Home
last modified time | relevance | path

Searched refs:right (Results 1 – 25 of 346) sorted by relevance

12345678910>>...14

/titanic_51/usr/src/common/net/wanboot/crypt/
H A Ddes.c213 uint32_t right; in des() local
216 /* Read input block and place in left/right in big-endian order */ in des()
221 right = ((uint32_t)block[4] << 24) | in des()
232 * input bits 2, 3, 4, ... 1 and "right" contains 33, 34, 35, ... 32 in des()
237 work = ((left >> 4) ^ right) & 0x0f0f0f0f; in des()
238 right ^= work; in des()
240 work = ((left >> 16) ^ right) & 0xffff; in des()
241 right ^= work; in des()
243 work = ((right >> 2) ^ left) & 0x33333333; in des()
245 right in des()
[all...]
/titanic_51/usr/src/common/crypto/blowfish/
H A Dblowfish_impl.c361 #define ROUND(left, right, i) \ argument
363 (right) ^= F((left)); \
365 (left) = (right); \
366 (right) = tmp;
379 uint32_t left, right, tmp; in blowfish_encrypt_block() local
389 right = b32[1]; in blowfish_encrypt_block()
394 * Read input block and place in left/right in big-endian order. in blowfish_encrypt_block()
398 right = htonl(*(uint32_t *)(void *)&block[4]); in blowfish_encrypt_block()
404 right = ((uint32_t)block[4] << 24) in blowfish_encrypt_block()
411 ROUND(left, right, in blowfish_encrypt_block()
474 uint32_t left, right, tmp; blowfish_decrypt_block() local
[all...]
/titanic_51/usr/src/cmd/cron/
H A Delm.c87 * right = points to the notice immediately following this one.
95 struct notice *right; }; member
106 * right = points to the key immediately following this one.
112 struct key *right; }; member
123 struct index *right; }; member
177 nprev->right = n;
184 kprev->right = k;
192 indprev->right = ind;
199 n->right = NULL;
200 nprev->right
[all...]
/titanic_51/usr/src/lib/libresolv2/common/isc/
H A Dtree.c111 RET(tree_srch(&(**ppr_tree).right, in tree_srch()
164 if (!tree_trav(&(**ppr_tree).right, pfi_uar)) in tree_trav()
174 tree_mung(&(**ppr_tree).right, pfv_uar); in tree_mung()
200 (*ppr)->right = NULL; in sprout()
222 /* right branch WAS longer; bal is ok now */ in sprout()
238 (*ppr)->left = p1->right; in sprout()
239 p1->right = *ppr; in sprout()
245 p2 = p1->right; in sprout()
246 p1->right = p2->left; in sprout()
249 (*ppr)->left = p2->right; in sprout()
[all...]
/titanic_51/usr/src/cmd/print/printmgr/com/sun/admin/pm/client/
H A DBST.java44 public BST right = null; field in BST
53 left = right = null; in BST()
82 if (right != null) in insert()
83 right.insert(theItem); in insert()
85 right = node = new BST(theItem); in insert()
116 if (right != null) in find_tree()
117 rv = right.find_tree(newKey, exactMatch); in find_tree()
139 if (right != null) in find()
140 rv = right.find(newKey, exactMatch); in find()
155 if (right ! in traverse()
[all...]
/titanic_51/usr/src/lib/libast/common/cdt/
H A Ddttree.c63 t = root->right;
77 { while((t = root->right) )
102 l->right = root->left;
103 r->left = root->right;
133 if(!(t = cmp < 0 ? t->left : t->right) )
150 root = t->right;
154 { t = root->right;
158 root = t->right;
190 if(!(root = t->right) )
201 { if((t = root->right) )
[all …]
H A Ddthash.c86 { r = t->right;
91 p->right = r;
93 t->right = *is; *is = t;
138 { r = t->right;
156 for(; t->right; t = t->right)
172 for(p = NIL(Dtlink_t*), t = *s; t; p = t, t = t->right)
208 for(p = NIL(Dtlink_t*); t; p = t, t = t->right)
226 p->right = t->right;
227 t->right = *s;
271 { r->right = t->right;
[all …]
H A Ddtrenew.c50 { if(!e->right ) /* make left child the new root */
53 { dt->data->here = e->right;
57 { for(t = e->right; t->left; t = t->left)
66 *s = e->right;
68 { for(; t->right != e; t = t->right)
70 t->right = e->right;
H A Ddtlist.c65 { t = r->right;
100 t->left->right = r;
101 r->right = t;
108 r->right = t = dt->data->head;
118 { t->left->right = r;
126 r->right = NIL(Dtlink_t*);
138 for(r = dt->data->head; r; r = r->right)
151 if(r->right)
152 r->right->left = r->left;
154 { dt->data->head = r->right;
[all …]
H A Ddtflatten.c48 last->right = t;
50 while(last->right)
51 last = last->right;
61 for(list = last = r, r = r->right; r; last = r, r = r->right)
66 last->right = r;
H A Ddttreeset.c44 l = l->right;
46 mid = l->right; l->right = NIL(Dtlink_t*);
48 mid->right = treebalance(mid->right, size - (n + 1));
H A Ddthdr.h68 #define rrotate(x,y) ((x)->left = (y)->right, (y)->right = (x))
69 #define lrotate(x,y) ((x)->right = (y)->left, (y)->left = (x))
71 #define llink(l,x) ((l) = (l)->right = (x) )
/titanic_51/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)))
96 Freehdr right; /* Right tree pointer */ member
230 tree = &x->right; in insert()
245 right_hook = &newhdr->right; in insert()
248 newhdr->right = NIL; in insert()
256 * it is always set to the address of a .right link in insert()
268 left_hook = &x->right; in insert()
269 x = x->right; in insert()
272 * rewrite link crossing from the right in insert()
[all...]
/titanic_51/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()
107 k = k->right; in il_shift()
124 fk->right = k; in il_shift()
125 k->left->right = fk; in il_shift()
238 kleft->right = k; in el_init()
267 k->right = NULL; in el_init()
268 kleft->right = k; in el_init()
356 /* find the right ke in el_add()
[all...]
/titanic_51/usr/src/cmd/make/lib/mksh/
H A Dmisc.cc956 node = node->right; in lookup()
983 if (node->right != 0) { in insert()
984 node = node->right; in insert()
989 node->right = new entry(name, node); in insert()
1020 if (node->right != 0) { in insert()
1021 node = node->right; in insert()
1023 node->right = new entry(name, node); in insert()
1040 entry *right = node->right; in rebalance() local
1043 unsigned rdepth = (right ! in rebalance()
[all...]
/titanic_51/usr/src/tools/scripts/
H A Dbringovercheck.sh46 right=$(/bin/ls -E "$2" 2>/dev/null | awk '{print $7}')
47 right=${right##*.}
48 [ -z "$left" -o -z "$right" -o "$left" -gt "$right" ] && return 0
/titanic_51/usr/src/lib/libbc/libc/gen/common/
H A Dmalloc.c42 * D(right(s)), we have:
181 fpp = &x->right; in insert()
199 newhdr->right = NIL; in insert()
210 right_hook = &newhdr->right; in insert()
216 * it is always set to the address of a .right link in insert()
228 left_hook = &x->right; in insert()
229 x = x->right; in insert()
232 * rewrite link crossing from the right in insert()
250 * The left and right branches of the node to be deleted define two
264 Freehdr right_branch; /* right subtre in delete()
[all...]
/titanic_51/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
70 * to "left", the code also works for right handed trees. The
74 * // 1 for dealing with right children
77 * // +1 when right subtree is taller
79 * int right; // will be the opposite of left (0 or 1)
82 * int direction; // 0 for "<" (ie. left child); 1 for ">" (right)
111 * left and right children when examining a tree. C "if()" statements
128 * - otherwise we return through parent nodes until we've come from a right
140 int right = 1 - left; avl_walk() local
306 int right = 1 - left; avl_rotation() local
687 int right; avl_remove() local
[all...]
/titanic_51/usr/src/common/atomic/sparc/
H A Datomic.s91 and %o0, 0x3, %o4 ! %o4 = byte offset, left-to-right
92 xor %o4, 0x3, %g1 ! %g1 = byte offset, right-to-left
93 sll %g1, 3, %g1 ! %g1 = bit offset, right-to-left
163 and %o0, 0x2, %o4 ! %o4 = byte offset, left-to-right
164 xor %o4, 0x2, %g1 ! %g1 = byte offset, right-to-left
165 sll %o4, 3, %o4 ! %o4 = bit offset, left-to-right
166 sll %g1, 3, %g1 ! %g1 = bit offset, right-to-left
328 and %o0, 0x3, %o4 ! %o4 = byte offset, left-to-right
329 xor %o4, 0x3, %g1 ! %g1 = byte offset, right-to-left
330 sll %g1, 3, %g1 ! %g1 = bit offset, right
[all...]
/titanic_51/usr/src/common/atomic/sparcv9/
H A Datomic.s212 and %o0, 0x3, %o4 ! %o4 = byte offset, left-to-right
213 xor %o4, 0x3, %g1 ! %g1 = byte offset, right-to-left
214 sll %g1, 3, %g1 ! %g1 = bit offset, right-to-left
284 and %o0, 0x2, %o4 ! %o4 = byte offset, left-to-right
285 xor %o4, 0x2, %g1 ! %g1 = byte offset, right-to-left
286 sll %o4, 3, %o4 ! %o4 = bit offset, left-to-right
287 sll %g1, 3, %g1 ! %g1 = bit offset, right-to-left
453 and %o0, 0x3, %o4 ! %o4 = byte offset, left-to-right
454 xor %o4, 0x3, %g1 ! %g1 = byte offset, right-to-left
455 sll %g1, 3, %g1 ! %g1 = bit offset, right
[all...]
/titanic_51/usr/src/cmd/fm/modules/common/eversholt/
H A Deft_mdb.c518 (void) eft_node((uintptr_t)node.u.expr.right, DCMD_ADDRSPEC, 0, in eft_node()
526 (void) eft_node((uintptr_t)node.u.expr.right, DCMD_ADDRSPEC, 0, in eft_node()
535 (void) eft_node((uintptr_t)node.u.expr.right, DCMD_ADDRSPEC, 0, in eft_node()
543 (void) eft_node((uintptr_t)node.u.expr.right, DCMD_ADDRSPEC, 0, in eft_node()
555 (void) eft_node((uintptr_t)node.u.expr.right, DCMD_ADDRSPEC, 0, in eft_node()
562 (void) eft_node((uintptr_t)node.u.expr.right, DCMD_ADDRSPEC, 0, in eft_node()
569 (void) eft_node((uintptr_t)node.u.expr.right, DCMD_ADDRSPEC, 0, in eft_node()
576 (void) eft_node((uintptr_t)node.u.expr.right, DCMD_ADDRSPEC, 0, in eft_node()
583 (void) eft_node((uintptr_t)node.u.expr.right, DCMD_ADDRSPEC, 0, in eft_node()
590 (void) eft_node((uintptr_t)node.u.expr.right, DCMD_ADDRSPE in eft_node()
[all...]
/titanic_51/usr/src/cmd/fm/eversholt/common/
H A Dptree.c160 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
180 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
193 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
200 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
207 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
214 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
221 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
228 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
235 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
242 ptree(flags, np->u.expr.right, no_iterator in ptree()
[all...]
/titanic_51/usr/src/lib/libdwarf/common/
H A Dpro_die.c56 parent,child,left,right: specify neighbors of the new die. Only
64 Dwarf_P_Die left, Dwarf_P_Die right, Dwarf_Error * error) in dwarf_new_die() argument
83 dwarf_die_link(new_die, parent, child, left, right, error); in dwarf_new_die()
89 parent,child,left,right: specify neighbors of the new die. Only
96 Dwarf_P_Die left, Dwarf_P_Die right, Dwarf_Error * error) in dwarf_die_link() argument
138 /* There's already a right sibling of left, in dwarf_die_link()
151 if (right != NULL) { in dwarf_die_link()
153 new_die->di_right = right; in dwarf_die_link()
154 if (right->di_left) { in dwarf_die_link()
155 /* There is already a left sibling of the right di in dwarf_die_link()
[all...]
/titanic_51/usr/src/lib/libast/common/misc/
H A Dfts.c86 FTSENT* right; /* right child */ \
254 #define RROTATE(r) (t = r->left, r->left = t->right, t->right = r, r = t)
255 #define LROTATE(r) (t = r->right, r->right = t->left, t->left = r, r = t)
263 register FTSENT* right; in search() local
267 left = right = lroot = rroot = 0; in search()
289 if (right) in search()
290 right->left = root; in search()
293 right = root; in search()
295 right->left = 0; in search()
303 if (root->right && (cmp = (*comparf)(&e, &root->right)) >= 0) in search()
[all …]
/titanic_51/usr/src/contrib/ast/src/lib/libast/misc/
H A Dfts.c86 FTSENT* right; /* right child */ \
254 #define RROTATE(r) (t = r->left, r->left = t->right, t->right = r, r = t)
255 #define LROTATE(r) (t = r->right, r->right = t->left, t->left = r, r = t)
263 register FTSENT* right; in search() local
267 left = right = lroot = rroot = 0; in search()
286 * stick all things > e to the right tree in search()
289 if (right) in search()
350 register FTSENT* right; deleteroot() local
[all...]

12345678910>>...14