s-macke

38 ms·

361.
by s-macke 10y ago
One of the most complex games Starflight of the 80th's is written in Forth. I had a lot of fun decompiling it. https://github.com/s-macke/starflight-reverse It turns out to be very portable because the assembler c
362.
by s-macke 10y ago
Just take a look at the link to the third talk I gave a few days ago about jor1k. https://github.com/s-macke/jor1k/wiki/Technical-details This talk give a few details about time frames and what someone has to
363.
by s-macke 10y ago
In this classical picture the decision which glove was in your pocket was made when you put it into your pocket. Still in your pocket, the glove already interacted with the world like a right or left glove e. g. the glove bulged the pocket
364.
by s-macke 10y ago
If you want to see fire based on real fluid dynamics take a look at Ron Fedkiw's site: http://physbam.stanford.edu/~fedkiw/ For example the following video: http://physbam.stanford.edu/~fedkiw&#x2F
365.
by s-macke 10y ago
Hmm, looks like I am wrong. The shift key is recognized by JavaScript.
366.
by s-macke 10y ago
The games needs about 130 MIPS in the emulation. If it runs at that speed you have to adjust the frame rate in the dropdown menu. But the main problem is the keyboard emulation. Frontier needs the shift key to slowdown the spaceship. And th
367.
by s-macke 10y ago
Try to play Frontier: Elite II on http://www.jor1k.com . When it finished booting just open the menu by typing "help" and then choose Elite in the graphic games menu. Change to 30 frames per second. This way it runs smo
368.
by s-macke 11y ago
Great work on your emulator. I am also looking forward to use webassembly for my emulator when available. However, I don't expect much speed improvement. I guess you can speed up your emulator significantly by putting in some '|0&
369.
Artur Fischer, Creator of the Nimble Screw Anchor, Dies at 96(bloomberg.com)
2 points by s-macke 11y ago|0 comments
370.
by s-macke 11y ago
For me quantum mechanics is something like a complex cooking receipe. We have equations, we know what we have to put into these equations to solve certain systems. The rest is just an endless variety of coordinate transformations, model ass
371.
by s-macke 11y ago
I was never happy with this statement. Because obviously we can make very accurate predictions by applying quantum mechanics. The problem with this statement is, that the meaning of "understanding" is unclear here. When I say &quo
372.
by s-macke 11y ago
And here an online player for SID files: http://simulationcorner.net/Sidplayer/index.html
373.
by s-macke 11y ago
Yes, by using f2c. For BLAS and LAPACK, this is a big effort and doesn't run out of the box. The cblas libraries are too old and don't contain new functions.
374.
by s-macke 11y ago
If this is true I can also compile scientific software with emscripten to Javascript, which is then able to compile the Fortran libraries BLAS and LAPACK. I like to have one click live demos of such software. Speed and memory doesn't m
375.
by s-macke 11y ago
You need just the Linux kernel and Busybox in order to run Linux with a working shell. 2-4 MB all together I would say. My first Internet router ran a Linux from a 1.44MB disk 15 years ago.
376.
by s-macke 11y ago
Yes, you did. Try this website to believe it ;) http://s-macke.github.io/jor1k/demos/compile.html
377.
by s-macke 11y ago
Did you know, that he rewrote his code to support asm.js lately. Fabrice Bellard asked me to update my small benchmark. https://github.com/s-macke/jor1k/wiki/Benchmark-with-other-e...
378.
by s-macke 11y ago
Perfect moment to mention my little project. http://simulationcorner.net/index.php?page=sam I have to admit, that the quality is not good. But it also works on embedded systems.
379.
by s-macke 11y ago
Well, just look at these lines of code: https://github.com/s-macke/jor1k/tree/master/js/worker/or1k/... I tried something like this already. I mean to recompile parts of the code into Java
380.
by s-macke 11y ago
Call me crazy, but what I would really like to see is a port to the Javascript "architecture", that you can compile via emscripten. In principle this should already be possible by using the current User Mode Linux target. But I g
381.
by s-macke 11y ago
I guess the problem is, that the new privileged ISA has to be implemented. With this ISA, Linux runs only via a proxy kernel and the devices have to be accessed in a special way. I guess it will take time until it will go upstream.
382.
by s-macke 11y ago
The RISC-V port in jor1k supports only 32-Bit whereas Angel supports only 64-Bit. Also jor1k supports the newest privilege instruction API whereas Angel hasn't been updated yet. Especially the jor1k port is assembler optimized by look
383.
by s-macke 11y ago
Hacked something together. Seems to work. http://simulationcorner.net/maze/
384.
by s-macke 11y ago
Yes, open boundary conditions at the walls. I am not sure what happens if you have two possible paths to the exit but one of them is wider, but longer. It might not always find the shortest path. I like this main idea, because it is indepen
385.
by s-macke 11y ago
Thanks. Indeed, the idea looks similar.
386.
by s-macke 11y ago
I would like to see a code, which solves a maze by calculating the Poisson equation for pressure. As boundary condition set high pressure at the start of the maze and low pressure at the end and follow the steepest decent.
387.
by s-macke 11y ago
Thanks. I have made my own small list of emulators a while ago: https://github.com/s-macke/jor1k/wiki/Similar-emulators-writ... It looks like you covered them all (except maybe http://schweigi.gith
388.
by s-macke 11y ago
At least you forgot one: Angel http://riscv.org/angel/ https://github.com/riscv/riscv-angel
389.
by s-macke 11y ago
Yes, more or less. Every operation must be written, that the type is obvious for the compiler. And you have one array, the heap with some special index rules. For example: (r[((ins >> 9) & 0x7C)>>2]|0 The >>2 and |0 is
390.
by s-macke 11y ago
Exactly. When I ported my software manually, it was the warning messages that helped. After that I can remove the "asm.js" statement and achieve almost the same performance (around 80% of max speed). asm.js runs currently through

More ›