BTree Class Reference

#include <btree.h>

Inheritance diagram for BTree:

[legend]Collaboration diagram for BTree:

[legend]List of all members.

Public Types
enum	MoveType { SWAP, ROTATE, MOVE }
Public Member Functions
	BTree (const HardBlockInfoType &blockinfo)
	BTree (const HardBlockInfoType &blockinfo, double nTolerance)
	BTree (const BTree &newBTree)
bool	operator= (const BTree &newBTree)
const vector< double > &	xloc () const
const vector< double > &	yloc () const
double	xloc (int index) const
double	yloc (int index) const
double	width (int index) const
double	height (int index) const
double	blockArea () const
double	totalArea () const
double	totalWidth () const
double	totalHeight () const
void	setTree (const vector< BTreeNode > &ntree)
void	evaluate (const vector< BTreeNode > &ntree)
void	evaluate (const vector< int > &tree_bits, const vector< int > &perm, const vector< int > &orient)
void	swap (int indexOne, int indexTwo)
void	rotate (int index, int newOrient)
void	move (int index, int target, bool leftChild)
void	save_bbb (const string &filename) const
Static Public Member Functions
void	bits2tree (const vector< int > &tree_bits, const vector< int > &perm, const vector< int > &orient, vector< BTreeNode > &ntree)
void	clean_tree (vector< BTreeNode > &otree)
void	clean_contour (vector< ContourNode > &oContour)
Public Attributes
const vector< BTreeNode > &	tree
const vector< ContourNode > &	contour
const int	NUM_BLOCKS
Static Public Attributes
const int	UNDEFINED = Dimension::UNDEFINED
Protected Member Functions
void	contour_evaluate ()
void	contour_add_block (int treePtr)
void	swap_parent_child (int parent, bool isLeft)
void	remove_left_up_right_down (int index)
Protected Attributes
const HardBlockInfoType &	in_blockinfo
vector< BTreeNode >	in_tree
vector< ContourNode >	in_contour
vector< double >	in_xloc
vector< double >	in_yloc
vector< double >	in_width
vector< double >	in_height
double	in_blockArea
double	in_totalArea
double	in_totalWidth
double	in_totalHeight
const double	TOLERANCE

---

Member Enumeration Documentation

enum BTree::MoveType

Enumeration values: SWAP  ROTATE  MOVE  Definition at line 83 of file btree.h. Referenced by BTreeAreaWireAnnealer::get_move(), and BTreeAreaWireAnnealer::makeMove(). {SWAP, ROTATE, MOVE};

---

Constructor & Destructor Documentation

BTree::BTree (  const HardBlockInfoType &  blockinfo  )

Definition at line 51 of file btree.cxx. References in_contour, in_height, in_tree, in_width, in_xloc, in_yloc, NUM_BLOCKS, and UNDEFINED. : tree(in_tree), contour(in_contour), NUM_BLOCKS(blockinfo.blocknum()), in_blockinfo(blockinfo), in_tree(blockinfo.blocknum()+2), in_contour(blockinfo.blocknum()+2), in_xloc(blockinfo.blocknum()+2, UNDEFINED), in_yloc(blockinfo.blocknum()+2, UNDEFINED), in_width(blockinfo.blocknum()+2, UNDEFINED), in_height(blockinfo.blocknum()+2, UNDEFINED), in_blockArea(blockinfo.blockArea()), in_totalArea(0), in_totalWidth(0), in_totalHeight(0), TOLERANCE(0) { int vec_size = NUM_BLOCKS+2; for (int i = 0; i < vec_size; i++) { in_tree[i].parent = UNDEFINED; in_tree[i].left = UNDEFINED; in_tree[i].right = UNDEFINED; in_tree[i].block_index = i; in_tree[i].orient = UNDEFINED; in_contour[i].next = UNDEFINED; in_contour[i].prev = UNDEFINED; in_contour[i].begin = UNDEFINED; in_contour[i].end = UNDEFINED; in_contour[i].CTL = UNDEFINED; } in_contour[NUM_BLOCKS].next = NUM_BLOCKS+1; in_contour[NUM_BLOCKS].prev = UNDEFINED; in_contour[NUM_BLOCKS].begin = 0; in_contour[NUM_BLOCKS].end = 0; in_contour[NUM_BLOCKS].CTL = Dimension::INFTY; in_xloc[NUM_BLOCKS] = 0; in_yloc[NUM_BLOCKS] = 0; in_width[NUM_BLOCKS] = 0; in_height[NUM_BLOCKS] = Dimension::INFTY; in_contour[NUM_BLOCKS+1].next = UNDEFINED; in_contour[NUM_BLOCKS+1].prev = NUM_BLOCKS; in_contour[NUM_BLOCKS+1].begin = 0; in_contour[NUM_BLOCKS+1].end = Dimension::INFTY; in_contour[NUM_BLOCKS+1].CTL = 0; in_xloc[NUM_BLOCKS+1] = 0; in_yloc[NUM_BLOCKS+1] = 0; in_width[NUM_BLOCKS+1] = Dimension::INFTY; in_height[NUM_BLOCKS+1] = 0; }

