• Skip to main content
  • Skip to search
  • Skip to footer
Cadence Home
  • This search text may be transcribed, used, stored, or accessed by our third-party service providers per our Cookie Policy and Privacy Policy.

  1. Community Forums
  2. Custom IC SKILL
  3. Search,select and then make cell?

Stats

  • Locked Locked
  • Replies 7
  • Subscribers 143
  • Views 3752
  • Members are here 0
This discussion has been locked.
You can no longer post new replies to this discussion. If you have a question you can start a new discussion

Search,select and then make cell?

jazzmatazz
jazzmatazz over 13 years ago
Hello guys ,

Here is my problem. I wanna  to do hierarchically search for cell with certain criterias then to select it/ 'em and to make new cell only with this cell/s ,but I know only how to achieve the first step. I use procedural function for hierarchically search

   leSearchHierarchy( cv,bbox ... etc. )

Which returned me a list of all objects that meet the object type and search criteria. That's OK but  then I don't  know how to use this answer and to make new cell with this objects?

Regards,
Jazzmatazz  

 
  • Cancel
Parents
  • Andrew Beckett
    Andrew Beckett over 13 years ago

    wanted=setof(instPath dbInstQuery(cv cv~>bBox 0 32) if(listp(instPath) car(last(instPath)) instPath)~>cellName=="probe")
    newCv=dbOpenCellViewByType("newLib" "newCell" "layout" "maskLayout" "w")
    foreach(instPath wanted dbCopyFig(if(listp(instPath) car(last(instPath)) instPath) newCv dbGetHierPathTransform(instPath)))
    dbSave(newCv)
    dbClose(newCv)

    Sorry it's not prettily formatted - this was just from something I typed into the CIW to test that it worked OK...

    You should be able to wrap that up in a procedure to give you what you want. It might not be the most efficient in a really large design because it is returning every instance in the design hierarchy prior to filtering with setof, but hopefully it's OK. The alternative algorithm to compare against would be to do a recursive traversal of the hierarchy, and then only deal with the matches (the potentially expensive part in the above approach is actually returning the path lists for each occurrence, when most may get thrown away).

    Andrew.

    • Cancel
    • Vote Up 0 Vote Down
    • Cancel
Reply
  • Andrew Beckett
    Andrew Beckett over 13 years ago

    wanted=setof(instPath dbInstQuery(cv cv~>bBox 0 32) if(listp(instPath) car(last(instPath)) instPath)~>cellName=="probe")
    newCv=dbOpenCellViewByType("newLib" "newCell" "layout" "maskLayout" "w")
    foreach(instPath wanted dbCopyFig(if(listp(instPath) car(last(instPath)) instPath) newCv dbGetHierPathTransform(instPath)))
    dbSave(newCv)
    dbClose(newCv)

    Sorry it's not prettily formatted - this was just from something I typed into the CIW to test that it worked OK...

    You should be able to wrap that up in a procedure to give you what you want. It might not be the most efficient in a really large design because it is returning every instance in the design hierarchy prior to filtering with setof, but hopefully it's OK. The alternative algorithm to compare against would be to do a recursive traversal of the hierarchy, and then only deal with the matches (the potentially expensive part in the above approach is actually returning the path lists for each occurrence, when most may get thrown away).

    Andrew.

    • Cancel
    • Vote Up 0 Vote Down
    • Cancel
Children
No Data

Community Guidelines

The Cadence Design Communities support Cadence users and technologists interacting to exchange ideas, news, technical information, and best practices to solve problems and get the most from Cadence technology. The community is open to everyone, and to provide the most value, we require participants to follow our Community Guidelines that facilitate a quality exchange of ideas and information. By accessing, contributing, using or downloading any materials from the site, you agree to be bound by the full Community Guidelines.

© 2025 Cadence Design Systems, Inc. All Rights Reserved.

  • Terms of Use
  • Privacy
  • Cookie Policy
  • US Trademarks
  • Do Not Sell or Share My Personal Information