Searched refs:rule (Results 1 - 25 of 35) sorted by relevance

12

/ast/src/cmd/mam/
H A Dmamold.sh43 typeset rule list order target variable
57 make|prev) rule=${target[level]}
59 implicit[$rule]="${implicit[$rule]} $arg" ||
60 prereqs[$rule]="${prereqs[$rule]} $arg"
74 for rule in $order
75 do [[ ! ${prereqs[$rule]} && ! ${action[$rule]} ]] && continue
77 closure ${prereqs[$rule]}
[all...]
H A Dmamdot.sh80 rule=$arg
83 [[ $op == make ]] && print "\"$arg\" [ label = \"$rule\" ]"
86 make) [[ $rule == $ignore ]] || list[level]=${list[level]}$'\n'\"$arg\"
90 prev) [[ $rule == $ignore ]] || list[level]=${list[level]}$'\n'\"$arg\"
92 done) [[ $rule == $ignore || ! ${list[level]} ]] ||
H A Dmamold.c83 clrprereqs(register struct rule* r)
89 if (p->rule->attributes & A_listprereq)
90 clrprereqs(p->rule);
92 if (p->rule->attributes & A_listprereq)
93 clrprereqs(p->rule);
284 dumpprereqs(register int col, register struct rule* r)
297 col = dumpprereqs(col, p->rule);
307 dump(register struct rule* r)
323 if (!(p->rule->attributes & A_listprereq))
325 clrprereqs(p->rule);
[all...]
H A Dmamnew.c64 #define MAXNAME 1024 /* max rule name */
78 struct local /* local rule info */
81 struct rule* directory; /* directory prefix */
94 struct rule* source; /* .SOURCE */
95 struct rule* source_a; /* .SOURCE.a */
96 struct rule* source_h; /* .SOURCE.h */
97 struct rule* sources; /* .MAM.SOURCES. */
130 static struct rule*
133 register struct rule* d;
135 struct rule*
[all...]
H A Dmamtst.c36 dumprule(register struct rule* r)
50 dumprule(p->rule);
/ast/src/lib/libmam/
H A Dmamlib.h35 struct rule* rule; /* rule for this frame */ member in struct:frame
38 #define _MAM_RULE_PRIVATE /* rule private */ \
H A Dmam.h34 #define getrule(p,n) (struct rule*)hashget((p)->rules,(n))
49 struct rule /* rule info */ struct
51 char* name; /* rule name */
91 struct rule* rule; /* this prereq */ member in struct:list
103 struct rule* root; /* root target */
109 Hash_table_t* rules; /* rule hash */
141 extern struct rule* mamrule(struct proc*, const char*);
143 extern void mamprereq(struct proc*, struct rule*, struc
[all...]
H A Dmam.c38 * free a rule
42 freerule(register struct rule* r)
79 pp->fp->rule = pp->root = mamrule(pp, "");
128 * check for rule alias
132 static struct rule*
137 if (*name != '/' || *pp->fp->rule->name == '/' || !pp->pwd) return(0);
138 sfsprintf(buf, sizeof(buf), "%s/%s", pp->pwd, pp->fp->rule->name);
141 putrule(pp, name, pp->fp->rule);
142 return(pp->fp->rule);
151 attributes(struct proc* pp, struct rule*
[all...]
/ast/src/cmd/nmake/
H A Dmetarule.c34 * force causes the rule to be created
63 sfprintf(internal.met, "%s>%s", in, r->prereqs->rule->name);
274 if (metamatch(stem, out->name, q->rule->name) && (x = metainfo('O', q->rule->name, NiL, 0)))
278 metaexpand(internal.met, stem, p->rule->name);
293 s = ((y = metarule(q->rule->name, z->name, 0)) && y->uname) ? y->uname : q->rule->name;
300 if (c != PREREQ_DELETE && metamatch(stem, q->rule->name, in->name) && !streq(stem, "%") && (x = metainfo('I', q->rule->name, NiL, 0)))
303 if (!streq(stem, q->rule
[all...]
H A Dvariable.c65 t.rule = makerule(r->active->primary);
72 x = p->rule;
167 * some internal vars have no associated rule
211 sfprintf(internal.val, " %s", p->rule->name);
225 if (v = getvar(p->rule->name))
234 else if (strchr(p->rule->name, '='))
240 shquote(internal.val, p->rule->name);
325 r = r->prereqs->rule;
354 if (p->rule != x && (c == '~' && (!(op & VAL_FILE) || !notfile(p->rule) || (o
[all...]
H A Drule.c25 * make rule support
175 * map name s to rule r
192 if (o && (pos = hashscan(table.rule, 0)))
206 if (p->rule == o)
207 p->rule = r;
215 * return a pointer to a rule given its name,
216 * creating the rule if necessary
229 if (((n = nametype(name, NiL)) & NAME_path) && (table.rule->flags & HASH_ALLOCATE))
265 * check if a rule name is special
300 return r->prereqs->rule
[all...]
H A Dmam.c170 if ((r->property & (P_joint|P_target)) == (P_joint|P_target) && r->prereqs->rule->prereqs->rule == r && mampush(sp, r->prereqs->rule, flags|P_joint|P_virtual) && !(r->prereqs->rule->property & P_target))
172 for (p = r->prereqs->rule->prereqs; p; p = p->next)
173 if (mampush(sp, p->rule, flags))
174 mampop(sp, p->rule, flags|P_joint);
175 mampop(sp, r->prereqs->rule, flags|P_joint|P_virtual);
176 r->prereqs->rule->property |= P_target;
H A Dtrap.c43 Rule_t* rule; member in struct:Alarms_s
100 * (re)initialize wakeup rule pointers
110 a->rule = makerule(a->rule->name);
143 error(level, "%6s %s %s", fmtelapsed((a->time >= now) ? (a->time - now) : 0, 1), timestr(tmxsns(a->time, 0)), a->rule->name);
179 if (a->rule == p->rule)
196 x->rule = p->rule;
302 r = a->rule;
[all...]
H A Dcommand.c182 lhs_prereqs.rule = &rhs_rule;
421 if (p->rule->semaphore)
423 p->rule->semaphore++;
424 p->rule->status = EXISTS;
532 if ((r = p->rule)->dynamic & D_scope)
666 for (p = job->target->prereqs->rule->prereqs; p; p = p->next)
667 if (p->rule != job->target)
668 accept(p->rule);
707 if (v = getvar(p->rule->name))
710 coexport(state.coshell, p->rule
[all...]
H A Dobject.c87 * 1 # time rule time
88 * 1 # nsec rule nsec [2004-12-01]
90 * * # ... [rule number field additions here]
94 * * $ ... [rule string field additions here]
98 * 1 # rule rule index
119 * old rule load() replacement puns on struct rule
121 * rule.mark is not used as load() may be triggered
137 #define MINRULENUM 6 /* min # rule numbe
266 OLD_rule_t* rule; /* list item */ member in struct:OLD_list_s
[all...]
H A Dparse.c2084 Rule_t rule; /* rule attributes */ member in struct:__anon172
2094 if (internal.assert_p->prereqs && (opr = associate(internal.assert_p, NiL, lhs, NiL)) && opr->prereqs && (opr = opr->prereqs->rule) && (opr->property & P_operator) && !opr->uname)
2286 att->rule.dynamic |= m;
2329 att->rule.property |= P_attribute;
2331 att->rule.property |= P_immediate;
2333 att->rule.property |= P_make;
2335 att->rule.property |= P_operator;
2337 att->rule.property |= P_readonly;
2342 if (att->rule
[all...]
H A Dmake.c51 s = p->rule;
81 if (p->rule != r)
88 (t = u)->rule = p->rule;
138 * a is the implicit action rule
171 u = p->rule;
266 * r->status determines the status of each rule:
269 * UPDATE rule in process of being updated
270 * MAKING rule action being executed
272 * EXISTS rule ha
[all...]
H A Ddump.c33 * list a rule name in re-readable form
92 * list a single rule and its attributes
118 if (r->attribute & p->rule->attribute)
119 sfputr(sp, p->rule->name, ' ');
122 if (p->rule->scan == r->scan)
124 sfputr(sp, p->rule->name, ' ');
407 dumpname(sp, p->rule, " ");
529 hashwalk(table.rule, 0, listrule, sp);
715 * dump rule info
H A Dexpand.c217 * $(s:T=<op>[r]) select components matching rule token <op> (see below)
236 * Sc return staterule name given non-state rule
237 * U return variable or non-state name given state rule
371 tab = hashalloc(table.rule, 0);
416 if (mark(xp, p->rule, m, c))
431 mark(xp, p->rule, m, c);
594 x->rule->mark |= M_mark|M_metarule;
626 if (!(p->rule->mark & M_mark))
630 sfputr(xp, state.localview ? localview(p->rule) : p->rule
[all...]
H A Dbind.c25 * make rule binding routines
48 message((-14, " %s", q->rule->name)); \
159 table.rule = hashalloc(NiL, HASH_compare, rule_compare, HASH_hash, rule_hash, HASH_name, "atoms", 0);
163 table.rule = hashalloc(table.oldvalue, HASH_name, "atoms", 0);
776 * return local view rule for r if defined
777 * force forces the rule to be allocated
858 * bind a rule to a file
1007 if ((p = x->prereqs) && (p->rule != internal.dot || (p = p->next)))
1017 if ((p = x->prereqs) && (p->rule != internal.dot || (p = p->next)))
1028 if ((p = z->prereqs) && (p->rule !
[all...]
H A Dscan.c610 hashwalk(table.rule, 0, forcescan, &r->scan);
1162 if (q->rule->scan == u->scan)
1163 os = q->rule->name;
1164 else if (q->rule->scan == n)
1165 ns = q->rule->name;
1794 if (p->rule->scan == r->scan)
1796 strategy[r->scan] = scancompile(p->rule, (r->property & P_parameter) ? SCAN_define : 0);
1849 if (p->rule->mark & M_scan)
1851 p->rule->mark &= ~M_scan;
1852 debug((-5, "%s: implicit prerequisite %s", r->name, p->rule
[all...]
H A Dmisc.c157 * add rule r onto the front of list p
168 q->rule = r;
190 q->rule = p->rule;
H A Darchive.c145 hashwalk(table.rule, 0, chktouch, NiL);
H A Dmake.h90 #define getrule(name) ((Rule_t*)hashget(table.rule,(name)))
102 #define putrule(name,r) hashput(table.rule,(char*)(name),(char*)(r))
127 #define freelist(x) do{if(x){(x)->rule=(Rule_t*)internal.freelists;internal.freelists=(char*)(x);}}while(0)
131 #define newlist(x) do{if(x=(List_t*)internal.freelists){if(x->next){x=x->next;*((char**)internal.freelists)=(char*)x->next;}else internal.freelists=(char*)x->rule;}else x=(List_t*)newchunk(&internal.freelists,sizeof(List_t));}while(0)
146 #define UPDATE 1 /* rule in process of being updated */
149 #define EXISTS 4 /* rule already exists in desired state */
150 #define IGNORE 5 /* rule make failed but ignore errors */
151 #define FAILED 6 /* rule make failed */
152 #define OLDRULE 7 /* makefile compiler old rule mark */
172 #define RULE 1 /* state rule i
717 Hash_table_t* rule; /* rule names */ member in struct:Tables_s
900 Rule_t* rule; /* list item */ member in struct:List_s
[all...]
/ast/src/cmd/INIT/
H A Dmamake.c179 struct Rule_s* rule; /* list item */ member in struct:List_s
182 typedef struct Rule_s /* rule item */
216 Dict_t* rules; /* rule dictionary */
598 * return a rule pointer for name
602 rule(char* name) function
609 report(3, "out of space [rule]", name, (unsigned long)0);
616 * prepend p onto rule r prereqs
624 for (x = r->prereqs; x && x->rule != p; x = x->next);
629 x->rule = p;
1384 make(rule(""));
[all...]

Completed in 309 milliseconds

12