Home
last modified time | relevance | path

Searched refs:left (Results 1 – 25 of 349) sorted by relevance

12345678910>>...14

/titanic_52/usr/src/common/net/wanboot/crypt/
H A Ddes.c212 uint32_t left; in des() local
216 /* Read input block and place in left/right in big-endian order */ in des()
217 left = ((uint32_t)block[0] << 24) | in des()
231 * register left by 1 bit, i.e., so that "left" contains permuted 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) in des()
[all...]
/titanic_52/usr/src/common/crypto/blowfish/
H A Dblowfish_impl.c361 #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()
394 * Read input block and place in left/right in big-endian order. in blowfish_encrypt_block()
397 left = htonl(*(uint32_t *)(void *)&block[0]); in blowfish_encrypt_block()
400 left in blowfish_encrypt_block()
474 uint32_t left, right, tmp; blowfish_decrypt_block() local
[all...]
/titanic_52/usr/src/cmd/cron/
H A Delm.c86 * left = points to the notice immediately preceding this one.
94 struct notice *left; member
105 * left = points to the key immediately preceding this one.
111 struct key *left; member
156 n->left = NULL;
163 k->left = NULL;
176 n->left = nprev;
183 k->left = kprev;
198 n->left = nprev;
206 k->left
[all...]
/titanic_52/usr/src/lib/libdevinfo/
H A Ddevinfo_realpath.c74 * in which case the path which caused trouble is left in (resolved).
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()
113 * Iterate over path components in `left'. in s_realpath()
117 * Extract the next path component and adjust `left' in s_realpath()
120 p = strchr(left, '/'); in s_realpath()
[all...]
/titanic_52/usr/src/lib/libresolv2/common/isc/
H A Dtree.c116 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()
212 /* if LESS, prepare to move to the left. in sprout()
215 MSG("LESS. sprouting left.") in sprout()
216 sub = sprout(&(*ppr)->left, p_data, pi_balance, in sprout()
218 if (sub && *pi_balance) { /*%< left branch has grown */ in sprout()
219 MSG("LESS: left branch has grown") in sprout()
228 /* balance WAS okay; now left branc in sprout()
[all...]
/titanic_52/usr/src/cmd/print/printmgr/com/sun/admin/pm/client/
H A DBST.java43 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 ! in traverse()
[all...]
/titanic_52/usr/src/cmd/isns/isnsd/
H A Dsched.c94 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 in el_init()
[all...]
/titanic_52/usr/src/psm/stand/boot/common/
H A Dheap_kmem.c63 * 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
228 tree = &x->left; in insert()
244 left_hook = &newhdr->left; in insert()
247 newhdr->left = NIL; in insert()
258 * below (i.e., to the left of) p. Similarly in insert()
265 * rewrite link crossing from the left in insert()
275 right_hook = &x->left; in insert()
[all...]
/titanic_52/usr/src/lib/libeti/menu/common/
H A Dlink.c44 int left, up; in link_col_major() local
69 /* Set up left and right links at edge of menu */ in link_col_major()
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
134 /* Setup left and right links at edge of menu */ in link_row_major()
137 left in link_row_major()
[all...]
/titanic_52/usr/src/lib/efcode/fcode_test/
H A Dparse.fth48 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
[all...]
/titanic_52/usr/src/contrib/zlib/
H A Dinftrees.c42 int left; /* number of prefix codes available */ in inflate_table() local
127 left = 1; in inflate_table()
129 left <<= 1; in inflate_table()
130 left -= count[len]; in inflate_table()
131 if (left < 0) return -1; /* over-subscribed */ in inflate_table()
133 if (left > 0 && (type == CODES || max != 1)) in inflate_table()
264 left = (int)(1 << curr); in inflate_table()
266 left -= count[curr + drop]; in inflate_table()
267 if (left <= 0) break; in inflate_table()
269 left << in inflate_table()
[all...]
H A Dinfback.c126 left = strm->avail_out; \
137 strm->avail_out = left; \
207 if (left == 0) { \
209 left = state->wsize; \
210 state->whave = left; \
211 if (out(out_desc, put, left)) { \
251 unsigned have, left; /* available input and output */ in inflateBack() local
278 left = state->wsize; in inflateBack()
337 if (copy > left) copy = left; in inflateBack()
[all...]
/titanic_52/usr/src/boot/lib/libz/
H A Dinftrees.c46 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...]
H A Dinfback.c131 left = strm->avail_out; \
142 strm->avail_out = left; \
212 if (left == 0) { \
214 left = state->wsize; \
215 state->whave = left; \
216 if (out(out_desc, put, left)) { \
260 unsigned have, left; /* available input and output */ local
287 left = state->wsize;
346 if (copy > left) copy = left;
[all...]
/titanic_52/usr/src/cmd/sgs/m4/common/
H A Dm4y_xpg4.y40 %left OROR
41 %left ANDAND
42 %left '|'
43 %left '^'
44 %left '&'
47 %left LSHIFT RSHIFT
48 %left '+' '-'
49 %left '*' '/' '%'
/titanic_52/usr/src/cmd/make/lib/mksh/
H A Dmisc.cc649 * The first property of the type, if any left
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
[all...]
/titanic_52/usr/src/cmd/oawk/
H A Dawk.g.y48 %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_52/usr/src/tools/scripts/
H A Dbringovercheck.sh44 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_52/usr/src/lib/libsqlite/test/
H A Djoin4_28.test16 # 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 oute
[all...]
/titanic_52/usr/src/cmd/pools/poolstat/
H A Dpoolstat.c437 default_f(char *str, int pos, int left, poolstat_field_format_t *ff, char *data) in default_f() argument
445 used = snprintf(str + pos, left, "%*.*lld", in default_f()
452 used = snprintf(str + pos, left, "%*.*llu", in default_f()
468 used = snprintf(str + pos, left, "%*.*f", in default_f()
488 used = snprintf(str + pos, left, "%-*s", ff->pff_width, in default_f()
499 bigno_f(char *str, int pos, int left, poolstat_field_format_t *ff, char *data) in bigno_f() argument
575 used = snprintf(str + pos, left, "%*.*f", in bigno_f()
578 used = snprintf(str + pos, left, "%*.*f%c", in bigno_f()
586 used_stat_f(char *str, int pos, int left, poolstat_field_format_t *ff, in used_stat_f() argument
594 used = snprintf(str + pos, left, " in used_stat_f()
616 header_f(char * str,int pos,int left,poolstat_field_format_t * ff,char * data) header_f() argument
640 int left = len; /* chars left to use in the line */ prt_stat_line() local
684 int left = len; /* chars left to use in the line */ prt_stat_hd() local
[all...]
/titanic_52/usr/src/contrib/ast/src/cmd/ksh93/sh/
H A Dtimers.c91 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 in sigalrm()
[all...]
/titanic_52/usr/src/lib/libcryptoutil/common/
H A Drandom.c87 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()
[all...]
/titanic_52/usr/src/common/avl/
H A Davl.c38 * 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) avl_walk() argument
305 int left = !(balance < 0); /* when balance = -2, left will be 0 */ avl_rotation() local
686 int left; avl_remove() local
[all...]
/titanic_52/usr/src/cmd/sgs/lex/common/
H A Dsub1.c686 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[ in treedump()
[all...]
/titanic_52/usr/src/lib/libbc/libc/gen/common/
H A Dmalloc.c41 * descendents of s; for all x in D(left(s)) and all y in
179 fpp = &x->left; in insert()
198 newhdr->left = NIL; in insert()
209 left_hook = &newhdr->left; in insert()
218 * below (i.e., to the left of) newblk. Similarly in insert()
225 * rewrite link crossing from the left in insert()
235 right_hook = &x->left; in insert()
236 x = x->left; in insert()
250 * The left and right branches of the node to be deleted define two
263 Freehdr left_branch; /* left subtre in delete()
[all...]

12345678910>>...14