JPS62272323A - System for acquiring macro text - Google Patents

Abstract

PURPOSE:To reduce the number of actual inputs/outputs by adopting the constitution where plural macro texts are stored in an actual storage area. CONSTITUTION:A macro procedure initial processing means 3 retrieves a pertinent macro name to discriminate whether this macro name is registered in a macro name storage area 11 or not by a macro name retrieval means 5, and it is registered in the macro name storage area 11 by a macro name register means 6 if it is not registered there. One buffer is acquired by a buffer allocating means 7 and a buffer control means 12, and its address is registered, and the pertinent macro is inputted to this buffer from an external medium 16 by a macro text input means 8. Since plural buffers are provided, there is a high probability that the macro name of a called macro is registered, that is, inputted to the buffer.

Description

[Detailed Description of the Invention] 3. Detailed Description of the Invention [Field of Industrial Application] The present invention is applicable to a macro text acquisition method, especially when a language processing program is used and a macro call is specified in the source program. The present invention relates to a macro text acquisition method for acquiring macro text for macro expansion.

[Conventional technology]

In the conventional method of obtaining macro text a, whenever a macro call is specified in a source program, the macro text is obtained from an external medium storing the macro text each time.

The relevant macro is loaded into memory.

[Problem that the invention seeks to solve]

In such a conventional method, even if the macro is the same, each time a macro call is specified in the source program, the macro text is loaded from an external medium, which increases the number of input/output instructions.

There is a problem that the processing speed is slow.

[Means for solving problems]

The system of the present invention includes a plurality of buffers including an area for storing macro text and an area for concatenating the stored macro text within the macro.

a buffer management storage area for storing each address 3 of the starting point buffer and ending point buffer of inter-macro linkage and the number of used buffers;

A macro name storage area for storing the name of the stored macro and its buffer address.

A release chain connection means for connecting used buffers using a buffer management storage area and an inter-macro connection area in order to prevent reuse of the used buffers.

When retrieval of a buffer is requested to store macro text, the buffer f is retrieved based on the contents of the intra-macro concatenation area and the buffer management storage area, and the macro name storage area 16 and buffer management storage area are updated. and buffer management means.

If a macro call is specified in a source program or a macro statement, a macro name search means is provided that saves the macro name storage area, and as a result of the search, the macro text of only the unregistered macros is retrieved from an external medium. It is characterized in that it is stored in a puff 77.

〔Example〕

Next, a drawing about the invention? Please refer to the explanation! JJjru.

FIG. 1 is a bottom view showing an embodiment of the present invention.

Macro name storage area 11 that stores macro names necessary for translation of
, a buffer tape M buffer management record ttM13, an initialization means 1 for initializing the buffer table/buffer management storage area 13, a source program analysis means 2 for detecting a macro call from the source program program 15, and a macro A procedure initial processing means 3, a macro name search means 5 for searching the macro name storage area 11 for a called macro, a macro name registration means 6 for registering the macro name in the macro name storage area 11, and a macro text 100, etc. Should be accumulated (buffer table/buffer management storage area 1)
buffer allocating means 7 for increasing the buffer from 3;

Macro text input means 8 for inputting macro text for macro text analysis from external medium 16, and macro text analysis means 4 for analyzing the input macro text.
, buffer chaining means 9 for chaining multiple buffers when the macro cannot be stored in one buffer, release chain linking means 14 for linking the buffers to the release chain at the end of the macro text, and a buffer retrieval request. It consists of a buffer management means 12 for managing a buffer table and a buffer management storage area 13 when there is a problem. In Figure 81, - indicates the flow of control, and → indicates the flow of data.

Next, the operation of this embodiment will be explained according to the processing flow shown in FIG. Is the reference number 8 in Figure 2 in Figure 1? Two matching reference numbers.

