texinfo/info/nodes.c

52 /* Magic number that RMS used to decide how much a tags table pointer could
57    neccessary to fill in the nodes or tags arrays in FILE_BUFFER. */
178   /* If this is the "main" info file, it might contain a tags table.  Search
179      the tags table for an entry which matches the node that we want.  If
180      there is a tags table, get the file which contains this node, but don't
182   else if (file_buffer->tags)
215    try to build a tags table (or otherwise glean the nodes) for this
216    file once found.  By default, we build the tags table, but when this
218    tags table describing the nodes, it is unnecessary. */
282                 if (get_tags && !file_buffer->tags)
308    says to build a list of tags (or nodes) for this file.  This is the
310    necessary when loading a subfile for which we already have tags. */
379   /* If requested, build the tags and nodes for this file buffer. */
387 /* Grovel FILE_BUFFER->contents finding tags and nodes, and filling in the
398   /* See if there is a tags table in this info file. */
423            tags table.  Grovel the file. */
427         /* Remember the end of the tags table. */
432         /* Locate the start of the tags table. */
445         /* The file contains a valid tags table.  Fill the FILE_BUFFER's
446            tags member. */
450         /* If this isn't an indirect tags table, just remember the nodes
451            described locally in this tags table.  Note that binding.end
465             /* This is an indirect tags table.  Build TAGS member. */
490   /* This file doesn't contain any kind of tags table.  Grovel the
496    one entry per each node present in the file.  Store the tags in
497    FILE_BUFFER->tags, and the number of allocated slots in
569       add_pointer_to_array (entry, tags_index, file_buffer->tags,
591    contents of BUFFER_BINDING for a tags table, and groveling the contents. */
603   /* Find the start of the tags table. */
630       /* Skip past informative "(Indirect)" tags table line. */
648          tags table.  */
681       add_pointer_to_array (entry, tags_index, file_buffer->tags,
706   /* First get the list of tags from the tags table.  Then lookup the
710   /* We have the list of tags in file_buffer->tags.  Get the list of
756          tags table.  This header appears at the start of every file.  We
809       /* For each node in the file's tags table, remember the starting
811       for (tags_index = 0; (entry = file_buffer->tags[tags_index]);
818           /* If the Info file containing the indirect tags table is
822               /* The Info file containing the indirect tags table is
845       /* We have successfully built the tags table.  Remember that it
871   for (anchor_pos = 0; file_buffer->tags[anchor_pos]; anchor_pos++)
873       TAG *t = file_buffer->tags[anchor_pos];
879   if (!file_buffer->tags[anchor_pos])
883      preceding node (we're assuming the tags are given in order),
886        node_pos >= 0 && file_buffer->tags[node_pos]->nodelen == 0;
896   node_tag = file_buffer->tags[node_pos];
913       node->display_pos = file_buffer->tags[anchor_pos]->nodestart
931    the tags table in FILE_BUFFER, or NULL.  */
938   /* If no tags at all (possibly a misformatted info file), quit.  */
939   if (!file_buffer->tags) {
943   for (i = 0; (tag = file_buffer->tags[i]); i++)
1054 /* Managing file_buffers, nodes, and tags.  */
1064   file_buffer->tags = NULL;
1085 /* Forget the contents, tags table, nodes list, and names of FILENAME. */
1106            the subfiles list is only of use in conjunction with tags. */
1121 /* Free the tags (if any) associated with FILE_BUFFER. */
1127   if (file_buffer->tags)
1131       for (i = 0; (tag = file_buffer->tags[i]); i++)
1134       free (file_buffer->tags);
1135       file_buffer->tags = NULL;
1165    the file was already loaded at least once successfully, so the tags and/or
1190    Because of the way that tags are implemented, the physical nodestart may
1261   /* Otherwise, the node was found, but the tags table could need updating