181 lines
6.2 KiB
Zig
181 lines
6.2 KiB
Zig
const std = @import("std");
|
|
const bits = @import("bits.zig");
|
|
const Register = bits.Register;
|
|
const RegisterManagerFn = @import("../../register_manager.zig").RegisterManager;
|
|
const Type = @import("../../type.zig").Type;
|
|
|
|
pub const Class = union(enum) {
|
|
memory,
|
|
byval,
|
|
i32_array: u8,
|
|
i64_array: u8,
|
|
|
|
fn arrSize(total_size: u64, arr_size: u64) Class {
|
|
const count = @intCast(u8, std.mem.alignForward(total_size, arr_size) / arr_size);
|
|
if (arr_size == 32) {
|
|
return .{ .i32_array = count };
|
|
} else {
|
|
return .{ .i64_array = count };
|
|
}
|
|
}
|
|
};
|
|
|
|
pub const Context = enum { ret, arg };
|
|
|
|
pub fn classifyType(ty: Type, target: std.Target, ctx: Context) Class {
|
|
std.debug.assert(ty.hasRuntimeBitsIgnoreComptime());
|
|
|
|
var maybe_float_bits: ?u16 = null;
|
|
const max_byval_size = 512;
|
|
switch (ty.zigTypeTag()) {
|
|
.Struct => {
|
|
const bit_size = ty.bitSize(target);
|
|
if (ty.containerLayout() == .Packed) {
|
|
if (bit_size > 64) return .memory;
|
|
return .byval;
|
|
}
|
|
if (bit_size > max_byval_size) return .memory;
|
|
const float_count = countFloats(ty, target, &maybe_float_bits);
|
|
if (float_count <= byval_float_count) return .byval;
|
|
|
|
const fields = ty.structFieldCount();
|
|
var i: u32 = 0;
|
|
while (i < fields) : (i += 1) {
|
|
const field_ty = ty.structFieldType(i);
|
|
const field_alignment = ty.structFieldAlign(i, target);
|
|
const field_size = field_ty.bitSize(target);
|
|
if (field_size > 32 or field_alignment > 32) {
|
|
return Class.arrSize(bit_size, 64);
|
|
}
|
|
}
|
|
return Class.arrSize(bit_size, 32);
|
|
},
|
|
.Union => {
|
|
const bit_size = ty.bitSize(target);
|
|
if (ty.containerLayout() == .Packed) {
|
|
if (bit_size > 64) return .memory;
|
|
return .byval;
|
|
}
|
|
if (bit_size > max_byval_size) return .memory;
|
|
const float_count = countFloats(ty, target, &maybe_float_bits);
|
|
if (float_count <= byval_float_count) return .byval;
|
|
|
|
for (ty.unionFields().values()) |field| {
|
|
if (field.ty.bitSize(target) > 32 or field.normalAlignment(target) > 32) {
|
|
return Class.arrSize(bit_size, 64);
|
|
}
|
|
}
|
|
return Class.arrSize(bit_size, 32);
|
|
},
|
|
.Bool, .Float => return .byval,
|
|
.Int => {
|
|
// TODO this is incorrect for _BitInt(128) but implementing
|
|
// this correctly makes implementing compiler-rt impossible.
|
|
// const bit_size = ty.bitSize(target);
|
|
// if (bit_size > 64) return .memory;
|
|
return .byval;
|
|
},
|
|
.Enum, .ErrorSet => {
|
|
const bit_size = ty.bitSize(target);
|
|
if (bit_size > 64) return .memory;
|
|
return .byval;
|
|
},
|
|
.Vector => {
|
|
const bit_size = ty.bitSize(target);
|
|
// TODO is this controlled by a cpu feature?
|
|
if (ctx == .ret and bit_size > 128) return .memory;
|
|
if (bit_size > 512) return .memory;
|
|
return .byval;
|
|
},
|
|
.Optional => {
|
|
std.debug.assert(ty.isPtrLikeOptional());
|
|
return .byval;
|
|
},
|
|
.Pointer => {
|
|
std.debug.assert(!ty.isSlice());
|
|
return .byval;
|
|
},
|
|
.ErrorUnion,
|
|
.Frame,
|
|
.AnyFrame,
|
|
.NoReturn,
|
|
.Void,
|
|
.Type,
|
|
.ComptimeFloat,
|
|
.ComptimeInt,
|
|
.Undefined,
|
|
.Null,
|
|
.BoundFn,
|
|
.Fn,
|
|
.Opaque,
|
|
.EnumLiteral,
|
|
.Array,
|
|
=> unreachable,
|
|
}
|
|
}
|
|
|
|
const byval_float_count = 4;
|
|
fn countFloats(ty: Type, target: std.Target, maybe_float_bits: *?u16) u32 {
|
|
const invalid = std.math.maxInt(u32);
|
|
switch (ty.zigTypeTag()) {
|
|
.Union => {
|
|
const fields = ty.unionFields();
|
|
var max_count: u32 = 0;
|
|
for (fields.values()) |field| {
|
|
const field_count = countFloats(field.ty, target, maybe_float_bits);
|
|
if (field_count == invalid) return invalid;
|
|
if (field_count > max_count) max_count = field_count;
|
|
if (max_count > byval_float_count) return invalid;
|
|
}
|
|
return max_count;
|
|
},
|
|
.Struct => {
|
|
const fields_len = ty.structFieldCount();
|
|
var count: u32 = 0;
|
|
var i: u32 = 0;
|
|
while (i < fields_len) : (i += 1) {
|
|
const field_ty = ty.structFieldType(i);
|
|
const field_count = countFloats(field_ty, target, maybe_float_bits);
|
|
if (field_count == invalid) return invalid;
|
|
count += field_count;
|
|
if (count > byval_float_count) return invalid;
|
|
}
|
|
return count;
|
|
},
|
|
.Float => {
|
|
const float_bits = maybe_float_bits.* orelse {
|
|
const float_bits = ty.floatBits(target);
|
|
if (float_bits != 32 and float_bits != 64) return invalid;
|
|
maybe_float_bits.* = float_bits;
|
|
return 1;
|
|
};
|
|
if (ty.floatBits(target) == float_bits) return 1;
|
|
return invalid;
|
|
},
|
|
.Void => return 0,
|
|
else => return invalid,
|
|
}
|
|
}
|
|
|
|
pub const callee_preserved_regs = [_]Register{ .r4, .r5, .r6, .r7, .r8, .r10 };
|
|
pub const caller_preserved_regs = [_]Register{ .r0, .r1, .r2, .r3 };
|
|
|
|
pub const c_abi_int_param_regs = [_]Register{ .r0, .r1, .r2, .r3 };
|
|
pub const c_abi_int_return_regs = [_]Register{ .r0, .r1 };
|
|
|
|
const allocatable_registers = callee_preserved_regs ++ caller_preserved_regs;
|
|
pub const RegisterManager = RegisterManagerFn(@import("CodeGen.zig"), Register, &allocatable_registers);
|
|
|
|
// Register classes
|
|
const RegisterBitSet = RegisterManager.RegisterBitSet;
|
|
pub const RegisterClass = struct {
|
|
pub const gp: RegisterBitSet = blk: {
|
|
var set = RegisterBitSet.initEmpty();
|
|
set.setRangeValue(.{
|
|
.start = 0,
|
|
.end = caller_preserved_regs.len + callee_preserved_regs.len,
|
|
}, true);
|
|
break :blk set;
|
|
};
|
|
};
|