Searched defs:Use (Results 1 - 25 of 43) sorted by relevance

12

/external/clang/test/Modules/
H A Dmerge-using-decls.cpp18 template<typename T> int Use() { function
27 return Use<C<T> >() + Use<D<T> >() + Use<E<T> >() + Use<F<T> >(); // expected-note 0-2{{instantiation of}}
/external/pdfium/core/src/fxge/ge/
H A Dfx_ge.cpp2 // Use of this source code is governed by a BSD-style license that can be
41 void CFX_GEModule::Use(CFX_GEModule* pModule) function in class:CFX_GEModule
/external/llvm/include/llvm/IR/
H A DUse.h1 //===-- llvm/Use.h - Definition of the Use class ----------------*- C++ -*-===//
11 /// This defines the Use class. The Use class represents the operand of an
12 /// instruction or some other User instance which refers to a Value. The Use
15 /// Pointer tagging is used to efficiently find the User corresponding to a Use
16 /// without having to store a User pointer in every Use. A User is preceded in
18 /// one of the fields (Prev) of the Use class are used to encode offsets to be
19 /// able to find that User given a pointer to any Use. For details, see:
39 class Use;
69 class Use { class in namespace:llvm
91 Use(PrevPtrTag tag) : Val(nullptr) { Prev.setInt(tag); } function in class:llvm::Use
[all...]
/external/google-breakpad/src/testing/gtest/test/
H A Dgtest-linked_ptr_test.cc51 virtual void Use() { *history << "A" << mynum << " use\n"; } function in class:__anon5260::A
61 virtual void Use() { *history << "B" << mynum << " use\n"; } function in class:__anon5260::B
80 // Use explicit function call notation here to suppress self-assign warning.
110 a3->Use();
111 a4->Use();
112 a5->Use();
113 a6->Use();
114 b0->Use();
115 (*b0).Use();
116 b0.get()->Use();
[all...]
/external/gtest/test/
H A Dgtest-linked_ptr_test.cc51 virtual void Use() { *history << "A" << mynum << " use\n"; } function in class:__anon5371::A
61 virtual void Use() { *history << "B" << mynum << " use\n"; } function in class:__anon5371::B
80 // Use explicit function call notation here to suppress self-assign warning.
110 a3->Use();
111 a4->Use();
112 a5->Use();
113 a6->Use();
114 b0->Use();
115 (*b0).Use();
116 b0.get()->Use();
[all...]
/external/protobuf/gtest/test/
H A Dgtest-linked_ptr_test.cc51 virtual void Use() { *history << "A" << mynum << " use\n"; } function in class:__anon13430::A
61 virtual void Use() { *history << "B" << mynum << " use\n"; } function in class:__anon13430::B
109 a3->Use();
110 a4->Use();
111 a5->Use();
112 a6->Use();
113 b0->Use();
114 (*b0).Use();
115 b0.get()->Use();
118 a0->Use();
[all...]
/external/llvm/lib/CodeGen/
H A DLiveInterval.cpp92 VNInfo *extendInBlock(SlotIndex StartIdx, SlotIndex Use) { argument
96 impl().findInsertPos(Segment(Use.getPrevSlot(), Use, nullptr));
102 if (I->end < Use)
103 extendSegmentEndTo(I, Use);
323 // Use the segment set, if it is available.
395 // Use binary searches to find initial positions.
493 // Use the segment set, if it is available.
512 // Use the segment set, if it is available.
H A DLiveRangeCalc.cpp222 void LiveRangeCalc::extend(LiveRange &LR, SlotIndex Use, unsigned PhysReg) { argument
223 assert(Use.isValid() && "Invalid SlotIndex");
227 MachineBasicBlock *UseMBB = Indexes->getMBBFromIndex(Use.getPrevSlot());
228 assert(UseMBB && "No MBB at Use");
231 if (LR.extendInBlock(Indexes->getMBBStartIdx(UseMBB), Use))
234 // Find the single reaching def, or determine if Use is jointly dominated by
238 if (findReachingDefs(LR, *UseMBB, Use, PhysReg))
258 SlotIndex Use, unsigned PhysReg) {
275 llvm_unreachable("Use not jointly dominated by defs.");
320 Use
257 findReachingDefs(LiveRange &LR, MachineBasicBlock &UseMBB, SlotIndex Use, unsigned PhysReg) argument
[all...]
H A DMachineInstr.cpp655 assert(MBB && "Use MachineInstrBuilder to add operands to dangling instrs");
657 assert(MF && "Use MachineInstrBuilder to add operands to dangling instrs");
1150 bool Use = false; local
1159 Use |= !MO.isUndef();
1167 return std::make_pair(Use || (PartDef && !FullDef), PartDef || FullDef);
1224 /// Use and def operands can be tied together, indicated by a non-zero TiedTo
1240 assert(!UseMO.isTied() && "Use is already tied to another def");
1905 [&](unsigned Use) { return TRI.regsOverlap(Use, Reg); }))
/external/llvm/lib/Target/AArch64/
H A DAArch64PromoteConstant.cpp118 typedef SmallVector<Use *, 4> Uses;
125 /// Find the closest point that dominates the given Use.
126 Instruction *findInsertionPoint(Use &Use);
133 /// \param Use the use to be added into the list of dominated uses
138 bool isDominated(Instruction *NewPt, Use &Use, InsertionPoints &InsertPts);
145 /// \param Use the use to be added into the list of dominated uses
152 bool tryAndMerge(Instruction *NewPt, Use &Use, InsertionPoint
186 appendAndTransferDominatedUses(Instruction *NewPt, Use &Use, InsertionPoints::iterator &IPI, InsertionPoints &InsertPts) argument
331 findInsertionPoint(Use &Use) argument
342 isDominated(Instruction *NewPt, Use &Use, InsertionPoints &InsertPts) argument
368 tryAndMerge(Instruction *NewPt, Use &Use, InsertionPoints &InsertPts) argument
[all...]
H A DAArch64CollectLOH.cpp333 // Use the global register ID when querying APIs external to this
543 /// Build the Use to Defs information and filter out obvious non-LOH candidates.
718 static bool registerADRCandidate(const MachineInstr &Use, argument
727 if (Use.getOpcode() != AArch64::ADDXri &&
728 (Use.getOpcode() != AArch64::LDRXui ||
729 !(Use.getOperand(2).getTargetFlags() & AArch64II::MO_GOT)))
731 InstrToInstrs::const_iterator It = UseToDefs.find(&Use);
749 assert((!InvolvedInLOHs || InvolvedInLOHs->insert(&Use)) &&
751 DEBUG(dbgs() << "Record AdrpAdd\n" << Def << '\n' << Use << '\n'); local
755 Args.push_back(&Use);
[all...]
/external/v8/src/compiler/
H A Draw-machine-assembler.cc2 // Use of this source code is governed by a BSD-style license that can be
64 schedule()->AddGoto(CurrentBlock(), Use(label));
73 schedule()->AddBranch(CurrentBlock(), branch, Use(true_val), Use(false_val));
134 BasicBlock* RawMachineAssembler::Use(Label* label) { function in class:v8::internal::compiler::RawMachineAssembler
H A Dinstruction-selector-impl.h2 // Use of this source code is governed by a BSD-style license that can be
56 InstructionOperand* Use(Node* node) { function in class:v8::internal::compiler::OperandGenerator
57 return Use(node,
63 return Use(node, new (zone())
68 // Use register or operand for the node. If a register is chosen, it won't
71 return Use(node, new (zone()) UnallocatedOperand(UnallocatedOperand::ANY));
74 // Use a unique register for the node that does not alias any temporary or
77 return Use(node, new (zone())
82 return Use(node, new (zone())
88 return Use(nod
171 UnallocatedOperand* Use(Node* node, UnallocatedOperand* operand) { function in class:v8::internal::compiler::OperandGenerator
[all...]
/external/llvm/lib/Target/R600/
H A DAMDGPUPromoteAlloca.cpp86 Instruction *Use = dyn_cast<Instruction>(*U); local
87 if (!Use)
89 if (Use->getParent()->getParent() == &F)
/external/llvm/lib/Target/SystemZ/
H A DSystemZElimCompare.cpp40 : Def(false), Use(false), IndirectDef(false), IndirectUse(false) {}
45 Use |= Other.Use;
50 explicit operator bool() const { return Def || Use; }
55 bool Use; member in struct:__anon10883::Reference
147 Ref.Use = true;
341 if (!CCRefs.Use && !SrcRefs && convertToBRCT(MI, Compare, CCUsers)) {
356 if (CCRefs.Use && CCRefs.Def)
454 if (CompleteCCUsers && CCRefs.Use)
/external/clang/test/SemaTemplate/
H A Ddependent-names.cpp217 void Use() { function in namespace:PR10053::my_file2
240 void Use() { function in namespace:PR10053::my_file2_a
260 void Use() { function in namespace:PR10053::unary
/external/llvm/lib/Support/
H A DYAMLTraits.cpp414 bool Output::mapTag(StringRef Tag, bool Use) { argument
415 if (Use) {
419 return Use;
/external/llvm/lib/Target/ARM/
H A DThumb2SizeReduction.cpp151 bool canAddPseudoFlagDep(MachineInstr *Use, bool IsSelfLoop);
249 Thumb2SizeReduce::canAddPseudoFlagDep(MachineInstr *Use, bool FirstInSelfLoop) { argument
269 for (const MachineOperand &MO : Use->operands()) {
283 if (Use->getOpcode() == ARM::t2MOVi ||
284 Use->getOpcode() == ARM::t2MOVi16)
/external/llvm/lib/Transforms/IPO/
H A DDeadArgumentElimination.cpp147 Liveness MarkIfNotLive(RetOrArg Use, UseVector &MaybeLiveUses);
148 Liveness SurveyUse(const Use *U, UseVector &MaybeLiveUses,
367 for (Use &U : Fn.uses()) {
416 /// MarkIfNotLive - This checks Use for liveness in LiveValues. If Use is not
417 /// live, it adds Use to the MaybeLiveUses argument. Returns the determined
418 /// liveness of Use.
419 DAE::Liveness DAE::MarkIfNotLive(RetOrArg Use, UseVector &MaybeLiveUses) { argument
421 if (LiveFunctions.count(Use.F) || LiveValues.count(Use))
448 RetOrArg Use = CreateRet(F, RetValNum); local
454 RetOrArg Use = CreateRet(F, i); local
506 RetOrArg Use = CreateArg(F, ArgNo); local
[all...]
/external/clang/lib/Analysis/
H A DUninitializedValues.cpp309 Use, enumerator in enum:__anon907::ClassifyRefs::Class
424 classify(BO->getLHS(), Use);
433 classify(UO->getSubExpr(), Use);
448 classify(CE->getArg(0), Use);
474 classify(CE->getSubExpr(), Use);
527 UninitUse Use(ex, isAlwaysUninit(v));
530 if (Use.getKind() == UninitUse::Always)
531 return Use;
591 Use.setUninitAfterCall();
610 Use
[all...]
/external/v8/test/cctest/compiler/
H A Dtest-simplified-lowering.cc2 // Use of this source code is governed by a BSD-style license that can be
721 Node* Use(Node* node, MachineType type) { function in class:TestingGraph
780 Node* use = t.Use(inv, kRepTagged);
812 Node* use = t.Use(inv, kRepTagged);
829 Node* use = t.Use(cnv, kMachInt32);
841 Node* use = t.Use(cnv, kMachInt32);
856 Node* use = t.Use(cnv, kMachAnyTagged);
869 Node* use = t.Use(cnv, kMachAnyTagged);
977 Node* use = t.Use(trunc, kRepTagged);
988 Node* use = t.Use(trun
[all...]
/external/clang/include/clang/Sema/
H A DScopeInfo.h265 WeakUseTy(const Expr *Use, bool IsRead) : Rep(Use, IsRead) {} argument
/external/clang/lib/Sema/
H A DAnalysisBasedWarnings.cpp664 static void DiagUninitUse(Sema &S, const VarDecl *VD, const UninitUse &Use, argument
668 switch (Use.getKind()) {
670 S.Diag(Use.getUser()->getLocStart(), diag::warn_uninit_var)
672 << Use.getUser()->getSourceRange();
679 << (Use.getKind() == UninitUse::AfterDecl ? 4 : 5)
682 S.Diag(Use.getUser()->getLocStart(), diag::note_uninit_var_use)
683 << IsCapturedByBlock << Use.getUser()->getSourceRange();
694 for (UninitUse::branch_iterator I = Use.branch_begin(), E = Use.branch_end();
696 assert(Use
836 DiagnoseUninitializedUse(Sema &S, const VarDecl *VD, const UninitUse &Use, bool alwaysReportSelfInit = false) argument
1392 UninitUse Use = hasSelfInit ? UninitUse(U.getUser(), false) : U; local
[all...]
/external/llvm/lib/Target/Hexagon/
H A DHexagonHardwareLoops.cpp920 MachineOperand &Use = *J; local
921 MachineInstr *UseMI = Use.getParent();
954 MachineOperand &Use = *I; local
958 if (Use.isDebug())
/external/llvm/lib/Transforms/Scalar/
H A DIndVarSimplify.cpp415 // Use a WeakVH to observe whether this happens.
706 /// caching Use* pointers.
766 Instruction *Use);
797 Instruction *Use) {
799 IRBuilder<> Builder(Use);
801 for (const Loop *L = LI->getLoopFor(Use->getParent());
1540 // narrower is likely a dead phi that has been widened. Use the wider phi
1783 for (Use &U : I->uses()) {
796 getExtend(Value *NarrowOper, Type *WideType, bool IsSigned, Instruction *Use) argument

Completed in 916 milliseconds

12