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

1 2

  /src/external/apache2/llvm/dist/clang/include/clang/AST/
LexicallyOrderedRecursiveASTVisitor.h 117 bool Swap;
124 Swap = true;
129 Swap = Children.size() != 2;
132 Swap = CE->isInfixBinaryOp();
135 if (Swap && Children.size() > 1)
136 std::swap(Children[0], Children[1]);
  /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/GSYM/
GsymReader.cpp 80 Swap.reset(new SwappedData);
89 if (Swap) {
92 Swap->Hdr = ExpectedHdr.get();
95 Hdr = &Swap->Hdr;
104 if (!Swap) {
142 Swap->AddrOffsets.resize(Hdr->NumAddresses * Hdr->AddrOffSize);
145 if (!Data.getU8(&Offset, Swap->AddrOffsets.data(), Hdr->NumAddresses))
151 reinterpret_cast<uint16_t *>(Swap->AddrOffsets.data()),
158 reinterpret_cast<uint32_t *>(Swap->AddrOffsets.data()),
165 reinterpret_cast<uint64_t *>(Swap->AddrOffsets.data())
    [all...]
  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/
sanitizer_allocator.h 67 Swap(a[i], a[RandN(&state, i + 1)]);
sanitizer_common.h 406 // Don't use std::min, std::max or std::swap, to minimize dependency
410 template<class T> void Swap(T& a, T& b) {
504 void swap(InternalMmapVectorNoCtor &other) { function in class:__sanitizer::InternalMmapVectorNoCtor
505 Swap(data_, other.data_);
506 Swap(capacity_bytes_, other.capacity_bytes_);
507 Swap(size_, other.size_);
590 Swap(v[j], v[p]);
595 // Stage 2: swap largest element with the last one,
598 Swap(v[0], v[i]);
609 Swap(v[j], v[max_ind])
    [all...]
sanitizer_deadlock_detector.h 82 Swap(recursive_locks[i], recursive_locks[n_recursive_locks]);
93 Swap(all_locks_with_contexts_[i],
165 Swap(edges_[i], edges_[n_edges_ - 1]);
  /src/sys/external/bsd/compiler_rt/dist/lib/tsan/rtl/
tsan_stack_trace.cc 48 Swap(trace_buffer[i], trace_buffer[size - 1 - i]);
  /src/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/
sanitizer_allocator.h 61 Swap(a[i], a[RandN(&state, i + 1)]);
sanitizer_common.h 453 // Don't use std::min, std::max or std::swap, to minimize dependency
463 template<class T> void Swap(T& a, T& b) {
558 void swap(InternalMmapVectorNoCtor &other) { function in class:__sanitizer::InternalMmapVectorNoCtor
559 Swap(data_, other.data_);
560 Swap(capacity_bytes_, other.capacity_bytes_);
561 Swap(size_, other.size_);
644 Swap(v[j], v[p]);
649 // Stage 2: swap largest element with the last one,
652 Swap(v[0], v[i]);
663 Swap(v[j], v[max_ind])
    [all...]
sanitizer_deadlock_detector.h 80 Swap(recursive_locks[i], recursive_locks[n_recursive_locks]);
90 Swap(all_locks_with_contexts_[i],
161 Swap(edges_[i], edges_[n_edges_ - 1]);
  /src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/
sanitizer_allocator.h 61 Swap(a[i], a[RandN(&state, i + 1)]);
sanitizer_common.h 475 // Don't use std::min, std::max or std::swap, to minimize dependency
489 template<class T> void Swap(T& a, T& b) {
584 void swap(InternalMmapVectorNoCtor &other) { function in class:__sanitizer::InternalMmapVectorNoCtor
585 Swap(data_, other.data_);
586 Swap(capacity_bytes_, other.capacity_bytes_);
587 Swap(size_, other.size_);
671 Swap(v[j], v[p]);
676 // Stage 2: swap largest element with the last one,
679 Swap(v[0], v[i]);
690 Swap(v[j], v[max_ind])
    [all...]
sanitizer_deadlock_detector.h 80 Swap(recursive_locks[i], recursive_locks[n_recursive_locks]);
90 Swap(all_locks_with_contexts_[i],
161 Swap(edges_[i], edges_[n_edges_ - 1]);
sanitizer_dense_map.h 594 swap(other);
602 void swap(DenseMap &RHS) { function in class:__sanitizer::DenseMap
603 Swap(Buckets, RHS.Buckets);
604 Swap(NumEntries, RHS.NumEntries);
605 Swap(NumTombstones, RHS.NumTombstones);
606 Swap(NumBuckets, RHS.NumBuckets);
619 swap(other);
  /src/external/gpl3/gcc/dist/libsanitizer/tsan/
tsan_stack_trace.cpp 43 Swap(trace_buffer[i], trace_buffer[size - 1 - i]);
  /src/external/gpl3/gcc.old/dist/libsanitizer/tsan/
tsan_stack_trace.cpp 43 Swap(trace_buffer[i], trace_buffer[size - 1 - i]);
  /src/usr.sbin/sysinst/arch/mvme68k/
msg.md.de 76 Mindestens 2 freie Partitionen (f�r das Root Dateisystem und Swap) sind n�tig.
  /src/usr.sbin/sysinst/arch/virt68k/
msg.md.de 76 Mindestens 2 freie Partitionen (f�r das Root Dateisystem und Swap) sind n�tig.
  /src/external/apache2/llvm/dist/libcxx/benchmarks/
function.bench.cpp 154 struct Swap {
159 values[0].swap(values[1]);
226 makeCartesianProductBenchmark<Swap, AllFunctionTypes, AllFunctionTypes>();
  /src/sys/external/bsd/compiler_rt/dist/lib/builtins/
fp_add_impl.inc 52 // Swap a and b if necessary so that a has the larger absolute value.
  /src/usr.sbin/sysinst/arch/atari/
msg.md.de 62 wollen, auf 'NBD'. Setzen Sie zus�tzlich die 'Id' der als Swap zu nutzenden
  /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/GSYM/
GsymReader.h 40 /// any parsing needed. If the endianness doesn't match, we swap these objects
69 std::unique_ptr<SwappedData> Swap;
  /src/sys/arch/mips/mips/
cache_r3k_subr.S 159 # Swap the caches (so we store to I$) and isolate them from memory.
  /src/sys/external/bsd/compiler_rt/dist/lib/asan/
asan_win.cc 87 Swap(ExceptionFilter, user_seh_handler);
  /src/external/gpl3/gcc/dist/libsanitizer/asan/
asan_win.cpp 86 Swap(ExceptionFilter, user_seh_handler);
  /src/external/gpl3/gcc.old/dist/libsanitizer/asan/
asan_win.cpp 86 Swap(ExceptionFilter, user_seh_handler);

Completed in 95 milliseconds

1 2