v8::internal::SplayTree< Config, AllocationPolicy > Class Template Reference

#include <splay-tree.h>

Inheritance diagram for v8::internal::SplayTree< Config, AllocationPolicy >:

Collaboration diagram for v8::internal::SplayTree< Config, AllocationPolicy >:

Classes
class	BASE_EMBEDDED
class	Node

Public Types
typedef Config::Key	Key
typedef Config::Value	Value

Public Member Functions
	SplayTree (AllocationPolicy allocator=AllocationPolicy())
	~SplayTree ()
	INLINE (void *operator new(size_t size, AllocationPolicy allocator=AllocationPolicy()))
	INLINE (void operator delete(void *p))
	INLINE (void operator delete(void *p, AllocationPolicy policy))
AllocationPolicy	allocator ()
bool	Contains (const Key &key)
bool	Insert (const Key &key, Locator *locator)
bool	Find (const Key &key, Locator *locator)
bool	FindGreatestLessThan (const Key &key, Locator *locator)
bool	FindGreatest (Locator *locator)
bool	FindLeastGreaterThan (const Key &key, Locator *locator)
bool	FindLeast (Locator *locator)
bool	Move (const Key &old_key, const Key &new_key)
bool	Remove (const Key &key)
void	Clear ()
bool	is_empty ()
void	Splay (const Key &key)
template<class Callback >
void	ForEach (Callback *callback)

Protected Member Functions
void	ResetRoot ()

Private Member Functions
bool	FindInternal (const Key &key)
void	InsertInternal (int cmp, Node *node)
void	RemoveRootNode (const Key &key)
template<class Callback >
void	ForEachNode (Callback *callback)
	DISALLOW_COPY_AND_ASSIGN (SplayTree)

Private Attributes
Node *	root_
AllocationPolicy	allocator_

Detailed Description

template<typename Config, class AllocationPolicy>
class v8::internal::SplayTree< Config, AllocationPolicy >

Definition at line 31 of file splay-tree.h.

Member Typedef Documentation

Key

template<typename Config , class AllocationPolicy >

typedef Config::Key v8::internal::SplayTree< Config, AllocationPolicy >::Key

Definition at line 33 of file splay-tree.h.

Value

template<typename Config , class AllocationPolicy >

typedef Config::Value v8::internal::SplayTree< Config, AllocationPolicy >::Value

Definition at line 34 of file splay-tree.h.

Constructor & Destructor Documentation

SplayTree()

template<typename Config , class AllocationPolicy >

v8::internal::SplayTree< Config, AllocationPolicy >::SplayTree ( AllocationPolicy  allocator = AllocationPolicy() )

inlineexplicit

Definition at line 38 of file splay-tree.h.

      : root_(NULL), allocator_(allocator) {}

~SplayTree()

template<typename Config , class Allocator >

v8::internal::SplayTree< Config, Allocator >::~SplayTree

Definition at line 15 of file splay-tree-inl.h.

                                         {
  NodeDeleter deleter;
  ForEachNode(&deleter);
}

Member Function Documentation

allocator()

template<typename Config , class AllocationPolicy >

AllocationPolicy v8::internal::SplayTree< Config, AllocationPolicy >::allocator ( )

inline

Definition at line 54 of file splay-tree.h.

{ return allocator_; }

References v8::internal::SplayTree< Config, AllocationPolicy >::allocator_.

Referenced by v8::internal::SplayTree< Config, AllocationPolicy >::Node::INLINE(), v8::internal::SplayTree< Config, AllocationPolicy >::INLINE(), and v8::internal::EffectsBase< Var, kNoVar >::zone().

Here is the caller graph for this function:

Clear()

template<typename Config , class AllocationPolicy >

void v8::internal::SplayTree< Config, AllocationPolicy >::Clear ( )

inline

Definition at line 90 of file splay-tree.h.

{ ResetRoot(); }

References v8::internal::SplayTree< Config, AllocationPolicy >::ResetRoot().

Here is the call graph for this function:

Contains()

template<typename Config , class Allocator >

bool v8::internal::SplayTree< Config, Allocator >::Contains

(

const Key &

key

)

Definition at line 71 of file splay-tree-inl.h.

                                                          {
  return FindInternal(key);
}

Referenced by v8::internal::EffectsBase< Var, kNoVar >::Contains().

Here is the caller graph for this function:

DISALLOW_COPY_AND_ASSIGN()

template<typename Config , class AllocationPolicy >

v8::internal::SplayTree< Config, AllocationPolicy >::DISALLOW_COPY_AND_ASSIGN ( SplayTree< Config, AllocationPolicy >  )

private

Find()

