CA1306307C - Means and method for controlling input events in multi-processing computer systems - Google Patents

Abstract

ABSTRACT

A method of inputting to a program or virtual process information from an external source such as another independently running process or an I/O device. Information is transmitted to a program by means of events, which may be selectively retrieved from an event queue by the program. User input such as that from a keyboard or mouse-type device, is treated specially to insure that the input goes to the proper program in a multi-processing environment. A keyboard driver is included that has the capacity to use individual translation tables for each individual application program which is running. User input from user activated devices, such as a keyboard or mouse, are combined with input from other parts of the systems by an input funnel which insures that user input is routed to the proper destination. The input funnel operates in conjunction with a window manager to allow a user to type a sequence of keys which may be directed to several different programs which are running.

Description

)7 MEANS ~ND METHOD FOR CONTROLL,ING INPUT EVENTS
IN MULTI-PROCESSING COMPUTER S~STEMS

Field of the Invention This invention is related to multi-processing computer systems, and more particularly to a means and method of routing keyboard and other input events in such a system.

Background of the Invention Computer systems in which several different programs or processes run concurrently are becoming more common. These processes may take the form of multiple application programs and may also include additional segments of executable code which form part of the operating system but which run independently, similar to applications programs.
Controlling and directing input data in a computer system in which multiple-processes run concurrently poses many problems compared to a system in which only a single process runs at any one time. One particular problem faced by such multi-processing systems is controlling the input from a user and directing it to the appropriate program or system function. Typically, user input is provided by a keyboard, mouse-type device, touch screen, or other similar input device. For example, when a user types one or more keys at a keyboard, this input data may be intended for any of several different programs or processes.
A user running a work processing program, for example, might type letter keys to indicate input to the word proc0ssing program, other function ?

:

.

~ ~)fi3(~7 keys to indicate to the system that certain parameters, such as window size, are to be changed, and still other keys to select another application program as the currently active program. Thus, a method of processing the input from a user and ensuring that input is directad to the appropriate computer process is necessary in computers running concurrent programs and processes.
Additionally, in a multi-processing system, each process or program runs only during a small portion of the time. Multiple programs are implemented by dividing the central processor time up into incremental portions and allowing individual programs and processes different amounts of this time. As a result, an application which has been inactive for a period of time may have several different input events of various levels of urgency waiting for it when it again becomes active. It is desirable to allow a program or process to selectively process these input event in an order which may not be the same as the order in which they occurred or the order in which they are "queued" by the computer system.

Summary of the Invention The present invention includes a method of inputting to a program or virtual process information from an external source such as another independently running process or an I/O device. All information is transmitted to a program by means of events. Events are placed in an event queue for the program and may be selectively retrieved by the program. In retrieving the events, a program may ask for the next event, or may specify with varying degrees of particularity a particular type of event or events which it wishes to receive next.

~30~30'7 70840-1~8 User input such a.s that from a keyboard or mouse-kyPe device, is treated sp~cially to insure that the input goes to the proper program in a multi-processing environment. The present invention includes a keyboard driver which ha~ the capacity to use individual translation tables for each individual application program which is running. User input ~rom user activa~ed devices, such as a keyboard or mouse, are combined wi~h input from other parts of the systems by an input funnel which insures that us~r input is routed to the proper destlnation. The input funnel lo operates in conjunction with a window manager to allow a user type a sequence of keys which may be directed to several dlfferent programs which are running.
According to a broad aspect of the invention there is provided a method of routing user input in a computer system which concurrently runs a plurality of processes, including steps of:
receiving scan codes representative of keys typed by a user, the scan codes including shift codes representative of shift states and other scan codes representative of keystrokes;
maintaining a shift state representative of said shift codes;
producing keycode data comprised of individual keycodes after receiving the scan codes, each representative of a keystroke, and each determined by looking up a scan code assigned to a keystroke in a multiplane table, a plane from which a keycode is determined being selected as a funation of a current shift state;
distinguishing the produced keycodes by looking up each keycode ln a routing table which assigns each possible keycode to ' . , ` ' ' ` ~, , .

~L3~ 7 7 0 ~ 4 0 - 1 2 ~3 an individual assigned process o~ sald plurality of processes, one of which processes is a supervisory process;
sending each keycode ~o its assigned process until a keycode assigned ~o the supervisory process is received;
sendiny keycodes recelved subsequent ~o the keycode assigned to the supervisory process to a bu~fer;
then, providing additional keycodes to the supervisory process from the buffer upon request by the supervisory process until the supervisory process has completed operation; and sending each keycode stored in the buf~er to a process to which it is assigned after the supervisory process has comple~ed operation.
According to another broad aspect of the invention there is provided a method of routing user input in a computer system which concurrently runs a plurality of processes, including steps of:
generatiny keycodes representative of keys typed by a usera distinguishing generated keycodes by looking up each keycode in a routing ~able which assigns each possible keycode to an individual asslgned process of said plurality o~ processes, one of which processes being a supervisory proce~s;
then, sending each keycode to its assigned process un~il a keycode assigned to the supervisory process is received;
sending keycodes received subsequent to ~he keycode assigned to the supervlsory process to a buffer;
next, providing additional keycodes to the supervisory - A

`

~L3~6307 708~0-12 process from the buffer until th~ ~upervlsory procegs has completed opera~ion; and sending keycodes stored in the buffer to proce~ses assigned therewith after the supervisory process has completed operatlon.
Des~ription of the Drawinqs The advantayes and operation of the present invention will be more fully understood upon reading the following description of the preferred embodiment in conjunction with the accompanying figures of whlch:
Figure 1 is a block diagram useful in explaining the data flow between the various parts of a computer system operating in aacordance with the invention;
Figure 2 is a flow diagram representing the steps carried out by the keyboard driver;
Figure 2A is a diagram showing the organiza~ion of the translation table used by the keyboard driver;
Flgure 3 is a flow diagram representing the steps carried out by the input funnel;
Figure 3A is a diagram showlng the organization of the ro~ting table uæed by the input funnel in conjunction with the process I.D. table;
Figure 4 is a flow diagram showing the operation of the typeahead buffer process;

?

3b :`
.
' .
- .

3~)'7 70~40-12~

