Home
last modified time | relevance | path

Searched refs:q_forw (Results 1 – 6 of 6) sorted by relevance

/freebsd/bin/ed/
H A Dundo.c101 REQUE(ustack[n].h->q_back, ustack[n].t->q_forw); in pop_undo_stack()
105 REQUE(ustack[n].t, ustack[n].t->q_forw); in pop_undo_stack()
109 REQUE(ustack[n - 1].h, ustack[n].h->q_forw); in pop_undo_stack()
140 ep = ustack[u_p].t->q_forw; in clear_undo_stack()
143 tl = lp->q_forw; in clear_undo_stack()
H A Ded.h65 struct line *q_forw; member
161 #define REQUE(pred, succ) (pred)->q_forw = (succ), (succ)->q_back = (pred)
166 REQUE((elem), (pred)->q_forw); \
171 #define REMQUE(elem) REQUE((elem)->q_back, (elem)->q_forw);
H A Dbuf.c148 while (cp != lp && (cp = cp->q_forw) != &buffer_head) in get_line_node_addr()
169 lp = lp->q_forw; in get_addressed_line_node()
182 lp = lp->q_forw; in get_addressed_line_node()
H A Dmain.c1070 for (; bp != ep; bp = bp->q_forw) { in join_lines()
1123 a2 = b2->q_forw; in move_lines()
1124 REQUE(b2, b1->q_forw); in move_lines()
1131 unset_active_nodes(b2->q_forw, a2); in move_lines()
1153 for (; n-- > 0; np = np->q_forw) { in copy_lines()
1189 unset_active_nodes(p->q_forw, n); in delete_lines()
1213 for (; bp != ep; bp = bp->q_forw) { in display_lines()
H A Dglbl.c57 for (n = first_addr; n <= second_addr; n++, lp = lp->q_forw) { in build_active_list()
188 for (lp = np; lp != mp; lp = lp->q_forw) in unset_active_nodes()
H A Dio.c85 lp = lp->q_forw; in read_stream()
179 for (; n && n <= m; n++, lp = lp->q_forw) { in write_stream()