Target text search method supporting macro expansion, electronic device, and medium

Abstract

The present application relates to the technical field of electronic design automation, and particularly relates to a target text search method supporting macro expansion, an electronic device and a medium, the method first acquires a macro expansion code file corresponding to an original code file, and records the line number mapping relationship of the macro expansion code line in the original code file and in the macro expansion code file, in the target text search process, the first search position possibly being the position of the target text is acquired in the original code file, and the second search position possibly being the position of the target text is acquired in the macro expansion code file, then the search position closest to the search starting position in the search direction is selected from the first search position and the second search position as the target search position, and the text to be searched corresponding to the target search position is determined as the target text, and the target text search efficiency supporting macro expansion is improved.

Description

Technical Field

[0001] This invention relates to the field of Electronic Design Automation (EDA) technology, and more particularly to a method, electronic device, and medium for finding target text that supports macro expansion. Background Technology

[0002] In Verilog, macros offer great flexibility, significantly improving coding efficiency. However, searching within macro expansions is also essential. Most existing debugging tools typically only support searching the raw Verilog file, not searching based on macro expansions. Some tools support localized searches of macro expansions, but not global searches. Since macros can replace any code structure, in Verilog files containing macros, the target text might be within a macro expansion, but the search cannot be performed within that macro. Current methods usually require manually expanding the macro text and examining it individually, resulting in inefficient target text searches. Therefore, improving the efficiency of finding target text that supports macro expansions is a pressing technical problem. Summary of the Invention

[0003] The purpose of this invention is to provide a method, electronic device, and medium for finding target text that supports macro expansion, thereby improving the efficiency of finding target text that supports macro expansion.

[0004] According to a first aspect of the present invention, a method for finding target text that supports macro expansion is provided, comprising: Step S1: Obtain the macro expansion code file corresponding to the original code file, and record the mapping relationship between the line numbers of the macro expansion code lines in the original code file and the line numbers in the macro expansion code file. The original code file contains macro references, and the macro expansion code file is used to store the macro expansion content corresponding to all macro references in the original code file in sequence. Step S2: Starting from the first starting position in the original code file, obtain the position information of the text to be searched that is closest to the first starting position in the search direction as the first search position. The first starting position is the current search starting position corresponding to the original code file. The search direction includes forward search and backward search. Step S3: Based on the first starting position, search direction, and the mapping relationship between the line numbers of the macro expanded code lines in the original code file and the macro expanded code file, obtain the search starting position in the macro expanded code file as the second starting position; Step S4: In the macro expansion code file, starting from the second starting position, obtain the position information of the text to be searched that is closest to the second starting position in the search direction as the second search position; Step S5: Select the search position that is closest to the search start position in the search direction from the first search position and the second search position as the target search position, and determine the text to be searched corresponding to the target search position as the target text.

[0005] According to a second aspect of the present invention, an electronic device is provided, comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, the instructions being configured to perform the method described in the first aspect of the present invention.

[0006] According to a third aspect of the present invention, a computer-readable storage medium is provided, storing computer-executable instructions for performing the method described in the first aspect of the present invention.

[0007] Compared with existing technologies, this invention has significant advantages and beneficial effects. Through the above technical solution, the target text search method, electronic device, and medium supporting macro expansion provided by this invention achieve considerable technological advancement and practicality, and have broad industrial application value. It has at least the following beneficial effects: This invention first obtains the macro expansion code file corresponding to the original code file and records the mapping relationship between the line numbers of the macro expansion code lines in the original code file and the macro expansion code file. During the target text search process, it obtains both a first search position in the original code file and a second search position in the macro expansion code file that may be the location of the target text. Then, it selects the search position closest to the search start position in the search direction from the first and second search positions as the target search position, and determines the text to be searched corresponding to the target search position as the target text. This invention enables rapid searching of information within macros, supports full-scale retrieval of macro text expansion content, and includes the content of both the original code lines and macro expansion lines. It improves the efficiency of finding target text that supports macro expansion and greatly helps and enhances macro content debugging in debugging tools. Attached Figure Description

