-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcountregions.s
214 lines (175 loc) · 7.55 KB
/
countregions.s
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
count_disjoint_regions:
# Your code goes here :)
sub $sp, $sp, 20
sw $ra, 0($sp)
sw $s0, 4($sp)
sw $s1, 8($sp)
sw $s2, 12($sp)
sw $s3, 16($sp)
move $s0, $a0 # line
move $s1, $a1 # canvas
move $s2, $a2 # solution
li $s3, 0 # unsigned int i = 0;
count_disjoint_regions_loop:
lw $t0, 0($s0) # $t0 = lines->num_lines
bge $s3, $t0, count_disjoint_regions_end # i < lines->num_lines : fallthrough
#lines->coords[0][i];
lw $t1, 4($s0) # $t1 = &(lines->coords[0][0])
lw $t2, 8($s0) # $t2 = &(lines->coords[1][0])
mul $t3, $s3, 4 # i * sizeof(int*)
add $t1, $t3, $t1 # $t1 = &(lines->coords[0][i])
add $t2, $t3, $t2 # $t2 = &(lines->coords[1][i])
lw $a0, 0($t1) # $a0 = lines->coords[0][i] = start_pos
lw $a1, 0($t2) # $a1 = lines->coords[0][i] = end_pos
move $a2, $s1 # $a2 = canvas
jal draw_line # draw_line(start_pos, end_pos, canvas);
li $a0, 65 # Immediate value A
rem $t1, $s3, 2 # i % 2
add $a0, $a0, $t1 # 'A' or 'B'
move $a1, $s1
jal count_disjoint_regions_step # count_disjoint_regions_step('A' + (i % 2), canvas);
# $v0 = count_disjoint_regions_step('A' + (i % 2), canvas);
#la $s2 solution
lw $t0, 4($s2) # &counts = &counts[0]
sll $t1, $s3, 2 # i * sizeof(unsigned int)
add $t0, $t1, $t0 # *counts[i]
sw $v0, 0($t0)
## // Update the solution struct. Memory for counts is preallocated.
## solution->counts[i] = count;
add $s3, $s3, 1 # i++
j count_disjoint_regions_loop
count_disjoint_regions_end:
lw $ra, 0($sp)
lw $s0, 4($sp)
lw $s1, 8($sp)
lw $s2, 12($sp)
lw $s3, 16($sp)
add $sp, $sp, 20
jr $ra
count_disjoint_regions_step:
# Your code goes here :)
sub $sp, $sp, 24
sw $ra, 0 ($sp)
sw $s0, 4 ($sp) # marker
sw $s1, 8 ($sp) # canvas
sw $s2, 12($sp) # region_count
sw $s3, 16($sp) # row
sw $s4, 20($sp) # col
move $s0, $a0
move $s1, $a1
li $s2, 0 # unsigned int region_count = 0;
li $s3, 0 # row = 0
outer_loop: # for (unsigned int row = 0; row < canvas->height; row++) {
lw $t0, 0($s1) # canvas->height
bge $s3, $t0, end_outer_loop # row < canvas->height : fallthrough
li $s4, 0 # col = 0
inner_loop: # for (unsigned int col = 0; col < canvas->width; col++) {
lw $t0, 4($s1) # canvas->width
bge $s4, $t0, end_inner_loop # col < canvas->width : fallthrough
# unsigned char curr_char = canvas->canvas[row][col];
lw $t1, 12($s1) # &(canvas->canvas)
mul $t2, $s3, 4 # $t2 = row * 4
add $t2, $t2, $t1 # $t2 = canvas->canvas + row * sizeof(char*) = canvas[row]
lw $t1, 0($t2) # $t1 = &char = char* = & canvas[row][0]
add $t1, $s4, $t1 # $t1 = &canvas[row][col]
lb $t1, 0($t1) # $t1 = canvas[row][col] = curr_char
lb $t2, 8($s1) # $t2 = canvas->pattern
# temps: $t1 = curr_char $t2 = canvas->pattern
# if (curr_char != canvas->pattern && curr_char != marker) {
beq $t1, $t2, endif # if (curr_char != canvas->pattern) fall
beq $t1, $s0, endif # if (curr_char != marker) fall
add $s2, $s2, 1 # region_count ++;
move $a0, $s3 # (row,
move $a1, $s4 # col,
move $a2, $s0 # marker,
move $a3, $s1 # canvas);
jal flood_fill # flood_fill(row, col, marker, canvas);
endif:
add $s4, $s4, 1 # col++
j inner_loop # loop again
end_inner_loop:
add $s3, $s3, 1 # row++
j outer_loop # loop again
end_outer_loop:
move $v0, $s2 # Copy return val
lw $ra, 0($sp)
lw $s0, 4 ($sp) # marker
lw $s1, 8 ($sp) # canvas
lw $s2, 12($sp) # region_count
lw $s3, 16($sp) # row
lw $s4, 20($sp) # col
add $sp, $sp, 24
jr $ra
draw_line:
lw $t0, 4($a2) # t0 = width = canvas->width
li $t1, 1 # t1 = step_size = 1
sub $t2, $a1, $a0 # t2 = end_pos - start_pos
blt $t2, $t0, cont
move $t1, $t0 # step_size = width;
cont:
move $t3, $a0 # t3 = pos = start_pos
add $t4, $a1, $t1 # t4 = end_pos + step_size
lw $t5, 12($a2) # t5 = &canvas->canvas
lbu $t6, 8($a2) # t6 = canvas->pattern
for_loop:
beq $t3, $t4, end_for
div $t3, $t0 #
mfhi $t7 # t7 = pos % width
mflo $t8 # t8 = pos / width
mul $t9, $t8, 4 # t9 = pos/width*4
add $t9, $t9, $t5 # t9 = &canvas->canvas[pos / width]
lw $t9, 0($t9) # t9 = canvas->canvas[pos / width]
add $t9, $t9, $t7
sb $t6, 0($t9) # canvas->canvas[pos / width][pos % width] = canvas->pattern
add $t3, $t3, $t1 # pos += step_size
j for_loop
end_for:
jr $ra
flood_fill:
# Your code goes here :)
blt $a0, $zero, flood_fill_end # row < 0
blt $a1, $zero, flood_fill_end # col < 0
lw $t0, 0($a3) # $t0 = canvas->height
bge $a0, $t0, flood_fill_end # row >= canvas->height
lw $t0, 4($a3) # $t0 = canvas->width
bge $a1, $t0, flood_fill_end # col >= canvas->width
j recur # NONE TRUE
recur:
# Find curr
lw $t0, 12($a3) # canvas->canvas
mul $t1, $a0, 4 # row * sizeof(char*)
add $t1, $t1, $t0 # $t1 = canvas->canvas + row * sizeof(char*) = canvas[row]
lw $t2, 0($t1) # $t2 = &char = char* = & canvas[row][0]
add $t2, $a1, $t2 # $t2 = &canvas[row][col]
lb $t3, 0($t2) # $t3 = curr
lb $t4, 8($a3) # $t4 = canvas->pattern
beq $t3, $t4, flood_fill_end # curr == canvas->pattern : break
beq $t3, $a2, flood_fill_end # curr == marker : break
#FLOODFILL
sb $a2, ($t2)
# Save depenedecies
sub $sp, $sp, 12
sw $ra, 0($sp)
sw $s0, 4($sp)
sw $s1, 8($sp)
move $s0, $a0
move $s1, $a1
sub $a0, $s0, 1
move $a1, $s1
jal flood_fill
move $a0, $s0
add $a1, $s1, 1
jal flood_fill
add $a0, $s0, 1
move $a1, $s1
jal flood_fill
move $a0, $s0
sub $a1, $s1, 1
jal flood_fill
# Restore VARS
lw $ra, 0($sp)
lw $s0, 4($sp)
lw $s1, 8($sp)
add $sp, $sp, 12
flood_fill_end:
jr $ra