| /external/clang/include/clang/ASTMatchers/ |
| ASTMatchFinder.h | 177 /// \brief Calls the registered callbacks on all matches on the given \p Node.
179 /// Note that there can be multiple matches on a single node, for
183 template <typename T> void match(const T &Node, ASTContext &Context) {
184 match(clang::ast_type_traits::DynTypedNode::create(Node), Context);
186 void match(const clang::ast_type_traits::DynTypedNode &Node,
224 /// \brief Returns the results of matching \p Matcher on \p Node.
227 /// \p Matcher on \p Node and returns the collected results.
236 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context);
240 match(MatcherT Matcher, const ast_type_traits::DynTypedNode &Node,
246 /// Returns \c NULL if there is no match, or if the matching node cannot b
[all...] |
| ASTMatchersInternal.h | 13 // Matches(...) which is a predicate on an AST node. The Matches method's
15 // or store the current node as bound to a specific string, so that it can be
66 /// \brief Adds \c Node to the map with key \c ID.
68 /// The node's base type should be in NodeBaseType or it will be unaccessible.
73 /// \brief Returns the AST node bound to \c ID.
75 /// Returns NULL if there was no node bound to \c ID or if there is a node but
142 /// \brief Add a binding from an id to a node.
171 /// i.e. all stored node maps have memoization data.
205 /// \brief Generic interface for matchers on an AST node of type T
[all...] |
| /external/google-breakpad/src/testing/gtest/test/ |
| gtest_xml_test_utils.py | 37 from xml.dom import minidom, Node
53 Asserts that actual_node (a DOM node object) is equivalent to
54 expected_node (another DOM node object), in that either both of
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)
123 attributes are encountered, or if any other type of node is encountered.
128 if child.nodeType == Node.ELEMENT_NODE:
134 elif child.nodeType in [Node.TEXT_NODE, Node.CDATA_SECTION_NODE]
[all...] |
| /external/gtest/test/ |
| gtest_xml_test_utils.py | 37 from xml.dom import minidom, Node
53 Asserts that actual_node (a DOM node object) is equivalent to
54 expected_node (another DOM node object), in that either both of
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)
127 attributes are encountered, or if any other type of node is encountered.
132 if child.nodeType == Node.ELEMENT_NODE:
138 elif child.nodeType in [Node.TEXT_NODE, Node.CDATA_SECTION_NODE]
[all...] |
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| DefaultNodeCreator.java | 35 * Default node creator.
40 @Override public Iterable<Node> getNodes(Iterable<Binding<?>> bindings) {
41 List<Node> nodes = Lists.newArrayList();
53 extends DefaultBindingTargetVisitor<Object, Collection<Node>> {
55 /** Returns a new interface node for the given {@link Binding}. */
61 * Returns a new implementation node for the given binding.
63 * @param binding binding for the node to create
64 * @param members members to add to the node
65 * @return implementation node for the given binding
74 * Returns a new instance node for the given {@link Binding}
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| StringTrieBuilder.java | 87 // because it makes registerNode() return the input node
131 * Makes sure that there is only one unique node registered that is
133 * @param newNode Input node. The builder takes ownership.
135 * an equivalent node if newNode is a duplicate.
137 private final Node registerNode(Node newNode) {
142 Node oldNode=nodes.get(newNode);
147 // registered node, then get() failed to find that and we will leak newNode.
156 * Avoids creating a node if the value is a duplicate.
164 Node oldNode=nodes.get(lookupFinalValueNode)
300 ValueNode node=builder.createSuffixNode(s, start, sValue); local
558 Node node=equal.get(start); local
806 ValueNode node=registerFinalValue(sValue); local
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| StringTrieBuilder.java | 89 // because it makes registerNode() return the input node
133 * Makes sure that there is only one unique node registered that is
135 * @param newNode Input node. The builder takes ownership.
137 * an equivalent node if newNode is a duplicate.
139 private final Node registerNode(Node newNode) {
144 Node oldNode=nodes.get(newNode);
149 // registered node, then get() failed to find that and we will leak newNode.
158 * Avoids creating a node if the value is a duplicate.
166 Node oldNode=nodes.get(lookupFinalValueNode)
302 ValueNode node=builder.createSuffixNode(s, start, sValue); local
560 Node node=equal.get(start); local
808 ValueNode node=registerFinalValue(sValue); local
[all...] |
| /external/protobuf/gtest/test/ |
| gtest_xml_test_utils.py | 37 from xml.dom import minidom, Node
53 Asserts that actual_node (a DOM node object) is equivalent to
54 expected_node (another DOM node object), in that either both of
69 if expected_node.nodeType == Node.CDATA_SECTION_NODE:
70 self.assertEquals(Node.CDATA_SECTION_NODE, actual_node.nodeType)
74 self.assertEquals(Node.ELEMENT_NODE, actual_node.nodeType)
75 self.assertEquals(Node.ELEMENT_NODE, expected_node.nodeType)
122 attributes are encountered, or if any other type of node is encountered.
127 if child.nodeType == Node.ELEMENT_NODE:
133 elif child.nodeType in [Node.TEXT_NODE, Node.CDATA_SECTION_NODE]
[all...] |
| /external/v8/src/compiler/ |
| dead-code-elimination.cc | 9 #include "src/compiler/node-properties.h"
24 Reduction DeadCodeElimination::Reduce(Node* node) {
25 switch (node->opcode()) {
27 return ReduceEnd(node);
30 return ReduceLoopOrMerge(node);
32 return ReduceNode(node);
39 Reduction DeadCodeElimination::ReduceEnd(Node* node) {
40 DCHECK_EQ(IrOpcode::kEnd, node->opcode())
[all...] |
| value-numbering-reducer.cc | 10 #include "src/compiler/node.h"
18 size_t HashCode(Node* node) {
19 size_t h = base::hash_combine(node->op()->HashCode(), node->InputCount());
20 for (int j = 0; j < node->InputCount(); ++j) {
21 h = base::hash_combine(h, node->InputAt(j)->id());
27 bool Equals(Node* a, Node* b) {
52 Reduction ValueNumberingReducer::Reduce(Node* node)
[all...] |
| bytecode-graph-builder.cc | 41 void AddToNode(Node* node, OutputFrameStateCombine combine) {
43 int count = OperatorProperties::GetFrameStateInputCount(node->op());
48 NodeProperties::GetFrameStateInput(node, 0)->opcode());
49 Node* frame_state_after =
51 NodeProperties::ReplaceFrameStateInput(node, 0, frame_state_after);
57 NodeProperties::GetFrameStateInput(node, 1)->opcode());
58 NodeProperties::ReplaceFrameStateInput(node, 1, frame_state_before_);
63 output_poke_count_ = node->op()->ValueOutputCount();
69 Node* frame_state_before_
403 Node* node = NewNode(op, graph()->start()); local
415 Node* node = NewNode(op, graph()->start()); local
426 Node* node = NewNode(op, graph()->start()); local
513 Node* node = NewNode(javascript()->StackCheck()); local
551 Node* node = jsgraph()->ZeroConstant(); local
558 Node* node = jsgraph()->Constant(iterator.GetImmediateOperand(0)); local
565 Node* node = jsgraph()->Constant(iterator.GetConstantForIndexOperand(0)); local
572 Node* node = jsgraph()->Constant(iterator.GetConstantForIndexOperand(0)); local
579 Node* node = jsgraph()->UndefinedConstant(); local
586 Node* node = jsgraph()->NullConstant(); local
593 Node* node = jsgraph()->TheHoleConstant(); local
600 Node* node = jsgraph()->TrueConstant(); local
607 Node* node = jsgraph()->FalseConstant(); local
656 Node* node = NewNode(op, BuildLoadFeedbackVector()); local
727 Node* node = NewNode(op, value, BuildLoadFeedbackVector()); local
770 Node* node = NewNode(op, context); local
883 Node* node = NewNode(op, object, BuildLoadFeedbackVector()); local
924 Node* node = NewNode(op, object, key, BuildLoadFeedbackVector()); local
968 Node* node = NewNode(op, object, value, BuildLoadFeedbackVector()); local
1010 Node* node = NewNode(op, object, key, value, BuildLoadFeedbackVector()); local
1336 Node* node = NewNode(js_op, left, right); local
1424 Node* node = NewNode(js_op, environment()->LookupAccumulator(), local
1435 Node* node = NewNode(js_op, environment()->LookupAccumulator(), local
1445 Node* node = NewNode(common()->Select(MachineRepresentation::kTagged), value, local
1453 Node* node = local
1464 Node* node = local
1499 Node* node = NewNode(js_op, left, right); local
1567 Node* node = NewNode(js_op, environment()->LookupAccumulator()); local
[all...] |
| common-operator-reducer.cc | 12 #include "src/compiler/node.h"
13 #include "src/compiler/node-matchers.h"
14 #include "src/compiler/node-properties.h"
24 Decision DecideCondition(Node* const cond) {
56 Reduction CommonOperatorReducer::Reduce(Node* node) {
57 switch (node->opcode()) {
59 return ReduceBranch(node);
61 return ReduceMerge(node);
63 return ReduceEffectPhi(node);
[all...] |
| simplified-lowering.cc | 14 #include "src/compiler/node-matchers.h"
15 #include "src/compiler/node-properties.h"
43 // During this phase, the usage information for a node determines the best
62 // The {UseInfo} class is used to describe a use of an input of a node.
66 // 1. During propagation, the use info is used to inform the input node
214 void SetAndCheckInput(Node* node, int index, UseInfo use_info) {
216 input_use_infos_.resize(node->InputCount(), UseInfo::None());
240 // Information for each node tracked during the fixpoint.
308 // Adds new use to the node. Returns true if something has change
360 Node* node = queue_.front(); local
376 Node* node = *i; local
388 Node* node = *i; local
412 Node* node = use_node->InputAt(index); local
[all...] |
| js-global-object-specialization.cc | 12 #include "src/compiler/node-properties.h"
40 Reduction JSGlobalObjectSpecialization::Reduce(Node* node) {
41 switch (node->opcode()) {
43 return ReduceJSLoadGlobal(node);
45 return ReduceJSStoreGlobal(node);
53 Reduction JSGlobalObjectSpecialization::ReduceJSLoadGlobal(Node* node) {
54 DCHECK_EQ(IrOpcode::kJSLoadGlobal, node->opcode());
55 Handle<Name> name = LoadGlobalParametersOf(node->op()).name()
[all...] |
| /external/vulkan-validation-layers/tests/gtest-1.7.0/test/ |
| gtest_xml_test_utils.py | 37 from xml.dom import minidom, Node
53 Asserts that actual_node (a DOM node object) is equivalent to
54 expected_node (another DOM node object), in that either both of
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)
127 attributes are encountered, or if any other type of node is encountered.
132 if child.nodeType == Node.ELEMENT_NODE:
138 elif child.nodeType in [Node.TEXT_NODE, Node.CDATA_SECTION_NODE]
[all...] |
| /ndk/sources/third_party/googletest/googletest/test/ |
| gtest_xml_test_utils.py | 37 from xml.dom import minidom, Node
53 Asserts that actual_node (a DOM node object) is equivalent to
54 expected_node (another DOM node object), in that either both of
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)
125 attributes are encountered, or if any other type of node is encountered.
130 if child.nodeType == Node.ELEMENT_NODE:
136 elif child.nodeType in [Node.TEXT_NODE, Node.CDATA_SECTION_NODE]
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/ |
| DOM2DTM.java | 50 import org.w3c.dom.Node;
57 * tree. You can wrap a DOM2DTM around a specific node and its subtree
75 /** The current position in the DOM tree. Last node examined for
77 transient private Node m_pos;
87 transient private Node m_root;
90 synthesis of the implied xml: namespace declaration node. */
98 /** The node objects. The instance part of the handle indexes
99 * directly into this vector. Each DTM node may actually be
102 * single DTM Text node); this table points only to the first in
107 * Construct a DOM2DTM object from a DOM node
781 Node node = lookupNode(identity); local
816 Node node = getNode(nodeHandle); local
871 Node node = getNode(nodeHandle); local
958 Node node = getNode(nodeHandle); local
982 Node node = getNode(nodeHandle); local
1001 Node node = getNode(nodeHandle); local
1060 Node node = getNode(nodeHandle); local
1103 Node node = getNode(nodeHandle); local
1115 Node node = getNode(nodeHandle); local
1164 Node node = getNode(nodeHandle); local
1363 Node node = getNode(identity); local
1621 Node node = getNode(nodeHandle); local
1726 Node node = getNode(nodeHandle); local
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| DominanceFrontierImpl.h | 35 : currentBB(B), parentBB(P), Node(N), parentNode(PN) {}
38 const DomTreeNodeT *Node;
52 BlockT *Node) {
54 assert(I->second.count(Node) && "Node is not in DominanceFrontier of BB");
55 I->second.erase(Node);
60 BlockT *Node) {
62 assert(I->second.count(Node) && "Node is not in DominanceFrontier of BB");
63 I->second.erase(Node);
[all...] |
| /frameworks/base/core/java/android/animation/ |
| AnimatorSet.java | 74 * to a single node representing that Animator, not create a new Node
77 private ArrayMap<Animator, Node> mNodeMap = new ArrayMap<Animator, Node>();
84 private ArrayList<Node> mNodes = new ArrayList<Node>();
123 private Node mRootNode = new Node(mDelayAnim);
248 Node node = mNodes.get(i) local
267 Node node = mNodes.get(i); local
415 Node node = mNodeMap.get(anim); local
442 Node node = mNodes.get(i); local
492 Node node = mNodes.get(i); local
545 Node node = mNodes.get(i); local
556 Node node = mNodes.get(i); local
574 Node node = mNodes.get(i); local
594 Node node = mNodes.get(i); local
619 Node node = mNodes.get(i); local
626 Node node = mNodes.get(i); local
665 Node node = mNodes.get(i); local
706 final Node node = mNodes.get(n); local
730 Node node = mNodes.get(i); local
851 Node node = mNodes.get(i); local
867 Node node = mNodes.get(i); local
878 Node node = mNodes.get(i); local
894 Node node = list.get(index); local
935 Node node = mNodes.get(i); local
964 Node node = mNodes.get(i); local
979 Node node = mNodes.get(i); local
1001 Node node = mNodes.get(i); local
1086 Node node = mNodeMap.get(anim); local
1159 Node node = (Node) super.clone(); local
1298 Node node = getNodeForAnimation(anim); local
1313 Node node = getNodeForAnimation(anim); local
1328 Node node = getNodeForAnimation(anim); local
[all...] |
| /art/compiler/optimizing/ |
| gvn.cc | 42 buckets_(allocator->AllocArray<Node*>(num_buckets_, kArenaAllocGvn)),
55 buckets_(allocator->AllocArray<Node*>(num_buckets_, kArenaAllocGvn)),
93 buckets_[index] = new (allocator_) Node(instruction, hash_code, buckets_[index]);
103 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) {
104 if (node->GetHashCode() == hash_code) {
105 HInstruction* existing = node->GetInstruction()
253 Node* node = buckets_[i]; local
[all...] |
| /external/llvm/lib/Analysis/ |
| TypeBasedAliasAnalysis.cpp | 33 // name in the tree is the name of the root node. Two trees with
34 // different root node names are entirely disjoint, even if they
37 // The second field identifies the type's parent node in the tree, or
38 // is null or omitted for a root node. A type is considered to alias
51 // The path tag node has 4 fields with the last field being optional.
53 // The first field is the base type node, it can be a struct type node
54 // or a scalar type node. The second field is the access type node, it
55 // must be a scalar type node. The third field is the offset into the base type
[all...] |
| LazyCallGraph.cpp | 25 SmallVectorImpl<PointerUnion<Function *, LazyCallGraph::Node *>> &Callees,
56 LazyCallGraph::Node::Node(LazyCallGraph &G, Function &F)
78 void LazyCallGraph::Node::insertEdgeInternal(Function &Callee) {
79 if (Node *N = G->lookup(Callee))
86 void LazyCallGraph::Node::insertEdgeInternal(Node &CalleeN) {
91 void LazyCallGraph::Node::removeEdgeInternal(Function &Callee) {
129 SCCEntryNodes.push_back(&Entry.get<Node *>()->getFunction());
159 void LazyCallGraph::SCC::insert(Node &N)
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| UnImplNode.java | 37 import org.w3c.dom.Node;
49 public class UnImplNode implements Node, Element, NodeList, Document
86 * Unimplemented. See org.w3c.dom.Node
88 * @param newChild New node to append to the list of this node's children
94 public Node appendChild(Node newChild) throws DOMException
103 * Unimplemented. See org.w3c.dom.Node
116 * Unimplemented. See org.w3c.dom.Node
129 * Unimplemented. See org.w3c.dom.Node
[all...] |
| /external/v8/src/compiler/mips64/ |
| instruction-selector-mips64.cc | 8 #include "src/compiler/node-matchers.h"
9 #include "src/compiler/node-properties.h"
27 InstructionOperand UseOperand(Node* node, InstructionCode opcode) {
28 if (CanBeImmediate(node, opcode)) {
29 return UseImmediate(node);
31 return UseRegister(node);
34 bool CanBeImmediate(Node* node, InstructionCode opcode) {
36 if (node->opcode() == IrOpcode::kInt32Constant
1601 Node* const node = value->InputAt(0); local
[all...] |
| /external/v8/src/compiler/mips/ |
| instruction-selector-mips.cc | 8 #include "src/compiler/node-matchers.h"
9 #include "src/compiler/node-properties.h"
27 InstructionOperand UseOperand(Node* node, InstructionCode opcode) {
28 if (CanBeImmediate(node, opcode)) {
29 return UseImmediate(node);
31 return UseRegister(node);
34 bool CanBeImmediate(Node* node, InstructionCode opcode) {
35 Int32Matcher m(node);
1115 Node* const node = value->InputAt(0); local
[all...] |
