Safe Flashing

• US 20080098388A1
• Filed: 06/23/2005
• Published: 04/24/2008
• Est. Priority Date: 06/29/2004
• Status: Abandoned Application

• Current Assignee: Koninklijke Philips N.V.
• Original Assignee: Koninklijke Philips Electronics N.V. (Koninklijke Philips N.V.)
• Inventors: Gouder De Beauregard, Arnaud Frank Wilhelmine, Frints, Justin Francois Paul-Marie
• Application Number:
  US11/570,785
• Publication Number:
  US 20080098388A1
• Time in Patent Office: Days
• US Class Current: 717/174
• CPC Class Codes: G06F 11/1433 during software upgrading
• CPC Class Codes: G06F 8/65 Updates security arrangements therefor G06F21/57

Abstract

In accordance with the present invention, when a flashing is initiated a flashcode can be uploaded (310) to a flash only area of a reprogrammable non-volatile storage medium. Then, it is verified (320) whether the flashcode has been uploaded correctly to the flash only area. If the flashcode has not been uploaded correctly, the flashcode will be uploaded (310) to the flash only area again. When the flashcode has been uploaded correctly, a code segment of said reprogrammable non-volatile storage medium can be flashed (330) with new code in the next step. Thereafter, it is verified (340) whether the new code has been correctly written into the code segment. If the code was not satisfactorily written into the code segment, the code segment is flashed (330) again.

Claims

1. A method of flashing a reprogrammable non-volatile storage medium, wherein the method comprises the steps of:

uploading (310) a flashcode to a flash only area of said storage medium;

verifying (320) whether the flashcode has been uploaded correctly;

if so

flashing (330) a code segment of said storage medium; and

verifying (340) whether the code segment has been written correctly;

if it is not written correctly, flashing the code segment again.

2. A method according to claim 1, wherein the method, if the flashcode has not been uploaded correctly, comprises the further step of:

uploading (310) the flashcode to the flash only area again.

3. A method according to claim 1, wherein the method, if the code segment has been written correctly, comprises the further step of:

erasing (350) the flashcode in the flash only area.

4. A method according to claim 1, wherein the method, after having been interrupted during the step of uploading said flashcode or during the step of verifying whether the flashcode has been uploaded correctly, comprises the further step of:

restarting (401) normal execution of the code.

5. A method according to claim 1, wherein the method, after having been interrupted during the step of flashing the code segment or during the step of verifying whether the code segment has been written correctly, comprises the further steps of:

restarting (411) normal execution of the code; and

verifying (412) whether the code segment comprises a complete code, if not comprising a complete code activating (414) the flashcode for renewed flashing of the code segment;

otherwise

proceeding (413) with normal execution of the code.

6. A method according to claim 5, wherein the step of verifying whether the code segment comprises a complete code comprises the steps of:

executing of a completeness check code in the code segment if said completeness check code is not corrupted, thereby checking the completeness of the code comprised in the code segment;

if the code segment is complete setting a watchdog register to a valid value;

checking the watchdog register within a predetermined time after the step of restarting normal execution of the code.

7. A method according to claim 6, wherein the method comprises the further step of:

proceeding with normal execution of the code when the watchdog register is valid;

otherwise

activating the flashcode for renewed flashing of the code segment.

8. A method according to claim 6, wherein the step of checking the completeness of the code comprised in the code segment comprises the steps of:

calculating a checksum over the code comprised in the code segment, and

comparing this checksum with a predetermined value, which indicates a complete code.

9. A method according to claim 1, wherein the method, before the step of uploading the flashcode, comprises the further step of:

verifying (610) whether the code segment comprises a complete code, if it is not complete activating (630) the flashcode and flashing (640) the code segment.

10. A method according to claim 9, wherein the step of verifying whether the code segment comprises a complete code comprises the steps of:

calculating a checksum over the code comprised in the code segment, and

comparing this checksum with a predetermined value, which indicates a complete code.

11. A method according to claim 9, wherein the method comprises the further step of:

verifying (650) whether the code segment has been written correctly;

if not flashing (640) the code segment again.

12. A method according to claim 11, wherein the step of verifying whether the code segment has been written correctly comprises the step of:

comparing the code comprised in another storage medium, which comprises the code that should be written into the code segment, with the code that has been written into the code segment.

13. A method according to claim 11, wherein the method, if the code segment has been written correctly, comprises the further step of:

erasing (660) the flashcode in the flash only area.

14. A method according to claim 9, wherein the method, if the code segment comprises a complete code, comprises the step of:

proceeding (620) with normal execution of the code.

15. A method according to claim 9, wherein the method—

after having been interrupted—

restarts with the step of;

verifying (610) whether the code segment comprises a complete code according to claim 9.

16. A method according to claim 1, wherein the step of verifying whether the flashcode has been uploaded correctly comprises the step of:

comparing the code comprised in another storage medium, which comprises the code that should be uploaded to the flash only area, with the flashcode that has been uploaded to the flash only area.

17. A method according to claim 1, wherein the step of verifying whether the code segment has been written correctly comprises the step of:

comparing the code comprised in another storage medium, which comprises the code that should be written into the code segment, with the code that has been written into the code segment.

18. A method according to claim 16, wherein the comparing step is performed by:

performing a byte-by-byte comparison.

19. A method according to claim 16, wherein the comparing step is performed by:

calculating a first checksum over the code in the another storage medium;

calculating a second checksum over the code in the non-volatile storage medium;

comparing the first and second checksums.

20. A method according to claim 16, wherein the comparing step is performed by:

calculating a checksum over the code in the non-volatile storage medium;

comparing the checksum with a predetermined value, which indicates the code that should be written into the non-volatile storage medium.

21. A method according to any claim 1, wherein the interruption is a power failure.

22. A computer readable program comprising program instructions for causing a computer to perform the method of claim 1.

23. A carrier having thereon a computer readable program comprising computer implementable instructions for causing a computer to perform the method according to claim 1.

24. A carrier according to claim 23, wherein said carrier is a firmware, a record medium, computer memory, read only memory or an electrical carrier signal.

25. A carrier according to claim 23, wherein said carrier is a reprogrammable non-volatile storage medium.

26. A carrier according to claim 23, wherein said reprogrammable non-volatile storage medium is a EPROM, EEPROM or a flash ROM.

27. A computer system comprising input means, output means, storage means and processing means, wherein said processing means is adapted to execute a computer readable program according to claim 22.