| /onnv/onnv-gate/usr/src/cmd/cron/ |
| elm.c | 87 * left = points to the notice immediately preceding this one.
95 struct notice *left; member in struct:notice
106 * left = points to the key immediately preceding this one.
112 struct key *left; member in struct:key
157 n->left = NULL;
164 k->left = NULL;
177 n->left = nprev;
184 k->left = kprev;
199 n->left = nprev;
207 k->left = kprev
[all...] |
| /onnv/onnv-gate/usr/src/lib/libdevinfo/ |
| 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...] |
| /onnv/onnv-gate/usr/src/tools/scripts/ |
| 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
|
| /onnv/onnv-gate/usr/src/common/net/wanboot/crypt/ |
| 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) & 0x33333333
[all...] |
| /onnv/onnv-gate/usr/src/lib/libntfs/common/libntfs/ |
| bitmap.c | 63 s64 bufsize, br, left = count; local
100 while ((bit & 7) && left--) {
110 /* Loop until @left reaches zero. */
113 bit = left & 7;
116 if (left > 0 && bit) {
117 lastbyte_pos = ((left + 7) >> 3) + firstbyte;
130 br = ntfs_attr_pread(na, (start_bit + left) >>
142 while (bit && left--) {
177 left -= tmp;
178 if (bufsize > (tmp = (left + 7) >> 3)
[all...] |
| /onnv/onnv-gate/usr/src/lib/libast/common/cdt/ |
| 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->right = r
[all...] |
| 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) )
|
| 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;
[all...] |
| 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;
|
| /onnv/onnv-gate/usr/src/cmd/print/printmgr/com/sun/admin/pm/client/ |
| 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 != null
[all...] |
| /onnv/onnv-gate/usr/src/cmd/sgs/m4/common/ |
| m4y.y | 40 %left OROR
41 %left ANDAND
42 %left '|' '^'
43 %left '&'
46 %left '+' '-'
47 %left '*' '/' '%'
|
| m4y_xpg4.y | 40 %left OROR
41 %left ANDAND
42 %left '|'
43 %left '^'
44 %left '&'
47 %left LSHIFT RSHIFT
48 %left '+' '-'
49 %left '*' '/' '%'
|
| /onnv/onnv-gate/usr/src/cmd/perl/5.8.4/distrib/ext/Storable/t/ |
| st-dump.pl | 21 my ($num, $left, $right, $name) = @_;
22 my $ok = ((defined $left) ? $left == $right : undef);
25 if (!defined $left) {
27 } elsif ($left !~ tr/0-9//c) {
28 print "# Got $left\n";
30 $left =~ s/([^-a-zA-Z0-9_+])/sprintf "\\%03o", ord $1/ge;
31 print "# Got \"$left\"\n";
|
| /onnv/onnv-gate/usr/src/lib/libc/port/gen/ |
| strlcat.c | 44 size_t left = dstsize; local
49 while (left-- != 0 && *df != '\0')
|
| /onnv/onnv-gate/usr/src/lib/libresolv2/common/isc/ |
| 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 branch longer *
[all...] |
| /onnv/onnv-gate/usr/src/cmd/isns/isnsd/ |
| 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 = kleft
[all...] |
| isns_sched.h | 47 struct el_key *left; member in struct:el_key
|
| /onnv/onnv-gate/usr/src/cmd/perl/5.8.4/distrib/t/op/ |
| qq.t | 14 my($left, $right) = @_;
16 if ($left eq $right) {
21 foreach ($left, $right) {
30 ), $test++, $left, $right;
|
| /onnv/onnv-gate/usr/src/lib/libcurses/screen/ |
| 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;
|
| 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);
|
| /onnv/onnv-gate/usr/src/common/crypto/blowfish/ |
| blowfish_impl.c | 363 #define ROUND(left, right, i) \
364 (left) ^= P[i]; \
365 (right) ^= F((left)); \
366 tmp = (left); \
367 (left) = (right); \
384 uint32_t left, right, tmp; local
393 left = b32[0];
399 * Read input block and place in left/right in big-endian order.
402 left = htonl(*(uint32_t *)(void *)&block[0]);
405 left = ((uint32_t)block[0] << 24
481 uint32_t left, right, tmp; local
[all...] |
| /onnv/onnv-gate/usr/src/lib/libcryptoutil/common/ |
| random.c | 85 size_t left = dlen; local
88 for (err = 0; left > 0 && nread != -1; marker += nread, left -= nread) {
89 if ((nread = read(fd, marker, left)) < 0) {
100 return (err != 0 ? err : dlen - left);
110 size_t left = dlen; local
113 for (err = 0; left > 0 && nwrite != -1; marker += nwrite,
114 left -= nwrite) {
115 if ((nwrite = write(fd, marker, left)) < 0) {
126 return (err != 0 ? err : dlen - left);
[all...] |
| 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;
|
| /onnv/onnv-gate/usr/src/psm/stand/boot/common/ |
| 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
[all...] |
| /onnv/onnv-gate/usr/src/cmd/troff/nroff.d/ |
| tw.h | 68 char *left; /* ditto */ member in struct:t
|
