Title: Theory / Unimportant / CS / Hardware / Intel / manual{ / Introduction
Tags: fromMath mathToDef mathToSee examplesSwitchExample1

Q: In illustrations of data structures in memory, smaller addresses appear toward the [...] of the figure.
A: bottom
Page: 5
Chapter: 1
Section: 3.1

Q: In illustrations of data structures in memory, higher addresses appear toward the [...] of the figure.
A: top
Page: 5
Chapter: 1
Section: 3.1

Name: Little endian representation
Definition: The bytes of a word are numbered starting from the least significant byte.
Page: 5
Chapter: 1
Section: 3.1

Name: Big endian representation
Definition: The bytes of a word are numbered starting from the most significant byte.
Page: 5
Chapter: 1
Section: 3.1

Name: A reserved bit
Definition: A bit having a future, though unknown, effect. Should be considered as unpredictable.
Page: 5
Chapter: 1
Section: 3.2
Context: Processor

Precaution to take with register and memory layout with reserved bits:
-Do not depend on the states of any reserved bits when testing the values of registers that contain such bits.
Mask out the reserved bits before testing.
-Do not depend on the states of any reserved bits when storing to memory or to a register.
-Do not depend on the ability to retain information written into any reserved bits.
-When loading a register, always load the reserved bits with the values indicated in the documentation, if any, or reload them with values previously read from the same register.
Page: 5
Chapter: 1
Section: 3.2

Name: A label
Definition: An identifier which is followed by a colon.
Page: 6
Chapter: 1
Section: 3.2.1

Name: A mnemonic
Definition: A reserved name for a class of instruction opcodes which have the same function.
Page: 6
Chapter: 1
Section: 3.2.1
Context: intel

Name: Operands
Definition: Literals or identifiers for data item.
Page: 6
Chapter: 1
Section: 3.2.1

Q: -[...] or
-[...].
A: Reserved names of registers; assumed to be assigned to data items declared in another part of the program
Page: 6
Chapter: 1
Section: 3.2.1
Name: Operand identifiers

Name: Format of instruction
Page: 6
Chapter: 1
Section: 3.2.1
Notation: label: mnemonic arguments

Question: When two operands are present in an arithmetic or logical instruction, the right operand is
Answer: the source.
Page: 6
Chapter: 1
Section: 3.2.1

Question: When two operands are present in an arithmetic or logical instruction, the left operand is
Answer: the destination.
Page: 6
Chapter: 1
Section: 3.2.1

Name: Base 16 (hexadecimal) numbers
Page: 6
Chapter: 1
Section: 3.3
Notation: A string of hexadecimal digits followed by the character H (for example, 0F82EH)

Name: Base 2 (binary) numbers
Page: 6
Chapter: 1
Section: 3.3
Notation: A string of 1s and 0s, sometimes followed by the character B (for example, 1010B)

Name: Byte adressing
Definition: Memory is organized and accessed as a sequence of bytes.
Page: 6
Chapter: 1
Section: 3.4

Name: An address space
Definition: The range of memory that can be addressed.
Page: 6
Chapter: 1
Section: 3.4

Name: A segment
Definition: One of the address spaces.
Page: 6
Chapter: 1
Section: 3.4

Name: Adressing in segment
Page: 6
Chapter: 1
Section: 3.4
Notation: Segment-register:Byte-address

Name: An exception
Definition: An event that typically occurs when an instruction causes an error.
Page: 8
Chapter: 1
Section: 3.6
Notation: #Exception name(Fault code)
Example: Divison by zero,

Question: Intel 64 and IA-32 processors are “little or bigger endian”?
Answer: little
Page: 5
Chapter: 1
Section: 3.1