Patent US4453093A successfully refreshed from Google Patents.
US4453093A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Multiple comparison circuitry for providing a software error trace signal
Assignee: Bull HN Information Systems Inc
•
Filing: 1982-04-02
•
Granted: 1984-06-05
•
Expires: 2002-04-02
Abstract
Abstract Apparatus and method for performing a logical not function in a multi-compare environment is disclosed. By performing two equivalence compares of a measured variable against selectable target values and using the result of the equivalence compares to selectivity set or reset a bistable element, the need for inverting and multiplexing the output of a comparator that is otherwise required when performing a NOT equivalence function in a single-compare environment is eliminated. The not function logic is used in a system analyzer connected to a data processing system and is used to selectively enable the tracing of software execution as a function of whether or not a variable is a predefined value.
Inventors
- 👤 Daniel A. Boudreau
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 20:26
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/36; G06F11/362; G06F11/3636; G06F9/00; G06F9/06; G06F9/30; G06F9/30003; G06F9/30007; G06F9/30029
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
149 words
A method for performing a logical NOT equivalence function between a first value and a second value comprising the steps of: A. performing a first comparison between the first value and the second value; B. unconditionally setting a bistable element to a first state after the first comparison without regard as to whether or not the first value is equal to the second value; C. performing a second comparison between the first value and the second value; and D. setting the bistable element to a second state after the second comparison if the first value is equal to the second value, whereby after the completion of the second comparison the bistable element will be in the second state if the first value is equal to the second value and the bistable element will be in the first state if the first value is not equal to the second value.
Claim 2
Independent Claim
149 words
A method for performing a logical NOT equivalence function between a first value and a second value comprising the steps of: A. performing a first comparison between the first value and the second value; B. unconditionally setting a bistable element to a first state after the first comparison without regard as to whether or not the first value is equal to the second value; C. performing a second comparison between the first value and the second value; and D. setting the bistable element to a second state after the second comparison if the first value is equal to the second value, whereby after the completion of the second comparison the bistable element will be in the second state if the first value is equal to the second value and the bistable element will be in the first state if the first value is not equal to the second value.
Claim 3
Dependent Claim
60 words
The method of claim 1 wherein the first value and the second value are comprised of a plurality of bits and wherein said unconditional setting of the bistable element to the first state is performed in response to the output of a maskable comparator indicating that all non-masked first value bits are equal to their corresponding non-masked second value bits.
Claim 4
Dependent Claim
49 words
The method of claim 2 wherein a mask having mask bits all of the same logic state is used so that there will be no non-masked bits and the output of the maskable comparator will indicate equivalence between the first value and the second value after the first comparison.
Claim 5
Dependent Claim
126 words
The method of claim 2 wherein the first state can be pre-specified to be a binary ZERO and the second state can be specified to be a binary ONE by selecting that the bistable is to be set to a binary ZERO after the first comparison and reset to a binary ONE after the second comparison if the output of the maskable comparator indicates equivalence or wherein the first state can be specified to be a binary ONE and the second state can be specified to be a binary ZERO by specifying that the bistable is to be set to a binary ONE after the first comparison and reset to a binary ZERO after the second comparison if the output of the maskable comparator indicates equivalence.
Claim 6
Dependent Claim
22 words
The method of claim 1 wherein the first value is a observed variable and the second value is a selected reference value.
Claim 7
Dependent Claim
38 words
The method of claim 1 wherein a third value is substituted for the first value and a fourth value is substituted for the second value during the second comparison providing for two independent equivalence functions to be performed.
Claim 8
Dependent Claim
50 words
The method of claim 1 wherein the second comparison is followed by N-1 further comparisons in which an Ith value is compared to the first value, where I is equal to the number of the comparison being performed, whereby N NOT equivalence functions can be performed by making N+1 comparisons.
Claim 9
Independent Claim
231 words
An apparatus for performing a logical NOT equivalence function between a first value and a second value comprising: A. bistable means having a first state and a second state; B. comparator means having a first input for receiving the first value and a second input for receiving the second value, said comparator means for generating an equal signal at an output, the equal signal being in a first state if the first value is equal to the second value and in a second state if the first value is not equal to the second value; and C. control means, a first input of said control means coupled to the output of said comparator means, an output of said control means coupled to said bistable means, said control means for setting said bistable means to the first state during a first comparison if the equal signal output by said comparator means is in the first state and for setting said bistable menas to the second state during a second comparison if the equal signal output by said comparator means is in the first state, whereby at the completion of the second comparison said bistable means will be in the second state if the first value is equal to the second value and said bistable means will be in the first state if the first value is not equal to the second value.
Claim 10
Independent Claim
231 words
An apparatus for performing a logical NOT equivalence function between a first value and a second value comprising: A. bistable means having a first state and a second state; B. comparator means having a first input for receiving the first value and a second input for receiving the second value, said comparator means for generating an equal signal at an output, the equal signal being in a first state if the first value is equal to the second value and in a second state if the first value is not equal to the second value; and C. control means, a first input of said control means coupled to the output of said comparator means, an output of said control means coupled to said bistable means, said control means for setting said bistable means to the first state during a first comparison if the equal signal output by said comparator means is in the first state and for setting said bistable menas to the second state during a second comparison if the equal signal output by said comparator means is in the first state, whereby at the completion of the second comparison said bistable means will be in the second state if the first value is equal to the second value and said bistable means will be in the first state if the first value is not equal to the second value.
Claim 11
Dependent Claim
13 words
The apparatus of claim 8 wherein said comparator means is a maskable comparator.
Claim 12
Dependent Claim
13 words
The apparatus of claim 9 wherein said bistable means is a J-K flip-flop.
Claim 13
Dependent Claim
13 words
The apparatus of claim 9 wherein said control means comprises two AND gates.
Claim 14
Independent Claim
376 words
An apparatus for controlling the tracing of a program execution comprising: A. bistable means having a first state and a second state; B. address comparator means having a first input for receiving an execution address value and a second input for receiving a trace address value, said address comparator means for generating an address equal signal at an output, the address equal signal being in a first state if the execution address value is equal to the trace address value and in a second state if the execution address value is not equal to the trace address value; C. data comparator means having a first input for receiving an execution data value and a second input for receiving a trace data value, said data comparator means for generating a data equal signal at an output, the data equal signal being in a first state if the execution data value is equal to the trace data value and in a second state if the execution data value is not equal to the trace data value; and D. control means, a first input of said control means coupled to the output of said address comparator means, a second input of said control means coupled to the output of said data comparator means, an output of said control means coupled to said bistable means, said control means for setting said bistable means to the first state during a first comparison if the address equal signal output by said address comparator means is in the first state and for setting said bistable means to the second state during a second comparison if the address equal signal output by said address comparator means is in the first state and if the data equal signal output by said data comparator means is in the first state, whereby at the completion of the second comparison said bistable means will be in the second state if the execution address value is equal to the trace address value and the execution data value is equal to the trace data value and said bistable means will be in the first state if the execution address value is equal to the trace address value and the execution data value is not equal to the trace data value.
Claim 15
Independent Claim
376 words
An apparatus for controlling the tracing of a program execution comprising: A. bistable means having a first state and a second state; B. address comparator means having a first input for receiving an execution address value and a second input for receiving a trace address value, said address comparator means for generating an address equal signal at an output, the address equal signal being in a first state if the execution address value is equal to the trace address value and in a second state if the execution address value is not equal to the trace address value; C. data comparator means having a first input for receiving an execution data value and a second input for receiving a trace data value, said data comparator means for generating a data equal signal at an output, the data equal signal being in a first state if the execution data value is equal to the trace data value and in a second state if the execution data value is not equal to the trace data value; and D. control means, a first input of said control means coupled to the output of said address comparator means, a second input of said control means coupled to the output of said data comparator means, an output of said control means coupled to said bistable means, said control means for setting said bistable means to the first state during a first comparison if the address equal signal output by said address comparator means is in the first state and for setting said bistable means to the second state during a second comparison if the address equal signal output by said address comparator means is in the first state and if the data equal signal output by said data comparator means is in the first state, whereby at the completion of the second comparison said bistable means will be in the second state if the execution address value is equal to the trace address value and the execution data value is equal to the trace data value and said bistable means will be in the first state if the execution address value is equal to the trace address value and the execution data value is not equal to the trace data value.
Claim 16
Dependent Claim
14 words
The apparatus of claim 12 wherein said data comparator means is a maskable comparator.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1987-06-05 | 1987-12-05 | 1988-06-05 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1991-06-05 | 1991-12-05 | 1992-06-05 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1995-06-05 | 1995-12-05 | 1996-06-05 | $7700.00 | Window Closed / Lapsed |