Gate addressing system for logic simulation machine

Abstract: A gate addressing system of a logic simulation machine performs translation from data of a circuit design data base (21) to circuit data for the logic simulation machine (24).The system numbers each input terminal of a circuit and each gate of said circuit without using numbers corresponding to the number of fanout gates minus one to which an output signal of an input terminal or a gate is applied between the numbers of one input terminal and another input terminal, one input terminal and one gate, one gate and another gate or one gate and one input terminal. It starts a list of numbers of fanout gates of each input terminal or each gate at an address as the number assigned to said input terminal and gate in a table representing connection relationships among input terminals and gates and among gates.

Description: Background of the Invention Field of the Invention The present invention relates to a logic simulation machine for carrying out a test program for a logic device and, more particularly, to a high speed gate addressing system of a logic simulation machine for generating circuit data for simulation by reading at a high speed circuit model data for the logic simulation machine from a data base on a module-by-module basis and generating intermodule connection data. Recent logic devices use many VLSIs. Thus, a single design deficiency in a logic device will greatly delay its development and increase its development cost. Therefore, the design of a logic device must be fully verified before it is manufactured. To this end, a designer uses a logic simulator to carry out a test program and the correctness of his design is confirmed when a comparison between results of the simulation and expected values indicates equality. However, recent devices may have several millions of gates and a clock rate as high as 1 GHz. It has been reported that the execution of the test program, which operates on an actual unit for only one minute, using a simulator as software on a large computer requires a period as long as 190 years. This is one billion times slower than the actual unit. For this reason, a logic simulation machine was invented which is about 10,000 times faster than the conventional simulator described above. With this machine, the test program can be executed in about one week, thus considerably decreasing the verification time after a logic design has been completed to some extent. To carry out the test program by the logic simulation machine, it is required to convert a data base for design to a circuit data base for a machine. Heretofore, circuit data for a machine has been expanded to a flat (not hierarchical) form of element levels. The data is represented by types of elements and connection relationships among elements. The elements are generally gates and the types of elements represent AND, NOR, etc. The connection relationship represents, as a minimum, an element (and its input pin) connected to the output pin of a certain element. The connection relationship is represented by numbers which are uniquely assigned to elements and pins. For example, the connection relationship in a circuit such as that shown in Figure 23 is conventionally given as follows. First, unique numbers are assigned to gates, as shown in Figure 24. The input pins of gates are consecutively numbered, starting with 0, from the top. The connection relationships form a table which provides information on to which gates and to what numbered pin of these gates the output of a certain other gate is to be connected. For example, the output of the tenth gate is connected to the second pin of the thirteenth gate and the second pin of the sixteenth gate. The method of storing this information in the table will be explained with reference to Figures 25 through 28. In Figures 25, through 28, the first column ADR represents row numbers (addresses) of the table. Thus, the ADR does not represent information to be written into the table. The second column to the fifth column represent the actual contents of the table. The second column END indicates the end of the list of connection information (the list ends at 1). The third column PTR represents whether data in each row represents an actual gate number (PTR = 0) or a pointer to the list in which gate numbers are written (PTR = 1). The fourth column GATE represents a gate number when PTR = 0 and points to a row number (or address) (address ADR) in the same table when PTR = 1. The fifth column INO represents an input pin number when PTR = 0 and has no meaning when PTR = 1. To determine to which gate and to which of its inputs (plus) the output of the tenth gate is connected, the address 10 of the table is referred to. The address 10 indicates PTR = 1 and points to the list starting with address 110. The list starting with the address 110 has two rows. This can be seen from that END = 1 in address 111. Since PTR=0, gate numbers are written in these two rows. Thus, it will be appreciated that the output of the gate 10 is connected to the pin 2 of the gate 13 and the pin 2 of the gate 16. These gates, connected to the output pin of the gate 10, are called fanout gates. In general, it is said that the average number of fanout gates for one gate is three. Figure 29 is a block diagram of hardware for reading numbers of fanout gates from the conventional table with a data structure described in conjunction with Figures 25 through 28. This hardware comprises a memory (FAN) 1 for storing the data END, PTR, GATE and INO described in conjunction with Figures 25 to 28, an address register (FADR) 2 for designating an address for reading a fanout gate number from the memory 1, a multiplexer 3 and an OR circuit. When the data END or PTR in the memory 1 is 1, the output of the OR circuit 4 is 1, in which case data from the multiplexer 3 is loaded into the address register 2. When either the END or PTR are both 0 and the output of OR circuit 4 is 0, however, the contents of the address register 2 are advanced. When PTR = 1, the GATE in the memory 1 indicates a pointer value which is stored in the address register 2 via the multiplexer 3. When PTR = 0 and END = 1, the externally applied next gate number is entered into the address register 2 via the multiplexer 3. When END = 1, a next signal is applied to the outside, which makes effective the externally applied next-gate number signal. This hardware is also used as the basis of an embodiment of the present invention and thus its operation will be described in detail below. With the conventional compile method, it is necessary to assign up to one million unique gate numbers to gates when the number of the gates is one million, and to represent connection relationships among about three million fan-out gates of the one million gates using those gate numbers. This process is called compilation. For compilation of one million gates a CPU time as long as several hours is needed, even with a large computer. Although the ratio of the CPU time of a large computer to the actual processing time depends on the number of jobs which run in parallel, the actual processing time is three or more times slower. Thus, the compilation will need substantially a full day. If the run time of the logic simulation machine is one week, the compile time is not a serious problem. When an error (disagreement between the result at a checkpoint of simulation and the expected value) is detected in the simulation machine, the continuation of the simulation is meaningless so long as a design deficiency that causes the error is not removed. The occurrence of many errors is inevitable in the initial stage of design in particular. Thus, the compile time becomes predominant, in which case the logic simulation machine cannot fully show its power. The technical problems with the conventional data structure or gate addressing method are summarized as follows. A first problem is that, even if the same partial circuit is used in plural locations, this fact is not utilized. Actually, the circuit of Figure 24 makes repeated use of a partial circuit (macro) of the same structure. A circuit comprising gates numbered 10 to 17 and input pins numbered 1 to 3 corresponds to this macro. Besides this macro, there are four identical macros in the circuit diagram (for example, a circuit comprised of gates 20 to 27 and input pins 4, 5 and 6 and a circuit comprised of gates 40 to 47 and input pins thereto which are shown unnumbered and connected to the output pins of the gates 60, 61 and 62). Such information is not utilized. A second problem is that, with the data structure of the conventional table described in conjunction with Figures 25 to 28, addresses corresponding in number to (1 + F) x the number of gates are required, F representing the average number (about three) of fan-outs of a gate. This increases the size of the table. For example, in Figures 25 to 28, data of ADR = 1 is the pointer to the starting address 101 of the list of fan-out gates. By referring to the list in the addresses 101 to 103 it becomes possible to know the fan-outs of the gate numbered 1. That is, there are four (i.e. H3) table addresses for the gate numbered 1. A third problem, which is similar to the second problem, is that the connection information on a certain partial circuit cannot be expanded on a memory to make repeated use of it for other partial circuits of the same structure. The Article by Y. Kazama et al. published in the Proceedings 1988 of the 25 th ACM/IEEE Design Automation Conference, June 12-15, 1988, Anaheim Convention Center, discloses a very large-scale logic simulation engine. A vectorized event-driven simulator can handle simultaneously both gate-level logic and register-transfer level structure. Summary of the Invention It is an object of the present invention to generate circuit data for a logic simulation machine by reading circuit data from a data base at high speed on a module-by-module basis and thereby generate inter-module connection data by the use of a new data structure for decreasing a compile time. The invention concerns a gate addressing system according to claim 1. The invention also concerns a circuit data expansion system according to claim 6. Brief Description of the Drawings Figures 1A and 1B are functional block diagrams designating first and second principles of the present invention, respectively, Figure 2 is a block diagram illustrating the third principle of the present invention, Figure 3 illustrates an embodiment of a first gate addressing system, Figures 4, 5 and 6 illustrate a table of first connection relationships corresponding to the first gate addressing system, Figure 7 is a diagram for explaining the macro and hierarchical representation of Figure 3, Figure 8 is a block diagram of a first connection relationship outputting hardware corresponding to the first gate addressing system, Figure 9 is a diagram illustrating an operation of the hardware of Figure 8, Figure 10 is a diagram illustrating another operation of the hardware of Figure 8, Figure 11 illustrates a second gate addressing system, Figures 12 and 13 illustrate a second connection relationship display table corresponding to the second gate addressing system, Figure 14 is a diagram for explaining the macro and hierarchical representation in Figure 11, Figure 15 is a block diagram of a second connection relationship outputting hardware corresponding to the second gate addressing system, Figures 16A and 16B are diagrams for explaining the concept of the gate addressing system when the depth of the hierarchy is 3 with Figure 16A for design hierarchy and with 16B for the gate address space, Figure 17 is a diagram illustrating an operation of the hardware of Figure 16, Figure 18 is a block diagram of a circuit data expanding system, Figure 19 is a flowchart of a compile process, Figure 20 is a diagram for explaining a circuit data generating system, Figure 21 is a diagram for explaining a circuit data generating system, Figure 22 is a flowchart of a simulation executing process of the third principle of the present invention, Figure 23 is a diagram illustrating an example of a circuit connection relationship, Figure 24 illustrates a conventional gate addressing system, Figures 25 through 28 illustrate an example of a connection relationship display table corresponding to the conventional gate addressing system, and Figure 29 illustrates an example of a connection relationship outputting hardware corresponding to the conventional gate addressing system. Description of the Preferred Embodiments Figures 1A and 1B are functional block diagrams of first and second principles of the inventions, respectively. These functional block diagrams correspond to a gate addressing system at the time of translation from data in a circuit design data base to circuit data for a logic simulation machine, that is, a gate numbering system. In Figure 1A, instead of performing consecutive numbering among input terminals of a circuit between the input terminal and the gate and among gates of the circuit as in Figure 24, the input terminals and gates are numbered in block 10 without using a number corresponding to the number of fanout gates minus one to which an output signal of each input terminal or of each gate is applied. Since, for example, the number of fan-out gates of the input terminal numbered 1 is three in Figure 24, the input terminal numbered 2 in Figure 24 is assigned number 4. In 11, a table representing connection relationships between an input terminal and a gate and among gates, as described in conjunction with Figures 25 and 28, is configured such that a list of numbers of fanout gates of input terminals and gates starts at addresses as numbers assigned to the input terminals and gates. For example, in Figures 25 to 28, data of address 1 indicates a pointer to a list of the numbers of a fanout gate to which the output signal of the input terminal 1 is applied, as described above. The actual list starts at address 101. By making 4 the number of the input terminal numbered 2 in Figure 24, the addresses 2 and 3 can be used for the list. Thus, the addresses 1 to 3 can be used to represent the list itself. In Figure 1B which is a functional block diagram of the second principle of the invention, in 12, when there are a plurality of partial circuits having the same arrangement of the input terminal and gates in a circuit, a specific offset value is assigned to each other partial circuit using input terminal and gate numbers of one partial circuit as the reference, and each input terminal and gate is numbered by adding the offset value between corresponding input terminal and between corresponding gate. In 13, in a table representing connection relationships between an input terminal and a gate and between gates, the offset value assigned to each partial circuit is added to the list for the partial circuit used as the reference so that the list of numbers of fanout gates of input terminals and gates may be shared among the plural partial circuits. In the second principle of the invention, for example, gate numbers, which are 10 to 12 and 13 to 17 in Figure 24, are made 4 to 6 and 7 to 11. 1 to 11 correspond to the partial circuit used as the reference. For example, input terminals numbered 4 to 6 are assigned 21 to 23 and gates numbered 20 to 27 are assigned numbers 24 to 31, which correspond to the old numbers 10 to 17. That is, the offset value for the second partial circuit relative to the partial circuit used as criterion is 20. By relatively numbering input terminals and gates of each partial circuit using an offset value and preparing only one list of fanout gate numbers in the table representing connection relationships between an input terminal and a gate and between gates, a single list can be referred to for fanout gate numbers of gates of each partial circuit using an offset value. Figure 2 is a block diagram illustrating the third principle of the present invention, which is directed to a circuit data expansion system in a memory 25 of a logic simulation dedicated machine 24 when a simulation circuit model is generated by compilation of source data. In Figure 2, a circuit data library 23 stores circuit data resulting from compilation of circuit components to which source data in a source file 21 refers. A compile program 22 has the facility to read source data from the source file 21, to take circuit data corresponding to the source data from the circuit data library 23 and to expand it on the memory 25 of the logic simulation dedicated machine 24. It also has the facility to issue a copy instruction to copy the circuit data which is already expanded on the memory 25 onto another location of the memory 25. The compile program 22 sequentially reads source data from the source file 21, refers to the circuit data library 23 to take compiled circuit data and expands it on the memory 25. When the source data corresponds to the circuit data which is already expanded on the memory 25, the compile program 22 issues a copy instruction to copy this expanded circuit data without taking circuit data from the circuit data library 23 again. In Figure 2, when all of the circuit data comprise pieces of source data corresponding to plural modules or components and if compiled circuit data corresponding to a piece of source data have already been expanded on the memory 25, the data are copied. When circuit data for all of modules or components have been expanded on the memory, the connection relationships among modules or components are set, thereby generating simulation circuit data. Thus, by utilizing a hierarchical structure at the time of compilation of source data, circuit data for modules or circuit parts once expanded on the memory 25 are copied into the memory 25, thereby reducing the amount of processing. Figure 3 illustrates a first gate addressing system according to the first principle of the present invention. The numbering in the first gate addressing system is characterized in that, first, the relative relationships among gates in macros of the same structure are equal in respective macros and, second, gates are not consecutively numbered. For example, a first input pin has three fanouts and thus the next input pin is numbered in accordance with a rule such that 1 + 3 = 4. Likewise, the twelfth gate has two fanouts and hence the next gate is numbered 12 + 2 = 14. According to the first feature, when the same macro is used in plural locations in a device, it is only required to repeatedly copy the same data into different addresses. For example, tables for macros assigned numbers 1 through 20, tables for macros assigned numbers 21 through 40 and tables for three other identical macros have only to store the same contents (thus resolving the first problem). According to the second feature, each gate is not necessarily required to point to a list and a list can be written below the gate address. Therefore, the number of addresses (1 + F) x the number of gates in the conventional system may be reduced to F x the number of gates (thus resolving the second problem). Figures 4, 5 and 6 illustrate a table of connection relationships corresponding to the first gate addressing system of Figure 4. Compared with the conventional data structure of the table of Figures 25 to 28, a further column "ADD" is added between columns "PTR" and "GATE". In this embodiment, when ADD = 1, the GATE column is numbered such that the sum of an address number and a number written in the GATE column indicates the actual gate number. When ADD = 0, the GATE points to a gate number directly as in the conventional system. To obtain fanouts of the gate 10, the table address 10 is referred to. Since the END in address 11 is 1, there are two lists in the addresses 10 and 11. Since ADD = 1 in the address 10, a gate number of 16 is obtained by adding + 6 in GATE to the address 10. Likewise, the address 11 and GATE = +8 results in a gate number of 19. In relatively expressing the connection relationship among macros 1 through 20 as described above, if a small-scale circuit at a macro level is once compiled, the resultant data can be utilized as it is, without renumbering gates uniquely as a whole. Such a relative description feature enables the above numbering method. Figure 7 is a diagram for explaining the macro and hierarchical representation of Figure 3. The circuit of Figure 3 is designed hierarchically as shown in Figure 7. The macro data shown in Figure A and its connection relationships are described normally. At this point it is only necessary to set an offset value to each of the macros using the present gate numbering method. The offset values have only to be set so that gate numbers of each macro may not coincide with those of another macro. Since each macro is designed herein to have a size of 19, the offset interval is set to 20. In this way, internal data of the macro can be utilized as it is, thus eliminating the need for renumbering gates. Where macros of the same type are used, as in the present embodiment, the macro need be copied only a few times. For connection among macros, the connections of those having offset values 0, 20 and 40 are defined individually from the addresses 200, 210 and 220 of the table of Figures 4 to 6. This is based on the adoption of an indirect addressing method (pointer). In this way the data structure of Figures 4 to 6 can be generated at a higher speed than with the conventional system. The first feature of the gate addressing system described in conjunction with Figures 3 to 7 and the corresponding table data structure is that the connection relationships within a macro are represented by relative values to data storage addresses, thus making data for a plurality of macros basically equal. For example, data for addresses 1 to 19 may be equal to those for addresses 21 to 39, 41 to 59, 61 to 79 and 81 to 99. The second feature is that the output of the entire macro is expressed by a list pointed to by a pointer. Thus, only one address suffices for one output, the size of a table required for a macro becomes constant regardless of how the output of the macro is connected outside and the address assignment to each macro can be performed independently, at high speed. In Figure 3, the output gates of the macros are 20, 40 and so on. The third feature is that gate addresses are not consecutive and provided including a list of fanout gates, thus reducing the number of pointers. For this reason, the total number of addresses in the system of Figures 4 to 6 is 110, while in the conventional system of Figures 25 to 28 it is 141. Figure 8 illustrates an example of connection relationship outputting hardware corresponding to the first gate addressing system. 31 denotes a memory (FAN) for storing connection relationship display table data as in the conventional system of Figure 29. 32 denotes a register (FADR) for pointing to an address of the table. This register 32 loads data from a multiplexer 33 (when load = 1) or increments the current address by one (when load = 0). This is controlled by a signal line load. When data in the FAN is a pointer (PTR = 1 the multiplexer 33 passes lower data coming from the FAN 31. A multiplexer 34 selectively loads externally applied data "next-gate" or data from a stack 35 and passes data from the stack as long as the stack is not empty (empty = 1). Gates 36 to 44 are control gates. A multiplexer 45 and an adder 46 pass data GATE from the FAN 31 as is or with a table address added. The multiplexer passes the data GATE as is (with 0 added) when ADD = 0 and with table addresses added when ADD = 1. 35 denotes a stack which, when data in the table FAN is a pointer (PTR = 1), stores an address (the current FADR address + 1 in an adder 47) returned at the termination of reading of data pointed to by the pointer. If, however, the pointer is written at the end (END = 1) of a list, the address is not saved since it does not need to return. 48 is a register which controls an address SADR of the stack. When a return address is saved, the address is incremented by one (UP = 1 ) to write data. When a table list ends, UP becomes UP = 0, in which case the value of the SADR 48 is decremented by one after the contents of the stack have been read into the FADR 32. When the list is halfway (END = 0), the SADR value is incremented only when data is for a pointer. At the end of the list, the SADR value is usually decremented (UP = 0). When the stack is empty (empty = 0) or data is for a pointer, the SADR 48 does not operate. First, the condition under which external data "next-gate" is taken in will be described. Only when the stack 35 of the hardware is empty, a list which is being internally read ends (end = 1 ) and the last piece of data is not a pointer (PTR = 0), AND gate 38 is enabled to take in the next gate next-gate which is a candidate for taking out fanout gates from the next gate. In other cases, external circuits are on standby while data are being stored. When the above condition is satisfied, the next-gate is loaded into the FADR 32 via the multiplexers 34 and 33. A gate number is thereby set in the FADR so that reading of fanout gates from the table 31 is initiated. When data is not a pointer, a valid signal from the inverter 43 goes to 1, indicating that effective data are being output to the outside. With regard to the gate number, the current FADR address is added to GATE when ADD = 1 so that a relative address is translated to a direct gate number. When data is a pointer, a pointer value is set in the FADR 32 via the multiplexer 33 to read a list pointed to by the pointer. At this point, it is the current FADR value + 1 that is to be returned at the termination of a reading of a preceding list and this value is stored in the stack 35. This is carried out by incrementing the FADR by one and writing FADR + 1 into the stack. However, when the pointer data is the last data in the list, it is not stored because its return is not necessary. When the list is read up to reach its last piece of data, if the last piece of data is a pointer, the next list pointed to by the pointer is read successively. If the last piece of data is not a pointer, the process is returned to the preceding list from which the process is moved. The address of the preceding list is written in the stack. This address is taken into the FADR via the multiplexers 34 and 33 and the SADR value is decremented by one. By repeating such an operation, the readout of fanout gates is terminated. Thus, the stack 35 becomes empty, the end of the list is reached and the last piece of data on it is no longer a pointer. Figure 9 illustrates an example of an operation of the hardware of Figure 10. An operation of the hardware in which 20, 21 and 24 are continuously input from outside as next gate numbers is indicated by the contents of the address register (FADR) 32 and stack 35. When 20 is externally input as the next gate number, no fanout gate number is output, the contents of the FADR becomes 20 and the next gate number becomes 21 because the data in the address 20 in Figure 7 indicates END = 1 , PTR = 1 and ADD = 0. At this time the contents of the stack remain 0. The contents of the address 20 indicate a pointer value of 200 by which the contents in address 200 are referred to. That is, the FADR value becomes 200 and the contents of GATE in address 200 is output as a fanout gate number. Since END = 0 and PTR = 0 in address 200, the FADR value is increased to 201. In address 201, END and PTR are both 1s so that no fanout gate number is output and address 81 is stored in the FADR 32 in accordance with pointer value 81. In address 81, the ADD is 1 and the END and PTR are both 0s. Thus, the address 81 and the contents of the GATE. i.e., +9, are added together and 90 is output as a fanout gate number. Likewise, 97 and 98 are output as fanout gate numbers for addresses 82 and 83. In address 83, the END is 1 so that the fanout gate number list for gate number 20 ends and the next gate number 21 is taken into the FADR 32. The content of address 21 corresponds not to a pointer but to a fanout gate number. Since ADD = 1, the address 21 and the contents of GATE, i.e., +9, are added together so that fanout gate number 30 is output. The fanout gate list for the gate numbered 21 continues up to address 23, in which the END becomes 1 so that fanout gate numbers 37 and 38 for addresses 22 and 23 are read. In this example, a pointer is always placed at the end of a list and thus no data is stored in the stack. Figure 10 illustrates another example of the operation of the hardware of Figure 8. In this example, data, except the contents of the END are interchanged between addresses 200 and 201 in the table of Figure 6. That is, in the table of Figure 7, the PTR and GATE in address 200 are changed to 1 and 81, respectively, while the PTR and GATE in address 201 are changed to 0 and 101, respectively. In Figure 10, the operation is the same as that in Figure 9 until gate number 20 is stored in the address register 32 (FADR). However, since data in address 200 pointed to by the pointer value as data in address 20 is a pointer, no fanout gate number is output when 200 is stored in the FADR 32, the contents of the FADR becomes 81 at the next clock, return address 201 is stored in the stack at the end of the list pointed to by the pointer, and fanout gate number 90 is output using data in address 81. Subsequently, fanout gate numbers 97 and 98 are output as in Figure 9, the value of the FADR 32 becomes address 201 stored in the stack because the list ends at address 83 and fanout gate number 101 is output. The reading of the fanout gate list for the gate numbered 20 ends at address 201. Fanout gate numbers for the gate numbered 21 are read afterward as in Figure 9. In the embodiment described in conjunction with Figures 3 through 10, the inputting of the next-gate is placed in the wait state when effective data is output to the outside. In this case, however, the writing into and reading from the stack are unnecessary and hence it is logically possible to input the next-gate into the stack early. The implementation of such hardware is also possible. The technique may be applied to generation of a data structure of a simulator serving as software and not as a dedicated machine. In this case, where an existing simulator adapted for direct addressing of gates is used, it is necessary in loading circuit data into the simulator to translate relative addresses to direct addresses. To cope with indirect addresses, a non-delay buffer can be inserted into a circuit. In this case, the buffer is assigned a gate number which can be pointed to by a pointer. This also applies to the case where the compile method is applied to a conventional simulation dedicated machine. Figure 11 illustrates a second gate addressing system according to the second principle. The feature of gate numbering is that relative relationships among gates in identical macros are equal in respective macros. Gates numbered 1 to 11 and gates numbered 21 to 31 are the same macro. The relative relationship (difference between gate numbers) between corresponding gates is equal for any gate. Figures 12 and 13 illustrates a second connection relationship indicating table corresponding to the second gate addressing system. Compared with the conventional table of Figures 25 to 28, a further column "ADD" is added between columns "PTR" and "GATE", as for the table of Figures 4 to 6. The meaning is the same as that of Figures 4 to 6. The INO column, unlike in the conventional system, indicates an offset value when PTR = 1. The GATE column indicates a pointer value when PTR = 1, as in the conventional system. When PTR = 1, a jump is made to a destination pointed to by a pointer value in the GATE column, as in the conventional system. Unlike in the conventional system, a fanout gate number contains an offset value of GATE data pointed to by a pointer. If the offset value and ADD are always 0, the second system is the same as the conventional system. When the same macro is used in plural locations, the use of the addressing system of Figure 11 and the data structure of the table of Figures 12 and 13 eliminates the need to repeatedly copy the same data into different addresses. The data has to be held in only one address. The pointer offset values permit independent gate numbers to be generated. For example, the pointer of the gate numbered 96 and the pointer in address 201 in the list of the fanout gate numbered 11 both point to 100, but different offset values of 60 and 80 are written in the BASE 2. Offset value 60 points to 64, 68 and 69 in the same macro, while offset value 80 points to 84, 88 and 89 (thus resolving the first problem). In a circuit using the same macro repeatedly, therefore, the table has only to store one type of macro. Thus, the length of the list can be reduced according to the frequency of repetition of the macro (thus resolving the second problem). In Figures 12 and 13 , table address 11 is referred to in order to obtain fanouts of the gate numbered 11. The address 11 points to address 200 with offset value 0. Since the END of address 201 is 1, there are two lists in addresses 200 and 201. Since PTR = 0 and ADD = 0 in address 200, a gate number 96 is directly written in GATE. In address 201, PTR = 1, which is a pointer, and the offset value is 80. Since the previous offset value is 0, an addition is made so that the correct offset value becomes 80. Since the pointer points to 100, a jump is made to 100 so that data are read from addresses 100, 101 and 102. In each of the addresses, ADD = 1. Thus, gates numbered 84, 88 and 89, which are derived from table address + BASE 1 + offset value (=80), are obtained as fanout gates. In this way, the table can express one type of macro using one address, thus reducing the quantity of data (thus resolving the first problem). If a macro is once compiled, its data can be utilized unchanged without the need to renumber gates uniquely as a whole. Figure 14 is a diagram for explaining a macro of Figure 11 and hierarchical representation. The circuit of Figure 11 is designed hierarchically as illustrated in Figure 14. Macro data such as like A and its connection relationship B are normally described. In this case, by using the present gate numbering method, a table has only to have only one address of addresses of gates within the macro. An offset value for identifying a macro has only to be set in BASE 2 of a row which points to the macro. Offset values for macros may be set such that their gate numbers do not coincide. Since the size of the macro in this example is 11, the offset interval is set to 20. The offset interval may be 12, but this value makes the correlation of numbers difficult to understand. Thus, 20 is used herein. This allows the internal data of a macro to be used unchanged, thus eliminating the need to renumber gates. Where macros of the same type are used, as in the present example, it is unnecessary to copy the macro several times. To enable interconnection of macros, their connections are defined individually in addresses 200, 202 and 204. This depends on the adoption of the indirect addressing method (pointer). Thus, the data structure of Figures 12 and 13 can be generated at a higher speed than in the conventional system. Figure 15 is a block diagram of connection relationship outputting hardware corresponding to the second gate addressing system. Like reference characters are used to designate parts corresponding to those in Figure 8 for the first gate addressing system and their descriptions are omitted. The stack (2) 50 of Figure 15 operates in the same manner as the stack 35. Data to be stored in the stack 50 is data of BASE 2. Initially the contents of a register 51 are 0 and thus the value of BASE 2 is stored in the stack (2) 50 as it is via an adder 52. This corresponds to a first pointer when a list is traced. This offset value is stored in the stack (2) 50 and output from the stack (2) at the next clock for addition in an adder 53. When a pointer comes again in this state, the value of BASE 2 is added to the current offset value in the adder 52 and then stored in the stack (2). The register 51 holds the offset value output from the stack one clock before. The stack (2) 50 outputs 0 when no data is stored therein and clears the register 51. In the stack 50 are written offset values. At a first-stage pointer the stack (2) is empty so it outputs data 0, making the value in the register 51 0. Thus, data written in BASE 2 becomes an offset value as is. Furthermore, when a pointer is followed, the sum of data written in BASE 2 and the current offset value output from the stack 50 and stored in the register 51 becomes the formal offset value and is stored in the stack 50. The address register for the stack (2) is SADR 48, which is also the address register for the stack 35. In the second gate addressing system described in conjunction with Figures 11 to 14, conditions such as those described in conjunction with Figure 15 in which a second pointer is written in a list pointed to by a first pointer, that is, conditions in which the value of BASE 2 is added to the current offset value, do not occur. Such conditions occur when the depth of hierarchy is three or more. They will be described conceptually with reference to Figure 16. Figure 16A illustrates an example of three hierarchies. Macros, i.e., partial circuits B0, B1 and B2, are the same as each other. In the second gate addressing system, only data on macro B0 is generated and addresses for macros B1 and B2 are generated on the basis of data on macro B0 by providing an offset BASE 2. The offset is set to 100 for macro B1 and to 200 for macro B2. That is, macro B is not more than 100. Inside macros A0, A1 and A2 of the macro B are also the same as each other. As is the case with the macro B, addresses are generated on the basis of data on A0 by providing each of macros A1 and A2 with an offset BASE 2. Figure 16B illustrates addresses which are finally generated in the gate address space. For example, a gate number, i.e., an address of macro B1, is obtained by adding 100 to the address of the corresponding gate in macro B0. An address of macro A1 within macro B1 is obtained by adding 100 + 20 to the address of the corresponding gate in macro A0 of macro B0. Thus, it becomes necessary to add two BASE 2s together. A correspondence between the description of Figure 15 and the example of Figure 16 will be established as follows. The above-described first pointer corresponds to the case where an inside gate of macro B1 is pointed to from outside, that is, the case where a fanout of a gate external to macro B1 is connected to an inside gate of macro B1. The next pointer corresponds to the case where an inside gate of macro A1 is pointed to by a gate external to macro A1. The above-described current offset value corresponds, in this case, to 100 and the value of BASE 2 corresponds to 20. Figure 17 illustrates an example of operation of the hardware of Figure 15. In this Figure, an operation in which 11, 21 and 22 are continuously input from outside as next gate numbers is illustrated with respect to the contents of the address register 32 (FADR) and two stacks 35 and 50. When 11 is input from outside as the next gate number, no fanout gate number is output, the contents of the FADR 32 becomes 21 and the next gate number becomes 21 since data in address 11 in Figures 12 and 13 is a pointer. At this time the contents of the two stacks remain 0. Next, address 200 is pointed to by the contents in address 11 so that the value of the FADR 32 becomes 200 and gate number 96 is output. At this point the contents of the FADR 32 are incremented to 201. However, address 201 is the end of a list and stores a pointer value so that no fanout gate number is output. Address 100 is referred to by the pointer value in address 201. At this time, the offset value 80 in address 201 is stored in the second stack 50. Then, 84 is output as a fanout gate number. Subsequently, fanout gate numbers 88 and 89 are output until address 102 is reached. Thus, the outputting of fanout gate numbers for the gate 11 terminates. Next, the next gate number 21 is read into the FADR 32. The data in address 21 is a pointer value 100 and an offset value is 20. Thus, the FADR 32 becomes 100 and the second stack 50 becomes 20 so that a fanout gate number 24 for address 100 is output and fanout gate numbers for addresses succeeding address 100 continue to be output. Next, an embodiment of a circuit data expansion system in accordance with the third principle of the present invention, which is illustrated in Figure 2, is illustrated in Figure 18. In Figure 18, a source file 21 stores source data which describes the structure of a circuit to be simulated. The source file 21 contains connection relationships among pins of the circuit (circuit components), etc. A compile program 22 reads source data from the source file 21 in sequence, takes relevant circuit data from a circuit data library 23 for translation from a relative address to an absolute address and expansion on a memory 25, transfers relevant circuit data from the circuit data library 23 directly to a simulation dedicated machine 24 with a relative address, expands the data on the memory 25 after translation to an absolute address (when a relative address to absolute address translation facility is installed), and issues a copy instruction to copy circuit data expanded on the memory 25. The circuit data library 23 previously stores circuit data resulting from compilation of circuit components to which source data refers. This circuit data library 23 stores in advance compiled circuit data, memory capacity for circuit data and so on. The logic simulation dedicated machine 24 is adapted for high-speed logic simulation (computer system). The memory 25 is installed in the logic simulation dedicated machine 24 and adapted to expand circuit data for simulation execution. Next, the operation of the embodiment of Figure 18 will be described with reference to the flowchart of Figure 19. In Figure 18, it is assumed that the source file 21 stores source data for two components a, one component b, three components c, one component d and three components e. The circuit data library 23 stores circuit data a, circuit data b, circuit data c, circuit data d and circuit data e resulting from compilation of component a, component b, component c, component d and component e, and memory sizes for those circuit data (a. memory size is expressed by the size of a rectangle). In Figure 19, source data are read in step S60. That is, source data (for example, a x 2) are read from the source file 21 on a row-by-row basis. In S61, relevant data (for example, circuit data a) are read from the circuit data library 23. In S62, the relevant circuit data are transferred and expanded on the memory. That is, the compile program 22 issues a circuit data transfer instruction so as to transfer circuit data (for example, circuit data a) from circuit data library 23 to the logic simulation dedicated machine memory 25, as indicated by an arrow in Figure 18, and expands it on the memory. In S63, a determination is made as to whether or not the same data is plural. If YES (for example, when the first source data a x 2 is read from the source file 21), the process of S64 is performed. If NO, next data are read in S65 and the process returns to S61. In S64, a copy instruction is issued to copy circuit data. That is, since it has been determined in step S63 that the same data is plural, the circuit data (for example, circuit data a) expanded on the logic simulation dedicated machine memory 25 is copied by the relevant number. In S66, a determination is made as to whether or not the compilation has been terminated, that is, whether or not all pieces of source data have been read. If YES, the connection relationships of the circuit data expanded on the logic simulation dedicated machine memory 25 are set in accordance with the circuit structure descriptive data in the source file 21 and then stored in a suitable location in S67. If NO, the next data are read in S65 and the process returns to S61. By the above processes, the circuit data relevant to the source data read from the source file 21 are read from the circuit data library 23 and expanded on the logic simulation dedicated machine memory 25, as shown in Figure 18. By copying the same data, it expands the compiled circuit data on the logic simulation dedicated machine memory 25 with a small amount of data from the source file 21. Next, a more specific description is made with reference to Figures 20 and 21. Figure 20A illustrates an example of circuit components. This is a schematic representation of circuit structures described in the source file 21. The component 1 is constructed from two components 2, one component 3, one component 4, one component 5 and three components 6. Furthermore, the component 2 is comprised of two components 4; the component 3 is comprised of one component 7 and one component 4; the component 5 is comprised of one component 4, one component 8 and one component 9; and the component 6 is comprised of one component 9 and one component 10. Figure 20B illustrates the hierarchical structures of the various components of Figure 20A. Figure 20C illustrates the combined hierarchical structure of Figure 20B. Figure 21 illustrates an example of the order of data transfer/copy. Here, "□" indicates a component whose data is transferred from the circuit data library 23 to the logic simulation dedicated machine memory 25 and expanded thereon, while "○" indicates a component to be copied on the logic simulation dedicated machine memory 25. This is described hereinafter. (1) The compile program 22 refers to the circuit data library 23 for components stored in the source file 21 and needed to configure the hierarchical structure of Figure 20C, to obtain the sizes of memory areas and to determine addresses assigned to the components so that circuit data storage areas in the logic simulation dedicated machine memory 25 do not overlap. (2) The "□" circuit data of Figure 21 are taken from the circuit data library 23 to be transferred to the addresses, assigned in (1), of the logic simulation dedicated machine memory 25 and expanded. Here, the circuit data are transferred to the addresses assigned to the "□" components 1 to 10. (3) The relevant "□" components are copied to the addresses assigned to the "○" components at the low level of Figure 21. Here, four components 4 and one component 9 are copied from the "□" components 4 and 9, respectively. (4) The relevant "□" components are copied to the addresses assigned to the "○" components at the second level of Figure 21. Here, one component 2 and two components 6 are copied from the "□" components 2 and 6, respectively. (5) The compile program 22 prepares data for connection among the components at the second level of Figure 21 and stores it in a suitable memory address of the logic simulation dedicated machine memory 25. (6) Data connected among all the components of Figure 21 are read from the source file 21 and connection relationships among the components are prepared in accordance with the addresses assigned in (2) and addresses of input/output terminals of each component read from the circuit data library 23 to be stored in a suitable memory address of the logic simulation dedicated machine memory 25. By performing the data transfer, expansion and copy in accordance with the above procedures, it becomes possible to expand components and their connection relationships on the logic simulation dedicated machine memory 25 in an optimized mode, with a small amount of processing, at a high speed. Figure 22 is a flowchart of the simulation executing process. In Figure 22, circuit data are fetched from the logic simulation dedicated machine memory 25 in S71. In S72, a logical operation is performed. In S73, an event is waited to fetch the next circuit data. A concrete example of the event here is such that a signal at the output pin of a gate A has gone to 1. When such an event occurs, the simulator fetches the destination to which the output pin of the gate A to be connected from the circuit data, updates a signal value of an input pin of the destination gate, and evaluates and updates a signal value of the output pin of the gate. In S74, a decision is made as to whether or not the simulation has terminated. If YES, the simulation terminates. If NO, S72 and the following steps are repeated to perform the simulation of the logic circuit.

Claims: A gate addressing system of a logic simulation machine for performing translation from data of a circuit design data base to circuit data for the logic simulation machine, characterized in that it comprises : means (31, 35, 50) for numbering input terminals and gates of a circuit, when said circuit comprises a plurality of partial circuits with the same arrangements, using one partial circuit as a reference, assigning a specific offset value to each other partial circuit and adding offset values between corresponding input terminals and corresponding gates; and means (32-36, 44-46, 51-53) for commonly providing a list of numbers of input terminals and numbers of fanout gates of each gate in a table representing connection relationships among input terminals and gates and among gates, by adding an offset value assigned to each of said partial circuits to the contents of a list of said partial circuit used as said reference. The gate addressing system according to claim 1, wherein data on fanout gate numbers (GATE) in said list are represented in terms of values relative to addresses (ADR) of the table. The gate addressing system according to claim 1 or 2, wherein a pointer (PTR) to another list in which fanout gate numbers are written is expressed in the fanout gate number list. The gate addressing system according to any one of claims 1, 2 or 3, wherein a pointer (PTR) to another list in which fanout gate numbers are written is expressed in the fanout gate number list, said pointer being caused to hold said specific offset value, and a fanout gate number is read by adding said specific offset value to data pointed to by said pointer. The gate addressing system according to any one of claims 1 to 4, wherein said circuit comprises a plurality of partial circuits with the same arrangements, using one partial circuit (1, 4, 7, 10, 12, 14, 16-20) as a reference, a specific offset value being assigned to each of the other partial circuits, and input terminals and gates being numbered by adding the offset values among corresponding input terminals and among corresponding gates. A circuit data expansion system for generating a simulation machine circuit model by compilation of source data, characterized in that it comprises : a circuit data library (23) for storing circuit data resulting from compilation of a circuit component to which the source data refers; a compile program (22) having a facility for expanding circuit data corresponding to source data taken from said circuit data library (23) on a memory (25) of a logic simulation machine (24) and a facility for causing said source data to copy said circuit data which has already been expanded on said memory in another area of said memory wherein; when said compile program reads source data from a source file (21) in sequence and refers to said circuit data library (23) to take compiled circuit data for expansion on said memory (25), said compile program issues a copy instruction to copy said circuit data expanded on said memory when said source data corresponds to said circuit data which has already been expanded on said memory.

Inventors: HIROSE FUMIYASU, SHOJI MINORU, HIROSE, FUMIYASU, SHOJI, MINORU
Applicants: FUJITSU LTD, FUJITSU LIMITED
Application year: 1991
Main classification: G06F17
IPC codes: G06F17