Register pointer trap to prevent errors due to an invalid pointer value in a register

Information

  • Patent Grant
  • 7966480
  • Patent Number
    7,966,480
  • Date Filed
    Monday, December 20, 2004
    21 years ago
  • Date Issued
    Tuesday, June 21, 2011
    15 years ago
Abstract
Trap flags and a pointer trap are associated with registers in a processor. Each trap flag indicates whether a corresponding register has been written with valid data. If not, the trap flag is set to indicate that the register corresponding to the trap flag contains invalid data. During instruction processing, the pointer trap receives control signals from instruction fetch/decode logic on the processor indicating an instruction being processed calls for a register to be used as a pointer. If the specified pointer register has its corresponding trap flag set, then the pointer trap indicates that a processing exception has occurred. The interrupt logic/exception processing logic then causes a trap interrupt service routine (ISR) to be executed in response to the exception. The ISR prevents errors from being introduced in the instruction processing due to invalid pointer values.
Description
FIELD OF THE INVENTION

The present invention relates to systems and methods for preventing processing errors in processors and, more particularly, to systems and methods for providing register pointer traps to identify registers having invalid data to prevent propagating processing errors due to these registers being used as pointers.


BACKGROUND OF THE INVENTION

After power is applied to a chip, registers and memory elements in general on the chip will assume values that are unpredictable and will contain data that is invalid. When the chip is a processor, this is not problematic unless a program resident on the processor tries to read memory elements prior to known values having been written into the memory elements. This may be particularly problematic when programs use a memory element, such as a register, as a pointer to a memory. In the latter scenario, the pointer is invalid, and its use will lead to processing errors.


To prevent processing errors, there is a need for a mechanism to identify when a memory element, such as a register, has invalid data in it. There is a further need to flag registers that have invalid data in them to prevent these registers from being used as pointers to memory.


SUMMARY OF THE INVENTION

According to embodiments of the present invention, trap flags and a pointer trap are associated with registers in a processor. Each trap flag indicates whether a corresponding register has been written with valid data. If not, the trap flag is set to indicate that the register corresponding to the trap flag contains invalid data. During instruction processing, the pointer trap receives control signals from instruction fetch/decode logic on the processor indicating an instruction being processed calls for a register to be used as a pointer. If the specified pointer register has its corresponding trap flag set, the then the pointer trap indicates that a processing exception has occurred. The interrupt logic/exception processing logic then causes a trap interrupt service routine (ISR) to be executed in response to the exception. The ISR prevents errors from being propagated during the ensuing instruction processing due to invalid pointer values.


According to one embodiment of the invention, a method of preventing processing errors due to invalid pointers includes fetching an instruction having a pointer operand for execution. The method further includes determining whether a trap flag corresponding to the pointer is in a set or reset condition and generating a trap control signal when the trap flag is in a reset condition. The method may further include executing the instruction and triggering a trap interrupt based on the trap control signal.


The trap flag corresponding to the pointer may be changed from the reset condition to the set condition based upon a write to the pointer. In addition, the trap flag may be changed to the reset condition after a power up or a reset of the processor.


According to another embodiment of the invention, a method of preventing processing errors due to invalid pointers includes providing trap flags, each corresponding to a pointer register. The trap flags are reset upon a power up or reset. Conversely, the trap flag corresponding to each pointer register are set based on the pointer register being written. A trap control signal may be generated when an instruction reads a pointer register with a trap flag set to reset. The trap control signal may trigger a trap interrupt.


According to still another embodiment of the invention, a processor prevents processing errors due to invalid pointers. The processor includes instruction fetch and decode logic, registers, trap flags and pointer trap logic. The instruction fetch and decode logic fetches and decodes instructions. The trap flags each correspond to a register and each indicate a set or reset condition. The pointer trap is coupled to the trap flags and generates a trap control signal based on decoding an instruction that reads a register that has a corresponding trap flag in a reset condition. The trap control signal may only be generated when the register being read from is acting as a pointer register.





BRIEF DESCRIPTION OF THE FIGURES

The above described features and advantages of the present invention will be more fully appreciated with reference to the detailed description and appended figures in which:



FIG. 1 depicts a functional block diagram of an embodiment of a processor chip within which embodiments of the present invention may find application.



FIG. 2 depicts a functional block diagram of a data busing scheme for use in a processor, which has a microcontroller and a digital signal processing engine, within which embodiments of the present invention may find application.



FIG. 3 depicts a functional block diagram of a processor configuration for implementing a pointer trap.



FIG. 4 depicts a method of processing instructions for detecting invalid pointers.





DETAILED DESCRIPTION

