| /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...] |
| /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 // Use the zero register if the node has the immediate value zero, otherwise
36 InstructionOperand UseRegisterOrImmediateZero(Node* node) {
1567 Node* const node = value->InputAt(0); local
[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...] |
| PrefixResolver.java | 46 * Given a namespace, get the corresponding prefix, based on the context node.
49 * @param context The node context from which to look up the URI.
54 String getNamespaceForPrefix(String prefix, org.w3c.dom.Node context);
|
| /external/clang/lib/ASTMatchers/ |
| ASTMatchersInternal.cpp | 332 StringRef getNodeName(const NamedDecl &Node, llvm::SmallString<128> &Scratch) {
334 if (Node.getIdentifier())
335 return Node.getName();
337 if (Node.getDeclName()) {
341 Node.printName(OS);
348 StringRef getNodeName(const RecordDecl &Node, llvm::SmallString<128> &Scratch) {
349 if (Node.getIdentifier()) {
350 return Node.getName();
353 return ("(anonymous " + Node.getKindName() + ")").toStringRef(Scratch);
356 StringRef getNodeName(const NamespaceDecl &Node,
[all...] |
| /external/v8/src/compiler/ |
| store-store-elimination.cc | 11 #include "src/compiler/node-properties.h"
53 // returned by node #263 cannot be observed ...
58 // eliminated. This optimization should work for any offset and input node, of
138 const ZoneSet<Node*>& to_remove_const() { return to_remove_; }
140 void Visit(Node* node);
143 static bool IsEffectful(Node* node);
144 void VisitEffectfulNode(Node* node);
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
| BlockFrequencyInfoImpl.h | 198 /// Contains the data necessary to represent a loop as a pseudo-node once it's
224 bool isHeader(const BlockNode &Node) const {
227 Node);
228 return Node == Nodes[0];
252 BlockNode Node; ///< This node.
256 WorkingData(const BlockNode &Node) : Node(Node), Loop(nullptr) {}
258 bool isLoopHeader() const { return Loop && Loop->isHeader(Node); }
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
| BlockFrequencyInfoImpl.h | 198 /// Contains the data necessary to represent a loop as a pseudo-node once it's
224 bool isHeader(const BlockNode &Node) const {
227 Node);
228 return Node == Nodes[0];
252 BlockNode Node; ///< This node.
256 WorkingData(const BlockNode &Node) : Node(Node), Loop(nullptr) {}
258 bool isLoopHeader() const { return Loop && Loop->isHeader(Node); }
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
| BlockFrequencyInfoImpl.h | 198 /// Contains the data necessary to represent a loop as a pseudo-node once it's
224 bool isHeader(const BlockNode &Node) const {
227 Node);
228 return Node == Nodes[0];
252 BlockNode Node; ///< This node.
256 WorkingData(const BlockNode &Node) : Node(Node), Loop(nullptr) {}
258 bool isLoopHeader() const { return Loop && Loop->isHeader(Node); }
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| BlockFrequencyInfoImpl.h | 198 /// Contains the data necessary to represent a loop as a pseudo-node once it's
224 bool isHeader(const BlockNode &Node) const {
227 Node);
228 return Node == Nodes[0];
252 BlockNode Node; ///< This node.
256 WorkingData(const BlockNode &Node) : Node(Node), Loop(nullptr) {}
258 bool isLoopHeader() const { return Loop && Loop->isHeader(Node); }
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
| BlockFrequencyInfoImpl.h | 198 /// Contains the data necessary to represent a loop as a pseudo-node once it's
224 bool isHeader(const BlockNode &Node) const {
227 Node);
228 return Node == Nodes[0];
252 BlockNode Node; ///< This node.
256 WorkingData(const BlockNode &Node) : Node(Node), Loop(nullptr) {}
258 bool isLoopHeader() const { return Loop && Loop->isHeader(Node); }
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
| BlockFrequencyInfoImpl.h | 198 /// Contains the data necessary to represent a loop as a pseudo-node once it's
224 bool isHeader(const BlockNode &Node) const {
227 Node);
228 return Node == Nodes[0];
252 BlockNode Node; ///< This node.
256 WorkingData(const BlockNode &Node) : Node(Node), Loop(nullptr) {}
258 bool isLoopHeader() const { return Loop && Loop->isHeader(Node); }
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
| BlockFrequencyInfoImpl.h | 198 /// Contains the data necessary to represent a loop as a pseudo-node once it's
224 bool isHeader(const BlockNode &Node) const {
227 Node);
228 return Node == Nodes[0];
252 BlockNode Node; ///< This node.
256 WorkingData(const BlockNode &Node) : Node(Node), Loop(nullptr) {}
258 bool isLoopHeader() const { return Loop && Loop->isHeader(Node); }
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| BlockFrequencyInfoImpl.h | 198 /// Contains the data necessary to represent a loop as a pseudo-node once it's
224 bool isHeader(const BlockNode &Node) const {
227 Node);
228 return Node == Nodes[0];
252 BlockNode Node; ///< This node.
256 WorkingData(const BlockNode &Node) : Node(Node), Loop(nullptr) {}
258 bool isLoopHeader() const { return Loop && Loop->isHeader(Node); }
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| TextTrieMap.java | 26 private Node _root = new Node();
96 private synchronized void find(Node node, CharIterator chitr, ResultHandler<V> handler) {
97 Iterator<V> values = node.values();
104 Node nextMatch = node.findMatch(chitr);
223 * Inner class representing a text node in the trie.
225 private class Node {
228 private List<Node> _children
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| TextTrieMap.java | 24 private Node _root = new Node();
94 private synchronized void find(Node node, CharIterator chitr, ResultHandler<V> handler) {
95 Iterator<V> values = node.values();
102 Node nextMatch = node.findMatch(chitr);
221 * Inner class representing a text node in the trie.
223 private class Node {
226 private List<Node> _children
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/lib2to3/fixes/ |
| fix_execfile.py | 11 from ..fixer_util import (Comma, Name, Call, LParen, RParen, Dot, Node,
24 def transform(self, node, results):
32 execfile_paren = node.children[-1].children[-1].clone()
35 open_call = Node(syms.power, [Name(u"open"), open_args])
36 read = [Node(syms.trailer, [Dot(), Name(u'read')]),
37 Node(syms.trailer, [LParen(), RParen()])]
52 return Call(Name(u"exec"), args, prefix=node.prefix)
|
| /device/linaro/bootloader/edk2/StdLib/LibC/Uefi/Devices/Utility/ |
| DevSearch.c | 34 @param Node Pointer to the pointer to receive the found Device Node's address.
36 @retval RETURN_SUCCESS The desired Device Node was found.
37 @retval RETURN_INVALID_PARAMETER Both DevName and DevProto are NULL or Node is NULL.
46 OUT DeviceNode **Node
53 if(((DevName == NULL) && (DevProto == NULL)) || (Node == NULL)) {
86 *Node = WorkNode;
102 *Node = WorkNode;
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
| ANTLRMapElement.h | 37 id node; variable
40 @property (retain, getter=getNode, setter=setNode:) id node; variable
44 + (id) newANTLRMapElementWithNode:(NSInteger)aTType Node:(id)aNode;
45 + (id) newANTLRMapElementWithName:(NSString *)aName Node:(id)aNode;
49 - (id) initWithNode:(NSInteger)aTType Node:(id)aNode;
50 - (id) initWithName:(NSString *)aName Node:(id)aNode;
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
| ANTLRMapElement.h | 37 id node; variable
40 @property (retain, getter=getNode, setter=setNode:) id node; variable
44 + (id) newANTLRMapElementWithNode:(NSInteger)aTType Node:(id)aNode;
45 + (id) newANTLRMapElementWithName:(NSString *)aName Node:(id)aNode;
49 - (id) initWithNode:(NSInteger)aTType Node:(id)aNode;
50 - (id) initWithName:(NSString *)aName Node:(id)aNode;
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
| ANTLRMapElement.h | 37 id node; variable
40 @property (retain, getter=getNode, setter=setNode:) id node; variable
44 + (id) newANTLRMapElementWithNode:(NSInteger)aTType Node:(id)aNode;
45 + (id) newANTLRMapElementWithName:(NSString *)aName Node:(id)aNode;
49 - (id) initWithNode:(NSInteger)aTType Node:(id)aNode;
50 - (id) initWithName:(NSString *)aName Node:(id)aNode;
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRMapElement.h | 37 id node; variable
40 @property (retain, getter=getNode, setter=setNode:) id node; variable
44 + (id) newANTLRMapElementWithNode:(NSInteger)aTType Node:(id)aNode;
45 + (id) newANTLRMapElementWithName:(NSString *)aName Node:(id)aNode;
49 - (id) initWithNode:(NSInteger)aTType Node:(id)aNode;
50 - (id) initWithName:(NSString *)aName Node:(id)aNode;
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMNodeIterator.java | 28 import org.w3c.dom.Node;
121 * and allows querying whether a given node would be permitted if it appeared
122 * as our next node, but in the current implementation that would be very
134 /** @return The root node of the NodeIterator, as specified
137 public Node getRoot()
144 /** Return a mask describing which node types are presented via the
152 /** @return the next node in the set and advance the position of the
158 public Node nextNode() throws DOMException
176 public Node previousNode()
|
| /external/llvm/include/llvm/Analysis/ |
| BlockFrequencyInfoImpl.h | 198 /// Contains the data necessary to represent a loop as a pseudo-node once it's
224 bool isHeader(const BlockNode &Node) const {
227 Node);
228 return Node == Nodes[0];
252 BlockNode Node; ///< This node.
256 WorkingData(const BlockNode &Node) : Node(Node), Loop(nullptr) {}
258 bool isLoopHeader() const { return Loop && Loop->isHeader(Node); }
[all...] |
| /external/python/cpython2/Lib/lib2to3/fixes/ |
| fix_execfile.py | 11 from ..fixer_util import (Comma, Name, Call, LParen, RParen, Dot, Node,
24 def transform(self, node, results):
32 execfile_paren = node.children[-1].children[-1].clone()
35 open_call = Node(syms.power, [Name(u"open"), open_args])
36 read = [Node(syms.trailer, [Dot(), Name(u'read')]),
37 Node(syms.trailer, [LParen(), RParen()])]
52 return Call(Name(u"exec"), args, prefix=node.prefix)
|
