JPS6246371A - Graphic processing for data display windowed latently - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates generally to digital data systems, and more particularly to digital data systems in which a single display device is
The present invention relates to techniques for processing representations of data by such systems in environments that provide multiple logical representations that function in unison. Each logical display is a “window”
It is said as. Multiple windows may all be displayed at the same time in a whole, or some windows may be partially or completely covered by other windows.

Digital data systems have been equipped with display devices almost since their advent. The type of display that has been introduced to users and has proven to be the most flexible is the cathode ray tube display. In more recently developed forms of use, such displays do not have to divide the space available for each user on the display, for several programs, or for several processes. Instead, each user, program, or process is allocated a certain amount of display area.

Each such area is known as a "window".

Therefore, the window can be thought of as a unique logical display coexisting on top of the tangible display. A similar example is several sheets of paper on a desk: they may all be placed visibly at the same time, and some may completely (indistinctly) cover the others. Or even if it is manipulated so as to partially cover it.

When objects that have been obscured or obscured are uncovered again, they still contain all the information that was temporarily hidden from view.

The windows above the display may be operated in a similar manner, some of which may sometimes be partially or completely hidden from view above the display.

That is, they have the appearance of being "covered" by other windows. Additionally, the preferred embodiment shows operations performed on the window while the subsequent "uncovering" is not visible, even while the affected window or portion of the window is not visible on the screen. accomplishes that the window data is processed.

Until now, window opening has primarily been accomplished through software. While such windowing implementation has worked satisfactorily, it has been done at the expense of computational overhead. A user request, in the form of a software request, must achieve a level of translation by the software to derive a set of machine language instructions that the system can execute, even in the case of simple (i.e., unobstructed) windows. This means that it must be done. Another reason for this overhead pain is that the descriptive information (which is much more voluminous in a windowed display than in a simple single display) is completely replayed on every request. This means that it must be processed. There is no structural provision to preserve the results of previous calculations that affect those parts of the display that are not affected by this change. The more complex the functions of window openings, the more severe these overhead costs become.

The present invention discloses a method of processing a display of a data system, including a storage, a processor, a display, and a display interface. The processor is capable of executing machine language instructions that process the displayed data 8 directly (i.e., without intermediary translation by software). The method consists of providing a set of such instructions and a set of configuration descriptors describing characteristics of a window over the display. Bromo [1(:・1 :1 Tsusa receives each such command in turn)
1: Take j and associate it with the morphological descriptor,
:□1 care, wa, hei, oh, kayo 7, oh, 11...:1 data (correction table specified by IS correction command,
, create a demonstration.
111.1 Thus, one object of the present invention is to improve
1′.

*y-z073, □□. 8a, 6; 18th. 6. one. ,. . , 1□1e, □ i'11'
:1 To provide.
-11; Furthermore, another object of the present invention is to
11 degrees, 78, 7. T-Ayah, I-
Wow ;”1): Execute the windowed display directly without the need to
・11・'1 To provide a data system.
4'1゜4 Eh, Ao is also one. Additional □ Target, target is 9 open Yuga [11.I To retain intermediate calculation results regarding the displayed display.
51)・1 Providing a data system with increased efficiency
Do・i is to do.
1.1 Other objects and advantages of the present invention will be understood by those of ordinary skill in the art upon reference to the description of the preferred embodiment flt and the accompanying drawings.

Description of the Preferred Embodiment: In the prior art, the processing of windowed displays has been done by software. This is shown in FIG. (Figure 1 does not attempt to show the data system as a whole, but only those elements necessary to generate and create the display.) The system includes a central processing unit CPU 101, a memory 102, a display It is shown to consist of an intermediate plane 109 and a display 110. User software 103 (residing in memory 102) may include all aspects of the overall software, including software requirements for display services; such software requirements are provided by system software 104 (also Also memory 102
) is required. System software 10
4 translates the user's request and submits it to the CPU's instructions;
),・ Requests submitted by user software
[,・One, to work. 7. 7. tsu, ayu, 1'' 7A 26-7□. 5゜9□□o. 1) and update the display database to respond to any changes caused by current requests from the user software. 1.”

・1 Further referring to Figure 1, the system software
:,': 6 x7104 K,,i,°-'CCPU 10 t
ic! 1%lff1k*,) Machine language instructions are passed to element 106 (hard line) which directs arithmetic logic unit ALU 107'
;1 or by fine line means). Note that these are all "traditional" commands (ADD, MOV, etc.). All of the descriptive information in the display database 105 must be reprocessed to create a new screen bitmap 108. The screen bitmap 108 is then called by the current request from the user software.
, 5□Z/+)−y. , 3. -・・１□１、－ふい、３． □、Yo、Niwaa、Ai... ! ] The display intermediate image 109 (whether by programmed Ilo or by direct memory access means) reads and processes the bitmap and displays it 110.
generates appropriate signals to cause the information specified by bitmap 108 to be displayed.

The term "bitmap" is used here by convention and may refer to a character map for character-oriented displays, or a pixel map for pixel-oriented displays: In an oriented display, the smallest addressable element is the character position, even if the character position is occupied by any character from a limited number of character fonts. The selection of which character occupies a particular character position is determined by placing the two-component code representing that character in the corresponding position of the bitmap.

In a pixel-oriented display, the smallest addressable element is essentially determined by the size of the "dot" that would be made to appear on the screen by the electron beam if it were not moved. (This is referred to by the term "pixel," from which the term "pixel" was coined.) In the simplest pixel bitmap, a single bit position in the bitmap represents each pixel position in the display. wo table “°”
“-r y 7”oloQfiKh“1°1”凰
1. Turn on the lighting at the corresponding position on the screen
j・, and rOJ indicates "off". More complex execution i.

