VLSI Project. More...

#include <files.h>

Inheritance diagram for RProject:
[legend]
Collaboration diagram for RProject:
[legend]

Public Member Functions

 RProject (const R::RURI &uri)
 
void Analyse (void)
 
virtual ~RProject (void)
 
- Public Member Functions inherited from RStructure
 RStructure (void)
 
RCellCreateCell (const R::RString &name, RLibrary *lib)
 
RCellGetCell (const R::RString &name)
 
RLibraryGetLibrary (const R::RString &name)
 
 ~RStructure (void)
 

Private Attributes

R::RURI URI
 
R::RURI PL2D
 
R::RURI LogName
 
- Private Attributes inherited from iRContainer< C >
C ** Tab
 
size_t NbPtr
 
size_t MaxPtr
 
size_t LastPtr
 
size_t IncPtr
 

Additional Inherited Members

- Protected Attributes inherited from RStructure
R::RContainer< RLibrary, true,
true > 
Libraries
 
R::RContainer< RCell, true, true > Cells
 
R::tCoord Units
 
- Private Member Functions inherited from RContainer< RDataFile, true, true >
 RContainer (size_t m, size_t i=0)
 
 RContainer (const RContainer< RDataFile, true, true > &src)
 
 RContainer (const RContainer< RDataFile, false, true > &src)
 
int Compare (const RContainer< RDataFile, true, true > &) const
 
size_t GetNb (void) const
 
size_t GetMaxPos (void) const
 
size_t GetMaxNb (void) const
 
size_t GetIncNb (void) const
 
bool VerifyIndex (size_t idx) const
 
void VerifyTab (size_t max=0)
 
void Clear (size_t m=0, size_t i=0, bool force=false)
 
void ReOrder (int sortOrder(const void *, const void *), size_t min, size_t max)
 
void ReOrder (int sortOrder(const void *, const void *))
 
void ReOrder (void)
 
void Exchange (size_t pos1, size_t pos2)
 
void Shift (size_t idx, bool reverse)
 
void Transfer (RContainer< RDataFile, a, o > &src)
 
RContaineroperator= (const RContainer< RDataFile, true, true > &src)
 
RContaineroperator= (const RContainer< RDataFile, false, true > &src)
 
void Copy (const RContainer< RDataFile, a, true > &src)
 
RContaineroperator+= (const RContainer< RDataFile, a, o > &src)
 
size_t GetIndex (const TUse &tag, bool &find, size_t min=0, size_t max=0) const
 
bool IsIn (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) const
 
bool IsIn (const TUse &tag, size_t min=0, size_t max=0) const
 
const RDataFile * operator[] (size_t idx) const
 
RDataFile * operator[] (size_t idx)
 
const RDataFile * GetPtrAt (size_t idx) const
 
RDataFile * GetPtrAt (size_t idx)
 
RDataFile * GetPtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) const
 
RDataFile * GetPtr (const TUse &tag, size_t min=0, size_t max=0) const
 
RDataFile * GetInsertPtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0)
 
RDataFile * GetInsertPtr (const TUse &tag, size_t min=0, size_t max=0)
 
RDataFile * GetInsertPtrAt (const TUse &tag, size_t pos)
 
RContainer< RDataFile, false,
true > * 
GetPtrs (const TUse &tag, size_t min=0, size_t max=0) const
 
size_t GetTab (const void **tab, size_t min=0, size_t max=0) const
 
size_t GetTab (void **tab, size_t min=0, size_t max=0)
 
size_t GetTab (const RDataFile **tab, size_t min=0, size_t max=0) const
 
size_t GetTab (RDataFile **tab, size_t min=0, size_t max=0)
 
void InsertPtrAt (RDataFile *ins, size_t pos, bool del)
 
void InsertPtrAt (RDataFile *ins, size_t pos)
 
void InsertPtr (RDataFile *ins, bool del=false, size_t min=0, size_t max=0)
 
void DeletePtrAt (size_t pos, bool shift, bool del)
 
void DeletePtrAt (size_t pos, bool shift)
 
void DeletePtrAt (size_t pos)
 
void DeletePtr (const TUse &tag, bool sortkey, bool del, size_t min=0, size_t max=0)
 
void DeletePtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0)
 
