Patent US5689702A successfully refreshed from Google Patents.
US5689702A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Flexible data structure layout for data structure including bit-field data members
Assignee: Mentor Graphics Corp
•
Filing: 1995-06-07
•
Granted: 1997-11-18
•
Expires: 2015-06-07
Abstract
Abstract The invention produces data structure layout in a flexible manner that enables the data structures of a computer program to be layed out in a manner that conforms to constraints imposed by a particular computer system on which the program is implemented and that enables the produced data structure layout to be used with different computer systems having different constraints. Thus, the invention is particularly useful with systems that require close control of data structure layout and that have unique requirements for that layout. Embedded real-time systems, which are often implemented on hardware which is designed and optimized for a particular application, are one example of the type of system with which the invention can advantageously be used. The invention additionally allows a user to specify various parameters that control aspects of the manner in which data structure layout is achieved and, therefore, certain characteristics of the data structure layout. The parameters can be specified to achieve a data layout that provides a desired combination of program execution speed and required memory capacity.
Inventors
- 👤 Gopi Kumar Bulusu
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 20:05
CPC Classifications
G; G06; G06F; G06F8/00; G06F8/40; G06F8/41; G06F8/43; G06F8/436; G06F8/437; G06F8/44; G06F8/447; Y; Y10; Y10S; Y10S707/00; Y10S707/99941; Y10S707/99942; Y10S707/99943; Y10S707/99944; Y10S707/99945
Claims Analysis
Total Claims: 4
Claim 1
Independent Claim
172 words
A method for laying out data members of a data structure, the data members including bit-field data members, the method comprising the steps of: accepting as input i) an identifier of each data member, ii) a data type for each data member, and iii) a data type size for each data member; accepting as input the value of a parameter specified by a user, the parameter indicating, if the structure is an unpacked structure, an increment that defines where a new allocation unit for a bit-field data member will start relative to the allocation unit for the previous data member, the increment being equal to the bit-field alignment requirement; sequentially determining a member offset for each of the data members, wherein: the determination of the member offset of each data member is dependent upon whether the data member is a bit-field data member or not; and the determination of one or more of the member offsets is dependent upon the value of the parameter; and determining a size of the data structure.
Claim 2
Independent Claim
172 words
A method for laying out data members of a data structure, the data members including bit-field data members, the method comprising the steps of: accepting as input i) an identifier of each data member, ii) a data type for each data member, and iii) a data type size for each data member; accepting as input the value of a parameter specified by a user, the parameter indicating, if the structure is an unpacked structure, an increment that defines where a new allocation unit for a bit-field data member will start relative to the allocation unit for the previous data member, the increment being equal to the bit-field alignment requirement; sequentially determining a member offset for each of the data members, wherein: the determination of the member offset of each data member is dependent upon whether the data member is a bit-field data member or not; and the determination of one or more of the member offsets is dependent upon the value of the parameter; and determining a size of the data structure.
Claim 3
Independent Claim
175 words
A method for laying out data members of a data structure, the data members including bit-field data members, the method comprising the steps of: accepting as input i) an identifier of each data member, ii) a data type for each data member, and iii) a data type size for each data member; accepting as input the value of a parameter specified by a user, the parameter indicating, if the structure is an unpacked structure, an increment that defines where a new allocation unit for a bit-field data member will start relative to the allocation unit for the previous data member, the increment being equal to the size of the previous allocation unit; sequentially determining a member offset for each of the data members, wherein: the determination of the member offset of each data member is dependent upon whether the data member is a bit-field data member or not; and the determination of one or more of the member offsets is dependent upon the value of the parameter; and determining a size of the data structure.
Claim 4
Independent Claim
175 words
A method for laying out data members of a data structure, the data members including bit-field data members, the method comprising the steps of: accepting as input i) an identifier of each data member, ii) a data type for each data member, and iii) a data type size for each data member; accepting as input the value of a parameter specified by a user, the parameter indicating, if the structure is an unpacked structure, an increment that defines where a new allocation unit for a bit-field data member will start relative to the allocation unit for the previous data member, the increment being equal to the size of the previous allocation unit; sequentially determining a member offset for each of the data members, wherein: the determination of the member offset of each data member is dependent upon whether the data member is a bit-field data member or not; and the determination of one or more of the member offsets is dependent upon the value of the parameter; and determining a size of the data structure.
References Cited (Backward Citations)
US4366537A
Cited
US4430705A
Cited
US4499539A
Cited
US4882642A
Cited
US4994998A
Cited
US5504891A
Cited
US5506985A
Cited
US5418963A
Cited
US5487165A
Cited
US5596736A
Cited
US5535369A
Cited
US5546575A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-11-17 | 2001-05-19 | 2001-11-18 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-11-17 | 2005-05-19 | 2005-11-18 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-11-17 | 2009-05-19 | 2009-11-18 | $7700.00 | Window Closed / Lapsed |