In the case of , some bits in the bitmap represent the positions of n pixels on the display;
:.

The intensity displayed at the pixel location indicates the color or both.
1. , even the prior art approaches can be successfully implemented ;]
There are 114. This is because all of the user's requests are translated.

This is because the software needs to
This is because the information is separate from the bitmap and is therefore forced to completely reprocess the descriptive information whenever any changes are desired on the display. Such implementation has been limited to fairly powerful machines. And even there, a substantial portion of the processing power is used up.

The method of the present invention enables the production of data systems that are capable of utilizing special purpose machine language instructions to process data in a windowed display, over and above the conventional instructions (CADD, NOV, etc.). and overcome these disadvantages. Since these instructions can be executed directly by the CPU, no intermediary software is required to translate them. They are executed directly within the CPU, so
A scratchpad memory can be included to capture descriptive information, eliminating the need to reprocess the descriptive information for every instruction. The method of the present invention thus uses significantly less processing power of a given machine. Otherwise, it is possible to implement the windowed display in smaller, less powerful machines than is possible in the prior art.
; Detailed explanation:
i-instruction execution and form I state descriptor: (・ The method of the present invention is shown in FIG. 2. (FIG. 2 attempts to show all the elements of the data system.)
”′.

-ch@<1. , Eh, □You 1. Let's make it
i:j [This is an attempt to show the main elements. Inventor
All of the data systems in which the 1 method is currently implemented (the hardware elements in Figures 10 and 1
Please refer to 1. You can see it in 1 degree.)
gj This data system also includes a CPU 201, memories 1-202, i□ and 6□203. Kaoka 1. oh
In this particular embodiment, the J display is a video monitor 204 oriented by pixels and oriented by letters 1□'. ,. 6yoyaji44203□, 6a. 1□・It is suitable for driving a video monitor. (2-bit pixels are used; black and white moni 2-0...a, yu4□o3k, 8
□6, [) For color monitors they are "
It includes "off" (black), "red", "green", and also "blue".

User software 208 is now capable of including instructions that directly stimulate CPU 201 for that purpose, although the software's requirement to manipulate the pit map to affect the display does not appear to be mandatory. . These are special-purpose instructions that allow the CPU hardware to build up a "screen image" directly into the pitmap, which is inherently much more efficient than manipulating the bitmap with traditional instructions. , for which the bitmap is an abstraction.

It can also be seen that a morphology descriptor 209 is required.

Several definitions are listed here in turn: The characteristics of a window, such as its height, width, and any customizations it may include, collectively form its "form." When a window is operated, its Although some become invisible, their forms continue to exist.

The entire data, including the data that specifies the form, is
□1.1. Known as "state descriptor"f' moves/exists a window
・For the record, a morphological descriptor is not provided for that purpose. ．． 7゜
1: Still referring to Figure 2, it appears that the user software 208 issues a software request to a piece of system software called the window manager. Costume.

The user can, if she wants, wide her self fang 0 form 1
Provide a child? <s B, l/' is 1
・The window manager provides them for her.
1□ and 95 possibilities exist・Many 0-L-f-・Many
In the environment of a large number of programs, it is desirable to arbitrate among the various programs competing for window space on the same tangible screen. .
Method f'""specific" display command 1 form descriptor"
Continuity is included, which is retrieved by the CPU as discussed below, and used by the CPU to modify the effects of the instructions. This is because the processing power of the windowed display is
Allows it to be taken out of software and placed directly into hardware.

The instructions written to the window are executed by the user software 208.
, they are submitted to CPU 201 where they are translated by microcode unit 205. In executing instructions, microcode unit 205 fetches a series of appropriate sub-instructions in response to each n instruction and directs them to ALU 207 .

As already mentioned, each of n such instructions includes an association with a form descriptor. ALU 207 interrogates configuration control record 212 (discussed in more detail later) to determine whether the configuration descriptor was captured into scratchpad memory 206 or stored in configuration outflow storage 213; if the latter. , it is retrieved from the form effluent storage 213 and stored in the scratchpad memory 20
6 and stored again. (Possibly replaced with another morphological descriptor, which is stored in the morphological outflow store 213)
; if neither is the case, the configuration descriptor is retrieved from the list of user-supplied configuration descriptors 209 , transformed into an internal configuration, and then imported into scratchpad memory 206 .

′″″1~°6″°”, Nu″i2!”°1°=-″
::Screen from window local coordinates provided by one I.

It consists of calculating global coordinates. (Knee f-H
・5″ion” “2/ +J -yogcKN&L,?
(I don't require you to know if there is one. [:j: Mayu/window is xl') - move around 9 on y but move around.
User convenience is enhanced if users are not required to provide new coordinates for each n new location. ) Referring to FIG. 3, a window is shown disposed on the screen. Inside the window are the user-specified origin 1'-0J307 (the user is free to specify the coordinates in the window by comparing them to this origin) and the point the user may try to manipulate [PJ308]. be. Listed in FIG. 3 are the global coordinates of the corners of the screen and the global and local coordinates of the associated points of the window: its four corners, the origin "O", and point rPJ. In the user-supplied configuration descriptor, the user specifies the height and width (in pixels) of the window and the local coordinates (relative to the origin "O") of the window's ULC (upper left column corner). requested to be specified. (Note that this implicitly specifies the location of the origin "O".

) Figure 4 shows the morphological descriptor of the internal morphology. The already mentioned variants include calculating and UL CC409 and 41 of the window
It consists of writing in the overall coordinates of O) and the overall 0.0 (B15) pointer. Since the morphology descriptor is captured as a morphology repository register, there is no need to recompute such information for subsequent queries about the same window.

Referring again to FIGS. 3 and 4, imagine that the user wishes to operate at point P308. The imported morphology descriptor provides the vector AE (global coordinates of E are 409 and 410) and the local coordinates of vector 0ECE are 413 and 414). The command input supplies a vector 0P (local coordinates of P: XL, YL compared to the origin 307). Vector A
P is computed as part of instruction execution.

