place_base.c File Reference

#include <stdlib.h>
#include <limits.h>
#include <assert.h>
#include <string.h>
#include "place_base.h"
#include "place_gordian.h"

Include dependency graph for place_base.c:

Go to the source code of this file.

Functions
Rect	getNetBBox (const ConcreteNet *net)
	Returns the bounding box of a net.
float	getNetWirelength (const ConcreteNet *net)
	Returns the half-perimeter wirelength of a net.
float	getTotalWirelength ()
	Returns the total HPWL of all nets.
float	getCellArea (const ConcreteCell *cell)
void	addConcreteNet (ConcreteNet *net)
	Adds a net to the placement database.
void	delConcreteNet (ConcreteNet *net)
	Does not deallocate memory.
void	addConcreteCell (ConcreteCell *cell)
void	delCellFromPartition (ConcreteCell *cell, Partition *p)
void	delConcreteCell (ConcreteCell *cell)
	Removes a cell from the placement database.
int	netSortByL (const void *a, const void *b)
	Sorts nets by position of one of its corners.
int	netSortByR (const void *a, const void *b)
int	netSortByB (const void *a, const void *b)
int	netSortByT (const void *a, const void *b)
int	netSortByID (const void *a, const void *b)
int	cellSortByX (const void *a, const void *b)
	Sorts cells by either position coordinate.
int	cellSortByY (const void *a, const void *b)
int	cellSortByID (const void *a, const void *b)

Variables
ABC_NAMESPACE_IMPL_START int	g_place_numCells = 0
int	g_place_numNets = 0
float	g_place_rowHeight = 1.0
Rect	g_place_coreBounds
Rect	g_place_padBounds
ConcreteCell **	g_place_concreteCells = NULL
int	g_place_concreteCellsSize = 0
ConcreteNet **	g_place_concreteNets = NULL
int	g_place_concreteNetsSize = 0

Function Documentation

addConcreteCell()

void addConcreteCell

(

ConcreteCell *

cell

)

The cell object must already be allocated and the ID must be set appropriately.

Definition at line 155 of file place_base.c.

                                           {
  assert(cell);
  assert(cell->m_id >= 0);
  if (cell->m_id >= g_place_concreteCellsSize) {
    g_place_concreteCellsSize = (cell->m_id > g_place_concreteCellsSize ? 
                                 cell->m_id : g_place_concreteCellsSize);
    g_place_concreteCellsSize *= 1.5;
    g_place_concreteCellsSize += 20;
    g_place_concreteCells = (ConcreteCell**)realloc(g_place_concreteCells, 
          sizeof(ConcreteCell*)*g_place_concreteCellsSize);
    assert(g_place_concreteCells);
  }
  if (cell->m_id >= g_place_numCells) {
    memset(&(g_place_concreteCells[g_place_numCells]), 0,
          sizeof(ConcreteCell*)*(cell->m_id+1-g_place_numCells));
    g_place_numCells = cell->m_id+1;
  }
  g_place_concreteCells[cell->m_id] = cell;
}

Here is the call graph for this function:

Here is the caller graph for this function:

addConcreteNet()

void addConcreteNet

(

ConcreteNet *

net

)

Adds a net to the placement database.

The net object must already be allocated and the ID must be set appropriately.

Definition at line 114 of file place_base.c.

                                        {
  assert(net);
  assert(net->m_id >= 0);
  if (net->m_id >= g_place_concreteNetsSize) {
    g_place_concreteNetsSize = (net->m_id > g_place_concreteNetsSize ? 
                               net->m_id : g_place_concreteNetsSize);
    g_place_concreteNetsSize *= 1.5;
    g_place_concreteNetsSize += 20;
    g_place_concreteNets = (ConcreteNet**)realloc(g_place_concreteNets, 
             sizeof(ConcreteNet*)*g_place_concreteNetsSize);
    assert(g_place_concreteNets);
  }
  if (net->m_id >= g_place_numNets) {
    memset(&(g_place_concreteNets[g_place_numNets]), 0,
            sizeof(ConcreteNet*)*(net->m_id+1-g_place_numNets));
    g_place_numNets = net->m_id+1;
    assert(g_place_numNets <= g_place_concreteNetsSize);
  }
  g_place_concreteNets[net->m_id] = net;
}

Here is the call graph for this function:

Here is the caller graph for this function:

cellSortByID()

int cellSortByID	(	const void *	a,
		const void *	b )

Definition at line 338 of file place_base.c.

                                               {
  const ConcreteCell *pa = *(const ConcreteCell **)a;
  const ConcreteCell *pb = *(const ConcreteCell **)b;
 
  if (!pa && !pb) return 0;
  else if (!pa) return -1;
  else if (!pb) return 1;
  if (pa->m_id < pb->m_id) return -1;
  if (pa->m_id > pb->m_id) return 1;
  return 0;
}

