System for exchanging binary data

• US 7,158,984 B2
• Filed: 02/03/2003
• Issued: 01/02/2007
• Est. Priority Date: 02/01/2002
• Status: Active Grant

• Current Assignee: John Fairweather
• Original Assignee: John Fairweather
• Inventors: Fairweather, John
• Primary Examiner(s): Robinson; Greta
• Assistant Examiner(s): Lewis; Cheryl
• Application Number:
  US10/357,325
• Publication Number:
  US 20040073913A1
• Time in Patent Office: 1,429 Days
• Field of Search: 707/100, 707/104.1, 707/1, 707/200, 709/203, 719/328, 717/103, 717/106, 717/108, 717/121
• US Class Current: 707/793
• CPC Class Codes: G06F 8/427 Parsing
• CPC Class Codes: G06F 9/4493 Object persistence
• CPC Class Codes: G06K 13/0825 the ejection arrangement being of the push-push kind
• CPC Class Codes: Y10S 707/913 Multimedia
• CPC Class Codes: Y10S 707/966 Distributed
• CPC Class Codes: Y10S 707/99931 Database or file accessing
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation

Abstract

A strongly-typed, distributed, run-time system capable of describing and manipulating arbitrarily complex, non-flat, binary data derived from type descriptions in a standard (or slightly extended) programming language, including handling of type inheritance. The system is composed of four primary components. First, a plurality of databases having binary type and field descriptions. Second, a run-time modifiable type compiler that is capable of generating type databases either via explicit API calls or by compilation of unmodified header files or individual type definitions in a standard programming language. Third, a complete API suite for access to type information as well as full support for reading and writing types, type relationships and inheritance, and type fields, given knowledge of the unique numeric type ID and the field name/path. Finally, a hashing process for converting type names to unique type IDs (which may also incorporate a number of logical flags relating to the nature of the type). Further extensions and improvements are also provided as described herein.

Claims

1. A system for describing and manipulating arbitrarily complex non-flat binary data, said arbitrarily complex non-flat binary data containing references between distinct structures and derived from type descriptions, the system comprising:

a processor;

logically connected to said processor, one or more custom binary type and field description databases, wherein said one or more custom binary type and field description databases provide type descriptions and field descriptions, accessible at run-time, for the purposes of manipulating the arbitrarily complex non-flat binary data, wherein said one or more custom binary type and field description databases define the set of known binary type structures and structure fields derived by compilation or interpretation of type definitions expressed in a standard textual source code form as structure descriptions, together with an enumeration and definition of component fields of said structure descriptions, including one or more fields mediating inter-structure references;

logically connected to the processor, a compiler, wherein said compiler is capable of accessing said one or more custom binary type and field description databases at run-time and generating or modifying said one or more custom binary type and field description databases;

logically connected to said processor, an application program interface suite, wherein said application program interface suite provides full support for reading and writing information from said one or more custom binary type and field description databases; and

logically connected to said processor, a hashing process, wherein said hashing process converts type names to unique numeric type IDs.

2. The system of claim 1, wherein said processor comprises two or more processors.

3. The system of claim 2, wherein said two or more processors are distributed across a computer network.

4. The system of claim 1, wherein said one or more custom binary type and field description databases are represented by a flat data model, wherein said flat data model utilizes a memory type that creates both a handle as well as a reference to an item within said handle.

5. The system of claim 1, wherein said compiler is capable of generating said one or more custom binary type and field description databases using explicit application program interface calls provided by said application program interface suite.

6. The system of claim 1, wherein said compiler is capable of generating said one or more custom binary type and field description databases by compilation of unmodified header files.

7. The system of claim 1, wherein said compiler is capable of generating said one or more custom binary type and field description databases by compilation of individual type definitions.

8. The system of claim 1, wherein said compiler is based upon a parser, wherein said parser communicates with a resolver and has an application program interface permitting use of one or more plug-ins capable of interpreting embedded reverse-polish operators.

9. The system of claim 8, wherein said compiler is based upon a lexical analyzer having a first table describing single transitions, and a second table describing range transitions, and a first phase of analysis that utilizes said first table, and a second phase of analysis that utilizes said second table.

10. The system of claim 1, wherein the type descriptions stored in said one or more custom binary type and field description databases are described using the C programming language.

11. The system of claim 1, wherein said type descriptions and said field descriptions of said one or more custom binary type and field description databases have at least one of the following types of information associated with them:

descriptive text;

field units;

named executable scripts;

named annotation records;

custom display, edit, and other handler processes;

type-converter processes;

key words;

coloring and icons; and

data links to external server links and functions.

12. The system of claim 1, wherein said hashing process involves computing a cyclic redundancy check of said type names.

13. The system of claim 1, wherein said application program interface suite includes an ability to allocate, initialize, de-allocate, and cross-reference heap memory model structures of any given type, and access type relationships and inheritance, and type fields, given knowledge of said unique numeric type IDs and a field name/path.

14. The system of claim 1, wherein said application program interface suite includes the ability to allocate, initialize, de-allocate, and cross-reference flat data model structures of any given type.

15. The system of claim 1, wherein said application program interface suite includes the ability to automatically re-map the byte ordering and field packing of complex binary structures based on that utilized by an underlying processor architecture.

16. The system of claim 1, wherein said application program interface suite includes the ability to convert between an arbitrarily complex binary type and a corresponding textual description.

17. The system of claim 1, further comprising a system for creating a proxy type in place of a full type, wherein said proxy type contains a subset of the fields of said full type such that said proxy type is transparently interchangeable with said full type for a given application.

18. The system of claim 1 wherein any given field within a parent type can be assigned a unique field index that can be used interchangeably with a field name/path.

19. The system of claim 1 wherein said type IDs created by said hashing process further incorporate a number of logical flags relating to a nature of said type.