Searched refs:right (Results 1 - 25 of 178) sorted by relevance

12345678

/illumos-gate/usr/src/cmd/cron/
H A Delm.c87 * right = points to the notice immediately following this one.
95 struct notice *right; }; member in struct:notice
106 * right = points to the key immediately following this one.
112 struct key *right; }; member in struct:key
123 struct index *right; }; member in struct:index
177 nprev->right = n;
184 kprev->right = k;
192 indprev->right = ind;
199 n->right = NULL;
200 nprev->right
[all...]
/illumos-gate/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
/illumos-gate/usr/src/common/net/wanboot/crypt/
H A Ddes.c213 uint32_t right; local
216 /* Read input block and place in left/right in big-endian order */
221 right = ((uint32_t)block[4] << 24) |
232 * input bits 2, 3, 4, ... 1 and "right" contains 33, 34, 35, ... 32
237 work = ((left >> 4) ^ right) & 0x0f0f0f0f;
238 right ^= work;
240 work = ((left >> 16) ^ right) & 0xffff;
241 right ^= work;
243 work = ((right >> 2) ^ left) & 0x33333333;
245 right
[all...]
/illumos-gate/usr/src/lib/libast/common/cdt/
H A Ddtrenew.c50 { if(!e->right ) /* make left child the new root */
52 else /* make right child the new root */
53 { dt->data->here = e->right;
55 /* merge left subtree to right subtree */
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;
[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) )
H A Ddttree.c63 t = root->right;
77 { while((t = root->right) )
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) )
150 root = t->right;
154 { t = root->right;
158 root = t->right;
190 if(!(root = t->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;
[all...]
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 Ddtsize.c35 { return e ? treecount(e->left) + treecount(e->right) + 1 : 0;
54 { for(size = 0, t = dt->data->head; t; t = t->right)
H A Ddtrestore.c62 list = t->right;
63 t->right = NIL(Dtlink_t*);
70 { t = list->right;
H A Ddtmethod.c72 for(t = r->right; t; r = t, t = t->right )
82 { r = list->right;
95 { r = list->right;
/illumos-gate/usr/src/cmd/print/printmgr/com/sun/admin/pm/client/
H A DBST.java44 public BST right = null; field in class:BST
53 left = right = null;
82 if (right != null)
83 right.insert(theItem);
85 right = node = new BST(theItem);
116 if (right != null)
117 rv = right.find_tree(newKey, exactMatch);
139 if (right != null)
140 rv = right.find(newKey, exactMatch);
155 if (right !
[all...]
/illumos-gate/usr/src/lib/libresolv2/common/isc/
H A Dtree.c111 RET(tree_srch(&(**ppr_tree).right,
164 if (!tree_trav(&(**ppr_tree).right, pfi_uar))
174 tree_mung(&(**ppr_tree).right, pfv_uar);
200 (*ppr)->right = NULL;
222 /* right branch WAS longer; bal is ok now */
238 (*ppr)->left = p1->right;
239 p1->right = *ppr;
245 p2 = p1->right;
246 p1->right = p2->left;
249 (*ppr)->left = p2->right;
[all...]
/illumos-gate/usr/src/common/crypto/blowfish/
H A Dblowfish_impl.c361 #define ROUND(left, right, i) \
363 (right) ^= F((left)); \
365 (left) = (right); \
366 (right) = tmp;
379 uint32_t left, right, tmp; local
389 right = b32[1];
394 * Read input block and place in left/right in big-endian order.
398 right = htonl(*(uint32_t *)(void *)&block[4]);
404 right = ((uint32_t)block[4] << 24)
411 ROUND(left, right,
474 uint32_t left, right, tmp; local
[all...]
/illumos-gate/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 in struct:freehdr
230 tree = &x->right;
245 right_hook = &newhdr->right;
248 newhdr->right = NIL;
256 * it is always set to the address of a .right link
268 left_hook = &x->right;
269 x = x->right;
272 * rewrite link crossing from the right
[all...]
/illumos-gate/usr/src/cmd/isns/isnsd/
H A Disns_sched.h48 struct el_key *right; member in struct:el_key
H A Dsched.c94 fk->left->right = fk->right;
95 fk->right->left = fk->left;
107 k = k->right;
124 fk->right = k;
125 k->left->right = fk;
238 kleft->right = k;
267 k->right = NULL;
268 kleft->right = k;
356 /* find the right ke
[all...]
/illumos-gate/usr/src/cmd/troff/nroff.d/
H A Dtw.h67 char *right; /* ditto */ member in struct:t
/illumos-gate/usr/src/lib/libcurses/screen/
H A Doverlap.c56 top, bottom, left, right; local
72 left = _MAX(sbx, dbx); right = _MIN(sex, dex);
75 dey = bottom - dby - 1; dex = right - dbx - 1;
/illumos-gate/usr/src/cmd/sgs/m4/common/
H A Dm4y.y44 %right '!' '~'
48 %right POWER
49 %right UMINUS
/illumos-gate/usr/src/lib/libbc/libc/gen/common/
H A Dmalloc.c42 * D(right(s)), we have:
181 fpp = &x->right;
199 newhdr->right = NIL;
210 right_hook = &newhdr->right;
216 * it is always set to the address of a .right link
228 left_hook = &x->right;
229 x = x->right;
232 * rewrite link crossing from the right
250 * The left and right branches of the node to be deleted define two
264 Freehdr right_branch; /* right subtre
[all...]
/illumos-gate/usr/src/cmd/make/lib/mksh/
H A Dmisc.cc956 node = node->right;
983 if (node->right != 0) {
984 node = node->right;
989 node->right = new entry(name, node);
1020 if (node->right != 0) {
1021 node = node->right;
1023 node->right = new entry(name, node);
1040 entry *right = node->right; local
1043 unsigned rdepth = (right !
[all...]
/illumos-gate/usr/src/tools/ctf/dwarf/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)
83 dwarf_die_link(new_die, parent, child, left, right, error);
89 parent,child,left,right: specify neighbors of the new die. Only
96 Dwarf_P_Die left, Dwarf_P_Die right, Dwarf_Error * error)
138 /* There's already a right sibling of left,
151 if (right != NULL) {
153 new_die->di_right = right;
154 if (right->di_left) {
155 /* There is already a left sibling of the right di
60 dwarf_new_die(Dwarf_P_Debug dbg, Dwarf_Tag tag, Dwarf_P_Die parent, Dwarf_P_Die child, Dwarf_P_Die left, Dwarf_P_Die right, Dwarf_Error * error) argument
93 dwarf_die_link(Dwarf_P_Die new_die, Dwarf_P_Die parent, Dwarf_P_Die child, Dwarf_P_Die left, Dwarf_P_Die right, Dwarf_Error * error) argument
[all...]

Completed in 140 milliseconds

12345678