Invalidation of metadata buffers
View Patent ↗A quick buffer validity check can optionally be performed when a potential invalidity of the content of a buffer is identified. The identifying of the potential invalidity condition can include determining that a most recent lifecycle management event timestamp is more recent than a most recent buffer validity check timestamp for the buffer. To determine whether the buffer contents need to be refreshed, a list of the last changed timestamps for the constituent elements of the buffer can be compared to a new list. If the new list and the old list are not identical, the buffer can be rebuilt.
1. A computer program product comprising a non-transitory machine-readable medium storing instructions that, when executed by at least one programmable processor, cause the at least one programmable processor to perform operations comprising:
identifying that content of a buffer might be invalid, the buffer storing a buffered version of each of one or more constituent elements copied from original versions of the one or more constituent elements retained in a repository, the identifying comprising determining that a most recent buffer validity check timestamp for the buffer is not later than a most recent lifecycle management event timestamp associated with a lifecycle management event;
maintaining a list of last changed timestamps, the list comprising a last changed time stamp for each of the one or more constituent elements, the maintaining comprising updating the list to create a new list reflecting a change to at least one of the one or more constituent elements resulting from the lifecycle management event;
comparing the new list to the list; and
rebuilding the buffer when the new list differs from the list, the rebuilding of the buffer comprising deleting the one or more constituent elements from the buffer, adding a current version of each of the one or more constituent elements to the buffer, and storing the new list in the buffer.
2. A computer program product as in claim 1 , wherein the maintaining further comprises reading the last changed time stamp for a specific constituent element from a transport object that delivers the specific constituent element.
3. A computer program product as in claim 1 , wherein the rebuilding further comprises storing a new most recent buffer validity check timestamp in the buffer to replace the most recent buffer validity check timestamp, the new most recent buffer validity check timestamp reflecting a time when the comparing occurs.
4. A computer program product as in claim 1 , wherein the rebuilding further comprises accessing the original version of the constituent element stored in the repository.
5. A computer program product as in claim 1 , wherein the identifying occurs at runtime.
6. A computer program product as in claim 5 , wherein the operations further comprise identifying, on a subsequent runtime access of the buffer, that the buffer is up to date, the identifying that the buffer is up to date comprising determining that the new most recent buffer validity check timestamp is more recent than the most recent lifecycle management event timestamp for the buffer.
7. A system comprising:
at least one programmable processor; and
a machine-readable medium storing instructions that, when executed by the at least one processor, cause the at least one programmable processor to perform operations comprising:
identifying that content of a buffer might be invalid, the buffer storing a buffered version of each of one or more constituent elements copied from original versions of the one or more constituent elements retained in a repository, the identifying comprising determining that a most recent buffer validity check timestamp for the buffer is not later than a most recent lifecycle management event timestamp associated with a lifecycle management event;
maintaining a list of last changed timestamps, the list comprising a last changed time stamp for each of the one or more constituent elements, the maintaining comprising updating the list to create a new list reflecting a change to at least one of the one or more constituent elements resulting from the lifecycle management event;
comparing the new list to the list; and
rebuilding the buffer when the new list differs from the list, the rebuilding of the buffer comprising deleting the one or more constituent elements from the buffer, adding a current version of each of the one or more constituent elements to the buffer, and storing the new list in the buffer.
8. A system as in claim 7 , wherein the maintaining further comprises reading the last changed time stamp for a specific constituent element from a transport object that delivers the specific constituent element.
9. A system as in claim 7 , wherein the rebuilding further comprises storing a new most recent buffer validity check timestamp in the buffer to replace the most recent buffer validity check timestamp, the new most recent buffer validity check timestamp reflecting a time when the comparing occurs.
10. A system as in claim 7 , wherein the rebuilding further comprises accessing the original version of the constituent element stored in the repository.
11. A system as in claim 7 , wherein the identifying occurs at runtime.
12. A system as in claim 11 , wherein the operations further comprise identifying, on a subsequent runtime access of the buffer, that the buffer is up to date, the identifying that the buffer is up to date comprising determining that the new most recent buffer validity check timestamp is more recent than the most recent lifecycle management event timestamp for the buffer.
13. A computer-implemented method comprising:
identifying that content of a buffer might be invalid, the buffer storing a buffered version of each of one or more constituent elements copied from original versions of the one or more constituent elements retained in a repository, the identifying comprising determining that a most recent buffer validity check timestamp for the buffer is not later than a most recent lifecycle management event timestamp associated with a lifecycle management event;
maintaining a list of last changed timestamps, the list comprising a last changed time stamp for each of the one or more constituent elements, the maintaining comprising updating the list to create a new list reflecting a change to at least one of the one or more constituent elements resulting from the lifecycle management event;
comparing the new list to the list; and
rebuilding the buffer when the new list differs from the list, the rebuilding of the buffer comprising deleting the one or more constituent elements from the buffer, adding a current version of each of the one or more constituent elements to the buffer, and storing the new list in the buffer.
14. A computer-implemented method as in claim 13 , wherein the maintaining further comprises reading the last changed time stamp for a specific constituent element from a transport object that delivers the specific constituent element.
15. A computer-implemented method as in claim 13 , wherein the rebuilding further comprises storing a new most recent buffer validity check timestamp in the buffer to replace the most recent buffer validity check timestamp, the new most recent buffer validity check timestamp reflecting a time when the comparing occurs.
16. A computer-implemented method as in claim 13 , wherein the rebuilding further comprises accessing the original version of the constituent element stored in the repository.
17. A computer-implemented method as in claim 13 , wherein the identifying occurs at runtime.
18. A computer-implemented method as in claim 17 , wherein the operations further comprise identifying, on a subsequent runtime access of the buffer, that the buffer is up to date, the identifying that the buffer is up to date comprising determining that the new most recent buffer validity check timestamp is more recent than the most recent lifecycle management event timestamp for the buffer.
19. A computer-implemented method as in claim 13 , wherein at least one of the identifying, the maintaining, the comparing, and the rebuilding is performed by at least one programmable processor.