/freebsd-11-stable/contrib/tcpdump/ |
H A D | cpack.c | 52 /* Advance to the next wordsize boundary. Return NULL if fewer than 59 const uint8_t *next; local 62 next = cpack_next_boundary(cs->c_buf, cs->c_next, wordsize); 65 if (next - cs->c_buf + wordsize > cs->c_len) 68 return next; 98 const uint8_t *next; local 100 if ((next = cpack_align_and_reserve(cs, sizeof(*u))) == NULL) 103 *u = EXTRACT_LE_64BITS(next); 106 cs->c_next = next + sizeof(*u); 114 const uint8_t *next; local 130 const uint8_t *next; local [all...] |
/freebsd-11-stable/contrib/xz/src/liblzma/common/ |
H A D | filter_decoder.h | 20 lzma_next_coder *next, const lzma_allocator *allocator,
|
H A D | alone_decoder.h | 20 lzma_next_coder *next, const lzma_allocator *allocator,
|
H A D | filter_encoder.h | 24 lzma_next_coder *next, const lzma_allocator *allocator,
|
H A D | stream_decoder.h | 19 lzma_next_coder *next, const lzma_allocator *allocator,
|
H A D | auto_decoder.c | 19 lzma_next_coder next; member in struct:__anon4427 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 156 auto_decoder_init(lzma_next_coder *next, const lzma_allocator *allocator, uint64_t memlimit, uint32_t flags) argument [all...] |
/freebsd-11-stable/contrib/xz/src/liblzma/simple/ |
H A D | simple_coder.h | 19 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-11-stable/libexec/revnetgroup/ |
H A D | hash.h | 38 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-11-stable/sys/contrib/ck/include/spinlock/ |
H A D | mcs.h | 40 struct ck_spinlock_mcs *next; member in struct:ck_spinlock_mcs 63 node->next = NULL; 92 node->next = NULL; 106 ck_pr_store_ptr(&previous->next, node); 119 struct ck_spinlock_mcs *next; local 123 next = ck_pr_load_ptr(&node->next); 124 if (next == NULL) { 142 next = ck_pr_load_ptr(&node->next); [all...] |
/freebsd-11-stable/usr.bin/m4/ |
H A D | tokenizer.l | 87 char *next; 92 base = strtol(yytext+2, &next, 0); 93 if (base > 36 || next == NULL) { 96 next++; 97 while (*next != 0) { 98 if (*next >= '0' && *next <= '9') 99 d = *next - '0'; 100 else if (*next >= 'a' && *next < [all...] |
/freebsd-11-stable/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-11-stable/contrib/bmake/lst.lib/ |
H A D | lstForEachFrom.c | 78 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-11-stable/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-11-stable/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-11-stable/sys/compat/linuxkpi/common/include/linux/ |
H A D | rculist.h | 39 #define list_next_rcu(head) (*((struct list_head **)(&(head)->next))) 43 for (pos = list_entry_rcu((head)->next, typeof(*(pos)), member); \ 45 pos = list_entry_rcu((pos)->member.next, typeof(*(pos)), member)) 49 struct list_head *next) 51 new->next = next; 54 next->prev = new; 60 linux_list_add_rcu(new, head, head->next); 70 __list_del_rcu(struct list_head *prev, struct list_head *next) argument 72 next 48 linux_list_add_rcu(struct list_head *new, struct list_head *prev, struct list_head *next) argument 73 rcu_assign_pointer(list_next_rcu(prev), next); local 112 struct hlist_node *next = n->next; local [all...] |
H A D | list.h | 85 struct list_head *next; member in struct:list_head 94 list->next = list->prev = list; 101 return (head->next == head); 107 struct list_head *next = head->next; local 109 return ((next == head) && (next == head->prev)); 113 __list_del(struct list_head *prev, struct list_head *next) argument 115 next->prev = prev; 116 WRITE_ONCE(prev->next, nex 150 linux_list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument 278 linux_list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) argument 333 struct hlist_node *next, **pprev; member in struct:hlist_node 390 hlist_add_before(struct hlist_node *n, struct hlist_node *next) argument [all...] |
/freebsd-11-stable/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-11-stable/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; 150 KeyDataT *next = NULL; local 260 next = NULL; 263 next = emalloc(sizeof(KeyDataT) + len); 264 next->keyacclist = NULL; 265 next->keyid = keyno; 266 next->keytype = keytype; 267 next [all...] |
/freebsd-11-stable/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-11-stable/contrib/subversion/subversion/libsvn_fs_base/ |
H A D | key-gen.c | 40 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-11-stable/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-11-stable/contrib/mdocml/ |
H A D | mandoc_xr.h | 19 struct mandoc_xr *next; member in struct:mandoc_xr
|
/freebsd-11-stable/contrib/subversion/subversion/libsvn_diff/ |
H A D | lcs.c | 104 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-11-stable/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-11-stable/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...] |