HomeSort by: relevance | last modified time | path
    Searched defs:shtree (Results 1 - 2 of 2) sorted by relevancy

  /src/bin/sh/
show.c 102 static void shtree(union node *, int, int, int, TFILE *);
274 shtree(n, 1, 1, 1, fp);
309 shtree(union node *n, int ind, int ilvl, int nl, TFILE *fp) function in typeref:typename:void
331 shtree(n->nbinary.ch1, 0, ilvl, 0, fp);
343 shtree(n->nbinary.ch2, 0, ilvl, nl, fp);
354 shtree(lp->n, 0, ilvl, 0, fp);
381 shtree(n->narg.next, (ind < 0 ? ilvl : ind) + 1, ilvl+1, 1, fp);
390 shtree(n->nnot.com, -1, ilvl, nl, fp);
393 shtree(n->nredir.n, -1, ilvl, 0, fp);
402 shtree(n->nif.test, -1, ilvl, 0, fp)
    [all...]
show.c 102 static void shtree(union node *, int, int, int, TFILE *);
274 shtree(n, 1, 1, 1, fp);
309 shtree(union node *n, int ind, int ilvl, int nl, TFILE *fp) function in typeref:typename:void
331 shtree(n->nbinary.ch1, 0, ilvl, 0, fp);
343 shtree(n->nbinary.ch2, 0, ilvl, nl, fp);
354 shtree(lp->n, 0, ilvl, 0, fp);
381 shtree(n->narg.next, (ind < 0 ? ilvl : ind) + 1, ilvl+1, 1, fp);
390 shtree(n->nnot.com, -1, ilvl, nl, fp);
393 shtree(n->nredir.n, -1, ilvl, 0, fp);
402 shtree(n->nif.test, -1, ilvl, 0, fp)
    [all...]

Completed in 26 milliseconds