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

  /src/external/gpl3/gdb/dist/gdb/
ui-style.h 161 && m_reverse == other.m_reverse);
179 && !m_reverse);
186 return m_reverse;
192 m_reverse = reverse;
243 bool m_reverse = false; member in struct:ui_file_style
ui-style.c 157 if (m_reverse)
296 m_reverse = true;
307 m_reverse = false;
  /src/external/gpl3/gdb.old/dist/gdb/
ui-style.h 161 && m_reverse == other.m_reverse);
179 && !m_reverse);
186 return m_reverse;
192 m_reverse = reverse;
243 bool m_reverse = false; member in struct:ui_file_style
ui-style.c 157 if (m_reverse)
296 m_reverse = true;
307 m_reverse = false;
  /src/external/gpl3/gcc/dist/gcc/text-art/
types.h 303 m_reverse (false),
314 && m_reverse == other.m_reverse
329 bool m_reverse; member in struct:text_art::style
  /src/external/gpl3/gcc/dist/gcc/
dominance.cc 131 bool m_reverse; member in class:__anon13579::dom_info
204 m_reverse = false;
210 m_reverse = true;
244 m_reverse = false;
249 m_reverse = true;
296 block for this tree and m_reverse is true, if predecessors should be visited
306 unsigned d_i = dom_convert_dir_to_idx (m_reverse ? CDI_POST_DOMINATORS
310 edge_iterator ei = m_reverse ? ei_start (bb->preds)
327 if (m_reverse)
391 /* The main entry for calculating the DFS tree or forest. m_reverse is true
    [all...]
expr.cc 1358 bool m_reverse;
1404 m_reverse = false;
1406 m_reverse = true;
1410 m_offset = m_reverse ? len : 0;
1423 m_from.decide_autoinc (mode, m_reverse, len);
1424 m_to.decide_autoinc (mode, m_reverse, len);
1508 if (m_reverse)
1526 if (!m_reverse)
1550 if (m_reverse)
1631 gcc_assert (!m_reverse);
1355 bool m_reverse; member in class:op_by_pieces_d
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
dominance.cc 131 bool m_reverse; member in class:__anon16015::dom_info
204 m_reverse = false;
210 m_reverse = true;
244 m_reverse = false;
249 m_reverse = true;
296 block for this tree and m_reverse is true, if predecessors should be visited
306 unsigned d_i = dom_convert_dir_to_idx (m_reverse ? CDI_POST_DOMINATORS
310 edge_iterator ei = m_reverse ? ei_start (bb->preds)
327 if (m_reverse)
391 /* The main entry for calculating the DFS tree or forest. m_reverse is true
    [all...]
expr.cc 1138 bool m_reverse;
1184 m_reverse = false;
1186 m_reverse = true;
1190 m_offset = m_reverse ? len : 0;
1204 m_from.decide_autoinc (mode, m_reverse, len);
1205 m_to.decide_autoinc (mode, m_reverse, len);
1290 if (m_reverse)
1308 if (!m_reverse)
1332 if (m_reverse)
1414 gcc_assert (!m_reverse);
1135 bool m_reverse; member in class:op_by_pieces_d
    [all...]

Completed in 51 milliseconds