Searched defs:right (Results 1 - 21 of 21) sorted by relevance

/ast/src/lib/libexpr/
H A Dexgram.h53 exnewnode(Expr_t* p, int op, int binary, int type, Exnode_t* left, Exnode_t* right) argument
64 x->data.operand.right = right;
134 if (x->data.operand.right)
135 exfreenode(p, x->data.operand.right);
367 args = args->data.operand.right;
403 args = args->data.operand.right;
452 args = args->data.operand.right;
580 args = args->data.operand.right;
H A Dexpr.h163 Exnode_t* right; /* right operand */ member in struct:Exdata_u::__anon354
191 Exshort_t binary; /* data.operand.{left,right} ok */
/ast/src/lib/libardir/
H A Dar-omf.c62 static int namcomp(Dt_t *dp, Void_t *left, Void_t *right, Dtdisc_t *dsp) argument
65 char *r= (char*)right;
72 static int offcomp(Dt_t *dp, Void_t *left, Void_t *right, Dtdisc_t *dsp) argument
75 off_t r= *((off_t*)right);
/ast/src/lib/libcmd/
H A Dexpr.c401 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);
/ast/src/cmd/ksh93/bltins/
H A Dtest.c464 int test_binop(Shell_t *shp,register int op,const char *left,const char *right) argument
471 while(*right=='0')
472 right++;
474 rnum = sh_arith(shp,right);
483 return(test_strmatch(shp, left, right));
485 return(!test_strmatch(shp, left, right));
487 return(strcoll(left, right)>0);
489 return(strcoll(left, right)<0);
491 return(strcmp(left, right)==0);
493 return(strcmp(left, right)!
[all...]
/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; local
267 left = right = lroot = rroot = 0;
286 * stick all things > e to the right tree
289 if (right)
350 register FTSENT* right; local
[all...]
/ast/src/lib/librecsort/
H A Drecsort.h74 Rsobj_t* right; /* next record in sorted list */ member in struct:_rsobj_s
/ast/src/lib/libtk/generic/
H A Dtk3d.c230 * forms the right side. */
237 GC left, right;
255 right = borderPtr->darkGC;
263 XFillRectangle(display, drawable, right, x+half, y,
267 right = borderPtr->lightGC;
302 int leftIn, rightIn; /* Describes whether the left and right
737 * -borderWidth units wide on the right side, if borderWidth
759 * relative to stuff on right. */
887 * 3. Compute b by shifting p1Ptr-perp to the right and
1005 * trajectory relative to right
235 GC left, right; local
[all...]
H A DtkCanvas.c1657 * order to make the overlaps look right).
1669 * pixel too far to the right). To handle this problem,
1932 int x2, y2; /* Lower right corner of area to redraw.
3660 int left, right, top, bottom, delta;
3694 * canvas in the view. The variables left, right, etc. keep track of
3705 right = canvasPtr->scrollX2
3710 if ((left < 0) && (right > 0)) {
3711 delta = (right > -left) ? -left : right;
3716 } else if ((right <
3630 int left, right, top, bottom, delta; local
[all...]
H A DtkListbox.c30 * left bearing and right bearing). */
1042 int left, right; /* Non-zero values here indicate
1043 * that the left or right edge of
1082 left = right = 0;
1088 right = listPtr->selBorderWidth+1;
1109 * 1. The left and right bevels may not be visible if horizontal
1110 * scrolling is enabled (the "left" and "right" variables
1115 * 3. If the left or right bevel isn't visible, then the "left"
1116 * and "right" variables, computed above, have non-zero values
1126 if (right
1037 int left, right; /* Non-zero values here indicate local
[all...]
/ast/src/cmd/mailx/port/
H A Dcdt.h182 { Dtlink_t* right; /* right child */ member in struct:_dtlink_s
312 #define dtlink(d,e) (((Dtlink_t*)(e))->right)
/ast/src/cmd/sortlib/sync/
H A Dss.h126 Ssop_t right; /* right operand */ member in struct:Ssexpr_s
/ast/src/lib/libtksh/tcl/
H A DtclCmdMZ.c1125 int left = 0, right = 0;
1306 left = right = 1;
1330 if (right) {
1353 right = 1;
1116 int left = 0, right = 0; local
/ast/src/lib/libast/include/
H A Dcdt.h85 Dtlink_t* right; /* right child */ member in struct:_dtlink_s
92 { Dtlink_t* __rght; /* right child or next */
/ast/src/cmd/html/
H A Dtroff2html.h274 int right; /* right justify `center' */ member in struct:State_s::__anon100
/ast/src/cmd/ksh93/sh/
H A Dparse.c408 * This routine parses up the matching right parenthesis and returns
493 register Shnode_t *left, *right; local
522 if(right=sh_cmd(lexp,sym,flag|SH_EMPTY))
523 left=makelist(lexp,TLST, left, right);
959 /* shift right */
H A Dxec.c2840 register char *right; local
2846 right = sh_macpat(shp,&(t->lst.lstrit->arg),((n==TEST_PEQ||n==TEST_PNE)?ARG_EXP:0)|OPTIMIZE);
2885 argv[3] = right;
2890 n = test_binop(shp,n,left,right);
2895 out_pattern(sfstderr,right,-1);
2897 sfputr(sfstderr,sh_fmtq(right),-1);
/ast/src/lib/libast/vmalloc/
H A Dvmhdr.h208 ** ALIGNA right, then the code below should be commented out and ALIGNA
261 Block_t* right; /* right child in free tree */ member in struct:_body_s
349 #define RIGHT(b) ((b)->body.body.right)
/ast/src/cmd/INIT/
H A Dmamake.c166 struct Dict_item_s* right; /* right child */ member in struct:Dict_item_s
485 register Dict_item_t* right; local
490 left = right = lroot = rroot = 0;
499 ROTATE(root, left, right, t);
503 if (right)
504 right->left = root;
507 right = root;
509 right->left = 0;
513 if (root->right
574 register Dict_item_t* right; local
[all...]
/ast/src/cmd/codexlib/lzh/
H A Dlzh.c80 ui2 right[2 * NC - 1]; member in struct:State_s
250 state->right[available] = state->left[available] = 0;
254 p = &state->right[*p];
315 state->right[avail] = state->left[avail] = 0;
318 if (k & mask) p = &state->right[*p];
396 c = ((b <<= 1) & 0x100) ? state->right[c] : state->left[c];
819 j = state->right[j];
845 j = state->right[j];
882 j = ((b <<= 1) & 0x10) ? state->right[j] : state->left[j];
902 j = ((b <<= 1) & 0x100) ? state->right[
[all...]
/ast/src/lib/libast/regex/
H A Dreglib.h94 #define REX_CONJ_RIGHT 12 /* REX_CONJ right catcher */
320 struct Rex_s* cont; /* right catcher */
327 struct Rex_s* right; /* right pattern */ member in struct:Conj_left_s
328 struct Rex_s* cont; /* right catcher */
347 ssize_t right; member in struct:Bm_s
372 struct Rex_s* right; member in struct:Binary_s
514 Conj_right_t conj_right; /* conj right catcher */

Completed in 94 milliseconds