[0008] To more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0009] Figure 1A flowchart illustrating a target text search method supporting macro expansion, provided in an embodiment of the present invention. Detailed Implementation

[0010] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0011] According to a first aspect of the present invention, a method for finding target text that supports macro expansion is provided, such as... Figure 1 As shown, it includes: Step S1: Obtain the macro expansion code file corresponding to the original code file, and record the mapping relationship between the line numbers of the macro expansion code lines in the original code file and the line numbers in the macro expansion code file. The original code file contains macro references, and the macro expansion code file is used to store the macro expansion content corresponding to all macro references in the original code file in sequence.

[0012] It should be noted that at least one line of original code in the original code file contains at least one macro reference. The macro expansion code file stores the macro expansion content corresponding to all macro references in the original code file in sequence. This means that the macro expansion content corresponding to all macro references in the original code file is stored in the macro expansion code file according to the order of the original code lines and the order of the macro expansion code lines after each original code line containing a macro reference is expanded. Macro expansion text refers to the text after replacing the original macro text with the macro. The mapping relationship between the line numbers of macro expansion code lines in the original code file and in the macro expansion code file can specifically include a mapping from the original code file to the macro expansion code file, and a mapping from the macro expansion code file to the original code file, thereby enabling bidirectional jumps and improving search performance.

[0013] Step S2: Starting from the first starting position in the original code file, obtain the position information of the text to be searched that is closest to the first starting position in the search direction as the first search position. The first starting position is the current search starting position corresponding to the original code file. The search direction includes forward search and backward search.

[0014] The text to be searched can be a string. Specifically, a preset search engine can be invoked, and the original code file, the first starting position, and the search direction can be input. The search engine will retrieve the position information of the text to be searched that is closest to the first starting position in the search direction from the first starting position in the original code file, and use this as the first search position. The first starting position specifically includes the row number and column number corresponding to the current search starting position in the original code file.

[0015] Step S3: Based on the first starting position, the search direction, and the mapping relationship between the line numbers of the macro expanded code lines in the original code file and the macro expanded code file, obtain the search starting position in the macro expanded code file as the second starting position.

[0016] It should be noted that in this embodiment of the invention, when searching for target text, a global search is required. Therefore, it is necessary to search in both the original code file and the macro expansion code file. However, the first starting position is the current search starting position corresponding to the original code file. Therefore, it is necessary to first convert it into the search starting position in the macro expansion code file as the second starting position.

[0017] Step S4: In the macro expansion code file, starting from the second starting position, obtain the position information of the text to be searched that is closest to the second starting position in the search direction, and use it as the second search position.

[0018] Specifically, a preset search engine can be invoked, and the macro expansion code file, the second starting position, and the search direction can be input. The search engine will retrieve the location information of the text to be searched that is closest to the second starting position in the search direction from the second starting position in the macro expansion code file, and use it as the second search position.

[0019] Step S5: Select the search position that is closest to the search start position in the search direction from the first search position and the second search position as the target search position, and determine the text to be searched corresponding to the target search position as the target text.

[0020] As one embodiment, step S1 includes: Step S11: Obtain a list of all macro information in the original code file {A1,A2,...,A...} n ,...,A N}, A n This is the nth macro information in the original code file, where n ranges from 1 to N, and N is the total number of macro references contained in the original code file. The macro information includes the macro reference identifier and the corresponding macro expansion text.

[0021] Step S12: Traverse the macro information list and obtain the A corresponding to each original code line containing a macro reference in the original code file. n .

[0022] Understandably, the original line of code containing macro references may correspond to one or more A's. n .

[0023] Step S13: Based on A corresponding to each original code line containing macro references nReplace all macro references in each original line of code containing macro references with the macro expanded text, generating the macro expanded text corresponding to each original line of code containing macro references.

