Static memory area scanning test method and equipment based on UVM methodology

Through the static memory area scanning test method based on UVM methodology, the problem of missing vector decomposition and incomplete coverage points in static memory verification is solved, and the full function coverage of the static memory area and mixed access of different operation types is achieved, ensuring that Test integrity and efficiency.

CN116860532BActive Publication Date: 2024-11-19BEIJING ZHAOXUN HENGDA TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202310746286.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-06-24
Publication Date
2024-11-19
Estimated Expiration
2043-06-24

AI Technical Summary

Technical Problem

In the prior art, there are problems in static memory verification, such that verification vector decomposition and incomplete coverage points are caused by the unusable static memory after production.

Method used

Using the static memory area scanning test method based on UVM methodology, by obtaining the address size and initial address of the address space, operating in byte, half word or word mode, burst transmission and single-byte transmission, and data writing and read, compare data consistency, print correct or error information, and add error flag signals.

Benefits of technology

It realizes full functional coverage of static memory area scanning test, supports mixed access of different operation types, such as word-written byte reading, single word-written byte continuous reading, etc., ensuring the integrity and testing efficiency of address mapping relationships.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN116860532B_ABST
    Figure CN116860532B_ABST
Patent Text Reader

Abstract

The present invention discloses a static memory area scan test method and device based on UVM methodology. The method proposes and implements full-function coverage of static memory area scan test by building a verification environment based on UVM methodology, thereby realizing mixed access of different operation types. On the other hand, the static memory area scan test process implemented by the present invention covers words, half words and bytes, which can ensure that different operation types have no effect on address mapping relationships.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention relates to a static memory area scanning test method based on UVM methodology, and also relates to corresponding static memory area scanning test equipment, belonging to the technical field of static memory testing. Background Art

[0002] Static memory is widely used in various electronic devices. Due to the variety of static memory products, different device types and bus interfaces, the verification simulation of static memory is a great test of the skills of verification engineers. If the verification vector decomposition is missing and the coverage points are not comprehensive, there will be a great risk that the static memory will be unusable after production.

[0003] In the Chinese invention patent with the patent number of ZL 200810180765.2, a test system and a test method for an embedded memory are disclosed. The system includes a test device and an automatic test device connected thereto, wherein the device includes a memory test controller connected to a memory test bus interface unit, and the memory test controller performs state conversion according to a test control signal input by the automatic test device, and writes the test data input by the automatic test device through the memory test bus interface unit into the embedded memory according to the storage address input by the automatic test device through the memory test bus interface unit in a corresponding state, or controls the memory test bus interface unit to read the test data stored in the embedded memory according to the storage address input by the automatic test device through the memory test bus interface unit in a corresponding state, and the memory test bus interface unit sends the test data to the automatic test device for verification.

[0004] On the other hand, Universal Verification Methodology (UVM) is a verification platform development framework based on the System Verilog class library. Verification engineers can use its reusable components to build a functional verification environment with standardized hierarchical structures and interfaces. UVM methodology greatly simplifies the complex association process between design and verification in traditional verification methods, reduces technical complexity, and improves verification efficiency. It is the mainstream direction of the current development of verification methodology. Summary of the invention

[0005] The primary technical problem to be solved by the present invention is to provide a static memory area scanning test method based on UVM methodology.

[0006] Another technical problem to be solved by the present invention is to provide a static memory area scanning test device based on UVM methodology.

[0007] In order to achieve the above object, the present invention adopts the following technical solutions:

[0008] According to a first aspect of an embodiment of the present invention, a static memory area scan test method based on UVM methodology is provided, comprising the following steps:

[0009] S101: Obtaining the address size and initial address corresponding to the defined address space;

[0010] S102: Assign values ​​to user-defined variables by byte-by-byte operation;

[0011] S103: increasing the target value in sequence from the target preset data in word mode;

[0012] S104: Determine whether all addresses in the defined address space have been traversed;

[0013] S105: If all addresses in the address space have not been traversed, return to step S102;

[0014] S106: If all addresses in the address space have been traversed, a burst transfer is performed, and 0 is written in word mode to initialize all addresses;

