Lines Matching refs:rlink
55 struct tree *rlink; /* Right link (to larger labels). */ member
162 dirs[depth++] = R, link = link->rlink; in kwsincr()
175 link->rlink = 0; in kwsincr()
194 links[depth]->rlink = link; in kwsincr()
216 r = links[depth], t = r->llink, rl = t->rlink; in kwsincr()
217 t->rlink = r, r->llink = rl; in kwsincr()
221 r = links[depth], l = r->llink, t = l->rlink; in kwsincr()
222 rl = t->rlink, lr = t->llink; in kwsincr()
223 t->llink = l, l->rlink = lr, t->rlink = r, r->llink = rl; in kwsincr()
236 l = links[depth], t = l->rlink, lr = t->llink; in kwsincr()
237 t->llink = l, l->rlink = lr; in kwsincr()
241 l = links[depth], r = l->rlink, t = r->llink; in kwsincr()
242 lr = t->llink, rl = t->rlink; in kwsincr()
243 t->llink = l, l->rlink = lr, t->rlink = r, r->llink = rl; in kwsincr()
259 links[depth - 1]->rlink = t; in kwsincr()
289 enqueue(tree->rlink, last); in enqueue()
306 treefails(tree->rlink, fail, recourse); in treefails()
317 link = link->rlink; in treefails()
339 treedelta(tree->rlink, depth, delta); in treedelta()
352 if (!hasevery(a, b->rlink)) in hasevery()
358 a = a->rlink; in hasevery()
370 treenext(tree->rlink, next); in treenext()
654 tree = tree->rlink; in cwexec()
705 tree = tree->rlink; in cwexec()