File Manager

003 File Manager

Current Path: /usr/src/contrib/llvm-project/compiler-rt/lib/sanitizer_common

usr / src / contrib / llvm-project / compiler-rt / lib / sanitizer_common /

📁 ..
📄 sancov_flags.cpp(1.64 KB)
📄 sancov_flags.h(1.08 KB)
📄 sancov_flags.inc(777 B)
📄 sanitizer_addrhashmap.h(9.19 KB)
📄 sanitizer_allocator.cpp(8.73 KB)
📄 sanitizer_allocator.h(2.69 KB)
📄 sanitizer_allocator_bytemap.h(3.12 KB)
📄 sanitizer_allocator_checks.cpp(686 B)
📄 sanitizer_allocator_checks.h(2.67 KB)
📄 sanitizer_allocator_combined.h(6.29 KB)
📄 sanitizer_allocator_interface.h(1.83 KB)
📄 sanitizer_allocator_internal.h(2.03 KB)
📄 sanitizer_allocator_local_cache.h(8.95 KB)
📄 sanitizer_allocator_primary32.h(12.64 KB)
📄 sanitizer_allocator_primary64.h(32.71 KB)
📄 sanitizer_allocator_report.cpp(4.68 KB)
📄 sanitizer_allocator_report.h(1.72 KB)
📄 sanitizer_allocator_secondary.h(10.78 KB)
📄 sanitizer_allocator_size_class_map.h(10.12 KB)
📄 sanitizer_allocator_stats.h(2.76 KB)
📄 sanitizer_asm.h(2.57 KB)
📄 sanitizer_atomic.h(1.97 KB)
📄 sanitizer_atomic_clang.h(3.42 KB)
📄 sanitizer_atomic_clang_mips.h(3.77 KB)
📄 sanitizer_atomic_clang_other.h(3.02 KB)
📄 sanitizer_atomic_clang_x86.h(3.77 KB)
📄 sanitizer_atomic_msvc.h(8.53 KB)
📄 sanitizer_bitvector.h(9.43 KB)
📄 sanitizer_bvgraph.h(4.62 KB)
📄 sanitizer_common.cpp(10.13 KB)
📄 sanitizer_common.h(30.64 KB)
📄 sanitizer_common_interceptors.inc(348.66 KB)
📄 sanitizer_common_interceptors_format.inc(16.84 KB)
📄 sanitizer_common_interceptors_ioctl.inc(22.13 KB)
📄 sanitizer_common_interceptors_netbsd_compat.inc(4.07 KB)
📄 sanitizer_common_interceptors_vfork_aarch64.inc.S(1.23 KB)
📄 sanitizer_common_interceptors_vfork_arm.inc.S(1.24 KB)
📄 sanitizer_common_interceptors_vfork_i386.inc.S(1.66 KB)
📄 sanitizer_common_interceptors_vfork_x86_64.inc.S(1.03 KB)
📄 sanitizer_common_interface.inc(2.05 KB)
📄 sanitizer_common_interface_posix.inc(732 B)
📄 sanitizer_common_libcdep.cpp(5.4 KB)
📄 sanitizer_common_nolibc.cpp(1.12 KB)
📄 sanitizer_common_syscalls.inc(85 KB)
📄 sanitizer_coverage_fuchsia.cpp(10.1 KB)
📄 sanitizer_coverage_interface.inc(1.73 KB)
📄 sanitizer_coverage_libcdep_new.cpp(7.39 KB)
📄 sanitizer_coverage_win_dll_thunk.cpp(1.03 KB)
📄 sanitizer_coverage_win_dynamic_runtime_thunk.cpp(1.16 KB)
📄 sanitizer_coverage_win_sections.cpp(3.36 KB)
📄 sanitizer_coverage_win_weak_interception.cpp(1.17 KB)
📄 sanitizer_dbghelp.h(1.44 KB)
📄 sanitizer_deadlock_detector.h(13.28 KB)
📄 sanitizer_deadlock_detector1.cpp(5.6 KB)
📄 sanitizer_deadlock_detector2.cpp(10.84 KB)
📄 sanitizer_deadlock_detector_interface.h(2.66 KB)
📄 sanitizer_errno.cpp(1.09 KB)
📄 sanitizer_errno.h(1.3 KB)
📄 sanitizer_errno_codes.h(1.1 KB)
📄 sanitizer_file.cpp(6.24 KB)
📄 sanitizer_file.h(3.67 KB)
📄 sanitizer_flag_parser.cpp(5.55 KB)
📄 sanitizer_flag_parser.h(5.71 KB)
📄 sanitizer_flags.cpp(3.95 KB)
📄 sanitizer_flags.h(2.13 KB)
📄 sanitizer_flags.inc(12.73 KB)
📄 sanitizer_freebsd.h(3.31 KB)
📄 sanitizer_fuchsia.cpp(16.58 KB)
📄 sanitizer_fuchsia.h(1.03 KB)
📄 sanitizer_getauxval.h(1.73 KB)
📄 sanitizer_glibc_version.h(748 B)
📄 sanitizer_hash.h(1.04 KB)
📄 sanitizer_interceptors_ioctl_netbsd.inc(68.81 KB)
📄 sanitizer_interface_internal.h(5.28 KB)
📄 sanitizer_internal_defs.h(14.28 KB)
📄 sanitizer_lfstack.h(2.08 KB)
📄 sanitizer_libc.cpp(7.21 KB)
📄 sanitizer_libc.h(3.23 KB)
📄 sanitizer_libignore.cpp(4.24 KB)
📄 sanitizer_libignore.h(3.5 KB)
📄 sanitizer_linux.cpp(71.58 KB)
📄 sanitizer_linux.h(5.47 KB)
📄 sanitizer_linux_libcdep.cpp(25.67 KB)
📄 sanitizer_linux_s390.cpp(6.91 KB)
📄 sanitizer_list.h(3.81 KB)
📄 sanitizer_local_address_space_view.h(3.67 KB)
📄 sanitizer_mac.cpp(38.67 KB)
📄 sanitizer_mac.h(2.49 KB)
📄 sanitizer_mac_libcdep.cpp(968 B)
📄 sanitizer_malloc_mac.inc(13.06 KB)
📄 sanitizer_mutex.h(5.17 KB)
📄 sanitizer_netbsd.cpp(9.95 KB)
📄 sanitizer_openbsd.cpp(3.17 KB)
📄 sanitizer_persistent_allocator.cpp(687 B)
📄 sanitizer_persistent_allocator.h(2.31 KB)
📄 sanitizer_placement_new.h(885 B)
📄 sanitizer_platform.h(10.11 KB)
📄 sanitizer_platform_interceptors.h(24.93 KB)
📄 sanitizer_platform_limits_freebsd.cpp(19.79 KB)
📄 sanitizer_platform_limits_freebsd.h(18.41 KB)
📄 sanitizer_platform_limits_linux.cpp(3.32 KB)
📄 sanitizer_platform_limits_netbsd.cpp(109.73 KB)
📄 sanitizer_platform_limits_netbsd.h(81.54 KB)
📄 sanitizer_platform_limits_openbsd.cpp(8.69 KB)
📄 sanitizer_platform_limits_openbsd.h(8.68 KB)
📄 sanitizer_platform_limits_posix.cpp(48.89 KB)
📄 sanitizer_platform_limits_posix.h(40.65 KB)
📄 sanitizer_platform_limits_solaris.cpp(11.93 KB)
📄 sanitizer_platform_limits_solaris.h(12.26 KB)
📄 sanitizer_posix.cpp(11.93 KB)
📄 sanitizer_posix.h(5.14 KB)
📄 sanitizer_posix_libcdep.cpp(16.21 KB)
📄 sanitizer_printf.cpp(12.07 KB)
📄 sanitizer_procmaps.h(2.93 KB)
📄 sanitizer_procmaps_bsd.cpp(3.81 KB)
📄 sanitizer_procmaps_common.cpp(5.27 KB)
📄 sanitizer_procmaps_fuchsia.cpp(2.51 KB)
📄 sanitizer_procmaps_linux.cpp(2.9 KB)
📄 sanitizer_procmaps_mac.cpp(13.7 KB)
📄 sanitizer_procmaps_solaris.cpp(2.18 KB)
📄 sanitizer_ptrauth.h(720 B)
📄 sanitizer_quarantine.h(9.57 KB)
📄 sanitizer_report_decorator.h(1.89 KB)
📄 sanitizer_ring_buffer.h(4.7 KB)
📄 sanitizer_rtems.cpp(7.61 KB)
📄 sanitizer_rtems.h(772 B)
📄 sanitizer_signal_interceptors.inc(2.89 KB)
📄 sanitizer_solaris.cpp(6.6 KB)
📄 sanitizer_stackdepot.cpp(4.54 KB)
📄 sanitizer_stackdepot.h(2.13 KB)
📄 sanitizer_stackdepotbase.h(5.58 KB)
📄 sanitizer_stacktrace.cpp(4.58 KB)
📄 sanitizer_stacktrace.h(5.65 KB)
📄 sanitizer_stacktrace_libcdep.cpp(5.54 KB)
📄 sanitizer_stacktrace_printer.cpp(9.08 KB)
📄 sanitizer_stacktrace_printer.h(3.08 KB)
📄 sanitizer_stacktrace_sparc.cpp(3.05 KB)
📄 sanitizer_stoptheworld.h(2.34 KB)
📄 sanitizer_stoptheworld_fuchsia.cpp(1.28 KB)
📄 sanitizer_stoptheworld_linux_libcdep.cpp(20.8 KB)
📄 sanitizer_stoptheworld_mac.cpp(5.29 KB)
📄 sanitizer_stoptheworld_netbsd_libcdep.cpp(11.02 KB)
📄 sanitizer_suppressions.cpp(5.67 KB)
📄 sanitizer_suppressions.h(1.69 KB)
📄 sanitizer_symbolizer.cpp(3.65 KB)
📄 sanitizer_symbolizer.h(6.62 KB)
📄 sanitizer_symbolizer_fuchsia.h(1.56 KB)
📄 sanitizer_symbolizer_internal.h(5.8 KB)
📄 sanitizer_symbolizer_libbacktrace.cpp(6.1 KB)
📄 sanitizer_symbolizer_libbacktrace.h(1.49 KB)
📄 sanitizer_symbolizer_libcdep.cpp(17.45 KB)
📄 sanitizer_symbolizer_mac.cpp(8.48 KB)
📄 sanitizer_symbolizer_mac.h(1.37 KB)
📄 sanitizer_symbolizer_markup.cpp(5.39 KB)
📄 sanitizer_symbolizer_posix_libcdep.cpp(16.5 KB)
📄 sanitizer_symbolizer_report.cpp(10.01 KB)
📄 sanitizer_symbolizer_rtems.h(1.56 KB)
📄 sanitizer_symbolizer_win.cpp(11.59 KB)
📄 sanitizer_syscall_generic.inc(1.06 KB)
📄 sanitizer_syscall_linux_aarch64.inc(4.58 KB)
📄 sanitizer_syscall_linux_arm.inc(4.58 KB)
📄 sanitizer_syscall_linux_x86_64.inc(3.07 KB)
📄 sanitizer_syscalls_netbsd.inc(120.97 KB)
📄 sanitizer_termination.cpp(2.86 KB)
📄 sanitizer_thread_registry.cpp(10.31 KB)
📄 sanitizer_thread_registry.h(5.44 KB)
📄 sanitizer_tls_get_addr.cpp(5.29 KB)
📄 sanitizer_tls_get_addr.h(2.21 KB)
📄 sanitizer_type_traits.cpp(708 B)
📄 sanitizer_type_traits.h(1.49 KB)
📄 sanitizer_unwind_linux_libcdep.cpp(6.13 KB)
📄 sanitizer_unwind_win.cpp(2.41 KB)
📄 sanitizer_vector.h(2.57 KB)
📄 sanitizer_win.cpp(33.3 KB)
📄 sanitizer_win.h(851 B)
📄 sanitizer_win_defs.h(7.23 KB)
📄 sanitizer_win_dll_thunk.cpp(3.41 KB)
📄 sanitizer_win_dll_thunk.h(11.13 KB)
📄 sanitizer_win_dynamic_runtime_thunk.cpp(1.16 KB)
📄 sanitizer_win_weak_interception.cpp(3.49 KB)
📄 sanitizer_win_weak_interception.h(1.64 KB)
📁 symbolizer
📄 weak_symbols.txt(230 B)