[0015] S107: cyclically access all address spaces according to the word mode;

[0016] S108: Execute single-byte transmission and write data to each byte address;

[0017] S109: Execute burst transfer and read out all data in the effective address space in word mode;

[0018] S110: Compare the written address by bytes to determine whether the variable and the read data are consistent;

[0019] S111: If they are consistent, print the correct output information;

[0020] S112: If they are inconsistent, print the wrong output information, and print the expected data and the actual simulated read data respectively, and increment the error flag signal by 1;

[0021] S113: for the address that has not been written, read the data in byte mode, and compare and determine whether the read data is 0;

[0022] S114: If the read data is 0, print the correct output information;

[0023] S115: If the read data is not 0, print the error output information, print the read data, and increment the error flag signal by 1;

[0024] S116: Continue reading the address, and the address increases by 1;

[0025] S117: Determine whether the loop operation of step S107 is completed. If the loop operation is completed, the next step is to execute S118; if the loop operation is not completed, the next step is to return to S107;

[0026] S118: Determine whether the error flag signal is 0, and print correct output information when the error flag signal is 0, and print incorrect output information when the error flag signal is not 0.

[0027] Preferably, step S101 specifically includes:

[0028] Get the address size and initial address corresponding to the address space defined in the macro definition file.

[0029] Preferably, in step S104, the target value is 5.

[0030] Preferably, in step S107, the number of words is calculated by dividing the address size of the address space by 4.

[0031] According to a second aspect of an embodiment of the present invention, a static memory area scan test method based on UVM methodology is provided, comprising the following steps:

[0032] S201: Obtaining the address size and initial address corresponding to the defined address space;

[0033] S202: Assign data to user-defined variables in half-word mode;

[0034] S203: increasing the data word by word from the target preset data to the target value;

[0035] S204: Determine whether all addresses in the address space have been traversed;

[0036] S205: If all addresses in the address space have not been traversed, return to step S202;

[0037] S206: If all addresses in the address space have been traversed, a burst transfer is performed, and 0 is written in word mode to initialize all addresses in the address space;

[0038] S207: cyclically access all addresses in the address space according to the half-word mode;

[0039] S208: Execute single half-word mode transmission, and write data to each half-word address;

[0040] S209: Execute burst transfer and read out all data in the effective address space in word mode;

[0041] S210: for the written address, compare and determine whether the variable and the read data are consistent according to the half-word mode;

[0042] S211: If they are consistent, print the correct output information;

[0043] S212: If they are inconsistent, print the error output information, and print the expected data and the actual simulated read data respectively, and increment the error flag signal by 1;

[0044] S213: For the address that has not been written, read the data in word mode, and compare and determine whether the read data is 0;

[0045] S214: If the read data is 0, print the correct output information;

[0046] S215: If the read data is not 0, print the error output information, print the read data, and increment the error flag signal by 1;

[0047] S216: increment the address by 2;

[0048] S217: Determine whether the loop operation is finished. If the loop operation is finished, the next step is to execute S218; if the loop operation is not finished, the next step is to return to step S207;

[0049] S218: Determine whether the error flag signal is 0. When the error flag signal is 0, print the correct output information. When the error flag signal is not 0, print the wrong output information.

[0050] According to a third aspect of an embodiment of the present invention, a static memory area scan test method based on UVM methodology is provided, comprising the following steps:

[0051] S301: Obtaining the address size and initial address corresponding to the defined address space;

[0052] S302: Execute burst transfer, write 0 in word mode, and initialize all addresses;

[0053] S303: cyclically access all address spaces according to the word mode;

[0054] S304: Execute a single word transfer, and write the assigned variable into the corresponding address in word mode;

[0055] S305: Execute burst transfer and read out all valid address space data in word mode;

[0056] S306: for the written address, determine whether the read data and the written data are consistent according to word comparison;

[0057] S307: If they are consistent, print the correct output information;

[0058] S308: If they are inconsistent, print the error output information, and print the expected data and the actual simulated read data respectively, and increment the error flag signal by 1;

