Granted Patent B2

US 12,189,759 · App. 17/465,694 · Granted Jan 7, 2025

Inventors: Matthias Neugschwandtner (Perchtoldsdorf, AT); Hugo Guiroux (Zurich, CH); Paul Elvinger (Zurich, CH)

Assignee: Oracle International Corporation

G06F21/54G06F2221/033

Abstract

Claims (77)

1. A computer-implemented method comprising:

identifying a plurality of function sets, among a plurality of functions of a particular application, one or more functions of each function set being associated with a common set of privilege dependencies including privileges granted for the one or more functions;

identifying one or more transition function calls in instructions for the particular application;

wherein a transition function call invokes a target function of a first function set, of the plurality of function sets, from within a caller function of a second function set of the plurality of function sets, the target function being associated with at least one granted privilege of the common set of privilege dependencies;

modifying the instructions for the particular application, to produce modified instructions, by replacing each transition function call, of the one or more transition function calls, with a wrapper function call that, when executed, causes a target function of said each transition function call to be executed by a separate thread with one or more privileges represented by a thread set of privilege dependencies associated with a function set that includes the target function, the thread set of privilege dependencies based on the at least one granted privilege; and

storing the modified instructions in memory or on disk;

wherein the method is performed by one or more computing devices.

2. The computer-implemented method of claim 1 , wherein:

said identifying the plurality of function sets is based, at least in part, on a fixed-point call graph comprising (a) a plurality of nodes representing the plurality of functions, and (b) one or more edges representing respective one or more function calls between the plurality of functions in the particular application;

wherein each node, of one or more nodes of the fixed-point call graph, is associated with a set of privilege dependencies that comprises any privilege dependencies for a function represented by said each node and any privilege dependencies for functions represented by any nodes that are reachable from said each node via edges of the fixed-point call graph;

wherein the one or more functions of each function set, of the plurality of function sets, are represented by one or more contiguous nodes in the fixed-point call graph.

3. The computer-implemented method of claim 2 , further comprising, prior to said identifying the plurality of function sets of the particular application:

performing iterative backward dataflow analysis on a preliminary call graph that comprises the plurality of nodes and the one or more edges;

wherein each node, of one or more nodes of the preliminary call graph, is associated with a preliminary set of privilege dependencies that comprises the any privilege dependencies for a function represented by said each node; and

generating the fixed-point call graph by associating each node, of one or more nodes in the preliminary call graph, with an associated set of privilege dependencies identified via the iterative backward dataflow analysis.

4. The computer-implemented method of claim 3 , further comprising:

prior to said identifying the plurality of function sets of the particular application:

identifying one or more transition edges of the fixed-point call graph;

wherein each transition edge, of the one or more transition edges, connects nodes associated with different sets of privileges;

wherein at least one function set, of the plurality of function sets, comprises multiple functions; and

wherein functions of any function set, of the plurality of function sets, comprising the multiple functions are connected by non-transition edges in the fixed-point call graph.

5. The computer-implemented method of claim 1 , further comprising:

executing the modified instructions to cause a first thread executing a first function that includes a particular wrapper function call, which replaced a particular transition function call to a particular function, to execute a particular wrapper function called by the particular wrapper function call, where the particular wrapper function call is one of the wrapper function call that replaced one of the each transition function call;

wherein the particular wrapper function shifts control to a second thread for execution of the particular function;

wherein the second thread is associated with a different set of privileges than the first thread.

6. The computer-implemented method of claim 5 , wherein prior to shifting control to the second thread, the particular wrapper function spawns the second thread and associates the second thread with the different set of privileges.

7. The computer-implemented method of claim 5 , wherein the second thread is initialized prior to executing the particular wrapper function.

8. The computer-implemented method of claim 7 , wherein the second thread is selected to run the particular function based on the second thread being associated with a set of privileges identified by a set of privilege dependencies associated with the particular function.

9. The computer-implemented method of claim 7 , wherein:

the second thread is selected to run the particular function based on the second thread being associated with a superset of a set of privileges identified by a set of privilege dependencies associated with the particular function;

the superset comprises one or more privileges not identified by the set of privilege dependencies associated with the particular function; and

the method further comprises, prior to the second thread executing the particular function, disassociating the second thread from the one or more privileges.

10. The computer-implemented method of claim 1 , further comprising:

receiving a request to modify the instructions for the particular application;

wherein said modifying the instructions is performed in response to receiving the request; and

returning the modified instructions as a response to the request.

11. The computer-implemented method of claim 1 , wherein:

each of one or more function sets, of the plurality of function sets, includes at least one function of a corresponding function set that is associated with one or more different privilege dependencies than other functions in said corresponding function set;

the common set of privilege dependencies for each function set, of the one or more function sets, comprises a superset of privilege dependencies for the functions of said each function set.

12. One or more non-transitory computer-readable media storing one or more sequences of instructions that, when executed by one or more processors, cause:

