/freebsd-11-stable/contrib/gcc/ |
H A D | regclass.c | 32 #include "hard-reg-set.h" 135 /* Contains 1 for registers that are set or clobbered by calls. */ 138 fixed_regs. Which leaves us guessing as to the set of fixed_regs 250 struct reg_info_data *next; /* next set of reg_info structures */ 779 /* If we're globalizing the frame pointer, we need to set the 781 set in fixed_regs. */ 804 and of using memory for each pseudo. We use this data to set up 977 /* If we get here, we are set up to record the costs of all the 1040 rtx set, note; 1055 set 1035 rtx set, note; local 1407 rtx set; local [all...] |
H A D | regmove.c | 38 #include "hard-reg-set.h" 138 is set, but the value is dead. Failure to do so will 174 /* If we get something that isn't a simple set, or a 175 [(set ..) (clobber ..)], this whole function will go wrong. */ 297 as the destination of a set. */ 576 /* If SRC is a hard register which is set or killed in some other 593 ending with the set of SRC to DEST, with SRC. We do not do this 604 rtx set; 617 set = single_set (p); 618 if (set 599 rtx set; local 659 rtx p, set; local 745 rtx set; local 1095 rtx set; local 1256 rtx set, p, src, dst; local 1661 fixup_match_1(rtx insn, rtx set, rtx src, rtx src_subreg, rtx dst, int backward, int operand_number, int match_number) argument 2237 rtx set; local 2317 rtx insn, next, set; local [all...] |
H A D | regrename.c | 31 #include "hard-reg-set.h" 100 note_sets (rtx x, rtx set ATTRIBUTE_UNUSED, void *data) 143 its lifetime and set the corresponding bits in *PSET. */ 176 /* For the last reference, also merge in all registers set in the 268 count number of uses, and narrow the set of registers we can 1188 kill_clobbered_value (rtx x, rtx set, void *data) 1191 if (GET_CODE (set) == CLOBBER) 1195 /* Called through note_stores. If X is set, not clobbered, kill its 1199 kill_set_value (rtx x, rtx set, void *data) 1202 if (GET_CODE (set) ! 1187 kill_clobbered_value(rtx x, rtx set, void *data) argument 1198 kill_set_value(rtx x, rtx set, void *data) argument 1600 rtx set; local 1871 HARD_REG_SET set; local 1926 HARD_REG_SET set; local [all...] |
H A D | reload.c | 104 #include "hard-reg-set.h" 312 we didn't need one. *PICODE is set to the insn_code to use if we do 462 set it up now. Note that we do the input case before making 595 allocate a new one. `something_changed' in reload will get set 826 (set (reg r13) (plus (reg r13) (const int 1))), and there is an 829 (set (reg r13) (plus (reg r13) (const int 999))), and the constant 999 1297 set, so that the storing insn can be deleted later. */ 1385 reloads. Remove the extra set now, so that if we later find 1485 If one of them is acceptable, set rld[i].reg_rtx 1543 the reload register if it is set i 2565 rtx set = single_set (insn); local [all...] |
H A D | reload1.c | 29 #include "hard-reg-set.h" 89 /* Elt N nonzero if reg_last_reload_reg[N] has been set in this insn 145 use; all of these must remain set for an inheritance to occur. */ 150 when reg_reloaded_valid is set for this register. */ 156 This is only valid if reg_reloaded_contents is set and valid. */ 180 reload_out is a MEM, spill_reg_stored_to will be set to reload_out_reg. */ 191 /* This reg set indicates registers that can't be used as spill registers for 199 we can't eliminate. A register that appears in this set also can't be used 228 marked in this set. */ 268 /* Flag set b 728 rtx set = single_set (insn); local 1490 rtx set = single_set (insn); local 1517 rtx set = single_set (insn); local 5764 rtx set = single_set (insn); local 6958 rtx set; local 6987 rtx set = single_set (insn); local 7535 rtx set = single_set (insn); local 7812 rtx set; local 8005 rtx set = single_set (i2); local 8029 rtx set = single_set (i2); local 8058 rtx set = single_set (dead_insn); local 8094 rtx prev, set, dst, i2; local [all...] |
H A D | reorg.c | 85 (3) `relax_delay_slots' uses a set of rules to simplify code that 125 #include "hard-reg-set.h" 266 resource set contains a volatile memory reference. Otherwise, return FALSE. */ 291 referenced by INSN. If INCLUDE_DELAYED_EFFECTS is set, return if the called 311 INCLUDE_DELAYED_EFFECTS is set if the actions of that routine should be 312 included. CC0 is only modified if it is explicitly set; see comments 336 we start with a bare RETURN insn and call find_end_label. It may set 505 Otherwise CUR_INSN_UID will get set to an incorrect value because 685 /* If a reg-note was found, it points to an insn to set CC0. This 1197 (in DELAY_LIST). SETS and NEEDED are denote resources already set an 1425 struct resources set, needed; local 1612 struct resources needed, set; local 1995 struct resources needed, set; local 2502 struct resources opposite_needed, set, needed; local [all...] |
H A D | resource.c | 29 #include "hard-reg-set.h" 217 /* Handle leaf items for which we set resource flags. Also, special-case 304 /* Usually, the first operand of SET is set, not referenced. But 364 We assume that they both use and set all registers. Using all 432 looking for registers that are set before they are used. These are dead. argument 439 struct resources set, struct resources needed) 478 underlying insn. Any registers set by the underlying insn 554 target_set = set; 562 mark_set_resources (insn, &set, 0, MARK_SRC_DEST_CALL); 566 mark_set_resources (insn, &set, 895 struct resources set, needed; local [all...] |
H A D | rtlanal.c | 30 #include "hard-reg-set.h" 67 and set by `-m...' switches. Must be defined in rtlanal.c. */ 730 /* Nonzero if register REG is set or clobbered in an insn between 923 rtx set = NULL; 940 but one are dead as single set insns. In common case 941 only single set is present in the pattern so we want 944 When we reach set first time, we just expect this is 945 the single set we are looking for and only when more 949 if (find_reg_note (insn, REG_UNUSED, SET_DEST (set)) 950 && !side_effects_p (set)) 914 rtx set = NULL; local 996 set_noop_p(rtx set) argument 1089 rtx set = single_set (p); local 3172 rtx set; local 4276 rtx set; local 4338 rtx set; local 4601 rtx set; local [all...] |
H A D | sched-deps.c | 34 #include "hard-reg-set.h" 965 /* Don't move CC0 setter to another block (it can set up the 1416 rtx tmp, set = single_set (insn); 1419 if (set == NULL) 1422 tmp = SET_DEST (set); 1430 tmp = SET_SRC (set); 1487 rtx link, end_seq, r0, set; 1538 /* We don't know what set of fixed registers might be used 1612 && (set = single_set (end_seq)) != 0 1613 && SET_DEST (set) 1408 rtx tmp, set = single_set (insn); local 1479 rtx link, end_seq, r0, set; local [all...] |
H A D | sched-ebb.c | 32 #include "hard-reg-set.h" 92 once before scheduling a set of insns. */ 230 /* INSN is a JUMP_INSN, COND_SET is the set of registers that are 231 conditionally set before INSN. Store the set of registers that 233 registers that must be considered as set in SET. */ 237 regset set) 250 bitmap_and (set, glat_start [e->dest->index], cond_set); 234 compute_jump_reg_dependencies(rtx insn, regset cond_set, regset used, regset set) argument
|
H A D | sched-rgn.c | 56 #include "hard-reg-set.h" 240 /* Bit-set of edges, where bit i stands for edge i. */ 258 pot_split[bb] is the set of potential split edges of bb. */ 261 /* For every bb, a set of its ancestor edges. */ 372 extract_edgelst (sbitmap set, edgelst *el) 384 EXECUTE_IF_SET_IN_SBITMAP (set, 0, i, sbi) 823 of the loop (i.e. they will not have max_hdr set to A). 826 had max_hdr set since they'd have a backedge to a dominator 1030 HEADER - set of all region heads. 1066 iteration the set o 371 extract_edgelst(sbitmap set, edgelst *el) argument [all...] |
H A D | see.c | 29 Depending on the instruction set of the architecture, some of these 88 set ((reg:SI 10) (..def1rhs..)) 89 set ((reg:DI 100) (sign_extend:DI (reg:SI 10))) 92 set ((reg:DI 100) (const_int 7)) 95 set ((reg:SI 20) (..def3rhs..)) 96 set ((reg:DI 100) (sign_extend:DI (reg:SI 20))) 99 set ((reg:CC...) (compare:CC (reg:DI 100) (...))) 102 set ((...) (reg:DI 100)) 124 set ((reg:DI 100) (sign_extend:DI ((subreg:SI (reg:DI 100))))) 125 set ((re 673 rtx set, rhs, lhs; local 721 rtx rhs, lhs, set; local 835 rtx set = single_set (extension->se_insn); local 968 rtx set, lhs; local 2454 rtx set, rhs; local 3423 rtx set = NULL; local [all...] |
H A D | struct-equiv.c | 29 1. RX and RY are local to their respective blocks; they are set there and 62 STRUCT_EQUIV_START bit set in the mode parameter. This will calculate the 64 need_rerun field is set, the results are only tentative, and the caller 209 assign_reg_reg_set (regset set, rtx reg, int value) 223 if ((value != 0) == REGNO_REG_SET_P (set, regno)) 226 old++, SET_REGNO_REG_SET (set, regno); 228 old--, CLEAR_REGNO_REG_SET (set, regno); 266 /* We have a profitable set of changes. If this is the final pass, 435 /* If info->live_update is not set, we are processing notes. 775 [(set (re 208 assign_reg_reg_set(regset set, rtx reg, int value) argument [all...] |
H A D | tree-into-ssa.c | 31 #include "hard-reg-set.h" 61 /* Structure to map a variable VAR to the set of blocks that contain 68 /* Blocks that contain definitions of VAR. Bit I will be set if the 95 underlying variable should be set to the given SSA_NAME. 139 create new names on the fly. FIXME. Currently set to 1/3 to avoid 148 bitmap set; member in struct:repl_map_d 181 /* This bitmap contains the variables which are set before they 219 /* The set of blocks affected by update_ssa. */ 354 /* Compute global livein information given the set of blockx where 356 and the set o 2171 bitmap set = names_replaced_by (var); local 2632 mark_set_for_renaming(bitmap set) argument [all...] |
H A D | tree-ssa-alias.c | 29 #include "hard-reg-set.h" 50 #include "pointer-set.h" 59 /* Structure to map a variable to its alias set and keep track of the 63 /* Variable and its alias set. */ 65 HOST_WIDE_INT set; member in struct:alias_map_d 121 /* Call clobbered variables in the function. If bit I is set, then 125 /* Addressable variables in the function. If bit I is set, then 298 /* Early exit once both global and cc are set, since the 310 clobbered will be set clobbered. Tags clobbered because they 398 /* This variable is set t [all...] |
H A D | tree-ssa-ccp.c | 52 the form V_i = CONST is found, V_i's lattice value is set to 65 same constant C, then the LHS of the PHI is set to C. This 177 set to true. This affects the evaluation of statements and PHI 315 3- If SSA_NAME_VALUE is set and it is a constant, its value is 648 because A_2 may have been set in another function. If we had used 742 set the PHI node's default lattice value to be 1176 creates virtual definitions, set the value of each new name to that 1263 value to set. */ 1275 /* Otherwise, set the names in V_MAY_DEF/V_MUST_DEF operands 1297 of virtual uses, so it is enough to set th 2058 bool set; local [all...] |
H A D | tree-ssa-loop-ivopts.c | 21 /* This pass tries to find the optimal set of induction variables for the loop. 40 3) The optimal (w.r. to a cost function) set of variables is chosen. The 45 variable in the set and adds its cost to the sum. The cost reflects 51 -- The set cost. Depending on the size of the set, extra cost may be 72 #include "hard-reg-set.h" 152 bitmap related_cands; /* The set of "related" iv candidates, plus the common 245 /* Number of uses that cannot be expressed by the candidates in the set. */ 257 /* The number of candidates in the set. */ 304 /* If there are at most this number of ivs in the set, tr 2415 rtx set; local 5234 struct iv_ca *set; local 5320 create_new_ivs(struct ivopts_data *data, struct iv_ca *set) argument [all...] |
H A D | tree-ssa-pre.c | 76 SSA, values are never killed, so we don't need a kill set, or a 89 set. Even in SSA form, values are not live over the entire 91 remove values from the ANTIC set once we go past the definition 141 expressions for use in the ANTIC sets, the EXP_GEN set, etc. 151 you will see "value.5 + value.7" in the set, instead of "a_55 + 164 track of values present in the set, and one that keeps track of 165 expressions present in the set. 169 set. The sets represent values, and the elements can be values or 171 element can only appear once in each set. 173 Since each node in the set represent 487 value_exists_in_set_bitmap(value_set_t set, tree v) argument 499 value_remove_from_set_bitmap(value_set_t set, tree v) argument 514 value_insert_into_set_bitmap(value_set_t set, tree v) argument 553 bitmap_insert_into_set(bitmap_set_t set, tree expr) argument 571 insert_into_set(value_set_t set, tree expr) argument 654 bitmap_set_empty_p(bitmap_set_t set) argument 680 set_remove(value_set_t set, tree expr) argument 711 set_contains_value(value_set_t set, tree val) argument 725 bitmap_set_contains(bitmap_set_t set, tree expr) argument 741 bitmap_set_contains_value(bitmap_set_t set, tree val) argument 751 bitmap_set_replace_value(bitmap_set_t set, tree lookfor, tree expr) argument 825 bitmap_value_replace_in_set(bitmap_set_t set, tree expr) argument 838 bitmap_value_insert_into_set(bitmap_set_t set, tree expr) argument 852 value_insert_into_set(value_set_t set, tree expr) argument 869 bitmap_print_value_set(FILE *outfile, bitmap_set_t set, const char *setname, int blockindex) argument 896 print_value_set(FILE *outfile, value_set_t set, const char *setname, int blockindex) argument 945 debug_value_set(value_set_t set, const char *setname, int blockindex) argument 1032 phi_translate(tree expr, value_set_t set, basic_block pred, basic_block phiblock) argument 1395 phi_translate_set(value_set_t dest, value_set_t set, basic_block pred, basic_block phiblock) argument 1431 bitmap_find_leader(bitmap_set_t set, tree val) argument 1473 find_leader(value_set_t set, tree val) argument 1546 valid_in_set(value_set_t set, tree expr, basic_block block) argument 1646 clean(value_set_t set, basic_block block) argument [all...] |
H A D | tree-ssa-structalias.c | 32 #include "hard-reg-set.h" 54 #include "pointer-set.h" 56 /* The idea behind this analyzer is to generate set constraints from the 62 describing the variables (each variable is a set) and operations that 63 are involved on the variables, and a set of rules that derive facts 64 from these operations. To solve a system of set constraints, you derive 115 In order to solve the system of set constraints, the following is 118 1. Each constraint variable x has a solution set associated with it, 144 appropriate variables to the solution set. 241 /* True if this is a special variable whose solution set shoul 706 solution_set_add(bitmap set, unsigned HOST_WIDE_INT offset) argument [all...] |
H A D | var-tracking.c | 37 < set < clobber < post-modifying stack adjustment 42 The IN set for basic block BB is computed as a union of OUT sets of BB's 43 predecessors, the OUT set for BB is copied from the IN set for BB and 53 effective deleting appropriate variable parts when we set or clobber the 63 set A; 65 set B; 77 (this means that we also emit notes for changes between the OUT set of the 78 previous block and the IN set of the current block). 95 #include "hard-reg-set 642 init_attrs_list_set(attrs *set) argument 733 unshare_variable(dataflow_set *set, variable var) argument 825 var_reg_set(dataflow_set *set, rtx loc) argument 849 var_reg_delete_and_set(dataflow_set *set, rtx loc, bool modify) argument 884 var_reg_delete(dataflow_set *set, rtx loc, bool clobber) argument 911 var_regno_delete(dataflow_set *set, int regno) argument 930 var_mem_set(dataflow_set *set, rtx loc) argument 948 var_mem_delete_and_set(dataflow_set *set, rtx loc, bool modify) argument 965 var_mem_delete(dataflow_set *set, rtx loc, bool clobber) argument 980 dataflow_set_init(dataflow_set *set, int vars_size) argument 991 dataflow_set_clear(dataflow_set *set) argument 1058 dataflow_set *set = (dataflow_set *) data; local 1427 dataflow_set_destroy(dataflow_set *set) argument 1980 dump_dataflow_set(dataflow_set *set) 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 2601 dataflow_set set; local [all...] |
H A D | web.c | 27 We don't split registers with REG_USERVAR set unless -fmessy-debugging 53 #include "hard-reg-set.h" 67 /* Find the root of unionfind tree (the representative of set). */ 113 rtx set; local 119 set = single_set (insn); 125 set = NULL; 146 if (set 147 && SET_SRC (set) == DF_REF_REG (use) 148 && SET_SRC (set) == SET_DEST (set)) [all...] |
/freebsd-11-stable/contrib/gcclibs/libcpp/ |
H A D | charset.c | 26 /* Character set handling for C-family languages. 28 Terminological note: In what follows, "charset" or "character set" 29 will be taken to mean both an abstract set of characters and an 30 encoding for that set. 33 The source character set is used for internal processing in translation 34 phases 1 through 4; the execution character set is used thereafter. 37 of these terms). Furthermore, the "basic character set" (listed in 42 character set" used to encode wide character constants and wide 49 The source character set is not necessarily the character set use [all...] |
H A D | files.c | 1112 /* Not everyone who wants to set system-header-ness on a buffer can 1247 If BRACKET does not lie in the QUOTE chain, it is set to QUOTE. */ 1289 char *alloc, *set; local 1293 set = alloc = XNEWVEC (char, len + 1); 1296 *set++ = ch; 1299 if (set - alloc == len) 1303 set = alloc + len / 2; 1305 *set++ = ch; 1308 *set = '\0'; 1512 /* Are there any values with once_only set [all...] |
H A D | line-map.c | 29 /* Initialize a line map set. */ 32 linemap_init (struct line_maps *set) argument 34 set->maps = NULL; 35 set->allocated = 0; 36 set->used = 0; 37 set->last_listed = -1; 38 set->trace_includes = false; 39 set->depth = 0; 40 set->cache = 0; 41 set 49 linemap_check_files_exited(struct line_maps *set) argument 63 linemap_free(struct line_maps *set) argument 88 linemap_add(struct line_maps *set, enum lc_reason reason, unsigned int sysp, const char *to_file, unsigned int to_line) argument 179 linemap_line_start(struct line_maps *set, unsigned int to_line, unsigned int max_column_hint) argument 237 linemap_position_for_column(struct line_maps *set, unsigned int to_column) argument 265 linemap_lookup(struct line_maps *set, source_location line) argument 304 linemap_print_containing_files(struct line_maps *set, const struct line_map *map) argument 341 trace_include(const struct line_maps *set, const struct line_map *map) argument [all...] |
/freebsd-11-stable/contrib/gcclibs/libcpp/include/ |
H A D | line-map.h | 44 INCLUDED_FROM is an index into the set that gives the line mapping 46 of the include stack have this set to -1. REASON is the reason for 63 /* A set of chronological line_map structures. */ 94 /* Initialize a line map set. */ 97 /* Free a line map set. */ 111 (struct line_maps *set, unsigned int to_line, unsigned int max_column_hint); 122 A call to this function can relocate the previous set of 166 struct line_maps *set = (SET); \ 167 if (__builtin_expect (to_column >= set->max_column_hint, 0)) \ 168 (LOC) = linemap_position_for_column (set, to_colum [all...] |