/osnet-11/usr/src/lib/libndr/common/ |
H A D | libndr.h | 227 struct ndr_binding *next; member in struct:ndr_binding 272 * Number of bytes required to align SIZE on the next dword/4-byte 356 * next ----------------------+ | 373 char *next; member in struct:ndr_heap
|
/osnet-11/usr/src/lib/libnisdb/ |
H A D | ldap_op.c | 402 void *next; member in struct:__anon1943 886 for (lc = ldapCon; lc != 0; lc = lc->next) { 1063 for (tmp = ldapCon; tmp->next != 0; 1064 tmp = tmp->next); 1065 tmp->next = lc; 1095 for (lc = list; lc != 0; lc = lc->next) { 1211 for (tmp = ldapReferralCon; tmp->next != 0; 1212 tmp = tmp->next) {} 1213 tmp->next = lc; 1257 for (lc = ldapCon; lc != 0; lc = lc->next) { [all...] |
/osnet-11/usr/src/lib/libnsl/rpc/ |
H A D | svc.c | 136 struct _svc_user_fd_node *next; member in struct:__anon2028 158 #define LIST_ISEMPTY(l) ((_svc_user_fd_node *) &(l.lnk) == l.lnk.next) 160 (l.lnk.previous = l.lnk.next = (_svc_user_fd_node *) &(l.lnk)) 293 node = svc_userfds[fd].lnk.next; 307 _svc_user_fd_node *next = node->lnk.next; local 331 node = next; 366 node = svc_userfds[one_fd].lnk.next; 370 node = node->lnk.next; 397 one_node = svc_userfds[fd].lnk.next; 506 _svc_user_fd_node* next; local [all...] |
/osnet-11/usr/src/lib/libparted/common/libparted/labels/ |
H A D | rdb.c | 94 struct AmigaIds *next; member in struct:AmigaIds 104 newid->next = ids; 110 struct AmigaIds *current, *next; local 112 for (current = ids; current != NULL; current = next) { 113 next = current->next; 121 for (current = ids; current != NULL; current = current->next) { 265 uint32_t pb_Next; /* Block number of the next PartitionBlock */ 313 uint32_t lk_Next; /* Block number of the next PartitionBlock */ 320 uint32_t lk2_Next; /* Block number of the next PartitionBloc 563 PedSector next; local 619 PedPartition *next; local [all...] |
/osnet-11/usr/src/lib/libpool/common/ |
H A D | pool_kernel.c | 583 pool_set_xref_t *current, *prev, *next; local 586 current = next) { 596 next = current->psx_next; 2662 * Return the next element in a result set.
|
H A D | pool_xml.c | 282 * Get the next ID for this configuration 1121 for (sib = node->children; sib != NULL; sib = sib->next) { 1768 * Return the next element in a result set. 1774 pool_elem_t *next; local 1781 next = 1783 return (next);
|
/osnet-11/usr/src/lib/libpp/common/ |
H A D | pp.h | 351 struct ppdirs* next; /* next in list */ member in struct:ppdirs 393 struct ppdirs* stddirs; /* next is the <...> dir list */ \
|
/osnet-11/usr/src/lib/libcmd/common/ |
H A D | find.c | 201 Node_t* next; member in struct:Node_s 469 " Sizes are rounded to the next unit.", 892 np->next = 0; 973 oldnp->next = 0; 988 np->next = np + i; 997 oldnp->next = 0; 1318 oldnp->next = ++np; 1329 oldnp->next = 0; 1397 np = np->next; 1653 np = np->next; [all...] |
/osnet-11/usr/src/lib/libdevinfo/ |
H A D | devfsinfo.c | 96 struct name_list *next; member in struct:name_list 372 cur->next = new; 404 devfs_free_all_prom_names(paths->next); 542 /* skip to next if bootfile unreadable */ 547 /* skip to next if not Solaris boot loader */ 747 /* skip to next if bootfile unreadable */ 758 /* skip to next if logical drive unreadable */ 1578 /* get the next list */ 1585 list = list->next; 1599 list = list->next; 2260 struct name_list *next = list; local [all...] |
H A D | devfsmap.c | 124 struct conf_entry *next; member in struct:conf_entry 157 * Leave NEWLINE as the next character. 188 /* return the next token from the given driver.conf file, or -1 on error */ 382 * the next (i.e. escaped) character. 429 struct conf_entry *confent, *next; local 431 for (confent = confent_list; confent != NULL; confent = next) { 432 next = confent->next; 438 * Parse the next entry from the driver.conf file and return in the form of 705 tail->next [all...] |
/osnet-11/usr/src/lib/libdladm/common/ |
H A D | usage.c | 535 net_time_entry_t *next = head; local 547 while (next != NULL) { 549 &next->my_time_stat->net_stat_time) != NET_TIME_LESSER) { 550 *lasttime = next->my_time_stat->net_stat_ctime; 551 next = next->net_time_entry_next; 554 *start = next; 908 net_entry_t *next; local 942 next = head->net_entry_next; 955 head = next; [all...] |
/osnet-11/usr/src/lib/libdlpi/common/ |
H A D | libdlpi.c | 248 dlpi_notifyent_t *next, *dnp; local 251 for (dnp = dip->dli_notifylistp; dnp != NULL; dnp = next) { 252 next = dnp->dln_next;
|
/osnet-11/usr/src/lib/libdtrace/common/ |
H A D | dt_aggregate.c | 49 * Rotate the hash by LSHIFT bits, then XOR the next word. 492 * next record; we simply ignore it. 1302 dt_ahashent_t *h, *next; local 1305 for (h = hash->dtah_all; h != NULL; h = next) { 1308 * entry; we need to load the next hash entry before calling 1311 next = h->dtahe_nextall; 1934 dt_ahashent_t *h, *next; local 1943 for (h = hash->dtah_all; h != NULL; h = next) { 1944 next = h->dtahe_nextall;
|
H A D | dt_consume.c | 198 * subtrahend right by one bit for the next comparison. 252 * bring down the next two-digit group. 257 * The value x is the next digit in the square root. 267 * 9 27 (Subtract and bring down the next group.) 268 * 146 8 76 (2 * 7 * 10 * 6 + 6^2 == 876 => 6 is the next digit in 270 * 51 34 (Subtract and bring down the next group.) 271 * 1523 45 69 (2 * 76 * 10 * 3 + 3^2 == 4569 => 3 is the next digit in 287 * 101 1 01 (1 << 2 + 1 == 101 < 1001 => next bit is 1) 290 * 1101 11 01 (11 << 2 + 1 == 1101 < 10010 => next bit is 1) 312 * Bring down the next pai 388 dtrace_epid_t next, id = epd->dtepd_epid; local [all...] |
/osnet-11/usr/src/lib/libfru/libfru/ |
H A D | libfru.cc | 92 struct cont_lock *next; member in struct:cont_lock 187 while (prev->next != NULL) { 188 prev = prev->next; 190 prev->next = lock; 205 which = which->next; 223 lock->next = NULL; 307 cur = cur->next; 669 fru_nodehdl_t next; local 698 if ((status = fru_get_child(node, &next)) == FRU_SUCCESS) 699 status = fru_walk_tree(next, pat [all...] |
/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/topo/libtopo/common/ |
H A D | hc.c | 728 * we can't just search for the next slash after the equal sign 730 * an equal sign for the next pair and work our way back to the 1443 * Move on to the next component in the hc-list 2084 char *next; local 2090 next = strchr(fmri + 5, '/'); 2091 if (next) 2092 h += topo_fmri_strhash_one(next, strlen(next));
|
/osnet-11/usr/src/lib/gss_mechs/mech_krb5/include/krb5/ |
H A D | kdb.h | 242 struct _krb5_actkvno_node *next; member in struct:_krb5_actkvno_node 248 struct _krb5_mkey_aux_node *next; member in struct:_krb5_mkey_aux_node 256 struct _krb5_keylist_node *next; member in struct:_krb5_keylist_node
|
/osnet-11/usr/src/lib/gss_mechs/mech_krb5/krb5/ccache/ |
H A D | cc_file.c | 335 struct fcc_set *next; member in struct:fcc_set 1664 for (fccsp = &fccs; *fccsp != NULL; fccsp = &(*fccsp)->next) 1674 *fccsp = (*fccsp)->next; 1879 for (setptr = fccs; setptr; setptr = setptr->next) { 1937 setptr->next = fccs; 2030 * Fills in creds with the "next" credentals structure from the cache 2036 * The cursor is updated for the next call to krb5_fcc_next_cred. 2266 setptr->next = fccs; 2560 cdata->cur = cdata->cur->next;
|
/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/hal/libhal/common/ |
H A D | libhal.c | 216 LibHalProperty *next; /**< Next property or NULL if this is member in struct:LibHalProperty_s 474 p->next = NULL; 480 p_last->next = p; 537 q = p->next; 561 for (p = set->properties_head; p != NULL; p = p->next) 575 for (p = set->properties_head; p != NULL; p = p->next) 784 * Advance iterator to next property. 790 iter->cur_prop = iter->cur_prop->next; 3733 LibHalChangeSetElement *next; member in struct:LibHalChangeSetElement_s 3781 elem->next [all...] |
/osnet-11/usr/src/lib/hal/libhal-storage/common/ |
H A D | libhal-storage.c | 63 struct IconMappingEntry_s *next; member in struct:IconMappingEntry_s 92 j = i->next; 106 for (i = policy->icon_mappings; i != NULL; i = i->next) { 119 i->next = policy->icon_mappings; 143 for (i = policy->icon_mappings; i != NULL; i = i->next) {
|
/osnet-11/usr/src/lib/krb5/kdb/ |
H A D | kdb5.c | 75 krb5_keylist_node *cur, *next; local 77 for (cur = mkey_list; cur != NULL; cur = next) { 78 next = cur->next; 141 temp = temp->next; 154 temp = temp->next; 166 temp = temp->next; 462 curr_elt = curr_elt->next; 472 prev_elt->next = *lib; 510 lib_list = lib->next; /* firs 880 krb5_tl_data *prev, *curr, *next; local [all...] |
/osnet-11/usr/src/grub/grub2/grub-core/bus/usb/ |
H A D | ohci.c | 59 /* next values are not for OHCI HW */ 60 volatile struct grub_ohci_td *link_td; /* pointer to next free/chained TD 101 struct grub_ohci *next; member in struct:grub_ohci 451 o->next = ohci; 485 for (o = ohci; o; o = o->next) 539 /* Currently we simply take next ED in array, no allocation 560 o->td_free = (grub_ohci_td_t)ret->link_td; /* Advance to next free TD in chain */ 768 /* Allocate next TD */ 858 * : td_head = next TD after TD with error 915 * ED has skip bit set and halted or empty or after next SO [all...] |
/osnet-11/usr/src/grub/grub2/grub-core/fs/ |
H A D | btrfs.c | 322 next (struct grub_btrfs_data *data, function 1440 r = next (data, &desc, &elemaddr, &elemsize, &key_out); 1499 r = next (data, &desc, &elemaddr, &elemsize, &key_out);
|