texinfo/util/prepinfo.awk

126 	Node[Name ".level"] = levelnum
127 	Node[Name ".name"] = Name
129 		printf("Node[%s\".level\"] = %s\n", Name, Node[Name ".level"]) > "/dev/stderr"
130 		printf("Node[%s\".name\"] = %s\n", Name, Node[Name ".name"]) > "/dev/stderr"
134 		Node[Name ".up"] = Up[levelnum - 1]
136 			Node[Prev[levelnum] ".next"] = Name
137 			Node[Name ".prev"] = Prev[levelnum]
143 		Node[Name ".up"] = Up[levelnum - 1]
145 			Node[Name ".prev"] = Prev[levelnum]
146 			Node[Prev[levelnum] ".next"] = Name
151 		Node[Name ".up"] = Up[levelnum - 1]
152 		Node[Up[Lastlevel] ".child"] = Name
163 		printf("Node[%s\".prev\"] = %s\n", Name, Node[Name ".prev"]) > "/dev/stderr"
164 		printf("Node[%s\".up\"] = %s\n", Name, Node[Name ".up"]) > "/dev/stderr"
165 		printf("Node[%s\".child\"] = %s\n", Name, Node[Name ".child"]) > "/dev/stderr"
171 	for (i in Node)
172 		printf("Node[%s] = %s\n", i, Node[i]) | "sort 1>&2"
186 			Node[node ".mendesc"] = desc
187 			Node[node ".longdesc"] = longdesc
189 				printf("Node[%s.mendesc] = %s\n",
190 					node, Node[node ".mendesc"]) > "/dev/stderr"
191 				printf("Node[%s.longdesc] = %s\n",
192 					node, Node[node ".longdesc"]) > "/dev/stderr"
229 	Node[node ".mendesc"] = desc
230 	Node[node ".longdesc"] = longdesc
232 		printf("Node[%s.mendesc] = %s\n",
233 			node, Node[node ".mendesc"]) > "/dev/stderr"
234 		printf("Node[%s.longdesc] = %s\n",
235 			node, Node[node ".longdesc"]) > "/dev/stderr"
262 	n = Node[Name ".next"]
263 	if (Node[Name ".level"] == 0 && n == "")
264 		n = Node[Name ".child"]
267 		Node[Name ".prev"] ? Node[Name ".prev"] : Node[Name ".up"],
268 		Node[Name ".up"])
285 	for (n = Node[Name ".child"]; (n ".next") in Node; n = Node[n ".next"]) {
286 		if ((n ".desc") in Node)
287 			s = Node[n ".desc"] ": " n "."
300 	for (n = Node[Name ".child"]; (n ".next") in Node; n = Node[n ".next"]) {
323 	if (! ((n ".longdesc") in Node)) {
330 		count = split(Node[n ".longdesc"], dwords, "[ \t\n]+")
332 	if ((n ".desc") in Node)
333 		s = Node[n ".desc"] ": " n "."