JPH0298740A - Do implied list processing system - Google Patents

Do implied list processing system

Info

Publication number
JPH0298740A
JPH0298740A JP25075688A JP25075688A JPH0298740A JP H0298740 A JPH0298740 A JP H0298740A JP 25075688 A JP25075688 A JP 25075688A JP 25075688 A JP25075688 A JP 25075688A JP H0298740 A JPH0298740 A JP H0298740A
Authority
JP
Japan
Prior art keywords
output
rtp
sequence
type
call
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.)
Pending
Application number
JP25075688A
Other languages
Japanese (ja)
Inventor
Hitoshi Fujii
藤井 等
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.)
NEC Corp
Original Assignee
NEC Corp
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 NEC Corp filed Critical NEC Corp
Priority to JP25075688A priority Critical patent/JPH0298740A/en
Publication of JPH0298740A publication Critical patent/JPH0298740A/en
Pending legal-status Critical Current

Links

Abstract

PURPOSE:To reduce the number of actual running steps and to perform an output processing at high speed by reducing the call of an RTP by changing an input/output list to a linear DO implied list. CONSTITUTION:A source WRITE(1) [1(K)*J(K), K=1,N] is executed in a source program 1. At a DO loop developing part 211 in an object program generating means 21, the part of a DO implied list is developed in a DO text, and an object program 31 to store a value of I(K)*J(K) in work(K) according to a DO variable K is generated. At an output call part 212, an object program 32 to call the RTP is generated after information with respect to the type of the work, etc., is generated. As a result, the DO implied list linear to the DO variable can be generated by converting the input/output list from [I(K)*J(K), K=1,N] to [work(K), K=1,N], and a processing can be performed only one time of call of RTP according to a FORTRAN compiler. In such a way, it is possible to reduce the number of actual running steps and to perform the output processing at high speed.

Description

【発明の詳細な説明】 〔産業上の利用分野〕 本発明は、 FORTRA、N言語のうち、出力文;・
cD。
[Detailed Description of the Invention] [Industrial Field of Application] The present invention applies to output sentences of FORTRA and N languages;
cD.

形並びを指定した時の処理方式に関するものである。It concerns the processing method when a shape sequence is specified.

〔従来の技術〕[Conventional technology]

