Lines Matching refs:oe
614 operand_entry *oe = operand_entry_pool.allocate ();
616 oe->op = op;
617 oe->rank = get_rank (op);
618 oe->id = next_operand_entry_id++;
619 oe->count = 1;
620 oe->stmt_to_insert = stmt_to_insert;
621 ops->safe_push (oe);
631 operand_entry *oe = operand_entry_pool.allocate ();
633 oe->op = op;
634 oe->rank = get_rank (op);
635 oe->id = next_operand_entry_id++;
636 oe->count = repeat;
637 oe->stmt_to_insert = NULL;
638 ops->safe_push (oe);
866 operand_entry *oe;
881 ops->iterate (i, &oe)
882 && oe->rank >= curr->rank - 1 ;
886 && ops_equal_values_p (oe->op, negateop))
893 print_generic_expr (dump_file, oe->op);
898 add_to_ops_vec (ops, build_zero_cst (TREE_TYPE (oe->op)));
905 && ops_equal_values_p (oe->op, notop))
907 tree op_type = TREE_TYPE (oe->op);
914 print_generic_expr (dump_file, oe->op);
950 operand_entry *oe;
965 ops->iterate (i, &oe)
966 && oe->rank >= curr->rank - 1;
969 if (oe->op == notop)
979 print_generic_expr (dump_file, oe->op);
987 oe->op = build_zero_cst (TREE_TYPE (oe->op));
989 oe->op = build_all_ones_cst (TREE_TYPE (oe->op));
993 ops->quick_push (oe);
2218 operand_entry *oe;
2236 for (i = currindex + 1; ops->iterate (i, &oe); i++)
2240 if (TREE_CODE (oe->op) != SSA_NAME)
2242 def2 = SSA_NAME_DEF_STMT (oe->op);
2295 print_generic_expr (dump_file, oe->op);
2301 /* Now we can delete oe, as it has been subsumed by the new combined
2342 operand_entry *oe;
2355 FOR_EACH_VEC_ELT (*ops, i, oe)
2360 op = oe->op;
2363 else if (operand_equal_p (oe->op, op, 0))
2373 op = oe->op;
2414 operand_entry *oe;
2457 for (i = 0; ops->iterate (i, &oe);)
2461 if (eliminate_not_pairs (opcode, ops, i, oe))
2463 if (eliminate_duplicate_pair (opcode, ops, &done, i, oe, oelast)
2464 || (!done && eliminate_plus_minus_pair (opcode, ops, i, oe))
2465 || (!done && eliminate_redundant_comparison (opcode, ops, i, oe)))
2473 oelast = oe;
2779 oe->rank. */
2807 operand_entry *oe = (*ops)[this_range->idx];
2808 basic_block this_bb = BASIC_BLOCK_FOR_FN (cfun, oe->id);
2830 operand_entry *oe = (*ops)[idx];
2831 tree op = oe->op;
2833 : last_stmt (BASIC_BLOCK_FOR_FN (cfun, oe->id));
2858 && (opcode != ERROR_MARK || oe->rank != BIT_IOR_EXPR))
2941 || (opcode == ERROR_MARK && oe->rank == BIT_IOR_EXPR))
2999 oe->op = tem;
3012 oe = (*ops)[range->idx];
3017 if (oe->op)
3018 oe->op = build_int_cst (TREE_TYPE (oe->op),
3019 oe->rank == BIT_IOR_EXPR ? 0 : 1);
3021 oe->op = (oe->rank == BIT_IOR_EXPR
3025 oe->op = error_mark_node;
3394 operand_entry *oe = (*ops)[ranges[i].idx];
3395 tree op = oe->op;
3397 : last_stmt (BASIC_BLOCK_FOR_FN (cfun, oe->id));
3799 operand_entry *oe = (*ops)[ranges[i].idx];
3800 stmt = last_stmt (BASIC_BLOCK_FOR_FN (cfun, oe->id));
3953 operand_entry *oe = (*ops)[ranges[i].idx];
3956 || (opcode == ERROR_MARK && oe->rank == BIT_IOR_EXPR))
3990 tree ctype = oe->op ? TREE_TYPE (oe->op) : boolean_type_node;
3998 if (oe->op && ctype != TREE_TYPE (oe->op))
4000 g = gimple_build_assign (make_ssa_name (TREE_TYPE (oe->op)),
4006 oe->op = ranges[i].exp;
4011 oe = (*ops)[ranges[*idx].idx];
4016 if (oe->op)
4017 oe->op = build_int_cst (TREE_TYPE (oe->op),
4018 oe->rank == BIT_IOR_EXPR ? 0 : 1);
4020 oe->op = (oe->rank == BIT_IOR_EXPR
4024 oe->op = error_mark_node;
4040 In that case if oe->op is NULL, oe->id is bb->index whose
4041 GIMPLE_COND is && or ||ed into the test, and oe->rank says
4050 operand_entry *oe;
4060 oe = (*ops)[i];
4062 init_range_entry (ranges + i, oe->op,
4063 oe->op
4065 : last_stmt (BASIC_BLOCK_FOR_FN (cfun, oe->id)));
4069 || (opcode == ERROR_MARK && oe->rank == BIT_IOR_EXPR))
4132 FOR_EACH_VEC_ELT (*ops, i, oe)
4134 if (oe->op == error_mark_node)
4137 (*ops)[j] = oe;
4289 operand_entry *oe;
4291 FOR_EACH_VEC_ELT (*ops, i, oe)
4293 if (oe->op == error_mark_node)
4296 (*ops)[j] = oe;
4613 operand_entry *oe = operand_entry_pool.allocate ();
4615 oe->op = rhs[i];
4616 oe->rank = code;
4617 oe->id = 0;
4618 oe->count = 1;
4619 oe->stmt_to_insert = NULL;
4620 ops->safe_push (oe);
4863 operand_entry *oe = operand_entry_pool.allocate ();
4865 oe->op = rhs;
4866 oe->rank = code;
4867 oe->id = 0;
4868 oe->count = 1;
4869 oe->stmt_to_insert = NULL;
4870 ops.safe_push (oe);
4881 operand_entry *oe = operand_entry_pool.allocate ();
4882 oe->op = lhs;
4883 oe->rank = code;
4884 oe->id = 0;
4885 oe->count = 1;
4886 ops.safe_push (oe);
4939 operand_entry *oe = operand_entry_pool.allocate ();
4941 oe->op = NULL;
4942 oe->rank = (e->flags & EDGE_TRUE_VALUE)
4944 /* oe->op = NULL signs that there is no SSA_NAME
4945 for the range test, and oe->id instead is the
4948 oe->id = bb->index;
4949 oe->count = 1;
4950 oe->stmt_to_insert = NULL;
4951 ops.safe_push (oe);
5271 operand_entry *oe;
5349 oe = ops[opindex];
5353 if (oe->stmt_to_insert)
5354 insert_stmt_before_use (stmt, oe->stmt_to_insert);
5360 changed || oe->op != rhs2 || next_changed,
5363 if (oe->op != rhs2 || new_rhs1 != rhs1)
5372 or all outer rhs2's were equal to corresponding oe->op,
5383 gimple *insert_point = find_insert_point (stmt, new_rhs1, oe->op,
5388 new_rhs1, oe->op);
5399 gcc_checking_assert (find_insert_point (stmt, new_rhs1, oe->op,
5403 gimple_assign_set_rhs2 (stmt, oe->op);
5536 operand_entry *oe = ops[op_index--];
5537 stmt2 = oe->stmt_to_insert;
5538 op2 = oe->op;
6193 operand_entry *oe;
6213 FOR_EACH_VEC_ELT (*ops, i, oe)
6215 if (TREE_CODE (oe->op) == SSA_NAME)
6219 if (rf1->factor == oe->op)
6221 rf1->count += oe->count;
6228 rfnew.factor = oe->op;
6229 rfnew.rank = oe->rank;
6230 rfnew.count = oe->count;
6490 FOR_EACH_VEC_ELT_REVERSE (*ops, n, oe)
6492 if (oe->op == rf1->factor)
6494 if (oe->count <= k)
6497 k -= oe->count;
6504 oe->count -= k;
6532 operand_entry *oe;
6540 FOR_EACH_VEC_ELT (*ops, i, oe)
6542 if (TREE_CODE (oe->op) == SSA_NAME
6543 && has_single_use (oe->op))
6545 gimple *def_stmt = SSA_NAME_DEF_STMT (oe->op);
6591 oe->op = negrhs;
6594 oe->op = lhs;
7006 operand_entry *oe;
7009 FOR_EACH_VEC_ELT (ops, i, oe)
7011 fprintf (file, "Op %d -> rank: %d, tree: ", i, oe->rank);
7012 print_generic_expr (file, oe->op);
Indexes created Sat Apr 25 00:22:52 UTC 2026