Instruction to compute the distance to a specified memory boundary

Patent metadata

Field	Value
Publication number	US-9710266-B2
Application number	US-201213421451-A
Country	US
Kind code	B2
Filing date	Mar 15, 2012
Priority date	Mar 15, 2012
Publication date	Jul 18, 2017
Grant date	Jul 18, 2017

Abstract

A Load Count to Block Boundary instruction is provided that provides a distance from a specified memory address to a specified memory boundary. The memory boundary is a boundary that is not to be crossed in loading data. The boundary may be specified a number of ways, including, but not limited to, a variable value in the instruction text, a fixed instruction text value encoded in the opcode, or a register based boundary; or it may be dynamically determined.

First claim

What is claimed is:

1. A computer program product for executing a machine instruction in a central processing unit, the computer program product comprising:
a non-transitory computer readable storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method comprising:
obtaining, by a processor, a machine instruction for execution, the machine instruction being defined for computer execution according to a computer architecture, the machine instruction comprising:
at least one opcode field to provide an opcode, the opcode identifying a Load Count to Block Boundary operation;
a register field to be used to designate a register, the register comprising a first operand; and
at least one field for indicating a location of a second operand, the second operand comprising at least a portion of a block of main memory; and

executing the machine instruction, the execution comprising:
determining a distance from the location of the second operand to a boundary of the block of main memory, wherein the location of the second operand is a starting address in memory from which data is to be counted, wherein the determining the distance comprises determining an ending address at which the counting is to stop, and wherein the determining the ending address comprises computing the ending address as follows:
ending address=minimum of (starting address+(boundary size−(starting address AND NOT boundary mask)), starting address+register size), wherein the boundary size is the boundary, boundary mask is equal to 0−boundary size, and register size is a length of a selected register; and

based on determining the distance, placing a value representing the determined distance in the first operand.

2. The computer program product of claim 1 , wherein the machine instruction further comprises a mask field, the mask field specifying the boundary.

3. The computer program product of claim 2 , wherein the block boundary is one boundary of a plurality of boundaries specifiable by the mask field.

4. The computer program product of claim 1 , wherein the executing further comprises dynamically determining the boundary, the dynamically determining using a specified type of boundary and one or more characteristics of the processor.

5. The computer program product of claim 1 , wherein the at least one field comprises a displacement field, a base field and an index field, the base field and index field for locating general registers having contents to be added to contents of the displacement field to form an address of the second operand, the address of the second operand providing the location of the second operand.

6. A computer system for executing a machine instruction in a central processing unit, the computer system comprising:
a memory; and
a processor in communications with the memory, wherein the computer system is configured to perform a method, the method comprising:
obtaining, by a processor, a machine instruction for execution, the machine instruction being defined for computer execution according to a computer architecture, the machine instruction comprising:
at least one opcode field to provide an opcode, the opcode identifying a Load Count to Block Boundary operation;
a register field to be used to designate a register, the register comprising a first operand; and
at least one field for indicating a location of a second operand, the second operand comprising at least a portion of a block of main memory; and

executing the machine instruction, the execution comprising:
determining a distance from the location of the second operand to a boundary of the block of main memory, wherein the location of the second operand is a starting address in memory from which data is to be counted, wherein the determining the distance comprises determining an ending address at which the counting is to stop, and wherein the determining the ending address comprises computing the ending address as follows:
ending address=minimum of (starting address+(boundary size−(starting address AND NOT boundary mask)), starting address+register size), wherein the boundary size is the boundary, boundary mask is equal to 0−boundary size, and register size is a length of a selected register; and

based on determining the distance, placing a value representing the determined distance in the first operand.

7. The computer system of claim 6 , wherein the machine instruction further comprises a mask field, the mask field specifying the boundary.

8. The computer system of claim 6 , wherein the executing further comprises dynamically determining the boundary, the dynamically determining using a specified type of boundary and one or more characteristics of the processor.

9. The computer program product of claim 1 , wherein the boundary is an end boundary of the block of main memory.

10. The computer system of claim 6 , wherein the boundary is an end boundary of the block of main memory.

Assignees

• Bradbury Jonathan D
• Gschwind Michael K
• Jacobi Christian
• Schwarz Eric M
• Slegel Timothy J
• IBM

Inventors

• Bradbury Jonathan D
• Gschwind Michael K
• Jacobi Christian
• Schwarz Eric M
• Slegel Timothy J

Classifications

• G06F9/30076

  to perform miscellaneous control operations, e.g. NOP · CPC title

• G06F9/355

  Indexed addressing · CPC title

• G06F9/3004

  to perform operations on memory · CPC title

• G06F9/3824

  Operand accessing · CPC title

• G06F9/3001

  Arithmetic instructions · CPC title