[0059] S309: Determine the address that has not been written, read the data in word mode, and compare whether the read data is 0;

[0060] S310: If the read data is 0, print the correct output information;

[0061] S311: If the read data is not 0, print the error output information, print the read data, and increment the error flag signal by 1;

[0062] S312: convert each written data, taking the last written data as the base, incrementing the hexadecimal number by 10, and incrementing the address by 4;

[0063] S313: Determine whether the loop operation in step S303 is finished. If the loop operation is finished, the next step is to execute S314; if the loop operation in step S303 is not finished, return to step S303;

[0064] S314: Determine whether the error flag signal is 0, and print correct output information when the error flag signal is 0, and print incorrect output information when the error flag signal is not 0.

[0065] According to a fourth aspect of an embodiment of the present invention, a static memory area scan test method based on UVM methodology is provided, comprising the following steps:

[0066] S401: Input the start address and end address of the address space to be tested;

[0067] S402: Write 1 to all addresses in word mode to initialize;

[0068] S403: Read all address data in word mode and determine whether the address data is 1;

[0069] S404: If the address data is 1, print the correct output information;

[0070] S405: If the address data is not 1, then print the error output information, and print the expected data and the actual simulated read data respectively, and increment the error flag signal by 1;

[0071] S406: cyclically access all address spaces according to the word mode;

[0072] S407: assigning values ​​to the custom variables according to the word mode, using incremental data starting from the second time;

[0073] S408: Execute a single transfer, and write the assigned variable into the corresponding address in word mode;

[0074] S409: Execute burst transfer and read out all valid address space data defined in the previous steps in word mode;

[0075] S410: for the written address, determine whether the read data and the written data are consistent according to the word mode comparison;

[0076] S411: If the read data and the written data are consistent, print the correct output information;

[0077] S412: If the read data and the written data are inconsistent, then print the error output information, print the expected data and the actual simulated read data respectively, and increment the error flag signal by 1;

[0078] S413: For the address that has not been written, read the data in word mode, and compare and determine whether the read data is 1;

[0079] S414: If the read data is 1, print the correct output information;

[0080] S415: If they are inconsistent, print the error output information, print the read data, and increment the error flag signal by 1;

[0081] S416: convert each written data, taking the last written data as the base, increment the hexadecimal number, and increment the address by 4;

[0082] S417: Determine whether the loop operation is finished. If the loop operation is finished, the next step is to execute S418; if the loop operation is not finished, return to step S406;

[0083] S418: Determine whether the error flag signal is 0, and print correct output information when the error flag signal is 0; and print incorrect output information when the error flag signal is not 0.

[0084] Preferably, in step S406, the address size of the address space is divided by 4 to calculate the number of words.

[0085] According to a fifth aspect of an embodiment of the present invention, a static memory area scan test device is provided, comprising a processor and a memory, wherein the processor reads a computer program in the memory to execute the above-mentioned static memory area scan test method.

[0086] Compared with the prior art, the static memory area scanning test method and device provided by the present invention propose and implement the full function coverage of the static memory area scanning test by building a verification environment based on UVM methodology, thereby realizing mixed access of different operation types, for example, various mixed and random operations such as word writing byte reading, single word writing byte continuous reading, single writing burst reading, etc. On the other hand, the static memory area scanning test process implemented by the present invention covers words, half words and bytes, which can ensure that different operation types have no effect on the address mapping relationship. BRIEF DESCRIPTION OF THE DRAWINGS

[0087] Figure 1 A schematic diagram of a test platform system for implementing the static memory area scanning test method;

[0088] Figure 2 A decomposition table of memory scan test vectors in an embodiment of the present invention;

[0089] Figure 3 This is an operation flow chart of writing one address and reading all addresses in single mode in an embodiment of the present invention;

[0090] Figure 4 A flowchart of single writing and burst reading of the entire space in half-word mode in an embodiment of the present invention;

[0091] Figure 5 This is a flow chart of a single write and burst read of all spaces in a static memory and data comparison in a word mode when all address spaces of the static memory are initialized to all zeros in an embodiment of the present invention;

