| /build/blueprint/ |
| D | ninja_writer.go | 44 func (n *ninjaWriter) Comment(comment string) error {
45 n.justDidBlankLine = false
75 _, err := io.WriteString(n.writer, line)
85 _, err := fmt.Fprintf(n.writer, "# %s\n", line)
94 func (n *ninjaWriter) Pool(name string) error {
95 n.justDidBlankLine = false
96 _, err := fmt.Fprintf(n.writer, "pool %s\n", name)
100 func (n *ninjaWriter) Rule(name string) error {
101 n.justDidBlankLine = false
102 _, err := fmt.Fprintf(n.writer, "rule %s\n", name)
[all …]
|
| D | ninja_strings.go | 89 n := strings.Count(str, "$")
91 strings: make([]string, 0, n+1),
92 variables: make([]Variable, 0, n),
273 func (n *ninjaString) Value(pkgNames map[*packageContext]string) string {
274 return n.ValueWithEscaper(pkgNames, defaultEscaper)
277 func (n *ninjaString) ValueWithEscaper(pkgNames map[*packageContext]string,
280 str := escaper.Replace(n.strings[0])
281 for i, v := range n.variables {
283 str += escaper.Replace(n.strings[i+1])
288 func (n *ninjaString) Eval(variables map[Variable]*ninjaString) (string, error) {
[all …]
|
| /build/kati/ |
| D | ninja.go | 82 func (n *NinjaGenerator) init(g *DepGraph) {
84 n.nodes = g.nodes
85 n.exports = g.exports
86 n.ctx = newExecContext(g.vars, g.vpaths, true)
87 n.done = make(map[string]nodeState)
301 func (n *NinjaGenerator) genShellScript(runners []runner) (cmd string, desc string, useLocalPool bo…
324 if n.GomaDir != "" {
327 cmd = fmt.Sprintf("%s/gomacc %s", n.GomaDir, rcmd)
331 if n.DetectAndroidEcho && desc == "" {
357 return buf.String(), desc, n.GomaDir != "" && !useGomacc
[all …]
|
| D | query.go | 22 func showDeps(w io.Writer, n *DepNode, indent int, seen map[string]int) {
23 id, present := seen[n.Output]
26 seen[n.Output] = id
28 fmt.Fprintf(w, "%*c%s (%d)\n", indent, ' ', n.Output, id)
32 for _, d := range n.Deps {
35 if len(n.OrderOnlys) > 0 {
37 for _, d := range n.OrderOnlys {
43 func showNode(w io.Writer, n *DepNode) {
44 fmt.Fprintf(w, "%s:", n.Output)
45 for _, i := range n.ActualInputs {
[all …]
|
| D | exec.go | 46 func (ex *Executor) makeJobs(n *DepNode, neededBy *job) error {
47 output, _ := ex.ctx.vpaths.exists(n.Output)
49 glog.V(1).Infof("MakeJob: %s for %s", output, neededBy.n.Output)
51 n.Output = output
61 if !n.IsPhony {
62 fmt.Printf("Circular %s <- %s dependency dropped.\n", neededBy.n.Output, n.Output)
68 glog.Infof("%s already done: %d", j.n.Output, j.outputTs)
77 n: n,
79 numDeps: len(n.Deps) + len(n.OrderOnlys),
91 for _, d := range n.Deps {
[all …]
|
| D | exec.cc | 52 double ExecNode(DepNode* n, DepNode* needed_by) { in ExecNode() argument
53 auto found = done_.find(n->output); in ExecNode()
58 n->output.c_str()); in ExecNode()
62 done_[n->output] = kProcessing; in ExecNode()
63 double output_ts = GetTimestamp(n->output.c_str()); in ExecNode()
65 LOG("ExecNode: %s for %s", n->output.c_str(), in ExecNode()
68 if (!n->has_rule && output_ts == kNotExist && !n->is_phony) { in ExecNode()
71 n->output.c_str(), needed_by->output.c_str()); in ExecNode()
73 ERROR("*** No rule to make target '%s'.", n->output.c_str()); in ExecNode()
78 for (DepNode* d : n->order_onlys) { in ExecNode()
[all …]
|
| D | worker.go | 34 n *DepNode member
80 n := len(old)
81 item := old[n-1]
82 *jq = old[0 : n-1]
119 runners, _, err := createRunners(j.ex.ctx, j.n)
133 if j.n.IsPhony {
136 j.outputTs = getTimestamp(j.n.Output)
139 if !j.n.HasRule {
140 if j.outputTs >= 0 || j.n.IsPhony {
144 return fmt.Errorf("*** No rule to make target %q.", j.n.Output)
[all …]
|
| D | dep.cc | 212 void FillDepNodeFromRule(Symbol output, const Rule* r, DepNode* n) const { in FillDepNodeFromRule()
214 copy(r->cmds.begin(), r->cmds.end(), back_inserter(n->cmds)); in FillDepNodeFromRule()
216 ApplyOutputPattern(*r, output, r->inputs, &n->actual_inputs); in FillDepNodeFromRule()
218 &n->actual_order_only_inputs); in FillDepNodeFromRule()
222 n->output_pattern = r->output_patterns[0]; in FillDepNodeFromRule()
226 void FillDepNodeLoc(const Rule* r, DepNode* n) const { in FillDepNodeLoc()
227 n->loc = r->loc; in FillDepNodeLoc()
229 n->loc.lineno = r->cmd_lineno; in FillDepNodeLoc()
232 void FillDepNode(Symbol output, const Rule* pattern_rule, DepNode* n) const { in FillDepNode()
235 FillDepNodeFromRule(output, primary_rule, n); in FillDepNode()
[all …]
|
| D | serialize.go | 194 for _, n := range nodes {
195 if ns.done[n.Output] {
198 ns.done[n.Output] = true
201 for _, d := range n.Deps {
205 for _, d := range n.OrderOnlys {
209 for _, d := range n.Parents {
213 for _, i := range n.ActualInputs {
219 for k := range n.TargetSpecificVars {
226 v := n.TargetSpecificVars[k]
244 Output: ns.serializeTarget(n.Output),
[all …]
|
| D | depgraph.go | 44 var fix func(n *DepNode)
45 fix = func(n *DepNode) {
46 if seen[n] {
49 seen[n] = true
50 glog.V(3).Infof("vpath check %s [%#v]", n.Output, g.vpaths)
51 if output, ok := g.vpaths.exists(n.Output); ok {
52 glog.V(2).Infof("vpath fix %s=>%s", n.Output, output)
53 n.Output = output
55 for _, d := range n.Deps {
58 for _, d := range n.OrderOnlys {
[all …]
|
| D | expr.cc | 120 explicit SymRef(Symbol n) : name_(n) {} in SymRef() argument
140 explicit VarRef(Value* n) : name_(n) {} in VarRef() argument
164 explicit VarSubst(Value* n, Value* p, Value* s) in VarSubst() argument
165 : name_(n), pat_(p), subst_(s) {} in VarSubst()
256 char n = s.get(i + 1); in SkipSpaces() local
257 if (n != '\r' && n != '\n') in SkipSpaces()
302 size_t n; in ParseFunc() local
303 Value* v = ParseExprImpl(loc, s.substr(i), terms, ParseExprOpt::FUNC, &n, in ParseFunc()
307 i += n; in ParseFunc()
347 size_t n; in ParseDollar() local
[all …]
|
| D | dep.go | 41 func (n *DepNode) String() string {
43 n.Output, len(n.Cmds), len(n.Deps), len(n.OrderOnlys), n.HasRule, n.IsPhony, n.Filename, n.Lineno)
290 if n, present := db.done[output]; present {
291 return n, nil
294 n := &DepNode{Output: output, IsPhony: db.phony[output]}
295 db.done[output] = n
300 return n, nil
351 n.Deps = append(n.Deps, ni)
352 ni.Parents = append(ni.Parents, n)
363 if n != nil {
[all …]
|
| D | evalcmd.go | 290 func createRunners(ctx *execContext, n *DepNode) ([]runner, bool, error) {
292 if len(n.Cmds) == 0 {
299 ctx.output = n.Output
300 ctx.inputs = n.ActualInputs
301 for k, v := range n.TargetSpecificVars {
310 ctx.ev.filename = n.Filename
311 ctx.ev.lineno = n.Lineno
312 glog.Infof("Building: %s cmds:%q", n.Output, n.Cmds)
314 output: n.Output,
318 for _, cmd := range n.Cmds {
[all …]
|
| D | command.cc | 119 const DepNode* n = ce_->current_dep_node(); in Eval() local
120 if (!n->output_pattern.IsValid()) in Eval()
122 Pattern pat(n->output_pattern.str()); in Eval()
123 pat.Stem(n->output.str()).AppendToString(s); in Eval()
186 void CommandEvaluator::Eval(DepNode* n, vector<Command*>* commands) { in Eval() argument
187 ev_->set_loc(n->loc); in Eval()
188 ev_->set_current_scope(n->rule_vars); in Eval()
189 current_dep_node_ = n; in Eval()
190 for (Value* v : n->cmds) { in Eval()
211 Command* command = new Command(n->output); in Eval()
[all …]
|
| D | expr.go | 195 n := int(p)
196 if n < len(ev.paramVars) {
197 err := ev.paramVars[n].Eval(w, ev)
202 vv := ev.LookupVar(fmt.Sprintf("%d", n))
317 n, err := strconv.ParseInt(v.String(), 10, 64)
318 return int(n), err
368 v, n, err := parseDollar(in[i:], op.alloc)
372 i += n
450 e, n, err := parseExpr(in[i:], term, op)
461 return &varref{varname: varname, paren: oparen}, i + 1 + n + 1, nil
[all …]
|
| /build/make/tools/ |
| D | java-layers.py | 102 n = 0
106 n = n + 1
107 return n
126 n = [0]
127 lines = [lineno(x,n) for x in lines]
128 lines = [(n,s.split("#")[0].strip()) for (n,s) in lines]
129 lines = [(n,s) for (n,s) in lines if len(s) > 0]
130 lines = [(n,s.split()) for (n,s) in lines]
132 for n,words in lines:
147 + " line %d.\n") % (filename, n, lower, deps[lower].lineno))
[all …]
|
| /build/soong/androidmk/parser/ |
| D | make_strings.go | 127 func (ms *MakeString) SplitN(sep string, n int) []*MakeString {
135 if n != 0 {
136 split := splitAnyN(s, sep, n)
137 if n != -1 {
138 if len(split) > n {
141 n -= len(split)
192 func splitAnyN(s, sep string, n int) []string {
194 for n == -1 || n > 1 {
199 if n > 0 {
200 n--
|
| D | make_strings_test.go | 26 n int
41 n: -1,
76 n: 3,
93 got := test.in.SplitN(test.sep, test.n)
|
| /build/soong/cmd/fileslist/ |
| D | fileslist.go | 63 func (n *Node) scan() bool {
64 n.Size = n.stat.Size()
68 if n.stat.Mode()&os.ModeSymlink == 0 {
69 f, err := os.Open(n.path)
80 s, err := os.Readlink(n.path)
88 n.SHA256 = fmt.Sprintf("%x", h.Sum(nil))
|
| /build/soong/cmd/symbol_inject/ |
| D | symbol_inject.go | 186 var n int
187 for n = i; n < len(file.Symbols); n++ {
188 if file.Symbols[n].Section != symbol.Section {
189 n = len(file.Symbols)
192 if file.Symbols[n].Addr > symbol.Addr {
200 if n < len(file.Symbols) {
201 end = file.Symbols[n].Addr
|
| /build/make/tools/droiddoc/templates-ndk/assets/js/ |
| D | prettify.js | 6 …:8,t:9,n:10,v:11,f:12,r:13},n=[],p=0,d=a.length;p<d;++p){g=a[p];if(g.global||g.multiline)throw Err… property
7 … e(a){for(var l=a.d,p=[l,"pln"],d=0,g=a.a.match(y)||[],r={},n=0,z=g.length;n<z;++n){var f=g[n],b=r…
9 …gth;d<g;++d){var r=e[d],n=r[3];if(n)for(var k=n.length;--k>=0;)h[n.charAt(k)]=r;r=r[1];n=""+r;p.ha…
10 …arning)\b|[^\n\r]*)/,q,"#"]),e.push(["str",/^<(?:(?:(?:\.\.\/)*|\/?)(?:[\w-]+(?:\/[\w-]+)+)?[\w-]+…
11 q,"#"]));a.cStyleComments&&(e.push(["com",/^\/\/[^\n\r]*/,q]),e.push(["com",/^\/\*[\S\s]*?(?:\*\/|$…
22 ["default-markup","htm","html","mxml","xhtml","xml","xsl"]);k(x([["pln",/^\s+/,q," \t\r\n"],["atv",…
|
| /build/soong/third_party/zip/ |
| D | zip_test.go | 116 n int64 member
131 return last.off + last.n
134 func (r *rleBuffer) Write(p []byte) (n int, err error) {
148 rp.n += int64(len(p))
159 rp.n++
165 func (r *rleBuffer) ReadAt(p []byte, off int64) (n int, err error) {
171 return part.off+part.n > off
178 for i := skipBytes; i < part.n; i++ {
179 if n == len(p) {
182 p[n] = part.b
[all …]
|
| /build/soong/android/ |
| D | util.go | 32 n := len(" ") * (len(strs) - 1)
34 n += len(prefix) + len(s)
37 ret := make([]byte, 0, n)
173 n := runtime.Callers(skip+1, pc[:])
174 if n != 1 {
|
| /build/make/tools/releasetools/ |
| D | rangelib.py | 276 def extend(self, n): argument
293 s1 = max(0, s - n)
294 e1 = e + n
298 def first(self, n): argument
317 if self.size() <= n:
322 if e - s >= n:
323 out += (s, s+n)
327 n -= e - s
|
| /build/make/tools/droiddoc/templates-pdk/assets/ |
| D | search_autocomplete.js | 184 var n = 0;
186 if (s.charAt(i) == c) ++n;
187 return n;
224 var n = b.__resultScore - a.__resultScore;
225 if (n == 0) // lexicographical sort if scores are the same
226 n = (a.label < b.label) ? -1 : 1;
227 return n;
|