JPS62264329A - Screen text editor processing system - Google Patents

Abstract

PURPOSE:To suppress the increase of the communication amount by sending back a changed part to a host computer after the source program to be edited is sent and processed, then collating the changed part with an unedited part to rewrite the editing result. CONSTITUTION:A source program file 102 is connected to a host computer processor 101; while a screen display device 105 and a keyboard input device 106 are connected to a work station 104. Then the processor 101 is connected to the station 104 via a communication circuit 103. Then the source program instructed by a user is written to the memory of the processor 101 from the file 102, then sent to the source buffer of the station 104. Then the source program is partly displayed on the device 105. The program is processed by an editing request received from the device 105 and this processing result is held by the replacement buffer of the station 104 together with a chain. Then the contents of the replacement buffer are sent back to the processor 101 together with an identifier for changed contents.

Description

Detailed Description of the Invention (Field of Industrial Application) The present invention relates to a method for editing and processing source programs for various programming languages on files from a workstation connected to a host computer, and in particular reduces the load on the host computer. The present invention relates to a screen text editor processing method that distributes processing.

(Prior art) Conventionally, this editor processing method executes editing processing on the host computer, and the workstation only displays one screen of the image attached to it on the host computer. from there to the workstation for display. Furthermore, the results of editing and input by the user on the workstation were sent back to the host computer on a screen-by-screen basis.

(Problems to be Solved by the Invention) The above-mentioned conventional screen text editor processing method is simply a modification of the processing method of the editor connected to the conventional Time Sharing System (TSS) on a screen-by-screen basis. Therefore, if there are many parts to be edited in a source program, or if the same source program parts are to be edited with high consistency, iI! It is necessary to transmit data from the host computer to the workstation in units of 11 songs, or to receive telephone calls from the latter to the former, and to maintain communication between the host computer and the workstation.
The disadvantage is that it increases.

Furthermore, there is a problem that editing processing is executed on the host computer and increases the load on the host combiator. In addition, even though the workstation screen is used, the secret processing is performed on the host computer, so workstations have become equipped with fine-grained editing functions as workstations have become more sophisticated and performant in recent years. The disadvantage was that it was not possible to make full use of it.

An object of the present invention is to send a source program to be edited to a workstation, execute text editing processing using screen functions on the workstation, and only edit the parts of the source program that have been changed. By sending the source program back to the host computer and writing the original source program back to the host computer's file according to the changes mentioned above, the above disadvantages can be eliminated, the increase in communication traffic can be suppressed, and editing functions can be fully utilized. The objective is to provide a structured screen test editor processing method.

(Means for Solving the Problems) The screen text editor processing method according to the present invention includes a source program sending means, an execution means, a return means, and a write-back means.

The source program sending means is for sending the source program to be edited onto the workstation.

The execution means is for executing text editing processing on the workstation.

The sending means is for sending back to the host computer only the part of the source program that is rarely changed out of the edited source program.

The write-back means is for comparing the changed source program with the source program before editing and writing back the edited source program onto the file.

(Example) Next, the present invention will be explained with reference to the drawings.

FIG. 1 is a block diagram showing the positioning within a system of an embodiment of the screen text editor according to the present invention. In FIG. 1, 101 is a device comprising a processing unit of a host computer, a memory, and a host editor executed in the processing unit. 1G2 is a source program file in which a source program is stored.

North program file 102 is connected to host computer 101 . 1.03 is a communication line for connecting the host computer and workstation. 104 is a device consisting of a workstation processing unit, memory, and a workstation editor executed on the processing unit. A screen display device 105 is connected to the workstation 104 and displays the output results of the workstation 104.

Reference numeral 106 denotes a keyboard input device, which is also connected to the workstation and is used to input data.

First, the host editor on the device i101 reads 71@next the source program from the source program file 102 into the memory on the device 101 according to a source program manual request command instructed by the user. When all of the read north programs are sent to the source buffer prepared in the memory on the workstation 104 via the communication line 103, the host editor on the device 101 enters a waiting state. During this time, the host computer 101 can use the processing device described above to execute other job programs.

The workstation editor on the workstation 104 displays a portion of the source program in the source buffer on the screen display device 105 and waits for the next editing request command input by the user. The user inputs a desired source program from the keyboard input device 106 while scrolling through the screen, and instructs M@request.

FIG. 2 is an explanatory diagram showing the structure and mutual relationship of a source buffer and an update buffer provided in a workstation. In FIG. 2, 201 is a source buffer, 202 is an update buffer, 203 and 210 are chain pointers, 204 is an identifier, and 205 is an update buffer.

Editing processing VC is performed character by character, word hypothetical, line (record) i
position, as well as changes, insertions, and substitutions for each record group.
This includes moving, copying, or deleting. Among these editing processes, processes that change the contents of the source program can be classified into three types: addition, modification, and deletion. In accordance with the eight types of processing described above, the workstation editor changes and stores the corresponding records in the source buffer 201 in the update buffer 202 prepared in the memory of the workstation 104.