Here is the caller graph for this function:

cellSortByX()

int cellSortByX	(	const void *	a,
		const void *	b )

Sorts cells by either position coordinate.

These are for use with qsort().

Can tolerate pointers to NULL objects.

Definition at line 314 of file place_base.c.

                                              {
  const ConcreteCell *pa = *(const ConcreteCell **)a;
  const ConcreteCell *pb = *(const ConcreteCell **)b;
 
  if (!pa && !pb) return 0;
  else if (!pa) return -1;
  else if (!pb) return 1;
  if (pa->m_x < pb->m_x) return -1;
  if (pa->m_x > pb->m_x) return 1;
  return 0;
}

Here is the caller graph for this function:

cellSortByY()

int cellSortByY	(	const void *	a,
		const void *	b )

Definition at line 326 of file place_base.c.

                                              {
  const ConcreteCell *pa = *(const ConcreteCell **)a;
  const ConcreteCell *pb = *(const ConcreteCell **)b;
 
  if (!pa && !pb) return 0;
  else if (!pa) return -1;
  else if (!pb) return 1;
  if (pa->m_y < pb->m_y) return -1;
  if (pa->m_y > pb->m_y) return 1;
  return 0;
}

Here is the caller graph for this function:

delCellFromPartition()

void delCellFromPartition	(	ConcreteCell *	cell,
		Partition *	p )

Definition at line 180 of file place_base.c.

                                                            {
  int c;
  bool found = false;
 
  assert(cell);
  assert(p);
 
  for(c=0; c<p->m_numMembers; c++) 
    if (p->m_members[c] == cell) {
      p->m_members[c] = 0;
      p->m_area -= getCellArea(cell);
      found = true;
      break;
    }
     
  if (!found) return;
 
  if (!p->m_leaf) {
    delCellFromPartition(cell, p->m_sub1);
    delCellFromPartition(cell, p->m_sub2);
  }
}

Here is the call graph for this function:

Here is the caller graph for this function:

delConcreteCell()

void delConcreteCell

(

ConcreteCell *

cell

)

Removes a cell from the placement database.

Does not deallocate memory.

Important: does not modify nets that may point to this cell. If these are connections are not removed, segmentation faults and other nasty errors will occur.

Definition at line 216 of file place_base.c.

                                           {
  assert(cell);
  g_place_concreteCells[cell->m_id] = 0;
  while(!g_place_concreteCells[g_place_numCells-1]) g_place_numCells--;
 
  if (g_place_rootPartition) delCellFromPartition(cell, g_place_rootPartition);
}

Here is the call graph for this function:

delConcreteNet()

void delConcreteNet

(

ConcreteNet *

net

)

Does not deallocate memory.

Definition at line 141 of file place_base.c.

                                        {
  assert(net);
  g_place_concreteNets[net->m_id] = 0;
  while(!g_place_concreteNets[g_place_numNets-1]) g_place_numNets--;
}

getCellArea()

float getCellArea

(

const ConcreteCell *

cell

)

Definition at line 99 of file place_base.c.

                                            {
  assert(cell);
  return cell->m_parent->m_width*cell->m_parent->m_height;
}

Here is the caller graph for this function:

getNetBBox()

Rect getNetBBox

(

const ConcreteNet *

net

)

Returns the bounding box of a net.

Definition at line 45 of file place_base.c.

                                          {
  int t;
  Rect r;
 
  assert(net);
 
  r.x = r.y = INT_MAX;
  r.w = r.h = -INT_MAX;
  for(t=0; t<net->m_numTerms; t++) {
    r.x = net->m_terms[t]->m_x < r.x ? net->m_terms[t]->m_x : r.x;
    r.y = net->m_terms[t]->m_y < r.y ? net->m_terms[t]->m_y : r.y;
    r.w = net->m_terms[t]->m_x > r.w ? net->m_terms[t]->m_x : r.w;
    r.h = net->m_terms[t]->m_y > r.h ? net->m_terms[t]->m_y : r.h;
  }
  r.w -= r.x; r.h -= r.y;
  return r;
}

Here is the caller graph for this function:

getNetWirelength()

float getNetWirelength

(

const ConcreteNet *

net

)

Returns the half-perimeter wirelength of a net.

Definition at line 70 of file place_base.c.

                                               {
  Rect r;
 
  assert(net);
 
  r = getNetBBox(net);
  return r.w+r.h;
}

Here is the call graph for this function:

Here is the caller graph for this function:

getTotalWirelength()

float getTotalWirelength

(

)

