v8::internal::FreeListCategory Class Reference

#include <spaces.h>

Collaboration diagram for v8::internal::FreeListCategory:

Public Member Functions
	FreeListCategory ()
intptr_t	Concatenate (FreeListCategory *category)
void	Reset ()
void	Free (FreeListNode *node, int size_in_bytes)
FreeListNode *	PickNodeFromList (int *node_size)
FreeListNode *	PickNodeFromList (int size_in_bytes, int *node_size)
intptr_t	EvictFreeListItemsInList (Page *p)
bool	ContainsPageFreeListItemsInList (Page *p)
void	RepairFreeList (Heap *heap)
FreeListNode *	top () const
void	set_top (FreeListNode *top)
FreeListNode **	GetEndAddress ()
FreeListNode *	end () const
void	set_end (FreeListNode *end)
int *	GetAvailableAddress ()
int	available () const
void	set_available (int available)
base::Mutex *	mutex ()
bool	IsEmpty ()

Private Attributes
base::AtomicWord	top_
FreeListNode *	end_
base::Mutex	mutex_
int	available_

Detailed Description

Definition at line 1438 of file spaces.h.

Constructor & Destructor Documentation

FreeListCategory()

v8::internal::FreeListCategory::FreeListCategory ( )

inline

Definition at line 1440 of file spaces.h.

: top_(0), end_(NULL), available_(0) {}

Member Function Documentation

available()

int v8::internal::FreeListCategory::available ( ) const

inline

Definition at line 1469 of file spaces.h.

{ return available_; }

References available_.

Referenced by v8::internal::FreeList::available(), Concatenate(), v8::internal::FreeList::FindNodeFor(), and set_available().

Here is the caller graph for this function:

Concatenate()

intptr_t v8::internal::FreeListCategory::Concatenate

(

FreeListCategory *

category

)

Definition at line 2028 of file spaces.cc.

                                                                 {
  intptr_t free_bytes = 0;
  if (category->top() != NULL) {
    // This is safe (not going to deadlock) since Concatenate operations
    // are never performed on the same free lists at the same time in
    // reverse order.
    base::LockGuard<base::Mutex> target_lock_guard(mutex());
    base::LockGuard<base::Mutex> source_lock_guard(category->mutex());
    DCHECK(category->end_ != NULL);
    free_bytes = category->available();
    if (end_ == NULL) {
      end_ = category->end();
    } else {
      category->end()->set_next(top());
    }
    set_top(category->top());
    base::NoBarrier_Store(&top_, category->top_);
    available_ += category->available();
    category->Reset();
  }
  return free_bytes;
}

References available(), available_, DCHECK, end(), end_, mutex(), v8::base::NoBarrier_Store(), NULL, Reset(), v8::internal::FreeListNode::set_next(), set_top(), top(), and top_.

Referenced by v8::internal::FreeList::Concatenate().

Here is the call graph for this function:

Here is the caller graph for this function:

ContainsPageFreeListItemsInList()

bool v8::internal::FreeListCategory::ContainsPageFreeListItemsInList

(

Page *

p

)

Definition at line 2081 of file spaces.cc.

                                                              {
  FreeListNode* node = top();
  while (node != NULL) {
    if (Page::FromAddress(node->address()) == p) return true;
    node = node->next();
  }
  return false;
}

References v8::internal::HeapObject::address(), v8::internal::MemoryChunk::FromAddress(), v8::internal::FreeListNode::next(), NULL, and top().

Here is the call graph for this function:

end()

FreeListNode* v8::internal::FreeListCategory::end ( ) const

inline

Definition at line 1465 of file spaces.h.

{ return end_; }

References end_.

Referenced by Concatenate(), and set_end().

Here is the caller graph for this function:

EvictFreeListItemsInList()

intptr_t v8::internal::FreeListCategory::EvictFreeListItemsInList

(

Page *

p

)