void DeletePtr (const TUse &tag, size_t min=0, size_t max=0)
 
void Inter (const iRContainer< RDataFile > &src1, const iRContainer< RDataFile > &src2)
 
void Union (const iRContainer< RDataFile > &src1, const iRContainer< RDataFile > &src2)
 
virtual ~RContainer (void)
 
- Private Member Functions inherited from iRContainer< C >
size_t GetNb (void) const
 
size_t GetMaxPos (void) const
 
size_t GetMaxNb (void) const
 
size_t GetIncNb (void) const
 
bool VerifyIndex (size_t idx) const
 
void VerifyTab (size_t max=0)
 
void Clear (size_t m=0, size_t i=0, bool force=false)
 
void ReOrder (int sortOrder(const void *, const void *), size_t min, size_t max)
 
void ReOrder (int sortOrder(const void *, const void *))
 
void ReOrder (void)
 
void Exchange (size_t pos1, size_t pos2)
 
void Shift (size_t idx, bool reverse)
 
void Transfer (iRContainer< C > &src)
 
iRContaineroperator= (const iRContainer< C > &src)
 
void Copy (const iRContainer< C > &src)
 
iRContaineroperator+= (const iRContainer< C > &src)
 
size_t GetIndex (bool order, const TUse &tag, bool &find, size_t min=0, size_t max=0) const
 
size_t GetIndex (const TUse &tag, bool &find, size_t min=0, size_t max=0) const
 
bool IsIn (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) const
 
bool IsIn (const TUse &tag, size_t min=0, size_t max=0) const
 
const C * operator[] (size_t idx) const
 
C * operator[] (size_t idx)
 
const C * GetPtrAt (size_t idx) const
 
C * GetPtrAt (size_t idx)
 
C * GetPtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) const
 
C * GetPtr (const TUse &tag, size_t min=0, size_t max=0) const
 
C * GetInsertPtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0)
 
C * GetInsertPtr (const TUse &tag, size_t min=0, size_t max=0)
 
C * GetInsertPtrAt (const TUse &tag, size_t pos)
 
size_t GetTab (const void **tab, size_t min=0, size_t max=0) const
 
size_t GetTab (void **tab, size_t min=0, size_t max=0)
 
size_t GetTab (const C **tab, size_t min=0, size_t max=0) const
 
size_t GetTab (C **tab, size_t min=0, size_t max=0)
 
void InsertPtrAt (C *ins, size_t pos, bool del)
 
void InsertPtrAt (C *ins, size_t pos)
 
void InsertPtr (C *ins, bool del=false, size_t min=0, size_t max=0)
 
void DeletePtrAt (size_t pos, bool shift, bool del)
 
void DeletePtrAt (size_t pos, bool shift)
 
void DeletePtrAt (size_t pos)
 
void DeletePtr (const TUse &tag, bool sortkey, bool del, size_t min=0, size_t max=0)
 
void DeletePtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0)
 
void DeletePtr (const TUse &tag, size_t min=0, size_t max=0)
 
void Inter (const iRContainer< C > &src1, const iRContainer< C > &src2)
 
void Union (const iRContainer< C > &src1, const iRContainer< C > &src2)
 
virtual ~iRContainer (void)
 
void Create (const iRContainer< C > &src)
 
iRContainerNormalCopy (const iRContainer< C > &src)
 
void DeepCopy (const iRContainer< C > &src)
 
iRContainerAdd (const iRContainer< C > &src)
 
- Static Private Member Functions inherited from RContainer< RDataFile, true, true >
static int SortOrder (const void *a, const void *b)
 
- Static Private Member Functions inherited from iRContainer< C >
static int SortOrder (const void *a, const void *b)
 

Detailed Description

VLSI Project.

The RProject provides a representation of a VLSI project, i.e. a VLSI structure and a set of data files.

Constructor & Destructor Documentation

RProject ( const R::RURI uri)

Create a project.

Parameters
uriURI of the project.
virtual ~RProject ( void  )
virtual

Destruct the project.

Returns

Member Function Documentation

void Analyse ( void  )

Analyze the project.

Member Data Documentation

R::RURI URI
private

Name of the project.

R::RURI PL2D
private

URI of the pl2d file to generate.

R::RURI LogName
private

URI of the log file.