一般にオペシーティ/グアステム(以下O8と略記する
。)にはFORTRA、N言語(日本規格協会発行の[
電子計算機プログラム言語FORTRA、N 、 、l
l5C−6201−1982J参照)の入出力並びに対
応しデータを処理するような機能は具備していない。
In general, operating system/guastem (hereinafter abbreviated as O8) uses FORTRA, N language (published by Japanese Standards Association [[
Electronic computer programming language FORTRA, N, , l
15C-6201-1982J) and functions for processing corresponding data.

そのためにFORTRAN文法とOS機能との間の機能
差を埋める目的でFORTRAN実行時入出力制御機構
(以下RTPと略記する)が存在する。出力文の処理の
場合は、 FORTRANコン・ンイラは出力並び項目
対応に型、長さ、格納アドレス等の情報を作成した後、
 RTPに制御を渡すような目的プログラムを作成する
。例えば。
For this reason, a FORTRAN runtime input/output control mechanism (hereinafter abbreviated as RTP) exists for the purpose of bridging the functional difference between the FORTRAN grammar and the OS functions. When processing output statements, the FORTRAN controller creates information such as type, length, storage address, etc. for each output list item, and then
Create a target program that passes control to RTP. for example.

■rTE(D A 、 B の場合。■rTE(D A, B in the case of.

Aの情報作成 RTP呼び出し Bの情報作成 RTP呼び出し というように処理する。A's information creation RTP call B's information creation RTP call Process as follows.

出力並びにDO並びが現れた場合も同様でVIIRIT
E(1)  (A(I)、I=1.N)の場合はDO形
並びをDOループに展開して以下のように処理する。
The same applies when output and DO sequence appear. VIIRIT
In the case of E(1) (A(I), I=1.N), the DO type sequence is expanded into a DO loop and processed as follows.

DO  I=1.N A(I)の情報作成 RTP呼び出し END D 0 FORTRANコンノやイラによっては、この例のよう
にDO変数に線形(増分値が一定)の場合は、D。
DOI=1. N A (I) information creation RTP call END D 0 Depending on the FORTRAN controller and layout, if the DO variable is linear (the increment value is constant) as in this example, D.

形並び評価時に、DO変数を評価することで全要素の格
納されているアドレスが確定することから。
This is because the addresses where all elements are stored are determined by evaluating the DO variable when evaluating the shape sequence.

最初のアドレス、増分値、繰り返し数等の情報を追加す
るのでRTP呼び出しの回数を1回に減らす処理をして
いる。
Since information such as the initial address, increment value, and number of repetitions is added, the number of RTP calls is reduced to one.

A(1)〜A(N)の情報作成 RTP呼び出し しかし、このようなコン・ぐイラでも。Information creation for A(1) to A(N) RTP call But even in such a con guira.

WRITE(1) (I(K) * J(K) 、 K
= 1 、 N )というように式がDO形並び中に指
定された場合。
WRITE(1) (I(K) * J(K), K
= 1, N) when an expression is specified in a DO type array.

あるいは。or.

V/RITE(1) (A(I(K))、 K= 1 
、 N )というようにDO変数に線形でない場合は、
D。
V/RITE(1) (A(I(K)), K= 1
, N), if it is not linear in the DO variable,
D.

形並び評価時にDO変数を評価するのみでは全要素が格
納されているアドレスが確定しないために前のような処
理はできず、それぞれ以下のようにDOループに展開し
ている。
If only the DO variable is evaluated during the evaluation of the shape arrangement, the addresses where all the elements are stored cannot be determined, so the processing as before cannot be performed, and each is expanded into a DO loop as shown below.

DO  K=1.N L = I(K) * J(K) Lの情報作成 RTP呼び出し END D 0 DO    K=1.N L = A (I (K) ) Lの情報作成 RTP呼び出し END D O 〔発明が解決しようとする課題〕 一般に、 RTP呼び出しの回数が多くなれば、それだ
けの出力のだめの情報設定等により、実走行ステップが
増加するため出力処理は遅くなる。
DOK=1. N L = I(K) * J(K) L information creation RTP call END D 0 DO K=1. N L = A (I (K)) L information creation RTP call END DO [Problem to be solved by the invention] In general, as the number of RTP calls increases, the number of outputs increases due to information settings, etc. Output processing becomes slower because the number of travel steps increases.

そこで本発明の技術的課題は、上記欠点に鑑み実走行ス
テップを減らし出力処理を高速に行うことができるDO
形並び処理方式を提供することである。
In view of the above-mentioned drawbacks, the technical problem of the present invention is to provide a DO system that can reduce the number of actual driving steps and perform output processing at high speed.
The purpose is to provide a format processing method.

〔課題を解決するだめの手段〕[Failure to solve the problem]

本発明によれば、 FORTRAN言語グロセソサを備
える計算機システムで、出力並びとして、DO形並びの
評価時にDO変数のみからではDO形並びで指定した全
要素の値が確定できないようなり。
According to the present invention, in a computer system equipped with a FORTRAN language glossor, when evaluating a DO type sequence as an output sequence, the values of all elements specified in the DO type sequence cannot be determined from only the DO variables.

形並びを指定した時の処理において、まず翻訳部が準備
した作業用領域に出力並びを移送するり。
In the process of specifying a format sequence, first the output sequence is transferred to the work area prepared by the translation department.

ルーノに展開し、そこで作成された作業用領域に対する
情報を出力制御手段に渡して出力制御手段を呼び出すこ
とで、DO変数を評価するのみでDO形並びで指定され
た全要素の値が確定できるDO形並びの形に変換するこ
とを特徴とするり。
By expanding to Runo, passing information about the work area created there to the output control means, and calling the output control means, the values of all elements specified in the DO type arrangement can be determined just by evaluating the DO variables. It is characterized by converting into a DO-shaped arrangement.

形並び処理方式が得られる。A form ordering processing method is obtained.

〔実施例〕〔Example〕

次に2本発明の1実施例について図面を参照しながら詳
細に説明する。
Next, one embodiment of the present invention will be described in detail with reference to the drawings.

第1図は2本発明の1実施例を示す構成図である。第1
図を参照すると9本発明の1実施例は。
FIG. 1 is a block diagram showing one embodiment of the present invention. 1st
Referring to Figure 9, one embodiment of the present invention is shown.

ソースグログラム1と、翻訳部2と目的プログラム3と
RTP 4と主記憶装置5から構成される。翻訳部2中
にDOルー!展開部211と出力呼び出し部212とか
らなる目的プログラム作成手段21がある。主記憶装置
5は配列I、J、翻訳部2が作業用領域として用意した
配列workおよびworkの情報等からなる。
It consists of a source program 1, a translation section 2, a target program 3, an RTP 4, and a main storage device 5. DO Lu during Translation Department 2! There is a target program creation means 21 consisting of an expansion section 211 and an output calling section 212. The main storage device 5 consists of arrays I, J, arrays WORK prepared as work areas by the translation section 2, and information on WORK.

次に1本実施例の動作を第1図を用いて説明する。ソー
スプログラム1内で ■ITE(1) (1(K) * J(K) 、 K=
 1 、 N )というソースを実行することを考える
Next, the operation of this embodiment will be explained with reference to FIG. ■ITE(1) (1(K) * J(K), K=
1, N).

このソースでは、出力並びが式であるために。In this source, the output sequence is an expression.

DO形並び評価時にはDO変数のみからでは全要素の値
は確定できない。そのだめ、目的プログラム作成手段2
1中のDOループ展開部211ではDO形並びの部分を
DO文に展開しDO変数KK従ってI (K)木J(K
)の値をwork(K) K格納する目的プログラム3
1を作成する。出力呼び出し部212ではwo rkの
型等の情報を作成した後RTPを呼び出す目的プログラ
ム32を作成する。
When evaluating a DO type arrangement, the values of all elements cannot be determined from the DO variable alone. No, purpose program creation means 2
The DO loop expansion unit 211 in 1 expands the DO type sequence into a DO statement and converts the DO variable KK and therefore the I (K) tree J (K
) Purpose program 3 to store the value of work(K) K
Create 1. The output calling unit 212 creates information such as the work type, and then creates a target program 32 that calls RTP.

この結果、入出力並びが、 (I(K)*J(K)、に
=1 。
As a result, the input/output sequence becomes (I(K)*J(K),=1).

N)から(work(K)、 K = 1 、 N )
 VC変換されることでDO変数に線形なDO形並びと
なりFORTRANコン・ぞイラによっては1回のRT
P呼び出しで処理可能になる。
N) to (work(K), K = 1, N)
By VC conversion, the DO variable becomes a linear DO type arrangement, and depending on the FORTRAN controller, one RT
It can be processed by calling P.

〔発明の効果〕〔Effect of the invention〕

以上説明したように、線形なりo形並びに変更すること
でRTPの呼び出しが減らすことが可能になり、これに
より実走行ステツプ数が減るため。
As explained above, by changing the linear or o-type arrangement, it is possible to reduce the number of RTP calls, which reduces the number of actual running steps.

出力処理を高速に行うことができる。また、波及効果と
して、ベクトル機構をもつ計算機システムにおいて、D
Oループに展開した部分がベクトル化できれば、より高
速に処理することが可能になる。
Output processing can be performed at high speed. In addition, as a ripple effect, in a computer system with a vector mechanism, D
If the part expanded into an O-loop can be vectorized, it will be possible to process it faster.

【図面の簡単な説明】[Brief explanation of drawings]

第1図は本発明の一実施例を示す構成図である。 1・・・ソースプログラム、2・・・翻訳部、21・・
・目的グロダラム作成手段、211・・・DOループ展
開部、212・・・出力呼び出し部、3・・・目的プロ
グラム、31・・・DOシル−作成目的プログラム、3
2・・・RTP呼び出し目的プログラム、4・・・RT
P 、 5・・・主記憶装置、51・・・配列工、52
・・・配列J、53・・・配列work 、 54・・
・workの情報。
FIG. 1 is a block diagram showing an embodiment of the present invention. 1... Source program, 2... Translation department, 21...
・Objective Grodarum creation means, 211... DO loop expansion unit, 212... Output calling unit, 3... Objective program, 31... DO sill-creation objective program, 3
2...RTP calling purpose program, 4...RT
P, 5... Main memory device, 51... Array engineering, 52
...Array J, 53...Array work, 54...
・Work information.

Claims (1)

【特許請求の範囲】[Claims] 1)FORTRAN言語プロセッサを備える計算機シス
テムで、出力並びとして、DO形並びの評価時にDO変
数のみからではDO形並びで指定した全要素の値が確定
しないようなDO形並びを指定した時の処理において、
まず翻訳部が準備した作業用領域に出力並びを移送する
DOループに展開し、そこで作成された作業用領域に対
する情報を出力制御手段に渡して出力制御手段を呼び出
すことで、DO変数を評価するのみでDO形並びで指定
された全要素の値が確定できるDO形並びの形に変換す
ることを特徴とするDO形並び処理方式。
1) Processing when a DO type sequence is specified as an output sequence in a computer system equipped with a FORTRAN language processor, in which the values of all elements specified in the DO type sequence cannot be determined from only the DO variables when evaluating the DO type sequence. In,
First, it is developed into a DO loop that transfers the output sequence to the work area prepared by the translation department, and the DO variable is evaluated by passing the information about the work area created there to the output control means and calling the output control means. A DO-type array processing method characterized by converting the DO-type array into a DO-type array in which the values of all elements specified in the DO-type array can be determined by using the following methods.
JP25075688A 1988-10-06 1988-10-06 Do implied list processing system Pending JPH0298740A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP25075688A JPH0298740A (en) 1988-10-06 1988-10-06 Do implied list processing system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP25075688A JPH0298740A (en) 1988-10-06 1988-10-06 Do implied list processing system

Publications (1)

Publication Number Publication Date
JPH0298740A true JPH0298740A (en) 1990-04-11

Family

ID=17212573

Family Applications (1)

Application Number Title Priority Date Filing Date
JP25075688A Pending JPH0298740A (en) 1988-10-06 1988-10-06 Do implied list processing system

Country Status (1)

Country Link
JP (1) JPH0298740A (en)

Similar Documents

Publication Publication Date Title
JP3032031B2 (en) Loop optimization method and apparatus
JP2666847B2 (en) Heterogeneous language communication method
JPH06324881A (en) Compiler device with superposition deciding function of memory data
JPH0298740A (en) Do implied list processing system
ATE387993T1 (en) ROBOT SYSTEM AND METHOD AND SOFTWARE FOR THE ROBOT SYSTEM
JP2585793B2 (en) Compiler system
US5748965A (en) Language processing method for calculating optimum address of array
JPH086797A (en) Constant reference optimizing processor
JPH04268928A (en) Emulation device and semiconductor device
JPS64725B2 (en)
JP2539070B2 (en) Compiler processor
JP3218566B2 (en) Inline processing equipment
JPS60220468A (en) Vector arithmetic control system
JPH08171554A (en) Optimizing compiler for vector operation
JPH0831091B2 (en) Compile processing method
JP2809073B2 (en) Array memory allocation method
JPH03269729A (en) Logical language processing system
JPH1124939A (en) Program conversion method
JPH0588908A (en) Object output system for cross compiler
JPH0713962A (en) Compiler device
JPH05143356A (en) Compiler device
JPS62196768A (en) Busy range reduction processing system for vector register
JPH0581038A (en) Compiler
JPH06119203A (en) Debugging line deleting device
JPH01180637A (en) Estimating system for instruction part