JP2000076053A - Character string retrieval and display device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To easily meaningful retrieval in consideration of the constitution of a program without any waste by retrieving which constituent element includes an arbitrary character string inputted from an input device within a specified retrieval range and finding the description line position of a function including the specified character string by referring to a stored function list. SOLUTION: A character string retrieval setting part 111 is used first and the character string to be retrieved and its retrieval range are specified through an input/output device 102. A character string retrieval part 112 acquires a function list of modules having the same name as a specified module name according to the specified module name and transfers and stores it as a function list 115 in a memory 103. Then the function start line position and function end line position in the function list 115 are obtained. When the module is not at the end, it is checked whether or not there is the specified character string in the obtained line and a character string retrieval result finding part 113 is used to check which function the character string is present in according to the position of the line.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a character string search and display device for searching and displaying an arbitrarily designated character string from a source program.

[0002]

2. Description of the Related Art Conventionally, a search function provided in an operating system and a search function used in a program development environment of a personal computer are provided as a function having a function of searching for and displaying an arbitrarily designated character string from a source program. is there.

[0003]

However, the above prior art has the following problems. (1) Before specifying a character string, the user must check the search range by himself and specify it.

(2) In order to perform an effective search, it is necessary to grasp the configuration of the development environment.

(3) In addition, a plurality of ranges cannot be specified at one time. Therefore, it is necessary to change the search range many times to search for a schedule or to create and execute a simple script.

(4) Further, only a directory or a file can be designated as a search range, and a search in consideration of a program configuration cannot be performed. For example, it is not possible to easily search for a character string to be searched in all the source programs that make up a program, and a search must be performed by specifying a search command several times according to the configuration of the development environment. Must
Also, only files and directories can be specified,
There is a case where the search range is shorter than the planned search range or a case where a search is made to an unnecessary directory.

(5) Also, when examining the use of a function in a library that is commonly used by several programs, if a search command is used, the program may determine which program or Since it is necessary to check whether it is related to the library, it is troublesome and the search range cannot be narrowed easily. Therefore, if the same function name exists in different libraries, it is not included in the configuration of the target program The library may also search and output extra search results that the user does not need.

(6) As for the search result, a file name and a row / column position are usually presented, but detailed information such as which function is used is not known. Therefore, in order to know detailed information, it is necessary to jump to the reported row / column position using an editor.

SUMMARY OF THE INVENTION The present invention has been made to solve the above-described problems. It is an object of the present invention to make it possible to easily perform a meaningful search in consideration of the structure of a program without waste and to use an editor. Without having to start
It is an object of the present invention to provide a character string search device capable of obtaining detailed information such as which function is used.

[0010]

SUMMARY OF THE INVENTION In order to achieve the above object, the present invention provides a character string search for searching and displaying an arbitrary character string designated by an input device from a source program stored in a storage device. A display device, comprising: storage means for storing a structure of a component such as a library or a module constituting a source program to be searched, including information on its relation and a function list used in each component; Search range setting means for designating all or a part of the components of the source program as a search range;
A search means for searching in which component an arbitrary character string input from the input device is described in a specified search range as a search target, and specifying a specified character in the searched component Indexing means for determining the description line position of the function including the column with reference to the function list stored in the storage means, and display processing means for displaying a source program statement including the determined description position It is characterized by the following.

[0011]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the character string retrieval and display device of the present invention will be described below in detail with reference to the drawings. FIG. 1 is a block diagram showing an embodiment of a character string search and display device 100 according to the present invention, which includes a central processing unit (CPU) 101 for performing a character string search process, an input unit 102a, and an output unit 102b. , An input / output device 102 for inputting various commands for search and a character string to be searched, and outputting a search result, a memory 103 storing data and programs for search processing, association between various programs, and the like. And an external storage device 104 in which design information indicating the above is stored as a design information database 104a.

