Searched refs:old_next (Results 1 - 6 of 6) sorted by relevance

/haiku-buildtools/binutils/libiberty/
H A Dpartition.c81 struct partition_elem *old_next; local
113 old_next = e1->next;
115 e2->next = old_next;
/haiku-buildtools/gcc/libiberty/
H A Dpartition.c81 struct partition_elem *old_next; local
113 old_next = e1->next;
115 e2->next = old_next;
/haiku-buildtools/legacy/binutils/libiberty/
H A Dpartition.c81 struct partition_elem *old_next; local
113 old_next = e1->next;
115 e2->next = old_next;
/haiku-buildtools/gcc/gcc/
H A Dipa-cp.c2936 struct cgraph_edge *old_next = next_edge_clone[src->uid]; local
2937 if (old_next)
2938 prev_edge_clone[old_next->uid] = dst;
2941 next_edge_clone[dst->uid] = old_next;
H A Dreload1.c4644 rtx_insn *old_next = NEXT_INSN (insn);
4786 for (rtx_insn *x = NEXT_INSN (insn); x != old_next; x = NEXT_INSN (x))
4820 for (p = PREV_INSN (old_next); p != prev; p = PREV_INSN (p))
4903 x != old_next;
4625 rtx_insn *old_next = NEXT_INSN (insn); local
/haiku-buildtools/legacy/gcc/gcc/
H A Dreload1.c4249 rtx old_next = NEXT_INSN (insn);
4366 for (x = NEXT_INSN (insn); x != old_next; x = NEXT_INSN (x))
4400 for (p = PREV_INSN (old_next); p != prev; p = PREV_INSN (p))
4230 rtx old_next = NEXT_INSN (insn); local

Completed in 214 milliseconds