GlhLineNode
GlhLineNode *node; /* The line being saved */
GlhLineNode *head; /* The head of the list of lines to be saved */
typedef struct GlhLineNode GlhLineNode;
GlhLineNode *next; /* The next youngest line in the list */
GlhLineNode *prev; /* The next oldest line in the list */
GlhLineNode *node; /* The line being displayed */
GlhLineNode *oldest; /* The oldest line to display */
GlhLineNode *head; /* The oldest line in the list */
GlhLineNode *tail; /* The newest line in the list */
GlhLineNode *recall; /* The last line recalled, or NULL if no recall */
GlhLineNode *node;
GlhLineNode *id_node;/* The node at which the last ID search terminated */
GlhLineNode *oldest = node->next; /* The oldest line to be kept */
GlhLineNode *node; /* The line node being checked */
GlhLineNode *next; /* The line node that follows 'node' */
static void _glh_discard_line(GlHistory *glh, GlhLineNode *node)
GlhLineNode *node; /* The located line location node */
static GlhLineNode *_glh_find_id(GlHistory *glh, GlhLineID id)
GlhLineNode *node; /* The node being checked */
static void _glh_discard_line(GlHistory *glh, GlhLineNode *node);
static GlhLineNode *_glh_find_id(GlHistory *glh, GlhLineID id);
glh->list.node_mem = _new_FreeList(sizeof(GlhLineNode), GLH_LINE_INCR);
glh->hash.node_mem = _new_FreeList(sizeof(GlhLineNode), GLH_HASH_INCR);
GlhLineNode *lnode; /* A node in the time-ordered list of lines */
lnode = (GlhLineNode *) _new_FreeListNode(glh->list.node_mem);
GlhLineNode *node; /* The line location node being checked */
GlhLineNode *node; /* The line location node being checked */
GlhLineNode *node; /* The line location node being checked */
GlhLineNode *node; /* The line location node being checked */
GlhLineNode *node; /* The line location node being checked */