FIGS. 5 and 6 are flow diagrams showing the major functions of the window manager process.

Description of the Preferred Embodiment Before proceeding to describe the present invention, it will be useful to define and explain some terms used in the following explanation. As used herein, the term "process" refers to a segment of executable code --for which the operating system maintains a virtual environment. Each application program which is running is an individual process. The operating system would include a number of individual processes performing different functions necessary for the operation and integration of the systems. The processes might include, for example, device drivers, a window or display manager process, a communications buffering process, and others.
An "event" is a data structure that indicates to a process that some action external to that process has occurred. Events may take many forms. Keystrokes, mouse movements, file I/O data, and timeout indications are examples of events. Typically, a process will send and receive many different types of events. For example, a word processor would receive keyboard and mouse events from a user indicating the desired functions to be performed on a piece of text. If the word processor were to read data from a disk storage unit, it would receive an event which informs it that the file transfer is complete. To print a document, the word processor could send an event to the operating systsm or other process whlch would cause the desired data to be sent to the printer. Whan the printing is finished, the printing process would typically send an event to the word processor indicating that the print operation has~been completed.
`~
~ -4-:`
, ` ~ :-' The present invention includes a method of running multiple programs in a multi-processing system in which an application receives most o~ its external input as events from a single source, the event queue. User initiated events, such as keystrokes or mouse movements, are put in the event gueue. Other inputs, such as communication events, file I/O
completion events, and others are also put into the application~s event gueue. The present invention includes a novel method of managing input to a program or process by means of classifying events both as to their type and function. ~his allows an application a great deal of flexibility in responding to inputs from a user or other processes running concurrently. Additionally, the present invention includes a novel method for properly directing user input in a multi-processing system to the proper process, which method has advantages over previous ways of routing user input.
For a proper appreciation of the present invention, it is necessary to understand the types of data structures used to describe events. The following data structures are described and shown in the appended listings as they would be implemented using the C language. The translation of such data structures to other languages is within the ordinary skill of those in the art, and the description of the present invention in terms of a particular language should not be construed to be a limitation thereon.
The generali~ed description of an event shown in Listing 1 and is comprised of a defined structure identified as UIVREC. The event record includes a "type" entry which defines the particular type of event designated by the event record. Event types will be discussed below, and in the present embodiment includes several different event types which may be distinguished.

~5-, ' .

~3~ 7 The event record also includes a "data" variable which includes the data which describe the event. This data may include a pointer to additional information, such as a message or the actual data transferred from a file I/O operation, which may be associated with the event. The structure of this variable depends upon the particular event and is defined in terms of a union of data structures identified as UIVDATA and described in more detail below.
A "timestamp" variable indicates the time at which the event was put into an application event queue and serve to provide chronological indication of event occurrences. Other data may be added to the event record, such as the "flags~' entry shown in Listing 1, which could be used to contain further information about an event.
The following explanation defines a number of different types of events. It should be clear that additional types may be added where they are required. The following is a brief descriptian of each of these types of events.
Listing 2 sho~s the definition and structure o~ the UIVDATA structure which is used to define the data variable in the event structure of Listing 1. The event data is defined as a union of the data structures required to define each of the different event types. The user event data structure, UIWSER, and the window avent data structure, UIVWINDOW
are explained in more detail below. For applications using other event types, it may be necessary to include additional data structures in the union shown in Listing 2. The following is a bri0f description of the event types shown in Listing 2.

-, , ~ 3(~6~

User events woulcl include all events which are initiated directly by a user. These events would include key strokes, function keys, mouse movements, and other events which are directly executed by a usar. User events also include actions which are indirectly performed by a user. An example of such an action would be a pull-down menu selection. Such an action would be initiated by a user in response to keys or mouse movements, which themselves would be events. The f inal result of the keys and mouse movements in a pull-down menu selection would be an event of that type indicating the function to be performed. It should be noted that a single key stroks and a pull-down menu selection operation may have the same meaning to a program. The data structure for a user e~ent is shown in Listing 3, discussed below.
~ indow events are issued by a window manager process when an application's window has been a~fected by a user's operation. For example, a window size could be changed, a window could be closed, or other operations could be performed. The data structure for window events is discussed below in connection with Listing 4.
Timer events indicate the expiration of an interval. ~hen a process sets up a timer, the expiration of the timer causes the appropriate event to be put in that processes' event queue. The data includes an integer which defines the particular timer which has expired.
File I/O events include internal events generated by all file I/O
operations. The data includes two long integers which identify the particular I/O operation which has been completed.
Application-defined events are provided which allow events to be sent between cooperating applications programs which are separate processes and which wish to send information to each other as events. The data associated with these events are arbitrary 12 byte strings.

.

, ~3~iq3~)~

Message events are generated whenever messages arrive on an open connection or when connection operations are being perormed. The avent data record contains information about the connection and the type of message, and a pointer to the message itself. Message events would include, for example, electronic mail sent between users on a multi-user system.
Message buffer events are gen~rated whenever message services have filled an application message buffer or whenever a destination mail box becomes free after a failed attempt to send a message to it. The event data record contains information which describes the connection or mail box in the buffer which has been affected. As will become clear below, an application can distinguish between different types of events.
Message buffer events may well require different and more urgent responses than normal message events and are thus given a separate event type to allow an application to appropriately respond to this class of events.
Child process termination events indicate that a child process, initiated by a parent process, has completed. The data includes the prGcess I.D. of the terminated process and a termination parameter.
Listing 3 defines the structure which contains data for user events.
User events come in 1 of 4 sub-types: keystroke events, mouse movements, region notifications, and pull down menu selection events. The "type"
variable of the UIWSER record indicates which of these 4 sub-types the user event data is. The UIW SER "code" variable is a 16 bit variable which uniquely defines the event. For example, each key will have an individual code indicating that the event is a key stroke corresponding with that key. Cursor keys, function keys, and other keys will also have )7 their own specific codes, which are defined hy the system. Thus, an application need only examine the UI WSER code variable to determine the information necessary to process the user event. However, additional data whi~h more particularly describes the event and how it was initiated by a user is available in the remaining portions of the UI WSER data structure. Thus, an application is able to determine, for example, whether a particular function, as indicated by the UI WSER code variable, was initiated by a single key stroke or by a menu selection. Encoding user data events in this manner allows an application to rapidly process user event data while still providing detailed inormation on the event for those applications requiring it. For example, a program might be written which would allow a user to select functions by either going through the menu system or activating a single function key. A user could select, for such a program, a mode in which a beginning user is automatically reminded of the corresponding function key when a particular function is selected through menus. Such a prcgram would require additional data to the UI WSER code value in order to determine how a user has selected a particular operation.
Listing 4 shows the structure used to define a window event. The "type" variable includes a code which indicates the window operation being performed, such as move, refresh, resize, close, etc. The other parameters are explained by the comments in Listing 4.
An application~receives input by requesting that it be notified of events in its event queue. An event is requested by means of a call to the system, which calls are discussed below, in conjunction with an event specification. The event specification allows the applications program or calling process precise control over the types of events which it may .. . .

.: . - . :
~' ' '. .

3q)~

request. Listing 5 is the definition of a Ppecification structure UIVSPEC which is used in the function calls discussed below. As discussed below in detail, the function calls operate by comparing one or more specification structures supplied by the calling program in the format shown in listing 5 with the events in that processes event queue, and matching events are returned. The "type" variable in Listing 5 identifies the event type, as discussed above, and is frequently the only data required in the UIVSPEC structure to identify a match. In order to allow multiple types o events to be requested, the following function calls normally define an event type by means o~ an array of specifications structures such as that shown in Listing 5. The end of such an array is indicated by means of an end-of-list terminator value stored in the type variable of the last UIVSPEC structure.
Sometimes additional specification of an event structure ~ay be necessary. The "data" variable of UIVSPEC allowsifurther specification for those types of events whose data is a single long integer such as for timer events. For event types requiring still more data, the "spec"
union may be used. The "action" and "action data" variables are provided to support high-level packages which process events and allow the specification of an event list which indicates what is to be defined by the packages which support and use them.
The following is a description of several C function definitions which show how the above described event data structures would be used.
It should be appreciated that most applications would include additional functions for manipulation and other operations on events in the event queue. The specific functions necessary will depend upon the size, speed, and capability of the processor and operating system being used, ~, .
, .

- ~ ~ \
~3~i;3~7 and the implementation of such functions is within the skill of those in the art in view of the present description.
The following is the definition of the UIvget function, which is usad to retrieve functions from an application's event queue.

UIvget (specp, wait, remove, eventp) UIV~PEC *specp, INT wait;
INT remove;
UMIREC *eventp;

The specp variable is a pointer to an array of UIVSPEC structures each specifying one or more events which may be returned. As set orth above, the last entry in the array should have the "type" variable set to a value which indicates that specification ends the array. I the specp pointer is null, the first event in the event queue will be returned.
The wait variable is flag indicating whether the process should be blocked to wait for an event matching this specification if none is found in the queue. The remove variable is a flag indicating whether the event record is to be removed from the queue once found. The eventp variable is pointer to a UIVREC structure to receive the found event.
This function looks for an event in the ev~nt gueue which matches the given specification. This specification may include one or ~ore different specifications of the type shown in Listing 5 arranged as an array terminated with an empty specification, as discussed above.
The following function allows the calling process to put an event back into its event queue in the order specified by the event's time stamp.

' ', UIvrequeue (eventp, countp) UIVREC ~eventp, ULONG *countp;

The eventp variable is a pointer to the UIVREC structure which contains the event to be placed back on queue. The countp parameter, if non-zero, is a pointer to a variable to receive the number of events in the current process's event queue after this event is reposted. The UIvrequeue functions allows a calling process which has removed an event from the queue, but which does not wish to process the event, to return it to the queue so that it can be processed later. If requested, this function also returns the number of events in the event queue.
The following function allows a process to send an event to the event gueue of another process.

UIvpost (eventp, process, wait, countp) UIVREC *eventp;
K_PROCESS process;
INT wait;
ULO~G *countp;

The eventp parameter is a pointer to the UIVREC structure which defines the event to be posted. The process parameter is the process I.D. to which the event is to be sent. The wait parameter is a flag indicating whether the process blocked to wait for the event to be posted if the receiving processes event queue is full. The countp parameter, if not null, is a pointer to a variable to receive the number of events currently in the receiving processes event cue.

` :
, : .
.