Editing: sanitizer_addrhashmap.h

//===-- sanitizer_addrhashmap.h ---------------------------------*- C++ -*-===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
//
// Concurrent uptr->T hashmap.
//
//===----------------------------------------------------------------------===//

#ifndef SANITIZER_ADDRHASHMAP_H
#define SANITIZER_ADDRHASHMAP_H

#include "sanitizer_common.h"
#include "sanitizer_mutex.h"
#include "sanitizer_atomic.h"
#include "sanitizer_allocator_internal.h"

namespace __sanitizer {

// Concurrent uptr->T hashmap.
// T must be a POD type, kSize is preferably a prime but can be any number.
// Usage example:
//
// typedef AddrHashMap<uptr, 11> Map;
// Map m;
// {
//   Map::Handle h(&m, addr);
//   use h.operator->() to access the data
//   if h.created() then the element was just created, and the current thread
//     has exclusive access to it
//   otherwise the current thread has only read access to the data
// }
// {
//   Map::Handle h(&m, addr, true);
//   this will remove the data from the map in Handle dtor
//   the current thread has exclusive access to the data
//   if !h.exists() then the element never existed
// }
template<typename T, uptr kSize>
class AddrHashMap {
 private:
  struct Cell {
    atomic_uintptr_t addr;
    T                val;
  };

struct AddBucket {
    uptr cap;
    uptr size;
    Cell cells[1];  // variable len
  };

static const uptr kBucketSize = 3;

struct Bucket {
    RWMutex          mtx;
    atomic_uintptr_t add;
    Cell             cells[kBucketSize];
  };

public:
  AddrHashMap();

class Handle {
   public:
    Handle(AddrHashMap<T, kSize> *map, uptr addr);
    Handle(AddrHashMap<T, kSize> *map, uptr addr, bool remove);
    Handle(AddrHashMap<T, kSize> *map, uptr addr, bool remove, bool create);

~Handle();
    T *operator->();
    T &operator*();
    const T &operator*() const;
    bool created() const;
    bool exists() const;

private:
    friend AddrHashMap<T, kSize>;
    AddrHashMap<T, kSize> *map_;
    Bucket                *bucket_;
    Cell                  *cell_;
    uptr                   addr_;
    uptr                   addidx_;
    bool                   created_;
    bool                   remove_;
    bool                   create_;
  };

private:
  friend class Handle;
  Bucket *table_;

void acquire(Handle *h);
  void release(Handle *h);
  uptr calcHash(uptr addr);
};

template<typename T, uptr kSize>
AddrHashMap<T, kSize>::Handle::Handle(AddrHashMap<T, kSize> *map, uptr addr) {
  map_ = map;
  addr_ = addr;
  remove_ = false;
  create_ = true;
  map_->acquire(this);
}

template<typename T, uptr kSize>
AddrHashMap<T, kSize>::Handle::Handle(AddrHashMap<T, kSize> *map, uptr addr,
    bool remove) {
  map_ = map;
  addr_ = addr;
  remove_ = remove;
  create_ = true;
  map_->acquire(this);
}

template<typename T, uptr kSize>
AddrHashMap<T, kSize>::Handle::Handle(AddrHashMap<T, kSize> *map, uptr addr,
    bool remove, bool create) {
  map_ = map;
  addr_ = addr;
  remove_ = remove;
  create_ = create;
  map_->acquire(this);
}

template<typename T, uptr kSize>
AddrHashMap<T, kSize>::Handle::~Handle() {
  map_->release(this);
}

template <typename T, uptr kSize>
T *AddrHashMap<T, kSize>::Handle::operator->() {
  return &cell_->val;
}

template <typename T, uptr kSize>
const T &AddrHashMap<T, kSize>::Handle::operator*() const {
  return cell_->val;
}

template <typename T, uptr kSize>
T &AddrHashMap<T, kSize>::Handle::operator*() {
  return cell_->val;
}

template<typename T, uptr kSize>
bool AddrHashMap<T, kSize>::Handle::created() const {
  return created_;
}

template<typename T, uptr kSize>
bool AddrHashMap<T, kSize>::Handle::exists() const {
  return cell_ != nullptr;
}

template<typename T, uptr kSize>
AddrHashMap<T, kSize>::AddrHashMap() {
  table_ = (Bucket*)MmapOrDie(kSize * sizeof(table_[0]), "AddrHashMap");
}

template<typename T, uptr kSize>
void AddrHashMap<T, kSize>::acquire(Handle *h) {
  uptr addr = h->addr_;
  uptr hash = calcHash(addr);
  Bucket *b = &table_[hash];

h->created_ = false;
  h->addidx_ = -1U;
  h->bucket_ = b;
  h->cell_ = nullptr;

// If we want to remove the element, we need exclusive access to the bucket,
  // so skip the lock-free phase.
  if (h->remove_)
    goto locked;

retry:
  // First try to find an existing element w/o read mutex.
  CHECK(!h->remove_);
  // Check the embed cells.
  for (uptr i = 0; i < kBucketSize; i++) {
    Cell *c = &b->cells[i];
    uptr addr1 = atomic_load(&c->addr, memory_order_acquire);
    if (addr1 == addr) {
      h->cell_ = c;
      return;
    }
  }

// Check the add cells with read lock.
  if (atomic_load(&b->add, memory_order_relaxed)) {
    b->mtx.ReadLock();
    AddBucket *add = (AddBucket*)atomic_load(&b->add, memory_order_relaxed);
    for (uptr i = 0; i < add->size; i++) {
      Cell *c = &add->cells[i];
      uptr addr1 = atomic_load(&c->addr, memory_order_relaxed);
      if (addr1 == addr) {
        h->addidx_ = i;
        h->cell_ = c;
        return;
      }
    }
    b->mtx.ReadUnlock();
  }

locked:
  // Re-check existence under write lock.
  // Embed cells.
  b->mtx.Lock();
  for (uptr i = 0; i < kBucketSize; i++) {
    Cell *c = &b->cells[i];
    uptr addr1 = atomic_load(&c->addr, memory_order_relaxed);
    if (addr1 == addr) {
      if (h->remove_) {
        h->cell_ = c;
        return;
      }
      b->mtx.Unlock();
      goto retry;
    }
  }

// Add cells.
  AddBucket *add = (AddBucket*)atomic_load(&b->add, memory_order_relaxed);
  if (add) {
    for (uptr i = 0; i < add->size; i++) {
      Cell *c = &add->cells[i];
      uptr addr1 = atomic_load(&c->addr, memory_order_relaxed);
      if (addr1 == addr) {
        if (h->remove_) {
          h->addidx_ = i;
          h->cell_ = c;
          return;
        }
        b->mtx.Unlock();
        goto retry;
      }
    }
  }

// The element does not exist, no need to create it if we want to remove.
  if (h->remove_ || !h->create_) {
    b->mtx.Unlock();
    return;
  }

// Now try to create it under the mutex.
  h->created_ = true;
  // See if we have a free embed cell.
  for (uptr i = 0; i < kBucketSize; i++) {
    Cell *c = &b->cells[i];
    uptr addr1 = atomic_load(&c->addr, memory_order_relaxed);
    if (addr1 == 0) {
      h->cell_ = c;
      return;
    }
  }

// Store in the add cells.
  if (!add) {
    // Allocate a new add array.
    const uptr kInitSize = 64;
    add = (AddBucket*)InternalAlloc(kInitSize);
    internal_memset(add, 0, kInitSize);
    add->cap = (kInitSize - sizeof(*add)) / sizeof(add->cells[0]) + 1;
    add->size = 0;
    atomic_store(&b->add, (uptr)add, memory_order_relaxed);
  }
  if (add->size == add->cap) {
    // Grow existing add array.
    uptr oldsize = sizeof(*add) + (add->cap - 1) * sizeof(add->cells[0]);
    uptr newsize = oldsize * 2;
    AddBucket *add1 = (AddBucket*)InternalAlloc(newsize);
    internal_memset(add1, 0, newsize);
    add1->cap = (newsize - sizeof(*add)) / sizeof(add->cells[0]) + 1;
    add1->size = add->size;
    internal_memcpy(add1->cells, add->cells, add->size * sizeof(add->cells[0]));
    InternalFree(add);
    atomic_store(&b->add, (uptr)add1, memory_order_relaxed);
    add = add1;
  }
  // Store.
  uptr i = add->size++;
  Cell *c = &add->cells[i];
  CHECK_EQ(atomic_load(&c->addr, memory_order_relaxed), 0);
  h->addidx_ = i;
  h->cell_ = c;
}

template<typename T, uptr kSize>
void AddrHashMap<T, kSize>::release(Handle *h) {
  if (!h->cell_)
    return;
  Bucket *b = h->bucket_;
  Cell *c = h->cell_;
  uptr addr1 = atomic_load(&c->addr, memory_order_relaxed);
  if (h->created_) {
    // Denote completion of insertion.
    CHECK_EQ(addr1, 0);
    // After the following store, the element becomes available
    // for lock-free reads.
    atomic_store(&c->addr, h->addr_, memory_order_release);
    b->mtx.Unlock();
  } else if (h->remove_) {
    // Denote that the cell is empty now.
    CHECK_EQ(addr1, h->addr_);
    atomic_store(&c->addr, 0, memory_order_release);
    // See if we need to compact the bucket.
    AddBucket *add = (AddBucket*)atomic_load(&b->add, memory_order_relaxed);
    if (h->addidx_ == -1U) {
      // Removed from embed array, move an add element into the freed cell.
      if (add && add->size != 0) {
        uptr last = --add->size;
        Cell *c1 = &add->cells[last];
        c->val = c1->val;
        uptr addr1 = atomic_load(&c1->addr, memory_order_relaxed);
        atomic_store(&c->addr, addr1, memory_order_release);
        atomic_store(&c1->addr, 0, memory_order_release);
      }
    } else {
      // Removed from add array, compact it.
      uptr last = --add->size;
      Cell *c1 = &add->cells[last];
      if (c != c1) {
        *c = *c1;
        atomic_store(&c1->addr, 0, memory_order_relaxed);
      }
    }
    if (add && add->size == 0) {
      // FIXME(dvyukov): free add?
    }
    b->mtx.Unlock();
  } else {
    CHECK_EQ(addr1, h->addr_);
    if (h->addidx_ != -1U)
      b->mtx.ReadUnlock();
  }
}

template<typename T, uptr kSize>
uptr AddrHashMap<T, kSize>::calcHash(uptr addr) {
  addr += addr << 10;
  addr ^= addr >> 6;
  return addr % kSize;
}

} // namespace __sanitizer

#endif // SANITIZER_ADDRHASHMAP_H

003 File Manager

Editing: sanitizer_addrhashmap.h

Upload File

Create Folder