Methods and apparatus for performing in-service upgrade of software in network processor

• US 7,802,245 B2
• Filed: 04/27/2006
• Issued: 09/21/2010
• Est. Priority Date: 04/27/2006
• Status: Expired due to Fees

• Current Assignee: Intel Corporation
• Original Assignee: Agere Systems Incorporated (Broadcom, Inc.)
• Inventors: Sonnier, David P., Vangati, Narender Reddy
• Primary Examiner(s): Bullock, Jr.; Lewis A
• Assistant Examiner(s): Gooray; Mark A
• Application Number:
  US11/412,915
• Publication Number:
  US 20070255764A1
• Time in Patent Office: 1,608 Days
• Field of Search: 717168-178
• US Class Current: 717/171
• CPC Class Codes: G06F 8/656 while running

Abstract

Improved techniques are disclosed for performing an in-service upgrade of software associated with a network or packet processor. By way of example, a method of performing an in-service upgrade of code, storable in a memory associated with a packet processor and executable on the packet processor, from a first code version to a second code version, includes the following steps. A first step includes preparing for the upgrade by generating one or more write operations to effectuate the code upgrade from the first code version to the second code version. A second step includes updating the code from the first code version to the second code version by propagating the one or more write operations to the packet processor. A third step includes cleaning up after the updating step by reclaiming one or more memory locations available after the update step. As such, the storage of only a single version of the code in the memory associated with the packet processor is required.

Claims

1. A method of performing an in-service upgrade of code, storable in a memory associated with a packet processor and executable on the packet processor, from a first code version to a second code version, comprising the steps of:

preparing for the upgrade by generating one or more write operations to effectuate the code upgrade from the first code version to the second code version, the preparing step comprising the steps of;

allocating an indirection address for a given flow function, wherein the indirection address points to an address for the given flow function in the first code version;

modifying one or more references to the given flow function to point to the indirection address for the given flow function;

generating the one or more write operations, wherein the one or more operations are operative to update the indirection address for the given flow function to point to an address for the given flow function in the second code version;

updating the code from the first code version to the second code version by propagating the one or more write operations to the packet processor; and

cleaning up after the updating step, the cleaning up step comprising the steps of;

modifying the one or more references to the given flow function to point to the address for the given flow function in the second code version; and

reclaiming one or more memory locations available after the update step;

wherein the preparing, updating and cleaning up steps require only the storage of a single version of the code in the memory associated with the packet processor.

2. The method of claim 1, wherein the code being upgraded comprises one or more processing elements and the updating step further comprises, for each processing element, ceasing operation of at least a portion of the packet processor responsible for executing the processing element.

3. The method of claim 2, wherein the updating step further comprises, for each processing element, propagating to the packet processor the one or more write operations associated with the processing element.

4. The method of claim 3, wherein the updating step further comprises, for each processing element, restarting operation of the ceased portion of the packet processor.

5. The method of claim 4, wherein the processing element comprises a functionally discrete block of code.

6. The method of claim 1, wherein the first code version comprises an old code version and the second code version comprises a new code version.

7. The method of claim 1, wherein the code executable on the packet processor comprises code for executing a packet classification function.

16. The method of claim 1, wherein the preparing step further comprises the step of building at least one tree associated with the second code version.

17. The method of claim 16, wherein the one or more write operations are further operative to modify a root address to point to the at least one tree associated with the second code version instead of at least one tree associated with the first code version.

18. The method of claim 17, wherein the one or more memory locations comprises one or more memory locations associated with the at least one tree associated with the first code version.

8. A packet processor configured to have code, storable in a memory associated with the packet processor and executable on the packet processor, upgraded from a first code version to a second code version by a process comprising the steps of:

preparing for the upgrade by generating one or more write operations to effectuate the code upgrade from the first code version to the second code version, the preparing step comprising the steps of;

allocating an indirection address for a given flow function, wherein the indirection address points to an address for the given flow function in the first code version;

modifying one or more references to the given flow function to point to the indirection address for the given flow function;

generating the one or more write operations, wherein the one or more operations are operative to update the indirection address for the given flow function to point to an address for the given flow function in the second code version;

updating the code from the first code version to the second code version by propagating the one or more write operations to the packet processor; and

cleaning up after the updating step, the cleaning up step comprising the steps of;

modifying the one or more references to the given flow function to point to the address for the given flow function in the second code version; and

reclaiming one or more memory locations available after the update step;

wherein the preparing, updating and cleaning up steps require only the storage of a single version of the code in the memory associated with the packet processor.

9. The packet processor of claim 8, wherein the code being upgraded comprises one or more processing elements and the updating step further comprises, for each processing element, ceasing operation of at least a portion of the packet processor responsible for executing the processing element.

10. The packet processor of claim 9, wherein the updating step further comprises, for each processing element, propagating to the packet processor the one or more write operations associated with the processing element.

11. The packet processor of claim 10, wherein the updating step further comprises, for each processing element, restarting operation of the ceased portion of the packet processor.

12. The packet processor of claim 11, wherein the processing element comprises a functionally discrete block of code.

13. The packet processor of claim 8, wherein the first code version comprises an old code version and the second code version comprises a new code version.

14. The packet processor of claim 8, wherein the code executable on the packet processor comprises code for executing a packet classification function.

15. The packet processor of claim 8, wherein the packet processor is implemented on an integrated circuit.

19. The packet processor of claim 8, wherein the preparing step further comprises the step of building at least one tree associated with the second code version.

20. The packet processor of claim 19, wherein the one or more write operations are further operative to modify a root address to point to the at least one tree associated with the second code version instead of at least one tree associated with the first code version.