Searched refs:cond_code (Results 1 - 25 of 50) sorted by relevance

12

/netbsd-current/external/gpl3/gcc.old/dist/gcc/
H A Dgimple-ssa-warn-alloca.c208 enum tree_code cond_code = gimple_cond_code (last); local
212 cond_code = invert_tree_comparison (cond_code, false);
223 if ((cond_code == LE_EXPR
224 || cond_code == LT_EXPR
225 || cond_code == GT_EXPR
226 || cond_code == GE_EXPR)
234 if ((cond_code == LT_EXPR && tst == -1)
235 || (cond_code == LE_EXPR && (tst == -1 || tst == 0)))
242 if (cond_code
[all...]
H A Dtree-ssa-threadedge.c448 enum tree_code cond_code; local
452 cond_code = gimple_cond_code (stmt);
483 op0, cond_code, op1,
581 enum tree_code cond_code,
596 cond_code = swap_tree_comparison (cond_code);
604 if ((cond_code == EQ_EXPR || cond_code == NE_EXPR)
629 if (cond_code == NE_EXPR)
632 if (cond_code
577 simplify_control_stmt_condition_1(edge e, gimple *stmt, class avail_exprs_stack *avail_exprs_stack, tree op0, enum tree_code cond_code, tree op1, gcond *dummy_cond, pfn_simplify simplify, unsigned limit) argument
[all...]
H A Domp-general.h51 enum tree_code cond_code; member in struct:omp_for_data_loop
79 extern void omp_adjust_for_condition (location_t loc, enum tree_code *cond_code,
H A Dtree-ssa-uninit.c616 enum tree_code cond_code; member in struct:pred_info
708 one_pred.cond_code = gimple_cond_code (cond_stmt);
751 one_pred.cond_code = EQ_EXPR;
930 fprintf (dump_file, " %s ", op_symbol_code (one_pred.cond_code));
1356 cmp_code = the_pred.cond_code;
1421 c1 = x1.cond_code;
1423 && TREE_CODE_CLASS (x2.cond_code) == tcc_comparison)
1424 c2 = invert_tree_comparison (x2.cond_code, false);
1426 c2 = x2.cond_code;
1437 return ((pred.cond_code
[all...]
H A Domp-general.c93 omp_adjust_for_condition (location_t loc, enum tree_code *cond_code, tree *n2, argument
96 switch (*cond_code)
107 *cond_code = LT_EXPR;
111 *cond_code = GT_EXPR;
119 *cond_code = LT_EXPR;
124 *cond_code = GT_EXPR;
136 *cond_code = LT_EXPR;
144 *cond_code = GT_EXPR;
334 loop->cond_code = gimple_omp_for_cond (for_stmt, i);
336 gcc_assert (loop->cond_code !
[all...]
H A Dvr-values.c463 enum tree_code cond_code,
474 if ((POINTER_TYPE_P (type) && cond_code != NE_EXPR && cond_code != EQ_EXPR)
541 if (cond_code == LE_EXPR)
543 else if (cond_code == GT_EXPR)
548 else if (cond_code == EQ_EXPR)
573 else if (cond_code == NE_EXPR)
618 else if (cond_code == LE_EXPR || cond_code == LT_EXPR)
635 if (cond_code
462 extract_range_for_var_from_comparison_expr(tree var, enum tree_code cond_code, tree op, tree limit, value_range_equiv *vr_p) argument
714 enum tree_code cond_code; local
3446 test_for_singularity(enum tree_code cond_code, tree op0, tree op1, const value_range_equiv *vr) argument
3562 enum tree_code cond_code = gimple_cond_code (stmt); local
[all...]
H A Domp-grid.c510 (fd.loops[i].cond_code == LT_EXPR ? -1 : 1));
514 if (TYPE_UNSIGNED (itype) && fd.loops[i].cond_code == GT_EXPR)
864 if (fd.loops[i].cond_code == GT_EXPR)
1314 enum tree_code cond_code = gimple_omp_for_cond (inner_loop, i); local
1321 omp_adjust_for_condition (loc, &cond_code, &n2, index_var, step);
1325 tree cond = fold_build2 (cond_code, boolean_type_node, n1, n2);
1327 tree t = build_int_cst (itype, (cond_code == LT_EXPR ? -1 : 1));
1331 if (TYPE_UNSIGNED (itype) && cond_code == GT_EXPR)
1340 if (cond_code == GT_EXPR)
H A Domp-expand.c826 if (fd.loop.cond_code == LT_EXPR)
1571 gcc_assert (loop->cond_code == LT_EXPR || loop->cond_code == GT_EXPR);
1603 bool up = loop->cond_code == LT_EXPR;
1801 t = fold_binary (fd->loops[i].cond_code, boolean_type_node,
1818 && ((t = fold_binary (fd->loops[i].cond_code, boolean_type_node,
1831 cond_stmt = gimple_build_cond (fd->loops[i].cond_code, n1, n2,
1879 t = build_int_cst (itype, (fd->loops[i].cond_code == LT_EXPR
1892 if (TYPE_UNSIGNED (itype) && fd->loops[i].cond_code == GT_EXPR)
2084 t = fold_build2 (fd->loops[i].cond_code, boolean_type_nod
6023 enum tree_code cond_code = fd->loop.cond_code; local
[all...]
H A Dtree-ssa-phiopt.c1873 enum tree_code cond_code; local
1911 cond_code = gimple_cond_code (cond);
1912 if (cond_code != GT_EXPR && cond_code != GE_EXPR
1913 && cond_code != LT_EXPR && cond_code != LE_EXPR)
1934 if (cond_code == GT_EXPR || cond_code == GE_EXPR)
H A Dtree-ssa-threadbackward.c324 enum tree_code cond_code = gimple_cond_code (stmt); local
327 arg = fold_binary (cond_code, boolean_type_node,
H A Dtree-vrp.c1613 extract_code_and_val_from_cond_with_ops (tree name, enum tree_code cond_code, argument
1628 comp_code = swap_tree_comparison (cond_code);
1635 comp_code = cond_code;
1821 enum tree_code cond_code,
1828 if (!extract_code_and_val_from_cond_with_ops (name, cond_code,
2464 is_masked_range_test (tree name, tree valt, enum tree_code cond_code, argument
2492 bool is_range = cond_code == EQ_EXPR;
2534 enum tree_code cond_code, tree cond_op0,
2546 if (!extract_code_and_val_from_cond_with_ops (name, cond_code,
2553 register_edge_assert_for_2 (name, e, cond_code, cond_op
1820 register_edge_assert_for_2(tree name, edge e, enum tree_code cond_code, tree cond_op0, tree cond_op1, bool invert, vec<assert_info> &asserts) argument
2533 register_edge_assert_for(tree name, edge e, enum tree_code cond_code, tree cond_op0, tree cond_op1, vec<assert_info> &asserts) argument
[all...]
/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Dtree-ssa-threadedge.cc351 enum tree_code cond_code; local
355 cond_code = gimple_cond_code (stmt);
385 = simplify_control_stmt_condition_1 (e, stmt, op0, cond_code, op1,
482 enum tree_code cond_code,
495 cond_code = swap_tree_comparison (cond_code);
503 if ((cond_code == EQ_EXPR || cond_code == NE_EXPR)
527 if (cond_code == NE_EXPR)
530 if (cond_code
478 simplify_control_stmt_condition_1(edge e, gimple *stmt, tree op0, enum tree_code cond_code, tree op1, unsigned limit) argument
[all...]
H A Dgimple-predicate-analysis.cc91 tree_code c1 = x1.cond_code, c2;
93 c2 = invert_tree_comparison (x2.cond_code, false);
95 c2 = x2.cond_code;
180 fprintf (dump_file, " %s ", op_symbol_code (pred.cond_code));
344 tree_code code = get_cmp_code (pred.cond_code, false, pred.invert);
642 tree_code cond_code = pred.cond_code; local
647 cond_code = invert_tree_comparison (cond_code, false);
649 return build2 (cond_code, TREE_TYP
[all...]
H A Domp-general.h58 enum tree_code cond_code; member in struct:omp_for_data_loop
98 extern void omp_adjust_for_condition (location_t loc, enum tree_code *cond_code,
H A Dgimple-predicate-analysis.h35 enum tree_code cond_code; member in struct:pred_info
H A Domp-general.cc96 omp_adjust_for_condition (location_t loc, enum tree_code *cond_code, tree *n2, argument
99 switch (*cond_code)
110 *cond_code = LT_EXPR;
114 *cond_code = GT_EXPR;
122 *cond_code = LT_EXPR;
127 *cond_code = GT_EXPR;
139 *cond_code = LT_EXPR;
147 *cond_code = GT_EXPR;
419 loop->cond_code = gimple_omp_for_cond (for_stmt, i);
421 gcc_assert (loop->cond_code !
[all...]
H A Dtree-ssa-threadedge.h98 tree_code cond_code,
H A Dvr-values.cc514 enum tree_code cond_code,
525 if ((POINTER_TYPE_P (type) && cond_code != NE_EXPR && cond_code != EQ_EXPR)
592 if (cond_code == LE_EXPR)
594 else if (cond_code == GT_EXPR)
599 else if (cond_code == EQ_EXPR)
624 else if (cond_code == NE_EXPR)
669 else if (cond_code == LE_EXPR || cond_code == LT_EXPR)
686 if (cond_code
513 extract_range_for_var_from_comparison_expr(tree var, enum tree_code cond_code, tree op, tree limit, value_range_equiv *vr_p) argument
765 enum tree_code cond_code; local
3347 test_for_singularity(enum tree_code cond_code, tree op0, tree op1, const value_range *vr) argument
3566 enum tree_code cond_code = gimple_cond_code (stmt); local
[all...]
H A Domp-expand.cc790 if (fd.loop.cond_code == LT_EXPR)
1573 gcc_assert (loop->cond_code == LT_EXPR || loop->cond_code == GT_EXPR);
1605 bool up = loop->cond_code == LT_EXPR;
1852 t = fold_binary (fd->loops[i].cond_code, boolean_type_node,
1880 && ((t = fold_binary (fd->loops[i].cond_code, boolean_type_node,
1893 cond_stmt = expand_omp_build_cond (gsi, fd->loops[i].cond_code,
1932 t = build_int_cst (itype, (fd->loops[i].cond_code == LT_EXPR
1945 if (TYPE_UNSIGNED (itype) && fd->loops[i].cond_code == GT_EXPR)
2024 t = build_int_cst (itype, (fd->loops[o].cond_code
7541 enum tree_code cond_code = fd->loop.cond_code; local
[all...]
/netbsd-current/external/gpl3/binutils/dist/opcodes/
H A Dz8k-dis.c49 unsigned long cond_code; member in struct:__anon1168
397 instr_data->cond_code = instr_nibl;
585 sprintf (tmp_str, "%s", codes[instr_data->cond_code]);
/netbsd-current/external/gpl3/binutils.old/dist/opcodes/
H A Dz8k-dis.c49 unsigned long cond_code; member in struct:__anon2384
397 instr_data->cond_code = instr_nibl;
585 sprintf (tmp_str, "%s", codes[instr_data->cond_code]);
/netbsd-current/external/gpl3/gdb.old/dist/opcodes/
H A Dz8k-dis.c49 unsigned long cond_code; member in struct:__anon2327
397 instr_data->cond_code = instr_nibl;
585 sprintf (tmp_str, "%s", codes[instr_data->cond_code]);
/netbsd-current/external/gpl3/gdb/dist/opcodes/
H A Dz8k-dis.c49 unsigned long cond_code; member in struct:__anon1768
397 instr_data->cond_code = instr_nibl;
585 sprintf (tmp_str, "%s", codes[instr_data->cond_code]);
/netbsd-current/external/gpl3/gcc.old/dist/gcc/config/nds32/
H A Dnds32-md-auxiliary.c133 const char *cond_code; local
159 cond_code = nds32_cond_code_str (inverse_code);
179 cond_code, align);
185 cond_code, suffix, align);
190 cond_code = nds32_cond_code_str (code);
195 "b%ss38\t %%2, %%3", cond_code);
201 "b%s%s\t%%1, %%2, %%3", cond_code, suffix);
214 const char *cond_code; local
220 cond_code = nds32_cond_code_str (inverse_code);
232 cond_code, suffi
[all...]
/netbsd-current/external/gpl3/gcc/dist/gcc/config/nds32/
H A Dnds32-md-auxiliary.cc133 const char *cond_code; local
159 cond_code = nds32_cond_code_str (inverse_code);
179 cond_code, align);
185 cond_code, suffix, align);
190 cond_code = nds32_cond_code_str (code);
195 "b%ss38\t %%2, %%3", cond_code);
201 "b%s%s\t%%1, %%2, %%3", cond_code, suffix);
214 const char *cond_code; local
220 cond_code = nds32_cond_code_str (inverse_code);
232 cond_code, suffi
[all...]

Completed in 532 milliseconds

12