This is a big help. The lang ref and docs are kind of scary when you have no background info. Now I feel like I can go in and read them with a lot less confusion. Thanks!
Nice tutorial, but it seems that there's a small mistake in the example (13:20): recursive_base should be ``` recursive_base: %1 = add i32 -1, %val %2 = call i32 @factorial(i32 %1) %3 = mul i32 %val, %2 ret i32 %3 ```
I was looking to see if someone pointed that out, I wasn't sure if there was some obscure reason to have the indices on the right side of the asignation to be one less than on the left side haha
This is a big help. The lang ref and docs are kind of scary when you have no background info.
Now I feel like I can go in and read them with a lot less confusion. Thanks!
Probably the best talk on this channel
Nice tutorial, but it seems that there's a small mistake in the example (13:20):
recursive_base should be
```
recursive_base:
%1 = add i32 -1, %val
%2 = call i32 @factorial(i32 %1)
%3 = mul i32 %val, %2
ret i32 %3
```
Yup, you're absolutely right :)
@Lovely Douche glad it helped!
I was unsure and then found this reply!!! Nice
I was looking to see if someone pointed that out, I wasn't sure if there was some obscure reason to have the indices on the right side of the asignation to be one less than on the left side haha
Always find myself coming back to this talk. It's clear and concise! 👍
The presentation is well-designed for beginners.
Thank you for the tutorial!
Thank. This is very helpful. Excellent tutorial.
Nice presentation, congrats!
Nice and clear explaination. Thank you.
Is any of this changed by LLVM opaque pointers?
quite clear and organized
an excellent tutorial ! Thanks !!
13:24 haha the IR is wrong, its supposed to return %3 not %2
Still fire!
Thank you
This is great. I have to write a small IR compiler(while having no idea what LLVM IR is) and this was of great help.
кто по ссылке from Konstantin Vladimirov?