/freebsd-11.0-release/contrib/gcc/ |
H A D | builtins.c | 1095 /* If we can prove the memory starting at XEXP (mem, 0) 1096 and ending at XEXP (mem, 0) + LENGTH will fit into 1331 return copy_addr_to_reg (XEXP (registers, 0)); 1525 result = copy_addr_to_reg (XEXP (result, 0)); 1914 && GET_CODE (XEXP (note, 0)) == EXPR_LIST 1915 && XEXP (XEXP (note, 0), 1) != NULL_RTX 1916 && XEXP (XEXP (XEXP (not [all...] |
H A D | cfganal.c | 75 && REG_P (XEXP (PATTERN (insn), 0)) 76 && REG_FUNCTION_VALUE_P (XEXP (PATTERN (insn), 0)))
|
H A D | genextract.c | 284 walk_rtx (XEXP (x, i), acc); 318 /* We first write out the operations (XEXP or XVECEXP) in reverse 326 fputs ("XEXP (", stdout);
|
H A D | genoutput.c | 541 scan_operands (d, XEXP (part, 0), 1, 0); 545 scan_operands (d, XEXP (part, 0), 0, 1); 559 scan_operands (d, XEXP (part, i), 0, 0);
|
H A D | ddg.c | 128 if (rtx_mem_access_p (XEXP (x, i))) 399 for (link = LOG_LINKS (dest_node->insn); link; link = XEXP (link, 1)) 401 ddg_node_ptr src_node = get_node_of_insn (g, XEXP (link, 0));
|
H A D | modulo-sched.c | 290 if (REG_P (XEXP (condition, 0))) 291 reg = XEXP (condition, 0); 292 else if (GET_CODE (XEXP (condition, 0)) == PLUS 293 && REG_P (XEXP (XEXP (condition, 0), 0))) 294 reg = XEXP (XEXP (condition, 0), 0);
|
H A D | rtl.h | 682 #define XEXP(RTX, N) (RTL_CHECK2 (RTX, N, 'e', 'u').rt_rtx) 738 #define PREV_INSN(INSN) XEXP (INSN, 1) 739 #define NEXT_INSN(INSN) XEXP (INSN, 2) 744 #define PATTERN(INSN) XEXP (INSN, 5) 755 #define LOG_LINKS(INSN) XEXP(INSN, 7) 799 #define REG_NOTES(INSN) XEXP(INSN, 8) 826 #define CALL_INSN_FUNCTION_USAGE(INSN) XEXP(INSN, 9) 681 #define XEXP macro
|
H A D | bb-reorder.c | 1587 if (GET_CODE (XEXP (set_src, 1)) == PC) 1588 old_label = XEXP (set_src, 2); 1589 else if (GET_CODE (XEXP (set_src, 2)) == PC) 1590 old_label = XEXP (set_src, 1);
|
H A D | dwarf2asm.c | 769 return XEXP (DECL_RTL (decl), 0);
|
H A D | optabs.c | 175 || ! rtx_equal_p (XEXP (SET_DEST (set), 0), target))) 3445 if (note != 0 && INTVAL (XEXP (note, 0)) <= 0) 3460 XEXP (note, 0) = constm1_rtx; 3696 XEXP (x, 0), Pmode, 3697 XEXP (y, 0), Pmode, 5168 symbol = XEXP (DECL_RTL (decl), 0); 5774 cc_op0 = XEXP (comparison, 0); 5775 cc_op1 = XEXP (comparison, 1);
|
H A D | df-problems.c | 3233 if (df_ignore_stack_reg (REGNO (XEXP (link, 0)))) 3234 REG_N_DEATHS (REGNO (XEXP (link, 0)))++; 3238 if (!df_ignore_stack_reg (REGNO (XEXP (link, 0)))) 3240 rtx next = XEXP (link, 1); 3250 pprev = &XEXP (link, 1);
|
H A D | stmt.c | 1957 gcc_assert (REG_P (XEXP (DECL_RTL (decl), 0))); 1958 oldaddr = XEXP (DECL_RTL (decl), 0); 1972 addr = force_operand (XEXP (DECL_RTL (decl), 0), oldaddr);
|
H A D | cfglayout.c | 701 && INTVAL (XEXP (note, 0)) < REG_BR_PROB_BASE / 2
|
H A D | tree-inline.c | 2792 XEXP (DECL_RTL (new_decl), 0) = 2793 gen_rtx_SYMBOL_REF (GET_MODE (XEXP (DECL_RTL (old_decl), 0)),
|
H A D | bt-load.c | 239 dest = XEXP (dest, 0);
|
H A D | cgraphunit.c | 1752 fn (XEXP (DECL_RTL (decl), 0), priority);
|
H A D | tree-ssa-loop-ivopts.c | 2524 cost += address_cost (XEXP (rslt, 0), TYPE_MODE (type)); 3340 XEXP (addr, 1) = gen_int_mode (i, Pmode); 3397 XEXP (addr, 1) = gen_int_mode (i, Pmode); 3406 XEXP (addr, 1) = gen_int_mode (-i, Pmode);
|
H A D | c-decl.c | 7463 targetm.asm_out.constructor (XEXP (DECL_RTL (fndecl), 0), 7467 targetm.asm_out.destructor (XEXP (DECL_RTL (fndecl), 0),
|
H A D | genautomata.c | 1721 DECL_INSN_RESERV (decl)->condexp = XEXP (def, 2);
|
/freebsd-11.0-release/contrib/gcc/config/mips/ |
H A D | mips.h | 1402 && GET_CODE (XEXP (X, 0)) == UNSPEC \ 1403 && XINT (XEXP (X, 0), 1) == UNSPEC_GP) 2234 XSTR (XEXP (DECL_RTL (current_function_decl), 0), 0)); \
|
/freebsd-11.0-release/contrib/gcc/cp/ |
H A D | method.c | 435 fnname = XSTR (XEXP (DECL_RTL (thunk_fndecl), 0), 0);
|
H A D | decl2.c | 2424 rtx fnsym = XEXP (DECL_RTL (fn), 0);
|
/freebsd-11.0-release/contrib/gcc/config/rs6000/ |
H A D | rs6000.h | 1993 const char *alias = XSTR (XEXP (DECL_RTL (DECL), 0), 0); \
|