HomeSort by: relevance | last modified time | path
    Searched refs:inner_dest (Results 1 - 6 of 6) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/analyzer/
trimmed-graph.cc 140 const exploded_node *inner_dest = inner_edge->m_dest; local
142 trimmed_node *tdest = *m_map_from_enode_to_tnode.get (inner_dest);
  /src/external/gpl3/gcc.old/dist/gcc/analyzer/
trimmed-graph.cc 152 const exploded_node *inner_dest = inner_edge->m_dest; local
154 trimmed_node *tdest = *m_map_from_enode_to_tnode.get (inner_dest);
  /src/external/gpl3/gcc/dist/gcc/
combine.cc 2114 rtx inner_dest = dest;
2117 while (GET_CODE (inner_dest) == STRICT_LOW_PART
2118 || GET_CODE (inner_dest) == SUBREG
2119 || GET_CODE (inner_dest) == ZERO_EXTRACT)
2120 inner_dest = XEXP (inner_dest, 0);
2126 if ((inner_dest != dest &&
2127 (!MEM_P (inner_dest)
2128 || rtx_equal_p (i2dest, inner_dest)
2129 || (i1dest && rtx_equal_p (i1dest, inner_dest))
2102 rtx inner_dest = dest; local
14719 rtx inner_dest = 0; local
    [all...]
cse.cc 4150 rtx inner_dest;
5553 sets[i].inner_dest = dest;
5798 rtx x = sets[i].inner_dest;
6012 elt->in_memory = (MEM_P (sets[i].inner_dest)
6013 && !MEM_READONLY_P (sets[i].inner_dest));
  /src/external/gpl3/gcc.old/dist/gcc/
combine.cc 2112 rtx inner_dest = dest;
2115 while (GET_CODE (inner_dest) == STRICT_LOW_PART
2116 || GET_CODE (inner_dest) == SUBREG
2117 || GET_CODE (inner_dest) == ZERO_EXTRACT)
2118 inner_dest = XEXP (inner_dest, 0);
2124 if ((inner_dest != dest &&
2125 (!MEM_P (inner_dest)
2126 || rtx_equal_p (i2dest, inner_dest)
2127 || (i1dest && rtx_equal_p (i1dest, inner_dest))
2100 rtx inner_dest = dest; local
14558 rtx inner_dest = 0; local
    [all...]
cse.cc 4160 rtx inner_dest;
5545 sets[i].inner_dest = dest;
5790 rtx x = sets[i].inner_dest;
6004 elt->in_memory = (MEM_P (sets[i].inner_dest)
6005 && !MEM_READONLY_P (sets[i].inner_dest));

Completed in 45 milliseconds