Patent US5694150A successfully refreshed from Google Patents.
Patent US6207532B1 successfully refreshed from Google Patents.
US5867643A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Run-time data type description mechanism for performance information in an extensible computer system
Assignee: Apple Inc
•
Filing: 1995-11-06
•
Granted: 1999-02-02
•
Expires: 2015-11-06
Abstract
Abstract A run-time data type extension mechanism describes the kinds of performance information collected within a registry located in a main memory of a computer. The data type extension mechanism comprises a base node of a multi-linked tree data structure having associated therewith a buffer portion for storing the collected performance information and a description portion for describing that information. Writer entities specify the contents of these latter portions, i.e., the collected information and its description, at run time to provide an arrangement for dynamically extending the kinds of information collected at the registry.
Inventors
- 👤 Carl D. Sutton
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 23:27
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/30; G06F11/34; G06F11/3466; G06F2201/00; G06F2201/865; G06F2201/88
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
129 words
A run-time data type extension mechanism for describing the kinds of performance information collected within a registry located in a main memory of a computer, the data type extension mechanism comprising: a base node object of a multi-linked tree data structure stored in the memory, representative of a data item of performance information to be collected, and specifying whether information collection for the data item is enabled; a buffer element associated with said base node, for storing the collected performance information in the memory while information collection is enabled; and a description element further associated with said base node, for storing in the memory descriptive information regarding the collected performance information, wherein said base node object includes pointers to said buffer element and said description element in the memory.
Claim 2
Dependent Claim
129 words
A run-time data type extension mechanism for describing the kinds of performance information collected within a registry located in a main memory of a computer, the data type extension mechanism comprising: a base node object of a multi-linked tree data structure stored in the memory, representative of a data item of performance information to be collected, and specifying whether information collection for the data item is enabled; a buffer element associated with said base node, for storing the collected performance information in the memory while information collection is enabled; and a description element further associated with said base node, for storing in the memory descriptive information regarding the collected performance information, wherein said base node object includes pointers to said buffer element and said description element in the memory.
Claim 3
Dependent Claim
37 words
The run-time data type extension mechanism of claim 1 wherein writer entities specify the contents of said buffer and description elements at run time to enable dynamic extension of the kinds of information collected at the registry.
Claim 4
Dependent Claim
37 words
The run-time data type extension mechanism of claim 2 wherein the contents comprise values of the collected performance information stored in said buffer element and a description of the collected performance information values in said description element.
Claim 5
Dependent Claim
41 words
The run-time data extension mechanism of claim 1, wherein when said base node object indicates that information collection for the data item is enabled, a plurality of memory locations are allocated to said buffer element for storing the collected performance information.
Claim 6
Dependent Claim
21 words
The run-time data type extension mechanism of claim 1 wherein data collection presented by each node is independently enabled and disabled.
Claim 7
Dependent Claim
45 words
The run-time data type extension mechanism of claim 5 wherein the values of the collected performance information stored in the buffer element change as the performance information specified by the writer entities change, and wherein the abstract data type represented by the node remains constant.
Claim 8
Independent Claim
148 words
A method for describing the types of performance information collected within a registry located in a main memory of a computer, the method comprising the steps of: providing a base node object of a multi-linked tree data structure stored in the memory representative of a data item of performance information to be collected wherein said base object node also specifies whether collection of information associated with the data item is enabled or disabled; storing the collected performance information in a buffer element associated with said base node while information collection is enabled, said buffer element located in the memory; and describing the collected performance information in a description element further associated with said base node, said description element resident in memory at a location that is separate and distinct from said buffer element, wherein said base node object includes pointers to said buffer element and said description element.
Claim 9
Independent Claim
148 words
A method for describing the types of performance information collected within a registry located in a main memory of a computer, the method comprising the steps of: providing a base node object of a multi-linked tree data structure stored in the memory representative of a data item of performance information to be collected wherein said base object node also specifies whether collection of information associated with the data item is enabled or disabled; storing the collected performance information in a buffer element associated with said base node while information collection is enabled, said buffer element located in the memory; and describing the collected performance information in a description element further associated with said base node, said description element resident in memory at a location that is separate and distinct from said buffer element, wherein said base node object includes pointers to said buffer element and said description element.
Claim 10
Dependent Claim
57 words
The method of claim 7 further comprising the steps of: implementing the base node object as a first object in a class hierarchy having an abstract data type associated therewith for collecting the performance information; and extending the abstract data type associated with the first object by creating a second object from a subclass of the hierarchy.
Claim 11
Dependent Claim
37 words
The method of claim 8 wherein the step of extending further comprises the step of creating a user-defined abstract data type of said second object comprising a plurality of primitive data types for collecting statistics performance information.
Claim 12
Dependent Claim
30 words
The method of claim 9 wherein the step of creating further comprises the step of grouping the statistics collected by the primitive data types together as a magnitude data type.
Claim 13
Dependent Claim
37 words
The run time data type extension mechanism of claim 4, wherein when said base node object indicates that information collection for the data item is disabled, said plurality of memory locations are unallocated from said buffer element.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-02-01 | 2002-08-03 | 2003-02-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-02-01 | 2006-08-03 | 2007-02-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-02-01 | 2010-08-03 | 2011-02-02 | $7700.00 | Window Closed / Lapsed |