BTree::BTree (  const HardBlockInfoType &  blockinfo, double  nTolerance )

Definition at line 110 of file btree.cxx. References in_contour, in_height, in_tree, in_width, in_xloc, in_yloc, NUM_BLOCKS, and UNDEFINED. : tree(in_tree), contour(in_contour), NUM_BLOCKS(blockinfo.blocknum()), in_blockinfo(blockinfo), in_tree(blockinfo.blocknum()+2), in_contour(blockinfo.blocknum()+2), in_xloc(blockinfo.blocknum()+2, UNDEFINED), in_yloc(blockinfo.blocknum()+2, UNDEFINED), in_width(blockinfo.blocknum()+2, UNDEFINED), in_height(blockinfo.blocknum()+2, UNDEFINED), in_blockArea(blockinfo.blockArea()), in_totalArea(0), in_totalWidth(0), in_totalHeight(0), TOLERANCE(nTolerance) { int vec_size = NUM_BLOCKS+2; for (int i = 0; i < vec_size; i++) { in_tree[i].parent = UNDEFINED; in_tree[i].left = UNDEFINED; in_tree[i].right = UNDEFINED; in_tree[i].block_index = i; in_tree[i].orient = UNDEFINED; in_contour[i].next = UNDEFINED; in_contour[i].prev = UNDEFINED; in_contour[i].begin = UNDEFINED; in_contour[i].end = UNDEFINED; in_contour[i].CTL = UNDEFINED; } in_contour[NUM_BLOCKS].next = NUM_BLOCKS+1; in_contour[NUM_BLOCKS].prev = UNDEFINED; in_contour[NUM_BLOCKS].begin = 0; in_contour[NUM_BLOCKS].end = 0; in_contour[NUM_BLOCKS].CTL = Dimension::INFTY; in_xloc[NUM_BLOCKS] = 0; in_yloc[NUM_BLOCKS] = 0; in_width[NUM_BLOCKS] = 0; in_height[NUM_BLOCKS] = Dimension::INFTY; in_contour[NUM_BLOCKS+1].next = UNDEFINED; in_contour[NUM_BLOCKS+1].prev = NUM_BLOCKS; in_contour[NUM_BLOCKS+1].begin = 0; in_contour[NUM_BLOCKS+1].end = Dimension::INFTY; in_contour[NUM_BLOCKS+1].CTL = 0; in_xloc[NUM_BLOCKS+1] = 0; in_yloc[NUM_BLOCKS+1] = 0; in_width[NUM_BLOCKS+1] = Dimension::INFTY; in_height[NUM_BLOCKS+1] = 0; }

BTree::BTree (  const BTree &  newBTree  )  [inline]

Definition at line 155 of file btree.h. : tree(in_tree), contour(in_contour), NUM_BLOCKS(newBtree.NUM_BLOCKS), in_blockinfo(newBtree.in_blockinfo), in_tree(newBtree.in_tree), in_contour(newBtree.in_contour), in_xloc(newBtree.in_xloc), in_yloc(newBtree.in_yloc), in_width(newBtree.in_width), in_height(newBtree.in_height), in_blockArea(newBtree.in_blockArea), in_totalArea(newBtree.in_totalArea), in_totalWidth(newBtree.in_totalWidth), in_totalHeight(newBtree.in_totalHeight), TOLERANCE(newBtree.TOLERANCE) {}

---

Member Function Documentation

void BTree::bits2tree (  const vector< int > &  tree_bits, const vector< int > &  perm, const vector< int > &  orient, vector< BTreeNode > &  ntree )  [static]

