Searched refs:next (Results 26 - 50 of 2659) sorted by relevance

1234567891011>>

/freebsd-10-stable/libexec/revnetgroup/
H A Dhash.h38 struct grouplist *next; member in struct:grouplist
46 struct member_entry *next; member in struct:member_entry
53 struct group_entry *next; member in struct:group_entry
/freebsd-10-stable/contrib/xz/src/liblzma/simple/
H A Dsimple_coder.h19 extern lzma_ret lzma_simple_x86_encoder_init(lzma_next_coder *next,
23 extern lzma_ret lzma_simple_x86_decoder_init(lzma_next_coder *next,
28 extern lzma_ret lzma_simple_powerpc_encoder_init(lzma_next_coder *next,
32 extern lzma_ret lzma_simple_powerpc_decoder_init(lzma_next_coder *next,
37 extern lzma_ret lzma_simple_ia64_encoder_init(lzma_next_coder *next,
41 extern lzma_ret lzma_simple_ia64_decoder_init(lzma_next_coder *next,
46 extern lzma_ret lzma_simple_arm_encoder_init(lzma_next_coder *next,
50 extern lzma_ret lzma_simple_arm_decoder_init(lzma_next_coder *next,
55 extern lzma_ret lzma_simple_armthumb_encoder_init(lzma_next_coder *next,
59 extern lzma_ret lzma_simple_armthumb_decoder_init(lzma_next_coder *next,
[all...]
/freebsd-10-stable/usr.bin/m4/
H A Dtokenizer.l84 char *next;
89 base = strtol(yytext+2, &next, 0);
90 if (base > 36 || next == NULL) {
93 next++;
94 while (*next != 0) {
95 if (*next >= '0' && *next <= '9')
96 d = *next - '0';
97 else if (*next >= 'a' && *next <
[all...]
/freebsd-10-stable/contrib/libucl/uthash/
H A Dutlist.h38 * To use singly-linked lists, your structure must have a "next" pointer.
39 * To use doubly-linked lists, your structure must "prev" and "next" pointers.
45 * struct item *prev, *next;
82 * to dereference its prev/next pointers, and save/restore the real head.*/
85 #define _NEXT(elt,list,next) ((char*)((list)->next))
86 #define _NEXTASGN(elt,list,to,next) { char **_alias = (char**)&((list)->next); *_alias=(char*)(to); }
93 #define _NEXT(elt,list,next) ((elt)->next)
[all...]
/freebsd-10-stable/contrib/bmake/lst.lib/
H A DlstForEachFrom.c78 ListNode next; local
92 next = tln->nextPtr;
96 * - the next node to examine is the first in the queue or
101 done = (next == NULL || next == list->firstPtr);
112 if (next != tln->nextPtr) {
113 next = tln->nextPtr;
120 tln = next;
/freebsd-10-stable/contrib/unbound/services/
H A Doutbound_list.c59 np = p->next;
72 e->next = list->first;
83 if(e->next)
84 e->next->prev = e->prev;
86 e->prev->next = e->next;
87 else list->first = e->next;
/freebsd-10-stable/contrib/wpa/src/utils/
H A Dlist.h16 struct dl_list *next; member in struct:dl_list
22 list->next = list;
28 item->next = list->next;
30 list->next->prev = item;
31 list->next = item;
41 item->next->prev = item->prev;
42 item->prev->next = item->next;
43 item->next
[all...]
/freebsd-10-stable/sys/ofed/include/linux/
H A Dlist.h71 struct list_head *next; member in struct:list_head
79 list->next = list->prev = list;
86 return (head->next == head);
93 entry->next->prev = entry->prev;
94 entry->prev->next = entry->next;
99 struct list_head *next)
102 next->prev = new;
103 new->next = next;
98 _list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
173 _list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) argument
228 struct hlist_node *next, **pprev; member in struct:hlist_node
285 hlist_add_before(struct hlist_node *n, struct hlist_node *next) argument
295 hlist_add_after(struct hlist_node *n, struct hlist_node *next) argument
[all...]
/freebsd-10-stable/sys/dev/drm2/
H A Ddrm_linux_list.h15 * The above copyright notice and this permission notice (including the next
39 struct list_head *next, *prev; member in struct:list_head
47 (head)->next = head;
58 return (head)->next == head;
63 (head)->next->prev = new;
64 (new)->next = (head)->next;
66 (head)->next = new;
72 (entry)->next = head;
73 (head)->prev->next
157 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) argument
[all...]
/freebsd-10-stable/contrib/ntp/libntp/
H A Dauthreadkeys.c71 * log the first 5 errors, silently ignore the next 10 errors, and give
89 KeyDataT *next; /* queue/stack link */ member in struct:keydata
121 node->keyacclist = kap->next;
150 KeyDataT *next = NULL; local
258 next = NULL;
261 next = emalloc(sizeof(KeyDataT) + len);
262 next->keyacclist = NULL;
263 next->keyid = keyno;
264 next->keytype = keytype;
265 next
[all...]
/freebsd-10-stable/lib/libelf/
H A Delf_next.c39 off_t next; local
55 next = e->e_rawfile - parent->e_rawfile + e->e_rawsize;
56 next = (next + 1) & ~1; /* round up to an even boundary */
58 parent->e_u.e_ar.e_next = (next >= (off_t) parent->e_rawsize) ? (off_t) 0 : next;
/freebsd-10-stable/contrib/com_err/
H A Dcompile_et.h58 struct error_code *next, **tail; member in struct:error_code
67 (L)->tail = &(V)->next; \
68 (L)->next = NULL; \
71 (L)->tail = &(V)->next; \
/freebsd-10-stable/crypto/heimdal/lib/com_err/
H A Dcompile_et.h61 struct error_code *next, **tail; member in struct:error_code
70 (L)->tail = &(V)->next; \
71 (L)->next = NULL; \
74 (L)->tail = &(V)->next; \
/freebsd-10-stable/sys/gnu/dts/arm/
H A Dbcm4708.dtsi22 next-level-cache = <&L2>;
29 next-level-cache = <&L2>;
H A Dbcm47081.dtsi22 next-level-cache = <&L2>;
H A Dmeson8.dtsi61 next-level-cache = <&L2>;
68 next-level-cache = <&L2>;
75 next-level-cache = <&L2>;
82 next-level-cache = <&L2>;
/freebsd-10-stable/contrib/xz/src/liblzma/common/
H A Dstream_decoder.h19 lzma_next_coder *next, const lzma_allocator *allocator,
H A Dalone_decoder.h20 lzma_next_coder *next, const lzma_allocator *allocator,
H A Dfilter_encoder.h24 lzma_next_coder *next, const lzma_allocator *allocator,
H A Dauto_decoder.c19 lzma_next_coder next; member in struct:__anon436
55 &coder->next, allocator,
58 return_if_error(lzma_alone_decoder_init(&coder->next,
75 const lzma_ret ret = coder->next.code(
76 coder->next.coder, allocator,
108 lzma_next_end(&coder->next, allocator);
120 return coder->next.get_check == NULL ? LZMA_CHECK_NONE
121 : coder->next.get_check(coder->next.coder);
133 if (coder->next
153 auto_decoder_init(lzma_next_coder *next, const lzma_allocator *allocator, uint64_t memlimit, uint32_t flags) argument
[all...]
/freebsd-10-stable/contrib/subversion/subversion/libsvn_fs_base/
H A Dkey-gen.c40 svn_fs_base__next_key(const char *this, apr_size_t *len, char *next)
69 next[i] = '0';
75 next[i] = 'a';
77 next[i] = c + 1;
81 next[i] = c;
99 next[*len] = '\0';
104 memmove(next+1, next, olen);
105 next[0] = '1';
39 svn_fs_base__next_key(const char *this, apr_size_t *len, char *next) argument
/freebsd-10-stable/contrib/subversion/subversion/libsvn_diff/
H A Dlcs.c104 previous_lcs = lcs->next;
105 lcs->next = *freelist;
113 start_position[1] = fp_k[-1].position[1]->next;
119 start_position[0] = fp_k[1].position[0]->next;
142 position[0] = position[0]->next;
143 position[1] = position[1]->next;
151 *freelist = lcs->next;
161 lcs->next = previous_lcs;
171 start_position[0] = position[0] = position[0]->next;
174 start_position[1] = position[1] = position[1]->next;
190 svn_diff__lcs_t *next; local
[all...]
/freebsd-10-stable/contrib/apr-util/misc/
H A Dapr_rmm.c38 * the caller-usable region represented by the block. The next and
41 * address of the next and previous blocks in the list. ("address 0",
55 apr_rmm_off_t next; member in struct:rmm_block_t
76 static apr_rmm_off_t find_block_by_offset(apr_rmm_t *rmm, apr_rmm_off_t next, argument
81 while (next) {
82 struct rmm_block_t *blk = (rmm_block_t*)((char*)rmm->base + next);
84 if (find == next)
85 return next;
88 if (find < next)
91 prev = next;
99 apr_rmm_off_t next = rmm->base->firstfree; local
161 struct rmm_block_t *next = (rmm_block_t*)((char*)rmm->base + blk->next); local
197 struct rmm_block_t *next = (rmm_block_t*)((char*)rmm->base + blk->next); local
420 struct rmm_block_t *next = (rmm_block_t*)((char*)rmm->base + blk->next); local
[all...]
/freebsd-10-stable/contrib/llvm/tools/clang/lib/Basic/
H A DVersionTuple.cpp42 char next = input[0]; local
44 if (next < '0' || next > '9') return true;
45 value = (unsigned) (next - '0');
48 next = input[0];
49 if (next < '0' || next > '9') return false;
51 value = value * 10 + (unsigned) (next - '0');
/freebsd-10-stable/gnu/usr.bin/rcs/lib/
H A Drcsrev.c372 store1(store, next)
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;
532 register struct hshentry * next, * trail; local
656 register struct assoc const *next; local
[all...]

Completed in 368 milliseconds

1234567891011>>