file: main.h


// includes 
#include <iostream.h>
#include <fstream.h>
#include "wishGui.hxx"
#include "MetisIntfc.hxx"
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include "placer.hxx"

//comparision operators
#define min(a,b) (a < b ? a : b)
#define max(a,b) (a > b ? a : b)

// width of the squares on the chip
// just for drawing on GUI
#define SQUARE 40

//solution accuracy for quadratic solution
#define SOLVE_ACCURACY 0.01

// type of node
#define GATE 1
#define PIN 2

// partition balancing techniques
// FIRST :    move the first gate I find
#define FIRST 1
// LAST :    move the last gate I find
#define LAST 2
// CONSTRAINED : move gate with least connectivity and no pads
#define CONSTRAINED 3
// LEASTLEN : move the gate with the least total netlength
//            of nets connected to it
#define LEASTLEN 4
// MOSTLEN :  move the gate with the greatest total netlength
//            of nets connected to it
#define MOSTLEN 5
// CONSTR_OPT : hybrid of 5 and 3
#define CONSTR_OPT 6

//initializing scheme
//put all the gates into location (1,1)
#define START 1
//put all gates into (ChipX,ChipY)
#define END 2
//distribute gates iteratively into all positions
#define DISTRIBUTE 3  
//put all gates into centre of chip
#define CENTER 4

//optimization schemes
//minimize congestion
#define MIN_CONGESTION 1
//minimize length
#define MIN_WIRELENGTH 2
//minimize delay
#define MIN_DELAY 3

//netweight definition
//unconstrained
#define UNCONSTR 1
//constrained 
#define CONSTR 2
//anything else is taken as constant

//k-way definitions
//anything other than these is asking for trouble
#define DUAL 2
#define QUAD 4



Back to Source File Index


C++ to HTML Conversion by ctoohtml