Lines Matching refs:left
242 assign(NODE *left, NODE *right)
250 switch (left->n_type) {
252 left = exprreduce(left);
255 return (nassign(left, right));
262 left = left->n_next;
266 return (lfield(exprint(left->n_left), right));
271 left->n_name);
284 node(int type, NODE *left, NODE *right)
289 np->n_left = left;
941 * In the interest of speed, a left recursive tree of CONCAT nodes
944 * routine, which allocates a large enough string when the left
1245 register NODE *left, *right;
1251 left = exprreduce(np->n_left);
1252 if (isreal(left->n_flags) ||
1253 (isstring(left->n_flags) && (type_of(left)&FVREAL))) {
1255 r1 = exprreal(left);
1258 i1 = exprint(left);
1342 register NODE *left, *right;
1348 left = np->n_left;
1349 if (isleaf(left->n_flags)) {
1350 if (left->n_type == PARM)
1351 left = left->n_next;
1353 left = exprreduce(left);
1354 tl = left->n_flags;
1374 cmp = wcscoll((wchar_t *)exprstring(left),
1377 r1 = exprreal(left);
1386 i1 = exprint(left);
1398 cmp = wcscoll((wchar_t *)exprstring(left),
1402 tl = type_of(left);
1408 r1 = exprreal(left);
1417 i1 = exprint(left);
1944 register NODE *left;
1954 left = np->n_left;
1956 if (left->n_type != IN)
1958 if ((var = left->n_left)->n_type == PARM)
1960 np = left->n_right;
2017 if ((left = symwalk(&nbuck, &np)) == NNULL)
2019 index = left->n_name;