| /netbsd/src/external/bsd/pcc/dist/pcc/cc/cpp/ |
| D | cpy.y | 87 %term ANDAND OROR IDENT NUMBER UNUMBER DEFINED
95 %left OROR
160 | e OROR e {
|
| D | cpc.c | 119 qloop(eandand, n1, OROR, 0, 0, 0); in eoror()
258 if (op == OROR && n1->nd_val) { in eval()
276 case OROR: in eval()
|
| D | cpp.h | 170 OROR, ANDAND, DEFINED, LE, GE }; enumerator
|
| D | scanner.l | 162 <IFR>"||" { return OROR; }
|
| /netbsd/src/external/gpl3/binutils/dist/gold/ |
| D | yyscript.h | 65 OROR = 266, /* OROR */ enumerator
177 #define OROR 266 macro
|
| D | yyscript.y | 90 %left OROR
935 | exp OROR exp
|
| /netbsd/src/external/gpl3/binutils/dist/ld/ |
| D | ldgram.h | 69 OROR = 270, /* OROR */ enumerator
213 #define OROR 270 macro
|
| D | ldgram.y | 116 %left <token> OROR
1003 | exp OROR exp
1004 { $$ = exp_binop (OROR , $1, $3); }
|
| D | ldgram.c | 170 OROR = 270, /* OROR */ enumerator
314 #define OROR 270 macro
3931 { (yyval.etree) = exp_binop (OROR , (yyvsp[-2].etree), (yyvsp[0].etree)); } in yyparse()
|
| D | ldlex.l | 220 <EXPRESSION,MRI>"||" { RTOKEN(OROR); }
|
| D | ldexp.c | 98 { OROR, "||" }, in exp_print_token()
634 BOPN (OROR, ||); in fold_binary()
|
| /netbsd/src/external/gpl3/gdb/dist/gdb/ |
| D | m2-exp.y | 133 %left OROR
421 exp : exp OROR exp
698 {"OR" , OROR },
|
| D | go-exp.y | 172 %left OROR
393 exp : exp OROR exp
930 {"||", OROR, OP_NULL},
|
| D | cp-name-parser.y | 294 %left OROR
458 | OPERATOR OROR
1106 exp : exp OROR exp
1770 HANDLE_TOKEN2 ("||", OROR);
|
| D | d-exp.y | 161 %left OROR
224 | OrOrExpression OROR AndAndExpression
965 {"||", OROR, OP_NULL},
|
| D | c-exp.y | 253 %left OROR
801 exp : exp OROR exp
1760 | OPERATOR OROR
2475 {"||", OROR, OP_NULL, 0},
2531 {"or", OROR, OP_NULL, FLAG_CXX},
|
| D | rust-parse.c | 113 OROR, enumerator
177 { "||", OROR, OP_NULL },
1354 OPERATION (OROR, 1, logical_or_operation) in parse_binop()
|
| /netbsd/src/external/bsd/pcc/dist/pcc/cc/cxxcom/ |
| D | builtins.c | 469 p = buildtree(OROR, mtisnan(a->n_left), mtisnan(a->n_right)); in builtin_isunordered()
481 p = buildtree(OROR, mtisnan(a->n_left), mtisnan(a->n_right)); in builtin_isany()
517 p = buildtree(OROR, mtisnan(a->n_left), mtisnan(a->n_right)); in builtin_islessgreater()
523 q = buildtree(OROR, q, r); in builtin_islessgreater()
|
| D | trees.c | 180 if (o == ANDAND || o == OROR || o == NOT) { in buildtree()
259 case OROR: in buildtree()
954 case OROR: in conval()
1685 case OROR: in opact()
1952 if (p->n_op == QUEST || p->n_op == ANDAND || p->n_op == OROR) in comops()
2120 case OROR: in andorbr()
2251 case OROR: in rmcops()
3157 SNAM(OROR,||) in copst()
3219 case OROR:
|
| D | pass1.h | 580 #define OROR (MAXOP+12) macro
|
| /netbsd/src/external/bsd/pcc/dist/pcc/arch/vax/ |
| D | order.c | 193 case OROR:
279 case OROR:
|
| /netbsd/src/external/bsd/pcc/dist/pcc/cc/ccom/ |
| D | builtins.c | 635 p = buildtree(OROR, mtisnan(a->n_left), mtisnan(a->n_right)); in builtin_isunordered()
647 p = buildtree(OROR, mtisnan(a->n_left), mtisnan(a->n_right)); in builtin_isany()
683 p = buildtree(OROR, mtisnan(a->n_left), mtisnan(a->n_right)); in builtin_islessgreater()
689 q = buildtree(OROR, q, r); in builtin_islessgreater()
|
| D | trees.c | 183 if (o == ANDAND || o == OROR || o == NOT) { in buildtree()
262 case OROR: in buildtree()
1029 case OROR: in conval()
1782 case OROR: in opact()
2024 if (p->n_op == QUEST || p->n_op == ANDAND || p->n_op == OROR) in comops()
2192 case OROR: in andorbr()
2323 case OROR: in rmcops()
3253 SNAM(OROR,||) in copst()
3320 case OROR:
|
| D | pass1.h | 633 #define OROR (MAXOP+12) macro
|
| D | optim.c | 468 case OROR: in optim()
|