Searched refs:low_bound (Results 1 - 17 of 17) sorted by relevance

/freebsd-9.3-release/contrib/gdb/gdb/
H A Dada-valprint.c93 long low_bound;
96 low_bound = 0;
102 low_bound = TYPE_LOW_BOUND (index_type);
111 if (low_bound == TYPE_FIELD_BITPOS (index_type, 0))
118 if (low_bound == 1)
123 ada_print_scalar (index_type, (LONGEST) low_bound, stream);
92 long low_bound; local
H A Deval.c346 enum noside noside, LONGEST low_bound, LONGEST high_bound)
354 low_bound, high_bound);
356 exp, pos, noside, low_bound, high_bound);
364 if (low < low_bound || high > high_bound)
369 + (index - low_bound) * element_size,
376 if (index < low_bound || index > high_bound)
378 memcpy (VALUE_CONTENTS_RAW (array) + (index - low_bound) * element_size,
519 LONGEST low_bound, high_bound, index;
520 if (get_discrete_bounds (range_type, &low_bound, &high_bound) < 0)
522 low_bound
342 init_array_element(struct value *array, struct value *element, struct expression *exp, int *pos, enum noside noside, LONGEST low_bound, LONGEST high_bound) argument
517 LONGEST low_bound, high_bound, index; local
567 LONGEST low_bound, high_bound; local
[all...]
H A Dgdbtypes.c631 int low_bound, int high_bound)
647 TYPE_FIELD_BITPOS (result_type, 0) = low_bound;
652 if (low_bound >= 0)
740 LONGEST low_bound, high_bound; local
748 if (get_discrete_bounds (range_type, &low_bound, &high_bound) < 0)
749 low_bound = high_bound = 0;
752 TYPE_LENGTH (element_type) * (high_bound - low_bound + 1);
791 LONGEST low_bound, high_bound, bit_length; local
804 if (get_discrete_bounds (domain_type, &low_bound, &high_bound) < 0)
805 low_bound
630 create_range_type(struct type *result_type, struct type *index_type, int low_bound, int high_bound) argument
[all...]
H A Dvalarith.c1384 LONGEST low_bound, high_bound;
1388 if (get_discrete_bounds (range, &low_bound, &high_bound) < 0)
1390 if (index < low_bound || index > high_bound)
1392 rel_index = index - low_bound;
1377 LONGEST low_bound, high_bound; local
H A Dp-valprint.c459 LONGEST low_bound, high_bound;
469 i = get_discrete_bounds (range, &low_bound, &high_bound);
477 for (i = low_bound; i <= high_bound; i++)
458 LONGEST low_bound, high_bound; local
H A Dvalues.c114 int low_bound = current_language->string_lower_bound; /* ??? */
119 low_bound, count + low_bound - 1);
113 int low_bound = current_language->string_lower_bound; /* ??? */ local
H A Dvalops.c235 LONGEST low_bound, high_bound, new_length; local
236 if (get_discrete_bounds (range_type, &low_bound, &high_bound) < 0)
237 low_bound = 0, high_bound = 0;
245 low_bound,
246 new_length + low_bound - 1);
H A Dada-lang.c1190 LONGEST low_bound, high_bound;
1204 &low_bound, &high_bound) < 0)
1205 low_bound = high_bound = 0;
1206 if (high_bound < low_bound)
1210 *elt_bits *= (high_bound - low_bound + 1);
1186 LONGEST low_bound, high_bound; local
/freebsd-9.3-release/contrib/gcc/
H A Dtree-dfa.c947 tree low_bound = array_ref_low_bound (exp); local
950 if (! integer_zerop (low_bound))
952 index, low_bound);
H A Dmips-tdump.c439 int low_bound;
454 qualifiers[i].low_bound = 0;
652 qualifiers[i].low_bound = aux_ptr[index+2].dnLow;
710 if (qualifiers[j].low_bound != 0)
713 (long) qualifiers[j].low_bound,
431 int low_bound; member in struct:qual
H A Dtree-ssa-ccp.c1552 tree low_bound = array_ref_low_bound (base); local
1555 if (TREE_CODE (low_bound) != INTEGER_CST
1559 elt_offset = int_const_binop (MINUS_EXPR, elt_offset, low_bound, 0);
H A Dstmt.c3284 int low_bound = node_has_low_bound (node, index_type);
3286 if (!high_bound && low_bound)
3297 else if (!low_bound && high_bound)
3307 else if (!low_bound && !high_bound)
3266 int low_bound = node_has_low_bound (node, index_type); local
H A Dc-common.c3813 splay_tree_node low_bound;
3823 low_bound = splay_tree_predecessor (cases,
3831 if (low_bound
3832 && CASE_HIGH ((tree) low_bound->value)
3833 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
3835 node = low_bound;
3798 splay_tree_node low_bound; local
H A Dexpr.c5736 tree low_bound = array_ref_low_bound (exp);
5743 if (! integer_zerop (low_bound))
5745 index, low_bound);
7357 tree low_bound = array_ref_low_bound (exp);
7362 We convert the low_bound to sizetype to avoid some problems
7368 if (! integer_zerop (low_bound))
7370 low_bound));
5721 tree low_bound = array_ref_low_bound (exp); local
7337 tree low_bound = array_ref_low_bound (exp); local
H A Demit-rtl.c1595 tree low_bound = array_ref_low_bound (t2);
1602 if (! integer_zerop (low_bound))
1604 index, low_bound);
1588 tree low_bound = array_ref_low_bound (t2); local
H A Dfold-const.c12981 tree low_bound = array_ref_low_bound (exp);
12986 We convert the low_bound to sizetype to avoid some problems
12991 if (! integer_zerop (low_bound))
12992 index = size_diffop (index, fold_convert (sizetype, low_bound));
12946 tree low_bound = array_ref_low_bound (exp); local
/freebsd-9.3-release/contrib/binutils/bfd/
H A Decoff.c1058 int low_bound;
1075 qualifiers[i].low_bound = 0;
1259 qualifiers[i].low_bound =
1312 if (qualifiers[j].low_bound != 0)
1315 (long) qualifiers[j].low_bound,
1055 int low_bound; member in struct:qual

Completed in 399 milliseconds