1. An apparatus, comprising:
a store queue comprising a plurality of entries configured to store information associated with store instructions, wherein a respective entry is configured to store a first portion of information associated with a page crossing store instruction; and
at least one buffer configured to store a second portion of information associated with the page crossing store instruction.
2. The apparatus of claim 1, wherein the page crossing store instruction, when executed, writes first data to a first memory page and second data to a second memory page.
3. The apparatus of claim 2, wherein an entry in the store queue storing the first portion of information associated with the page crossing instruction comprises information indicating a first physical address in the first memory page and said at least one buffer storing the second portion of information associated with the page crossing instruction comprises information indicating a second physical address in the second memory page.
4. The apparatus of claim 3, wherein the entry storing the first portion of information associated with the page crossing store instruction comprises information indicating that the entry stores a page crossing store instruction.
5. The apparatus of claim 4, wherein the entry storing the first portion of information associated with the page crossing store instruction comprises information associating the entry with said at least one buffer.
6. The apparatus of claim 1, comprising logic configured to determine whether store instructions are page crossing store instructions.
7. The apparatus of claim 6, wherein said logic is configured to determine whether at least one page crossing store instruction is eligible to use said at least one buffer to store information associated with the second portion of the page crossing store instruction.
8. The apparatus of claim 7, wherein said logic is configured to determine whether said at least one page crossing store instruction is an oldest store instruction in the store queue.
9. A method, comprising:
storing a first portion of information associated with a store instruction in a store queue; and
storing a second portion of a second portion of information associated with the store instruction in at least one buffer when the store instruction is a page crossing store instruction.
10. The method of claim 9, wherein the page crossing store instruction, when executed, writes first data to a first memory page and second data to a second memory page.
11. The method of claim 10, wherein storing the first portion of information associated with the page crossing instruction comprises storing information indicating a first physical address in the first memory page, and wherein storing the second portion of information associated with the page crossing instruction comprises storing information indicating a second physical address in the second memory page.
12. The method of claim 11, wherein storing the first portion of information associated with the page crossing store instruction comprises storing information indicating that the entry stores a page crossing store instruction.
13. The method of claim 12, wherein storing the first portion of information associated with the page crossing store instruction comprises storing information associating the entry with said at least one buffer.
14. The method of claim 13, comprising determining whether the page crossing store instruction is eligible to use said at least one buffer to store information associated with the second portion of the page crossing store instruction.
15. The method of claim 14, wherein determining whether the page crossing store instruction is eligible to use said at least one buffer comprises determining that the page crossing store instruction is eligible to use said at least one buffer in response to determining that the page crossing store instruction is the oldest store instruction in the store queue.
16. The method of claim 15, wherein determining whether the page crossing store instruction is eligible to use said at least one buffer comprises replaying the page crossing store instruction in response to determining that the page crossing store instruction is not the oldest store instruction in the store queue.
17. A non-transitory computer readable media including instructions that when executed can configure a manufacturing process used to manufacture a semiconductor device comprising:
a store queue comprising a plurality of entries configured to store information associated with store instructions, wherein a respective entry is configured to store a first portion of information associated with a page crossing store instruction; and
at least one buffer configured to store a second portion of information associated with the page crossing store instruction.
18. The non-transitory computer readable media set forth in claim 17, further comprising instructions that when executed can configure the manufacturing process used in manufacturing the semiconductor device comprising logic configured to determine whether store instructions are page crossing store instructions.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
What is claimed is:
1. A method of recording information on an information medium which has a data area for recording stream data using stream packets each of which includes an application packet area containing one or more application packets with time stamps, and a management area for recording management information that pertains to the stream data, said method comprising:
distributing the stream data to the application packet areas in the stream packets so that the distributed stream data are recorded in the application packet areas,
wherein information recording is performed such that a start portion of the application packet area included in a first one of the stream packets of the stream data matches a first byte of the time stamp appended to a first one of the application packets in the application packet area.
2. A method of recording information on an information medium which has a data area for recording stream data using stream packs each of which includes an application packet area having one or more application packets with time stamps, and a management area for recording management information that pertains to the stream data, said method comprising:
distributing the stream data to the application packet areas in the stream packs so that the distributed stream data are recorded in the application packet areas; and
when a blank portion is present at an end of the application packet area, providing a stuffing area formed of a predetermined number of bytes in the blank portion.
3. A method of recording information on an information medium which has a data area for recording stream data using stream packs each of which includes an application packet area having one or more application packets with time stamps, and a management area for recording management information that pertains to the stream data, said method comprising:
distributing the stream data to the application packet areas in the stream packs, and recording the distributed stream data in the application packet areas; and
as a result of recording the distributed stream data, if a blank portion of one or more of the stream packs appears between an end of a last one of the stream packs that actually contains the stream data, and an end of the data area for recording the stream data, then recording a stuffing packet in the blank portion.
4. An information recording method using an information medium which has a data area for recording stream data using data packets and data units each being larger than the data packet, and a management area for recording management information that pertains to the stream data, said method comprising:
constituting the stream data by a plurality of the data units;
constituting each of the data units by one or more data packets each of which records predetermined time stamp information; and
recording, in the management area, at least a time difference value corresponding to a difference between a first time stamp recorded in a first data unit and a second time stamp recorded in a second data unit, said first and second data units being included in a plurality of said data units.
5. A method according to claim 4, wherein the time difference value is determined by rounding to a predetermined number of effective digits a difference between a time information value corresponding to the second time stamp and a time information value corresponding to the first time stamp.
6. A method according to claim 4, wherein a value of a first time stamp recorded in a first one of the data packets located in the data unit is used to compute the time difference value.
7. A method according to claim 4, wherein a time stamp recorded in the data packet at an end of a last one of the data units included in the stream data indicates an arrival time of a last one of the data packets in the last data unit, and the arrival time of the last data packet is used to compute the time difference value.
8. An information recording method using an information medium which has a data area for recording stream data using data packets and data units each being larger than the data packet, and a management area for recording management information that pertains to the stream data, said method comprising:
recording information of one or more cells in the stream data;
recording, in the management area, program chain information that describes a set of one or more of the cells; and
recording, in the management area, information of an entry point which can be used as a marker of a skip position upon partially skipping recorded contents of the stream data in playback.
9. A method according to claim 8, wherein the management area includes stream object general information which includes at least one of recording time information of the stream data, a data packet arrival time of a start portion of the stream data, and a data packet arrival time of an end portion of the stream data.
10. A data structure which has a data area for recording stream data using predetermined data recording units, and a management area for recording management information that pertains to the stream data, wherein
a plurality of stream packs, each of which contains one or more of the data recording units with time stamps, are provided, and the stream data are distributed to these stream packs,
each of the stream packs contains a pack header and a stream packet, and
a start portion of an application packet area included in a first one of the stream packets of the stream data matches a start byte of the time stamp appended to a first one of the data recording units in the application packet area.
11. A data structure according to claim 10, wherein the stream packet includes a stuffing byte of a variable length including zero byte length, and the application packet area including one or more of the data recording units with time stamps.
12. A data structure which has a data area for recording stream data using data packets and data units each being larger than the data packet, and a management area for recording management information that pertains to the stream data, wherein
the stream data are distributed to application packet areas each including one or more of the data packets, and
when a blank portion is present at an end of the application packet area, a stuffing area formed of a predetermined number of bytes is provided in the blank portion.
13. A data structure according to claim 12, wherein if a blank portion of one or more stream packs appears between an end of a last one of the stream packs that actually contains the stream data, and an end of the data area for recording the stream data, then a stuffing packet is recorded as padding data in the blank portion.
14. A data structure which has a data area for recording stream data using data packets and data units each being larger than the data packet, and a management area for recording management information that pertains to the stream data, wherein
the stream data includes a plurality of the data units,
each of the data unit includes one or more of the data packets each recording time stamp information, and
a time difference value corresponding to a difference between a first time stamp recorded in a first data unit and a second time stamp recorded in a second data is recorded in the management area, said first and second data units being included in said data units.
15. A data structure according to claim 14, wherein the time difference value is determined by rounding to a predetermined number of effective digits a difference between a time information value corresponding to the second time stamp and a time information value corresponding to the first time stamp.
16. A data structure according to claim 14, wherein a value of a first time stamp recorded in a first one of the data packets located in the data unit is used to compute the time difference value.
17. A data structure according to claim 14, wherein a time stamp recorded in the data packet at an end of a last one of the data units included in the stream data indicates an arrival time of a last one of the data packets in the last data unit, and the arrival time of the last data packet is used to compute the time difference value.
18. A data structure which has a data area for recording stream data using a data packet and a data unit larger than the data packet, and a management area for recording management information that pertains to the stream data, wherein
one or more pieces of cell information are recorded in the stream data,
information of a program chain that describes a set of one or more cells is recorded in the management area, and
the management information includes information of an entry point which can be used as a marker of a skip position upon partially skipping recorded contents of the stream data in playback.
19. A data structure according to claim 18, wherein the management area includes stream object general information which includes at least one of recording time information of the stream data, a data packet arrival time of a start portion of the stream data, and a data packet arrival time of an end portion of the stream data.