The contents of each process are as follows: When the initialization means 1 completes the initialization of the macro name storage area 11X and the buffer table/buffer management storage area 13, the source program analysis means 2 reads the source program 15. E.O.
Read until F is detected. If a macro call is not specified in each line of the source program, the next line of the source program is read as is, but if a macro call is specified, the macro procedure initial processing means is first executed as follows. 3, the macro name search means 5 searches whether the macro salt is registered in the macro name storage area 11 or not, and if it is not registered, the macro salt is registered in the macro name storage area 11 by the macro name registration means 6. and buffer allocation means 7. The buffer management means 12 acquires one buffer and registers its address, and the external medium 16 also inputs the macro into the buffer using the macro text input means 8. Example 1: Since a plurality of bubbles 7a are provided in the present invention, there is a high probability that the macro salt called by the macro will be registered, that is, input into the buffer.

1 Macro text input is completed 1, + % Macro text analysis means 4 analyzes the macro statement in this micro text and expands the macro statement into the source program (However, the macro text cannot be stored in one buffer) If there is no macro text, the buffer allocator 7 performs the above-mentioned buffer allocation and the macro text input means 8 inputs the macro text, and analyzes the input macro text.As a result of the macro statement analysis, There is also a case where the macro statement further calls a macro, and in such a case, the macro procedure initialization processing is performed by the above-mentioned macro procedure initialization processing means.

Each buffer that stores each text of the macro that cannot be stored in one buffer is processed by the buffer chaining means 9, and the macro whose analysis has been completed is processed by the macro analysis completion processing means 10.
．． The release chain connection means 14 is used to update the buffer table/buffer management storage area 13, respectively.

When a request for retrieving a buffer is made by the buffer allocating means 7 or the prodigy chain linking hand 14, the buffer managing means 12 stores the buffer table/buffer completion management record 4.
The free buffer or the oldest buffer is retrieved by referring to the X memory 13, and the black name memory 11'& is updated.

Next one #1. The details of each component of the embodiment will be explained below in sequence.

As shown in FIG. 3, the macro name storage area 11 includes a macro name storage area 17 which is an area for storing macro salt, and a buffer (buffer table 1 to be described later) which stores macro text.
30), and a buffer address storage area 18, which is an area for storing addresses (one element of 30).

Buffer table/buffer management storage area 13.

As shown in FIG. 4, the address of the corresponding element in the macro name storage area 11 is stored.

≠# Contains a complete ringing macro name storage area address storage area 22, a buffer equivalence chain address storage area 23 for chaining buffers when the macro text does not fit in one puff. Wj for connecting the buffer whose macro text has been analyzed by the macro text analysis means 4 to the release chain
Late chain storage area 24. A release reverse chain storage area 25 for connecting the release chain in reverse, a macro text storage area 26 which is an area for storing macro text, a point storage area 19, and a release chain end storage area 20 for indicating the end of the aforementioned chain. and a buffer table element number storage area 21 indicating the next buffer of the buffer used up to now.
It consists of In FIG. 4, reference numeral 131 indicates seven puffs, and a buffer table 130 indicates a plurality of buffers 1.
Consists of 31.

The initialization means 1 initializes the macro name storage area 11 and the buffer table/buffer management storage area 13. The macro name storage area 17 is initialized with blank characters, and the buffer address storage area 18 is initialized with 9 values.

Next, regarding the source program analysis means 2.

This will be explained with reference to the flowchart shown in FIG. Referring to FIG. 5, when the source program analysis means 2 receives control authority from the initialization means 1.

First, one line of the source program 15 is read (27).

It is determined whether one line of the source program that has been read indicates the end of the source program (28), and if it has ended, the process ends.

If it does not end, search for a macro call within one line of the loaded source program (29), and determine whether a macro call has been made (30).
If a macro call has been made, macro processing is performed (31). If a macro call has not been made, the macro process (31) is not performed, and after that, the process of reading one line of the source program 15 is performed, and the process returns to the termination determination process (28) of the source program 15, and the termination determination process (31) is performed.
28) The following will be repeated.

