Lines Matching refs:rlink
64 struct tree *rlink; /* Right link (to larger labels). */ member
206 dirs[depth++] = R, cur = cur->rlink; in kwsincr()
216 cur->rlink = NULL; in kwsincr()
232 links[depth]->rlink = cur; in kwsincr()
256 r = links[depth], t = r->llink, rl = t->rlink; in kwsincr()
257 t->rlink = r, r->llink = rl; in kwsincr()
261 r = links[depth], l = r->llink, t = l->rlink; in kwsincr()
262 rl = t->rlink, lr = t->llink; in kwsincr()
263 t->llink = l, l->rlink = lr, t->rlink = r, r->llink = rl; in kwsincr()
276 l = links[depth], t = l->rlink, lr = t->llink; in kwsincr()
277 t->llink = l, l->rlink = lr; in kwsincr()
281 l = links[depth], r = l->rlink, t = r->llink; in kwsincr()
282 lr = t->llink, rl = t->rlink; in kwsincr()
283 t->llink = l, l->rlink = lr, t->rlink = r, r->llink = rl; in kwsincr()
299 links[depth - 1]->rlink = t; in kwsincr()
336 enqueue (tree->rlink, last); in enqueue()
353 treefails (tree->rlink, fail, recourse, reverse); in treefails()
364 cur = cur->rlink; in treefails()
386 treedelta (tree->rlink, depth, delta); in treedelta()
399 if (!hasevery (a, b->rlink)) in hasevery()
405 a = a->rlink; in hasevery()
417 treenext (tree->rlink, next); in treenext()
824 tree = c < tree->label ? tree->llink : tree->rlink; in acexec_trans()
871 tree = c < tree->label ? tree->llink : tree->rlink; in acexec_trans()