/opensolaris-onvv-gate/usr/src/cmd/cron/ |
H A D | elm.c | 88 * right = points to the notice immediately following this one. 96 struct notice *right; }; member in struct:notice 107 * right = points to the key immediately following this one. 113 struct key *right; }; member in struct:key 124 struct index *right; }; member in struct:index 178 nprev->right = n; 185 kprev->right = k; 193 indprev->right = ind; 200 n->right = NULL; 201 nprev->right [all...] |
/opensolaris-onvv-gate/usr/src/tools/scripts/ |
H A D | bringovercheck.sh | 46 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
|
/opensolaris-onvv-gate/usr/src/common/net/wanboot/crypt/ |
H A D | des.c | 213 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...] |
/opensolaris-onvv-gate/usr/src/lib/libast/common/cdt/ |
H A D | dtrenew.c | 50 { 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 D | dtflatten.c | 48 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 D | dttreeset.c | 44 l = l->right; 46 mid = l->right; l->right = NIL(Dtlink_t*); 48 mid->right = treebalance(mid->right, size - (n + 1));
|
H A D | dthdr.h | 68 #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 D | dttree.c | 63 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 D | dthash.c | 86 { 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 D | dtlist.c | 65 { 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 D | dtsize.c | 35 { return e ? treecount(e->left) + treecount(e->right) + 1 : 0; 54 { for(size = 0, t = dt->data->head; t; t = t->right)
|
H A D | dtrestore.c | 62 list = t->right; 63 t->right = NIL(Dtlink_t*); 70 { t = list->right;
|
H A D | dtmethod.c | 72 for(t = r->right; t; r = t, t = t->right ) 82 { r = list->right; 95 { r = list->right;
|
/opensolaris-onvv-gate/usr/src/cmd/print/printmgr/com/sun/admin/pm/client/ |
H A D | BST.java | 44 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...] |
/opensolaris-onvv-gate/usr/src/lib/libresolv2/common/isc/ |
H A D | tree.c | 111 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...] |
/opensolaris-onvv-gate/usr/src/cmd/perl/5.8.4/distrib/t/op/ |
H A D | qq.t | 14 my($left, $right) = @_; 16 if ($left eq $right) { 21 foreach ($left, $right) { 30 ), $test++, $left, $right;
|
H A D | write.t | 97 $right = 108 if (cat('Op_write.tmp') eq $right) 136 $right = 150 if (cat('Op_write.tmp') eq $right) 179 $right = 194 if (cat('Op_write.tmp') eq $right) 246 $right = 249 if (cat('Op_write.tmp') eq $right) 298 $right = " 12.95 00012.95\n"; 299 if (cat('Op_write.tmp') eq $right) [all...] |
/opensolaris-onvv-gate/usr/src/common/crypto/blowfish/ |
H A D | blowfish_impl.c | 363 #define ROUND(left, right, i) \ 365 (right) ^= F((left)); \ 367 (left) = (right); \ 368 (right) = tmp; 384 uint32_t left, right, tmp; local 394 right = b32[1]; 399 * Read input block and place in left/right in big-endian order. 403 right = htonl(*(uint32_t *)(void *)&block[4]); 409 right = ((uint32_t)block[4] << 24) 416 ROUND(left, right, 481 uint32_t left, right, tmp; local [all...] |
/opensolaris-onvv-gate/usr/src/psm/stand/boot/common/ |
H A D | 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))) 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...] |
/opensolaris-onvv-gate/usr/src/cmd/isns/isnsd/ |
H A D | isns_sched.h | 48 struct el_key *right; member in struct:el_key
|
H A D | sched.c | 94 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...] |
/opensolaris-onvv-gate/usr/src/cmd/troff/nroff.d/ |
H A D | tw.h | 67 char *right; /* ditto */ member in struct:t
|
/opensolaris-onvv-gate/usr/src/lib/libcurses/screen/ |
H A D | overlap.c | 56 top, bottom, left, right; local 72 left = _MAX(sbx, dbx); right = _MIN(sex, dex); 75 dey = bottom - dby - 1; dex = right - dbx - 1;
|
/opensolaris-onvv-gate/usr/src/cmd/sgs/m4/common/ |
H A D | m4y.y | 44 %right '!' '~' 48 %right POWER 49 %right UMINUS
|
/opensolaris-onvv-gate/usr/src/cmd/krb5/kadmin/gui/visualrt/sunsoft/jws/visual/rt/type/ |
H A D | InsetsConverter.java | 44 * An example of the inset string format: "top=14;left=5;bottom=10;right=4". 58 return /* NOI18N */"top=0;left=0;bottom=0;right=0;"; 70 s = s + /* NOI18N */"right=" + insets.right + /* NOI18N */";"; 113 (/* NOI18N */"right")) { 130 if (table.containsKey(/* NOI18N */"right")) 131 insets.right = getIntegerFromTable(table, 132 /* NOI18N */"right"); 149 + i.bottom + /* NOI18N */", " + i.right
|