v8::internal::TemplateHashMapImpl< AllocationPolicy > Class Template Reference

#include <hashmap.h>

Inheritance diagram for v8::internal::TemplateHashMapImpl< AllocationPolicy >:

Collaboration diagram for v8::internal::TemplateHashMapImpl< AllocationPolicy >:

Classes
struct	Entry

Public Types
typedef bool(*	MatchFun) (void *key1, void *key2)

Public Member Functions
	TemplateHashMapImpl (MatchFun match, uint32_t capacity=kDefaultHashMapCapacity, AllocationPolicy allocator=AllocationPolicy())
	~TemplateHashMapImpl ()
Entry *	Lookup (void *key, uint32_t hash, bool insert, AllocationPolicy allocator=AllocationPolicy())
void *	Remove (void *key, uint32_t hash)
void	Clear ()
uint32_t	occupancy () const
uint32_t	capacity () const
Entry *	Start () const
Entry *	Next (Entry *p) const

Static Public Member Functions
static bool	PointersMatch (void *key1, void *key2)

Static Public Attributes
static const uint32_t	kDefaultHashMapCapacity = 8

Private Member Functions
Entry *	map_end () const
Entry *	Probe (void *key, uint32_t hash)
void	Initialize (uint32_t capacity, AllocationPolicy allocator)
void	Resize (AllocationPolicy allocator)

Private Attributes
MatchFun	match_
Entry *	map_
uint32_t	capacity_
uint32_t	occupancy_

Detailed Description

template<class AllocationPolicy>
class v8::internal::TemplateHashMapImpl< AllocationPolicy >

Definition at line 17 of file hashmap.h.

Member Typedef Documentation

MatchFun

template<class AllocationPolicy >

typedef bool(* v8::internal::TemplateHashMapImpl< AllocationPolicy >::MatchFun) (void *key1, void *key2)

Definition at line 19 of file hashmap.h.

Constructor & Destructor Documentation

TemplateHashMapImpl()

template<class AllocationPolicy >

v8::internal::TemplateHashMapImpl< AllocationPolicy >::TemplateHashMapImpl	(	MatchFun	match,
		uint32_t	capacity = kDefaultHashMapCapacity,
		AllocationPolicy	allocator = AllocationPolicy()
	)

Definition at line 99 of file hashmap.h.

                                                                           {
  match_ = match;
  Initialize(initial_capacity, allocator);
}

~TemplateHashMapImpl()

template<class AllocationPolicy >

v8::internal::TemplateHashMapImpl< AllocationPolicy >::~TemplateHashMapImpl

Definition at line 107 of file hashmap.h.

                                                            {
  AllocationPolicy::Delete(map_);
}

Member Function Documentation

capacity()

template<class AllocationPolicy >

uint32_t v8::internal::TemplateHashMapImpl< AllocationPolicy >::capacity ( ) const

inline

Definition at line 66 of file hashmap.h.

{ return capacity_; }

References v8::internal::TemplateHashMapImpl< AllocationPolicy >::capacity_.

Referenced by v8::internal::HeapObjectsMap::GetUsedMemorySize(), and v8::internal::StringsStorage::GetUsedMemorySize().

Here is the caller graph for this function:

Clear()

template<class AllocationPolicy >

void v8::internal::TemplateHashMapImpl< AllocationPolicy >::Clear

Definition at line 207 of file hashmap.h.

                                                  {
  // Mark all entries as empty.
  const Entry* end = map_end();
  for (Entry* p = map_; p < end; p++) {
    p->key = NULL;
  }
  occupancy_ = 0;
}

References NULL.

Referenced by v8::internal::HeapObjectsSet::Clear(), and v8::internal::LargeObjectSpace::SetUp().

Here is the caller graph for this function:

Initialize()

template<class AllocationPolicy >

void v8::internal::TemplateHashMapImpl< AllocationPolicy >::Initialize ( uint32_t  capacity, AllocationPolicy  allocator  )

private

Definition at line 261 of file hashmap.h.

                                                   {
  DCHECK(base::bits::IsPowerOfTwo32(capacity));
  map_ = reinterpret_cast<Entry*>(allocator.New(capacity * sizeof(Entry)));
  if (map_ == NULL) {
    v8::internal::FatalProcessOutOfMemory("HashMap::Initialize");
    return;
  }
  capacity_ = capacity;
  Clear();
}

References DCHECK, v8::internal::FatalProcessOutOfMemory(), v8::base::bits::IsPowerOfTwo32(), and NULL.

Here is the call graph for this function:

Lookup()

template<class AllocationPolicy >