[0092] Figure 6 This is a flow chart of a single write and burst read of all spaces in a static memory and data comparison in a word mode when all address spaces of the static memory are initialized to all 1s in an embodiment of the present invention;

[0093] Figure 7 A schematic diagram of the structure of a static memory area scan test device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0094] The technical content of the present invention is described in detail below with reference to the accompanying drawings and specific embodiments.

[0095] like Figure 1 As shown, the test platform system for implementing the static memory area scan test method provided by the embodiment of the present invention includes: a test vector library, a parameter configuration module, an interface connection module and a result comparison module; wherein,

[0096] Test vector library: contains test vectors that support various types of static memory, and the corresponding test vectors can be selected through the parameter configuration module. All test vectors use the system verilog language and the drive information is written according to the flow chart.

[0097] Parameter configuration module: used to input configuration information for the test platform system, which includes key information such as which test vector to select.

[0098] Interface connection module: used to connect the test vector and the module under test (such as static memory), output the stimulus signal and collect the output result, and send the stimulus signal and the output result to the result comparison module.

[0099] Result comparison module: includes a result information model that automatically outputs a standard format, and compares the input key information (the key information mainly includes: the test address range, the written data) with the collected output results, and outputs the compared results.

[0100] Figure 2 A decomposition table of memory scan test vectors in one embodiment of the present invention. Figure 3 This is the operation flow chart of writing one address and reading all addresses in single mode. Figure 3 As shown, the specific steps include:

[0101] S101: Obtain the address size and initial address corresponding to the address space manually defined in the macro definition file (define.sv);

[0102] S102: assigning data to user-defined variables by byte (a type of data type, taking a 32-bit bus operating system as an example, 32-bit operation is word operation, 16-bit operation is half word operation, and 8-bit is byte operation; bus operating systems of other bit numbers are analogous to this);

[0103] S103: the data is converted into word mode from 32'h12345678 (this data is artificially defined arbitrary data, which will be used in subsequent reading and comparison) plus 5 in sequence;

[0104] S104: Starting from the initial address, determine whether all address spaces defined in step S101 have been traversed;

[0105] S105: If all addresses in the address space have not been traversed, return to step S102;

[0106] S106: If all addresses in the address space have been traversed, a burst transfer is performed, and 0 is written in word mode to initialize all addresses;

[0107] S107: Loop through all address spaces. Since the access is in word mode, the total address space size is divided by 4 to calculate the number of words. The pseudo code is as follows: for (int k = 0; k < address size / 4; k++);

[0108] S108: Execute single-byte transmission and write data to each byte address;

[0109] S109: Execute burst transfer and read out all data in the effective address space in word mode.

[0110] S110: For the written address, compare the variables and the read data by bytes to determine whether they are consistent;

[0111] S111: If they are consistent, print the correct output information (read indata is ok);

[0112] S112: If they are inconsistent, print the error output information (read data is err): print the expected data (indata) and the actual simulated read data (rdata) respectively, and increment the error flag signal (err_flg) by 1;

[0113] S113: for the address that has not been written, read the data in byte mode, and compare and determine whether the read data is 0;

[0114] S114: If the read data is 0, print the correct output information (read indata is ok);

[0115] S115: If the read data is not 0, print the error output information (read data is err), print the read data, and increment the error flag signal (err_flg) by 1;

[0116] S116: Continue reading the address, and the address increases by 1;

[0117] S117: After step S116 is executed, it is determined whether the loop operation of step S107 is completed. If the loop operation in step S107 is completed, the next step is to execute S118; if the loop operation is not completed, the next step is to return to S107;

[0118] S118: Determine whether the error flag signal (err_flg) is 0, and print the correct output information (PASS) when err_flg is 0, and print the wrong output information (ERROR) when err_flg is not 0;

[0119] This ends the process.

[0120] Figure 4 This is a flowchart of a single write burst read of the entire space in half-word mode, which specifically includes the following steps:

[0121] S201: Obtain the address size and initial address corresponding to the address space manually defined in the macro definition file (define.sv);

