Home
last modified time | relevance | path

Searched refs:op1 (Results 76 – 100 of 235) sorted by relevance

12345678910

/dragonfly/contrib/gmp/mpz/
H A Dand.c25 mpz_and (mpz_ptr res, mpz_srcptr op1, mpz_srcptr op2) in mpz_and() argument
35 op1_size = SIZ(op1); in mpz_and()
38 op1_ptr = PTR(op1); in mpz_and()
146 MPZ_SRCPTR_SWAP (op1, op2); in mpz_and()
/dragonfly/contrib/gcc-4.7/gcc/
H A Dtree-vrp.c3199 tree op0, op1; in extract_range_from_cond_expr() local
4509 retval |= register_edge_assert_for_2 (op1, e, bsi, rhs_code, op0, op1, in register_edge_assert_for_1()
5933 vr1 = (TREE_CODE (op1) == SSA_NAME) ? get_value_range (op1) : NULL; in vrp_evaluate_conditional_warnv_with_ops_using_ranges()
6001 && TREE_OVERFLOW (op1))) in vrp_evaluate_conditional()
6781 tree lhs, op0, op1; in simplify_truth_ops_using_ranges() local
6800 op1 = int_const_binop (BIT_XOR_EXPR, op1, integer_one_node); in simplify_truth_ops_using_ranges()
6817 if (integer_zerop (op1)) in simplify_truth_ops_using_ranges()
7025 op = op1; in simplify_bit_ops_using_ranges()
7033 op = op1; in simplify_bit_ops_using_ranges()
7076 max = op1; in test_for_singularity()
[all …]
H A Dgimple-fold.c397 tree type = TREE_TYPE (op1); in fold_gimple_assign()
417 result = op1; in fold_gimple_assign()
422 type, op1); in fold_gimple_assign()
1392 const_tree op1, const_tree op2) in same_bool_comparison_p() argument
1420 if (TREE_CODE (op1) == SSA_NAME in same_bool_comparison_p()
1423 s = SSA_NAME_DEF_STMT (op1); in same_bool_comparison_p()
1451 if (operand_equal_p (op1, op2, 0)) in same_bool_result_p()
1464 TREE_OPERAND (op1, 0), in same_bool_result_p()
1465 TREE_OPERAND (op1, 1))) in same_bool_result_p()
3165 tree op0, op1; in gimple_val_nonnegative_real_p() local
[all …]
H A Dreal.c1003 const REAL_VALUE_TYPE *op1) in real_arithmetic() argument
1007 if (op0->decimal || (op1 && op1->decimal)) in real_arithmetic()
1015 if (r != op0 && r != op1) in real_arithmetic()
1020 if (r != op0 && r != op1) in real_arithmetic()
1025 if (r != op0 && r != op1) in real_arithmetic()
1035 if (op1->cl == rvc_nan) in real_arithmetic()
1036 *r = *op1; in real_arithmetic()
1040 *r = *op1; in real_arithmetic()
1044 if (op1->cl == rvc_nan) in real_arithmetic()
1045 *r = *op1; in real_arithmetic()
[all …]
H A Dtree-ssa-sccvn.c406 && expressions_equal_p (vro1->op1, vro2->op1) in vn_reference_op_eq()
418 if (vro1->op1) in vn_reference_op_compute_hash()
597 temp.op1 = TMR_STEP (ref); in copy_reference_ops_from_ref()
864 if (op->op1 in ao_ref_init_from_vn_reference()
1145 && integer_zerop (op->op1) in fully_constant_vn_reference_p()
1193 if (vro->op1 && TREE_CODE (vro->op1) == SSA_NAME) in VEC()
1196 if (tem != vro->op1) in VEC()
1199 vro->op1 = tem; in VEC()
3028 op1 = valueize_expr (vn_get_expr_for (op1)); in simplify_binary_expression()
3030 op1 = vn_valueize (op1); in simplify_binary_expression()
[all …]
H A Dtree-ssa-copy.c447 tree op1 = gimple_cond_rhs (stmt); in copy_prop_visit_cond_stmt() local
451 if (TREE_CODE (op0) == SSA_NAME && TREE_CODE (op1) == SSA_NAME) in copy_prop_visit_cond_stmt()
454 op1 = valueize_val (op1); in copy_prop_visit_cond_stmt()
466 if (op0 == op1) in copy_prop_visit_cond_stmt()
469 boolean_type_node, op0, op1); in copy_prop_visit_cond_stmt()
H A Dtree-ssa-loop-niter.c73 tree op0, op1; in split_to_var_and_offset() local
89 op1 = TREE_OPERAND (expr, 1); in split_to_var_and_offset()
96 off = tree_to_double_int (op1); in split_to_var_and_offset()
1809 tree op0, op1; in number_of_iterations_exit() local
1840 op1 = gimple_cond_rhs (stmt); in number_of_iterations_exit()
2340 op0, code, op1); in derive_constant_upper_bound_assign()
2351 tree op0, op1; in derive_constant_upper_bound() local
2363 enum tree_code code, tree op1) in derive_constant_upper_bound_ops() argument
2473 || tree_int_cst_sign_bit (op1)) in derive_constant_upper_bound_ops()
2481 || tree_int_cst_sign_bit (op1)) in derive_constant_upper_bound_ops()
[all …]
H A Dreload.c5419 && (tem = subst_indexed_address (op1)) != op1) in subst_indexed_address()
5420 op1 = tem; in subst_indexed_address()
5426 op2 = XEXP (op1, 1), op1 = XEXP (op1, 0); in subst_indexed_address()
5428 op2 = op1, op1 = XEXP (op0, 1), op0 = XEXP (op0, 0); in subst_indexed_address()
5432 op1 = form_sum (GET_MODE (addr), op1, op2); in subst_indexed_address()
5433 if (op1 != 0) in subst_indexed_address()
5524 rtx op1 = orig_op1; in find_reloads_address_1() local
5541 op1 = SUBREG_REG (op1); in find_reloads_address_1()
5546 op1 = gen_rtx_REG (GET_MODE (op1), in find_reloads_address_1()
5547 (REGNO (op1) + in find_reloads_address_1()
[all …]
H A Dtree-ssa-loop-ivopts.c1345 tmp_op = op0; op0 = op1; op1 = tmp_op; in extract_cond_operands()
1356 *bound = op1; in extract_cond_operands()
2036 op1 = strip_offset_1 (op1, false, false, &off1); in strip_offset_1()
2050 expr = op1; in strip_offset_1()
2086 op1 = strip_offset_1 (op1, false, false, &off1); in strip_offset_1()
2143 && (!op1 || op1 == TREE_OPERAND (expr, 1))) in strip_offset_1()
2148 if (op1) in strip_offset_1()
3549 tree op0, op1; in force_expr_to_var_cost() local
3623 STRIP_NOPS (op1); in force_expr_to_var_cost()
3640 op1 = NULL_TREE; in force_expr_to_var_cost()
[all …]
H A Dtree-vect-stmts.c1487 if (op1) in vect_get_vec_defs()
1493 if (op1) in vect_get_vec_defs()
1507 if (op1) in vect_get_vec_defs()
2469 op1 = fold_convert (TREE_TYPE (op0), op1); in vectorizable_conversion()
2580 vec_oprnd1 = op1; in vectorizable_conversion()
2601 vec_oprnd1 = op1; in vectorizable_conversion()
2617 vec_oprnd1 = op1; in vectorizable_conversion()
2951 tree op0, op1 = NULL; in vectorizable_shift() local
3137 op1 = fold_convert (TREE_TYPE (vectype), op1); in vectorizable_shift()
3152 op1 = fold_convert (TREE_TYPE (vectype), op1); in vectorizable_shift()
[all …]
H A Dtree-ssa-forwprop.c373 tree op0, tree op1, bool invariant_only) in combine_cond_expr_cond() argument
412 tree op0, tree op1) in forward_propagate_into_comparison_1() argument
427 rhs0, op1, !single_use0_p); in forward_propagate_into_comparison_1()
434 if (TREE_CODE (op1) == SSA_NAME) in forward_propagate_into_comparison_1()
1654 tree op1, op2; in lookup_logical_inverted_value() local
1668 op1 = gimple_assign_rhs1 (def); in lookup_logical_inverted_value()
1681 return op1; in lookup_logical_inverted_value()
1685 if (!INTEGRAL_TYPE_P (TREE_TYPE (op1))) in lookup_logical_inverted_value()
1688 return op1; in lookup_logical_inverted_value()
1695 return op1; in lookup_logical_inverted_value()
[all …]
H A Dcse.c3834 rtx op0, op1; in record_jump_equiv() local
3945 && subreg_lowpart_p (op1) in record_jump_cond()
3968 op1_hash = HASH (op1, mode); in record_jump_cond()
3982 || op0 == op1 || rtx_equal_p (op0, op1)) in record_jump_cond()
4000 if (!REG_P (op1)) in record_jump_cond()
4001 op1 = equiv_constant (op1); in record_jump_cond()
4019 if (! CONSTANT_P (op1)) in record_jump_cond()
4020 op1_hash = HASH (op1,mode); in record_jump_cond()
4031 if (REG_P (op1)) in record_jump_cond()
4041 rehash_using_reg (op1); in record_jump_cond()
[all …]
H A Dtree-ssa-phiopt.c830 tree lhs, op0, op1, bound; in minmax_replacement() local
841 op1 = gimple_assign_rhs2 (assign); in minmax_replacement()
863 bound = op1; in minmax_replacement()
864 else if (operand_equal_for_phi_arg_p (op1, smaller)) in minmax_replacement()
888 bound = op1; in minmax_replacement()
889 else if (operand_equal_for_phi_arg_p (op1, larger)) in minmax_replacement()
922 bound = op1; in minmax_replacement()
923 else if (operand_equal_for_phi_arg_p (op1, smaller)) in minmax_replacement()
947 bound = op1; in minmax_replacement()
948 else if (operand_equal_for_phi_arg_p (op1, larger)) in minmax_replacement()
/dragonfly/contrib/gcc-4.7/gcc/c-family/
H A Dc-common.c1195 op1 = decl_constant_value_for_optimization (op1); in c_fully_fold_internal()
1261 op1 = c_fully_fold_internal (op1, in_init, maybe_const_operands, in c_fully_fold_internal()
1264 op1 = decl_constant_value_for_optimization (op1); in c_fully_fold_internal()
1897 op1 = convert (result_type, op1); in shorten_binary_op()
2190 if ((TREE_CODE (op1) == REAL_CST || TREE_CODE (op1) == INTEGER_CST in conversion_warning()
3432 primop1 = op1; in shorten_compare()
3439 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr) in shorten_compare()
3459 op0 = op1; in shorten_compare()
3460 op1 = tem; in shorten_compare()
4039 op1 = c_common_truthvalue_conversion (location, op1); in c_common_truthvalue_conversion()
[all …]
/dragonfly/contrib/gcc-8.0/gcc/c-family/
H A Dc-warn.c1137 tree op1 = TREE_OPERAND (expr, 1); in conversion_warning() local
1939 tree op0, tree op1, in warn_for_sign_compare() argument
2021 op1 = c_common_get_narrower (op1, &unsignedp1); in warn_for_sign_compare()
2029 op1 = c_common_get_narrower (TREE_OPERAND (op1, 0), &unsignedp1); in warn_for_sign_compare()
2040 primop = op1; in warn_for_sign_compare()
2048 constant = tree_to_shwi (op1); in warn_for_sign_compare()
2282 || TREE_CODE (op1) != INTEGER_CST) in maybe_warn_shift_overflow()
2293 + TREE_INT_CST_LOW (op1)); in maybe_warn_shift_overflow()
2329 tree op1) in maybe_warn_bool_compare() argument
2338 else if (f = fold_for_warn (op1), in maybe_warn_bool_compare()
[all …]
/dragonfly/lib/libnvmm/
H A Dlibnvmm_x86.c2756 uint64_t *op1, op2, fl, ret; in EXEC_DISPATCHER() local
2758 op1 = (uint64_t *)mem->data; in EXEC_DISPATCHER()
2788 uint64_t *op1, op2, fl, ret; in x86_func_and() local
2790 op1 = (uint64_t *)mem->data; in x86_func_and()
2818 uint64_t *op1, op2; in x86_func_xchg() local
2820 op1 = (uint64_t *)mem->data; in x86_func_xchg()
2829 mem->data = (uint8_t *)op1; in x86_func_xchg()
2834 *op1 = op2; in x86_func_xchg()
2877 uint64_t *op1, op2, fl, ret; in x86_func_xor() local
2907 uint64_t *op1, *op2, fl; in x86_func_cmp() local
[all …]
/dragonfly/contrib/gcc-8.0/gcc/
H A Dgimple-fold.h77 enum tree_code code, tree type, tree op0, tree op1) in gimple_build() argument
79 return gimple_build (seq, UNKNOWN_LOCATION, code, type, op0, op1); in gimple_build()
85 enum tree_code code, tree type, tree op0, tree op1, tree op2) in gimple_build() argument
87 return gimple_build (seq, UNKNOWN_LOCATION, code, type, op0, op1, op2); in gimple_build()
H A Dpredict.c1444 || (TREE_CODE (op1) != SSA_NAME && TREE_CODE (op1) != INTEGER_CST)) in is_comparison_with_loop_invariant_p()
2431 op1 = expr_expected_value (op1, visited, &predictor2); in expr_expected_value_1()
2434 if (!op1) in expr_expected_value_1()
2468 tree op0, op1; in expr_expected_value() local
2488 tree op0, op1; in tree_predict_by_opcode() local
2580 if (integer_zerop (op1) in tree_predict_by_opcode()
2583 || real_zerop (op1) in tree_predict_by_opcode()
2584 || real_onep (op1) in tree_predict_by_opcode()
2591 if (integer_zerop (op1) in tree_predict_by_opcode()
2594 || real_zerop (op1) in tree_predict_by_opcode()
[all …]
H A Dtree-scalar-evolution.c1998 op0, code, op1); in interpret_expr()
2421 if (op1 == chrec_dont_know) in instantiate_scev_name()
2424 TREE_TYPE (chrec), op0, op1); in instantiate_scev_name()
2512 tree op1; in instantiate_scev_poly() local
2524 if (op1 == chrec_dont_know) in instantiate_scev_poly()
2528 || CHREC_RIGHT (chrec) != op1) in instantiate_scev_poly()
2530 op1 = chrec_convert_rhs (chrec_type (op0), op1, NULL); in instantiate_scev_poly()
2559 tree op1; in instantiate_scev_binary() local
2567 if (op1 == chrec_dont_know) in instantiate_scev_binary()
2571 || c1 != op1) in instantiate_scev_binary()
[all …]
H A Dtree-ssa-math-opts.c348 tree op1 = gimple_assign_rhs2 (use_stmt); in is_square_of() local
350 return op0 == op1 && op0 == def; in is_square_of()
1167 tree op0, op1, ssa_target; in powi_as_mults_1() local
1191 op1 = op0; in powi_as_mults_1()
2660 tree addop, mulop1 = op1, result = mul_result; in convert_mult_to_fma_1()
2731 tree op1; member
3042 fti.op1 = op1; in convert_mult_to_fma()
3060 convert_mult_to_fma_1 (mul_result, op1, op2); in convert_mult_to_fma()
3293 tree op1 = gimple_assign_rhs1 (stmt); in divmod_candidate_p() local
3337 tree op1 = gimple_assign_rhs1 (stmt); in convert_to_divmod() local
[all …]
H A Dreload.c5401 && (tem = subst_indexed_address (op1)) != op1) in subst_indexed_address()
5402 op1 = tem; in subst_indexed_address()
5408 op2 = XEXP (op1, 1), op1 = XEXP (op1, 0); in subst_indexed_address()
5410 op2 = op1, op1 = XEXP (op0, 1), op0 = XEXP (op0, 0); in subst_indexed_address()
5414 op1 = form_sum (GET_MODE (addr), op1, op2); in subst_indexed_address()
5415 if (op1 != 0) in subst_indexed_address()
5506 rtx op1 = orig_op1; in find_reloads_address_1() local
5523 op1 = SUBREG_REG (op1); in find_reloads_address_1()
5528 op1 = gen_rtx_REG (GET_MODE (op1), in find_reloads_address_1()
5529 (REGNO (op1) + in find_reloads_address_1()
[all …]
H A Dvtable-verify.c520 tree op1 = TREE_OPERAND (rhs, 1); in extract_object_class_type() local
522 if (TREE_CODE (op1) == FIELD_DECL in extract_object_class_type()
523 && DECL_VIRTUAL_P (op1)) in extract_object_class_type()
536 && TREE_CODE (op1) == COMPONENT_REF) in extract_object_class_type()
537 result = extract_object_class_type (op1); in extract_object_class_type()
H A Dtree-ssa-phiopt.c738 tree op1 = gimple_assign_rhs2 (def1); in rhs_is_fed_for_value_replacement() local
740 && operand_equal_for_phi_arg_p (arg1, op1)) in rhs_is_fed_for_value_replacement()
741 || (operand_equal_for_phi_arg_p (arg0, op1) in rhs_is_fed_for_value_replacement()
1341 tree lhs, op0, op1, bound; in minmax_replacement() local
1352 op1 = gimple_assign_rhs2 (assign); in minmax_replacement()
1378 bound = op1; in minmax_replacement()
1381 && operand_equal_for_phi_arg_p (op1, alt_smaller))) in minmax_replacement()
1409 bound = op1; in minmax_replacement()
1412 && operand_equal_for_phi_arg_p (op1, alt_larger))) in minmax_replacement()
1449 bound = op1; in minmax_replacement()
[all …]
/dragonfly/contrib/zstd/lib/decompress/
H A Dhuf_decompress.c382 BYTE* op1 = ostart; in HUF_decompress4X1_usingDTable_internal_body() local
398 HUF_DECODE_SYMBOLX1_2(op1, &bitD1); in HUF_decompress4X1_usingDTable_internal_body()
402 HUF_DECODE_SYMBOLX1_1(op1, &bitD1); in HUF_decompress4X1_usingDTable_internal_body()
406 HUF_DECODE_SYMBOLX1_2(op1, &bitD1); in HUF_decompress4X1_usingDTable_internal_body()
410 HUF_DECODE_SYMBOLX1_0(op1, &bitD1); in HUF_decompress4X1_usingDTable_internal_body()
834 BYTE* op1 = ostart; in HUF_decompress4X2_usingDTable_internal_body() local
851 HUF_DECODE_SYMBOLX2_2(op1, &bitD1); in HUF_decompress4X2_usingDTable_internal_body()
852 HUF_DECODE_SYMBOLX2_1(op1, &bitD1); in HUF_decompress4X2_usingDTable_internal_body()
853 HUF_DECODE_SYMBOLX2_2(op1, &bitD1); in HUF_decompress4X2_usingDTable_internal_body()
854 HUF_DECODE_SYMBOLX2_0(op1, &bitD1); in HUF_decompress4X2_usingDTable_internal_body()
[all …]
/dragonfly/contrib/gcc-4.7/gcc/cp/
H A Dcvt.c913 tree op1 = TREE_OPERAND (expr,1); in convert_to_void() local
915 bool side_effects = ((op1 && TREE_SIDE_EFFECTS (op1)) in convert_to_void()
921 if (op1) in convert_to_void()
922 new_op1 = convert_to_void (op1, ICV_SECOND_OF_COND, complain); in convert_to_void()
927 if (op1) in convert_to_void()
928 new_op1 = convert_to_void (op1, ICV_CAST, complain); in convert_to_void()
940 tree op1 = TREE_OPERAND (expr,1); in convert_to_void() local
943 new_op1 = convert_to_void (op1, ICV_RIGHT_OF_COMMA, complain); in convert_to_void()
945 new_op1 = convert_to_void (op1, ICV_CAST, complain); in convert_to_void()
947 if (new_op1 != op1) in convert_to_void()

12345678910