| /src/external/gpl3/gcc/dist/libsanitizer/tsan/ |
| tsan_vector_clock.h | 25 void Set(Sid sid, Epoch v);
44 ALWAYS_INLINE void VectorClock::Set(Sid sid, Epoch v) {
|
| /src/external/gpl3/gcc.old/dist/libsanitizer/tsan/ |
| tsan_vector_clock.h | 25 void Set(Sid sid, Epoch v);
44 ALWAYS_INLINE void VectorClock::Set(Sid sid, Epoch v) {
|
| /src/external/apache2/llvm/dist/llvm/utils/unittest/googletest/include/gtest/internal/ |
| gtest-filepath.h | 54 // Except for Set methods, all methods are const or static, which provides an
72 Set(rhs);
76 void Set(const FilePath& rhs) {
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| WasmEHFuncInfo.h | 45 const auto &Set = UnwindDestToSrcs.lookup(BB);
47 for (const auto P : Set)
71 const auto &Set = UnwindDestToSrcs.lookup(MBB);
73 for (const auto P : Set)
|
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/DWARF/ |
| DWARFDebugAranges.cpp | 17 #include <set>
27 DWARFDebugArangeSet Set;
31 Set.extract(DebugArangesData, &Offset, RecoverableErrorHandler)) {
35 uint64_t CUOffset = Set.getCompileUnitDIEOffset();
36 for (const auto &Desc : Set.descriptors()) {
88 std::multiset<uint64_t> ValidCUs; // Maintain the set of CUs describing
104 // Update the set of valid CUs.
|
| /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/ |
| sanitizer_allocator_stats.h | 44 void Set(AllocatorStat i, uptr v) {
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/DWARF/ |
| DWARFDebugPubTable.h | 39 /// Each table consists of sets of variable length entries. Each set describes
43 struct Set {
44 /// The total length of the entries for that set, not including the length
48 /// The DWARF format of the set.
56 /// compilation unit header referenced by the set.
67 std::vector<Set> Sets;
81 ArrayRef<Set> getData() { return Sets; }
|
| /src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/ |
| sanitizer_allocator_stats.h | 37 void Set(AllocatorStat i, uptr v) {
|
| /src/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/ |
| sanitizer_allocator_stats.h | 43 void Set(AllocatorStat i, uptr v) {
|
| /src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ProgramStateTrait.h | 11 // to implement set/get methods for manipulating a ProgramState's
76 /// State = State->set<Name>(K, V);
97 /// Declares an immutable set of type \p NameTy, suitable for placement into
104 /// NameTy Set = State->get<Name>();
112 /// Declares an immutable set type \p Name and registers the factory
113 /// for such sets in the program state, but does not add the set itself
166 static data_type Set(data_type B, key_type K, value_type E,
|
| /src/external/apache2/llvm/dist/clang/tools/libclang/ |
| CXString.cpp | 114 CXStringSet *Set = new CXStringSet;
115 Set->Count = Strings.size();
116 Set->Strings = new CXString[Set->Count];
117 for (unsigned SI = 0, SE = Set->Count; SI < SE; ++SI)
118 Set->Strings[SI] = createDup(Strings[SI]);
119 return Set;
185 void clang_disposeStringSet(CXStringSet *set) {
186 for (unsigned SI = 0, SE = set->Count; SI < SE; ++SI)
187 clang_disposeString(set->Strings[SI])
[all...] |
| CIndexDiagnostic.cpp | 160 // -checks the diagnostics, the diagnostics set is lazily created,
166 // the operation but can only query the lazily created set.
169 // diagnostic set was created, in which case we reset it.
172 Set = static_cast<CXDiagnosticSetImpl*>(TU->Diagnostics);
173 if (AU->stored_diag_size() != Set->getNumDiagnostics()) {
176 delete Set;
182 CXDiagnosticSetImpl *Set = new CXDiagnosticSetImpl();
183 TU->Diagnostics = Set;
186 &*DOpts, Set);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| SmallSet.h | 24 #include <set>
31 /// delegating to the underlying SmallVector or Set iterators.
37 using SetIterTy = typename std::set<T, C>::const_iterator;
41 /// Iterators to the parts of the SmallSet containing the data. They are set
56 // MSVC STL, where set<T>::const_iterator is not trivially copy constructible.
129 /// SmallSet - This maintains a set of unique values, optimizing for the case
130 /// when the set is small (less than N). In this case, the set can be
131 /// maintained with no mallocs. If the set gets large, we expand to using an
132 /// std::set to maintain reasonable lookup times
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| RDFDeadCode.cpp | 29 SetQueue() : Set(), Queue() {}
37 Set.erase(V);
41 if (Set.count(V))
44 Set.insert(V);
48 DenseSet<T> Set;
113 // Traverse the DFG and collect the set dead RefNodes and the set of
118 // are then the complement of the set of live nodes.
176 // Erase the nodes given in the Nodes set from DFG. In addition to removing
183 // Prepare the actual set of ref nodes to remove: ref nodes from Node
[all...] |
| BitTracker.h | 21 #include <set>
68 using EdgeSetType = std::set<CFGEdge>;
69 using InstrSetType = std::set<const MachineInstr *>;
87 if (Set.insert(MI).second)
91 Set.erase(front());
104 DenseSet<const MachineInstr*> Set; // Set to avoid adding duplicate entries.
151 // any register, it is more of an abstraction of the two-element set of
437 // Set bit, clear bit.
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/X86/ |
| X86DiscriminateMemOps.cpp | 139 DenseSet<unsigned> &Set = Seen[L];
141 Set.insert(DI->getBaseDiscriminator());
167 Set.insert(DI->getBaseDiscriminator());
169 assert(MustInsert.second && "New discriminator shouldn't be present in set");
|
| /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/ |
| FuzzerDictionary.h | 27 FixedWord(const uint8_t *B, uint8_t S) { Set(B, S); }
29 void Set(const uint8_t *B, uint8_t S) {
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/ |
| DynamicType.cpp | 30 /// A set factory of dynamic cast informations.
101 State = State->set<DynamicTypeMap>(MR->StripCasts(), NewTy);
122 State = State->set<DynamicTypeMap>(MR, CastToTy);
135 CastSet Set = TempSet ? *TempSet : F.getEmptySet();
137 Set = F.add(Set, {CastFromTy, CastToTy, ResultKind});
138 State = State->set<DynamicCastMap>(MR, Set);
147 State = State->set<DynamicClassObjectMap>(Sym, NewTy);
257 static raw_ostream &printJson(const CastSet &Set, raw_ostream &Out
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/MC/ |
| MCSubtargetInfo.cpp | 34 /// For each feature that is (transitively) implied by this feature, set it.
70 Bits.set(FeatureEntry->Value);
72 // For each feature that this implies, set it.
173 // Set the features implied by this CPU feature, if any.
186 // Set the features implied by this CPU feature, if any.
278 FeatureBits.set(FeatureEntry->Value);
280 // For each feature that this implies, set it.
299 FeatureBitset Set, All;
301 ::ApplyFeatureFlag(Set, F, ProcFeatures);
306 return (FeatureBits & All) == Set;
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/TableGen/ |
| SetTheory.cpp | 46 // (sub Add, Sub, ...) Set difference.
51 PrintFatalError(Loc, "Set difference needs at least two arguments: " +
62 // (and S1, S2) Set intersection.
67 PrintFatalError(Loc, "Set intersection requires two arguments: " +
80 virtual void apply2(SetTheory &ST, DagInit *Expr, RecSet &Set, int64_t N,
86 PrintFatalError(Loc, "Operator requires (Op Set, Int) arguments: " +
88 RecSet Set;
89 ST.evaluate(Expr->arg_begin()[0], Set, Loc);
94 apply2(ST, Expr, Set, II->getValue(), Elts, Loc);
100 void apply2(SetTheory &ST, DagInit *Expr, RecSet &Set, int64_t N
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| GCNMinRegStrategy.cpp | 178 SmallPtrSet<const SUnit*, 32> Set;
187 Set.insert(PSU);
191 SmallVector<const SUnit*, 32> Worklist(Set.begin(), Set.end());
197 Set.insert(P.getSUnit()).second)
205 if (Set.count(C.SU)) {
|
| /src/external/gpl3/gcc/dist/gcc/ |
| hash-set-tests.cc | 1 /* Unit tests for hash-set.h.
25 #include "hash-set.h"
56 /* Verify that the values are now within the set. */
101 /* Verify that the values are now within the set. */
228 typedef hash_set <val_t, false, value_hash_traits> Set;
231 Set s;
241 Set s;
249 Set s;
258 Set s;
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| hash-set-tests.cc | 1 /* Unit tests for hash-set.h.
25 #include "hash-set.h"
56 /* Verify that the values are now within the set. */
101 /* Verify that the values are now within the set. */
228 typedef hash_set <val_t, false, value_hash_traits> Set;
231 Set s;
241 Set s;
249 Set s;
258 Set s;
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/ |
| InnerPointerChecker.cpp | 27 // Associate container objects with a set of raw pointer symbols.
242 // Start tracking this raw pointer by adding it to the set of symbols
247 PtrSet Set = SetPtr ? *SetPtr : F.getEmptySet();
248 assert(C.wasInlined || !Set.contains(Sym));
249 Set = F.add(Set, Sym);
251 State = State->set<RawPtrMap>(ObjRegion, Set);
281 : State->set<RawPtrMap>(Entry.first, CleanedUpSet);
|
| /src/external/apache2/llvm/dist/llvm/tools/obj2yaml/ |
| dwarf2yaml.cpp | 102 DWARFDebugArangeSet Set;
107 // WarningHandler parameter of Set.extract().
111 if (Error E = Set.extract(ArangesData, &Offset, DiscardError))
114 Range.Format = Set.getHeader().Format;
115 Range.Length = Set.getHeader().Length;
116 Range.Version = Set.getHeader().Version;
117 Range.CuOffset = Set.getHeader().CuOffset;
118 Range.AddrSize = Set.getHeader().AddrSize;
119 Range.SegSize = Set.getHeader().SegSize;
120 for (auto Descriptor : Set.descriptors())
[all...] |
