/dragonfly/contrib/lvm2/dist/libdm/mm/ |
H A D | dbg_malloc.c | 39 struct memblock *prev, *next; /* All allocated blocks are linked */ member 86 nb->next = 0; in dm_malloc_aux_debug() 106 _tail->next = nb; in dm_malloc_aux_debug() 148 mb->prev->next = mb->next; in dm_free_aux() 150 _head = mb->next; in dm_free_aux() 152 if (mb->next) in dm_free_aux() 153 mb->next->prev = mb->prev; in dm_free_aux() 197 for (mb = _head; mb; mb = mb->next) { in dm_dump_memory_debug() 232 mb = mb->next; in dm_bounds_check_debug()
|
/dragonfly/contrib/gdb-7/bfd/ |
H A D | merge.c | 55 struct sec_merge_hash_entry *next; member 78 struct sec_merge_info *next; member 88 struct sec_merge_sec_info *next; member 127 ret->next = NULL; in sec_merge_hash_newfunc() 279 tab->last->next = entry; in sec_merge_add() 422 secinfo->next = sinfo->chain->next; in _bfd_add_merge_section() 423 sinfo->chain->next = secinfo; in _bfd_add_merge_section() 426 secinfo->next = secinfo; in _bfd_add_merge_section() 691 a = &e->next; in merge_strings() 694 *a = e->next; in merge_strings() [all …]
|
/dragonfly/contrib/bmake/ |
H A D | hash.c | 125 for (e = t->buckets[h & t->bucketsMask]; e != NULL; e = e->next) { in HashTable_Find() 168 HashEntry *next = he->next; in HashTable_Done() local 170 he = next; in HashTable_Done() 228 HashEntry *next = he->next; in HashTable_Enlarge() local 229 he->next = newBuckets[he->key_hash & newMask]; in HashTable_Enlarge() 231 he = next; in HashTable_Enlarge() 270 he->next = t->buckets[h & t->bucketsMask]; in HashTable_CreateEntry() 293 for (; (p = *ref) != NULL; ref = &p->next) { in HashTable_DeleteEntry() 295 *ref = p->next; in HashTable_DeleteEntry() 317 he = he->next; /* skip the most recently returned entry */ in HashIter_Next()
|
/dragonfly/usr.sbin/bthcid/ |
H A D | client.c | 56 LIST_ENTRY(client) next; 68 LIST_ENTRY(item) next; 173 LIST_INSERT_HEAD(&client_list, cl, next); in process_control() 194 LIST_REMOVE(cl, next); in process_client() 203 LIST_FOREACH(item, &item_list, next) { in process_client() 217 LIST_REMOVE(item, next); in process_client() 244 LIST_REMOVE(item, next); in process_client() 265 LIST_FOREACH(cl, &client_list, next) { in send_client_request() 308 LIST_REMOVE(item, next); in process_item() 323 LIST_FOREACH(item, &item_list, next) { in lookup_pin() [all …]
|
/dragonfly/contrib/dhcpcd/src/ |
H A D | eloop.c | 182 TAILQ_ENTRY(eloop_event) next; 193 TAILQ_ENTRY(eloop_timeout) next; 285 TAILQ_REMOVE(&eloop->events, e, next); in eloop_event_setup_fds() 334 TAILQ_FOREACH(e, &eloop->events, next) { in eloop_event_add() 383 TAILQ_REMOVE(&eloop->events, e, next); in eloop_event_add() 398 TAILQ_REMOVE(&eloop->events, e, next); in eloop_event_add() 429 TAILQ_FOREACH(e, &eloop->events, next) { in eloop_event_delete() 577 TAILQ_INSERT_BEFORE(tt, t, next); in eloop_q_timeout_add() 705 TAILQ_FOREACH(e, &eloop->events, next) { in eloop_forked() 928 TAILQ_REMOVE(&eloop->events, e, next); in eloop_clear() [all …]
|
/dragonfly/usr.bin/crunch/crunchgen/ |
H A D | crunchgen.c | 57 struct strlst *next; member 64 struct prog *next; /* link field */ member 429 p2->next = NULL; in add_prog() 433 p1->next = p2; in add_prog() 825 p1 = p2, p2 = p2->next; in remove_error_progs() 831 p1->next = p2->next; in remove_error_progs() 833 progs = p2->next; in remove_error_progs() 834 p2 = p2->next; in remove_error_progs() 1306 p2->next = NULL; in add_string() 1315 p1->next = p2; in add_string() [all …]
|
/dragonfly/contrib/binutils-2.27/libiberty/ |
H A D | partition.c | 54 part->elements[e].next = &(part->elements[e]); in partition_new() 108 for (p = e2->next; p != e2; p = p->next) in partition_union() 113 old_next = e1->next; in partition_union() 114 e1->next = e2->next; in partition_union() 115 e2->next = old_next; in partition_union() 168 c = elements[c].next - elements; in partition_print()
|
/dragonfly/contrib/binutils-2.34/libiberty/ |
H A D | partition.c | 54 part->elements[e].next = &(part->elements[e]); in partition_new() 108 for (p = e2->next; p != e2; p = p->next) in partition_union() 113 old_next = e1->next; in partition_union() 114 e1->next = e2->next; in partition_union() 115 e2->next = old_next; in partition_union() 168 c = elements[c].next - elements; in partition_print()
|
/dragonfly/contrib/gcc-4.7/libiberty/ |
H A D | partition.c | 54 part->elements[e].next = &(part->elements[e]); in partition_new() 108 for (p = e2->next; p != e2; p = p->next) in partition_union() 113 old_next = e1->next; in partition_union() 114 e1->next = e2->next; in partition_union() 115 e2->next = old_next; in partition_union() 168 c = elements[c].next - elements; in partition_print()
|
/dragonfly/contrib/gcc-8.0/libiberty/ |
H A D | partition.c | 54 part->elements[e].next = &(part->elements[e]); in partition_new() 108 for (p = e2->next; p != e2; p = p->next) in partition_union() 113 old_next = e1->next; in partition_union() 114 e1->next = e2->next; in partition_union() 115 e2->next = old_next; in partition_union() 168 c = elements[c].next - elements; in partition_print()
|
/dragonfly/contrib/xz/src/liblzma/delta/ |
H A D | delta_encoder.c | 61 if (coder->next.code == NULL) { in delta_encode() 77 ret = coder->next.code(coder->next.coder, allocator, in delta_encode() 99 &coder->next, allocator, reversed_filters + 1); in delta_encoder_update() 104 lzma_delta_encoder_init(lzma_next_coder *next, const lzma_allocator *allocator, in lzma_delta_encoder_init() argument 107 next->code = &delta_encode; in lzma_delta_encoder_init() 108 next->update = &delta_encoder_update; in lzma_delta_encoder_init() 109 return lzma_delta_coder_init(next, allocator, filters); in lzma_delta_encoder_init()
|
/dragonfly/contrib/gcc-8.0/libgomp/ |
H A D | task.c | 113 p = p->next; in gomp_clear_parent_in_list() 266 out->prev->next = out->next; in gomp_task_handle_depend() 267 out->next = last->next; in gomp_task_handle_depend() 269 last->next = out; in gomp_task_handle_depend() 270 if (out->next) in gomp_task_handle_depend() 271 out->next->prev = out; in gomp_task_handle_depend() 811 node->prev->next = node->next; in priority_list_upgrade_task() 814 node->next = last_parent_depends_on->next; in priority_list_upgrade_task() 820 node->prev->next = node->next; in priority_list_upgrade_task() 889 node->prev->next = node->next; in priority_list_downgrade_task() [all …]
|
H A D | priority_queue.h | 40 struct priority_node *next, *prev; member 261 node->next = last_parent_depends_on->next; in priority_list_insert() 267 node->next = list->tasks; in priority_list_insert() 272 node->next->prev = node; in priority_list_insert() 273 node->prev->next = node; in priority_list_insert() 277 node->next = node; in priority_list_insert() 420 node->prev->next = node->next; in priority_list_remove() 421 node->next->prev = node->prev; in priority_list_remove() 424 if (node->next != node) in priority_list_remove() 425 list->tasks = node->next; in priority_list_remove()
|
/dragonfly/gnu/usr.bin/rcs/lib/ |
H A D | rcskeys.c | 126 char *copy, *next; local 130 next = copy; 131 switch (*next++) { 145 key = strtok(next, ","); 165 char *copy, *next, *key; local 168 next = copy; 169 key = strtok(next, "=");
|
/dragonfly/contrib/gcc-4.7/gcc/ |
H A D | cselib.c | 222 el->next = next; in new_elt_list() 235 gcc_checking_assert (!next || !next->setting_insn in new_elt_loc_list() 268 for (el = CSELIB_VAL_PTR (loc)->locs; el->next; el = el->next) in new_elt_loc_list() 315 el->next = next; in new_elt_loc_list() 335 && !l->next->next); in promote_debug_loc() 351 *pl = l->next; in unchain_one_elt_list() 362 *pl = l->next; in unchain_one_elt_loc_list() 619 p = &(*p)->next; in discard_useless_locs() 1560 l = l->next; in cselib_expand_value_rtx_1() 1833 l = l->next; in cselib_subst_to_values() [all …]
|
/dragonfly/contrib/diffutils/src/ |
H A D | util.c | 53 struct msg *next; member 130 new->next = 0; in message5() 152 struct msg *next = m->next; in print_message_queue() local 158 m = next; in print_message_queue() 697 e = e->next; in parse_diff_color() 1178 while (next) in print_script() 1183 this = next; in print_script() 1476 next = hunk; in analyze_hunk() 1479 l0 = next->line0 + next->deleted - 1; in analyze_hunk() 1480 l1 = next->line1 + next->inserted - 1; in analyze_hunk() [all …]
|
/dragonfly/sbin/ifconfig/ |
H A D | regdomain.c | 454 LIST_FOREACH(dp, &rdp->domains, next) { in lib80211_regdomain_readconfig() 460 LIST_FOREACH(fp, &rdp->freqbands, next) { in lib80211_regdomain_readconfig() 466 LIST_FOREACH(cp, &rdp->countries, next) { in lib80211_regdomain_readconfig() 474 LIST_FOREACH(dp, &rdp->domains, next) { in lib80211_regdomain_readconfig() 485 LIST_FOREACH(nb, &dp->bands_11b, next) { in lib80211_regdomain_readconfig() 572 LIST_REMOVE(nb, next); in cleanup_bands() 590 LIST_REMOVE(dp, next); in lib80211_regdomain_cleanup() 605 LIST_REMOVE(cp, next); in lib80211_regdomain_cleanup() 614 LIST_REMOVE(fp, next); in lib80211_regdomain_cleanup() 684 LIST_FOREACH(dp, &rdp->domains, next) { in lib80211_regdomain_findbysku() [all …]
|
/dragonfly/usr.sbin/ppp/ |
H A D | cbcp.c | 260 char list[sizeof cbcp->fsm.phone], *next; in cbcp_SendReq() local 282 for (next = strtok(list, ","); next; next = strtok(NULL, ",")) { in cbcp_SendReq() 283 len = strlen(next); in cbcp_SendReq() 287 strcpy(addr->addr, next); in cbcp_SendReq() 291 next); in cbcp_SendReq() 430 for (next = strtok(list, ","); next; next = strtok(NULL, ",")) in cbcp_AdjustResponse() 431 if (!strcmp(next, addr->addr)) { in cbcp_AdjustResponse() 433 strcpy(cbcp->fsm.phone, next); in cbcp_AdjustResponse() 456 for (next = strtok(list, ","); next; next = strtok(NULL, ",")) in cbcp_AdjustResponse() 555 for (next = strtok(list, ","); next; next = strtok(NULL, ",")) in cbcp_CheckResponse() [all …]
|
H A D | log.c | 92 prompt->next = promptlist; in log_RegisterPrompt() 111 for (p = promptlist; p; p = p->next) in LogSetMaskLocal() 132 *p = prompt->next; in log_UnRegisterPrompt() 133 prompt->next = NULL; in log_UnRegisterPrompt() 149 pn = p->next; in log_DestroyPrompts() 152 pl->next = p->next; in log_DestroyPrompts() 154 promptlist = p->next; in log_DestroyPrompts() 155 p->next = NULL; in log_DestroyPrompts() 168 for (p = promptlist; p; p = p->next) in log_DisplayPrompts() 179 for (p = promptlist; p; p = p->next) in log_WritePrompts() [all …]
|
/dragonfly/crypto/libressl/apps/openssl/ |
H A D | certhash.c | 68 struct hashinfo *next; member 141 while (hi->next != NULL) in hashinfo_chain() 142 hi = hi->next; in hashinfo_chain() 143 hi->next = entry; in hashinfo_chain() 151 struct hashinfo *next; in hashinfo_chain_free() local 154 next = hi->next; in hashinfo_chain_free() 156 hi = next; in hashinfo_chain_free() 167 hi = hi->next; in hashinfo_chain_length() 192 entry->next = list[i]; in hashinfo_chain_sort() 195 entry->next = NULL; in hashinfo_chain_sort() [all …]
|
/dragonfly/contrib/tcsh-6/ |
H A D | ed.xmap.c | 177 if (ptr->next) { in TraverseMap() 257 if (ptr->next != NULL) { in TryNode() 259 ptr->next = NULL; in TryNode() 294 if (ptr->next == NULL) in TryNode() 362 else if (ptr->next != NULL && TryDeleteNode(&ptr->next, str) == 1) { in TryDeleteNode() 363 if (ptr->next != NULL) in TryDeleteNode() 384 if (ptr->next != NULL) { in PutFreeNode() 385 PutFreeNode(ptr->next); in PutFreeNode() 386 ptr->next = NULL; in PutFreeNode() 420 ptr->next = NULL; in GetFreeNode() [all …]
|
/dragonfly/contrib/gmp/mpn/generic/ |
H A D | perfpow.c | 397 next = TMP_ALLOC_LIMBS (ncn + 2); in mpn_perfect_power_p() 408 mpn_sqr (next, prev, pn); in mpn_perfect_power_p() 410 xn -= (next[xn - 1] == 0); in mpn_perfect_power_p() 417 MP_PTR_SWAP (next, prev); in mpn_perfect_power_p() 434 mpn_mul (next, prev, pn, tp, xn); in mpn_perfect_power_p() 436 xn -= (next[xn - 1] == 0); in mpn_perfect_power_p() 440 cry = mpn_mul_1 (next, prev, pn, d); in mpn_perfect_power_p() 441 next[pn] = cry; in mpn_perfect_power_p() 453 MP_PTR_SWAP (next, prev); in mpn_perfect_power_p() 471 ncn += next[ncn] != 0; in mpn_perfect_power_p() [all …]
|
/dragonfly/usr.sbin/installer/libaura/ |
H A D | dict.c | 134 d->b[bucket_no] = b->next; in aura_dict_free() 176 b->next = NULL; in aura_bucket_new() 247 b->next = d->b[i]; in aura_dict_store_hash() 286 b->next = d->b[0]; in aura_dict_store_list() 331 new_b->next = NULL; in aura_dict_store_list_sorted() 338 prev->next = new_b; in aura_dict_store_list_sorted() 341 new_b->next = b; in aura_dict_store_list_sorted() 348 prev->next = new_b; in aura_dict_store_list_sorted() 349 new_b->next = NULL; in aura_dict_store_list_sorted() 442 d->cursor = d->cursor->next; in aura_dict_next() [all …]
|
/dragonfly/crypto/libressl/crypto/lhash/ |
H A D | lhash.c | 149 nn = n->next; in lh_free() 177 nn->next = NULL; in lh_insert() 210 *rn = nn->next; in lh_delete() 263 n = a->next; in doall_util_fn() 308 *n1 = (*n1)->next; in expand() 309 np->next= *n2; in expand() 312 n1 = &((*n1)->next); in expand() 366 n1 = n1->next; in contract() 367 n1->next = np; in contract() 391 ret = &(n1->next); in getrn() [all …]
|
/dragonfly/contrib/gdb-7/gdb/ |
H A D | reverse.c | 106 struct bookmark *next; member 116 #define ALL_BOOKMARKS(B) for ((B) = bookmark_chain; (B); (B) = (B)->next) 120 (B) ? ((TMP) = (B)->next, 1) : 0; \ 152 b->next = NULL; in save_bookmark_command() 162 while (b1->next) in save_bookmark_command() 163 b1 = b1->next; in save_bookmark_command() 164 b1->next = b; in save_bookmark_command() 184 bookmark_chain = b->next; in delete_one_bookmark() 190 if (b1->next == b) in delete_one_bookmark() 193 b1->next = b->next; in delete_one_bookmark()
|