Returning to Figure 2, the scratch band memory always contains a transformed translation of the most recently used morphology descriptor "ru". This can greatly speed up execution. This is because many forms are often used repeatedly in practice.

(Determination of the value of "n" is left to the designer of a particular implementation.)? 71-277'. 1. YuXplJ-y□. 6□
: Contains the image of what should be, so pit map 2
Execution of the current instruction may be considered complete when 15 has been updated to include the new display information specified by the current instruction. It is the display intermediate plane 2030 function that translates the pit map into a viewable display.
The timing is asynchronous with the timing of instruction execution.

ALU 207 may reconcile the previous contents of pit map 215 if the operation requested by the current command is a function of the previous display. ALU 207 will write the appropriate new portion of pit map 215, resulting in a corresponding new display on video monitor 204.

That method would not allow the user to write outside the window he was associated with. For example, if the user's command specifies a horizontal line length of 400 pixels within the window, i.e., only 200 pixels wide, only the portion of the line that falls inside the window will be written to the pit map 215; The rest will be ignored. This is known as "cutting out". Carrie's instructions are returned to her upon completion of the command to notify the user that the clipping has been completed.

Note that pit map 215 is contained in VRAM's (Video Random Access Memories). The VEAM's can access the ALU just like any other portion of main memory. VRAM'
What is different about s is that they are different from the display intermediate plane 20, as will be discussed later in the display memory section.
This is achieved by having special equipment to quickly remove the load of 3.

Being blocked = (divided window): 1ξ A window is blocked (partially covered) by another window
Also, complications arise in the aforementioned processing. Referring to Figure 1■5, window A302 is partially connected to window B501.
It can be seen that it covers the Before it was occluded, processing could view window B as a single entity, but now it must be viewed as a composite entity made up of several single entities. One section B1, B2
, and B3° (the term "compartment" refers to a portion of a window).
In order to keep their single entities as simple as possible, a constraint is imposed that the partitions must always be rectangular. - That is, this method does not allow to take into account the occluded rectangle or L-shaped remainder, but the L-shaped remainder
We request that it be divided into two rectangles, B2 and B3.

Users of window B are not required to know that they have been blocked (it may have been caused by different users, programs, and processes) and therefore provide form descriptors for their partitions. Don't bear the burden.

This method does this automatically, and in a sense it is transparent to the user. A morphological descriptor that describes a rectangle is known as a "simple morphological descriptor." (
A user-provided morphology descriptor that describes the entire window is a simple morphology descriptor. ) When requesting shading or dividing a window into sections, the process will automatically create a simple form descriptor for the partitions and also create a stand form descriptor for the window. . In future embodiments, this automatic creation may be performed under the control of microcode; in this embodiment, it is discussed later and calls the fault handler 211, which creates faults in software from microcode. done by software, invoked by the ability to cause

The complex form descriptor for a window essentially consists of a list of instructions to the simple form descriptors for the sections that make up the window. In the present embodiment, the "form side" recorder 212' exists 1111 with a zero indication. Another use of the form control recorder is for partitions and windows.
:・It is to maintain the locus of the bitmap position.

When a certain section is obstructed, it will be displayed above it. A, 2:z)-z77'
i11.1′: ′”°′″″7″″tu゛-M, e[v″9°7°o
It means that it will be overwritten by il, l data. Rather than abandon this information, recalculate it later when the parcel becomes visible again. and 76 k, also 5. 5.1□:
It may also be necessary when the user wants to manipulate data within that partition (it is possible to manipulate data even in invisible partitions).
:1'1・), so it is in the main memory.
-'11 off 2 p +)-:y e y)
? -y 7'yo2.48□ Wa,) 11th station is held. FIG. 6 shows the configuration control record registration reflecting the obstructed situation shown in FIG.
hB605 C2<AIBVCn. ) ”')FatF
j"j::.

It can be seen that it contains The configuration control recorder A points to the configuration descriptor A and the bitmap of the window A.

(Location inside bitmap 215 where information for window A was stored) Before being occluded, the configuration control recording structure of window B was similar to the structure just described for window A. However, in detecting the occurrence of occlusion, the process
Create new form descriptors for partitions B1, B2, and B3; move bitmap data for partition B1 from bitmap 215 to off-screen bitmap 7'214; pointers to the three new form descriptors (606,
608, and 610) and the off-screen bitmap 607. B2 bitmap 609, and B
Create a new form control recorder 605 containing pointers to the bitmap 611 of 3.

Subsequent user commands to operate window B can now be handled. For example (see Figure 5), if the user identifies a line from I to J in window B, then
Processing automatically translates into 3 requests = 1 for partition B3
For the line I-1' in □': □1□th,
One for the line 7'-J' in section Bl, and the other for the line J'-J in section B2, 0a,
. , (A, 8, 3.. 11.1) Each request requests the entire line of I-J.
I.111'1 The previously mentioned cropping function
, Yo. 8 work 9 □ work Yuoya. ga. Tsu3. :
□゛：：：(It causes the result of being absorbed.) This
□;'1:': When these three requests are processed, 3f, 1
′jJ□ Record the line in the bitmap of one section
:・.

The result will be ・,・□. However, the partition
-B1 is currently blocked, so I'-J'
The line is ;:'off 7,,? 1J-727)
z77"□□□, 111□5., 1' 1.1 will not be visible on the display. Following that, the window
□:i: When A is removed, simple morphological description for window B
1':1'1 "0-6°゛5"K&, BfJ6'+L゛m''°
1)□.

