| /openbsd-src/gnu/usr.bin/gcc/gcc/ |
| H A D | convert.c | 70 return convert_to_pointer (type, integer_zero_node);
103 return convert_to_real (type, integer_zero_node);
107 return convert_to_real (type, integer_zero_node);
141 expr = integer_zero_node;
272 tree t = convert_to_integer (type, integer_zero_node);
441 return convert (type, integer_zero_node);
461 convert (subtype, integer_zero_node));
493 return convert_to_complex (type, integer_zero_node);
497 return convert_to_complex (type, integer_zero_node);
521 return convert_to_vector (type, integer_zero_node);
|
| H A D | fold-const.c | 1503 return convert (ctype, integer_zero_node);
1507 return size_binop (MINUS_EXPR, convert (ctype, integer_zero_node),
2339 return build (EQ_EXPR, type, arg, convert (type, integer_zero_node));
2558 ? integer_one_node : integer_zero_node));
2571 ? integer_one_node : integer_zero_node));
2579 rhs = convert (type, integer_zero_node);
2881 return convert (type, result ? integer_one_node : integer_zero_node);
2908 in_p = 0, low = high = convert (TREE_TYPE (exp), integer_zero_node);
2984 1, convert (type, integer_zero_node),
2998 low = convert (type, integer_zero_node);
[all …]
|
| H A D | c-lex.c | 880 value = build_complex (NULL_TREE, convert (type, integer_zero_node), value);
946 value = build_complex (NULL_TREE, convert (type, integer_zero_node), value);
|
| H A D | builtins.c | 755 arg1 = integer_zero_node;
766 arg1 = integer_zero_node;
780 arg2 = integer_zero_node;
2344 newarglist = tree_cons (NULL_TREE, integer_zero_node, newarglist);
3640 c = integer_zero_node;
4239 return integer_zero_node;
|
| /openbsd-src/gnu/gcc/gcc/ |
| H A D | tree-data-ref.c | 945 integer_zero_node, step)), in estimate_niter_from_size_of_data()
2370 *overlaps_a = integer_zero_node; in analyze_ziv_subscript()
2371 *overlaps_b = integer_zero_node; in analyze_ziv_subscript()
2380 *last_conflicts = integer_zero_node; in analyze_ziv_subscript()
2481 *overlaps_a = integer_zero_node; in analyze_siv_subscript_cst_affine()
2500 *last_conflicts = integer_zero_node; in analyze_siv_subscript_cst_affine()
2514 *last_conflicts = integer_zero_node; in analyze_siv_subscript_cst_affine()
2529 *last_conflicts = integer_zero_node; in analyze_siv_subscript_cst_affine()
2561 *overlaps_a = integer_zero_node; in analyze_siv_subscript_cst_affine()
2577 *last_conflicts = integer_zero_node; in analyze_siv_subscript_cst_affine()
[all …]
|
| H A D | convert.c | 74 return convert_to_pointer (type, integer_zero_node); in convert_to_pointer()
340 return convert_to_real (type, integer_zero_node); in convert_to_real()
344 return convert_to_real (type, integer_zero_node); in convert_to_real()
745 return convert (type, integer_zero_node); in convert_to_integer()
763 convert (subtype, integer_zero_node)); in convert_to_complex()
794 return convert_to_complex (type, integer_zero_node); in convert_to_complex()
798 return convert_to_complex (type, integer_zero_node); in convert_to_complex()
|
| H A D | tree-sra.c | 629 child = integer_zero_node; in maybe_lookup_element_for_expr()
1130 if (elt->element == integer_zero_node) in build_element_name_1()
1363 instantiate_missing_elements_1 (elt, integer_zero_node, type); in instantiate_missing_elements()
1636 if (elt->element == integer_zero_node) in generate_one_element_ref()
1682 c = lookup_element (elt, integer_zero_node, NULL, NO_INSERT); in generate_copy_inout()
1761 t = fold_convert (elt->type, integer_zero_node); in generate_element_zero()
1816 if (sub->element == integer_zero_node) in generate_element_init_1()
2263 fputs (elt->element == integer_zero_node ? "__real__ " : "__imag__ ", f); in dump_sra_elt_name()
|
| H A D | fold-const.c | 2118 elem = fold_convert_const (NOP_EXPR, TREE_TYPE (type), integer_zero_node); in build_zero_vector()
2213 fold_convert (TREE_TYPE (type), integer_zero_node)); in fold_convert()
4162 integer_zero_node), in make_range()
4175 integer_zero_node), in make_range()
4901 : rhs != 0 ? rhs : integer_zero_node, in fold_range_test()
5494 return omit_one_operand (type, integer_zero_node, inner); in optimize_minmax_comparison()
5502 return omit_one_operand (type, integer_zero_node, inner); in optimize_minmax_comparison()
5521 return omit_one_operand (type, integer_zero_node, inner); in optimize_minmax_comparison()
5807 return omit_one_operand (type, integer_zero_node, op0); in extract_muldiv_1()
5887 return value ? integer_one_node : integer_zero_node; in constant_boolean_node()
[all …]
|
| H A D | builtins.c | 966 arg1 = integer_zero_node; in expand_builtin_prefetch()
977 arg1 = integer_zero_node; in expand_builtin_prefetch()
992 arg2 = integer_zero_node; in expand_builtin_prefetch()
3561 newarglist = tree_cons (NULL_TREE, integer_zero_node, newarglist); in expand_builtin_bzero()
4663 c = integer_zero_node; in expand_builtin_expect()
6625 return integer_zero_node; in fold_builtin_constant_p()
8050 newarglist = tree_cons (NULL_TREE, integer_zero_node, newarglist); in fold_builtin_bzero()
8308 return omit_two_operands (integer_type_node, integer_zero_node, in fold_builtin_memcmp()
8313 return omit_one_operand (integer_type_node, integer_zero_node, len); in fold_builtin_memcmp()
8331 return integer_zero_node; in fold_builtin_memcmp()
[all …]
|
| H A D | tree-mudflap.c | 726 if (dirflag == integer_zero_node && flag_mudflap_ignore_reads) in mf_xform_derefs_1()
919 integer_zero_node); in mf_xform_derefs()
927 EXPR_LOCUS (s), integer_zero_node); in mf_xform_derefs()
930 integer_zero_node); in mf_xform_derefs()
|
| H A D | tree-ssa-ccp.c | 1542 tree min_idx, idx, elt_offset = integer_zero_node; in maybe_fold_offset_to_array_ref()
1581 idx = integer_zero_node; in maybe_fold_offset_to_array_ref()
1604 min_idx = integer_zero_node; in maybe_fold_offset_to_array_ref()
1820 return integer_zero_node; in maybe_fold_stmt_indirect()
1987 integer_zero_node); in fold_stmt_r()
2560 result = integer_zero_node; in execute_fold_all_builtins()
|
| H A D | tree-ssa-forwprop.c | 343 integer_zero_node)); in forward_propagate_into_cond_1()
396 integer_zero_node)); in forward_propagate_into_cond_1()
|
| H A D | tree-ssa-reassoc.c | 465 integer_zero_node)); in eliminate_duplicate_pair()
529 integer_zero_node)); in eliminate_plus_minus_pair()
591 oe->op = fold_convert (TREE_TYPE (oe->op), integer_zero_node); in eliminate_not_pairs()
|
| H A D | c-omp.c | 235 init = integer_zero_node; in c_finish_omp_for()
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/config/rs6000/ |
| H A D | rs6000-c.c | 64 if (n != integer_zero_node && n != integer_one_node)
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/f/ |
| H A D | com.c | 1077 convert (subtype, integer_zero_node)); in ffecom_convert_to_complex_()
1107 convert (subtype, integer_zero_node), in ffecom_convert_to_complex_()
1108 convert (subtype, integer_zero_node)); in ffecom_convert_to_complex_()
3731 integer_zero_node)); in ffecom_expr_()
4175 convert (tree_type, integer_zero_node)); in ffecom_expr_intrinsic_()
4332 integer_zero_node))), in ffecom_expr_intrinsic_()
4446 false_tree = convert (tree_type, integer_zero_node); in ffecom_expr_intrinsic_()
4462 integer_zero_node))), in ffecom_expr_intrinsic_()
4496 integer_zero_node)), in ffecom_expr_intrinsic_()
4507 integer_zero_node)), in ffecom_expr_intrinsic_()
[all …]
|
| H A D | ste.c | 216 (Flag) ? integer_one_node : integer_zero_node); \
613 integer_zero_node))); in ffeste_begin_iterdo_()
1411 formatinit = integer_zero_node; in ffeste_io_cilist_()
3030 integer_zero_node)); in ffeste_R840()
3045 integer_zero_node)); in ffeste_R840()
3059 integer_zero_node)); in ffeste_R840()
3077 integer_zero_node)); in ffeste_R840()
3083 integer_zero_node)); in ffeste_R840()
4211 integer_zero_node, in ffeste_R1001()
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/cp/ |
| H A D | init.c | 204 init = convert (type, integer_zero_node); in build_zero_init()
813 current_in_charge_parm, integer_zero_node),
853 expr, integer_zero_node));
1969 if (this_nelts == integer_zero_node)
1972 nelts = integer_zero_node;
1979 nelts = integer_zero_node;
2572 loop = integer_zero_node;
2614 deallocate_expr = integer_zero_node;
2647 if (loop && deallocate_expr != integer_zero_node)
2659 integer_zero_node)),
[all …]
|
| H A D | typeck.c | 3196 if (tree_int_cst_lt (op1, integer_zero_node))
3221 if (tree_int_cst_lt (op1, integer_zero_node))
3242 if (tree_int_cst_lt (op1, integer_zero_node))
3287 op1 = cp_convert (TREE_TYPE (op0), integer_zero_node);
3328 integer_zero_node));
3334 return cp_build_binary_op (EQ_EXPR, e, integer_zero_node);
3872 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
4034 return cp_convert (TREE_TYPE (arg), integer_zero_node);
5578 tree delta = integer_zero_node;
5613 integer_zero_node,
[all …]
|
| H A D | typeck2.c | 860 members = tree_cons (field, integer_zero_node, members);
1306 parms = integer_zero_node;
|
| /openbsd-src/gnu/gcc/gcc/cp/ |
| H A D | init.c | 182 init = convert (type, integer_zero_node); in build_zero_init()
257 init = fold_convert (type, integer_zero_node); in build_zero_init()
801 current_in_charge_parm, integer_zero_node), in expand_virtual_init()
839 expr, integer_zero_node); in expand_cleanup_for_base()
2036 integer_zero_node); in build_new_1()
2310 body = integer_zero_node; in build_vec_delete_1()
2316 integer_zero_node)), in build_vec_delete_1()
2317 body, integer_zero_node); in build_vec_delete_1()
2850 ifexp = fold (cp_build_binary_op (NE_EXPR, addr, integer_zero_node)); in build_delete()
|
| H A D | typeck2.c | 895 flags |= picflag_from_initializer (integer_zero_node); in process_init_constructor_record()
896 CONSTRUCTOR_APPEND_ELT (v, field, integer_zero_node); in process_init_constructor_record()
1324 return cp_convert (type, integer_zero_node); in build_functional_cast()
|
| H A D | typeck.c | 3211 if (tree_int_cst_lt (op1, integer_zero_node)) in build_binary_op()
3236 if (tree_int_cst_lt (op1, integer_zero_node)) in build_binary_op()
3257 if (tree_int_cst_lt (op1, integer_zero_node)) in build_binary_op()
3310 op1 = cp_convert (TREE_TYPE (op0), integer_zero_node); in build_binary_op()
3351 integer_zero_node)); in build_binary_op()
3357 return cp_build_binary_op (EQ_EXPR, e, integer_zero_node); in build_binary_op()
3928 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1); in cp_truthvalue_conversion()
4092 return cp_convert (TREE_TYPE (arg), integer_zero_node); in build_unary_op()
5905 result = integer_zero_node; in get_delta_difference()
6065 pfn = build_c_cast (type, integer_zero_node); in build_ptrmemfunc()
[all …]
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/java/ |
| H A D | class.c | 327 DECL_SIZE (decl) = integer_zero_node;
376 BINFO_OFFSET (super_binfo) = integer_zero_node;
517 BINFO_OFFSET (interface_binfo) = integer_zero_node;
518 BINFO_VPTR_FIELD (interface_binfo) = integer_zero_node;
1411 list = tree_cons (integer_zero_node, null_pointer_node, list);
1660 PUSH_FIELD_VALUE (cons, "state", integer_zero_node);
1663 PUSH_FIELD_VALUE (cons, "depth", integer_zero_node);
2017 dtable_count = integer_zero_node;
|
| H A D | expr.c | 1414 ifexp2, integer_zero_node,
1430 integer_zero_node));
1669 value2 = (type == ptr_type_node) ? null_pointer_node : integer_zero_node;
1801 init, integer_zero_node);
2105 push_value (convert (method_type, integer_zero_node));
2410 push_value (convert (field_type, integer_zero_node));
|