/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/lib/libdevinfo/ |
H A D | devinfo_realpath.c | 74 * in which case the path which caused trouble is left in (resolved). 88 char left[PATH_MAX], next_token[PATH_MAX], symlink[PATH_MAX]; local 98 left_len = strlcpy(left, path + 1, sizeof (left)); 105 left_len = strlcpy(left, path, sizeof (left)); 107 if (left_len >= sizeof (left) || resolved_len >= PATH_MAX) { 113 * Iterate over path components in `left'. 117 * Extract the next path component and adjust `left' 120 p = strchr(left, '/'); [all...] |
/illumos-gate/usr/src/tools/scripts/ |
H A D | bringovercheck.sh | 44 left=$(/bin/ls -E "$1" 2>/dev/null | awk '{print $7}') 45 left=${left##*.} 48 [ -z "$left" -o -z "$right" -o "$left" -gt "$right" ] && return 0
|
/illumos-gate/usr/src/common/net/wanboot/crypt/ |
H A D | des.c | 212 uint32_t left; local 216 /* Read input block and place in left/right in big-endian order */ 217 left = ((uint32_t)block[0] << 24) | 231 * register left by 1 bit, i.e., so that "left" contains permuted 237 work = ((left >> 4) ^ right) & 0x0f0f0f0f; 239 left ^= work << 4; 240 work = ((left >> 16) ^ right) & 0xffff; 242 left ^= work << 16; 243 work = ((right >> 2) ^ left) [all...] |
/illumos-gate/usr/src/lib/libast/common/cdt/ |
H A D | dtlist.c | 52 r = r->left; 99 { r->left = t->left; 100 t->left->right = r; 102 t->left = r; 110 { r->left = t->left; 111 t->left = r; 113 else r->left = r; 118 { t->left [all...] |
H A D | dthdr.h | 42 #define left hl._left macro 68 #define rrotate(x,y) ((x)->left = (y)->right, (y)->right = (x)) 69 #define lrotate(x,y) ((x)->right = (y)->left, (y)->left = (x)) 70 #define rlink(r,x) ((r) = (r)->left = (x) )
|
H A D | dttree.c | 61 { while((t = root->left) ) 81 { while((t = root->left) ) 90 /* note that link.right is LEFT tree and link.left is RIGHT tree */ 102 l->right = root->left; 103 r->left = root->right; 133 if(!(t = cmp < 0 ? t->left : t->right) ) 141 { t = root->left; 145 root = t->left; 163 root = t->left; 174 { if((t = root->left) ) [all...] |
H A D | dtrenew.c | 50 { if(!e->right ) /* make left child the new root */ 51 dt->data->here = e->left; 55 /* merge left subtree to right subtree */ 56 if(e->left) 57 { for(t = e->right; t->left; t = t->left) 59 t->left = e->left;
|
H A D | dtflatten.c | 59 { while((t = r->left) ) 62 { if((t = r->left) ) 64 while((t = r->left) );
|
/illumos-gate/usr/src/cmd/print/printmgr/com/sun/admin/pm/client/ |
H A D | BST.java | 43 public BST left = null; field in class:BST 53 left = right = null; 77 if (left != null) 78 left.insert(theItem); 80 left = node = new BST(theItem); 113 if (left != null) 114 rv = left.find_tree(newKey, exactMatch); 136 if (left != null) 137 rv = left.find(newKey, exactMatch); 152 if (left ! [all...] |
/illumos-gate/usr/src/cmd/sgs/m4/common/ |
H A D | m4y.y | 40 %left OROR 41 %left ANDAND 42 %left '|' '^' 43 %left '&' 46 %left '+' '-' 47 %left '*' '/' '%'
|
H A D | m4y_xpg4.y | 40 %left OROR 41 %left ANDAND 42 %left '|' 43 %left '^' 44 %left '&' 47 %left LSHIFT RSHIFT 48 %left '+' '-' 49 %left '*' '/' '%'
|
/illumos-gate/usr/src/lib/libresolv2/common/isc/ |
H A D | tree.c | 116 RET(tree_srch(&(**ppr_tree).left, 160 if (!tree_trav(&(**ppr_tree).left, pfi_uar)) 173 tree_mung(&(**ppr_tree).left, pfv_uar); 199 (*ppr)->left = NULL; 212 /* if LESS, prepare to move to the left. 215 MSG("LESS. sprouting left.") 216 sub = sprout(&(*ppr)->left, p_data, pi_balance, 218 if (sub && *pi_balance) { /*%< left branch has grown */ 219 MSG("LESS: left branch has grown") 228 /* balance WAS okay; now left branc [all...] |
/illumos-gate/usr/src/lib/libc/port/gen/ |
H A D | strlcat.c | 44 size_t left = dstsize; local 49 while (left-- != 0 && *df != '\0')
|
/illumos-gate/usr/src/cmd/isns/isnsd/ |
H A D | sched.c | 94 fk->left->right = fk->right; 95 fk->right->left = fk->left; 123 fk->left = k->left; 125 k->left->right = fk; 126 k->left = fk; 204 k->left = NULL; 237 k->left = kleft; 266 k->left [all...] |
H A D | isns_sched.h | 47 struct el_key *left; member in struct:el_key
|
/illumos-gate/usr/src/lib/libcurses/screen/ |
H A D | overlap.c | 56 top, bottom, left, right; local 72 left = _MAX(sbx, dbx); right = _MIN(sex, dex); 74 sby = top - sby; sbx = left - sbx; 76 dby = top - dby; dbx = left - dbx;
|
H A D | slk_set.c | 54 * f: 0, 1, 2 for left, center, right-justification 61 int len, slklen = slk->_len, left; local 85 left = 0; 87 left = (slklen - len) / ((f == 1) ? 2 : 1); 89 (void) memcpy(nlab + left, lab, len);
|
/illumos-gate/usr/src/common/crypto/blowfish/ |
H A D | blowfish_impl.c | 361 #define ROUND(left, right, i) \ 362 (left) ^= P[i]; \ 363 (right) ^= F((left)); \ 364 tmp = (left); \ 365 (left) = (right); \ 379 uint32_t left, right, tmp; local 388 left = b32[0]; 394 * Read input block and place in left/right in big-endian order. 397 left = htonl(*(uint32_t *)(void *)&block[0]); 400 left 474 uint32_t left, right, tmp; local [all...] |
/illumos-gate/usr/src/boot/lib/libz/ |
H A D | inftrees.c | 46 int left; /* number of prefix codes available */ local 131 left = 1; 133 left <<= 1; 134 left -= count[len]; 135 if (left < 0) return -1; /* over-subscribed */ 137 if (left > 0 && (type == CODES || max != 1)) 270 left = (int)(1 << curr); 272 left -= count[curr + drop]; 273 if (left <= 0) break; 275 left << [all...] |
/illumos-gate/usr/src/lib/libcryptoutil/common/ |
H A D | keyfile.c | 112 size_t left = filesize; local 115 for (/* */; left > 0; marker += nread, left -= nread) { 117 nread = read(fd, marker, left); 137 filesize -= left;
|
/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/cmd/troff/nroff.d/ |
H A D | tw.h | 68 char *left; /* ditto */ member in struct:t
|
/illumos-gate/usr/src/lib/libeti/menu/common/ |
H A D | link.c | 44 int left, up; local 69 /* Set up left and right links at edge of menu */ 73 left = n + r; 74 if (left >= Nitems(m)) { 75 left -= Rows(m); 77 Left(IthItem(m, n)) = IthItem(m, left); 78 Right(IthItem(m, left)) = IthItem(m, n); 101 int left, up; local 134 /* Setup left and right links at edge of menu */ 137 left [all...] |
/illumos-gate/usr/src/cmd/oawk/ |
H A D | awk.g.y | 48 %left BOR 49 %left AND 50 %left NOT 51 %left NUMBER VAR ARRAY FNCN SUBSTR LSUBSTR INDEX 52 %left GETLINE 54 %left OR 55 %left STRING DOT CCL NCCL CHAR 56 %left '(' '^' '$' 57 %left CAT 58 %left ' [all...] |