[0024] Step S14: Store the macro expanded text corresponding to each original code line containing macro references line by line into the macro expanded code file.

[0025] Step S15: Record the mapping relationship between the line number of each line of macro expanded text in the original code file and the line number in the macro expanded code file {B, C+D}, where B represents the line number of the macro expanded text line in the macro expanded code file, C+D represents the line number of the macro expanded text line in the original code file, C represents the line number of the original code line corresponding to the macro expanded text, and D represents the line number of the macro expanded text line in the corresponding macro expanded text.

[0026] Taking the macro reference contained in line 55 of the original code as an example, the corresponding macro expanded text is only one line, and the corresponding macro expanded text is stored in line 6 of the macro expanded code file. In this example, B=6, C=55, D=1, and the corresponding mapping relationship is {6, 55+1}.

[0027] As one embodiment, in step S2, the line forward from the first line of the original code file is the last line of the original code file, and the line backward from the last line of the original code file is the first line of the original code file. It can be understood that, with the above settings, during the forward search, if the first line of the original code file is found, the next line will start searching from the last line of the original code file. During the backward search, if the last line of the original code file is found, the next line will start searching from the first line of the original code file.

[0028] As one embodiment, step S3 includes: Step S31: Create a query position X+0 based on the first starting position, where X is the line number corresponding to the first starting position in the original code file.

[0029] Step S32: In the mapping relationship between the line numbers of the macro expanded code line in the original code file and the line number in the macro expanded code file, obtain the B corresponding to the C+D closest to X+0 along the search direction and use it as the search starting line number E in the macro expanded code file.

[0030] Step S33: If the search direction is backward, then the first column of row E is determined as the second starting position; if the search direction is forward, then the first column of the next row below row E is determined as the second starting position.

[0031] It should be noted that since the column number of the converted starting position starts from 1, if searching forward, the first column of the row below row E should be determined as the second starting position. This can avoid missed checks and improve the accuracy of the search results.

[0032] As one embodiment, in step S4, the line forward from the first line of the macro expansion code file is the last line of the macro expansion code file, and the line backward from the last line of the macro expansion code file is the first line of the macro expansion code file. It can be understood that, with the above settings, during the forward search, if the first line of the macro expansion code file is found, the next line will start searching from the last line of the macro expansion code file. During the backward search, if the last line of the macro expansion code file is found, the next line will start searching from the first line of the macro expansion code file.

[0033] As one embodiment, both the first search position and the second search position include a row number and a column number. Specifically, the search position can be the starting position of the text to be searched, or it can be the ending position of the text to be searched. The column number of the same line of macro-expanded text is consistent in the original code file and the macro-expanded code file. Step S5 includes: Step S51: Obtain the first absolute position value corresponding to the first search position in the original code file.

[0034] Step S52: Based on the mapping relationship between the line numbers in the macro expanded text in the original code file and the line numbers in the macro expanded code file, obtain the third position information corresponding to the second position information in the original code file.

[0035] Step S53: Obtain the second absolute position value corresponding to the third position information in the original code file.

[0036] Step S54: Obtain the current search start absolute position value corresponding to the first starting position in the original code file.

[0037] It should be noted that the absolute position value is equal to the total number of characters in all lines preceding the current calculation position in the original code file plus the column number of the current calculation position. Understandably, to maintain consistency, when calculating the total number of characters in all lines preceding the current calculation position in the original code file, any macro expansion text should also be included.

[0038] Step S55: Select the target search position from the first search position and the second search position based on the search direction, the first absolute position value, the second absolute position value, and the current search start absolute position value.

[0039] Step S56: Determine the text to be searched corresponding to the target search location as the target text.

[0040] As one embodiment, if the search direction is backward, step S55 includes: Step S551: If both the first absolute position value and the second absolute position value are greater than or both are less than the current search starting absolute position value, then the search position corresponding to the absolute position with the smaller value between the first absolute position value and the second absolute position value is determined as the target search position.