Definition at line 2059 of file spaces.cc.

                                                           {
  int sum = 0;
  FreeListNode* t = top();
  FreeListNode** n = &t;
  while (*n != NULL) {
    if (Page::FromAddress((*n)->address()) == p) {
      FreeSpace* free_space = reinterpret_cast<FreeSpace*>(*n);
      sum += free_space->Size();
      *n = (*n)->next();
    } else {
      n = (*n)->next_address();
    }
  }
  set_top(t);
  if (top() == NULL) {
    set_end(NULL);
  }
  available_ -= sum;
  return sum;
}

References available_, v8::internal::MemoryChunk::FromAddress(), v8::internal::FreeListNode::next(), v8::internal::FreeListNode::next_address(), NULL, set_end(), set_top(), v8::internal::FreeSpace::Size(), and top().

Referenced by v8::internal::FreeList::ContainsPageFreeListItems(), and v8::internal::FreeList::EvictFreeListItems().

Here is the call graph for this function:

Here is the caller graph for this function:

Free()

void v8::internal::FreeListCategory::Free	(	FreeListNode *	node,
		int	size_in_bytes
	)

Definition at line 2130 of file spaces.cc.

                                                                 {
  node->set_next(top());
  set_top(node);
  if (end_ == NULL) {
    end_ = node;
  }
  available_ += size_in_bytes;
}

References available_, end_, NULL, v8::internal::FreeListNode::set_next(), set_top(), and top().

Referenced by v8::internal::FreeList::Free(), and PickNodeFromList().

Here is the call graph for this function:

Here is the caller graph for this function:

GetAvailableAddress()

int* v8::internal::FreeListCategory::GetAvailableAddress ( )

inline

Definition at line 1468 of file spaces.h.

{ return &available_; }

References available_.

GetEndAddress()

FreeListNode** v8::internal::FreeListCategory::GetEndAddress ( )

inline

Definition at line 1464 of file spaces.h.

{ return &end_; }

References end_.

IsEmpty()

bool v8::internal::FreeListCategory::IsEmpty ( )

inline

Definition at line 1474 of file spaces.h.

{ return top() == 0; }

References top().

Referenced by v8::internal::FreeList::IsEmpty().

Here is the call graph for this function:

Here is the caller graph for this function:

mutex()

base::Mutex* v8::internal::FreeListCategory::mutex ( )

inline

Definition at line 1472 of file spaces.h.

{ return &mutex_; }

References mutex_.

Referenced by Concatenate().

Here is the caller graph for this function:

PickNodeFromList() [1/2]

FreeListNode * v8::internal::FreeListCategory::PickNodeFromList

(

int *

node_size

)

Definition at line 2091 of file spaces.cc.

                                                               {
  FreeListNode* node = top();
 
  if (node == NULL) return NULL;
 
  while (node != NULL &&
         Page::FromAddress(node->address())->IsEvacuationCandidate()) {
    available_ -= reinterpret_cast<FreeSpace*>(node)->Size();
    node = node->next();
  }
 
  if (node != NULL) {
    set_top(node->next());
    *node_size = reinterpret_cast<FreeSpace*>(node)->Size();
    available_ -= *node_size;
  } else {
    set_top(NULL);
  }
 
  if (top() == NULL) {
    set_end(NULL);
  }
 
  return node;
}

References v8::internal::HeapObject::address(), available_, v8::internal::MemoryChunk::FromAddress(), v8::internal::MemoryChunk::IsEvacuationCandidate(), v8::internal::FreeListNode::next(), NULL, set_end(), set_top(), and top().

Referenced by v8::internal::FreeList::FindNodeFor(), and PickNodeFromList().

Here is the call graph for this function:

Here is the caller graph for this function:

PickNodeFromList() [2/2]

FreeListNode * v8::internal::FreeListCategory::PickNodeFromList	(	int	size_in_bytes,
		int *	node_size
	)

Definition at line 2118 of file spaces.cc.

                                                                 {
  FreeListNode* node = PickNodeFromList(node_size);
  if (node != NULL && *node_size < size_in_bytes) {
    Free(node, *node_size);
    *node_size = 0;
    return NULL;
  }
  return node;
}

