System and Method Thereof for Creating Dynamically Attachable and Detachable Binary Files
Abstract
A technique for creating dynamically attachable and detachable binary files is provided. The invention provides an efficient mechanism to manage the existing code bases with respect to the additional code needed for a particular feature as a single code base. It also provides a mechanism for designers to plan for such features even before the code is conceptualized. The system parses the code having a dynamic feature manager (DFM) tag to produce a base code wherein the DFM tag encloses a feature. The multiple code sets based on the DFM tags are created. A feature change table storing the information about a changed feature compared to the feature from the code sets is generated and stored in the system. The code sets are then compiled to generate binaries. The difference between each of the binaries, using the feature change tables is determined and stored which is used for creating differential binary file(s).
Claims
exact text as granted — not AI-modifiedWhat is claimed is:
1 . A computer system having a non-transitory computer-readable medium including computer program logic encoded thereon that, when executed on the computer system provides a mechanism for creating and managing one or more executable differential binary files, that causes the computer system to perform operations of:
parsing at least one computer program source code having at least one dynamic feature manager (DFM) tag; creating a plurality of code sets based on the DFM tags, wherein the code sets comprise a first code set having a base code and at least one second code set having the base code and a feature, wherein the base code is the at least one computer program source code without any DFM tag, and wherein the feature is a set of code; generating one or more feature change tables, wherein the feature change tables store the information about a changed feature compared to the feature from the code sets; stripping the DFM tag from the computer program source code to produce the base code, wherein the DFM tag is used to indicate that the feature is enclosed from the at least one computer program source code; compiling the code sets for generating a plurality of binaries; determining a difference between any two of the binaries using the feature change tables; and creating a differential binary file(s) of the one or more executable differential binary files based on the difference determined.
2 . The computer system according to claim 1 , wherein the DFM tag follows syntax as DFM_<feature name>_start and DFM_<the feature name>_end to enclose the feature.
3 . The computer system according to claim 1 , wherein the DFM tag is added while writing the computer program source code.
4 . The computer system according to claim 1 , wherein the DFM tag is added while adding or updating new code to the computer program source code.
5 . The computer system according to claim 1 , wherein the feature is selected from a group comprising a function, a global variables and structures, a common macros, an inline function, a static variable, and a combination thereof.
6 . The computer system according to claim 1 , wherein in parsing the at least one computer program source code having the at least one DFM tag, the computer system is further caused to perform an operation of parsing at least one computer program source code having at least one DFM tag, to check for a nesting of the DFM tag and to create a hierarchy tree of the computer program source code, wherein the hierarchy tree comprises a DFM unrelated tag arranged at a topmost level, and a child and/or sibling tag as the next level node in the hierarchy tree.
7 . The computer system according to claim 1 , wherein the changed feature is selected from a group comprising functions, global variables, structures, common macros, inline functions, static variables, and/or a combination thereof, that is changed, newly introduced, or updated per feature as compared to the feature from the code sets.
8 . The computer system according to claim 1 , wherein the DFM tag follows a rule wherein a corresponding ‘end’ DFM tag is matched with a ‘start’ DFM tag of each feature.
9 . The computer system according to claim 1 , wherein the computer system is further caused to perform an operation of loading the differential binary file(s) to a memory and mapping the differential binary file(s) to executing binary.
10 . A method for creating and managing at least one executable differential binary file, the method comprising:
parsing at least one computer program source code having at least one dynamic feature manager (DFM) tag; creating a plurality of code sets based on the DFM tags, wherein the code sets comprise a first code set having the base code and at least one second code set having the base code and a feature, wherein the base code is the at least one computer program source code without any DFM tag, and wherein the feature is a set of code; generating one or more feature change tables, wherein the feature change tables store the information about a changed feature compared to the feature from the code sets; stripping the DFM tag from the computer program source code to produce a base code, wherein the DFM tag is used to indicate that the feature is enclosed from the at least one computer program source code; compiling the code sets for generating a plurality of binaries; determining a difference between any two of the binaries using the feature change tables; and creating a differential binary file(s) of the one or more executable differential binary files based on the difference determined.
11 . The method according to claim 10 , wherein the DFM tag follows syntax as DFM_<the feature name>_start and DFM_<the feature name>_end to enclose the feature.
12 . The method according to claim 10 , wherein the DFM tag is added while writing the computer program source code.
13 . The method according to claim 10 , wherein the DFM tag is added while adding or updating new code to the computer program source code.
14 . The method according to claim 10 , wherein the feature is selected from a group comprising a function, a global variables and structures, a common macros, an inline function, a static variable, and a combination thereof.
15 . The method according to claim 10 , wherein parsing the at least one computer program source code having the at least one DFM tag comprises parsing at least one computer program source code having at least one DFM tag to check for a nesting of the DFM tag and to create a hierarchy tree of the computer program source code, wherein the hierarchy tree comprises a DFM unrelated tag arranged at a topmost level, and a child and/or sibling tag as the next level node in the hierarchy tree.
16 . The method according to claim 11 , wherein the changed feature is selected from a group comprising functions, global variables, structures, common macros, inline functions, static variables, and/or a combination thereof, that is changed, newly introduced, or updated per feature as compared to the feature from the code sets.
17 . The method according to claim 10 , wherein the DFM tag follows a rule wherein a corresponding ‘end’ DFM tag is matched with a ‘start’ DFM tag of each feature.
18 . The method according to claim 10 , wherein the computer system is further caused to perform an operation of loading the differential binary file(s) to a memory and mapping the differential binary file(s) to executing binary.Join the waitlist — get patent alerts
Track US2015339119A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.