Abstract: A system for evaluating at least one tripping stimulus for a ground-fault circuit interrupter includes: a sensing circuit configured to measure a leakage current from a voltage line to ground, wherein the sensing circuit is capable of generating a leakage signal including a voltage representative of the leakage current; and an evaluating circuit configured to evaluate the leakage signal to generate an indication signal, wherein the indication signal includes information corresponding to the at least one tripping stimulus. The sensing circuit may include a circuit substantially similar to at least a portion of a ground-fault circuit interrupter, and the evaluating circuit may include a peak hold circuit. The system may further include an indicator circuit for receiving the indication signal and displaying a status of the tripping conditions.

Abstract: A system for evaluating at least one tripping stimulus for a ground-fault circuit interrupter includes: a sensing circuit configured to measure a leakage current from a voltage line to ground, wherein the sensing circuit is capable of generating a leakage signal including a voltage representative of the leakage current; and an evaluating circuit configured to evaluate the leakage signal to generate an indication signal, wherein the indication signal includes information corresponding to the at least one tripping stimulus. The sensing circuit may include a circuit substantially similar to at least a portion of a ground-fault circuit interrupter, and the evaluating circuit may include a peak hold circuit. The system may further include an indicator circuit for receiving the indication signal and displaying a status of the tripping conditions.

Abstract: A memory management technique for maintaining packet order in a packet processing system involves maintaining a START indicator and a VALID indicator for each memory block in a packet memory. Packets are written in a number of successive memory blocks, and the START indicator corresponding to the first memory block of the number of successive memory blocks is set to indicate that the packet is available for processing. The packets are processed by a packet processor. When the packet processor completes the processing of a particular packet, the VALID indicator corresponding to the first memory block associated with that packet is set to indicate that the packet is ready to be forwarded. The packet may become ready to be forwarded out of order.

Abstract: A method, apparatus, and article of manufacture for hash lookups using valid bit tables with pointers. A key is compressed by hashing the key using a hash function. The hash key is used as a valid bit index into the valid bit table. A first pointer associated with the valid bit index is then used as a pointer into a first block of entries in a result table. A sum of transition bits in the valid bit table below the valid bit index is used as a result index into the first block of entries in the result table. The result index into the first block of entries may be used to reference a result of the radix search tree lookup. Extra space is added in the result table to enable insertion of entries after the first block of entries. A second pointer is used to add redundant entries from the first block of entries into a second block of entries in the result table.

Abstract: A method, apparatus, and article of manufacture for performing a radix search tree lookup with a key using a transition table with pointers. The key is used as a transition index into the transition table. A first pointer associated with the transition index is then used as a pointer into a first block of entries in a result table. A sum of transition bits in the transition table below the transition index is used as a result index into the first block of entries in the result table. The result index into the first block of entries may be used to reference a result of the radix search tree lookup. Extra space is added in the result table to enable insertion of entries after the first block of entries. A second pointer is used to add redundant entries from the first block of entries into a second block of entries in the result table.

Abstract: A method, apparatus, and article of manufacture for performing a radix search tree lookup with a key using a valid bit table with pointers. The key is used as a valid bit index into the valid bit table. A first pointer associated with the valid bit index is then used as a pointer into a first block of entries in a result table. A sum of valid bits in the valid bit table below the valid bit index is used as a result index into the first block of entries in the result table. The result index into the first block of entries may be used to reference a result of the radix search tree lookup. Extra space is added in the result table to enable insertion of entries after the first block of entries. A second pointer is used to add redundant entries from the first block of entries into a second block of entries in the result table.

Abstract: A method, apparatus, and article of manufacture for performing compressed radix search tree lookups using transition tables. The key is used as a transition index into the transition table. A sum of transition bits in the transition table below the transition index is used as a result index into the result table. The result index into the result table may be used to reference a result of the radix search tree lookup.

Abstract: A delayed replace mechanism for a streaming packet modification engine. The delayed replace mechanism allows for packet streaming where embedded fields within a data packet may be modified dependent upon fields following them within the data packet. Data to be forwarded is buffered through a data FIFO while marking fields that are to be replaced. Calculated replacement fields are stored in a replacement FIFO to be overwritten upon transmission from the packet streaming mechanism.