The memory 103 stores a character string search setting section 111, a character string search section 112, a character string search result indexing section 113, and a character string search result display section 114, which are processing programs for realizing a character string search process. Have been. In addition, a function list 115 and search result information 116 are stored as data. String search setting unit 111
Is used to set a character string to be searched and a search range, and the character string search unit 112 searches for the designated character string. The character string search result indexing unit 113
Will return if the specified string is extracted from the search results.
To determine which function the string is in,
The character string search result display unit 114 displays the search result on the input / output device 1
02 is displayed on the output unit 102b.

As shown in FIG. 2A, the design information database 104a stored in the external storage device 104 includes identification numbers (ID) 201 of various programs being designed or designed in a certain program development project.
Type 202, name 203, destination 204, source 20
5. Design information such as a storage location pointer 206 of the program body is stored in units of a program. In the example shown in FIG. 2A, the project AAA is
In the related destination 204, “have: 2, have: 3, have
e: 4 ", ID = 2, ID = 2
3, program oed with ID = 4, library libo
lc, liboru.

The program oed is stored in the related destination 204
Since “have: 5, have: 6” is set in the module oed. c and com. c is included. Also, this program oed is sent to the related destination 204 as “ref
er: 3, refer: 4 ”, the library liboc, l of ID = 3 and ID = 4 is set.
It is shown that there is a reference relationship with iboru. In addition, the program oed stores “have:
Since “1” is set, it indicates that the project belongs to a lower level of the project AAA of ID = 1.

Storage location pointer 206 of program body
Indicates, directly or indirectly, the address where the program body of each program name is stored. As shown in FIG. 2B, the program body corresponding to the position (address) indicated by the pointer 206 is stored. Have been.

FIG. 3 is a flowchart showing a process for searching a character string specified by the user from the input / output device 102 from an arbitrary program. In this example, a module is specified as a search target program, and the search for the module is performed. A description will be given of a case where the present invention is implemented. First, a character string to be searched and a search range are specified from the input / output device 102 using the character string search setting unit 111 (step 301). As a method of specifying the search range in the present embodiment,
There are (1) a method of specifying a project, a program, and a module in resource units, and (2) a method of specifying a program and a module at a search level. How to specify the search range will be described later. Here, it is assumed that one module file as a search target program is specified by a module name.

When a character string to be searched and a module name to be searched are specified, the character string search unit 112 performs a function of a module having a name 203 matching the module name based on the specified module name. The list is acquired, transferred and stored as the function list 115 in the memory 103 (step 302).

The function list 115 is obtained by analyzing each resource (project, program, library, module) in the design information database 104a by the language analysis device 105, and identifying the function included in each resource, the starting line position, and the like. The list is obtained by extracting a function identifier 401, a function start line position 402, and a function end line position 403 for each function name, for example, as shown in FIG. In FIG. 4, "demo-a
ge. The function list used in the module "c" is illustrated. This function list is transferred and stored in the memory 103 as the function list 115 when the search range is specified. However, what is transferred is the function list of the program belonging to the specified search range. As a result, the function list 115 including the function identifier 401, the function start line position 402, and the function end line position 403 is stored in the memory 103 for the module specified as the search target, as shown in FIG.

Next, the character string search unit 112 determines the function start line position 402 and the function end line position 40 in the function list 115.
3 is acquired (step 303). Next, it is determined whether or not the module is completed (the last line of the module) (step 3).
04) If the module ends, the search result is displayed (step 309). However, if it is not the end of the module, it is checked whether or not the specified character string exists in the obtained line (step 305). Then, using the character string search result indexing unit 113, it is checked which function is in the line position (step 306). At this time, the function list 115 is checked one by one, and the function identifier 401 whose line is “function start line position 402 ≦ line ≦ function end line position 403” is acquired. Then, the search result is stored as search result information 116 (step 307). As shown in FIG. 5, the search result information 116 includes a program identifier 501, a module identifier 502, a function identifier 503, a line position 504, and a content 50.
Consists of five. Thereafter, the data of the next row is obtained (step 308), and the process returns to step 304 to repeat the same processing.

