Home
last modified time | relevance | path

Searched refs:END_NODE (Results 1 – 6 of 6) sorted by relevance

/external/dtc/tests/
Dtrees.S71 #define END_NODE \ macro
106 END_NODE
109 END_NODE
111 END_NODE
125 END_NODE
128 END_NODE
130 END_NODE
132 END_NODE
172 END_NODE
173 END_NODE
[all …]
/external/bison/src/
Drelation.c39 for (j = 0; r[i][j] != END_NODE; ++j) in relation_print()
71 for (j = 0; R[i][j] != END_NODE; ++j) in traverse()
146 for (j = 0; r[i][j] != END_NODE; ++j) in relation_transpose()
156 sp[nedges[i]] = END_NODE; in relation_transpose()
165 for (j = 0; r[i][j] != END_NODE; ++j) in relation_transpose()
Drelation.h29 #define END_NODE ((relation_node) -1) macro
Dlalr.c191 reads[i][nedges] = END_NODE; in initialize_F()
279 includes[i][nedges] = END_NODE; in build_relations()
Dielr.c162 (*edgesp)[i][nsources] = END_NODE; in ielr_compute_internal_follow_edges()
277 (*edgesp)[i][nedges] = END_NODE; in ielr_compute_always_follows()
/external/bison/
DChangeLog-201211611 (build_relations): Use END_NODE, not -1, to denote end of edges.
11693 Check for END_NODE rather than looking at sign.
11694 * src/relation.h (END_NODE): New macro.