[0122] S202: Assign data to user-defined variables in half-word mode;

[0123] S203: add 5 to the data word by word from 32'h12345678 (this data is artificially defined and will be used in subsequent data reading and comparison);

[0124] S204: Determine whether all addresses in the address space have been traversed;

[0125] S205: If all addresses in the address space have not been traversed, return to step S202;

[0126] S206: If all addresses in the address space have been traversed, a burst transfer is performed, and 0 is written in word mode to initialize all addresses;

[0127] S207: Loop through all address spaces. Since the access is in half-word mode, the total address space size is divided by 2 to calculate the number of half-words. The pseudo code is as follows: for (int k = 0; k < address size / 2; K++);

[0128] S208: Execute a single half-word type transfer, and write data to each half-word address;

[0129] S209: Execute burst transfer and read out all data in the effective address space in word mode;

[0130] S210: for the written address, compare and determine whether the variable and the read data are consistent according to the half-word mode;

[0131] S211: If they are consistent, print the correct output information (read in data is ok);

[0132] S212: If they are inconsistent, print the error output information (read data is err): print the expected data (indata) and the actual simulated read data (rdata) respectively, and increment the error flag signal (err_flg) by 1;

[0133] S213: For the address that has not been written, read the data in half-word (half-word) mode, and compare whether the read data is 0;

[0134] S214: If the read data is 0, print the correct output information (read indata is ok);

[0135] S215: If the read data is not 0, print the error output information (read data is err) and print the read data;

[0136] S216: address + 2, reading data makes the address increment by 2;

[0137] S217: After step S216 is executed, it is determined whether the loop operation in step S207 is completed. If the loop operation in step S207 is completed, the next step is to execute S218; if the loop operation in step S207 is not completed, the next step is to return to step S207;

[0138] S218: Determine whether the error flag signal (err_flg) is 0. When err_flg is 0, print the correct output information (PASS). When err_flg is not 0, print the wrong output information (ERROR).

[0139] This is the end of the process.

[0140] Figure 5 When all address spaces of static memory are initialized to 0, a flowchart of single writing and burst reading of all spaces and data comparison is performed in word mode. Specifically, the steps are as follows:

[0141] S301: Obtain the address size and initial address of the address space manually defined in the macro definition file (define.sv);

[0142] S302: Execute burst transfer, write 0 in word mode, and initialize all addresses;

[0143] S303: Loop through all address spaces. Since the access is in word mode, the total address space size is divided by 4 to calculate the number of words. The pseudo code is as follows: for (int k = 0; k < address size / 4; k++);

[0144] S304: Execute a single word transfer, and write the assigned variable into the corresponding address in word mode;

[0145] S305: Execute burst transfer and read out all valid address space data in word mode;

[0146] S306: Compare the written address by word to determine whether the read data is consistent with the written data;

[0147] S307: If the read data and the written data are consistent, print the correct output information (PASS);

[0148] S308: If the read data and the written data are inconsistent, the error output information (ERROR) is printed, and the expected data (indata) and the actual simulated read data (rdata) are printed respectively, and the error flag signal (err_flg) is incremented by 1;

[0149] S309: For the address that has not been written, read the data in word mode, and compare and determine whether the read data is 0;

[0150] S310: If the read data is 0, print the correct output information (PASS);

[0151] S311: If the read data is not 0, print the error output information (ERROR) and print the read data;

[0152] S312: In order to ensure that the written data in each address space is inconsistent, the written data is converted each time, with the last written data as the base, the hexadecimal number is incremented by 10, and the address is incremented by 4 (a 32-bit bus width), that is, data + 10, address + 4;

[0153] It should be noted that the above-mentioned increasing hexadecimal number can be any number and is not limited to 10 in the embodiment; the submitted address is fixed, and the address of a word is 4.

[0154] S313: After step 312, determine whether the loop operation in step S303 is completed. If the loop operation in step S303 is completed, the next step is to execute S314; if the loop operation in step S303 is not completed, return to step S303;

[0155] S314: Determine whether the error flag signal (err_flg) is 0, and if it is 0, print the correct output information (PASS), and if it is not 0, print the wrong output information (ERROR);

