Searched refs:integer_minus_one_node (Results 1 – 12 of 12) sorted by relevance
1027 integer_minus_one_node); in compute_object_sizes()
8397 return integer_minus_one_node; in fold_builtin_memcmp()8450 return integer_minus_one_node; in fold_builtin_strcmp()8522 return integer_minus_one_node; in fold_builtin_strncmp()8822 ? integer_one_node : integer_minus_one_node; in fold_builtin_classify()10425 ? integer_minus_one_node : integer_zero_node); in fold_builtin_object_size()
1656 fold_convert (type, integer_minus_one_node)); in interpret_rhs_modify_expr()
2644 tree min_ascii = integer_minus_one_node; in estimate_case_costs()
3395 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE] macro
1558 return fold_convert (type, integer_minus_one_node); in omp_reduction_init()
6545 maxindex = integer_minus_one_node; in complete_array_type()
6564 integer_minus_one_node = build_int_cst (NULL_TREE, -1); in build_common_tree_nodes_2()
13038 else if (INT_CST_LT (integer_minus_one_node, arg0)) in fold_abs_const()
30672 * stmt.c (estimate_case_costs): Use integer_minus_one_node.30674 * tree.c (build_common_tree_nodes_2): Set integer_minus_one_node.30677 (integer_minus_one_node): Define.
234 if (!tree_int_cst_equal (max_index, integer_minus_one_node)) in build_zero_init()
3397 to integer_minus_one_node.3400 (build_vec_init): Use integer_minus_one_node.