TemplateHashMapImpl< AllocationPolicy >::Entry * v8::internal::TemplateHashMapImpl< AllocationPolicy >::Lookup	(	void *	key,
		uint32_t	hash,
		bool	insert,
		AllocationPolicy	allocator = AllocationPolicy()
	)

Definition at line 114 of file hashmap.h.

                                                                       {
  // Find a matching entry.
  Entry* p = Probe(key, hash);
  if (p->key != NULL) {
    return p;
  }
 
  // No entry found; insert one if necessary.
  if (insert) {
    p->key = key;
    p->value = NULL;
    p->hash = hash;
    p->order = occupancy_;
    occupancy_++;
 
    // Grow the map if we reached >= 80% occupancy.
    if (occupancy_ + occupancy_/4 >= capacity_) {
      Resize(allocator);
      p = Probe(key, hash);
    }
 
    return p;
  }
 
  // No entry found and none inserted.
  return NULL;
}

References v8::internal::TemplateHashMapImpl< AllocationPolicy >::Entry::hash, v8::internal::TemplateHashMapImpl< AllocationPolicy >::Entry::key, NULL, v8::internal::TemplateHashMapImpl< AllocationPolicy >::Entry::order, and v8::internal::TemplateHashMapImpl< AllocationPolicy >::Entry::value.

Referenced by v8::internal::AllocationTracker::AddFunctionInfo(), v8::internal::SerializationAddressMapper::AddMapping(), v8::internal::DuplicateFinder::AddSymbol(), v8::internal::LargeObjectSpace::AllocateRaw(), v8::internal::HeapObjectsSet::Contains(), v8::internal::Interface::DoAdd(), v8::internal::TemplateHashMap< Key, Value, AllocationPolicy >::find(), v8::internal::ProfileNode::FindChild(), v8::internal::HeapObjectsMap::FindEntry(), v8::internal::CodeAddressMap::NameMap::FindEntry(), v8::internal::ProfileNode::FindOrAddChild(), v8::internal::HeapObjectsMap::FindOrAddEntry(), v8::internal::NativeObjectsExplorer::FindOrAddGroupInfo(), v8::internal::CodeAddressMap::NameMap::FindOrCreateEntry(), v8::internal::LargeObjectSpace::FindPage(), v8::internal::HeapObjectsMap::FindUntrackedObjects(), v8::internal::StringsStorage::GetEntry(), v8::internal::NativeObjectsExplorer::GetListMaybeDisposeInfo(), v8::internal::AstValueFactory::GetString(), v8::internal::HeapSnapshotJSONSerializer::GetStringId(), v8::internal::HeapObjectsSet::GetTag(), v8::internal::ScriptCache::HandleWeakScript(), v8::internal::HeapObjectsSet::Insert(), v8::internal::SerializationAddressMapper::IsMapped(), v8::CounterMap::Lookup(), v8::internal::HeapEntriesMap::Map(), v8::internal::SerializationAddressMapper::MappedTo(), v8::internal::HeapObjectsMap::MoveObject(), v8::internal::HeapEntriesMap::Pair(), v8::internal::ExternalReferenceEncoder::Put(), v8::internal::HeapObjectsMap::RemoveDeadEntries(), v8::CounterMap::Set(), and v8::internal::HeapObjectsSet::SetTag().

Here is the caller graph for this function:

map_end()

template<class AllocationPolicy >

Entry* v8::internal::TemplateHashMapImpl< AllocationPolicy >::map_end ( ) const

inlineprivate

Definition at line 90 of file hashmap.h.

{ return map_ + capacity_; }

References v8::internal::TemplateHashMapImpl< AllocationPolicy >::capacity_, and v8::internal::TemplateHashMapImpl< AllocationPolicy >::map_.

Next()

template<class AllocationPolicy >

TemplateHashMapImpl< AllocationPolicy >::Entry * v8::internal::TemplateHashMapImpl< AllocationPolicy >::Next

(

Entry *

p

)

const

Definition at line 226 of file hashmap.h.

                                                              {
  const Entry* end = map_end();
  DCHECK(map_ - 1 <= p && p < end);
  for (p++; p < end; p++) {
    if (p->key != NULL) {
      return p;
    }
  }
  return NULL;
}

References DCHECK, v8::internal::TemplateHashMapImpl< AllocationPolicy >::Entry::key, and NULL.

Referenced by v8::internal::Interface::Iterator::Advance(), v8::internal::Scope::AllocateNonParameterLocals(), v8::internal::Scope::CollectStackAndContextLocals(), v8::internal::StringsStorage::GetUsedMemorySize(), v8::internal::NativeObjectsExplorer::IterateAndExtractReferences(), v8::CounterMap::Iterator::Next(), v8::internal::ProfileNode::Print(), v8::internal::HeapSnapshotJSONSerializer::SerializeStrings(), v8::internal::NativeObjectsExplorer::SetRootNativeRootsReference(), v8::internal::CodeAddressMap::NameMap::~NameMap(), v8::internal::NativeObjectsExplorer::~NativeObjectsExplorer(), and v8::internal::StringsStorage::~StringsStorage().

