[evan]

just made a bubble sort in assembly. I feel awesome.

[scratt]

Nice work. There is nothing like coding in ASM to put hairs on your chest!!

What flavour of assembly? i386, ARM... ?

[Baron Munchausen]

I am really glad to hear people still get a buzz from doing such things and I am also happy now I realised that I got a buzz from hearing about another person doing it!

I always used to check key routines or fragments to see what the compiler created in machine code. People who write compilers sure know their machine code!

Brings it home that a computer does only a few things such as loads, compares, add/subtract, shift, branch.

[bassplayinMacFiend]

Wow, that's awesome! I did ASM in SPIM ( a MIPS emulator) back in school. I loved ASM because with proper flowcharting, an ASM program will run right the first time it's programmed. Plus I think it's wicked to get "inside the head" of a CPU and get a solid understanding of how it works / what makes it tick.

[Ryan]

Originally Posted by bassplayinMacFiend Wow, that's awesome! I did ASM in SPIM ( a MIPS emulator) back in school. I loved ASM because with proper flowcharting, an ASM program will run right the first time it's programmed. Plus I think it's wicked to get "inside the head" of a CPU and get a solid understanding of how it works / what makes it tick.

I’m in a class using the same tool right now. We haven’t written anything, we’re still on control flow and datapaths right now, but I think we’re starting that next week. Our semester project is to write our own MIPS emulator, so I should go get started on that.

[evan]

Originally Posted by scratt Nice work. There is nothing like coding in ASM to put hairs on your chest!! What flavour of assembly? i386, ARM... ?

IBCM

Here's my bubbles sort - it sorts the array that is the last 5 lines of code. obviously you could change N and a[] and put in a different array and (hopefully) it would still work.

C00A	00			jmp		start		skip around the variables0000	01	i		dw		0			int i0000	02	j		dw		0			int j0043	03	a		dw 		0			int a[] - array of 5 [ 5, 4, 3, 2, 1] 0005	04	N		dw		0			int N0001	05	one		dw		1			3000	06	loadit	dw		30006000	07	subit	dw		60000000	08	temp	dw		04000	09	stoit	dw		40003004	0A	oloop	load	n			if (j >= N) goto xit6002	0B			sub 	jE023	0C			jmpl	xit			jump to exit if N < jD023	0D			jmpe	xit			jump to exit if N == j 3004	0E	iloop	load	n			if (i >= N-1) goto end of outterloop6001	0F			sub		i6005	10			sub		1E03D	11			jmpl	xit			jump to end of iloop if N < iD03D	12			jmpe	xit			jump to end of iloop if N == i 3006	13			load 	loadit		form instruction to load a[i]5003	14			add 	a5001	15			add 	i5005	16			add		1401C	17			store	doit		plant instruction into program3007	18			load 	subit		form instruction to load a[i]5003	19			add 	a5001	1A			add 	i401D	1B			store	doit2		plant instructions0000	1C	doit	load	doit0000	1D	doit2	dw		0E024	1E			jmpl	swap		goto swap if a[i]>a[i+1]3001	1F			load	i			i += 15005	20			add		one4001	21			store iC00E	22			jmp		loop		goto iloop0000	23			xit3006	24	swap	load 	loadit		form instructions to put a[i] in temp-----5003	25			add 	a5001	26			add 	i4028	27			store	doit3		plant instructions0000	28	doit3	dw		04008	29			store	a[i]		storing in temp -----------------3009	2A			load	stoit		form instructions to put a[i+1] in a[i]5003	2B			add		a5001	2C			add 	i4034	2D			store 	doit4		plant instructions to store in a[i+1]3006	2E			load 	loadit5005	2F			add		15003	30			add		a5001	31			add		i4033	32			store 	doit50000	33	doit5	dw		00000	34	doit4	dw		0			put a[i+1] into a[i]------------------3009	35			load	stoit		form instructions to put temp in a[i+1]5005	36			add		15003	37			add		a5001	38			add 	i403B	39			store 	doit63008	3A			load	temp0000	3B	doit6	dw		0			puts temp in [a+1]C01F	3C			jmp back into loop3002	3D			load	j			i += 15005	3E			add		one4002	3F			store j3050	40			load zero4001	41			store iC00A	42			jmp		loop		goto loop00050004000300020001

the first four digits of each line is all the compiler reads, the rest is just comments to make it readable.

when I finally got it it was awesome. One of the more rewarding programming experiences I've had (and last week we made our own hash tree! - in C++, not assembly )