identifying a plurality of function sets, among a plurality of functions of a particular application, one or more functions of each function set being associated with a common set of privilege dependencies including privileges granted for the one or more functions;

identifying one or more transition function calls in instructions for the particular application;

wherein a transition function call invokes a target function of a first function set, of the plurality of function sets, from within a caller function of a second function set of the plurality of function sets, the target function being associated with at least one granted privilege of the common set of privilege dependencies;

modifying the instructions for the particular application, to produce modified instructions, by replacing each transition function call, of the one or more transition function calls, with a wrapper function call that, when executed, causes a target function of said each transition function call to be executed by a separate thread with one or more privileges represented by a thread set of privilege dependencies associated with a function set that includes the target function, the thread set of privilege dependencies based on the at least one granted privilege; and

storing the modified instructions in memory or on disk.

13. The one or more non-transitory computer-readable media of claim 12 , wherein:

said identifying the plurality of function sets is based, at least in part, on a fixed-point call graph comprising (a) a plurality of nodes representing the plurality of functions, and (b) one or more edges representing respective one or more function calls between the plurality of functions in the particular application;

wherein each node, of one or more nodes of the fixed-point call graph, is associated with a set of privilege dependencies that comprises any privilege dependencies for a function represented by said each node and any privilege dependencies for functions represented by any nodes that are reachable from said each node via edges of the fixed-point call graph;

wherein the one or more functions of each function set, of the plurality of function sets, are represented by one or more contiguous nodes in the fixed-point call graph.

14. The one or more non-transitory computer-readable media of claim 13 , wherein the one or more sequences of instructions, when executed by one or more processors, cause, prior to said identifying the plurality of function sets of the particular application:

performing iterative backward dataflow analysis on a preliminary call graph that comprises the plurality of nodes and the one or more edges;

wherein each node, of one or more nodes of the preliminary call graph, is associated with a preliminary set of privilege dependencies that comprises the any privilege dependencies for a function represented by said each node; and

generating the fixed-point call graph by associating each node, of one or more nodes in the preliminary call graph, with an associated set of privilege dependencies identified via the iterative backward dataflow analysis.

15. The one or more non-transitory computer-readable media of claim 14 , wherein the one or more sequences of instructions, when executed by one or more processors, cause:

prior to said identifying the plurality of function sets of the particular application:

identifying one or more transition edges of the fixed-point call graph;

wherein each transition edge, of the one or more transition edges, connects nodes associated with different sets of privileges;

wherein at least one function set, of the plurality of function sets, comprises multiple functions; and

wherein functions of any function set, of the plurality of function sets, comprising the multiple functions are connected by non-transition edges in the fixed-point call graph.

16. The one or more non-transitory computer-readable media of claim 12 , wherein the one or more sequences of instructions, when executed by one or more processors, cause:

executing the modified instructions to cause a first thread executing a first function that includes a particular wrapper function call, which replaced a particular transition function call to a particular function, to execute a particular wrapper function called by the particular wrapper function call, where the particular wrapper function call is one of the wrapper function call that replaced one of the each transition function call;

wherein the particular wrapper function shifts control to a second thread for execution of the particular function;

wherein the second thread is associated with a different set of privileges than the first thread.

17. The one or more non-transitory computer-readable media of claim 16 , wherein prior to shifting control to the second thread, the particular wrapper function spawns the second thread and associates the second thread with the different set of privileges.

18. The one or more non-transitory computer-readable media of claim 16 , wherein the second thread is initialized prior to executing the particular wrapper function.

19. The one or more non-transitory computer-readable media of claim 18 , wherein the second thread is selected to run the particular function based on the second thread being associated with a set of privileges identified by a set of privilege dependencies associated with the particular function.

20. The one or more non-transitory computer-readable media of claim 18 , wherein:

the second thread is selected to run the particular function based on the second thread being associated with a superset of a set of privileges identified by a set of privilege dependencies associated with the particular function;

the superset comprises one or more privileges not identified by the set of privilege dependencies associated with the particular function; and

the one or more sequences of instructions further comprise instructions that, when executed by one or more processors, cause, prior to the second thread executing the particular function, disassociating the second thread from the one or more privileges.

21. The one or more non-transitory computer-readable media of claim 12 , wherein the one or more sequences of instructions, when executed by one or more processors, cause:

receiving a request to modify the instructions for the particular application;

wherein said modifying the instructions is performed in response to receiving the request; and

returning the modified instructions as a response to the request.

22. The one or more non-transitory computer-readable media of claim 12 , wherein:

each of one or more function sets, of the plurality of function sets, includes at least one function of a corresponding function set that is associated with one or more different privilege dependencies than other functions in said corresponding function set;

the common set of privilege dependencies for each function set, of the one or more function sets, comprises a superset of privilege dependencies for the functions of said each function set.

Assignments (1)

Continuity (1)

References Cited (65)