CN116627846A - Method, electronic device and medium for determining position information of target call identifier - Google Patents
Method, electronic device and medium for determining position information of target call identifier Download PDFInfo
- Publication number
- CN116627846A CN116627846A CN202310892684.XA CN202310892684A CN116627846A CN 116627846 A CN116627846 A CN 116627846A CN 202310892684 A CN202310892684 A CN 202310892684A CN 116627846 A CN116627846 A CN 116627846A
- Authority
- CN
- China
- Prior art keywords
- position information
- identifier
- target
- call
- calling
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 38
- 230000006870 function Effects 0.000 claims description 13
- 230000009191 jumping Effects 0.000 claims description 6
- 239000000523 sample Substances 0.000 claims 2
- 239000000758 substrate Substances 0.000 claims 2
- 238000012795 verification Methods 0.000 abstract description 7
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000001960 triggered effect Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/36—Preventing errors by testing or debugging software
- G06F11/362—Software debugging
- G06F11/3624—Software debugging by performing operations on the source code, e.g. via a compiler
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/36—Preventing errors by testing or debugging software
- G06F11/362—Software debugging
- G06F11/366—Software debugging using diagnostics
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/30—Circuit design
- G06F30/32—Circuit design at the digital level
- G06F30/33—Design verification, e.g. functional simulation or model checking
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computer Hardware Design (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Quality & Reliability (AREA)
- Evolutionary Computation (AREA)
- Geometry (AREA)
- Debugging And Monitoring (AREA)
Abstract
The invention relates to the technical field of chips, in particular to a method, electronic equipment and medium for determining position information of a target call identifier, which comprises the following steps of S1, creating a corresponding jump list for each call identifier; step S2, acquiring a target calling identifier from a chip code definition area, if a jump list corresponding to the target calling identifier is not empty, executing step S3, otherwise, executing step S4; s3, determining the position information of the calling identifier currently arranged at the last position in the jump list corresponding to the target calling identifier as the position information of the chip code target calling identifier; and S4, traversing the position information corresponding to all the target call identifiers, and determining the position information of the target call identifier with the highest call priority as the position information of the target call identifier of the chip code. The invention can rapidly and accurately determine the position information of the target call identifier, and improves the efficiency of chip design and chip verification.
Description
Technical Field
The present invention relates to the field of chip technologies, and in particular, to a method, an electronic device, and a medium for determining location information of a target call identifier.
Background
In chip design and chip verification processes, it is often necessary to view at which locations in the code a function, task or class is called and to determine location information identified by the target call to view the relevant code. The prior art cannot automatically determine the position information of the target call identifier, and generally needs to guess that the target call identifier is likely to be called through global search keywords, but the search is performed in a relatively complex chip design, so that the time consumption is huge, the final search result may not be the position information of the target call identifier, the jump accuracy cannot be ensured, and the chip design and chip verification efficiency is reduced. Therefore, how to quickly and accurately determine the position information of the target call identifier, and improve the efficiency of chip design and chip verification becomes a technical problem to be solved urgently.
Disclosure of Invention
The invention aims to provide a method, electronic equipment and medium for determining the position information of a target call identifier, which can rapidly and accurately determine the position information of the target call identifier and improve the efficiency of chip design and chip verification.
According to a first aspect of the present invention, there is provided a method of determining location information of a destination call identifier, comprising:
step S1, creating a corresponding jump list for each calling identifier, wherein each jump list is initially empty, when the calling identifier is called, acquiring the position information of the calling identifier, and sequentially storing the position information of the calling identifier into the corresponding jump list according to the order of executing the viewing definition operation;
step S2, acquiring a target calling identifier from a chip code definition area, if a jump list corresponding to the target calling identifier is not empty, executing a step S3, otherwise, executing a step S4;
step S3, determining the position information of the calling identifier currently arranged at the tail position in the jump list corresponding to the target calling identifier as the position information of the chip code target calling identifier, moving the position information of the calling identifier currently arranged at the tail position in the jump list corresponding to the target calling identifier to the head position of the jump list corresponding to the target calling identifier, jumping to the position corresponding to the position information of the target calling identifier, and returning to the execution step S2;
and S4, compiling the chip code to obtain the position information corresponding to all the target calling identifiers, traversing the position information corresponding to all the target calling identifiers, determining the position information of the target calling identifier with the highest calling priority as the position information of the target calling identifier of the chip code, jumping to the position corresponding to the position information of the target calling identifier, and returning to the execution step S2.
According to a second aspect of the present invention, there is provided an electronic device comprising: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor, the instructions being arranged to perform the method according to the first aspect of the invention.
According to a third aspect of the present invention there is provided a computer readable storage medium storing computer executable instructions for performing the method of the first aspect of the present invention.
Compared with the prior art, the invention has obvious advantages and beneficial effects. By means of the technical scheme, the method, the electronic equipment and the medium for determining the position information of the target call identifier can achieve quite technical progress and practicality, and have wide industrial utilization value, and the method and the medium have at least the following beneficial effects:
the invention creates the corresponding jump list by setting the call identifier, determines the position information of the target call identifier based on the jump list for the call identifier which is not empty in the jump list, and determines the position information of the target call identifier based on the priority in the call identifier which is empty in the jump list, thereby being capable of rapidly and accurately determining the position information of the target call identifier and improving the efficiency of chip design and chip verification.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for the description of the embodiments will be briefly described below, and it is apparent that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flowchart of a method for determining location information of a target call identifier according to an embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to fall within the scope of the invention.
The embodiment of the invention provides a method for determining position information of a target call identifier, which is shown in fig. 1 and comprises the following steps:
step S1, creating a corresponding jump list for each calling identifier, wherein each jump list is initially empty, when the calling identifier is called, acquiring the position information of the calling identifier, and sequentially storing the position information of the calling identifier into the corresponding jump list according to the order of executing the viewing definition operation.
It should be noted that, the jump list corresponding to each call identifier records the location information and the trigger sequence of the jump identifier triggering the check definition operation. The calling code and the definition code corresponding to each calling identifier may be located in the same code file or may be located in different code files. And the same code file may contain multiple call sites corresponding to the same call identifier. The call is identified as a function name, task name, or class name.
And S2, acquiring a target calling identifier from a chip code definition area, executing the step S3 if a jump list corresponding to the target calling identifier is not empty, and executing the step S4 if not.
It should be noted that, the scene that needs to jump back to the calling location includes at least two kinds, one kind triggers the view definition operation for the calling location, and then jumps back from the view definition location to the location that triggers the view definition operation. Alternatively, the previous call identifier does not jump to the definition code operation, but rather jumps directly from the definition code location to a target call location. In the prior art, automatic accurate skip cannot be realized, keyword retrieval is needed, selection is performed according to experience, accuracy cannot be guaranteed, and skip efficiency is low.
And S3, determining the position information of the calling identifier currently arranged at the tail position in the jump list corresponding to the target calling identifier as the position information of the chip code target calling identifier, moving the position information of the calling identifier currently arranged at the tail position in the jump list corresponding to the target calling identifier to the head position of the jump list corresponding to the target calling identifier, jumping to the position corresponding to the position information of the target calling identifier, and returning to the execution step S2.
It should be noted that, based on the set jump list, the position information of the call identifier of the target call identifier is determined in a form of first-in last-out, and the position information of the selected target call identifier is moved to the first position of the jump list corresponding to the target call identifier, so that the situation that the definition operation is triggered to be checked is used as the situation that the previous call identifier is not jumped to the definition code is not mistakenly processed, and the accuracy of determining the position information of the target call identifier is improved.
And S4, compiling the chip code to obtain the position information corresponding to all the target calling identifiers, traversing the position information corresponding to all the target calling identifiers, determining the position information of the target calling identifier with the highest calling priority as the position information of the target calling identifier of the chip code, jumping to the position corresponding to the position information of the target calling identifier, and returning to the execution step S2.
When the jump list corresponding to the target call identifier is empty, it is indicated that there is no position triggering the viewing definition operation at present, so that the position information of the target call identifier cannot be determined through historical triggering of the viewing definition operation, and the position information of the target call identifier needs to be determined through calling identifier priority information, so that the accuracy of determining the position information of the target call identifier is improved.
As an embodiment, the step S1 includes:
and S11, acquiring a view definition instruction based on the chip code.
And step S12, analyzing the view definition instruction, and acquiring a calling identifier corresponding to the view definition instruction and position information of the calling identifier, wherein the position information of the calling identifier comprises code file information and code line information.
And step S13, sequentially storing the position information of the calling identifier corresponding to the viewing definition instruction into a skip list corresponding to the viewing definition instruction according to the order of executing the viewing definition operation.
The generation of the viewing definition instruction can be triggered by clicking on a calling position of a function, task or class of the chip code. The information including the code file and the code line information may be obtained directly and will not be described here.
Because the position information of the calling identifier currently arranged at the last position in the jump list corresponding to the target calling identifier is moved to the first position of the jump list corresponding to the target calling identifier, the capacity of the jump list is limited, so that the jump list is full along with the increase of the number of the position information of the calling identifier, and the position information of the calling identifier is deleted directly from the first position of the jump list after the jump list is full, and the method specifically comprises the following steps:
and step S10, when the number of the position information of the calling identifier in the jump list exceeds a preset buffer number threshold, deleting the position information of the calling identifier from the first position of the jump list, so that the position information in the jump list is equal to the preset buffer number threshold.
Under the condition that the jump list is full, deleting the position information of the position corresponding to the position where the jump from the definition is executed or storing the position information with the longest time in the jump list in the position corresponding to the position where the jump is not executed, thereby ensuring that the new position information of the calling identifier can be normally stored in the jump list, ensuring that the position information of the target calling identifier which is jumped back each time corresponds to the position of the latest check definition operation, and improving the accuracy of the position information of the target calling identifier.
The function and the task may be provided with the same priority determination method of the position information, and the priority determination method of the position information of the class is different from the function and the task, and the following embodiments describe the priorities of the function and the task and the position information of the class in detail.
As an embodiment, the target call is identified as a function name or a task name, and the step S4 includes:
step S41, compiling the chip code to obtain the position information { A } corresponding to all the target call identifiers 1 ,A 2 ,…,A n ,…,A N },A n And (3) the position information corresponding to the N-th target call identifier in the chip code, wherein the value range of N is 1 to N, and N is the total number of the position information corresponding to the target call identifier in the chip code.
Acquiring position information { A } corresponding to all target call identifiers from a preset database based on the target call identifiers 1 ,A 2 ,…,A n ,…,A N And storing the position information corresponding to all the calling identifiers in the preset database in advance.
Step S42, setting n=1, and setting the current first position information B to be compared 1 =A n Current second position information B to be compared 2 =A n+1 Step S43 is performed.
Step S43, obtaining the instance module identifier corresponding to the target call identifier from the chip code definition area, if B 1 And B 2 The instance module identifier corresponding to only one piece of position information is the same as the corresponding instance module identifier, B is carried out 1 And B 2 The same location information as the corresponding instance module identity is determined as the current intermediate location information C n Step S45 is performed, otherwise step S44 is performed.
It should be noted that the decision policy of step S43 is an example where the call in the example of the same module as the function/task is better than that of a different module.
Step S44, obtaining the current debug viewing file identification corresponding to the target call identification from the chip code definition area, if B 1 And B 2 The file identification corresponding to only one position information is the same as the corresponding current debugging and viewing file identification, B is carried out 1 And B 2 The position information which is the same as the corresponding current debug viewing file identification is determined to be the current intermediate position information C n Otherwise, from B 1 And B 2 Randomly selects one as the current intermediate position information C n 。
It should be noted that, the decision policy in step S44 is that the call in the file currently being debugged and viewed is better than the call in the other files.
Step S45, if n=n-1, C n And determining the position information of the target call identifier, otherwise, setting n=n+1, and returning to the step S41.
And through the step S43 and the step S44, the position information is pairwise aligned, the judgment is carried out according to the priority judgment sequence set in the step S43 and the step S44, and finally, the position information of the target call identifier of the function or the task is determined, so that the accuracy of determining the position information of the target call identifier is improved.
As an embodiment, the target call is identified as a class name, and the step S4 includes:
step S401, compiling the chip code to obtain position information { A } corresponding to all target call identifiers 1 ,A 2 ,…,A n ,…,A N },A n And (3) the position information corresponding to the N-th target call identifier in the chip code, wherein the value range of N is 1 to N, and N is the total number of the position information corresponding to the target call identifier in the chip code.
Acquiring position information { A } corresponding to all target call identifiers from a preset database based on the target call identifiers 1 ,A 2 ,…,A n ,…,A N Pre-storing all calls in the preset databaseCorresponding location information is identified.
Step S402, setting n=1, and setting the current first position information B to be compared 1 =A n Current second position information B to be compared 2 =A n+1 Step S403 is performed.
Step S403, if B 1 And B 2 One of which is to define only the unused instance and the other is the actually used instance, then the actually used instance is determined as the current intermediate position information C n Step S406 is performed, otherwise step S404 is performed.
It should be noted that the decision policy in step S403 is to prioritize the examples actually used by the class over the examples only not actually used.
Step S404, if B 1 And B 2 One of the calls is a call in the range of the class, and the other call is a call out of the range of the class, and the call out of the range of the class is determined to be the current intermediate position information C n Step S406 is performed, otherwise step S405 is performed.
The decision policy in step S404 is that the use outside the scope of the class itself is better than the call in the class itself.
Step S405, if B 1 And B 2 One is a call in a preset UVM architecture, the other is a call in a chip self code, and the call in the chip self code is determined as current intermediate position information C n Otherwise, from B 1 And B 2 Randomly selects one as the current intermediate position information C n 。
It should be noted that the use in the chip design self code of step S405 is better than the use in the UVM architecture.
Step S406, if n=n-1, then C n And determining the position information of the target call identifier, otherwise, setting n=n+1, and returning to the step S41.
And through the steps S403 to S405, the position information of the target call identifier of the function or the task is finally determined by pairwise alignment, and judgment is carried out according to the priority judgment sequence set in the steps S403 to S405, so that the accuracy of determining the position information of the target call identifier is improved.
It should be noted that some exemplary embodiments are described as a process or a method depicted as a flowchart. Although a flowchart depicts steps as a sequential process, many of the steps may be implemented in parallel, concurrently, or with other steps. Furthermore, the order of the steps may be rearranged. The process may be terminated when its operations are completed, but may have additional steps not included in the figures. The processes may correspond to methods, functions, procedures, subroutines, and the like.
The embodiment of the invention also provides electronic equipment, which comprises: at least one processor; and a memory communicatively coupled 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 methods of embodiments of the present invention.
The embodiment of the invention also provides a computer readable storage medium, which stores computer executable instructions for executing the method according to the embodiment of the invention.
According to the embodiment of the invention, the corresponding jump list is created by setting the call identifier, the position information of the target call identifier is determined based on the jump list for the call identifier which is not empty in the jump list, and the position information of the target call identifier is determined based on the priority for the call identifier which is empty in the jump list, so that the position information of the target call identifier can be rapidly and accurately determined, and the efficiency of chip design and chip verification is improved.
The present invention is not limited to the above-mentioned embodiments, but is intended to be limited to the following embodiments, and any modifications, equivalents and modifications can be made to the above-mentioned embodiments without departing from the scope of the invention.
Claims (10)
1. A method of determining location information for a destination call identifier, comprising:
step S1, creating a corresponding jump list for each calling identifier, wherein each jump list is initially empty, when the calling identifier is called, acquiring the position information of the calling identifier, and sequentially storing the position information of the calling identifier into the corresponding jump list according to the order of executing the viewing definition operation;
step S2, acquiring a target calling identifier from a chip code definition area, if a jump list corresponding to the target calling identifier is not empty, executing a step S3, otherwise, executing a step S4;
step S3, determining the position information of the calling identifier currently arranged at the tail position in the jump list corresponding to the target calling identifier as the position information of the chip code target calling identifier, moving the position information of the calling identifier currently arranged at the tail position in the jump list corresponding to the target calling identifier to the head position of the jump list corresponding to the target calling identifier, jumping to the position corresponding to the position information of the target calling identifier, and returning to the execution step S2;
and S4, compiling the chip code to obtain the position information corresponding to all the target calling identifiers, traversing the position information corresponding to all the target calling identifiers, determining the position information of the target calling identifier with the highest calling priority as the position information of the target calling identifier of the chip code, jumping to the position corresponding to the position information of the target calling identifier, and returning to the execution step S2.
2. The method of claim 1, wherein the step of determining the position of the substrate comprises,
the step S1 includes:
s11, acquiring a view definition instruction based on a chip code;
step S12, analyzing the view definition instruction, and acquiring a calling identifier corresponding to the view definition instruction and position information of the calling identifier, wherein the position information of the calling identifier comprises code file information and code line information;
and step S13, sequentially storing the position information of the calling identifier corresponding to the viewing definition instruction into a skip list corresponding to the viewing definition instruction according to the order of executing the viewing definition operation.
3. A method according to claim 1 or 2, characterized in that,
the method further comprises the steps of:
and step S10, when the number of the position information of the calling identifier in the jump list exceeds a preset buffer number threshold, deleting the position information of the calling identifier from the first position of the jump list, so that the position information in the jump list is equal to the preset buffer number threshold.
4. The method of claim 1, wherein the step of determining the position of the substrate comprises,
the call is identified as a function name, task name, or class name.
5. The method of claim 4, wherein the step of determining the position of the first electrode is performed,
the target call is identified as a function name or a task name, and the step S4 includes:
step S41, compiling the chip code to obtain the position information { A } corresponding to all the target call identifiers 1 ,A 2 ,…,A n ,…,A N },A n The method comprises the steps that position information corresponding to an nth target calling identifier in a chip code is obtained, the value range of N is 1 to N, and N is the total number of the position information corresponding to the target calling identifier in the chip code;
step S42, setting n=1, and setting the current first position information B to be compared 1 =A n Current second position information B to be compared 2 =A n+1 Step S43 is performed;
step S43, obtaining the instance module identifier corresponding to the target call identifier from the chip code definition area, if B 1 And B 2 The instance module identifier corresponding to only one piece of position information is the same as the corresponding instance module identifier, the methodB 1 And B 2 The same location information as the corresponding instance module identity is determined as the current intermediate location information C n Step S45 is executed, otherwise, step S44 is executed;
step S44, obtaining the current debug viewing file identification corresponding to the target call identification from the chip code definition area, if B 1 And B 2 The file identification corresponding to only one position information is the same as the corresponding current debugging and viewing file identification, B is carried out 1 And B 2 The position information which is the same as the corresponding current debug viewing file identification is determined to be the current intermediate position information C n Otherwise, from B 1 And B 2 Randomly selects one as the current intermediate position information C n ;
Step S45, if n=n-1, C n And determining the position information of the target call identifier, otherwise, setting n=n+1, and returning to the step S41.
6. The method of claim 5, wherein the step of determining the position of the probe is performed,
in the step S41, the location information { a } corresponding to all the target call identifiers is obtained from a preset database based on the target call identifiers 1 ,A 2 ,…,A n ,…,A N And storing the position information corresponding to all the calling identifiers in the preset database in advance.
7. The method of claim 4, wherein the step of determining the position of the first electrode is performed,
the target call is identified as a class name, and the step S4 includes:
step S401, compiling the chip code to obtain position information { A } corresponding to all target call identifiers 1 ,A 2 ,…,A n ,…,A N },A n The method comprises the steps that position information corresponding to an nth target calling identifier in a chip code is obtained, the value range of N is 1 to N, and N is the total number of the position information corresponding to the target calling identifier in the chip code;
step S402, setting n=1, and setting the current first position information B to be compared 1 =A n When (when)Front second position information to be compared B 2 =A n+1 Step S403 is performed;
step S403, if B 1 And B 2 One of which is to define only the unused instance and the other is the actually used instance, then the actually used instance is determined as the current intermediate position information C n Step S406 is executed, otherwise, step S404 is executed;
step S404, if B 1 And B 2 One of the calls is a call in the range of the class, and the other call is a call out of the range of the class, and the call out of the range of the class is determined to be the current intermediate position information C n Step S406 is executed, otherwise step S405 is executed;
step S405, if B 1 And B 2 One is a call in a preset UVM architecture, the other is a call in a chip self code, and the call in the chip self code is determined as current intermediate position information C n Otherwise, from B 1 And B 2 Randomly selects one as the current intermediate position information C n ;
Step S406, if n=n-1, then C n And determining the position information of the target call identifier, otherwise, setting n=n+1, and returning to the step S41.
8. The method of claim 7, wherein the step of determining the position of the probe is performed,
in the step S401, the location information { a } corresponding to all the target call identifiers is obtained from a preset database based on the target call identifiers 1 ,A 2 ,…,A n ,…,A N And storing the position information corresponding to all the calling identifiers in the preset database in advance.
9. An electronic device, comprising:
at least one processor;
and a memory communicatively coupled to the at least one processor;
wherein the memory stores instructions executable by the at least one processor, the instructions being arranged to perform the method of any of the preceding claims 1-8.
10. A computer readable storage medium, characterized in that computer executable instructions are stored for performing the method of any of the preceding claims 1-8.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202310892684.XA CN116627846B (en) | 2023-07-20 | 2023-07-20 | Method, electronic device and medium for determining position information of target call identifier |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202310892684.XA CN116627846B (en) | 2023-07-20 | 2023-07-20 | Method, electronic device and medium for determining position information of target call identifier |
Publications (2)
Publication Number | Publication Date |
---|---|
CN116627846A true CN116627846A (en) | 2023-08-22 |
CN116627846B CN116627846B (en) | 2023-09-22 |
Family
ID=87638528
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202310892684.XA Active CN116627846B (en) | 2023-07-20 | 2023-07-20 | Method, electronic device and medium for determining position information of target call identifier |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN116627846B (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN116796674A (en) * | 2023-08-24 | 2023-09-22 | 上海合见工业软件集团有限公司 | Heterogeneous hardware simulation method and system |
CN117313651A (en) * | 2023-11-30 | 2023-12-29 | 沐曦集成电路(上海)有限公司 | Chip function feature setting method, electronic device and medium |
Citations (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP1959343A1 (en) * | 2007-02-15 | 2008-08-20 | Giesecke & Devrient GmbH | Method for analysing the software configuration of a portable data storage device |
US20100023926A1 (en) * | 2008-07-23 | 2010-01-28 | International Business Machines Corporation | Call graph dependency extraction by static source code analysis |
CN109656553A (en) * | 2018-11-23 | 2019-04-19 | 北京微播视界科技有限公司 | Page creation method, page layout method and device |
CN111615688A (en) * | 2019-05-28 | 2020-09-01 | 深圳市大疆创新科技有限公司 | Assertion verification code binding method and device |
US20220045948A1 (en) * | 2018-12-28 | 2022-02-10 | Lynxi Technologies Co., Ltd. | Path creation method and device for network on chip and electronic apparatus |
WO2022057322A1 (en) * | 2020-09-16 | 2022-03-24 | 海信视像科技股份有限公司 | Display method and display device |
WO2023000143A1 (en) * | 2021-07-19 | 2023-01-26 | Oppo广东移动通信有限公司 | Relay method for slidelink, first electronic device, chip, and storage medium |
CN116071012A (en) * | 2022-12-27 | 2023-05-05 | 中国邮政储蓄银行股份有限公司 | Node jump method and device of workflow, processor and electronic equipment |
-
2023
- 2023-07-20 CN CN202310892684.XA patent/CN116627846B/en active Active
Patent Citations (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP1959343A1 (en) * | 2007-02-15 | 2008-08-20 | Giesecke & Devrient GmbH | Method for analysing the software configuration of a portable data storage device |
US20100023926A1 (en) * | 2008-07-23 | 2010-01-28 | International Business Machines Corporation | Call graph dependency extraction by static source code analysis |
CN109656553A (en) * | 2018-11-23 | 2019-04-19 | 北京微播视界科技有限公司 | Page creation method, page layout method and device |
US20220045948A1 (en) * | 2018-12-28 | 2022-02-10 | Lynxi Technologies Co., Ltd. | Path creation method and device for network on chip and electronic apparatus |
CN111615688A (en) * | 2019-05-28 | 2020-09-01 | 深圳市大疆创新科技有限公司 | Assertion verification code binding method and device |
WO2022057322A1 (en) * | 2020-09-16 | 2022-03-24 | 海信视像科技股份有限公司 | Display method and display device |
WO2023000143A1 (en) * | 2021-07-19 | 2023-01-26 | Oppo广东移动通信有限公司 | Relay method for slidelink, first electronic device, chip, and storage medium |
CN116071012A (en) * | 2022-12-27 | 2023-05-05 | 中国邮政储蓄银行股份有限公司 | Node jump method and device of workflow, processor and electronic equipment |
Non-Patent Citations (1)
Title |
---|
张鸿骏;武延军;张珩;张立波;: "一种适应GPU的混合访问缓存索引框架", 软件学报, no. 10 * |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN116796674A (en) * | 2023-08-24 | 2023-09-22 | 上海合见工业软件集团有限公司 | Heterogeneous hardware simulation method and system |
CN116796674B (en) * | 2023-08-24 | 2023-11-24 | 上海合见工业软件集团有限公司 | Heterogeneous hardware simulation method and system |
CN117313651A (en) * | 2023-11-30 | 2023-12-29 | 沐曦集成电路(上海)有限公司 | Chip function feature setting method, electronic device and medium |
CN117313651B (en) * | 2023-11-30 | 2024-02-09 | 沐曦集成电路(上海)有限公司 | Chip function feature setting method, electronic device and medium |
Also Published As
Publication number | Publication date |
---|---|
CN116627846B (en) | 2023-09-22 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN116627846B (en) | Method, electronic device and medium for determining position information of target call identifier | |
US8732681B2 (en) | Stack analysis for post mortem analysis | |
US20130111267A1 (en) | Optimizing regression testing based on code coverage analysis | |
CN104346267A (en) | Method and device for generating program bug positioning information | |
CN105988798B (en) | Patch processing method and device | |
CN113342685A (en) | Precise test method and device, computer equipment and storage medium | |
CN106055462A (en) | Method and device for duration acquisition | |
US7861072B2 (en) | Throwing one selected representative exception among aggregated multiple exceptions of same root cause received from concurrent tasks and discarding the rest | |
CN110716919A (en) | Mock testing method, Mock testing device and storage medium | |
CN102681938A (en) | Memory leakage detecting method and device | |
CN112015665B (en) | Test verification backtracking method and device, electronic equipment and storage medium | |
US8898644B2 (en) | Efficient unified tracing of kernel and user events with multi-mode stacking | |
US8146085B2 (en) | Concurrent exception handling using an aggregated exception structure | |
CN114860586A (en) | Binary multi-executive software instrumentation method based on dynamic instrumentation | |
CN112783764B (en) | Automatic testing method and device for application program, storage medium and terminal | |
JP6122054B2 (en) | Monitor device having branch circuit extraction display function of ladder program | |
US8046760B2 (en) | Lock contention pinpointing | |
US20060265687A1 (en) | Method for Finding a Function Call Stack in Run Time for a Computer System | |
CN108459952B (en) | Program exception processing method and system | |
CN110727602B (en) | Coverage rate data processing method, coverage rate data processing device and storage medium | |
US8826233B2 (en) | Graphical representation of a JAVA bytecode | |
CN108959032A (en) | Real-time monitoring method and device for server service index and electronic equipment | |
CN110209593B (en) | Preference setting-oriented android application testing method | |
CN113076257A (en) | Test script recording method, device, medium and computer equipment | |
CN107656868B (en) | Debugging method and system for acquiring thread name by using thread private data |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |