/freebsd-11-stable/contrib/gcc/ |
H A D | rtl.h | 27 # define __PAST_END(array, offset) (((typeof(*(array)) *)(array))[offset]) 145 stricter alignment; OFFSET is the offset of the MEM within that object. */ 150 rtx offset; /* Offset from start of DECL, as CONST_INT. */ 161 HOST_WIDE_INT offset; /* Offset from start of DECL. */ 195 /* The offset of this object from the start of its block. It is negative 196 if the symbol has not yet been assigned an offset. */ local 197 HOST_WIDE_INT offset; 218 order of increasing offset and the following conditions will 228 in order of increasing offset, an 149 rtx offset; /* Offset from start of DECL, as CONST_INT. */ local 160 HOST_WIDE_INT offset; /* Offset from start of DECL. */ local [all...] |
H A D | rtlanal.c | 285 HOST_WIDE_INT offset; 292 offset = INTVAL (XEXP (x, 1)); 301 offset -= STACK_POINTER_OFFSET; 304 return offset % GET_MODE_SIZE (mode) != 0; 389 /* Similarly. Further, the offset is always positive. */ 2884 and SUBREG_BYTE, return the bit offset where the subreg begins 2925 /* Given a subreg X, return the bit offset where the subreg begins 2935 /* This function returns the regno offset of a subreg expression. 2938 offset - The byte offset 284 HOST_WIDE_INT offset; local 2920 subreg_regno_offset(unsigned int xregno, enum machine_mode xmode, unsigned int offset, enum machine_mode ymode) argument 2966 subreg_offset_representable_p(unsigned int xregno, enum machine_mode xmode, unsigned int offset, enum machine_mode ymode) argument [all...] |
H A D | rtlhooks.c | 60 int offset = 0; 74 offset = (MAX (GET_MODE_SIZE (GET_MODE (x)), UNITS_PER_WORD) 80 offset -= (MIN (UNITS_PER_WORD, GET_MODE_SIZE (mode)) 83 return adjust_address (x, mode, offset); 147 int offset = 0; 151 offset = (MAX (GET_MODE_SIZE (GET_MODE (x)), UNITS_PER_WORD) 156 offset -= (MIN (UNITS_PER_WORD, GET_MODE_SIZE (mode)) 159 new = adjust_address_nv (x, mode, offset); 59 int offset = 0; local 146 int offset = 0; local
|
H A D | sbitmap.c | 138 unsigned int i, bytes, offset, elm_bytes, size, amt, vector_bytes; local 162 for (i = 0, offset = vector_bytes; i < n_vecs; i++, offset += elm_bytes) 164 sbitmap b = (sbitmap) ((char *) bitmap_vector + offset);
|
H A D | sdbout.c | 89 /* A C expression for the integer offset value of an automatic variable 96 /* A C expression for the integer offset value of an argument (C_ARG) 97 having address X (an RTX). The nominal offset is OFFSET. */ 901 /* This is for variables which are at offset zero from 1361 /* Again, this assumes the offset is based on the arg pointer. */ 1413 int offset = DECL_OFFSET (parms) / BITS_PER_UNIT; 1418 && offset != -1 1420 offset += (GET_MODE_SIZE (TYPE_MODE (DECL_ARG_TYPE (parms))) 1422 if (INTVAL (XEXP (XEXP (DECL_RTL (parms), 0), 1)) != offset) {...}
|
H A D | simplify-rtx.c | 141 HOST_WIDE_INT offset = 0; 170 /* Split the address into a base and integer offset. */ 175 offset = INTVAL (XEXP (XEXP (addr, 0), 1)); 193 if (offset != 0 || cmode != GET_MODE (x)) 195 rtx tem = simplify_subreg (GET_MODE (x), c, cmode, offset); 2592 int offset = INTVAL (XVECEXP (trueop1, 0, 0)) * GET_MODE_SIZE (mode); 2599 if (offset < vec_size) 2603 offset -= vec_size; 4369 will already have offset 0. */ 4527 /* The SUBREG_BYTE represents offset, a 138 HOST_WIDE_INT offset = 0; local 2585 int offset = INTVAL (XVECEXP (trueop1, 0, 0)) * GET_MODE_SIZE (mode); local 4553 int offset = 0; local [all...] |
H A D | stor-layout.c | 541 rli->offset = size_zero_node; 552 the offset/bitpos forms and byte and bit offsets. */ 555 bit_from_pos (tree offset, tree bitpos) 559 fold_convert (bitsizetype, offset), 564 byte_from_pos (tree offset, tree bitpos) 566 return size_binop (PLUS_EXPR, offset, 584 /* Given a pointer to bit and byte offsets and an offset alignment, 614 print_node_brief (stderr, "\noffset", rli->offset, 0); 641 normalize_offset (&rli->offset, &rli->bitpos, rli->offset_align); 649 return byte_from_pos (rli->offset, rl 551 bit_from_pos(tree offset, tree bitpos) argument 560 byte_from_pos(tree offset, tree bitpos) argument 804 unsigned HOST_WIDE_INT offset = byte_offset * BITS_PER_UNIT + bit_offset; local 953 HOST_WIDE_INT offset = tree_low_cst (rli->offset, 0); local 985 HOST_WIDE_INT offset = tree_low_cst (rli->offset, 0); local [all...] |
H A D | tree-data-ref.c | 516 the data-ref is described by {base addr + offset} and its access function, 1201 Given an offset expression EXPR received from get_inner_reference, analyze 1406 /* Compute offset. */ 1427 INITIAL_OFFSET - initial offset of EXPR from BASE (an expression) 1428 MISALIGN - offset of EXPR from BASE in bytes (a constant) or NULL_TREE if the 1440 tree *offset, tree *misalign, tree *aligned_to, tree *step) 1452 /* EXPR is of form {base +/- offset} (or {offset +/- base}). */ 1460 For offset, the returned base will be NULL. */ 1490 /* EXPR is of form {base +/- offset} (o 1436 address_analysis(tree expr, tree stmt, bool is_read, struct data_reference *dr, tree *offset, tree *misalign, tree *aligned_to, tree *step) argument 1595 object_analysis(tree memref, tree stmt, bool is_read, struct data_reference **dr, tree *offset, tree *misalign, tree *aligned_to, tree *step, tree *memtag, struct ptr_info_def **ptr_info, subvar_t *subvars) argument 1883 analyze_offset(tree offset, tree *invariant, tree *constant) argument 1958 tree base_address, offset, step, misalign, memtag; local [all...] |
H A D | tree-data-ref.h | 27 /** {base_address + offset + init} is the first location accessed by data-ref 36 offset j_0*D_j + i_0*D_i + C_a x 49 tree offset; member in struct:first_location_in_loop 101 /* The offset of the data-reference from its base in bytes. */ 125 #define DR_OFFSET(DR) (DR)->first_location.offset
|
H A D | tree-flow-inline.h | 1534 /* Return the subvariable of VAR at offset OFFSET. */ 1537 get_subvar_at (tree var, unsigned HOST_WIDE_INT offset) argument 1542 if (SFT_OFFSET (sv->var) == offset) 1582 overlap_subvar (unsigned HOST_WIDE_INT offset, unsigned HOST_WIDE_INT size, argument 1587 |offset, offset + size | 1588 |sv->offset, sv->offset + sv->size | 1590 2. We can have offset starting after sv->offset, lik [all...] |
H A D | tree-flow.h | 982 /* Constant offset. */ 983 unsigned HOST_WIDE_INT offset; member in struct:affine_tree_combination 1000 tree symbol, base, index, step, offset; member in struct:mem_address 1010 to track the offset of the field, since bitpos_of_field gives it relative 1019 HOST_WIDE_INT offset; member in struct:fieldoff
|
H A D | tree-object-size.c | 70 /* Maximum value of offset we consider to be addition. */ 86 /* Compute offset of EXPR within VAR. Return error_mark_node 509 unsigned HOST_WIDE_INT offset) 517 if (offset >= offset_limit) 528 orig_bytes = (offset > orig_bytes) 529 ? (unsigned HOST_WIDE_INT) 0 : orig_bytes - offset; 508 merge_object_sizes(struct object_size_info *osi, tree dest, tree orig, unsigned HOST_WIDE_INT offset) argument
|
H A D | tree-ssa-address.c | 78 rtx * GTY ((skip)) off_p; /* The point in template where the offset should 96 *STEP_P and offset to *OFFSET_P. */ 99 gen_addr_rtx (rtx symbol, rtx base, rtx index, rtx step, rtx offset, argument 135 if (offset) 138 gen_rtx_PLUS (Pmode, act_elem, offset)); 148 else if (offset) 152 *addr = gen_rtx_PLUS (Pmode, *addr, offset); 158 *addr = offset; 186 if (addr->offset && !integer_zerop (addr->offset)) 248 tree step = TMR_STEP (mem_ref), offset = TMR_OFFSET (mem_ref); local [all...] |
H A D | tree-ssa-alias.c | 2792 HOST_WIDE_INT offset, size, maxsize; local 2798 ref = get_ref_base_and_extent (expr, &offset, &size, &maxsize); 2817 if (overlap_subvar (offset, maxsize, sv->var, &exact)) 2963 offset OFFSET, with size SIZE, of variable VAR. */ 2966 create_sft (tree var, tree field, unsigned HOST_WIDE_INT offset, argument 2986 SFT_OFFSET (subvar) = offset; 3023 Fields with offsets which are not constant will have an offset < 0 3032 || fo->offset < 0) 3087 or it has the exact same offset and size as the last 3090 if (((fo->offset < [all...] |
H A D | tree-ssa-ccp.c | 1540 maybe_fold_offset_to_array_ref (tree base, tree offset, tree orig_type) argument 1545 /* If BASE is an ARRAY_REF, we can pick up another offset (this time 1573 Otherwise, compute the offset as an index by using a division. If the 1576 if (integer_zerop (offset)) 1590 TREE_INT_CST_LOW (offset), 1591 TREE_INT_CST_HIGH (offset), 1634 maybe_fold_offset_to_component_ref (tree record_type, tree base, tree offset, argument 1671 /* Check to see if this offset overlaps with the field. */ 1672 cmp = tree_int_cst_compare (field_offset, offset); 1678 /* Here we exactly match the offset bein 1739 maybe_fold_stmt_indirect(tree expr, tree base, tree offset) argument [all...] |
H A D | tree-ssa-forwprop.c | 138 offset = index * element_size; 139 offset_p = (pointer) offset; 594 arbitrary element within the array. The (variable) byte offset 598 it is indeed computing the offset of an element within the array 599 and extract the index corresponding to the given byte offset. 608 forward_propagate_addr_into_variable_array_index (tree offset, tree lhs, argument 613 /* The offset must be defined by a simple MODIFY_EXPR statement. */ 614 if (TREE_CODE (offset) != MODIFY_EXPR) 619 offset = TREE_OPERAND (offset, [all...] |
H A D | tree-ssa-loop-ivopts.c | 47 for the given purpose (adding base and offset for arrays, etc.). 1351 /* If base is a component ref, require that the offset of the reference 1789 unsigned HOST_WIDE_INT *offset) 1801 *offset = 0; 1810 *offset = int_cst_value (expr); 1821 *offset = (code == PLUS_EXPR ? off0 + off1 : off0 - off1); 1851 *offset = off1 * st; 1859 *offset += off0; 1875 *offset = off0 + int_cst_value (tmp); 1883 *offset 1788 strip_offset_1(tree expr, bool inside_addr, bool top_compref, unsigned HOST_WIDE_INT *offset) argument 1925 strip_offset(tree expr, unsigned HOST_WIDE_INT *offset) argument 2194 unsigned HOST_WIDE_INT offset; local 3369 get_address_cost(bool symbol_present, bool var_present, unsigned HOST_WIDE_INT offset, HOST_WIDE_INT ratio) argument 3711 split_address_cost(struct ivopts_data *data, tree addr, bool *symbol_present, bool *var_present, unsigned HOST_WIDE_INT *offset, bitmap *depends_on) argument 3757 ptr_difference_cost(struct ivopts_data *data, tree e1, tree e2, bool *symbol_present, bool *var_present, unsigned HOST_WIDE_INT *offset, bitmap *depends_on) argument 3795 difference_cost(struct ivopts_data *data, tree e1, tree e2, bool *symbol_present, bool *var_present, unsigned HOST_WIDE_INT *offset, bitmap *depends_on) argument 3853 unsigned HOST_WIDE_INT ustepi, cstepi, offset = 0; local 5520 HOST_WIDE_INT offset, size, maxsize; local [all...] |
H A D | tree-ssa-operands.c | 1043 access_can_touch_variable (tree ref, tree alias, HOST_WIDE_INT offset, argument 1046 bool offsetgtz = offset > 0; 1047 unsigned HOST_WIDE_INT uoffset = (unsigned HOST_WIDE_INT) offset; 1061 /* If ALIAS is an SFT, it can't be touched if the offset 1062 and size of the access is not overlapping with the SFT offset and 1067 offset, and get the wrong answer. 1087 However, the access through the foo pointer will be at offset 0. */ 1092 && !overlap_subvar (offset, size, alias, NULL)) 1173 /* If the offset of the access is greater than the size of one of 1209 tree full_ref, HOST_WIDE_INT offset, 1208 add_virtual_operand(tree var, stmt_ann_t s_ann, int flags, tree full_ref, HOST_WIDE_INT offset, HOST_WIDE_INT size, bool for_clobber) argument 1410 get_indirect_ref_operands(tree stmt, tree expr, int flags, tree full_ref, HOST_WIDE_INT offset, HOST_WIDE_INT size, bool recurse_on_base) argument 1492 HOST_WIDE_INT offset, size, maxsize; local 1928 HOST_WIDE_INT offset, size, maxsize; local [all...] |
H A D | tree-ssa-structalias.c | 78 of a constraint type, a variable, and an offset. 91 field" in each variable that points to the next field in offset 97 3. "offset", that tells the offset in bits from the beginning of the 110 foo.a -> id 1, size 32, offset 0, fullsize 64, next foo.b 111 foo.b -> id 2, size 32, offset 32, fullsize 64, next NULL 112 bar -> id 3, size 32, offset 0, fullsize 32, next NULL 154 on and turned into anything), but isn't. You can just see what offset 221 unsigned HOST_WIDE_INT offset; member in struct:variable_info 405 unsigned HOST_WIDE_INT offset; member in struct:constraint_expr 706 solution_set_add(bitmap set, unsigned HOST_WIDE_INT offset) argument 1325 type_safe(unsigned int n, unsigned HOST_WIDE_INT *offset) argument 1355 unsigned HOST_WIDE_INT offset = c->lhs.offset; local 3585 first_vi_for_offset(varinfo_t start, unsigned HOST_WIDE_INT offset) argument 3679 push_fields_onto_fieldstack(tree type, VEC(fieldoff_s,heap) **fieldstack, HOST_WIDE_INT offset, bool *has_union) argument [all...] |
H A D | tree-vect-transform.c | 137 tree offset) 160 if (offset) 162 tree tmp = create_tmp_var (TREE_TYPE (base_offset), "offset"); 164 offset = fold_build2 (MULT_EXPR, TREE_TYPE (offset), offset, 167 base_offset, offset); 223 3. OFFSET (optional): an offset to be added to the initial address accessed 253 tree offset, tree *initial_address, bool only_init) 315 /* Create: (&(base[init_val+offset]) i 135 vect_create_addr_base_for_vector_ref(tree stmt, tree *new_stmt_list, tree offset) argument 251 vect_create_data_ref_ptr(tree stmt, block_stmt_iterator *bsi ATTRIBUTE_UNUSED, tree offset, tree *initial_address, bool only_init) argument 1877 tree offset; local 2759 tree offset = DR_OFFSET (dr); local [all...] |
H A D | tree.h | 27 # define __PAST_END(array, offset) (((typeof(*(array)) *)(array))[offset]) 2225 /* The offset where this basetype appears in its containing type. 2226 BINFO_OFFSET slot holds the offset (in bytes) 2231 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset) 2267 front-end this field is an INTEGER_CST giving an offset into the 2268 vtable where the offset to the virtual base can be found. */ 2300 tree offset; 2431 unsigned HOST_WIDE_INT offset; 2438 #define SFT_OFFSET(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.offset) 2288 tree offset; local 2418 unsigned HOST_WIDE_INT offset; local 2741 tree offset; local 3888 tree offset; member in struct:record_layout_info_s [all...] |
H A D | unwind-dw2.c | 450 _Unwind_Sword offset, stmp; 605 op_ptr = read_sleb128 (op_ptr, &offset); 606 result = _Unwind_GetGR (context, op - DW_OP_breg0) + offset; 610 op_ptr = read_sleb128 (op_ptr, &offset); 611 result = _Unwind_GetGR (context, reg) + offset; 625 offset = *op_ptr++; 626 gcc_assert (offset < stack_elt - 1); 627 result = stack[stack_elt - 1 - offset]; 810 offset = read_2s (op_ptr); 812 op_ptr += offset; 446 _Unwind_Sword offset, stmp; local 871 _Unwind_Sword offset, stmp; local [all...] |
H A D | unwind-dw2.h | 49 _Unwind_Sword offset; member in union:__anon1396::frame_state_reg_info::__anon1397::__anon1398 66 /* The CFA can be described in terms of a reg+offset or a
|
H A D | var-tracking.c | 47 (used for adjusting offset of variables addressed using stack pointer), 51 i.e. it is a list of triplets (reg, decl, offset) where decl is 52 REG_EXPR (reg) and offset is REG_OFFSET (reg). The linked list is used for 180 HOST_WIDE_INT offset; member in struct:attrs_def 186 /* Adjustment of stack offset. */ 233 /* The offset in the variable. */ 234 HOST_WIDE_INT offset; member in struct:variable_part_def 480 HOST_WIDE_INT offset; local 483 offset = VTI (bb)->in.stack_adjust; 487 offset 668 attrs_list_member(attrs list, tree decl, HOST_WIDE_INT offset) argument 679 attrs_list_insert(attrs *listp, tree decl, HOST_WIDE_INT offset, rtx loc) argument 828 HOST_WIDE_INT offset = REG_OFFSET (loc); local 852 HOST_WIDE_INT offset = REG_OFFSET (loc); local 892 HOST_WIDE_INT offset = REG_OFFSET (loc); local 933 HOST_WIDE_INT offset = INT_MEM_OFFSET (loc); local 951 HOST_WIDE_INT offset = INT_MEM_OFFSET (loc); local 968 HOST_WIDE_INT offset = INT_MEM_OFFSET (loc); local 1553 offset_valid_for_tracked_p(HOST_WIDE_INT offset) argument 1562 same_variable_part_p(rtx loc, tree expr, HOST_WIDE_INT offset) argument 2070 find_variable_location_part(variable var, HOST_WIDE_INT offset, int *insertion_point) argument 2102 set_variable_part(dataflow_set *set, rtx loc, tree decl, HOST_WIDE_INT offset) argument 2214 clobber_variable_part(dataflow_set *set, rtx loc, tree decl, HOST_WIDE_INT offset) argument 2274 delete_variable_part(dataflow_set *set, rtx loc, tree decl, HOST_WIDE_INT offset) argument 2771 HOST_WIDE_INT offset; local [all...] |
H A D | varasm.c | 352 /* Create a symbol with label LABEL and place it at byte offset 353 OFFSET in BLOCK. OFFSET can be negative if the symbol's offset 358 HOST_WIDE_INT offset) 376 SYMBOL_REF_BLOCK_OFFSET (symbol) = offset; 2354 HOST_WIDE_INT offset; 2361 int offset = 0; 2370 offset += int_byte_position (TREE_OPERAND (target, 1)); 2376 offset += (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target)), 1) 2412 value->offset = offset; 356 create_block_symbol(const char *label, struct object_block *block, HOST_WIDE_INT offset) argument 2342 HOST_WIDE_INT offset; local 2349 int offset = 0; local 3009 HOST_WIDE_INT offset; local 3018 HOST_WIDE_INT offset; local 6034 unsigned HOST_WIDE_INT size, mask, offset; local 6082 get_section_anchor(struct object_block *block, HOST_WIDE_INT offset, enum tls_model model) argument 6168 HOST_WIDE_INT offset; local [all...] |