/illumos-gate/usr/src/uts/sparc/ml/ |
H A D | fd_asm.s | 73 ! Traverse the list of controllers until we find the first 79 ldn [Fdc], Fdc ! get the first in the list... 208 ! wait!!! should we check rqm first??? ABSOLUTELY YES!!!!
|
H A D | ip_ocsum.s | 65 ! Do first halfwords until 32-byte aligned
|
/illumos-gate/usr/src/lib/nsswitch/files/common/ |
H A D | getexecattr.c | 108 char *first; local 238 for (first = instr; isspace(*first); first++) 240 if (*first == '\0') 250 linelen = last - first + 1; 251 if (first != instr) 252 instr = first;
|
/illumos-gate/usr/src/cmd/cmd-inet/usr.sbin/snoop/ |
H A D | fw.h | 51 Op_arg_item _TKFAR *first; member in struct:Op_row_link 58 Op_row_link _TKFAR *first; member in struct:Op_arg
|
/illumos-gate/usr/src/cmd/mdb/sun4v/modules/errh/ |
H A D | errh.c | 44 uintptr_t current, first; local 53 if (mdb_readvar(&first, "cpu_list") == -1) { 61 current = first; 76 } while ((current = (uintptr_t)cpu.cpu_next) != first); 87 uintptr_t current, first; local 96 if (mdb_readvar(&first, "cpu_list") == -1) { 104 current = first; 119 } while ((current = (uintptr_t)cpu.cpu_next) != first);
|
/illumos-gate/usr/src/cmd/truss/ |
H A D | htbl.c | 77 tmp = cur->first; 131 tmp = cur->first; 157 new->next = cur->first; 162 cur->first = new; 189 tmp = cur->first; 238 tmp = cur->first;
|
/illumos-gate/usr/src/cmd/mandoc/ |
H A D | tree.c | 44 print_mdoc(mdoc->first->child, 0); 51 print_man(man->first->child, 0); 175 print_box(n->eqn->root->first, indent + 4); 260 print_box(n->eqn->root->first, indent + 4); 330 print_box(ep->first, indent + 4); 354 for (dp = sp->first; dp; dp = dp->next) {
|
/illumos-gate/usr/src/lib/libshell/common/sh/ |
H A D | string.c | 56 register int first; local 60 if(sp==0 || (first= *sp)==0) 63 while((c= *tp->sh_name) && (CC_NATIVE!=CC_ASCII || c <= first)) 65 if(first == c && strcmp(sp,tp->sh_name)==0) 80 register int first; local 97 if((first= *sp)==0) 108 if(first == c) 199 /* skip to first character which matches start of oldsp */
|
H A D | lex.c | 97 char *first; member in struct:lexdata 143 off_t off = (fcseek(0)-(type+1))-(lp->lexd.first?lp->lexd.first:fcfirst()); 145 if(lp->lexd.first) 147 off = (fcseek(0)-(type+1)) - lp->lexd.first; 148 r=kiaentity(lp,lp->lexd.first+lp->lexd.kiaoff+type,off-lp->lexd.kiaoff,'v',-1,-1,lp->current,'v',0,""); 206 if(lp->lexd.first) 208 size -= (lp->lexd.first-(char*)buff); 209 buff = lp->lexd.first; 219 lp->lexd.first [all...] |
/illumos-gate/usr/src/lib/libcurses/screen/ |
H A D | tgetch.c | 161 fprintf(outf, "read from %d returns %d chars, first %o\n", 197 int first, collapse = 1; local 212 first = key; 247 key = (first = blockpeek = 306 if (key != first) { 324 for (j = i--; j > first; ) 326 kp[first] = savekey; 328 *inp = kp[first]->_keyval; 363 /* the first character identifies what button is involved (1,2,or 3) */ 364 /* if the first characte [all...] |
/illumos-gate/usr/src/cmd/nscd/ |
H A D | nscd_nswstate.c | 124 s = base->nsw_state.first; 126 s = base->nsw_state_thr.first; 424 * is the first time around for a passwd, shadow, group, 448 /* Wait first if it's being created. */ 506 * If list is not empty, return the first one on list. 528 _nscd_logit(me, "first nsw state on list = %p\n", 529 ctrl_p->first); 536 if (ctrl_p->first == NULL && ctrl_p->allocated == ctrl_p->max) 561 ctrl_p->first != NULL) 566 if (ctrl_p->first ! [all...] |
/illumos-gate/usr/src/cmd/find/ |
H A D | find.c | 181 union Item first; member in struct:Node 342 topnode->first.np = savenode; 353 * If -H is specified, it means we walk the first 486 np->first.np = topnode; 496 np->first.np = topnode; 541 np->first.l = 0L; 542 np->first.ll = 0LL; 558 np->first.ll = atoll(b); 568 np->first.l = atol(b); 599 np->first [all...] |
/illumos-gate/usr/src/lib/pkcs11/libpkcs11/common/ |
H A D | metaSessionManager.c | 301 * activated, it must be deactivated first. 331 * maximum threshold MAX_SESSION_TO_BE_FREED, it will free the first 343 if (ses_delay_freed.first == NULL) { 345 ses_delay_freed.first = sp; 353 * Free the first session in the list only if 357 tmp = ses_delay_freed.first->next; 358 free(ses_delay_freed.first); 359 ses_delay_freed.first = tmp;
|
/illumos-gate/usr/src/cmd/cmd-crypto/cryptoadm/ |
H A D | adm_util.c | 42 char *first, *last; local 54 first = name; 55 while (isspace(*first)) /* nuke leading whitespace */ 56 first++; 57 (void) strlcpy(pres->name, first, sizeof (pres->name)); 168 * the end. The resulting file will be saved in the temp file first.
|
/illumos-gate/usr/src/cmd/sgs/size/common/ |
H A D | process.c | 83 * size of first, second, third number and total size 86 GElf_Xword first; local 103 * Otherwise, process sections. For the default case, the first number 132 first = second = third = totsize = 0; 161 first += shdr.sh_size; 189 totsize = first + second + third; 191 first, second, third, totsize); 207 * case, the first number is the file size of all nonwritable segments
|
/illumos-gate/usr/src/uts/common/vm/ |
H A D | vm_usage.c | 42 * The vm_getusage() calculation is implemented so that the first thread 665 end, char type, vmu_bound_t **first, vmu_bound_t **last) 674 *first = *last = NULL; 684 *first = walker; 694 *first = walker; 700 * At this point, if *first is still NULL, then we 708 if (*first == NULL) { 713 *first = tmp; 717 *first = *last = tmp; 723 ASSERT(*first ! 664 vmu_insert_lookup_object_bounds(vmu_object_t *ro, pgcnt_t start, pgcnt_t end, char type, vmu_bound_t **first, vmu_bound_t **last) argument 799 vmu_update_bounds(avl_tree_t *tree, vmu_bound_t **first, vmu_bound_t **last, avl_tree_t *new_tree, vmu_bound_t *new_first, vmu_bound_t *new_last) argument 858 vmu_merge_bounds(avl_tree_t *tree, vmu_bound_t **first, vmu_bound_t **last) argument 896 vmu_amp_update_incore_bounds(avl_tree_t *tree, struct anon_map *amp, vmu_bound_t **first, vmu_bound_t **last, boolean_t incore) argument 991 vmu_vnode_update_incore_bounds(avl_tree_t *tree, vnode_t *vnode, vmu_bound_t **first, vmu_bound_t **last) argument 1093 vmu_bound_t *first = NULL; local 1378 shared_object->vmo_key, &first, local 1384 shared_object->vmo_key, &first, local [all...] |
/illumos-gate/usr/src/lib/libdtrace_jni/java/src/org/opensolaris/os/dtrace/ |
H A D | Aggregation.java | 365 boolean first = true; 367 if (first) { 368 first = false;
|
/illumos-gate/usr/src/cmd/picl/plugins/sun4u/snowbird/frutree/ |
H A D | picllibdevinfo.c | 71 port_info_t *first; member in struct:__anon1209 86 nextptr = listptr->first; 125 if (list->first == NULL) { 160 nextptr = list->first; 195 port_info = list->first; 251 if (devp->first == NULL) { /* 1st node */ 252 devp->first = cachep; 258 devp->first->next = cachep; 392 if (listptr->first == NULL) { /* 1st node */ 393 listptr->first [all...] |
H A D | piclscsi.c | 102 node_t *first; member in struct:linked_list 126 tmp = list->first; 149 cntrl_list->first = NULL; 177 if (cntrl_list->first == NULL) { 178 cntrl_list->first = nodeptr; 181 nodeptr->next = cntrl_list->first; 182 cntrl_list->first = nodeptr; 246 tmp = list->first; 423 curr = list->first; 491 curr = scsi_list->first; [all...] |
/illumos-gate/usr/src/cmd/fm/modules/common/disk-monitor/ |
H A D | diskmon_conf.h | 199 extern void link_indicator(indicator_t **first, 204 extern void link_indaction(ind_action_t **first, 210 extern void link_indrule(indrule_t **first, indrule_t *to_add);
|
/illumos-gate/usr/src/cmd/tip/ |
H A D | uucplock.c | 202 static int first = 1; local 206 if (first) { 217 first = 0;
|
/illumos-gate/usr/src/lib/libnisdb/ |
H A D | nis_hashitem.c | 94 table->first = 0; 299 if (table->first) 300 table->first->prv_item = item; 302 item->nxt_item = table->first; 304 table->first = item; 415 /* Wait until the first item isn't in use by another thread */ 417 while ((item = table->first) != 0) { 444 table->first = cur->nxt_item; 533 table->first = nl->nxt_item; 666 * first/prv_ite [all...] |
/illumos-gate/usr/src/cmd/fs.d/autofs/ |
H A D | ns_nis.c | 172 int first, err; local 179 first = 1; 197 if (first) { 198 first = 0; 314 int first, err, count; local 319 first = 1; 332 if (first) { 333 first = 0; 547 * i.e., first for an exact key match and then a wildcard, if there's
|
/illumos-gate/usr/src/cmd/backup/restore/ |
H A D | restore.c | 132 * restore algorithm. The first removes old entries, the second 134 * cleans up link names missed by the first two, and the final 138 * other files in them which need to be moved out first. As 625 ino_t first; local 634 first = lowerbnd(ROOTINO); 637 first = lowerbnd(first); 645 * The loop will terminate with first == maxino, if not 649 while (first < curfile.ino) { 650 ep = lookupino(first); 735 ino_t first, next, last; local [all...] |
/illumos-gate/usr/src/lib/libfakekernel/ |
H A D | Makefile.com | 53 CPPFLAGS.first += -I../common
|