According to embodiments of the present invention, trap flags and a pointer trap are associated with registers in a processor. Each trap flag indicates whether a corresponding register has been written with valid data. If not, the trap flag is set to indicate that the register corresponding to the trap flag contains invalid data. During instruction processing, the pointer trap receives control signals from instruction fetch/decode logic on the processor indicating an instruction being processed calls for a register to be used as a pointer. If the specified pointer register has its corresponding trap flag set, then the pointer trap indicates that a processing exception has occurred. The interrupt logic/exception processing logic then causes a trap interrupt service routine (ISR) to be executed in response to the exception. The ISR prevents errors from being propagated during the ensuing instruction processing due to invalid pointer values.


In order to describe embodiments of the invention, an overview of pertinent processor elements is first presented with reference to FIGS. 1 and 2. The pointer trap functionality and interrupt processing is then described more particularly with reference to FIGS. 3-4.


Overview of Processor Elements



FIG. 1 depicts a functional block diagram of an embodiment of a processor chip within which the present invention may find application. Referring to FIG. 1, a processor 100 is coupled to external devices/systems 140. The processor 100 may be any type of processor including, for example, a digital signal processor (DSP), a microprocessor, a microcontroller or combinations thereof. The external devices 140 may be any type of systems or devices including input/output devices such as keyboards, displays, speakers, microphones, memory, or other systems which may or may not include processors. Moreover, the processor 100 and the external devices 140 may together comprise a stand alone system.


The processor 100 includes a program memory 105, an instruction fetch/decode unit 110, instruction execution units 115, data memory and registers 120, peripherals 125, data I/O 130, and a program counter and loop control unit 135. The bus 150, which may include one or more common buses, communicates data between the units as shown.


The program memory 105 stores software embodied in program instructions for execution by the processor 100. The program memory 105 may comprise any type of nonvolatile memory such as a read only memory (ROM), a programmable read only memory (PROM), an electrically programmable or an electrically programmable and erasable read only memory (EPROM or EEPROM) or flash memory. In addition, the program memory 105 may be supplemented with external nonvolatile memory 145 as shown to increase the complexity of software available to the processor 100. Alternatively, the program memory may be volatile memory which receives program instructions from, for example, an external non-volatile memory 145. When the program memory 105 is nonvolatile memory, the program memory may be programmed at the time of manufacturing the processor 100 or prior to or during implementation of the processor 100 within a system. In the latter scenario, the processor 100 may be programmed through a process called in-line serial programming.


The instruction fetch/decode unit 110 is coupled to the program memory 105, the instruction execution units 115 and the data memory 120. Coupled to the program memory 105 and the bus 150 is the program counter and loop control unit 135. The instruction fetch/decode unit 110 fetches the instructions from the program memory 105 specified by the address value contained in the program counter 135. The instruction fetch/decode unit 110 then decodes the fetched instructions and sends the decoded instructions to the appropriate execution unit 115. The instruction fetch/decode unit 110 may also send operand information including addresses of data to the data memory 120 and to functional elements that access the registers.


The program counter and loop control unit 135 includes a program counter register (not shown) which stores an address of the next instruction to be fetched. During normal instruction processing, the program counter register may be incremented to cause sequential instructions to be fetched. Alternatively, the program counter value may be altered by loading a new value into it via the bus 150. The new value may be derived based on decoding and executing a flow control instruction such as, for example, a branch instruction. In addition, the loop control portion of the program counter and loop control unit 135 may be used to provide repeat instruction processing and repeat loop control as further described below.


The instruction execution units 115 receive the decoded instructions from the instruction fetch/decode unit 110 and thereafter execute the decoded instructions. As part of this process, the execution units may retrieve one or two operands via the bus 150 and store the result into a register or memory location within the data memory 120. The execution units may include an arithmetic logic unit (ALU) such as those typically found in a microcontroller. The execution units may also include a digital signal processing engine, a floating point processor, an integer processor or any other convenient execution unit. A preferred embodiment of the execution units and their interaction with the bus 150, which may include one or more buses, is presented in more detail below with reference to FIG. 2.


The data memory and registers 120 are volatile memory and are used to store data used and generated by the execution units. The data memory 120 and program memory 105 are preferably separate memories for storing data and program instructions respectively. This format is a known generally as a Harvard architecture. It is noted, however, that according to the present invention, the architecture may be a von Neumann architecture or a modified Harvard architecture which permits the use of some program space for data space. A dotted line is shown, for example, connecting the program memory 105 to the bus 150. This path may include logic for aligning data reads from program space such as, for example, during table reads from program space to data memory 120.