Here is the caller graph for this function:

occupancy()

template<class AllocationPolicy >

uint32_t v8::internal::TemplateHashMapImpl< AllocationPolicy >::occupancy ( ) const

inline

Definition at line 61 of file hashmap.h.

{ return occupancy_; }

References v8::internal::TemplateHashMapImpl< AllocationPolicy >::occupancy_.

Referenced by v8::internal::Scope::AllocateNonParameterLocals(), v8::internal::Scope::CollectStackAndContextLocals(), v8::internal::Interface::DoUnify(), v8::internal::NativeObjectsExplorer::EstimateObjectsCount(), v8::internal::HeapObjectsMap::FindEntry(), v8::internal::HeapObjectsMap::FindOrAddEntry(), v8::internal::HeapObjectsMap::FindUntrackedObjects(), v8::internal::HeapObjectsSet::is_empty(), v8::internal::Interface::Length(), v8::internal::HeapObjectsMap::RemoveDeadEntries(), v8::internal::HeapSnapshotJSONSerializer::SerializeStrings(), v8::internal::Interface::Unify(), and v8::internal::HeapObjectsMap::UpdateHeapObjectsMap().

Here is the caller graph for this function:

PointersMatch()

template<class AllocationPolicy >

static bool v8::internal::TemplateHashMapImpl< AllocationPolicy >::PointersMatch ( void *  key1, void *  key2  )

inlinestatic

Definition at line 80 of file hashmap.h.

                                                    {
    return key1 == key2;
  }

Probe()

template<class AllocationPolicy >

TemplateHashMapImpl< AllocationPolicy >::Entry * v8::internal::TemplateHashMapImpl< AllocationPolicy >::Probe ( void *  key, uint32_t  hash  )

private

Definition at line 240 of file hashmap.h.

                                                                         {
  DCHECK(key != NULL);
 
  DCHECK(base::bits::IsPowerOfTwo32(capacity_));
  Entry* p = map_ + (hash & (capacity_ - 1));
  const Entry* end = map_end();
  DCHECK(map_ <= p && p < end);
 
  DCHECK(occupancy_ < capacity_);  // Guarantees loop termination.
  while (p->key != NULL && (hash != p->hash || !match_(key, p->key))) {
    p++;
    if (p >= end) {
      p = map_;
    }
  }
 
  return p;
}

References DCHECK, v8::internal::TemplateHashMapImpl< AllocationPolicy >::Entry::hash, v8::base::bits::IsPowerOfTwo32(), v8::internal::TemplateHashMapImpl< AllocationPolicy >::Entry::key, and NULL.

Here is the call graph for this function:

Remove()

template<class AllocationPolicy >

void * v8::internal::TemplateHashMapImpl< AllocationPolicy >::Remove	(	void *	key,
		uint32_t	hash
	)

Definition at line 145 of file hashmap.h.

                                                                            {
  // Lookup the entry for the key to remove.
  Entry* p = Probe(key, hash);
  if (p->key == NULL) {
    // Key not found nothing to remove.
    return NULL;
  }
 
  void* value = p->value;
  // To remove an entry we need to ensure that it does not create an empty
  // entry that will cause the search for another entry to stop too soon. If all
  // the entries between the entry to remove and the next empty slot have their
  // initial position inside this interval, clearing the entry to remove will
  // not break the search. If, while searching for the next empty entry, an
  // entry is encountered which does not have its initial position between the
  // entry to remove and the position looked at, then this entry can be moved to
  // the place of the entry to remove without breaking the search for it. The
  // entry made vacant by this move is now the entry to remove and the process
  // starts over.
  // Algorithm from http://en.wikipedia.org/wiki/Open_addressing.
 
  // This guarantees loop termination as there is at least one empty entry so
  // eventually the removed entry will have an empty entry after it.
  DCHECK(occupancy_ < capacity_);
 
  // p is the candidate entry to clear. q is used to scan forwards.
  Entry* q = p;  // Start at the entry to remove.
  while (true) {
    // Move q to the next entry.
    q = q + 1;
    if (q == map_end()) {
      q = map_;
    }
 
    // All entries between p and q have their initial position between p and q
    // and the entry p can be cleared without breaking the search for these
    // entries.
    if (q->key == NULL) {
      break;
    }
 
    // Find the initial position for the entry at position q.
    Entry* r = map_ + (q->hash & (capacity_ - 1));
 
    // If the entry at position q has its initial position outside the range
    // between p and q it can be moved forward to position p and will still be
    // found. There is now a new candidate entry for clearing.
    if ((q > p && (r <= p || r > q)) ||
        (q < p && (r <= p && r > q))) {
      *p = *q;
      p = q;
    }
  }
 
  // Clear the entry which is allowed to en emptied.
  p->key = NULL;
  occupancy_--;
  return value;
}

