Term
| Problems with assembly programming |
|
Definition
Every process architecture is different
Time consuming and error-prone |
|
|
Term
|
Definition
Use of processor specific features
highest possible performance with lowest memory footprint
C has a nice balance of expressive power and direct correspondance with common machine instructions |
|
|
Term
|
Definition
Lets us specify how a piece of data should be interpreted, every type has a size in bytes
char= 1 byte, int is 4 |
|
|
Term
|
Definition
(different type) expression
(int) '!' treat character ! as int |
|
|
Term
|
Definition
| Allows us to reuse, organize and parametrize code, may hae many inputs, but at most one output (return value) |
|
|
Term
|
Definition
| No argument or no return value |
|
|
Term
|
Definition
A variable which holds an address
int t(referent type)* ptr(identifier)= &x; (address of variable x) |
|
|
Term
|
Definition
Sequential- linear from entry to exit
Conditional- tests a true/false condition (seperate true and false paths)
loop- repeats a process multiple times |
|
|
Term
|
Definition
most basic and common counting loop
for x=1 to n
repeats process n times then continues to next processor |
|
|
Term
|
Definition
linear for loop
does process for n times while test condition is true tests x>= n-1 |
|
|
Term
|
Definition
Branch move forward or back to non sequential position in code, unconditional-always, conditional if T/F
Sub- jump to subroutine, when subroutine is finished return to point of call. |
|
|
Term
|
Definition
Section of RAM used for temp storage
FILO structure, 32 bit word alligned
4 bytes for each read/write of stack,
bottom of stack = highest stack address |
|
|
Term
|
Definition
| cpu register that tracks the top of the stack, always contains an address value that points to the last data placed on stack, initially defined as bottom of stack |
|
|
Term
|
Definition
| Store registers to stack, registers stored in sequence lowest numbered register to lowest memory address |
|
|
Term
|
Definition
|
|
Term
|
Definition
Independent: does not rely on other programs or subbroutines that can change
Transparent: restores CPU registers to values before subroutines (store CPU reg temporarily to stack)
Relocatable: data and code is location independent |
|
|
Term
| Branch always to an address held within a register |
|
Definition
|
|
Term
| Branch always to a subroutine at an addressed held within a register |
|
Definition
|
|
Term
For the KL25Z, what is
the possible memory address range for the stack? |
|
Definition
RAM exist between 0x2000.0000 and 0x2000.2FFF, and the stack can be placed
anywhere in RAM. |
|
|
