Lines Matching defs:hash
512 uint64_t hash = ((uint32_t) ino * 2654435761U) % f->id_table.size;
513 uint64_t oldhash = hash % (f->id_table.size / 2);
518 return hash;
523 size_t hash = id_hash(f, nodeid);
526 for (node = f->id_table.array[hash]; node != NULL; node = node->id_next)
650 size_t hash;
655 hash = t->split;
657 for (nodep = &t->array[hash]; *nodep != NULL; nodep = next) {
661 if (newhash != hash) {
676 size_t hash = id_hash(f, node->nodeid);
677 node->id_next = f->id_table.array[hash];
678 f->id_table.array[hash] = node;
688 uint64_t hash = parent;
692 hash = hash * 31 + (unsigned char) *name;
694 hash %= f->name_table.size;
695 oldhash = hash % (f->name_table.size / 2);
699 return hash;
733 size_t hash = name_hash(f, node->parent->nodeid, node->name);
734 struct node **nodep = &f->name_table.array[hash];
763 size_t hash;
768 hash = t->split;
770 for (nodep = &t->array[hash]; *nodep != NULL; nodep = next) {
774 if (newhash != hash) {
790 size_t hash = name_hash(f, parentid, name);
803 node->name_next = f->name_table.array[hash];
804 f->name_table.array[hash] = node;
849 size_t hash = name_hash(f, parent, name);
852 for (node = f->name_table.array[hash]; node != NULL; node = node->name_next)