Referring again to FIG. 1, a plurality of peripherals 125 on the processor may be coupled to the bus 125. The peripherals may include, for example, analog to digital converters, timers, bus interfaces and protocols such as, for example, the controller area network (CAN) protocol or the Universal Serial Bus (USB) protocol and other peripherals. The peripherals exchange data over the bus 150 with the other units.


The data I/O unit 130 may include transceivers and other logic for interfacing with the external devices/systems 140. The data I/O unit 130 may further include functionality to permit in circuit serial programming of the Program memory through the data I/O unit 130.



FIG. 2 depicts a functional block diagram of a data busing scheme for use in a processor 100, such as that shown in FIG. 1, which has an integrated microcontroller arithmetic logic unit (ALU) 270 and a digital signal processing (DSP) engine 230. This configuration may be used to integrate DSP functionality to an existing microcontroller core. Referring to FIG. 2, the data memory 120 of FIG. 1 is implemented as two separate memories: an X-memory 210 and a Y-memory 220, each being respectively addressable by an X-address generator 250 and a Y-address generator 260. The X-address generator may also permit addressing the Y-memory space thus making the data space appear like a single contiguous memory space when addressed from the X address generator. The bus 150 may be implemented as two buses, one for each of the X and Y memory, to permit simultaneous fetching of data from the X and Y memories.


The W registers 240 are general purpose address and/or data registers. The DSP engine 230 is coupled to both the X and Y memory buses and to the W registers 240. The DSP engine 230 may simultaneously fetch data from each of the X and Y memory, execute instructions which operate on the simultaneously fetched data and write the result to an accumulator (not shown) and write a prior result to X or Y memory or to the W registers 240 within a single processor cycle.


In one embodiment, the ALU 270 may be coupled only to the X memory bus and may only fetch data from the X bus. However, the X and Y memories 210 and 220 may be addressed as a single memory space by the X address generator in order to make the data memory segregation transparent to the ALU 270. The memory locations within the X and Y memories may be addressed by values stored in the W registers 240.


Any processor clocking scheme may be implemented for fetching and executing instructions. A specific example follows, however, to illustrate an embodiment of the present invention. Each instruction cycle is comprised of four Q clock cycles Q1-Q4. The four phase Q cycles provide timing signals to coordinate the decode, read, process data and write data portions of each instruction cycle.


According to one embodiment of the processor 100, the processor 100 concurrently performs two operations—it fetches the next instruction and executes the present instruction. Accordingly, the two processes occur simultaneously. The following sequence of events may comprise, for example, the fetch instruction cycle:

    • Q1: Fetch Instruction
    • Q2: Fetch Instruction
    • Q3: Fetch Instruction
    • Q4: Latch Instruction into prefetch register, Increment PC


The following sequence of events may comprise, for example, the execute instruction cycle for a single operand instruction:

    • Q1: latch instruction into IR, decode and determine addresses of operand data
    • Q2: fetch operand
    • Q3: execute function specified by instruction and calculate destination address for data
    • Q4: write result to destination


The following sequence of events may comprise, for example, the execute instruction cycle for a dual operand instruction using a data pre-fetch mechanism. These instructions pre-fetch the dual operands simultaneously from the X and Y data memories and store them into registers specified in the instruction. They simultaneously allow instruction execution on the operands fetched during the previous cycle.

    • Q1: latch instruction into IR, decode and determine addresses of operand data
    • Q2: pre-fetch operands into specified registers, execute operation in instruction
    • Q3: execute operation in instruction, calculate destination address for data
    • Q4: complete execution, write result to destination


Pointer Trap Embodiments



FIG. 3 depicts a functional block diagram of a processor configuration for implementing a pointer trap. Referring to FIG. 3, the processor includes a program memory 300 with instructions 301 and 302 in a processing sequence. A program counter 305 is coupled to the program memory 300 and indicates the current instruction. An instruction fetch/decoder unit 310 is coupled to the program memory 300 and fetches the next instruction for execution as indicated by the program counter 305.


A reset/power up control unit 315 resides on the processor and is used to initialize the processor after a power up and after a processor reset. The unit 315 may be used to control when the processor begins to process instructions after a power on event. This may be performed by letting a predetermined number of clock cycles occur prior to releasing the processor to process instructions. During this start up period, the processor and oscillator clocking the processor are given time to stabilize. In the event of either a power on or a processor reset, and possibly other events, the reset/power up control unit 315 sends a reset control signal to the trap flag control unit 320 to reset the trap flags. This is done because the registers on the processor contain invalid data after a power on event or after a processor reset.


