Late bound, transactional configuration system and methods

• US 9,298,847 B1
• Filed: 12/20/2013
• Issued: 03/29/2016
• Est. Priority Date: 12/20/2013
• Status: Active Grant

• Current Assignee: Emc IP Holding Company LLC (Dell Technologies Inc.)
• Original Assignee: EMC Corporation (Dell Technologies Inc.)
• Inventors: Rohde, Henning K.
• Primary Examiner(s): Beausoliel, Jr., Robert
• Assistant Examiner(s): Khakhar, Nirav K
• Application Number:
  US14/136,964
• Time in Patent Office: 830 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: G06F 16/90 Details of database functions independent of the retrieved data types
• CPC Class Codes: G06F 8/427 Parsing
• CPC Class Codes: G06F 9/44505 Configuring for program initiating, e.g. using registry, configuration files

Abstract

Systems and methods for configuring software systems help guarantee correctness while providing operational flexibility and minimal time to recover. A configuration system uses a un-typed syntax tree with transactional semantics layered under a set of late-bound semantic constraints. Configuration settings are defined in property flies which are parsed into a syntax tree during startup and which can be safely reloaded. Semantic constraints are dynamically specified by software components. The system maintains a transactional history to enable rollback and inspection.

Claims

1. A computer system, comprising:

a memory;

a plurality of configuration keys;

a semantic registry to store, in the memory, a plurality of semantic constraints, each of the plurality of semantic constraints associated with one of the plurality of configuration keys;

a syntax parser to receive text from a configuration source, to parse the text to generate a plurality of key definitions, each of the key definitions associated with one of the plurality of configuration keys and having a corresponding value;

a semantic validator to receive the plurality of key definitions and to validate each of the plurality of key definitions using ones of the plurality of semantic constraints associated with the same key as the key definition; and

a syntax history module to maintain an ordered list of commits in the memory, each commit having one or more committed key definitions; and

at least one application component configured to register semantic constraints with the semantic registry and to register key definitions with the syntax history module, wherein in response to parsing text received from a configuration source, the syntax history module appends an immutable commit to the end of the list of commits, and wherein in response to receiving key definitions registered from the at least one application component, the syntax history module mutates a first commit within the list of commits.

2. The system of claim 1 wherein at least one of the semantic constraints includes a data type and validating the plurality of key definitions comprises determining if at least one of the key definitions has a value compatible with the data type.

3. The system of claim 1 wherein validating the plurality of key definitions comprises determining of any two of the key definitions comprise the same key.

4. The system of claim 1 wherein each commit comprises a tree, each leaf of the tree generally corresponding to one of the plurality of key definitions.

5. The system of claim 4, the syntax history module further to merge commits by copying a portion of a first tree to a second tree.

6. The system of claim 1 further comprising an input/output (IO) module to read a property file, wherein the text is based upon the contents of the property file.

7. The computer system of claim 1 wherein the at least one application component can register semantic constraints with the semantic registry after the syntax parser parses text from the configuration source.

8. A method implemented in a computer system comprising a memory, the method comprising:

receiving, from an application component, a plurality of semantic constraints, each of the plurality of semantic constraints associated with one of a plurality of configuration keys;

storing the semantic constraints to the memory;

receiving text from a configuration source;

parsing the text to generate a plurality of first key definitions, each of the first key definitions associated with one or more configuration keys and having a corresponding value;

validating each of the first key definitions using ones of the plurality of semantic constraints associated with the same configuration keys as the key definition;

appending an immutable commit to the end of an ordered list of commits stored in the memory, the appended commit comprising the first key definitions;

receiving second key definitions from the application component; and

mutating a first commit within the ordered list of commits to store the second key definitions.

9. The method of claim 8 wherein receiving the text occurs before receiving the one or more semantic constraints.

10. The method of claim 8 wherein at least one of the semantic constraints includes a data type and validating the plurality of key definitions comprises determining if at least one of the key definitions has a value compatible with the data type.

11. The method of claim 8 wherein validating the plurality of key definitions comprises determining of any two of the key definitions comprise the same configuration key.

12. The method of claim 8 further comprising removing a commit from the end of the list of commits.

13. The method of claim 12 wherein each commit comprises a tree, each leaf of the tree generally corresponding to one of the plurality of key definitions.

14. The method of claim 13 wherein the ordered list includes a first commit and a second commit, the method further comprising merging commits by copying a portion of the first commit tree to the second commit tree, the portion of the tree corresponding to one or more key definitions in the first commit.

15. The method of claim 14 wherein each of the plurality of key definitions is either an explicit key definition or a default key definition, and an explicit key definition in the first commit is copied to the second commit tree only if the second commit does not include a corresponding explicit key definition.

16. The method of claim 14 wherein each of the plurality of key definitions is either an explicit key definition or a default key definition, and a default key definition in the first commit is copied to the second commit tree only if the second commit does not include a corresponding key definition.

17. The method of claim 8 further comprising reading a property file, wherein the text is based upon the contents of the property file.

18. A computer program product tangibly embodied in a non-transitory computer-readable medium, the computer-readable medium storing program instructions that are executable to:

receive, from an application component, a plurality of semantic constraints, each of the plurality of semantic constraints associated with one of a plurality of configuration keys;

store the semantic constraints to a memory;

receive text from a configuration source;

parse the text to generate a plurality of first key definitions, each of the first key definitions associated with one or more configuration keys and having a corresponding value;

validate each of the first key definitions using ones of the plurality of semantic constraints associated with the same configuration keys as the key definition;

append an immutable commit to the end of an ordered list of commits stored in the memory, the appended commit comprising the first key definitions;

receive second key definitions from the application component; and

mutate a first commit within the ordered list of commits to store the second key definitions.