Lines Matching refs:u

105 		out(flags|O_NONL, "%s", np->u.name.s);
107 if (np->u.name.cp != NULL) {
109 cp2num(np->u.name.cp, &num);
111 } else if (np->u.name.it == IT_HORIZONTAL) {
112 if (np->u.name.child == NULL ||
113 (np->u.name.childgen && !Pchildgen))
117 ptree(flags, np->u.name.child,
121 } else if (np->u.name.child &&
122 (!np->u.name.childgen || Pchildgen)) {
123 if (np->u.name.it != IT_NONE)
125 ptree(flags, np->u.name.child, no_iterators,
127 if (np->u.name.it != IT_NONE)
131 if (np->u.name.next) {
132 ASSERT(np->u.name.next->t == T_NAME);
133 if (np->u.name.it == IT_ENAME)
137 ptree(flags, np->u.name.next, no_iterators, fileline);
141 ptree_timeval(flags, &np->u.ull);
144 out(flags|O_NONL, "%llu", np->u.ull);
147 out(flags|O_NONL, "\"%s\"", np->u.quote.s);
150 out(flags|O_NONL, "$%s", np->u.globid.s);
153 out(flags|O_NONL, "%s(", np->u.func.s);
154 ptree(flags, np->u.func.arglist, no_iterators, fileline);
158 ptree(flags, np->u.expr.left, no_iterators, fileline);
160 ptree(flags, np->u.expr.right, no_iterators, fileline);
163 ptree(flags, np->u.event.ename, no_iterators, fileline);
164 if (np->u.event.epname) {
166 ptree(flags, np->u.event.epname,
169 if (np->u.event.eexprlist) {
171 ptree(flags, np->u.event.eexprlist,
178 ptree(flags, np->u.expr.left, no_iterators, fileline);
180 ptree(flags, np->u.expr.right, no_iterators, fileline);
186 ptree(flags, np->u.expr.left, no_iterators, fileline);
191 ptree(flags, np->u.expr.left, no_iterators, fileline);
193 ptree(flags, np->u.expr.right, no_iterators, fileline);
198 ptree(flags, np->u.expr.left, no_iterators, fileline);
200 ptree(flags, np->u.expr.right, no_iterators, fileline);
205 ptree(flags, np->u.expr.left, no_iterators, fileline);
207 ptree(flags, np->u.expr.right, no_iterators, fileline);
212 ptree(flags, np->u.expr.left, no_iterators, fileline);
214 ptree(flags, np->u.expr.right, no_iterators, fileline);
219 ptree(flags, np->u.expr.left, no_iterators, fileline);
221 ptree(flags, np->u.expr.right, no_iterators, fileline);
226 ptree(flags, np->u.expr.left, no_iterators, fileline);
228 ptree(flags, np->u.expr.right, no_iterators, fileline);
233 ptree(flags, np->u.expr.left, no_iterators, fileline);
235 ptree(flags, np->u.expr.right, no_iterators, fileline);
240 ptree(flags, np->u.expr.left, no_iterators, fileline);
242 ptree(flags, np->u.expr.right, no_iterators, fileline);
247 ptree(flags, np->u.expr.left, no_iterators, fileline);
249 ptree(flags, np->u.expr.right, no_iterators, fileline);
254 ptree(flags, np->u.expr.left, no_iterators, fileline);
256 ptree(flags, np->u.expr.right, no_iterators, fileline);
261 ptree(flags, np->u.expr.left, no_iterators, fileline);
263 ptree(flags, np->u.expr.right, no_iterators, fileline);
268 ptree(flags, np->u.expr.left, no_iterators, fileline);
270 ptree(flags, np->u.expr.right, no_iterators, fileline);
275 ptree(flags, np->u.expr.left, no_iterators, fileline);
277 ptree(flags, np->u.expr.right, no_iterators, fileline);
283 ptree(flags, np->u.expr.left, no_iterators, fileline);
288 ptree(flags, np->u.expr.left, no_iterators, fileline);
290 ptree(flags, np->u.expr.right, no_iterators, fileline);
295 ptree(flags, np->u.expr.left, no_iterators, fileline);
297 ptree(flags, np->u.expr.right, no_iterators, fileline);
302 ptree(flags, np->u.expr.left, no_iterators, fileline);
304 ptree(flags, np->u.expr.right, no_iterators, fileline);
309 ptree(flags, np->u.expr.left, no_iterators, fileline);
311 ptree(flags, np->u.expr.right, no_iterators, fileline);
316 ptree(flags, np->u.expr.left, no_iterators, fileline);
318 ptree(flags, np->u.expr.right, no_iterators, fileline);
323 ptree(flags, np->u.expr.left, no_iterators, fileline);
325 ptree(flags, np->u.expr.right, no_iterators, fileline);
330 ptree(flags, np->u.expr.left, no_iterators, fileline);
332 ptree(flags, np->u.expr.right, no_iterators, fileline);
336 ptree(flags, np->u.arrow.lhs, no_iterators, fileline);
337 if (np->u.arrow.nnp) {
339 ptree(flags, np->u.arrow.nnp, no_iterators, fileline);
343 if (np->u.arrow.knp) {
345 ptree(flags, np->u.arrow.knp, no_iterators, fileline);
348 ptree(flags, np->u.arrow.rhs, no_iterators, fileline);
351 ptree(flags, np->u.expr.left, no_iterators, fileline);
352 if (np->u.expr.left && np->u.expr.right &&
353 (np->u.expr.left->t != T_LIST ||
354 ! is_stmt(np->u.expr.right)))
356 ptree(flags, np->u.expr.right, no_iterators, fileline);
366 ptree(flags, np->u.stmt.np, no_iterators, fileline);
367 if (np->u.stmt.nvpairs) {
369 ptree(flags, np->u.stmt.nvpairs, no_iterators,
379 ptree(flags, np->u.stmt.np, no_iterators, fileline);
380 if (np->u.stmt.nvpairs) {
382 ptree(flags, np->u.stmt.nvpairs, no_iterators,
384 } else if (np->u.stmt.lutp) {
390 lut_walk(np->u.stmt.lutp, ptree_plut, &pd);
398 ptree(flags, np->u.stmt.np, no_iterators, fileline);
399 if (np->u.stmt.nvpairs) {
401 ptree(flags, np->u.stmt.nvpairs, no_iterators,
410 ptree(flags, np->u.stmt.np, no_iterators, fileline);
411 if (np->u.stmt.nvpairs) {
413 ptree(flags, np->u.stmt.nvpairs, no_iterators,
422 ptree(flags, np->u.stmt.np, no_iterators, fileline);
423 if (np->u.stmt.nvpairs) {
425 ptree(flags, np->u.stmt.nvpairs, no_iterators,
434 ptree(flags, np->u.stmt.np, no_iterators, fileline);
441 ptree(flags, np->u.stmt.np, no_iterators, fileline);
592 const char *s = np->u.name.s;
604 name_pattern_match(np->u.name.next,
612 np = np->u.name.next;
629 return (name_pattern_match_in_subtree(np->u.event.ename, pat) ||
630 name_pattern_match_in_subtree(np->u.event.epname, pat) ||
631 name_pattern_match_in_subtree(np->u.event.eexprlist, pat));
633 return (name_pattern_match_in_subtree(np->u.arrow.lhs, pat) ||
634 name_pattern_match_in_subtree(np->u.arrow.rhs, pat));
659 return (name_pattern_match_in_subtree(np->u.expr.left, pat) ||
660 name_pattern_match_in_subtree(np->u.expr.right, pat));
662 return (name_pattern_match_in_subtree(np->u.func.arglist, pat));
721 for (np = Props; np; np = np->u.stmt.next)
722 if (name_pattern_match_in_subtree(np->u.stmt.np, pat))
726 for (np = Masks; np; np = np->u.stmt.next)
727 if (name_pattern_match_in_subtree(np->u.stmt.np, pat))