ECE3120: Computer Systems Chapter 4: Advanced Assembly Programming - PowerPoint PPT Presentation

1 / 15
About This Presentation
Title:

ECE3120: Computer Systems Chapter 4: Advanced Assembly Programming

Description:

stab 0,y ; save the code and increment the pointer. clr 1,y ; terminated the string with NULL ... stab 2,y ; save the least significant digit. xgdx ; swap the ... – PowerPoint PPT presentation

Number of Views:24
Avg rating:3.0/5.0
Slides: 16
Provided by: xubi
Category:

less

Transcript and Presenter's Notes

Title: ECE3120: Computer Systems Chapter 4: Advanced Assembly Programming


1
ECE3120 Computer SystemsChapter 4 Advanced
Assembly Programming
  • Dr. Xubin He
  • http//iweb.tntech.edu/hexb
  • Email hexb_at_tntech.edu
  • Tel 931-3723462, Brown Hall 319

2
  • Prev
  • Stack
  • Array
  • Today
  • Strings

3
Strings - A sequence of characters terminated by
a NULL (ASCII code 0) or other special character
such as EOT (ASCII code 4). - A number in the
computer is represented as a binary number. - A
number must be converted to ASCII code before
output so that it can be understood. - To
convert a binary into an ASCII string, we divide
the binary number by 10 repeatedly until the
quotient is zero. For each remainder, the number
30 is added. Example 4.4 Write a program to
convert the unsigned 8-bit binary number in
accumulator A into BCD digits terminated by a
NULL character. Each digit is represented in
ASCII code. Solution 1. 4 bytes are needed to
hold the converted BCD digits. 2. Repeated
division by 10 method is used.
4
test_dat equ 220 org 1000 out_buf rmb 4 temp rmb
2 org 1500 starting address of the
program ldaa test_dat load the test
data ldy out_buf tab transfer the 8-bit
value in B check to see if the number has only
one digit cmpb 9 bhi chk_99 addb 30
convert the digit into ASCII code stab 0,y
save the code and increment the
pointer clr 1,y terminated the string with
NULL jmp done chk_99 clra check to see if the
number has two digits cmpb 99 is the number
greater than 99 bhi three_dig if yes, the
string has three digits ldx 10 idiv addb 30
convert the lower digit stab 1,y store the
lowest digit
5
xgdx addb 30 stab 0,y save the upper
digit clr 2,y terminated the string with
NULL bra done three_dig ldx 10 idiv addb 30
stab 2,y save the least significant
digit xgdx swap the quotient to
D ldx 10 idiv addb 30 stab 1,y save the
middle digit xgdx swap the hundreds digit to
B addb 30 stab 0,y save the ASCII code of
the highest digit clr 3,y terminate the string
with NULL done swi end
6
Example 4.5 Write a program to convert the 16-bit
signed integer in D into a string of BCD
digits. Solution 1. A signed 16-bit integer is
in the range of -32768 to 32767. 2. A NULL
character is needed to terminate the converted
BCD string. 3. A minus character is needed for a
negative number. 4. Up to 7 bytes are needed to
hold the converted result.
7
org 1800 out_buf rmb 7 temp rmb 2 test_dat equ -
4300 org 1000 ldd test_dat load a test
data ldy out_buf use Y as the pointer to the
output buffer cpd 0 lbpl chk_9 if plus, no
complement lbeq zero is the given number a
0? the following three instructions compute the
magnitude of the given number in
D coma comb addd 1 std temp ldaa 2D
place a negative sum staa 0,y store the
sign iny ldd temp chk_9 cpd 9 does the
number have only one digit? lbhi chk_99 addb 3
0 stab 0,y
8
clr 1,y terminate the string with
NULL lbra done chk_99 cpd 99 does the number
have only two digits? lbhi chk_999 branch if
the number has more than two digits ldx 10 idi
v addb 30 convert the ones digit to BCD
ASCII stab 1,y save the ones
digit xgdx addb 30 stab 0,y save the tens
digit clr 2,y add a NULL character lbra done
chk_999 cpd 999 does the number have only
three digits? lbhi chk_9999 branch if the
number has more than three digits ldx 10 idiv
addb 30 convert the ones digit stab 2,y
save the ones digit xgdx ldx 10 idiv addb 3
0
9
stab 1,y save the tens digit xgdx addb 30
convert the hundreds digit stab 0,y clr 3,y
add a NULL character lbra done chk_9999
cpd 9999 does the number have only four
digits? lbhi five_digit branch if the number
has five digits ldx 10 idiv addb 30 stab 3,
y save the ones digit xgdx ldx 10 idiv add
b 30 stab 2,y xgdx ldx 10 idiv addb 30
stab 1,y xgdx
10
addb 30 stab 0,y clr 4,y add a NULL
character lbra done five_digit ldx 10 idiv ad
db 30 stab 4,y save the ones
digit xgdx ldx 10 idiv addb 30 stab 3,y
save the tens digit xgdx ldx 10 idiv addb
30 stab 2,y save the hundreds
digit xgdx ldx 10 idiv addb 30
11
stab 2,y save the hundreds digit xgdx ldx 1
0 idiv addb 30 stab 1,y save the
thousands digit xgdx addb 30 stab 0,y
save the ten-thousands digit clr 5,y add a
NULL character done swi zero ldaa 30 staa 0,y
clr 1,y swi end
12
Example 4.6 Write a program to convert a BCD
ASCII string to a binary number. Algorithm Step
1 sign ? 0 error ? 0 number ? 0 Step 2 If
the character pointed to by in_ptr is the minus
sign, then sign ? 1 in_ptr ? in_ptr 1 Step
3 If the character pointed to by in_ptr is the
NULL character, then go to step 4. else if the
character is not a BCD digit, then error ? 1
go to step 4 else number ? number 10
min_ptr - 30 in_ptr ? in_ptr 1 go to
step 3 Step 4 If sign 1 and error 0
,then number ? twos complement of
number else stop
13
Solution minus equ 2D ASCII code of minus
sign org 1800 in_buf fcc "9889" input ASCII
to be converted fcb 0 null character out_buf r
mb 2 buf1 is used to hold the current digit
value and buf2 will be cleared to
0 buf2 rmb 1 buf1 rmb 1 sign rmb 1 holds the
sign of the number error rmb 1 indicates the
occurrence of illegal character org 1000 clr si
gn clr error clr out_buf clr out_buf1 clr buf
2 ldx in_buf ldaa 0,x cmpa minus is the
first character a minus sign bne continue
branch if not minus inc sign set the sign to
1 inx move the pointer
14
continue ldaa 1,x is the current character a
NULL character? lbeq done yes, we reach the
end of the string cmpa 30 is the character
not between 0 to 9? lblo in_error " cmpa 39
" lbhi in_error " suba 30 convert to
the BCD digit value staa buf1 save the digit
temporarily ldd out_buf ldy 10 emul
perform 16-bit by 16-bit multiplication addd buf2
add the current digit value std out_buf bra
continue in_error ldaa 1 staa error done ldaa si
gn check to see if the original number is
negative beq positive ldaa out_buf if
negative, compute its twos complement ldab out_b
uf1 coma comb addd 1 st
d out_buf positive swi end
15
Next
  • Strings (Contd.)
  • Read Chapter 4.5
Write a Comment
User Comments (0)
About PowerShow.com