Self-contained programmable terminal for security systems

BACKGROUND OF THE INVENTION
This invention relates to security systems, and, in the preferred embodiment, to magnetically encoded data card security systems in which access at a secured location is controlled by a comparison of data on a card inserted by personnel into the system with data stored in the system and defining those persons who shall be granted access. More particularly, this invention relates to a system in which, in addition to card data, keyboard data may be entered by persons wishing access, the keyboard data being in combination and permutation of the card data. In such a system, the present invention provides a substantially broader degree of flexibility in system control than was previously available, since it permits independent programming of terminals at each of plural remote locations in a system where the remote terminals, under normal circumstances, operate in conjunction with a central processor to regulate access. Thus, with this system flexibility, it is possible, even when communication is interrupted between the central processor and the remote terminals, to limit access at the remote terminals in accordance with either (a) the same identification list as is stored in the main memory, (b) a more stringent list, or (c) a more liberal list, as the user desires. Such flexibility has not heretofore been available. Furthermore, the ability to program a memory list to define who shall be provided access at each of the independent terminals, is accomplished in the present invention in a manner which permits identification numbers to be added and deleted from the system without affecting the system's memory capacity.
Security systems utilizing remote terminals to limit access at individual remote locations have, in the past, utilized static magnetic card readers at these remote locations for controlling access through electrically operable devices, such as doors, turnstiles, printers, etc. Prior art systems have been devised in which the remote card readers communicate with a central data processor or operate as stand-alone units.
The card or badge bearing encoded data used for controlling access is typically inserted into a slot of a reader which reads and decodes the data on the card. Advantageously, this data is encoded as a plurality of magnetically polarized spots in a sheet of magnetic material. Such encoded data normally includes an identification number or numbers identifying the card holder. During use, this number encoded by the card is compared with a number or numbers stored in the central computer terminal in multiterminal systems using central processors or at the remote locations in totally stand-alone systems, all to ascertain whether the individual inserting the card is entitled to access to a building, room, parking lot, or the like.
In one prior art embodiment, the magnetically polarized spots are used to directly actuate a reed relay or other moving switch mechanism located within the reader. In the state-of-the-art system, as is exemplified by U.S. Pat. No. 3,686,479 entitled "Static Reader System For Magnetic Cards", assigned to A-T-O, Inc., assignee of the present invention, electromagnetic solid state sensors are used. These sensors are disclosed and claimed in U.S. Pat. No. 3,717,749, also assigned to A-T-O, Inc. These patents are hereby incorporated in this disclosure by reference. Such systems have been found to be very reliable and are in use as access control systems in a number of different industries, universities, and government installations.
Operation of such systems as a part of a security network employing a central processor is disclosed and claimed in U.S. Pat. No. 4,004,134, also assigned to A-T-O, Inc., and also incorporated herein by reference. This latter system incorporates a central processor which periodically and sequentially polls each of the remote terminals in the system. The remote terminals are able to transfer data to the central processor only on receipt of a polling pulse. At the central terminal, data read at the remote location from an inserted card is compared with a master list which includes those persons who shall be given access at that remote location. Such systems, in the past, have permitted a limited degree of remote terminal operation, even is some or all of the interconnecting lines between the remote terminal and the central processor have been interrupted. The systems, however, generally require that a much simpler test be made of persons wishing entrance during such degraded mode operation, and thus the group of persons allowed access at such times is, of necessity, much larger than would normally be granted access. This is a distinct disadvantage in such systems, since it does not permit a controlled programmable access under all circumstances as is often required in secured locations.
An improved system for providing degraded operation in such a central processor-oriented system is disclosed and claimed in U.S. Pat. No. 4,097,727, entitled "Circuit For Controlling Automatic Off-Line Operation of An On-Line Card Reader," assigned to A-T-O, Inc., the assignee of the present invention, and incorporated herein by reference. Even in that improved system, there is no substantial system flexibility regarding the persons who will be granted access during degraded mode operation, and it is common in a system of that type to provide access during degraded mode operation to any person having a card coded for use within the overall security system, even if it is not coded for use at this particular remote location.
The communication lines used in a security system of this type, where a central processor is utilized for controlling the operation of plural remote terminals, provide an even greater level of security if the communication lines are monitored to assure that they are not tampered with and that their integrity is not degraded. A system for accomplishing this purpose is disclosed and claimed in U.S. patent application Ser. No. 827,994, filed Aug. 26, 1977, and entitled "System For Monitoring Integrity of Communication Lines In Security Systems Having Remote Terminals," this application being assigned to A-T-O, Inc., the assignee of the present invention and incorporated herein by reference.
It has also been known in the prior art to include at the remote location a keyboard. Typically such keyboard systems require that persons wishing access, in addition to the insertion of a magnetically encoded data card, are required to enter keyboard data, typically a sequence of digits. These digits have typically comprised a particular permutation and combination of the data encoded on the employee's card, the particular permutation and combination often being different for different remote terminals. Some prior systems have used hardwired permutation and combination circuits which did not pemit alteration after the system was installed. A more advanced keyboard system, which permits programming of the particular permutation and combination after installation, is disclosed and claimed in U.S. Pat. No. 4,142,097, entitled "Remotely Programmable Keyboard Sequence For A Security System", assigned to A-T-O, Inc., the assignee of the present invention and incorporated herein by reference.
While these systems disclosed in the prior art have provided a relatively flexible, sophisticated security network, certain persistent problems have remained unsolved. One of these problems involves the fact that systems utilizing a central processor invariably provided very broadly based access during degraded communication line operation. In addition, the prior art systems in which remote terminals are used to store lists of identification numbers for selective access have permitted changes in the access lists only at the expense of reduced memory size since, in the prior art, the elimination of an identification number from a memory storage location has typically required the destruction of that memory location.
In addition, those prior art systems which utilized real-time clocks for limiting access through a particular terminal to different personnel at different times of day, have been fairly limited in their flexibility and typically required that a person be issued a new entrance card or badge if his time of entry was to be changed. Such systems, therefore, greatly reduced the flexibility of real-time access control. In addition, such systems have not provided plural overlapping time zones so that various personnel could be provided access at different times of day which were not mutually exclusive.
SUMMARY OF THE INVENTION
The present invention solves these persistent problems in the prior art and provides, through their solution, an extremely powerful and flexible terminal system for secured access control. This system includes independent programmable identification listings at each of the plural remote locations of those individuals who will be granted access at such locations. In addition, the system permits connection of a plurality of these remote terminals to a central processor which includes its own programmable memory listing of personnel who will be provided access at each of the remote locations. During normal operation, when a central processor is used, this central memory is used to provide access at each of the remote locations, since the use of a central processor permits a printer to be added to the system, which printer provides a record of personnel movement throughout the system on a continuous basis. The central processor system also permits programming of each of the remote units from a central location and thus makes the system easier to control and to operate.
Nevertheless, any difficulty in communication between the central processor and the remote terminals in this system will not degrade the system operation, since a complete list of personnel who will be provided access is stored in a programmable memory at the remote location. Thus, when faulty communication lines are detected, the system interrogates its own memory for access control, and the person inserting a card at the remote terminal has no way of determining that the communication lines are impaired.
Furthermore, the system of the present invention provides a flexible, solid state programmable memory which is operated in a manner which maintains identification numbers in numerical order within the memory. Such numerical ordering permits a binary search to be conducted so that an efficient determination can be made to determine whether a particular number is stored in the memory. When a number is deleted from the memory, the remaining entries in the memory are shifted to close the data order so that no voids remain. Thus, the end of the memory can always be checked to determine whether there is room for additional identification numbers.
It will be appreciated, of course, that since the terminals of the present invention have the capability of such stand-alone operation, they can be used in a totally stand-alone application where no central processor is provided. Even in such an application, these terminals permit total programming flexibility at each of the remote locations. It will be appreciated that, utilizing a terminal of this type, a mixed system, some terminals centrally controlled and some operated as stand-alone units, is permissible utilizing the same terminal throughout the system. In addition, it is possible to install a plurality of stand-alone terminals with the expectation that, at a later date as system requirements increase, a central processor may be added to control the already installed stand-alone remote terminals.
Whereas in the prior art system which have time of day access control, a portion of a user's identification number typically included a time of day code, the present system utilizes such a time of day code only in combination with a user's identification number in memory. Thus, the user's card or badge does not itself define a time of day, and access at different remote locations may be provided using a single card at different times of day. In use, the present system responds to the insertion of a card by finding the user's identification number in memory and accessing an associated plurality of bits which determine the times of day at which access will be provided. If this defined time of day conforms with the time of day as monitored by real time clocks within the system, access will be provided. The time of day may be changed by changing each of plural clocks within the clock system itself. In addition, the particular clocks used for controlling access for each individual are programmable within the memory.

These and other advantages of the present invention are best understood through a reference to the drawings, in which:
FIG. 1 is a schematic diagram of the overall system of the present invention showing the primary elements of a central processing unit and plural remote units;
FIG. 2 is a more detailed schematic diagram showing the operation of the memory, memory control, and real-time sensor of the remote terminals of FIG. 1;
FIG. 3 is a flow chart showing the operation of an insertion loop counter and its associated electronic elements, all of which are shown in FIG. 2;
FIG. 4 is a flow chart showing the sequential operation of a deletion loop counter and its associated electronics, all as shown in FIG. 2; and
FIG. 5 is a schematic block diagram illustration of a programmable microprocessor system utilizing a program as included in this application for accomplishing the same basic functions provided by the hardwired embodiment of FIGS. 1-4.

