Searched refs:Use (Results 1 - 25 of 476) sorted by relevance

1234567891011>>

/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:
38 class Use;
68 class Use { class in namespace:llvm
90 Use(PrevPtrTag tag) : Val(nullptr) { Prev.setInt(tag); } function in class:llvm::Use
[all...]
H A DOperandTraits.h26 /// FixedNumOperandTraits - determine the allocation regime of the Use array
27 /// when it is a prefix to the User object, and the number of Use objects is
32 static Use *op_begin(SubClass* U) {
33 return reinterpret_cast<Use*>(U) - ARITY;
35 static Use *op_end(SubClass* U) {
36 return reinterpret_cast<Use*>(U);
61 /// VariadicOperandTraits - determine the allocation regime of the Use array
62 /// when it is a prefix to the User object, and the number of Use objects is
67 static Use *op_begin(SubClass* U) {
68 return reinterpret_cast<Use*>(
[all...]
H A DUser.h68 User(Type *ty, unsigned vty, Use *, unsigned NumOps)
91 /// \brief Free memory allocated for User and Use objects.
102 template <int Idx, typename U> static Use &OpFrom(const U *that) {
107 template <int Idx> Use &Op() {
110 template <int Idx> const Use &Op() const {
114 Use *&getHungOffOperands() { return *(reinterpret_cast<Use **>(this) - 1); }
116 Use *getIntrusiveOperands() {
117 return reinterpret_cast<Use *>(this) - NumUserOperands;
120 void setOperandList(Use *NewLis
[all...]
/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/llvm/lib/IR/
H A DUse.cpp1 //===-- Use.cpp - Implement the Use class ---------------------------------===//
10 #include "llvm/IR/Use.h"
17 void Use::swap(Use &RHS) {
41 User *Use::getUser() const {
42 const Use *End = getImpliedUser();
45 : reinterpret_cast<User *>(const_cast<Use *>(End));
48 unsigned Use::getOperandNo() const {
57 Use *Us
[all...]
H A DUser.cpp46 static_assert(AlignOf<Use>::Alignment >= AlignOf<Use::UserRef>::Alignment,
48 static_assert(AlignOf<Use::UserRef>::Alignment >=
54 size_t size = N * sizeof(Use) + sizeof(Use::UserRef);
57 Use *Begin = static_cast<Use*>(::operator new(size));
58 Use *End = Begin + N;
59 (void) new(End) Use::UserRef(const_cast<User*>(this), 1);
60 setOperandList(Use
[all...]
/external/valgrind/none/tests/
H A Dcmdline3.stderr.exp2 valgrind: Use --help for more information.
H A Dcmdline4.stderr.exp2 valgrind: Use --help for more information or consult the user manual.
/external/valgrind/memcheck/tests/
H A Dmanuel2.stderr.exp0 Use of uninitialised value of size 4
/external/llvm/unittests/IR/
H A DWaymarkTest.cpp37 const Use *U = &A->getOperandUse(0);
38 const Use *Ue = &A->getOperandUse(22);
47 Use* many = (Use*)calloc(sizeof(Use), 8212 + 1);
49 Use::initTags(many, many + 8212);
50 for (Use *U = many, *Ue = many + 8212 - 1; U != Ue; ++U)
/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...]
/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:__anon6248::A
61 virtual void Use() { *history << "B" << mynum << " use\n"; } function in class:__anon6248::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:__anon6360::A
61 virtual void Use() { *history << "B" << mynum << " use\n"; } function in class:__anon6360::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/libchrome/base/memory/
H A Dlinked_ptr_unittest.cc2 // Use of this source code is governed by a BSD-style license that can be
21 virtual void Use() { history += base::StringPrintf("A%d use\n", mynum); } function in struct:__anon9016::A
29 void Use() override { history += base::StringPrintf("B%d use\n", mynum); }
66 a3->Use();
67 a4->Use();
68 a5->Use();
69 a6->Use();
70 b0->Use();
71 (*b0).Use();
72 b0.get()->Use();
[all...]
/external/llvm/include/llvm/Analysis/
H A DCaptureTracking.h20 class Use;
67 virtual bool shouldExplore(const Use *U);
72 virtual bool captured(const Use *U) = 0;
/external/protobuf/gtest/test/
H A Dgtest-linked_ptr_test.cc51 virtual void Use() { *history << "A" << mynum << " use\n"; } function in class:__anon16270::A
61 virtual void Use() { *history << "B" << mynum << " use\n"; } function in class:__anon16270::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/vulkan-validation-layers/tests/gtest-1.7.0/test/
H A Dgtest-linked_ptr_test.cc51 virtual void Use() { *history << "A" << mynum << " use\n"; } function in class:__anon20476::A
61 virtual void Use() { *history << "B" << mynum << " use\n"; } function in class:__anon20476::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/clang/include/clang/Tooling/Core/
H A DLookup.h33 /// \param Use The nested name to be replaced.
40 std::string replaceNestedName(const NestedNameSpecifier *Use,
/external/kernel-headers/original/uapi/asm-mips/asm/
H A Dsgidefs.h18 #error Use a Linux compiler or give up.
/external/skia/src/svg/parser/
H A DSkSVGUse.h5 * Use of this source code is governed by a BSD-style license that can be
16 DECLARE_SVG_INFO(Use);
/external/webrtc/webrtc/base/
H A Dratelimiter.cc4 * Use of this source code is governed by a BSD-style license
20 void RateLimiter::Use(size_t used, double time) { function in class:rtc::RateLimiter
H A Dratelimiter_unittest.cc4 * Use of this source code is governed by a BSD-style license
30 limiter.Use(1000, monday);
37 limiter.Use(1000, monday);
48 limiter.Use(1000, tuesday);
53 limiter.Use(1000, thursday);
/external/v8/src/compiler/
H A Dnode.cc2 // Use of this source code is governed by a BSD-style license that can be
13 sizeof(OutOfLineInputs) + capacity * (sizeof(Node*) + sizeof(Use));
16 reinterpret_cast<OutOfLineInputs*>(raw_buffer + capacity * sizeof(Use));
23 void Node::OutOfLineInputs::ExtractFrom(Use* old_use_ptr, Node** old_input_ptr,
27 Use* new_use_ptr = reinterpret_cast<Use*>(this) - 1;
31 Use::InputIndexField::encode(current) | Use::InlineField::encode(false);
55 Use* use_ptr;
84 use_ptr = reinterpret_cast<Use*>(outlin
[all...]
/external/icu/icu4c/source/
H A DrunConfigureICU37 AIX Use the IBM Visual Age xlc_r/xlC_r compilers on AIX
38 AIX/GCC Use the GNU gcc/g++ compilers on AIX
39 Cygwin Use the GNU gcc/g++ compilers on Cygwin
40 Cygwin/MSVC Use the Microsoft Visual C++ compiler on Cygwin
41 Cygwin/MSVC2005 Use the Microsoft Visual C++ 2005 compiler on Cygwin
42 Cygwin/ICL Use the Intel C++ compiler on Cygwin
43 FreeBSD Use the clang/clang++ or GNU gcc/g++ compilers on FreeBSD
44 HP-UX/ACC Use the HP ANSI C/Advanced C++ compilers on HP-UX 11
45 IBMi Use the iCC compilers on IBM i, i5/OS, OS/400
46 Linux Use th
[all...]
/external/llvm/lib/Target/Hexagon/
H A DHexagonOptimizeSZextends.cpp81 Instruction* Use = cast<Instruction>(*UI); local
82 SExtInst* SI = new SExtInst(&Arg, Use->getType());
84 (EVT::getEVT(Use->getType())));
86 Use->replaceAllUsesWith(SI);
89 Use->eraseFromParent();
135 const Use &TheUse = UI.getUse();

Completed in 1514 milliseconds

1234567891011>>