Lines Matching refs:sep
179 * $(<var>[|<var>][:[<pfx>]<op>[<sep><val>]])
183 * $(<var>[|<var>]`[<del>[<pfx>]<op>[<sep><val>]]<del>)
193 * :<op><sep><value>:
213 * $(s:O<sep><n>) select components <|<=|==|!=|>=|> <n> starting at 1
327 * (sep & NOT) for file equality
331 uniq(Sfio_t* xp, char* v, char* w, int sep)
340 if (sep & NOT)
351 sep = 0;
361 if (sep)
364 sep = 1;
375 sep = 0;
381 if (sep)
384 sep = 1;
495 int sep;
504 sep = 0;
510 if (sep) sfputc(xp, ' ');
511 else sep = 1;
524 if (sep) sfputc(xp, ' ');
525 else sep = 1;
548 * sep!=EQ for literal intersection
552 intersect(Sfio_t* xp, char* v, char* w, int sep)
573 if (sep == EQ)
602 if (sep == EQ)
652 int sep;
661 sep = 0;
670 if (sep) sfputc(xp, ' ');
671 else sep = 1;
1034 sepcmp(int sep, unsigned long a, unsigned long b)
1036 switch (sep)
1053 error(PANIC, "invalid separator operator %d", sep);
1064 septimecmp(int sep, Time_t a, Time_t b)
1066 switch (sep)
1083 error(PANIC, "invalid separator operator %d", sep);
1687 pathop(Sfio_t* xp, register char* s, char* op, int sep)
1776 sep = 0;
1807 sep = 1;
1818 if (sep)
1840 if (sep)
1864 sep = 0;
1886 sep = 0;
1889 if (sep)
1892 sep = 1;
1931 else if ((!stat(s, &st) && !stat(op, &st1) && st.st_dev == st1.st_dev && st.st_ino == st1.st_ino) == (sep == EQ))
1947 sep = 0;
1962 if (sep)
1965 sep = 1;
2027 if (sep)
2030 sep = 1;
2037 if (*op == 'A' && !sep)
2050 if (sepcmp(sep, (unsigned long)((r->dynamic & D_global) ? state.maxview : r->view), (unsigned long)n))
2108 if (c == !(sep & NOT))
2172 if ((*(op + 1) == 'P' ? !lstat(s, &st) : !stat(s, &st)) == (sep == EQ))
2331 token(Sfio_t* xp, char* s, register char* p, int sep)
2380 if ((*s == 0) == ((op == 'V') == !(sep & NOT)))
2441 if (tst == !(sep & NOT))
2572 if (tst != 'F' || ((sep & GT) ? pathstat(r->name, &st) : lstat(r->name, &st)))
2691 sep = '\n';
2705 sep = -1;
2721 sfputr(sp, ops, sep);
2726 if (sep != -1) sfputc(tmp, sep);
2727 sep = sfstrtell(tmp);
2728 sfwrite(sp, sfstrbase(tmp), sep);
2808 if (septimecmp(sep, r->time, tm))
2863 if (matched == !(sep & NOT))
2892 * sep placed between names
2896 parentage(Sfio_t* xp, register Rule_t* r, char* sep)
2901 parentage(xp, r->active->parent->target, sep);
2903 sfputr(xp, sep, -1);
2915 attribute(Sfio_t* xp, char* s, register char* att, int sep)
2940 if (r || (x || (sep & LT)) && (r = makerule(s)))
2950 if (sep & GT)
2964 if (sep & LT)
2978 if (sep == EQ)
2991 if (sep & NOT)
3019 else if (att && (sep & NOT))
3031 * (sep<) lists the primary and secondary targets for name
3035 generate(Sfio_t* xp, char* name, char* pat, int sep)
3047 if (!(sep & NOT))
3058 if (!(sep & NOT))
3066 if (!(sep & NOT))
3083 if (!(sep & NOT))
3103 generate(xp, sfstruse(tp), pat, sep);
3106 if ((state.questionable & 0x00040000) && !(sep & LT))
3125 generate(xp, sfstruse(tp), pat, sep);
3151 generate(tp, name, q->rule->name, sep);
3159 generate(xp, sfstruse(tp), pat, sep);
3178 if (!(sep & NOT))
3183 if (sep & NOT) sfputr(xp, name, -1);
3337 register int sep;
3341 sep = 0;
3349 if (sep) sfputc(xp, ' ');
3350 else sep = 1;
3391 int sep;
3656 sep = 0;
3771 sep |= EQ;
3776 if (!sep)
3778 sep |= EQ;
3783 if (sep & MAT)
3785 sep |= MAT;
3788 if (sep & HAT)
3790 sep |= HAT;
3793 if (sep & NOT)
3795 sep |= NOT;
3798 if (sep & LT)
3800 sep |= LT;
3803 if (sep & GT)
3805 sep |= GT;
3810 if (!sep)
3984 if (!sep)
3985 sep = EQ;
3991 intersect(xp, x, val, sep);
4001 if (sep & GT)
4003 if (sep & LT)
4005 if (sep & EQ)
4007 if (sep & NOT)
4009 if (sep & MAT)
4011 if (sep & HAT)
4053 uniq(xp, x, val, sep);
4090 if (sep & GT)
4092 if (sep & EQ)
4094 if (sep & NOT)
4096 if (sep & MAT)
4221 attribute(xp, s, val, sep);
4266 generate(xp, s, v, sep);
4270 generate(xp, s, val, sep);
4276 else if ((n == 0) == (sep == EQ))
4283 switch (sep)
4328 pathop(xp, s, val, sep);
4334 token(xp, s, val, sep);