Complex morphological descriptors and compartments B1, B2, and
Stone E3 (Dfca+M)*HMuMea-f
b Idl! Z4Ji t'L, IIZ kl! II
I') The bitmap information of B1 is moved from the off-screen bit map 214 to bitmap 215; in this way the complete line I-J, part of which was not visible when it was written. Nevertheless, it will become visible.

The interruption of the request to draw line 1-J mentioned above and its decomposition into three requests may be performed by the CPU under microcode control in future embodiments, but this In an embodiment, it is executed by software called by microcode-to-software fault 216.

Microcode-to-Software Faults: Microcode-to-software faults are a mechanism in the current implementation that allows complex problems to be taken out of the microcode and into the software. However, on the other hand, it clearly leaves the way for improved future implementations in which more functions are performed by microcode. It also provides a guide for performing a series of tasks and for moving up and down in functionality.

When an operation is initiated, the microcode must determine whether it can perform the operation and must also determine whether it can handle it in the form in which it must operate. If the answer is negative in both cases, the microcode must cause the software to "fail" (or "fail").

A fault handling address is provided as part of each instruction. In this way, there can be multiple fault handlers.

The fault handler will mimic the required operation, subdividing if necessary (as described above) and using more rudimentary instructions if necessary. The called program is recovered by the WPOPJ instruction in the Data General's 32-bit instruction set. Cyclical failure is thus implicitly supported.

The combination of obstruction mechanisms, cropping, and window-local coordinate systems provides a unique benefit: display effect operations on compound windows are equivalent to the same operations applied to all of the component simple breaths in turn. It is. The user is thus relieved from the burden of composite windows.

Types of data that can be displayed: Operates that indicate that the user wants to write to her window by a particular instruction (see Separate - Ik, 1) are direct operands (contained in the instruction). Might happen. Or, the instruction may contain pointers to data outside of the instruction.

(Element 217 in Figure 2) Descriptions of the various data types include:
provided here.

line style Line styles are different ways of drawing uniform lines.

Specified as a bit string of length 32, it controls which pixels calculated during line drawing should actually be implanted. For each drawing position, the leftmost bit in the line style is examined. If set, the pixel is implanted; if sharp, no change occurs. The line style is rotated one bit position to the left and the next drawing position is calculated. An example of a line style (expressed in hexadecimal) is:
1FFFFFFFF: -*
'FOFOFOFO: Mostly pointillistic AAAAAAAAA□6<'□” Court I
FFFOFFFO: long dash
1FFFOFFO: &'JfL(DI
-7y:z '88888888
: Very Thin FFFF066 : Dashes and Dots FFFF0660 : Dashes, Dots, Dots Font Fonts are a set of special forms used by character-drawing operations. They are descriptions of how each individual character is depicted. This description (which need not be in the form of a bitmap) must be translated into a form relevant to the actual screen before rendering can occur. Adjustments to the height and width of the characters must be performed. Alignment and padding may also be required. This latter entity is "strike font"
It is. Character instructions process the specified strike font by indicating a strike font descriptor. Figure 7 shows this diagram.

Font mechanisms have been chosen to use one bit per pixel. The scan lines are filled into two force number bits and occupy consecutive memory locations. Each scanline must start on a border equal to its width. The number of scan lines must also be in force of two. Every character in a 7 ont occupies the same amount of space, which is implicitly two power number bits. The first scan line of the strike cell is not depicted. It makes up a proportionately spaced subset of cells, O
Check those columns in NH. Figure 8 shows the character “1”
It shows the layout of 12x24 strike font registration for .

Character rendering is controlled by processes such as line styles. Conceptually, the letters are drawn by "open pit" of their strike font column style. Each bit in the column is examined in turn, ignoring those columns with control line zeros in a proportionally spaced manner. If 1, then colored depiction (foreground) pixels are provided. If O, background colored pixels are provided instead.

The value of the supplied pixel is dependent on the print control;
Foreground and background pixels can be removed independently. This allows you to open space on a trial basis (no printing at all), to write while a background is present, and to draw text and background at the same time.

(Additional combination rules that all must follow are outlined below.) Combination Rules: Many commands over a specified pixel (resource pixel)
Use combination rules to handle overlapping files.

One does not always wish to strictly replace designated pixels with resource pixels; it may be desirable to plant pixels whose value is a function of the resource and designation. This suggests that the specification may also be an input.

A single pool rule and a mask applied to logical pixels are specified. A diagram has been adopted.

The bits of the logical pixels corresponding to zero are unchanged in the target form; those corresponding to l, the series of pixels concatenated according to the pooling rule, are already just the rightmost bits of the tangible pixels. do not have.

Access Method: By defining instructions, the execution of the graphical method indicates that certain "favorite" operations are frequently performed, including: reading or writing the value of a pixel; thing.

Moving a rectangular area around a US pixel.

To draw a lingering or series of connected line segments.

Filling the polygonal area with rice patterns.
(The next step is to draw the continuation of ASCII characters.)

These operations consist of three main ways to draw on the display: pixels, shapes, and characters.
i-character access This method proposes a method of placing the main text in a window.
I offer. Character Block Transfer (CCHARBLT) instruction This instruction transfers a series of ASCII characters to their pixel table.
:Allows arbitrary font specifications in the actual translation. It also checks for characters that may require special handling.
1 shape access
) Drawing lines is an important part of technical computer diagramming. That is CAD/CAM parts
1 cage, architectural design packages, and commercial illustration packages. Because this operation is performed frequently, special instructions are provided.
1 has been done. Both continuous and incremental forms of line drawing are included. Lines can be drawn closed, half open, or fully open. The actual arithmetic rules must be reversible to allow for accurate line deletion, etc. Line width arguments have been included to support this feature at a lower level.

