/dragonfly/usr.bin/find/ |
H A D | operator.c | 60 node->next = NULL; in yanknode() 109 tail->next = next; in yankexpr() 110 tail = next; in yankexpr() 175 next->p_data[0] = not_squish(next->p_data[0]); in not_squish() 201 next = node; in not_squish() 210 tail->next = next; in not_squish() 211 tail = next; in not_squish() 237 next->p_data[0] = or_squish(next->p_data[0]); in or_squish() 241 next->p_data[0] = or_squish(next->p_data[0]); in or_squish() 262 tail->next = next; in or_squish() [all …]
|
/dragonfly/sys/dev/drm/include/linux/ |
H A D | list.h | 107 new->next = old->next; in list_replace() 126 new->next = next; in _list_add() 246 last->next = next; in _list_splice() 349 n->next = next; in hlist_add_before() 350 next->pprev = &n->next; in hlist_add_before() 358 next->next = n->next; in hlist_add_after() 359 n->next = next; in hlist_add_after() 360 next->pprev = &n->next; in hlist_add_after() 361 if (next->next) in hlist_add_after() 362 next->next->pprev = &next->next; in hlist_add_after() [all …]
|
/dragonfly/gnu/usr.bin/rcs/lib/ |
H A D | rcsrev.c | 437 next = next->next; 462 next=next->next; 483 next = next->next; 484 if (!next) 488 if (!next || cmpnumfld(revno,next->num,1) != 0) { 512 next->num, next->author 519 next->state ? next->state : "<empty>" 597 next=next->next; 607 next=next->next; 629 next = next->next; [all …]
|
/dragonfly/tools/tools/drm/radeon/mkregtable/ |
H A D | mkregtable.c | 52 list->next = list; in INIT_LIST_HEAD() 66 next->prev = new; in __list_add() 67 new->next = next; in __list_add() 69 prev->next = new; in __list_add() 112 prev->next = next; in __list_del() 141 new->next = old->next; in list_replace() 222 struct list_head *next = head->next; in list_empty_careful() local 223 return (next == head) && (next == head->prev); in list_empty_careful() 240 list->next = head->next; in __list_cut_position() 285 last->next = next; in __list_splice() [all …]
|
/dragonfly/crypto/libressl/ssl/ |
H A D | pqueue.c | 81 item->next = NULL; in pitem_new() 107 pitem *curr, *next; in pqueue_insert() local 114 for (curr = NULL, next = pq->items; next != NULL; in pqueue_insert() 115 curr = next, next = next->next) { in pqueue_insert() 121 item->next = next; in pqueue_insert() 133 item->next = NULL; in pqueue_insert() 134 curr->next = item; in pqueue_insert() 159 pitem *next; in pqueue_find() local 161 for (next = pq->items; next != NULL; next = next->next) in pqueue_find() 164 return next; in pqueue_find() [all …]
|
/dragonfly/contrib/tcpdump/ |
H A D | cpack.c | 61 const uint8_t *next; in nd_cpack_align_and_reserve() local 70 return next; in nd_cpack_align_and_reserve() 100 const uint8_t *next; in nd_cpack_uint64() local 105 *u = GET_LE_U_8(next); in nd_cpack_uint64() 116 const uint8_t *next; in nd_cpack_int64() local 121 *u = GET_LE_S_8(next); in nd_cpack_int64() 132 const uint8_t *next; in nd_cpack_uint32() local 137 *u = GET_LE_U_4(next); in nd_cpack_uint32() 148 const uint8_t *next; in nd_cpack_int32() local 164 const uint8_t *next; in nd_cpack_uint16() local [all …]
|
/dragonfly/sys/dev/raid/hpt27xx/ |
H A D | list.h | 48 next->prev = _new; in __list_add() 49 _new->next = next; in __list_add() 51 prev->next = _new; in __list_add() 66 next->prev = prev; in __list_del() 67 prev->next = next; in __list_del() 84 return head->next == head; in list_empty() 95 head->next = first; in __list_splice() 97 last->next = at; in __list_splice() 119 for (pos = (head)->next; pos != (head); pos = pos->next) 122 for (pos = (head)->next, n = pos->next; pos != (head); \ [all …]
|
/dragonfly/sys/dev/raid/hptrr/ |
H A D | list.h | 50 next->prev = _new; in __list_add() 51 _new->next = next; in __list_add() 53 prev->next = _new; in __list_add() 68 next->prev = prev; in __list_del() 69 prev->next = next; in __list_del() 86 return head->next == head; in list_empty() 97 head->next = first; in __list_splice() 99 last->next = at; in __list_splice() 121 for (pos = (head)->next; pos != (head); pos = pos->next) 124 for (pos = (head)->next, n = pos->next; pos != (head); \ [all …]
|
/dragonfly/contrib/gcc-4.7/gcc/ |
H A D | genemit.c | 44 struct clobber_pat *next; member 53 struct clobber_ent *next; member 340 link->next = p->insns; in gen_insn() 491 if ((GET_CODE (next) == SET && GET_CODE (SET_DEST (next)) == PC) in gen_expand() 496 || ANY_RETURN_P (next)) in gen_expand() 498 else if ((GET_CODE (next) == SET && GET_CODE (SET_SRC (next)) == CALL) in gen_expand() 520 if (GET_CODE (next) == SET && GET_CODE (SET_DEST (next)) == PC in gen_expand() 609 if ((GET_CODE (next) == SET && GET_CODE (SET_DEST (next)) == PC) in gen_split() 613 || ANY_RETURN_P (next)) in gen_split() 615 else if ((GET_CODE (next) == SET && GET_CODE (SET_SRC (next)) == CALL) in gen_split() [all …]
|
H A D | bitmap.c | 161 bitmap_element *next = elt->next; in bitmap_element_free() local 165 prev->next = next; in bitmap_element_free() 177 head->current = next != 0 ? next : prev; in bitmap_element_free() 464 element->next = ptr->next; in bitmap_element_link() 500 node->next = elt->next; in bitmap_elt_insert_after() 950 next = a_elt->next; in bitmap_and_into() 969 next = a_elt->next; in bitmap_and_into() 1170 next = a_elt->next; in bitmap_and_compl_into() 1436 next = a_elt->next; in bitmap_compl_and_into() 1463 next = a_elt->next; in bitmap_compl_and_into() [all …]
|
/dragonfly/sys/kern/ |
H A D | subr_module.c | 51 int next; in preload_search_by_name() local 80 next = roundup(next, sizeof(u_long)); in preload_search_by_name() 81 curp += next; in preload_search_by_name() 94 int next; in preload_search_by_type() local 116 next = roundup(next, sizeof(u_long)); in preload_search_by_type() 131 int next; in preload_search_next_name() local 141 next = roundup(next, sizeof(u_long)); in preload_search_next_name() 157 next = roundup(next, sizeof(u_long)); in preload_search_next_name() 203 next = roundup(next, sizeof(u_long)); in preload_search_info() 240 next = roundup(next, sizeof(u_long)); in preload_delete_name() [all …]
|
/dragonfly/sbin/rcorder/ |
H A D | rcorder.c | 98 f_provnode *next; member 103 f_reqnode *next; member 251 temp->next = fn_head->next; in filenode_new() 346 pnode->next = head->next; in add_provide() 541 pnode->next = head->next; in make_fake_provision() 738 r = r->next; in do_file() 754 pnode->last->next = pnode->next; in do_file() 757 p = p->next; in do_file() 773 fnode->last->next = fnode->next; in do_file() 804 for (file = fn_head->next; file; file = file->next) { in generate_ordering() [all …]
|
/dragonfly/contrib/gdb-7/gdb/ |
H A D | buildsym.c | 189 for (next = free_pendings; next; next = next1) in really_free_pendings() 191 next1 = next->next; in really_free_pendings() 198 for (next = file_symbols; next != NULL; next = next1) in really_free_pendings() 200 next1 = next->next; in really_free_pendings() 205 for (next = global_symbols; next != NULL; next = next1) in really_free_pendings() 207 next1 = next->next; in really_free_pendings() 332 for (next = *listhead; next; next = next1) in finish_block_internal() 334 next1 = next->next; in finish_block_internal() 501 for (next = pending_blocks, i = 0; next; next = next->next, i++) in make_blockvector() 517 for (next = pending_blocks; next; next = next->next) in make_blockvector() [all …]
|
/dragonfly/contrib/diffutils/lib/ |
H A D | hash.c | 671 next = cursor->next; in hash_clear() 726 next = cursor->next; in hash_free() 734 next = cursor->next; in hash_free() 811 struct hash_entry *next = bucket->next; in hash_find_entry() local 837 struct hash_entry *next = cursor->next; in hash_find_entry() local 841 cursor->next = next->next; in hash_find_entry() 882 next = cursor->next; in transfer_entries() 888 cursor->next = new_bucket->next; in transfer_entries() 919 new_entry->next = new_bucket->next; in transfer_entries() 1104 new_entry->next = bucket->next; in hash_insert_if_absent() [all …]
|
/dragonfly/contrib/grep/lib/ |
H A D | hash.c | 671 next = cursor->next; in hash_clear() 726 next = cursor->next; in hash_free() 734 next = cursor->next; in hash_free() 811 struct hash_entry *next = bucket->next; in hash_find_entry() local 837 struct hash_entry *next = cursor->next; in hash_find_entry() local 841 cursor->next = next->next; in hash_find_entry() 882 next = cursor->next; in transfer_entries() 888 cursor->next = new_bucket->next; in transfer_entries() 919 new_entry->next = new_bucket->next; in transfer_entries() 1104 new_entry->next = bucket->next; in hash_insert_if_absent() [all …]
|
/dragonfly/contrib/tcsh-6/ |
H A D | sh.parse.c | 76 p1 = p1->next; in asyntax() 101 if (p->next != p2 && eq(p->next->word, STRand)) in asyn0() 102 p = p->next; in asyn0() 171 alout.prev->prev->next = p1->next; in asyn3() 173 p1->next = alout.next; in asyn3() 187 p1 = p1->next; in freenod() 249 if (p->next != p2 && eq(p->next->word, STRand)) in syn0() 250 p = p->next; in syn0() 558 lp = p->next; in syn3() 574 if (p->next != p2 && eq(p->next->word, STRand)) { in syn3() [all …]
|
/dragonfly/contrib/xz/src/liblzma/common/ |
H A D | common.c | 120 next->id = filters[0].id; in lzma_next_filter_init() 139 assert(next->update != NULL); in lzma_next_filter_update() 140 return next->update(next->coder, allocator, NULL, reversed_filters); in lzma_next_filter_update() 151 if (next->end != NULL) in lzma_next_end() 152 next->end(next->coder, allocator); in lzma_next_end() 158 *next = LZMA_NEXT_CODER_INIT; in lzma_next_end() 374 strm->internal->next.get_progress(strm->internal->next.coder, in lzma_get_progress() 393 return strm->internal->next.get_check(strm->internal->next.coder); in lzma_get_check() 406 strm->internal->next.coder, in lzma_memusage() 423 strm->internal->next.coder, in lzma_memlimit_get() [all …]
|
H A D | auto_decoder.c | 19 lzma_next_coder next; member 55 &coder->next, allocator, in auto_decode() 76 coder->next.coder, allocator, in auto_decode() 121 : coder->next.get_check(coder->next.coder); in auto_decoder_get_check() 133 if (coder->next.memconfig != NULL) { in auto_decoder_memconfig() 134 ret = coder->next.memconfig(coder->next.coder, in auto_decoder_memconfig() 164 lzma_auto_coder *coder = next->coder; in auto_decoder_init() 170 next->coder = coder; in auto_decoder_init() 171 next->code = &auto_decode; in auto_decoder_init() 172 next->end = &auto_decoder_end; in auto_decoder_init() [all …]
|
/dragonfly/contrib/gcc-8.0/gcc/ |
H A D | bitmap.c | 88 bitmap_element *next = elt->next; in bitmap_element_free() local 92 prev->next = next; in bitmap_element_free() 104 head->current = next != 0 ? next : prev; in bitmap_element_free() 392 element->next = ptr->next; in bitmap_element_link() 428 node->next = elt->next; in bitmap_elt_insert_after() 944 next = a_elt->next; in bitmap_and_into() 965 next = a_elt->next; in bitmap_and_into() 1174 next = a_elt->next; in bitmap_and_compl_into() 1452 next = a_elt->next; in bitmap_compl_and_into() 1479 next = a_elt->next; in bitmap_compl_and_into() [all …]
|
/dragonfly/contrib/cvs-1.12/diff/ |
H A D | context.c | 177 next = hunk; 184 while (next && next->line0 + next->deleted <= i) 185 next = next->link; 190 if (next && next->line0 <= i) 206 next = hunk; 213 while (next && next->line1 + next->inserted <= i) 214 next = next->link; 219 if (next && next->line1 <= i) 308 next = hunk; 317 if (!next || i < next->line0) [all …]
|
/dragonfly/usr.bin/m4/ |
H A D | tokenizer.l | 83 char *next; in parse_radix() local 89 if (base > 36 || next == NULL) { in parse_radix() 92 next++; in parse_radix() 93 while (*next != 0) { in parse_radix() 94 if (*next >= '0' && *next <= '9') in parse_radix() 95 d = *next - '0'; in parse_radix() 96 else if (*next >= 'a' && *next <= 'z') in parse_radix() 97 d = *next - 'a' + 10; in parse_radix() 99 assert(*next >= 'A' && *next <= 'Z'); in parse_radix() 100 d = *next - 'A' + 10; in parse_radix() [all …]
|
/dragonfly/contrib/wpa_supplicant/src/utils/ |
H A D | list.h | 16 struct dl_list *next; member 24 list->next = list; in dl_list_init() 30 item->next = list->next; in dl_list_add() 32 list->next->prev = item; in dl_list_add() 33 list->next = item; in dl_list_add() 43 item->next->prev = item->prev; in dl_list_del() 44 item->prev->next = item->next; in dl_list_del() 45 item->next = NULL; in dl_list_del() 51 return list->next == list; in dl_list_empty() 58 for (item = list->next; item != list; item = item->next) in dl_list_len() [all …]
|
/dragonfly/contrib/gcc-8.0/libstdc++-v3/libsupc++/ |
H A D | eh_alloc.cc | 97 free_entry *next; member 158 e = &(*e)->next) in allocate() 169 free_entry *next = (*e)->next; in allocate() local 171 f->next = next; in allocate() 182 free_entry *next = (*e)->next; in allocate() local 186 *e = next; in allocate() 218 f->next = first_free_entry->next; in free() 226 (*fe)->next in free() 237 (*fe)->next = (*fe)->next->next; in free() 249 f->next = (*fe)->next; in free() [all …]
|
/dragonfly/contrib/byacc/ |
H A D | mkpar.c | 139 for (next = actions; next && next->symbol < symbol; next = next->next) in add_reduce() 140 prev = next; in add_reduce() 142 while (next && next->symbol == symbol && next->action_code == SHIFT) in add_reduce() 144 prev = next; in add_reduce() 145 next = next->next; in add_reduce() 148 while (next && next->symbol == symbol && in add_reduce() 149 next->action_code == REDUCE && next->number < ruleno) in add_reduce() 151 prev = next; in add_reduce() 152 next = next->next; in add_reduce() 156 temp->next = next; in add_reduce() [all …]
|
/dragonfly/lib/libc/stdlib/ |
H A D | insque.c | 23 struct que_elem *prev, *next, *elem; in insque() local 29 elem->prev = elem->next = NULL; in insque() 33 next = prev->next; in insque() 34 if (next != NULL) { in insque() 36 if (next->prev != prev) { in insque() 39 next, next->prev, prev); in insque() 42 next->prev = elem; in insque() 44 prev->next = elem; in insque() 46 elem->next = next; in insque()
|