dist/info/nodes.c

54 /* Magic number that RMS used to decide how much a tags table pointer could
59    neccessary to fill in the nodes or tags arrays in FILE_BUFFER. */
180   /* If this is the "main" info file, it might contain a tags table.  Search
181      the tags table for an entry which matches the node that we want.  If
182      there is a tags table, get the file which contains this node, but don't
184   else if (file_buffer->tags)
217    try to build a tags table (or otherwise glean the nodes) for this
218    file once found.  By default, we build the tags table, but when this
220    tags table describing the nodes, it is unnecessary. */
284                 if (get_tags && !file_buffer->tags)
310    says to build a list of tags (or nodes) for this file.  This is the
312    necessary when loading a subfile for which we already have tags. */
381   /* If requested, build the tags and nodes for this file buffer. */
389 /* Grovel FILE_BUFFER->contents finding tags and nodes, and filling in the
400   /* See if there is a tags table in this info file. */
425            tags table.  Grovel the file. */
429         /* Remember the end of the tags table. */
434         /* Locate the start of the tags table. */
447         /* The file contains a valid tags table.  Fill the FILE_BUFFER's
448            tags member. */
452         /* If this isn't an indirect tags table, just remember the nodes
453            described locally in this tags table.  Note that binding.end
467             /* This is an indirect tags table.  Build TAGS member. */
492   /* This file doesn't contain any kind of tags table.  Grovel the
498    one entry per each node present in the file.  Store the tags in
499    FILE_BUFFER->tags, and the number of allocated slots in
571       add_pointer_to_array (entry, tags_index, file_buffer->tags,
593    contents of BUFFER_BINDING for a tags table, and groveling the contents. */
605   /* Find the start of the tags table. */
632       /* Skip past informative "(Indirect)" tags table line. */
650          tags table.  */
683       add_pointer_to_array (entry, tags_index, file_buffer->tags,
708   /* First get the list of tags from the tags table.  Then lookup the
712   /* We have the list of tags in file_buffer->tags.  Get the list of
758          tags table.  This header appears at the start of every file.  We
811       /* For each node in the file's tags table, remember the starting
813       for (tags_index = 0; (entry = file_buffer->tags[tags_index]);
820           /* If the Info file containing the indirect tags table is
824               /* The Info file containing the indirect tags table is
847       /* We have successfully built the tags table.  Remember that it
873   for (anchor_pos = 0; file_buffer->tags[anchor_pos]; anchor_pos++)
875       TAG *t = file_buffer->tags[anchor_pos];
881   if (!file_buffer->tags[anchor_pos])
885      preceding node (we're assuming the tags are given in order),
888        node_pos >= 0 && file_buffer->tags[node_pos]->nodelen == 0;
898   node_tag = file_buffer->tags[node_pos];
915       node->display_pos = file_buffer->tags[anchor_pos]->nodestart
933    the tags table in FILE_BUFFER, or NULL.  */
940   /* If no tags at all (possibly a misformatted info file), quit.  */
941   if (!file_buffer->tags) {
945   for (i = 0; (tag = file_buffer->tags[i]); i++)
1056 /* Managing file_buffers, nodes, and tags.  */
1066   file_buffer->tags = NULL;
1087 /* Forget the contents, tags table, nodes list, and names of FILENAME. */
1108            the subfiles list is only of use in conjunction with tags. */
1123 /* Free the tags (if any) associated with FILE_BUFFER. */
1129   if (file_buffer->tags)
1133       for (i = 0; (tag = file_buffer->tags[i]); i++)
1136       free (file_buffer->tags);
1137       file_buffer->tags = NULL;
1167    the file was already loaded at least once successfully, so the tags and/or
1192    Because of the way that tags are implemented, the physical nodestart may
1263   /* Otherwise, the node was found, but the tags table could need updating