[0041] It should be noted that, when searching backwards, if both the first and second absolute position values ​​are greater than the current search starting absolute position value, it means that both the first and second search positions are after the first starting position, and the search process has not passed the last row. If both the first and second absolute position values ​​are less than the current search starting absolute position value, it means that the search process has passed the last row and then started searching again from the first row. In both cases, the search position corresponding to the smaller of the first and second absolute position values ​​is the target search position.

[0042] Step S552: If the first absolute position value is greater than the current search start absolute position value and the second absolute position value is less than the current search start absolute position value, then the first search position is determined as the target search position.

[0043] It should be noted that, when searching backwards, if the first absolute position value is greater than the current search start absolute position value and the second absolute position value is less than the current search start absolute position value, it means that the first search position is after the first start position and has not passed the last row during the search. The second search position has passed the last row and starts searching again from the first row, and is located before the first start position. In this case, the first search position is the target search position.

[0044] Step S553: ​​If the first absolute position value is less than the current search start absolute position value and the second absolute position value is greater than the current search start absolute position value, then the second search position is determined as the target search position.

[0045] It should be noted that, when searching backwards, if the first absolute position value is less than the current search start absolute position value and the second absolute position value is greater than the current search start absolute position value, it means that the second search position is after the first start position and has not passed the last row during the search. If the first search position has passed the last row and then starts searching again from the first row, it is located before the first start position. In this case, the second search position is the target search position.

[0046] As one embodiment, if the search direction is forward, step S55 includes: Step C551: If both the first absolute position value and the second absolute position value are greater than or both are less than the current search starting absolute position value, then the search position corresponding to the absolute position with the larger value between the first absolute position value and the second absolute position value is determined as the target search position.

[0047] It should be noted that, in the case of a forward search, if both the first and second absolute position values ​​are greater than the current search starting absolute position value, it means that both the first and second search positions are after the first starting position, indicating that the search process has passed through the first row and started from the last row again. If both the first and second absolute position values ​​are less than the current search starting absolute position value, it means that both the first and second search positions are before the first starting position, and the search process has not passed through the first row. In this case, the search position corresponding to the absolute position with the larger of the first and second absolute position values ​​is the target search position. Step C552: If the first absolute position value is greater than the current search start absolute position value and the second absolute position value is less than the current search start absolute position value, then the second search position is determined as the target search position.

[0048] It should be noted that, in the case of a forward search, if the first absolute position value is greater than the current search start absolute position value and the second absolute position value is less than the current search start absolute position value, it means that the first search position is after the first start position, and the search process has passed through the first row and started from the last row again. The second search position is before the current search start absolute position, and the search process has not passed through the first row. In this case, the second search position is the target search position.

[0049] Step C553: If the first absolute position value is less than the current search start absolute position value and the second absolute position value is greater than the current search start absolute position value, then the first search position is determined as the target search position.

[0050] It should be noted that, in the case of a forward search, if the first absolute position value is less than the current search start absolute position value and the second absolute position value is greater than the current search start absolute position value, it means that the first search position is before the first start position and the search process has not passed the first row. The second search position is after the current search start absolute position, and the search process has passed the first row and then starts searching from the last row. In this case, the first search position is the target search position.

[0051] As one embodiment, the step S5 is followed by: Step S6: Jump to the target search location and mark the target text corresponding to the target search location in the display interface using a preset first annotation method. The display interface is used to present the original code or the original code after macro expansion.

[0052] Specifically, the target text can be highlighted using the preset first color.

[0053] As one embodiment, the step S6 is followed by: Step S7: Search for all text to be searched within the visible range of the display interface, and annotate all text to be searched in the display interface using a preset second annotation method. The first annotation method and the second annotation method are different annotation methods.

[0054] Specifically, all text to be searched can be obtained by highlighting the text within the visible range using the preset second color. However, it is understandable that the text to be searched, which is identified as the target text, is not marked with the preset first annotation method but with the preset second annotation method.