Detailed Description of the Preferred Embodiment
Referring initially to FIG. 1, a central data processing unit 11 is shown connected to a particular remote terminal 13 by a pair of polling and data lines 15,17 and a pair of data lines 19 and 21. The polling lines 15 and 17, in a typical application, are unidirectional lines which enable the central data processing unit 11 to sequentially interrogate and send data to a plurality of remote terminals 13, 23, 25, etc. to determine which of these remote terminals require servicing. It will be understood throughout the remainder of the specification in this application that a large number of remote terminals may be connected to a single central processing unit 11 and that each of the remote terminals 23 and 25 performs substantially the functions described below with reference to the remote terminal 13.
It should be understood that the lines 15,17 are a line pair, the line 17, for example, providing a return for the line 15. Similarly, the line 21 provides a return for line 19. Polling signals and data which initiate at the central processor 11 are communicated to the remote terminal 13 on the line pair 15,17. Similarly, data signals produced at the remote terminal 13 are communicated to the central processor 11 on the line pair 19,21. It will be appreciated that words communicated on the line pairs 15,17 and 19,21 are most advantageously connected within the central and remote units 11,13 to shift registers 27-33. Thus, data sequentially clocked from register 27 onto lines 15,17 may be self-clocked, as shown by line 35 into shift register 29. Similarly, data sequentially clocked from the shift register 33 may be self-clocked, as shown by the connection 37, into the shift register 31.
Although the details of a line integrity monitoring system are not shown in FIG. 1 (in order to maintain the clarity of this disclosure), such a system is typiclly included in the communication system between the central processing unit 11 and the remote terminal 13, and is shown in FIG. 1 as a first line integrity monitor 39 within the remote terminal 13 interconnected between the shift registers 29 and 33, and a second line integrity monitor 41 in the central processing unit 11 interconnected between the shift register 31 and the shift register 27. The details of the line integrity monitoring circuits 39 and 41 are described in U.S. Pat. application Ser. No. 827,994, filed Aug. 26, 1977, mentioned previously. For the purpose of the present application, it is sufficient to understand that the line integrity monitoring system 41 cauases the shift register 27 to sequentially poll the remote terminals 13,23,25, etc. by sending a polling signal on the lines 15 and 17. The remote terminals 13,23,25, etc., through the line integrity monitoring circuitry 39, respond to these polling signals by providing a calculated, predetermined response which is transmitted by way of the shift register 33 and data lines 19 and 21 to the shift register 31. This data returned from the remote terminal and placed in a shift register 31 is compared by the line integrity monitoring circuit 41 to determine whether an appropriate response has been received from the remote terminal and to thus verify the integrity of the lines 15,17,19,21. It will be understood by those skilled in this art that the continued integrity of these data and communication lines is extremely important, since systems built in accordance with the present invention are used to limit personnel access and the line integrity monitoring circuit 39,41 can provide an alarm, for example, at the central processor 11, whenever an intruder (or other cuase) has interfered with the communication line network.
It is important to recognize at the outset of this disclosure that the remote terminal 13 is designed to operate as a stand-alone unit as well as a remote terminal for a central processor 11, and that it can therefore be utilized without the data communication lines 15 through 21, as described below.
A card reader or sensor 43, located in the remote terminal 13, substantially is described and claimed in U.S. Pat. Nos. 3,686,479 and 3,717,749, is used to sense magnetically encoded data on a card or badge inserted into the card reader 43. This data is transmitted, as by a line 45, to a buffer or storage register 47. In a typical system, the buffer 47 provides storage for five decimal digits, each of which can be any interger between zero and nine. The communication of these five digits requires four binary digits each, so that the interconnecting line 45, as well as the buffer 47, must be a 20-bit wide device. Data from the card inserted into the card reader 43 and supplying the 20 bits of information is typically placed into the register 47 in the same order in which it appears on the card or badge. In the system of the present invention, this data will either be compared with data in a memory 49 (in the remote unit 13) to determine whether the five-digit identification number is present in the memory 49, or will be compared with data stored in the central processor 11, if it is connected. A degraded mode sensor 42 is typically connected in series between the buffer 47 and the memory 49 and is used to selectively send data from the buffer 47 via the shift register 33 to the central processor 11 or directly to the memory 49, depending upon the mode of operation of the terminal 13. If the terminal 13 is is used as a stand-alone terminal, the degraded mode sensor 42 is bypassed so that the buffer 47 is linked directly to the memory system within the remote terminal. Alternatively, if the terminal 13 is used with a central processor, the degraded mode sensor 42 normally transmits data from the buffer 47 to the central processor unit via shift register 33 but can be used when the communication lines are degraded to transfer data from the buffer 47 directly to the memory 49 within the remote terminal. The degraded mode sensor may be substantially as described and claimed in U.S. patent application Ser. No. 830, 002, filed September 1, 1977, and referenced above.
If the memory 49 is being used, and stores an identification number identical to that in buffer 47, it will store, in conjunction with the number, a time code. This time code will be supplied by a memory control circuit 63, associated with the memory 49, to a real-time sensor circuit 51 which provides real-time input for the remote terminal 13. If the real-time input from the circuit 51 corresponds with the time data from the memory 49, the real-time circuit 51 will enable a gate 53 to provide access at the remote location, as through a door access control circuit 54.
In this system it is possible to provide, in addition to the memory 49, a secondary means for screening personnel for access. This mechanism includes a keyboard 55 attached to a buffer 57 and a circuit 59, referred to in FIG. 1 as an IDEC circuit. The IDEC circuit 59 is described in detail in U.S. patent application Ser. No. 830,004, filed Sept. 1, 1977 and referred to previously. For the purpose of the present application, it is sufficient to understand that the IDEC circuit 59 requires that the person requiring access at the door 54 must input a sequence of numbers at the keyboard 55, which is identical to a plurality of numbers read by the card reader 43, but altered in sequence. The IDEC circuit 59 respondes to the data from the buffer 47 as well as the data from the buffer 57 to assure that the proper digits in the proper sequence are input at the keyboard 55. An output from the IDEC circuit 59 on line 61 is required at the gate 53, along with the output from the time of day circuit 51, in order to provide access at the door 54. It should be noted that the IDEC system 59 within the terminal 13 may be used regardless of whether the memory 49 or the central processor 11 memory is used for identification number comparisons.
It will be understood by those skilled in the art that the buffer 47 does not communicate directly with the memory 49, but rather is connected to a memory control 63 which accesses data to and from the memory 49, and organizes the data in memory. This memory control 63 is connected to the keyboard 55 for programming purposes, as shown by line 65, which is connected in series with a supervisor's access circuit 67. The supervisor's access circuit 67 is connected to the buffer 47 and assures that, unless a supervisor's card has been inserted in the card reader 43, the keyboard 55 cannot be used to change the identification numbers or time zones stored in the memory 49. Thus, the keyboard 55 is connected to the IDEC circuit 59 at all times, but is connected to the memory control circuit 63 only when a supervisor's card is used. The supervisor's access module 67 is described and claimed in Patent Application Ser. No. 827,993, filed Aug. 26, 1977, and referred to above. Although not shown in detail in FIG. 1, it will be understood from the description in that application that the circuit 67 compares data from the buffer 47 with a register to determine whether a supervisor's card has been inserted at the card reader 43, and permits access to the write logic incorporated in the memory control 63.
As has been common in the prior art, the central processor 11 may include a memory 69 and memory control 71 as well as a keyboard 73. Thus, the central processor, by monitoring data received from the remote unit 13 and placed in the shift register 31, may be used to grant or deny access through appropriate polling signals supplied from the memory 69 to the shift register 27. While the use, in general, of such a system at the central processor 11 forms a part of the present invention, the details are well known. Thus, the programming of the memory 69 utilizing the keyboard 73 and control 71 may be substantially identical to the programming described below for the memory 49 utilizing the memory control 63 and keyboard 55 at the remote unit. Furthermore, it should be understood that, using the techniques for programming which are described below, and well known communication techniques, it is possible through the communication lines 15-21 to interconnect the keyboard 73 with the memory control 63 in a standard fashion, so that the keyboard 73 may be used to program the memory 49 in one of the remote units 13.
It will also be understood that it is common at the central processor 11 to include a printer 75, typically connected to the memory control 71, for making a permanent record of access authorizations and denials at each of the remote units 13, so that the flow of personnel throughout the security system can be monitored.
Referring to FIG. 2, the details of the memory 49, the memory control 63 as well as the real-time sensor 51 and its connections to the gate 53 and door access control 55, will be described.
The memory 49 is shown schematically in FIG. 2 to include five columns of card identification data digits and a single column of time code digits. The memory 49 stores in numerical sequence the five-digit identification numbers corresponding to the cards or badges of those personnel who are to be granted access at this remote terminal. Following each such identification number is a time code between 1 and 8 delineating the times of day when that particular individual is to be granted access. This time of day control will be understood in more detail through the description which follows.
The memory 49 is a read and write memory, or RAM memory, as is commonly used in digital circuits and is accessed by means of an address buffer 77 which forms a part of the memory control 63. A data buffer 79 is directly connected to the memory 49 and is used to access data from the memory 49 in accordance with the address 77. In the simplest utilization of the memory 49, data from the card reader buffer 47 is supplied on a line 81 to a comparator 83 which is also supplied with data from the data buffer 79. The comparator 83 is designated to provide a signal on a plus line 85 whenever the number accessed from the card reader buffer 47 is smaller than the data from buffer 79, to provide a signal on a minus line 87 whenever the data from the buffer 47 is larger than the data from the buffer 79 and to supply a signal on a zero line 89 when the data from the card reader buffer 47 is identical to the card identification data read from the data buffer 79. It will be understood that, since the time code data is not available from the buffer 47, only the card identification number portion, that is, the most-significant five digits, from the memory 49 is compared in the comparator 83. If the identification number from the buffer 47 is identical to the identification number accessed from the memory 49, indicating that the identification number from the card is present in the memory 49, a gate 93 is enabled to transfer the last four binary bits, conducted from the data buffer 79 on line 91, to the real-time sensor 51. This line 91 carries the decimal digit 1 through 8 which identifies the time code when access is to be permitted for this particular individual. The signal on line 89 enables the gate 93, indicating that the user's identification number is stored in memory.
It can be seen that the signal on line 89 is used to enable the gate 93 to access the time code data to the real-time sensor 51. Except on rare coincidences, the line 89 will not provide a signal, however, until a search for this identification number has been completed.
A search is accomplished as follows. In all cases, the address buffer 77 is initially accessed to the center location of the memory 49. This is accomplished by a shift register 95 which includes nine bit positions, eight of which are filled by consecutive zeroes and one of which is filled by a one. The binary 1 is in the most-significant bit position at the beginning of any data search. Thus, the binary number 1,0,0,0,0,0,0,0,0 is accessed on a line 97 from the shift register 95 and ORed in a gate 99 with a temporary address buffer 101 which, at the beginning of the search, stores the nine-digit binary number 0,0,0,0,0,0,0,0,0. This address is supplied to the address buffer 77 and selects the center position in the memory 49. In response to this accessing, the data buffer 79 is supplied with the center word in the memory 49, and this word is automatically compared with the identification number from the card data buffer 47. If the identification number, accessed at this central point from the memory 49, is smaller than the card identification number from the buffer 47, a signal will be produced on line 85 which will enable a gate 103 to supply the data from the address buffer 77 to the temporary address buffer 101. The temporary address buffer 101 in this instance will contain the word 1,0,0,0,0,0,0,0,0, designating the center location in memory 49. The signal on line 85 is also supplied through an OR gate 105 to a delay 107 which in turn clocks the shift register 95.
The shift register 95 is made recirculating by the connection 108, and the 1 in the most-significant bit position is thus clocked to the second most-significant bit position. If, on the other hand, the number accessed at the central location in the memory 49 is larger than the identification number from the buffer 47, a signal will be produced on line 87 which will recirculate (using gate 105 and delay 107) by one bit the shift register 95, but will not enable the gate 103. The number in the address buffer 77 will thus not be supplied to the temporary address buffer 101.
This searching routine continues so that each time that the comparator 83 produces a plus or minus output signal on line 85 or 87, the binary number in the shift register 95 is circulated by one count. The circulated number in this register 95 is ORed with the temporary address buffer 101, to change the address buffer 77 and thus address a new location in the memory. At the same time, the temporary address buffer is supplied with the additional digit from the shift register 95 only if the output from the comparator 83 indicates that the data is at a higher address location in the memory 49. Thus, the search continues, one bit at a time, in a normal binary search fashion. At each step, the next most-significant bit of the address buffer 77 is made a one if the data is at a higher address in the memory 49. Alternatively, the next most-significant bit of the address buffer 77 is made a zero if the data is at a lower address in the memory 49. This selective addressing is accomplished by either enabling or not enabling, respectively, the gate 103. Ultimately, this search process will locate the position in memory 49 at which the data from the buffer 47 should be stored, and if such data is stored in the memory 49, the data buffer 79 will store the same card identification number as is accessed on line 81, so that a zero signal will be produced on line 89 to gate the time code to the real-time sensor 51. Alternatively, if the search is completed, so that a binary one exists in the least-significant bit position of the shift register 97, this bit will be shifted on the last signal from the dealy 107 to the most-significant bit position. As the one digit is thus shifted by the line 108, it is coupled by line 109 to temporarily disable a gate 111 which temporarily prohibits signals from the OR gate 105 from again actuating the shift register 95, and the search is thus terminated. This same signal on line 109 is used to clear the temporary address buffer 101.
If the search terminates without a zero signal being provided on line 89 from the comparator 83, no signals are produced which will enable the gate 93, and access will not be permitted to the card holder. Obviously, at any time during the search that a zero signal is produced, the search stops, since no signal is supplied to the OR gate 105, and access is immediately permitted if the time of day code compares favorably with the real time, as will be explained in more detail below.
The remainder of the circuitry associated with the memory control circuit 63 is utilized primarily for programming the memory 49 to add or delete identification numbers from the memory 49 or to search the memory 49 for programming purposes, so that the system user may provide access at this remote location for only selected personnel. As previously explained, a supervisor's card is utilized to provide program access, and this access supplies keyboard data from the program access control circuit 67 to a buffer 113, shown in FIG. 2. In a number of cases, the programmer will utilize the keyboard to place an identification number in the buffer 113, followed by a code indicating the operation to be conducted. Thus, for example, the programmer may place an identification number in the buffer 113 and utilize an additional keystroke to indicate that this identification number is to be inserted into the memory, so that an additional employee will be granted access. Alternatively, the additional keystroke may be used to delete this number from memory or simply to search the memory for this number. In some cases, only a single keystroke is used, as, for example, when the programmer wishes to simply increment or decrement the memory address register 77.
Whenever signals are present on line 67 indicating that program access control has been granted, a line 115 coupled to line 67 enables a display 117, the first five digits of which, that is, the identification number digits of which, are provided by the buffer 113. The last digit, reserved for the time code digit from the memory 49, is supplied by the line 91 to the display 117. Thus, the programmer can see the identification number that he keys into the buffer 113, but his last keystroke which indicates the operation he wishes to perform, will not operate the display 117. Rather, the last keystroke will begin a search or other operation which will result in data being placed in the data buffer 79. Ultimately, the last digit of the display 117 will indicate the results of the search or other step by displaying the last digit from the data buffer 79.
The identification number from the buffer 113 is coupled by a line 119 to the comparator 83, while the least-significant bit is coupled by a line 121 to a plurality of comparators. If the least-significant keystroke identifies a memory address incrementing step, data identical to the keystroke is supplied by a buffer 123 so that a comparator 125 supplies a signal on line 127 to an adder 129 which adds unity from a register 131 to the current value of the address buffer 77, as supplied on line 133, and supplies the sum back to the address buffer 77 on line 135. Thus, each time that this keystroke is entered, the address in register 77 is incremented by one location, as required by the programmer. In a similar fashion, a decrementing keystroke will compare favorably in a comparator 137 with data from a buffer 139 to provide a signal on line 141 to add a minus one in a buffer 143 to the value in the address buffer 77, as accessed on line 145, so that an adder 147 provides on line 149 a decremented address, permitting the programmer to decrement the memory location address in register 77 for programming purposes.
If the programmer utilizes a keystroke which requires a search of the memory 69, after first introducing an identification number into the buffer 113, a search routine will be implemented which will search the memory 49 to determine whether the identification number in the buffer 113 exists in the memory 49 and, if so, during what time zones that individual is allowed access. This is accomplished by first comparing the keystroke data with a search keystroke indication in a buffer 151, so that a comparator 153 provides a signal on line 155 to enable a gate 157 which supplies the identification number from the buffer 113 to the comparator 83. The comparator 83 then initiates a search routine in a binary fashion, as previously described, to ultimately provide on lines 91 the decimal digit indicating the time access code for this particular identification number, which time access code will be displayed on the display 117 along with the identification number which was searched. If the identification number is not in the memory 49, a zero output signal on line 89 will not be produced by the comparator 83, and the gate 93 will not be enabled. Thus, no display will appear in the least-significant bit position of the display 117. Alternatively, the system could be designed to provide a zero in the least-significant bit position of the display 117 if the searched identification number is not present in the memory 49.
If, as the least-significant bit after the insertion of an identification number in the buffer 113, the programmer depresses a key which provides an instruction to insert this identification number as a new or additional identification number in the memory 49, a comparator 159 will provide an output signal because of identity between the keystroke data and data from a buffer 161, the signal being provided from the comparator 159 on line 163 to initiate the operation of a counter 165. This operation is initiated by placing the pulse on the clocking input 167 of the counter 165 so that the counter counts to its first position, placing an output signal on a 1 count line 169. When a signal is present on line 169, a comparator 171 compares a delimiter register 173 with a register 175 which stores a count equivalent to the last storage location in the memory 49. The delimiter register 173, as will be understood through the following description, is continuously updated so that it stores a number equal to the number of words stored in the memory 49. When the number in the delimiter register 173 is equal to the number stored in the register 175, this is an indication that the memory 49 is full and the comparator 171 will produce a signal on line 177 to energize a front panel display 179 indicating to the programmer that the memory is full, and that no additional identification numbers should be inserted without first deleting some identification numbers. Furthermore, the full memory indication is not connected to clock the counter 165, so the insert routine will not continue.
If the memory 49 is not full, the comparator 171 will produce a signal on line 181 indicating that the registers 173 and 175 did not store equal numbers. This signal on line 181 is used for clocking the counter 165 to its second count position, producing a signal on line 183. The programmer will have been told that, prior to an insert operation, a search operation should be conducted using the comparator 153 so that, at the time the insert operation is conducted, the address buffer 77 will be addressing the memory 49 at a location immediately preceding or immediately following the location where the new identification number should be inserted. At the end of the search routine, the comparator 83 will provide a plus signal on line 85 if the new data word should immediately precede the present location of the address buffer 77 or a minus signal if it should immediately follow this word. During the insert routine, the output lines of the comparator 83 are checked at the second clock position by ANDing the line 183 in gates 185 and 187 with the minus line 87 and plus line 85, respectively, from the comparator 83. If the minus line 87 contains a logic signal, the AND gate 185 produces an output signal on line 189 to again clock the counter 165 to produce an output signal on its 3-count line 191. If, on the other hand, the plus line 85 is at a positive level, the AND gate 187 will provide a signal on line 193 to a buffer 195 enabling that buffer 195 to input on a plurality of lines 197 to the counter 165 a 6-count, so that the counter 165 will jump from its 2-count position to its 6-count position. This latter step is necessary so that if the new data word is to be stored at the next data position in memory 49 (a plus signal on line 85), a routine will be implemented which skips a data position in the memory 49. If, on the other hand, the present data position where the address buffer 77 presently points is not to be skipped (since the new data word is to go at this present position), the next series of steps between count 2 and count 6 of the counter 165 are used for removing and temporarily storing the presently addressed word from the memory 49, as will be seen from a description of these steps.
When the signal on line 189 clocks the counter 165 to its three count, the signal on line 191 enables a gate 194 so that data from the data buffer 79 is accessed in parallel to a temporary storage buffer 196. This step is used to save the identification number in the current memory location. It will be seen as this description follows that the current memory location is stored in the next lower memory location, while the word from that lower position is, in turn, stored in the next succeeding lower position. Thus, when a new word is placed in memory 49, the counter 165 is used to sequence a repeating routine which shifts the remaining data in the memory 49 toward the bottom of the memory 49 by one step, making room at the proper location in numerical order for the newly added data word.
Once the current identification number has been stored in the temporary register 196, a delay 198 connected to the line 191 is used to clock the counter 165 to its 4-count position. This 4-count position provides a signal on line 201 which enables a gate 203 connecting the buffer 113 to write logic 205 associated with the memory 49. Thus, at count 4, the data previously stored in the current memory location is automatically erased and the new identification number is written in this storage location. A delay circuit 207 connected to the line 201 is used to again clock the counter 165 at the completion of this writing operation so that the counter produces a 5-count output on line 211 which accesses the data word from the temporary buffer 196 into the buffer 113, erasing the number previously stored in the buffer 113, by enabling a gate 213 interconnecting these buffers. This places the number previously stored in the memory 49 (which was removed to make room for the new word) into the buffer 113, so that, on the next circulation of the counter 165, it can be written into the next successive location in the memory 49.
A delay 215 connected to line 211 clocks the counter 165 after the data has been accessed into the buffer 113 and the counter 165 then provides a 6-count output on line 217 which is connected to line 127 to increment the addressed location in the memory 49 as previously described. The line 217 is additionally connected through a delay 219 to clock the counter 165 to its seventh and final output position. It will be recognized that, at the sixth count position, the signal on line 217 incremented the memory 49 location so that the next successive memory word is being accessed. This memory word should be larger than the word currently in the buffer 113, unless we have reached the end of the data in the memory 49, in which case the new word would be 0,0,0,0 and thus smaller than the word stored presently in the buffer 113. Thus, the signals on lines 85 and 87 can be utilized to determine whether the insert routine should stop. The signal on line 221, indicating count 7, is ANDed with the signal on line 85 in AND gate 223 and with the signal on line 87 in AND gate 225. If the AND gate 223 produces an output signal, this signal is connected to an incrementing circuit 227 which is, in turn, connected to increment the delimiting register 173 adding one count to this register. If, on the other hand, the memory transfer operation has not been completed, the output signal from gate 225 will be used, through a delay 229, to clock the counter 165 back to its 3-count position by utilizing a 3-count register 231 to place a count of three in the counter 165. Thus, the sequence continuously loops through counts 3 through 7 until each of the words in the memory 49 has been shifted down one count, and the delimiter register 173 has been incremented. This entire insert routine is shown in the flow chart of FIG. 3. It can be seen from that flow chart that each element of memory data is shifted toward the end of the memory by one position to make room for the new element. The delimiter is then incremented and the process comes to a stop.
A similar process is generated by a keyboard keystroke which provides on line 121 a delete signal which compares favorably with a delete word stored in a buffer 233. This sequence is shown in the flow chart of FIG. 4 and can be followed there as well as in the schematic diagram of FIG. 2. Signals from the comparator 235 connected to the buffer 233 indicate that a keystroke demanding a data element deletion from the memory 49 has been made. This signal on line 237 is used to provide the initial input to a counter 245 used to sequence the deletion process. During the data deletion process, it is desired to delete the element of data located during a search operation and to shift all of the remaining data within the memory 49 to close the gap. Thus, the remaining data in the memory 49 must be moved up in the memory by one data position, and the delimiter 173 must be decremented by one count.
This is accomplished by utilizing the signal on 237 to initially increment the address buffer 77 by providing a signal on line 127. A delay 239 is used to assure that this incrementing has been accomplished, and then provides a signal on line 241 to enable a buffer 243 storing a 2-count to input this 2-count into the counter 245 used for sequencing the deletion process. In response to the 2-count from the buffer 243, the counter 245 provides a 2-count output on line 247 which reads the data word at the incremented location into the temporary buffer 196 by enabling gate 194. In addition, through a delay 249, the signal 247 increments the counter 245 at its clocking input 251. The counter 245 then provides a 3-count output on line 253 which is connected to line 141 to decrement the address in the buffer 77. Line 253 is additionally connected through a delay 255 to clock the counter 245 to a 4-count position producing a signal on line 257. This signal is used to enable gates 213 and 203 to access the data from the temporary buffer 195 to the write logic 205. This logic 205 then writes the word in the temporary buffer 195 into the memory location addressed by the buffer 77 in the memory 49. The signal on line 257, in addition, provides a delayed output from a delay circuit 259 to clock the counter 245 to its 5-count position which provides a signal on line 261. Line 261 is connected to the line 127 to increment the address buffer 77. This signal is also delayed in a delay circuit 263 to provide an additional clocking input to the counter 245. In response to this additional clocking input, the counter 245 provides a 1 output on line 267 which is connected to line 127 to increment the address buffer 77 a second time, and is additionally ANDed in gates 269 and 271 with the plus signal 85 and minus signal 87. If a minus signal 87 is present, the end of search has been reached and the delimiter register is decremented by decrementer 272. If a plus signal is present, the gate 269 provides, through a delay 273, a clocking input to the counter 245 to repeat the data shifting process on the next data word. It can thus be seen that the counter 245 is used to sequence a repeating cycle of steps which are used as a looping function to shift all of the data words in the memory one step toward the beginning of the memory in order to close the gap in the memory which results from deleting a data word therefrom. The flow chart of FIG. 4 diagrams this process utilizing element numbers from the schematic of FIG. 2.
When, in the course of a searching operation, an identification number is located, it was explained previously that the data buffer 79 provides, through gate 93, a 4-bit output indicating the time of day when access is to be provided for the person having this identification number. This number is accessed by the real-time sensor 51 which, as shown in FIG. 2, includes three separate clocks, 301, 303, and 305, each of which can provide the closure of switch in response to a particular time of day setting. Thus, for example, the clock 301 may be set to provide a switch closure from 8:00 A.M. to 5:00 P.M, the clock 303 from 5:00 P.M. to midnight, and the clock 305 from midnight to 8:00 A.M. These three clock switches are accessed to a comparator 307 which is, in turn, provided with signals from the gate 93. If the signals from gate 93 conform to the switch closures from the clocks 301 through 305, access is permitted by placing a signal from the comparator 307 on line 309 to gate 53. In a typical arrangement, the comparator 307 will provide an output signal on line 309 if any one of the clocks 301-305 is providing a switch closure and the signal from gate 93 has a 1-bit on the corresponding line indicating that this employee is to be provided access at the time of day indicated by this switch closure. It can be seen that by setting the clocks 301-305 and by giving a particular employee access at combinations of times from 1, 2, or 3 of these clocks, total flexibility in timing control can be achieved. Furthermore, by providing a time code on the fourth line from the gate 93, the comparator 307 can be made to provide an output signal on line 309 at any time of day, irrespective of the condition of the clocks 301 through 305, so that, for example, supervisory personnel can be granted access at all times.
Referring once again to FIG. 1, it bears repeating that the remote terminal 13 of the present invention will operate utilizing its own memory 49 and memory control 63 in the manner described. Alternatively, this same remote unit can be utilized by accessing data directly from the buffer 47 through the degraded mode sensor 42, shown in FIG. 1, and comparable to that described in U.S. patent application Ser. No. 830,002, filed Sept. 1, 1977, and referenced above. This degraded mode sensor 42 will limit access at this remote terminal in accordance with data stored in the memory 69 in the main processing unit 11 until such time as the communication lines are degraded. At that time, the memory 49 and its memory control 63 will be utilized for limiting access. It can be seen, therefore, that the terminal 13 of the present invention can be used either as a stand-alone terminal by bypassing the degraded mode sensor 42, or may be used as a remote terminal with a central processor system 11, utilizing the degraded mode sensor 42 to impose stand-alone operation only if data lines are degraded.
The present invention permits the same data to be stored in the memory 69 and the memory 49 so that, even during degraded mode oepration, although use of the printer 75 may be lost (so that personnel flow data is no longer available), nevertheless the same limited number of personnel may be granted access at this remote location, so that security is not degraded.
The preceding embodiment described in reference to FIGS. 1 through 4 is illustrative of a hardwired circuit for performing the functions of the present invention. In the preferred embodiment, the functions of the remote units 13 are performed by a microprocessor, as illustrated in FIG. 5. This microprocessor includes a central processing unit 401, such as a Motorola 6800, which is connected with a memory unit 403, such as an AMI Model SF101. In addition, a scratch pad memory 405 can be provided, such as a Motorola 6810. The central processing unit 401 is also connected to a read only memory 407 in a typical fashion to store the control steps for the central processing unit.
As is typical, the central processing unit 401 interfaces with a communication interface unit, such as a Motorola 6850, 409, for communicating with the central processor 11, and may interfere, in addition, with the card sensor 43 and real-time sensor 51, similar to those shown in FIG. 1. A peripheral interface adapter 411, such as a Motorola 6820, is used to connect the central processing unit 401 to the door access control 54, such a door strike. The keyboard 55 of FIG. 1 may also be connected to the central processing unit 401 through the main data and control bus 413.
It will be recognized by those skilled in the art that the data processing unit, shown in FIG. 5, is typical of many other similar data processing units. What makes this processing unit unique is a program stored in the read-only memory 407 for controlling the operation of the central processing unit 401. This program, written for the Motorola 6800, is as follows:
__________________________________________________________________________ ; STANDB -- STAND ALONE READER VERSION B -- 19 DEC 77 ##STR1## ; ; ; THIS IS THE CONTROL SOFTWARE FOR THE RUSCO ; STAND-ALONE READER, BASED ON THE 68.phi..phi. MICROPROCESSOR. 1 ; ; TITLE "ZERO PAGE" ; .phi..phi..phi..phi. HACK = .phi..phi..phi..phi..phi. ZSECT ; ; DELAY COUNTERS ; ; ; THESE TWO BYTE COUNTERS ARE INCREMENTED ; ON EVERY CLOCK TICK. WHEN ONE OF THEM ; CLOCKS TO ZERO, THE ASSOCIATED COMPLETION ; ROUTINE IS CALLED. ; ; IF A COUNTER IS ZERO, IT STOPS ; THIS TABLE RUNS PARALLEL TO `SERV` ;>>>>THE ORDER OF THE ENTRIES IS CRITICAL!!! ; E.G. ASCNTR MUST BE SIXTH BECAUSE OF THE CNTDN KLUDGE ; .phi..phi..phi..phi.Z CNTRS = *.phi..phi..phi..phi. OPCNTR: BLOCK 2 ;(!) SET BY OPEN; WAKES GOON.phi..phi..phi. 2 GOCNTR: BLOCK 2 ;(!) SET BY GOON; WAKES GOOFF.phi..phi..phi.4 GXCNTR: BLOCK 2 ;(!)SET BY GOON, GXOFF; WAKES GXOFF.phi..phi..phi.6 EDCNTR: BLOCK 2 ;SET BY COMCON;WAKES EDEND.phi..phi..phi.8 ERCNTR: BLOCK 2.phi..phi..phi.A ASCNTR: BLOCK 2 ;(!)SET BY GOOFF; WAKES RLYOFF(2.phi.).phi..phi..phi.C DUCNTR: BLOCK 2.phi..phi..phi.E BLOCK 2 ;FOR PATCHING ; NOTE: (!) MEANS CLEARED BY NOTIME ;*** .phi..phi.1.phi. NCNTRS = *-CNTRS ;NUMBER OF **BYTES** OF COUNTERS ; ; STATE FLAGS ; ; ; SOME BYTES TO INDICATE THE CURRENT MACHINE ; STATE AND THE RESULTS OF PROCESSING A CARD ; ENTRY. ;.phi..phi.1.phi. APBFLG: BLOCK 1.phi..phi.11 CRDFLG: BLOCK 1.phi..phi.12 EDMODE: BLOCK 1 ;SET MEANS WE ARE EDITING.phi..phi.13 OHFLG: BLOCK 1 ;1 MEANS OPEN HOUSE ; ; ; ; KEYBOARD DATA TABLES ;.phi..phi.14 KEYTAB: BLOCK 5 ;IDEK OR EDIT INPUT.phi..phi.19 KEYZON: BLOCK 1 ;SIXTH EDIT DIGIT.phi..phi.1A KEYPTR: BLOCK 1 ;ALWAYS ZERO.phi..phi.1B KEYCNT: BLOCK 1.phi..phi.1C DURESF: BLOCK 1.phi..phi.1D CMDBYT: BLOCK 1 ;ZERO OR KEYBOARD CMD.phi..phi.1E POISON: BLOCK 1 ;WIPE OUT DISPLAY ; ;ON NEXT NUMERIC KEY.phi..phi.1F KEYFLG: BLOCK 1 ;WEVE SEEN THIS KEY BEFORE.phi..phi.2.phi. OLDKEY: BLOCK 1 ;FF OR LAST KEY SEEN ;.phi..phi.21 MASTER: BLOCK 4 ;CARD DIGIT INDICES.phi..phi.25 MASHER: BLOCK 4 ;" " " BUT UNPERMUTED.phi..phi.29 MATCH: BLOCK 1 ; ; CARD DATA BUFFER ;.phi..phi.2A DIGTAB: BLOCK 8 ;DIGITS READ FROM CARD.phi..phi.32 ENDMEM: BLOCK 2 ;FIRST ADDR NOT IN CMOS MEMORY.phi..phi.34 DISDIG: BLOCK 3 ;SEARCH COMPARAND.phi..phi.37 EDTPTR: BLOCK 2 ;FIRST BYTE OF `THIS` RECORD.phi..phi.39 EDTZON: BLOCK 1 ;TIME ZONE OF `THIS` RECORD ; ZERO MEANS EDTPTR POINTS TO INVALID RECORD ; ; ERROR RETRIES ID AND COUNT ;.phi..phi.3A RTLBUF: BLOCK 5.phi..phi.3F NTRIES: BLOCK 1 ; ; XREG ; ; ; SAVE AREAS FOR X BECAUSE YOU CAN'T ; SAVE IT ANY OTHER WAY ;.phi..phi.4.phi. XREG.phi.: BLOCK 2.phi..phi.42 XREG1: BLOCK 2.phi..phi.44 SCNPTR: BLOCK 2.phi..phi.46 DIGPTR: BLOCK 2.phi..phi.48 COMBX: BLOCK 2.phi..phi.4A MIXPTR: BLOCK 2.phi..phi.4C MUXPTR: BLOCK 2 ;POINTS TO DIGIT TO BE DISPLAYED.phi..phi.4E MUXTMP: BLOCK 1 ; ; ; FPROM AND I/O ADDRESSES ; ; ; .phi..phi.8.phi. FPROM = $8.phi. .phi..phi.84 SCNTAB = $84 ;COIL ADDR TABLE ; .phi..phi.A4 BUFA = $A4 ;PIA COIL ADDRESSES .phi..phi.A5 CSRA = BUFA+1 .phi..phi.A6 BUFB = BUFA+2 ;PIA RELAYS .phi..phi.A7 CSRB = BUFA+3 ; .phi..phi.A8 ACSTAT = $.phi..phi.A8 ;ACIA STATUS PORT .phi..phi.A9 ACDATA = ACSTAT+1 ;ACIA I/O PORT ; .phi..phi.E.phi. ROW.phi. = $.phi..phi.E.phi. ;KEYBOARD SWITCH ROW ; DIP SWITCH ADDRESSES.phi..phi.C3 ASECT $.phi..phi.C3.phi..phi.C3 S.XXX: BLOCK 1 ;EXTERNAL SENSOR SWITCHES.phi..phi.C4 S.COMB: BLOCK 1 ;PERMUTATION & COMBINATION.phi..phi.C5 S.SYS: BLOCK 1 ;SYSTEM CODE .phi..phi.C6 S.AS = * ;AS/DOD TIMER COUNT.phi..phi.C6 S.VTD: BLOCK 1 ;VTD TIMER COUNT ; ; CMOS MEMORY ASSIGNMENTS.phi..phi..phi..phi. VSECT.phi..phi..phi..phi. SUM: BLOCK 2 ;CHECKSUM OF REST OF CMOS.phi..phi..phi.2 FOX: BLOCK 3 ;ID OF PERSON ALLOWED TO EDIT MEMORY.phi..phi..phi.5 ENDPTR: BLOCK 2 ;FIRST BYTE AFTER VALID MEMORY.phi..phi..phi.7 CMOS: BLOCK 3*5 ;ALLOW FIVE ENTRIES .phi..phi.16V END1 = * ;FIRST ADDR NOT IN CMOS.phi..phi.16 BLOCK 3 ;AND ONE MORE .phi..phi.19V END2 = *.phi..phi..phi..phi. PSECT ; ; KLUDGEY LINKS TO FOREGROUND MODULE ;.phi..phi..phi..phi. RTC: BLOCK 3.phi..phi..phi.3 OPEN: BLOCK 3.phi..phi..phi.6 BLANK: BLOCK 3.phi..phi..phi.9 RLYON: BLOCK 3 ; .phi..phi..phi.6P RUBOUT = BLANK ; ; RESET AND INTERRUPT VECTORS ;.phi.FF8 ASECT $.phi.FF8.phi.FF8 WORD RTC ;REAL TIME CLOCK.phi.FFA WORD $FC.phi.4 ;SWI TO KERNEL ; ; BIT MASKS, ETC. ; ;************ ; ; FIRST, THE OPTION BITS ; THESE SYMBOLS ARE USED TO REFER TO BITS IN ; THE OPTION BYTES ; ;** FIRST OPTION BYTE .phi..phi.4.phi. O.OH = $4.phi. ;OPEN HOUSE MODE .phi. .phi.2.phi. O.AS = $2.phi. ;ALARM SHUNT .phi..phi..phi.8 O.BIG = $.phi.8 ;LARGE CMOS MEMORY .phi..phi..phi.2 O.TZ = $.phi.2 ;TIME ZONE INPUTS .phi..phi..phi.1 O.IDEK = $.phi.1 ;WE ARE AN IDEK READER ;** NOW FOR THE SECOND BYTE OF OPTIONS .phi..phi.4.phi. O.ERAN = $4.phi. ;ERROR ANNUNCIATOR .phi..phi.2.phi. O.DUR = $2.phi. ;DURESS RELAY ; ; NOW FOR THE RELAY BITS ; .phi..phi.8.phi. R.GO = $8.phi. .phi..phi.4.phi. R.DUR = $4.phi. ;DURESS RELAY .phi..phi.2.phi. R.AS = $2.phi. ;ALARM SHUNT .phi..phi.1.phi. R.ERRAN = $1.phi. ;ERRAN ; ; NOW FOR THE EXTERNAL SWITCHES ; (THESE ARE BITS WITHIN THE WORD S.XXX) ; .phi..phi..phi.1 X.ICK = $.phi.1 ;CLOSED=ZERO=CARD ONLY ;X.TRIES = $.phi.6 ;NTRIES SWITCH INPUTS .phi..phi..phi.8 X.FOX = $.phi.8 ;STORE NEXT CARD AS FOX ;X.TZ = $7.phi. ;TIME CLOCK INPUTS .phi..phi.8.phi. X.AS = $8.phi. ;SHUNT REQUEST PUSHBUTTON SWITCH ; ; ; DELAY TIMES ; ; ; THE COUNTER/TIMERS IN THE FOREGROUND ROUTINE ; ARE CLOCKED ONCE EVERY 3.33 ; MILLISECONDS (3.phi..phi. TIMES A SECOND). ; EACH COUNTER IS A TW.phi. BYTE COUNTER, AND ; IS INCREMENTED ON EACH CLOCK TICK. ; TIMEOUT OCCURS WHEN COUNTER OVERFLOWS ; TO ZERO. ; ; FFF.phi. T.5.phi.MS = -16 ;5.phi. MILLISECONDS FED4 T..phi.1S = -3.phi..phi. ;1 SECOND FC7C T..phi.3S = -9.phi..phi. ;3 SECONDS F448 T.1.phi.S = -3.phi..phi..phi. ;1.phi. SECONDS DCD8 T.3.phi.S = -9.phi..phi..phi. ;3.phi. SECONDS B9B.phi. T.6.phi.S = -18.phi..phi..phi. ;ONE MIN ; ; ; BACK ; ; ; THIS IS THE CONTROLLING PROGRAM FOR THE ; BACKGROUND TASKS. MOST OF THE EXECUTION ; TIME OF THE PROCESSOR IS SPENT IN THIS ; ROUTINE CHECKING STATUS BITS ; AND WAITING TO BEGIN ONE OF SEVERAL ; BACKGROUND TASKS. THE FOLLOWING ; TASKS ARE INITIATED FROM THIS ROUTINE: ; ; 1. INITIATE RESPONSE TO CONSOLE INQUIRY ; OR COMMAND. ; ; 2. CHECK FOR CARD, OPEN DOOR IF OK ; ; 3. CHECK FOR MASTER CARD, ACCEPT PROGRAMMING COMMANDS ; TITLE "BACK".phi..phi..phi.C PSECT ;.phi..phi..phi.C 8E .phi..phi.68 START: LDS #$.phi..phi.68 ;INIT STACK PTR.phi..phi..phi.F BD .phi.197 JSR IOSET ;INITIALIZE I/O DEVICES.phi..phi.12 BD .phi.18C JSR CLRRAM ;INITIALIZE MACHINE STATE ;.phi..phi.15 CE FFFF LDX #$FFFF.phi..phi.18 DF 8.phi. STX FPROM ;ENABLE ALL FEATURES ; DETERMINE MEMORY SIZE.phi..phi.1A CE .phi..phi.16 LDX #END1.phi..phi.1D 96 8.phi. LDAA FPROM.phi..phi.1F 84 .phi.8 ANDA #O.BIG.phi..phi.21 27 .phi.3 = BEQ ENDMMS.phi..phi.23 CE .phi..phi.19 LDX #END2.phi..phi.26 DF 32Z ENDMMS: STX ENDMEM ;.phi..phi.28 BD .phi.4.phi.1 JSR CHKSUM ;IS CMOS OK?.phi..phi.2B 27 .phi.9 = BEQ SUMOK.phi..phi.2D 7F .phi..phi..phi.4 CLR FOX+2 ;WIPE OUT PART OF FOX.phi..phi.3.phi. BD .phi.3AE JSR DOCLR ;WIPE OUT REST OF CMOS.phi..phi.33 BD .phi.412 JSR SETSUM ;SUM OK NOW!.phi..phi.36P SUMOK = * ;.phi..phi.36 PION ;TURN ON INTERRUPTS ; ; ; MAIN BACKGROUND LOOP ;.phi..phi.37P BACK = *.phi..phi.37 86 34 LDAA #$34.phi..phi.39 97 A5 STAA CSRA ;WAKE UP DEADMAN.phi..phi.3B 96 11Z LDAA CRDFLG.phi..phi.3D 81 .phi.1 CMPA #$.phi.1 ;NEW CARD?.phi..phi.3F 26 F6 = BNE BACK ; HERE WHEN WE GET A NEW CARD.phi..phi.41 BD .phi.1B6 JSR CARDRD.phi..phi.44 BD .phi.2B5 JSR PAKARD ;CONDENSE INTO DISDIG ;.phi..phi.47 BD .phi.41C JSR CHKSYS.phi..phi.4A 26 4C = BNE ERROR ;BAD SYS CODE.phi..phi.4C BD .phi.42D JSR FRTL ;SEE IF NEW PERSON TRYING ;.phi..phi.4F 96 C3 LDAA S.XXX.phi..phi.51 84 .phi.8 ANDA #X.FOX ;NEW MASTER?.phi..phi.53 27 4C = BEQ NEWFOX ;YES . . . . DO NOT OPEN DOOR, THOUGH ; SEE IF WE SHOULD GO INTO EDIT MODE.phi..phi.55 BD .phi.25.phi. JSR CHKFOX.phi..phi.58 26 .phi.3 = BNE *+5.phi..phi.5A 7E .phi..phi.F8 JMP NEWED ;YES, SIR! ; HERE IF ORDINARY ENTRY ATTEMPT.phi..phi.5D 86 34 BCK: LDAA #$34 ;KEEP DEADMAN FROM TRASHING US.phi..phi.5F 97 A5 STAA CSRA.phi..phi.61 96 11Z LDAA CRDFLG ;LEAVE LOOP IF CARD REMOVED PREMATURELY.phi..phi.63 27 D2 = BEQ BACK.phi..phi.65 BD .phi..phi.AD JSR CHKIDK ;EXAMINE IDEK PASSWORD.phi..phi.68 27 F3 = BEQ BCK ;NOT READY YET.phi..phi.6A 25 2C = BCS ERROR ;HE FLUBBED HIS PASSWORD! ;.phi..phi.6C 96 13Z LDAA OHFLG.phi..phi.6E 26 19 = BNE LETIN ;TODAY IS OPEN HOUSE ;.phi..phi.7.phi. BD .phi.2.phi.7 JSR FIND ;COMPARAND IN DISDIG ALREADY ; HERE WITH APPROPRIATE TZ IN EDTZON .phi..phi.73 96 C3 LDAA S.XXX ;READ TIME ZONE INPUTS.phi..phi.75 44 LSRA.phi..phi.76 44 LSRA.phi..phi.77 44 LSRA.phi..phi.78 44 LSRA.phi..phi.79 84 .phi.7 ANDA #$.phi.7 ;TZ INPUTS IN 3 LSBS.phi..phi.7B 8A .phi.8 ORAA #$.phi.8 ;SUPER TIME ZONE ALWAYS ON ;.phi..phi.7D D6 8.phi. LDAB FPROM.phi..phi.7F C4 .phi.2 ANDB #O.TZ ;DID HE PAY FOR TIME ZONES?.phi..phi.87 27 .phi.F = BEQ ERROR ;NOT ALLOWED AT THIS TIME ; HERE AFTER WE HAVE RUN THE ENTIRE GAUNTLET ; ALL IS OK, LET HIM IN.phi..phi.89 86 FE LETIN: LDAA #$FE ;MEANS CARD PROCESSED.phi..phi.8B 97 11Z STAA CRDFLG.phi..phi.8D BD .phi.44A JSR DURESS.phi..phi.9.phi. BD .phi..phi..phi.3 JSR OPEN.phi..phi.93 7F .phi..phi.3F CLR NTRIES.phi..phi.96 2.phi. 9F = BRA BACK ;GO WAIT FOR NEXT CARD ; ; ; HERE WHEN WE DECIDE THAT WE WILL NOT LET THIS GUY IN.phi..phi.98P ERROR = *.phi..phi.98 86 FE LDAA #$FE ;WERE THROUGH WITH THIS CARD.phi..phi.9A 97 11Z STAA CRDFLG.phi..phi.9C BD .phi. .phi.CE JSR ERRTRY ;PULL IN ERRAN IF TOO MANY TRIES.phi..phi.9F 2.phi. 96 = BRA BACK ; ; HERE WHEN THE NEW FOX CARD IS PUT IN.phi..phi.A1P NEWFOX = *.phi..phi.A1 86 FE LDAA #$FE.phi..phi.A3 97 11Z STAA CRDFLG ;WE ARE THROUGH WITH THIS CARD.phi..phi.A5 BD .phi.23B JSR SETFOX.phi..phi.A8 BD .phi.412 JSR SETSUM ;FIX UP CHECKSUM.phi..phi.AB 2.phi. 8A = BRA BACK ; ; ROUTINE TO CHECK IDEK PASSWORD ; RETURNS WITH Z SET IF NOTT READY ; RETURNS WITH C SET IF HE GOT IT WRONG ; BOTH CLEAR IF ALL OK.phi..phi.ADP CHKIDK = *.phi..phi.AD 96 8.phi. LDAA FPROM.phi..phi.AF 84 .phi.1 ANDA #O.IDEK -.phi..phi.B1 27 17 = BEQ HAPPY ;NOT AN IDEK READER! ;.phi..phi.B3 96 C3 LDAA S.XXX.phi..phi.B5 84 .phi.1 ANDA #X.ICK ;CARD+ KEYBOARD?.phi..phi.B7 27 11 = BEQ HAPPY ;NO, CARD ONLY ;.phi..phi.B9 96 1BZ LDAA KEYCNT.phi..phi.BB 81 .phi.4 CMPA #$.phi.4 ;THERE ARE 4 DIGS IN A PASSWORD.phi..phi.BD 2B .phi.9 = BMI NOIDEK ;NOT ENUF YET ;.phi..phi.BF BD .phi.45F JSR COMBIN.phi..phi.C2 25 .phi.6 = BCS HAPPY ; HERE IF BAD IDEK.phi..phi.C4 86 .phi.1 LDAA #1 ;NOT ZERO.phi..phi.C6 .phi.D SEC.phi..phi.C7 39 RTS ; HERE IF NOT READY.phi..phi.C8P NOIDEK = *.phi..phi.C8 4F CLRA.phi..phi.C9 39 RTS ; HERE IF GOOD IDEK.phi..phi.CAP HAPPY = *.phi..phi.CA 86 .phi.1 LDAA #1.phi. .phi.CC .phi.C CLC.phi..phi.CD 39 RTS ; ; ; CALL HERE ONCE FOR EACH ERROR ; PULLS IN ERRAN WHEN NTRIES IS USED UP.phi..phi.CEP ERRTRY = *.phi..phi.CE 96 81 LDAA FPROM+1.phi..phi.D.phi. 84 4.phi. ANDA #O.ERAN.phi..phi.D2 27 1A = BEQ ETD ;SAVE OURSELVES A LOT OF WORK ;.phi..phi.D4 7C .phi..phi.3F INC NTRIES ;KEEP COUNT.phi..phi.D7 96 C3 LDAA S.XXX ;GET SWITCH SETTING.phi..phi.D9 44 LSRA.phi..phi.DA 84 .phi.3 ANDA #$.phi.3.phi..phi.DC 4C INCA ;ZERO ON SWITCHES=ONE TRY.phi..phi.DD 91 3FZ CMPA NTRIES.phi..phi.DF 26 .phi.D = BNE ETD ;STILL TRYING ;.phi..phi.E1 86 1.phi. LDAA #R.ERAN.phi..phi.E3 BD .phi..phi..phi.9 JSR RLYON.phi..phi.E6 7F .phi..phi.3F CLR NTRIES.phi..phi.E9 CE FC7C LDX #T..phi.3S.phi..phi.EC DF .phi.8Z STX ERCNTR ;.phi..phi.EE 39 ETD: RTS ; ; ; HERE WHEN THROUGH EDITING.phi..phi.EFP FINED = *.phi..phi.EF 7F .phi..phi.12 CLR EDMODE.phi..phi.F2 BD .phi..phi..phi.6 JSR BLANK.phi..phi.F5 7E .phi..phi.37 JMP BACK ; ; ; MAIN LOOP FOR EDITING MEMORY ;.phi..phi.F8P NEWED = *.phi..phi.F8 86 FE LDAA #$FE.phi..phi.FA 97 11Z STAA CRDFLG ;HIS CARD IS FINISHED! ;.phi..phi.FC 7C .phi..phi.12 INC EDMODE ;WE ARE NOW EDITING.phi..phi.FF BD .phi.182 JSR BADCMD.phi.1.phi.2 CE .phi..phi..phi.7 LDX #CMCS.phi.1.phi.5 DF 37Z STX EDTPTR.phi.1.phi.7 CE B9B.phi. LDX #T.6.phi.S.phi.1.phi.A DF .phi.6Z STX EDCNTR ;TURN OFF IF IDLE ONE MIN.phi.1.phi.C 7F .phi..phi.39 CLR EDTZON ;.phi.1.phi.FP EDIT = *.phi.1.phi.F 86 34 LDAA #$34.phi.111 97 A5 STAA CSRA.phi.113 7D .phi..phi.12 TST EDMODE.phi.116 27 D7 = BEQ FINED ;LEAVE EDIT MODE.phi.118 96 1DZ LDAA CMDBYT.phi.11A 2F F3 = BLE EDIT.phi.11C BD .phi.129 JSR COMCON.phi.11F BD .phi.412 JSR SETSUM.phi.122 CE B9B.phi. LDX #T.6.phi.S.phi.125 DF .phi.6Z STX EDCNTR.phi.127 2.phi. E6 = BRA EDIT ; ; COMMAND DISPATCHER ; CALL HERE WITH CMD CODE IN A ;.phi.129P COMCON = *.phi.129 7F .phi..phi.1D CLR CMDBYT ;SO WE WON'T TRY TO DO IT AGAIN.phi.12C 84 .phi.F ANDA # $.phi.F ;STRIP OFF HIGH ORDER BITS.phi.12E 81 .phi.B CMPA #$.phi.B ;BIGGEST CMD IS .phi.A.phi.13.phi. 2A 3B = BPL COMRTS ;ILLEGAL IGNORE.phi.132 48 ASLA ;TWO BYTES TO AN ADDR ; AT THIS POINT A CONTAINS .phi..phi..phi..phi.XXX.phi..phi.133 97 43Z STAA XREG1+1 ;LSB OFFSET.phi.135 86 ?? LDAA #MSB COMTAB.phi.137 97 42Z STAA XREG1 ;MSB TABLE ADDR.phi.139 DE 42Z LDX XREG1.phi.13B EE ?? LDX CMTLSB,X ;LSB TABLE ADDR.phi.13D 6E .phi..phi. JMP .phi.,X ;.phi.13FP COMTAB = *.phi.13F WORD RUBOUT,UP,C.OH,CLRALL.phi.147 WORD DOWN,C.XOH,DELETE,SEARCH.phi.14F WORD RUBOUT,QUIT,INSERT.,RUBOUT???? CMTLSB = LSB COMTAB ; ; SERVICE ROUTINE FOR QUIT CMD.phi.157 7F .phi..phi.12 QUIT: CLR EDMODE ;BACKGRUND WILL NOTICE FLAG.phi.15A 39 RTS ; ; SERVICE FOR OPEN HOUSE CMD.phi.15BP C.OH = *.phi.15B 96 8.phi. LDAA FPROM.phi.15D 84 4.phi. ANDA #O.OH.phi.15F 27 21 = BEQ BADCMD ;.phi.161 BD .phi..phi..phi.6 JSR BLANK.phi.164 86 .phi.1 LDAA #$.phi.1.phi.166 97 13Z STAA OHFLG.phi.168 97 19Z STAA KEYZON ;SHOW CMD ACCEPTED.phi.16A 7C .phi..phi.1E INC POISON.phi.16D 39 COMRTS: RTS ; ; SERVICE FOR END OPEN HOUSE CMD.phi.16EP C.XOH = *.phi.16E 96 8.phi. LDAA FPROM.phi.17.phi. 84 4.phi. ANDA #O.OH.phi.172 27 .phi.E = BEQ BADCMD ;.phi.174 BD .phi..phi..phi.6 JSR BLANK.phi.177 86 .phi.2 LDAA #$.phi.2.phi.179 97 19Z STAA KEYZON.phi.17B 7C .phi..phi.1E INC POISON.phi.17E 7F .phi..phi.13 CLR OHFLG ; HERE TO RETRUN A CODE OF ZERO.phi.182 BD .phi..phi..phi.6 BADCMD: JSR BLANK.phi.185 7C .phi..phi.1E INC POISON.phi.188 7F .phi..phi.19 CLR KEYZON.phi.18B 39 RTS ; ; ; ; CLRRAM ; ; ; CLEARS ALL RAM FROM .phi..phi..phi..phi. TO VAREND ; USED TO INIT RAM ON STARTUP ;.phi.18C CE .phi..phi.4F CLRRAM: LDX #VAREND.phi.18F 6F .phi..phi. CLRRML: CLR .phi.,X.phi.191 .phi.9 DEX.phi.192 26 FB = BNE CLRRML.phi.194 6F .phi..phi. CLR .phi.,X ;CLEAR BYTE ZERO ALSO!.phi.196 39 RTS ; ; ; ; I/O INITIALIZATION ROUTINES ; ;.phi.197 7F .phi..phi.A5 IOSET: CLR CSRA ;ROUTING BIT=.phi. MEANS DDRS.phi.19A 7F .phi..phi.A7 CLR CSRB.phi.19D 86 FF LDAA #$FF ;1 MEANS OUTPUT.phi.19F 97 A4 STAA BUFA.phi.1A1 86 FE LDAA #$FE ;ONE INPUT FOR CARDIN.phi.1A3 97 A6 STAA BUFB ; SET CA2 TO `MANUAL`, LOW=PG, HIGH=FG ; (FOR DEADMAN) ; SET CA1 TO REACT TO FALLING EDGE OF COIL DATA.phi.1A5 86 34 LDAA #$34 ;$30 FOR FOREGROUND.phi.1A7 97 A5 STAA CSRA ; CB2 REACTS TO THE RISING EDGE OF RTC ; CB1 IS UNUSED.phi.1A9 86 .phi.E LDAA #$.phi.E.phi.1AB 97 A7 STAA CSRB ; NOW SET INITAL VALUES ; NO COILS SELECTED, NO RELAYS ON.phi.1AD 86 F.phi. LDAA #$F.phi..phi.1AF 97 A4 STAA BUFA.phi.1B1 86 .phi.E LDAA #$.phi.E.phi.1B3 97 A6 STAA BUFB.phi.1B5 39 RTS2: RTS ; ; ;* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * ; ; CARD READER ; ;* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * ; ; ; THIS SET OF ROUTINES READS THE MAGNETS, ; ASSEMBLES BITS INTO 4-BIT DIGITS ; AND STORES THEM ONE TO A WORD AT DIGTAB ; ;.phi.1B6 CE .phi..phi.84 CARDRD: LDX #SCNTAB ;POINTS AT COIL ADDRESSES.phi.1B9 DF 44Z STX SCNPTR.phi.1BB CE .phi..phi.2A LDX #DIGTAB.phi.1BE DF 46Z STX DIGPTR ;POINTS TO PLACE TO KEEP THE DIGITS.phi.1C.phi.P CRDRDL = * ; ; HERE TO READ THE NEXT DIGIT OF THE CARD ; ; LDX DIGPTR ; ;ASSUME X CONTAINS DIGPTR.phi.1C.phi. 8C .phi..phi.31 CPX #DIGTAB+7 ;STOP AFTER 7 DIGITS.phi.1C3 26 .phi.1 = BNE CRDOIT.phi.1C5 39 RTS ;ALL DIGITS ACCUMULATED ;.phi.1C6 C6 1.phi. CRDOIT: LDAB #$1.phi. ;WILL CARRY AFTER 4 ITERATIONS.phi.1C8P BITRDL = * ; HERE TO READ ONE BIT AND INCLUDE IT IN DIGIT ;.phi.1C8 BD .phi.1DA JSR CRDSCN ;SCAN CARD FOR BIT.phi.1CB 59 ROLB ;ROLL CARRY BIT INTO B.phi.1CC 7C .phi..phi.45 INC SCNPTR+1 ;UPDATE BIT INDEX LSB.phi.1CF 24 F7 = BCC BITRDL ;IF KLUDGEY FLAG BIT CARRIED OUT ; WE HAVE A DIGIT ; STORE IT IN RAM ;.phi.1D1 DE 46Z LDX DIGPTR.phi.1D3 E7 .phi..phi. STAB .phi.,X.phi.1D5 .phi.8 INX ;UPDATE STORAGE POINTER.phi.1D6 DF 46Z STX DIGPTR ;SAFEKEEPING IN RAM.phi.1D8 2.phi. E6 = BRA CRDRDL ;GO GET ANOTHER DIGIT ; ; ; ; ; CRDSCN: CHECKS MAGNET BIT ; ; CALL WITH INDEX INTO COIL ADDR TABLE IN SCNPTR ; SETS CARRY BIT ACCORDING TO RESULT ;.phi.1DA 86 F.phi. CRDSCN: LDAA #$F.phi. ;CLEAR COILS.phi.1DC 97 A4 STAA BUFA.phi.1DE .phi.1 NOP ;WAIT FOR COILS TO SETTLE.phi.1DF .phi.1 NOP.phi.1E.phi. .phi.1 NOP.phi.1E1 96 A4 LDAA BUFA ;CLR PIA EDGE DETECTOR.phi.1E3 DE 44Z LDX SCNPTR ;PTR FOR THIS BIT ;.phi.1E5 .phi.7 TPA ;DISABLE INTERRUPTS DUE.phi.1E6 36 PSHA ;TO CRITICAL TIMING.phi.1E7 PIOFF ;.phi.1E8 A6 .phi..phi. LDAA .phi.,X ;GET COIL ADDRESS FROM FPROM.phi.1EA 97 A4 STAA BUFA ;AND TURN ON COIL.phi.1EC .phi.1 NOP.phi.1ED .phi.1 NOP.phi.1EE .phi.1 NOP.phi.1EF .phi.1 NOP.phi.1F.phi. .phi.1 NOP ;WAIT FOR COIL RESPONSE.phi.1F1 .phi.1 NOP.phi.1F2 .phi.1 NOP ;SET CARRY BIT ACCORDING TO.phi.1F3 96 A5 LDAA CSRA ;RESPONSE ON CRA7.phi.1F5 2B .phi.8 = BMI CRDSC ;.phi.1F7 32 PULA ;RESTORE INTERRUPT STATUS.phi.1F8 .phi.6 TAP.phi.1F9 86 F.phi. LDAA #$F.phi. ;TURN OFF COIL.phi.1FB 97 A4 STAA BUFA.phi.1FD .phi.D SEC ;NORTH SPOT--SET CARRY.phi.1FE 39 RTS ;.phi.1FF 32 CRDSC: PULA ;RESTORE INTERUPT STATUS.phi.2.phi..phi. .phi.6 TAP.phi.2.phi.1 86 F.phi. LDAA #$F.phi..phi.2.phi.3 97 A4 STAA BUFA.phi. 2.phi.5 .phi.C CLC ;SOUTH SPOT--CLR CARRY ;.phi.2.phi.6 39 RTS ; ; FIND ; ; THE FIND ROUTINE SEARCHES THE TABLE OF IDS FOR THE ID ; STORED IN DISDIG. IF THE ID IS FOUND IN THE TABLE THEN ; THE TIME ZONE FOR THAT ID IS RETURNED IN ; EDTZON. ALSO, THE VARIABLE EDTPTR IS SET TO ; POINT TO THE FIRST BYTE OF THE MATCHING ENTRY. ; IF THE ID IS NOT FOUND THEN EDTZON IS SET TO ; ZERO AND EDTPTR POINTS TO THE FIRST ENTRY LARGER ; THAN THE ID. IF THE ID IS GREATER THAN ALL THE ENTRIES ; IN THE TABLE THEN EDTPTR HAS THE VALUE ENDPTR. ;.phi.2.phi.7 CE .phi..phi..phi.4 FIND: LDX #CMOS-3 ;ADDRESS OF TABLE - 3 ;.phi.2.phi.A BD .phi.3DE DOENT: JSR INX3 ;NEXT ELEMENT OF TABLE.phi.2.phi.D DF 37Z STX EDTPTR ;MAYBE THIS IS THE ENTRY WE SEEK.phi. 2.phi.F BC .phi..phi..phi.5 CPX ENDPTR ;END OF TABLE.phi.212 27 .phi.D = BEQ NOTFOU ;WELL COMPARAND NOT FOUND IN TABLE ;.phi.214 BD .phi.225 JSR COMDIG ;COMPARE DISDIG AND TABLE ENTRY.phi.217 25 F1 = BCS DOENT ;IF LOW THEN TRY NEXT ENTRY.phi.219 22 .phi.6 = BHI NOTFOU ;WE HAVE GONE TOO FAR ;.phi.21B A6 .phi.2 LDAA 2,X ;GET THIRD BYTE OF ENTRY.phi.21D 84 .phi.F ANDA #$.phi.F ;LEAVE ONLY TIME ZONE.phi.21F 2.phi. .phi.1 = BRA RET ;.phi.221 4F NOTFOU: CLRA ;ZERO TIME ZONE ;.phi.222 97 39Z RET: STAA EDTZON ;SAVE TIME ZONE.phi.224 39 RTS ; ; COMDIG ; ; COMDIG COMPARES THE ENTRY POINTED TO BY X ; WITH THE ID STORED IN DISDIG. RETURNS CARRY SET ; IF THE ENTRY IS SMALLER, ZERO SET IF THEY ARE ; THE SAME. ;.phi.225 A6 .phi..phi. COMDIG: LDAA .phi.,X ;GET FIRST BYTE OF TABLE ENTRY.phi.227 91 34Z CMPA DISDIG ;COMPARE TABLE BYTE AND ID BYTE.phi.229 26 .phi.F = BNE RETCOM ;RETURN IF NOT EQUAL ;.phi.22B A6 .phi.1 LDAA 1,X ;SECOND BYTE OF TABLE ENTRY.phi.22D 91 35Z CMPA DISDIG+1 ;COMPARE SECOND BYTES.phi.22F 26 .phi.9 = BNE RETCOM ;.phi.231 A6 .phi.2 LDAA 2,X ;THIRD BYTE.phi.233 84 F.phi. ANDA #$F.phi. ;ZAP TIME ZONE FIELD.phi.235 D6 36Z LDAB DISDIG+2 ;GET THIRD BYTE OF DISDIG.phi.237 C4 F.phi. ANDB #$F.phi. ;ZAP ITS TIME ZONE, TOO.phi.239 11 CBA ;.phi.23A 39 RETCOM: RTS ; ; SETFOX ; ; SETFOX SETS THE MASTER CARD. THE KEY IN DIGTAB ; IS STORED INTO THE LOCATION FOX. ;.phi.23B BD .phi.2B5 SETFOX: JSR PAKARD ;PACK DIGTAB INTO DISDIG.phi.23E 96 34Z LDAA DISDIG ;GET FIRST BYTE OF DISDIG.phi.24.phi. B7 .phi..phi..phi.2 STAA FOX ;PUT INTO FIRST BYTE OF FOX.phi.243 96 35Z LDAA DISDIG+1 ;SECOND DIGIT.phi.245 B7 .phi..phi..phi.3 STAA FOX+1.phi.248 96 36Z LDAA DISDIG+2.phi.24A 8A .phi.F ORAA #$.phi.F ;PUT IN `F` TIME ZONE.phi.24C B7 .phi..phi..phi.4 STAA FOX+2.phi.24F 39 RTS ; ; ; CHKFOX ; ; CHKFOX CHECKS FOR THE MASTER CARD TO ALLOW ; EDITING OF THE TABLE OF IDS. RETURNS THE ; ZERO FLAG TRUE IF THE ID IN DIGTAB IS THE MASTER ; CARD, OTHERWIZE ZERO IS SET TO FALSE. ;.phi.25.phi. BD .phi.2B5 CHKFOX: JSR PAKARD ;PACK DIGITS INTO DISDIG.phi.253 CE .phi..phi..phi.2 LDX #FOX.phi.256 BD .phi.225 JSR COMDIG ;CHECK IF DIGITS ARE THE SAME.phi.259 26 .phi.7 = BNE CHFRET ;IF NOT RETURN.phi.25B B6 .phi..phi..phi.4 LDAA FOX+2 ;GET THIRD DIGIT OF MASTER.phi.25E 84 .phi.F ANDA #$.phi.F ;LEAVE ONLY TIME ZONE.phi.26.phi. 81 .phi.F CMPA #$.phi.F ;IS TIME ZONE `F`.phi.262 39 CHFRET: RTS ; ; SEARCH ; ; SEARCH SEARCHES FOR THE ID IN ; KEYTAB. IF THE ENTRY EXISTS THEN THE TIME ZONE ; IS PUT IN THE DISPLAY, OTHERWISE ZERO IS PUT IN THE ; TIME ZONE DISPLAY. EDTPTR POINTS TO THE ENTRY IF IT ; IS FOUND OTHERWISE IT POINTS TO THE FIRST LARGER ENTRY ; OR ENDPTR IF THERE IS NO LARGER ENTRY. ;.phi.263 7F .phi..phi.19 SEARCH: CLR KEYZON ;PREPARE FOR PACKING.phi.266 BD .phi.271 JSR PKDIG ;PACK KEYTAB INTO DISDIG.phi.269 BD .phi.2.phi.7 JSR FIND ;FIND THE ENTRY.phi.26C 96 39Z LDAA EDTZON ;GET THE TIME ZONE(ZERO IF INVALID).phi.26E 97 19Z STAA KEYZON ;DISPLAY TIME ZONE.phi.27.phi. 39 RTS ; ; PKDIG ; ; PKDIG PACKS THE DIGITS IN ; KEYTAB INTO DISDIG TWO DIGITS TO A BYTE. ;.phi.271 96 14Z PKDIG: LDAA KEYTAB ;GET FIRST BYTE OF KEYTAB.phi.273 BD .phi.3E6 JSR ASLA4 ;SHIFT DIGIT INTO LEFT HALF OF BYTE.phi.276 9A 15Z ORAA KEYTAB+1 ;OR SECOND DIGIT INTO RIGHT HALF.phi.278 97 34Z STAA DISDIG ;STORE IT AS FIRST BYTE OF DISDIG.phi.27A 96 16Z LDAA KEYTAB+2 ;THIRD DIGIT.phi.27C BD .phi.3E6 JSR ASLA4.phi.27F 9A 17Z ORAA KEYTAB+3 ;FOURTH DIGIT.phi.281 97 35Z STAA DISDIG+1 ;SECOND BYTE OF DISDIG.phi.283 96 18Z LDAA KEYTAB+4 ;FIFTH DIGIT.phi.285 BD .phi.3E6 JSR ASLA4.phi.288 9A 19Z ORAA KEYZON ;TIME ZONE.phi.28A 97 36Z STAA DISDIG+2.phi.28C 39 RTS ; ; UPKDIG ; ; UPKDIG UNPACKS THE DIGITS IN DISDIG INTO KEYTAB ; FOR DISPLAY. ;.phi.28D 96 34Z UPKDIG:DAA DISDIG ;GET BYTE ONE OF DISDIG.phi.28F BD .phi.3EB JSR LSRA4 ;GET LEFT DIGIT INTO RIGHT HALF.phi.292 97 14Z STAA KEYTAB ;FIRST BYTE OF KEYTAB.phi.294 96 34Z LDAA DISDIG ;GET BYTE ONE AGAIN.phi.296 84 .phi.F ANDA #$.phi.F ;MASK LEFT DIGIT.phi.298 97 15Z STAA KEYTAB+1 ;SECOND BYTE OF KEYTAB.phi.29A 96 35Z LDAA DISDG+1 ;BYTE TWO OF DISDIG.phi.29C BD .phi.3FB JSR LSRA4.phi.29F 97 16Z STAA KEYTAB+2.phi.2A1 96 35Z LDAA DISDIG+1.phi.2A3 84 .phi.F ANDA #$.phi.F.phi.2A5 97 17Z STAA KEYTAB+3.phi.2A7 96 36Z LDAA DISDIG+2.phi.2A9 BD .phi.3EB JSR LSRA4.phi.2AC 97 18Z STAA KEYTAB+4.phi.2AE 96 36Z LDAA DISDIG+2.phi.2B.phi. 84 .phi.F ANDA #$.phi.F.phi.2B2 97 19Z STAA KEYZON ;TIME ZONE.phi.2B4 39 RTS ; ; PAKARD ; ; PAKARD PACKS THE DIGITS IN DIGTAB INTO DISDIG ;.phi.2B5 96 2AZ PAKARD: LDAA DIGTAB.phi.2B7 BD .phi.3E6 JSR ASLA4.phi.2BA 9A 2BZ ORAA DIGTAB+1.phi.2BC 97 34Z STAA DISDIG.phi.2BE 96 2CZ LDAA DIGTAB+2.phi.2C.phi. BD .phi.3E6 JSR ASLA4.phi.2C3 9A 2DZ ORAA DIGTAB+3.phi.2C5 97 35Z STAA DISDIG+1.phi.2C7 96 2EZ LDAA DIGTAB+4.phi.2C9 BD .phi.3E6 JSR ASLA4.phi.2CC 97 36Z STAA DISDIG+2.phi.2CE 39 RTS ; ; DELETE ; ; DELETE REMOVES THE ENTRY POINTED TO BY EDTPTR FROM THE ; TABLE OF VALID IDS. ZAP TIME ZONE IN DISPLAY ; ASSUME: #CMOS <= EDTPTR < ENDPTR ;.phi.2CF 7D .phi..phi.39 DELETE: TST EDTZON ;IS THIS ENTRY VALID.phi.2D2 27 24 = BEQ NOENT.phi.2D4 DE 37Z LDX EDTPTR ;GET `THIS` ENTRY ;.phi.2D6 BC .phi..phi..phi.5 DELTOP: CPX ENDPTR ;ARE WE PAST LAST ENTRY.phi.2D9 27 11 = BEQ OUT ;DONE.phi.2DB A6 .phi.3 LDAA 3,X ;MOVE NEXT ENTRY ONTO THIS ENTRY.phi.2DD A7 .phi..phi. STAA .phi.,X.phi.2DF A6 .phi.4 LDAA 4,X.phi.2E1 A7 .phi.1 STAA 1,X.phi.2E3 A6 .phi.5 LDAA 5,X.phi.2E5 A7 .phi.2 STAA 2,X.phi.2E7 BD .phi.3DE JSR INX3 ;ADD 3 TO X.phi.2EA 2.phi. EA = BRA DELTOP ;MOVE NEXT ENTRY ;.phi.2EC BD .phi.3E2 OUT: JSR DEX3 ;DECREMENT X BY 3.phi.2EF FF .phi..phi..phi.5 STX ENDPTR ;ENDPTR = ENDPTR - 3.phi.2F2 7F .phi..phi.39 CLR EDTZON ;CURRENT ENTRY IS NOT VALID.phi.2F5 7F .phi..phi.19 CLR KEYZON ;ZAP TIME ZONE IN DISPLAY.phi.2F8 39 NOENT: RTS ; ; INSERT ; ; INSERT INSERTS THE ID AND TIME ZONE IN KEYTAB ; INTO THE TABLE. ; INSERT.:.phi.2F9 CE .phi..phi..phi.5 LDX #5 ;5 ITERATIONS ;.phi.2FC A6 13Z INSNXT: LDAA KEYTAB-1,X ;GET DIGIT OF KEYTAB.phi.2FE 81 .phi.9 CMPA #$.phi.9 ;CHK FOR GREATER THAN 9.phi.3.phi..phi. 22 62 = BHI INSFAI ;ILLEGAL DIGIT GO AWAY.phi.3.phi.2 .phi.9 DEX.phi.3.phi.3 26 F7 = BNE INSNXT ;.phi.3.phi.5 96 19Z LDAA KEYZON ;GET TIME ZONE.phi.3.phi.7 81 .phi.8 CMPA #$.phi.8 ;ILLEGAL?.phi.3.phi.9 22 59 = BHI INSFAI ;GO AWAY.phi.3.phi.B 7D .phi..phi.19 TST KEYZON ;ILLEGAL TIME ZONE.phi.3.phi.E 27 54 = BEQ INSFAI ;IF SO GO AWAY ;.phi.31.phi. BD .phi.271 JSR PKDIG ;PACK KEYTAB INTO DISDIG.phi.313 BD .phi.2.phi.7 JSR FIND ;SEE IF ENTRY IN TABLE.phi.316 7D .phi..phi.39 TST EDTZON ;CHECK ZONE.phi.319 26 25 = BNE HAVSPA ;ITS ALREADY THERE.phi.31B FE .phi..phi..phi.5 LDX ENDPTR ;GET POINTER TO PAST LAST ENTRY.phi.31E 9C 32Z CPX ENDMEM ;ARE WE PAST END OF MEMORY.phi.32.phi. 27 38 = BEQ OVERFL ;.phi.322 9C 37Z INSTOP: CPX EDTPTR ;ARE WE UP TO CURRENT ENTRY.phi.324 27 11 = BEQ OUT1.phi.326 BD .phi.3E2 JSR DEX3 ;DECREMENT X BY 3.phi.329 A6 .phi..phi. LDAA .phi.,X ;MOVE THIS ENTRY DOWN BY ONE.phi.32B A7 .phi.3 STAA 3,X.phi.32D A6 .phi.1 LDAA 1,X.phi.32F A7 .phi.4 STAA 4,X.phi.331 A6 .phi.2 LDAA 2,X.phi.333 A7 .phi.5 STAA 5,X.phi.335 2.phi. EB = BRA INSTOP ;MOVE NEXT ENTRY ;.phi.337 FE .phi..phi..phi.5 OUT1: LDX ENDPTR ;INCREMENT ENDPTR BY 3.phi.33A BD .phi.3DE JSR INX3.phi.33D FF .phi..phi..phi.5 STX ENDPTR.phi.34.phi. BD .phi.3BA HAVSPA: JSR EDTIN ;READ KEYTAB INTO TABLE.phi.343 96 19Z LDAA KEYZON ;GET TIME ZONE FROM DISPLAY.phi.345 97 39Z STAA EDTZON ;PUT IT IN EDTZON ; HERE TO FLASH THE DISPLAY OFF.phi.351 .phi.9 DEX.phi.352 26 F9 = BNE FLASH.phi.354 7C .phi..phi.1E INC POISON.phi.357 7E .phi.3CC JMP EDTOUT ;RESTORE DISPLAY AND RETURN ;.phi.35A BD .phi..phi..phi.6 OVERFL: JSR BLANK ;BLANK DISPLAY.phi.35D 7F .phi..phi.19 CLR KEYZON ;ZERO THE DISPLAY TIME ZONE.phi.36.phi. 7C .phi..phi.1E INC POISON.phi.363 39 RTS ;.phi.364 7F .phi..phi.39 INSFAI: CLR EDTZON ;ILLEGAL ENTRY.phi.367 7F .phi..phi.19 CLR KEYZON ;ZAP TIME ZONE IN DISPLAY.phi.36A 39 RTS ; ; UP ; ; UP MOVES EDTPTR UP TO THE PREVIOUS ENTRY. ; IF THE POINTER IS ALREADY AT THE FIRST ENTRY ; OF THE TABLE IT IS NOT MOVED. ;.phi.36B DE 37Z UP: LDX EDTPTR ;GET CURRENT ENTRY.phi.36D 8C .phi..phi..phi.7 CPX #CMOS ;ARE WE AT THE FIRST ENTRY.phi.37.phi. 27 .phi.C = BEQ RETUP ;IF SO THE RETURN.phi.372 BD .phi.3E2 JSR DEX3 ;ELSE DECREMENT X BY 3.phi.375 DF 37Z STX EDTPTR ;EDTPTR = EDTPTR - 6.phi.377 BD .phi.3CC JSR EDTOUT ;PUT ENTRY INTO DISPLAY.phi.37A 96 19Z LDAA KEYZON ;GET TIME ZONE.phi.37C 97 39Z STAA EDTZON ;LEAVE IN EDTZON.phi.37E 39 RETUP: RTS ; ; ; DOWN ; ; DOWN MOVES EDTPTR DOWN BY ONE ENTRY. IF EDTPTR IS ; ALREADY THE LAST ELEMENT OF THE TABLE DO NOTHING. ;.phi.37F DE 37Z DOWN: LDX EDTPTR ;GET EDIT POINTER.phi.381 BC .phi..phi..phi.5 CPX ENDPTR ;PAST LAST ENTRY?.phi.384 27 16 = BEQ RETDWN ;GO AWAY.phi.386 7D .phi..phi.39 TST EDTZON ;IS CURRENT ENTRY LEGAL.phi.389 27 .phi.3 = BEQ ZERZON ;USE THIS ENTRY.phi.38B BD .phi.3DE JSR INX3 ;GO TO NEXT ENTRY.phi.38E BC .phi..phi..phi.5 ZERZON: CPX ENDPTR ;PAST LAST ENTRY NOW?.phi.391 27 .phi.9 = BEQ RETDWN ;GO AWAY.phi.393 DF 37Z STX EDTPTR ;SAVE AS EDTPTR.phi.395 BD .phi.3CC JSR EDTOUT ;PUT OUT ENTRY ON DISPLAY.phi.398 96 19Z LDAA KEYZON ;GET TIME ZONE OF DISPLAY.phi.39A 97 39Z STAA EDTZON ;PUT IT IN EDIT ZONE.phi.39C 39 RETDWN: RTS ; ; CLRALL ; ; CLRALL CLEARS THE ENTIRE TABLE OF VALID IDS ;.phi.39D 96 14Z CLRALL: LDAA KEYTAB ;GET FIRST BYTE OF DISPLAY.phi.39F 9A 15Z ORAA KEYTAB+1 ;OR IN SECOND BYTE.phi.3A1 9A 16Z ORAA KEYTAB+2.phi.3A3 9A 17Z ORAA KEYTAB+3.phi.3A5 9A 18Z ORAA KEYTAB+4.phi.3A7 9A 19Z ORAA KEYZON.phi.3A9 26 .phi.E = BNE CLRRET ;IF DISPLAY NOT ALL ZERO GO AWAY.phi.3AB BD .phi..phi..phi.6 JSR BLANK ;BLANK DISPLAY ;.phi.3AE CE .phi..phi..phi.7 DOCLR: LDX #CMOS ;GET START OF TABLE.phi.3B1 FF .phi..phi..phi.5 STX ENDPTR ;MAKE IT END OF TABLE.phi.3B4 DF 37Z STX EDTPTR ;ALSO CURRENT ENTRY.phi.3B6 7F .phi..phi.39 CLR EDTZON ;THIS ENTRY ILLEGAL.phi.3B9 39 CLRRET: RTS ; ; EDTIN ; ; EDTIN READS THE DISPLAY IN KEYTAB INTO THE ENTRY ; POINTED TO BY EDTPTR. ;.phi.3BA BD .phi.271 EDTIN: JSR PKDIG ;PACK THE DIGITS INTO DISDIG.phi.3BD DE 37Z LDX EDTPTR ;GET POINTER TO ENTRY.phi.3BF 96 34Z LDAA DISDIG ;GRAB FIRST BYTE OF DISDIG.phi.3C1 A7 .phi..phi. STAA .phi.,X ;PUT IT INTO TABLE.phi.3C3 96 35Z LDAA DISDIG+1.phi.3C5 A7 .phi.1 STAA 1,X.phi.3C7 96 36Z LDAA DISDIG+2.phi.3C9 A7 .phi.2 STAA 2,X.phi.3CB 39 RTS ; ; ; EDTOUT ; -; EDTOUT PUTS THE ENTRY POINTED TO BY EDTPTR ; OUT ONTO THE DISPLAY. ;.phi.3CC DE 37Z EDTOUT: LDX EDTPTR ;GET POINTER TO ENTRY.phi.3CE A6 .phi..phi. LDAA .phi.,X ;GET FIRST BYTE OF ENTRY.phi.3D.phi. 97 34Z STAA DISDIG ;PUT IT INTO FIRST BYTE OF DISDIG.phi.3D2 A6 .phi.1 LDAA 1,X.phi.3D4 97 35Z STAA DISDIG+1.phi.3D6 A6 .phi.2 LDAA 2,X.phi.3D8 97 36Z STAA DISDIG+2.phi.3DA BD .phi.28D JSR UPKDIG ;UNPACK DISDIG INTO THE DISPLAY.phi.3DD 39 RTS ; ; USEFUL ROUTINES ;.phi.3DE .phi.8 INX3: INX.phi.3DF .phi.8 INX2: INX.phi.3E.phi. .phi.3 INX.phi.3E1 39 RTS ;.phi.3E2 .phi.9 DEX3: DEX.phi.3E3 .phi.9 DEX2: DEX.phi.3E4 .phi.9 DEX.phi.3E5 39 RTS ;.phi.3F6 48 ASLA4: ASLA.phi.3E7 48 ASLA3: ASLA.phi.3E8 48 ASLA2: ASLA.phi.3E9 48 ASLA.phi.3EA 39 RTS ;.phi.3EB 44 LSRA4: LSRA.phi.3EC 44 LSRA3: LSRA.phi.3ED 44 LSRA2: LSRA.phi.3EE 44 LSRA.phi.3EF 39 RTS ; ; DOSUM ; ; DOSUM RETURNS THE CHECK SUM OF CMOS MEMORY FROM ; LOCATION #SUM+2 TO LOCATION ENDMEM IN ACCS A AND B ;* * * * * * * * * * * * * * *.phi.3F.phi. CE .phi..phi..phi.2 DOSUM: LDX #SUM+2 ;FIRST ADDRESS FOR CHECK SUM.phi.3F3 4F CLRA.phi.3F4 5F CLRB.phi.3F5 EB .phi..phi. LOOP1: ADDB .phi.,X ;ADD BYTE TO B.phi.3F7 99 .phi..phi. ADCA .phi. ;ADD CARRY OUT TO A.phi.3F9 .phi.8 INX ;GO TO NEXT BYTE.phi.3FA 9C 32Z CPX ENDMEM ;PAST END OF MEMORY?.phi.3FC 26 F7 = BNE LOOP1 ;.phi.3FE 43 COMA ;COMPLEMENT RESULT.phi.3FF 53 COMB.phi.4.phi..phi. 39 RTS ; ; CHKSUM ; ; CHKSUM COMPARES THE CHECK SUM OF MEMORY TO THE ; VALUES STORED IN LOCATIONS SUM AND SUM + 1. IF ; THE SUM IS DIFFERENT CARRY IS SET TO 1 ELSE ; CARRY IS ZERO. ;.phi.4.phi.1 BD .phi.3F.phi. CHKSUM: JSR DOSUM ;GET CHKSUM OF CMOS MEMORY.phi.4.phi.4 B1 .phi..phi..phi..phi. CMPA SUM ;CHECK FIRST BYTE.phi.4.phi.7 26 .phi.7 = BNE CHKERR ;TOO BAD.phi.4.phi.9 F1 .phi..phi..phi.1 CMPB SUM+1 ;SECOND BYTE.phi.4.phi.C 26 .phi.2 = BNE CHKERR.phi.4.phi.E .phi.C CLC ;CARRY = .phi. MEANS OK.phi.4.phi.F 39 RTS ;.phi.41.phi. .phi.D CHKERR: SEC ;CARRY = 1 MEANS FAIL.phi.411 39 RTS ; ; SETSUM ; ; SETSUM PUTS THE CHECK SUM OF MEMORY INTO ; LOCATIONS SUM AND SUM + 1 ;.phi.412 BD .phi.3F.phi. SETSUM: JSR DOSUM ;GET CHECK SUM OF MEMORY.phi.415 B7 .phi..phi..phi..phi. STAA SUM ;STORE FIRST BYTE.phi.418 F7 .phi..phi..phi.1 STAB SUM+1 ;SECOND TOO.phi.41B 39 RTS ; ; ; ROUTINE TO SEE IF SYS CODE IN DIGTAB IS OK ; RETURNS Z= 1 IF OK.phi.41CP CHKSYS = *.phi.41C 96 C5 LDAA S.SYS.phi.41E 84 .phi.F ANDA #$.phi.F.phi.42.phi. 91 3.phi.Z CMPA DIGTAB+6.phi.422 26 .phi.8 = BNE SYSRET ;BAD NEWS ; NOW FOR HIGHER DIGIT.phi.424 96 C5 LDAA S.SYS.phi.426 44 LSRA.phi.427 44 LSRA.phi.428 44 LSRA.phi.429 44 LSRA.phi.42A 91 2FZ CMPA DIGTAB+5.phi.42C 39 SYSRET: RTS ; FRTL CHECKS TO SEE IF THIS CARD IS THE SAME ; AS THE LAST ONE. IF IT IS NOT (AND IT HAS A VALID ; SYSTEM CODE) THEN WE STORE THIS AS THE NEW ; COMPARAND AND CLEAR THE COUNT OF ERROR TRIES ;*.phi.42DP FRTL = *.phi.42D BD .phi.41C JSR CHKSYS.phi.43.phi. 26 .phi.C = BNE FRTS ;BAD SYS CODE ;.phi.432 CE .phi..phi..phi.5 LDX #$.phi..phi..phi.5 ;FIVE DIGS IN RTLBUF.phi.435 A6 29Z FRTLL: LDAA DIGTAB-1,X.phi.437 A1 39Z CMPA RTLBUF-1,X.phi.439 26 .phi.4 = BNE NEWFRT.phi.43P .phi.9 DEX.phi.43C 26 F7 = BNE FRTLL ; IT WAS THE SAME.phi.43E 39 FRTS: RTS ;.phi.43F A6 29Z NEWFRT: LDAA DIGTAB-1,X.phi.441 A7 39Z STAA RTLBUF-1,X.phi.443 .phi.9 DEX.phi.444 26 F9 = BNE NEWFRT ;.phi.446 7F .phi..phi.3F CLR NTRIES.phi.449 39 RTS ; ; ROUTINE TO CHECK DURESS FLAG ; TRIGGERS RELAY IF SET.phi.44AP DURESS = *.phi.44A 96 81 LDAA FPROM+1.phi.440 84 2.phi. ANDA #O.DUR.phi. 44E 27 .phi.E = BEQ NODUR ;HE DIDN'T BUY THE DURESS OPTION ;.phi.45.phi. 96 1CZ LDAA DURESF.phi.452 27 .phi.A = BEQ NODUR ;HE DIDN'T COMPLAIN ;.phi.454 86 4.phi. LDAA #R.DUR.phi.459 CE FC7C LDX #T..phi.3S.phi.45C DF .phi.CZ STX DUCNTR.phi.45E 39 NODUR: RTS ; ; ; ; ROUTINE TO CHECK IDEK PASSWORD ; RETURNS WITH CARRY = 1 IF OK ; CARRY = .phi. IF BAD ; ; CALLS MIX TO RECALCULATE COMBINATION FUNCTION ; ASSUMES CARD IMAGE IN DIGTAB ; AND PASSWORD IN KEYTAB ; ; MIXPTR IS A CALCULATED INDEX INTO DIGTAB ; COMBX IS AN INDEX INTO MASTER ; WE PROCESS THE DIGITS OF THE PASSWORD IN ORDER ;.phi.45FP COMBIN = *.phi.45F BD .phi.482 JSR MIX ;TABLE OF DIGIT INDICES IN `MASTER`.phi.462 7F .phi..phi.4A CLR MIXPTR ;MSB OF XREG.phi.465 CE .phi..phi..phi..phi. LDX #.phi. ;FIRST DIGIT OF PASSWORD.phi.468 A6 21Z COMBL: LDAA MASTER,X.phi.46A DF 48Z STX COMBX.phi.46C 97 4BZ STAA MIXPTR+1.phi.46E DF 4AZ LDX MIXPTR ; NOW X INDICATES WHICH DIGIT OF HIS ; CARD FORMS THIS DIGIT OF THE PASSWORD.phi.47.phi. A6 2AZ LDAA DIGTAB,X.phi.472 DE 48Z LDX COMBX.phi.474 A1 14Z CMPA KEYTAB,X.phi.476 26 .phi.8 = BNE COMBAD.phi.478 .phi.8 INX.phi.479 8C .phi..phi..phi.3 CPX #3.phi.47C 26 EA = BNE COMBL.phi.47E .phi.D SEC.phi.47F 39 RTS ;.phi.48.phi. .phi.C COMBAD: CLC.phi.481 39 RTS ; ; ; SUBROUTINE TO PREPARE COMPARAND ; TABLE FOR IDEK PERSONAL CODE ; ; THE IDEK CODE IS 4 DIGITS TAKEN FROM THE CARDHOLDER'S ; 5 DIGIT CODE IN AN ARBITRARY ORDER ; ; SO WE HAVE ALL COMBINATIONS OF FIVE THINGS ; TAKEN FOUR AT A TIME ; >>>12.phi.<<< ; SPECIFY WHICH OF THE FIVE IS MISSING (3 BITS) ; >>>24<<< ; SPECIFY WHICH OF THE FOUR APPEARS FIRST (2 BITS) ; >>>6<<< ; SPECIFY WHICH COMES NEXT (2 BITS) ; >>>2<<< ; TAKE THE REMAINING TWO IN ORDER, OR REVERSED (1 BIT) ; ; BIT MEANINGS: ; TTHE PERM/COMB SWITCH HAS FOUR FIELDS, ; IN THIS FORM: (MMMFFSSX) ; WHERE MMM INDICATES WHICH IS MISSING ; FF. . .WHICH COMES FIRST ; SS. . .WHICH COMES SECOND ; X . . .=1 IF LAST SHOULD BE FLIPPED ; ;* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * ; ; RTC ; ;* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * ; ; ALL TASKS WHICH REQUIRE TIME DELAYS AND ALL ; PARAMETERS REQUIRING CONTINUOUS MONITORING ; ARE HANDLED BY THIS SET OF ROUTINES. ; SPECIFICALLY, THIS MODULE HANDLES THE ; FOLLOWING TASKS: ; ; DOOR OPEN PUSHBUTTON MONITORING ; RELAY ACTIVATION SEQUENCES ; RELAY CLOSURES AFTER TIME DELAY ; DEAD MAN SET ; CARD EDGE DETECT ; TITLE "RTC" ; ; DEFINE MODULE STARTING ADDRESS ;.phi..phi..phi..phi. PSECT ;.phi..phi..phi..phi. 7E .phi..phi..phi.C JMP RTC.phi..phi..phi.3 7E .phi..phi.F4 JMP OPEN.phi..phi..phi.6 7E .phi.1B5 JMP BLANK.phi..phi..phi.9 7E .phi.15B JMP RLYON ; ; ; ; RTC ; ; ; THIS IS THE MAIN SERVICE ROUTINE FOR THE REAL ; TIME CLOCK INTERRUPTS. A RISING EDGE OF THE CLOCK ; FORCES AN IRQ INTERRUPT WHICH VECTORS TO RTC. ; RTC IN TURN CALLS SUBROUTINES TO EXECUTE THE ; VARIOUS TASKS THAT NEED SERVICING ONE AT A TIME. ; ;.phi..phi..phi.CP RTC = *.phi..phi..phi.C 96 4FZ LDAA VAREND.phi..phi..phi.E 26 FE = BNE * ;STACK OVERFLOW???? ;.phi..phi.1.phi. 96 A6 LDAA BUFB ;CLR INTERRUPT AT PIA.phi..phi.12 86 38 LDAA #$38 ;RESET PIA DDR'S.phi..phi.14 97 A5 STAA CSRA.phi..phi.16 86 .phi.A LDAA #$.phi.A.phi..phi.18 97 A7 STAA CSRB.phi..phi.1A 86 FF LDAA #$FF.phi..phi.1C 97 A4 STAA BUFA.phi..phi.1E 86 FE LDAA #$FE.phi..phi.2.phi. 97 A6 STAA BUFB.phi..phi.22 86 3C LDAA #$3C ;SET DEAD MAN HIGH.phi..phi.24 97 A5 STAA CSRA.phi..phi.26 86 .phi.E LDAA #$.phi.E.phi..phi.28 97 A7 STAA CSRB ;.phi..phi.2A BD .phi.174 JSR KEYSER ;SCAN KEYBD.phi..phi.2D BD .phi..phi.3A JSR CRDEDG ;CHK FOR CRD IN.phi..phi.3.phi. BD .phi..phi.69 JSR MUX ;TEND THE DISPLAY IF NEEDED.phi..phi.33 BD .phi..phi.9.phi. JSR APR ;CHK DOOR OPEN PUSHBUTTON.phi..phi.36 BD .phi..phi.B1 JSR CNTDN ;COUNT DOWN SERVICE TIMERS ;.phi..phi.39 3B RTI ;RETURN TO BACKGROUND TASK ; ; ; ; CRDEDG ; ; ; CHECKS FOR CARD, SETS CRDFLG ACCORDINGLY ; ; .phi..phi. NO CARD ; NN (1<NN<=2.phi.) CARD IN, BUT BOUNCING ; .phi.1 CARD IN, NOT YET PROCESSED ; FE CARD IN, ALREADY PROCESSED ;.phi..phi.3AP CRDEDG = *.phi..phi.3A 96 12Z LDAA EDMODE ;ARE WE EDITING?.phi..phi.3C 26 2A = BNE CRDDN ;YES; IGNORE CARDS.phi..phi.3E 96 11Z LDAA CRDFLG.phi..phi.4.phi. 26 11 = BNE WASIN ; HERE IF THE CARD WAS NOT IN LAST TIME.phi..phi.42 96 A6 LDAA BUFB.phi..phi.44 84 .phi.1 ANDA #$.phi.1.phi..phi.46 27 2.phi.= BEQ CRDDN.phi..phi.48 86 2.phi. LDAA #$2.phi..phi..phi.4A 97 11Z STAA CRDFLG ;PUT DEBOUNCE CNT INTO CRDFLG ;.phi..phi.4C 7F .phi..phi.1B CLR KEYCNT ;IDEK ENTRY START OVER.phi..phi.4F 7F .phi..phi.1C CLR DURESF ;DURESS MUST BE AFTER CARD IN.phi..phi.52 39 RTS ; ;.phi..phi.53 96 A6 WASIN: LDAA BUFB ;FLAG CARD REMOVAL.phi..phi.55 84 .phi.1 ANDA #$.phi.1.phi..phi.57 27 .phi.C = BEQ CRDCLR ;CARD REMOVED ; HERE IF CARD STILL IN.phi..phi.59 96 11Z LDAA CRDFLG.phi..phi.5B 81 FE CMPA #$FE ;CARD PROCESSED?.phi..phi.5D 27 .phi.9 = BEQ CRDDN ;YES; DO NOT DEBOUNCE.phi..phi.5F 4A DECA ;CHECK DEBOUNCE COUNT.phi..phi.6.phi. 27 .phi.6 = BEQ CRDDN ;COUNT WAS 1, I.E. STOPPED.phi..phi.62 97 11Z STAA CRDFLG.phi..phi.64 39 RTS ;.phi..phi.65P CRDCLR = *.phi..phi.65 7F .phi..phi.11 CLR CRDFLG ;.phi..phi.68 39 CRDDN: RTS ; ; ; EDITOR DISPLAY MULTIPLEXER ; CALL HERE ONCE A TICK TO CHANGE THE DISPLAY ; THIS ROUTINE IS HIGHLY NON-REENTRANT ; INDEED, IT OUTPUTS A DIFFERENT DIGIT EACH ; TIME IT IS CALLED. ;.phi..phi.69P MUX = *.phi..phi.69 96 12Z LDAA EDMODE ;SHOULD THE DISPLAY BE LIT?.phi..phi.6B 27 FB = BEQ CRDDN ;;NO.phi..phi.6D 96 4DZ LDAA MUXPTR+1.phi..phi.6F 48 ASLA.phi..phi.7.phi. 97 4EZ STAA MUXTMP.phi..phi.72 D6 A6 LDAB BUFB.phi..phi.74 C4 F1 ANDB #$F1.phi..phi.76 DA 4EZ ORAB MUXTMP ; B CONTAINS DIGIT# ; NOW GET DATA FOR THIS DIGIT.phi..phi.78 96 A4 LDAA BUFA.phi..phi.7A 84 F.phi. ANDA #$F.phi..phi..phi.7C DE 4CZ LDX MUXPTR.phi..phi.7E AA 14Z ORAA KEYTAB,X.phi..phi.8.phi. 97 A4 STAA BUFA.phi..phi.82 D7 A6 STAB BUFB ;.phi..phi.84 .phi.9 DEX.phi..phi.85 8C .phi..phi..phi..phi. CPX #.phi. ;DEX DOESN'T SET FLAGS NICELY!.phi..phi.88 2A .phi.3 = BPL *+5.phi..phi.8A CE .phi..phi..phi.5 LDX #$.phi..phi..phi.5.phi..phi.8D DF 4CZ STX MUXPTR.phi..phi.8F 39 RTS ; ; ; ; APB ; ; ; CHECKS DOOR OPEN PUSHBUTTON. CAUSES DOOR OPEN ; SEQUENCE WHEN CLOSURE IS DETECTED IF PUSHER'S ; FINGER HAS RIGHT SYSTEM CODE ;.phi..phi.9.phi. 96 8.phi. APB: LDAA FPROM ;CHK FOR AS OPTION.phi..phi.92 84 2.phi. ANDA #O.AS.phi..phi.94 27 1A = BEQ APBD ;.phi..phi.96 96 1.phi.Z LDAA APBFLG ;IGNORE SWITCH IF.phi..phi.98 26 .phi.D = BNE APX ;ALREADY SERVICED ;.phi..phi.9A 96 C3 LDAA S.XXX ;OPEN DOOR IF SWITCH.phi..phi.9C 84 8.phi. ANDA #X.AS ;IS PUSHED.phi..phi.9E 26 1.phi. = BNE APBD.phi..phi.A.phi. BD .phi..phi.F4 JSR OPEN.phi..phi. A3 7C .phi..phi.1.phi. INC APBFLG ;FLAG AS SERVICED.phi..phi.A6 39 RTS ;.phi..phi.A7 96 C3 APX: LDAA S.XXX ;CLR FLAG WHEN SWITCH.phi..phi.A9 84 8.phi. ANDA #X.AS ;IS RELEASED.phi..phi.AB 27 .phi.3 = BEQ APBD.phi..phi.AD 7F .phi..phi.1.phi. CLR APBFLG ;.phi..phi.B.phi. 39 APBD: RTS ; ; ; ; CNTDN ; ; EVERY TASK INVOLVING A TIME DELAY HAS A ; COUNTER ASSOCIATED WITH IT. THESE TWO BYTE ; COUNTERS ARE LOADED WITH A NUMBER TO ACTIVATE ; THEM. EACH COUNTER THEN INCREMENTS ON EACH ; CLOCK TICK UNTIL IT OVERFLOWS, AT WHICH TIME ; A COMPLETION ROUTINE IS CALLED TO TAKE THE ; APPROPRIATE ACTION. ; ; YOU SHOULD ALSO BE AWARE THAT EACH ; COMPLETION ROUTINE IS CALLED WITH A VALUE IN AC A ; EQUAL TO 2 N WHERE N IS THE VECTOR SLOT NUMBER ; OF THAT ROUTINE. ; THIS MAKES FOR SIMPLIFIED RLYOFF CALLS ;.phi..phi.B1 CE .phi. .phi..phi..phi. CNTDN: LDX #$.phi..phi..phi..phi. ;SET LOOP INDICES.phi..phi.B4 86 .phi.1 LDAA #$.phi.1 ;.phi..phi.B6 6D .phi..phi.Z CNTDNL: TST CNTRS,X ;CLOCK EACH COUNTER.phi..phi.B8 27 1D = BEQ CNTDNS ;UNLESS ITS ALREADY.phi..phi.BA 6C .phi.1Z INC CNTRS+1,X ;ZERO.phi..phi.BC 26 19 = BNE CNTDNS.phi..phi.BE 6C .phi..phi.Z INC CNTRS,X.phi..phi.C.phi. 26 15 = BNE CNTDNS ;.phi..phi.C2 36 PSHA.phi..phi.C3 DF 4.phi.Z STX XREG.phi. ;IF COUNTER OVERFLOWS.phi..phi.C5 86 ?? LDAA #MSB SERV ;TO ZERO, CALL ASSOCIATED.phi..phi.C7 97 4.phi.Z STAA XREG.phi. ;SERVICE ROUTINE.phi..phi.C9 DE 4.phi.Z LDX XREG.phi..phi..phi.CB EE ?? LDX LSB SERV,X.phi..phi.CD 32 PULA.phi..phi.CE 36 PSHA.phi..phi.CF AD .phi..phi. JSR .phi.,X.phi..phi.D1 4F CLRA.phi..phi.D2 97 4.phi.Z STAA XREG.phi..phi..phi.D4 DE 4.phi.Z LDX XREG.phi..phi..phi.D6 32 PULA ;.phi..phi.D7 .phi.8 CNTDNS: INX ;INCREMENT LOOP INDICE.phi..phi.D8 .phi.8 INX ;LOOP UNTIL ALL CNTRS SERVICED.phi..phi.D9 48 ASLA ;SHIFT BIT TO NEXT PLACE.phi..phi.DA 8C .phi..phi.1.phi. CPX #NCNTRS.phi..phi.DD 26 D7 = BNE CNTDNL ; ; SERVICE TABLE ;.phi..phi.E.phi.P SERV = *.phi..phi.E.phi. WORD GOON.phi..phi.E2 WORD GOOFF.phi..phi.E4 WORD GXOFF.phi..phi.E6 WORD EDEND.phi..phi.E8 WORD RLYOFF ;EROFF.phi..phi.EA WORD RLYOFF ;ASOFF.phi..phi.EC WORD RLYOFF ;DUOFF.phi..phi.EE WORD RTS3 ;FOR PATCHING ; ; ; THIS ROUTINE IS CALLED WHEN ; THE EDITOR HAS DONE NOTHING FOR A WHOLE MINUTE ; SO WE LEAVE EDIT MODE ;.phi..phi.F.phi.P EDEND = *.phi..phi.F.phi. 7F .phi..phi.12 CLR EDMODE.phi..phi.F3 39 RTS ; ; OPEN ; ; ; STARTS DOOR OPEN SEQUENCE. ; TURNS ON ALARM SHUNT, WAKES UP GOON TO TURN ; ON GO RELAY AFTER 5.phi. MILLISECOND DELAY. ;.phi..phi.F4 96 8.phi. OPEN: LDAA FPROM ;CHECK `AS` OPTION,LEAVE.phi..phi.F6 84 2.phi. ANDA #O.AS ;RELAY OFF UNLESS IN.phi..phi.F8 27 .phi.5 = BEQ OPENS ;.phi..phi.FA 86 2.phi. LDAA #R.AS ;TURN ON `AS` RELAY.phi..phi.FC BD .phi.15B JSR RLYON ;.phi..phi.FF BD .phi.14B OPENS: JSR NOTIME ;TURN OFF CONFLICTING TIMERS.phi.1.phi.2 CE FFF.phi. LDX #T.5.phi.MS ;WAKE UP GOON IN 5.phi. MS.phi.1.phi.5 DF .phi..phi.Z STX OPCNTR ;.phi.1.phi.7 39 OPEND: RTS .phi.1.phi.7P RTS3 = OPEND ; ; ; GOON ; -; TURN ON GO RELAY ; ENABLE EITHER GOOFF OR GXOFF TO ; TURN IT OFF LATER ; ; "COME IN, TAILOR. HERE YOU MAY ROAST YOUR GOOSE." ; ;.phi.1.phi.8 86 8.phi. GOON; LDAA #R.GO ;ACTIVATE RELAY.phi.1.phi.A BD .phi.15B JSR RLYON ;.phi.1.phi.D CE .phi..phi..phi.2 LDX #GOCNTR ;SET DELAY ACORDING.phi.11.phi. 96 C6 LDAA S.VTD ;TO VTD SWITCHES IF.phi.112 84 .phi.F ANDA #$.phi.F ;VTD NOT ZERO.phi.114 27 .phi.4 = BEQ GOONX.phi.116 BD .phi.16.phi. JSR CALCT.phi.119 39 RTS ;.phi.11A 86 FF GOONX: LDAA #$FF ;WHEN VTD IS ZERO,.phi.11C 97 .phi.4Z STAA GXCNTR ;ENABLE ROUTINE TO.phi.11E 97 .phi.5Z STAA GXCNTR+1 ;CLOSE GO RELAY AS SOON ; ;AS CARD IS REMOVED.phi.12.phi. 39 GOOND: RTS ; ; ; GOOFF ; ; "I PRAY YOU, REMEMBER THE PORTER" ; ; WHEN `GO` RELAY TIMES OUT, WE MUST KEEP ; THE AS RELAY CLOSED AWHILE LONGER ; TIME SPECIFIED BY THE AS/DOD SWITCHES ;.phi.121 86 8.phi. GOOFF: LDAA #R.GO.phi.123 BD .phi.155 JSR RLYOFF ;CLOSE `GO` RELAY ;.phi.126 96 C6 LDAA S.AS ;READ AS/DOD SWITCHES.phi.128 44 LSRA.phi.129 44 LSRA.phi.12A 44 LSRA.phi.12B 44 LSRA.phi.12C 4C INCA ;AS=.phi. MEANS SHORTEST TIME.phi.12D 48 ASLA ; ; AT THIS POINT, AC CONTAINS .phi..phi..phi.XXXX.phi. ;.phi.12F CE .phi..phi..phi.A LDX #ASCNTR ;LOAD `AS` COUNTER.phi.131 BD .phi.16.phi. JSR CALCT ;ACCORDING TO SWITCHES ;.phi.134 39 RTS ; ; ; GXOFF ; ; ; CHECKS IF CARD STILL IN SLOT. ; IF NOT, DISABLES GO IMMEDIATELY ; IF SO, WAKES ITSELF UP ON NEXT CLOCK. ; ; "I'LL DEVIL PORTER IT NO LONGER" ; ;.phi.135P GXOFF = *.phi.135 96 A6 LDAA BUFB ;CHECK FOR CARD.phi.137 84 .phi.1 ANDA #.phi.1.phi.139 26 .phi.9 = BNE STILL ; KEEP IT ON IF A.S. BUTTON IS PUSHED.phi.13B 96 C3 LDAA S.XXX.phi.13D 84 8.phi. ANDA #X.AS.phi.13F 27 .phi.3 = BEQ STILL ; GO CLOSE GO AND THEN AS RELAYS.phi.141 7E .phi.121 JMP GOOFF ; HERE IF WE WANT TO STAY OPEN.phi.144 86 FF STILL: LDAA #$FF ;WAKE ME UP AT.phi.146 97 .phi.4Z STAA GXCNTR ;NEXT CLOCK TICK.phi.148 97 .phi.5Z STAA GXCNTR+1 ;.phi.14A 39 GXD: RTS ; ; ; NOTIME TURNS OFF A WHOLE SLEW OF COUNTERS ; CALL HERE WHEN YOU START A `GO SEQUENCE` ; SO THAT YOUR PREDECESSORS CANNOT INTERFERE WITH YOU ;.phi.14B CE .phi..phi..phi..phi. NOTIME: LDX #.phi..phi.14E DF .phi.AZ STX ASCNTR.phi.15.phi. DF .phi.2Z STX GOCNTR.phi.152 DF .phi..phi.Z STX OPCNTR.phi.154 39 RTS ; ; RLYOFF ; ; ; RLYOFF CLOSES THE RELAY INDICATED ; BY MASK (E.G. $8.phi.) IN AC A ; ;.phi.155P RLYOFF = *.phi.155 43 COMA.phi.156 94 A6 ANDA BUFB.phi.158 97 A6 STAA BUFB ;.phi.15A 39 RTS ; ; ; RLYON ;TURNS ON A RELAY ; ;BIT MASK E.G. $8.phi. IN AC A ;.phi.15BP RLYON = *.phi.15B 9A A6 ORAA BUFB.phi.15D 97 A6 STAA BUFB ; ; ; CALCT ; ; ; ; CALCULATE TIMER CONSTANT FROM VALUE ; IN ACCUM A. ACCUM A CONTAINS TIME IN SECONDS, ; X POINTS TO TIMER. ; ;.phi.16.phi. 6F .phi..phi. CALCT: CLR .phi.,X ;ACCUMULATE TIMER CONST..phi.162 6F .phi.1 CLR 1,X ;IN XREG2 ; ;.phi.164 E6 .phi.1 CALCTL: LDAB 1,X ;SUBTRACT ONE SECOND.phi.166 C.phi. 2C SUBB #LSB (-T..phi.1S) ;EACH TIME THRU LOOP.phi.168 E7 .phi.1 STAB 1,X.phi.16A E6 .phi..phi. LDAP .phi.,X.phi.16C C2 .phi.1 SBCB #MSB (-T..phi.1S) ;MSB.phi.16E E7 .phi..phi. STAB .phi.,X ;.phi.17.phi. 4A DECA ;GO THRU LOOP UNTIL.phi.171 26 F1 = BNE CALCTL ;ACCUM A COUNTED OUT ; ;.phi.173 39 RTS ;RETURN WITH TIMER ; ;CONST. IN X ; ; KEYSER ; ; ; MAIN KEYBOARD SERVICE ENTRY, ; CALL HERE AT RTC TO CHECK KEYBOARD ; CONTINUALLY SHOVES NEW KEYS INTO KEYTAB ; CALLS DEBOUNCE AND STASH ETC.. ; ;.phi.174P KEYSER = *.phi.174 BD .phi.17E JSR DB ;WHAT HAS BEEN PUSHED?.phi.177 4D TSTA ;FF MEANS NOTHING.phi.178 2B .phi.3 = BMI NOKEY.phi.17A BD .phi.199 JSR STASH ;PUT INTO MEMORY ;.phi.17D 39 NOKEY: RTS ; ; ; DEBOUNCE ; ; RETURNS # OF KEY IN AC A ; RETURNS FF IF NO NEW KEYS THIS TIME ; ; USES SUBR KEYSCAN ;.phi.17EP DB = *.phi.17E BD .phi.1D4 JSR KEYSCN ;GET NEW KEY IN B.phi.181 96 2.phi.Z LDAA OLDKEY.phi.183 D7 2.phi.Z STAB OLDKEY ;SAVE THIS # FOR NEXT TIME ; ;A CONTAINS ONLY COPY OF OLD ONE.phi.185 11 CBA.phi.186 27 .phi.6 = BEQ OLDIE ; HERE IF WE SEE KEY FOR FIRST TIME.phi.188 7F .phi..phi.1F CLR KEYFLG.phi.18B 86 FF LDAA #$FF ;DON'T ASSIMILATE UNTIL LATER.phi.18D 39 RTS ; HERE IF SEEN AT LEAST ONCE BEFORE.phi.18E D6 1FZ OLDIE: LDAB KEYFLG.phi.19.phi. 27 .phi.3 = BEQ GOODIE ; HERE IF SEEN MANY TIMES.phi.192 86 FF LDAA #$FF.phi.194 39 RTS ;.phi.195 7A .phi..phi.1F GOODIE: DEC KEYFLG ;NO LONGER VIRGIN.phi.198 39 RTS ;KEY # IN AC A STILL ; ; ; STASH ;PROCESS KEYBOARD CHARS ; ; IF A NUM, STORES IT INTO KEYTAB ; AND INCREMENTS KEYCNT ; IF DURESS, SETS DURESF FLAG ; ; CALLED WITH CHAR IN AC A ;.phi.199P STASH = * ; FIRST FOR THE SPECIAL CHECKS ;.phi.199 81 .phi.A CMPA #$.phi.A ;DURESS CHARACTER.phi.19B 27 2E = BEQ DURKEY.phi.19D 2A 2F = BPL CMDKEY ;1.phi. AND UP ARE CMDS ; HERE IF IT IS A PLAIN NUMBER.phi.19F 7D .phi..phi.1E TST POISON.phi.1A2 27 .phi.3 = BEQ *+5.phi.1A4 BD .phi.1B5 JSR BLANK ;FIRST CHAR AFTER CMD CLEARS DISPLAY ; SEE IF THERE IS ROOM.phi.1A7 D6 1BZ LDAB KEYCNT.phi.1A9 C1 .phi.6 CMPB #$.phi.6.phi.1AB 27 .phi.7 = BEQ RTS4 ;DISPLAY ALREADY FULL ; OK, STICK IT IN.phi.1AD 5C INCP.phi.1AE D7 1BZ STAB KEYCNT.phi.1B.phi. DE 1AZ LDX KEYPTR ;WHICH IS KEYCNT-1.phi.1B2 A7 13Z STAA KEYTAB-1,X.phi.1B4 39 RTS4: RTS ; ; HERE TO BLANK OUT THE WHOLE DISPLAY ; KRUMPS X AND B.phi.1B5P BLANK = *.phi.1B5 D6 A6 LDAB BUFB.phi.1B7 CA .phi.E ORAB #$.phi.E.phi.1B9 D7 A6 STAB BUFB ;.phi.1BB CE .phi.F.phi.F LDX #$.phi.F.phi.F.phi.1BE DF 14Z STX KEYTAB.phi.1C.phi. DF 16Z STX KEYTAB+2.phi.1C2 DF 18Z STX KEYTAB+4.phi.1C4 7F .phi..phi.1B CLR KEYCNT.phi.1C7 7F .phi..phi.1E CLR POISON.phi.1CA 39 RTS ;.phi.1CBP DURKEY = *.phi.1CB 97 1CZ STAA DURESF ;MAKE FLAG NON-ZERO.phi.1CD 39 RTS ; ; HERE WHEN WE SEE A CMD KEY.phi.1CE 97 1DZ CMDKEY: STAA CMDBYT.phi.1D.phi. 7C .phi..phi.1E INC POISON.phi.1D3 39 RTS ; ; ; KEYSCAN ; ; TELLS WHAT KEY IS DOWN ; ANSWER IS IN AC B ; .phi. THROUGH $2A DESIGNATES KEY ; $1.phi. THROUGH $1A DESIGNATES SHIFTED CONTROL KEY ; FF MEANS NO KEYS PUSHED ; .phi.1D4P KEYSCN = *.phi.1D4 5F CLRB ;START WITH KEY .phi. ; ; DETERMINE WHAT ROW THE KEY IS IN ;.phi.1D5 96 E.phi. LDAA ROW.phi..phi.1D7 43 COMA.phi.1D8 84 F.phi. ANDA #$F.phi. ;UNUSED BITS.phi.1DA 26 15 = BNE GOTIT.phi.1DC CB .phi.4 ADDB #4 ;NEXT ROW STARTS WITH KEY 4 ;.phi.1DE 96 E1 LDAA ROW.phi.+1.phi.1E.phi. 43 COMA.phi.1E1 84 F.phi. ANDA #$F.phi..phi.1E3 26 .phi.C = BNE GOTIT.phi.1E5 CB .phi.4 ADDB #4 ;.phi.1E7 96 E2 LDAA ROW.phi.+2.phi.1E9 43 COMA ; ANDA #$F.phi..phi.1EA 84 7.phi. ANDA #$7.phi. ;TRASH BIT FROM SHIFT KEY.phi.1EC 26 .phi.3 = BNE GOTIT ; HERE IF NOW ROWS HAVE KEYS DOWN.phi.1EE C6 FF LDAB #$FF.phi.1F.phi. 39 RTS ; ; NOW TO DETERMINE WHICH OF THE FOUR COLUMNS IT IS ; AT THIS POINT, B CONTAINS .phi., 4, OR 8 ; AND A CONTAINS A `ONE-OF-FOUR` CODE IN THE MSB'S ; THE CODE FOR KEY .phi. IS 1.phi.; KEY 1 is 2.phi., ETC. ;.phi.1F1P GOTIT = *.phi.1F1 44 LSRA.phi.1F2 44 LSRA.phi.1F3 44 LSRA.phi.1F4 44 LSRA ; NOW CODE IS THE THE FOUR LSB'S.phi.1F5 44 KEYSL: LSRA ;PUT A BIT INTO CARRY FLAG.phi.1F6 25 .phi.3= BCS DONKEY ;IF A ONE, THEN WE'RE THROUGH.phi.1F8 5C INCB ;NOPE. . .GO TO NEXT BIT.phi.1F9 2.phi. FA= BRA KEYSL ;LOOP UNTIL FIND ONE ; NOTE THAT WE ARE GUARANTEED THAT AC IS NON-ZERO!!! ; HERE WITH NUMERIC IN AC B ; SEE IF SHIFT KEY IS PUSHED.phi.1FB 7D .phi..phi.E2 TST ROW.phi.+2.phi.1FE 2B .phi.2 = BMI *+4 ;SKIP IF NOT PUSHED.phi.2.phi..phi. CA 1.phi. OPAB #$1.phi. ;ADD IN SHIFT BIT.phi.2.phi.2 39 RTS ;__________________________________________________________________________

Number	Name	Date
3857018	Stark et al.	Dec 1974
4097727	Ulch	Jun 1978
4142097	Ulch	Feb 1979
4150781	Silverman et al.	Apr 1979

Self-contained programmable terminal for security systems

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

US Classifications

Field of Search

US

International Classifications

Abstract

Description

Claims

Parent Case Info

US Referenced Citations (4)

Divisions (1)