|
Members in Shoutbox
None.
Shoutbox Search
Shoutbox Commands
/w [name] > Whisper
/r > Reply to last whisper /me > Marks as action Shoutbox Information
Moderators may delete any and all shouts at will.
|
Global Shoutbox
Please log in to shout.
[2014-9-09. : 7:22 am]  O)FaRTy1billion[MM] -- I like how two harmonics on adjacent strings can be so dissonant, yet when you just play the two strings you don't hear any dissonance[2014-9-09. : 4:49 am] O)FaRTy1billion[MM] -- like copy the register to another, shift left 1, add back the original, shift twice more.[2014-9-09. : 4:48 am] O)FaRTy1billion[MM] -- I had several routines for basic binary multiplication, but it made it complicated[2014-9-09. : 4:47 am] O)FaRTy1billion[MM] -- the best way to multiply was if it happened to easily relate to powers of 2 ...[2014-9-09. : 4:47 am] O)FaRTy1billion[MM] -- a, b, c, d, e, f, h, and l for af, bd, de, and hl. 'f' being the flags (carry, zero, parity, etc.)[2014-9-09. : 4:46 am] O)FaRTy1billion[MM] -- it had 8 bit registers that could be combined in to 16 bit registers.[2014-9-09. : 4:46 am] O)FaRTy1billion[MM] -- It'd be way easier for x86 .. I was using z80 which didn't have any sort of multiply or divide[2014-9-09. : 4:44 am]  jjf28 -- I always just wrote the C code, then converted to 1 statement-per line, then the ASM would fly right of me[2014-9-09. : 4:42 am] O)FaRTy1billion[MM] -- ASM is really fun, it just easily becomes complicated to do simple tasks  [2014-9-09. : 4:41 am] O)FaRTy1billion[MM] -- oh, the calculator functions actually worked like that. you basically jump to a specific memory address followed by the code of the function you want and then it would pop, read then next two bytes, and then push the new address and call the appropriate system routine[2014-9-09. : 4:40 am] jjf28 -- I was surprised that did that in x86, I was used to having a defined return (to previously linked point) function in the language i used[2014-9-09. : 4:39 am] O)FaRTy1billion[MM] -- or like call thing, then thing: pop bc // know where you're calling from![2014-9-09. : 4:36 am] O)FaRTy1billion[MM] -- what's super fun is recursive functions and then exploding the stack [2014-9-09. : 4:36 am] O)FaRTy1billion[MM] -- I guess you can increment the stackptr when adding and decrement when removing, but in my experience with z80 asm it does it the other way [2014-9-09. : 4:34 am] O)FaRTy1billion[MM] -- basically push(value){ *stackptr = value; stackptr -= sizeof(value); } or pop(*value){ *value = *stackptr; stackptr += sizeof(value); }[2014-9-09. : 4:34 am] jjf28 -- adding is as simple as setting the item you're about to add's next value to the stack pointer, and then setting the stack pointer to the addition[2014-9-09. : 4:33 am] O)FaRTy1billion[MM] -- I only know of a stack in the sense of ASM, where you push and pop from the stack [2014-9-09. : 4:33 am] jjf28 -- struct* stack = nullptr; struct* addition = ...; addition.next = stack; stack = addition[2014-9-09. : 4:31 am] O)FaRTy1billion[MM] -- linked lists are cool, I started using them with tinymap2 to keep track of files without needing to reallocate and move a bunch of memory around all the time[2014-9-09. : 4:31 am] jjf28 -- http://www.cs.usfca.edu/~srollins/courses/cs112-f07/web/notes/linkedlists/ll2.gif[2014-9-09. : 4:30 am] O)FaRTy1billion[MM] -- I know what a stack is, but I'm not sure if my understanding applies[2014-9-09. : 4:29 am] payne -- http://www.staredit.net/site/magicboxes/ I wish I could open that bottom left box!  [2014-9-09. : 4:29 am] O)FaRTy1billion[MM] -- I always write crazy things with pointers every whichway, and go to compile and get a few warnings and think "This is never going to work." and then am always pleasantly surprised that, after fixing the warnings and recompiling, that it works flawlessly. [2014-9-09. : 4:26 am] jjf28 -- right so there were 50 problems with my pointers, I got rid of enough for this not to crash till you try to close it, so the TA won't notice  [2014-9-09. : 4:25 am] O)FaRTy1billion[MM] -- my code works, dammit. I may be too tired and falling asleep to know how or why, but it gets the job done. [2014-9-09. : 4:23 am] O)FaRTy1billion[MM] -- Although that wasn't really a meaningful error since it checked for something that would never have happened anyway. |
Members Online: 5camilae1523eh1, 
Ultraviolet
Ultraviolet