| /titanic_41/usr/src/common/net/wanboot/crypt/ |
| H A D | des.c | 212 uint32_t left; in des() local
217 left = ((uint32_t)block[0] << 24) | in des()
237 work = ((left >> 4) ^ right) & 0x0f0f0f0f; in des()
239 left ^= work << 4; in des()
240 work = ((left >> 16) ^ right) & 0xffff; in des()
242 left ^= work << 16; in des()
243 work = ((right >> 2) ^ left) & 0x33333333; in des()
244 left ^= work; in des()
246 work = ((right >> 8) ^ left) & 0xff00ff; in des()
247 left ^= work; in des()
[all …]
|
| /titanic_41/usr/src/common/crypto/blowfish/ |
| H A D | blowfish_impl.c | 361 #define ROUND(left, right, i) \ argument
362 (left) ^= P[i]; \
363 (right) ^= F((left)); \
364 tmp = (left); \
365 (left) = (right); \
379 uint32_t left, right, tmp; in blowfish_encrypt_block() local
388 left = b32[0]; in blowfish_encrypt_block()
397 left = htonl(*(uint32_t *)(void *)&block[0]); in blowfish_encrypt_block()
400 left = ((uint32_t)block[0] << 24) in blowfish_encrypt_block()
411 ROUND(left, right, 0); in blowfish_encrypt_block()
[all …]
|
| /titanic_41/usr/src/cmd/cron/ |
| H A D | elm.c | 95 struct notice *left; member
112 struct key *left; member
157 n->left = NULL;
164 k->left = NULL;
177 n->left = nprev;
184 k->left = kprev;
199 n->left = nprev;
207 k->left = kprev;
265 k = (ind->key)->left;
266 while (k->time > time) k = k->left;
[all …]
|
| /titanic_41/usr/src/lib/libdevinfo/ |
| H A D | devinfo_realpath.c | 88 char left[PATH_MAX], next_token[PATH_MAX], symlink[PATH_MAX]; in s_realpath() local
98 left_len = strlcpy(left, path + 1, sizeof (left)); in s_realpath()
105 left_len = strlcpy(left, path, sizeof (left)); in s_realpath()
107 if (left_len >= sizeof (left) || resolved_len >= PATH_MAX) { in s_realpath()
120 p = strchr(left, '/'); in s_realpath()
121 s = p ? p : left + left_len; in s_realpath()
122 if (s - left >= sizeof (next_token)) { in s_realpath()
126 (void) memcpy(next_token, left, s - left); in s_realpath()
127 next_token[s - left] = '\0'; in s_realpath()
128 left_len -= s - left; in s_realpath()
[all …]
|
| /titanic_41/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->right = r;
119 r->left = t->left;
120 t->left = r;
[all …]
|
| H A D | dttree.c | 61 { while((t = root->left) )
81 { while((t = root->left) )
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) )
179 if(!(root = t->left) )
[all …]
|
| H A D | dtrenew.c | 51 dt->data->here = e->left;
56 if(e->left)
57 { for(t = e->right; t->left; t = t->left)
59 t->left = e->left;
|
| /titanic_41/usr/src/lib/libresolv2/common/isc/ |
| H A D | tree.c | 116 RET(tree_srch(&(**ppr_tree).left, in tree_srch()
160 if (!tree_trav(&(**ppr_tree).left, pfi_uar)) in tree_trav()
173 tree_mung(&(**ppr_tree).left, pfv_uar); in tree_mung()
199 (*ppr)->left = NULL; in sprout()
216 sub = sprout(&(*ppr)->left, p_data, pi_balance, in sprout()
235 p1 = (*ppr)->left; in sprout()
238 (*ppr)->left = p1->right; in sprout()
246 p1->right = p2->left; in sprout()
247 p2->left = p1; in sprout()
249 (*ppr)->left = p2->right; in sprout()
[all …]
|
| /titanic_41/usr/src/cmd/print/printmgr/com/sun/admin/pm/client/ |
| H A D | BST.java | 43 public BST left = null; field in BST
53 left = right = null; in BST()
77 if (left != null) in insert()
78 left.insert(theItem); in insert()
80 left = node = new BST(theItem); in insert()
113 if (left != null) in find_tree()
114 rv = left.find_tree(newKey, exactMatch); in find_tree()
136 if (left != null) in find()
137 rv = left.find(newKey, exactMatch); in find()
152 if (left != null) in traverse()
[all …]
|
| /titanic_41/usr/src/cmd/isns/isnsd/ |
| H A D | sched.c | 94 fk->left->right = fk->right; in il_shift()
95 fk->right->left = fk->left; in il_shift()
123 fk->left = k->left; in il_shift()
125 k->left->right = fk; in il_shift()
126 k->left = fk; in il_shift()
204 k->left = NULL; in el_init()
237 k->left = kleft; in el_init()
266 k->left = kleft; in el_init()
357 k = (il[i])->left; in el_add()
359 k = k->left; in el_add()
[all …]
|
| /titanic_41/usr/src/psm/stand/boot/common/ |
| H A D | heap_kmem.c | 95 Freehdr left; /* Left tree pointer */ member
228 tree = &x->left; in insert()
244 left_hook = &newhdr->left; in insert()
247 newhdr->left = NIL; in insert()
275 right_hook = &x->left; in insert()
276 x = x->left; in insert()
308 left_branch = x->left; in delete()
328 p = &right_branch->left; in delete()
329 right_branch = right_branch->left; in delete()
372 left_branch = x->left; in demote()
[all …]
|
| /titanic_41/usr/src/lib/libeti/menu/common/ |
| H A D | link.c | 44 int left, up; in link_col_major() local
73 left = n + r; in link_col_major()
74 if (left >= Nitems(m)) { in link_col_major()
75 left -= Rows(m); in link_col_major()
77 Left(IthItem(m, n)) = IthItem(m, left); in link_col_major()
78 Right(IthItem(m, left)) = IthItem(m, n); in link_col_major()
101 int left, up; in link_row_major() local
137 left = n + Cols(m) - 1; in link_row_major()
138 if (left >= Nitems(m)) { in link_row_major()
139 left = Nitems(m) - 1; in link_row_major()
[all …]
|
| /titanic_41/usr/src/lib/efcode/fcode_test/ |
| H A D | parse.fth | 48 ascii , left-parse-string " 9600" $= " left-parse.1" rot .passed?
49 ascii , left-parse-string " 8" $= " left-parse.2" rot .passed?
50 ascii , left-parse-string " n" $= " left-parse.3" rot .passed?
51 ascii , left-parse-string " 1" $= " left-parse.4" rot .passed?
52 ascii , left-parse-string " -" $= " left-parse.5" rot .passed?
|
| /titanic_41/usr/src/cmd/sgs/m4/common/ |
| 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 '*' '/' '%'
|
| /titanic_41/usr/src/cmd/make/lib/mksh/ |
| H A D | misc.cc | 954 node = node->left; in lookup()
973 if (node->left != 0) { in insert()
974 node = node->left; in insert()
979 node->left = new entry(name, node); in insert()
1012 if (node->left != 0) { in insert()
1013 node = node->left; in insert()
1015 node->left = new entry(name, node); in insert()
1041 entry *left = node->left; in rebalance() local
1044 unsigned ldepth = (left != 0) ? left->depth : 0; in rebalance()
1047 if ((node->left = left->right) != 0) { in rebalance()
[all …]
|
| /titanic_41/usr/src/uts/common/zmod/ |
| H A D | inftrees.c | 48 int left; /* number of prefix codes available */ local
133 left = 1;
135 left <<= 1;
136 left -= count[len];
137 if (left < 0) return -1; /* over-subscribed */
139 if (left > 0 && (type == CODES || max != 1))
272 left = (int)(1 << curr);
274 left -= count[curr + drop];
275 if (left <= 0) break;
277 left <<= 1;
|
| /titanic_41/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 …]
|
| /titanic_41/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
|
| /titanic_41/usr/src/lib/libsqlite/test/ |
| H A D | join4_28.test | 16 # This file implements tests for left outer joins containing WHERE
17 # clauses that restrict the scope of the left term of the join.
37 select * from t1 left outer join t2 on t1.a=t2.x where t2.z='ok'
42 select * from t1 left outer join t2 on t1.a=t2.x and t2.z='ok'
50 select * from t1 left outer join t2 on t1.a=t2.x where t2.z='ok'
55 select * from t1 left outer join t2 on t1.a=t2.x and t2.z='ok'
60 select * from t1 left outer join t2 on t1.a=t2.x where t2.z>='ok'
65 select * from t1 left outer join t2 on t1.a=t2.x and t2.z>='ok'
70 select * from t1 left outer join t2 on t1.a=t2.x where t2.z IN ('ok')
75 select * from t1 left outer join t2 on t1.a=t2.x and t2.z IN ('ok')
|
| /titanic_41/usr/src/cmd/pools/poolstat/ |
| H A D | poolstat.c | 438 default_f(char *str, int pos, int left, poolstat_field_format_t *ff, char *data) in default_f() argument
446 used = snprintf(str + pos, left, "%*.*lld", in default_f()
453 used = snprintf(str + pos, left, "%*.*llu", in default_f()
469 used = snprintf(str + pos, left, "%*.*f", in default_f()
489 used = snprintf(str + pos, left, "%-*s", ff->pff_width, in default_f()
500 bigno_f(char *str, int pos, int left, poolstat_field_format_t *ff, char *data) in bigno_f() argument
576 used = snprintf(str + pos, left, "%*.*f", in bigno_f()
579 used = snprintf(str + pos, left, "%*.*f%c", in bigno_f()
587 used_stat_f(char *str, int pos, int left, poolstat_field_format_t *ff, in used_stat_f() argument
595 used = snprintf(str + pos, left, "%*c", ff->pff_width, '-'); in used_stat_f()
[all …]
|
| /titanic_41/usr/src/lib/libshell/common/sh/ |
| H A D | timers.c | 91 static double left; in sigalrm() local
93 left = 0; in sigalrm()
144 if(tpmin && (left==0 || (tp && tpmin->wakeup < (now+left)))) in sigalrm()
146 if(left==0) in sigalrm()
148 left = setalarm(tpmin->wakeup-now); in sigalrm()
149 if(left && (now+left) < tpmin->wakeup) in sigalrm()
150 setalarm(left); in sigalrm()
152 left=tpmin->wakeup-now; in sigalrm()
|
| /titanic_41/usr/src/lib/libcryptoutil/common/ |
| H A D | random.c | 87 size_t left = dlen; in readn_nointr() local
90 for (err = 0; left > 0 && nread != -1; marker += nread, left -= nread) { in readn_nointr()
91 if ((nread = read(fd, marker, left)) < 0) { in readn_nointr()
102 return (err != 0 ? err : dlen - left); in readn_nointr()
112 size_t left = dlen; in writen_nointr() local
115 for (err = 0; left > 0 && nwrite != -1; marker += nwrite, in writen_nointr()
116 left -= nwrite) { in writen_nointr()
117 if ((nwrite = write(fd, marker, left)) < 0) { in writen_nointr()
128 return (err != 0 ? err : dlen - left); in writen_nointr()
|
| /titanic_41/usr/src/common/avl/ |
| H A D | avl.c | 135 avl_walk(avl_tree_t *tree, void *oldnode, int left) in avl_walk() argument
139 int right = 1 - left; in avl_walk()
155 if (node->avl_child[left] != NULL) { in avl_walk()
156 for (node = node->avl_child[left]; in avl_walk()
304 int left = !(balance < 0); /* when balance = -2, left will be 0 */ in avl_rotation() local
305 int right = 1 - left; in avl_rotation()
309 avl_node_t *child = node->avl_child[left]; in avl_rotation()
358 node->avl_child[left] = cright; in avl_rotation()
361 AVL_SETCHILD(cright, left); in avl_rotation()
420 gleft = gchild->avl_child[left]; in avl_rotation()
[all …]
|
| /titanic_41/usr/src/lib/libbc/libc/gen/common/ |
| H A D | malloc.c | 179 fpp = &x->left; in insert()
198 newhdr->left = NIL; in insert()
209 left_hook = &newhdr->left; in insert()
235 right_hook = &x->left; in insert()
236 x = x->left; in insert()
269 left_branch = x->left; in delete()
307 p = &right_branch->left; in delete()
356 left_branch = x->left; in demote()
378 p = &right_branch->left; in demote()
385 x->left = left_branch; in demote()
[all …]
|
| /titanic_41/usr/src/cmd/sgs/lex/common/ |
| H A D | sub1.c | 686 left[tptr] = d; in mn2()
730 left[tptr] = d; in mn1()
821 return (mn1(i, left[n])); in dupl()
823 return (mn1(i, dupl(left[n]))); in dupl()
827 return (mn2(i, dupl(left[n]), right[n])); in dupl()
829 return (mn2(i, dupl(left[n]), dupl(right[n]))); in dupl()
937 (void) printf("%d ", left[t]); in treedump()
942 strpt(left[t]); in treedump()
946 strpt(left[t]); in treedump()
949 (void) printf("/ %d %d", left[t], right[t]); in treedump()
[all …]
|