CN103677851A - Method and device for generating embedded program operation symbol table - Google Patents

Method and device for generating embedded program operation symbol table Download PDF

Info

Publication number
CN103677851A
CN103677851A CN201310741877.1A CN201310741877A CN103677851A CN 103677851 A CN103677851 A CN 103677851A CN 201310741877 A CN201310741877 A CN 201310741877A CN 103677851 A CN103677851 A CN 103677851A
Authority
CN
China
Prior art keywords
symbol
array
symbol table
information
file destination
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
Application number
CN201310741877.1A
Other languages
Chinese (zh)
Other versions
CN103677851B (en
Inventor
黄锡元
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Raisecom Technology Co Ltd
Original Assignee
Raisecom Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Raisecom Technology Co Ltd filed Critical Raisecom Technology Co Ltd
Priority to CN201310741877.1A priority Critical patent/CN103677851B/en
Publication of CN103677851A publication Critical patent/CN103677851A/en
Application granted granted Critical
Publication of CN103677851B publication Critical patent/CN103677851B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention discloses a method and device for generating an embedded program operation symbol table. The method includes the following steps that all symbol information is extracted from a generated target file, symbol information is extracted from the generated target file according to set requirements; global symbol information is sieved out from the extracted symbol information, symbol names of the global symbol information are ordered, and a first orderly symbol array is generated; static symbol information is sieved out of the extracted symbol information and a second symbol array is generated; symbol addresses of the extracted symbol information are ordered and an address ordering symbol index array is generated; the first orderly symbol array, the second orderly symbol array and the address ordering symbol index array are merged and the symbol table is generated. According to the technical scheme, searching from the symbol addresses to the symbol information can be supported and retrieving the static symbol information through the symbol addresses can also be supported.

Description

A kind of method and apparatus that generates embedded program operation symbol table
Technical field
The present invention relates to field of embedded software, relate in particular to a kind of method that generates embedded program operation symbol table.
Background technology
Along with the increase of network system complexity, the on-the-spot adjustable ability of equipment is more aobvious important, and wherein, symbol table is one of most important technology of field adjustable.By symbol table information, slip-stick artist can carry out function call operation by title, checks the information of global variable, the information such as the call stack of print progress.This is very helpful for the running status of obtaining equipment, can allow slip-stick artist's orientation problem reason faster.
In embedded system, due to storage space and chip speed, the design of symbol table should be the least possible takies storage space, possesses fast as far as possible search efficiency.Current industry mainly adopts the method for " secondary link one-step installation " to generate symbol table:
As shown in Figure 1, the method flow of " secondary link one-step installation " is as follows:
A, link for the first time.First all file destinations and library file are once linked, generate an interim file destination.
B, link for the second time.Then from this transient target file the inside, extract symbolic information and generate the source file that comprises original symbol information, compile this source file and generate symbol table file destination.Then the transient target file of this symbol table file destination and steps A being produced links again, generates final bin file.
C, one-step installation.In device start, symbol is installed to initialization, such as being installed as Hash table, Adelson-Velskii-Landis tree etc.
After symbol table has been installed, equipment can find corresponding symbolic information by function name in operational process, such as function address etc., thereby can carry out easily the debugging that function call is relevant.
But there is following defect in the method:
1, secondary link has increased the time of compiling.Current embedded system is more and more huger, and last link time accounts for total compiling link time significant proportion, increases the time that once link increases larger.
2, at present a lot of system providers (such as wind river) provide complete compiling and the integration environment of script, and use the mode of secondary link need to revise these environment and script, cumbersome.
3, the process that has an installation, one understands the start-up time of increase equipment; Two owing to having increased an index space, can additionally increase many memory consumptions.For embedded system, no matter be nonvolatile storage space or memory headroom, be all more valuable resource.
4, because the symbol table of installing be take designation as index, therefore from designation, can find efficiently symbolic information, but it is more consuming time from symbolic address, to search symbolic information.When obtaining the call stack of process, this is a regular operation.
5, owing to there are a lot of static variables of the same name, in order to prevent producing ambiguity when designation is searched symbolic information, current symbol table only extracts globak symbol, lacks static symbol, so static symbol cannot be searched symbolic information by symbolic address.And in the call stack of process, having is much static function, if cannot obtain function name, when printing call stack information, can only print an address information, this can bring many puzzlements to debugging.
6, symbol table does not possess dynamic load characteristic, has or nothing.This is more unfavorable for FLASH or the smaller equipment of internal memory, due to space constraint, cannot add symbol table, wants with symbol table once out of joint, cumbersome.
Summary of the invention
Technical matters to be solved by this invention is to reduce the compiling link time, finds efficiently symbolic information, and symbol table capable of dynamic is loaded, and proposes a kind of method and apparatus that generates embedded program operation symbol table.
In order to solve the problems of the technologies described above, technical scheme provided by the invention is as follows:
A method that generates embedded program operation symbol table, comprising:
From the file destination generating, extract all symbolic information or from the file destination generating according to setting requirement extract symbolic information;
From the symbolic information of extracting, filter out globak symbol information, the designation of described globak symbol information is sorted, generate the first orderly symbol array;
From the symbolic information of extracting, filter out static symbol information, generate second symbol array;
Symbolic address to the symbolic information of extracting sorts, calculated address sequence notation index array;
The first orderly symbol array, second symbol array and address sort notation index array are merged, generate symbol table.
Further, described file destination is that described symbol table is binary file by source file being compiled and linked the file of generation.
Further, described method also comprises
Described symbol table and file destination are loaded in flash memory FLASH; To designation sequence, it is the ASCII character size sequence according to designation.
Further, before in described symbol table and file destination are loaded into flash memory FLASH, also comprise and judge whether the space of flash memory FLASH meets the loading requirement of described symbol table and file destination, if met, described symbol table and file destination are loaded in flash memory FLASH, if do not meet, described symbol table and file destination be loaded in internal memory.
Further, the first orderly symbol array, second symbol array and address sort notation index array are merged and are comprised:
Set up a symbol table management document, the number of version number, the number of globak symbol, the number of static symbol and the symbolic address index of described symbol table management document maintain symbol table;
Preserve the described first orderly symbol array, described second symbol array, described address sort notation index array and described symbol table management document, generate described symbol table.
In order to solve the problems of the technologies described above, the present invention also provides a kind of device that generates embedded program operation symbol table, comprising: generation unit, extraction unit, sequencing unit and processing unit;
Described generation unit, for generating object file;
Described extraction unit, for the file destination from generating extract all symbolic information or from the file destination generating according to setting requirement extract symbolic information; Also for filtering out globak symbol information and static symbol information from the symbolic information of extracting;
Described sequencing unit, for the designation of described globak symbol information is sorted, generates the first orderly symbol array; The designation of described static symbol information is generated to second symbol array; Symbolic address to the symbolic information of extracting sorts, calculated address sequence notation index array;
Described processing unit, for the first orderly symbol array, second symbol array and address sort notation index array are merged, generates symbol table.
Alternatively, the file destination that described generation unit generates is by source file being compiled and linked the file of generation, and the symbol table that described processing unit generates is binary file.
Alternatively, described device also comprises loading unit;
Described loading unit, for described symbol table and file destination are loaded into flash memory FLASH,
Described sequencing unit is the ASCII character size sequence according to designation to designation sequence.
Alternatively, described device also comprises, judging unit,
Described judging unit, for judging whether the space of flash memory FLASH meets the loading requirement of described symbol table and file destination, described loading unit, while requiring for meet the loading of symbol table and file destination in the space of described FLASH, described symbol table and file destination are loaded in flash memory FLASH, when the loading that does not also meet symbol table and file destination for the space at described FLASH requires, described symbol table and file destination are loaded in internal memory.
Alternatively, described processing unit merges and comprises the first orderly symbol array, second symbol array and address sort notation index array:
Processing unit is set up a symbol table management document, described symbol table management document is for the number of the version number of maintain symbol table, the number of the number of globak symbol, static symbol and symbolic address index, described processing unit is preserved the described first orderly symbol array, described second symbol array, described address sort notation index array and described symbol table management document, generates described symbol table.
Scheme provided by the invention is carried out pre-service to symbolic information, directly generates the data structure of tape index information, saves the installation process of symbol table.By the symbolic address pre-service of sorting, directly generate and take the data structure that address is index, support searching from symbolic address to symbolic information.Differentiation by globak symbol and static symbol is stored, and when avoiding searching by designation symbolic information and producing ambiguity, has supported to search static symbol information by symbolic address.By symbol table and final goal file, separate, reach the object that symbol table capable of dynamic loads.
Accompanying drawing explanation
Fig. 1 is the process flow diagram of conventional symbols table generating method;
Fig. 2 is a kind of process flow diagram that generates the method for embedded program operation symbol table of the embodiment of the present invention;
Fig. 3 is a kind of structural representation that generates the device of embedded program operation symbol table of the embodiment of the present invention.
Embodiment
For making the object, technical solutions and advantages of the present invention clearer, hereinafter in connection with accompanying drawing, embodiments of the invention are elaborated.It should be noted that, in the situation that not conflicting, the embodiment in the application and the feature in embodiment be combination in any mutually.
As shown in Figure 2, the embodiment of the present invention provides a kind of method that generates embedded program operation symbol table,
From the file destination generating, extract all symbolic information or from the file destination generating according to setting requirement extract symbolic information;
From the symbolic information of extracting, filter out globak symbol information, the designation of described globak symbol information is sorted, generate the first orderly symbol array;
From the symbolic information of extracting, filter out static symbol information, generate second symbol array;
Symbolic address to all symbolic information sorts, calculated address sequence notation index array;
The first orderly symbol array, second symbol array and address sort notation index array are merged, generate symbol table.
When searching according to designation, symbol table has been orderly like this, does not need additionally to set up index.
Wherein, described file destination is that described symbol table is binary file, and described symbol table and file destination are loaded in flash memory FLASH by source file being compiled and linked the file of generation; To designation sequence, it is the ASCII character size sequence according to designation.
Each symbol (comprising globak symbol and static symbol) has a title, is exactly the title of variable and function in general programming, generally letter, numeral and underscore, consists of.Sequence according to the order that is ASCII character size, compare successively from front to back, for example designation is respectively the symbol of hello and hellp, because letter can learn that front four letters are the same after relatively one by one, last o is less than p, sorts like this hello before hellp.
Before in described symbol table and file destination are loaded into flash memory FLASH, also comprise and judge whether the space of flash memory FLASH meets the loading requirement of described symbol table and file destination, if met, described symbol table and file destination are loaded in flash memory FLASH, if do not met, run duration is loaded into described symbol table and file destination in internal memory as required.
Concrete file system is depended in the loading requirement of symbol table and file destination, and in the embodiment of the present invention, space size meets.
The first orderly symbol array, second symbol array and address sort notation index array are merged and are comprised:
Set up a symbol table management document, the number of version number, the number of globak symbol, the number of local symbol and the symbolic address index of described symbol table management document maintain symbol table;
Preserve the described first orderly symbol array, described second symbol array, described address sort notation index array and described symbol table management document, generate described symbol table.
Wherein, symbol table management document at least comprises: the number of the version number of symbol table, the number of globak symbol, static symbol and the number of symbolic address index, and wherein current sign table version, compatible in the time of for ease of function renewal; The number of static symbol is 0 o'clock, represents not record local symbol, and the number of symbolic address index equals the number of globak symbol and the number sum of static symbol.
The process merging is that above-mentioned four document orders are saved in a file, and the order of the embodiment of the present invention is symbol table management document, the first orderly symbol array, described second symbol array and address sort notation index array.
As shown in Figure 3, a kind of device that generates embedded program operation symbol table, is characterized in that, comprising: generation unit, extraction unit, sequencing unit and and processing unit;
Described generation unit, for generating object file;
Described extraction unit, for the file destination from generating extract all symbolic information or from the file destination generating according to setting requirement extract symbolic information; Also for filtering out globak symbol information and static symbol information from the symbolic information of extracting;
Described sequencing unit, for the designation of described globak symbol information is sorted, generates the first orderly symbol array; The designation of described static symbol information is generated to second symbol array; Symbolic address to all symbolic information sorts, calculated address sequence notation index array;
Described processing unit, for the first orderly symbol array, second symbol array and address sort notation index array are merged, generates symbol table.
Described device also comprises loading unit;
Described loading unit, for being loaded into flash memory FLASH or internal memory by described symbol table.
The file destination that described generation unit generates is by source file being compiled and linked the file of generation, and the symbol table that described processing unit generates is binary file.Described sequencing unit is the ASCII character size sequence according to designation to designation sequence,
Described device also comprises judging unit,
Described judging unit, for judging whether the space of flash memory FLASH meets the loading requirement of described symbol table and file destination, described loading unit, while requiring for meet the loading of symbol table and file destination in the space of described FLASH, described symbol table and file destination are loaded in flash memory FLASH, when the loading that does not also meet symbol table and file destination for the space at described FLASH requires, at run duration, as required described symbol table and file destination are loaded in internal memory.
Described processing unit merges and comprises the first orderly symbol array, the second orderly symbol array and address sort notation index array:
Processing unit is set up a symbol table management document, described symbol table management document is for the number of the version number of maintain symbol table, the number of the number of globak symbol, static symbol and symbolic address index, described processing unit is preserved the described first orderly symbol array, described second symbol array, described address sort notation index array and described symbol table management document, generates described symbol table.
Embodiment
The reason of secondary link is need to first generate a transient target file to extract symbol table, and then symbol table and transient target file are linked again, generates final file destination.Symbol table is just embedded in final file destination and has suffered like this.
In this programme, removed the process that generates transient target file, directly generated final file destination, this is that third party's translation and compiling environment is all supported, without any need for modification.Then from final file destination, extract symbolic information, generate the binary file that a capable of dynamic loads.This binary object file is not to be embedded in final goal file, but a binary file independently.If FLASH space is enough, can be directly and final goal file pack and leave in FLASH; If FLASH space is inadequate, can in needs, dynamic download use in internal memory.Solved like this problem of secondary link, modification translation and compiling environment and dynamic load.
The symbolic information of extracting from file destination the inside may be unordered (specifically depending on the instrument that extracts symbolic information), in order to improve search efficiency, generally symbol table need to be mounted to orderly data structure, current most embedded system is to do this work when system starts, and this has additionally increased start-up time.This patent solves above problem by the pre-service of symbol table.Pre-service is to complete in the compilation phase, can not produce any extra consumption to equipment actual motion, and under current computer performance, the compilation time that pre-service increases is almost negligible, also can be few a lot of than link time.
In sum, basic step is as follows:
Step 101: all symbolic information are extracted in the file destination the inside generating from link, or the file destination generating from link the inside is according to setting requirement extract symbolic information.
Step 102: globak symbol information is extracted in the symbolic information the inside of extracting from step 101, and sequence generates orderly symbol array one according to designation.
Step 103: static symbol information is extracted in the symbolic information the inside of extracting from step 101, generates symbol array two.
Step 104: the overall situation and static information are extracted in the symbolic information the inside of extracting from step 101, according to symbolic address sequence calculated address sequence notation index array.
Step 105: the symbolic information that step 102-step 104 the inside is extracted merges, generation can directly be loaded into the binary file in internal memory.
Step 106: if symbol table directly need to be loaded, final goal file and the packing of symbol table binary file are stored in FLASH, look into and see if there is symbol table according to package information when system starts, if had, be directly loaded in internal memory.
Step 107: if need to use symbol table in the equipment of the symbol table of not packing, corresponding symbol table binary file is downloaded in device memory.
This programme, below describes and will take C language as example for convenience of description, introduce the description that some C language are relevant, but this patent protection domain is not limited to any programming language.
Suppose that basic symbolic information organization definition is as follows:
Figure BDA0000448557960000091
After file destination has extracted symbolic information, first utilize PC to carry out organizing again after a minor sort symbolic information (being also pre-service) according to designation, symbol table just becomes orderly like this.Because the number of symbol is fixed, so can use the mode save symbol information of array; And after sequence, the symbol table of array form can directly be searched by dichotomy, efficiency is equal to Adelson-Velskii-Landis tree, without carrying out one-step installation operation again.Also, by the presort of designation, process, solved this problem that symbol table need to be installed.The final data that generate should be the symbol arrays of sequence.The C language of take illustrates as example:
Suppose current four symbols that have, designation is respectively " sym2 ", " sym3 ", " sym1 ", " sym4 "; Symbol size is respectively 4,6,2,8; Symbolic address is respectively 40,80,90,10.After designation sequence, can generate so the symbol array of a sequence, suppose that name is called symtable:
Figure BDA0000448557960000101
The designation of array the inside is orderly, can directly travel through array by dichotomy and complete the operation of searching symbolic information by designation.Without extra installation constitution symbol table operation.
Prior art is generally carried out symbol table by the mode of traversal instead looks into operation (searching symbolic information by symbolic address), and the time of its consumption is depended on the scale of symbol table, along with the linear increase of increase of number of symbols.If take and set up again one by the method for secondary installing the database that address is index, can additionally consume more storage space and start-up time, such as the most frequently used Adelson-Velskii-Landis tree, each symbol at least needs three pointer space, and in 32 systems, each symbol need to consume the internal memory of 12 bytes.In this programme, adopt the pretreated method of compile duration, symbol is sorted again according to address, generate one by the notation index array of symbolic address sequence, each symbol only need to consume an index space (number of symbol is depended in the space that each index takies, and the most very much not can surpass 4 bytes) and can set up an index that possesses Adelson-Velskii-Landis tree search efficiency like this.The final data that generate are symbolic pointer arrays of sequence.
Connect above-mentioned example, according to array symtable, can use dichotomy to search symbolic information by designation, if but need to from symbolic address, search symbolic information by this array, still need traversal, because in array, symbolic address is unordered.
After symbolic address sequence, generate a symbolic pointer array, suppose that title is addrtable, notation index represents with unsigned int:
Figure BDA0000448557960000111
In this array, each symbol only consumes an index space, can generate a concordance list that possesses AVL search efficiency.
Because static symbol allows to bear the same name, therefore static variable is not generally increased in symbol table, in above-mentioned example, if there is the name of two static symbol to be called " sym2 ", so when need to search symbolic information corresponding to " sym2 " this title, have ambiguity and produce, cannot determine and use which symbol.Above not introducing the problem that static symbol brings, not mentioning, is exactly that static symbol is searched symbolic information in location impenetrably, gives to obtain process transfer stack and bring puzzlement.In order to address this problem, this programme has designed double sign array, the scheme of single notation index array.Use two symbol array stored symbols information: symbol array one is still stored globak symbol information as usual, another one symbol storage of array static symbol information, the most significant digit difference overall situation and static symbol for notation index array.This programme is to deposit the overall situation and static symbol with two arrays in for example, but this patent protection domain comprises the scheme that all overall situations, static symbol are distinguished storage, such as passing through mark position to distinguish, by memory location differentiation etc.
From above-mentioned example, extend, suppose two static symbol in addition, title is respectively " sym1 ", " sym2 ", and size is 10, and address is respectively 400,200.Suppose that static symbol array name is called statictable:
After having added static symbol, finally generate three arrays:
Figure BDA0000448557960000112
Figure BDA0000448557960000121
By array addrtable, can search and comprise the overall situation, the static symbolic information at interior all symbols by symbolic address.
Although the disclosed embodiment of the present invention as above, the embodiment that described content just adopts for the ease of understanding the present invention, not in order to limit the present invention.Technician in any the technical field of the invention; do not departing under the prerequisite of the disclosed spirit and scope of the present invention; can do any modification and variation what implement in form and in details; but scope of patent protection of the present invention, still must be as the criterion with the scope that appending claims was defined.

Claims (10)

1. a method that generates embedded program operation symbol table, is characterized in that, comprising:
From the file destination generating, extract all symbolic information or from the file destination generating according to setting requirement extract symbolic information;
From the symbolic information of extracting, filter out globak symbol information, the designation of described globak symbol information is sorted, generate the first orderly symbol array;
From the symbolic information of extracting, filter out static symbol information, generate second symbol array;
Symbolic address to the symbolic information of extracting sorts, calculated address sequence notation index array;
The first orderly symbol array, second symbol array and address sort notation index array are merged, generate symbol table.
2. method according to claim 1, is characterized in that,
Described file destination is that described symbol table is binary file by source file being compiled and linked the file of generation.
3. method according to claim 1, is characterized in that, described method also comprises
Described symbol table and file destination are loaded in flash memory FLASH; To designation sequence, it is the ASCII character size sequence according to designation.
4. method according to claim 3, it is characterized in that, before in described symbol table and file destination are loaded into flash memory FLASH, also comprise and judge whether the space of flash memory FLASH meets the loading requirement of described symbol table and file destination, if met, described symbol table and file destination are loaded in flash memory FLASH, if do not meet, described symbol table and file destination be loaded in internal memory.
5. method according to claim 1, is characterized in that, the first orderly symbol array, second symbol array and address sort notation index array are merged and comprised:
Set up a symbol table management document, the number of version number, the number of globak symbol, the number of static symbol and the symbolic address index of described symbol table management document maintain symbol table;
Preserve the described first orderly symbol array, described second symbol array, described address sort notation index array and described symbol table management document, generate described symbol table.
6. a device that generates embedded program operation symbol table, is characterized in that, comprising: generation unit, extraction unit, sequencing unit and processing unit;
Described generation unit, for generating object file;
Described extraction unit, for the file destination from generating extract all symbolic information or from the file destination generating according to setting requirement extract symbolic information; Also for filtering out globak symbol information and static symbol information from the symbolic information of extracting;
Described sequencing unit, for the designation of described globak symbol information is sorted, generates the first orderly symbol array; The designation of described static symbol information is generated to second symbol array; Symbolic address to the symbolic information of extracting sorts, calculated address sequence notation index array;
Described processing unit, for the first orderly symbol array, second symbol array and address sort notation index array are merged, generates symbol table.
7. device according to claim 6, is characterized in that, the file destination that described generation unit generates is by source file being compiled and linked the file of generation, and the symbol table that described processing unit generates is binary file.
8. device according to claim 6, is characterized in that, also comprises loading unit;
Described loading unit, for described symbol table and file destination are loaded into flash memory FLASH,
Described sequencing unit is the ASCII character size sequence according to designation to designation sequence.
9. device according to claim 8, is characterized in that, also comprise, and judging unit,
Described judging unit, for judging whether the space of flash memory FLASH meets the loading requirement of described symbol table and file destination, described loading unit, while requiring for meet the loading of symbol table and file destination in the space of described FLASH, described symbol table and file destination are loaded in flash memory FLASH, when the loading that does not also meet symbol table and file destination for the space at described FLASH requires, described symbol table and file destination are loaded in internal memory.
10. device according to claim 6, is characterized in that, described processing unit merges and comprises the first orderly symbol array, second symbol array and address sort notation index array:
Processing unit is set up a symbol table management document, described symbol table management document is for the number of the version number of maintain symbol table, the number of the number of globak symbol, static symbol and symbolic address index, described processing unit is preserved the described first orderly symbol array, described second symbol array, described address sort notation index array and described symbol table management document, generates described symbol table.
CN201310741877.1A 2013-12-27 2013-12-27 A kind of method and apparatus generating embedded program operation symbol table Active CN103677851B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310741877.1A CN103677851B (en) 2013-12-27 2013-12-27 A kind of method and apparatus generating embedded program operation symbol table

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310741877.1A CN103677851B (en) 2013-12-27 2013-12-27 A kind of method and apparatus generating embedded program operation symbol table

Publications (2)

Publication Number Publication Date
CN103677851A true CN103677851A (en) 2014-03-26
CN103677851B CN103677851B (en) 2016-07-27

Family

ID=50315518

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310741877.1A Active CN103677851B (en) 2013-12-27 2013-12-27 A kind of method and apparatus generating embedded program operation symbol table

Country Status (1)

Country Link
CN (1) CN103677851B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107193604A (en) * 2017-05-25 2017-09-22 深圳震有科技股份有限公司 Embedded system loads method, storage medium and the terminal of symbol table

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100511177C (en) * 2006-11-06 2009-07-08 中兴通讯股份有限公司 Symbol locating method of embedded system
CN101251799B (en) * 2008-04-16 2010-09-29 中兴通讯股份有限公司 Apparatus and method for implementing management
CN101339507B (en) * 2008-08-15 2011-10-26 中兴通讯股份有限公司 Method for creating embedded program operation symbol table
CN101706735A (en) * 2009-11-26 2010-05-12 中兴通讯股份有限公司 Embedded system and method for acquiring symbol table by same

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107193604A (en) * 2017-05-25 2017-09-22 深圳震有科技股份有限公司 Embedded system loads method, storage medium and the terminal of symbol table

Also Published As

Publication number Publication date
CN103677851B (en) 2016-07-27

Similar Documents

Publication Publication Date Title
CN107918666B (en) Data synchronization method and system on block chain
CN107958057A (en) A kind of code generating method and device for being used for Data Migration in heterogeneous database
CN106843840B (en) Source code version evolution annotation multiplexing method based on similarity analysis
CN101430714B (en) Content structuring process method and system based on model
CN104360865A (en) Serialization method, deserialization method and related equipment
CN102541529A (en) Query page generating device and method
CN102279847A (en) Method and device for internationalizing software system
CN101763255A (en) Format conversion method and device of special interface tool
CN101251799B (en) Apparatus and method for implementing management
CN102110102A (en) Data processing method and device, and file identifying method and tool
CN103714116A (en) Webpage information extracting method and webpage information extracting equipment
CN113609820A (en) Method, device and equipment for generating word file based on extensible markup language file
CN101673299B (en) ERP system and data search method and device thereof
CN105095304A (en) Log template generation method and equipment
CN105550169A (en) Method and device for identifying point of interest names based on character length
CN101553779A (en) Migration apparatus which convert application program of mainframe system into application program of open system and method for thereof
CN105160001A (en) Physical memory mirror image document analysis method of Linux system
CN101046746A (en) Code management in a distributed software development environment
CN109491884A (en) Code method for testing performance, device, computer equipment and medium
CN103677851B (en) A kind of method and apparatus generating embedded program operation symbol table
CN101339507B (en) Method for creating embedded program operation symbol table
CN102710833A (en) Mobile phone test case and automatic generation method thereof
CN103559574A (en) Method and system for operating workflow
CN115203494A (en) Text-oriented time information extraction method and device
CN111966930B (en) Webpage list analyzing method and system based on XPath sequence

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant