Home
last modified time | relevance | path

Searched refs:First (Results 1 - 25 of 199) sorted by relevance

12345678

/third_party/vk-gl-cts/framework/common/
H A DtcuEither.hpp23 * \brief Template class that is either type of First or Second.
32 * \brief Object containing Either First or Second type of object
34 * \note Type First and Second are always aligned to same alignment as
36 * \note This type always uses at least sizeof(bool) + max(sizeof(First*),
39 template<typename First, typename Second>
43 Either (const First& first);
47 Either (const Either<First, Second>& other);
48 Either& operator= (const Either<First, Second>& other);
50 Either& operator= (const First& first);
56 const First
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Demangle/
H A DStringView.h24 const char *First; member in StringView
31 StringView(const char (&Str)[N]) : First(Str), Last(Str + N - 1) {} in StringView()
33 : First(First_), Last(Last_) {} in StringView()
35 : First(First_), Last(First_ + Len) {} in StringView()
36 StringView(const char *Str) : First(Str), Last(Str + std::strlen(Str)) {} in StringView()
37 StringView() : First(nullptr), Last(nullptr) {} in StringView()
48 if (const void *P = ::memchr(First + FindBegin, C, size() - FindBegin)) in find()
49 return size_t(static_cast<const char *>(P) - First); in find()
59 return StringView(First + From, First in substr()
[all...]
H A DItaniumDemangle.h1890 const Node *First; member in BracedRangeExpr
1895 : Node(KBracedRangeExpr), First(First_), Last(Last_), Init(Init_) {} in BracedRangeExpr()
1897 template<typename Fn> void match(Fn F) const { F(First, Last, Init); } in match()
1901 First->print(S);
2176 T* First = nullptr; member in PODSmallVector
2181 bool isInline() const { return First == Inline; } in isInline()
2184 First = Inline; in clearInline()
2195 std::copy(First, Last, Tmp); in reserve()
2196 First = Tmp; in reserve()
2198 First in reserve()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
H A DSwitchLoweringUtils.cpp21 unsigned First, unsigned Last) { in getJumpTableRange()
22 assert(Last >= First); in getJumpTableRange()
23 const APInt &LowCase = Clusters[First].Low->getValue(); in getJumpTableRange()
35 unsigned First, unsigned Last) { in getJumpTableNumCases()
36 assert(Last >= First); in getJumpTableNumCases()
37 assert(TotalCases[Last] >= TotalCases[First]); in getJumpTableNumCases()
39 TotalCases[Last] - (First == 0 ? 0 : TotalCases[First - 1]); in getJumpTableNumCases()
169 for (unsigned First = 0, Last; First < in findJumpTables()
20 getJumpTableRange(const CaseClusterVector &Clusters, unsigned First, unsigned Last) getJumpTableRange() argument
34 getJumpTableNumCases(const SmallVectorImpl<unsigned> &TotalCases, unsigned First, unsigned Last) getJumpTableNumCases() argument
187 buildJumpTable(const CaseClusterVector &Clusters, unsigned First, unsigned Last, const SwitchInst *SI, MachineBasicBlock *DefaultMBB, CaseCluster &JTCluster) buildJumpTable() argument
361 buildBitTests(CaseClusterVector &Clusters, unsigned First, unsigned Last, const SwitchInst *SI, CaseCluster &BTCluster) buildBitTests() argument
[all...]
H A DInterferenceCache.cpp165 BI->First = BI->Last = SlotIndex(); in update()
175 if (!BI->First.isValid() || StartI < BI->First) in update()
176 BI->First = StartI; in update()
188 if (!BI->First.isValid() || StartI < BI->First) in update()
189 BI->First = StartI; in update()
195 SlotIndex Limit = BI->First.isValid() ? BI->First : Stop; in update()
200 BI->First in update()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
H A Dilist_base.h44 static void removeRangeImpl(node_base_type &First, node_base_type &Last) { in removeRangeImpl() argument
45 node_base_type *Prev = First.getPrev(); in removeRangeImpl()
51 First.setPrev(nullptr); in removeRangeImpl()
55 static void transferBeforeImpl(node_base_type &Next, node_base_type &First, in transferBeforeImpl() argument
57 if (&Next == &Last || &First == &Last) in transferBeforeImpl()
61 assert(&Next != &First && in transferBeforeImpl()
68 First.getPrev()->setNext(&Last); in transferBeforeImpl()
69 Last.setPrev(First.getPrev()); in transferBeforeImpl()
71 // Splice [First, Final] into its new list/position. in transferBeforeImpl()
74 First in transferBeforeImpl()
84 removeRange(T &First, T &Last) removeRange() argument
88 transferBefore(T &Next, T &First, T &Last) transferBefore() argument
[all...]
H A Dsimple_ilist.h162 void insert(iterator I, Iterator First, Iterator Last) { in insert() argument
163 for (; First != Last; ++First) in insert()
164 insert(I, *First); in insert()
201 iterator erase(iterator First, iterator Last) { in erase() argument
202 list_base_type::removeRange(*First.getNodePtr(), *Last.getNodePtr()); in erase()
217 iterator eraseAndDispose(iterator First, iterator Last, Disposer dispose) { in eraseAndDispose() argument
218 while (First != Last) in eraseAndDispose()
219 First = eraseAndDispose(First, dispos in eraseAndDispose()
244 splice(iterator I, simple_ilist &, iterator First, iterator Last) splice() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A Dilist_base.h41 static void removeRangeImpl(node_base_type &First, node_base_type &Last) { in removeRangeImpl() argument
42 node_base_type *Prev = First.getPrev(); in removeRangeImpl()
48 First.setPrev(nullptr); in removeRangeImpl()
52 static void transferBeforeImpl(node_base_type &Next, node_base_type &First, in transferBeforeImpl() argument
54 if (&Next == &Last || &First == &Last) in transferBeforeImpl()
58 assert(&Next != &First && in transferBeforeImpl()
65 First.getPrev()->setNext(&Last); in transferBeforeImpl()
66 Last.setPrev(First.getPrev()); in transferBeforeImpl()
68 // Splice [First, Final] into its new list/position. in transferBeforeImpl()
71 First in transferBeforeImpl()
81 removeRange(T &First, T &Last) removeRange() argument
85 transferBefore(T &Next, T &First, T &Last) transferBefore() argument
[all...]
H A Dsimple_ilist.h166 void insert(iterator I, Iterator First, Iterator Last) { in insert() argument
167 for (; First != Last; ++First) in insert()
168 insert(I, *First); in insert()
205 iterator erase(iterator First, iterator Last) { in erase() argument
206 list_base_type::removeRange(*First.getNodePtr(), *Last.getNodePtr()); in erase()
221 iterator eraseAndDispose(iterator First, iterator Last, Disposer dispose) { in eraseAndDispose() argument
222 while (First != Last) in eraseAndDispose()
223 First = eraseAndDispose(First, dispos in eraseAndDispose()
248 splice(iterator I, simple_ilist &, iterator First, iterator Last) splice() argument
[all...]
H A DPointerUnion.h165 // want PointerUnion to be a 'template <typename First, typename ...Rest>'
168 using First = typename pointer_union_detail::GetFirstType<PTs...>::type;
209 First const *getAddrOfPtr1() const {
215 First *getAddrOfPtr1() {
216 assert(is<First>() && "Val is not the first pointer");
218 PointerLikeTypeTraits<First>::getAsVoidPointer(get<First>()) ==
221 return const_cast<First *>(
222 reinterpret_cast<const First *>(this->Val.getAddrOfPointer()));
/third_party/typescript/tests/baselines/reference/
H A DgenericCapturingFunctionNarrowing.js2 function needsToNarrowTheType<First extends { foo: string }, Second extends { bar: string }, SubFirst extends First, SubFirstMore extends First & {other: string}>(thing: First | SubFirst | SubFirstMore | Second) {
8 console.log(thing.bar); // Error: Property 'bar' does not exist on type 'First | Second'.
11 function hasAFoo(value: First | Second): value is First {
23 console.log(thing.bar); // Error: Property 'bar' does not exist on type 'First | Second'.
H A DenumAssignmentCompat3.js2 namespace First {
58 var abc: First.E;
93 var First; variable
94 (function (First) {
100 })(E = First.E || (First.E = {}));
101 })(First || (First = {}));
/third_party/skia/third_party/externals/swiftshader/third_party/subzero/src/
H A DIceRangeSpec.cpp39 /// Helper function to parse "X" or "X:Y" into First and Last.
49 void getRange(const std::string &Token, uint32_t *First, uint32_t *Last) { in getRange() argument
53 *First = std::stoul(Tokens[0]); in getRange()
54 *Last = *First + 1; in getRange()
56 *First = Tokens[0].empty() ? 0 : std::stoul(Tokens[0]); in getRange()
61 if (*First >= *Last) { in getRange()
80 uint32_t First = 0, Last = 0; in record() local
81 getRange(Token, &First, &Last); in record()
83 D->AllFrom = std::min(D->AllFrom, First); in record()
87 D->Numbers.set(First, Las in record()
[all...]
/third_party/protobuf/src/google/protobuf/stubs/
H A Dhash.h92 template <typename First, typename Second>
93 struct hash<std::pair<First, Second> > {
94 inline size_t operator()(const std::pair<First, Second>& key) const { in operator ()()
95 size_t first_hash = hash<First>()(key.first); in operator ()()
105 inline bool operator()(const std::pair<First, Second>& a, in operator ()()
106 const std::pair<First, Second>& b) const { in operator ()()
/third_party/skia/src/core/
H A DSkRecordPattern.h16 // First, some matchers. These match a single command in the SkRecord,
85 // Matches if any of First or Rest... does. Stores nothing.
86 template <typename First, typename... Rest>
89 bool operator()(T* ptr) { return First()(ptr) || Or<Rest...>()(ptr); } in operator ()()
91 template <typename First>
92 struct Or<First> {
94 bool operator()(T* ptr) { return First()(ptr); } in operator ()()
119 template <typename First, typename... Rest>
120 class Pattern<First, Rest...> {
171 First fFirs
[all...]
H A DSkTBlockList.h124 if (releaseIndex == First(block)) { in pop_back()
160 count += (sizeof(T) + Last(b) - First(b)) / sizeof(T); in count()
179 return GetItem(fAllocator->headBlock(), First(fAllocator->headBlock())); in front()
183 return GetItem(fAllocator->headBlock(), First(fAllocator->headBlock())); in front()
211 int start = First(b); in item()
241 static int First(const SkBlockAllocator::Block* b) { in First() function in SkTBlockList
258 br.fAlignedOffset == First(fAllocator->currentBlock())); in pushItem()
272 using Iter = BlockIndexIterator<T&, true, false, &First, &Last, &Increment, &GetItem>;
273 using CIter = BlockIndexIterator<const T&, true, true, &First, &Last, &Increment, &GetItem>;
274 using RIter = BlockIndexIterator<T&, false, false, &Last, &First,
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Lanai/
H A DLanaiMemAluCombiner.cpp335 MbbIterator First = MemInstr; in findClosestSuitableAluInstr() local
338 while (First != Last) { in findClosestSuitableAluInstr()
339 Decrement ? --First : ++First; in findClosestSuitableAluInstr()
341 if (First == Last) in findClosestSuitableAluInstr()
345 if (First->isDebugInstr()) in findClosestSuitableAluInstr()
348 if (isSuitableAluInstr(IsSpls, First, *Base, *Offset)) { in findClosestSuitableAluInstr()
349 return First; in findClosestSuitableAluInstr()
353 if (First != Last) { in findClosestSuitableAluInstr()
354 if (InstrUsesReg(First, Bas in findClosestSuitableAluInstr()
[all...]
/third_party/mesa3d/src/gallium/drivers/r300/
H A Dr300_vs_draw.c70 /* First instruction processed? */
84 decl.Range.First = decl.Range.Last = reg; in emit_temp()
101 decl.Range.First = decl.Range.Last = reg; in emit_output()
115 for (i = before->Range.First; i < ARRAY_SIZE(vsctx->out_remap); i++) { in insert_output_before()
121 before->Range.First + vsctx->decl_shift); in insert_output_before()
134 for (i = after->Range.First+1; i < ARRAY_SIZE(vsctx->out_remap); i++) { in insert_output_after()
140 after->Range.First + 1); in insert_output_after()
154 vsctx->pos_output = decl->Range.First; in transform_decl()
201 decl->Range.First += vsctx->decl_shift; in transform_decl()
206 for (i = decl->Range.First; in transform_decl()
[all...]
/third_party/mesa3d/src/gallium/auxiliary/tgsi/
H A Dtgsi_two_side.c81 ts->front_color_input[decl->Semantic.Index] = decl->Range.First; in xform_decl()
85 ts->face_input = decl->Range.First; in xform_decl()
115 decl.Range.First = decl.Range.Last = ts->num_inputs++; in emit_prolog()
118 ts->back_color_input[i] = decl.Range.First; in emit_prolog()
127 decl.Range.First = ts->num_temps; in emit_prolog()
140 decl.Range.First = decl.Range.Last = ts->num_inputs++; in emit_prolog()
142 ts->face_input = decl.Range.First; in emit_prolog()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/
H A DBinaryStreamWriter.cpp86 WritableBinaryStreamRef First = Stream.drop_front(Offset); in split() local
88 WritableBinaryStreamRef Second = First.drop_front(Off); in split()
89 First = First.keep_front(Off); in split()
90 BinaryStreamWriter W1{First}; in split()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/X86/
H A DX86OptimizeLEAs.cpp264 int calcInstrDist(const MachineInstr &First, const MachineInstr &Last);
281 /// \p First. The difference between displacements of the addresses calculated
283 /// replacement of the \p Last LEA's uses with the \p First's def register.
284 bool isReplaceable(const MachineInstr &First, const MachineInstr &Last,
319 int X86OptimizeLEAPass::calcInstrDist(const MachineInstr &First, in calcInstrDist() argument
323 assert(Last.getParent() == First.getParent() && in calcInstrDist()
325 assert(InstrPos.find(&First) != InstrPos.end() && in calcInstrDist()
329 return InstrPos[&Last] - InstrPos[&First]; in calcInstrDist()
418 // Check that the Last LEA can be replaced by the First LEA. To be so,
424 bool X86OptimizeLEAPass::isReplaceable(const MachineInstr &First, in isReplaceable() argument
607 MachineInstr &First = **I1; removeRedundantLEAs() local
[all...]
/third_party/glslang/SPIRV/
H A Dbitutils.h33 // SetBits<T, First, Num> returns an integer of type <T> with bits set
34 // for position <First> through <First + Num - 1>, counting from the least
36 // A static assert will be triggered if First + Num > sizeof(T) * 8, that is,
38 template <typename T, size_t First = 0, size_t Num = 0>
40 static_assert(First < sizeof(T) * 8,
42 const static T get = (T(1) << First) | SetBits<T, First + 1, Num - 1>::get;
/third_party/skia/experimental/graphite/src/
H A DDrawOrder.h22 static constexpr MonotonicValue First() { return 0; } in First() function in skgpu::MonotonicValue
123 inline static constexpr PaintersDepth kClearDepth = PaintersDepth::First();
127 CompressedPaintersOrder kNoIntersection = CompressedPaintersOrder::First();
129 inline static constexpr DisjointStencilIndex kUnassigned = DisjointStencilIndex::First();
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
H A DSwitchLoweringUtils.h176 APInt First; member
185 : First(std::move(F)), Last(std::move(L)), SValue(SV), HeaderBB(H), in JumpTableHeader()
204 APInt First; member
221 : First(std::move(F)), Range(std::move(R)), SValue(SV), Reg(Rg), in BitTestBlock()
227 uint64_t getJumpTableRange(const CaseClusterVector &Clusters, unsigned First,
232 unsigned First, unsigned Last);
271 bool buildJumpTable(const CaseClusterVector &Clusters, unsigned First,
278 /// Build a bit test cluster from Clusters[First..Last]. Returns false if it
280 bool buildBitTests(CaseClusterVector &Clusters, unsigned First, unsigned Last,
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/ARC/
H A DARCOptAddrMode.cpp236 LLVM_DEBUG(MachineInstr *First = &Ldst; MachineInstr *Last = &Add; in tryToCombine()
237 if (MDT->dominates(Last, First)) std::swap(First, Last); in tryToCombine()
238 dbgs() << "[ABAW] Instructions " << *First << " and " << *Last in tryToCombine()
269 MachineInstr *First = Add; in canJoinInstructions() local
272 std::swap(First, Last); in canJoinInstructions()
276 LLVM_DEBUG(dbgs() << "canJoinInstructions: " << *First << *Last); in canJoinInstructions()
318 if (First == Add) { in canJoinInstructions()
323 if (noUseOfAddBeforeLoadOrStore(First, Last)) { in canJoinInstructions()
327 Result = First; in canJoinInstructions()
[all...]

Completed in 20 milliseconds

12345678