` ' ~3()~;3~7 The following unction will flush all svents which match the givenspecification list from the event queue.

UIvflush ~specp) UIVSPEC *specp;

The specp parameter is a eointer to an array of UIVSP~C structures which specify the events to be flushed.
The following function allos~ a process to determine the number of events in another processor's event queue and the maximum number of events which that process may have in its event queue.

UIvgtcount (process, countp, maxp) K-process process;
ULONG *countp;
ULONG *maxp;

The process variable is the process I.D. The countp parameter is a pointer to a variable to receive the number of events currently in the specified processor's event queue. The maxp parameter is a pointer to a variable to receive the maximum number of events which may be queued in the specified processor's event ~ueue.
Referring to FIG. 1, there is sho~m a diagram which illustrates the flow of data and signals between the various portions of a typical system incorporating the present invention. In FIG. 1, keyboard driver 10 represents a process which accepts input data from a user, such as might be typed on a keyboard 12 or which might be indicated by manipulations of ~. ',' ' .

~30~
70~0-128 a mouse type device 14. Associated with keyboard driver 10 is a translation table 16, described in more detail below. The keyboard driver receives scan codes from keyboard 12 indicatiny the rnake and break status of each of the keys on the keyboard. In the described embodiment, these scan codes are 8 bits long. It also may receive data from a mouse 14 indicating mouse movements and activation of mouse buttons. It should be appreciated that other types of input sources, such as touch screen indicators may be used in place of or in addition to the keyboard and/or mouse input devices illustrated in FIG. 1. The incorporation of such devices into the present invention is easily done by one of ordinary skill in the art.
The output from keyboard driver 10 is a key code which is 16 bytes in the described embodiment. Each key code is passed to a procedure 20 which will be referred to as the input unnel. The input funnel is responsible for assuring that the codes from keyboard driver 10 are routed to the appropriate process running on the system. This process might be an application program or alternatively may be a signal to the operating system indicating that certain functions are to take place.
For example, a user running an-applications program might desire to change the window size, and the keys indicating this change of window size would be sent to a window manager process, illustrated by block 30 in FIG. 1, which would carry out the appropriate steps in response to the users input. The input funnel 20 has associated with it a routing table 22, described in more detail below, and which includes data representa-tive of the various processes to which the input funnel may send events.

.. .

~: ' ' ,, , , In FIG. 1, a block 40 represents a first application program with which a user is interacting. In the described embodiment, a user may have several progr~ms executing at one time These programs will each have individual windows on the screen which may vary in size from a small icon, indicating that the program is loaded, to a larger window which displays data from the program. In the described embodiment, many windows may be present on the user's display simultaneously, reflecting the different programs and processes which may be running concurrently.
However, input data from a user may be sent, to, i.e., put in the event queue 46 of, only a single process at one time. The process to which data may be sent is displayed on the screen in a window denoted as the "active window", as illustrated by dotted box 50 in FIG. 1. Additional applications programs 42 and 44 are illustrated in FIG. 1. These programs may be executing in the background or may be suspended, however, only the program 40 in the active window may receive user data frGm the keyboard. A user may send data to other applications by making another application's window active in place of the current active window.
Selected keystrokes may be interrupted by the input funnel and put in the event queue of applications programs not in the active window and to other processes, as indicated by dashed lines 21, as described below.
The operating system in the described embodiment includes a window manager process 30 which controls the data displayed to a user Oll a device such as a CRT display. Wlndow manager 30 may control, for example, the number, size, location, and updating of various windows displaying the output from different programs to a user. The user communicates with wlndow manager 30 via input from keyboard 12 or mouse 14. This Input is applied via keyboard driver to input funnel 20. Input :

3~ 7 funnel 20 includes a routing table 22 which is used to i.dentify those input events from the user which s~lould be directed to the window manager 30. For example, a particular key, such as a function key, is typically defined to be the key by which a user presses to interact directly with window manager 30. In response to the depression of this key, keyboard driver 10 will pass a key code representative of that key to the input funnel 20. Input funnel 20 uses data in routing table 22 to identify this key as intended for the window manager process 30 and sends this key directly to ~he window manager. In response to a key intended for window manager 30, the input funnel 20 also sets a flag indicating that the window manager has been called. While this flag is set, all further keyboard input is routed by the input funnel 20 to a typeahead process 60. This is necessary because the ultimate destination of keys typed after a window function is called may not be the application program which is currently in the active window. This is described in more detail below. Additional keys typed after the window manager has been called are sent by input funnel 20 to the typeahead process 60 and are stored in a typeahead buffer 62 pending the completion of the window operation. Typically, window operations require additional input to completa the operation, and window manager 30 will receive these additional key codes from typeahead buffer 60, as described in more detail below. Thus input ~unnel 20 in conjunction with typeahead process 60 ensures that keys typed by a user after the initiation of a window event are sent to the correct destination.
The operation of keyboard driver 10 is similar to known types of keyboard device drivers, with one exception discussed below. The functions performed by keyboard driver 10 are shown generally in FIG. 2.

~ ~ ~ 3~

It should be appreciated that the specific prograrn code needed to implement these functions will vary, depending upon the particular programming language and computer processor being used. In the described embodiment, keyboard driver 10 is interrupt driven in response to the depression of a key, although it could equally well be called by being polled.
Keyboard driver lO first receives a scan code sent by ke~board 12 in response to the depression or release of a keyboard key, block lO0. In the preferred embodiment, the scan codes from the keyboard are 8 bits long, giving 256 possible different scan codes. The following description assumes operation of the keyboard driver wherein a single key code is sent in response to the depression of the key, and no key code is sent upon the release of the key. Additionally, the keyboard driver may be designed so that holding a key down for a predetermined period will cause the keyboard driver to send multiple key codes representative of that key to provide an automatic repeat key function. In some circum-stances, it is desirable to provide a keyboard output representative of when a key is depressed and when it is released, also known as typeamatic action. The present invention may be used with such an implementation also, and such a modification with the embodiment described herein is within the capabilities of one ordinary skill in the art.
Following receipt of a scan code from the keyboard, block 100, the keyboard driver checks the scan to determine whether the depressed key is a shit key, block 102. Shift keys serve to modify the meaning of a subse~uently depressed key, and include keys such as upper case shift, control, ALT, and others. Additionally, combinations of shift keys may be used. In the present embodiment, lO different shift keys and combinations are defined.

~L3~ 7 Other key combinations may be defined whi~h have special functions or meanings to the system or a process. For example, it is typical to define a three key combination to reboot the computer or workstation.
Although not shown in FIG. 2, these combinations may be identified in block 102 and the appropriate operational function carried out in response thereto.
If the depressed key is a shift key, the keyboard driver proceeds to block 104 where it changes the shift state. The keyboard driver process then ends and the keyboard driver returns to the previous routine, block 110. If the keyboard driver determines that the depressed key is not a shift key, it proceeds to block 106 where the keyboard driver gets the appropriate key code from translation table 16.
Referring to FIG. 2A, there is a diagram which shows how the translation table is implemented in the present embodiment. The translation table includes a plurality of planes 112, each of which represents a different shift state. Within each plane are stored the key codes which are to be generated in response to the activation of each non-shift key. Thus, the shift state provides an index into the translation table while the scan code from the activated key provides the offset. In the described embodiment, each f the key codes stored in translation table 16 is composed of 16 bits.
It should be appreciated that storing the key codes in the manner described above allows an arbitrary number of different shift states to be defined while reyuiring memory only for those planes, or shift states, which are, in fact, being used by a particular process or application program. Furthermore, the translation table may be changed to accommo-date the requirements of different programs. $hus, by writing new data . .

3l~ -into translation table 16 used by keyboard driver 10, different key codes will be produced by the keyboard driver in response to keys pressed by a user. In the present embodiment, window manager 30 controls which application is in the active window 50, and thus which application is responding to keys typed at the keyboard by a user. When a user switches the acti~e window from one application program to another application program, window manager 30 will, if required, replace the translation table 16 in keyboard drive 10 with a new translation table suitable for the new application program. After the proper key code has been determined from translation table 16, the keyboard driver goes to the input funnel routine 108, shown in more detail in FIG. 3.
FIG. 3 shows the functions performed by the input funnel. After receiving a key code, block 120, from the keyboard driver, the input funnel checks the typeahead flag to see whether or not it is set, block 122. If so, the input funnel sends the key code to the typeahead process, block 124, described in more detail below. Otherwise the input funnel looks up the keycode in the routing table, block 126. The structure of the routing table is shown in more detail in FIG. 3A.
The input funnel first takes the 8 most significant bits of the 16 bit key code and uses that value as an index into a first tab]e 200 identified as Tl in FIG. 3A. Table Tl includes 256 entries each of which consists of a pointer to the beginning of a secondary table elsewhere in memory described below. In the described embodiment, the pointers in table Tl are 32 bits long.
If the value within table Tl is a null, or 0, value, block 128, the input funnel sends the key code directly to the application program, block 130, which is currently running in the active window. A process _19-~3~

I.D. table 202 is kept by the system which gives the process identification numbers for all of the currently active processes. In the described embodiment, up to 48 different processes may be active at one time. The process I.D. in the first table entry is always that of the application running in the active window. The process I.D. in the second table entry is that of the window manager process 30.
If the value in table T1 is other than null, the input funnel uses the 32 bit pointer as an index to a 256-byte secondary table and uses the 8 least significant bits as an offset into that table, block 132.
Referring to FIG. 3A, the first entry 204 in table T1 is null. This indicates that the key code should be sent directly to the process in the active window, and thus no secondary table is required. The second entry 204 in table Tl is an address value designated as Al. This address indicates first entry in a secondary table 210. The input funnel takes the 8 least significant bytes of the key code and uses that as an offset into table 210.
Table 210 and each of the other secondary tables which may be stored each include a numerical value between 1 and 48 which indicates the process to which the key code will be sent. After looking up the process number in the appropriate secondary table, the input funnel refers to the process I.D. table 202 to find the process I.D. number, block 134, which is used to inform the system of the process to which the current key code event is to be sent. Once they key code is sent, block 138, the input funnel returns, block 140.
It should be appreciated that the above described procedure results in a sparse array for the translation table in which a primary table Tl and one or more secondary tables are stored to identify key codes which ~ . .

~3~3~t7 are sent to processes other than khe currently active application. The values in the secondary tables indicate the process to which the key code is sent. A value of 0 indicates that the key code is to be sent to the currently active application. Thus, a key code having the 8 most significant bytes equal to a value other than null may still be sent to the active application of the corresponding entry in the appropriate secondary table is 0.
A value of l in the secondary table indicates that the key code is to be sent to the window manager. This is a special situation which causes the input funnel to activate the typeahead buffer. Thus, if the input funnel determines that the key is for the window manager, block 136, the input funnel sets a typeahead process flag, block 142, and sends the key to the window manager, block 144, and returns, block 146. The next time the input funnel is called, the typeahead flag is detected in block 122, and all further keyboard input is sent to the typeahead process, block 124, as long as the typeahead process is active, as described below.
FIG. 4 shows the steps carried out by the typeahead process 60. When ~t receives an event, the typeahead process stores the event in typeahead buffer 62, block 160. The typeahead process next checks a flush flag, block 162. The flush flag is set by the window manager and indicates that a window event has been completed and that all further key codes stored in typeahead buffer 62 are to be rerouted through the input funnel 20 to the approprlate application. Thus, if the flush flag is set, the typeahead process will send the next event in the typeahead buffer to the input funnel, block 164.

~3~ 3~

Typeahead process 60 next checks to determine whether the t~peahead buffer is empty, block 166. If not, it returns to block 164 and sends the next event in the typeahead buffer to the input funnel. If the typeahead buffer is empty, the flush flag is reset, block 168, and the typeahead process resets the typeahead flag in the input funnel (checked in block 122~ to cause the input funnel to resume sending user events directly to their destination, rather than to the typeahead process, block 170.
If the flush flag is not set, block 162, the typeahead process may return as soon as the key code is stored in the typeahead buffer 62.
Alternately the typeahead process may proceed to block 176.
A first key code which is identified as being intended for the window manager 30 is sent directly by the input funnel to the window manager process, block 144. Normally, a window function will require further key strokes from a user for completion. These key strokes are provided by the typeahead process by a routine shown generally at 174. This routine may be entered immediately following block 162, it may be periodically activated by a polling routine, or it may be called by the window manager 30 when the window manager determines that it needs an additional key.
If called by other than a window manager, the typeahead process checks the window manager request flag, block 176 to determine whether it should send a key code to the window manager. If so, or if the typeahead process is called directly by the window manager, it sends the next event in the typeahead buffer 62 to window manager, block 178.
The functions performed by the window manager 30 will vary depending upon the particular type of program being run, the complexity of the window structure, and other parameters related to the hardware and ~l3~

software of a particular system. The implementation of these different functions is well within the o~dinary skill of those ;n the art. FIG. 5 shows certain portions of routines which will be carried out by window manager process 30 and which interrelate with the above described functions.
The window manager is called up by a user by the depression of a key corresponding to a window function. This key is recognized by the input funnel based on data in the keyboard t:ranslation table 16 and the input funnel routing table 22, as described above. After the window manager routine is begun by the depression of a window function key, block 180, the window manager determines what function is indicated, block 182, and executes the appropriate steps block 184 and then determines whether another key or event is needed for further execution, block 186.
Some window functions may be accomplished with a single key strok0.
~or example, a window close function may be activated with a single key stroke. Other window functions may require more than one key. For example, a window resize function will require that the window manager be called up, the resize operation be initiated, and then the window manager will request cursor key strokes or mouse movements and buttons from the typeahead process in order to receive input from the user as to the particular resize operation. In such cases, the window manager will determine that it needs additional input to complete the operation, block 188, and will repeat the above described sequence of operation until it determinee that the window operation is complete, block 186. The flush flag in the typeahead process is set, block 187, and the window manager returns, block 189.

..

' ~3~3~

In carrying out the above described operations, the window rnanager may change the application running in the active window. In this case, the sequence of steps shown in FIG. 6 would be carried out. This sequence may be integrated as part of the execution of the window function being performed in block 184, or it may be located elsewhere in the window manager functioning.
In FIG. 6, the window manager first checks to determine whether a new application has been made active, block 192. If not, the following steps are skipped, and the window manaqer proceeds to return or to carry out the next function, block 199. Otherwise, the window manager will check to determine whether a new translation table is needed, block 194. A
default translation table is provided by the operating system, and many, of not most, applications programs will use the default key translation table. In this case, a new translation table does not need to be loaded. However, where an application requires a new translation table, the window manager will load the appropriate translation table, block 196, when the new application becomes the active application, as shown in FIG. 6. Next, the window manager updates the process I.d. table 204, block 198. As discussed above, the first entry in the process I.D. table always corresponds w~th the application running in the active window.
Thus, any change o the application in the active window will require updating the process I.D. table.
Invocation of some applications programs will also require changes in the routing tables 22. As described above, user key strokes are sent either to the window manager or to the program running in the active window. Some programs may, however, perform functions in the background in response to particuIar keys or key combinations entered by a user.

' ' ' .

- , ~

~ . .

:~30~ 3~7 For example, a keyboard macro program may be activated by a user and record succeeding key strokes until deactivated by the user. A debugger program, as another example, may be activated or deactivated by a user while the program runs in the active window. Such programs when first invoked would call the system and would appropriately modify tables 200 and 210 so that the proper key codes would be sent as events to these operations operating in the background.
It should be appreciated that in applying the teachings set forth above, those of ordinary skill in the art will make modifications and additions which are within the scope of the present invention.
Accordingly, the description herein of a preferred embodiment should not be taken as a limitation on the invention, but rather the invention should only be interpreted in accordance with the appended claims.

~ 3~ 30 ._~ APPENDIX
L STIi~G 1 typedef s t ruc t USHORT type; /~ Type of event q/
UIVDATA data; /~ Data accompanying event ~t K_INTERVAL timestamp; /~ Relative time event was queued ~/
USHORT flagsi /~ Event flags ~/
} UIVREC;

typedef union UIVUSER user; /~ User Events ~/
UIVWINDOW window; /~ hindow events ~/
ULONG timer; /~ Timer events ~/ . ~
ULONG fileio[2]; /~ File I/O events n/
ULONG apman; /~ Application Manager events Y/
UTINY appl~12]; /~ Application-defined events ~t struct R MSG TYPE msgtype; /~ Message typ0 ~/
K MB NUM buf; /~ Message buffer number ~/
K MBX ID mailbox; /~ Mailbox to uhich message ~as sent ~/
K CONNECT connect; /~ Connection on whieh it arrived '~
POINTER msgptr; ~ Pointer to message ~/
USHORT msgcount; /~ Count field ~/
} message; /~ New-style message events ~/
struct BOOL full; i- TRUE if full, FALSE if unblocked ~/
K MSG TYPE buftype; /~ Message buffer type ~t K CONNECT connect; /~ Connection id of buffer ~/
K MBX_ID mailbox; /~ Mailbox id of buffer /
K MB NUM buf; /~ Number of buffer ~/
} mbevent; /~ Message buffer events ~/
struct .
K PROCESS process: /~ Id of terminated process ~/
ULONG delparm; /~ Del_proc parameter ~/
} procterm;
ULONC dheventl3]; /~ Device Handler events ~/
K_INTERACTIVE EVENT
uievent; /~ Interactive windowing events ~/
} UIYDATA;

.. . . .

~L3q~3 typedef struct union - TEXT ra~ tll];
UIUSERCODE code; /~ For all types ~/
struct /~ Type - KEY ~/
UIUSERCODE keycode; /~ ~ISCII k~ycode ~/
USHORT keystatus; /~ Bitmap for ma~e/break status ~t TEXT rawcode; /~ Hard~are keycode ~t TEXT t~pe; /~ Make/break/whole ~/
GPPTS p kposition; /~ Current pointer position ~/
TEXT funnelid; /~ Input funnel ID '/
} key;
struct /~ Type - ~ENU ~/
VIUSERCODE menucode; /~ Pull-down ~enu event code ~/
UIUSERCODE currmenucode; /~ Current code ~hen HELP ~as hit ~/
UTINY flags; /~ Menu event characteristics ^/
TEXT type; /~ Menu event type ~/
UTINY count; /~ Event count or menu offset /
} menu;
strucl /~ Type - MOUSE ~/
UIUSERCODE keycode; /~ Mouse event code ~/
GPPTS ptrposition; /~ Current pointer position /
TEXT funnelid; t~ l~put funnel ID ~t } mouse;
strucl , UIUSERCODE notifycode; /~ Region event code ~/
UIREGIONID regid; /~ Region id /
UIWINDID : windid: /~ Window id /
ULONC reginfo; /- Application defined i~fo /
} notify;
} userdata;
TEXT type; /^ Ev~nt type ~EY. ~~ OTIFIC~T10~. or ~OUSE ^/
} UIYUSER;
- ~2 7--~ 3(~7 LISTI-c~G 4 union - -TEXT raw[16];
struct UIWINDID ~indow; /~ ~indow id ~1 UTINY type; /~ Window operation /
UTINY state; /~ Window state ~/
GPUNIONPTS size; /~ New ~idth and height of window ~/
GPUNIONPTS location; /~ Corner resize initiated from ~/
GPUNIONPTS offset; /~ Window offset from old position ~/
} ~indo~data;
} UIVWIN WW;

typedef struct uivspec USHORT type: /~ Event type ~/
ULONG data: /~ Normal event specifioation ~/
union /~ Additional event specification ~/
~ struct K_CONNECT co~nect;
K_MBX ID mailbox;
} message; /~ Specific message events ~/
struct uivspec ~specptr; /~ More specification /-USHORT action; /~ Action code for this event class ~/
ULONG actiondata; / Action data for this event class ~/
¦ UIVSPEC;
UIVSPEC eventspec[2]; /~ Sample declaration ~/

Claims (8)

1. A method of routing user input in a computer system which concurrently runs a plurality of processes, including steps of:
receiving scan codes representative of keys typed by a user, the scan codes including shift codes representative of shift states and other scan codes representative of keystrokes;
maintaining a shift state representative of said shift codes;
producing keycode data comprised of individual keycodes after receiving the scan codes, each representative of a keystroke, and each determined by looking up a scan code assigned to a keystroke in a multiplane table, a plane from which a keycode is determined being selected as a function of a current shift state;
distinguishing the produced keycodes by looking up each keycode in a routing table which assigns each possible keycode to an individual assigned process of said plurality of processes, one of which processes is a supervisory process;
sending each keycode to its assigned process until a keycode assigned to the supervisory process is received;
sending keycodes received subsequent to the keycode assigned to the supervisory process to a buffer;
then, providing additional keycodes to the supervisory process from the buffer upon request by the supervisory process until the supervisory process has completed operation; and sending each keycode stored in the buffer to a process to which it is assigned after the supervisory process has completed operation.

2. The method of claim 1 wherein the supervisory process includes a step of modifying the routing table to change an assignment between the keycodes and individual processes.

3. The method of claim 1 further comprising displaying windows from a plurality of processes, the supervisory process being a window manager which selects a process to be active and respond to predetermined keystrokes.

4. The method of claim 3 wherein the window manager includes a step of modifying the routing table to change an assignment between the keycodes and individual processes.

5. A method of routing user input in a computer system which concurrently runs a plurality of processes, including steps of:
generating keycodes representative of keys typed by a user;
distinguishing generated keycodes by looking up each keycode in a routing table which assigns each possible keycode to an individual assigned process of said plurality of processes, one of which processes being a supervisory process;
then, sending each keycode to its assigned process until a keycode assigned to the supervisory process is received;
sending keycodes received subsequent to the keycode assigned to the supervisory process to a buffer;
next, providing additional keycodes to the supervisory process from the buffer until the supervisory process has completed operation; and sending keycodes stored in the buffer to processes assigned therewith after the supervisory process has completed operation.

6. The method of claim 5 wherein the supervisory process includes a step of modifying the routing table to change an assignment between the keycodes and individual processes.

7. The method of claim 5 further comprising displaying windows from a plurality of processes, the supervisory process being a window manager which selects a process to the active and respond to predetermined keystrokes.

8. The method of claim 7 wherein the window manager includes a step of modifying the routing table to change an assignment between the keycodes and individual processes.