mirror of
https://github.com/c3lang/c3c.git
synced 2026-02-27 12:01:16 +00:00
Rename muldiv and update tests for LLVM 20
This commit is contained in:
@@ -530,7 +530,7 @@ check: ; preds = %no_match, %entry
|
||||
missing_function: ; preds = %check
|
||||
ret ptr null
|
||||
compare: ; preds = %check
|
||||
%4 = getelementptr inbounds { ptr, ptr, ptr }, ptr %2, i32 0, i32 1
|
||||
%4 = getelementptr inbounds
|
||||
%5 = load ptr, ptr %4, align 8
|
||||
%6 = icmp eq ptr %5, %1
|
||||
br i1 %6, label %match, label %no_match
|
||||
@@ -538,7 +538,7 @@ match: ; preds = %compare
|
||||
%7 = load ptr, ptr %2, align 8
|
||||
ret ptr %7
|
||||
no_match: ; preds = %compare
|
||||
%8 = getelementptr inbounds { ptr, ptr, ptr }, ptr %2, i32 0, i32 2
|
||||
%8 = getelementptr inbounds
|
||||
%9 = load ptr, ptr %8, align 8
|
||||
br label %check
|
||||
}
|
||||
|
||||
@@ -156,7 +156,7 @@ check: ; preds = %no_match, %entry
|
||||
missing_function: ; preds = %check
|
||||
ret ptr null
|
||||
compare: ; preds = %check
|
||||
%4 = getelementptr inbounds { ptr, ptr, ptr }, ptr %2, i32 0, i32 1
|
||||
%4 = getelementptr inbounds
|
||||
%5 = load ptr, ptr %4, align 8
|
||||
%6 = icmp eq ptr %5, %1
|
||||
br i1 %6, label %match, label %no_match
|
||||
@@ -164,7 +164,7 @@ match: ; preds = %compare
|
||||
%7 = load ptr, ptr %2, align 8
|
||||
ret ptr %7
|
||||
no_match: ; preds = %compare
|
||||
%8 = getelementptr inbounds { ptr, ptr, ptr }, ptr %2, i32 0, i32 2
|
||||
%8 = getelementptr inbounds
|
||||
%9 = load ptr, ptr %8, align 8
|
||||
br label %check
|
||||
}
|
||||
@@ -172,23 +172,23 @@ define internal void @.c3_dynamic_register() align 8 {
|
||||
entry:
|
||||
br label %dtable_check
|
||||
dtable_check: ; preds = %dtable_next, %entry
|
||||
%dtable_ref = phi ptr [ getelementptr inbounds (%.introspect, ptr @"$ct.inherit.Test", i32 0, i32 2), %entry ], [ %next_dtable_ref, %dtable_next ]
|
||||
%dtable_ref = phi ptr [ getelementptr inbounds
|
||||
%dtable_ptr = load ptr, ptr %dtable_ref, align 8
|
||||
%0 = icmp eq ptr %dtable_ptr, null
|
||||
br i1 %0, label %dtable_found, label %dtable_next
|
||||
dtable_next: ; preds = %dtable_check
|
||||
%next_dtable_ref = getelementptr inbounds { ptr, ptr, ptr }, ptr %dtable_ptr, i32 0, i32 2
|
||||
%next_dtable_ref = getelementptr inbounds
|
||||
br label %dtable_check
|
||||
dtable_found: ; preds = %dtable_check
|
||||
store ptr @"$ct.dyn.inherit.Test.tesT", ptr %dtable_ref, align 8
|
||||
br label %dtable_check1
|
||||
dtable_check1: ; preds = %dtable_next4, %dtable_found
|
||||
%dtable_ref2 = phi ptr [ getelementptr inbounds (%.introspect, ptr @"$ct.inherit.Test", i32 0, i32 2), %dtable_found ], [ %next_dtable_ref5, %dtable_next4 ]
|
||||
%dtable_ref2 = phi ptr [ getelementptr inbounds
|
||||
%dtable_ptr3 = load ptr, ptr %dtable_ref2, align 8
|
||||
%1 = icmp eq ptr %dtable_ptr3, null
|
||||
br i1 %1, label %dtable_found6, label %dtable_next4
|
||||
dtable_next4: ; preds = %dtable_check1
|
||||
%next_dtable_ref5 = getelementptr inbounds { ptr, ptr, ptr }, ptr %dtable_ptr3, i32 0, i32 2
|
||||
%next_dtable_ref5 = getelementptr inbounds
|
||||
br label %dtable_check1
|
||||
dtable_found6: ; preds = %dtable_check1
|
||||
store ptr @"$ct.dyn.inherit.Test.hello", ptr %dtable_ref2, align 8
|
||||
|
||||
@@ -149,7 +149,7 @@ check: ; preds = %no_match, %entry
|
||||
missing_function: ; preds = %check
|
||||
ret ptr null
|
||||
compare: ; preds = %check
|
||||
%4 = getelementptr inbounds { ptr, ptr, ptr }, ptr %2, i32 0, i32 1
|
||||
%4 = getelementptr inbounds
|
||||
%5 = load ptr, ptr %4, align 8
|
||||
%6 = icmp eq ptr %5, %1
|
||||
br i1 %6, label %match, label %no_match
|
||||
@@ -157,7 +157,7 @@ match: ; preds = %compare
|
||||
%7 = load ptr, ptr %2, align 8
|
||||
ret ptr %7
|
||||
no_match: ; preds = %compare
|
||||
%8 = getelementptr inbounds { ptr, ptr, ptr }, ptr %2, i32 0, i32 2
|
||||
%8 = getelementptr inbounds
|
||||
%9 = load ptr, ptr %8, align 8
|
||||
br label %check
|
||||
}
|
||||
|
||||
@@ -149,7 +149,7 @@ check: ; preds = %no_match, %entry
|
||||
missing_function: ; preds = %check
|
||||
ret ptr null
|
||||
compare: ; preds = %check
|
||||
%4 = getelementptr inbounds { ptr, ptr, ptr }, ptr %2, i32 0, i32 1
|
||||
%4 = getelementptr inbounds
|
||||
%5 = load ptr, ptr %4, align 8
|
||||
%6 = icmp eq ptr %5, %1
|
||||
br i1 %6, label %match, label %no_match
|
||||
@@ -157,7 +157,7 @@ match: ; preds = %compare
|
||||
%7 = load ptr, ptr %2, align 8
|
||||
ret ptr %7
|
||||
no_match: ; preds = %compare
|
||||
%8 = getelementptr inbounds { ptr, ptr, ptr }, ptr %2, i32 0, i32 2
|
||||
%8 = getelementptr inbounds
|
||||
%9 = load ptr, ptr %8, align 8
|
||||
br label %check
|
||||
}
|
||||
@@ -165,23 +165,23 @@ define internal void @.c3_dynamic_register() align 8 {
|
||||
entry:
|
||||
br label %dtable_check
|
||||
dtable_check: ; preds = %dtable_next, %entry
|
||||
%dtable_ref = phi ptr [ getelementptr inbounds (%.introspect, ptr @"$ct.overlap.Test", i32 0, i32 2), %entry ], [ %next_dtable_ref, %dtable_next ]
|
||||
%dtable_ref = phi ptr [ getelementptr inbounds
|
||||
%dtable_ptr = load ptr, ptr %dtable_ref, align 8
|
||||
%0 = icmp eq ptr %dtable_ptr, null
|
||||
br i1 %0, label %dtable_found, label %dtable_next
|
||||
dtable_next: ; preds = %dtable_check
|
||||
%next_dtable_ref = getelementptr inbounds { ptr, ptr, ptr }, ptr %dtable_ptr, i32 0, i32 2
|
||||
%next_dtable_ref = getelementptr inbounds
|
||||
br label %dtable_check
|
||||
dtable_found: ; preds = %dtable_check
|
||||
store ptr @"$ct.dyn.overlap.Test.tesT", ptr %dtable_ref, align 8
|
||||
br label %dtable_check1
|
||||
dtable_check1: ; preds = %dtable_next4, %dtable_found
|
||||
%dtable_ref2 = phi ptr [ getelementptr inbounds (%.introspect, ptr @"$ct.overlap.Test", i32 0, i32 2), %dtable_found ], [ %next_dtable_ref5, %dtable_next4 ]
|
||||
%dtable_ref2 = phi ptr [ getelementptr inbounds
|
||||
%dtable_ptr3 = load ptr, ptr %dtable_ref2, align 8
|
||||
%1 = icmp eq ptr %dtable_ptr3, null
|
||||
br i1 %1, label %dtable_found6, label %dtable_next4
|
||||
dtable_next4: ; preds = %dtable_check1
|
||||
%next_dtable_ref5 = getelementptr inbounds { ptr, ptr, ptr }, ptr %dtable_ptr3, i32 0, i32 2
|
||||
%next_dtable_ref5 = getelementptr inbounds
|
||||
br label %dtable_check1
|
||||
dtable_found6: ; preds = %dtable_check1
|
||||
store ptr @"$ct.dyn.overlap.Test.foo", ptr %dtable_ref2, align 8
|
||||
|
||||
@@ -160,7 +160,7 @@ missing_function: ; preds = %check
|
||||
ret ptr null
|
||||
|
||||
compare: ; preds = %check
|
||||
%4 = getelementptr inbounds { ptr, ptr, ptr }, ptr %2, i32 0, i32 1
|
||||
%4 = getelementptr inbounds
|
||||
%5 = load ptr, ptr %4, align 8
|
||||
%6 = icmp eq ptr %5, %1
|
||||
br i1 %6, label %match, label %no_match
|
||||
@@ -170,7 +170,7 @@ match: ; preds = %compare
|
||||
ret ptr %7
|
||||
|
||||
no_match: ; preds = %compare
|
||||
%8 = getelementptr inbounds { ptr, ptr, ptr }, ptr %2, i32 0, i32 2
|
||||
%8 = getelementptr inbounds
|
||||
%9 = load ptr, ptr %8, align 8
|
||||
br label %check
|
||||
}
|
||||
|
||||
@@ -37,7 +37,7 @@ faultname_no: ; preds = %entry
|
||||
|
||||
faultname_ok: ; preds = %entry
|
||||
%3 = inttoptr i64 %2 to ptr
|
||||
%4 = getelementptr inbounds %.fault, ptr %3, i32 0, i32 1
|
||||
%4 = getelementptr inbounds
|
||||
br label %faultname_exit
|
||||
|
||||
faultname_exit: ; preds = %faultname_ok, %faultname_no
|
||||
|
||||
@@ -37,7 +37,7 @@ entry:
|
||||
%error_var4 = alloca i64, align 8
|
||||
%error_var10 = alloca i64, align 8
|
||||
%zext = zext i32 %0 to i64
|
||||
%ptroffset_any = getelementptr [16 x i8], ptr getelementptr inbounds (%.introspect, ptr @"$ct.test.Enum", i32 0, i32 6), i64 %zext
|
||||
%ptroffset_any = getelementptr [16 x i8], ptr getelementptr inbounds
|
||||
call void @llvm.memcpy.p0.p0.i32(ptr align 8 %x, ptr align 8 %ptroffset_any, i32 16, i1 false)
|
||||
%1 = call ptr @std.io.stdout()
|
||||
call void @llvm.memcpy.p0.p0.i32(ptr align 8 %x1, ptr align 8 %x, i32 16, i1 false)
|
||||
|
||||
@@ -273,13 +273,13 @@ entry:
|
||||
br label %dtable_check
|
||||
|
||||
dtable_check: ; preds = %dtable_next, %entry
|
||||
%dtable_ref = phi ptr [ getelementptr inbounds (%.introspect, ptr @"$ct.test.Foo", i32 0, i32 2), %entry ], [ %next_dtable_ref, %dtable_next ]
|
||||
%dtable_ref = phi ptr [ getelementptr inbounds
|
||||
%dtable_ptr = load ptr, ptr %dtable_ref, align 8
|
||||
%0 = icmp eq ptr %dtable_ptr, null
|
||||
br i1 %0, label %dtable_found, label %dtable_next
|
||||
|
||||
dtable_next: ; preds = %dtable_check
|
||||
%next_dtable_ref = getelementptr inbounds { ptr, ptr, ptr }, ptr %dtable_ptr, i32 0, i32 2
|
||||
%next_dtable_ref = getelementptr inbounds
|
||||
br label %dtable_check
|
||||
|
||||
dtable_found: ; preds = %dtable_check
|
||||
|
||||
@@ -166,32 +166,32 @@ fn void! test() @test
|
||||
assert(math::round_to_decimals(radians_f, 3) == 0.785f);
|
||||
}
|
||||
|
||||
fn void! test_mult_div()
|
||||
fn void! test_muldiv()
|
||||
{
|
||||
char a = 20;
|
||||
assert(a.mult_div(20, 10) == 40);
|
||||
assert(a.muldiv(20, 10) == 40);
|
||||
ichar b = 20;
|
||||
assert(b.mult_div(20, -10) == -40);
|
||||
assert(b.muldiv(20, -10) == -40);
|
||||
short c = 16000;
|
||||
assert(c.mult_div(4, 2) == 32000);
|
||||
assert(c.muldiv(4, 2) == 32000);
|
||||
ushort d = 16000;
|
||||
assert(d.mult_div(8, 2) == 64000);
|
||||
assert(d.muldiv(8, 2) == 64000);
|
||||
int e = 1_000_000;
|
||||
assert(e.mult_div(40000, 10000) == 4_000_000);
|
||||
assert(e.muldiv(40000, 10000) == 4_000_000);
|
||||
uint f = 3_000_000_000u;
|
||||
assert(f.mult_div(110, 100) == 3_300_000_000u);
|
||||
assert(f.muldiv(110, 100) == 3_300_000_000u);
|
||||
long g = 1_000_000_000_000i64;
|
||||
assert(g.mult_div(2_000_000_000_000i64, 1_000_000_000i64) == 2_000_000_000_000_000i64);
|
||||
assert(g.muldiv(2_000_000_000_000i64, 1_000_000_000i64) == 2_000_000_000_000_000i64);
|
||||
ulong h = 1_000_000_000_000u64;
|
||||
assert(h.mult_div(2_000_000_000_000u64, 1_000_000_000u64) == 2_000_000_000_000_000u64);
|
||||
assert(h.muldiv(2_000_000_000_000u64, 1_000_000_000u64) == 2_000_000_000_000_000u64);
|
||||
|
||||
char[<4>] i = {20, 30, 40, 50};
|
||||
assert(i.mult_div(12,10) == char[<4>] {24, 36, 48, 60});
|
||||
assert(i.mult_div(char[<4>]{11, 12, 13, 14}, char[<4>]{10,10,10,10}) == char[<4>]{22, 36, 52, 70});
|
||||
assert(i.muldiv(12,10) == char[<4>] {24, 36, 48, 60});
|
||||
assert(i.muldiv(char[<4>]{11, 12, 13, 14}, char[<4>]{10,10,10,10}) == char[<4>]{22, 36, 52, 70});
|
||||
|
||||
long[<4>] j = {1_000_000_000_000i64, 2_000_000_000_000i64, 3_000_000_000_000i64, 4_000_000_000_000i64};
|
||||
assert(j.mult_div(2_000_000_000_000i64, 1_000_000_000i64) == long[<4>]{2_000_000_000_000_000i64, 4_000_000_000_000_000i64, 6_000_000_000_000_000i64, 8_000_000_000_000_000i64});
|
||||
assert(j.muldiv(2_000_000_000_000i64, 1_000_000_000i64) == long[<4>]{2_000_000_000_000_000i64, 4_000_000_000_000_000i64, 6_000_000_000_000_000i64, 8_000_000_000_000_000i64});
|
||||
|
||||
ichar[<4>] k = {20, 30, 40, 50};
|
||||
assert(k.mult_div(20,-10) == ichar[<4>]{-40,-60,-80,-100});
|
||||
assert(k.muldiv(20,-10) == ichar[<4>]{-40,-60,-80,-100});
|
||||
}
|
||||
Reference in New Issue
Block a user