/dports/security/pkcs11-tools/pkcs11-tools-2.5.0/.gnulib/lib/ |
H A D | gl_anytreehash_list1.h | 112 for (entryp = &list->table[bucket]; *entryp != NULL; entryp = &(*entryp)->hash_next) in add_to_bucket() 157 multi_entry->h.hash_next = entry->hash_next; in add_to_bucket() 173 new_node->h.hash_next = list->table[bucket]; in add_to_bucket() 199 for (entryp = &list->table[bucket]; ; entryp = &(*entryp)->hash_next) in remove_from_bucket() 206 *entryp = old_node->h.hash_next; in remove_from_bucket() 230 node->h.hash_next = entry->hash_next; in remove_from_bucket() 245 for (entryp = &list->table[bucket]; ; entryp = &(*entryp)->hash_next) in remove_from_bucket() 249 *entryp = old_node->h.hash_next; in remove_from_bucket()
|
H A D | gl_hash_set.c | 109 node = (gl_list_node_t) node->h.hash_next) in gl_hash_search() 134 node = (gl_list_node_t) node->h.hash_next) in gl_hash_nx_add() 153 node->h.hash_next = set->table[bucket]; in gl_hash_nx_add() 179 nodep = (gl_list_node_t *) &(*nodep)->h.hash_next) in gl_hash_remove() 188 *nodep = (gl_list_node_t) node->h.hash_next; in gl_hash_remove() 218 gl_hash_entry_t next = node->hash_next; in gl_hash_free() 265 iterator->p = (gl_list_node_t) node->h.hash_next; in gl_hash_iterator_next() 283 iterator->p = (gl_list_node_t) node->h.hash_next; in gl_hash_iterator_next()
|
H A D | gl_hash_map.c | 112 node = (gl_list_node_t) node->h.hash_next) 141 node = (gl_list_node_t) node->h.hash_next) 165 node->h.hash_next = map->table[bucket]; 191 nodep = (gl_list_node_t *) &(*nodep)->h.hash_next) 202 *nodep = (gl_list_node_t) node->h.hash_next; 233 gl_hash_entry_t next = node->hash_next; 284 iterator->p = (gl_list_node_t) node->h.hash_next; 303 iterator->p = (gl_list_node_t) node->h.hash_next;
|
/dports/devel/bison/bison-3.7.6/lib/ |
H A D | gl_anytreehash_list1.h | 112 for (entryp = &list->table[bucket]; *entryp != NULL; entryp = &(*entryp)->hash_next) in add_to_bucket() 157 multi_entry->h.hash_next = entry->hash_next; in add_to_bucket() 173 new_node->h.hash_next = list->table[bucket]; in add_to_bucket() 199 for (entryp = &list->table[bucket]; ; entryp = &(*entryp)->hash_next) in remove_from_bucket() 206 *entryp = old_node->h.hash_next; in remove_from_bucket() 230 node->h.hash_next = entry->hash_next; in remove_from_bucket() 245 for (entryp = &list->table[bucket]; ; entryp = &(*entryp)->hash_next) in remove_from_bucket() 249 *entryp = old_node->h.hash_next; in remove_from_bucket()
|
/dports/japanese/kinput2/kinput2-v3.1/lib/imlib/ |
H A D | imic.c | 49 imp = imp->hash_next; 66 icp = icp->hash_next; 108 imp->hash_next = imHash[IMHASHVAL(imp)]; 119 icp->hash_next = icHash[ICHASHVAL(icp)]; 136 p = p->hash_next; 141 q->hash_next = p->hash_next; 143 imHash[IMHASHVAL(imp)] = p->hash_next; 161 p = p->hash_next; 166 q->hash_next = p->hash_next; 168 icHash[ICHASHVAL(icp)] = p->hash_next;
|
/dports/devel/gnulib/gnulib-20140202-stable/lib/ |
H A D | gl_anytreehash_list1.h | 122 for (entryp = &list->table[bucket]; *entryp != NULL; entryp = &(*entryp)->hash_next) in add_to_bucket() 167 multi_entry->h.hash_next = entry->hash_next; in add_to_bucket() 183 new_node->h.hash_next = list->table[bucket]; in add_to_bucket() 211 for (entryp = &list->table[bucket]; ; entryp = &(*entryp)->hash_next) in remove_from_bucket() 218 *entryp = old_node->h.hash_next; in remove_from_bucket() 242 node->h.hash_next = entry->hash_next; in remove_from_bucket() 257 for (entryp = &list->table[bucket]; ; entryp = &(*entryp)->hash_next) in remove_from_bucket() 261 *entryp = old_node->h.hash_next; in remove_from_bucket()
|
/dports/sysutils/moosefs3-netdump/moosefs-3.0.116/mfsclient/ |
H A D | dentry_invalidator.c | 49 struct _dinval_element *hash_next,**hash_prev; member 90 if (dielem->hash_next!=NULL) { in dinval_element_detach() 91 dielem->hash_next->hash_prev = dielem->hash_prev; in dinval_element_detach() 93 *(dielem->hash_prev) = dielem->hash_next; in dinval_element_detach() 120 dielem->hash_next = hashtab[hash]; in dinval_element_attach() 121 if (dielem->hash_next!=NULL) { in dinval_element_attach() 122 dielem->hash_next->hash_prev = &(dielem->hash_next); in dinval_element_attach() 135 for (dielem = hashtab[hash] ; dielem!=NULL ; dielem=dielem->hash_next) { in dinval_element_find()
|
/dports/sysutils/moosefs3-cli/moosefs-3.0.116/mfsclient/ |
H A D | dentry_invalidator.c | 49 struct _dinval_element *hash_next,**hash_prev; member 90 if (dielem->hash_next!=NULL) { in dinval_element_detach() 91 dielem->hash_next->hash_prev = dielem->hash_prev; in dinval_element_detach() 93 *(dielem->hash_prev) = dielem->hash_next; in dinval_element_detach() 120 dielem->hash_next = hashtab[hash]; in dinval_element_attach() 121 if (dielem->hash_next!=NULL) { in dinval_element_attach() 122 dielem->hash_next->hash_prev = &(dielem->hash_next); in dinval_element_attach() 135 for (dielem = hashtab[hash] ; dielem!=NULL ; dielem=dielem->hash_next) { in dinval_element_find()
|
/dports/sysutils/moosefs3-cgi/moosefs-3.0.116/mfsclient/ |
H A D | dentry_invalidator.c | 49 struct _dinval_element *hash_next,**hash_prev; member 90 if (dielem->hash_next!=NULL) { in dinval_element_detach() 91 dielem->hash_next->hash_prev = dielem->hash_prev; in dinval_element_detach() 93 *(dielem->hash_prev) = dielem->hash_next; in dinval_element_detach() 120 dielem->hash_next = hashtab[hash]; in dinval_element_attach() 121 if (dielem->hash_next!=NULL) { in dinval_element_attach() 122 dielem->hash_next->hash_prev = &(dielem->hash_next); in dinval_element_attach() 135 for (dielem = hashtab[hash] ; dielem!=NULL ; dielem=dielem->hash_next) { in dinval_element_find()
|
/dports/sysutils/moosefs3-chunkserver/moosefs-3.0.116/mfsclient/ |
H A D | dentry_invalidator.c | 49 struct _dinval_element *hash_next,**hash_prev; member 90 if (dielem->hash_next!=NULL) { in dinval_element_detach() 91 dielem->hash_next->hash_prev = dielem->hash_prev; in dinval_element_detach() 93 *(dielem->hash_prev) = dielem->hash_next; in dinval_element_detach() 120 dielem->hash_next = hashtab[hash]; in dinval_element_attach() 121 if (dielem->hash_next!=NULL) { in dinval_element_attach() 122 dielem->hash_next->hash_prev = &(dielem->hash_next); in dinval_element_attach() 135 for (dielem = hashtab[hash] ; dielem!=NULL ; dielem=dielem->hash_next) { in dinval_element_find()
|
/dports/sysutils/moosefs3-cgiserv/moosefs-3.0.116/mfsclient/ |
H A D | dentry_invalidator.c | 49 struct _dinval_element *hash_next,**hash_prev; member 90 if (dielem->hash_next!=NULL) { in dinval_element_detach() 91 dielem->hash_next->hash_prev = dielem->hash_prev; in dinval_element_detach() 93 *(dielem->hash_prev) = dielem->hash_next; in dinval_element_detach() 120 dielem->hash_next = hashtab[hash]; in dinval_element_attach() 121 if (dielem->hash_next!=NULL) { in dinval_element_attach() 122 dielem->hash_next->hash_prev = &(dielem->hash_next); in dinval_element_attach() 135 for (dielem = hashtab[hash] ; dielem!=NULL ; dielem=dielem->hash_next) { in dinval_element_find()
|
/dports/sysutils/moosefs3-client/moosefs-3.0.116/mfsclient/ |
H A D | dentry_invalidator.c | 49 struct _dinval_element *hash_next,**hash_prev; member 90 if (dielem->hash_next!=NULL) { in dinval_element_detach() 91 dielem->hash_next->hash_prev = dielem->hash_prev; in dinval_element_detach() 93 *(dielem->hash_prev) = dielem->hash_next; in dinval_element_detach() 120 dielem->hash_next = hashtab[hash]; in dinval_element_attach() 121 if (dielem->hash_next!=NULL) { in dinval_element_attach() 122 dielem->hash_next->hash_prev = &(dielem->hash_next); in dinval_element_attach() 135 for (dielem = hashtab[hash] ; dielem!=NULL ; dielem=dielem->hash_next) { in dinval_element_find()
|
/dports/sysutils/moosefs3-metalogger/moosefs-3.0.116/mfsclient/ |
H A D | dentry_invalidator.c | 49 struct _dinval_element *hash_next,**hash_prev; member 90 if (dielem->hash_next!=NULL) { in dinval_element_detach() 91 dielem->hash_next->hash_prev = dielem->hash_prev; in dinval_element_detach() 93 *(dielem->hash_prev) = dielem->hash_next; in dinval_element_detach() 120 dielem->hash_next = hashtab[hash]; in dinval_element_attach() 121 if (dielem->hash_next!=NULL) { in dinval_element_attach() 122 dielem->hash_next->hash_prev = &(dielem->hash_next); in dinval_element_attach() 135 for (dielem = hashtab[hash] ; dielem!=NULL ; dielem=dielem->hash_next) { in dinval_element_find()
|
/dports/sysutils/moosefs3-master/moosefs-3.0.116/mfsclient/ |
H A D | dentry_invalidator.c | 49 struct _dinval_element *hash_next,**hash_prev; member 90 if (dielem->hash_next!=NULL) { in dinval_element_detach() 91 dielem->hash_next->hash_prev = dielem->hash_prev; in dinval_element_detach() 93 *(dielem->hash_prev) = dielem->hash_next; in dinval_element_detach() 120 dielem->hash_next = hashtab[hash]; in dinval_element_attach() 121 if (dielem->hash_next!=NULL) { in dinval_element_attach() 122 dielem->hash_next->hash_prev = &(dielem->hash_next); in dinval_element_attach() 135 for (dielem = hashtab[hash] ; dielem!=NULL ; dielem=dielem->hash_next) { in dinval_element_find()
|
/dports/net/parpd/parpd-1.3/ |
H A D | cache6.c | 11 TAILQ_ENTRY(cache6_entry) hash_next; 38 TAILQ_FOREACH(p, cache6_head(ip), hash_next) { in cache6_search_ip() 79 TAILQ_FOREACH(p, &cache6.hash.table[i], hash_next) { in print_nd_table() 140 TAILQ_REMOVE(cache6_head((*pp)->entry.ip), *pp, hash_next); in remove_cache6_entry() 153 TAILQ_INSERT_TAIL(cache6_head(entry->ip), n, hash_next); in update_nd_entry() 321 memset(&p->hash_next, 0, sizeof(p->hash_next)); /* remove all hash entries */ in update_cache6_config() 324 memset(&p->hash_next, 0, sizeof(p->hash_next)); /* remove all hash entries */ in update_cache6_config() 338 TAILQ_INSERT_BEFORE(n, p, hash_next); in update_cache6_config() 340 TAILQ_INSERT_TAIL(cache6_head(p->entry.ip), p, hash_next); in update_cache6_config() 346 TAILQ_INSERT_BEFORE(n, p, hash_next); in update_cache6_config() [all …]
|
H A D | cache.c | 11 TAILQ_ENTRY(cache_entry) hash_next; 38 TAILQ_FOREACH(p, cache_head(ip), hash_next) { in cache_search_ip() 79 TAILQ_FOREACH(p, &cache.hash.table[i], hash_next) { in print_arp_table() 140 TAILQ_REMOVE(cache_head((*pp)->entry.ip), *pp, hash_next); in remove_cache_entry() 153 TAILQ_INSERT_TAIL(cache_head(entry->ip), n, hash_next); in update_arp_entry() 335 memset(&p->hash_next, 0, sizeof(p->hash_next)); /* remove all hash entries */ in update_cache_config() 338 memset(&p->hash_next, 0, sizeof(p->hash_next)); /* remove all hash entries */ in update_cache_config() 352 TAILQ_INSERT_BEFORE(n, p, hash_next); in update_cache_config() 354 TAILQ_INSERT_TAIL(cache_head(p->entry.ip), p, hash_next); in update_cache_config() 360 TAILQ_INSERT_BEFORE(n, p, hash_next); in update_cache_config() [all …]
|
/dports/lang/racket-minimal/racket-8.3/src/rktio/ |
H A D | rktio_dll.c | 41 rktio_dll_t *hash_next; /* chain for hash collisions */ member 71 dll = dll->hash_next; in rktio_dll_open() 130 dll->hash_next = dlls; in rktio_dll_open() 181 rktio_hash_set(rktio->dlls_by_name, key, dll->hash_next); in rktio_dll_close() 183 while (dlls->hash_next) { in rktio_dll_close() 184 if (dlls->hash_next == dll) { in rktio_dll_close() 185 dlls->hash_next = dll->hash_next; in rktio_dll_close() 188 dlls = dlls->hash_next; in rktio_dll_close() 286 rktio_dll_object_t *hash_next; /* chain for hash collisions */ member 298 for (obj = objs; obj; obj = obj->hash_next) in rktio_dll_find_object() [all …]
|
/dports/lang/racket/racket-8.3/src/rktio/ |
H A D | rktio_dll.c | 41 rktio_dll_t *hash_next; /* chain for hash collisions */ member 71 dll = dll->hash_next; in rktio_dll_open() 130 dll->hash_next = dlls; in rktio_dll_open() 181 rktio_hash_set(rktio->dlls_by_name, key, dll->hash_next); in rktio_dll_close() 183 while (dlls->hash_next) { in rktio_dll_close() 184 if (dlls->hash_next == dll) { in rktio_dll_close() 185 dlls->hash_next = dll->hash_next; in rktio_dll_close() 188 dlls = dlls->hash_next; in rktio_dll_close() 286 rktio_dll_object_t *hash_next; /* chain for hash collisions */ member 298 for (obj = objs; obj; obj = obj->hash_next) in rktio_dll_find_object() [all …]
|
/dports/net-mgmt/ipcad/ipcad-3.7.3/ |
H A D | genhash.c | 179 if((el->hash_prev->hash_next = el->hash_next)) in _remove_normal_hash_el() 180 el->hash_next->hash_prev = el->hash_prev; in _remove_normal_hash_el() 184 el->hash_next->hash_prev = NULL; in _remove_normal_hash_el() 234 if((el->hash_prev->hash_next = el->hash_next)) in _genhash_normal_el_move2top() 235 el->hash_next->hash_prev = el->hash_prev; in _genhash_normal_el_move2top() 238 if((el->hash_next = h->buckets[bucket])) in _genhash_normal_el_move2top() 239 el->hash_next->hash_prev = el; in _genhash_normal_el_move2top() 315 if((el->hash_next = newbuckets[bucket])) in _expand_hash() 316 el->hash_next->hash_prev = el; in _expand_hash() 421 if((el->hash_next = *bucket)) in _genhash_normal_add() [all …]
|
/dports/graphics/cairo/cairo-1.17.4/util/cairo-trace/ |
H A D | lookup-symbol.c | 251 struct symbol_cache_entry *hash_prev, *hash_next; member 274 cache = cache->hash_next) in lookup_symbol() 278 cache->hash_prev->hash_next = cache->hash_next; in lookup_symbol() 279 if (cache->hash_next != NULL) in lookup_symbol() 280 cache->hash_next->hash_prev = cache->hash_prev; in lookup_symbol() 282 cache->hash_next = symbol_cache_hash[bucket]; in lookup_symbol() 323 cache->hash_next = symbol_cache_hash[bucket]; in lookup_symbol()
|
/dports/games/ufoai/ufoai-2.5-source/src/common/ |
H A D | cmd.cpp | 48 struct cmd_alias_s* hash_next; member 424 for (a = cmd_alias_hash[hash]; a; a = a->hash_next) { in Cmd_Alias_f() 435 a->hash_next = cmd_alias_hash[hash]; in Cmd_Alias_f() 489 struct cmd_function_s* hash_next; member 644 for (cmd = cmd_functions_hash[hash]; cmd; cmd = cmd->hash_next) { in Cmd_GetCommandDesc() 694 for (cmd = cmd_functions_hash[hash]; cmd; cmd = cmd->hash_next) { in Cmd_AddParamCompleteFunction() 722 for (cmd = cmd_functions_hash[hash]; cmd; cmd = cmd->hash_next) { in Cmd_GetUserdata() 749 for (cmd = cmd_functions_hash[hash]; cmd; cmd = cmd->hash_next) { in Cmd_AddUserdata() 814 *back = cmd->hash_next; in Cmd_RemoveCommand() 817 back = &cmd->hash_next; in Cmd_RemoveCommand() [all …]
|
/dports/devel/ncnf/ncnf-3.0.1/src/ |
H A D | genhash.c | 73 struct genhash_el_s *hash_next; member 184 if((el->hash_prev->hash_next = el->hash_next)) in _remove_normal_hash_el() 185 el->hash_next->hash_prev = el->hash_prev; in _remove_normal_hash_el() 189 el->hash_next->hash_prev = NULL; in _remove_normal_hash_el() 229 if((el->hash_prev->hash_next = el->hash_next)) in _genhash_normal_el_move2top() 233 if((el->hash_next = h->buckets[bucket])) in _genhash_normal_el_move2top() 234 el->hash_next->hash_prev = el; in _genhash_normal_el_move2top() 311 if((el->hash_next = newbuckets[bucket])) in _expand_hash() 398 if((el->hash_next = *bucket)) in _genhash_normal_add() 495 walk; walk = walk->hash_next) { in genhash_get() [all …]
|
/dports/databases/xtrabackup8/percona-xtrabackup-8.0.14/storage/ndb/plugin/ |
H A D | ndb_conflict_trans.cc | 52 hash_next(NULL) {} in st_row_event_key_info() 77 return hash_next; in getNext() 81 hash_next = _next; in setNext() 92 hash_next(NULL) {} in st_trans_dependency() 124 st_trans_dependency *st_trans_dependency::getNext() const { return hash_next; } in getNext() 127 hash_next = _next; in setNext() 136 hash_next(NULL) {} in st_transaction() 162 st_transaction *st_transaction::getNext() const { return hash_next; } in getNext() 164 void st_transaction::setNext(st_transaction *_next) { hash_next = _next; } in setNext()
|
/dports/games/ufoai/ufoai-2.5-source/src/tests/ |
H A D | test_shared.cpp | 105 struct test_property_s* hash_next; member 124 for (element = test_property_hash[hash]; element; element = element->hash_next) { in TEST_RegisterProperty() 136 element->hash_next = test_property_hash[hash]; in TEST_RegisterProperty() 154 for (element = test_property_hash[hash]; element; element = element->hash_next) { in TEST_GetProperty()
|
/dports/science/py-pymol/pymol-open-source-2.4.0/layer0/ |
H A D | Tracker.cpp | 53 int hash_next, hash_prev; member 351 int next = member->hash_next; in TrackerDelCand() 358 if(member->hash_next) { in TrackerDelCand() 641 if(member->hash_next) { in TrackerDelList() 732 member_index = member->hash_next; in TrackerLink() 783 member->hash_next = I_member[hash_start.word].hash_next; in TrackerLink() 785 if(member->hash_next) { in TrackerLink() 834 member_index = member->hash_next; in TrackerUnlink() 856 int next = member->hash_next; in TrackerUnlink() 859 I_member[prev].hash_next = next; in TrackerUnlink() [all …]
|