Cadence® system design and verification solutions, integrated under our System Development Suite, provide the simulation, acceleration, emulation, and management capabilities.
System Development Suite Related Products A-Z
Cadence® digital design and signoff solutions provide a fast path to design closure and better predictability, helping you meet your power, performance, and area (PPA) targets.
Full-Flow Digital Solution Related Products A-Z
Cadence® custom, analog, and RF design solutions can help you save time by automating many routine tasks, from block-level and mixed-signal simulation to routing and library characterization.
Overview Related Products A-Z
Driving efficiency and accuracy in advanced packaging, system planning, and multi-fabric interoperability, Cadence® package implementation products deliver the automation and accuracy.
Cadence® PCB design solutions enable shorter, more predictable design cycles with greater integration of component design and system-level simulation for a constraint-driven flow.
An open IP platform for you to customize your app-driven SoC design.
Comprehensive solutions and methodologies.
Helping you meet your broader business goals.
A global customer support infrastructure with around-the-clock help.
24/7 Support - Cadence Online Support
Locate the latest software updates, service request, technical documentation, solutions and more in your personalized environment.
Cadence offers various software services for download. This page describes our offerings, including the Allegro FREE Physical Viewer.
Get the most out of your investment in Cadence technologies through a wide range of training offerings.
This course combines our Allegro PCB Editor Basic Techniques, followed by Allegro PCB Editor Intermediate Techniques.
Virtuoso Analog Design Environment Verifier 16.7
Learn learn to perform requirements-driven analog verification using the Virtuoso ADE Verifier tool.
Exchange ideas, news, technical information, and best practices.
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.
It's not all about the technlogy. Here we exchange ideas on the Cadence Academic Network and other subjects of general interest.
Cadence is a leading provider of system design tools, software, IP, and services.
I am a new Skill User, iam trying to write a code for extracting a net from one cellview and put it into a different cellview (only the extracted net). i have read some previous threads but most of them were pointed to VXL. i do not have a VXL licence. so can anyone hint me how to extract a net using skill in VLE.
In IC614 there's a new function to save the result of the "Mark Net" command to another cellView - leHiSaveAllHighLightMarkNet(). Unfortunately it doesn't really support a procedural approach to being called - it's just a UI function. However, with a bit of work, it can be made to respond to a procedural approach.
In order to mark the net you want, if you know the coordinates of somewhere on the net, simply do:
And then to save the result to a cellView, you can use CCSsaveMarkNet() as defined below:
procedure(CCSsaveMarkNetCB(lib cell view)
; Form done needs to be done via a timer, otherwise the form
; gets stuck
hiRegTimer(sprintf(nil "hiFormDone(%s)" form->hiFormSym) 1)
procedure(CCSsaveMarkNet(lib cell view @optional (wid hiGetCurrentWindow()) "tttw")
; Delete the previous cellView to stop being prompted for overwrite
ddId=ddGetObj(lib cell view)
; Fill in the form, via a timer - so is filled in after the save
; form is launched
hiRegTimer(sprintf(nil "CCSsaveMarkNetCB(%L %L %L)" lib cell view) 0)
All this can be done with VLS "L" licenses (no XL needed). You do need to ensure that you don't have a via (in the validVias constraint) which connects down to your diffusion layer, because otherwise connections will be made under the gate of transistors by mark net.
If you're using earlier versions, you'll need to write a shape tracer, which is quite a lot of work...
If DIVA works then ivExtract would work for this. It saves the extracted data in a view extract. Try it.
In reply to Andrew Beckett:
BTW, I filed an enhancement CCR number 740427 for a proper API for Mark Net.
Thanks for the reply. Unfortunately, iam Using an IC613 so i haven't got the idea of the function leHiSaveAllHighLightMarknet() and its features.
i'll give a brief explanation of what iam trying to do
1) Iam selecting a net in my top level (ex: vdd) by using xx = setof(x cvid~>shapes x~>net~>name == "vdd")
2) now i need to traverse in to and out of the hierarchy to select the connectivity of vdd in my instances.
3) once the net is traced i could use a dbCopyFig() function to copy the traced net.
the problem is that i could not find any functions that could help me trace a net hierarchically.
This code could be very helpful for me to find the shorts quickly. can u please guide me how i can do this
In reply to posh:
One thing I don't understand - if you are using the base layout editor (not XL), how has the design got connectivity information present? Normally it's only XL (and GXL) which would add connectivity into the database?
Also, it should be straightforward to move from IC613 to IC614 - it's just an update release (no license changes needed), so that might be your simplest option.
You can select the shapes in the lower level cells by following the instTerms. There's some relevant posts on this before. For example Read and follow nets.Try searching a bit in the forums. I recall answering something similar elsewhere recently - it may have been here, or maybe on comp.cad.cadence (can't quite remember).
i have now got an XL version which made my life easier. But my question was is there a way to extract connectivity information in VLE like in some previous post i read about dbGetTrueOverlaps() could do the trick, but was not able to find a way how this could do. if possible for u can u give me a hint of how actually it could be done.
I know the code would include a lot of work, but can u help me in finding a way to do it.
Check out this post if you haven't already.
I will add to what Derek and Andrew have said by providing an outline of how I would approach this in SKILL code:
The above is just an outline for finding the "connected" shapes in a similar fashion to the Mark Net feature. You may wish to add highlights to show what is being processed. The decision of whether something is connected will depend on the layers used, you may wish to use information from the Technology File (IC5141) or the viaDefs (IC61x) similar to how Mark Net works.
I hope that this information is helpful to you.
In reply to skillUser:
Step #5 needs to be expanded, or else you can get incorrect results. If you have several L shaped polygons or paths, the bounding box of those shapes could overlap shapes which are not connected. You actually have to break all shapes into rectangles and then do the overlap check on each rectangle. This part is not trivial for polygons, although, as discussed in the linked post, dbLayerTile could help with this.
In reply to dmay:
Yes, thank you Derek - I did read through the linked post but I forgot to mention about fracturing any input polygons in my post above. The suggested algorithm is one from my head and not proven by any actual coding! dbGetOverlaps can indeed produce overlaps where the bounding boxes of shapes overlap but the actual shapes do not - dbGetTrueOverlaps might help but it might also be too much of an overhead (it will be slower since it is a less simplistic function).
Harish, do pay attention to Derek's comments since he has written functional code on this topic and I have not.
But there is so much more you can do when you actually get the objects on the hilighted net. We have dozens of functions that take advantage of the extracted net.
This was one of the most useful tools we ever wrote. We waited until Mark Net was released, discovered that the first release was buggy and wrote our own. By the time Mark Net was fixed, we had something better.
Thanks Derek, Lawrence and Andrew
You guys are just unbelievable, I thought being a new skill user, i may never be able to write this code, but the amount of information and advices u give are simply outstandung. this gave me a lot of confidence.
i have just started the code, and i shall fall back to u guys if i find any difiiculties.
once again Thankyou verymuch
Thank you very much for the outline. i have worked according to your outline with the following functions but held up at recursion,
1) I selected an object from the layout by using obj=car(selectedSet())
2) then i have done an overlap function for this by using list1 = dbGetTrueOverlaps(cv obj~>bBox list("m1" "drawing"))
3) similar to step 2 i have done all the overlaps for m2 m3 and poly. Here i have got a problem that if i use a search level 0:4, the vias in the layout are also selected and when iam using a dbCopyFig() function it says that the vias are not dbObjects. can u help me why it not copying vias.
4) At this point i have list4 whish contains all the dbobjects which overlap with my selected objects.
5) Now if i want to know what objects are overlapping these list of objects, i'll be using a foreach , do u think we can do this in different way.
please do comment or advise on these steps
Seeing your code would probably have helped, but my guess is that you're not understanding the output of dbGetTrueOverlaps. If it's a top level (level 0) shape, you get it directly, but if down in the hierarchy (e.g. inside a via or an instance of some sort), you'll get a set of instance (or via) dbobjects prior to the actual object, which are giving you the hierarchical path down to that shape. You can't pass this directly to dbCopyFig - instead you need to compute the appropriate transform and then copy the figure itself. I've usually used functions like this:
* (abGetOverlapTransform overlap) *
* Get the transform needed to transform the shape in the overlap *
* into the current cell's coordinate system *
(procedure (abGetOverlapTransform overlap)
(if (listp overlap)
(setq transform (dbConcatTransform
(abGetOverlapTransform (cadr overlap))
(dbGetq (car overlap) transform)
(list (dbGetq (car overlap) origin)
(dbGetq (car overlap) orient)
(setq transform (list 0:0 "R0" 1.0)))
* (abGetOverlapShape overlap) *
* get hold of the actual shape in the overlap *
(procedure (abGetOverlapShape overlap)
(if (listp overlap)
(abGetOverlapShape (cadr overlap))
to compute the transform and find the shape, and then call:
(dbCopyFig (abGetOverlapShape overlap) cellView (abGetOverlapTransform overlap))
But you could also use geGetInstTransform() to find the transform from the overlap. In these examples, overlap is one of the items in the list of results from dbGetTrueOverlaps().
Essentially at step 5 in your list, you are calling your function again - tracing the shapes from that. You need to keep track of shapes you've already seen, to avoid visiting them over and over again...
Sorry, don't have time to go into more details.