The trap flag control unit 320 is coupled to the reset/power up control unit 315 and the instruction fetch/decode unit 310. In response to receiving a reset control signal from the reset/power up control unit 315, the trap flag control unit 320 causes the trap flags to be reset to a predetermined value, which may be for example a zero or a one. The reset causes the trap flags 345 to indicate that their corresponding registers 340 include invalid data and hence should not be used to provide pointer values.


When an instruction that is being processed calls for writing to one of the registers, the instruction fetch/decode unit 310 generates a write control signal that identifies the particular registers that are being written into. The trap flag control unit 320 receives the write control signal and sets the trap flag 345 for the corresponding register that is being written into to a value that indicates that the register contains valid data. This value may be a zero or one and is the opposite value from the reset value stored after a processor power up or reset.


The trap flags 345 accordingly each relate to a corresponding register 340. In a reset state, a trap flag indicates that the corresponding register contains invalid data. In a set state, the trap flag indicates that the corresponding register contains valid data. The state of the trap flags 345 are reset upon a power on occurrence or a processor reset. The state of each trap flag 345 is thereafter changed to a set state after the corresponding register is written.


The pointer trap 325 is coupled to the instruction fetch/decode unit 310. When an instruction that is being processed calls for reading a pointer value (or other value) from one of the registers, the instruction fetch/decode unit 310 generates a read control signal that identifies the particular registers that are being written into. The pointer trap 325 receives the read control signal for the corresponding register that is being read from. The pointer trap 325 reads the trap flag of the register being read that is identified in the read control signal. When the trap flag corresponding to the register being read is in the reset condition, the pointer trap generates a trap control signal that is sent to the interrupt logic 330 to cause a trap interrupt. When the trap flag corresponding to the register being read is in the set condition, the pointer trap generates a trap control signal that is sent to the interrupt logic 330 that does not cause a trap interrupt. In this manner, the pointer trap 325 monitors instructions that are being processed and when the instructions will result in reading a pointer value that includes invalid data, a trap interrupt is triggered.


The interrupt logic 330 receives indications of exceptions from various units on the processor. The interrupt logic 330 thereafter arbitrates priority and determines which interrupt to service and when. Upon selection of the trap interrupt, the interrupt logic 330 identifies the trap interrupt to the ISR vector register 335.


The ISR vector register 335 is a look up table that includes the address of the first instruction of various interrupt service routines (ISRs). When the trap interrupt is being serviced, the address of the first instruction of the trap ISR is loaded into the program counter 305 which causes the trap ISR to be run. The trap ISR typically places the processor in a known condition to avoid processing errors.



FIG. 4 depicts a method of processing instructions for detecting invalid pointers. Referring to FIG. 4, in step 400, the processor fetches an instruction. In step 410, the processor decodes the instruction. Then in step 420, the processor identifies pointers in the instruction operands. This may be performed by an instruction decoder on the processor. In step 430, the instruction decoder generates read control signals identifying pointer registers that are being read from by a current instruction. The read control signals generated may be sent to a pointer trap unit. In step 440, the processor checks the trap flag value corresponding to one or more of the pointer registers that are being read from. This may be performed by a pointer trap unit. In step 450, the processor determines whether the trap flag is set for one or more of the corresponding pointer registers being read from. If so, then step 460 begins. If not, then step 480 begins and the processor executes the instruction.


In step 460, the processor sends a trap control signal to interrupt control logic on the processor. The trap control signal indicates that a pointer trap exception has occurred. Then in step 470, the processor loads and executes a trap ISR to prevent propagating processing errors and to return the processor to a known state.


While specific embodiments of the present invention have been illustrated and described, it will be understood by those having ordinary skill in the art that changes may be made to those embodiments without departing from the spirit and scope of the invention. For example, FIG. 4 depicts an embodiment of the present invention where the instruction is prevented from being executed when the pointer trap flag is set. In alternative embodiments of the invention, the instruction may be executed even if the pointer trap flag is set. In this embodiment, the trap ISR may cause the processor to undo or correct for the instruction having been executed. In still other embodiments, an instruction may be executed when a trap flag is set but, in the case of a write instruction, the write to memory may be inhibited by a trap control signal. Many other variations are possible and within the scope of the present invention.