As shown in the flowchart of FIG. 6, the macro procedure initial processing means 3 acquires the macro salt from the source program 15 in the macro processing 31 in FIG.
Using the macro salt, the macro name searching means 5 searches for a matching macro salt in the macro name storage area 17 in the macro name storage area 11 (33). When it is found that the macro salt is not registered (34), the macro salt is registered in the macro name storage area 17 by the macro name registration means 6 (35).

Next, refer to the buffer address storage area 18 in the macro name storage area 11 to determine whether a buffer has been set (
36). If no buffer is set, the buffer address storage area 18 is empty. If a buffer is set, the macro text does not need to be read from the external medium 16, which reduces actual input/output. is performed by buffer rocket means 7 (
37), Next, the allocated buffer (Double 6
．． The macro text is input into the macro text storage area 26) by the macro text input means 8 (38).

As shown in the flowchart of FIG. 7, the macro name search means 5 moves the address pointer to the beginning of the macro name storage area 11 (ff(39)) and moves the address pointer to the beginning of the macro name storage area 17 at that position.
It is determined whether or not is the final element (40), and whether it stores a blank character (41), and if it is multiplied by the blank character, it matches the t'Lta macro name received from the macro procedure initial processing means 3. 42), macro name storage area 110, positioning to the next element (43) is repeated. It is only registered when the macro salts match.

The macro name registration means 6 is entered in step 34 shown in FIG.
When the macro name search means 5 finds that the macro name has not yet been released as a result of the search result, the macro name search ends at the last element of the macro name storage area 17, as shown in FIG. It is determined whether or not (44). If it is a star element, it means that the puff 7 table 131 is full, so error processing should be performed (!6). Also, if it is not the final element, macro storage @17-\ of the macro salt is set (45).

Is the buffer allocation means 7 shown in Figure 6? It functions when it finds in step 36 that no buffer has been set. As shown in FIG. 9, first, the buffer manager Q 12 i (to acquire one more buffer 47)-
Set the buffer address in the buffer address storage area 18 (48), and set the macro name storage area 11 with the above buffer address in the macro name storage area address storage area 22.
(49).

The macro text input means 8 inputs macro text from the external medium 16 into the macro text storage area 26 allocated in this manner. Let's do it.

The macro text is the same size as the buffer 131.

Next, the macro analysis means 4 will be explained with reference to FIG. When the input of the macro text by the macro procedure initial processing means 3 is completed, the macro text analysis means 4 starts functioning.

First, one macro sentence of the input macro text is analyzed to determine whether it is a macro end sentence (50).

If it is an end sentence, the macro analysis end processing means lO performs macro end processing (51), and if it is an end sentence, it is determined whether the macro text ends or not using the address pointer of the buffer 131 (52).

The fact that the macro text has ended even though the macro has not ended means that the macro could not be stored in one buffer 131 because the size of the macro text and the buffer 131 were used. In this case, after performing the input 53 (same as 37) and the macro text input 54 (same as 38), the address pointer of the beginning of the macro text 131 is returned. Position 1 (55)L Return to step 5o.

If it is determined in step 52 that the macro text is not finished, it is checked whether the macro statement is a macro call (56), and if it is a macro call, the macro procedure initial processing means 3 executes the above-mentioned series of steps. Perform macro procedure initial processing 5 (57).

Further, if it is determined in step 56 that the macro statement is not a call, one macro statement processing, that is, the instruction specified by the macro statement is executed, and the macro statement is expanded into a source program statement (58). After step 57 or step 58 is completed, the address pointer of the buffer 131 is advanced to the next macro statement step 51, and the buffer equivalence chain address storage area 23 of the buffer 131 is completed.
fart.

Buffer 131 allocated at step 53
(60). In this way, when the macro cannot be stored in one buffer, the buffers storing the macro text are concatenated.

The macro termination processing means 10 performs macro processing termination processing and processing by the release chain connection means 14. As shown in FIG. 12, the release chain linking means 14 reads the contents of the release chain starting point storage area 19 (61) and checks whether it is 9-valued (62).