template<typename Config , class Allocator >

bool v8::internal::SplayTree< Config, Allocator >::Find	(	const Key &	key,
		Locator *	locator
	)

Definition at line 77 of file splay-tree-inl.h.

                                                                        {
  if (FindInternal(key)) {
    locator->bind(root_);
    return true;
  } else {
    return false;
  }
}

Referenced by v8::internal::CodeMap::GetSharedId(), and v8::internal::CodeMap::MoveCode().

Here is the caller graph for this function:

FindGreatest()

template<typename Config , class Allocator >

bool v8::internal::SplayTree< Config, Allocator >::FindGreatest

(

Locator *

locator

)

Definition at line 136 of file splay-tree-inl.h.

                                                                {
  if (is_empty())
    return false;
  Node* current = root_;
  while (current->right_ != NULL)
    current = current->right_;
  locator->bind(current);
  return true;
}

References NULL, and v8::internal::SplayTree< Config, AllocationPolicy >::Node::right_.

FindGreatestLessThan()

template<typename Config , class Allocator >

bool v8::internal::SplayTree< Config, Allocator >::FindGreatestLessThan	(	const Key &	key,
		Locator *	locator
	)

Definition at line 88 of file splay-tree-inl.h.

                                                                          {
  if (is_empty())
    return false;
  // Splay on the key to move the node with the given key or the last
  // node on the search path to the top of the tree.
  Splay(key);
  // Now the result is either the root node or the greatest node in
  // the left subtree.
  int cmp = Config::Compare(root_->key_, key);
  if (cmp <= 0) {
    locator->bind(root_);
    return true;
  } else {
    Node* temp = root_;
    root_ = root_->left_;
    bool result = FindGreatest(locator);
    root_ = temp;
    return result;
  }
}

References v8::internal::Compare().

Referenced by v8::internal::CodeMap::DeleteAllCoveredCode(), and v8::internal::CodeMap::FindEntry().

Here is the call graph for this function:

Here is the caller graph for this function:

FindInternal()

template<typename Config , class Allocator >

bool v8::internal::SplayTree< Config, Allocator >::FindInternal ( const Key &  key )

private

Definition at line 62 of file splay-tree-inl.h.

                                                              {
  if (is_empty())
    return false;
  Splay(key);
  return Config::Compare(key, root_->key_) == 0;
}

References v8::internal::Compare().

Here is the call graph for this function:

FindLeast()

template<typename Config , class Allocator >

bool v8::internal::SplayTree< Config, Allocator >::FindLeast

(

Locator *

locator

)

Definition at line 148 of file splay-tree-inl.h.

                                                             {
  if (is_empty())
    return false;
  Node* current = root_;
  while (current->left_ != NULL)
    current = current->left_;
  locator->bind(current);
  return true;
}

FindLeastGreaterThan()

template<typename Config , class Allocator >

bool v8::internal::SplayTree< Config, Allocator >::FindLeastGreaterThan	(	const Key &	key,
		Locator *	locator
	)

Definition at line 112 of file splay-tree-inl.h.

                                                                          {
  if (is_empty())
    return false;
  // Splay on the key to move the node with the given key or the last
  // node on the search path to the top of the tree.
  Splay(key);
  // Now the result is either the root node or the least node in
  // the right subtree.
  int cmp = Config::Compare(root_->key_, key);
  if (cmp >= 0) {
    locator->bind(root_);
    return true;
  } else {
    Node* temp = root_;
    root_ = root_->right_;
    bool result = FindLeast(locator);
    root_ = temp;
    return result;
  }
}

References v8::internal::Compare(), and v8::internal::SplayTree< Config, AllocationPolicy >::Node::right_.

Here is the call graph for this function:

ForEach()

template<typename Config , class Allocator >

template<class Callback >

void v8::internal::SplayTree< Config, Allocator >::ForEach

(

Callback *

callback

)

Definition at line 271 of file splay-tree-inl.h.

                                                             {
  NodeToPairAdaptor<Callback> callback_adaptor(callback);
  ForEachNode(&callback_adaptor);
}

Referenced by v8::internal::EffectsBase< Var, kNoVar >::ForEach(), and v8::internal::CodeMap::Print().

Here is the caller graph for this function:

ForEachNode()

template<typename Config , class Allocator >

template<class Callback >

void v8::internal::SplayTree< Config, Allocator >::ForEachNode ( Callback *  callback )

private

