US 10,649,763 B2Granted

Resource efficient deployment of multiple hot patches

AssigneeMicrosoft Technology Licensing, LLC

InventorsSai Ganesh Ramachandran, Bruce J. Sherwin, Jr., David Alan Hepkin

Life of this patent

Estimating the term…

Loading patent…

Abstract

The disclosed technology is generally directed to the patching of executing binaries. In one example of the technology, at separate times, a plurality of hot patch requests is received. Each hot patch request of the plurality of hot patch requests includes a corresponding hot patch to hot patch the executing binary. A cardinality of the plurality of hot patch requested is greater than the fixed number of logical patch slots. with the executing binary continuing to execute, each time a request to apply a hot patch to the executing binary is received, the corresponding hot patch is assigned to an inactive logical patch slot of the fixed number of logical patch slots. The corresponding hot patch is executed from the assigned logical patch slot to hot patch the executing binary based on the corresponding hot patch.

Claims20

Dependent claims

An apparatus, comprising:

a device including at least one memory adapted to store run-time data for the device, and at least one processor that is adapted to execute processor-executable code that, in response to execution, enables the device to perform actions, including:
providing a plurality of logical patch slots for patch images for hot patching an executing binary;
receiving a hot patch request, the hot patch request including a hot patch for the executing binary;
assigning the hot patch to a first logical patch slot of the plurality of logical patch slots, based at least in part on the first logical patch slot being set as inactive;
executing the hot patch from the first logical patch slot, resulting in the first logical patch slot becoming active;
and
de-assigning a second logical patch slot of the plurality of logical patch slots, based at least in part on the second logical patch slot being active, the second logical patch slot distinct from the first logical patch slot, the second logical patch slot associated with a patch generation, wherein the de-assigning the second logical patch slot comprises:
signaling a first thread to unwind and rewind, the first thread included in a plurality of threads running in the patch generation;
responsive to the first thread finishing rewinding, decrementing a reference counter associated with the second logical patch slot, the reference counter corresponding to a cardinality of the plurality of threads running in the patch generation;
responsive to the reference counter reaching zero, setting the second logical patch slot as inactive.

7 more elements

A method, comprising:

receiving a particular request to apply a particular hot patch to an executing binary, wherein a plurality of threads are running in a current image of the executing binary, wherein the particular request to apply the particular hot patch was received after receiving a prior request to apply a prior hot patch to the executing binary, and wherein the executing binary has executed without a restart for at least an entirety of a period between the receiving of the prior request and the receiving of the particular request;
responsive to the particular request to apply the particular hot patch, setting a reference counter associated with the particular hot patch to correspond to a cardinality of the plurality of threads that are running the current image of the executing binary;
executing the particular hot patch;
signaling a first thread of the plurality of threads to unwind and rewind, wherein the signaling is performed while the first thread is executing in a prior patch generation that corresponds to the prior hot patch and while a second thread of the plurality of threads is executing in another patch generation that is older than the prior patch generation;
based on the first thread completing the rewind, decrementing the reference counter associated with the particular hot patch;
and
in response to the reference counter associated with the particular hot patch reaching zero, reclaiming resources associated with the particular hot patch with the executing binary continuing to execute.

4 more elements

A processor-readable storage medium, having stored thereon processor-executable code that, upon execution by at least one processor, enables actions, comprising:

executing an operating system kernel with bounded execution guarantees, such that a plurality of threads are running on a current image of the executing operating system kernel;
beginning execution of a particular hot patch to the executing operating system kernel after a beginning of an execution of a prior hot patch to the executing operating system and while a first thread of the plurality of threads is operating in a different patch generation than a second thread of the plurality of threads, wherein the executing operating system has been executing without a restart for at least an entirety of a period between the beginning of the execution of the prior hot patch and the beginning of the execution of the present hot patch;
setting a counter associated with the particular hot patch to correspond to a cardinality of the plurality of threads;
signaling the first thread of the plurality of threads to unwind and rewind;
based on the first thread completing the rewind, decrementing the counter by one;
and
responsive to the counter reaching zero, reclaiming resources associated with the particular hot patch.

4 more elements

Dependencies are inferred from the claim text.