| /external/clang/include/clang/Rewrite/ |
| DeltaTree.h | 27 void *Root; // "DeltaTreeNode *"
|
| RewriteRope.h | 150 void /*RopePieceBTreeNode*/ *Root;
158 iterator begin() const { return iterator(Root); }
|
| /external/clang/test/CXX/basic/basic.lookup/basic.lookup.qual/namespace.qual/ |
| p3.cpp | 5 namespace Root {
11 using namespace Root;
15 using namespace Root;
29 using Root::i;
30 using Root::f;
|
| /external/clang/lib/CodeGen/ |
| CodeGenTBAA.h | 47 llvm::MDNode *Root;
50 /// getRoot - This is the mdnode for the root of the metadata type graph
|
| CGObjCMac.cpp | [all...] |
| /external/clang/utils/TableGen/ |
| ClangASTNodesEmitter.h | 34 Record Root;
46 // the record's name plus the base suffix, but if it is the root node and
49 if (&R == &Root && !BaseSuffix.empty())
60 : Records(R), Root(N, SMLoc(), R), BaseSuffix(S)
|
| /external/clang/test/CodeGenCXX/ |
| derived-to-base-conv.cpp | 56 struct Root {
62 struct Base : Root {
|
| /external/llvm/lib/Analysis/IPA/ |
| CallGraph.cpp | 30 // Root is root of the call graph, or the external node if a 'main' function
33 CallGraphNode *Root;
45 BasicCallGraph() : ModulePass(ID), Root(0),
56 Root = 0;
63 if (Root == 0) Root = ExternalCallingNode;
73 OS << "CallGraph Root is: ";
100 // getRoot - Return the root of the call graph, which is either main, or if
103 CallGraphNode *getRoot() { return Root; }
[all...] |
| /frameworks/base/tools/preload/ |
| Root.java | 36 * Root of our data model.
38 public class Root implements Serializable {
149 * Reads Root from a file.
151 static Root fromFile(String fileName)
157 Root root = (Root) oin.readObject(); local
161 return root;
|
| /external/clang/include/clang/Index/ |
| CallGraph.h | 67 /// Root node is the 'main' function or 0.
68 CallGraphNode *Root;
85 CallGraphNode *getRoot() { return Root; }
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| LLVMConventionsChecker.cpp | 215 const CXXRecordDecl *Root;
218 ASTFieldVisitor(const CXXRecordDecl *root, BugReporter &br)
219 : Root(root), BR(br) {}
259 os << "AST class '" << Root->getName() << "' has a field '"
|
| /external/llvm/include/llvm/ADT/ |
| ImmutableMap.h | 72 TreeTy* Root;
75 /// Constructs a map from a pointer to a tree root. In general one
79 explicit ImmutableMap(const TreeTy* R) : Root(const_cast<TreeTy*>(R)) {
80 if (Root) { Root->retain(); }
82 ImmutableMap(const ImmutableMap &X) : Root(X.Root) {
83 if (Root) { Root->retain(); }
86 if (Root != X.Root)
[all...] |
| ImmutableSet.h | 266 // Mutating operations. A tree root can be manipulated as
451 // in an existing root if that root is still marked mutable.
592 /// markImmutable - Clears the mutable bits of a root and all of its
655 inline ImutAVLTreeGenericIterator(const TreeTy* Root) {
656 if (Root) stack.push_back(reinterpret_cast<uintptr_t>(Root));
765 ImutAVLTreeInOrderIterator(const TreeTy* Root) : InternalItr(Root) {
766 if (Root) operator++(); // Advance to first element
[all...] |
| /frameworks/base/tools/localize/ |
| XMLHandler.h | 170 // after it's done, you own everything created and added to root
171 NodeHandler(XMLNode* root, int pretty);
181 inline XMLNode* Root() const { return m_root; }
|
| /external/dropbear/libtommath/ |
| bn.tex | [all...] |
| /external/llvm/include/llvm/CodeGen/ |
| SelectionDAG.h | 145 /// Root - The root of the entire DAG.
146 SDValue Root;
247 /// getRoot - Return the root tag of the SelectionDAG.
249 const SDValue &getRoot() const { return Root; }
257 /// setRoot - Set the current root tag of the SelectionDAG.
261 "DAG root value is not a chain!");
264 Root = N;
267 return Root;
395 SDValue getEHLabel(DebugLoc dl, SDValue Root, MCSymbol *Label)
[all...] |
| /external/llvm/utils/TableGen/ |
| DAGISelMatcherGen.cpp | 207 // If this is the root of the dag we're matching, we emit a redundant opcode
288 // If this is at the root of the pattern, we emit a redundant
332 // If this node is not the root and the subtree underneath it produces a
334 // Beyond that, this means that we're also folding (at least) the root node
353 const TreePatternNode *Root = Pattern.getSrcPattern();
354 if (N != Root) { // Not the root of the pattern.
355 // If there is a node between the root and this node, then we definitely
357 bool NeedCheck = !Root->hasChild(N);
359 // If it *is* an immediate child of the root, we can still need a check i
[all...] |
| AsmMatcherEmitter.cpp | 217 const ClassInfo *Root = this;
218 while (!Root->SuperClasses.empty())
219 Root = Root->SuperClasses.front();
225 return Root == RHSRoot;
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| PromoteMemoryToRegister.cpp | 491 DomTreeNode *Root = DT.getRootNode();
492 DomLevels[Root] = 0;
493 Worklist.push_back(Root);
772 DomTreeNode *Root = RootPair.first;
775 // Walk all dominator tree children of Root, inspecting their CFG edges with
777 // most Root's level are added to the iterated dominance frontier of the
781 Worklist.push_back(Root);
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| BugReporter.cpp | [all...] |
| /external/llvm/lib/Target/XCore/ |
| XCoreISelLowering.cpp | 367 const SDValue *Root = &Base;
373 Root = &Base.getOperand(0);
376 if (isa<FrameIndexSDNode>(*Root)) {
382 if (Root->getOpcode() == XCoreISD::DPRelativeWrapper ||
383 Root->getOpcode() == XCoreISD::CPRelativeWrapper) {
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGBuilder.cpp | [all...] |
| /external/llvm/lib/Target/X86/ |
| X86ISelLowering.cpp | [all...] |
