/freebsd-current/contrib/llvm-project/openmp/runtime/src/ |
H A D | kmp_settings.cpp | 676 const char *next; local 684 next = buf; 685 SKIP_DIGITS(next); 688 buf = next; 695 next = buf; 696 if (*buf == '\0' || __kmp_match_str("ms", buf, &next)) { 701 } else if (__kmp_match_str("us", buf, &next)) { 705 } else if (__kmp_match_str("infinite", buf, &next) || 706 __kmp_match_str("infinity", buf, &next)) { 1118 const char *next local 2038 const char *next = scan; local 2217 char *next = NULL; // end of token / start of next. local 2736 const char *next = NULL; local 2799 const char *next; local 2898 const char *next; local 2930 const char *next = scan; local 3052 const char *next = scan; local 3488 const char *next; local 3704 const char *next, *scan, *start; local 4839 const char *next = value; local 4940 const char *next = value; local [all...] |
/freebsd-current/contrib/wpa/src/ap/ |
H A D | vlan_full.c | 43 struct dynamic_iface *next; member in struct:dynamic_iface 53 struct dynamic_iface *next, **dynamic_ifaces; local 59 for (next = *dynamic_ifaces; next; next = next->next) { 60 if (os_strcmp(ifname, next->ifname) == 0) 64 if (next) { 65 next 89 struct dynamic_iface *next, *prev = NULL, **dynamic_ifaces; local [all...] |
/freebsd-current/crypto/heimdal/base/ |
H A D | dict.c | 40 struct hashentry *next; member in struct:hashentry 58 i = g->next; 154 for (p = dict->tab[v % dict->size]; p != NULL; p = p->next) 213 h->next = *tabptr; 216 if (h->next) 217 h->next->prev = &h->next; 241 if ((*(h->prev) = h->next) != NULL) 242 h->next->prev = h->prev; 261 for (g = *h; g; g = g->next) [all...] |
/freebsd-current/contrib/ofed/libmlx4/ |
H A D | dbrec.c | 42 struct mlx4_db_page *prev, *next; member in struct:mlx4_db_page 79 page->next = context->db_list[type]; 81 if (page->next) 82 page->next->prev = page; 95 for (page = context->db_list[type]; page; page = page->next) 127 for (page = context->db_list[type]; page; page = page->next) 139 page->prev->next = page->next; 141 context->db_list[type] = page->next; 142 if (page->next) [all...] |
/freebsd-current/sys/contrib/ck/include/ |
H A D | ck_brlock.h | 50 struct ck_brlock_reader *next; member in struct:ck_brlock_reader 89 for (cursor = br->readers; cursor != NULL; cursor = cursor->next) { 126 for (cursor = br->readers; cursor != NULL; cursor = cursor->next) { 151 reader->next = ck_pr_load_ptr(&br->readers); 152 if (reader->next != NULL) 153 reader->next->previous = reader; 166 if (reader->next != NULL) 167 reader->next->previous = reader->previous; 170 reader->previous->next = reader->next; [all...] |
/freebsd-current/sys/contrib/openzfs/include/os/linux/spl/sys/ |
H A D | list.h | 39 * the name of the list_next/list_prev pointers to next/prev respectively. 43 * the next/prev pointers are set to LIST_POISON1 and LIST_POISON2 67 node->next = LIST_POISON1; 125 list_node_t *head = list->list_head.next; 150 return (list_object(list, list->list_head.next)); 167 if (node->next != &list->list_head) 168 return (list_object(list, node->next)); 187 EQUIV(node->next == LIST_POISON1, node->prev == LIST_POISON2); 188 return (node->next != LIST_POISON1); 202 new_node->next [all...] |
/freebsd-current/usr.sbin/ppp/ |
H A D | timer.c | 105 for (t = TimerList; t; t = t->next) { 122 tp->next = t; 124 pt->next = tp; 142 * A RUNNING timer must be removed from TimerList (->next list). 143 * A STOPPED timer isn't in any list, but may have a bogus [e]next field. 151 for (t = TimerList; t != tp && t != NULL; t = t->next) 156 pt->next = t->next; 158 TimerList = t->next; 162 if (t->next) { 192 struct pppTimer *tp, *exp, *next; local [all...] |
H A D | timer.h | 41 struct pppTimer *next; /* Link to next timer */ member in struct:pppTimer 42 struct pppTimer *enext; /* Link to next expired timer */
|
/freebsd-current/contrib/ofed/opensm/opensm/ |
H A D | st.c | 54 st_table_entry *next; member in struct:st_table_entry 236 register st_table_entry *ptr, *next; local 242 next = ptr->next; 244 ptr = next; 266 while (PTR_NOT_EQUAL(table, ptr->next, hash_val, key)) {\ 267 ptr = ptr->next;\ 269 ptr = ptr->next;\ 304 entry->next = table->bins[bin_pos];\ 337 register st_table_entry *ptr, *next, **new_bin local [all...] |
/freebsd-current/sys/contrib/openzfs/lib/libshare/os/linux/ |
H A D | nfs.c | 140 char *host_dup, *host, *next, *v6Literal; local 174 next = NULL; 176 next = strchr(v6Literal + 2, ':'); 177 if (next == NULL) { 185 cidr_len = next - v6Literal - 1; 190 next++; 194 next = v6Literal + 2; 200 next = strchr(host, ':'); 201 if (next != NULL) { 202 *next 323 char *host, *val_dup, *literal, *next; local [all...] |
/freebsd-current/sbin/rcorder/ |
H A D | rcorder.c | 108 provnode *next, *last; member in struct:provnode 114 f_provnode *next; member in struct:f_provnode 119 f_reqnode *next; member in struct:f_reqnode 124 strnodelist *next; member in struct:strnodelist 131 filenode *next, *last; member in struct:filenode 246 ent->next = *listp; 277 temp->next = fn_head->next; 278 if (temp->next != NULL) 279 temp->next [all...] |
/freebsd-current/sbin/dhclient/ |
H A D | dispatch.c | 160 for (l = protocols; l; l = l->next) 178 timeouts = timeouts->next; 180 t->next = free_timeouts; 200 for (i = 0, l = protocols; l; l = l->next) { 231 for (l = protocols; l; l = l->next) { 365 for (q = timeouts; q; q = q->next) { 368 t->next = q->next; 370 timeouts = q->next; 381 free_timeouts = q->next; [all...] |
/freebsd-current/contrib/ncurses/ncurses/base/ |
H A D | new_pair.c | 89 while (list[pair].next != base) { 91 pair = list[pair].next; 116 n, n == pair ? '@' : ':', list[n].next, list[n].prev); 166 int next = list[pair].next; local 169 if (list[prev].next == pair && 170 list[next].prev == pair) { 171 list[prev].next = next; 172 list[next] 196 _nc_reset_color_pair(SCREEN *sp, int pair, colorpair_t * next) argument [all...] |
/freebsd-current/contrib/llvm-project/compiler-rt/lib/stats/ |
H A D | stats.h | 31 StatModule *next; member in struct:__sanitizer::StatModule
|
/freebsd-current/contrib/wpa/wpa_supplicant/ |
H A D | blacklist.h | 13 struct wpa_blacklist *next; member in struct:wpa_blacklist
|
/freebsd-current/crypto/heimdal/lib/sl/ |
H A D | slc.h | 47 struct assignment *next; member in struct:assignment
|
/freebsd-current/contrib/mandoc/ |
H A D | tbl.h | 53 struct tbl_cell *next; /* Layout cell to the right. */ member in struct:tbl_cell 74 struct tbl_row *next; /* Layout row below. */ member in struct:tbl_row 94 struct tbl_dat *next; /* Data cell to the right. */ member in struct:tbl_dat 115 struct tbl_span *next; /* Data row below. */ member in struct:tbl_span
|
/freebsd-current/crypto/openssl/crypto/lhash/ |
H A D | lhash_local.h | 15 struct lhash_node_st *next; member in struct:lhash_node_st
|
/freebsd-current/lib/lib80211/ |
H A D | lib80211_regdomain.h | 43 LIST_ENTRY(freqband) next; member in struct:freqband 60 LIST_ENTRY(netband) next; member in struct:netband 79 LIST_ENTRY(regdomain) next; member in struct:regdomain 89 LIST_ENTRY(country) next; member in struct:country
|
/freebsd-current/sys/dev/qat/qat_api/common/include/ |
H A D | lac_list.h | 28 struct sal_list_s *next; member in struct:sal_list_s 68 * to point to list->next if head_list is 73 * (*pre_list)->next is updated 74 * by the function to point to list->next 111 * Returns next element in list structure. 114 * Returns next associated with sal_list_t structure. 117 * @retval void* next member of list structure.
|
/freebsd-current/usr.bin/mkimg/ |
H A D | format.h | 31 struct mkimg_format *next; member in struct:mkimg_format
|
/freebsd-current/contrib/xz/src/liblzma/lzma/ |
H A D | lzma2_encoder.h | 33 lzma_next_coder *next, const lzma_allocator *allocator,
|
H A D | lzma2_decoder.h | 18 extern lzma_ret lzma_lzma2_decoder_init(lzma_next_coder *next,
|
/freebsd-current/contrib/ntp/ntpd/ |
H A D | ntp_clockdev.c | 41 DeviceInfoT *next; /* link to next record */ member in struct:DeviceInfoS 87 InfoList = item->next; 110 *ppl = item->next; 114 ppl = &item->next; 139 for (item = InfoList; NULL != item; item = item->next) 159 item->next = InfoList; 182 for (item = InfoList; NULL != item; item = item->next)
|
/freebsd-current/contrib/googletest/googletest/samples/ |
H A D | sample3-inl.h | 44 // type E and a pointer to the next node. 53 // Gets the next node in the queue. 54 QueueNode* next() { return next_; } function in class:QueueNode 55 const QueueNode* next() const { return next_; } function in class:QueueNode 58 // Creates a node with a given element value. The next pointer is 85 QueueNode<E>* next = node->next(); local 88 node = next; 90 next = node->next(); [all...] |