assembly - Cannot access and print byte array in index in mips -


i trying print random byte screen check see if i'm getting right element. use li $v0, 11 since byte apparently, can lw , use byte value, tried , doesn't work well. prints out address 268501003 example @ current row + col index set to, , address change depending on arguments set $a0 , $a1 prior calling calculate address. i'm getting no output array index value i'm trying print. please help!

.data  n: .word 10  # gives board dimensions  board:    .byte 1, 0, 0, 0, 0, 0, 0, 0, 0, 0    .byte 1, 1, 0, 0, 0, 0, 0, 0, 0, 0    .byte 0, 0, 0, 1, 0, 0, 0, 0, 0, 0    .byte 0, 0, 1, 0, 1, 0, 0, 0, 0, 0    .byte 0, 0, 0, 0, 1, 0, 0, 0, 0, 0    .byte 0, 0, 0, 0, 1, 1, 1, 0, 0, 0    .byte 0, 0, 0, 1, 0, 0, 1, 0, 0, 0    .byte 0, 0, 1, 0, 0, 0, 0, 0, 0, 0    .byte 0, 0, 1, 0, 0, 0, 0, 0, 0, 0    .byte 0, 0, 1, 0, 0, 0, 0, 0, 0, 0  newboard: .space 100  .data  maxiter: .word 0 nn: .word 0 promptmsg: .asciiz "# iterations: " dot: .asciiz "." newline: .asciiz "\n" .text #=============================== main:  la $a0, promptmsg jal printtext  li $v0, 5 syscall  li $a0, 6 #random row/col index li $a1, 7 la $a2, board jal calculate_address  move $t5, $v0  li $v0, 1 move $a0, $t5 syscall  la $a0, newline jal printtext  li $t7, 0 li, $a0, 0 lb $t7, board($t5) move $a0, $t7 li $v0, 11 syscall  li $v0, 10 syscall  printtext: li $v0, 4 syscall jr $ra   calculate_address: #(row index * column size + column index)*datasize + base address #a0 = rowindex, a1 = colindex, a2 = base address lw $t6, n # col size li $t3, 0 mult $a0, $t6 mfhi $t3 add $t3, $t3, $a1 add $t3, $t3, $a2 #la $a0, msg4 #jal printtext move $v0, $t3 #return address of element [i][j] jr $ra


Comments

Post a Comment

Popular posts from this blog

Sort a complex associative array in PHP -

this question has answer here: php sort array subarray value 5 answers i have associative array in php like: $newarray1 = array ( [producta] => array ( [link] => http://sanjosespartan.com/blog/products/agile-java-development/ [visitcount] => 4 ) [productd] => array ( [link] => http://sanjosespartan.com/blog/products/intro-to-go/ [visitcount] => 1 ) [productg] => array ( [link] => http://sanjosespartan.com/blog/products/node-js-for-developers/ [visitcount] => 1 ) [productb] => array ( [link] => http://sanjosespartan.com/blog/products/beginning-mysql/ [visitcount] => 1 ) [productc] => array ( [link] => http://sanjosespartan.com/blog/products/computer-networks/ [visitcount] => 1 ) ...
Read more

vb.net - How to ignore if a cell is empty nothing -

how use roscolor() ignore value (like empty cell) ? color row if value upper 5 when there nothing in cell, want ignore roscolor() apply, how? public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val integer val = quotedatagridview1.rows(i).cells(3).value if val = vbempty quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white elseif val < 5 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.red elseif val > 5 , val < 10 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.lightyellow end if next end sub you can check empty value following public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val = quotedatagridview1.rows(i).cells(3).value if isdbnull(val) or val nothing quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white ...
Read more

recursion - Can every recursive algorithm be improved with dynamic programming? -

i first year undergraduate csc student looking competitive programming. recursion involves defining , solving sub problems. understand, top down dynamic programming (dp) involves memoizing solutions sub problems reduce time complexity of algorithm. can top down dp used improve efficiency of every recursive algorithm overlapping sub problems? dp fail work , how can identify this? the short answer is: yes. however, there constraints. obvious 1 recursive calls must overlap. i.e. during execution of algorithm, recursive function must called multiple times same parameters. lets truncate recursion tree memoization. can use memoization reduce number of calls. however, reduction of calls comes price. need store results somewhere. next obvious constraint need have enough memory. comes not-so obvious constraint. memory access requires time. first need find result stored , maybe copy location. in cases, might faster let recursion calculate result instead of loading somewher...
Read more