In the search result display processing in step 309, the contents of the search result information 116 are displayed using the character string search result display section 114. FIG. 6 shows a search result display screen 6
00 is a diagram showing an example of the search string “year” 601 which is a search character string specified by the user at the top of the screen, and a line including this search character string “year” 601 as a function is a search result display window at the bottom of the screen. 608.

When the function on the corresponding line in the search result display window 608 is double-clicked with the mouse pointer 607, the source program of the corresponding module is displayed as shown in FIG. In this case, the search string "y
"ear" 601 as a function (in this example, the 40th
The (line) 704 is displayed so as to be substantially at the center of the search result display window 703. In FIG. 6, 60
2 is an operation button for canceling the search processing, 603 is an operation button for executing the search, 604 is an operation button for designating a module as a search target, 605
Is an operation button for designating a program as a search target, and 606 is an operation button for designating a project level as a search target level. In FIG. 7, reference numeral 701 denotes an operation button for specifying display of a line number, 702 denotes an operation button for highlighting a search character string by changing brightness or color, and 703 includes a specified character string. Function.

Next, a method of searching for a program line containing a specified character string by specifying a search range will be described. In the present embodiment, as described above, the method of specifying the search range includes (1) project, program,
Method to specify in resource unit called module, (2)
There is a method of specifying a program or module at a search level in the hierarchical direction.

In the former method (1), a search is performed up to the module level, which is the lowest level, by sequentially examining lower layers that the specified range has (have). . FIG. 8 shows a processing procedure when this method (1) is performed on a project. In FIG.
First, it is determined whether or not the search processing for the program / library possessed by the project has been completed (step 801), and if not, it is determined whether the program / library possesses it (step 802),
If not, a search for a specified character string is performed in the module / include header (step 803).
When the search processing up to the lowest level module / include header of the project is completed by the above processing, the search result is displayed (step 80).
4).

[0024] Thereby, the interrelationship between the programs and libraries possessed by the project is examined, and the program or library which is expected to contain the specified character string is not specified, and the program or library is relied on formal structure of the program. Then, the search processing can be performed up to the lowest level module / include header of the project. Also, by specifying an arbitrary program in the project as a search range, a search for a specified character string can be performed only within the specified program.

On the other hand, the latter method (2) is a method of searching using a relation established between a program and a library or a library and a library. FIG. 9 shows an example of this relation. This is different from the method (1) in that a formal combination of programs is used instead of a formal combination. In the figure, the program "oed"
Is directly related to the library "libolc",
It is combined with "liboru", "liborm", and "libocmn". The library “libolc” is further combined with the library “liboru”, and the library “li
boru "is combined with the libraries" liborm "and" libocmn ". Here, when the program “oed” itself is set to “level 1”, those directly related to the program “oed” are further related to “level 2”, and those directly related to the program “oed” are further related. Things "Level 3"
If the hierarchical level is defined in such a manner and the search level is given as "level 1", the search range is only in the program "oed".

However, if the search level is specified as “level 2”, the program “oed” and the library “libol
"c", "liboru", "liborm", "libocmn" are searched. In the downward direction of such an association tree, "level 1" to "level N" can be designated.
“Level N” is for performing a full search in a tree rooted at the program “oed”.

Further, "level M" is prepared. this is,
This is a search process in which a library is specified and a level N search is performed for each program referencing the library.
By using this “level M”, a specified character string can be searched from a range in which a certain library may be used. In FIG. 10, when the library “libolc” belonging to “level 2” of the program “oed” is searched at “level M”, the program “om” is obtained.
s "and" okscc "also refer to the library" libolc ", so they are searched, and as a result, the program" om
"Level N" is searched for "s", "okscc", and "oed".

