Optimization of Meta-Template Instantiations

• US 20150186122A1
• Filed: 12/01/2014
• Published: 07/02/2015
• Est. Priority Date: 09/30/2009
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Perry, Sean Douglas
• Granted Patent: US 9,436,448 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 8/41 Compilation
• CPC Class Codes: G06F 8/443 Optimisation

Abstract

An illustrative embodiment provides a computer-implemented method for an alternate type system for optimizing the evaluation and use of meta-template instantiations. The computer-implemented method obtains a source code, instantiates an element of the source code to form an instantiated element and identifies a meta-template within the instantiated element to form an identified meta-template. The computer-implemented method creates an entry for the identified meta-template in a first data structure, wherein the entry comprises a set of mapped entries, creates an associated entry in a second data structure linked to the entry comprising the set of mapped entries, wherein the associated entry represents the set of mapped entries, and uses the associated entry of the second data structure in combination with the entry of the first data structure.

Claims

1. A computer program product comprising:

a computer readable storage medium; and

computer usable code stored on the computer readable storage medium, where, when executed by a processor, the computer usable code causes a computer to;

determine whether a template in a source code is a meta-template;

create a set of entries in a first data structure of an alternate type system, wherein each entry of the set of entries is to correspond to a separate recursive instantiation;

conduct an evaluation of the set of entries to generate a single entry in a second data structure of a regular type system, wherein the single entry is to correspond to a result of the evaluation; and

process the set of entries to resolve a problem.

2. The computer program product of claim 1, wherein, when executed by a processor, the computer usable code causes a computer to instantiate the source code to identify the template within the source code.

3. The computer program product of claim 1, wherein, when executed by a processor, the computer usable code causes a computer to generate an entry associated with the template in the second data structure independent of the evaluation when the template is not a meta-template.

4. The computer program product of claim 3, wherein a size of an entry and a number of entries of the set of entries are to be smaller relative to the entry associated with the template.

5. The computer program product of claim 1, wherein, when executed by a processor, the computer usable code causes a computer to:

create a graph in the alternate type system, wherein the graph is to include a node for each separate recursive instantiation that is to contain a value of a static data member, an enum, and a typedef; and

utilize the graph to generate the result.

6. The computer program product of claim 1, wherein, when executed by a processor, the computer usable code causes a computer to provide a link from the set of entries to the regular type system.

7. A method comprising:

determining whether a template in a source code is a meta-template;

creating a set of entries in a first data structure of an alternate type system, wherein each entry of the set of entries corresponds to a separate recursive instantiation;

conducting an evaluation of the set of entries to generate a single entry in a second data structure of a regular type system, wherein the single entry corresponds to a result of the evaluation; and

processing the set of entries to resolve a problem.

8. The method of claim 7, further including instantiating the source code to identify the template within the source code.

9. The method of claim 7, further including generating an entry associated with the template in the second data structure independent of the evaluation when the template is not a meta-template.

10. The method of claim 9, wherein a size of an entry and a number of entries of the set of entries are smaller relative to the entry associated with the template.

11. The method of claim 7, further including:

creating a graph in the alternate type system, wherein the graph includes a node for each separate recursive instantiation containing a value of a static data member, an enum, and a typedef; and

utilizing the graph to generate the result.

12. The method of claim 7, further including providing a link from the set of entries to the regular type system.

13. An apparatus comprising:

a template analyzer to determine whether a template in a source code is a meta-template;

a template mapper to;

create a set of entries in a first data structure of an alternate type system, wherein each entry of the set of entries is to correspond to a separate recursive instantiation; and

conduct an evaluation of the set of entries to generate a single entry in a second data structure of a regular type system, wherein the single entry is to correspond to a result of the evaluation; and

a processor to process the set of entries to resolve a problem.

14. The apparatus of claim 13, wherein the processor is to instantiate the source code to identify the template within the source code.

15. The apparatus of claim 13, wherein the processor is to generate an entry associated with the template in the second data structure independent of the evaluation when the template is not a meta-template.

16. The apparatus of claim 15, wherein a size of an entry and a number of entries of the set of entries are to be smaller relative to the entry associated with the template.

17. The apparatus of claim 13, wherein the template mapper is to:

create a graph in the alternate type system, wherein the graph is to include a node for each separate recursive instantiation that is to contain a value of a static data member, an enum, and a typedef; and

utilize the graph to generate the result.

18. The apparatus of claim 13, wherein, the template mapper is to to provide a link from the set of entries to the regular type system.