Home
last modified time | relevance | path

Searched refs:Elem (Results 1 – 25 of 99) sorted by relevance

1234

/llvm-project-15.0.7/compiler-rt/lib/tsan/rtl-old/
H A Dtsan_ilist.h56 Elem* Prev(Elem* e);
58 Elem* Next(Elem* e);
82 void IList<Base, Node, Elem>::PushFront(Elem* e) { in PushFront()
87 void IList<Base, Node, Elem>::PushBack(Elem* e) { in PushBack()
105 void IList<Base, Node, Elem>::Remove(Elem* e) { in Remove()
119 Elem* IList<Base, Node, Elem>::PopFront() { in PopFront()
127 Elem* IList<Base, Node, Elem>::PopBack() { in PopBack()
135 Elem* IList<Base, Node, Elem>::Front() { in Front()
140 Elem* IList<Base, Node, Elem>::Back() { in Back()
145 Elem* IList<Base, Node, Elem>::Prev(Elem* e) { in Prev()
[all …]
/llvm-project-15.0.7/compiler-rt/lib/tsan/rtl/
H A Dtsan_ilist.h56 Elem* Prev(Elem* e);
58 Elem* Next(Elem* e);
82 void IList<Base, Node, Elem>::PushFront(Elem* e) { in PushFront()
87 void IList<Base, Node, Elem>::PushBack(Elem* e) { in PushBack()
105 void IList<Base, Node, Elem>::Remove(Elem* e) { in Remove()
119 Elem* IList<Base, Node, Elem>::PopFront() { in PopFront()
127 Elem* IList<Base, Node, Elem>::PopBack() { in PopBack()
135 Elem* IList<Base, Node, Elem>::Front() { in Front()
140 Elem* IList<Base, Node, Elem>::Back() { in Back()
145 Elem* IList<Base, Node, Elem>::Prev(Elem* e) { in Prev()
[all …]
/llvm-project-15.0.7/libcxx/test/std/utilities/function.objects/func.bind_front/
H A Dbind_front.pass.cpp93 auto f = std::bind_front(MakeTuple{}, Elem<1>{}, Elem<2>{}, Elem<3>{}); in test()
94 assert(f() == std::make_tuple(Elem<1>{}, Elem<2>{}, Elem<3>{})); in test()
106 assert(f(Elem<1>{}, Elem<2>{}) == std::make_tuple(Elem<1>{}, Elem<2>{})); in test()
110 … assert(f(Elem<1>{}, Elem<2>{}, Elem<3>{}) == std::make_tuple(Elem<1>{}, Elem<2>{}, Elem<3>{})); in test()
118 assert(f(Elem<10>{}) == std::make_tuple(Elem<1>{}, Elem<10>{})); in test()
122 assert(f(Elem<10>{}) == std::make_tuple(Elem<1>{}, Elem<2>{}, Elem<10>{})); in test()
125 auto f = std::bind_front(MakeTuple{}, Elem<1>{}, Elem<2>{}, Elem<3>{}); in test()
126 assert(f(Elem<10>{}) == std::make_tuple(Elem<1>{}, Elem<2>{}, Elem<3>{}, Elem<10>{})); in test()
131 assert(f(Elem<10>{}, Elem<11>{}) == std::make_tuple(Elem<1>{}, Elem<10>{}, Elem<11>{})); in test()
135 …assert(f(Elem<10>{}, Elem<11>{}) == std::make_tuple(Elem<1>{}, Elem<2>{}, Elem<10>{}, Elem<11>{})); in test()
[all …]
/llvm-project-15.0.7/libcxx/test/libcxx/utilities/function.objects/func.bind.partial/
H A Dbind_back.pass.cpp96 auto f = std::__bind_back(MakeTuple{}, Elem<1>{}, Elem<2>{}, Elem<3>{}); in test()
97 assert(f() == std::make_tuple(Elem<1>{}, Elem<2>{}, Elem<3>{})); in test()
109 assert(f(Elem<1>{}, Elem<2>{}) == std::make_tuple(Elem<1>{}, Elem<2>{})); in test()
113 … assert(f(Elem<1>{}, Elem<2>{}, Elem<3>{}) == std::make_tuple(Elem<1>{}, Elem<2>{}, Elem<3>{})); in test()
121 assert(f(Elem<10>{}) == std::make_tuple(Elem<10>{}, Elem<1>{})); in test()
125 assert(f(Elem<10>{}) == std::make_tuple(Elem<10>{}, Elem<1>{}, Elem<2>{})); in test()
128 auto f = std::__bind_back(MakeTuple{}, Elem<1>{}, Elem<2>{}, Elem<3>{}); in test()
129 assert(f(Elem<10>{}) == std::make_tuple(Elem<10>{}, Elem<1>{}, Elem<2>{}, Elem<3>{})); in test()
134 assert(f(Elem<10>{}, Elem<11>{}) == std::make_tuple(Elem<10>{}, Elem<11>{}, Elem<1>{})); in test()
138 …assert(f(Elem<10>{}, Elem<11>{}) == std::make_tuple(Elem<10>{}, Elem<11>{}, Elem<1>{}, Elem<2>{})); in test()
[all …]
H A Dcompose.pass.cpp20 struct Elem { struct
22 constexpr bool operator==(Elem<Y> const&) const in operator ==() argument
29 return std::make_tuple(Elem<888>{}, std::forward<Args>(args)...); in operator ()()
36 return std::make_tuple(Elem<999>{}, std::forward<Args>(args)...); in operator ()()
50 assert(c(Elem<0>{}) == f(g(Elem<0>{}))); in test()
54 assert(c(Elem<0>{}, Elem<1>{}) == f(g(Elem<0>{}, Elem<1>{}))); in test()
58 assert(c(Elem<0>{}, Elem<1>{}, Elem<2>{}) == f(g(Elem<0>{}, Elem<1>{}, Elem<2>{}))); in test()
64 constexpr Elem<0> foo() { return {}; } in test()
70 assert(c(MemberFunction2{}) == Elem<0>{}); in test()
/llvm-project-15.0.7/libcxx/test/std/utilities/tuple/tuple.tuple/tuple.cnstr/
H A Dmove.pass.cpp51 template <class Elem>
53 using Tup = std::tuple<Elem>; in test_sfinae()
65 static_assert(std::is_constructible<Tup, Elem&&>::value, ""); in test_sfinae()
66 static_assert(!std::is_constructible<Tup, Elem const&>::value, ""); in test_sfinae()
67 static_assert(!std::is_constructible<Tup, Elem&>::value, ""); in test_sfinae()
78 static_assert(std::is_constructible<Tup, Tag, Alloc, Elem&&>::value, ""); in test_sfinae()
79 static_assert(!std::is_constructible<Tup, Tag, Alloc, Elem const&>::value, ""); in test_sfinae()
80 static_assert(!std::is_constructible<Tup, Tag, Alloc, Elem &>::value, ""); in test_sfinae()
/llvm-project-15.0.7/polly/test/CodeGen/
H A Dinv-load-lnt-crash-wrong-order-2.ll11 …690.723.756.888.987.1218.2438.2471.2636.2669.2768.2900.2999.3015, %struct.Elem.12.45.78.243.573.60…
12 …88.721.754.886.985.1216.2436.2469.2634.2667.2766.2898.2997.3035*, %struct.Elem.12.45.78.243.573.60…
14 …739.871.970.1201.2421.2454.2619.2652.2751.2883.2982.3012 = type { %struct.Elem.12.45.78.243.573.60…
16 … { i32, i32, %struct.Elem.12.45.78.243.573.606.672.705.738.870.969.1200.2420.2453.2618.2651.2750.2…
17 %struct.Elem.12.45.78.243.573.606.672.705.738.870.969.1200.2420.2453.2618.2651.2750.2882.2981.3021 …
23 … { i32, i32, %struct.Elem.12.45.78.243.573.606.672.705.738.870.969.1200.2420.2453.2618.2651.2750.2…
24 … { i32, i32, %struct.Elem.12.45.78.243.573.606.672.705.738.870.969.1200.2420.2453.2618.2651.2750.2…
26 …742.874.973.1204.2424.2457.2622.2655.2754.2886.2985.3024 = type { %struct.Elem.12.45.78.243.573.60…
H A Dinv-load-lnt-crash-wrong-order.ll11 …anon.0.30.63.96.327.492.855.921.954.987.1053.2041.2140.2173.2585, %struct.Elem.12.45.78.309.474.83…
12 …State.28.61.94.325.490.853.919.952.985.1051.2039.2138.2171.2605*, %struct.Elem.12.45.78.309.474.83…
14 %struct.Declaration.13.46.79.310.475.838.904.937.970.1036.2024.2123.2156.2582 = type { %struct.Elem…
16 …73.2585 = type { i32, i32, %struct.Elem.12.45.78.309.474.837.903.936.969.1035.2023.2122.2155.2591*…
17 %struct.Elem.12.45.78.309.474.837.903.936.969.1035.2023.2122.2155.2591 = type { i32, i32, %struct.R…
23 …57.2592 = type { i32, i32, %struct.Elem.12.45.78.309.474.837.903.936.969.1035.2023.2122.2155.2591*…
24 …58.2593 = type { i32, i32, %struct.Elem.12.45.78.309.474.837.903.936.969.1035.2023.2122.2155.2591*…
26 %struct.Goto.16.49.82.313.478.841.907.940.973.1039.2027.2126.2159.2594 = type { %struct.Elem.12.45.…
/llvm-project-15.0.7/llvm/unittests/ADT/
H A DFallibleIteratorTest.cpp121 for (auto &Elem : in TEST() local
123 EXPECT_TRUE(Elem.isValid()); in TEST()
138 for (auto &Elem : in TEST() local
140 EXPECT_TRUE(Elem.isValid()); in TEST()
156 for (auto &Elem : in TEST() local
158 (void)Elem; in TEST()
180 for (auto &Elem : in TEST()
182 (void)Elem; in TEST()
/llvm-project-15.0.7/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DProgramStateTrait.h112 #define REGISTER_SET_WITH_PROGRAMSTATE(Name, Elem) \ argument
113 REGISTER_TRAIT_WITH_PROGRAMSTATE(Name, llvm::ImmutableSet<Elem>)
119 #define REGISTER_SET_FACTORY_WITH_PROGRAMSTATE(Name, Elem) \ argument
120 using Name = llvm::ImmutableSet<Elem>; \
135 #define REGISTER_LIST_WITH_PROGRAMSTATE(Name, Elem) \ argument
136 REGISTER_TRAIT_WITH_PROGRAMSTATE(Name, llvm::ImmutableList<Elem>)
142 #define REGISTER_LIST_FACTORY_WITH_PROGRAMSTATE(Name, Elem) \ argument
143 using Name = llvm::ImmutableList<Elem>; \
/llvm-project-15.0.7/llvm/lib/Target/WebAssembly/
H A DWebAssemblyDebugFixup.cpp89 for (auto &Elem : reverse(Stack)) { in runOnMachineFunction() local
90 if (MO.getReg() == Elem.Reg) { in runOnMachineFunction()
91 auto Depth = static_cast<unsigned>(&Elem - &Stack[0]); in runOnMachineFunction()
98 Elem.DebugValue = &MI; in runOnMachineFunction()
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DAssumptionCache.cpp142 if (llvm::none_of(AVV, [&](ResultElem &Elem) { in updateAffectedValues() argument
143 return Elem.Assume == CI && Elem.Index == AV.Index; in updateAffectedValues()
159 for (ResultElem &Elem : AVI->second) { in unregisterAssumption()
160 if (Elem.Assume == CI) { in unregisterAssumption()
162 Elem.Assume = nullptr; in unregisterAssumption()
164 HasNonnull |= !!Elem.Assume; in unregisterAssumption()
H A DAssumeBundleQueries.cpp164 for (AssumptionCache::ResultElem &Elem : AC->assumptionsFor(V)) { in getKnowledgeForValue()
165 auto *II = cast_or_null<AssumeInst>(Elem.Assume); in getKnowledgeForValue()
166 if (!II || Elem.Index == AssumptionCache::ExprResultIdx) in getKnowledgeForValue()
169 *II, II->bundle_op_info_begin()[Elem.Index])) { in getKnowledgeForValue()
173 Filter(RK, II, &II->bundle_op_info_begin()[Elem.Index])) { in getKnowledgeForValue()
/llvm-project-15.0.7/bolt/lib/Passes/
H A DFrameAnalysis.cpp210 std::pair<int64_t, uint16_t> &Elem = CFIStack.top(); in doNext() local
212 CfaOffset = Elem.first; in doNext()
213 CfaReg = Elem.second; in doNext()
363 for (std::pair<int64_t, uint8_t> Elem : Iter->second) { in updateArgsTouchedFor()
364 if (ArgsTouchedMap[&BF].find(Elem) == ArgsTouchedMap[&BF].end()) { in updateArgsTouchedFor()
365 ArgsTouchedMap[&BF].emplace(Elem); in updateArgsTouchedFor()
384 for (std::pair<int64_t, uint8_t> Elem : Iter->second) { in updateArgsTouchedFor()
385 if (Elem.first == -1) { in updateArgsTouchedFor()
390 << CurOffset + Elem.first << "\n"); in updateArgsTouchedFor()
392 Inst, ArgInStackAccess{/*StackOffset=*/CurOffset + Elem.first, in updateArgsTouchedFor()
[all …]
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DScalarizer.cpp516 for (unsigned Elem = 0; Elem < NumElems; ++Elem) in splitUnary() local
517 Res[Elem] = Split(Builder, Op[Elem], I.getName() + ".i" + Twine(Elem)); in splitUnary()
538 for (unsigned Elem = 0; Elem < NumElems; ++Elem) { in splitBinary() local
539 Value *Op0 = VOp0[Elem]; in splitBinary()
540 Value *Op1 = VOp1[Elem]; in splitBinary()
541 Res[Elem] = Split(Builder, Op0, Op1, I.getName() + ".i" + Twine(Elem)); in splitBinary()
607 for (unsigned Elem = 0; Elem < NumElems; ++Elem) { in splitCall() local
614 ScalarCallOps.push_back(Scattered[J][Elem]); in splitCall()
617 Res[Elem] = Builder.CreateCall(NewIntrin, ScalarCallOps, in splitCall()
618 CI.getName() + ".i" + Twine(Elem)); in splitCall()
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DAssumeBundleBuilder.cpp362 for (auto &Elem : BBToAssume) { in buildMapping() local
363 llvm::sort(Elem.second, in buildMapping()
443 for (MapValue &Elem : Lookup) { in dropRedundantKnowledge()
444 if (!isValidAssumeForContext(Elem.Assume, Assume, DT)) in dropRedundantKnowledge()
446 if (Elem.ArgValue >= RK.ArgValue) { in dropRedundantKnowledge()
449 } else if (isValidAssumeForContext(Assume, Elem.Assume, DT)) { in dropRedundantKnowledge()
450 Elem.Assume->op_begin()[Elem.BOI->Begin + ABA_Argument].set( in dropRedundantKnowledge()
515 for (auto &Elem : BBToAssume) { in mergeAssumes() local
516 SmallVectorImpl<IntrinsicInst *> &AssumesInBB = Elem.second; in mergeAssumes()
535 mergeRange(Elem.first, *SplitIt, *(SplitIt + 1)); in mergeAssumes()
/llvm-project-15.0.7/llvm/unittests/Linker/
H A DLinkModulesTest.cpp115 Value *Elem = Init->getOperand(0); in TEST_F() local
116 ASSERT_TRUE(isa<BlockAddress>(Elem)); in TEST_F()
117 EXPECT_EQ(cast<BlockAddress>(Elem)->getFunction(), in TEST_F()
119 EXPECT_EQ(cast<BlockAddress>(Elem)->getBasicBlock()->getParent(), in TEST_F()
122 Elem = Init->getOperand(1); in TEST_F()
123 ASSERT_TRUE(isa<BlockAddress>(Elem)); in TEST_F()
124 EXPECT_EQ(cast<BlockAddress>(Elem)->getFunction(), in TEST_F()
126 EXPECT_EQ(cast<BlockAddress>(Elem)->getBasicBlock()->getParent(), in TEST_F()
/llvm-project-15.0.7/clang/lib/AST/Interp/
H A DFunction.cpp36 using Elem = std::pair<unsigned, SourceInfo>; in getSource() typedef
37 auto It = llvm::lower_bound(SrcMap, Elem{Offset, {}}, llvm::less_first()); in getSource()
H A DDescriptor.cpp216 Descriptor::Descriptor(const DeclTy &D, Descriptor *Elem, unsigned NumElems, in Descriptor() argument
218 : Source(D), ElemSize(Elem->getAllocSize() + sizeof(InlineDescriptor)), in Descriptor()
220 AllocSize(std::max<size_t>(alignof(void *), Size)), ElemDesc(Elem), in Descriptor()
227 Descriptor::Descriptor(const DeclTy &D, Descriptor *Elem, bool IsTemporary, in Descriptor() argument
229 : Source(D), ElemSize(Elem->getAllocSize() + sizeof(InlineDescriptor)), in Descriptor()
230 Size(UnknownSizeMark), AllocSize(alignof(void *)), ElemDesc(Elem), in Descriptor()
H A DDescriptor.h99 Descriptor(const DeclTy &D, Descriptor *Elem, unsigned NumElems, bool IsConst,
103 Descriptor(const DeclTy &D, Descriptor *Elem, bool IsTemporary, UnknownSize);
/llvm-project-15.0.7/clang/lib/AST/
H A DStmtObjC.cpp20 ObjCForCollectionStmt::ObjCForCollectionStmt(Stmt *Elem, Expr *Collect, in ObjCForCollectionStmt() argument
24 SubExprs[ELEM] = Elem; in ObjCForCollectionStmt()
/llvm-project-15.0.7/clang/include/clang/Analysis/Analyses/
H A DThreadSafetyUtil.h178 void push_back(const T &Elem) { in push_back() argument
180 Data[Size++] = Elem; in push_back()
322 void push_back(const T &Elem) { in push_back() argument
324 Data->Vect.push_back(Elem); in push_back()
/llvm-project-15.0.7/clang/lib/Frontend/
H A DCreateInvocationFromCommandLine.cpp42 Args, [](const char *Elem) { return llvm::StringRef(Elem) == "--"; }), in createInvocation() argument
/llvm-project-15.0.7/llvm/lib/ExecutionEngine/Orc/
H A DExecutorProcessControl.cpp90 for (auto &Elem : Request) { in lookupSymbols() local
91 auto *Dylib = jitTargetAddressToPointer<sys::DynamicLibrary *>(Elem.Handle); in lookupSymbols()
99 for (auto &KV : Elem.Symbols) { in lookupSymbols()
/llvm-project-15.0.7/clang-tools-extra/clang-tidy/bugprone/
H A DUseAfterMoveCheck.cpp261 for (const auto &Elem : *Block) { in getDeclRefs()
262 Optional<CFGStmt> S = Elem.getAs<CFGStmt>(); in getDeclRefs()
357 for (const auto &Elem : *Block) { in getReinits()
358 Optional<CFGStmt> S = Elem.getAs<CFGStmt>(); in getReinits()

1234