Definition at line 278 of file splay-tree-inl.h.

                                                                 {
  if (root_ == NULL) return;
  // Pre-allocate some space for tiny trees.
  List<Node*, Allocator> nodes_to_visit(10, allocator_);
  nodes_to_visit.Add(root_, allocator_);
  int pos = 0;
  while (pos < nodes_to_visit.length()) {
    Node* node = nodes_to_visit[pos++];
    if (node->left() != NULL) nodes_to_visit.Add(node->left(), allocator_);
    if (node->right() != NULL) nodes_to_visit.Add(node->right(), allocator_);
    callback->Call(node);
  }
}

References v8::internal::List< T, AllocationPolicy >::Add(), v8::internal::SplayTree< Config, AllocationPolicy >::Node::left(), NULL, and v8::internal::SplayTree< Config, AllocationPolicy >::Node::right().

Here is the call graph for this function:

INLINE() [1/3]

template<typename Config , class AllocationPolicy >

v8::internal::SplayTree< Config, AllocationPolicy >::INLINE ( void *operator   newsize_t size, AllocationPolicy allocator=AllocationPolicy() )

inline

Definition at line 42 of file splay-tree.h.

                                                                              {
    return allocator.New(static_cast<int>(size));
  }

References v8::internal::SplayTree< Config, AllocationPolicy >::allocator(), and size.

Here is the call graph for this function:

INLINE() [2/3]

template<typename Config , class AllocationPolicy >

v8::internal::SplayTree< Config, AllocationPolicy >::INLINE ( void operator   deletevoid *p )

inline

Definition at line 46 of file splay-tree.h.

                                        {
    AllocationPolicy::Delete(p);
  }

INLINE() [3/3]

template<typename Config , class AllocationPolicy >

v8::internal::SplayTree< Config, AllocationPolicy >::INLINE ( void operator   deletevoid *p, AllocationPolicy policy )

inline

Definition at line 50 of file splay-tree.h.

                                                                 {
    UNREACHABLE();
  }

References UNREACHABLE.

Insert()

template<typename Config , class Allocator >

bool v8::internal::SplayTree< Config, Allocator >::Insert	(	const Key &	key,
		Locator *	locator
	)

Definition at line 22 of file splay-tree-inl.h.

                                                            {
  if (is_empty()) {
    // If the tree is empty, insert the new node.
    root_ = new(allocator_) Node(key, Config::NoValue());
  } else {
    // Splay on the key to move the last node on the search path
    // for the key to the root of the tree.
    Splay(key);
    // Ignore repeated insertions with the same key.
    int cmp = Config::Compare(key, root_->key_);
    if (cmp == 0) {
      locator->bind(root_);
      return false;
    }
    // Insert the new node.
    Node* node = new(allocator_) Node(key, Config::NoValue());
    InsertInternal(cmp, node);
  }
  locator->bind(root_);
  return true;
}

References v8::internal::Compare().

Referenced by v8::internal::CodeMap::AddCode(), and v8::internal::CodeMap::GetSharedId().

Here is the call graph for this function:

Here is the caller graph for this function:

InsertInternal()

template<typename Config , class Allocator >

void v8::internal::SplayTree< Config, Allocator >::InsertInternal ( int  cmp, Node *  node  )

private

Definition at line 47 of file splay-tree-inl.h.

                                                                     {
  if (cmp > 0) {
    node->left_ = root_;
    node->right_ = root_->right_;
    root_->right_ = NULL;
  } else {
    node->right_ = root_;
    node->left_ = root_->left_;
    root_->left_ = NULL;
  }
  root_ = node;
}

References v8::internal::SplayTree< Config, AllocationPolicy >::Node::left_, NULL, and v8::internal::SplayTree< Config, AllocationPolicy >::Node::right_.

is_empty()

template<typename Config , class AllocationPolicy >

bool v8::internal::SplayTree< Config, AllocationPolicy >::is_empty ( )

inline

Definition at line 92 of file splay-tree.h.

{ return root_ == NULL; }

References NULL, and v8::internal::SplayTree< Config, AllocationPolicy >::root_.

Move()

template<typename Config , class Allocator >

bool v8::internal::SplayTree< Config, Allocator >::Move	(	const Key &	old_key,
		const Key &	new_key
	)

Definition at line 160 of file splay-tree-inl.h.

                                                            {
  if (!FindInternal(old_key))
    return false;
  Node* node_to_move = root_;
  RemoveRootNode(old_key);
  Splay(new_key);
  int cmp = Config::Compare(new_key, root_->key_);
  if (cmp == 0) {
    // A node with the target key already exists.
    delete node_to_move;
    return false;
  }
  node_to_move->key_ = new_key;
  InsertInternal(cmp, node_to_move);
  return true;
}

Remove()

template<typename Config , class Allocator >

bool v8::internal::SplayTree< Config, Allocator >::Remove

