1#ifndef PACK_OBJECTS_H 2#define PACK_OBJECTS_H 3 4struct object_entry { 5struct pack_idx_entry idx; 6unsigned long size;/* uncompressed size */ 7struct packed_git *in_pack;/* already in pack */ 8 off_t in_pack_offset; 9struct object_entry *delta;/* delta base object */ 10struct object_entry *delta_child;/* deltified objects who bases me */ 11struct object_entry *delta_sibling;/* other deltified objects who 12 * uses the same base as me 13 */ 14void*delta_data;/* cached delta (uncompressed) */ 15unsigned long delta_size;/* delta data size (uncompressed) */ 16unsigned long z_delta_size;/* delta data size (compressed) */ 17enum object_type type; 18enum object_type in_pack_type;/* could be delta */ 19uint32_t hash;/* name hint hash */ 20unsigned char in_pack_header_size; 21unsigned preferred_base:1;/* 22 * we do not pack this, but is available 23 * to be used as the base object to delta 24 * objects against. 25 */ 26unsigned no_try_delta:1; 27unsigned tagged:1;/* near the very tip of refs */ 28unsigned filled:1;/* assigned write-order */ 29}; 30 31struct packing_data { 32struct object_entry *objects; 33uint32_t nr_objects, nr_alloc; 34 35int32_t*index; 36uint32_t index_size; 37}; 38 39struct object_entry *packlist_alloc(struct packing_data *pdata, 40const unsigned char*sha1, 41uint32_t index_pos); 42 43struct object_entry *packlist_find(struct packing_data *pdata, 44const unsigned char*sha1, 45uint32_t*index_pos); 46 47staticinlineuint32_tpack_name_hash(const char*name) 48{ 49uint32_t c, hash =0; 50 51if(!name) 52return0; 53 54/* 55 * This effectively just creates a sortable number from the 56 * last sixteen non-whitespace characters. Last characters 57 * count "most", so things that end in ".c" sort together. 58 */ 59while((c = *name++) !=0) { 60if(isspace(c)) 61continue; 62 hash = (hash >>2) + (c <<24); 63} 64return hash; 65} 66 67#endif