Pixel Access Method This access method deals with individual pixels and their rectangular areas. It can serve as a basis for more advanced access methods, allowing users to create their own display processing instructions. A read pixel and store pixel operator allows direct access to pixels (such as for image processing or conic section generation). These only two operations are strictly necessary to do the job, but more advanced operations are much more common.

These are merely descriptive instructions that do not employ the specification of combination rules. They are intended to be the simplest of all building blocks. The model used is
One of many WR pixels for the same form of fast succession.

The bit block transfer operator is a very useful pixel level operator. It is essentially a rectangular join and transfer function. This is especially done in the case of windows that are rolled up, windows that are moving around, and windows that are made or broken that obscure other windows. Special rectangle filling operations are also useful for handling screen window removal and window subdivision.

Pit BLT is a single operation that takes two forms. This is because certain restrictions are placed on the form of resources and goals. Resource logic pixels may be filled or chopped to match the parameters of the target form.

Instruction inventory: Instructions that affect all displays have a common instruction sequence format. The first 16-bit word of all such instructions is 107151 in hexadecimal notation.

(Hex 8E69, Nova ADDOL+ 2.
O.

5EP) The next two 16-bit words hold the competitor/fault handling software's anti-relative offset program. The fourth 16-bit word contains a small unsigned integer subopcode that specifies the special function to be performed.

el + m ey fvi I
A complete listing of the instructions that affect the Ll'l u"+ h display is shown in Appendix A.

Display Memory Module: Screen bitmaps (215 in Figure 2) are maintained in a special area of main memory known as H1 display memory or video memory. An embodiment of a video memory for a black and white monitor is now described.