If the value is 9, write the 9 value to the release chain storage area 24 (6
3) The macro end statement is recognized in the release chain end storage area 20 (50), and the address of the buffer 131 (current buffer) storing the macro text is set (64).
).

8 at step 62 and release chain starting storage area 19 is 9
If it is not a value, that is, at least one macro 'l or C has been input in the buffer table 130, and if it has been released, the buffer 13 specified by the release chain starting point storage area 19 is
1 (referred to as the origin buffer) release reverse chain storage area 2
5 is set to the address of the current buffer 131 (65), and the address of the starting point buffer is set to the release chain storage area 24 of the current buffer 131 (66).

From step 64 or 66, the process moves to step 67, where a value of 9 is set in the release reverse chain storage area 25 of the current buffer 131, and then the address of the current buffer 131 is set in the release chain start storage area 19 (68). Figure 13 is 3
It shows how the three buffers A, Bg and C are sequentially connected as described above.

The buffer management means 12 is 5 as shown in FIG.

First, the contents of the buffer table element number storage area 21 are read and the buffer 13 included in the buffer table 130 is read.
It is compared with the number 1 to determine whether there is an empty buffer (69). When the contents of the buffer table element storage area 21 are not large, there is an empty buffer, and the buffer next to the buffer specified by the buffer equivalence chain address storage area 23 or the release chain end storage area 20 is conveniently used. It turns out (70)
.

The buffer table element number storage area 21 is updated.

If it is determined in step 69 that there is no free buffer, it is determined whether the contents of the release chain end storage area 20 are 9 values (72), and the most referenced buffer among the currently allocated buffers (13th buffer) is checked. In the example shown, the buffer person)
I can't reuse it.

It receives the buffer specified by the release chain end storage area 20 (73), updates the contents of the M release chain end storage area 20 (74), and then sets the value 9 in the corresponding buffer address storage area 18 (75). .

2. In the present invention, the error processing 76 ends abnormally when there are no more usable buffers.

〔Effect of the invention〕

As explained above, the present invention can reduce actual input/output by adopting a configuration in which a plurality of macro texts are stored in a real storage area.

[Brief explanation of the drawing]

FIG. 1 shows one embodiment of the present invention, and FIG. 2 shows a 70-chart z and FIGS. 3 to 14 for explaining the operation of this embodiment.
The figures up to the figures show details of the constituent elements of this embodiment. 1... Initialization means, 2... Source program analysis means, 3... Macro procedure initial processing means, 4... Macro text analysis means, 5.・
...Macro name search means, 6.Macro name registration means, 7.--Buffer allocation means, 8.
...--Macro text input means. 9...Buffer completed chaining f[, 10...Macro analysis end processing was completed, 11...Macro name storage area. 12...Buffer manager R, 1a...
Pabfataple buffer management storage area, 14...
...Release chain connection means, 15...Source program, 16...External medium, 1.7...
... Macro name storage area, 18 ... Buffer address storage area, 19 ... Release chain start storage area,
20... Release chain end storage area. 21...Buffer table element number storage area, 2
2... Macro name storage area address storage area, 23.
...Buffer equivalence chain address storage area, 24
......Release chain storage area, 25......Release reverse chain storage area, 26...Macro text storage area, 130...Buffer team 7'le, 13
1. A, B, C...Pass series

Claims (1)

[Scope of Claims] A plurality of buffers having an area for storing macro text, an area for intra-macro concatenation of stored macro texts, and an area for inter-macro concatenation, and a starting point buffer and an end point buffer for the inter-macro concatenation. a buffer management storage area for storing each address and the number of used buffers; a macro name storage area for storing the stored macro names and their buffer addresses; and a macro name storage area for storing used buffers. release chain linking means for linking the used buffers using the buffer management storage area and the inter-macro linking area; buffer management means for extracting a buffer based on the contents of a concatenation area and a buffer management memory and updating the macro name storage area and the buffer management storage area; and a macro name search means for searching the macro name memory, and the macro text of only the macros found to be unregistered as a result of the search is stored in the buffer from an external medium. method.