Lines Matching refs:np

68 is_stmt(struct node *np)  in is_stmt()  argument
70 switch (np->t) { in is_stmt()
94 ptree(int flags, struct node *np, int no_iterators, int fileline) in ptree() argument
96 if (np == NULL) in ptree()
99 switch (np->t) { in ptree()
103 out(flags|O_NONL, "%s", np->u.name.s); in ptree()
105 if (np->u.name.cp != NULL) { in ptree()
107 cp2num(np->u.name.cp, &num); in ptree()
109 } else if (np->u.name.it == IT_HORIZONTAL) { in ptree()
110 if (np->u.name.child == NULL || in ptree()
111 (np->u.name.childgen && !Pchildgen)) in ptree()
115 ptree(flags, np->u.name.child, in ptree()
119 } else if (np->u.name.child && in ptree()
120 (!np->u.name.childgen || Pchildgen)) { in ptree()
121 if (np->u.name.it != IT_NONE) in ptree()
123 ptree(flags, np->u.name.child, no_iterators, in ptree()
125 if (np->u.name.it != IT_NONE) in ptree()
129 if (np->u.name.next) { in ptree()
130 ASSERT(np->u.name.next->t == T_NAME); in ptree()
131 if (np->u.name.it == IT_ENAME) in ptree()
135 ptree(flags, np->u.name.next, no_iterators, fileline); in ptree()
139 ptree_timeval(flags, &np->u.ull); in ptree()
142 out(flags|O_NONL, "%llu", np->u.ull); in ptree()
145 out(flags|O_NONL, "\"%s\"", np->u.quote.s); in ptree()
148 out(flags|O_NONL, "$%s", np->u.globid.s); in ptree()
151 out(flags|O_NONL, "%s(", np->u.func.s); in ptree()
152 ptree(flags, np->u.func.arglist, no_iterators, fileline); in ptree()
156 ptree(flags, np->u.expr.left, no_iterators, fileline); in ptree()
158 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
161 ptree(flags, np->u.event.ename, no_iterators, fileline); in ptree()
162 if (np->u.event.epname) { in ptree()
164 ptree(flags, np->u.event.epname, in ptree()
167 if (np->u.event.eexprlist) { in ptree()
169 ptree(flags, np->u.event.eexprlist, in ptree()
176 ptree(flags, np->u.expr.left, no_iterators, fileline); in ptree()
178 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
184 ptree(flags, np->u.expr.left, no_iterators, fileline); in ptree()
189 ptree(flags, np->u.expr.left, no_iterators, fileline); in ptree()
191 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
196 ptree(flags, np->u.expr.left, no_iterators, fileline); in ptree()
198 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
203 ptree(flags, np->u.expr.left, no_iterators, fileline); in ptree()
205 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
210 ptree(flags, np->u.expr.left, no_iterators, fileline); in ptree()
212 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
217 ptree(flags, np->u.expr.left, no_iterators, fileline); in ptree()
219 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
224 ptree(flags, np->u.expr.left, no_iterators, fileline); in ptree()
226 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
231 ptree(flags, np->u.expr.left, no_iterators, fileline); in ptree()
233 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
238 ptree(flags, np->u.expr.left, no_iterators, fileline); in ptree()
240 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
245 ptree(flags, np->u.expr.left, no_iterators, fileline); in ptree()
247 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
252 ptree(flags, np->u.expr.left, no_iterators, fileline); in ptree()
254 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
259 ptree(flags, np->u.expr.left, no_iterators, fileline); in ptree()
261 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
266 ptree(flags, np->u.expr.left, no_iterators, fileline); in ptree()
268 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
273 ptree(flags, np->u.expr.left, no_iterators, fileline); in ptree()
275 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
281 ptree(flags, np->u.expr.left, no_iterators, fileline); in ptree()
286 ptree(flags, np->u.expr.left, no_iterators, fileline); in ptree()
288 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
293 ptree(flags, np->u.expr.left, no_iterators, fileline); in ptree()
295 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
300 ptree(flags, np->u.expr.left, no_iterators, fileline); in ptree()
302 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
307 ptree(flags, np->u.expr.left, no_iterators, fileline); in ptree()
309 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
314 ptree(flags, np->u.expr.left, no_iterators, fileline); in ptree()
316 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
321 ptree(flags, np->u.expr.left, no_iterators, fileline); in ptree()
323 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
328 ptree(flags, np->u.expr.left, no_iterators, fileline); in ptree()
330 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
334 ptree(flags, np->u.arrow.lhs, no_iterators, fileline); in ptree()
335 if (np->u.arrow.nnp) { in ptree()
337 ptree(flags, np->u.arrow.nnp, no_iterators, fileline); in ptree()
341 if (np->u.arrow.knp) { in ptree()
343 ptree(flags, np->u.arrow.knp, no_iterators, fileline); in ptree()
346 ptree(flags, np->u.arrow.rhs, no_iterators, fileline); in ptree()
349 ptree(flags, np->u.expr.left, no_iterators, fileline); in ptree()
350 if (np->u.expr.left && np->u.expr.right && in ptree()
351 (np->u.expr.left->t != T_LIST || in ptree()
352 ! is_stmt(np->u.expr.right))) in ptree()
354 ptree(flags, np->u.expr.right, no_iterators, fileline); in ptree()
362 out(flags, "# %d \"%s\"", np->line, np->file); in ptree()
364 ptree(flags, np->u.stmt.np, no_iterators, fileline); in ptree()
365 if (np->u.stmt.nvpairs) { in ptree()
367 ptree(flags, np->u.stmt.nvpairs, no_iterators, in ptree()
375 out(flags, "# %d \"%s\"", np->line, np->file); in ptree()
377 ptree(flags, np->u.stmt.np, no_iterators, fileline); in ptree()
378 if (np->u.stmt.nvpairs) { in ptree()
380 ptree(flags, np->u.stmt.nvpairs, no_iterators, in ptree()
382 } else if (np->u.stmt.lutp) { in ptree()
388 lut_walk(np->u.stmt.lutp, ptree_plut, &pd); in ptree()
394 out(flags, "# %d \"%s\"", np->line, np->file); in ptree()
396 ptree(flags, np->u.stmt.np, no_iterators, fileline); in ptree()
397 if (np->u.stmt.nvpairs) { in ptree()
399 ptree(flags, np->u.stmt.nvpairs, no_iterators, in ptree()
406 out(flags, "# %d \"%s\"", np->line, np->file); in ptree()
408 ptree(flags, np->u.stmt.np, no_iterators, fileline); in ptree()
409 if (np->u.stmt.nvpairs) { in ptree()
411 ptree(flags, np->u.stmt.nvpairs, no_iterators, in ptree()
418 out(flags, "# %d \"%s\"", np->line, np->file); in ptree()
420 ptree(flags, np->u.stmt.np, no_iterators, fileline); in ptree()
421 if (np->u.stmt.nvpairs) { in ptree()
423 ptree(flags, np->u.stmt.nvpairs, no_iterators, in ptree()
430 out(flags, "# %d \"%s\"", np->line, np->file); in ptree()
432 ptree(flags, np->u.stmt.np, no_iterators, fileline); in ptree()
437 out(flags, "# %d \"%s\"", np->line, np->file); in ptree()
439 ptree(flags, np->u.stmt.np, no_iterators, fileline); in ptree()
444 "internal error: ptree unexpected nodetype: %d", np->t); in ptree()
474 ptree_name(int flags, struct node *np) in ptree_name() argument
476 ptree(flags, np, 1, 0); in ptree_name()
480 ptree_name_iter(int flags, struct node *np) in ptree_name_iter() argument
482 ptree(flags, np, 0, 0); in ptree_name_iter()
571 name_pattern_match(struct node *np, const char *pat) in name_pattern_match() argument
578 if (np == NULL) in name_pattern_match()
581 ASSERTeq(np->t, T_NAME, ptree_nodetype2str); in name_pattern_match()
589 while (np) { in name_pattern_match()
590 const char *s = np->u.name.s; in name_pattern_match()
602 name_pattern_match(np->u.name.next, in name_pattern_match()
610 np = np->u.name.next; in name_pattern_match()
616 name_pattern_match_in_subtree(struct node *np, const char *pat) in name_pattern_match_in_subtree() argument
621 if (np == NULL) in name_pattern_match_in_subtree()
624 if (np->t == T_NAME) in name_pattern_match_in_subtree()
625 return (name_pattern_match(np, pat)); in name_pattern_match_in_subtree()
626 else if (np->t == T_EVENT) in name_pattern_match_in_subtree()
627 return (name_pattern_match_in_subtree(np->u.event.ename, pat) || in name_pattern_match_in_subtree()
628 name_pattern_match_in_subtree(np->u.event.epname, pat) || in name_pattern_match_in_subtree()
629 name_pattern_match_in_subtree(np->u.event.eexprlist, pat)); in name_pattern_match_in_subtree()
630 else if (np->t == T_ARROW) in name_pattern_match_in_subtree()
631 return (name_pattern_match_in_subtree(np->u.arrow.lhs, pat) || in name_pattern_match_in_subtree()
632 name_pattern_match_in_subtree(np->u.arrow.rhs, pat)); in name_pattern_match_in_subtree()
633 else if (np->t == T_ASSIGN || in name_pattern_match_in_subtree()
634 np->t == T_CONDIF || in name_pattern_match_in_subtree()
635 np->t == T_CONDELSE || in name_pattern_match_in_subtree()
636 np->t == T_NOT || in name_pattern_match_in_subtree()
637 np->t == T_AND || in name_pattern_match_in_subtree()
638 np->t == T_OR || in name_pattern_match_in_subtree()
639 np->t == T_EQ || in name_pattern_match_in_subtree()
640 np->t == T_NE || in name_pattern_match_in_subtree()
641 np->t == T_SUB || in name_pattern_match_in_subtree()
642 np->t == T_ADD || in name_pattern_match_in_subtree()
643 np->t == T_MUL || in name_pattern_match_in_subtree()
644 np->t == T_DIV || in name_pattern_match_in_subtree()
645 np->t == T_MOD || in name_pattern_match_in_subtree()
646 np->t == T_LT || in name_pattern_match_in_subtree()
647 np->t == T_LE || in name_pattern_match_in_subtree()
648 np->t == T_GT || in name_pattern_match_in_subtree()
649 np->t == T_GE || in name_pattern_match_in_subtree()
650 np->t == T_BITAND || in name_pattern_match_in_subtree()
651 np->t == T_BITOR || in name_pattern_match_in_subtree()
652 np->t == T_BITXOR || in name_pattern_match_in_subtree()
653 np->t == T_BITNOT || in name_pattern_match_in_subtree()
654 np->t == T_LSHIFT || in name_pattern_match_in_subtree()
655 np->t == T_RSHIFT || in name_pattern_match_in_subtree()
656 np->t == T_LIST) { in name_pattern_match_in_subtree()
657 return (name_pattern_match_in_subtree(np->u.expr.left, pat) || in name_pattern_match_in_subtree()
658 name_pattern_match_in_subtree(np->u.expr.right, pat)); in name_pattern_match_in_subtree()
659 } else if (np->t == T_FUNC) { in name_pattern_match_in_subtree()
660 return (name_pattern_match_in_subtree(np->u.func.arglist, pat)); in name_pattern_match_in_subtree()
681 struct node *np; in ptree_type_pattern() local
719 for (np = Props; np; np = np->u.stmt.next) in ptree_type_pattern()
720 if (name_pattern_match_in_subtree(np->u.stmt.np, pat)) in ptree_type_pattern()
721 ptree(flags, np, 0, 0); in ptree_type_pattern()
724 for (np = Masks; np; np = np->u.stmt.next) in ptree_type_pattern()
725 if (name_pattern_match_in_subtree(np->u.stmt.np, pat)) in ptree_type_pattern()
726 ptree(flags, np, 0, 0); in ptree_type_pattern()