Function binding method and system
View Patent ↗The present invention provides a process for generating a shared function binding arrangement comprising a first module and a shared module which includes a plurality of functions and having means for binding a function shared between the first module and the shared module. The process comprises a linking phase for creating the first module and the shared module, a preparation phase for preparing the first module for calling the shared module without exposing details of the call, and a loading phase for loading the modules and linking the first module to a respective function in the shared module without exposing details of the call. The invention also provides a method and system for binding a function shared between a first module and a shared module by means of a linking arrangement a linking arrangement that enables the first module to call a respective function in the shared module without exposing details of the call.
1. A computer-implemented method comprising:
calling a shared module from a first module for a respective function, concealing details of the call for the respective function, said concealing comprising:
encrypting and embedding marker information in the shared module, wherein the marker information identifies functions including the respective function in the shared module through a shared function table, and wherein the marker information is embedded prior to run time; and
using a respective function proxy in the first module to call a common function pointer in the first module, which makes a call to a general call address in the shared module with an address for a respective dynamic object which knows the address of the respective function: and
linking the first module to the respective function in the shared module.
2. A computer-implemented method according to claim 1 in which linking the first module comprises forming an indirect routing link in the first module between an input carrying a request for the respective function and an output carrying the call to the shared module.
3. A computer-implemented method according to claim 1 in which linking the first module comprises forming an indirect routing link in the shared module between an input carrying the call from the first module and an address for the respective function.
4. A computer-implemented method according to claim 2 in which forming an indirect routing link comprises providing function proxies in the first module.
5. A computer-implemented method according to claim 4 in which forming an indirect routing link comprises using a respective function proxy to access a respective address for a respective dynamic object in the shared module.
6. A computer-implemented method according to claim 3 in which forming an indirect routing link comprises providing a general call address in the shared module for indirectly locating the respective function.
7. A computer-implemented method according to claim 3 in which forming an indirect routing link comprises providing dynamic objects in the shared module including address information for locating the functions.
8. A computer-implemented method according to claim 7 in which forming an indirect routing link comprises using a respective dynamic object in the shared module for locating the respective function.
9. A computer-implemented method according to claim 7 further comprising encrypting the address information.
10. A computer-implemented method according to claim 1 in which linking the first module comprises providing a common function pointer in the first module for locating a general call address in the shared module.
11. A computer-implemented method according to claim 1 in which linking the first module comprises using a dynamic object address in the first module for locating a dynamic object in the shared module.
12. A computer-implemented process comprising:
creating a first module and a shared module, preparing the first module for calling the shared module;
concealing details of a particular call for a respective function, said concealing comprising:
encrypting and embedding marker information in the shared module, wherein the marker information identifies functions including the respective function in the shared module through a shared function table, and wherein the marker information is embedded prior to run time; and
using a respective function proxy in the first module to call a common function pointer in the first module, which makes a call to a general call address in the shared module with an address for a respective dynamic object which knows the address of the respective function; and
loading the first and the shared modules and linking the first module to the respective function in the shared module.
13. A computer-implemented process according to claim 12 in which creating the first module and the shared module comprises generating a first module including a secure library containing information for subsequently locating the functions.
14. A computer-implemented process according to claim 13 in which the secure library comprises markers for locating functions by way of identifiers.
15. A computer-implemented process according to claim 13 in which the secure library comprises function proxies.
16. A computer-implemented process according to claim 12 in which creating the first module and the shared module comprises generating the shared module including the plurality of functions and a shared function table associating identifiers with the functions.
17. A computer-implemented process according to claim 12 in which preparing the first module comprises extracting marker information from the first module and embedding the marker information in the shared module.
18. A computer-implemented process according to claim 17 in which preparing the first module comprises clearing the marker information from the first module.
19. A computer-implemented process according to claim 12 in which the loading phase comprises loading the first module.
20. A computer-implemented process according to claim 19 in which loading comprises loading the shared module on an instruction from the first module.
21. A computer-implemented process according to claim 12 in which loading comprises creating within the shared module dynamic objects including address information for locating the functions.
22. A computer-implemented process according to claim 12 in which loading comprises patching into the first module the common function pointer.
23. A computer-implemented process according to claim 21 in which loading comprises patching into the first module addresses for the dynamic objects.
24. A computer-implemented process according to claim 21 comprising encrypting the address information.
25. A system comprising:
a processor;
a first module;
a shared module including a plurality of functions, and
a linking arrangement that enables the first module to call a respective function in the shared module, the linking arrangement enabling concealing details of the call, said concealing comprising:
encrypting and embedding marker information in the shared module, wherein the marker information identifies functions in the shared module through a shared function table, and wherein the marker information is embedded prior to run time; and
using a respective function proxy in the first module to call a common function pointer in the first module, which makes a call to a general call address in the shared module with an address for a respective dynamic object which knows the address of the respective function.
26. A system according to claim 25 in which the linking arrangement comprises an indirect routing link in the first module between an input for carrying a request for the respective function and an output for carrying a call to the shared module.
27. A system according to claim 25 in which the linking arrangement comprises an indirect routing link in the shared module between an input for carrying a call from the first module and an address for the respective function.
28. A system according to claim 26 in which the indirect routing link comprises a common function pointer in the first module for locating a general call address in the shared module.
29. A system according to claim 26 in which the indirect routing link comprises a respective dynamic object address in the first module for a respective dynamic object in the shared module.
30. A system according to claim 29 in which the indirect routing link comprises a respective function proxy in the first module for routing to the respective dynamic object address.
31. A system according to claim 27 in which the address information is encrypted.