Claims
  • 1. A method for preventing processing errors due to invalid pointers, comprising the steps of: providing a register associated with a processor wherein said register stores an address, and associating a trap flag with the register wherein the trap flag comprises a bit;upon reset of the processor, setting said bit to a first value, the first value indicating that the register has not been written with valid data;providing a pointer trap coupled with an instruction decode unit;decoding an instruction by the instruction decode unit;determining whether the instruction identifies said register in its operands;if the instruction identifies said register then sending at least one signal to the pointer trap;determining by the pointer trap if the trap flag is set to the first value; andif the trap flag is set to the first value, then preventing execution of said instruction and generating an exception signal by the pointer trap indicating to said processor that a processing exception has occurred.
  • 2. The method of claim 1, wherein if the processing exception has occurred, then executing a trap interrupt service routine, wherein the trap interrupt service routine returns the processor to a known state.
  • 3. The method of claim 2, wherein the trap interrupt service routine prevents errors from propagating during ensuing instructions processed by the processor.
  • 4. The method of claim 1, wherein when an instruction that is being processed calls for writing to said register, the associated trap flag is set to an opposite value of said first value.
  • 5. The method of claim 1, wherein the step of receiving one or more control signals includes receiving by the pointer trap one or more control signals from instruction fetch/decode logic indicating an instruction calls for the register to be used as a pointer.
  • 6. A processor that identities invalid pointers, comprising: a processor capable of executing one or more instructions;an instruction decode unit for decoding said one or more instructions and for determining whether an instruction uses a predetermined register in its operands;a trap flag control unit coupled with said instruction decode unit;said predetermined register having a plurality of bits and being operative with the processor,a trap flag associated with the register, the trap flag comprising at least one bit which is set or reset by the trap flag control unit; anda pointer trap operative with the trap flag and said instruction decode unit, wherein the pointer trap receives a control signal from said instruction decode unit if said instruction identifies said register in its operands;wherein when the pointer trap receives the control signal from said instruction decode unit, the pointer trap determines if the at least one bit of the trap flag is set to a value indicating that the register has not been written with valid data, and if so, then the processor is operable to prevent execution of said instruction and the pointer trap generates an exception signal.
  • 7. The processor of claim 6, wherein the processor executes a trap interrupt service routine if the exception signal is detected.
  • 8. The processor of claim 7, wherein the register stores an address.
  • 9. The processor of claim 6, wherein the trap flag control unit is operable to set the associated trap flag to a second value if an instruction is being processed that calls for writing to said register.
  • 10. The processor of claim 6, wherein the register stores data.
  • 11. The processor of claim 6, wherein the processor includes an instruction fetch/decode logic that sends the control signal to the pointer trap.
  • 12. A method for preventing processing errors in a processor due to invalid pointers, comprising the steps of: providing a plurality of registers, and a plurality of trap flags wherein each trap flag is associated with a register from said plurality of registers wherein each trap flag comprises a bit;upon reset of the processor, setting each bit of the plurality of trap flags to a first value, the first value indicating that the associated register has not been written with valid data;providing a pointer trap;decoding an instruction and determining whether the instruction identifies one of said plurality of registers to be used when executing said instruction;if the instruction identifies the one of a plurality of registers to be used then sending at least one signal to the pointer trap;if the pointer trap received said at least one signal then determining by the pointer trap if a trap flag associated with the one of said plurality of registers is set to the first value;if the trap flag is set to the first value, then preventing execution of said instruction.
  • 13. The method of claim 12, further comprising generating an exception signal, wherein if the processing exception has occurred, then executing a trap interrupt service routine.
  • 14. The method of claim 13, wherein the trap interrupt service routine prevents errors from propagating during ensuing instructions processed by the processor.
  • 15. The method of claim 12, wherein a register value of the one of said plurality of registers is to be used as data.
  • 16. The method of claim 12, wherein a register value of the one of said plurality of registers is to be used as an address.
  • 17. The method of claim 12, wherein the step of receiving one or more control signals includes receiving by the pointer trap one or more control signals from instruction fetch/decode logic indicating an instruction calls for the one of said plurality of registers to be used as a pointer.
  • 18. A method for preventing processing errors due to invalid pointers, comprising the steps of: providing a register associated with a processor wherein said register stores an address, and associating a trap flag with the register wherein the trap flag comprises a bit;upon reset of the processor, setting said bit to a first value, the first value indicating that the register has not been written with valid data;providing a pointer trap coupled with an instruction decode unit;decoding an instruction by the instruction decode unit;determining whether the instruction identifies said register storing an address in its operands;if the instruction identifies said register storing an address then sending at least one signal to the pointer trap;determining by the pointer trap if the trap flag is set to the first value; andif the trap flag is set to the first value and said instruction is a write instruction, then generating a signal that inhibits a write to memory.
  • 19. A method for preventing processing errors in a processor due to invalid pointers, comprising the steps of: providing a plurality of registers, and a plurality of trap flags wherein each trap flag is associated with a register from said plurality of registers wherein each trap flag comprises a bit;upon reset of the processor, setting each bit of the plurality of trap flags to a first value, the first value indicating that the associated register has not been written with valid data;providing a pointer trap;decoding an instruction and determining whether the instruction identifies one of said plurality of registers to be used when executing said instruction;if the instruction identifies the one of a plurality of registers to be used then sending at least one signal to the pointer trap;if the pointer trap received said at least one signal then determining by the pointer trap if a trap flag associated with the one of said plurality of registers is set to the first value;if the trap flag is set to the first value, then executing said instruction and generating an exception signal whereupon a trap interrupt service routine is executed, wherein said trap interrupt service routine undoes or corrects the effect of said instruction execution.
  • 20. The method of claim 19, wherein the trap interrupt service routine prevents errors from propagating during ensuing instructions processed by the processor.
  • 21. The method of claim 19, wherein a register value of the one of said plurality of registers is to be used as data.
  • 22. The method of claim 19, wherein a register value of the one of said plurality of registers is to be used as an address.
  • 23. The method of claim 19, wherein the step of receiving one or more signals includes receiving by the pointer trap one or more control signals from instruction fetch/decode logic indicating an instruction calls for the one of said plurality of registers to be used as a pointer.
  • 24. A processor that identifies invalid pointers, comprising: a processor capable of executing one or more instructions;an instruction decode unit for decoding said one or more instructions and for determining whether an instruction uses a predetermined register in its operands;a trap flag control unit coupled with said instruction decode unit;wherein said predetermined register having a plurality of bits and being operative with the processor, said register storing an address;a trap flag associated with the register, the trap flag comprising at least one bit which is set or reset by the trap flag control unit; anda pointer trap operative with the trap flag and said instruction decode unit, wherein the pointer trap receives a control signal from said instruction decode unit if said instruction identifies said register in its operands;wherein when the pointer trap receives the control signal from said instruction decode unit, the pointer trap determines if the at least one bit of the trap flag is set to a value indicating that the register has not been written with valid data, and if so, then the processor is operable to execute said instruction and a trap interrupt service routine undoes or corrects the effect of said instruction execution.
  • 25. The processor of claim 24, wherein the trap flag control unit is operable to set the associated trap flag to a second value if an instruction is being processed that calls for writing to said register.
  • 26. The processor of claim 24, wherein the processor includes an instruction fetch/decode logic that sends the control signal to the pointer trap.
