/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20001203-2.c | 49 long long low_bound, high_bound; local 54 get_discrete_bounds (&low_bound, &high_bound); 56 (element_type)->length * (high_bound - low_bound + 1);
|
/haiku-buildtools/binutils/gold/ |
H A D | aarch64-reloc-property.cc | 52 int64_t low_bound = -(L == 0 ? 0 : ((int64_t)1 << L)); local 54 return ((low_bound <= x && x < up_bound)
|
/haiku-buildtools/gcc/gcc/ |
H A D | tree-dfa.c | 518 tree low_bound, unit_size; local 522 && (low_bound = array_ref_low_bound (exp), 523 TREE_CODE (low_bound) == INTEGER_CST) 528 = wi::sext (wi::to_offset (index) - wi::to_offset (low_bound), 740 tree low_bound, unit_size; local 748 && (low_bound = array_ref_low_bound (exp), 749 TREE_CODE (low_bound) == INTEGER_CST) 754 = wi::sext (wi::to_offset (index) - wi::to_offset (low_bound),
|
H A D | stmt.c | 2010 int low_bound = node_has_low_bound (node, index_type); 2012 if (!high_bound && low_bound) 2027 else if (!low_bound && high_bound) 2041 else if (!low_bound && !high_bound) 1998 int low_bound = node_has_low_bound (node, index_type); local
|
H A D | tree-vrp.c | 3029 wide_int low_bound, high_bound; local 3047 low_bound = bound; 3049 if (wi::ltu_p (vr0.max, low_bound)) 3068 low_bound = complement; 3071 && wi::lts_p (low_bound, vr0.min)) 6516 tree low_bound, up_bound, up_bound_p1; local 6554 low_bound = array_ref_low_bound (ref); 6573 && tree_int_cst_lt (low_sub, low_bound)) 6598 && tree_int_cst_lt (low_sub, low_bound)) 6652 tree low_bound, up_boun local [all...] |
H A D | gimple-fold.c | 5311 offset_int low_bound; local 5326 low_bound = wi::to_offset (TYPE_MIN_VALUE (domain_type)); 5329 low_bound = 0; 5346 access_index += low_bound; 5359 index = low_bound - 1; 5554 tree low_bound, unit_size; local 5557 if ((low_bound = array_ref_low_bound (t), 5558 TREE_CODE (low_bound) == INTEGER_CST) 5563 = wi::sext (wi::to_offset (idx) - wi::to_offset (low_bound),
|
H A D | expr.c | 6876 tree low_bound = array_ref_low_bound (exp); 6883 if (! integer_zerop (low_bound)) 6885 index, low_bound); 10073 tree low_bound = array_ref_low_bound (exp); 10086 if (!integer_zerop (low_bound)) 10089 low_bound)); 6861 tree low_bound = array_ref_low_bound (exp); local 10053 tree low_bound = array_ref_low_bound (exp); local
|
H A D | emit-rtl.c | 1918 tree low_bound = array_ref_low_bound (t2); 1925 if (! integer_zerop (low_bound)) 1927 index, low_bound); 1910 tree low_bound = array_ref_low_bound (t2); local
|
H A D | fold-const.c | 15578 tree low_bound = array_ref_low_bound (exp); 15583 We convert the low_bound to sizetype to avoid some problems 15588 if (! integer_zerop (low_bound)) 15590 fold_convert_loc (loc, sizetype, low_bound)); 15549 tree low_bound = array_ref_low_bound (exp); local
|
/haiku-buildtools/gcc/gcc/cp/ |
H A D | semantics.c | 4294 tree ret, low_bound, length, type; 4333 low_bound = TREE_PURPOSE (t); 4335 if ((low_bound && type_dependent_expression_p (low_bound)) 4339 if (low_bound == error_mark_node || length == error_mark_node) 4342 if (low_bound && !INTEGRAL_TYPE_P (TREE_TYPE (low_bound))) 4346 low_bound); 4356 if (low_bound) 4357 low_bound 4293 tree ret, low_bound, length, type; local 4345 low_bound); local 4422 "in %qs clause", low_bound, local 4577 tree low_bound = TREE_PURPOSE (t); local [all...] |
H A D | parser.c | 27847 tree low_bound = NULL_TREE, length = NULL_TREE; 27852 low_bound = cp_parser_expression (parser); 27874 if (TREE_CODE (low_bound) != INTEGER_CST 27875 && !TREE_READONLY (low_bound)) 27878 "%qD is not a constant", low_bound); 27891 decl = tree_cons (low_bound, length, decl); 27843 tree low_bound = NULL_TREE, length = NULL_TREE; local
|
H A D | pt.c | 13631 tree low_bound 13638 if (TREE_PURPOSE (decl) == low_bound 13642 return tree_cons (low_bound, length, chain); 13630 tree low_bound local
|
/haiku-buildtools/legacy/gcc/gcc/ |
H A D | mips-tdump.c | 476 int low_bound; 491 qualifiers[i].low_bound = 0; 689 qualifiers[i].low_bound = aux_ptr[index+2].dnLow; 747 if (qualifiers[j].low_bound != 0) 750 (long) qualifiers[j].low_bound, 468 int low_bound; member in struct:qual
|
H A D | expr.c | 4986 tree low_bound 5000 We convert the low_bound to sizetype to avoid some problems 5009 if (! integer_zerop (low_bound)) 5011 convert (sizetype, low_bound))); 6388 tree low_bound = domain ? TYPE_MIN_VALUE (domain) : integer_zero_node; 6395 We convert the low_bound to sizetype to avoid some problems 6404 if (! integer_zerop (low_bound)) 6406 convert (sizetype, low_bound))); 4973 tree low_bound local 6372 tree low_bound = domain ? TYPE_MIN_VALUE (domain) : integer_zero_node; local
|
/haiku-buildtools/gcc/gcc/c/ |
H A D | c-typeck.c | 11675 tree ret, low_bound, length, type; 11709 low_bound = TREE_PURPOSE (t); 11712 if (low_bound == error_mark_node || length == error_mark_node) 11715 if (low_bound && !INTEGRAL_TYPE_P (TREE_TYPE (low_bound))) 11719 low_bound); 11729 if (low_bound 11730 && TREE_CODE (low_bound) == INTEGER_CST 11731 && TYPE_PRECISION (TREE_TYPE (low_bound)) 11733 low_bound 11635 tree ret, low_bound, length, type; local 11679 low_bound); local 11752 "in %qs clause", low_bound, local 11911 tree low_bound = TREE_PURPOSE (t); local [all...] |
H A D | c-parser.c | 10156 tree low_bound = NULL_TREE, length = NULL_TREE; 10161 low_bound = c_parser_expression (parser).value; 10162 mark_exp_read (low_bound); 10191 if (TREE_CODE (low_bound) != INTEGER_CST 10192 && !TREE_READONLY (low_bound)) 10195 "%qD is not a constant", low_bound); 10208 t = tree_cons (low_bound, length, t); 10151 tree low_bound = NULL_TREE, length = NULL_TREE; local
|
/haiku-buildtools/legacy/gcc/gcc/ch/ |
H A D | parse.c | 2112 tree low_bound, high_bound; 2117 low_bound = convert (expr, TYPE_MIN_VALUE (expr)); 2122 low_bound = expr; 2125 build_loop_iterator (loop_counter, low_bound, 2111 tree low_bound, high_bound; local
|
/haiku-buildtools/legacy/binutils/bfd/ |
H A D | ecoff.c | 1059 int low_bound; 1076 qualifiers[i].low_bound = 0; 1260 qualifiers[i].low_bound = 1313 if (qualifiers[j].low_bound != 0) 1316 (long) qualifiers[j].low_bound, 1056 int low_bound; member in struct:qual
|
/haiku-buildtools/binutils/bfd/ |
H A D | ecoff.c | 1093 int low_bound; 1110 qualifiers[i].low_bound = 0; 1294 qualifiers[i].low_bound = 1347 if (qualifiers[j].low_bound != 0) 1350 (long) qualifiers[j].low_bound, 1090 int low_bound; member in struct:qual
|
/haiku-buildtools/gcc/gcc/c-family/ |
H A D | c-common.c | 6172 splay_tree_node low_bound; 6182 low_bound = splay_tree_predecessor (cases, 6190 if (low_bound 6191 && CASE_HIGH ((tree) low_bound->value) 6192 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value), 6194 node = low_bound; 6158 splay_tree_node low_bound; local
|
/haiku-buildtools/gcc/gcc/ada/gcc-interface/ |
H A D | trans.c | 209 tree low_bound; variable 3052 = rci->low_bound 3055 rci->low_bound) 5285 rci->low_bound = gnu_low_bound;
|