In order to prevent the records from getting out of order,
Chaining is performed from the chain pointer 210 of the source buffer 201 (The source buffer 201 and update buffer 202 each have a chain pointer 210 in order to chain them in the order of input rows (records).
．． Prepare 203.

The record structure in the update buffer 2'02 includes a chain pointer 203 provided for each record, additions,
It consists of an identifier 204 indicating the content of changes such as modification or deletion, and update information 205 according to each identifier. The chain pointer 203 is provided to maintain the order of rows (records).According to the input order, it points from the logically previous record, and stores the memory address of the next record. put. This memory address is the address of the source buffer 201 or the address of the update buffer 202.

The identifier 204 is provided with codes for identifying four types of changes: addition, change, deletion, and reediting.

Next, we will explain how the workstation editor processes in response to a user's editing request.

FIG. 8 is an explanatory diagram showing the structure of the editing raid. In FIG. 3, 301, 305, 308, 310 are chain pointers, 302 is an addition identifier, 303 is the number of added records, 304 is an addition record, 306 is a change identifier, 30 is a change record, 309 is a deletion identifier,
311 is a re-editing identifier.

A request to add a record means to insert a record by adding one line (record) or multiple lines (records) after a specific record. The chain pointer 210 is changed corresponding to the relevant line and stored in the free area of the update buffer 202. Next, the additional records shown in FIG. 3 are placed in the update buffer. Replace the chain pointer 301 with a chain pointer to the north buffer, add an additional code to the identifier 302, and write the number of records added 303 and the added record 3 at the end.
Enter 04.

Requesting a record change means changing the contents of a record in the source buffer, and the workstation editor invalidates the original record in the source buffer that is being changed, so The chain pointer 210 of is changed and stored in the free area of the update buffer 201. Next, the change record shown in FIG. 3 is placed in the update buffer. Replace the chain pointer 305 with a chain pointer to the north buffer, and set the identifier 30
6, and the changed record 307 is placed after it.

A record deletion request means to delete a record in the source buffer, and the workstation editor changes and updates the chain pointer 210 of the record immediately before the record to be deleted in the source buffer. The data is stored in an empty area of the buffer 201. Therefore, the third
Place the figure deletion record into the update buffer. The chain pointer 308 is redirected to point to the next record of the deleted record in the source buffer, and a deletion code is entered in the identifier 309.

Edit requests in the source buffer are processed as described above, but records in the update buffer may be changed again by a user's edit request. Corresponding to this is the reedit record shown in FIG. The workstation editor changes the record chain record to be re-edited in the update buffer and stores it in the free area of the update buffer 201, and also uses its identifier 31.
Replace 1 with re-edit. Generates either user-directed addition, modification, or deletion records in free space in the update buffer.

As described above, based on the user's editing request, the chain pointer 210 in the source buffer is changed and stored in the update buffer, and the edited record is stored for the purpose of the update bank.

When the user finishes editing and sends a request to write back to the original file, the workstation editor sequentially scans the source buffer 301″f while following the chain pointer 210 and writes to the update buffer 202. Specify only the records that have been inserted.

As a result, the optimized lines 103 are input in the order of input.
The record number, identifier 204, and change information are sent back to the host editor of the host computer 101 through the host computer 101.

The host editor sequentially writes back the sent change records back to the source program file 1G2 while comparing them with the record numbers of the source program read into the memory.

(Effect of xA Akira) As explained above, the present invention is based on the test editor! By distributing execution from the host computer to the workstations, only the files between the host computer and the source program input/output workstations need to be executed, reducing the load on the host computer. It has the effect of being able to reduce the In addition, communication between the host computer and workstation is done on a file-by-file basis, not on a screen-by-screen basis, so the more editing processing you do, the more you can reduce the amount of communication between them. This has the effect of making it possible to perform test editing using very detailed editing functions.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing one implementation implementing a screen text editor according to the present invention. FIG. 2 is an explanatory diagram showing the structure of a source buffer and an update parameter provided in a workstation, as well as their relationship to each other. FIG. 3 is an explanatory diagram showing the structure of an edit record. 101.104--@device 102--・No 27' program file 103...-
Communication line 105... Document screen display device 106... Thousand-board input device 201... North buffer 202... Update buffer 203. 210, 301, 305, 308° 310...
... e-chain pointer 204 ... identifier 205 ... update buffer 302 ... addition identifier 303 ... number of fist added records 304 ... addition record 306 ... change identifier 30 ... change record 309 ...Deletion identifier 311...Cloudy reedit identifier

Claims (1)

[Claims] A source program transmitting means for transmitting a source program to be edited onto a workstation; an execution means for executing text editing processing on the workstation; a return means for sending only the modified source program portion back to the host computer; and a write-back means for comparing the changed source program with the unedited source program and writing back the edited source program onto a file. A screen text editor processing method comprising: