summaryrefslogtreecommitdiff
path: root/.github
diff options
context:
space:
mode:
authorLibravatar brian m. carlson <sandals@crustytoothpaste.net>2017-11-12 21:28:52 +0000
committerLibravatar Junio C Hamano <gitster@pobox.com>2017-11-13 13:20:44 +0900
commitf50e766b7b3dd02fc44ff7d4339c6f62e70fbf60 (patch)
tree5880f402a2f3b589dfe56cd336d8433629708491 /.github
parentsetup: expose enumerated repo info (diff)
downloadtgif-f50e766b7b3dd02fc44ff7d4339c6f62e70fbf60.tar.xz
Add structure representing hash algorithm
Since in the future we want to support an additional hash algorithm, add a structure that represents a hash algorithm and all the data that must go along with it. Add a constant to allow easy enumeration of hash algorithms. Implement function typedefs to create an abstract API that can be used by any hash algorithm, and wrappers for the existing SHA1 functions that conform to this API. Expose a value for hex size as well as binary size. While one will always be twice the other, the two values are both used extremely commonly throughout the codebase and providing both leads to improved readability. Don't include an entry in the hash algorithm structure for the null object ID. As this value is all zeros, any suitably sized all-zero object ID can be used, and there's no need to store a given one on a per-hash basis. The current hash function transition plan envisions a time when we will accept input from the user that might be in SHA-1 or in the NewHash format. Since we cannot know which the user has provided, add a constant representing the unknown algorithm to allow us to indicate that we must look the correct value up. Provide dummy API functions that die in this case. Finally, include git-compat-util.h in hash.h so that the required types are available. This aids people using automated tools their editors. Signed-off-by: brian m. carlson <sandals@crustytoothpaste.net> Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to '.github')
0 files changed, 0 insertions, 0 deletions