Lines Matching refs:next
67 GlhLineSeg *next; /* The next sub-string of the history line */
69 /* substring of a line, as indicated by 'next' */
91 GlhHashNode *next; /* The next in the list of nodes within the */
137 GlhLineNode *next; /* The next youngest line in the list */
138 GlhLineNode *prev; /* The next oldest line in the list */
193 unsigned long seq; /* The next ID to assign to a line node */
220 GlhLineSeg *seg; /* The line segment that the next character will */
223 /* the next unread character. */
311 seg->next = seg + 1;
313 glh->unused[i].next = NULL;
503 glh->list.tail->next = lnode;
506 lnode->next = NULL;
517 * Recall the next oldest line that has the search prefix last recorded
604 * Recall the next newest line that has the search prefix last recorded
649 node = glh->recall->next;
660 node = node->next;
670 * Record the starting point of the next search.
827 node = node->next)
929 for(node=glh->recall; node && offset != 0; node=node->next) {
1053 for(node=head; node; node=node->next) {
1065 for(seg=node->line->head; seg; seg=seg->next) {
1066 size_t slen = seg->next ? GLH_SEG_SIZE : strlen(seg->s);
1213 * The next word must be a timestamp.
1225 * The next word must be an unsigned integer group number.
1303 * endp char ** On output *endp will point to the next unprocessed
1495 for(node=glh->list.head; node; node=node->next) {
1526 for(node=oldest; node; node=node->next) {
1545 * Search for the start of the next format directive or the end of the string.
1593 for(seg=node->line->head; seg; seg=seg->next) {
1594 len = seg->next ? GLH_SEG_SIZE : strlen(seg->s);
1670 seg->next = seg + 1;
1672 glh->unused[i].next = NULL;
1712 for(hnode=b->lines; hnode; hnode=hnode->next) {
1715 for( ; seg; seg=seg->next) {
1717 buffer[nbusy].next = seg->next ? &buffer[nbusy+1] : NULL;
1726 buffer[i].next = &buffer[i+1];
1728 buffer[i].next = NULL;
1777 GlhLineNode *oldest = node->next; /* The oldest line to be kept */
1839 seg->next = seg + 1;
1841 glh->unused[i].next = NULL;
1853 GlhLineNode *next; /* The line node that follows 'node' */
1857 for(node=glh->list.head; node; node=next) {
1862 next = node->next;
1902 node->prev->next = node->next;
1904 glh->list.head = node->next;
1905 if(node->next)
1906 node->next->prev = node->prev;
1917 * next prefix search, cancel the search.
1945 * be invalidated by the next call to any public
2042 node = node->next;
2211 for(i=0,seg=glh->unused; i<nseg-1; i++,seg=seg->next, offset+=GLH_SEG_SIZE)
2226 glh->unused = seg->next;
2227 seg->next = NULL;
2233 hnode->next = bucket->lines;
2277 bucket->lines = hnode->next;
2280 for(prev=bucket->lines; prev && prev->next != hnode; prev=prev->next)
2283 prev->next = hnode->next;
2285 hnode->next = NULL;
2296 for(nseg=1,tail=hnode->head; tail->next; nseg++,tail=tail->next)
2302 tail->next = glh->unused;
2362 for(node=bucket->lines; node; node=node->next) {
2396 for(seg=hash->head; n>0 && seg; seg=seg->next) {
2471 for(seg=hash->head; dim>0 && seg; seg=seg->next) {
2563 * Copy the next unread character in the line being iterated, in str->c.
2578 * to the position of the next character in the line.
2582 str->seg = str->seg->next;
2647 * Handle the next character of the pattern.