World: r4wp
[#Red] Red language group
older newer | first last |
DocKimbel 8-Mar-2013 [6084x2] | Function => native |
So `print [1 + 2]` could be compiled efficiently by the compiler (calling the native with a reduced block), while `print a` will directly call the native version. | |
Kaj 8-Mar-2013 [6086] | Would you have to do that with all functions that reduce? |
DocKimbel 8-Mar-2013 [6087x2] | Currently, REDUCE and COMPOSE are handled like that by the compiler. |
They have a native common part anyway, as some parts cannot be statically compiled. | |
Kaj 8-Mar-2013 [6089] | But REFORM etcetera? |
DocKimbel 8-Mar-2013 [6090] | These less used functions could be implemented as mezz only. |
Kaj 8-Mar-2013 [6091] | I'm not sure which are more performance critical |
DocKimbel 8-Mar-2013 [6092x3] | It is not mandatory to make the compiler handle it, it will just produce faster code, as the expressions will be statically compiled instead of been interpreted. |
It would be good to have some benchmarks on these to see the gains the compiler brings (it will be vary a lot I guess). | |
-be | |
Kaj 8-Mar-2013 [6095x2] | I don't see COMPOSE in the intrinsics |
Shouldn't DO be an intrinsic, so it can compile literal blocks? | |
DocKimbel 8-Mar-2013 [6097x3] | Right, I've removed COMPOSE as an intrinsic, the implementation was too complicated and wasn't better than the purely native version. |
DO: it was supposed to be handled by the compiler for literal blocks, but as it is the main way to invoke the interpreter, I wanted it to be consistent whatever argument was passed. | |
Also, later, I realized that if I make DO an intrinsic, expressions in functions like: `do [foo: :bar]` (where `bar` is a function) would be more complicated to write for the user, as the literal block would be compiled, loosing the advantage of interpreter here. So it would have required user to write instead: `code: [foo: :bar] do code`. | |
Kaj 8-Mar-2013 [6100x4] | Hm, intricate |
So REDUCE is the most performant of all? | |
Andreas' R3 build is a bit slower even than mine, so nothing wrong with mine it seems. Apparently R3 is 10% slower than R2 on Fibonacci 40 | |
(On my machine, current constellation of the stars, etcetera, etcetera) | |
DocKimbel 8-Mar-2013 [6104x2] | :-)) |
Right, REDUCE on a literal block should be the fastest way to evaluate code dynamically, for now. | |
Kaj 8-Mar-2013 [6106] | Do you know of any other language that intertwines an interpreter and a compiler so intimately? |
DocKimbel 8-Mar-2013 [6107x3] | No, not the way Red does it (static AOT compiler + interpreter), but as there are thousands of languages out there, I guess that there are probably others that use the same technique. Thinking about that, there's a more classical approach used by some JIT compilers like LuaJIT, that by default runs under an interpreter, gather runtime stats, then starts replacing some nested loops with JIT-compiled code (principle of a tracing JIT). So, such architecture implies an interwined interpreter and JIT-compiler. |
Maybe some Lisps are using the same approach than Red, but I'm not aware of any. | |
Almost time to wake up...but I haven't gone to sleep yet. :-) Good night! | |
Kaj 8-Mar-2013 [6110x4] | Same here. Night |
It's hard to debug in the interpreter because it doesn't warn for undefined values. Would that be much work to implement? | |
On the other hand, unknown paths now exit the interpreter with an error. That's what they should do, but the error currently can't be trapped, so it makes tools such as GTK-IDE unworkable | |
Could both these situations issue a warning and not an error for now? | |
DocKimbel 9-Mar-2013 [6114] | That should be doable. |
Endo 9-Mar-2013 [6115] | Another 40 eu goes to Doc, for the great progress! |
DocKimbel 9-Mar-2013 [6116x4] | Received it, thanks a lot Endo! |
Added preliminary file! support (doesn't work from compiler yet, only from interpreter). | |
red>> a: %dev == %dev red>> type? a == file! red>> length? a == 3 red>> append a %/red/hello.red == %dev/red/hello.red red>> length? a == 17 red>> find a slash == %/red/hello.red red>> index? find a slash == 4 red>> form a == "dev/red/hello.red" red>> mold a == "%dev/red/hello.red" red>> a/1 == #"d" red>> last a == #"d" red>> a/5: #"R" == #"R" red>> a == %dev/Red/hello.red | |
I will add compiler support later today. | |
Gregg 9-Mar-2013 [6120] | Very cool Doc! |
DocKimbel 9-Mar-2013 [6121] | I'm counting 27 datatypes implemented so far in Red. The next on the list will be: typeset!, errror!, object!, port!, binary!. Although, I'm not sure in which precise order they will be added (especially for error! and object!, not sure which one I'll do first). For other datatypes, like float!, date! and time!, which are not a requirement for building Red core itself, I would like them to be contributed if possible. I could provide a sample empty datatype file and instructions on how to use Red's current internal API to anyone willing to work on them. |
Pekr 9-Mar-2013 [6122x2] | image! :-) |
vector! | |
DocKimbel 9-Mar-2013 [6124x3] | Vector! is a bit tricky and I might use it for parallel processing, so I will probably implement it myself. |
Image! could be contributed too (would require loader and savers do be also added). | |
Image! should be built as an add-on module, that you choose to import in your app. | |
Pekr 9-Mar-2013 [6127x2] | IIRC, vector! and range! were not even precisely defined for R3, so those two might use some discussions between our two projects ... |
I don't want to import anything :-) | |
DocKimbel 9-Mar-2013 [6129x2] | Pekr: think SDK! :-) |
But don't worry, you'll have your fat single all-in-one binary too. ;-) | |
Pekr 9-Mar-2013 [6131x2] | well, OK - so I might built full-contained Red executable with all stuff which I need? |
The thing is, if I will have to use import, or not - how that module/component system will work. Btw - what were technically R2 components? We could see them in system structure .... | |
DocKimbel 9-Mar-2013 [6133] | Yes, you'll be able to just build your fat binary/interpreter yourself including whatever module you want. |
older newer | first last |