References Free(), NULL, and PickNodeFromList().

Here is the call graph for this function:

RepairFreeList()

void v8::internal::FreeListCategory::RepairFreeList

(

Heap *

heap

)

Definition at line 2140 of file spaces.cc.

                                                {
  FreeListNode* n = top();
  while (n != NULL) {
    Map** map_location = reinterpret_cast<Map**>(n->address());
    if (*map_location == NULL) {
      *map_location = heap->free_space_map();
    } else {
      DCHECK(*map_location == heap->free_space_map());
    }
    n = n->next();
  }
}

References v8::internal::HeapObject::address(), DCHECK, v8::internal::FreeListNode::next(), NULL, and top().

Referenced by v8::internal::FreeList::RepairLists().

Here is the call graph for this function:

Here is the caller graph for this function:

Reset()

void v8::internal::FreeListCategory::Reset

(

)

Definition at line 2052 of file spaces.cc.

                             {
  set_top(NULL);
  set_end(NULL);
  set_available(0);
}

References NULL, set_available(), set_end(), and set_top().

Referenced by Concatenate(), and v8::internal::FreeList::Reset().

Here is the call graph for this function:

Here is the caller graph for this function:

set_available()

void v8::internal::FreeListCategory::set_available ( int  available )

inline

Definition at line 1470 of file spaces.h.

{ available_ = available; }

References available(), and available_.

Referenced by v8::internal::FreeList::FindNodeFor(), and Reset().

Here is the call graph for this function:

Here is the caller graph for this function:

set_end()

void v8::internal::FreeListCategory::set_end ( FreeListNode *  end )

inline

Definition at line 1466 of file spaces.h.

{ end_ = end; }

References end(), and end_.

Referenced by EvictFreeListItemsInList(), v8::internal::FreeList::FindNodeFor(), PickNodeFromList(), and Reset().

Here is the call graph for this function:

Here is the caller graph for this function:

set_top()

void v8::internal::FreeListCategory::set_top ( FreeListNode *  top )

inline

Definition at line 1460 of file spaces.h.

                                  {
    base::NoBarrier_Store(&top_, reinterpret_cast<base::AtomicWord>(top));
  }

References v8::base::NoBarrier_Store(), top(), and top_.

Referenced by Concatenate(), EvictFreeListItemsInList(), v8::internal::FreeList::FindNodeFor(), Free(), PickNodeFromList(), and Reset().

Here is the call graph for this function:

Here is the caller graph for this function:

top()

FreeListNode* v8::internal::FreeListCategory::top ( ) const

inline

Definition at line 1456 of file spaces.h.

                            {
    return reinterpret_cast<FreeListNode*>(base::NoBarrier_Load(&top_));
  }

References v8::base::NoBarrier_Load(), and top_.

Referenced by Concatenate(), ContainsPageFreeListItemsInList(), EvictFreeListItemsInList(), v8::internal::FreeList::FindNodeFor(), Free(), IsEmpty(), PickNodeFromList(), RepairFreeList(), and set_top().

Here is the call graph for this function:

Here is the caller graph for this function:

Member Data Documentation

available_

int v8::internal::FreeListCategory::available_

private

Definition at line 1488 of file spaces.h.

Referenced by available(), Concatenate(), EvictFreeListItemsInList(), Free(), GetAvailableAddress(), PickNodeFromList(), and set_available().

end_

FreeListNode* v8::internal::FreeListCategory::end_

private

Definition at line 1484 of file spaces.h.

Referenced by Concatenate(), end(), Free(), GetEndAddress(), and set_end().

mutex_

base::Mutex v8::internal::FreeListCategory::mutex_

private

Definition at line 1485 of file spaces.h.

Referenced by mutex().

top_

base::AtomicWord v8::internal::FreeListCategory::top_

private

Definition at line 1483 of file spaces.h.

Referenced by Concatenate(), set_top(), and top().

---

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

• /mnt/V8SourceCode/src/heap/spaces.h
• /mnt/V8SourceCode/src/heap/spaces.cc