Definition at line 197 of file btree.cxx. References clean_tree(), and UNDEFINED. Referenced by evaluate(). { int perm_size = perm.size(); ntree.resize(perm_size+2); clean_tree(ntree); int treePtr = perm_size; int bitsPtr = 0; int lastAct = -1; for (int i = 0; i < perm_size; i++) { int currAct = tree_bits[bitsPtr]; while (currAct == 1) { // move up a level/sibling if (lastAct == 1) treePtr = ntree[treePtr].parent; // move among siblings while (ntree[treePtr].right != UNDEFINED) treePtr = ntree[treePtr].parent; bitsPtr++; lastAct = 1; currAct = tree_bits[bitsPtr]; } if (lastAct != 1) ntree[treePtr].left = perm[i]; else // lastAct == 1 ntree[treePtr].right = perm[i]; ntree[perm[i]].parent = treePtr; ntree[perm[i]].block_index = perm[i]; ntree[perm[i]].orient = orient[i]; treePtr = perm[i]; lastAct = 0; bitsPtr++; } }

Here is the call graph for this function:

double BTree::blockArea (   )  const [inline]

Definition at line 217 of file btree.h. References in_blockArea. Referenced by BTreeCompactSlice(), OutputBTree(), BTreeAreaWireAnnealer::packOneBlock(), and BTreeCompactor::slimAssign(). { return in_blockArea; }

void BTree::clean_contour (  vector< ContourNode > &  oContour  )  [inline, static]

Definition at line 248 of file btree.h. References basepacking_h::Dimension::INFTY, and UNDEFINED. Referenced by BTreeCompactor::build_orth_tree(), and contour_evaluate(). { int vec_size = oContour.size(); int Ledge = vec_size-2; int Bedge = vec_size-1; oContour[Ledge].next = Bedge; oContour[Ledge].prev = UNDEFINED; oContour[Ledge].begin = 0; oContour[Ledge].end = 0; oContour[Ledge].CTL = basepacking_h::Dimension::INFTY; oContour[Bedge].next = UNDEFINED; oContour[Bedge].prev = Ledge; oContour[Bedge].begin = 0; oContour[Bedge].end = basepacking_h::Dimension::INFTY; oContour[Bedge].CTL = 0; }

void BTree::clean_tree (  vector< BTreeNode > &  otree  )  [inline, static]

Definition at line 232 of file btree.h. References UNDEFINED. Referenced by bits2tree(), BTreeSlackEval::BTreeSlackEval(), BTreeCompactor::build_orth_tree(), and BTreeSlackEval::reverse_tree(). { int vec_size = otree.size(); for (int i = 0; i < vec_size; i++) { otree[i].parent = UNDEFINED; otree[i].left = UNDEFINED; otree[i].right = UNDEFINED; } otree[vec_size-2].block_index = vec_size-2; otree[vec_size-1].block_index = vec_size-1; otree[vec_size-2].orient = UNDEFINED; otree[vec_size-1].orient = UNDEFINED; }

void BTree::contour_add_block (  int  treePtr  )  [protected]

Definition at line 484 of file btree.cxx. References in_blockinfo, in_contour, in_height, in_tree, in_width, in_xloc, in_yloc, TOLERANCE, and UNDEFINED. Referenced by contour_evaluate(). { int tree_parent = in_tree[tree_ptr].parent; double maxCTL = -1; int contour_ptr = UNDEFINED; int contour_prev = UNDEFINED; if (tree_ptr == in_tree[in_tree[tree_ptr].parent].left) { in_contour[tree_ptr].begin = in_contour[tree_parent].end; contour_ptr = in_contour[tree_parent].next; } else { in_contour[tree_ptr].begin = in_contour[tree_parent].begin; contour_ptr = tree_parent; } contour_prev = in_contour[contour_ptr].prev; // begins of cPtr/tPtr match maxCTL = in_contour[contour_ptr].CTL; int block = in_tree[tree_ptr].block_index; int theta = in_tree[tree_ptr].orient; in_contour[tree_ptr].end = in_contour[tree_ptr].begin + in_blockinfo[block].width[theta]; while (in_contour[contour_ptr].end <= in_contour[tree_ptr].end + TOLERANCE) { maxCTL = max(maxCTL, in_contour[contour_ptr].CTL); contour_ptr = in_contour[contour_ptr].next; } if (in_contour[contour_ptr].begin + TOLERANCE < in_contour[tree_ptr].end) maxCTL = max(maxCTL, in_contour[contour_ptr].CTL); in_xloc[tree_ptr] = in_contour[tree_ptr].begin; in_yloc[tree_ptr] = maxCTL; in_width[tree_ptr] = in_blockinfo[block].width[theta]; in_height[tree_ptr] = in_blockinfo[block].height[theta]; in_contour[tree_ptr].CTL = maxCTL + in_blockinfo[block].height[theta]; in_contour[tree_ptr].next = contour_ptr; in_contour[contour_ptr].prev = tree_ptr; in_contour[contour_ptr].begin = in_contour[tree_ptr].end; in_contour[tree_ptr].prev = contour_prev; in_contour[contour_prev].next = tree_ptr; in_contour[tree_ptr].begin = in_contour[contour_prev].end; }

void BTree::contour_evaluate (   )  [protected]

Definition at line 438 of file btree.cxx. References clean_contour(), contour_add_block(), in_contour, in_totalArea, in_totalHeight, in_totalWidth, in_tree, NUM_BLOCKS, and UNDEFINED. Referenced by evaluate(), move(), rotate(), and swap(). { clean_contour(in_contour); int tree_prev = NUM_BLOCKS; int tree_curr = in_tree[NUM_BLOCKS].left; // start with first block while (tree_curr != NUM_BLOCKS) // until reach the root again { // cout << "tree_curr: " << tree_curr << endl; if (tree_prev == in_tree[tree_curr].parent) { contour_add_block(tree_curr); tree_prev = tree_curr; if (in_tree[tree_curr].left != UNDEFINED) tree_curr = in_tree[tree_curr].left; else if (in_tree[tree_curr].right != UNDEFINED) tree_curr = in_tree[tree_curr].right; else tree_curr = in_tree[tree_curr].parent; } else if (tree_prev == in_tree[tree_curr].left) { tree_prev = tree_curr; if (in_tree[tree_curr].right != UNDEFINED) tree_curr = in_tree[tree_curr].right; else tree_curr = in_tree[tree_curr].parent; } else { tree_prev = tree_curr; tree_curr = in_tree[tree_curr].parent; } } in_totalWidth = in_contour[NUM_BLOCKS+1].begin; int contour_ptr = in_contour[NUM_BLOCKS].next; in_totalHeight = 0; while (contour_ptr != NUM_BLOCKS+1) { in_totalHeight = max(in_totalHeight, in_contour[contour_ptr].CTL); contour_ptr = in_contour[contour_ptr].next; } in_totalArea = in_totalWidth * in_totalHeight; }

Here is the call graph for this function:

void BTree::evaluate (  const vector< int > &  tree_bits, const vector< int > &  perm, const vector< int > &  orient )

Definition at line 182 of file btree.cxx. References bits2tree(), contour_evaluate(), in_tree, and NUM_BLOCKS. { if (int(perm.size()) != NUM_BLOCKS) { cout << "ERROR: the permutation length doesn't match with " << "size of the tree." << endl; exit(1); } bits2tree(tree_bits, perm, orient, in_tree); // OutputBTree(cout, in_tree); contour_evaluate(); }

Here is the call graph for this function:

void BTree::evaluate (  const vector< BTreeNode > &  ntree  )

Definition at line 170 of file btree.cxx. References contour_evaluate(), and in_tree. Referenced by BTreeAreaWireAnnealer::anneal(), BTreeFromSoftPacking::BTreeFromSoftPacking(), BTreeSlackEval::evaluateXSlacks(), BTreeSlackEval::evaluateYSlacks(), BTreeAreaWireAnnealer::GenerateRandomSoln(), BTreeAreaWireAnnealer::packSoftBlocks(), and BTreeAreaWireAnnealer::takePlfromDB(). { if (ntree.size() != in_tree.size()) { cout << "ERROR: size of btree's doesn't match." << endl; exit(1); } in_tree = ntree; contour_evaluate(); }

Here is the call graph for this function:

double BTree::height (  int  index  )  const [inline]

Definition at line 214 of file btree.h. References in_height. Referenced by BTreeAreaWireAnnealer::anneal(), BTreeOrientedPacking::BTreeOrientedPacking(), BTreeAreaWireAnnealer::DBfromSoln(), BTreeSlackEval::evaluateYSlacks(), BTreeAreaWireAnnealer::getSoftBlIndex(), BTreeAreaWireAnnealer::getSoftBlNewDimensions(), BTreeOrientedPacking::operator=(), OutputBTree(), BTreeAreaWireAnnealer::packOneBlock(), and BTreeAreaWireAnnealer::packSoftBlocks(). { return in_height[index]; }

void BTree::move (  int  index, int  target, bool  leftChild )

Definition at line 355 of file btree.cxx. References contour_evaluate(), in_tree, remove_left_up_right_down(), and UNDEFINED. Referenced by BTreeAreaWireAnnealer::makeARWLMove(), BTreeAreaWireAnnealer::makeHPWLMove(), BTreeAreaWireAnnealer::makeMoveSlacksCore(), and BTreeAreaWireAnnealer::perform_move(). { int index_parent = in_tree[index].parent; int index_left = in_tree[index].left; int index_right = in_tree[index].right; // remove "index" from the tree if ((index_left != UNDEFINED) && (index_right != UNDEFINED)) remove_left_up_right_down(index); else if (index_left != UNDEFINED) { in_tree[index_left].parent = index_parent; if (index == in_tree[index_parent].left) in_tree[index_parent].left = index_left; else in_tree[index_parent].right = index_left; } else if (index_right != UNDEFINED) { in_tree[index_right].parent = index_parent; if (index == in_tree[index_parent].left) in_tree[index_parent].left = index_right; else in_tree[index_parent].right = index_right; } else { if (index == in_tree[index_parent].left) in_tree[index_parent].left = UNDEFINED; else in_tree[index_parent].right = UNDEFINED; } int target_left = in_tree[target].left; int target_right = in_tree[target].right; // add "index" to the required location if (leftChild) { in_tree[target].left = index; if (target_left != UNDEFINED) in_tree[target_left].parent = index; in_tree[index].parent = target; in_tree[index].left = target_left; in_tree[index].right = UNDEFINED; } else { in_tree[target].right = index; if (target_right != UNDEFINED) in_tree[target_right].parent = index; in_tree[index].parent = target; in_tree[index].left = UNDEFINED; in_tree[index].right = target_right; } contour_evaluate(); }

Here is the call graph for this function:

bool BTree::operator= (  const BTree &  newBTree  )  [inline]

Reimplemented in BTreeCompactor. Definition at line 176 of file btree.h. References in_blockArea, in_contour, in_height, in_totalArea, in_totalHeight, in_totalWidth, in_tree, in_width, in_xloc, in_yloc, and NUM_BLOCKS. Referenced by BTreeCompactor::operator=(). { if (NUM_BLOCKS == newBtree.NUM_BLOCKS) { in_tree = newBtree.in_tree; in_contour = newBtree.in_contour; in_xloc = newBtree.in_xloc; in_yloc = newBtree.in_yloc; in_width = newBtree.in_width; in_height = newBtree.in_height; in_blockArea = newBtree.in_blockArea; in_totalArea = newBtree.in_totalArea; in_totalWidth = newBtree.in_totalWidth; in_totalHeight = newBtree.in_totalHeight; return true; } else return false; }

void BTree::remove_left_up_right_down (  int  index  )  [protected]

Definition at line 418 of file btree.cxx. References in_tree, and UNDEFINED. Referenced by move(). { int index_parent = in_tree[index].parent; int index_left = in_tree[index].left; int index_right = in_tree[index].right; in_tree[index_left].parent = index_parent; if (index == in_tree[index_parent].left) in_tree[index_parent].left = index_left; else in_tree[index_parent].right = index_left; int ptr = index_left; while (in_tree[ptr].right != UNDEFINED) ptr = in_tree[ptr].right; in_tree[ptr].right = index_right; in_tree[index_right].parent = ptr; }

void BTree::rotate (  int  index, int  newOrient )  [inline]

Definition at line 267 of file btree.h. References contour_evaluate(), and in_tree. Referenced by BTreeAreaWireAnnealer::packOneBlock(), and BTreeAreaWireAnnealer::perform_rotate(). { in_tree[index].orient = newOrient; contour_evaluate(); }

Here is the call graph for this function:

void BTree::save_bbb (  const string &  filename  )  const

Definition at line 534 of file btree.cxx. References in_height, in_totalHeight, in_totalWidth, in_width, in_xloc, in_yloc, and NUM_BLOCKS. Referenced by DebugBTreeAnnealerFromDB(). { ofstream outfile; outfile.open(filename.c_str()); if (!outfile.good()) { cout << "ERROR: cannot open file" << filename << endl; exit(1); } outfile.setf(ios::fixed); outfile.precision(3); outfile << in_totalWidth << endl; outfile << in_totalHeight << endl; outfile << NUM_BLOCKS << endl; for (int i = 0; i < NUM_BLOCKS; i++) outfile << in_width[i] << " " << in_height[i] << endl; outfile << endl; for (int i = 0; i < NUM_BLOCKS; i++) outfile << in_xloc[i] << " " << in_yloc[i] << endl; outfile << endl; }

void BTree::setTree (  const vector< BTreeNode > &  ntree  )  [inline]

Definition at line 229 of file btree.h. References in_tree. Referenced by BTreeAreaWireAnnealer::perform_move(), and BTreeAreaWireAnnealer::perform_rotate(). { in_tree = ntree; }

void BTree::swap (  int  indexOne, int  indexTwo )

Definition at line 242 of file btree.cxx. References contour_evaluate(), in_tree, swap_parent_child(), and UNDEFINED. Referenced by BTreeAreaWireAnnealer::perform_swap(). { int indexOne_left = in_tree[indexOne].left; int indexOne_right = in_tree[indexOne].right; int indexOne_parent = in_tree[indexOne].parent; int indexTwo_left = in_tree[indexTwo].left; int indexTwo_right = in_tree[indexTwo].right; int indexTwo_parent = in_tree[indexTwo].parent; if (indexOne == indexTwo_parent) swap_parent_child(indexOne, (indexTwo == in_tree[indexOne].left)); else if (indexTwo == indexOne_parent) swap_parent_child(indexTwo, (indexOne == in_tree[indexTwo].left)); else { // update around indexOne in_tree[indexOne].parent = indexTwo_parent; in_tree[indexOne].left = indexTwo_left; in_tree[indexOne].right = indexTwo_right; if (indexOne == in_tree[indexOne_parent].left) in_tree[indexOne_parent].left = indexTwo; else in_tree[indexOne_parent].right = indexTwo; if (indexOne_left != UNDEFINED) in_tree[indexOne_left].parent = indexTwo; if (indexOne_right != UNDEFINED) in_tree[indexOne_right].parent = indexTwo; // update around indexTwo in_tree[indexTwo].parent = indexOne_parent; in_tree[indexTwo].left = indexOne_left; in_tree[indexTwo].right = indexOne_right; if (indexTwo == in_tree[indexTwo_parent].left) in_tree[indexTwo_parent].left = indexOne; else in_tree[indexTwo_parent].right = indexOne; if (indexTwo_left != UNDEFINED) in_tree[indexTwo_left].parent = indexOne; if (indexTwo_right != UNDEFINED) in_tree[indexTwo_right].parent = indexOne; } contour_evaluate(); }

Here is the call graph for this function:

void BTree::swap_parent_child (  int  parent, bool  isLeft )  [protected]

Definition at line 294 of file btree.cxx. References in_tree, and UNDEFINED. Referenced by swap(). { int parent_parent = in_tree[parent].parent; int parent_left = in_tree[parent].left; int parent_right = in_tree[parent].right; int child = (isLeft)? in_tree[parent].left : in_tree[parent].right; int child_left = in_tree[child].left; int child_right = in_tree[child].right; if (isLeft) { in_tree[parent].parent = child; in_tree[parent].left = child_left; in_tree[parent].right = child_right; if (parent == in_tree[parent_parent].left) in_tree[parent_parent].left = child; else in_tree[parent_parent].right = child; if (parent_right != UNDEFINED) in_tree[parent_right].parent = child; in_tree[child].parent = parent_parent; in_tree[child].left = parent; in_tree[child].right = parent_right; if (child_left != UNDEFINED) in_tree[child_left].parent = parent; if (child_right != UNDEFINED) in_tree[child_right].parent = parent; } else { in_tree[parent].parent = child; in_tree[parent].left = child_left; in_tree[parent].right = child_right; if (parent == in_tree[parent_parent].left) in_tree[parent_parent].left = child; else in_tree[parent_parent].right = child; if (parent_left != UNDEFINED) in_tree[parent_left].parent = child; in_tree[child].parent = parent_parent; in_tree[child].left = parent_left; in_tree[child].right = parent; if (child_left != UNDEFINED) in_tree[child_left].parent = parent; if (child_right != UNDEFINED) in_tree[child_right].parent = parent; } }

double BTree::totalArea (   )  const [inline]

Definition at line 220 of file btree.h. References in_totalArea. Referenced by BTreeAreaWireAnnealer::anneal(), BTreeCompactSlice(), BTreeAreaWireAnnealer::compactSoln(), BTreeAreaWireAnnealer::go(), OutputBTree(), and BTreeAreaWireAnnealer::packSoftBlocks(). { return in_totalArea; }

double BTree::totalHeight (   )  const [inline]

Definition at line 226 of file btree.h. References in_totalHeight. Referenced by BTreeAreaWireAnnealer::anneal(), BTreeCompactSlice(), BTreeAreaWireAnnealer::DBfromSoln(), DebugBTreeAnnealerFromDB(), BTreeSlackEval::evaluateYSlacks(), BTreeAreaWireAnnealer::locateSearchBlocks(), BTreeAreaWireAnnealer::makeARMove(), BTreeAreaWireAnnealer::makeARWLMove(), and OutputBTree(). { return in_totalHeight; }

double BTree::totalWidth (   )  const [inline]

Definition at line 223 of file btree.h. References in_totalWidth. Referenced by BTreeAreaWireAnnealer::anneal(), BTreeCompactSlice(), BTreeAreaWireAnnealer::DBfromSoln(), DebugBTreeAnnealerFromDB(), BTreeSlackEval::evaluateXSlacks(), BTreeAreaWireAnnealer::locateSearchBlocks(), BTreeAreaWireAnnealer::makeARMove(), BTreeAreaWireAnnealer::makeARWLMove(), and OutputBTree(). { return in_totalWidth; }

double BTree::width (  int  index  )  const [inline]

Definition at line 211 of file btree.h. References in_width. Referenced by BTreeAreaWireAnnealer::anneal(), BTreeOrientedPacking::BTreeOrientedPacking(), BTreeAreaWireAnnealer::DBfromSoln(), BTreeSlackEval::evaluateXSlacks(), BTreeAreaWireAnnealer::getSoftBlIndex(), BTreeAreaWireAnnealer::getSoftBlNewDimensions(), BTreeOrientedPacking::operator=(), OutputBTree(), BTreeAreaWireAnnealer::packOneBlock(), and BTreeAreaWireAnnealer::packSoftBlocks(). { return in_width[index]; }

double BTree::xloc (  int  index  )  const [inline]

Definition at line 205 of file btree.h. References in_xloc. { return in_xloc[index]; }

const vector< double > & BTree::xloc (   )  const [inline]

Definition at line 199 of file btree.h. References in_xloc. Referenced by BTreeAreaWireAnnealer::anneal(), BTreeOrientedPacking::BTreeOrientedPacking(), BTreeAreaWireAnnealer::DBfromSoln(), BTreeSlackEval::evaluateXSlacks(), BTreeAreaWireAnnealer::locateSearchBlocks(), BTreeOrientedPacking::operator=(), and OutputBTree(). { return in_xloc; }

double BTree::yloc (  int  index  )  const [inline]

Definition at line 208 of file btree.h. References in_yloc. { return in_yloc[index]; }

const vector< double > & BTree::yloc (   )  const [inline]

Definition at line 202 of file btree.h. References in_yloc. Referenced by BTreeAreaWireAnnealer::anneal(), BTreeOrientedPacking::BTreeOrientedPacking(), BTreeAreaWireAnnealer::DBfromSoln(), BTreeSlackEval::evaluateXSlacks(), BTreeSlackEval::evaluateYSlacks(), BTreeAreaWireAnnealer::locateSearchBlocks(), BTreeOrientedPacking::operator=(), and OutputBTree(). { return in_yloc; }

---

Member Data Documentation

const vector<ContourNode>& BTree::contour

Definition at line 56 of file btree.h. Referenced by OutputBTree().

double BTree::in_blockArea [protected]

Definition at line 128 of file btree.h. Referenced by blockArea(), operator=(), and BTreeCompactor::slimAssign().

const HardBlockInfoType& BTree::in_blockinfo [protected]

Definition at line 118 of file btree.h. Referenced by BTreeCompactor::build_orth_tree_add_block(), and contour_add_block().

vector<ContourNode> BTree::in_contour [protected]

Definition at line 120 of file btree.h. Referenced by BTree(), BTreeCompactor::build_orth_tree(), BTreeCompactor::build_orth_tree_add_block(), contour_add_block(), contour_evaluate(), and operator=().

vector<double> BTree::in_height [protected]

Definition at line 126 of file btree.h. Referenced by BTree(), BTreeCompactor::build_orth_tree_add_block(), contour_add_block(), height(), operator=(), and save_bbb().

double BTree::in_totalArea [protected]

Definition at line 129 of file btree.h. Referenced by BTreeCompactor::build_orth_tree(), contour_evaluate(), operator=(), and totalArea().

double BTree::in_totalHeight [protected]

Definition at line 131 of file btree.h. Referenced by BTreeCompactor::build_orth_tree(), contour_evaluate(), operator=(), save_bbb(), and totalHeight().

double BTree::in_totalWidth [protected]

Definition at line 130 of file btree.h. Referenced by BTreeCompactor::build_orth_tree(), contour_evaluate(), operator=(), save_bbb(), and totalWidth().

vector<BTreeNode> BTree::in_tree [protected]

Definition at line 119 of file btree.h. Referenced by BTree(), BTreeFromSoftPacking::BTreeFromSoftPacking(), BTreeCompactor::build_orth_tree(), BTreeCompactor::build_orth_tree_add_block(), BTreeCompactor::compact(), contour_add_block(), contour_evaluate(), evaluate(), BTreeFromSoftPacking::EvaluateTree(), move(), operator=(), remove_left_up_right_down(), rotate(), setTree(), BTreeCompactor::slimAssign(), swap(), and swap_parent_child().

vector<double> BTree::in_width [protected]

Definition at line 125 of file btree.h. Referenced by BTree(), BTreeCompactor::build_orth_tree_add_block(), contour_add_block(), operator=(), save_bbb(), and width().

vector<double> BTree::in_xloc [protected]

Definition at line 123 of file btree.h. Referenced by BTree(), BTreeCompactor::build_orth_tree_add_block(), BTreeCompactor::compact(), contour_add_block(), operator=(), save_bbb(), and xloc().

vector<double> BTree::in_yloc [protected]

Definition at line 124 of file btree.h. Referenced by BTree(), BTreeCompactor::build_orth_tree_add_block(), BTreeCompactor::compact(), contour_add_block(), operator=(), save_bbb(), and yloc().

const int BTree::NUM_BLOCKS

Definition at line 89 of file btree.h. Referenced by BTreeAreaWireAnnealer::anneal(), BTree(), BTreeOrientedPacking::BTreeOrientedPacking(), BTreeCompactor::build_orth_tree(), BTreeCompactor::build_orth_tree_add_block(), BTreeCompactor::compact(), BTreeAreaWireAnnealer::constructor_core(), contour_evaluate(), BTreeAreaWireAnnealer::DBfromSoln(), evaluate(), BTreeSlackEval::evaluateXSlacks(), BTreeSlackEval::evaluateYSlacks(), BTreeCompactor::fix_orth_tree(), BTreeAreaWireAnnealer::getSoftBlIndex(), BTreeAreaWireAnnealer::go(), BTreeAreaWireAnnealer::locateSearchBlocks(), BTreeAreaWireAnnealer::makeARWLMove(), BTreeAreaWireAnnealer::makeHPWLMove(), BTreeAreaWireAnnealer::makeMoveSlacksCore(), BTreeOrientedPacking::operator=(), operator=(), OutputBTree(), BTreeAreaWireAnnealer::packSoftBlocks(), and save_bbb().

const double BTree::TOLERANCE [protected]

Definition at line 133 of file btree.h. Referenced by BTreeCompactor::build_orth_tree_add_block(), and contour_add_block().

const vector<BTreeNode>& BTree::tree

Definition at line 55 of file btree.h. Referenced by BTreeAreaWireAnnealer::anneal(), BTreeOrientedPacking::BTreeOrientedPacking(), BTreeAreaWireAnnealer::DBfromSoln(), BTreeSlackEval::evaluateYSlacks(), BTreeAreaWireAnnealer::getSoftBlIndex(), BTreeAreaWireAnnealer::getSoftBlNewDimensions(), BTreeCompactor::operator=(), BTreeOrientedPacking::operator=(), OutputBTree(), BTreeAreaWireAnnealer::packSoftBlocks(), BTreeAreaWireAnnealer::perform_move(), BTreeAreaWireAnnealer::perform_rotate(), and BTreeCompactor::slimAssign().

const int BTree::UNDEFINED = Dimension::UNDEFINED [static]

Definition at line 49 of file btree.cxx. Referenced by bits2tree(), BTree(), BTreeCompactor::BTreeCompactor(), BTreeCompactor::build_orth_tree(), BTreeCompactor::build_orth_tree_add_block(), clean_contour(), clean_tree(), contour_add_block(), contour_evaluate(), BTreeFromSoftPacking::EvaluateTree(), move(), BTreeCompactor::operator=(), OutputBTree(), remove_left_up_right_down(), BTreeSlackEval::reverse_tree(), BTreeCompactor::slimAssign(), swap(), and swap_parent_child().

---

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

• btree.h
• btree.cxx

---