References DCHECK, v8::internal::TemplateHashMapImpl< AllocationPolicy >::Entry::hash, v8::internal::TemplateHashMapImpl< AllocationPolicy >::Entry::key, NULL, and v8::internal::TemplateHashMapImpl< AllocationPolicy >::Entry::value.

Referenced by v8::internal::LargeObjectSpace::FreeUnmarkedObjects(), v8::internal::ScriptCache::HandleWeakScript(), v8::internal::HeapObjectsMap::MoveObject(), v8::internal::HeapObjectsMap::RemoveDeadEntries(), and v8::internal::CodeAddressMap::NameMap::RemoveEntry().

Here is the caller graph for this function:

Resize()

template<class AllocationPolicy >

void v8::internal::TemplateHashMapImpl< AllocationPolicy >::Resize ( AllocationPolicy  allocator )

private

Definition at line 275 of file hashmap.h.

                                                                             {
  Entry* map = map_;
  uint32_t n = occupancy_;
 
  // Allocate larger map.
  Initialize(capacity_ * 2, allocator);
 
  // Rehash all current entries.
  for (Entry* p = map; n > 0; p++) {
    if (p->key != NULL) {
      Entry* entry = Lookup(p->key, p->hash, true, allocator);
      entry->value = p->value;
      entry->order = p->order;
      n--;
    }
  }
 
  // Delete old map.
  AllocationPolicy::Delete(map);
}

References map, NULL, v8::internal::TemplateHashMapImpl< AllocationPolicy >::Entry::order, and v8::internal::TemplateHashMapImpl< AllocationPolicy >::Entry::value.

Start()

template<class AllocationPolicy >

TemplateHashMapImpl< AllocationPolicy >::Entry * v8::internal::TemplateHashMapImpl< AllocationPolicy >::Start

Definition at line 219 of file hashmap.h.

                                                       {
  return Next(map_ - 1);
}

Referenced by v8::internal::Scope::AllocateNonParameterLocals(), v8::internal::TemplateHashMap< Key, Value, AllocationPolicy >::begin(), v8::internal::Scope::CollectStackAndContextLocals(), v8::internal::StringsStorage::GetUsedMemorySize(), v8::internal::NativeObjectsExplorer::IterateAndExtractReferences(), v8::internal::ProfileNode::Print(), v8::internal::HeapSnapshotJSONSerializer::SerializeStrings(), v8::internal::NativeObjectsExplorer::SetRootNativeRootsReference(), v8::internal::CodeAddressMap::NameMap::~NameMap(), v8::internal::NativeObjectsExplorer::~NativeObjectsExplorer(), and v8::internal::StringsStorage::~StringsStorage().

Here is the caller graph for this function:

Member Data Documentation

capacity_

template<class AllocationPolicy >

uint32_t v8::internal::TemplateHashMapImpl< AllocationPolicy >::capacity_

private

Definition at line 87 of file hashmap.h.

Referenced by v8::internal::TemplateHashMapImpl< AllocationPolicy >::capacity(), and v8::internal::TemplateHashMapImpl< AllocationPolicy >::map_end().

kDefaultHashMapCapacity

template<class AllocationPolicy >

const uint32_t v8::internal::TemplateHashMapImpl< AllocationPolicy >::kDefaultHashMapCapacity = 8

static

Definition at line 24 of file hashmap.h.

map_

template<class AllocationPolicy >

Entry* v8::internal::TemplateHashMapImpl< AllocationPolicy >::map_

private

Definition at line 86 of file hashmap.h.

Referenced by v8::internal::TemplateHashMapImpl< AllocationPolicy >::map_end().

match_

template<class AllocationPolicy >

MatchFun v8::internal::TemplateHashMapImpl< AllocationPolicy >::match_

private

Definition at line 85 of file hashmap.h.

occupancy_

template<class AllocationPolicy >

uint32_t v8::internal::TemplateHashMapImpl< AllocationPolicy >::occupancy_

private

Definition at line 88 of file hashmap.h.

Referenced by v8::internal::TemplateHashMapImpl< AllocationPolicy >::occupancy().

---

The documentation for this class was generated from the following file:

• /mnt/V8SourceCode/src/hashmap.h