Searched refs:m_prev (Results 1 - 11 of 11) sorted by relevance

/netbsd-current/external/gpl3/gcc.old/dist/gcc/
H A Dshortest-paths.h53 auto_vec<const edge_t *> m_prev; member in class:shortest_paths
59 m_prev with enough information to be able to generate Path_t instances
68 m_prev (graph.m_nodes.length ())
77 m_prev.quick_push (NULL);
119 m_prev[dest->m_index] = succ;
134 while (m_prev[to->m_index])
136 result.m_edges.safe_push (m_prev[to->m_index]);
137 to = m_prev[to->m_index]->m_src;
H A Dggc-tests.c339 chain_prev ("%h.m_prev") )) test_node
341 test_node *m_prev;
378 new_node->m_prev = tail_node;
334 test_node *m_prev; variable
H A Dhsa-regalloc.c494 for (insn = hbb->m_last_insn; insn; insn = insn->m_prev)
542 for (insn = hbb->m_last_insn; insn; insn = insn->m_prev)
H A Dhsa-gen.c1363 : m_prev (NULL),
1431 : m_prev (NULL), m_next (NULL), m_bb (NULL), m_opcode (opc),m_number (0),
1767 insn->m_prev = m_last_insn;
1781 hphi->m_prev = m_last_phi;
1800 new_insn->m_prev = old_insn->m_prev;
1802 if (old_insn->m_prev)
1803 old_insn->m_prev->m_next = new_insn;
1804 old_insn->m_prev = new_insn;
1817 new_insn->m_prev
[all...]
H A Dhsa-common.h456 hsa_insn_basic *m_prev, *m_next; member in class:hsa_insn_basic
/netbsd-current/external/bsd/atf/dist/atf-c/detail/
H A Dlist.c44 struct list_entry *m_prev; member in struct:list_entry
78 le->m_prev = le->m_next = NULL;
106 le->m_prev = prev;
110 next->m_prev = le;
215 lebeg->m_prev = NULL;
218 leend->m_prev = lebeg;
361 prev = next->m_prev;
381 e1 = ghost1->m_prev;
388 e2->m_prev = e1;
/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Dggc-tests.cc328 chain_prev ("%h.m_prev") )) test_node
330 test_node *m_prev;
367 new_node->m_prev = tail_node;
323 test_node *m_prev; variable
/netbsd-current/external/gpl3/gcc.old/dist/libphobos/src/std/
H A Dconcurrency.d2172 return !m_prev.next;
2177 enforce(m_prev.next, "invalid list node");
2178 return m_prev.next.val;
2183 enforce(m_prev.next, "invalid list node");
2184 m_prev.next.val = val;
2189 enforce(m_prev.next, "invalid list node");
2190 m_prev = m_prev.next;
2195 m_prev = p;
2198 private Node* m_prev;
[all...]
/netbsd-current/external/gpl3/gcc/dist/libphobos/src/std/
H A Dconcurrency.d2435 return !m_prev.next;
2440 enforce(m_prev.next, "invalid list node");
2441 return m_prev.next.val;
2446 enforce(m_prev.next, "invalid list node");
2447 m_prev.next.val = val;
2452 enforce(m_prev.next, "invalid list node");
2453 m_prev = m_prev.next;
2458 m_prev = p;
2461 private Node* m_prev;
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/gcc/config/gcn/
H A Dgcn.c3804 machine_mode m_prev = insn_data[icode].operand[4].mode; local
3805 arg_prev = force_reg (m_prev,
3807 m_prev, EXPAND_NORMAL));
/netbsd-current/external/gpl3/gcc/dist/gcc/config/gcn/
H A Dgcn.cc4038 machine_mode m_prev = insn_data[icode].operand[4].mode; local
4039 arg_prev = force_reg (m_prev,
4041 m_prev, EXPAND_NORMAL));

Completed in 169 milliseconds