[0156] This is the end of the process.

[0157] Figure 6 When all address spaces of the static memory are initialized to all 1, a flowchart of single writing and burst reading of all spaces and data comparison in word mode is provided, which specifically includes the following steps:

[0158] S401: Input the starting address and ending address of the address space to be tested this time;

[0159] S402: Write 1 to all addresses in word mode to initialize;

[0160] S403: Read all address data in word mode and determine whether the address data is 1;

[0161] S404: If the address data is 1, print the correct output information (read indata is ok);

[0162] S405: If the address data is not 1, print the error output information (read data is err), and print the expected data (indata) and the actual simulated read data (rdata) respectively, and increment the error flag signal (err_flg) by 1;

[0163] S406: All address spaces are accessed in a loop according to the word mode. Because the access is in word mode, the total address space size is divided by 4 to calculate the number of words. The pseudo code is as follows: for(int k=0; k<address size / 4; k++;

[0164] S407: assign 32'h12345678 (this data is artificially defined arbitrary data, which will be used in subsequent reading and comparison) to the write operation parameter according to the word mode, and use incremental data from the second time onwards;

[0165] S408: Execute a single transfer, and write the assigned variable into the corresponding address in word mode;

[0166] S409: Execute burst transfer and read out the data of all valid address spaces defined in the previous steps in word mode;

[0167] S410: Compare the written address according to the word mode to determine whether the read data and the written data are consistent;

[0168] S411: If they are consistent, print the correct output information (read indata is ok);

[0169] S412: If they are inconsistent, print the error output information (read data is err): print the expected data (indata) and the actual simulated read data (rdata) respectively, and increment the error flag signal (err_flg) by 1;

[0170] S413: For the address that has not been written, read the data in word mode and compare whether the read data is 1;

[0171] S414: If it is 1, print the correct output information (read indata is ok); if it is not 1, print the wrong output information (read data is err), print the read data, and increment the error flag signal (err_flg) by 1;

[0172] S415: In order to ensure that the written data in each address space is inconsistent, the written data is converted each time, with the last written data as the base, the hexadecimal number is incremented by 10, and the address is incremented by 4 (a 32-bit bus width), that is, data + 10, address + 4;

[0173] S416: After step S415, determine whether the loop operation is completed. If the loop operation is completed, the next step is to execute S417; if the loop operation is not completed, return to step S406;

[0174] S417: Determine whether the error flag signal (err_flg) is 0. If it is 0, print the correct output information (read indata is ok); if it is not 0, print the wrong output information (read data is err);

[0175] This is the end of the process.

[0176] Based on the static memory area scan test method provided in the above embodiments, the embodiment of the present invention further provides a corresponding static memory area scan test device (abbreviated as scan test device). Figure 7 As shown, the scan test device includes one or more processors 301 , a communication interface 302 , a memory 303 and a communication bus 304 , wherein the processor 301 , the communication interface 302 , and the memory 303 communicate with each other via the communication bus 304 .

[0177] Memory 303, used for storing computer programs;

[0178] The processor 301 is used to implement each step of the above-mentioned static memory area scanning test method when executing the computer program stored in the memory 303.

[0179] The processor 301 may be a general-purpose processor, including a central processing unit, a network processor, etc.; it may also be a digital signal processor, an application-specific integrated circuit, a field programmable gate array, or other programmable logic devices, etc.

[0180] The memory 303 may include a large capacity static memory for data or instructions. For example, but not limitation, the memory 303 may include a hard disk drive, a floppy disk drive, a flash memory, an optical disk, a magneto-optical disk, a magnetic tape or a universal serial bus drive or a combination of two or more of these. In appropriate cases, the memory 303 may include a removable or non-removable (or fixed) medium. In a specific embodiment, the memory 303 is a non-volatile solid-state static memory. In a specific embodiment, the memory 303 includes a read-only static memory (ROM). In appropriate cases, the ROM may be a mask-programmed ROM, a programmable ROM (PROM), an erasable PROM (EPROM), an electrically erasable PROM (EEPROM), an electrically rewritable ROM (EAROM) or a flash memory or a combination of two or more of these.

[0181] The communication bus 304 includes hardware, software, or both for coupling the above components to each other. For example, the communication bus 304 may include an accelerated graphics port (AGP) or other graphics bus, an enhanced industry standard architecture (EISA) bus, a front side bus (FSB), a HyperTransport (HT) interconnect, an industry standard architecture (ISA) bus, an InfiniBand interconnect, a low pin count (LPC) bus, a static memory bus, a microchannel architecture (MCA) bus, a peripheral component interconnect (PCI) bus, a PCI-Express (PCI-X) bus, a serial advanced technology attachment (SATA) bus, a video electronics standard association local (VLB) bus, or other suitable buses or a combination of two or more of these.

[0182] Compared with the prior art, the static memory area scanning test method and device provided by the present invention propose and implement the full function coverage of the static memory area scanning test by building a verification environment based on UVM methodology, thereby realizing mixed access of different operation types, for example, various mixed and random operations such as word writing byte reading, single word writing byte continuous reading, single writing burst reading, etc. On the other hand, the static memory area scanning test process implemented by the present invention covers words, half words and bytes, which can ensure that different operation types have no effect on the address mapping relationship.

[0183] The static memory area scanning test method and equipment based on UVM methodology provided by the present invention are described in detail above. For those skilled in the art, any obvious changes made to it without departing from the essence of the present invention will constitute infringement of the patent right of the present invention and will bear corresponding legal liability.

Claims

1. A static memory area scanning test method based on UVM methodology, characterized in that The steps include: S101: Obtaining the address size and initial address corresponding to the defined address space; S102: Assign values ​​to user-defined variables by byte-by-byte operation; S103: increasing the target value in sequence from the target preset data in word mode; S104: Determine whether all addresses in the defined address space have been traversed; S105: If all addresses in the address space have not been traversed, return to step S102; S106: If all addresses in the address space have been traversed, a burst transfer is performed, and 0 is written in word mode to initialize all addresses; S107: cyclically access all address spaces according to the word mode; S108: Execute single-byte transmission and write data to each byte address; S109: Execute burst transfer and read out all data in the effective address space in word mode; S110: Compare the written address by bytes to determine whether the variable and the read data are consistent; S111: If they are consistent, print the correct output information; S112: If they are inconsistent, print the wrong output information, and print the expected data and the actual simulated read data respectively, and increment the error flag signal by 1; S113: for the address that has not been written, read the data in byte mode, and compare and determine whether the read data is 0; S114: If the read data is 0, print the correct output information; S115: If the read data is not 0, print the error output information, print the read data, and increment the error flag signal by 1; S116: Continue reading the address, and the address increases by 1; S117: Determine whether the loop operation of step S107 is completed. If the loop operation is completed, the next step is to execute S118; if the loop operation is not completed, the next step is to return to S107; S118: Determine whether the error flag signal is 0, and print correct output information when the error flag signal is 0, and print incorrect output information when the error flag signal is not 0.

2. The static memory area scan test method as claimed in claim 1, characterized in that Step S101 specifically includes: Get the address size and initial address corresponding to the address space defined in the macro definition file.

3. The static memory area scan test method as claimed in claim 1, characterized in that In step S103, the target value is 5.

4. The static memory area scan test method according to claim 1, characterized in that In step S107, the address size of the address space is divided by 4 to calculate the number of words.

5. A static memory area scanning test method based on UVM methodology, characterized in that The steps include: S201: Obtaining the address size and initial address corresponding to the defined address space; S202: Assign data to user-defined variables in half-word mode; S203: increasing the data word by word from the target preset data to the target value; S204: Determine whether all addresses in the address space have been traversed; S205: If all addresses in the address space have not been traversed, return to step S202; S206: If all addresses in the address space have been traversed, a burst transfer is performed, and 0 is written in word mode to initialize all addresses in the address space; S207: cyclically access all addresses in the address space according to the half-word mode; S208: Execute single half-word mode transmission, and write data to each half-word address; S209: Execute burst transfer and read out all data in the effective address space in word mode; S210: for the written address, compare and determine whether the variable and the read data are consistent according to the half-word mode; S211: If they are consistent, print the correct output information; S212: If they are inconsistent, print the error output information, and print the expected data and the actual simulated read data respectively, and increment the error flag signal by 1; S213: For the address that has not been written, read the data in word mode, and compare and determine whether the read data is 0; S214: If the read data is 0, print the correct output information; S215: If the read data is not 0, print the error output information, print the read data, and increment the error flag signal by 1; S216: increment the address by 2; S217: Determine whether the loop operation is finished. If the loop operation is finished, the next step is to execute S218; if the loop operation is not finished, the next step is to return to step S207; S218: Determine whether the error flag signal is 0. When the error flag signal is 0, print the correct output information. When the error flag signal is not 0, print the wrong output information.

6. A static memory area scanning test method based on UVM methodology, characterized in that The steps include: S301: Obtaining the address size and initial address corresponding to the defined address space; S302: Execute burst transfer, write 0 in word mode, and initialize all addresses; S303: cyclically access all address spaces according to the word mode; S304: Execute a single word transfer, and write the assigned variable into the corresponding address in word mode; S305: Execute burst transfer and read out all valid address space data in word mode; S306: for the written address, determine whether the read data and the written data are consistent according to word comparison; S307: If they are consistent, print the correct output information; S308: If they are inconsistent, print the error output information, and print the expected data and the actual simulated read data respectively, and increment the error flag signal by 1; S309: Determine the address that has not been written, read the data in word mode, and compare whether the read data is 0; S310: If the read data is 0, print the correct output information; S311: If the read data is not 0, print the error output information, print the read data, and increment the error flag signal by 1; S312: convert each written data, taking the last written data as the base, incrementing the hexadecimal number by 10, and incrementing the address by 4; S313: Determine whether the loop operation in step S303 is finished. If the loop operation is finished, the next step is to execute S314; if the loop operation in step S303 is not finished, return to step S303; S314: Determine whether the error flag signal is 0, and print correct output information when the error flag signal is 0, and print incorrect output information when the error flag signal is not 0.

7. A static memory area scanning test method based on UVM methodology, characterized in that The steps include: S401: Input the start address and end address of the address space to be tested; S402: Write 1 to all addresses in word mode to initialize; S403: Read all address data in word mode and determine whether the address data is 1; S404: If the address data is 1, print the correct output information; S405: If the address data is not 1, then print the error output information, and print the expected data and the actual simulated read data respectively, and increment the error flag signal by 1; S406: cyclically access all address spaces according to the word mode; S407: assigning values ​​to the custom variables according to the word mode, using incremental data starting from the second time; S408: Execute a single transfer, and write the assigned variable into the corresponding address in word mode; S409: Execute burst transfer and read out all valid address space data defined in the previous steps in word mode; S410: for the written address, determine whether the read data and the written data are consistent according to the word mode comparison; S411: If the read data and the written data are consistent, print the correct output information; S412: If the read data and the written data are inconsistent, then print the error output information, print the expected data and the actual simulated read data respectively, and increment the error flag signal by 1; S413: For the address that has not been written, read the data in word mode, and compare and determine whether the read data is 1; S414: If the read data is 1, print the correct output information; S415: If they are inconsistent, print the error output information, print the read data, and increment the error flag signal by 1; S416: convert each written data, taking the last written data as the base, increment the hexadecimal number, and increment the address by 4; S417: Determine whether the loop operation is finished. If the loop operation is finished, the next step is to execute S418; if the loop operation is not finished, return to step S406; S418: Determine whether the error flag signal is 0, and print correct output information when the error flag signal is 0; and print incorrect output information when the error flag signal is not 0.

8. The static memory area scan test method according to claim 7, wherein: In step S406, the address size of the address space is divided by 4 to calculate the number of words.

9. A static memory area scanning test device, characterized in that The invention comprises a processor and a memory, wherein the processor reads a computer program in the memory and is used to execute the static memory area scanning test method according to any one of claims 1 to 8.