[0055] This invention first obtains the macro expansion code file corresponding to the original code file and records the line number mapping relationship between the macro expansion code lines in the original code file and the macro expansion code file. During the target text search process, it obtains both a first search position that may be the location of the target text in the original code file and a second search position that may be the location of the target text in the macro expansion code file. Then, it selects the search position closest to the search start position in the search direction from the first and second search positions as the target search position, and determines the text to be searched corresponding to the target search position as the target text. This invention enables rapid search of information within macros, supports full retrieval of macro text expansion content, and includes the content of both the original code lines and macro expansion lines. It improves the efficiency of target text search supporting macro expansion and greatly helps and enhances macro content debugging in debugging tools.

[0056] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention pertains. The terminology used herein in the description of this invention is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. The term "and / or" as used herein includes any and all combinations of one or more of the associated listed items.

[0057] It should be noted that some exemplary embodiments are described as processes or methods depicted as flowcharts. Although the flowcharts describe the steps as sequential processes, many of these steps can be performed in parallel, concurrently, or simultaneously. Furthermore, the order of the steps can be rearranged. A process can be terminated when its operation is complete, but it may also have additional steps not included in the figures. A process can correspond to a method, function, procedure, subroutine, subroutine, etc.

[0058] This invention also provides an electronic device, including: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, the instructions being configured to perform the method described in this invention.

[0059] This invention also provides a computer-readable storage medium storing computer-executable instructions for performing the methods described in this invention.

[0060] The above description is merely a preferred embodiment of the present invention and is not intended to limit the present invention in any way. Although the present invention has been disclosed above with reference to preferred embodiments, it is not intended to limit the present invention. Any person skilled in the art can make some modifications or alterations to the above-disclosed technical content to create equivalent embodiments without departing from the scope of the present invention. Any simple modifications, equivalent changes, and alterations made to the above embodiments based on the technical essence of the present invention without departing from the scope of the present invention shall still fall within the scope of the present invention.

Claims

1. A method for finding target text that supports macro expansion, characterized in that, include: Step S1: Obtain the macro expansion code file corresponding to the original code file, and record the mapping relationship between the line numbers of the macro expansion code lines in the original code file and the line numbers in the macro expansion code file. The original code file contains macro references. The macro expansion code file is used to store the macro expansion content corresponding to all macro references in the original code file according to the sorting of the original code lines and the order of the macro expansion code lines after each original code line containing a macro reference is expanded. The mapping relationship between the line numbers of the macro expansion code lines in the original code file and the line numbers in the macro expansion code file specifically includes the mapping from the original code file to the macro expansion code file and the mapping from the macro expansion code file to the original code file. Step S2: Starting from the first starting position in the original code file, obtain the position information of the text to be searched that is closest to the first starting position in the search direction as the first search position. The first starting position is the current search starting position corresponding to the original code file. The search direction includes forward search and backward search. Step S3: Based on the first starting position, search direction, and the mapping relationship between the line numbers of the macro expanded code lines in the original code file and the macro expanded code file, obtain the search starting position in the macro expanded code file as the second starting position; Step S4: In the macro expansion code file, starting from the second starting position, obtain the position information of the text to be searched that is closest to the second starting position in the search direction as the second search position; Step S5: Select the search position that is closest to the search start position in the search direction from the first search position and the second search position as the target search position, and determine the text to be searched corresponding to the target search position as the target text; Step S1 includes: Step S11: Obtain a list of all macro information in the original code file {A1,A2,...,A...} n ,...,A N }, A n This is the nth macro information in the original code file, where n ranges from 1 to N, and N is the total number of macro references contained in the original code file. The macro information includes the macro reference identifier and the corresponding macro expansion text. Step S12: Traverse the macro information list and obtain the A corresponding to each original code line containing a macro reference in the original code file. n ; Step S13: Based on A corresponding to each original code line containing macro references n Replace all macro references in each original line of code containing macro references with macro expanded text to generate macro expanded text for each original line of code containing macro references; Step S14: Store the macro expanded text corresponding to each original code line containing macro references line by line into the macro expanded code file; Step S15: Record the mapping relationship between the line number of each line of macro expanded text in the original code file and the line number in the macro expanded code file {B, C+D}, where B represents the line number of the macro expanded text line in the macro expanded code file, C+D represents the line number of the macro expanded text line in the original code file, C represents the line number of the original code line corresponding to the macro expanded text, and D represents the line number of the macro expanded text line in the corresponding macro expanded text.

