/illumos-gate/usr/src/uts/common/io/ib/ibtl/ |
H A D | ibtl_util.c | 296 size_t left = ibtf_buf_eptr - ibtf_buf_sptr; local 299 (caddr_t)ibtf_buf_sptr, left); 300 bcopy((caddr_t)ibtf_print_buf + left, 301 (caddr_t)ibtf_debug_buf, len - left); 302 ibtf_buf_sptr = ibtf_debug_buf + len - left;
|
/illumos-gate/usr/src/uts/common/io/scsi/adapters/scsi_vhci/ |
H A D | scsi_vhci_tpgs.c | 416 int loop, left; local 419 left = buf_size % 8; 421 VHCI_DEBUG(4, (CE_NOTE, NULL, "!buf_size: %x loop: %x left: %x", 422 buf_size, loop, left)); 432 if (left) { 434 "NOTICE: buf[%d-%d]:", i, i + left)); 435 for (j = 0; j < left; j++) {
|
/illumos-gate/usr/src/cmd/cron/ |
H A D | elm.c | 86 * left = points to the notice immediately preceding this one. 94 struct notice *left; member in struct:notice 105 * left = points to the key immediately preceding this one. 111 struct key *left; member in struct:key 156 n->left = NULL; 163 k->left = NULL; 176 n->left = nprev; 183 k->left = kprev; 198 n->left = nprev; 206 k->left [all...] |
/illumos-gate/usr/src/boot/lib/libz/ |
H A D | inflate.c | 462 left = strm->avail_out; \ 473 strm->avail_out = left; \ 551 input left to load n bits into the accumulator, or it continues. BITS(n) 564 state information is maintained to continue the loop where it left off 612 unsigned have, left; /* available input and output */ local 636 out = left; 884 if (copy > left) copy = left; 889 left -= copy; 1022 if (have >= 6 && left > [all...] |
/illumos-gate/usr/src/lib/fm/topo/modules/sun4v/sun4vpi/ |
H A D | pi_walker.c | 686 pi_walkerlist_compare(const void *left, const void *right, void *private) argument 688 pi_walkernode_t *lp = (pi_walkernode_t *)left;
|
/illumos-gate/usr/src/lib/libshell/common/bltins/ |
H A D | test.c | 459 int test_binop(register int op,const char *left,const char *right) argument 464 while(*left=='0') 465 left++; 468 lnum = sh_arith(left); 476 return(*left!=0); 478 return(test_strmatch(left, right)); 480 return(!test_strmatch(left, right)); 482 return(strcoll(left, right)>0); 484 return(strcoll(left, right)<0); 486 return(strcmp(left, righ [all...] |
/illumos-gate/usr/src/lib/libeti/menu/inc/ |
H A D | menu.h | 70 struct ITEM *left; member in struct:ITEM
|
/illumos-gate/usr/src/lib/libcmd/common/ |
H A D | expr.c | 48 "left associative. The symbols \aexpr1\a and \aexpr2\a represent " 401 register char *left,*right; local 410 left = np->str; 412 sfsprintf(left=buff1,sizeof(buff1),"%d",np->num); 421 np->num = streq(left,right); 424 np->num = (strcoll(left,right)>0); 427 np->num = (strcoll(left,right)<0); 430 np->num = (strcoll(left,right)>=0); 433 np->num = (strcoll(left,right)<=0); 436 np->num = !streq(left,righ [all...] |
/illumos-gate/usr/src/cmd/mdb/common/kmdb/ |
H A D | kmdb_promif.c | 229 int oldhead, left, n; local 232 * Calculate the number of slots left before we wrap around to the 235 left = KMDB_PROM_READBUF_SIZE - kmdb_prom_readbuf_head; 237 left--; 240 (kmdb_prom_readbuf_head > kmdb_prom_readbuf_tail && left > 0)) { 248 kmdb_prom_readbuf_head, left, wait)) <= 0) 258 if (n != left) 262 left = kmdb_prom_readbuf_tail - kmdb_prom_readbuf_head - 1; 263 if (left > 0) { 265 kmdb_prom_readbuf_head, left, wai 348 size_t left = len; local [all...] |
/illumos-gate/usr/src/cmd/fm/modules/common/eversholt/ |
H A D | config.c | 425 prop_destructor(void *left, void *right, void *arg) argument
|
/illumos-gate/usr/src/cmd/sed/ |
H A D | process.c | 476 size_t clen, left; local 494 for (p = ps, left = psl; left > 0; p += clen, left -= clen) { 501 if (left >= y->multis[i].fromlen &&
|
/illumos-gate/usr/src/cmd/awk/ |
H A D | b.c | 43 #define left(v) (v)->narg[0] macro 53 * left is index, right contains value or pointer to value 54 * unary (STAR, PLUS, QUEST): left is child, right is null 55 * binary (CAT, OR): left and right are children 198 left(p) = (Node *) poscnt; 202 penter(left(p)); 203 parent(left(p)) = p; 207 penter(left(p)); 209 parent(left(p)) = p; 226 freetr(left( [all...] |
/illumos-gate/usr/src/cmd/ipf/tools/ |
H A D | ip_fil.c | 841 int left, ioc, num, offset; local 846 left = len; 851 while ((left > 0) && (ioc < uio->uio_iovcnt)) { 854 if (num > left) 855 num = left; 865 left -= num; 866 if (left > 0) 869 if (left > 0)
|
/illumos-gate/usr/src/cmd/last/ |
H A D | last.c | 509 strspl(char *left, char *right) argument 511 size_t ressize = strlen(left) + strlen(right) + 1; 519 (void) strlcpy(res, left, ressize);
|
/illumos-gate/usr/src/psm/stand/boot/common/ |
H A D | heap_kmem.c | 63 * a. addr(D(left(s))) < addr(s) < addr(D(right(s))) 64 * b. len(D(left(s))) <= len(s) >= len(D(right(s))) 82 * The left pointer of a header blocks is used to chain free header 95 Freehdr left; /* Left tree pointer */ member in struct:freehdr 228 tree = &x->left; 244 left_hook = &newhdr->left; 247 newhdr->left = NIL; 258 * below (i.e., to the left of) p. Similarly 265 * rewrite link crossing from the left 275 right_hook = &x->left; [all...] |
/illumos-gate/usr/src/uts/common/io/ib/clients/rdsv3/ |
H A D | ib_send.c | 388 /* Oops, there aren't that many credits left! */ 994 uint32_t left, count; local 1041 left = scat[i].swr.wr_nds; 1042 for (idx = 0; left > 0; k++) { 1058 if (left > RDSV3_IB_MAX_SGE) { 1060 left -= RDSV3_IB_MAX_SGE; 1062 count = left; 1063 left = 0;
|
/illumos-gate/usr/src/cmd/make/bin/ |
H A D | implicit.cc | 1147 wchar_t *left = (wchar_t *) wcschr(lmn_string.get_string(), (int) parenleft_char); local 1150 if ((left == NULL) || (right == NULL)) { 1153 line->body.line.percent = GETNAME(left + 1, right - left - 1);
|
/illumos-gate/usr/src/common/avl/ |
H A D | avl.c | 38 * any given node, the left and right subtrees are allowed to differ in height 66 * - The left/right children pointers of a node are in an array. 68 * left and right indices. The implementation is written as if it only 69 * dealt with left handed manipulations. By changing the value assigned 70 * to "left", the code also works for right handed trees. The 73 * int left; // 0 when dealing with left children, 76 * int left_heavy; // -1 when left subtree is taller at some node, 79 * int right; // will be the opposite of left (0 or 1) 82 * int direction; // 0 for "<" (ie. left chil 136 avl_walk(avl_tree_t *tree, void *oldnode, int left) argument 305 int left = !(balance < 0); /* when balance = -2, left will be 0 */ local 686 int left; local [all...] |
/illumos-gate/usr/src/lib/pkcs11/pkcs11_softtoken/common/ |
H A D | softSSL.c | 224 uint_t left = resultlen; local 250 while (left > 0) { 263 if (left > MD5_HASH_SIZE) { 273 left -= MD5_HASH_SIZE; 277 for (i = 0; i < left; i++) { 282 bcopy(md5_hmac, res, left); 304 uint_t left = resultlen; local 330 while (left > 0) { 344 if (left > SHA1_HASH_SIZE) { 354 left [all...] |
/illumos-gate/usr/src/lib/fm/libfmevent/common/ |
H A D | fmev_subscribe.c | 464 struct fmev_subinfo *left = (struct fmev_subinfo *)l; local 467 return (strncmp(left->si_pat, right->si_pat, FMEV_MAX_CLASS));
|
/illumos-gate/usr/src/lib/libcpc/i386/ |
H A D | event_pentium.c | 676 cpc_event_diff(cpc_event_t *diff, cpc_event_t *left, cpc_event_t *right) argument 678 diff->ce_hrt = left->ce_hrt; 679 diff->ce_tsc = left->ce_tsc - right->ce_tsc; 680 diff->ce_pic[0] = left->ce_pic[0] - right->ce_pic[0]; 681 diff->ce_pic[1] = left->ce_pic[1] - right->ce_pic[1];
|
/illumos-gate/usr/src/lib/libpcp/common/ |
H A D | libpcp.c | 1294 /* Add left-over byte, if any */ 1380 int left = size; local 1395 if ((res = write(fd, bufp, left)) <= 0) { 1401 left -= res; 1403 } while (left > 0); 1408 return (size - left); 1418 int left = size; local 1430 while (left > 0) { 1431 res = read(fd, bufp, left); 1447 left [all...] |
/illumos-gate/usr/src/cmd/oawk/ |
H A D | b.c | 47 #define left(v) v->narg[0] macro 58 * leaf (CCL, NCCL, CHAR, DOT): left is index, 60 * unary (FINAL, STAR, PLUS, QUEST): left is child, right is null 61 * binary (CAT, OR): left and right are children 136 left(p) = (NODE *)line; 140 penter(left(p)); 141 parent(left(p)) = p; 145 penter(left(p)); 147 parent(left(p)) = p; 161 xfree(foll[(int)left( [all...] |
/illumos-gate/usr/src/cmd/csh/ |
H A D | sh.lex.c | 514 int left, right, dol; local 540 left = 0, right = dol; 550 left = right = -1; 556 left = 0, right = dol; 561 if (!getsel(&left, &right, dol)) 567 if (!getsel(&left, &right, dol)) 572 exclc = right - left + 1; 573 while (--left >= 0)
|
/illumos-gate/usr/src/cmd/fm/eversholt/common/ |
H A D | tree.c | 267 tree_free(root->u.expr.left); 276 tree_free(root->u.expr.left); 372 if (tree_treecmp(np1->u.expr.left, np2->u.expr.left, t, 391 return (tree_treecmp(np1->u.expr.left, np2->u.expr.left, t, 462 tree_expr(enum nodetype t, struct node *left, struct node *right) argument 466 ASSERTinfo(left != NULL || right != NULL, ptree_nodetype2str(t)); 469 (left) ? left [all...] |