/bind-9.11.3/lib/dns/rdata/generic/ |
H A D | nsec_47.h | 20 dns_name_t next; member in struct:dns_rdata_nsec
|
H A D | nxt_30.h | 20 dns_name_t next; member in struct:dns_rdata_nxt
|
H A D | talink_58.h | 18 dns_name_t next; member in struct:dns_rdata_talink
|
H A D | talink_58.c | 48 dns_name_t next; local 56 dns_name_init(&next, NULL); 64 dns_name_fromregion(&next, &dregion); 65 isc_region_consume(&dregion, name_length(&next)); 72 sub = name_prefix(&next, tctx->origin, &prefix); 79 dns_name_t next; local 89 dns_name_init(&next, NULL); 92 return(dns_name_fromwire(&next, source, dctx, options, target)); 99 dns_name_t next; local 109 dns_name_init(&next, roffset [all...] |
H A D | nsec3_50.h | 30 unsigned char *next; member in struct:dns_rdata_nsec3
|
/bind-9.11.3/bin/tests/system/checkds/ |
H A D | dig.bat | 8 if "%arg:~0,1%" == "+" goto next 9 if "%arg%" == "-t" goto next 17 goto next 21 goto next 25 goto next 29 goto next 31 :next label
|
/bind-9.11.3/lib/lwres/include/lwres/ |
H A D | list.h | 20 #define LWRES_LINK(type) struct { type *prev, *next; } 24 (elt)->link.next = (void *)(-1); \ 40 (elt)->link.next = (list).head; \ 47 (list).tail->link.next = (elt); \ 51 (elt)->link.next = NULL; \ 57 if ((elt)->link.next != NULL) \ 58 (elt)->link.next->link.prev = (elt)->link.prev; \ 62 (elt)->link.prev->link.next = (elt)->link.next; \ 64 (list).head = (elt)->link.next; \ [all...] |
/bind-9.11.3/contrib/dlz/modules/include/ |
H A D | dlz_list.h | 16 #define DLZ_LINK(type) struct { type *prev, *next; } 20 (elt)->link.next = (void *)(-1); \ 29 (list).tail->link.next = (elt); \ 33 (elt)->link.next = NULL; \ 38 #define DLZ_LIST_NEXT(elt, link) ((elt)->link.next)
|
/bind-9.11.3/contrib/idn/idnkit-1.0-src/wsock/common/ |
H A D | hook.c | 65 HOOKPTR next; member in struct:_HOOK 76 if (hookList.prev == NULL || hookList.next == NULL) { 78 hookList.next = &hookList; 86 for (hp = hookList.next ; hp != &hookList ; hp = hp->next) { 96 HOOKPTR hp, prev, next; local 110 next = prev->next; 111 prev->next = hp; 112 next 122 HOOKPTR prev, next; local [all...] |
/bind-9.11.3/contrib/idn/idnkit-1.0-src/lib/tests/ |
H A D | setenv.c | 62 myenv_t *next; member in struct:myenv 83 for (mye = myenvs; mye != NULL; mye = mye->next) { 85 if (mye->next != NULL) 86 mye->next->prev = mye->prev; 88 mye->prev->next = mye->next; 89 if (mye->next == NULL && mye->prev == NULL) 125 mye->next = myenvs;
|
/bind-9.11.3/lib/isc/include/isc/ |
H A D | queue.h | 32 #define ISC_QLINK(type) struct { type *prev, *next; } 36 (elt)->link.next = (elt)->link.prev = (void *)(-1); \ 39 #define ISC_QLINK_LINKED(elt, link) ((void*)(elt)->link.next != (void*)(-1)) 84 * push wins - updates {head,tail}->link.next, pop updates head 85 * with new ->link.next and doesn't update tail 104 (elt)->link.next = NULL; \ 106 (queue).tail->link.next = (elt); \ 121 if (ret->link.next == NULL) { \ 123 if (ret->link.next == NULL) { \ 130 (queue).head = ret->link.next; \ [all...] |
H A D | list.h | 26 #define ISC_LINK(type) struct { type *prev, *next; } 30 (elt)->link.next = (type *)(-1); \ 47 (elt)->link.next = (list).head; \ 63 (list).tail->link.next = (elt); \ 67 (elt)->link.next = NULL; \ 82 if ((elt)->link.next != NULL) \ 83 (elt)->link.next->link.prev = (elt)->link.prev; \ 89 (elt)->link.prev->link.next = (elt)->link.next; \ 92 (list).head = (elt)->link.next; \ [all...] |
/bind-9.11.3/lib/dns/ |
H A D | badcache.c | 47 dns_bcentry_t * next; member in struct:dns_bcentry 117 dns_bcentry_t **newtable, *bad, *next; local 131 for (bad = bc->table[i]; bad != NULL; bad = next) { 132 next = bad->next; 138 bad->next = newtable[bad->hashval % newsize]; 159 dns_bcentry_t *bad, *prev, *next; local 175 for (bad = bc->table[i]; bad != NULL; bad = next) { 176 next = bad->next; 227 dns_bcentry_t *bad, *prev, *next; local 297 dns_bcentry_t *entry, *next; local 315 dns_bcentry_t *bad, *prev, *next; local 352 dns_bcentry_t *bad, *prev, *next; local 394 dns_bcentry_t *bad, *next, *prev; local [all...] |
H A D | rdatasetiter.c | 50 * Move the rdataset cursor to the next rdataset at the node (if any). 55 return (iterator->methods->next(iterator));
|
H A D | keytable.c | 49 struct dns_keynode * next; member in struct:dns_keynode 187 for (k = node->data; k != NULL; k = k->next) { 205 knode->next = node->data; 291 if (knode->next == NULL && knode->key != NULL && 303 kprev = &knode->next; 304 knode = knode->next; 312 * dns_keynode_attach(knode->next, &tmp); 317 *kprev = knode->next; 318 knode->next = NULL; 359 * Return the next ke 756 dns_keynode_t *next = NULL, *node = *keynode; local [all...] |
/bind-9.11.3/contrib/idn/idnkit-1.0-src/lib/ |
H A D | aliaslist.c | 63 struct aliasitem *next; member in struct:aliasitem 107 aliasitem_t next; local 121 next = current->next; 123 current = next; 199 new_item->next = list->first_item; 232 if (cur_item->next == NULL) { 235 cur_item = cur_item->next; 237 cur_item->next = new_item; 266 current = current->next; [all...] |
H A D | strhash.c | 71 struct strhash_entry *next; member in struct:strhash_entry 126 strhash_entry_t *next; local 129 next = bin->next; 133 bin = next; 159 entry->next = hash->bins[h_index]; 221 entry = entry->next; 237 entry->next = NULL; 267 entries = entries->next; 271 e->next [all...] |
H A D | ucsmap.c | 94 struct ucsmap_buf *next; member in struct:ucsmap_buf 345 buf->next = ctx->mapdata; 359 ucsmap_buf_t *next = buf->next; local 361 buf = next;
|
/bind-9.11.3/lib/isc/ |
H A D | ht.c | 29 isc_ht_node_t *next; member in struct:isc_ht_node 101 isc_ht_node_t *next = node->next; local 106 node = next; 135 node = node->next; 144 node->next = ht->table[hash & ht->mask]; 171 node = node->next; 192 ht->table[hash & ht->mask] = node->next; 194 prev->next = node->next; [all...] |
/bind-9.11.3/unit/atf-src/atf-c/detail/ |
H A D | list.c | 96 struct list_entry *next) 103 le->m_next = next; 106 next->m_prev = le; 353 struct list_entry *le, *next, *prev; local 356 next = (struct list_entry *)l->m_end; 357 prev = next->m_prev; 358 le = new_entry_and_link(data, managed, prev, next); 95 new_entry_and_link(void *object, bool managed, struct list_entry *prev, struct list_entry *next) argument
|
/bind-9.11.3/unit/atf-src/tools/ |
H A D | parser.hpp | 163 token next(void); 218 tokenizer< IS >::next(void) function in class:tools::parser::tokenizer 333 token next(void); 420 parser< TKZ >::next(void) function in class:tools::parser::parser 422 token t = m_tkz.next(); 450 t = next(); 460 token t = next(); 476 token t = next(); 493 token t = next(); 511 token t = next(); [all...] |
/bind-9.11.3/lib/dns/include/dns/ |
H A D | rdatasetiter.h | 70 isc_result_t (*next)(dns_rdatasetiter_t *iterator); member in struct:dns_rdatasetitermethods 131 * Move the rdataset cursor to the next rdataset at the node (if any).
|
/bind-9.11.3/contrib/idn/idnkit-1.0-src/wsock/wsock20/ |
H A D | dllfunc.c | 86 struct obj_lock *next; member in struct:obj_lock 388 olp = olp->next; 405 olp->next = obj_lock_hash[h]; 424 obj_lock_hash[h] = olp->next; 426 olp0->next = olp->next; 431 olp = olp->next; 482 struct my_addrinfo *next = aip->ai_next; local 487 aip = next;
|
/bind-9.11.3/lib/isc/win32/ |
H A D | condition.c | 165 isc_condition_thread_t *next, *threadcond; local 178 next = ISC_LIST_NEXT(threadcond, link); 182 threadcond = next;
|
/bind-9.11.3/bin/named/ |
H A D | listenlist.c | 66 ns_listenelt_t *elt, *next; local 69 elt = next) 71 next = ISC_LIST_NEXT(elt, link);
|