Referring to FIG. 9, the video memory 901 includes 6 of 32
It consists of 4 video RAM (VRAM) and is organized in a space of 1024 x 1024 x 2,
Allows a 2-pit pixel representation of a screen with a height of 1024 pixels and a width of 1024 pixels. R8
-343A monitor timing allows display of the entire array. The free-running blinking clock selects one of two complete palettes 904 that allow any pixel value to be mapped to one of four levels of gray. (0=black to 3=white) Ilo and other local operations are processed through the [illustrative space] and are actually encoded as ICO auxiliary processor (AP) transmission channels.
1nru. VRAMK-specific "registration-transfer" function and additional features 1.:.
, Ey“ 1゜′・′yr−1−E IJ −1(
S yfg″′″−“j″W′−・1 Mary,
'< 7. (7) fc- as the requester Mainno, -:y,.

l′V′! 9°zealr(l!&~7"69・
1° Video memory - double word (i.e. 32 bit) video memo in main body 64
:1・: Lee uses normal system memory by CPU.
:□ :' is processed. The screen is from left to right,
1;,: Ordered in the classical sense from the top to the bottom.
:1. Double word 0 linear arrangement “J in′ゝ”1.
1. .

Generated from a logical bitmap. 2 bits
1'□ pixels, from left to right, with their rnsb
: Will be packed towards the double word rnsb. 1'11:' Texas Instrument VRAM Lander
The LM access cycle is essentially a standard DRA
are identical to those of M'. Their unique feature is that they have special access to the entire 256-bit string of internal storage in the continuous conversion register 903.
It is an ability that can be transferred to This register is
It may then be recorded independently of subsequent random access activity. Additional controls fully multiplex the bit section to four 64's of this column recorder to aid in printability.

Timing and control dot and CRT timing is approximately 44MHz
It would originate from a local oscillator acting at .

The independent nature of VRAM continuous time recording requires no arbitration of registration-transfer cycles, and no apparent synchronicity with existing memory timing.

Special VRAM columns and max address sequences must be maintained to properly update the interwoven display. A relatively simple multiplex would be all that is required to feed the pixel values into the palette. The above capabilities are optimally satisfied by an intelligent microcontroller (uC) 906 and 80
31/2732 EPROM implementation may be utilized in future embodiments (y=xs o
517ri, (-(7)!/J,” 2) iC Oi?
H,i I:: High selection and CEQ will yield results.
B.

Logic 9050 rotation and merging: i' the microphone that needs to execute the positive bit BLT command
1:°°−“°″″″″?tB!aK””1″″′
″′′′ し.

-0 interval 5 to the arbitrary (D f 7 ) boundary line. A certain need was noted in [1: As a result, it was requested to execute this function). -Doware 1 was developed as a memory bus internal device.Control 1゛□?y)#Z,ll□,.ka.,ah.,□,1..

The "function" bit does not exclude circular "rotation only" and has an advantage of 11, 6.910 interval "・Illustration method 9
;.

It is created via UABA.

Palette and DAC: This example simply transfers pixel values to a palette.
1;... used as i7de7ri3"ru・i4 V 7)
I,.

It is a special hardware map, which is a pixel map.
1□Translate the value of 1 Torr into the intensity of the (digital) light beam.
[:1 Instructions exist to command and restore pixel-to-color translation. Palettes are organized as a 4X2X2 array placed inside a single double word of storage. The two-pit palette data written through the AP graphics space provides the desired gray level total encoding in relation to the value of the pixel given for each state of the blinking clock in the palette multiplexer 907. will. Direct reading of this recorder is not available, but the microcode will hold the image at a single scratchpad location. The EDH13400 DAC (digital to analog converter 908) will be utilized to create the analog composite video signal. Red, green, and blue outputs are available; for a monochrome monitor the signal would be sent on top of the green output. The DAC not only performs synchronous mixing, but is also capable of 75 ohm DC power and is available in a 24-pin, 600 mil ceramic package.

Blink This embodiment provides a "blink clock." That is 5
Clamp the pallet at a fixed rate of approximately 1.0-1.5 Hz, with an efficiency cycle of 0%.

In this way, there are two palettes, one for each state of the blinking clock r'', b・2
O(iD''PV 7) O'5#, e H・
ffDK%”.

has been done. This allows the user to program the value of a given pixel to alternate between two levels of intensity. (or 2 in color display)
The diagram below shows that several effects are possible when this palette scheme is used on 2-bit pixels. The individual palette registers the four intensities as unsigned binary fractions between zero and one of 32 pits.The two R8-343A video monitors feature 19 fields. A monitor that is not listed is being used. Green - The synchronous analog interface will be wired directly from the back plane pins to the monitor's ENC connector via the connector.

Memory Programming: UABA Encoding The following table summarizes the display memory UABA encoding that will be supported by the graphical microcode: QO
Oro 00 O ζ Yuichi --〇 0 0 0 Daikyo Sen-6 Group- (Isao 5) The present invention may be embodied in other specific forms without departing from its spirit or essential characteristics. As such, the examples are to be regarded in all respects as illustrative and not as restrictive, and the scope of the invention is determined by the appended claims rather than by the foregoing description. and all changes that come within the scope and meaning of equivalents of the claims are accordingly intended to be embraced therein.

Instruction Dictionary RDPIXEL[107151;000000] This instruction reads a single pixel from the feature and restores its masked value to the logical pixel width of the feature, or does not restore if it has no value. Instead, the krivitung instruction is returned to the carry.

Input ACO: Ignored ACl: Integer local X coordinate AC2: Integer local Y coordinate AC3: Directive to morphology description Output ACO: Logical pixel value of original (if morphology) unchanged (unless there is a point within the morphology) ACl: Unchanged AC2: Unchanged AC3: Unchanged C: Set if I: , mask it against the feature's logical pixel width, and bias it by the feature's logical palette base.

Input ACO: Prototype logical pixel value ACl: Integer local X coordinate AC2: Integer local Y coordinate AC3: Indication output to shape descriptor Output ACO: Unchanged ACl: Unchanged AC2: Unchanged AC3: Unchanged C: If CX, Set if Y] is in a defined format, otherwise unchanged Method 1) Start with the logical pixel value from the ACO 2) AND it with the morphological logical pixel mask and store it
) 13) Logical OR on the logical palette base of the form and change the local color to the whole color 1
4) Set the physical pixel value to (X, Y) □ LINESEG (107151,00000411 This command draws a single line segment. The control packet is updated for possible restarts and contains four 11 items. , X and Y offsets, epsilon, and a cycled line style specifier.

Input ACO: Most important point 1 Instruction AC to the (X, Y:) group AC1: Most important point 2 Instruction AC to the [X, Y] group
2: Line Seg Instructions to the packet/Integer bit (62) operation mask
:・Bit (32) Control word・Bit (01) Suppress end point 1・Bit (01) Suppress end point 2・Bit (26) Filler, should be set to zero・Bit (04) Combination rule・Drawing Prototype pixel value/prototype line width for AC3: Directive output to configuration descriptor ACO: Unchanged ACl: Unchanged AC2: Unchanged X-delta in updated packet Y-delta update in updated packet Epsilon in updated packets Line style in updated packets (cycled) AC3: Unchanged
1:11, □ C: If coupling occurs, set, then
1゜::11 U'''''ke h&f-T'-further
,,,1CHARBLT(107151,0000
06].

This command converts characters into glyphs held within the character.
, , : (glyphs) Values are placed within the characters within the form using. '□CHARBLT
There are four data multiplexed by :′
”: category, string data, character data,
1: Divided into morphological data and operating parameters.

Therefore, this instruction takes instructions within all 4 ACs.

Also, skip recovery upon final (sic) completion
.

′th″′6°″′″J″0″s cvht,=-p″
'~°1. ,・Input ACO: Instructions to string packet,,,1・Byte planting into character string 1″・
Prototype minimum index string □゛:
To the original starting index string (update) ACl: Planting in CHARBLT packet
,,.

・Integer X - start (restart value, updated) ・Integer Y
-Start (restart value, updated)/Prototype X-Delta (
(initial 0, updated) - Prototype Y-Delta (initial 0, updated) - Prototype foreground pixel value - Prototype background pixel value - Bit (62) Motion mask - Bit (62) Control word - Bit (01) Suppression Foreground - Bit (01) Suppression Background - Bit (01) Spatial proportion - Bit (25) Filler, zeroed out - Bit (04) Combination rule AC2: Instructions to character descriptor - Character prototype height - 7 Prototype width of character cell, Prototype strike character cell width (in bits), Prototype strike character cell height (inside line) - 2) Before 5.0'':'
/)-r77'''Q instruction, :AC3:
Amount of instruction to form descriptor Force
, :・.

ACO: Unchanged (updated space in packet
,,11::'tring index) ・,・'1 ACl: Unchanged (X-start, Y-start, X-delta, updated 7'cY-delta) ,・,
, AC2: Unchanged AC3: Unchanged C0: Set if cribbing occurs, otherwise unchanged PC: Set to PC+4 if the string is indicated by the leaked ACO.

On the other hand, bit vector via ACl 1 yo) character in LE (like CMT) If exclusion is specified, the process to pcas will be performed. Kip execution.

Method 1) If both X delta and Y delta are not zero,
Resuming a literary book from an interruption point within the text.

2) Repeat the following steps for each character in the string starting with SINDEX: 3) Fetch the current character, string (SINDEX), and call it C 4) If exclude[C] is 1' Done and skip.

PC=PC+5; 5) Position the pre-strike cell for the C glyph. The first bit is offset given by the integer value of the character, the product of the strike cell width and the strike cell height.

