forked from lix-project/lix
9530cc3170
* Start cleaning up unique store path generation (they weren't always
unique; in particular the suffix ("-aterm-2.2", "-builder.sh") was
not part of the hash, therefore changes to the suffix would cause
multiple store objects with the same hash).
62 lines
1.3 KiB
C++
62 lines
1.3 KiB
C++
#ifndef __HASH_H
|
|
#define __HASH_H
|
|
|
|
#include <string>
|
|
|
|
#include "util.hh"
|
|
|
|
using namespace std;
|
|
|
|
|
|
typedef enum { htMD5, htSHA1, htSHA256 } HashType;
|
|
|
|
|
|
const int md5HashSize = 16;
|
|
const int sha1HashSize = 20;
|
|
const int sha256HashSize = 32;
|
|
|
|
|
|
struct Hash
|
|
{
|
|
static const unsigned int maxHashSize = 32;
|
|
unsigned int hashSize;
|
|
unsigned char hash[maxHashSize];
|
|
|
|
HashType type;
|
|
|
|
/* Create a zeroed hash object. */
|
|
Hash(HashType type);
|
|
|
|
/* Check whether two hash are equal. */
|
|
bool operator == (const Hash & h2) const;
|
|
|
|
/* Check whether two hash are not equal. */
|
|
bool operator != (const Hash & h2) const;
|
|
|
|
/* For sorting. */
|
|
bool operator < (const Hash & h) const;
|
|
|
|
/* Convert a hash code into a hexadecimal representation. */
|
|
operator string() const;
|
|
};
|
|
|
|
|
|
/* Parse a hexadecimal representation of a hash code. */
|
|
Hash parseHash(const string & s);
|
|
|
|
/* Verify that the given string is a valid hash code. */
|
|
bool isHash(const string & s);
|
|
|
|
/* Compute the hash of the given string. */
|
|
Hash hashString(const string & s, HashType ht);
|
|
|
|
/* Compute the hash of the given file. */
|
|
Hash hashFile(const Path & path, HashType ht);
|
|
|
|
/* Compute the hash of the given path. The hash is defined as
|
|
md5(dump(path)). */
|
|
Hash hashPath(const Path & path, HashType ht);
|
|
|
|
|
|
#endif /* !__HASH_H */
|