FIG. 11 shows the processing procedure of this search method (2). In FIG. 11, first, it is checked whether or not “level M” has been designated (step 1101). If "level M" has been designated, the program referencing the target is checked and stored in the list (step 110).
2). However, if "level M" is not specified, the specified search target is stored in the list (step 1).
103).

Next, "level N" is applied to all the elements (programs, libraries, modules) in the list.
Is performed (step 1105), and when the search is completed (step 1104), the search result is displayed.
(1106).

FIG. 12 is a flowchart showing the details of the "level N" search process (step 1105) in FIG. 11. First, as a premise, a search target and a search level are passed to this process. A program / library search process is performed for this search target (step 1201). The details of this processing will be described later in detail. Then, after lowering the passed search level by "1" (step 1202), the following processing is performed for each library related to the search target.

That is, it is checked whether the search level is "level 1" (step 1204). If the search level is "level 1", a program / library search process is performed (step 1205). However, if the search level is not “level 1”, a search process of level N is performed (step 1206). Then, when the processing for the library associated with the user is completed, the search processing of “level N” is completed.

FIG. 13 is a flowchart showing the details of the program / library search process (steps 1201 and 1205) of FIG. 12. First, it is checked whether the program / library to be searched is unreferenced (step 13).
01). If it is not referred to, the specified character string is searched for each module / include header of the search target program / library (step 1303), and all modules / include headers of the search target program / library are searched. Is completed (step 1302), a reference flag is attached to the program / library to be searched (step 1304), and the program / library search process is terminated.

FIGS. 14 to 21 show examples of related diagrams of the program structure displayed on the input / output device 102. FIG. A screen 1400 in FIG. 14 shows a list of all the programs in the project up to the module level, and the programs “oed”,
Libraries “libolc.sl” and “liboru.
sl "and" libocmn.sl "are displayed in association with the module names of the lower layers.

FIG. 15 shows a display screen 1500 when the program "oed" is designated. When the program "oed" 1501 is designated by a mouse click operation, as shown in FIG.
The modules “oed.c” 1502 and “com.c” 1503 that the module 501 has (have) are highlighted.

FIG. 16 shows a display screen 1600 when the module “oed.c” is designated. When the module “oed.c” 1601 is designated by a mouse click operation, as shown in FIG. "O
ed. "c" 1601 is highlighted.

FIG. 17 shows a display screen 1700 when level 2 is specified.
, The level 2 libraries “libolc.sl” and “liboru.s” as shown in FIG.
“l” and “libocmn.sl” are highlighted in association with the upper layer program “oed” and the module name of the lower layer.

FIG. 18 shows an example of a display screen when a project is specified. When a project is specified, as shown in FIG. 18, the program “oed” and the library “liboc.
l "," liboru.sl "," libocmn.s "
“l” is highlighted in association with the module name of the lower hierarchy.

FIG. 19 shows a display example of a screen 1900 displaying the relation between the programs. When the program "oed" is designated, the program "oed" is highlighted as shown in FIG. A library having a reference relationship with the program “oed” is displayed with an arrow indicating the direction of the reference relationship. By the way, the relationship between the program “oed” and the library “libolc.sl” indicates that the arrow “refer” is the library “libol.
c. sl ", the program" oe "
d "refers to the library" libolc.sl ".

FIG. 20 shows a display example of a screen 2000 displaying the relation between programs when level 2 is designated. When level 2 is designated, as shown in FIG. .Sl "and" l
iboru. sl "are highlighted, and these libraries" libolc.sl "and" liboru.
sl ", the program" oed ", the library" libocmn.sl "," liborm_cl "
event. “sl” is displayed with an arrow indicating the direction of the reference relationship.