6) If there is a match, use the first scan line as a control mask and ignore columns corresponding to 0 in the mask. (Thus, the number 1 is the width of the special character in the matching spacing. If monospaced, ignore the first line.

7) Operation mask, print control and comb
o) Scan the lines of the IJ under the control of the rules to determine and locate foreground and background pixels as described in GI 8.002.

8) Jump XS and TART by character width and jump 5INDEX by 1.

9) SINDEX) If MAXINDEX, PC=PC+
Perform step 4 and repeat.

10) When executing SINDEX=MAXINDEX+1, both XDELTA and YDELTA are zero.

BITBLT(:107151.0000051 Pixels starting at the ULC of the source left tumble in the source form are paired with pixels starting at the ULC of the target left tumble in the target form.

The contours of both the source and target pixels are combined and the target pixel is replaced.

This is done in such a way that the target pixel is not deformed before it is used as a source pixel because the source and target boxes overlap. BITBLT never blurs pixels the way WCMY blurs text. B
The ITBLT must choose the correct direction to detect the two left tumbles.

Input ACO: Ignore ACl: Instructions to BITBLT packet/Integer X
- Digital (initially 0, restart) ・Integer Y-' Digital (initially 01 restart) ・First star) Instructions to ULC regulator ・Target star Instructions to ITJLc regulator ・Prototype X-Range (pixels (within) ・Prototype Y-range (within pixels) ・Bit (32) Operation mask e-pit (32) Combination rule (row 4)
bit) AC2: (Source) Instructions to configuration descriptor AC3:
(Target) Direction to morphological descriptor Force ACO: Unchanged ACl: Unchanged (updated X-Delta, Y-Delta) AC2: Unchanged AC3: Unchanged
1C: Set if coupling occurs, otherwise unchanged RDPALC107151,000002] This command restores the contents of the palette entry for the value of a particular pixel within the context of the given form.

-'t-hu 0WRPAL(il-'vy))KA
JI; h, 6fi! ! Rather, it reflects the actual saturation stored within the palette.
,,,
.

Input:' ACO “JjXm*”@ep-b”1-”O**K13
1Hi.

)1. .

ACI: Phase ORGBL-Tuple", instructions 1' (・: ・Beep) (32) Red Saturation (ignored) 1.-・Beep) (32) Green Saturation (ignored)!゛:1・ ・Beep) (32) Blue saturation (ignored)・Beep) (
32) Gray-Level (ignored) AC2: Phase I RGBL-Instruction to Tuple (beep) (32) Red Saturation (ignored) (beep) (
32) Green saturation (ignored), bit (32) Blue saturation (ignored), beep) (32) Gray-level (ignored) AC3: Instruction output to form descriptor ACO: Unchanged ACl: Unchanged, phase Instructions to ORGBL-Tuple Bit (32) Red coloring (if black and white (mono),
bit (32) green color (undefined if black and white) bit (32) blue color (undefined if black and white) bit (32) gray level (undefined if black and white) ) Tomi [′ AC2: unchanged, instructions to phase ORGBL-Tuple Y,.

°ゞPa0°')”Q(4Lel~%/)　　　　[.

If so, undefined) 1″, ty) (3□)□Qi−~8, i) [゛undefined) ・Bit (32) blue expansion color (if black and white,
11・□ Not defined) 1: ・Bit (32) Gray-Level (If black and white, not defined) ”C3:/Fffi! l・
,.

Method: 5 1) Verify that the physical pallet unit uses the unit designation cell of the form descriptor 1''
do·
1..2) The logical pixel value input in the ACO is
A logical pixel mask of the form indicated by AC3:1, .
Masked by 1.
1・1' 3) The actual physical palette index is the form
[Logical palette-paced form identical to descriptor
It is calculated by ORing 1:.

4) The returned RGBL-tuples contain the actual results of the performance.

5) Color performer L-slots are defined, monophonic performer RGB-slots are not defined.

6) The linkless execution render phase 1 tuples is not defined.

WRPAL [107151,0000031 This instruction sets up the palette descriptions for both phases of the plink clock (if any). It allows colors and gray levels to be described independently. It is assumed that the control software sets up the palette base of the target configuration and prevents abuse of WRPAL.

Input ACO: Prototype logical pixel value (for a certain format) ACl: Phase ORGBL-TupLe instruction bit (32) Red coloring (ignored if black and white)
1°) Bit (32) Green coloring (ignored if black and white)
l'i' ru) 1... bit (32
) Blue expansion color (ignored if black and white) 1...bit (3
2) Gray-level (ignored if black and white) AC2: Phase I RGBL-Tuple Instructions
Bit (32) Red coloring (ignored if black and white)
)□.

・Bit (32) Green coloring (ignored if black and white)1. .

・Bit (32) blue expansion color (ignored if black and white)
□Tobit (32) Gray-level (ignored if black and white) AC3: Output instructions to form descriptor ACO: Unchanged ACl: Unchanged AC2: Unchanged AC3: Unchanged Method 1) Physical pallet unit is the form The use of the descriptor's instruction cell is confirmed.

2) Logical pixel value inputs within the ACO are masked using the morphology mask found within the morphology descriptor indicated by AC3.

3) The physical palette index is computed by ORing the logical palette pace of the indicated form to the masked pixel value.

4) Non-color performance ignores RGB coloring; color performance ignores gray-levels.

5) RGBL values are scaled down on the surface to the internal palette resolution.

6) Link-less performance ignores phase-1 color.

