Chapter 6

studied byStudied by 0 people
0.0(0)
Get a hint
Hint

Program control instructions

1 / 53

encourage image

There's no tags or description

Looks like no one added any tags here yet for you.

54 Terms

1

Program control instructions

Direct the flow of a program and allow the flow to change

New cards
2

Jump

The main program control instruction, allows the programmer to skip sections of a program and branch to any part of the memory for the next instruction

New cards
3

conditional jump instruction

Allows the programmer to make decisions based upon numerical tests

New cards
4

Short jump, near jump, and far jump

Three types of unconditional jump instructions

New cards
5

Short jump

is a 2-byte instruction that allows jumps or branches to memory locations within +127 and -128 bytes from the address following the jump

New cards
6

Short jump

are called relative jumps because they can be moved, along with their related software, to any location in the current code segment without a change

New cards
7

Near jump

The 3-byte allows a branch or jump within ±32K bytes (or any where in the current code segment) from the instruction in the current code segment

New cards
8

Near jump

Is similar to the short jump, except that the distance is farther

New cards
9

Near jump

Is also relocatable (as was the short jump) because it is also a relative jump.

New cards
10

Far jump

The 5-byte. allows a jump to any memory location within the real memory system

New cards
11

Far jump

Instructions obtains a new segment and offset address to accomplish the jump.

New cards
12

Intrasegment jumps

The short and near jumps are often called

New cards
13

Intersegment jumps

Far jumps are often called

New cards
14

Far label

Another way to obtain a far jump is to define a label as

New cards
15

greater than and less

The terms __than refer to signed numbers

New cards
16

above and below

The terms __ refer to unsigned numbers

New cards
17

LOOP instruction

Is a combination of a decrement CX and the JNZ conditional jump

New cards
18

LOOPE (loop while equal)

instruction jumps if CX != 0 while an equal condition exists.

New cards
19

LOOPNE (loop while not equal)

Instruction jumps if CX != 0 while a not-equal condition exists

New cards
20

WHILE

statement is used with a condition to begin the loop

New cards
21

ENDW

statement ends the loop

New cards
22

REPEAT-UNTIL Loops

series of instructions is

repeated until some condition occurs

New cards
23

REPEAT

statement defines the start of the loop

New cards
24

UNTIL

The end is defined __with the condition statement, which contains a

New cards
25

UNTILCXZ

instruction uses the CX register as a counter to repeat a loop a fixed number of times.

New cards
26

Procedure

is an important part of any computer system's architecture. A procedure is a group of instructions that usually performs one task

New cards
27

Procedure

is a reusable section of the software that is stored in memory once, but used as often as necessary

New cards
28

PROC - ENDP

End of procedure

A procedure begins with the__directive and ends with the__

New cards
29

NEAR or FAR

The PROC directive is followed by the type of procedure

New cards
30

Far procedures

Procedures that are to be used by all software (global) should be written as

New cards
31

Near procedures

Procedures that are used by a given task (local) are normally defined as

New cards
32

CALL instruction

Transfers the flow of the program to the procedure.

New cards
33

Near CALL instruction

is 3 bytes long; the first byte contains the opcode, and the second and third bytes contain the displacement, or distance of ±32K in the 8086 through the 80286 processors

New cards
34

Far CALL instruction

is like a far jump because it can call a procedure stored in any memory location in the system

New cards
35

Return instruction (RET)

removes a 16-bit number (near return) from the stack and places it into IP, or removes a 32-bit number (far return) and places it into IP and CS

New cards
36

Interrupt

is either a hardware-generated CALL or a Software-generated CALL

New cards
37

Exception

An internal interrupt is called an

New cards
38

Hardware-generated CALL

externally derived from a hardware signal

New cards
39

Software-generated CALL

internally derived from the execution of an instruction or by some other internal

event

New cards
40

Interrupt vector

is a 4-byte number stored in the first 1024 bytes of the memory (00000H-

003FFH) when the microprocessor operates in the real mode.

New cards
41

Interrupt return instruction (IRET

is used only with software or hardware interrupt service procedures

New cards
42

INT 3

Instruction is a special software interrupt designed to function as a breakpoint

New cards
43

Interrupt on overflow (INTO

is a conditional software interrupt that tests the overflow flag (0).

New cards
44

Set interrupt flag instruction (STI)

places a 1 into the I flag bit, which enables the INTR pin. Interrupt request

New cards
45

Clear interrupt flag instruction (CLI)

places a 0 into the I flag bit, which disables the INTR pin.

New cards
46

IRETQ instruction

64-bit system uses the__ to return from an interrupt service

New cards
47

Carry flag (C)

Propagates the carry or borrow in multiple-word/doubleword addition and subtraction

New cards
48

WAIT

instruction monitors the hardware BUSY pin on the 80286 and 80386, and the

pin on the 8086/8088.

New cards
49

Halt instruction (HLT)

Stops the execution of software

This instruction normally appears in a program to wait for an interrupt

New cards
50

No operation instruction (NOP

was often used to pad software with space for future machine language instructions.

New cards
51

LOCK prefix

Appends an instruction and causes the pin to become a logic 0

New cards
52

BOUND instruction

is a comparison

instruction that may cause an interrupt (vector type number 5)

New cards
53

ENTER and LEAVE instructions

first made available to the 80186 microprocessor, are used with stack frames, which are mechanisms used to pass parameters to a procedure through the stack memory

New cards
54

ENTER instruction

creates a stack frame by pushing BP onto the stack and then loading BP with the uppermost address of the stack frame

New cards

Explore top notes

note Note
studied byStudied by 24 people
... ago
5.0(1)
note Note
studied byStudied by 21 people
... ago
5.0(1)
note Note
studied byStudied by 103 people
... ago
5.0(1)
note Note
studied byStudied by 8 people
... ago
5.0(1)
note Note
studied byStudied by 5 people
... ago
5.0(1)
note Note
studied byStudied by 143 people
... ago
5.0(1)
note Note
studied byStudied by 5 people
... ago
5.0(1)
note Note
studied byStudied by 10 people
... ago
5.0(1)

Explore top flashcards

flashcards Flashcard (100)
studied byStudied by 89 people
... ago
4.0(2)
flashcards Flashcard (336)
studied byStudied by 11 people
... ago
5.0(2)
flashcards Flashcard (28)
studied byStudied by 7 people
... ago
5.0(1)
flashcards Flashcard (98)
studied byStudied by 154 people
... ago
5.0(2)
flashcards Flashcard (23)
studied byStudied by 14 people
... ago
4.0(4)
flashcards Flashcard (56)
studied byStudied by 4 people
... ago
5.0(1)
flashcards Flashcard (63)
studied byStudied by 320 people
... ago
5.0(3)
robot