Invention Grant
- Patent Title: Storing the most significant and the least significant bytes of characters at non-contiguous addresses
-
Application No.: US12861863Application Date: 2010-08-24
-
Publication No.: US08402221B2Publication Date: 2013-03-19
- Inventor: Jeremy A. Arnold , Scott A. Moore , Gregory A. Olson , Eric J. Stec
- Applicant: Jeremy A. Arnold , Scott A. Moore , Gregory A. Olson , Eric J. Stec
- Applicant Address: US NY Armonk
- Assignee: International Business Machines Corporation
- Current Assignee: International Business Machines Corporation
- Current Assignee Address: US NY Armonk
- Agent Owen J. Gamon
- Main IPC: G06F13/00
- IPC: G06F13/00 ; G06F13/28

Abstract:
In an embodiment, an indicator is set to indicate that all of a plurality of most significant bytes of characters in a character array are zero. A first index and an input character are received. The input character comprises a first most significant byte and a first least significant byte. The first most significant byte is stored at a first storage location and the first least significant byte is stored at a second storage location, wherein the first storage location and the second storage location have non-contiguous addresses. If the first most significant byte does not equal zero, the indicator is set to indicate that at least one of a plurality of most significant bytes of the characters in the character array is non-zero. The character array comprises the first most significant byte and the first least significant byte.
Public/Granted literature
- US20120054435A1 STORING THE MOST SIGNIFICANT AND THE LEAST SIGNIFICANT BYTES OF CHARACTERS AT NON-CONTIGUOUS ADDRESSES Public/Granted day:2012-03-01
Information query