.data list: .space 1000 # reserves a block of 1000 bytes
allocation for list
Array Declaration and Storage Allocation
MIPS Arrays 1
The first step is to reserve sufficient space for the array:
.data list: .space 1000
# reserves a block of 1000 bytes
This yields a contiguous block of bytes of the specified size. The label is a symbolic name for the address of the beginning of the array.
list == 1004000
The size of the array is specified in bytes... could be used as: ? array of 1000 char values (ASCII codes) ? array of 250 int values ? array of 125 double values
1004000 1004001 1004002 1004003 1004004
. . . 1004999
Memory
There is no sense in which the size of the array is "known" by the array itself.
CS@VT September 2010
Computer Organization I
?2006-10 McQuain,
alloc for vowels
Array Declaration with Initialization
An array can also be declared with a list of initializers:
.data vowels: .byte 'a', 'e', 'i', 'o', 'u' pow2: .word 1, 2, 4, 8, 16, 32, 64, 128
vowels names a contiguous block of 5 bytes, set to store the given values; each value is stored in a single byte.
Address of vowels[k] == vowels + k
pow2 names a contiguous block of 32 bytes, set to store the given values; each value is stored in a word (4 bytes)
Address of pow2[k] == pow2 + 4 * k
MIPS Arrays 2
1004000 1004001 1004002 1004003 1004004 1004005 1004006 1004007 1004008 1004009 1004010 1004011 1004012
Memory 97
101 105 111 117
1
2
alloc for pow2
CS@VT September 2010
Computer Organization I
?2006-10 McQuain,
Another View
MIPS Arrays 3
Viewed as hex nybbles, the contents of memory would look like (in little-endian):
61 65 69 6F 75
01 00 00 00 02 00 00 00
10040000 10040001 10040002 10040008 10040012
0110 0001
Note that endian-ness affects the ordering of bytes, not the ordering of the nybbles within a byte.
CS@VT September 2010
Computer Organization I
?2006-10 McQuain,
Array Traversal and Initialization
MIPS Arrays 4
Here's an array traversal to initialize a list of integer values:
.data list: .space 1000 listsz: .word 250
# using as array of integers
main:
.text lw $s0, listsz la $s1, list li $t0, 0
# $s0 = array dimension # $s1 = array address # $t0 = # elems init'd
initlp: beq $t0, $s0, initdn
sw $s1, ($s1)
# list[i] = addr of list[i]
addi $s1, $s1, 4 # step to next array cell
addi $t0, $t0, 1 # count elem just init'd
b
initlp
initdn:
li $v0, 10
syscall
QTP: why 4?
CS@VT September 2010
Computer Organization I
?2006-10 McQuain,
Array Traversal Details
. . . initlp: beq $t0, $s0, initdn
sw $s1, ($s1)
addi $s1, $s1, 4
addi $t0, $t0, 1
b initdn:
initlp
A variable that stores an address is called a pointer.
Here, $s1 is a pointer to a cell of the array list. We can re-target $s1 to a different cell by adding an appropriate value to it.
MIPS Arrays 5
1004008
1004008
1004012
1004012
1004016
1004016
1004020
1004020
1004024
1004024
CS@VT September 2010
Computer Organization I
?2006-10 McQuain,
Alternate Traversal Logic
MIPS Arrays 6
This traversal uses pointer logic to terminate the loop:
.data list: .space 1000 listsz: .word 250
main:
.text la $s1, list lw $s0, listsz addi $s0, $s0, -1 sll $s0, $s0, 2 add $s0, $s0, $s1
# index of last cell # offset of last cell # ptr to last cell
1004008 1004012 1004016
1004008 1004012 1004016
initlp: bgt $s1, $s0, initdn
sw $s1, ($s1)
addi $s1, $s1, 4
b
initlp
initdn:
li $v0, 10
syscall
. . . . . .
1004996
1004024
QTP: rewrite this using the do-while pattern shown in the previous lecture
CS@VT September 2010
Computer Organization I
1005000
?2006-10 McQuain,
alloc for vowels
Array Bounds Issues
An array can also be declared with a list of initializers:
.data vowels: .byte 'a', 'e', 'i', 'o', 'u' pow2: .word 1, 2, 4, 8, 16, 32, 64, 128
What happens if you access an array with a logically-invalid array index?
MIPS Arrays 7
1004004 1004005 1004006 1004007 1004008
Memory 117
1
vowels[5] ?? contents of address 1004005
1004012
2
While vowels[5] does not exist logically as part of the array, it does specify a physical location in memory.
What is actually stored there is, in general, unpredictable.
. . .
In any case, the value is not one that we want...
1004036
alloc for pow2
CS@VT September 2010
Computer Organization I
?2006-10 McQuain,
Special Case: Array of Characters
As we've seen, the declaration:
.data vowels: .byte 'a', 'e', 'i', 'o', 'u'
Leads to the allocation:
61 65 69 6F 75
MIPS Arrays 8
However, the declaration:
.data vowels: .asciiz "aeiou"
Leads to the allocation:
61 65 69 6F 75 00
An extra byte is allocated and initialized to store 0x00, which acts as a marker for the end of the character sequence (i.e., string).
This allows us to write loops to process character strings without knowing the length of the string in advance.
CS@VT September 2010
Computer Organization I
?2006-10 McQuain,
................
................
In order to avoid copyright disputes, this page is only a partial summary.
To fulfill the demand for quickly locating and searching documents.
It is intelligent file search solution for home and business.
Related download
- linaro kevin townsend
- capl scripting quickstart vector informatik
- lab 3 hashing
- data list space 1000 reserves a block of 1000 bytes
- bitpacket manual non gnu
- homework 1a many time pad attack
- lecture 15 hashing for message authentication lecture
- 1 4 https 1zlzl5
- x86 assembly university of alaska system
- big endian and little endian formats for integers
Related searches
- what is a theme of a story
- a memoir of a family and culture in cris
- list of 1000 words
- how to do a block quote
- python list all directories in a directory
- list when you buy a house
- list of 1000 spanish words
- how to make a block quote
- responsibilities of a trustee of a trust
- 2 percent of 1000 dollars
- 10 pound block of chocolate
- powershell comment block of text