(

const Key &

key

)

Definition at line 180 of file splay-tree-inl.h.

                                                        {
  if (!FindInternal(key))
    return false;
  Node* node_to_remove = root_;
  RemoveRootNode(key);
  delete node_to_remove;
  return true;
}

Referenced by v8::internal::CodeMap::DeleteAllCoveredCode(), and v8::internal::CodeMap::MoveCode().

Here is the caller graph for this function:

RemoveRootNode()

template<typename Config , class Allocator >

void v8::internal::SplayTree< Config, Allocator >::RemoveRootNode ( const Key &  key )

private

Definition at line 191 of file splay-tree-inl.h.

                                                                {
  if (root_->left_ == NULL) {
    // No left child, so the new tree is just the right child.
    root_ = root_->right_;
  } else {
    // Left child exists.
    Node* right = root_->right_;
    // Make the original left child the new root.
    root_ = root_->left_;
    // Splay to make sure that the new root has an empty right child.
    Splay(key);
    // Insert the original right child as the right child of the new
    // root.
    root_->right_ = right;
  }
}

ResetRoot()

template<typename Config , class AllocationPolicy >

void v8::internal::SplayTree< Config, AllocationPolicy >::ResetRoot ( )

inlineprotected

Definition at line 154 of file splay-tree.h.

{ root_ = NULL; }

References NULL, and v8::internal::SplayTree< Config, AllocationPolicy >::root_.

Referenced by v8::internal::SplayTree< Config, AllocationPolicy >::Clear(), and v8::internal::ZoneSplayTree< Config >::~ZoneSplayTree().

Here is the caller graph for this function:

Splay()

template<typename Config , class Allocator >

void v8::internal::SplayTree< Config, Allocator >::Splay

(

const Key &

key

)

Definition at line 210 of file splay-tree-inl.h.

                                                       {
  if (is_empty())
    return;
  Node dummy_node(Config::kNoKey, Config::NoValue());
  // Create a dummy node.  The use of the dummy node is a bit
  // counter-intuitive: The right child of the dummy node will hold
  // the L tree of the algorithm.  The left child of the dummy node
  // will hold the R tree of the algorithm.  Using a dummy node, left
  // and right will always be nodes and we avoid special cases.
  Node* dummy = &dummy_node;
  Node* left = dummy;
  Node* right = dummy;
  Node* current = root_;
  while (true) {
    int cmp = Config::Compare(key, current->key_);
    if (cmp < 0) {
      if (current->left_ == NULL)
        break;
      if (Config::Compare(key, current->left_->key_) < 0) {
        // Rotate right.
        Node* temp = current->left_;
        current->left_ = temp->right_;
        temp->right_ = current;
        current = temp;
        if (current->left_ == NULL)
          break;
      }
      // Link right.
      right->left_ = current;
      right = current;
      current = current->left_;
    } else if (cmp > 0) {
      if (current->right_ == NULL)
        break;
      if (Config::Compare(key, current->right_->key_) > 0) {
        // Rotate left.
        Node* temp = current->right_;
        current->right_ = temp->left_;
        temp->left_ = current;
        current = temp;
        if (current->right_ == NULL)
          break;
      }
      // Link left.
      left->right_ = current;
      left = current;
      current = current->right_;
    } else {
      break;
    }
  }
  // Assemble.
  left->right_ = current->left_;
  right->left_ = current->right_;
  current->left_ = dummy->right_;
  current->right_ = dummy->left_;
  root_ = current;
}

References v8::internal::Compare(), v8::internal::SplayTree< Config, AllocationPolicy >::Node::key_, v8::internal::SplayTree< Config, AllocationPolicy >::Node::left_, NULL, and v8::internal::SplayTree< Config, AllocationPolicy >::Node::right_.

Here is the call graph for this function:

Member Data Documentation

allocator_

template<typename Config , class AllocationPolicy >

AllocationPolicy v8::internal::SplayTree< Config, AllocationPolicy >::allocator_

private

Definition at line 195 of file splay-tree.h.

Referenced by v8::internal::SplayTree< Config, AllocationPolicy >::allocator().

root_

template<typename Config , class AllocationPolicy >

Node* v8::internal::SplayTree< Config, AllocationPolicy >::root_

private

Definition at line 194 of file splay-tree.h.

Referenced by v8::internal::SplayTree< Config, AllocationPolicy >::is_empty(), and v8::internal::SplayTree< Config, AllocationPolicy >::ResetRoot().

---

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

• /mnt/V8SourceCode/src/globals.h
• /mnt/V8SourceCode/src/splay-tree.h
• /mnt/V8SourceCode/src/splay-tree-inl.h