Lines Matching refs:nodes
57 /* Array of structures describing for each window which nodes have been
71 /* Begin an info session finding the nodes specified by FILENAME and NODENAMES.
99 of remembered windows and nodes. Then tile the windows. */
350 (info_win->nodes[info_win->current] == window->node))
368 info_win->nodes = (NODE **)NULL;
381 the list of history nodes. This may happen only at the very
383 if (info_win->nodes
385 && info_win->nodes[info_win->current]->contents == node->contents
392 and points as well as nodes, it is more efficient to avoid the
397 info_win->nodes = (NODE **) xrealloc (info_win->nodes,
405 info_win->nodes[info_win->nodes_index] = node;
409 info_win->nodes[info_win->nodes_index] = NULL;
435 /* Remove WINDOW and its associated list of nodes from INFO_WINDOWS. */
458 if (info_win->nodes)
463 for (i = 0; info_win->nodes[i]; i++)
464 if (internal_info_node_p (info_win->nodes[i]))
465 free (info_win->nodes[i]);
466 free (info_win->nodes);
902 are no more nodes. */
980 free (info_win->nodes[info_win->nodes_index]);
981 info_win->nodes[info_win->nodes_index] = (NODE *)NULL;
984 window->node = info_win->nodes[old_current];
989 info_error ((char *) _("No more nodes within this document."),
1059 /* The nodes are the same. Inhibit moving to the last
1142 and the chosen behaviour is to scroll through nodes get the
1515 if (!internal_info_node_p (iw->nodes[j]))
1517 if (iw->nodes[j]->parent)
1518 filename = iw->nodes[j]->parent;
1520 filename = iw->nodes[j]->filename;
1522 node = info_get_node (filename, iw->nodes[j]->nodename);
1543 /* Delete WINDOW, forgetting the list of last visited nodes. If we are
1570 associated nodes. */
1901 info_error ((char *) _("This window has no additional nodes"), NULL, NULL);
1934 info_error ((char *) _("This window has no additional nodes"), NULL, NULL);
2391 /* Build a completion list of all of the known nodes. */
2612 char **nodes = xmalloc (len * sizeof (char *));
2614 nodes[len - 2] = str;
2622 nodes = xrealloc (nodes, len * sizeof (char *));
2623 nodes[len - 2] = str;
2627 nodes[len - 1] = NULL;
2629 return nodes;
2654 char **nodes = split_list_of_nodenames (line);
2673 node = info_follow_menus (dir_node, nodes, &errstr, &errarg1, &errarg2);
2675 free (nodes);
2771 /* Look for node names typical for usage nodes in this menu. */
2919 /* Read the name of a node to kill. The list of available nodes comes
2920 from the nodes appearing in the current window configuration. */
2977 if (strcmp (nodename, info_win->nodes[info_win->current]->nodename) == 0
2991 /* If there are no more nodes left anywhere to view, complain and exit. */
2999 this node from the list of nodes previously shown in this window. */
3001 info_win->nodes[i] = info_win->nodes[i + 1];
3009 /* If there aren't any nodes left in this window, steal one from the
3040 temp = stealer->nodes[which];
3062 temp = info_win->nodes[info_win->current];
3077 previous implementation, which did not account for nodes being
3141 /* Dump the nodes specified by FILENAME and NODENAMES to the file named
3143 the nodes which appear in the menu of each node dumped. */
3151 /* Get the stream to print the nodes to. Special case of an output
3152 filename of "-" means to dump the nodes to stdout. */
3178 /* A place to remember already dumped nodes. */
3190 If DUMP_SUBNODES is non-zero, recursively dump the nodes which appear
3262 the nodes which appear in the menu of each node dumped. */
3270 filename of "-" means to dump the nodes to stdout. */
3546 /* Search through subsequent nodes, wrapping around to the top
4178 no nodes in INFO_WINDOWS that reference this file buffer's contents.
4209 /* Check each INFO_WINDOW to see if it has any nodes which reference
4213 for (i = 0; iw->nodes && iw->nodes[i]; i++)
4215 if ((FILENAME_CMP (fb->fullpath, iw->nodes[i]->filename) == 0) ||
4216 (FILENAME_CMP (fb->filename, iw->nodes[i]->filename) == 0))