Lines Matching refs:list
32 ** are kept in a linked list which is managed by a move-to-front
85 Suftree *list;
87 if(!(list = (Suftree*)malloc((n+1)*sizeof(Suftree))))
94 /* store where this list is for later deletion */
95 NEXT(list) = 0;
100 NEXT(root) = list;
103 return list+1;
125 Suftree *root, *list, *endlist;
137 if(!(list = getmem(root,n)))
139 endlist = list + n;
142 root = list++;
207 if(list >= endlist)
209 if(!(list = getmem(root,ALLOCSIZE)))
211 else endlist = list+ALLOCSIZE;
215 LABEL(list) = rescan;
216 LENGTH(list) = relen;
217 CHILD(list) = match;
218 SIBLING(list) = SIBLING(match);
219 LINK(list) = root;
226 CHILD(link) = list;
227 link = list++;
264 if(list >= endlist)
266 if(!(list = getmem(root,ALLOCSIZE)))
268 else endlist = list+ALLOCSIZE;
272 LABEL(list) = LABEL(match);
273 LENGTH(list) = mp - LABEL(match);
274 CHILD(list) = match;
275 SIBLING(list) = SIBLING(match);
276 LINK(list) = root;
279 LABEL(match) += LENGTH(list);
280 LENGTH(match) -= LENGTH(list);
281 mtlen += LENGTH(list);
284 CHILD(locus) = list;
285 locus = list++;
290 if(list >= endlist)
292 if(!(list = getmem(root,ALLOCSIZE)))
294 else endlist = list+ALLOCSIZE;
298 SUFFIX(list) = src;
299 LABEL(list) = sp;
300 LENGTH(list) = endsrc-sp;
301 CHILD(list) = 0;
304 SIBLING(list) = CHILD(locus);
305 CHILD(locus) = list++;