一个是插入排序，一个是乘法，求指点
#
# Insertion sort algorithm
# See http://www.cs.ubc.ca/spider/harrison/Java/InsertionSortAlgorithm.java.html
# Note use of MIPS register pseudo-names, and # for comments
#
.data
array: .word 0x4F6961869342DC99,0x7A0B67101C85D9EE,0x5EF87A2B37CA911D,0x47EF58E8B7E01DD9
.word 0x79A74EAB20CB53C9,0x6D26753D06F8E483,0x70F313AF126C0B47,0x745232A4035F1EF5
.word 0x46036BDDE8D095FD,0x4DE3F1D89B5A43EA,0x5279659D102EABBA,0x4496CDA949E29089
.word 0x6D594E2009B7D04A,0x4CE57C0D55905DE5,0x4115A0AC78A1848B,0x5051DAA648B3BDA6
.word 0x71C3730CE11593C0,0x425A9FAE68370FC5,0x6B265F8485354426,0x4E935A849C713D01
.word 0x773110588E5170D7,0x5B133F183803A780,0x49A52D37525C362C,0x4A0C150C49D8A123
.word 0x7962EC77A41FB066,0x5D3A087AF3417D04,0x7076F96031DC3B2E,0x404EC3D105D02FDD
.word 0x5484F578189A7A8B,0x65EA86F819037E03,0x4367E6F2AE35B27A,0x63C1CF869394DB43
.word 0x59421109269E583C,0x6B9F1B529C8598EF,0x4C877DCC129AF1BD,0x58401EDBF56D884F
.word 0x754C5475E3F8BFCF,0x1111111111111111,0x786213BFF3FAE203,0x53F6C77223F8D4B5
.word 0x5304A0C74815DFBF,0x701BFCF2B7E84DED,0x72C3DEDE1BA476AD,0x557C05371C0A436C
.word 0x741CECCDBAEBBBB3,0x577156E9E5C72202,0x641D1FEFF6E59822,0x623B6D2C45E6AFC6
.word 0x6976994C37A754F0,0x4CE48C6E6963A020,0x4EDDBCD1CF3CD3AC,0x706AAA8FC1AE08E4
.word 0x674DE62D8E4ACB59,0x791423B583AF7749,0x4589009608F70D0A,0x55159D9A3430F238
.word 0x70BD250BE3048518,0x6D1B60128C603831,0x5397AB7F0E29CEE8,0x58EF0102374A9A97
.word 0x625D9DBD94D1E2D1,0x5E8439437165FDF6,0x4F621F3A37353266,0x426B3ACC1149F170
.word 0x59D789FA7FA3F476,0x4C4353E0D30D6D4B,0x492F120FA02F0B1C,0x720DFD78A97CFF59
.word 0x5BC2140E14551D39,0x68718C039D4656B9,0x7FFFFFFFFFFFFFFF,0x48F63330CBC9A739
.word 0x6E47955AFD5F8C20,0x44972B6AD10F9D2A,0x46578121CA1151A1,0x46281A1E7672B320
.word 0x4094CC803E05BD98,0x5FF5B63C7812A363,0x6AF41E217F7612C5,0x4B7B4452B1E208AC
.word 0x750F8A67FA5E72E4,0x51C8ECF29B5E8AD1,0x580550353D81B486,0x668CD4C5F3970ABF
.word 0x480BEE00A16715AD,0x4888D5AC9EE02467,0x77C3DDBA62669040,0x48D55CDF7F706867
.word 0x720670341FE6E445,0x6CAE4383191C2CC9,0x4F9E28BAD0270344,0x46DAD4328A8A3979
.word 0x55B7AEB598729716,0x76D0F139C5FF97C5,0x4B876EB39C2DC380,0x781ADC2AD91E6FDF
.word 0x53BDEAF8F4AA0625,0x624D7EA5B9A73772,0x75A02137A787850D,0x4259BDE1C33A32E6
len: .word 100
.text
daddi $t0,$zero,8 # $t0 = i = 8
ld $t1,len($zero) # $t1 = len
dsll $t1,$t1,3 # $t1 = len*8
for: slt $t2,$t0,$t1 # i < len?
beqz $t2,out # yes - exit
dadd $t3,$zero,$t0 # $t3=j=i
ld $t4,array($t0) # $t4=B=a[i]
loop: slt $t2,$zero,$t3 # j>0 ?
beqz $t2,over # no -exit
daddi $t5,$t3,-8 # $t5=j-1
ld $t6,array($t5) # get $t6=a[j-1]
slt $t2,$t6,$t4 # >B ?
beqz $t2,over
sd $t6,array($t3) # a[j]=a[j-1]
dadd $t3,$zero,$t5 # j--
j loop
over: sd $t4,array($t3) # a[j] = B
daddi $t0,$t0,8 # i++
j for
out: halt
代码二：
; Unsigned multiplication of two 64-bit numbers on MIPS64 processor
; Result is 128-bits w=x*y
;
.data
x: .word 0xFFFFFFFFFFFFFFFF
y: .word 0xFFFFFFFFFFFFFFFF
w: .word 0,0
.text
start: jal mul ; call subroutine
nop
halt
mul: daddi r1,r0,64 ; r1=64 bits
daddi r5,r0,63 ; for shifting
daddu r2,r0,r0 ; r2=0
daddu r10,r0,r0 ; r10=0
ld r3,x(r0) ; r3=x
ld r4,y(r0) ; r4=y
andi r9,r3,1 ; check LSB of x
dsub r9,r0,r9 ;; negate it
dsrl r3,r3,1 ; and then shift it right
again: ;daddu r6,r0,r0
;; movn r6,r4,r9
and r6,r4,r9
daddu r2,r2,r6
sltu r7,r2,r6 ; did it overflow?
dsllv r7,r7,r5 ; catch overflowed bit
andi r10,r2,1 ; get LSB of r2 ..
dsllv r10,r10,r5 ; .. becomes MSB of r3
dsrl r2,r2,1 ; 64-bit shift of r2,r3
or r2,r2,r7 ; or in overflowed bit
andi r9,r3,1 ; catch LSB
dsub r9,r0,r9 ;; negate it
daddi r1,r1,-1 ; here to avoid stall
dsrl r3,r3,1
or r3,r3,r10 ; shift it right, and set MSB
bnez r1,again
sd r2,w(r0) ; store answer
sd r3,w+8(r0)
jr r31