So I changed things up and got some dedicated hosting to No Support Linux Hosting from wordpress.com + domain mapping. So far, I’m loving their setup Anywho, expect to see more here; there’s a reason why I got myself some dedicated hosting. Peace. Out.

This is a big reason why I haven’t really touched dynarec in a good while. So I was writing up the whole pseudo asm dealie, works a lot how I’m doing it with x86 opcodes now except more generic. At compile time I wanted to translate the generic ones to the real calls, that’s easy… [...]

Or fast as ballz memory pool. The memory pool is now really close to O(1) allocation and deletion. As much as I’d like to take credit for it, I can’t. My friend Marcel Girgis (of Elysian Shadows) figured it out, I just applied it to the memory pool and asked a load of questions about [...]

Or how to reduce worst case (O(N)) showing up. So I’ve managed to free up some memory and make mp_alloc super fast. Freeing up memory is in regard to mp_block (it used to be a node for a linked list type deal), but since I was already bulk allocating the entire linked list I figured [...]

Right, So here’s what I got done: Implemented Red-black tree for code lookup. Implemented memory pool for red-black node allocation. What I’m currently working on is making it so you can have more than one instance of dynarec in a project (it’s pretty sloppy right now, almost everything is coded for one instance only). Adding [...]

Man, Red-black trees are awesomely cool. But damn, they sure do make you work for it. So yeah, I’m currently ripping out the old POS code lookup stuff for a red black tree implementation to get better lookup times, insertion times, etc. Now if you’re thinking “but that’ll fragment the memory!” you’re one the same [...]

So yeah, this is My Stack Trace. I’ll be posting thoughts on code and projects I’m working on.