Abstract: In one general embodiment, a computer-implemented method includes identifying a data dump and a predefined data structure, parsing the predefined data structure to determine one or more identifiers within the predefined data structure, determining that a match exists between one or more elements of the data dump and the one or more determined identifiers of the predefined data structure, and formatting the data dump utilizing the predefined data structure, in response to the determining.

Abstract: A computer-implemented method according to one embodiment includes receiving a request to initialize a storage device, the request including a volume serial number associated with the storage device, identifying a size of the storage device, where the size is indicated within the request, determining a size of a table of contents and a location for the table of contents within the storage device, based on the identified size of the storage device, selecting a type of the table of contents from a plurality of different types, based on the identified size of the storage device, and automatically initializing the storage device, including creating the table of contents, reserving a physical area of the storage device for the table of contents using a physical extent, and inserting the table of contents into the storage device, where the table of contents has the determined size of the table of contents, the determined location for the table of contents, and the selected type of the table of contents.

Abstract: In one general embodiment, a computer-implemented method includes identifying a data dump and a predefined data structure, parsing the predefined data structure to determine one or more identifiers within the predefined data structure, determining that a match exists between one or more elements of the data dump and the one or more determined identifiers of the predefined data structure, and formatting the data dump utilizing the predefined data structure, in response to the determining.

Abstract: In one general embodiment, a computer-implemented method includes identifying a data dump and a predefined data structure, parsing the predefined data structure to determine one or more identifiers within the predefined data structure, determining that a match exists between one or more elements of the data dump and the one or more determined identifiers of the predefined data structure, and formatting the data dump utilizing the predefined data structure, in response to the determining.

Abstract: A computer-implemented method according to one embodiment includes receiving a request to initialize a storage device, the request including a volume serial number associated with the storage device, identifying a size of the storage device, where the size is indicated within the request, determining a size of a table of contents and a location for the table of contents within the storage device, based on the identified size of the storage device, selecting a type of the table of contents from a plurality of different types, based on the identified size of the storage device, and automatically initializing the storage device, including creating the table of contents, reserving a physical area of the storage device for the table of contents using a physical extent, and inserting the table of contents into the storage device, where the table of contents has the determined size of the table of contents, the determined location for the table of contents, and the selected type of the table of contents.

Abstract: A computer-implemented method according to one embodiment includes receiving a request to initialize a storage device, identifying a size of the storage device to be initialized, determining a size of a table of contents and a location for the table of contents within the storage device, based on the identified size of the storage device to be initialized, determining a type of the table of contents; and initializing the storage device, utilizing the determined size of the table of contents, the determined location for the table of contents, and the determined type of the table of contents.

Abstract: In one general embodiment, a computer-implemented method includes identifying a data dump and a predefined data structure, parsing the predefined data structure to determine one or more identifiers within the predefined data structure, determining that a match exists between one or more elements of the data dump and the one or more determined identifiers of the predefined data structure, and formatting the data dump utilizing the predefined data structure, in response to the determining.

Abstract: A computer-implemented method according to one embodiment includes receiving a request to initialize a storage device, identifying a size of the storage device to be initialized, determining a size of a table of contents and a location for the table of contents within the storage device, based on the identified size of the storage device to be initialized, determining a type of the table of contents; and initializing the storage device, utilizing the determined size of the table of contents, the determined location for the table of contents, and the determined type of the table of contents.

Abstract: In a processor having an instruction unit, a decode/issue unit, and execution queues configured to provide instructions to correspondingly different types execution units, a method comprises maintaining a duplicate free list for the execution queues. The duplicate free list includes a plurality of duplicate dependent instruction indicators that indicate when a duplicate instruction for a dependent instruction is stored in at least one of the execution queues. One of the duplicate dependent instruction indicators is assigned to an execution queue for a dependent instruction. The dependent instruction is executed only when the one of the duplicate dependent instruction indicators is reset.

Abstract: A data processing system comprises a processor unit that includes an instruction decode/issue unit including a re-order buffer having entries that include an execution queue tag that indicates an execution queue location of an instruction to which a re-order buffer entry is assigned, a result valid indicator to indicate that a corresponding instruction has executed with a status bit valid result, and a forward indicator to indicate that the status bit can be forwarded to an execution queue of an instruction pointed to that is waiting to receive the status bit.

Abstract: A data processing system comprises a processor unit that includes an instruction decode/issue unit including a re-order buffer having entries that include an execution queue tag that indicates an execution queue location of an instruction to which a re-order buffer entry is assigned, a result valid indicator to indicate that a corresponding instruction has executed with a status bit valid result, and a forward indicator to indicate that the status bit can be forwarded to an execution queue of an instruction pointed to that is waiting to receive the status bit.

Abstract: In a processor having an instruction unit, a decode/issue unit, and execution queues configured to provide instructions to correspondingly different types execution units, a method comprises maintaining a duplicate free list for the execution queues. The duplicate free list includes a plurality of duplicate dependent instruction indicators that indicate when a duplicate instruction for a dependent instruction is stored in at least one of the execution queues. One of the duplicate dependent instruction indicators is assigned to an execution queue for a dependent instruction. The dependent instruction is executed only when the one of the duplicate dependent instruction indicators is reset.

Abstract: A multiplier (42) forms a product from two signed operands without performing a sign extension of the multiplicand (A). A modified Booth's recoding of the multiplier operand (B) is begun immediately without being delayed by a sign extension operation. While recoding and partial product generation is occurring, a determination is made in parallel whether or not a sign extension adjustment term must be created. When needed, a value equal to (?B) (2N), where N is equal to a bit width of the multiplicand (A), is formed in parallel with the recoding and partial product generation. The sign extension adjustment term is coupled to a plurality of carry save adders (49, 51, 53) that compress a plurality of partial products to a sum term and a carry term. A final add stage combines the sum term and carry term to provide a product with correct sign extension.

Abstract: A multiplier (42) forms a product from two signed operands without performing a sign extension of the multiplicand (A). A modified Booth's recoding of the multiplier operand (B) is begun immediately without being delayed by a sign extension operation. While recoding and partial product generation is occurring, a determination is made in parallel whether or not a sign extension adjustment term must be created. When needed, a value equal to N (−B) (2N), where N is equal to a bit width of the multiplicand (A), is formed in parallel with the recoding and partial product generation. The sign extension adjustment term is coupled to a plurality of carry save adders (49, 51, 53) that compress a plurality of partial products to a sum term and a carry term. A final add stage combines the sum term and carry term to provide a product with correct sign extension.

Abstract: Within a data processing system implementing L1 and L2 caches and stream filters and buffers, prefetching of cache lines is performed in a progressive manner. In one mode, data may not be prefetched. In a second mode, two cache lines are prefetched wherein one line is prefetched into the L1 cache and the next line is prefetched into a stream buffer. In a third mode, more than two cache lines are prefetched at a time. In the third mode cache lines may be prefetched to the L1 cache and not the L2 cache, resulting in no inclusion between the L1 and L2 caches. A directory field entry provides an indication of whether or not a particular cache line in the L1 cache is also included in the L2 cache.

Abstract: Within a data processing system implementing L1 and L2 caches and stream filters and buffers, prefetching of cache lines is performed in a progressive manner. In one mode, data may not be prefetched. In a second mode, two cache lines are prefetched wherein one line is prefetched into the L1 cache and the next line is prefetched into a stream buffer. In a third mode, more than two cache lines are prefetched at a time. In the third mode cache lines may be prefetched to the L1 cache and not the L2 cache, resulting in no inclusion between the L1 and L2 caches.