| /ndk/sources/host-tools/nawk-20071023/ |
| D | proto.h | 32 extern int constnode(Node *);
33 extern char *strnode(Node *);
34 extern Node *notnull(Node *);
49 extern void penter(Node *);
50 extern void freetr(Node *);
55 extern void cfoll(fa *, Node *);
56 extern int first(Node *);
57 extern void follow(Node *);
62 extern Node *reparse(const char *);
63 extern Node *regexp(void);
[all …]
|
| D | parse.c | 32 Node *nodealloc(int n) in nodealloc()
34 Node *x; in nodealloc()
36 x = (Node *) malloc(sizeof(Node) + (n-1)*sizeof(Node *)); in nodealloc()
44 Node *exptostat(Node *a) in exptostat()
50 Node *node1(int a, Node *b) in node1()
52 Node *x; in node1()
60 Node *node2(int a, Node *b, Node *c) in node2()
62 Node *x; in node2()
71 Node *node3(int a, Node *b, Node *c, Node *d) in node3()
73 Node *x; in node3()
[all …]
|
| D | awkgram.y | 30 void checkdup(Node *list, Cell *item);
33 Node *beginloc = 0;
34 Node *endloc = 0;
38 Node *arglist = 0; /* list of args for current function */
42 Node *p;
99 winner = (Node *)stat3(PROGRAM, beginloc, $1, endloc); }
206 | ppattern MATCHOP reg_expr { $$ = op3($2, NIL, $1, (Node*)makedfa($3, 0)); }
209 $$ = op3($2, NIL, $1, (Node*)makedfa(strnode($3), 0));
211 $$ = op3($2, (Node *)1, $1, $3); }
233 | pattern MATCHOP reg_expr { $$ = op3($2, NIL, $1, (Node*)makedfa($3, 0)); }
[all …]
|
| D | awk.h | 132 typedef struct Node { struct
134 struct Node *nnext; argument
137 struct Node *narg[1]; /* variable: actual size set by calling malloc */ argument
138 } Node; typedef
140 #define NIL ((Node *) 0)
142 extern Node *winner;
143 extern Node *nullstat;
144 extern Node *nullnode;
212 Node *np;
|
| D | run.c | 70 Node *winner = NULL; /* root of parse tree */
91 Node *curnode = NULL; /* the node being executed, for debugging */
128 void run(Node *a) /* execution of parse tree starts here */ in run()
137 Cell *execute(Node *u) /* execute a node of the parse tree */ in execute()
139 Cell *(*proc)(Node **, int); in execute()
141 Node *a; in execute()
174 Cell *program(Node **a, int n) /* execute an awk program */ in program()
221 Cell *call(Node **a, int n) /* function call. very kludgy and fragile */ in call()
226 Node *x; in call()
282 y = execute((Node *)(fcn->sval)); /* execute body */ in call()
[all …]
|
| D | b.c | 124 Node *p, *p1; in mkdfa()
183 void penter(Node *p) /* set up parent pointers and leaf indices */ in penter()
208 void freetr(Node *p) /* free parse tree */ in freetr()
339 void cfoll(fa *f, Node *v) /* enter follow set of each leaf of vertex v into lfollow[leaf] */ in cfoll()
381 int first(Node *p) /* collects initially active leaves of p into setvec */ in first()
427 void follow(Node *v) /* collects leaves that can follow v into setvec */ in follow()
429 Node *p; in follow()
605 Node *reparse(const char *p) /* parses regular expression pointed to by p */ in reparse()
607 Node *np; in reparse()
623 Node *regexp(void) /* top-level parse of reg expr */ in regexp()
[all …]
|
| D | tran.c | 65 Node *nullnode; /* zero&null, converted into a node for comparisons */
|
| D | lib.c | 583 extern Node *curnode; in error()
|
| /ndk/sources/host-tools/make-3.81/doc/ |
| D | make.info | 41 Node: Top1452
42 Node: Overview14860
43 Node: Preparing15870
44 Node: Reading16842
45 Node: Bugs17769
46 Node: Introduction19599
47 Node: Rule Introduction21191
48 Node: Simple Makefile22935
49 Node: How Make Works26564
50 Node: Variables Simplify29219
[all …]
|
| D | make.info-1 | 35 File: make.info, Node: Top, Next: Overview, Prev: (dir), Up: (dir)
91 --- The Detailed Node Listing ---
302 File: make.info, Node: Overview, Next: Introduction, Prev: Top, Up: Top
329 File: make.info, Node: Preparing, Next: Reading, Prev: Overview, Up: Overview
354 File: make.info, Node: Reading, Next: Bugs, Prev: Preparing, Up: Overview
375 File: make.info, Node: Bugs, Prev: Reading, Up: Overview
418 File: make.info, Node: Introduction, Next: Makefiles, Prev: Overview, Up: Top
452 File: make.info, Node: Rule Introduction, Next: Simple Makefile, Prev: Introduction, Up: Introd…
495 File: make.info, Node: Simple Makefile, Next: How Make Works, Prev: Rule Introduction, Up: Intr…
580 File: make.info, Node: How Make Works, Next: Variables Simplify, Prev: Simple Makefile, Up: Int…
[all …]
|
| D | make.info-2 | 35 File: make.info, Node: Pattern Rules, Next: Last Resort, Prev: Chained Rules, Up: Implicit Rules
69 File: make.info, Node: Pattern Intro, Next: Pattern Examples, Prev: Pattern Rules, Up: Pattern …
128 File: make.info, Node: Pattern Examples, Next: Automatic Variables, Prev: Pattern Intro, Up: Pa…
172 File: make.info, Node: Automatic Variables, Next: Pattern Match, Prev: Pattern Examples, Up: Pa…
339 File: make.info, Node: Pattern Match, Next: Match-Anything Rules, Prev: Automatic Variables, Up…
369 File: make.info, Node: Match-Anything Rules, Next: Canceling Rules, Prev: Pattern Match, Up: Pa…
447 File: make.info, Node: Canceling Rules, Prev: Match-Anything Rules, Up: Pattern Rules
465 File: make.info, Node: Last Resort, Next: Suffix Rules, Prev: Pattern Rules, Up: Implicit Rules
510 File: make.info, Node: Suffix Rules, Next: Implicit Rule Search, Prev: Last Resort, Up: Implici…
596 File: make.info, Node: Implicit Rule Search, Prev: Suffix Rules, Up: Implicit Rules
[all …]
|
| D | make.texi | 117 --- The Detailed Node Listing ---
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/list/aux_/ |
| D | iterator.hpp | 29 template< typename Node >
36 template< typename Node >
37 struct deref< l_iter<Node> >
39 typedef typename Node::item type;
42 template< typename Node >
43 struct next< l_iter<Node> >
45 typedef l_iter< typename Node::next > type;
50 template< typename Node >
55 typedef typename Node::item type;
56 typedef l_iter< typename mpl::next<Node>::type > next;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/ |
| D | tree_right_rotate.pass.cpp | 20 struct Node struct
22 Node* __left_; argument
23 Node* __right_; argument
24 Node* __parent_; argument
26 Node() : __left_(), __right_(), __parent_() {} in Node() argument
32 Node root; in test1()
33 Node x; in test1()
34 Node y; in test1()
57 Node root; in test2()
58 Node x; in test2()
[all …]
|
| D | tree_left_rotate.pass.cpp | 20 struct Node struct
22 Node* __left_; argument
23 Node* __right_; argument
24 Node* __parent_; argument
26 Node() : __left_(), __right_(), __parent_() {} in Node() argument
32 Node root; in test1()
33 Node x; in test1()
34 Node y; in test1()
57 Node root; in test2()
58 Node x; in test2()
[all …]
|
| D | tree_balance_after_insert.pass.cpp | 20 struct Node struct
22 Node* __left_; argument
23 Node* __right_; argument
24 Node* __parent_; argument
27 Node() : __left_(), __right_(), __parent_(), __is_black_() {} in Node() argument
34 Node root; in test1()
35 Node a; in test1()
36 Node b; in test1()
37 Node c; in test1()
38 Node d; in test1()
[all …]
|
| D | tree_remove.pass.cpp | 20 struct Node struct
22 Node* __left_; argument
23 Node* __right_; argument
24 Node* __parent_; argument
27 Node() : __left_(), __right_(), __parent_(), __is_black_() {} in Node() function
36 Node root; in test1()
37 Node b; in test1()
38 Node c; in test1()
39 Node d; in test1()
40 Node e; in test1()
[all …]
|
| /ndk/sources/third_party/googletest/googletest/test/ |
| D | gtest_xml_test_utils.py | 37 from xml.dom import minidom, Node
70 if expected_node.nodeType == Node.CDATA_SECTION_NODE:
71 self.assertEquals(Node.CDATA_SECTION_NODE, actual_node.nodeType)
75 self.assertEquals(Node.ELEMENT_NODE, actual_node.nodeType)
76 self.assertEquals(Node.ELEMENT_NODE, expected_node.nodeType)
130 if child.nodeType == Node.ELEMENT_NODE:
136 elif child.nodeType in [Node.TEXT_NODE, Node.CDATA_SECTION_NODE]:
138 if (child.nodeType == Node.CDATA_SECTION_NODE or
184 if child.nodeType == Node.CDATA_SECTION_NODE:
191 if child.nodeType == Node.ELEMENT_NODE:
|
| D | gtest_xml_outfiles_test.py | 37 from xml.dom import minidom, Node
|
| D | gtest_xml_output_unittest.py | 41 from xml.dom import minidom, Node
|
| /ndk/sources/host-tools/sed-4.2.1/doc/ |
| D | sed.info | 28 File: sed.info, Node: Top, Next: Introduction, Up: (dir)
99 File: sed.info, Node: Introduction, Next: Invoking sed, Prev: Top, Up: Top
113 File: sed.info, Node: Invoking sed, Next: sed Programs, Prev: Introduction, Up: Top
268 File: sed.info, Node: sed Programs, Next: Examples, Prev: Invoking sed, Up: Top
297 File: sed.info, Node: Execution Cycle, Next: Addresses, Up: sed Programs
331 File: sed.info, Node: Addresses, Next: Regular Expressions, Prev: Execution Cycle, Up: sed Prog…
438 File: sed.info, Node: Regular Expressions, Next: Common Commands, Prev: Addresses, Up: sed Prog…
643 File: sed.info, Node: Common Commands, Next: The "s" Command, Prev: Regular Expressions, Up: se…
698 File: sed.info, Node: The "s" Command, Next: Other Commands, Prev: Common Commands, Up: sed Pro…
809 File: sed.info, Node: Other Commands, Next: Programming Commands, Prev: The "s" Command, Up: se…
[all …]
|
| /ndk/tests/device/test-stlport_shared-exception/jni/ |
| D | unroll1.cpp | 347 class Node class
350 Node(const Interval &owned, const Interval &allocated) in Node() function in Node
371 Node node_m;
|
| /ndk/tests/device/test-stlport_static-exception/jni/ |
| D | unroll1.cpp | 347 class Node class
350 Node(const Interval &owned, const Interval &allocated) in Node() function in Node
371 Node node_m;
|