| /onnv/onnv-gate/usr/src/cmd/print/printmgr/com/sun/admin/pm/client/ |
| 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 != null
[all...] |
| /onnv/onnv-gate/usr/src/cmd/isns/isnsd/ |
| isns_sched.h | 48 struct el_key *right; member in struct:el_key
|
| /onnv/onnv-gate/usr/src/lib/libcurses/screen/ |
| 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;
|
| /onnv/onnv-gate/usr/src/lib/libresolv2/include/isc/ |
| tree.h | 44 struct tree_s *left, *right; member in struct:tree_s
|
| /onnv/onnv-gate/usr/src/common/net/wanboot/crypt/ |
| 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 ^= (work << 2)
[all...] |
| /onnv/onnv-gate/usr/src/cmd/ldap/common/ |
| ldaptool.h | 208 struct Element *right; member in struct:Element
|
| /onnv/onnv-gate/usr/src/lib/libbc/libc/gen/common/ |
| mallint.h | 65 Freehdr right; /* Right tree pointer */ member in struct:freehdr
|
| /onnv/onnv-gate/usr/src/cmd/eqn/ |
| e.y | 41 %right FROM TO
43 %right SUP SUB
44 %right SIZE FONT ROMAN ITALIC BOLD FAT
45 %right UP DOWN BACK FWD
46 %left LEFT RIGHT
47 %right DOT DOTDOT HAT TILDE BAR UNDER VEC DYAD
106 | left eqn right { paren($1, $2, $3); }
150 right : RIGHT text { $$ = ((char *)$2)[0]; } label
151 | RIGHT '}' { $$ = '}';
[all...] |
| /onnv/onnv-gate/usr/src/cmd/logadm/ |
| glob.c | 93 char *right; local
101 if ((right = strchr(left, '}')) == NULL) {
109 /* stuff after "right" still need processing */
110 sp = right + 1;
112 if (left + 1 == right)
115 /* stuff between "left" and "right" is comma-sep list */
127 fn_list_appendrange(ret, left, right);
|
| /onnv/onnv-gate/usr/src/cmd/troff/nroff.d/ |
| tw.h | 67 char *right; /* ditto */ member in struct:t
|
| /onnv/onnv-gate/usr/src/lib/libeti/form/common/ |
| chg_field.c | 121 /* right - return active field on page right of f */
123 right(FIELD *f) function
244 return (_set_current_field(f, right(C(f))));
|
| /onnv/onnv-gate/usr/src/cmd/sh/ |
| cmd.c | 187 struct trenod *right; local
190 right = makefork(FPIN, term(NLFLG));
191 return(makefork(0, makelist(TFIL, left, right)));
|
| /onnv/onnv-gate/usr/src/cmd/cron/ |
| 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 = n
[all...] |
| /onnv/onnv-gate/usr/src/cmd/sendmail/db/include/ |
| btree_auto.h | 51 db_pgno_t right; member in struct:_bam_split_args
|
| /onnv/onnv-gate/usr/src/common/crypto/blowfish/ |
| 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, 0)
481 uint32_t left, right, tmp; local
[all...] |
| /onnv/onnv-gate/usr/src/lib/libxcurses/src/libc/xcurses/ |
| mvcur.c | 177 * cursor_left/right.
187 static t_steps right = { __MOVE_TAB, __MOVE_RIGHT, __MOVE_LEFT }; local
198 dir = &right;
301 /* try out paramaterized left or right motion */
|
| /onnv/onnv-gate/usr/src/lib/libxcurses2/src/libc/xcurses/ |
| mvcur.c | 176 * cursor_left/right.
184 static t_steps right = { __MOVE_TAB, __MOVE_RIGHT, __MOVE_LEFT }; local
195 dir = &right;
299 /* try out paramaterized left or right motion */
383 /* Force absolute position at bottom right because we */
|
| /onnv/onnv-gate/usr/src/cmd/filebench/common/ |
| fb_avl.c | 35 * any given node, the left and right subtrees are allowed to differ in height
63 * - The left/right children pointers of a node are in an array.
65 * left and right indices. The implementation is written as if it only
67 * to "left", the code also works for right handed trees. The
71 * // 1 for dealing with right children
74 * // +1 when right subtree is taller
76 * int right; // will be the opposite of left (0 or 1)
79 * int direction; // 0 for "<" (ie. left child); 1 for ">" (right)
99 * left and right children when examining a tree. C "if()" statements
116 * - otherwise we return thru parent nodes until we've come from a right child
127 int right = 1 - left; local
297 int right = 1 - left; local
662 int right; local
[all...] |
| /onnv/onnv-gate/usr/src/cmd/fmli/oh/ |
| scram.c | 333 int left, right; local
367 unsigned int left, right; local
371 right = clock & 0177;
372 buf[0] = right;
375 right = (right + n + (right & 0125)) & 0177;
376 if (right == 0177) right = n;
377 buf[n] = right;
[all...] |
| /onnv/onnv-gate/usr/src/lib/libcmd/common/ |
| expr.c | 401 register char *left,*right; local
414 right = rp.str;
416 sfsprintf(right=buff2,sizeof(buff2),"%d",rp.num);
421 np->num = streq(left,right);
424 np->num = (strcoll(left,right)>0);
427 np->num = (strcoll(left,right)<0);
430 np->num = (strcoll(left,right)>=0);
433 np->num = (strcoll(left,right)<=0);
436 np->num = !streq(left,right);
|
| /onnv/onnv-gate/usr/src/common/avl/ |
| avl.c | 33 * any given node, the left and right subtrees are allowed to differ in height
61 * - The left/right children pointers of a node are in an array.
63 * left and right indices. The implementation is written as if it only
65 * to "left", the code also works for right handed trees. The
69 * // 1 for dealing with right children
72 * // +1 when right subtree is taller
74 * int right; // will be the opposite of left (0 or 1)
77 * int direction; // 0 for "<" (ie. left child); 1 for ">" (right)
100 * left and right children when examining a tree. C "if()" statements
117 * - otherwise we return thru parent nodes until we've come from a right child
128 int right = 1 - left; local
294 int right = 1 - left; local
672 int right; local
[all...] |
| /onnv/onnv-gate/usr/src/cmd/awk/ |
| b.c | 44 #define right(v) (v)->narg[1] macro
53 * left is index, right contains value or pointer to value
54 * unary (STAR, PLUS, QUEST): left is child, right is null
55 * binary (CAT, OR): left and right are children
208 penter(right(p));
210 parent(right(p)) = p;
232 freetr(right(p));
313 f->re[(int)left(v)].lval = (int)right(v);
333 cfoll(f, right(v));
355 if (type(p) == CCL && (*(uchar *)right(p)) == '\0'
[all...] |
| /onnv/onnv-gate/usr/src/lib/libeti/menu/inc/ |
| menu.h | 71 struct ITEM *right; member in struct:ITEM
|
| /onnv/onnv-gate/usr/src/psm/stand/boot/common/ |
| 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;
[all...] |
| /onnv/onnv-gate/usr/src/lib/libparted/common/lib/ |
| quotearg.c | 220 should translate "'" to U+201D (RIGHT DOUBLE QUOTATION
223 U+2019 (RIGHT SINGLE QUOTATION MARK), respectively.
230 char const *right = gettext_quote (N_("'"), quoting_style); local
234 quote_string = right;
|
