Home
last modified time | relevance | path

Searched refs:K (Results 1 – 25 of 954) sorted by relevance

12345678910>>...39

/llvm-project-15.0.7/clang/test/Analysis/
H A Dcxx-uninitialized-object-unguarded-access.cpp32 Kind K; member in NoUnguardedFieldsTest
35 NoUnguardedFieldsTest(Kind K) : K(K) { in NoUnguardedFieldsTest() argument
74 NoUngardedFieldsNoReturnFuncCalledTest(Kind K) : K(K) { in NoUngardedFieldsNoReturnFuncCalledTest() argument
115 NoUnguardedFieldsWithUndefMethodTest(Kind K) : K(K) { in NoUnguardedFieldsWithUndefMethodTest() argument
160 UnguardedFieldThroughMethodTest(Kind K) : K(K) { in UnguardedFieldThroughMethodTest() argument
198 UnguardedPublicFieldsTest(Kind K) : K(K) { in UnguardedPublicFieldsTest() argument
240 UnguardedFalseNegativeTest1(Kind K) : K(K) { in UnguardedFalseNegativeTest1() argument
280 UnguardedFalseNegativeTest2(Kind K) : K(K) { in UnguardedFalseNegativeTest2() argument
327 IfGuardedFieldsTest(Kind K) : K(K) { in IfGuardedFieldsTest() argument
368 SwitchGuardedFieldsTest(Kind K) : K(K) { in SwitchGuardedFieldsTest() argument
[all …]
/llvm-project-15.0.7/llvm/include/llvm/MC/
H A DSectionKind.h120 } K : 8; variable
127 bool isText() const { return K == Text || K == ExecuteOnly; } in isText()
137 return K == Mergeable1ByteCString || K == Mergeable2ByteCString || in isMergeableCString()
145 return K == MergeableConst4 || K == MergeableConst8 || in isMergeableConst()
146 K == MergeableConst16 || K == MergeableConst32; in isMergeableConst()
158 return K == ThreadData || K == ThreadBSS || K == ThreadBSSLocal; in isThreadLocal()
161 bool isThreadBSS() const { return K == ThreadBSS || K == ThreadBSSLocal; } in isThreadBSS()
169 bool isBSS() const { return K == BSS || K == BSSLocal || K == BSSExtern; } in isBSS()
178 return K == ReadOnlyWithRel; in isReadOnlyWithRel()
181 static SectionKind get(Kind K) { in get() argument
[all …]
/llvm-project-15.0.7/flang/test/Semantics/OpenMP/
H A Domp-nested-simd.f9010 K = K + 1
59 K = K + 1
64 K = 2
70 K = 2
92 K = K + 1
97 K = 2
103 K = 2
126 K = K + 1
131 K = 2
137 K = 2
[all …]
/llvm-project-15.0.7/clang/tools/libclang/
H A DCXCursor.cpp35 assert(K >= CXCursor_FirstInvalid && K <= CXCursor_LastInvalid); in MakeCXCursorInvalid()
159 CXCursor C = {K, in MakeCXCursor()
180 K = CXCursor_CaseStmt; in MakeCXCursor()
188 K = CXCursor_IfStmt; in MakeCXCursor()
196 K = CXCursor_WhileStmt; in MakeCXCursor()
200 K = CXCursor_DoStmt; in MakeCXCursor()
204 K = CXCursor_ForStmt; in MakeCXCursor()
208 K = CXCursor_GotoStmt; in MakeCXCursor()
220 K = CXCursor_BreakStmt; in MakeCXCursor()
356 K = CXCursor_NullStmt; in MakeCXCursor()
[all …]
/llvm-project-15.0.7/llvm/test/TableGen/
H A DSiblingForeach.td6 int K = k;
26 // CHECK: int K = 0;
31 // CHECK: int K = 0;
36 // CHECK: int K = 0;
41 // CHECK: int K = 0;
46 // CHECK: int K = 0;
51 // CHECK: int K = 0;
56 // CHECK: int K = 0;
61 // CHECK: int K = 0;
66 // CHECK: int K = 0;
[all …]
/llvm-project-15.0.7/clang-tools-extra/test/clang-tidy/checkers/performance/
H A Dinefficient-algorithm.cpp14 template <typename K, typename Cmp = less<K>> struct set {
16 iterator find(const K &k);
17 unsigned count(const K &k);
27 template <typename K, typename V, typename Cmp = less<K>> struct map {
29 iterator find(const K &k);
38 template <typename K, typename V> struct multimap : map<K, V> {};
39 template <typename K> struct unordered_set : set<K> {};
40 template <typename K, typename V> struct unordered_map : map<K, V> {};
41 template <typename K> struct unordered_multiset : set<K> {};
42 template <typename K, typename V> struct unordered_multimap : map<K, V> {};
[all …]
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DScopedHashTable.h41 template <typename K, typename V, typename KInfo = DenseMapInfo<K>,
45 template <typename K, typename V>
49 K Key;
55 const K &getKey() const { return Key; } in getKey()
83 template <typename K, typename V, typename KInfo = DenseMapInfo<K>,
117 template <typename K, typename V, typename KInfo = DenseMapInfo<K>>
119 ScopedHashTableVal<K, V> *Node;
162 using ValTy = ScopedHashTableVal<K, V>;
181 size_type count(const K &Key) const { in count()
185 V lookup(const K &Key) const { in lookup()
[all …]
/llvm-project-15.0.7/clang/include/clang/Basic/
H A DTokenKinds.h76 return (K == tok::identifier) || (K == tok::raw_identifier); in isAnyIdentifier()
82 return K == tok::string_literal || K == tok::wide_string_literal || in isStringLiteral()
83 K == tok::utf8_string_literal || K == tok::utf16_string_literal || in isStringLiteral()
84 K == tok::utf32_string_literal; in isStringLiteral()
89 inline bool isLiteral(TokenKind K) { in isLiteral() argument
90 return K == tok::numeric_constant || K == tok::char_constant || in isLiteral()
91 K == tok::wide_char_constant || K == tok::utf8_char_constant || in isLiteral()
92 K == tok::utf16_char_constant || K == tok::utf32_char_constant || in isLiteral()
93 isStringLiteral(K) || K == tok::header_name; in isLiteral()
97 bool isAnnotation(TokenKind K);
[all …]
H A DXRayInstr.h48 bool has(XRayInstrMask K) const { in has()
49 assert(llvm::isPowerOf2_32(K)); in has()
50 return Mask & K; in has()
53 bool hasOneOf(XRayInstrMask K) const { return Mask & K; } in hasOneOf()
55 void set(XRayInstrMask K, bool Value) { in set()
56 Mask = Value ? (Mask | K) : (Mask & ~K); in set()
59 void clear(XRayInstrMask K = XRayInstrKind::All) { Mask &= ~K; }
/llvm-project-15.0.7/llvm/lib/MC/
H A DStringTableBuilder.cpp32 switch (K) { in initSize()
56 : K(K), Alignment(Alignment) { in StringTableBuilder()
79 if (K == WinCOFF) in write()
106 for (size_t K = 1; K < J;) { in multikeySort() local
113 K++; in multikeySort()
164 if (K != RAW) in finalizeStringTable()
170 if (K == MachO || K == MachOLinked) in finalizeStringTable()
172 if (K == MachO64 || K == MachO64Linked) in finalizeStringTable()
178 if (K == MachOLinked || K == MachO64Linked) in finalizeStringTable()
185 if (K == ELF) in finalizeStringTable()
[all …]
/llvm-project-15.0.7/libcxx/test/std/experimental/memory/memory.resource.aliases/
H A Dheader_unordered_map_synop.pass.cpp46 using K = int; in main() typedef
48 using DH = std::hash<K>; in main()
49 using MH = MyHash<K>; in main()
50 using DP = std::equal_to<K>; in main()
51 using MP = MyPred<K>; in main()
52 using P = std::pair<const K, V>; in main()
55 using PmrMap = pmr::unordered_map<K, V>; in main()
60 using PmrMap = pmr::unordered_map<K, V, MH>; in main()
65 using PmrMap = pmr::unordered_map<K, V, MH, MP>; in main()
74 using PmrMap = pmr::unordered_multimap<K, V>; in main()
[all …]
H A Dheader_map_synop.pass.cpp40 using K = int; in main() typedef
44 using P = std::pair<const K, V>; in main()
46 using StdMap = std::map<K, V, DC, pmr::polymorphic_allocator<P>>; in main()
47 using PmrMap = pmr::map<K, V>; in main()
51 using StdMap = std::map<K, V, OC, pmr::polymorphic_allocator<P>>; in main()
52 using PmrMap = pmr::map<K, V, OC>; in main()
60 using StdMap = std::multimap<K, V, DC, pmr::polymorphic_allocator<P>>; in main()
61 using PmrMap = pmr::multimap<K, V>; in main()
65 using StdMap = std::multimap<K, V, OC, pmr::polymorphic_allocator<P>>; in main()
66 using PmrMap = pmr::multimap<K, V, OC>; in main()
/llvm-project-15.0.7/clang-tools-extra/test/clang-tidy/checkers/portability/
H A Dstd-allocator-const.cpp24 template <class K, class C = std::less<K>, class A = std::allocator<K>>
26 template <class K, class C = std::less<K>, class A = std::allocator<K>>
28 template <class K, class H = std::hash<K>, class Eq = std::equal_to<K>, class A = std::allocator<K>>
30 template <class K, class H = std::hash<K>, class Eq = std::equal_to<K>, class A = std::allocator<K>>
38 template <class K, class H = std::hash<K>, class Eq = std::equal_to<K>, class A = std::allocator<K>>
/llvm-project-15.0.7/clang/lib/Headers/
H A Dhexagon_circ_brev_intrinsics.h22 #define Q6_circ_load_update_D(dest,ptr,incr,bufsize,K) \ argument
31 #define Q6_circ_load_update_W(dest,ptr,incr,bufsize,K) \ argument
40 #define Q6_circ_load_update_H(dest,ptr,incr,bufsize,K) \ argument
49 #define Q6_circ_load_update_UH(dest,ptr,incr,bufsize,K) \ argument
58 #define Q6_circ_load_update_B(dest,ptr,incr,bufsize,K) \ argument
67 #define Q6_circ_load_update_UB(dest,ptr,incr,bufsize,K) \ argument
77 #define Q6_circ_store_update_D(src,ptr,incr,bufsize,K) \ argument
86 #define Q6_circ_store_update_W(src,ptr,incr,bufsize,K) \ argument
95 #define Q6_circ_store_update_HL(src,ptr,incr,bufsize,K) \ argument
104 #define Q6_circ_store_update_HH(src,ptr,incr,bufsize,K) \ argument
[all …]
/llvm-project-15.0.7/clang-tools-extra/test/clang-tidy/checkers/modernize/
H A Dloop-convert-negative.cpp111 int K = *I; in notBeginOrEnd() local
114 int K = *I; in notBeginOrEnd() local
119 int K = *I; in badLoopShapes() local
122 int K = *I; in badLoopShapes() local
125 int K = *I; in badLoopShapes() local
138 int K = *I; in iteratorArrayMix() local
141 int K = *I; in iteratorArrayMix() local
152 int K = *I; in badConstructor() local
154 int K = *I; in badConstructor() local
204 int K = *I; in differentContainers() local
[all …]
/llvm-project-15.0.7/clang/include/clang/Analysis/
H A DAnyCall.h66 Kind K; variable
73 if (D && ((K == Function && !isa<FunctionDecl>(D)) || in AnyCall()
74 (K == Block && !isa<BlockDecl>(D)))) in AnyCall()
79 : E(ME), D(ME->getMethodDecl()), K(ObjCMethod) {} in AnyCall()
82 : E(NE), D(NE->getOperatorNew()), K(Allocator) {} in AnyCall()
88 : E(NE), D(NE->getConstructor()), K(Constructor) {} in AnyCall()
101 K = Constructor; in AnyCall()
103 K = Destructor; in AnyCall()
105 K = Function; in AnyCall()
165 switch (K) { in getReturnType()
[all …]
/llvm-project-15.0.7/llvm/unittests/ExecutionEngine/Orc/
H A DResourceTrackerTest.cpp72 void removeResource(ResourceKey K) { Resources.erase(K); } in removeResource() argument
94 return HandleRemove(K); in handleRemoveResources()
122 SRM.removeResource(K); in TEST_F()
161 SRM.removeResource(K); in TEST_F()
169 [&](ResourceKey K) { SRM.recordResource(K); })); in TEST_F() argument
197 SRM.removeResource(K); in TEST_F()
251 [&](ResourceKey K) { ++SRM.getRecordedResources()[K]; })); in TEST_F() argument
261 [&](ResourceKey K) { ++SRM.getRecordedResources()[K]; })); in TEST_F() argument
303 [&](ResourceKey K) { SRM.recordResource(K); })); in TEST_F() argument
352 [&](ResourceKey K) { SRM.recordResource(K, 1); })); in TEST_F() argument
[all …]
/llvm-project-15.0.7/llvm/test/DebugInfo/X86/
H A Dstack-value-dwarf2.ll9 %class.K = type { %class.N, %struct.F, i32 }
14 %"struct.J<K::L, false, int>::Node" = type { %"class.K::L" }
15 %"class.K::L" = type { %class.__thread_id }
17 %"struct.K::M" = type { %class.I, %class.H }
24 %ref.tmp = alloca %class.K, align 8
25 %0 = getelementptr inbounds %class.K, %class.K* %ref.tmp, i32 0, i32 0, i32 0, i32 0
27 %1 = bitcast %class.K* %ref.tmp to i64*
28 %LastSearch.i.i = getelementptr inbounds %class.K, %class.K* %ref.tmp, i32 0, i32 0, i32 0
44 …%Handle2.i.i.i.i.i = getelementptr inbounds %"struct.K::M", %"struct.K::M"* %call4.i, i32 0, i32 0…
45 …%Handle.i.i.i.i.i = getelementptr inbounds %"struct.K::M", %"struct.K::M"* %call4.i, i32 0, i32 1,…
[all …]
/llvm-project-15.0.7/libcxx/test/std/containers/container.node/
H A Dnode_handle.pass.cpp19 template <class K, class T, class C1, class C2, class H1, class H2, class E1, class E2, class A_set…
23 …std::is_same_v<typename std::map<K, T, C1, A_map>::node_type, typename std::map<K, T…
24 …std::is_same_v<typename std::map<K, T, C1, A_map>::node_type, typename std::multimap…
25 …std::is_same_v<typename std::set<K, C1, A_set>::node_type, typename std::set<K, C…
26 …std::is_same_v<typename std::set<K, C1, A_set>::node_type, typename std::multiset…
27 …std::is_same_v<typename std::unordered_map<K, T, H1, E1, A_map>::node_type, typename std::unordere…
28 …std::is_same_v<typename std::unordered_map<K, T, H1, E1, A_map>::node_type, typename std::unordere…
29 …std::is_same_v<typename std::unordered_set<K, H1, E1, A_set>::node_type, typename std::unordere…
30 …std::is_same_v<typename std::unordered_set<K, H1, E1, A_set>::node_type, typename std::unordere…
/llvm-project-15.0.7/clang/include/clang/ASTMatchers/Dynamic/
H A DVariantValue.h45 ArgKind(Kind K) : K(K) { assert(K != AK_Matcher); } in ArgKind() argument
56 Kind getArgKind() const { return K; } in getArgKind()
58 assert(K == AK_Matcher); in getMatcherKind()
62 assert(K == AK_Node); in getNodeKind()
75 if ((K == AK_Matcher && Other.K == AK_Matcher) ||
76 (K == AK_Node && Other.K == AK_Node))
78 return K < Other.K;
85 ArgKind(Kind K, ASTNodeKind NK) : K(K), NodeKind(NK) {} in ArgKind() argument
86 Kind K; variable
/llvm-project-15.0.7/llvm/lib/Object/
H A DCOFFModuleDefinition.cpp53 Kind K; member
130 return Token(K, Word); in lex()
148 } while (Tok.K != Eof); in parse()
171 if (Tok.K != Expected) in expect()
180 switch (Tok.K) { in parseOne()
227 if (Tok.K == Equal) { in parseExport()
229 if (Tok.K != Identifier) in parseExport()
267 if (Tok.K == KwData) { in parseExport()
297 if (Tok.K != Comma) { in parseNumbers()
318 if (Tok.K == KwBase) { in parseName()
[all …]
/llvm-project-15.0.7/libcxx/benchmarks/
H A Dmap.bench.cpp246 for (auto K : Data.Keys) { in run() local
288 for (auto K : Data.Keys) { in run() local
827 for (auto K : Data.Keys) { in run() local
831 size_t I = Map.count(K); in run()
859 for (auto K : Data.Keys) { in run() local
863 auto Itor = Map.find(K); in run()
891 for (auto K : Data.Keys) { in run() local
898 auto Key = K; in run()
931 for (auto K : Data.Keys) { in run() local
963 for (auto K : Data.Keys) { in run() local
[all …]
/llvm-project-15.0.7/clang/test/CodeGenCXX/
H A Dspecialized-static-data-mem-init.cpp8 struct K struct
10 K();
11 K(const K &);
12 ~K();
20 static K needs_guard;
23 template<typename T> K C<T>::needs_guard;
/llvm-project-15.0.7/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DProgramStateTrait.h166 return B.lookup(K);
171 return F.add(B, K, E);
175 return F.remove(B, K);
178 static bool Contains(data_type B, key_type K) {
179 return B.contains(K);
212 return F.add(B, K);
216 return F.remove(B, K);
219 static bool Contains(data_type B, key_type K) {
220 return B.contains(K);
244 return F.add(K, L);
[all …]
/llvm-project-15.0.7/clang-tools-extra/test/clang-tidy/checkers/readability/
H A Dcontainer-contains.cpp8 unsigned count(const Key &K) const;
9 bool contains(const Key &K) const;
10 void *find(const Key &K);
16 unsigned count(const Key &K) const;
17 bool contains(const Key &K) const;
22 unsigned count(const Key &K) const;
23 bool contains(const Key &K) const;
28 unsigned count(const Key &K) const;
29 bool contains(const Key &K) const;
216 bool contains(const Key &K) const;
[all …]

12345678910>>...39