The present invention generally relates to hardware emulators, and more particularly to tracing memories in a hardware emulator.
Today's sophisticated SoC (System on Chip) designs are rapidly evolving and nearly doubling in size with each generation. Indeed, complex designs have nearly exceeded 50 million gates. This complexity, combined with the use of devices in industrial and mission-critical products, has made complete design verification an essential element in the semiconductor development cycle. Ultimately, this means that every chip designer, system integrator, and application software developer must focus on design verification.
Hardware emulation provides an effective way to increase verification productivity, speed up time-to-market, and deliver greater confidence in the final SoC product. Even though individual intellectual property blocks may be exhaustively verified, previously undetected problems appear when the blocks are integrated within the system. Comprehensive system-level verification, as provided by hardware emulation, tests overall system functionality, IP subsystem integrity, specification errors, block-to-block interfaces, boundary cases, and asynchronous clock domain crossings. Although design reuse, intellectual property, and high-performance tools all help by shortening SoC design time, they do not diminish the system verification bottleneck, which consumes 60-70% of the design cycle. As a result, designers can implement a number of system verification strategies in a complementary methodology including software simulation, simulation acceleration, hardware emulation, and rapid prototyping. But, for system-level verification, hardware emulation remains a favorable choice due to superior performance, visibility, flexibility, and accuracy.
A short history of hardware emulation is useful for understanding the emulation environment. Initially, software programs would read a circuit design file and simulate the electrical performance of the circuit very slowly. To speed up the process, special computers were designed to run simulators as fast as possible. IBM's Yorktown “simulator” was the earliest (1982) successful example of this—it used multiple processors running in parallel to run the simulation. Each processor was programmed to mimic a logical operation of the circuit for each cycle and may be reprogrammed in subsequent cycles to mimic a different logical operation. This hardware ‘simulator’ was faster than the current software simulators, but far slower than the end-product ICs. When Field Programmable Gate Arrays (FPGAs) became available in the mid-80's, circuit designers conceived of networking hundreds of FPGAs together in order to map their circuit design onto the FPGAs and the entire FPGA network would mimic, or emulate, the entire circuit. In the early 90's the term “emulation” was used to distinguish reprogrammable hardware that took the form of the design under test (DUT) versus a general purpose computer (or work station) running a software simulation program.
Soon, variations appeared. Custom FPGAs were designed for hardware emulation that included on-chip memory (for DUT memory as well as for debugging), special routing for outputting internal signals, and for efficient networking between logic elements. Another variation used custom IC chips with networked single bit processors (so-called processor based emulation) that processed in parallel and usually assumed a different logic function every cycle.
Physically, a hardware emulator resembles a large server. Racks of large printed circuit boards are connected by backplanes in ways that most facilitate a particular network configuration. A workstation connects to the hardware emulator for control, input, and output.
Before the emulator can emulate a DUT, the DUT design must be compiled. That is, the DUT's logic must be converted (synthesized) into code that can program the hardware emulator's logic elements (whether they be processors or FPGAs). Also, the DUT's interconnections must be synthesized into a suitable network that can be programmed into the hardware emulator. The compilation is highly emulator specific and can be time consuming.
Once the design is loaded and running in the hardware emulator, it is desirable to obtain trace data of the states of the various design state elements and/or other design elements and/or design signals. Such trace data, also known as user visibility data, is made available to the user and is often used to debug a design. Unfortunately, as the number of state elements increases, so to does the amount of trace data. For example, an FPGA emulating one hundred thousand state elements could generate up to one hundred thousand bits, or 0.1 Mb, of trace data per clock cycle. The elements that are traced can be divided into three main categories: flip-flops, glue logic, and RAM. Each of these categories has its own unique tracing problems, but all are limited by the size of a trace buffer into which data is stored. Because of the large amount of data needed to be captured over a large number of clock cycles, some elements are captured only at pre-determined intervals (e.g., every 1000 clock cycles) and if a user requests to view a particular interval, any uncaptured cycles can be simulated and regenerated in order to complete the entire trace period. For example, flip-flops may be captured once every 1000 cycles and that captured data may be used to simulate the other flip-flop states as well as the glue logic.
While such simulation works well with flip-flops and glue logic, memory must be captured every clock cycle. For example, a user wanting to view the contents of memory at a particular trace cycle cannot rely on simulation generated using a memory captured only once every 1000 cycles. If the memory contents change every cycle, such changes will be lost and unrecoverable. Another difficult issue with memory is the manner of tracing used. During emulation, the memory is constantly accessed. In order to view the memory, it is not possible to switch off the memory or the emulator and download the memory contents. Thus, current systems monitor the memory ports in order to trace changes that occurred in the memory, similar to shadow memories known in the art. Knowledge of the original contents of memory and how it changed can be used to accurately recreate the memory contents.
A problem with tracing read ports is that every user cycle, memory data continuously accumulates until a cross-over point where the data captured to duplicate the memory exceeds the memory size itself. Continued tracing beyond the cross-over point means that it would have been more efficient to have a duplicate memory. Additionally, as user designs continue to become larger and more complex, the memory size is increasing, requiring the trace buffer to monitor more memory ports. With this trend continuing, it is desirable to re-think how memory can be more efficiently traced without over-burdening the trace system.
A system and method are disclosed to trace memory in a hardware emulator.
In one aspect, a first Random Access Memory is used to store data associated with a user design during emulation. At any desired point in time, the contents of the first Random Access Memory are captured in a second Random Access Memory. After the capturing, the contents of the second Random Access Memory are copied to another location. During the copying, the user design may modify the data in the first Random Access Memory while the captured contents within the second Random Access Memory remain unmodifiable so that the captured contents are not compromised.
In another aspect, different size memories within the emulator are used to emulate the user model. Larger memories have their ports monitored to reconstruct the contents of the memories, while smaller memories are captured in a snapshot RAM. Together the two different modes of tracing memory are used to provide visibility to the user of the entire user memory.
These features and others of the described embodiments will be more readily apparent from the following detailed description, which proceeds with reference to the accompanying drawings.
The emulator 12 includes multiple printed circuit boards 16 coupled to a midplane 18. The midplane 18 allows physical connection of the printed circuit boards into the emulator 12 on both sides of the midplane. A backplane may also be used in place of the midplane, the backplane allowing connection of printed circuit boards on one side of the backplane. Any desired type of printed circuit boards may be used. For example, programmable boards 20 generally include an array of FPGAs, or other programmable circuitry, that may be programmed with the user's design downloaded from the emulator host 14. One or more I/O boards 22 allow communication between the emulator 12 and hardware external to the emulator. For example, the user may have a preexisting processor board that is used in conjunction with the emulator and such a processor board connects to the emulator through I/O board 22. Clock board 24 generates any number of desired clock signals. And interconnect boards 26 allow integrated circuits on the programmable boards 20 to communicate together and with integrated circuits on the I/O boards 22.
The RAM 66 in
Having illustrated and described the principles of the illustrated embodiments, it will be apparent to those skilled in the art that the embodiments can be modified in arrangement and detail without departing from such principles.
Although two embodiments are shown to transfer data from the user model portion of RAM to the snapshot RAM, there are numerous techniques for making such a transfer as well understood in the art, and any other technique may easily be substituted to perform such a transfer.
In view of the many possible embodiments, it will be recognized that the illustrated embodiments include only examples of the invention and should not be taken as a limitation on the scope of the invention. Rather, the invention is defined by the following claims. We therefore claim as the invention all such embodiments that come within the scope of these claims.
This is a 35 U.S.C. §371 U.S. National Stage of International Application No. PCT/EP2007/051644, filed Feb. 21, 2007, which was published in English under PCT Article 21(2), which in turn claims the benefit of U.S. Provisional Application No. 60/775,494, filed Feb. 21, 2006. Both applications are incorporated herein in their entirety. This application claims priority to U.S. provisional application 60/775,494 dated Feb. 21, 2006, entitled “Memory Snapshot in an Emulation Environment”, the contents of which are hereby incorporated by reference.
Filing Document | Filing Date | Country | Kind | 371c Date |
---|---|---|---|---|
PCT/EP2007/051644 | 2/21/2007 | WO | 00 | 5/20/2008 |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO2007/096372 | 8/30/2007 | WO | A |
Number | Name | Date | Kind |
---|---|---|---|
4636945 | Tanagawa et al. | Jan 1987 | A |
4674089 | Poret et al. | Jun 1987 | A |
4879646 | Iwasaki et al. | Nov 1989 | A |
4954942 | Masuda et al. | Sep 1990 | A |
5036473 | Butts et al. | Jul 1991 | A |
5109353 | Sample et al. | Apr 1992 | A |
5321828 | Phillips et al. | Jun 1994 | A |
5345580 | Tamaru et al. | Sep 1994 | A |
5444859 | Baker et al. | Aug 1995 | A |
5560036 | Yoshida | Sep 1996 | A |
5564041 | Matsui et al. | Oct 1996 | A |
5608867 | Ishihara | Mar 1997 | A |
5754827 | Barbier et al. | May 1998 | A |
6041406 | Mann | Mar 2000 | A |
6061511 | Marantz et al. | May 2000 | A |
6243836 | Whalen | Jun 2001 | B1 |
6314530 | Mann | Nov 2001 | B1 |
6549959 | Yates et al. | Apr 2003 | B1 |
6721922 | Walters et al. | Apr 2004 | B1 |
7826282 | Schmitt | Nov 2010 | B2 |
20010054175 | Watanabe | Dec 2001 | A1 |
20020162055 | Kurooka | Oct 2002 | A1 |
20040015885 | Akatsuka | Jan 2004 | A1 |
20040148153 | Beletsky et al. | Jul 2004 | A1 |
20050102572 | Oberlaender | May 2005 | A1 |
20080288719 | Schmitt et al. | Nov 2008 | A1 |
20080301360 | Schmitt | Dec 2008 | A1 |
Number | Date | Country |
---|---|---|
1 450 278 | Aug 2004 | EP |
1450278 | Aug 2004 | EP |
09 252309 | Sep 1997 | JP |
Number | Date | Country | |
---|---|---|---|
20080288719 A1 | Nov 2008 | US |
Number | Date | Country | |
---|---|---|---|
60775494 | Feb 2006 | US |