HomeSort by: relevance | last modified time | path
    Searched refs:Sort (Results 1 - 25 of 43) sorted by relevancy

1 2

  /src/external/apache2/llvm/dist/llvm/include/llvm/XRay/
Trace.h 71 Expected<Trace> loadTraceFile(StringRef Filename, bool Sort = false);
75 Expected<Trace> loadTrace(const DataExtractor &Extractor, bool Sort = false);
  /src/external/apache2/llvm/dist/llvm/lib/Support/
Z3Solver.cpp 66 /// Wrapper for Z3 Sort
72 Z3_sort Sort;
76 Z3Sort(Z3Context &C, Z3_sort ZS) : Context(C), Sort(ZS) {
77 Z3_inc_ref(Context.Context, reinterpret_cast<Z3_ast>(Sort));
81 Z3Sort(const Z3Sort &Other) : Context(Other.Context), Sort(Other.Sort) {
82 Z3_inc_ref(Context.Context, reinterpret_cast<Z3_ast>(Sort));
88 Z3_inc_ref(Context.Context, reinterpret_cast<Z3_ast>(Other.Sort));
89 Z3_dec_ref(Context.Context, reinterpret_cast<Z3_ast>(Sort));
90 Sort = Other.Sort
    [all...]
  /src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/
sanitizer_range.cpp 38 Sort(events.data(), events.size(),
sanitizer_lzw.h 41 Sort(dict_len1.data(), dict_len1.size());
49 // Remap after the Sort.
sanitizer_coverage_libcdep_new.cpp 67 Sort(pcs, len);
sanitizer_allocator_secondary.h 210 Sort(reinterpret_cast<uptr *>(chunks), n_chunks_);
277 EnsureSortedChunks(); // Avoid doing the sort while iterating.
sanitizer_common.h 662 void Sort(T *v, uptr size, Compare comp = {}) {
733 Sort(v.data(), v.size(), comp);
  /src/external/apache2/llvm/dist/llvm/lib/XRay/
Trace.cpp 322 // This is now the meat of the algorithm. Here we sort the blocks according to
325 // After the sort, we then reconstitute `Trace` records using a stateful
330 llvm::sort(Blocks, [](const BlockIndexer::Block &L,
380 Expected<Trace> llvm::xray::loadTraceFile(StringRef Filename, bool Sort) {
410 auto TraceOrError = loadTrace(LittleEndianDE, Sort);
414 TraceOrError = loadTrace(BigEndianDE, Sort);
419 Expected<Trace> llvm::xray::loadTrace(const DataExtractor &DE, bool Sort) {
471 if (Sort)
  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/
sanitizer_common_test.cc 42 Sort(array, n);
48 Sort(array, n);
54 Sort(array, n);
60 Sort(array, n);
67 Sort(array, n);
69 // Minimal case - sort three elements.
72 Sort(array, 2);
265 std::sort(data.begin(), data.end());
  /src/sys/external/bsd/compiler_rt/dist/lib/asan/
asan_memory_profile.cc 52 Sort(allocations_.data(), allocations_.size(),
  /src/external/gpl3/gcc/dist/libsanitizer/asan/
asan_memory_profile.cpp 50 Sort(allocations_.data(), allocations_.size(),
  /src/external/gpl3/gcc.old/dist/libsanitizer/asan/
asan_memory_profile.cpp 51 Sort(allocations_.data(), allocations_.size(),
  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/
sanitizer_stackdepot.cc 149 Sort(map_.data(), map_.size(), &IdDescPair::IdComparator);
sanitizer_coverage_libcdep_new.cc 66 Sort(pcs, len);
sanitizer_allocator_secondary.h 208 Sort(reinterpret_cast<uptr *>(chunks), n_chunks_);
277 EnsureSortedChunks(); // Avoid doing the sort while iterating.
  /src/external/gpl3/gcc/dist/libsanitizer/lsan/
lsan_common_fuchsia.cpp 109 __sanitizer::Sort(params.allocator_caches.data(),
lsan_common.cpp 707 Sort(threads.data(), threads.size());
900 Sort(leaks_.data(), leaks_.size(), &LeakComparator);
  /src/external/gpl3/gcc.old/dist/libsanitizer/lsan/
lsan_common_fuchsia.cpp 100 __sanitizer::Sort(params.allocator_caches.data(),
  /src/external/apache2/llvm/dist/libcxx/benchmarks/
algorithms.bench.cpp 116 std::sort(V.begin(), V.end());
119 std::sort(V.begin(), V.end(), std::greater<>());
125 std::sort(V.begin(), V.end());
189 struct Sort {
195 [](auto& Copy) { std::sort(Copy.begin(), Copy.end()); });
327 makeCartesianProductBenchmark<Sort, AllValueTypes, AllOrders>(Quantities);
  /src/external/gpl2/gettext/dist/gettext-tools/libuniname/
gen-uninames 100 ;; Sort the word lists.
110 (sort (word-list-sorted word-list) #'string<)
217 ;; Sort the list of unicode-chars by word-indices.
219 (sort all-chars
272 (dolist (uc (sort (copy-list all-chars) #'< :key #'unicode-char-code))
  /src/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/
sanitizer_coverage_libcdep_new.cpp 65 Sort(pcs, len);
sanitizer_allocator_secondary.h 210 Sort(reinterpret_cast<uptr *>(chunks), n_chunks_);
277 EnsureSortedChunks(); // Avoid doing the sort while iterating.
  /src/external/apache2/llvm/dist/llvm/include/llvm/Support/
SMTAPI.h 31 /// Returns true if the sort is a bitvector, calls isBitvectorSortImpl().
34 /// Returns true if the sort is a floating-point, calls isFloatSortImpl().
37 /// Returns true if the sort is a boolean, calls isBooleanSortImpl().
40 /// Returns the bitvector size, fails if the sort is not a bitvector
43 assert(isBitvectorSort() && "Not a bitvector sort!");
49 /// Returns the floating-point size, fails if the sort is not a floating-point
52 assert(isFloatSort() && "Not a floating-point sort!");
80 /// Query the SMT solver and checks if a sort is bitvector.
83 /// Query the SMT solver and checks if a sort is floating-point.
86 /// Query the SMT solver and checks if a sort is boolean
    [all...]
  /src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
SMTConv.h 26 // Returns an appropriate sort, given a QualType and it's bit width.
96 "AST's must have the same sort!");
206 "AST's must have the same sort!");
298 llvm::SMTSortRef Sort = Solver->getFloatSort(ToBitWidth);
300 ? Solver->mkSBVtoFP(Exp, Sort)
301 : Solver->mkUBVtoFP(Exp, Sort);
  /src/sys/external/bsd/compiler_rt/dist/lib/lsan/
lsan_common.cc 548 Sort(threads.data(), threads.size());
714 Sort(leaks_.data(), leaks_.size(), &LeakComparator);

Completed in 41 milliseconds

1 2