/osnet-11/usr/src/lib/libipadm/common/ |
H A D | ipadm_if.c | 328 * to the next interface. 825 * to the next one. If this approach becomes too slow, we 2502 ipadm_addr_info_t *curr, *next, *last = NULL; local 2509 for (curr = *downaddrs; curr != NULL; curr = next) { 2510 next = IA_NEXT(curr); 2538 *downaddrs = next;
|
/osnet-11/usr/src/lib/fm/libfmd_snmp/common/ |
H A D | module.c | 508 "index %lu; trying next column\n", index)); 669 for (request = requests; request; request = request->next) {
|
H A D | resource.c | 521 "index %lu; trying next column\n", index)); 690 for (request = requests; request; request = request->next) {
|
/osnet-11/usr/src/grub/grub2/grub-core/video/readers/ |
H A D | png.c | 895 .next = 0
|
/osnet-11/usr/src/grub/grub2/grub-core/video/ |
H A D | sm712.c | 769 .next = 0
|
/osnet-11/usr/src/lib/libast/common/vmalloc/ |
H A D | vmhdr.h | 296 { Block_t* link; /* next in link list */ 365 Seg_t* next; /* next segment */ member in struct:_seg_s
|
/osnet-11/usr/src/lib/libc/capabilities/sun4v-hwcap3/common/ |
H A D | memset.s | 373 inc %o5 ! next byte
|
/osnet-11/usr/src/lib/lvm/libmeta/common/ |
H A D | meta_namespace.c | 708 for (p = nlp; (p != NULL); p = p->next) {
|
H A D | meta_set_hst.c | 334 nl2 = nl2->next; 751 /* Something wrong, will pick this up in next loop */ 878 /* Something wrong, will pick this up in next loop */ 1581 * This is done before the next loop, so that 1783 /* Drive already added, skip to next node */ 1968 for (sn = dnp->side_names; sn->next != NULL; sn = sn->next) 1970 sn_next = &sn->next; 2386 nl2 = nl2->next; 2707 /* Something wrong, will pick this up in next loo [all...] |
/osnet-11/usr/src/lib/storage/liba5k/common/ |
H A D | diag.c | 83 for (; dl != NULL; dl = dl->next) {
|
/osnet-11/usr/src/lib/libldap5/sources/ldap/common/ |
H A D | llib-lldap | 444 char *str_getline(char **next);
|
/osnet-11/usr/src/lib/nsswitch/files/common/ |
H A D | files_common.c | 49 * Open either the firsts or the next file in the directory 347 for (linem = *plinem; linem != NULL; linem = linem->next) { 364 linem->next = *plinem; 873 * the same keys next to each other in the hash table. 1050 for (f = 2; f * f <= line; f++) { /* find next largest prime */ 1247 * and and we continue with the next entry in the file.
|
/osnet-11/usr/src/lib/pkcs11/pkcs11_tpm/common/ |
H A D | tpmtok_int.h | 119 struct _DL_NODE *next; member in struct:_DL_NODE 392 struct mech_list_item *next; member in struct:mech_list_item
|
/osnet-11/usr/src/cmd/hal/hald/ |
H A D | hald_dbus.c | 861 for (iter = hal_property_get_strlist (p); iter != NULL; iter = iter->next) { 2228 struct PendingUpdate_s *next; /**< next update or #NULL */ member in struct:PendingUpdate_s 2271 pu_iter_next = pu_iter->next; 2279 for (pu_iter2 = pu_iter; pu_iter2 != NULL; pu_iter2 = pu_iter2->next) { 2302 pu_iter2 = pu_iter2->next) { 2379 pu->next = pending_updates_head; 3243 HAL_INFO (("Execing next method in queue"));
|
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/ |
H A D | toke.c | 19 * The main routine is yylex(), which returns the next token. 109 * lexer for the next token. They all take an argument. 601 /* reset variables for next time we lex */ 700 * - if we have a next token, then it's a list operator [why?] 701 * - if the next thing is an opening paren, then it's a function 728 * When the lexer realizes it knows the next token (for instance, 730 * to know what token to return the next time the lexer is called. Caller 749 * When the lexer knows the next thing is a word (for instance, it has 750 * just seen -> and it knows that the next char is a word char, then 751 * it calls S_force_word to stick the next wor 8018 char *next = pos; local [all...] |
H A D | pp_pack.c | 369 * locates next template code and count 1947 /* Look ahead for next symbol. Do we have code/code? */ 2448 NV next = Perl_floor(anv / 128); 2451 *--in = (unsigned char)(anv - (next * 128)) | 0x80; 2452 anv = next;
|
H A D | hv.c | 1165 /* We're going to trash this HE's next pointer when we chain it 1166 into the new hash below, so store where we go next. */ 1167 HE *next = HeNEXT(entry); local 1195 entry = next; 1661 to free the entry on the next call to C<hv_iternext>, so you must not discard 1722 /* force key to stay around until next time */ 1757 /* OK. Come to the end of the current list. Grab the next one. */ 1761 /* There is no next one. End of the hash. */ 1770 Try the next. */
|
/osnet-11/usr/src/lib/libproc/common/ |
H A D | Pcontrol.c | 391 * wait for it to stop on entry to the next exec(). 2237 * and leave the process stopped at the next instruction. 2432 * the watchpoint, and then leave the LWP stopped at the next instruction. 3510 * and leave the LWP stopped at the next instruction. 3546 * the watchpoint, and then leave the LWP stopped at the next instruction. 3669 size_t next = P->map_alloc ? P->map_alloc * 2 : 16; local 3672 next * sizeof (map_info_t))) == NULL) 3675 P->map_alloc = next;
|
/osnet-11/usr/src/lib/libscf/common/ |
H A D | midlevel.c | 2213 * If last isn't NULL, then return the next prop in the property group, 2555 pv_ptr_node = pv_ptr_node->next; 2628 pv_ptr_ll_end->next = pv_ptr_node; 2960 for (; pv_ptr_node != NULL; pv_ptr_node = pv_ptr_node->next) {
|
/osnet-11/usr/src/lib/libshell/common/sh/ |
H A D | nvtype.c | 637 for(fp=np->nvfun;fp;fp=fp->next) 1154 for(fp=nq->nvfun; fp; fp = fp->next) 1273 for(fp=np->nvfun; fp; fp=fp->next)
|
/osnet-11/usr/src/cmd/sendmail/src/ |
H A D | main.c | 1010 optarg++; /* skip '!' for next switch */ 2869 ENVELOPE *next; local 2884 next = e->e_sibling; 2889 e->e_sibling = next;
|
H A D | map.c | 3706 /* server disappeared, try reopen on next search */ 7164 struct ns_map_list *next; member in struct:ns_map_list 7175 for (ns_map = ns_maps; ns_map != NULL; ns_map = ns_map->next) 7188 ns_map->next = ns_maps; 7709 /* couldn't connect.... try next address */ 7719 /* try next address */ 7851 MAP *next; local 7859 next = smap->socket_map_next; 7861 smap = next;
|
/osnet-11/usr/src/lib/libast/common/string/ |
H A D | ccmap.c | 615 Map_t* next; member in struct:Map_s 662 for (map = maps; map; map = map->next) 675 map->next = maps;
|
/osnet-11/usr/src/lib/gss_mechs/mech_krb5/krb5/unicode/ |
H A D | ure.c | 395 * Encountered a comma, so select the next character property flag 551 unsigned int next : 8; member in struct:__anon1046 707 tp = cclass_trie + tp->next; 852 * add it as the range start. Otherwise, save it in case the next 974 * through to the next case. 1085 * Build the next symbol so we can test to see if it is already in the
|
/osnet-11/usr/src/lib/nsswitch/ldap/common/ |
H A D | getgrent.c | 84 * The next two filters are used to retrieve entries from AD. Both cause 161 * Where in the buffer to add the next data item. The first 227 * indicate a no sorting search should be done next 232 * Where in the buffer to add the next data item. The first 1225 /* next try searching group */ 1365 * go pass it to process the next set of data, 2071 i++, curEntry = curEntry->next) { 2328 i++, curEntry = curEntry->next) {
|