Searched refs:PRED_AND_LIST (Results 1 – 9 of 9) sorted by relevance
78 if (second->expr == PRED_AND_LIST) {103 if (first->expr == PRED_AND_LIST) {129 if (first->expr == PRED_AND_LIST && second->expr == PRED_AND_LIST) {143 } else if (first->expr == PRED_AND_LIST && second->expr == PRED_OR_LIST) {154 } else if (first->expr == PRED_OR_LIST && second->expr == PRED_AND_LIST) {380 if (p->expr == PRED_AND_LIST) fprintf(output,"%s NAND (not AND) expr\n\n",p->expr);506 if (p->expr != PRED_AND_LIST &&728 p->expr == PRED_AND_LIST) {748 ** if (p->expr == PRED_AND_LIST) {802 p->expr != PRED_AND_LIST) {[all …]
48 char *PRED_AND_LIST = "AND"; variable469 root->expr = PRED_AND_LIST;618 if ( a->expr == PRED_AND_LIST || a->expr == PRED_OR_LIST )666 if ( a->expr == PRED_AND_LIST || a->expr == PRED_OR_LIST )714 if ( p->expr == PRED_AND_LIST || p->expr == PRED_OR_LIST )742 p->expr == PRED_AND_LIST ||
63 if (p->expr == PRED_AND_LIST ||
579 else if ( p->expr==PRED_AND_LIST || p->expr==PRED_OR_LIST ) {594 if ( p->expr == PRED_AND_LIST )733 } else if (p->expr == PRED_AND_LIST) {914 if ( p->expr == PRED_AND_LIST )1054 } else if (p->expr == PRED_AND_LIST && MR_allPredLeaves(p->down)) {1093 if ( p->expr == PRED_AND_LIST )
268 extern char *PRED_AND_LIST; /* MR10 */
521 predicate->expr == PRED_AND_LIST )
1494 if ( p->expr==PRED_AND_LIST || p->expr==PRED_OR_LIST )
1058 ANDnode->expr=PRED_AND_LIST; in predAndExpr()
1175 ANDnode->expr=PRED_AND_LIST;