Searched defs:Root (Results 1 - 25 of 49) sorted by last modified time

12

/external/skia/experimental/PdfViewer/pdfparser/native/pdfapi/
H A DSkPdfFDFTrailerDictionary_autogen.cpp11 SkPdfDictionary* SkPdfFDFTrailerDictionary::Root(SkPdfNativeDoc* doc) { function in class:SkPdfFDFTrailerDictionary
12 SkPdfNativeObject* ret = get("Root", "");
20 return get("Root", "") != NULL;
H A DSkPdfFileTrailerDictionary_autogen.cpp35 SkPdfDictionary* SkPdfFileTrailerDictionary::Root(SkPdfNativeDoc* doc) { function in class:SkPdfFileTrailerDictionary
36 SkPdfNativeObject* ret = get("Root", "");
44 return get("Root", "") != NULL;
/external/pdfium/core/src/fxcodec/lcms2/lcms2-2.6/src/
H A Dcmstypes.c3105 char Root[33]; local
3108 if (io -> Read(io, Root, 32, 1) != 1) return NULL;
3112 if (!cmsAppendNamedColor(v, Root, PCS, Colorant)) goto Error;
3153 char Root[33]; local
3155 if (!cmsNamedColorInfo(NamedColorList, i, Root, NULL, NULL, PCS, Colorant)) return 0;
3156 if (!io ->Write(io, 32 , Root)) return FALSE;
/external/llvm/utils/TableGen/
H A DAsmMatcherEmitter.cpp240 const ClassInfo *Root = this; local
241 while (!Root->SuperClasses.empty())
242 Root = Root->SuperClasses.front();
248 return Root == RHSRoot;
H A DDAGISelMatcherGen.cpp393 const TreePatternNode *Root = Pattern.getSrcPattern(); local
394 if (N != Root) { // Not the root of the pattern.
397 bool NeedCheck = !Root->hasChild(N);
404 const SDNodeInfo &PInfo = CGP.getSDNodeInfo(Root->getOperator());
406 Root->getOperator() == CGP.get_intrinsic_void_sdnode() ||
407 Root->getOperator() == CGP.get_intrinsic_w_chain_sdnode() ||
408 Root->getOperator() == CGP.get_intrinsic_wo_chain_sdnode() ||
/external/llvm/include/llvm/ADT/
H A DImmutableMap.h72 TreeTy* Root; member in class:llvm::ImmutableMap
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) {
284 TreeTy *Root; member in class:llvm::ImmutableMapRef
[all...]
H A DImmutableSet.h660 inline ImutAVLTreeGenericIterator(const TreeTy* Root) { argument
661 if (Root) stack.push_back(reinterpret_cast<uintptr_t>(Root));
765 ImutAVLTreeInOrderIterator(const TreeTy* Root) : InternalItr(Root) { argument
766 if (Root) operator++(); // Advance to first element.
945 TreeTy *Root; member in class:llvm::ImmutableSet
952 explicit ImmutableSet(TreeTy* R) : Root(R) {
953 if (Root) { Root
1122 TreeTy *Root; member in class:llvm::ImmutableSetRef
[all...]
/external/llvm/include/llvm/Analysis/
H A DCallGraph.h83 /// \brief Root is root of the call graph, or the external node if a 'main'
85 CallGraphNode *Root; member in class:llvm::CallGraph
H A DScalarEvolutionExpressions.h586 void visitAll(const SCEV *Root) { argument
587 push(Root);
629 void visitAll(const SCEV *Root, SV& Visitor) { argument
631 T.visitAll(Root);
/external/llvm/include/llvm/CodeGen/
H A DSelectionDAG.h178 /// Root - The root of the entire DAG.
179 SDValue Root; member in class:llvm::SelectionDAG
323 const SDValue &getRoot() const { return Root; }
338 Root = N;
341 return Root;
476 SDValue getEHLabel(SDLoc dl, SDValue Root, MCSymbol *Label);
H A DSelectionDAGISel.h92 /// operand node N of U during instruction selection that starts at Root.
93 virtual bool IsProfitableToFold(SDValue N, SDNode *U, SDNode *Root) const;
96 /// U can be folded during instruction selection that starts at Root.
99 static bool IsLegalToFold(SDValue N, SDNode *U, SDNode *Root,
227 virtual bool CheckComplexPattern(SDNode *Root, SDNode *Parent, SDValue N, argument
/external/llvm/include/llvm/Support/
H A DYAMLParser.h464 /// \brief Root for parsing a node. Returns a single node.
475 if (Root)
476 return Root;
477 return Root = parseBlockNode();
495 Node *Root; member in class:llvm::yaml::Document
/external/llvm/lib/Analysis/IPA/
H A DCallGraph.cpp24 : M(M), Root(nullptr), ExternalCallingNode(getOrInsertFunction(nullptr)),
31 if (!Root)
32 Root = ExternalCallingNode;
61 if (Root) // Found multiple external mains? Don't pick one.
62 Root = ExternalCallingNode;
64 Root = Node; // Found a main, keep track of it!
94 OS << "CallGraph Root is: ";
95 if (Function *F = Root->getFunction())
98 OS << "<<null function: 0x" << Root << ">>\n"; local
/external/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAG.cpp934 Root(getEntryNode()), NewNodesMustHaveLegalTypes(false),
993 Root = getEntryNode();
1654 SDValue SelectionDAG::getEHLabel(SDLoc dl, SDValue Root, MCSymbol *Label) { argument
1656 SDValue Ops[] = { Root };
1664 dl.getDebugLoc(), Root, Label);
H A DSelectionDAGISel.cpp1732 SDNode *Root, SmallPtrSet<SDNode*, 16> &Visited,
1757 if (Use == ImmedUse || Use == Root)
1759 assert(N != Root);
1764 if (findNonImmUse(N, Def, ImmedUse, Root, Visited, IgnoreChains))
1771 /// operand node N of U during instruction selection that starts at Root.
1773 SDNode *Root) const {
1779 /// U can be folded during instruction selection that starts at Root.
1780 bool SelectionDAGISel::IsLegalToFold(SDValue N, SDNode *U, SDNode *Root, argument
1785 // If Root use can somehow reach N through a path that that doesn't contain
1787 // diagram, Root ca
1731 findNonImmUse(SDNode *Use, SDNode* Def, SDNode *ImmedUse, SDNode *Root, SmallPtrSet<SDNode*, 16> &Visited, bool IgnoreChains) argument
[all...]
/external/llvm/lib/IR/
H A DMDBuilder.cpp66 MDNode *Root = MDNode::get(Context, Dummy); local
71 Root->replaceOperandWith(0, Root);
75 return Root;
/external/llvm/lib/Support/
H A DIntervalMap.cpp19 void Path::replaceRoot(void *Root, unsigned Size, IdxPair Offsets) { argument
21 path.front() = Entry(Root, Size, Offsets.first);
/external/llvm/lib/Target/ARM/
H A DARMISelLowering.cpp2688 SDValue &Root, SelectionDAG &DAG,
2701 SDValue ArgValue = DAG.getCopyFromReg(Root, dl, Reg, MVT::i32);
2710 ArgValue2 = DAG.getLoad(MVT::i32, dl, Root, FIN,
2715 ArgValue2 = DAG.getCopyFromReg(Root, dl, Reg, MVT::i32);
2687 GetF64FormalArgument(CCValAssign &VA, CCValAssign &NextVA, SDValue &Root, SelectionDAG &DAG, SDLoc dl) const argument
/external/llvm/lib/Target/NVPTX/
H A DNVPTXISelLowering.cpp1637 SDValue Root = DAG.getRoot(); local
1747 p = DAG.getExtLoad(ExtOp, dl, Ins[InsIdx].VT, Root, srcAddr,
1751 p = DAG.getLoad(partVT, dl, Root, srcAddr,
1782 EltVT, dl, Root, SrcAddr, MachinePointerInfo(SrcValue), false,
1802 VecVT, dl, Root, SrcAddr, MachinePointerInfo(SrcValue), false,
1846 VecVT, dl, Root, SrcAddr, MachinePointerInfo(SrcValue), false,
1880 p = DAG.getExtLoad(ExtOp, dl, Ins[InsIdx].VT, Root, Arg,
1884 p = DAG.getLoad(Ins[InsIdx].VT, dl, Root, Arg,
/external/llvm/lib/Target/X86/
H A DX86ISelDAGToDAG.cpp174 bool IsProfitableToFold(SDValue N, SDNode *U, SDNode *Root) const override;
218 bool SelectScalarSSELoad(SDNode *Root, SDValue N,
307 X86DAGToDAGISel::IsProfitableToFold(SDValue N, SDNode *U, SDNode *Root) const {
317 if (U == Root) {
1355 bool X86DAGToDAGISel::SelectScalarSSELoad(SDNode *Root, argument
1364 IsProfitableToFold(N.getOperand(0), N.getNode(), Root) &&
1365 IsLegalToFold(N.getOperand(0), N.getNode(), Root, OptLevel)) {
1381 IsProfitableToFold(N.getOperand(0), N.getNode(), Root) &&
1382 IsLegalToFold(N.getOperand(0), N.getNode(), Root, OptLevel)) {
/external/llvm/lib/Transforms/Scalar/
H A DGVN.cpp714 const BasicBlockEdge &Root);
715 bool propagateEquality(Value *LHS, Value *RHS, const BasicBlockEdge &Root);
2046 const BasicBlockEdge &Root) {
2052 if (DT->dominates(Root, U)) {
2078 /// dominated by 'Root'. Exploit this, for example by replacing 'LHS' with
2081 const BasicBlockEdge &Root) {
2086 // DT->dominates(Root, Root.getEnd());
2087 bool RootDominatesEnd = isOnlyReachableViaThisEdge(Root, DT);
2130 addToLeaderTable(LVN, RHS, Root
2045 replaceAllDominatedUsesWith(Value *From, Value *To, const BasicBlockEdge &Root) argument
2080 propagateEquality(Value *LHS, Value *RHS, const BasicBlockEdge &Root) argument
[all...]
H A DLoopRerollPass.cpp325 Instruction * Root,
473 Instruction *Root, const SmallInstructionSet &Exclude,
476 SmallInstructionVector Queue(1, Root);
472 collectInLoopUserSet(Loop *L, Instruction *Root, const SmallInstructionSet &Exclude, const SmallInstructionSet &Final, DenseSet<Instruction *> &Users) argument
H A DSROA.cpp605 Instruction *hasUnsafePHIOrSelectUse(Instruction *Root, uint64_t &Size) { argument
612 Visited.insert(Root);
613 Uses.push_back(std::make_pair(cast<Instruction>(*U), Root));
H A DTailRecursionElimination.cpp172 void walk(Value *Root) { argument
184 AddUsesToWorklist(Root);
/external/llvm/lib/Transforms/Utils/
H A DPromoteMemoryToRegister.cpp579 DomTreeNode *Root = DT.getRootNode(); local
580 DomLevels[Root] = 0;
581 Worklist.push_back(Root);
873 DomTreeNode *Root = RootPair.first; local
876 // Walk all dominator tree children of Root, inspecting their CFG edges with
878 // most Root's level are added to the iterated dominance frontier of the
882 Worklist.push_back(Root);

Completed in 683 milliseconds

12