Home
last modified time | relevance | path

Searched refs:Sequence (Results 1 – 25 of 151) sorted by relevance

1234567

/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DPriorityQueue.h26 class Sequence = std::vector<T>,
27 class Compare = std::less<typename Sequence::value_type> >
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
31 const Sequence &sequence = Sequence())
32 : std::priority_queue<T, Sequence, Compare>(compare, sequence)
38 const Sequence &sequence = Sequence())
39 : std::priority_queue<T, Sequence, Compare>(begin, end, compare, sequence)
49 typename Sequence::size_type i = find(this->c, t) - this->c.begin(); in erase_one()
53 typename Sequence::size_type parent = (i - 1) / 2; in erase_one()
/llvm-project-15.0.7/mlir/test/Integration/Dialect/SparseTensor/taco/
H A Dunit_test_tensor_utils.py3 from typing import Sequence
22 def _to_string(s: Sequence[int]) -> str:
27 def _add_one(s: Sequence[int]) -> Sequence[int]:
45 shape: Sequence[int]
46 values: Sequence[float]
47 indices: Sequence[Sequence[int]]
67 sparsity_codes: Sequence[sparse_tensor.DimLevelType]) -> int:
/llvm-project-15.0.7/llvm/include/llvm/MCA/
H A DSourceMgr.h60 ArrayRef<UniqueInst> Sequence; variable
67 : Sequence(S), Current(0U), Iterations(Iter ? Iter : DefaultIterations) {} in CircularSourceMgr()
69 ArrayRef<UniqueInst> getInstructions() const override { return Sequence; } in getInstructions()
73 return Current < (Iterations * Sequence.size()); in hasNext()
79 return SourceRef(Current, *Sequence[Current % Sequence.size()]); in peekNext()
/llvm-project-15.0.7/llvm/lib/Transforms/ObjCARC/
H A DPtrState.cpp37 raw_ostream &llvm::objcarc::operator<<(raw_ostream &OS, const Sequence S) { in operator <<()
59 static Sequence MergeSeqs(Sequence A, Sequence B, bool TopDown) { in MergeSeqs()
134 void PtrState::SetSeq(Sequence NewSeq) { in SetSeq()
140 void PtrState::ResetSequenceProgress(Sequence NewSeq) { in ResetSequenceProgress()
191 Sequence NewSeq = ReleaseMetadata ? S_MovableRelease : S_Stop; in InitBottomUp()
206 Sequence OldSeq = GetSeq(); in MatchWithRetain()
230 Sequence S = GetSeq(); in HandlePotentialAlterRefCount()
257 auto SetSeqAndInsertReverseInsertPt = [&](Sequence NewSeq){ in HandlePotentialUse()
353 Sequence OldSeq = GetSeq(); in MatchWithRelease()
H A DPtrState.h41 enum Sequence { enum
51 const Sequence S) LLVM_ATTRIBUTE_UNUSED;
148 void SetSeq(Sequence NewSeq);
150 Sequence GetSeq() const { return static_cast<Sequence>(Seq); } in GetSeq()
154 void ResetSequenceProgress(Sequence NewSeq);
/llvm-project-15.0.7/mlir/python/mlir/dialects/
H A D_transform_ops_ext.py12 from typing import Optional, overload, Sequence, Union
34 handles: Sequence[Union[Operation, Value]],
66 handles: Sequence[Union[Operation, Value]],
81 def __init__(self, resultsOrRoot: Sequence[Type],
91 results = resultsOrRoot if isinstance(resultsOrRoot, Sequence) else []
94 if not isinstance(resultsOrRoot, Sequence) else optionalRoot)
133 operands: Union[Operation, Sequence[Value]] = [],
H A D_pdl_ops_ext.py11 from typing import Union, Optional, Sequence, List, Mapping
24 def _get_array_attr(attrs: Union[ArrayAttr, Sequence[Attribute]]) -> ArrayAttr:
32 def _get_str_array_attr(attrs: Union[ArrayAttr, Sequence[str]]) -> ArrayAttr:
61 args: Sequence[Union[OpView, Operation, Value]] = [],
74 results: Sequence[Type],
76 args: Sequence[Union[OpView, Operation, Value]] = [],
142 args: Sequence[Union[OpView, Operation, Value]] = [],
144 types: Sequence[Union[OpView, Operation, Value]] = [],
189 with_values: Sequence[Union[OpView, Operation, Value]] = [],
234 args: Sequence[Union[OpView, Operation, Value]] = [],
[all …]
H A D_structured_transform_ops_ext.py12 from typing import List, Optional, Sequence, Union
14 IntOrAttrList = Sequence[Union[IntegerAttr, int]]
25 values: Optional[Union[ArrayAttr, Sequence[Attribute]]]) -> ArrayAttr:
36 values: Optional[Union[ArrayAttr, Sequence[Union[IntegerAttr, int]]]]
54 values: Optional[Union[ArrayAttr, Sequence[Union[ArrayAttr,
143 Sequence[Attribute]]] = None,
147 transpose_paddings: Optional[Union[ArrayAttr, Sequence[Union[
217 sizes: Optional[Union[Sequence[Union[int, IntegerAttr, Operation,
/llvm-project-15.0.7/clang-tools-extra/pseudo/tool/
H A DHTMLForest.cpp124 std::vector<std::pair<const ForestNode *, /*End*/ Token::Index>> Sequence; in writeForestJSON() local
127 auto R = Index.try_emplace(N, Sequence.size()); in writeForestJSON()
129 Sequence.push_back({N, End}); in writeForestJSON()
137 for (unsigned I = 0; I < Sequence.size(); ++I) { in writeForestJSON()
138 const ForestNode *N = Sequence[I].first; in writeForestJSON()
139 Token::Index End = Sequence[I].second; in writeForestJSON()
147 case ForestNode::Sequence: in writeForestJSON()
/llvm-project-15.0.7/clang-tools-extra/pseudo/lib/grammar/
H A DGrammarBNF.cpp61 for (const RuleSpec::Element &Elt : Spec.Sequence) { in build()
100 assert(Spec.Sequence.size() <= Rule::MaxElements); in build()
102 for (const RuleSpec::Element &Elt : Spec.Sequence) in build()
189 std::vector<Element> Sequence; member
193 for (const auto &E : Sequence) in toString()
223 Out.Sequence.clear(); in parseLine()
229 if (Out.Sequence.empty()) in parseLine()
232 parseAttributes(Chunk, Out.Sequence.back().Attributes); in parseLine()
236 Out.Sequence.push_back({Chunk, /*Attributes=*/{}}); in parseLine()
259 for (unsigned I = 0; I < Spec.Sequence.size(); ++I) { in applyAttributes()
[all …]
/llvm-project-15.0.7/clang/include/clang/Tooling/Syntax/
H A DNodes.td46 def ParenExpression : Sequence<Expression> {
62 def IntegerLiteralExpression : Sequence<LiteralExpression> {
74 def CharacterLiteralExpression : Sequence<LiteralExpression> {
82 def FloatingLiteralExpression : Sequence<LiteralExpression> {
94 def StringLiteralExpression : Sequence<LiteralExpression> {
105 def BoolLiteralExpression : Sequence<LiteralExpression> {
113 def CxxNullPtrExpression : Sequence<LiteralExpression> {
163 def IdExpression : Sequence<Expression> {
179 def MemberExpression : Sequence<Expression> {
197 def ThisExpression : Sequence<Expression> {
[all …]
/llvm-project-15.0.7/llvm/lib/ExecutionEngine/Orc/
H A DDebugUtils.cpp80 template <typename Sequence,
81 typename Pred = PrintAll<typename Sequence::value_type>>
84 SequencePrinter(const Sequence &S, char OpenSeq, char CloseSeq, in SequencePrinter()
104 const Sequence &S;
110 template <typename Sequence, typename Pred>
111 SequencePrinter<Sequence, Pred> printSequence(const Sequence &S, char OpenSeq, in printSequence()
113 return SequencePrinter<Sequence, Pred>(S, OpenSeq, CloseSeq, std::move(P)); in printSequence()
117 template <typename Sequence, typename Pred>
119 const SequencePrinter<Sequence, Pred> &Printer) { in operator <<() argument
/llvm-project-15.0.7/compiler-rt/test/profile/Inputs/
H A Dinstrprof-value-prof-evict.c56 #define INDIRECT_CALLSITE(Sequence, NumValsTracked) \ in main() argument
58 for (I = 0; I < sizeof(Sequence) / sizeof(*Sequence); I++) { \ in main()
59 FPT FP = getCalleeFunc(Sequence[I]); \ in main()
/llvm-project-15.0.7/llvm/include/llvm/DebugInfo/DWARF/
H A DDWARFDebugLine.h194 struct Sequence { struct
195 Sequence();
211 static bool orderByHighPC(const Sequence &LHS, const Sequence &RHS) { in orderByHighPC() argument
234 void appendSequence(const DWARFDebugLine::Sequence &S) { in appendSequence() argument
282 using SequenceVector = std::vector<Sequence>;
290 uint32_t findRowInSeq(const DWARFDebugLine::Sequence &Seq,
398 struct Sequence Sequence; member
/llvm-project-15.0.7/pstl/test/std/algorithms/alg.sorting/alg.set.operations/
H A Dset.pass.cpp67 Sequence<T1> expect(n); in operator ()()
68 Sequence<T1> out(n); in operator ()()
97 Sequence<T1> expect(n); in operator ()()
98 Sequence<T1> out(n); in operator ()()
127 Sequence<T1> expect(n); in operator ()()
128 Sequence<T1> out(n); in operator ()()
157 Sequence<T1> expect(n); in operator ()()
158 Sequence<T1> out(n); in operator ()()
190 Sequence<T1> in1(n, [](std::size_t k) { return rand() % (2 * k + 1); }); in test_set()
191 Sequence<T2> in2(m, [m](std::size_t k) { return (m % 2) * rand() + rand() % (k + 1); }); in test_set()
/llvm-project-15.0.7/pstl/test/std/algorithms/alg.modifying.operations/alg.reverse/
H A Dreverse_copy.pass.cpp91 Sequence<T> res(n); in operator ()()
102 typedef typename Sequence<T1>::iterator iterator_type; in test()
103 typedef typename Sequence<T1>::const_bidirectional_iterator cbi_iterator_type; in test()
107 Sequence<T2> actual(max_len); in test()
109 Sequence<T1> data(max_len, [](std::size_t i) { return T1(i); }); in test()
/llvm-project-15.0.7/llvm/lib/DebugInfo/DWARF/
H A DDWARFDebugLine.cpp503 DWARFDebugLine::Sequence::Sequence() { reset(); } in Sequence() function in DWARFDebugLine::Sequence
548 Sequence.reset(); in resetRowAndSequence()
553 if (Sequence.Empty) { in appendRowToMatrix()
555 Sequence.Empty = false; in appendRowToMatrix()
565 if (Sequence.isValid()) in appendRowToMatrix()
567 Sequence.reset(); in appendRowToMatrix()
1191 if (!State.Sequence.Empty) in parse()
1259 DWARFDebugLine::Sequence Sequence; in lookupAddressImpl() local
1261 Sequence.HighPC = Address.Address; in lookupAddressImpl()
1292 DWARFDebugLine::Sequence Sequence; in lookupAddressRangeImpl() local
[all …]
/llvm-project-15.0.7/pstl/test/std/algorithms/alg.nonmodifying/
H A Dadjacent_find.pass.cpp49 Sequence<T> in(counts[c], [](size_t v) -> T { return T(v); }); //fill 0...n in test_adjacent_find_by_type()
63 Sequence<T> in(expect, [](size_t v) -> T { return T(v); }); //fill 0...n in test_adjacent_find_by_type()
72 Sequence<T> a1 = {5, 5, 5, 6, 7, 8, 9}; in test_adjacent_find_by_type()
79 Sequence<T> a2 = {5, 6, 7, 8, 9, 9}; in test_adjacent_find_by_type()
86 Sequence<T> a3 = {5, 6, 6, 6, 7, 9, 9, 9, 9}; in test_adjacent_find_by_type()
/llvm-project-15.0.7/clang-tools-extra/pseudo/unittests/
H A DGrammarTest.cpp25 template <typename... T> testing::Matcher<const Rule &> Sequence(T... IDs) { in Sequence() function
67 AllOf(TargetID(id("_")), Sequence(id("IDENTIFIER"), id("+"), id("_"))); in TEST_F()
81 UnorderedElementsAre(Sequence(id("INT")), in TEST_F()
82 Sequence(id("CONST"), id("INT")), in TEST_F()
83 Sequence(id("CONST"), id("INT"), id(";")), in TEST_F()
84 Sequence(id("INT"), id(";")))); in TEST_F()
/llvm-project-15.0.7/mlir/python/mlir/_mlir_libs/
H A D__init__.py5 from typing import Any, Sequence
12 def get_lib_dirs() -> Sequence[str]:
21 def get_include_dirs() -> Sequence[str]:
/llvm-project-15.0.7/llvm/utils/unittest/googlemock/include/gmock/
H A Dgmock-spec-builders.h531 friend class Sequence; variable
632 class GTEST_API_ Sequence {
635 Sequence() : last_expectation_(new Expectation) {} in Sequence() function
848 friend class ::testing::Sequence;
948 TypedExpectation& InSequence(const Sequence& s) { in InSequence()
958 TypedExpectation& InSequence(const Sequence& s1, const Sequence& s2) { in InSequence()
961 TypedExpectation& InSequence(const Sequence& s1, const Sequence& s2, in InSequence()
965 TypedExpectation& InSequence(const Sequence& s1, const Sequence& s2, in InSequence()
966 const Sequence& s3, const Sequence& s4) { in InSequence()
969 TypedExpectation& InSequence(const Sequence& s1, const Sequence& s2, in InSequence()
[all …]
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DPostRASchedulerList.cpp131 std::vector<SUnit*> Sequence; member in __anon3b4013580111::SchedulePostRATDList
237 Sequence.clear(); in enterRegion()
253 for (const SUnit *SU : Sequence) { in dumpSchedule()
499 Sequence.push_back(SU); in ScheduleNodeTopDown()
513 Sequence.push_back(nullptr); // NULL here means noop in emitNoop()
547 Sequence.reserve(SUnits.size()); in ListScheduleTopDown()
658 unsigned Noops = llvm::count(Sequence, nullptr); in ListScheduleTopDown()
659 assert(Sequence.size() - Noops == ScheduledNodes && in ListScheduleTopDown()
673 for (unsigned i = 0, e = Sequence.size(); i != e; i++) { in EmitSchedule()
674 if (SUnit *SU = Sequence[i]) in EmitSchedule()
/llvm-project-15.0.7/clang/lib/Sema/
H A DSemaInit.cpp3930 if (Sequence) in TryInitializerListConstruction()
4339 if (Sequence) in TryReferenceListInitialization()
4345 if (Sequence.step_begin() != Sequence.step_end()) in TryReferenceListInitialization()
4354 Sequence.SetFailed( in TryReferenceListInitialization()
4369 if (Sequence) { in TryReferenceListInitialization()
4378 Sequence.SetFailed( in TryReferenceListInitialization()
4452 if (Sequence) { in TryListInitialization()
4565 if (Sequence) in TryListInitialization()
4913 Sequence.SetFailed( in TryReferenceInitializationCore()
5039 Sequence.SetFailed( in TryReferenceInitializationCore()
[all …]
/llvm-project-15.0.7/clang-tools-extra/pseudo/include/clang-pseudo/
H A DForest.h54 Sequence, in alignas() enumerator
74 assert(kind() == Sequence); in alignas()
80 assert(kind() == Sequence); in alignas()
93 case Sequence: in alignas()
157 return create(ForestNode::Sequence, SID, in createSequence()
/llvm-project-15.0.7/pstl/test/std/numerics/numeric.ops/
H A Dtransform_scan.pass.cpp111 Sequence<In> in(n, [](size_t k) { return In(k ^ encryption_mask); }); in test()
114 Sequence<Out> expected(n, [&](size_t k) -> Out { in test()
128 Sequence<Out> out(n, [&](size_t) { return trash; }); in test()
150 Sequence<In> in(n, [](size_t k) { return In(k, k + 1); }); in test_matrix()
152 Sequence<Out> out(n, [&](size_t) { return trash; }); in test_matrix()
153 Sequence<Out> expected(n, [&](size_t) { return trash; }); in test_matrix()

1234567