FIG. 21 shows a level 3 library "lib".
oru. 21 shows a display example of a screen 2100 displaying the relation between programs when "sl" is specified. When a level 3 library "liboru.sl" is specified, a level 3 library "lib" is displayed as shown in FIG.
oru. sl ”is highlighted, and the libraries“ libocmn.sl ”and“ li ”
beam_client. “sl” is displayed with an arrow indicating the direction of the reference relationship. A search range can be designated on the screens shown in FIGS. 14 to 21 to search for a target character string.

[0041]

As described above, according to the present invention, a meaningful search conscious of the structure of a program can be performed without waste.
It can be done easily. In addition, there is an effect that detailed information such as which function is used can be obtained without starting the editor one by one.

[Brief description of the drawings]

FIG. 1 is a block diagram showing an embodiment of a character string search and display device according to the present invention.

FIG. 2 is a diagram showing a configuration of a design information database of FIG.

FIG. 3 is a flowchart illustrating a procedure for searching for a designated character string.

FIG. 4 is a diagram illustrating an example of a function list.

FIG. 5 is a diagram illustrating an example of search result information.

FIG. 6 is a diagram illustrating a display example of a search result.

FIG. 7 is a diagram illustrating an example in which a line including a character string of a search result is displayed.

FIG. 8 is a flowchart illustrating a procedure when a search range is specified in file units of a program.

FIG. 9 is a diagram showing an example of a relation between programs.

FIG. 10 is a diagram showing another example of the relationship between programs.

FIG. 11 is a flowchart illustrating a procedure for searching for a target character string by specifying a search level.

FIG. 12 is a diagram showing a level N search processing procedure.

FIG. 13 is a flowchart showing a procedure of a program / library search process.

FIG. 14 is a diagram showing a display screen of a configuration example of a program to be searched;

FIG. 15 is a diagram showing a display screen when a program is designated as a search target.

FIG. 16 is a diagram showing a display screen when a module is designated as a search target.

FIG. 17 is a diagram showing a display screen when level 2 is specified as a search target.

FIG. 18 is a diagram showing a display screen when a project is specified as a search target.

FIG. 19 is a diagram illustrating a display screen when a program-related level 1 is designated.

FIG. 20 is a diagram showing a display screen when a program-related level 2 is designated.

FIG. 21 is a diagram showing a display screen when a program-related level 3 is designated.

[Explanation of symbols]

100: character string search and display device, 101: CPU, 102
... I / O display device, 103 ... Memory, 104 ... External storage device, 104a ... Design information database, 105 ... Language analysis device, 111 ... Character string search setting unit, 112 ... Character string search unit, 113 ... Character string search result split Output unit, 114: character string search result display unit, 115: function list, 116: search result information.

 ──────────────────────────────────────────────────の Continuing from the front page (72) Inventor Kenichi Shintoku 6-81 Onoecho, Naka-ku, Yokohama-shi, Kanagawa Prefecture Hitachi Software Engineering Co., Ltd. In-house F-term (reference) 5B075 ND03 ND23 ND35 NK02 NK14 NK32 NK37 NK50 PP25 PQ02 PQ32 5B076 DB05

Claims (3)

[Claims] 1. A character string search and display device for searching and displaying an arbitrary character string designated by an input device from a source program stored in a storage device, wherein a library, a module, etc., constituting a search target source program are provided. Storage means that stores the structure of each component, including information on its relation and a list of functions used in each component, and specifies all or some components of the source program to be searched as a search range Search range setting means for searching, a search means for searching for an arbitrary character string input from the input device described in any of the components with the specified search range as a search target, and a searched component Indexing means for determining a description line position of a function including a specified character string by referring to a function list stored in the storage means, String search display apparatus comprising: a display processing means for displaying the source program statements including the issued described position. 2. The structure of components such as libraries and modules stored in the storage means, information on relations, and a list of functions used in each component are stored in a source program to be searched using a language analyzer. 2. The character string search and display device according to claim 1, wherein the character string is analyzed and stored in advance. 3. The character string search display device according to claim 1, wherein said some components are specified at a hierarchical level of a source program to be searched.