2. The method according to claim 1, characterized in that, In step S2, the line forward from the first line of the original code file becomes the last line of the original code file, and the line backward from the last line of the original code file becomes the first line of the original code file.

3. The method according to claim 1, characterized in that, Step S3 includes: Step S31: Create a query position X+0 based on the first starting position, where X is the line number corresponding to the first starting position in the original code file; Step S32: In the mapping relationship between the line numbers of the macro expanded code line in the original code file and the line number in the macro expanded code file, obtain the B corresponding to the C+D closest to X+0 along the search direction and use it as the search starting line number E in the macro expanded code file; Step S33: If the search direction is backward, then the first column of row E is determined as the second starting position; if the search direction is forward, then the first column of the next row below row E is determined as the second starting position.

4. The method according to claim 2, characterized in that, In step S4, the line forward from the first line of the macro expansion code file is the last line of the macro expansion code file, and the line backward from the last line of the macro expansion code file is the first line of the macro expansion code file.

5. The method according to claim 4, characterized in that, Both the first and second search positions include row and column numbers. The column number of the same line of macro expanded text is consistent in both the original code file and the macro expanded code file. Step S5 includes: Step S51: Obtain the first absolute position value corresponding to the first search position in the original code file; Step S52: Based on the mapping relationship between the line numbers in the macro expanded text in the original code file and the line numbers in the macro expanded code file, obtain the third position information corresponding to the second position information in the original code file; Step S53: Obtain the second absolute position value corresponding to the third position information in the original code file; Step S54: Obtain the current search start absolute position value corresponding to the first starting position in the original code file; Step S55: Select the target search position from the first search position and the second search position based on the search direction, the first absolute position value, the second absolute position value, and the current search start absolute position value; Step S56: Determine the text to be searched corresponding to the target search location as the target text.

6. The method according to claim 5, characterized in that, If the search direction is backward, step S55 includes: Step S551: If both the first absolute position value and the second absolute position value are greater than or both are less than the current search starting absolute position value, then the search position corresponding to the absolute position with the smaller value between the first absolute position value and the second absolute position value is determined as the target search position. Step S552: If the first absolute position value is greater than the current search start absolute position value and the second absolute position value is less than the current search start absolute position value, then the first search position is determined as the target search position; Step S553: ​​If the first absolute position value is less than the current search start absolute position value and the second absolute position value is greater than the current search start absolute position value, then the second search position is determined as the target search position.

7. The method according to claim 5, characterized in that, If the search direction is forward, step S55 includes: Step C551: If both the first absolute position value and the second absolute position value are greater than or both are less than the current search starting absolute position value, then the search position corresponding to the absolute position with the larger value between the first absolute position value and the second absolute position value is determined as the target search position. Step C552: If the first absolute position value is greater than the current search start absolute position value and the second absolute position value is less than the current search start absolute position value, then the second search position is determined as the target search position; Step C553: If the first absolute position value is less than the current search start absolute position value and the second absolute position value is greater than the current search start absolute position value, then the first search position is determined as the target search position.

8. An electronic device, characterized in that, include: At least one processor; And, a memory communicatively connected to the at least one processor; The memory stores instructions that are executed by the at least one processor, the instructions being configured to perform the method as described in any one of claims 1-7.

9. A computer-readable storage medium, characterized in that, The device stores computer-executable instructions for performing the method as described in any one of claims 1-7.

Images