Home
last modified time | relevance | path

Searched refs:next (Results 1 – 25 of 2634) sorted by relevance

12345678910>>...106

/NextBSD/contrib/subversion/subversion/libsvn_fs_base/util/
HDfs_skels.c62 && skel->children->next->is_atom) in is_valid_checksum_skel()
66 && skel->children->next->is_atom) in is_valid_checksum_skel()
80 && skel->children->next->is_atom) in is_valid_revision_skel()
105 if (skel->children->next->is_atom in is_valid_transaction_skel()
106 && skel->children->next->next->is_atom in is_valid_transaction_skel()
107 && (! skel->children->next->next->next->is_atom) in is_valid_transaction_skel()
108 && (! skel->children->next->next->next->next->is_atom)) in is_valid_transaction_skel()
128 window = skel->children->next; in is_valid_rep_delta_chunk_skel()
133 && (window->children->next->is_atom) in is_valid_rep_delta_chunk_skel()
134 && (window->children->next->next->is_atom))) in is_valid_rep_delta_chunk_skel()
[all …]
/NextBSD/contrib/libucl/uthash/
HDutlist.h85 #define _NEXT(elt,list,next) ((char*)((list)->next)) argument
86 #define _NEXTASGN(elt,list,to,next) { char **_alias = (char**)&((list)->next); *_alias=(char*)(to);… argument
93 #define _NEXT(elt,list,next) ((elt)->next) argument
94 #define _NEXTASGN(elt,list,to,next) ((elt)->next)=(to) argument
106 LL_SORT2(list, cmp, next)
108 #define LL_SORT2(list, cmp, next) \ argument
129 _SV(_ls_q,list); _ls_q = _NEXT(_ls_q,list,next); _RS(list); \
136 _NEXT(_ls_q,list,next); _RS(list); _ls_qsize--; \
139 _NEXT(_ls_p,list,next); _RS(list); _ls_psize--; \
142 _NEXT(_ls_p,list,next); _RS(list); _ls_psize--; \
[all …]
/NextBSD/sys/sys/mach/
HDqueue.h122 struct queue_entry *next; /* next element */ member
181 elt->next = que->next; in enqueue_head()
183 elt->next->prev = elt; in enqueue_head()
184 que->next = elt; in enqueue_head()
192 elt->next = que; in enqueue_tail()
194 elt->prev->next = elt; in enqueue_tail()
204 if (que->next != que) { in dequeue_head()
205 elt = que->next; in dequeue_head()
206 elt->next->prev = que; in dequeue_head()
207 que->next = elt->next; in dequeue_head()
[all …]
/NextBSD/usr.bin/find/
HDoperator.c64 (*planp) = (*planp)->next; in yanknode()
65 node->next = NULL; in yanknode()
78 PLAN *next; /* temp node holding subexpression results */ in yankexpr() local
95 if ((next = yankexpr(planp)) == NULL) in yankexpr()
104 if (next->execute == f_closeparen) { in yankexpr()
112 tail = subplan = next; in yankexpr()
114 tail->next = next; in yankexpr()
115 tail = next; in yankexpr()
117 tail->next = NULL; in yankexpr()
152 tail->next = expr; in paren_squish()
[all …]
/NextBSD/sys/compat/linuxkpi/common/include/linux/
HDlist.h76 struct list_head *next; member
84 list->next = list->prev = list; in INIT_LIST_HEAD()
91 return (head->next == head); in list_empty()
98 entry->next->prev = entry->prev; in list_del()
99 entry->prev->next = entry->next; in list_del()
105 new->next = old->next; in list_replace()
106 new->next->prev = new; in list_replace()
108 new->prev->next = new; in list_replace()
113 struct list_head *next) in _list_add() argument
116 next->prev = new; in _list_add()
[all …]
/NextBSD/crypto/openssl/crypto/pqueue/
HDpqueue.c78 item->next = NULL; in pitem_new()
111 pitem *curr, *next; in pqueue_insert() local
118 for (curr = NULL, next = pq->items; in pqueue_insert()
119 next != NULL; curr = next, next = next->next) { in pqueue_insert()
123 int cmp = memcmp(next->priority, item->priority, 8); in pqueue_insert()
125 item->next = next; in pqueue_insert()
130 curr->next = item; in pqueue_insert()
139 item->next = NULL; in pqueue_insert()
140 curr->next = item; in pqueue_insert()
155 pq->items = pq->items->next; in pqueue_pop()
[all …]
/NextBSD/gnu/usr.bin/rcs/lib/
HDrcsrev.c372 store1(store, next) in store1() argument
374 struct hshentry *next;
383 p->first = next;
399 register struct hshentry * next; local
407 if (!(next = Head)) {
416 while ((result=cmpnumfld(revno,next->num,1)) < 0) {
417 store1(&store, next);
418 next = next->next;
419 if (!next) {
432 branchnum = next->num; /* works even for empty revno*/
[all …]
/NextBSD/sys/kern/
HDsubr_module.c49 int next; in preload_search_by_name() local
65 next = sizeof(uint32_t) * 2 + hdr[1]; in preload_search_by_name()
66 next = roundup(next, sizeof(u_long)); in preload_search_by_name()
67 curp += next; in preload_search_by_name()
81 int next; in preload_search_by_type() local
102 next = sizeof(uint32_t) * 2 + hdr[1]; in preload_search_by_type()
103 next = roundup(next, sizeof(u_long)); in preload_search_by_type()
104 curp += next; in preload_search_by_type()
118 int next; in preload_search_next_name() local
127 next = sizeof(uint32_t) * 2 + hdr[1]; in preload_search_next_name()
[all …]
/NextBSD/contrib/ntp/libntp/
HDauthreadkeys.c87 KeyDataT *next; /* queue/stack link */ member
127 KeyDataT *next = NULL; in authreadkeys() local
227 next = NULL; in authreadkeys()
230 next = emalloc(sizeof(KeyDataT) + len); in authreadkeys()
231 next->keyid = keyno; in authreadkeys()
232 next->keytype = keytype; in authreadkeys()
233 next->seclen = len; in authreadkeys()
234 memcpy(next->secbuf, token, len); in authreadkeys()
259 next = emalloc(sizeof(KeyDataT) + len); in authreadkeys()
260 next->keyid = keyno; in authreadkeys()
[all …]
/NextBSD/sys/dev/drm2/
HDdrm_linux_list.h39 struct list_head *next, *prev; member
47 (head)->next = head; in INIT_LIST_HEAD()
58 return (head)->next == head; in list_empty()
63 (head)->next->prev = new; in list_add()
64 (new)->next = (head)->next; in list_add()
66 (head)->next = new; in list_add()
72 (entry)->next = head; in list_add_tail()
73 (head)->prev->next = entry; in list_add_tail()
79 (entry)->next->prev = (entry)->prev; in list_del()
80 (entry)->prev->next = (entry)->next; in list_del()
[all …]
/NextBSD/contrib/apr-util/misc/
HDapr_rmm.c55 apr_rmm_off_t next; member
76 static apr_rmm_off_t find_block_by_offset(apr_rmm_t *rmm, apr_rmm_off_t next, in find_block_by_offset() argument
81 while (next) { in find_block_by_offset()
82 struct rmm_block_t *blk = (rmm_block_t*)((char*)rmm->base + next); in find_block_by_offset()
84 if (find == next) in find_block_by_offset()
85 return next; in find_block_by_offset()
88 if (find < next) in find_block_by_offset()
91 prev = next; in find_block_by_offset()
92 next = blk->next; in find_block_by_offset()
99 apr_rmm_off_t next = rmm->base->firstfree; in find_block_of_size() local
[all …]
/NextBSD/sys/dev/hpt27xx/
HDlist.h41 struct list_head *next, *prev; member
44 #define INIT_LIST_HEAD(ptr) do { (ptr)->next = (ptr); (ptr)->prev = (ptr); } while (0)
46 …T_INLINE void __list_add(struct list_head * _new, struct list_head * prev, struct list_head * next) in __list_add() argument
48 next->prev = _new; in __list_add()
49 _new->next = next; in __list_add()
51 prev->next = _new; in __list_add()
56 __list_add(_new, head, head->next); in list_add()
64 static HPT_INLINE void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
66 next->prev = prev; in __list_del()
67 prev->next = next; in __list_del()
[all …]
/NextBSD/sys/dev/nxge/include/
HDxge-list.h45 struct xge_list_t* next; member
57 header->next = header; in xge_list_init()
73 return header->next == header; in xge_list_is_empty()
87 xge_assert(header->next != NULL); in xge_list_first_get()
90 if(header->next == header) in xge_list_first_get()
93 return header->next; in xge_list_first_get()
106 xge_assert(item->next != NULL); in xge_list_remove()
109 item->next->prev = item->prev; in xge_list_remove()
110 item->prev->next = item->next; in xge_list_remove()
112 item->next = item->prev = NULL; in xge_list_remove()
[all …]
/NextBSD/sys/dev/hptrr/
HDlist.h43 struct list_head *next, *prev; member
46 #define INIT_LIST_HEAD(ptr) do { (ptr)->next = (ptr); (ptr)->prev = (ptr); } while (0)
48 …T_INLINE void __list_add(struct list_head * _new, struct list_head * prev, struct list_head * next) in __list_add() argument
50 next->prev = _new; in __list_add()
51 _new->next = next; in __list_add()
53 prev->next = _new; in __list_add()
58 __list_add(_new, head, head->next); in list_add()
66 static HPT_INLINE void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
68 next->prev = prev; in __list_del()
69 prev->next = next; in __list_del()
[all …]
/NextBSD/sys/dev/hptnr/
HDlist.h40 struct list_head *next, *prev; member
43 #define INIT_LIST_HEAD(ptr) do { (ptr)->next = (ptr); (ptr)->prev = (ptr); } while (0)
45 …T_INLINE void __list_add(struct list_head * _new, struct list_head * prev, struct list_head * next) in __list_add() argument
47 next->prev = _new; in __list_add()
48 _new->next = next; in __list_add()
50 prev->next = _new; in __list_add()
55 __list_add(_new, head, head->next); in list_add()
63 static HPT_INLINE void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
65 next->prev = prev; in __list_del()
66 prev->next = next; in __list_del()
[all …]
/NextBSD/tools/tools/drm/radeon/mkregtable/
HDmkregtable.c45 struct list_head *next, *prev; member
55 list->next = list; in INIT_LIST_HEAD()
67 struct list_head *prev, struct list_head *next) in __list_add() argument
69 next->prev = new; in __list_add()
70 new->next = next; in __list_add()
72 prev->next = new; in __list_add()
76 struct list_head *prev, struct list_head *next);
89 __list_add(new, head, head->next); in list_add()
112 static inline void __list_del(struct list_head *prev, struct list_head *next) in __list_del() argument
114 next->prev = prev; in __list_del()
[all …]
/NextBSD/contrib/netbsd-tests/lib/libbluetooth/
HDt_sdp_put.c58 test.end = test.next; in ATF_TC_BODY()
59 test.next = buf; in ATF_TC_BODY()
67 ATF_REQUIRE_EQ(test.end - test.next, sizeof(expect)); in ATF_TC_BODY()
68 ATF_CHECK(memcmp(expect, test.next, sizeof(expect)) == 0); in ATF_TC_BODY()
90 value.next += 1; // skip "nil" in ATF_TC_BODY()
92 test.end = test.next; in ATF_TC_BODY()
93 test.next = buf; in ATF_TC_BODY()
100 ATF_REQUIRE_EQ(test.end - test.next, sizeof(expect)); in ATF_TC_BODY()
101 ATF_CHECK(memcmp(expect, test.next, sizeof(expect)) == 0); in ATF_TC_BODY()
144 test.end = test.next; in ATF_TC_BODY()
[all …]
/NextBSD/contrib/libxo/tests/core/saved/
HDtest_08.X.out1 …next>1</next></sub><sub><name>1</name><next>2</next></sub><sub><name>2</name><next>3</next></sub><…
HDtest_08.XP.out82 <next>1</next>
86 <next>2</next>
90 <next>3</next>
99 <next>1</next>
103 <next>2</next>
107 <next>3</next>
116 <next>1</next>
120 <next>2</next>
124 <next>3</next>
133 <next>1</next>
[all …]
/NextBSD/sys/dev/vxge/include/
HDvxge-list.h47 struct vxge_list_t *next; member
61 header->next = header; in vxge_list_init()
77 return (header->next == header); in vxge_list_is_empty()
91 vxge_assert(header->next != NULL); in vxge_list_first_get()
94 if (header->next == header) in vxge_list_first_get()
97 return (header->next); in vxge_list_first_get()
110 vxge_assert(item->next != NULL); in vxge_list_remove()
113 item->next->prev = item->prev; in vxge_list_remove()
114 item->prev->next = item->next; in vxge_list_remove()
116 item->next = item->prev = NULL; in vxge_list_remove()
[all …]
/NextBSD/contrib/gdb/gdb/
HDbuildsym.c91 while (link->next) link = link->next; in add_free_pendings()
92 link->next = free_pendings; in add_free_pendings()
118 free_pendings = link->next; in add_symbol_to_list()
125 link->next = *listhead; in add_symbol_to_list()
159 list = list->next; in find_symbol_in_list()
170 struct pending *next, *next1; in really_free_pendings() local
172 for (next = free_pendings; next; next = next1) in really_free_pendings()
174 next1 = next->next; in really_free_pendings()
175 xfree ((void *) next); in really_free_pendings()
181 for (next = file_symbols; next != NULL; next = next1) in really_free_pendings()
[all …]
/NextBSD/contrib/subversion/subversion/libsvn_wc/
HDtree_conflicts.c95 && skel->children->next->is_atom in is_valid_version_info_skel()
96 && skel->children->next->next->is_atom in is_valid_version_info_skel()
97 && skel->children->next->next->next->is_atom in is_valid_version_info_skel()
98 && skel->children->next->next->next->next->is_atom); in is_valid_version_info_skel()
113 skel = skel->children->next; in is_valid_conflict_skel()
114 for (i = 5; i--; skel = skel->next) in is_valid_conflict_skel()
120 && is_valid_version_info_skel(skel->next)); in is_valid_conflict_skel()
165 skel->children->next->data, in read_node_version_info()
166 skel->children->next->len); in read_node_version_info()
177 skel->children->next->next->data, in read_node_version_info()
[all …]
/NextBSD/sys/dev/drm/
HDdrm_linux_list.h39 struct list_head *next, *prev; member
47 (head)->next = head; in INIT_LIST_HEAD()
53 return (head)->next == head; in list_empty()
58 (head)->next->prev = new; in list_add()
59 (new)->next = (head)->next; in list_add()
61 (head)->next = new; in list_add()
67 (entry)->next = head; in list_add_tail()
68 (head)->prev->next = entry; in list_add_tail()
74 (entry)->next->prev = (entry)->prev; in list_del()
75 (entry)->prev->next = (entry)->next; in list_del()
[all …]
/NextBSD/contrib/gcc/
HDbitmap.c54 elt->next = NULL; in bitmap_elem_to_freelist()
73 bitmap_element *next = elt->next; in bitmap_element_free() local
77 prev->next = next; in bitmap_element_free()
79 if (next) in bitmap_element_free()
80 next->prev = prev; in bitmap_element_free()
83 head->first = next; in bitmap_element_free()
89 head->current = next != 0 ? next : prev; in bitmap_element_free()
113 if (element->next) in bitmap_element_allocate()
115 bit_obstack->elements = element->next; in bitmap_element_allocate()
130 if (element->next) in bitmap_element_allocate()
[all …]
/NextBSD/contrib/xz/src/liblzma/common/
HDauto_decoder.c19 lzma_next_coder next; member
53 &coder->next, allocator, in auto_decode()
56 return_if_error(lzma_alone_decoder_init(&coder->next, in auto_decode()
73 const lzma_ret ret = coder->next.code( in auto_decode()
74 coder->next.coder, allocator, in auto_decode()
105 lzma_next_end(&coder->next, allocator); in auto_decoder_end()
115 return coder->next.get_check == NULL ? LZMA_CHECK_NONE in auto_decoder_get_check()
116 : coder->next.get_check(coder->next.coder); in auto_decoder_get_check()
126 if (coder->next.memconfig != NULL) { in auto_decoder_memconfig()
127 ret = coder->next.memconfig(coder->next.coder, in auto_decoder_memconfig()
[all …]

12345678910>>...106