CROSS REFERENCE TO RELATED APPLICATION

This application is a continuation of U.S. application Ser. No. 09/870,446 entitled “Register Pointer Trap” which was filed by Michael I. Catherwood on Jun. 1, 2001 now abandoned and is assigned to the same entity as the present application.

US Referenced Citations (228)
Number Name Date Kind
3771146 Cotton et al. Nov 1973 A
3781810 Downing Dec 1973 A
3886524 Appelt May 1975 A
3930253 Maida Dec 1975 A
4025771 Lynch et al. May 1977 A
4074353 Woods et al. Feb 1978 A
4090250 Carlson et al. May 1978 A
4323981 Nakamura Apr 1982 A
4379338 Nishitani et al. Apr 1983 A
4398244 Chu et al. Aug 1983 A
4408274 Wheatley et al. Oct 1983 A
4451885 Gerson et al. May 1984 A
4472788 Yamazaki Sep 1984 A
4481576 Bicknell Nov 1984 A
4488252 Vassar Dec 1984 A
4511990 Hagiwara et al. Apr 1985 A
4556938 Parker et al. Dec 1985 A
4615005 Maejima et al. Sep 1986 A
4626988 George Dec 1986 A
4709324 Kloker Nov 1987 A
4727475 Kiremidjian Feb 1988 A
4730248 Watanabe et al. Mar 1988 A
4742479 Kloker et al. May 1988 A
4768149 Konopik et al. Aug 1988 A
4779191 Greenblatt Oct 1988 A
4782457 Cline Nov 1988 A
4800524 Roesgen Jan 1989 A
4807172 Nukiyama Feb 1989 A
4829420 Stahle May 1989 A
4829460 Ito May 1989 A
4839846 Hirose et al. Jun 1989 A
4841468 Miller et al. Jun 1989 A
4872128 Shimizu Oct 1989 A
4882701 Ishii Nov 1989 A
4926371 Vassilliadis et al. May 1990 A
4941120 Brown et al. Jul 1990 A
4942524 Nunomura Jul 1990 A
4943940 New Jul 1990 A
4945507 Ishida et al. Jul 1990 A
4959776 Deerfield et al. Sep 1990 A
4977533 Miyabayashi et al. Dec 1990 A
4984213 Abdoo et al. Jan 1991 A
5007020 Inskeep Apr 1991 A
5012441 Retter Apr 1991 A
5032986 Pathak et al. Jul 1991 A
5034887 Yasui et al. Jul 1991 A
5038310 Akagiri et al. Aug 1991 A
5040178 Lindsay et al. Aug 1991 A
5056004 Ohde et al. Oct 1991 A
5099445 Studor et al. Mar 1992 A
5101484 Kohn Mar 1992 A
5117498 Miller et al. May 1992 A
5121431 Wiener Jun 1992 A
5122981 Taniguchi Jun 1992 A
5155823 Tsue Oct 1992 A
5177373 Nakamura Jan 1993 A
5197023 Nakayama Mar 1993 A
5197140 Balmer Mar 1993 A
5206940 Murakami et al. Apr 1993 A
5212662 Cocanougher et al. May 1993 A
5218239 Boomer Jun 1993 A
5239654 Ing-Simmons et al. Aug 1993 A
5276634 Suzuki et al. Jan 1994 A
5282153 Bartkowiak et al. Jan 1994 A
5327543 Miura et al. Jul 1994 A
5327566 Forsyth Jul 1994 A
5375080 Davies Dec 1994 A
5379240 Byrne Jan 1995 A
5386563 Thomas Jan 1995 A
5392435 Masui et al. Feb 1995 A
5418976 Iida May 1995 A
5422805 McIntyre et al. Jun 1995 A
5432943 Mitsuishi Jul 1995 A
5448703 Amini et al. Sep 1995 A
5448706 Fleming et al. Sep 1995 A
5450027 Gabara Sep 1995 A
5463749 Wertheizer et al. Oct 1995 A
5469377 Amano Nov 1995 A
5471600 Nakamoto Nov 1995 A
5497340 Uramoto et al. Mar 1996 A
5499380 Iwata et al. Mar 1996 A
5504916 Murakami et al. Apr 1996 A
5506484 Munro et al. Apr 1996 A
5517436 Andreas et al. May 1996 A
5525874 Mallarapu et al. Jun 1996 A
5548544 Matheny et al. Aug 1996 A
5561384 Reents et al. Oct 1996 A
5561619 Watanabe et al. Oct 1996 A
5561774 Aikawa et al. Oct 1996 A
5564028 Swoboda et al. Oct 1996 A
5568380 Broadnax et al. Oct 1996 A
5568412 Han et al. Oct 1996 A
5596760 Ueda Jan 1997 A
5600813 Nakagawa et al. Feb 1997 A
5604864 Noda Feb 1997 A
5611061 Yasuda Mar 1997 A
5619711 Anderson Apr 1997 A
5623646 Clarke Apr 1997 A
5638524 Kiuchi et al. Jun 1997 A
5642516 Hedayat et al. Jun 1997 A
5649146 Riou Jul 1997 A
5651121 Davies Jul 1997 A
5657484 Scarrá Aug 1997 A
5659700 Chen et al. Aug 1997 A
5682339 Tam Oct 1997 A
5689693 White Nov 1997 A
5694350 Wolrich et al. Dec 1997 A
5696711 Makineni Dec 1997 A
5701493 Jaggar Dec 1997 A
5706460 Craig et al. Jan 1998 A
5706466 Dockser Jan 1998 A
5715470 Asano et al. Feb 1998 A
5737570 Koch Apr 1998 A
5740095 Parant Apr 1998 A
5740419 Potter Apr 1998 A
5740451 Muraki et al. Apr 1998 A
5748516 Goddard et al. May 1998 A
5748970 Miyaji et al. May 1998 A
5764555 McPherson et al. Jun 1998 A
5765216 Weng et al. Jun 1998 A
5765218 Ozawa et al. Jun 1998 A
5774711 Henry et al. Jun 1998 A
5778237 Yamamoto et al. Jul 1998 A
5778416 Harrison et al. Jul 1998 A
5790443 Shen et al. Aug 1998 A
5808926 Gorshtein et al. Sep 1998 A
5812439 Hansen Sep 1998 A
5812868 Moyer et al. Sep 1998 A
5815693 McDermott et al. Sep 1998 A
5825730 Nishida et al. Oct 1998 A
5826013 Nachenberg Oct 1998 A
5826072 Knapp et al. Oct 1998 A
5826096 Baxter Oct 1998 A
5828875 Halvarsson et al. Oct 1998 A
5862065 Muthusamy Jan 1999 A
5867726 Ohsuga et al. Feb 1999 A
5875342 Temple Feb 1999 A
5880984 Burchfiel et al. Mar 1999 A
5887146 Baxter et al. Mar 1999 A
5892697 Brakefield Apr 1999 A
5892699 Duncan et al. Apr 1999 A
5894428 Harada Apr 1999 A
5900683 Rinehart et al. May 1999 A
5909385 Nishiyama et al. Jun 1999 A
5917741 Ng Jun 1999 A
5918252 Chen et al. Jun 1999 A
5930159 Wong Jul 1999 A
5930503 Drees Jul 1999 A
5936870 Im Aug 1999 A
5937199 Temple Aug 1999 A
5938759 Kamijo Aug 1999 A
5941940 Prasad et al. Aug 1999 A
5943249 Handlogten Aug 1999 A
5944816 Dutton et al. Aug 1999 A
5951627 Kiamilev et al. Sep 1999 A
5951679 Anderson et al. Sep 1999 A
5973527 Schweighofer et al. Oct 1999 A
5974549 Golan Oct 1999 A
5978825 Divine et al. Nov 1999 A
5983333 Kolagotia et al. Nov 1999 A
5991787 Abel et al. Nov 1999 A
5991868 Kamiyama et al. Nov 1999 A
5996067 White Nov 1999 A
6002234 Ohm et al. Dec 1999 A
6009454 Dummermuth Dec 1999 A
6014723 Tremblay et al. Jan 2000 A
6018757 Wong Jan 2000 A
6026489 Wachi et al. Feb 2000 A
6044392 Anderson et al. Mar 2000 A
6044434 Oliver Mar 2000 A
6049858 Kolagotia et al. Apr 2000 A
6055619 North et al. Apr 2000 A
6058409 Kozaki et al. May 2000 A
6058410 Sharangpani May 2000 A
6058464 Taylor May 2000 A
6061711 Song et al. May 2000 A
6061780 Shippy et al. May 2000 A
6061783 Harriman May 2000 A
6076154 Van Eijndhoven et al. Jun 2000 A
6084880 Bailey et al. Jul 2000 A
6101521 Kosiec Aug 2000 A
6101599 Wright et al. Aug 2000 A
6115732 Oberman et al. Sep 2000 A
6128728 Dowling Oct 2000 A
6134574 Oberman et al. Oct 2000 A
6144980 Oberman Nov 2000 A
6145049 Wong Nov 2000 A
6181151 Wasson Jan 2001 B1
6192447 Shand Feb 2001 B1
6202163 Gabzdyl et al. Mar 2001 B1
6205467 Lambrecht et al. Mar 2001 B1
6209086 Chi et al. Mar 2001 B1
6243786 Huang et al. Jun 2001 B1
6243804 Cheng Jun 2001 B1
6260162 Typaldos et al. Jul 2001 B1
6282637 Chan et al. Aug 2001 B1
6292866 Zaiki et al. Sep 2001 B1
6295574 MacDonald Sep 2001 B1
6300800 Schmitt et al. Oct 2001 B1
6315200 Silverbrook et al. Nov 2001 B1
6356970 Killian et al. Mar 2002 B1
6363522 Click et al. Mar 2002 B1
6377619 Denk et al. Apr 2002 B1
6397318 Peh May 2002 B1
6412081 Koscal et al. Jun 2002 B1
6434020 Lambert et al. Aug 2002 B1
6487654 Dowling Nov 2002 B2
6523108 James et al. Feb 2003 B1
6552625 Bowling Apr 2003 B2
6564238 Kim et al. May 2003 B1
6633970 Clift et al. Oct 2003 B1
6634020 Bates et al. Oct 2003 B1
6643150 Kawakami Nov 2003 B2
6658578 Laurenti et al. Dec 2003 B1
6681280 Miyake et al. Jan 2004 B1
6694398 Zhao et al. Feb 2004 B1
6724169 Majumdar et al. Apr 2004 B2
6728856 Grosbach et al. Apr 2004 B2
6751742 Duhault et al. Jun 2004 B1
6763478 Bui Jul 2004 B1
6862635 Alverson et al. Mar 2005 B1
20010013117 Ungar Aug 2001 A1
20020194466 Catherwood et al. Dec 2002 A1
20030093656 Masse et al. May 2003 A1
20040150439 Greenfeld Aug 2004 A1
20070038826 Dieffenderfer et al. Feb 2007 A1
20070113046 Vorbach et al. May 2007 A1
20080028262 Gellerich Jan 2008 A1
Foreign Referenced Citations (6)
Number Date Country
0 554 917 Aug 1993 EP
0 855 643 Jul 1998 EP
0 992 888 Dec 2000 EP
0 992 889 Dec 2000 EP
01037424 Feb 1989 JP
9611443 Apr 1996 WO
Related Publications (1)
Number Date Country
20050172109 A1 Aug 2005 US
Continuations (1)
Number Date Country
Parent 09870446 Jun 2001 US
Child 11016798 US