03:02 <tankf33der> razzy: llvm-ir is well optimized by a special tool called 'opt' with argument '-O3'

03:02 <tankf33der> check src/Makefile

04:48 <razzy> tankf33der: as i read, llvm has many libraries and infinite possibilities for optimization. my question is, if it is good as it is. i understand, that perfect optimization depends on code you run in ipl

04:48 <razzy> *pil

04:49 <razzy> good morning to all ;], btw.

05:55 <tankf33der> razzy: i belive you will not find any *working* and active develope optimizers.

05:56 <tankf33der> opt -O3 is enough.

06:33 <Regenaxer> Hi razzy, tankf33der!

06:34 <Regenaxer> There are two places to optimize: PilSrc -> LLVM-IR and LLVM-IR -> machine assembly

06:35 <Regenaxer> For PilSrc -> LLVM-IR I tried my best

06:35 <Regenaxer> and for backend llvm opt should be the best we can do

06:41 <razzy> thank you for answers Regenaxer tankf33der

06:47 <Regenaxer> And for optimizing Lisp level code, a simple rule is to choose the smallest version. Use 'size" to measure it.

06:47 <Regenaxer> And then of course measure with 'bench' overall speed

08:16 <razzy> I propably asked it before. only way to store graph is in pil database yes? for example AST(abstract syntax tree)

08:18 <Regenaxer> Why only in DB? The natural Lisp way is in s-expressions

08:18 <Regenaxer> DB is just for persistence

14:46 <razzy> Regenaxer: I think s-expression naturally express kind of one way tree like AST. if i have general graph, i am not sure if it works.

14:46 <Regenaxer> You can build any structure

14:47 <Regenaxer> see e.g. doubly linked lists in rosettacode

14:47 <Regenaxer> Or you make objects with properties

14:47 <razzy> i know, but searching in big data can be trouble

14:47 <Regenaxer> the DB is also *only* objects with properties

14:48 <razzy> doubly linked list seem broken last time

14:48 <Regenaxer> just made persistent

14:50 <razzy> ok, worst case, i build something. thank you :]

15:55 <seteeri> hello

15:59 <Regenaxer> Cheers seteeri!

15:59 <seteeri> it has been a while. hopefully all is well!

16:00 <Regenaxer> yes :)

16:00 <seteeri> finally moved back to the US so I can get back into programming again

16:01 <seteeri> so I encountered a stack overflow with the code from here: https://rosettacode.org/wiki/Doubly-linked_list/Definition#PicoLisp

16:01 <Regenaxer> Where have you been?

16:01 <seteeri> I was in the UK

16:01 <Regenaxer> ok

17:35 <beneroth> cheers seteeri

18:03 <seteeri> hello beneroth!