Returns the total HPWL of all nets.

Definition at line 86 of file place_base.c.

                           {
  float r = 0;
  int n;
  for(n=0; n<g_place_numNets; n++) if (g_place_concreteNets[n])
    r += getNetWirelength(g_place_concreteNets[n]);
  return r;
}

Here is the call graph for this function:

Here is the caller graph for this function:

netSortByB()

int netSortByB	(	const void *	a,
		const void *	b )

Definition at line 263 of file place_base.c.

                                             {
  const ConcreteNet *pa = *(const ConcreteNet **)a;
  const ConcreteNet *pb = *(const ConcreteNet **)b;
  Rect ba, bb;
 
  if (!pa && !pb) return 0;
  else if (!pa) return -1;
  else if (!pb) return 1;
  ba = getNetBBox(pa), bb = getNetBBox(pb);
  if (ba.y + ba.h < bb.y + bb.h) return -1;
  if (ba.y + ba.h > bb.y + bb.h) return 1;
  return 0;
}

Here is the call graph for this function:

Here is the caller graph for this function:

netSortByID()

int netSortByID	(	const void *	a,
		const void *	b )

Definition at line 291 of file place_base.c.

                                              {
  const ConcreteNet *pa = *(const ConcreteNet **)a;
  const ConcreteNet *pb = *(const ConcreteNet **)b;
 
  if (!pa && !pb) return 0;
  else if (!pa) return -1;
  else if (!pb) return 1;
  if (pa->m_id < pb->m_id) return -1;
  if (pa->m_id > pb->m_id) return 1;
  return 0;
}

netSortByL()

int netSortByL	(	const void *	a,
		const void *	b )

Sorts nets by position of one of its corners.

These are for use with qsort().

Can tolerate pointers to NULL objects.

Definition at line 235 of file place_base.c.

                                             {
  const ConcreteNet *pa = *(const ConcreteNet **)a;
  const ConcreteNet *pb = *(const ConcreteNet **)b;
  Rect ba, bb;
 
  if (!pa && !pb) return 0;
  else if (!pa) return -1;
  else if (!pb) return 1;
  ba = getNetBBox(pa), bb = getNetBBox(pb);
  if (ba.x < bb.x) return -1;
  if (ba.x > bb.x) return 1;
  return 0;
}

Here is the call graph for this function:

Here is the caller graph for this function:

netSortByR()

int netSortByR	(	const void *	a,
		const void *	b )

Definition at line 249 of file place_base.c.

                                             {
  const ConcreteNet *pa = *(const ConcreteNet **)a;
  const ConcreteNet *pb = *(const ConcreteNet **)b;
  Rect ba, bb;
 
  if (!pa && !pb) return 0;
  else if (!pa) return -1;
  else if (!pb) return 1;
  ba = getNetBBox(pa), bb = getNetBBox(pb);
  if (ba.x + ba.w < bb.x + bb.w) return -1;
  if (ba.x + ba.w > bb.x + bb.w) return 1;
  return 0;
}

Here is the call graph for this function:

Here is the caller graph for this function:

netSortByT()

int netSortByT	(	const void *	a,
		const void *	b )

Definition at line 277 of file place_base.c.

                                             {
  const ConcreteNet *pa = *(const ConcreteNet **)a;
  const ConcreteNet *pb = *(const ConcreteNet **)b;
  Rect ba, bb;
 
  if (!pa && !pb) return 0;
  else if (!pa) return -1;
  else if (!pb) return 1;
  ba = getNetBBox(pa), bb = getNetBBox(pb);
  if (ba.y < bb.y) return -1;
  if (ba.y > bb.y) return 1;
  return 0;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Variable Documentation

g_place_concreteCells

ConcreteCell** g_place_concreteCells = NULL

Definition at line 33 of file place_base.c.

g_place_concreteCellsSize

int g_place_concreteCellsSize = 0

Definition at line 34 of file place_base.c.

g_place_concreteNets

ConcreteNet** g_place_concreteNets = NULL

Definition at line 35 of file place_base.c.

g_place_concreteNetsSize

int g_place_concreteNetsSize = 0

Definition at line 36 of file place_base.c.

g_place_coreBounds

Rect g_place_coreBounds

Definition at line 30 of file place_base.c.

g_place_numCells

ABC_NAMESPACE_IMPL_START int g_place_numCells = 0

Definition at line 26 of file place_base.c.

g_place_numNets

int g_place_numNets = 0

Definition at line 27 of file place_base.c.

g_place_padBounds

Rect g_place_padBounds

Definition at line 31 of file place_base.c.

g_place_rowHeight

float g_place_rowHeight = 1.0

Definition at line 28 of file place_base.c.