CN104375879A - Binary system translation method and device based on execution tree depth - Google Patents
Binary system translation method and device based on execution tree depth Download PDFInfo
- Publication number
- CN104375879A CN104375879A CN201410688378.5A CN201410688378A CN104375879A CN 104375879 A CN104375879 A CN 104375879A CN 201410688378 A CN201410688378 A CN 201410688378A CN 104375879 A CN104375879 A CN 104375879A
- Authority
- CN
- China
- Prior art keywords
- depth
- fundamental block
- translation
- instruction
- execution tree
- 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 35
- 229910002056 binary alloy Inorganic materials 0.000 title abstract 2
- 230000006870 function Effects 0.000 claims abstract description 27
- 238000010586 diagram Methods 0.000 description 6
- 230000008901 benefit Effects 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- GNFTZDOKVXKIBK-UHFFFAOYSA-N 3-(2-methoxyethoxy)benzohydrazide Chemical compound COCCOC1=CC=CC(C(=O)NN)=C1 GNFTZDOKVXKIBK-UHFFFAOYSA-N 0.000 description 2
- 244000017020 Ipomoea batatas Species 0.000 description 1
- 235000002678 Ipomoea batatas Nutrition 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
Landscapes
- Devices For Executing Special Programs (AREA)
Abstract
The invention discloses a binary system translation method and device based on the execution tree depth. The method comprises the steps that when a super block begins to be constructed, the execution tree depth is initialized to be zero, a preset execution tree depth threshold value is obtained, translation is started from a basic block where a preset initial address is located, and in the translating process, if a current instruction of the translated basic block is a direct skip instruction, a basic block which the direct skip instruction enters is translated; if the current instruction of the translated basic block is a condition skip instruction, a basic block after the condition skip instruction skips and the next basic block of the condition skip instruction are translated, and one is added into the execution tree depth; if the current instruction of the translated basic block is a function call instruction, functions corresponding to the function call instruction are translated, one is added into the execution tree depth, when the execution tree depth reaches the execution tree depth threshold value, translation is finished, and all the translated basic blocks form the super block. The method and the device can promote the performance of an execution translation program.
Description
Technical field
The present invention relates to field of computer technology, specifically, particularly based on the binary translation method and the device that perform the tree degree of depth.
Background technology
Binary translation refers to a kind of method binary program of source processor being translated as the machine language on another target processor, can perform on target processor to enable the program be translated.In binary translation method, multiple fundamental block is configured to a superblock, wherein, fundamental block refers to the one section of instruction only having single entrance and single outlet, and superblock refers to the set of multiple fundamental block.
Existing method having successively execution sequence, multiple fundamental blocks of performing on source processor form a superblock, then this superblock is translated.Therefore, existing interpretation method is not translated fundamental block unenforced on source processor in superblock, and in target processor during executive routine, execution efficiency is low.
For the problem that the performance of the superblock after the target processor execution two-stage system translation existed in prior art is low, at present effective solution is not yet proposed.
Summary of the invention
Fundamental purpose of the present invention is to provide a kind of binary translation method and device based on performing the tree degree of depth, to solve the low problem of performance that target processor of the prior art performs the superblock after two-stage system translation.
According to one aspect of the present invention, provide a kind of binary translation method based on performing the tree degree of depth.
Binary translation method according to the present invention comprises: step S0: start to construct superblock, and the execution tree degree of depth is initialized as 0, and obtains the execution tree depth threshold preset, translation from the fundamental block at the start address place of presetting; Step S1: translate the fundamental block got; Step S2: if the present instruction of the fundamental block of translation is direct jump instruction, then obtains the fundamental block that direct jump instruction enters, and be back to step S1; Step S3: if the present instruction of the fundamental block of translation is conditional jump instructions, then obtain the next fundamental block of the fundamental block after conditional jump instructions redirect and conditional jump instructions, and the execution tree degree of depth is added 1, is back to step S1; Step S4: if the present instruction of the fundamental block of translation is function call instruction, then obtain function corresponding to function call instruction as fundamental block, and the execution tree degree of depth is added 1, be back to step S1, wherein, add after 1 in each tree degree of depth that performs, judge whether the current execution tree degree of depth reaches and perform tree depth threshold, if perform the tree degree of depth to reach execution tree depth threshold, then translate end, all fundamental blocks of translation form a superblock.
Further, the method also comprises: step S5: after execution step S1, store the address of the Article 1 instruction of fundamental block.
Further, the method also comprises: step S6: while obtaining the execution tree depth threshold preset, obtain the translate duration threshold value preset, and the timing when starting to translate, wherein, add after 1 in each tree degree of depth that performs, judge whether the translate duration of present timing reaches translate duration threshold value, if the translate duration of present timing reaches translate duration threshold value, then translate end.
According to another aspect of the present invention, provide a kind of binary translation device based on performing the tree degree of depth.
Binary translation device according to the present invention comprises: initialization module, during for starting to construct superblock, the execution tree degree of depth is initialized as 0, and obtains the execution tree depth threshold preset, translation from the fundamental block at the start address place of presetting; Translation module, for translating the fundamental block got; First acquisition module, the present instruction for the fundamental block of serving as interpreter is direct jump instruction, obtains the new fundamental block that direct jump instruction enters, and is translated by translation module; Second acquisition module, the present instruction for the fundamental block of serving as interpreter is conditional jump instructions, obtains the next fundamental block of the fundamental block after conditional jump instructions redirect and conditional jump instructions, is translated by translation module, and the execution tree degree of depth is added 1; 3rd acquisition module, the present instruction of the fundamental block of serving as interpreter is function call instruction, then obtain function corresponding to function call instruction as fundamental block, translated by translation module, and the execution tree degree of depth is added 1; Judge module, for adding after 1 in each execution tree degree of depth, judge whether the current execution tree degree of depth reaches and perform tree depth threshold, if the execution tree degree of depth reaches perform tree depth threshold, then translate end, all fundamental blocks of translation form a superblock.
Further, this device also comprises: memory module, for translate a fundamental block at translation module after, stores the address of the Article 1 instruction of this fundamental block.
Further, initialization module also for while obtaining the execution tree depth threshold preset, obtains the translate duration threshold value preset, and the timing when starting to translate; Judge module also for adding after 1 in each tree degree of depth that performs, judges whether the translate duration of present timing reaches translate duration threshold value, if the translate duration of present timing reaches translate duration threshold value, then and translate end.
By the present invention, when carrying out binary translation, translation from the fundamental block at the start address place of presetting, when translating, if the present instruction of the fundamental block of translation is direct jump instruction, then translates the fundamental block that direct jump instruction enters; If the present instruction of the fundamental block of translation is conditional jump instructions, then the fundamental block after Translation Condition jump instruction redirect and the next fundamental block of conditional jump instructions, and the execution tree degree of depth is added 1; If the present instruction of the fundamental block of translation is function call instruction, the function that then sweet potato function call instruction is corresponding, and the execution tree degree of depth is added 1, when performing the tree degree of depth and reaching execution tree depth threshold, translate end, all fundamental blocks of translation form a superblock.By the present invention, the performance performing translation program can be promoted.
Above-mentioned explanation is only the general introduction of technical solution of the present invention, in order to technological means of the present invention can be better understood, and can be implemented according to the content of instructions, and can become apparent, below especially exemplified by the specific embodiment of the present invention to allow above and other objects of the present invention, feature and advantage.
Accompanying drawing explanation
By reading hereafter detailed description of the preferred embodiment, various other advantage and benefit will become cheer and bright for those of ordinary skill in the art.Accompanying drawing only for illustrating the object of preferred implementation, and does not think limitation of the present invention.And in whole accompanying drawing, represent identical parts by identical reference symbol.In the accompanying drawings:
Fig. 1 is the process flow diagram of binary translation method according to a first embodiment of the present invention;
Fig. 2 is the process flow diagram of binary translation method according to a second embodiment of the present invention;
Fig. 3 is the block diagram of binary translation device according to a second embodiment of the present invention.
Embodiment
Below in conjunction with the drawings and specific embodiments, the present invention will be further described.It is pointed out that when not conflicting, the embodiment in the application and the feature in embodiment can combine mutually.
First embodiment
Fig. 1 is the process flow diagram of binary translation method according to a first embodiment of the present invention, and as shown in Figure 1, the method comprises following step:
Step S0: start to construct superblock, is initialized as 0 by the execution tree degree of depth, and obtains the execution tree depth threshold preset, translation from the fundamental block at the start address place of presetting.
Step S1: translate the fundamental block got.
Step S2: if the present instruction of the fundamental block of translation is direct jump instruction, then obtains the fundamental block that direct jump instruction enters, and be back to step S1.
Step S3: if the present instruction of the fundamental block of translation is conditional jump instructions, then obtain the next fundamental block of the fundamental block after conditional jump instructions redirect and conditional jump instructions, and the execution tree degree of depth is added 1, is back to step S1.
Step S4: if the present instruction of the fundamental block of translation is function call instruction, then obtain function corresponding to function call instruction as fundamental block, and the execution tree degree of depth is added 1, is back to step S1,
Wherein, add after 1 in each execution tree degree of depth, judge whether the current execution tree degree of depth reaches and perform tree depth threshold, if the execution tree degree of depth reaches perform tree depth threshold, then translate end, all fundamental blocks of translation form a superblock.
The binary translation method based on the execution tree degree of depth adopting this embodiment to provide, when constructing superblock, no matter whether fundamental block is performed on source processor, as long as these fundamental blocks are on execution tree, just can be configured in same superblock and be translated, the fundamental block likely performed is placed in a superblock, thus relevant fundamental block can be placed in a superblock, the performance of the superblock after performing translation can be improved.
Preferably, the method also comprises: step S6: while obtaining the execution tree depth threshold preset, obtain the translate duration threshold value preset, and the timing when starting to translate, wherein, add after 1 in each tree degree of depth that performs, judge whether the translate duration of present timing reaches translate duration threshold value, if the translate duration of present timing reaches translate duration threshold value, then translate end.
Adopt the preferred embodiment, using the structural environment one of of translate duration as superblock, thus reach threshold value in translate duration or perform when the tree degree of depth reaches threshold value and all can terminate translation, when avoiding the execution tree degree of depth of specifying improper, translate duration is long.
Second embodiment
Fig. 2 is the process flow diagram of binary translation method according to a second embodiment of the present invention, in this embodiment, when carrying out binary translation from the address of an instruction, when current execution route is encountered function call instruction or conditional jump instructions, instruction translation and can want the execution route of redirect to translate at current execution route simultaneously, thus, in this embodiment, performing the degree of depth also referred to as the translation degree of depth.The translation degree of depth can set flexibly according to concrete application scenarios.The translation degree of depth is larger, and the fundamental block of composition superblock is also more, and the fundamental block of composition is more can bring more code optimization effect, and the performance of executive routine also can correspondingly improve.But it is elongated that the negative effect that fundamental block is more is translate duration.After superblock has been translated, the address of the Article 1 instruction of each fundamental block comprised in superblock is saved.When target program starts to perform time, often encounter the address of a fundamental block, whether translatedly all can search this fundamental block, if translated, then jump in the superblock at translated fundamental block place and perform.
Particularly, the flow process of method that provides of this embodiment is as follows:
A, from certain start address, construct superblock.
B, appointment one the translation degree of depth, when reaching this translation degree of depth, superblock will stop translation, enters step c;
Namely the fundamental block at c, translation place, current address, also translate a fundamental block from present instruction.
If d present instruction is direct jump instruction, then enters new fundamental block translation, enter step c.
E is if conditional jump instructions, then the degree of depth adds one, and the next fundamental block of simultaneously Translation Condition instruction and the object block of redirect, enter step g.
F if function call instruction, then enters this function and translates, and translates the degree of depth and add one, enters step g.
G, judge translation the degree of depth whether reach designated depth, if reached, then translate end, enters step h, and completes the structure of superblock, if do not reach designated depth, then enters step c.
H, superblock structure terminates.
The binary translation method based on the execution tree degree of depth adopting this embodiment to provide, carry out code analysis in advance, superblock is constructed by the default execution tree degree of depth, thus can all fundamental block composition superblocks on tree be performed, the present invention can be placed on the fundamental block likely performed in a superblock, so as much as possible relevant fundamental block is placed in a superblock, the performance of the superblock after performing translation has the raising of certain amplitude.
3rd embodiment
Fig. 3 is the block diagram of the binary translation device based on the execution tree degree of depth according to a third embodiment of the present invention, as shown in Figure 3, this translating equipment comprises initialization module 10, translation module 20, first acquisition module 30, second acquisition module 40, the 3rd acquisition module 50 and judge module 60.
Wherein, initial in translation, the initialization of translating is carried out by initialization module 10, particularly, when initialization module 10 starts to construct superblock, the execution tree degree of depth is initialized as 0, and obtain the execution tree depth threshold preset, translation from the fundamental block at the start address place of presetting.
First, the fundamental block of translation module 20 to certain the start address place in two-stage system program to be translated starts translation, translates the fundamental block that each acquisition module gets one by one.
Each acquisition module is when obtaining fundamental block, be based on the instruction in the fundamental block of current translation, specific address, in translation process, the present instruction of the fundamental block of serving as interpreter is direct jump instruction, first acquisition module 30 obtains the new fundamental block that direct jump instruction enters, and the basic module got is translated by translation module 20; The present instruction of the fundamental block of serving as interpreter is conditional jump instructions, second acquisition module 40 obtains the next fundamental block of the fundamental block after conditional jump instructions redirect and conditional jump instructions, the basic module got is translated by translation module 10, and the execution tree degree of depth is added 1; The present instruction of the fundamental block of serving as interpreter is function call instruction, and the 3rd acquisition module obtains function corresponding to function call instruction as fundamental block, and the basic module got is translated by translation module 10, and the execution tree degree of depth is added 1.
Add after 1 in each execution tree degree of depth, judge module 60 judges whether the current execution tree degree of depth reaches and performs tree depth threshold, if the execution tree degree of depth reaches perform tree depth threshold, then translate end, all fundamental blocks of translation form a superblock.
The binary translation device based on the execution tree degree of depth adopting this embodiment to provide, when constructing superblock, no matter whether fundamental block is performed on source processor, as long as these fundamental blocks are on execution tree, just can be configured in same superblock and be translated, the fundamental block likely performed is placed in a superblock, thus relevant fundamental block can be placed in a superblock, the performance of the superblock after performing translation can be improved.
Preferably, this device also comprises: memory module, for translate a fundamental block at translation module after, stores the address of the Article 1 instruction of this fundamental block.
Adopt the preferred embodiment, the address of the Article 1 instruction of each fundamental block is stored, thus when performing the binary program of translation, often encounter the address of a fundamental block, whether this fundamental block is searched in capital translated, if translated, then jump in the superblock at translated fundamental block place and perform.
Preferably, initialization module also for while obtaining the execution tree depth threshold preset, obtains the translate duration threshold value preset, and the timing when starting to translate; Judge module also for adding after 1 in each tree degree of depth that performs, judges whether the translate duration of present timing reaches translate duration threshold value, if the translate duration of present timing reaches translate duration threshold value, then and translate end.
Adopt the preferred embodiment, using the structural environment one of of translate duration as superblock, thus reach threshold value in translate duration or perform when the tree degree of depth reaches threshold value and all can terminate translation, when avoiding the execution tree degree of depth of specifying improper, translate duration is long.
From the description of above each embodiment, can find out, the embodiment of the present invention achieves following technique effect: improve the performance performing program after binary translation.
The above; be only the present invention's preferably embodiment, but protection scope of the present invention is not limited thereto, any people being familiar with this technology is in the technical scope disclosed by the present invention; the change that can expect easily or replacement, all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection domain of claim.
Claims (6)
1., based on the binary translation method performing the tree degree of depth, it is characterized in that, comprising:
Step S0: start to construct superblock, is initialized as 0 by the execution tree degree of depth, and obtains the execution tree depth threshold preset, translation from the fundamental block at the start address place of presetting;
Step S1: translate the fundamental block got;
Step S2: if the present instruction of the fundamental block of translation is direct jump instruction, then obtains the fundamental block that described direct jump instruction enters, and be back to step S1;
Step S3: if the present instruction of the fundamental block of translation is conditional jump instructions, then obtain the next fundamental block of the fundamental block after described conditional jump instructions redirect and described conditional jump instructions, and the execution tree degree of depth is added 1, be back to step S1;
Step S4: if the present instruction of the fundamental block of translation is function call instruction, then obtain function corresponding to described function call instruction as fundamental block, and the execution tree degree of depth is added 1, be back to step S1,
Wherein, add after 1 in each tree degree of depth that performs, judge whether the current execution tree degree of depth reaches described execution tree depth threshold, if the described execution tree degree of depth reaches described execution tree depth threshold, then translate end, all fundamental blocks of translation form a superblock.
2. the binary translation method based on performing the tree degree of depth according to claim 1, is characterized in that, also comprise:
Step S5: after execution step S1, store the address of the Article 1 instruction of described fundamental block.
3. the binary translation method based on performing the tree degree of depth according to claim 1 and 2, is characterized in that, also comprise:
Step S6: while obtaining the execution tree depth threshold preset, obtain the translate duration threshold value preset, and the timing when starting to translate,
Wherein, add after 1 in each tree degree of depth that performs, judge whether the translate duration of present timing reaches described translate duration threshold value, if the translate duration of described present timing reaches described translate duration threshold value, then translate end.
4., based on the binary translation device performing the tree degree of depth, it is characterized in that, comprising:
Initialization module, during for starting to construct superblock, is initialized as 0 by the execution tree degree of depth, and obtains the execution tree depth threshold preset, translation from the fundamental block at the start address place of presetting;
Translation module, for translating the fundamental block got;
First acquisition module, the present instruction for the fundamental block of serving as interpreter is direct jump instruction, obtains the new fundamental block that described direct jump instruction enters, and is translated by described translation module;
Second acquisition module, present instruction for the fundamental block of serving as interpreter is conditional jump instructions, obtain the next fundamental block of the fundamental block after described conditional jump instructions redirect and described conditional jump instructions, translated by described translation module, and the execution tree degree of depth is added 1;
3rd acquisition module, the present instruction of the fundamental block of serving as interpreter is function call instruction, then obtain function corresponding to described function call instruction as fundamental block, translated by described translation module, and the execution tree degree of depth is added 1;
Judge module, for adding after 1 in each tree degree of depth that performs, judge whether the current execution tree degree of depth reaches described execution tree depth threshold, if the described execution tree degree of depth reaches described execution tree depth threshold, then translate end, all fundamental blocks of translation form a superblock.
5. the binary translation device based on performing the tree degree of depth according to claim 4, is characterized in that, also comprise:
Memory module, after translating a fundamental block at described translation module, stores the address of the Article 1 instruction of this fundamental block.
6. the binary translation device based on the execution tree degree of depth according to claim 4 or 5, is characterized in that,
Described initialization module also for while obtaining the execution tree depth threshold preset, obtains the translate duration threshold value preset, and the timing when starting to translate;
Described judge module also for adding after 1 in each tree degree of depth that performs, judges whether the translate duration of present timing reaches described translate duration threshold value, if the translate duration of described present timing reaches described translate duration threshold value, then and translate end.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410688378.5A CN104375879B (en) | 2014-11-26 | 2014-11-26 | Based on the binary translation method and device for performing tree depth |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410688378.5A CN104375879B (en) | 2014-11-26 | 2014-11-26 | Based on the binary translation method and device for performing tree depth |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104375879A true CN104375879A (en) | 2015-02-25 |
| CN104375879B CN104375879B (en) | 2018-02-09 |
Family
ID=52554818
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410688378.5A Active CN104375879B (en) | 2014-11-26 | 2014-11-26 | Based on the binary translation method and device for performing tree depth |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104375879B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109471668A (en) * | 2018-11-20 | 2019-03-15 | 南方电网科学研究院有限责任公司 | Cross-platform display card firmware translation execution method, device, equipment and readable medium |
| CN111090417A (en) * | 2019-11-14 | 2020-05-01 | 杭州中恒电气股份有限公司 | Binary file analysis method, device, equipment and medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1716202A (en) * | 2004-06-30 | 2006-01-04 | 中国科学院计算技术研究所 | Be association of activity and inertia incomplete disposal route of static information and device in the binary translation |
| CN1823322A (en) * | 2003-07-15 | 2006-08-23 | 可递有限公司 | Shared code caching method and apparatus for program code conversion |
| CN101387970A (en) * | 2008-10-30 | 2009-03-18 | 上海交通大学 | Method for generating super block utilizing partial information |
-
2014
- 2014-11-26 CN CN201410688378.5A patent/CN104375879B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1823322A (en) * | 2003-07-15 | 2006-08-23 | 可递有限公司 | Shared code caching method and apparatus for program code conversion |
| CN1716202A (en) * | 2004-06-30 | 2006-01-04 | 中国科学院计算技术研究所 | Be association of activity and inertia incomplete disposal route of static information and device in the binary translation |
| CN101387970A (en) * | 2008-10-30 | 2009-03-18 | 上海交通大学 | Method for generating super block utilizing partial information |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109471668A (en) * | 2018-11-20 | 2019-03-15 | 南方电网科学研究院有限责任公司 | Cross-platform display card firmware translation execution method, device, equipment and readable medium |
| CN109471668B (en) * | 2018-11-20 | 2021-11-26 | 南方电网科学研究院有限责任公司 | Cross-platform display card firmware translation execution method, device, equipment and readable medium |
| CN111090417A (en) * | 2019-11-14 | 2020-05-01 | 杭州中恒电气股份有限公司 | Binary file analysis method, device, equipment and medium |
| CN111090417B (en) * | 2019-11-14 | 2023-11-28 | 杭州中恒电气股份有限公司 | Binary file analysis method, binary file analysis device, binary file analysis equipment and binary file analysis medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104375879B (en) | 2018-02-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104077162B (en) | Renewal, dissemination method and the device of mobile terminal application template | |
| US11409706B2 (en) | Document cooperation supporting apparatus for supporting simultaneous edit of document, and operating method thereof | |
| US20160147882A1 (en) | Object Search Method and Apparatus | |
| RU2015121718A (en) | METHOD AND DEVICE FOR PRESENTING A LIST OF ACCESS POINTS | |
| JP2017528842A5 (en) | ||
| ATE359559T1 (en) | METHOD AND SYSTEM FOR PERFORMING CALCULATION OPERATIONS AND DEVICE | |
| WO2010127045A3 (en) | Method and system for calling variations in a sample polynucleotide sequence with respect to a reference polynucleotide sequence | |
| CN104391840A (en) | Translation method and device | |
| CN107247722B (en) | File scanning method and device and intelligent terminal | |
| KR970013799A (en) | Viterbi decoding method and Viterbi decoding apparatus | |
| CN103714116A (en) | Webpage information extracting method and webpage information extracting equipment | |
| WO2017012416A3 (en) | Shortcut operation method, shortcut operation device, and terminal | |
| CN108241740A (en) | The generation method and device of a kind of search input associational word of timeliness | |
| CN106648568B (en) | Method and device for adding check box on table | |
| CN104375879A (en) | Binary system translation method and device based on execution tree depth | |
| CN103473350B (en) | Document handling method and equipment | |
| CN105468661A (en) | Method and system for searching symbol information in ELF file | |
| CN106775826B (en) | Method and system for loading code file by annotation mode | |
| CN104572876A (en) | Method and device for reading configuration file corresponding to software | |
| MY193465A (en) | Method, terminal and storage medium for starting software | |
| KR102147355B1 (en) | Method and apparatus for converting programs | |
| RU2015103742A (en) | METHOD AND DEVICE FOR UPDATING USER DATA | |
| CN106802860B (en) | Useless class detection method and device | |
| CN103838865A (en) | Method and device for mining timeliness seed page | |
| GB2556481A (en) | Automatic imports and dependencies in large-scale source code repositories |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210122 Address after: Room 802, 8th floor, building 3, Science Park, shuimuwan District, Shaoxing City, Zhejiang Province, 312000 Patentee after: Zhejiang Dijie Software Technology Co.,Ltd. Address before: No. 124, Fit3 District, Tsinghua University, Haidian District, Beijing 100084 Patentee before: Kang Shuo |
|
| TR01 | Transfer of patent right |