/freebsd-current/usr.bin/m4/ |
H A D | tokenizer.l | 85 char *next; 90 base = strtol(yytext+2, &next, 0); 91 if (base > 36 || next == NULL) { 94 next++; 95 while (*next != 0) { 96 if (*next >= '0' && *next <= '9') 97 d = *next - '0'; 98 else if (*next >= 'a' && *next < [all...] |
/freebsd-current/contrib/libucl/uthash/ |
H A D | utlist.h | 38 * 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-current/contrib/elftoolchain/libelf/ |
H A D | elf_next.c | 38 off_t next; local 53 next = e->e_rawfile - parent->e_rawfile + (off_t) e->e_rawsize; 54 next = (next + 1) & ~1; /* round up to an even boundary */ 58 * next call to 'elf_begin()'. 60 parent->e_u.e_ar.e_next = (next >= (off_t) parent->e_rawsize) ? 61 (off_t) 0 : next; 68 * 'e_next' field so that the next call to elf_begin(3) will terminate 72 if (next > (off_t) parent->e_rawsize) {
|
/freebsd-current/contrib/unbound/services/ |
H A D | outbound_list.c | 59 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-current/contrib/tcpdump/ |
H A D | cpack.c | 54 /* Advance to the next wordsize boundary. Return NULL if fewer than 61 const uint8_t *next; local 64 next = nd_cpack_next_boundary(cs->c_buf, cs->c_next, wordsize); 67 if (next - cs->c_buf + wordsize > cs->c_len) 70 return next; 100 const uint8_t *next; local 102 if ((next = nd_cpack_align_and_reserve(cs, sizeof(*u))) == NULL) 105 *u = GET_LE_U_8(next); 108 cs->c_next = next + sizeof(*u); 116 const uint8_t *next; local 132 const uint8_t *next; local 148 const uint8_t *next; local 164 const uint8_t *next; local 180 const uint8_t *next; local [all...] |
/freebsd-current/sys/compat/linuxkpi/common/include/linux/ |
H A D | rculist.h | 37 #define list_next_rcu(head) (*((struct list_head **)(&(head)->next))) 41 for (pos = list_entry_rcu((head)->next, typeof(*(pos)), member); \ 43 pos = list_entry_rcu((pos)->member.next, typeof(*(pos)), member)) 48 pos = list_entry_rcu((pos)->member.next, typeof(*(pos)), member)) 55 struct list_head *next) 57 new->next = next; 60 next->prev = new; 66 linux_list_add_rcu(new, head, head->next); 76 __list_del_rcu(struct list_head *prev, struct list_head *next) argument 54 linux_list_add_rcu(struct list_head *new, struct list_head *prev, struct list_head *next) argument 79 rcu_assign_pointer(list_next_rcu(prev), next); local 118 struct hlist_node *next = n->next; local [all...] |
H A D | list.h | 91 list->next = list->prev = list; 98 return (head->next == head); 104 struct list_head *next = head->next; local 106 return ((next == head) && (next == head->prev)); 110 __list_del(struct list_head *prev, struct list_head *next) argument 112 next->prev = prev; 113 WRITE_ONCE(prev->next, next); 147 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument 287 linux_list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) argument 341 struct hlist_node *next, **pprev; member in struct:hlist_node 397 hlist_add_before(struct hlist_node *n, struct hlist_node *next) argument [all...] |
/freebsd-current/contrib/wpa/src/utils/ |
H A D | list.h | 16 struct dl_list *next; member in struct:dl_list 24 list->next = list; 30 item->next = list->next; 32 list->next->prev = item; 33 list->next = item; 43 item->next->prev = item->prev; 44 item->prev->next = item->next; 45 item->next [all...] |
/freebsd-current/contrib/com_err/ |
H A D | compile_et.h | 58 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-current/crypto/heimdal/lib/com_err/ |
H A D | compile_et.h | 61 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-current/contrib/mandoc/ |
H A D | mandoc_xr.h | 19 struct mandoc_xr *next; member in struct:mandoc_xr
|
/freebsd-current/bin/sh/ |
H A D | alias.h | 36 struct alias *next; member in struct:alias
|
/freebsd-current/contrib/xz/src/liblzma/common/ |
H A D | alone_decoder.h | 19 lzma_next_coder *next, const lzma_allocator *allocator,
|
H A D | index_decoder.h | 19 extern lzma_ret lzma_index_decoder_init(lzma_next_coder *next,
|
H A D | stream_decoder.h | 18 lzma_next_coder *next, const lzma_allocator *allocator,
|
H A D | lzip_decoder.h | 18 lzma_next_coder *next, const lzma_allocator *allocator,
|
H A D | auto_decoder.c | 21 lzma_next_coder next; member in struct:__anon35 59 &coder->next, allocator, 64 &coder->next, allocator, 68 return_if_error(lzma_alone_decoder_init(&coder->next, 85 const lzma_ret ret = coder->next.code( 86 coder->next.coder, allocator, 118 lzma_next_end(&coder->next, allocator); 130 return coder->next.get_check == NULL ? LZMA_CHECK_NONE 131 : coder->next.get_check(coder->next 166 auto_decoder_init(lzma_next_coder *next, const lzma_allocator *allocator, uint64_t memlimit, uint32_t flags) argument [all...] |
/freebsd-current/lib/libpmc/pmu-events/ |
H A D | list.h | 46 struct list_head *next; member in struct:list_head 75 list->next = list->prev = list; 82 return (head->next == head); 88 struct list_head *next = head->next; local 90 return ((next == head) && (next == head->prev)); 94 __list_del(struct list_head *prev, struct list_head *next) argument 96 next->prev = prev; 97 WRITE_ONCE(prev->next, nex 131 linux_list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument 243 linux_list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) argument 298 struct hlist_node *next, **pprev; member in struct:hlist_node 355 hlist_add_before(struct hlist_node *n, struct hlist_node *next) argument 365 hlist_add_after(struct hlist_node *n, struct hlist_node *next) argument [all...] |
/freebsd-current/sys/contrib/ck/include/ |
H A D | ck_fifo.h | 41 struct ck_fifo_spsc_entry *next; member in struct:ck_fifo_spsc_entry 109 stub->next = NULL; 130 entry->next = NULL; 132 /* If stub->next is visible, guarantee that entry is consistent. */ 134 ck_pr_store_ptr(&fifo->tail->next, entry); 149 entry = ck_pr_load_ptr(&fifo->head->next); 176 fifo->garbage = garbage->next; 184 return ck_pr_load_ptr(&head->next) == NULL; 187 #define CK_FIFO_SPSC_ISEMPTY(f) ((f)->head->next == NULL) 188 #define CK_FIFO_SPSC_FIRST(f) ((f)->head->next) 213 struct ck_fifo_mpmc_pointer next; member in struct:ck_fifo_mpmc_entry 249 struct ck_fifo_mpmc_pointer tail, next, update; local 306 struct ck_fifo_mpmc_pointer tail, next, update; local 359 struct ck_fifo_mpmc_pointer head, tail, next, update; local 414 struct ck_fifo_mpmc_pointer head, tail, next, update; local [all...] |
/freebsd-current/contrib/ofed/librdmacm/ |
H A D | indexer.h | 49 int next; member in union:idx_entry 105 struct _dlist_entry *next; member in struct:_dlist_entry 111 head->next = head; 117 return head->next == head; 122 item->next = head->next; 124 head->next->prev = item; 125 head->next = item; 138 item->prev->next = item->next; [all...] |
/freebsd-current/sys/libkern/x86/ |
H A D | crc32_sse42.c | 153 * bits), in even -- next square puts operator for two zero bytes in 223 const unsigned char *next, *end; local 230 next = buf; 234 while (len && ((uintptr_t)next & (align - 1)) != 0) { 235 crc0 = _mm_crc32_u8(crc0, *next); 236 next++; 252 end = next + LONG; 255 crc0 = _mm_crc32_u64(crc0, *(const uint64_t *)next); 257 *(const uint64_t *)(next + LONG)); 259 *(const uint64_t *)(next [all...] |
/freebsd-current/sys/dev/qat/qat_api/common/utils/ |
H A D | lac_lock_free_stack.h | 38 lac_mem_blk_t *next; local 42 next = PTR(old_top.ptr); 43 if (NULL == next) 44 return next; 46 new_top.ptr = (uintptr_t)next->pNext; 52 return next; 82 lac_mem_blk_t *next = PTR(old_top.ptr); local 83 return next;
|
/freebsd-current/sys/contrib/openzfs/lib/libspl/ |
H A D | list.c | 38 #define list_empty(a) ((a)->list_head.next == &(a)->list_head) 43 lnew->next = (node)->next; \ 44 (node)->next->prev = lnew; \ 45 (node)->next = lnew; \ 50 lnew->next = (node); \ 52 (node)->prev->next = lnew; \ 57 (node)->prev->next = (node)->next; \ 58 (node)->next [all...] |
/freebsd-current/contrib/llvm-project/llvm/lib/Support/ |
H A D | VersionTuple.cpp | 46 char next = input[0]; local 48 if (next < '0' || next > '9') 50 value = (unsigned)(next - '0'); 53 next = input[0]; 54 if (next < '0' || next > '9') 57 value = value * 10 + (unsigned)(next - '0');
|
/freebsd-current/contrib/ntp/libntp/ |
H A D | authreadkeys.c | 71 * 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; 149 KeyDataT *next = NULL; local 259 next = NULL; 283 next = emalloc(sizeof(KeyDataT) + len); 284 next->keyacclist = NULL; 285 next->keyid = keyno; 286 next->keytype = keytype; 287 next [all...] |