PFORMS [107151,000007:] This function is a PATU (barge ATU) or 5PTE (
(set page table entry). Additionally, LSBR8 and LSBRA (load sum/all segment base register) disable the binding of logical addresses to configuration description information. Also, P
FORMS occurs as an implication of the execution of the above instructions.

input ACO: ignored ACl: ignored AC2: ignored AC3: Instructions to morphology descriptor output ACOS child OS ACI: Unchanged AC2: unchanged AC3: unchanged AC4: unchanged

[Brief explanation of drawings]

FIG. 1 is an overview of the prior art. Figure 2 - @1ift is related to non-invention. FIG. 2 is a block diagram of the inventive method implemented in a typical data processing system. FIG. 3 shows a single window display on the screen. FIG. 4 shows the morphology descriptor. Figure 5 shows two windows on the screen, which - by all means - are obstructed. FIG. 6 shows a form control recording scheme. FIG. 7 shows a character font scheme. FIG. 8 shows a typical character bitmap in a character font. FIG. 9 shows the display storage subsystem. The JIO diagram shows the central processing unit (1) of a digital computer system. FIG. 11 shows the control system of the digital computer system. Engraving of 100 figures (no changes in content) □ FIG, J l. □ □ 1' [ □ FIG 5 FIG, 4 FIG 6 FIG, 8 FIG, 10-1 l FIG, 11-2 Written amendment (method) % formula % 6. Relationship with the person making the amendment Applicant address Name Data General Corporation 4
agent

Claims (1)

[Claims] 1. A method for controlling the display of a digital computer system, the system comprising: a primary storage means for storing instructions and data; and a means for performing operations on the data in response to the instructions. processing means; and display means for displaying a representation of the data; instructions for identifying the first data, instructions for identifying the representation of the first data to be displayed on the storage means, and the representation of the first data to be displayed thereon; c) storing an instruction for describing a position inside the tissue described by the morphological descriptor; c) storing the instruction and the morphological description to obtain the selected instruction and the selected morphological descriptor; d) in the processing means, determining second determined data that is a function of the selected instruction, the selected morphology descriptor, and the determined second data specified by the selected instruction; e) for the representation of the second determined data to be displayed; e) for the representation of the second determined data to be displayed;
sending the second determined data to display means. 2. The method of claim 1, wherein in step d) the second determined data comprises a function of a selected instruction, a selected configuration descriptor, and a selected instruction. The method is characterized in that, in addition to being the determined first data identified by the data, the method is also a function of the earlier second determined data. 3. In the method according to claim 1: the processing means of the digital computer system on which the method is carried out are capable of storing data significantly more quickly in them than in the primary storage means. step d) includes a scratchpad storage means from which data can be retrieved more meaningfully and more quickly than from the primary storage means; (2) If the selected morphology descriptor has been captured in the scratchpad storage means, retrieving it therefrom; If the selected configuration descriptor has not been incorporated into the scratchpad storage means, it is directly preceded by the steps of retrieving it from the main storage means and incorporating it into the scratchpad storage means. A method characterized by: 4. A method according to claim 1 or 2, wherein the processing means of the digital computer system on which the method is carried out includes a control store, and in step d) the processing means for selecting one of the microinstructions from a plurality of sequences of microinstructions prepared in the control store;
A method characterized in that said calculations are performed under the control of one series. 5. In the method set forth in claim 4, the series of microinstructions that generally control the processing means may relinquish control of the processing means, and the sequence of microinstructions that generally control the processing means may A method characterized in that one sequence of instructions may be brought under control from a plurality of sequences of instructions prepared in a primary storage means. 6. In the method as claimed in claim 1: if in step d) a defined part of the data representation displayed on the display means is obscured or occluded by another data representation; that it should become
If it is determined that the selected instruction specified, a second determined data portion corresponding to the determined portion of the data representation is moved to a reserved area in the primary storage means; in d), if it is determined that the selected instruction specifies that a determined portion of the data representation that was previously obscured or became occluded should become visible again; For example, a method characterized in that the corresponding parts of the second determined data are restored from the pending area, so that there is no need to recalculate those parts of the second determined data. 7. In the method as claimed in claim 1: if in step d) the second defined data portion already delimited by the second defined selected morphology descriptor; , if the first determined and selected morphological descriptor is determined to be delimited, and if in step d) the first determined and selected morphological descriptor is determined to be delimited. In the second confirmed data part that was missing,
where it is further determined that the second determined morphological descriptor also delimits; decomposing the second determined specified morphological descriptor into sub-morphological descriptors; the first submorphological descriptor bounding a portion of the second determined data bounded by both the determined selected morphology descriptor of; and the second determined selected morphology descriptor; one or more portions of the second determined data that are delimited by the selected morphological descriptor but not delimited by the first determined and selected morphological descriptor; A method characterized in that the next submorphological descriptor of defines a range. 8. In the method according to claim 7: if in step d) it is determined that the selected morphology descriptor has previously been decomposed into submorphological descriptors: selection a function of the selected instruction, a selected configuration descriptor, and the determined first data specified by the selected instruction, a function of the selected instruction, a lower configuration descriptor,
and determined first data specified by the selected instruction. 9. In the method as claimed in claim 7: if in step d) the second defined data portion previously delimited by two or more morphology descriptors is , characterized in that, if it is determined that it will be delimited by only one morphological descriptor, then the sub-morphological descriptor delimiting that part of the second determined data is discarded. How to do it. 10. A digital computer system having improved display control capabilities, comprising: storage means for storing instructions and data; display means for creating a display in response to first determined data stored in the primary storage means; processing means for performing operations on the data in response to the instructions; said processing means being capable of generating first determined data in response to some of the instructions; Each of said number of instructions is displayed a representation in the primary storage means with a morphological descriptor from among a number of morphological descriptors stored in the storage means for specifying the organization of data to be displayed. the processing means is adapted to formulate the first determined data as a function of each of the number of instructions, and to form the first determined data as a function of each of the number of instructions; A digital computer system comprising: creating a descriptor and creating second defined data specified by each of a number of instructions.