, just wanted to pass you a reference cuz idk sql
1
1
1
you dont wanna know how many random tech stuff i'd buy and set up and manage just because
♂️ 
dbg_asserts are always enabledlet mut module = Module::new("example");
let mut func = Function::new("main", &[Parameter::new(Type::Int(32))], Type::Int(32));
let param = func.param(0)?;
let entry_block = func.entry_block;
let value = func.blocks[entry_block].instr_add(¶m, &Operand::const_i32(4))?;
let then_block = func.add_block(&[]);
let else_block = func.add_block(&[]);
let final_block = func.add_block(&[Type::Int(32)]);
let cond = func.blocks[entry_block].instr_icmp(
IcmpCond::Eq,
value.clone(),
Operand::const_i32(6),
)?;
func.blocks[entry_block].instr_cond_jmp(then_block, else_block, &cond, &[], &[]);
{
let value = func.blocks[then_block].instr_add(&value, &Operand::const_i32(2))?;
func.blocks[then_block].instr_jmp(final_block, &[value]);
}
{
let value = func.blocks[else_block].instr_add(&value, &Operand::const_i32(6))?;
func.blocks[else_block].instr_jmp(final_block, &[value]);
}
{
let param = func.blocks[final_block].arg(0)?;
func.blocks[final_block].instr_ret(Some(¶m));
}
module.functions.insert(func);
lower_module_to_llvmir(&module)?;
makes the following ir:
; ModuleID = 'example'
source_filename = "example"
define i32 @main(i32 %0) {
entry:
%1 = add i32 %0, 4
%2 = icmp eq i32 %1, 6
br i1 %2, label %bb0_true_1, label %bb0_false_2
%3 = add i32 %1, 2
bb0_true_1: ; preds = %entry
br label %bbbr
ret i32 %5
%4 = add i32 %3, 6
br label %bbbr
ret i32 %5
bb0_false_2: ; preds = %entry
bbbr: ; preds = %bb0_true_1, %bb0_true_1
%5 = phi i32 [ %3, %bb0_true_1 ], [ %3, %bb0_false_2 ]
}
@MilkeeyCat current IRVM status, can make simple stuff, the api can be improved more tho let mut module = Module::new("example");
let mut func = Function::new("main", &[Parameter::new(Type::Int(32))], Type::Int(32));
let param = func.param(0)?;
let entry_block = func.entry_block;
let value = func.blocks[entry_block].instr_add(¶m, &Operand::const_i32(4))?;
let then_block = func.add_block(&[]);
let else_block = func.add_block(&[]);
let final_block = func.add_block(&[Type::Int(32)]);
let cond = func.blocks[entry_block].instr_icmp(
IcmpCond::Eq,
value.clone(),
Operand::const_i32(6),
)?;
func.blocks[entry_block].instr_cond_jmp(then_block, else_block, &cond, &[], &[]);
{
let value = func.blocks[then_block].instr_add(&value, &Operand::const_i32(2))?;
func.blocks[then_block].instr_jmp(final_block, &[value]);
}
{
let value = func.blocks[else_block].instr_add(&value, &Operand::const_i32(6))?;
func.blocks[else_block].instr_jmp(final_block, &[value]);
}
{
let param = func.blocks[final_block].arg(0)?;
func.blocks[final_block].instr_ret(Some(¶m));
}
module.functions.insert(func);
lower_module_to_llvmir(&module)?;
makes the following ir:
; ModuleID = 'example'
source_filename = "example"
define i32 @main(i32 %0) {
entry:
%1 = add i32 %0, 4
%2 = icmp eq i32 %1, 6
br i1 %2, label %bb0_true_1, label %bb0_false_2
%3 = add i32 %1, 2
bb0_true_1: ; preds = %entry
br label %bbbr
ret i32 %5
%4 = add i32 %3, 6
br label %bbbr
ret i32 %5
bb0_false_2: ; preds = %entry
bbbr: ; preds = %bb0_true_1, %bb0_true_1
%5 = phi i32 [ %3, %bb0_true_1 ], [ %3, %bb0_false_2 ]
}
@MilkeeyCat current IRVM status, can make simple stuff, the api can be improved more tho 1
TextRender()->SetFontPreset(EFontPreset::ICON_FONT);
// create text container, or just draw text
TextRender()->SetFontPreset(EFontPreset::DEFAULT_FONT);
TextRender()->SetFontPreset(EFontPreset::ICON_FONT);
// create text container, or just draw text
TextRender()->SetFontPreset(EFontPreset::DEFAULT_FONT); 
Thank you @Jupstar ✪ for leading me to the right place, the rendering logic is partly a bit tideous 1 Thank you @Jupstar ✪ for leading me to the right place, the rendering logic is partly a bit tideous 
OVERLAYRENDERFLAG_TEXT but it's never passed as an argument
2
1
x = othervelrampvalue/(tick_speed * log(curvature)) @cached for lookup xD std::log is more optimized than I think, a cache-miss would instantly make it slower, so caching is not the best ideax = othervelrampvalue/(tick_speed * log(curvature)) std::log isn't too optimized, but we can replace that with some approximate log if needed, a taylor series approximation should be pretty accurate and cheap if needed x = othervelrampvalue/(tick_speed * log(curvature)) dbg_asserts are always enabled 
