mirror of
https://codeberg.org/ziglang/zig.git
synced 2025-12-06 05:44:20 +00:00
4250 lines
156 KiB
Zig
4250 lines
156 KiB
Zig
//! Both types and values are canonically represented by a single 32-bit integer
|
|
//! which is an index into an `InternPool` data structure.
|
|
//! This struct abstracts around this storage by providing methods only
|
|
//! applicable to types rather than values in general.
|
|
|
|
const std = @import("std");
|
|
const builtin = @import("builtin");
|
|
const Allocator = std.mem.Allocator;
|
|
const Value = @import("Value.zig");
|
|
const assert = std.debug.assert;
|
|
const Target = std.Target;
|
|
const Zcu = @import("Zcu.zig");
|
|
const log = std.log.scoped(.Type);
|
|
const target_util = @import("target.zig");
|
|
const Sema = @import("Sema.zig");
|
|
const InternPool = @import("InternPool.zig");
|
|
const Alignment = InternPool.Alignment;
|
|
const Zir = std.zig.Zir;
|
|
const Type = @This();
|
|
const SemaError = Zcu.SemaError;
|
|
|
|
ip_index: InternPool.Index,
|
|
|
|
pub fn zigTypeTag(ty: Type, zcu: *const Zcu) std.builtin.TypeId {
|
|
return zcu.intern_pool.zigTypeTag(ty.toIntern());
|
|
}
|
|
|
|
pub fn baseZigTypeTag(self: Type, mod: *Zcu) std.builtin.TypeId {
|
|
return switch (self.zigTypeTag(mod)) {
|
|
.error_union => self.errorUnionPayload(mod).baseZigTypeTag(mod),
|
|
.optional => {
|
|
return self.optionalChild(mod).baseZigTypeTag(mod);
|
|
},
|
|
else => |t| t,
|
|
};
|
|
}
|
|
|
|
/// Asserts the type is resolved.
|
|
pub fn isSelfComparable(ty: Type, zcu: *const Zcu, is_equality_cmp: bool) bool {
|
|
return switch (ty.zigTypeTag(zcu)) {
|
|
.int,
|
|
.float,
|
|
.comptime_float,
|
|
.comptime_int,
|
|
=> true,
|
|
|
|
.vector => ty.elemType2(zcu).isSelfComparable(zcu, is_equality_cmp),
|
|
|
|
.bool,
|
|
.type,
|
|
.void,
|
|
.error_set,
|
|
.@"fn",
|
|
.@"opaque",
|
|
.@"anyframe",
|
|
.@"enum",
|
|
.enum_literal,
|
|
=> is_equality_cmp,
|
|
|
|
.noreturn,
|
|
.array,
|
|
.undefined,
|
|
.null,
|
|
.error_union,
|
|
.@"union",
|
|
.frame,
|
|
=> false,
|
|
|
|
.@"struct" => is_equality_cmp and ty.containerLayout(zcu) == .@"packed",
|
|
.pointer => !ty.isSlice(zcu) and (is_equality_cmp or ty.isCPtr(zcu)),
|
|
.optional => {
|
|
if (!is_equality_cmp) return false;
|
|
return ty.optionalChild(zcu).isSelfComparable(zcu, is_equality_cmp);
|
|
},
|
|
};
|
|
}
|
|
|
|
/// If it is a function pointer, returns the function type. Otherwise returns null.
|
|
pub fn castPtrToFn(ty: Type, zcu: *const Zcu) ?Type {
|
|
if (ty.zigTypeTag(zcu) != .pointer) return null;
|
|
const elem_ty = ty.childType(zcu);
|
|
if (elem_ty.zigTypeTag(zcu) != .@"fn") return null;
|
|
return elem_ty;
|
|
}
|
|
|
|
/// Asserts the type is a pointer.
|
|
pub fn ptrIsMutable(ty: Type, zcu: *const Zcu) bool {
|
|
return !zcu.intern_pool.indexToKey(ty.toIntern()).ptr_type.flags.is_const;
|
|
}
|
|
|
|
pub const ArrayInfo = struct {
|
|
elem_type: Type,
|
|
sentinel: ?Value = null,
|
|
len: u64,
|
|
};
|
|
|
|
pub fn arrayInfo(self: Type, zcu: *const Zcu) ArrayInfo {
|
|
return .{
|
|
.len = self.arrayLen(zcu),
|
|
.sentinel = self.sentinel(zcu),
|
|
.elem_type = self.childType(zcu),
|
|
};
|
|
}
|
|
|
|
pub fn ptrInfo(ty: Type, zcu: *const Zcu) InternPool.Key.PtrType {
|
|
return switch (zcu.intern_pool.indexToKey(ty.toIntern())) {
|
|
.ptr_type => |p| p,
|
|
.opt_type => |child| switch (zcu.intern_pool.indexToKey(child)) {
|
|
.ptr_type => |p| p,
|
|
else => unreachable,
|
|
},
|
|
else => unreachable,
|
|
};
|
|
}
|
|
|
|
pub fn eql(a: Type, b: Type, zcu: *const Zcu) bool {
|
|
_ = zcu; // TODO: remove this parameter
|
|
// The InternPool data structure hashes based on Key to make interned objects
|
|
// unique. An Index can be treated simply as u32 value for the
|
|
// purpose of Type/Value hashing and equality.
|
|
return a.toIntern() == b.toIntern();
|
|
}
|
|
|
|
pub fn format(ty: Type, comptime unused_fmt_string: []const u8, options: std.fmt.FormatOptions, writer: anytype) !void {
|
|
_ = ty;
|
|
_ = unused_fmt_string;
|
|
_ = options;
|
|
_ = writer;
|
|
@compileError("do not format types directly; use either ty.fmtDebug() or ty.fmt()");
|
|
}
|
|
|
|
pub const Formatter = std.fmt.Formatter(format2);
|
|
|
|
pub fn fmt(ty: Type, pt: Zcu.PerThread) Formatter {
|
|
return .{ .data = .{
|
|
.ty = ty,
|
|
.pt = pt,
|
|
} };
|
|
}
|
|
|
|
const FormatContext = struct {
|
|
ty: Type,
|
|
pt: Zcu.PerThread,
|
|
};
|
|
|
|
fn format2(
|
|
ctx: FormatContext,
|
|
comptime unused_format_string: []const u8,
|
|
options: std.fmt.FormatOptions,
|
|
writer: anytype,
|
|
) !void {
|
|
comptime assert(unused_format_string.len == 0);
|
|
_ = options;
|
|
return print(ctx.ty, writer, ctx.pt);
|
|
}
|
|
|
|
pub fn fmtDebug(ty: Type) std.fmt.Formatter(dump) {
|
|
return .{ .data = ty };
|
|
}
|
|
|
|
/// This is a debug function. In order to print types in a meaningful way
|
|
/// we also need access to the module.
|
|
pub fn dump(
|
|
start_type: Type,
|
|
comptime unused_format_string: []const u8,
|
|
options: std.fmt.FormatOptions,
|
|
writer: anytype,
|
|
) @TypeOf(writer).Error!void {
|
|
_ = options;
|
|
comptime assert(unused_format_string.len == 0);
|
|
return writer.print("{any}", .{start_type.ip_index});
|
|
}
|
|
|
|
/// Prints a name suitable for `@typeName`.
|
|
/// TODO: take an `opt_sema` to pass to `fmtValue` when printing sentinels.
|
|
pub fn print(ty: Type, writer: anytype, pt: Zcu.PerThread) @TypeOf(writer).Error!void {
|
|
const zcu = pt.zcu;
|
|
const ip = &zcu.intern_pool;
|
|
switch (ip.indexToKey(ty.toIntern())) {
|
|
.int_type => |int_type| {
|
|
const sign_char: u8 = switch (int_type.signedness) {
|
|
.signed => 'i',
|
|
.unsigned => 'u',
|
|
};
|
|
return writer.print("{c}{d}", .{ sign_char, int_type.bits });
|
|
},
|
|
.ptr_type => {
|
|
const info = ty.ptrInfo(zcu);
|
|
|
|
if (info.sentinel != .none) switch (info.flags.size) {
|
|
.one, .c => unreachable,
|
|
.many => try writer.print("[*:{}]", .{Value.fromInterned(info.sentinel).fmtValue(pt)}),
|
|
.slice => try writer.print("[:{}]", .{Value.fromInterned(info.sentinel).fmtValue(pt)}),
|
|
} else switch (info.flags.size) {
|
|
.one => try writer.writeAll("*"),
|
|
.many => try writer.writeAll("[*]"),
|
|
.c => try writer.writeAll("[*c]"),
|
|
.slice => try writer.writeAll("[]"),
|
|
}
|
|
if (info.flags.is_allowzero and info.flags.size != .c) try writer.writeAll("allowzero ");
|
|
if (info.flags.alignment != .none or
|
|
info.packed_offset.host_size != 0 or
|
|
info.flags.vector_index != .none)
|
|
{
|
|
const alignment = if (info.flags.alignment != .none)
|
|
info.flags.alignment
|
|
else
|
|
Type.fromInterned(info.child).abiAlignment(pt.zcu);
|
|
try writer.print("align({d}", .{alignment.toByteUnits() orelse 0});
|
|
|
|
if (info.packed_offset.bit_offset != 0 or info.packed_offset.host_size != 0) {
|
|
try writer.print(":{d}:{d}", .{
|
|
info.packed_offset.bit_offset, info.packed_offset.host_size,
|
|
});
|
|
}
|
|
if (info.flags.vector_index == .runtime) {
|
|
try writer.writeAll(":?");
|
|
} else if (info.flags.vector_index != .none) {
|
|
try writer.print(":{d}", .{@intFromEnum(info.flags.vector_index)});
|
|
}
|
|
try writer.writeAll(") ");
|
|
}
|
|
if (info.flags.address_space != .generic) {
|
|
try writer.print("addrspace(.{s}) ", .{@tagName(info.flags.address_space)});
|
|
}
|
|
if (info.flags.is_const) try writer.writeAll("const ");
|
|
if (info.flags.is_volatile) try writer.writeAll("volatile ");
|
|
|
|
try print(Type.fromInterned(info.child), writer, pt);
|
|
return;
|
|
},
|
|
.array_type => |array_type| {
|
|
if (array_type.sentinel == .none) {
|
|
try writer.print("[{d}]", .{array_type.len});
|
|
try print(Type.fromInterned(array_type.child), writer, pt);
|
|
} else {
|
|
try writer.print("[{d}:{}]", .{
|
|
array_type.len,
|
|
Value.fromInterned(array_type.sentinel).fmtValue(pt),
|
|
});
|
|
try print(Type.fromInterned(array_type.child), writer, pt);
|
|
}
|
|
return;
|
|
},
|
|
.vector_type => |vector_type| {
|
|
try writer.print("@Vector({d}, ", .{vector_type.len});
|
|
try print(Type.fromInterned(vector_type.child), writer, pt);
|
|
try writer.writeAll(")");
|
|
return;
|
|
},
|
|
.opt_type => |child| {
|
|
try writer.writeByte('?');
|
|
return print(Type.fromInterned(child), writer, pt);
|
|
},
|
|
.error_union_type => |error_union_type| {
|
|
try print(Type.fromInterned(error_union_type.error_set_type), writer, pt);
|
|
try writer.writeByte('!');
|
|
if (error_union_type.payload_type == .generic_poison_type) {
|
|
try writer.writeAll("anytype");
|
|
} else {
|
|
try print(Type.fromInterned(error_union_type.payload_type), writer, pt);
|
|
}
|
|
return;
|
|
},
|
|
.inferred_error_set_type => |func_index| {
|
|
const func_nav = ip.getNav(zcu.funcInfo(func_index).owner_nav);
|
|
try writer.print("@typeInfo(@typeInfo(@TypeOf({})).@\"fn\".return_type.?).error_union.error_set", .{
|
|
func_nav.fqn.fmt(ip),
|
|
});
|
|
},
|
|
.error_set_type => |error_set_type| {
|
|
const names = error_set_type.names;
|
|
try writer.writeAll("error{");
|
|
for (names.get(ip), 0..) |name, i| {
|
|
if (i != 0) try writer.writeByte(',');
|
|
try writer.print("{}", .{name.fmt(ip)});
|
|
}
|
|
try writer.writeAll("}");
|
|
},
|
|
.simple_type => |s| switch (s) {
|
|
.f16,
|
|
.f32,
|
|
.f64,
|
|
.f80,
|
|
.f128,
|
|
.usize,
|
|
.isize,
|
|
.c_char,
|
|
.c_short,
|
|
.c_ushort,
|
|
.c_int,
|
|
.c_uint,
|
|
.c_long,
|
|
.c_ulong,
|
|
.c_longlong,
|
|
.c_ulonglong,
|
|
.c_longdouble,
|
|
.anyopaque,
|
|
.bool,
|
|
.void,
|
|
.type,
|
|
.anyerror,
|
|
.comptime_int,
|
|
.comptime_float,
|
|
.noreturn,
|
|
.adhoc_inferred_error_set,
|
|
=> return writer.writeAll(@tagName(s)),
|
|
|
|
.null,
|
|
.undefined,
|
|
=> try writer.print("@TypeOf({s})", .{@tagName(s)}),
|
|
|
|
.enum_literal => try writer.writeAll("@Type(.enum_literal)"),
|
|
|
|
.generic_poison => unreachable,
|
|
},
|
|
.struct_type => {
|
|
const name = ip.loadStructType(ty.toIntern()).name;
|
|
try writer.print("{}", .{name.fmt(ip)});
|
|
},
|
|
.tuple_type => |tuple| {
|
|
if (tuple.types.len == 0) {
|
|
return writer.writeAll("@TypeOf(.{})");
|
|
}
|
|
try writer.writeAll("struct {");
|
|
for (tuple.types.get(ip), tuple.values.get(ip), 0..) |field_ty, val, i| {
|
|
try writer.writeAll(if (i == 0) " " else ", ");
|
|
if (val != .none) try writer.writeAll("comptime ");
|
|
try print(Type.fromInterned(field_ty), writer, pt);
|
|
if (val != .none) try writer.print(" = {}", .{Value.fromInterned(val).fmtValue(pt)});
|
|
}
|
|
try writer.writeAll(" }");
|
|
},
|
|
|
|
.union_type => {
|
|
const name = ip.loadUnionType(ty.toIntern()).name;
|
|
try writer.print("{}", .{name.fmt(ip)});
|
|
},
|
|
.opaque_type => {
|
|
const name = ip.loadOpaqueType(ty.toIntern()).name;
|
|
try writer.print("{}", .{name.fmt(ip)});
|
|
},
|
|
.enum_type => {
|
|
const name = ip.loadEnumType(ty.toIntern()).name;
|
|
try writer.print("{}", .{name.fmt(ip)});
|
|
},
|
|
.func_type => |fn_info| {
|
|
if (fn_info.is_noinline) {
|
|
try writer.writeAll("noinline ");
|
|
}
|
|
try writer.writeAll("fn (");
|
|
const param_types = fn_info.param_types.get(&zcu.intern_pool);
|
|
for (param_types, 0..) |param_ty, i| {
|
|
if (i != 0) try writer.writeAll(", ");
|
|
if (std.math.cast(u5, i)) |index| {
|
|
if (fn_info.paramIsComptime(index)) {
|
|
try writer.writeAll("comptime ");
|
|
}
|
|
if (fn_info.paramIsNoalias(index)) {
|
|
try writer.writeAll("noalias ");
|
|
}
|
|
}
|
|
if (param_ty == .generic_poison_type) {
|
|
try writer.writeAll("anytype");
|
|
} else {
|
|
try print(Type.fromInterned(param_ty), writer, pt);
|
|
}
|
|
}
|
|
if (fn_info.is_var_args) {
|
|
if (param_types.len != 0) {
|
|
try writer.writeAll(", ");
|
|
}
|
|
try writer.writeAll("...");
|
|
}
|
|
try writer.writeAll(") ");
|
|
if (fn_info.cc != .auto) print_cc: {
|
|
if (zcu.getTarget().cCallingConvention()) |ccc| {
|
|
if (fn_info.cc.eql(ccc)) {
|
|
try writer.writeAll("callconv(.c) ");
|
|
break :print_cc;
|
|
}
|
|
}
|
|
switch (fn_info.cc) {
|
|
.auto, .@"async", .naked, .@"inline" => try writer.print("callconv(.{}) ", .{std.zig.fmtId(@tagName(fn_info.cc))}),
|
|
else => try writer.print("callconv({any}) ", .{fn_info.cc}),
|
|
}
|
|
}
|
|
if (fn_info.return_type == .generic_poison_type) {
|
|
try writer.writeAll("anytype");
|
|
} else {
|
|
try print(Type.fromInterned(fn_info.return_type), writer, pt);
|
|
}
|
|
},
|
|
.anyframe_type => |child| {
|
|
if (child == .none) return writer.writeAll("anyframe");
|
|
try writer.writeAll("anyframe->");
|
|
return print(Type.fromInterned(child), writer, pt);
|
|
},
|
|
|
|
// values, not types
|
|
.undef,
|
|
.simple_value,
|
|
.variable,
|
|
.@"extern",
|
|
.func,
|
|
.int,
|
|
.err,
|
|
.error_union,
|
|
.enum_literal,
|
|
.enum_tag,
|
|
.empty_enum_value,
|
|
.float,
|
|
.ptr,
|
|
.slice,
|
|
.opt,
|
|
.aggregate,
|
|
.un,
|
|
// memoization, not types
|
|
.memoized_call,
|
|
=> unreachable,
|
|
}
|
|
}
|
|
|
|
pub fn fromInterned(i: InternPool.Index) Type {
|
|
assert(i != .none);
|
|
return .{ .ip_index = i };
|
|
}
|
|
|
|
pub fn toIntern(ty: Type) InternPool.Index {
|
|
assert(ty.ip_index != .none);
|
|
return ty.ip_index;
|
|
}
|
|
|
|
pub fn toValue(self: Type) Value {
|
|
return Value.fromInterned(self.toIntern());
|
|
}
|
|
|
|
const RuntimeBitsError = SemaError || error{NeedLazy};
|
|
|
|
pub fn hasRuntimeBits(ty: Type, zcu: *const Zcu) bool {
|
|
return hasRuntimeBitsInner(ty, false, .eager, zcu, {}) catch unreachable;
|
|
}
|
|
|
|
pub fn hasRuntimeBitsSema(ty: Type, pt: Zcu.PerThread) SemaError!bool {
|
|
return hasRuntimeBitsInner(ty, false, .sema, pt.zcu, pt.tid) catch |err| switch (err) {
|
|
error.NeedLazy => unreachable, // this would require a resolve strat of lazy
|
|
else => |e| return e,
|
|
};
|
|
}
|
|
|
|
pub fn hasRuntimeBitsIgnoreComptime(ty: Type, zcu: *const Zcu) bool {
|
|
return hasRuntimeBitsInner(ty, true, .eager, zcu, {}) catch unreachable;
|
|
}
|
|
|
|
pub fn hasRuntimeBitsIgnoreComptimeSema(ty: Type, pt: Zcu.PerThread) SemaError!bool {
|
|
return hasRuntimeBitsInner(ty, true, .sema, pt.zcu, pt.tid) catch |err| switch (err) {
|
|
error.NeedLazy => unreachable, // this would require a resolve strat of lazy
|
|
else => |e| return e,
|
|
};
|
|
}
|
|
|
|
/// true if and only if the type takes up space in memory at runtime.
|
|
/// There are two reasons a type will return false:
|
|
/// * the type is a comptime-only type. For example, the type `type` itself.
|
|
/// - note, however, that a struct can have mixed fields and only the non-comptime-only
|
|
/// fields will count towards the ABI size. For example, `struct {T: type, x: i32}`
|
|
/// hasRuntimeBits()=true and abiSize()=4
|
|
/// * the type has only one possible value, making its ABI size 0.
|
|
/// - an enum with an explicit tag type has the ABI size of the integer tag type,
|
|
/// making it one-possible-value only if the integer tag type has 0 bits.
|
|
/// When `ignore_comptime_only` is true, then types that are comptime-only
|
|
/// may return false positives.
|
|
pub fn hasRuntimeBitsInner(
|
|
ty: Type,
|
|
ignore_comptime_only: bool,
|
|
comptime strat: ResolveStratLazy,
|
|
zcu: strat.ZcuPtr(),
|
|
tid: strat.Tid(),
|
|
) RuntimeBitsError!bool {
|
|
const ip = &zcu.intern_pool;
|
|
return switch (ty.toIntern()) {
|
|
.empty_tuple_type => false,
|
|
else => switch (ip.indexToKey(ty.toIntern())) {
|
|
.int_type => |int_type| int_type.bits != 0,
|
|
.ptr_type => {
|
|
// Pointers to zero-bit types still have a runtime address; however, pointers
|
|
// to comptime-only types do not, with the exception of function pointers.
|
|
if (ignore_comptime_only) return true;
|
|
return switch (strat) {
|
|
.sema => {
|
|
const pt = strat.pt(zcu, tid);
|
|
return !try ty.comptimeOnlySema(pt);
|
|
},
|
|
.eager => !ty.comptimeOnly(zcu),
|
|
.lazy => error.NeedLazy,
|
|
};
|
|
},
|
|
.anyframe_type => true,
|
|
.array_type => |array_type| return array_type.lenIncludingSentinel() > 0 and
|
|
try Type.fromInterned(array_type.child).hasRuntimeBitsInner(ignore_comptime_only, strat, zcu, tid),
|
|
.vector_type => |vector_type| return vector_type.len > 0 and
|
|
try Type.fromInterned(vector_type.child).hasRuntimeBitsInner(ignore_comptime_only, strat, zcu, tid),
|
|
.opt_type => |child| {
|
|
const child_ty = Type.fromInterned(child);
|
|
if (child_ty.isNoReturn(zcu)) {
|
|
// Then the optional is comptime-known to be null.
|
|
return false;
|
|
}
|
|
if (ignore_comptime_only) return true;
|
|
return switch (strat) {
|
|
.sema => !try child_ty.comptimeOnlyInner(.sema, zcu, tid),
|
|
.eager => !child_ty.comptimeOnly(zcu),
|
|
.lazy => error.NeedLazy,
|
|
};
|
|
},
|
|
.error_union_type,
|
|
.error_set_type,
|
|
.inferred_error_set_type,
|
|
=> true,
|
|
|
|
// These are function *bodies*, not pointers.
|
|
// They return false here because they are comptime-only types.
|
|
// Special exceptions have to be made when emitting functions due to
|
|
// this returning false.
|
|
.func_type => false,
|
|
|
|
.simple_type => |t| switch (t) {
|
|
.f16,
|
|
.f32,
|
|
.f64,
|
|
.f80,
|
|
.f128,
|
|
.usize,
|
|
.isize,
|
|
.c_char,
|
|
.c_short,
|
|
.c_ushort,
|
|
.c_int,
|
|
.c_uint,
|
|
.c_long,
|
|
.c_ulong,
|
|
.c_longlong,
|
|
.c_ulonglong,
|
|
.c_longdouble,
|
|
.bool,
|
|
.anyerror,
|
|
.adhoc_inferred_error_set,
|
|
.anyopaque,
|
|
=> true,
|
|
|
|
// These are false because they are comptime-only types.
|
|
.void,
|
|
.type,
|
|
.comptime_int,
|
|
.comptime_float,
|
|
.noreturn,
|
|
.null,
|
|
.undefined,
|
|
.enum_literal,
|
|
=> false,
|
|
|
|
.generic_poison => unreachable,
|
|
},
|
|
.struct_type => {
|
|
const struct_type = ip.loadStructType(ty.toIntern());
|
|
if (strat != .eager and struct_type.assumeRuntimeBitsIfFieldTypesWip(ip)) {
|
|
// In this case, we guess that hasRuntimeBits() for this type is true,
|
|
// and then later if our guess was incorrect, we emit a compile error.
|
|
return true;
|
|
}
|
|
switch (strat) {
|
|
.sema => try ty.resolveFields(strat.pt(zcu, tid)),
|
|
.eager => assert(struct_type.haveFieldTypes(ip)),
|
|
.lazy => if (!struct_type.haveFieldTypes(ip)) return error.NeedLazy,
|
|
}
|
|
for (0..struct_type.field_types.len) |i| {
|
|
if (struct_type.comptime_bits.getBit(ip, i)) continue;
|
|
const field_ty = Type.fromInterned(struct_type.field_types.get(ip)[i]);
|
|
if (try field_ty.hasRuntimeBitsInner(ignore_comptime_only, strat, zcu, tid))
|
|
return true;
|
|
} else {
|
|
return false;
|
|
}
|
|
},
|
|
.tuple_type => |tuple| {
|
|
for (tuple.types.get(ip), tuple.values.get(ip)) |field_ty, val| {
|
|
if (val != .none) continue; // comptime field
|
|
if (try Type.fromInterned(field_ty).hasRuntimeBitsInner(
|
|
ignore_comptime_only,
|
|
strat,
|
|
zcu,
|
|
tid,
|
|
)) return true;
|
|
}
|
|
return false;
|
|
},
|
|
|
|
.union_type => {
|
|
const union_type = ip.loadUnionType(ty.toIntern());
|
|
const union_flags = union_type.flagsUnordered(ip);
|
|
switch (union_flags.runtime_tag) {
|
|
.none => if (strat != .eager) {
|
|
// In this case, we guess that hasRuntimeBits() for this type is true,
|
|
// and then later if our guess was incorrect, we emit a compile error.
|
|
if (union_type.assumeRuntimeBitsIfFieldTypesWip(ip)) return true;
|
|
},
|
|
.safety, .tagged => {},
|
|
}
|
|
switch (strat) {
|
|
.sema => try ty.resolveFields(strat.pt(zcu, tid)),
|
|
.eager => assert(union_flags.status.haveFieldTypes()),
|
|
.lazy => if (!union_flags.status.haveFieldTypes())
|
|
return error.NeedLazy,
|
|
}
|
|
switch (union_flags.runtime_tag) {
|
|
.none => {},
|
|
.safety, .tagged => {
|
|
const tag_ty = union_type.tagTypeUnordered(ip);
|
|
assert(tag_ty != .none); // tag_ty should have been resolved above
|
|
if (try Type.fromInterned(tag_ty).hasRuntimeBitsInner(
|
|
ignore_comptime_only,
|
|
strat,
|
|
zcu,
|
|
tid,
|
|
)) {
|
|
return true;
|
|
}
|
|
},
|
|
}
|
|
for (0..union_type.field_types.len) |field_index| {
|
|
const field_ty = Type.fromInterned(union_type.field_types.get(ip)[field_index]);
|
|
if (try field_ty.hasRuntimeBitsInner(ignore_comptime_only, strat, zcu, tid))
|
|
return true;
|
|
} else {
|
|
return false;
|
|
}
|
|
},
|
|
|
|
.opaque_type => true,
|
|
.enum_type => Type.fromInterned(ip.loadEnumType(ty.toIntern()).tag_ty).hasRuntimeBitsInner(
|
|
ignore_comptime_only,
|
|
strat,
|
|
zcu,
|
|
tid,
|
|
),
|
|
|
|
// values, not types
|
|
.undef,
|
|
.simple_value,
|
|
.variable,
|
|
.@"extern",
|
|
.func,
|
|
.int,
|
|
.err,
|
|
.error_union,
|
|
.enum_literal,
|
|
.enum_tag,
|
|
.empty_enum_value,
|
|
.float,
|
|
.ptr,
|
|
.slice,
|
|
.opt,
|
|
.aggregate,
|
|
.un,
|
|
// memoization, not types
|
|
.memoized_call,
|
|
=> unreachable,
|
|
},
|
|
};
|
|
}
|
|
|
|
/// true if and only if the type has a well-defined memory layout
|
|
/// readFrom/writeToMemory are supported only for types with a well-
|
|
/// defined memory layout
|
|
pub fn hasWellDefinedLayout(ty: Type, zcu: *const Zcu) bool {
|
|
const ip = &zcu.intern_pool;
|
|
return switch (ip.indexToKey(ty.toIntern())) {
|
|
.int_type,
|
|
.vector_type,
|
|
=> true,
|
|
|
|
.error_union_type,
|
|
.error_set_type,
|
|
.inferred_error_set_type,
|
|
.tuple_type,
|
|
.opaque_type,
|
|
.anyframe_type,
|
|
// These are function bodies, not function pointers.
|
|
.func_type,
|
|
=> false,
|
|
|
|
.array_type => |array_type| Type.fromInterned(array_type.child).hasWellDefinedLayout(zcu),
|
|
.opt_type => ty.isPtrLikeOptional(zcu),
|
|
.ptr_type => |ptr_type| ptr_type.flags.size != .slice,
|
|
|
|
.simple_type => |t| switch (t) {
|
|
.f16,
|
|
.f32,
|
|
.f64,
|
|
.f80,
|
|
.f128,
|
|
.usize,
|
|
.isize,
|
|
.c_char,
|
|
.c_short,
|
|
.c_ushort,
|
|
.c_int,
|
|
.c_uint,
|
|
.c_long,
|
|
.c_ulong,
|
|
.c_longlong,
|
|
.c_ulonglong,
|
|
.c_longdouble,
|
|
.bool,
|
|
.void,
|
|
=> true,
|
|
|
|
.anyerror,
|
|
.adhoc_inferred_error_set,
|
|
.anyopaque,
|
|
.type,
|
|
.comptime_int,
|
|
.comptime_float,
|
|
.noreturn,
|
|
.null,
|
|
.undefined,
|
|
.enum_literal,
|
|
.generic_poison,
|
|
=> false,
|
|
},
|
|
.struct_type => ip.loadStructType(ty.toIntern()).layout != .auto,
|
|
.union_type => {
|
|
const union_type = ip.loadUnionType(ty.toIntern());
|
|
return switch (union_type.flagsUnordered(ip).runtime_tag) {
|
|
.none, .safety => union_type.flagsUnordered(ip).layout != .auto,
|
|
.tagged => false,
|
|
};
|
|
},
|
|
.enum_type => switch (ip.loadEnumType(ty.toIntern()).tag_mode) {
|
|
.auto => false,
|
|
.explicit, .nonexhaustive => true,
|
|
},
|
|
|
|
// values, not types
|
|
.undef,
|
|
.simple_value,
|
|
.variable,
|
|
.@"extern",
|
|
.func,
|
|
.int,
|
|
.err,
|
|
.error_union,
|
|
.enum_literal,
|
|
.enum_tag,
|
|
.empty_enum_value,
|
|
.float,
|
|
.ptr,
|
|
.slice,
|
|
.opt,
|
|
.aggregate,
|
|
.un,
|
|
// memoization, not types
|
|
.memoized_call,
|
|
=> unreachable,
|
|
};
|
|
}
|
|
|
|
pub fn fnHasRuntimeBits(ty: Type, zcu: *Zcu) bool {
|
|
return ty.fnHasRuntimeBitsInner(.normal, zcu, {}) catch unreachable;
|
|
}
|
|
|
|
pub fn fnHasRuntimeBitsSema(ty: Type, pt: Zcu.PerThread) SemaError!bool {
|
|
return try ty.fnHasRuntimeBitsInner(.sema, pt.zcu, pt.tid);
|
|
}
|
|
|
|
/// Determines whether a function type has runtime bits, i.e. whether a
|
|
/// function with this type can exist at runtime.
|
|
/// Asserts that `ty` is a function type.
|
|
pub fn fnHasRuntimeBitsInner(
|
|
ty: Type,
|
|
comptime strat: ResolveStrat,
|
|
zcu: strat.ZcuPtr(),
|
|
tid: strat.Tid(),
|
|
) SemaError!bool {
|
|
const fn_info = zcu.typeToFunc(ty).?;
|
|
if (fn_info.is_generic) return false;
|
|
if (fn_info.is_var_args) return true;
|
|
if (fn_info.cc == .@"inline") return false;
|
|
return !try Type.fromInterned(fn_info.return_type).comptimeOnlyInner(strat, zcu, tid);
|
|
}
|
|
|
|
pub fn isFnOrHasRuntimeBits(ty: Type, zcu: *Zcu) bool {
|
|
switch (ty.zigTypeTag(zcu)) {
|
|
.@"fn" => return ty.fnHasRuntimeBits(zcu),
|
|
else => return ty.hasRuntimeBits(zcu),
|
|
}
|
|
}
|
|
|
|
/// Same as `isFnOrHasRuntimeBits` but comptime-only types may return a false positive.
|
|
pub fn isFnOrHasRuntimeBitsIgnoreComptime(ty: Type, zcu: *Zcu) bool {
|
|
return switch (ty.zigTypeTag(zcu)) {
|
|
.@"fn" => true,
|
|
else => return ty.hasRuntimeBitsIgnoreComptime(zcu),
|
|
};
|
|
}
|
|
|
|
pub fn isNoReturn(ty: Type, zcu: *const Zcu) bool {
|
|
return zcu.intern_pool.isNoReturn(ty.toIntern());
|
|
}
|
|
|
|
/// Never returns `none`. Asserts that all necessary type resolution is already done.
|
|
pub fn ptrAlignment(ty: Type, zcu: *Zcu) Alignment {
|
|
return ptrAlignmentInner(ty, .normal, zcu, {}) catch unreachable;
|
|
}
|
|
|
|
pub fn ptrAlignmentSema(ty: Type, pt: Zcu.PerThread) SemaError!Alignment {
|
|
return try ty.ptrAlignmentInner(.sema, pt.zcu, pt.tid);
|
|
}
|
|
|
|
pub fn ptrAlignmentInner(
|
|
ty: Type,
|
|
comptime strat: ResolveStrat,
|
|
zcu: strat.ZcuPtr(),
|
|
tid: strat.Tid(),
|
|
) !Alignment {
|
|
return switch (zcu.intern_pool.indexToKey(ty.toIntern())) {
|
|
.ptr_type => |ptr_type| {
|
|
if (ptr_type.flags.alignment != .none) return ptr_type.flags.alignment;
|
|
const res = try Type.fromInterned(ptr_type.child).abiAlignmentInner(strat.toLazy(), zcu, tid);
|
|
return res.scalar;
|
|
},
|
|
.opt_type => |child| Type.fromInterned(child).ptrAlignmentInner(strat, zcu, tid),
|
|
else => unreachable,
|
|
};
|
|
}
|
|
|
|
pub fn ptrAddressSpace(ty: Type, zcu: *const Zcu) std.builtin.AddressSpace {
|
|
return switch (zcu.intern_pool.indexToKey(ty.toIntern())) {
|
|
.ptr_type => |ptr_type| ptr_type.flags.address_space,
|
|
.opt_type => |child| zcu.intern_pool.indexToKey(child).ptr_type.flags.address_space,
|
|
else => unreachable,
|
|
};
|
|
}
|
|
|
|
/// May capture a reference to `ty`.
|
|
/// Returned value has type `comptime_int`.
|
|
pub fn lazyAbiAlignment(ty: Type, pt: Zcu.PerThread) !Value {
|
|
switch (try ty.abiAlignmentInner(.lazy, pt.zcu, pt.tid)) {
|
|
.val => |val| return val,
|
|
.scalar => |x| return pt.intValue(Type.comptime_int, x.toByteUnits() orelse 0),
|
|
}
|
|
}
|
|
|
|
pub const AbiAlignmentInner = union(enum) {
|
|
scalar: Alignment,
|
|
val: Value,
|
|
};
|
|
|
|
pub const ResolveStratLazy = enum {
|
|
/// Return a `lazy_size` or `lazy_align` value if necessary.
|
|
/// This value can be resolved later using `Value.resolveLazy`.
|
|
lazy,
|
|
/// Return a scalar result, expecting all necessary type resolution to be completed.
|
|
/// Backends should typically use this, since they must not perform type resolution.
|
|
eager,
|
|
/// Return a scalar result, performing type resolution as necessary.
|
|
/// This should typically be used from semantic analysis.
|
|
sema,
|
|
|
|
pub fn Tid(strat: ResolveStratLazy) type {
|
|
return switch (strat) {
|
|
.lazy, .sema => Zcu.PerThread.Id,
|
|
.eager => void,
|
|
};
|
|
}
|
|
|
|
pub fn ZcuPtr(strat: ResolveStratLazy) type {
|
|
return switch (strat) {
|
|
.eager => *const Zcu,
|
|
.sema, .lazy => *Zcu,
|
|
};
|
|
}
|
|
|
|
pub fn pt(
|
|
comptime strat: ResolveStratLazy,
|
|
zcu: strat.ZcuPtr(),
|
|
tid: strat.Tid(),
|
|
) switch (strat) {
|
|
.lazy, .sema => Zcu.PerThread,
|
|
.eager => void,
|
|
} {
|
|
return switch (strat) {
|
|
.lazy, .sema => .{ .tid = tid, .zcu = zcu },
|
|
else => {},
|
|
};
|
|
}
|
|
};
|
|
|
|
/// The chosen strategy can be easily optimized away in release builds.
|
|
/// However, in debug builds, it helps to avoid accidentally resolving types in backends.
|
|
pub const ResolveStrat = enum {
|
|
/// Assert that all necessary resolution is completed.
|
|
/// Backends should typically use this, since they must not perform type resolution.
|
|
normal,
|
|
/// Perform type resolution as necessary using `Zcu`.
|
|
/// This should typically be used from semantic analysis.
|
|
sema,
|
|
|
|
pub fn Tid(strat: ResolveStrat) type {
|
|
return switch (strat) {
|
|
.sema => Zcu.PerThread.Id,
|
|
.normal => void,
|
|
};
|
|
}
|
|
|
|
pub fn ZcuPtr(strat: ResolveStrat) type {
|
|
return switch (strat) {
|
|
.normal => *const Zcu,
|
|
.sema => *Zcu,
|
|
};
|
|
}
|
|
|
|
pub fn pt(comptime strat: ResolveStrat, zcu: strat.ZcuPtr(), tid: strat.Tid()) switch (strat) {
|
|
.sema => Zcu.PerThread,
|
|
.normal => void,
|
|
} {
|
|
return switch (strat) {
|
|
.sema => .{ .tid = tid, .zcu = zcu },
|
|
.normal => {},
|
|
};
|
|
}
|
|
|
|
pub inline fn toLazy(strat: ResolveStrat) ResolveStratLazy {
|
|
return switch (strat) {
|
|
.normal => .eager,
|
|
.sema => .sema,
|
|
};
|
|
}
|
|
};
|
|
|
|
/// Never returns `none`. Asserts that all necessary type resolution is already done.
|
|
pub fn abiAlignment(ty: Type, zcu: *const Zcu) Alignment {
|
|
return (ty.abiAlignmentInner(.eager, zcu, {}) catch unreachable).scalar;
|
|
}
|
|
|
|
pub fn abiAlignmentSema(ty: Type, pt: Zcu.PerThread) SemaError!Alignment {
|
|
return (try ty.abiAlignmentInner(.sema, pt.zcu, pt.tid)).scalar;
|
|
}
|
|
|
|
/// If you pass `eager` you will get back `scalar` and assert the type is resolved.
|
|
/// In this case there will be no error, guaranteed.
|
|
/// If you pass `lazy` you may get back `scalar` or `val`.
|
|
/// If `val` is returned, a reference to `ty` has been captured.
|
|
/// If you pass `sema` you will get back `scalar` and resolve the type if
|
|
/// necessary, possibly returning a CompileError.
|
|
pub fn abiAlignmentInner(
|
|
ty: Type,
|
|
comptime strat: ResolveStratLazy,
|
|
zcu: strat.ZcuPtr(),
|
|
tid: strat.Tid(),
|
|
) SemaError!AbiAlignmentInner {
|
|
const pt = strat.pt(zcu, tid);
|
|
const target = zcu.getTarget();
|
|
const ip = &zcu.intern_pool;
|
|
|
|
switch (ty.toIntern()) {
|
|
.empty_tuple_type => return .{ .scalar = .@"1" },
|
|
else => switch (ip.indexToKey(ty.toIntern())) {
|
|
.int_type => |int_type| {
|
|
if (int_type.bits == 0) return .{ .scalar = .@"1" };
|
|
return .{ .scalar = intAbiAlignment(int_type.bits, target) };
|
|
},
|
|
.ptr_type, .anyframe_type => {
|
|
return .{ .scalar = ptrAbiAlignment(target) };
|
|
},
|
|
.array_type => |array_type| {
|
|
return Type.fromInterned(array_type.child).abiAlignmentInner(strat, zcu, tid);
|
|
},
|
|
.vector_type => |vector_type| {
|
|
if (vector_type.len == 0) return .{ .scalar = .@"1" };
|
|
switch (zcu.comp.getZigBackend()) {
|
|
else => {
|
|
// This is fine because the child type of a vector always has a bit-size known
|
|
// without needing any type resolution.
|
|
const elem_bits: u32 = @intCast(Type.fromInterned(vector_type.child).bitSize(zcu));
|
|
if (elem_bits == 0) return .{ .scalar = .@"1" };
|
|
const bytes = ((elem_bits * vector_type.len) + 7) / 8;
|
|
const alignment = std.math.ceilPowerOfTwoAssert(u32, bytes);
|
|
return .{ .scalar = Alignment.fromByteUnits(alignment) };
|
|
},
|
|
.stage2_c => {
|
|
return Type.fromInterned(vector_type.child).abiAlignmentInner(strat, zcu, tid);
|
|
},
|
|
.stage2_x86_64 => {
|
|
if (vector_type.child == .bool_type) {
|
|
if (vector_type.len > 256 and std.Target.x86.featureSetHas(target.cpu.features, .avx512f)) return .{ .scalar = .@"64" };
|
|
if (vector_type.len > 128 and std.Target.x86.featureSetHas(target.cpu.features, .avx2)) return .{ .scalar = .@"32" };
|
|
if (vector_type.len > 64) return .{ .scalar = .@"16" };
|
|
const bytes = std.math.divCeil(u32, vector_type.len, 8) catch unreachable;
|
|
const alignment = std.math.ceilPowerOfTwoAssert(u32, bytes);
|
|
return .{ .scalar = Alignment.fromByteUnits(alignment) };
|
|
}
|
|
const elem_bytes: u32 = @intCast((try Type.fromInterned(vector_type.child).abiSizeInner(strat, zcu, tid)).scalar);
|
|
if (elem_bytes == 0) return .{ .scalar = .@"1" };
|
|
const bytes = elem_bytes * vector_type.len;
|
|
if (bytes > 32 and std.Target.x86.featureSetHas(target.cpu.features, .avx512f)) return .{ .scalar = .@"64" };
|
|
if (bytes > 16 and std.Target.x86.featureSetHas(target.cpu.features, .avx)) return .{ .scalar = .@"32" };
|
|
return .{ .scalar = .@"16" };
|
|
},
|
|
}
|
|
},
|
|
|
|
.opt_type => return ty.abiAlignmentInnerOptional(strat, zcu, tid),
|
|
.error_union_type => |info| return ty.abiAlignmentInnerErrorUnion(
|
|
strat,
|
|
zcu,
|
|
tid,
|
|
Type.fromInterned(info.payload_type),
|
|
),
|
|
|
|
.error_set_type, .inferred_error_set_type => {
|
|
const bits = zcu.errorSetBits();
|
|
if (bits == 0) return .{ .scalar = .@"1" };
|
|
return .{ .scalar = intAbiAlignment(bits, target) };
|
|
},
|
|
|
|
// represents machine code; not a pointer
|
|
.func_type => return .{ .scalar = target_util.minFunctionAlignment(target) },
|
|
|
|
.simple_type => |t| switch (t) {
|
|
.bool,
|
|
.anyopaque,
|
|
=> return .{ .scalar = .@"1" },
|
|
|
|
.usize,
|
|
.isize,
|
|
=> return .{ .scalar = intAbiAlignment(target.ptrBitWidth(), target) },
|
|
|
|
.c_char => return .{ .scalar = cTypeAlign(target, .char) },
|
|
.c_short => return .{ .scalar = cTypeAlign(target, .short) },
|
|
.c_ushort => return .{ .scalar = cTypeAlign(target, .ushort) },
|
|
.c_int => return .{ .scalar = cTypeAlign(target, .int) },
|
|
.c_uint => return .{ .scalar = cTypeAlign(target, .uint) },
|
|
.c_long => return .{ .scalar = cTypeAlign(target, .long) },
|
|
.c_ulong => return .{ .scalar = cTypeAlign(target, .ulong) },
|
|
.c_longlong => return .{ .scalar = cTypeAlign(target, .longlong) },
|
|
.c_ulonglong => return .{ .scalar = cTypeAlign(target, .ulonglong) },
|
|
.c_longdouble => return .{ .scalar = cTypeAlign(target, .longdouble) },
|
|
|
|
.f16 => return .{ .scalar = .@"2" },
|
|
.f32 => return .{ .scalar = cTypeAlign(target, .float) },
|
|
.f64 => switch (target.cTypeBitSize(.double)) {
|
|
64 => return .{ .scalar = cTypeAlign(target, .double) },
|
|
else => return .{ .scalar = .@"8" },
|
|
},
|
|
.f80 => switch (target.cTypeBitSize(.longdouble)) {
|
|
80 => return .{ .scalar = cTypeAlign(target, .longdouble) },
|
|
else => return .{ .scalar = Type.u80.abiAlignment(zcu) },
|
|
},
|
|
.f128 => switch (target.cTypeBitSize(.longdouble)) {
|
|
128 => return .{ .scalar = cTypeAlign(target, .longdouble) },
|
|
else => return .{ .scalar = .@"16" },
|
|
},
|
|
|
|
.anyerror, .adhoc_inferred_error_set => {
|
|
const bits = zcu.errorSetBits();
|
|
if (bits == 0) return .{ .scalar = .@"1" };
|
|
return .{ .scalar = intAbiAlignment(bits, target) };
|
|
},
|
|
|
|
.void,
|
|
.type,
|
|
.comptime_int,
|
|
.comptime_float,
|
|
.null,
|
|
.undefined,
|
|
.enum_literal,
|
|
=> return .{ .scalar = .@"1" },
|
|
|
|
.noreturn => unreachable,
|
|
.generic_poison => unreachable,
|
|
},
|
|
.struct_type => {
|
|
const struct_type = ip.loadStructType(ty.toIntern());
|
|
if (struct_type.layout == .@"packed") {
|
|
switch (strat) {
|
|
.sema => try ty.resolveLayout(pt),
|
|
.lazy => if (struct_type.backingIntTypeUnordered(ip) == .none) return .{
|
|
.val = Value.fromInterned(try pt.intern(.{ .int = .{
|
|
.ty = .comptime_int_type,
|
|
.storage = .{ .lazy_align = ty.toIntern() },
|
|
} })),
|
|
},
|
|
.eager => {},
|
|
}
|
|
return .{ .scalar = Type.fromInterned(struct_type.backingIntTypeUnordered(ip)).abiAlignment(zcu) };
|
|
}
|
|
|
|
if (struct_type.flagsUnordered(ip).alignment == .none) switch (strat) {
|
|
.eager => unreachable, // struct alignment not resolved
|
|
.sema => try ty.resolveStructAlignment(pt),
|
|
.lazy => return .{ .val = Value.fromInterned(try pt.intern(.{ .int = .{
|
|
.ty = .comptime_int_type,
|
|
.storage = .{ .lazy_align = ty.toIntern() },
|
|
} })) },
|
|
};
|
|
|
|
return .{ .scalar = struct_type.flagsUnordered(ip).alignment };
|
|
},
|
|
.tuple_type => |tuple| {
|
|
var big_align: Alignment = .@"1";
|
|
for (tuple.types.get(ip), tuple.values.get(ip)) |field_ty, val| {
|
|
if (val != .none) continue; // comptime field
|
|
switch (try Type.fromInterned(field_ty).abiAlignmentInner(strat, zcu, tid)) {
|
|
.scalar => |field_align| big_align = big_align.max(field_align),
|
|
.val => switch (strat) {
|
|
.eager => unreachable, // field type alignment not resolved
|
|
.sema => unreachable, // passed to abiAlignmentInner above
|
|
.lazy => return .{ .val = Value.fromInterned(try pt.intern(.{ .int = .{
|
|
.ty = .comptime_int_type,
|
|
.storage = .{ .lazy_align = ty.toIntern() },
|
|
} })) },
|
|
},
|
|
}
|
|
}
|
|
return .{ .scalar = big_align };
|
|
},
|
|
.union_type => {
|
|
const union_type = ip.loadUnionType(ty.toIntern());
|
|
|
|
if (union_type.flagsUnordered(ip).alignment == .none) switch (strat) {
|
|
.eager => unreachable, // union layout not resolved
|
|
.sema => try ty.resolveUnionAlignment(pt),
|
|
.lazy => return .{ .val = Value.fromInterned(try pt.intern(.{ .int = .{
|
|
.ty = .comptime_int_type,
|
|
.storage = .{ .lazy_align = ty.toIntern() },
|
|
} })) },
|
|
};
|
|
|
|
return .{ .scalar = union_type.flagsUnordered(ip).alignment };
|
|
},
|
|
.opaque_type => return .{ .scalar = .@"1" },
|
|
.enum_type => return .{
|
|
.scalar = Type.fromInterned(ip.loadEnumType(ty.toIntern()).tag_ty).abiAlignment(zcu),
|
|
},
|
|
|
|
// values, not types
|
|
.undef,
|
|
.simple_value,
|
|
.variable,
|
|
.@"extern",
|
|
.func,
|
|
.int,
|
|
.err,
|
|
.error_union,
|
|
.enum_literal,
|
|
.enum_tag,
|
|
.empty_enum_value,
|
|
.float,
|
|
.ptr,
|
|
.slice,
|
|
.opt,
|
|
.aggregate,
|
|
.un,
|
|
// memoization, not types
|
|
.memoized_call,
|
|
=> unreachable,
|
|
},
|
|
}
|
|
}
|
|
|
|
fn abiAlignmentInnerErrorUnion(
|
|
ty: Type,
|
|
comptime strat: ResolveStratLazy,
|
|
zcu: strat.ZcuPtr(),
|
|
tid: strat.Tid(),
|
|
payload_ty: Type,
|
|
) SemaError!AbiAlignmentInner {
|
|
// This code needs to be kept in sync with the equivalent switch prong
|
|
// in abiSizeInner.
|
|
const code_align = Type.anyerror.abiAlignment(zcu);
|
|
switch (strat) {
|
|
.eager, .sema => {
|
|
if (!(payload_ty.hasRuntimeBitsInner(false, strat, zcu, tid) catch |err| switch (err) {
|
|
error.NeedLazy => if (strat == .lazy) {
|
|
const pt = strat.pt(zcu, tid);
|
|
return .{ .val = Value.fromInterned(try pt.intern(.{ .int = .{
|
|
.ty = .comptime_int_type,
|
|
.storage = .{ .lazy_align = ty.toIntern() },
|
|
} })) };
|
|
} else unreachable,
|
|
else => |e| return e,
|
|
})) {
|
|
return .{ .scalar = code_align };
|
|
}
|
|
return .{ .scalar = code_align.max(
|
|
(try payload_ty.abiAlignmentInner(strat, zcu, tid)).scalar,
|
|
) };
|
|
},
|
|
.lazy => {
|
|
const pt = strat.pt(zcu, tid);
|
|
switch (try payload_ty.abiAlignmentInner(strat, zcu, tid)) {
|
|
.scalar => |payload_align| return .{ .scalar = code_align.max(payload_align) },
|
|
.val => {},
|
|
}
|
|
return .{ .val = Value.fromInterned(try pt.intern(.{ .int = .{
|
|
.ty = .comptime_int_type,
|
|
.storage = .{ .lazy_align = ty.toIntern() },
|
|
} })) };
|
|
},
|
|
}
|
|
}
|
|
|
|
fn abiAlignmentInnerOptional(
|
|
ty: Type,
|
|
comptime strat: ResolveStratLazy,
|
|
zcu: strat.ZcuPtr(),
|
|
tid: strat.Tid(),
|
|
) SemaError!AbiAlignmentInner {
|
|
const pt = strat.pt(zcu, tid);
|
|
const target = zcu.getTarget();
|
|
const child_type = ty.optionalChild(zcu);
|
|
|
|
switch (child_type.zigTypeTag(zcu)) {
|
|
.pointer => return .{ .scalar = ptrAbiAlignment(target) },
|
|
.error_set => return Type.anyerror.abiAlignmentInner(strat, zcu, tid),
|
|
.noreturn => return .{ .scalar = .@"1" },
|
|
else => {},
|
|
}
|
|
|
|
switch (strat) {
|
|
.eager, .sema => {
|
|
if (!(child_type.hasRuntimeBitsInner(false, strat, zcu, tid) catch |err| switch (err) {
|
|
error.NeedLazy => if (strat == .lazy) {
|
|
return .{ .val = Value.fromInterned(try pt.intern(.{ .int = .{
|
|
.ty = .comptime_int_type,
|
|
.storage = .{ .lazy_align = ty.toIntern() },
|
|
} })) };
|
|
} else unreachable,
|
|
else => |e| return e,
|
|
})) {
|
|
return .{ .scalar = .@"1" };
|
|
}
|
|
return child_type.abiAlignmentInner(strat, zcu, tid);
|
|
},
|
|
.lazy => switch (try child_type.abiAlignmentInner(strat, zcu, tid)) {
|
|
.scalar => |x| return .{ .scalar = x.max(.@"1") },
|
|
.val => return .{ .val = Value.fromInterned(try pt.intern(.{ .int = .{
|
|
.ty = .comptime_int_type,
|
|
.storage = .{ .lazy_align = ty.toIntern() },
|
|
} })) },
|
|
},
|
|
}
|
|
}
|
|
|
|
const AbiSizeInner = union(enum) {
|
|
scalar: u64,
|
|
val: Value,
|
|
};
|
|
|
|
/// Asserts the type has the ABI size already resolved.
|
|
/// Types that return false for hasRuntimeBits() return 0.
|
|
pub fn abiSize(ty: Type, zcu: *const Zcu) u64 {
|
|
return (abiSizeInner(ty, .eager, zcu, {}) catch unreachable).scalar;
|
|
}
|
|
|
|
/// May capture a reference to `ty`.
|
|
pub fn abiSizeLazy(ty: Type, pt: Zcu.PerThread) !Value {
|
|
switch (try ty.abiSizeInner(.lazy, pt.zcu, pt.tid)) {
|
|
.val => |val| return val,
|
|
.scalar => |x| return pt.intValue(Type.comptime_int, x),
|
|
}
|
|
}
|
|
|
|
pub fn abiSizeSema(ty: Type, pt: Zcu.PerThread) SemaError!u64 {
|
|
return (try abiSizeInner(ty, .sema, pt.zcu, pt.tid)).scalar;
|
|
}
|
|
|
|
/// If you pass `eager` you will get back `scalar` and assert the type is resolved.
|
|
/// In this case there will be no error, guaranteed.
|
|
/// If you pass `lazy` you may get back `scalar` or `val`.
|
|
/// If `val` is returned, a reference to `ty` has been captured.
|
|
/// If you pass `sema` you will get back `scalar` and resolve the type if
|
|
/// necessary, possibly returning a CompileError.
|
|
pub fn abiSizeInner(
|
|
ty: Type,
|
|
comptime strat: ResolveStratLazy,
|
|
zcu: strat.ZcuPtr(),
|
|
tid: strat.Tid(),
|
|
) SemaError!AbiSizeInner {
|
|
const target = zcu.getTarget();
|
|
const ip = &zcu.intern_pool;
|
|
|
|
switch (ty.toIntern()) {
|
|
.empty_tuple_type => return .{ .scalar = 0 },
|
|
|
|
else => switch (ip.indexToKey(ty.toIntern())) {
|
|
.int_type => |int_type| {
|
|
if (int_type.bits == 0) return .{ .scalar = 0 };
|
|
return .{ .scalar = intAbiSize(int_type.bits, target) };
|
|
},
|
|
.ptr_type => |ptr_type| switch (ptr_type.flags.size) {
|
|
.slice => return .{ .scalar = @divExact(target.ptrBitWidth(), 8) * 2 },
|
|
else => return .{ .scalar = @divExact(target.ptrBitWidth(), 8) },
|
|
},
|
|
.anyframe_type => return .{ .scalar = @divExact(target.ptrBitWidth(), 8) },
|
|
|
|
.array_type => |array_type| {
|
|
const len = array_type.lenIncludingSentinel();
|
|
if (len == 0) return .{ .scalar = 0 };
|
|
switch (try Type.fromInterned(array_type.child).abiSizeInner(strat, zcu, tid)) {
|
|
.scalar => |elem_size| return .{ .scalar = len * elem_size },
|
|
.val => switch (strat) {
|
|
.sema, .eager => unreachable,
|
|
.lazy => {
|
|
const pt = strat.pt(zcu, tid);
|
|
return .{ .val = Value.fromInterned(try pt.intern(.{ .int = .{
|
|
.ty = .comptime_int_type,
|
|
.storage = .{ .lazy_size = ty.toIntern() },
|
|
} })) };
|
|
},
|
|
},
|
|
}
|
|
},
|
|
.vector_type => |vector_type| {
|
|
const sub_strat: ResolveStrat = switch (strat) {
|
|
.sema => .sema,
|
|
.eager => .normal,
|
|
.lazy => {
|
|
const pt = strat.pt(zcu, tid);
|
|
return .{ .val = Value.fromInterned(try pt.intern(.{ .int = .{
|
|
.ty = .comptime_int_type,
|
|
.storage = .{ .lazy_size = ty.toIntern() },
|
|
} })) };
|
|
},
|
|
};
|
|
const alignment = (try ty.abiAlignmentInner(strat, zcu, tid)).scalar;
|
|
const total_bytes = switch (zcu.comp.getZigBackend()) {
|
|
else => total_bytes: {
|
|
const elem_bits = try Type.fromInterned(vector_type.child).bitSizeInner(sub_strat, zcu, tid);
|
|
const total_bits = elem_bits * vector_type.len;
|
|
break :total_bytes (total_bits + 7) / 8;
|
|
},
|
|
.stage2_c => total_bytes: {
|
|
const elem_bytes: u32 = @intCast((try Type.fromInterned(vector_type.child).abiSizeInner(strat, zcu, tid)).scalar);
|
|
break :total_bytes elem_bytes * vector_type.len;
|
|
},
|
|
.stage2_x86_64 => total_bytes: {
|
|
if (vector_type.child == .bool_type) break :total_bytes std.math.divCeil(u32, vector_type.len, 8) catch unreachable;
|
|
const elem_bytes: u32 = @intCast((try Type.fromInterned(vector_type.child).abiSizeInner(strat, zcu, tid)).scalar);
|
|
break :total_bytes elem_bytes * vector_type.len;
|
|
},
|
|
};
|
|
return .{ .scalar = alignment.forward(total_bytes) };
|
|
},
|
|
|
|
.opt_type => return ty.abiSizeInnerOptional(strat, zcu, tid),
|
|
|
|
.error_set_type, .inferred_error_set_type => {
|
|
const bits = zcu.errorSetBits();
|
|
if (bits == 0) return .{ .scalar = 0 };
|
|
return .{ .scalar = intAbiSize(bits, target) };
|
|
},
|
|
|
|
.error_union_type => |error_union_type| {
|
|
const payload_ty = Type.fromInterned(error_union_type.payload_type);
|
|
// This code needs to be kept in sync with the equivalent switch prong
|
|
// in abiAlignmentInner.
|
|
const code_size = Type.anyerror.abiSize(zcu);
|
|
if (!(payload_ty.hasRuntimeBitsInner(false, strat, zcu, tid) catch |err| switch (err) {
|
|
error.NeedLazy => if (strat == .lazy) {
|
|
const pt = strat.pt(zcu, tid);
|
|
return .{ .val = Value.fromInterned(try pt.intern(.{ .int = .{
|
|
.ty = .comptime_int_type,
|
|
.storage = .{ .lazy_size = ty.toIntern() },
|
|
} })) };
|
|
} else unreachable,
|
|
else => |e| return e,
|
|
})) {
|
|
// Same as anyerror.
|
|
return .{ .scalar = code_size };
|
|
}
|
|
const code_align = Type.anyerror.abiAlignment(zcu);
|
|
const payload_align = (try payload_ty.abiAlignmentInner(strat, zcu, tid)).scalar;
|
|
const payload_size = switch (try payload_ty.abiSizeInner(strat, zcu, tid)) {
|
|
.scalar => |elem_size| elem_size,
|
|
.val => switch (strat) {
|
|
.sema => unreachable,
|
|
.eager => unreachable,
|
|
.lazy => {
|
|
const pt = strat.pt(zcu, tid);
|
|
return .{ .val = Value.fromInterned(try pt.intern(.{ .int = .{
|
|
.ty = .comptime_int_type,
|
|
.storage = .{ .lazy_size = ty.toIntern() },
|
|
} })) };
|
|
},
|
|
},
|
|
};
|
|
|
|
var size: u64 = 0;
|
|
if (code_align.compare(.gt, payload_align)) {
|
|
size += code_size;
|
|
size = payload_align.forward(size);
|
|
size += payload_size;
|
|
size = code_align.forward(size);
|
|
} else {
|
|
size += payload_size;
|
|
size = code_align.forward(size);
|
|
size += code_size;
|
|
size = payload_align.forward(size);
|
|
}
|
|
return .{ .scalar = size };
|
|
},
|
|
.func_type => unreachable, // represents machine code; not a pointer
|
|
.simple_type => |t| switch (t) {
|
|
.bool => return .{ .scalar = 1 },
|
|
|
|
.f16 => return .{ .scalar = 2 },
|
|
.f32 => return .{ .scalar = 4 },
|
|
.f64 => return .{ .scalar = 8 },
|
|
.f128 => return .{ .scalar = 16 },
|
|
.f80 => switch (target.cTypeBitSize(.longdouble)) {
|
|
80 => return .{ .scalar = target.cTypeByteSize(.longdouble) },
|
|
else => return .{ .scalar = Type.u80.abiSize(zcu) },
|
|
},
|
|
|
|
.usize,
|
|
.isize,
|
|
=> return .{ .scalar = @divExact(target.ptrBitWidth(), 8) },
|
|
|
|
.c_char => return .{ .scalar = target.cTypeByteSize(.char) },
|
|
.c_short => return .{ .scalar = target.cTypeByteSize(.short) },
|
|
.c_ushort => return .{ .scalar = target.cTypeByteSize(.ushort) },
|
|
.c_int => return .{ .scalar = target.cTypeByteSize(.int) },
|
|
.c_uint => return .{ .scalar = target.cTypeByteSize(.uint) },
|
|
.c_long => return .{ .scalar = target.cTypeByteSize(.long) },
|
|
.c_ulong => return .{ .scalar = target.cTypeByteSize(.ulong) },
|
|
.c_longlong => return .{ .scalar = target.cTypeByteSize(.longlong) },
|
|
.c_ulonglong => return .{ .scalar = target.cTypeByteSize(.ulonglong) },
|
|
.c_longdouble => return .{ .scalar = target.cTypeByteSize(.longdouble) },
|
|
|
|
.anyopaque,
|
|
.void,
|
|
.type,
|
|
.comptime_int,
|
|
.comptime_float,
|
|
.null,
|
|
.undefined,
|
|
.enum_literal,
|
|
=> return .{ .scalar = 0 },
|
|
|
|
.anyerror, .adhoc_inferred_error_set => {
|
|
const bits = zcu.errorSetBits();
|
|
if (bits == 0) return .{ .scalar = 0 };
|
|
return .{ .scalar = intAbiSize(bits, target) };
|
|
},
|
|
|
|
.noreturn => unreachable,
|
|
.generic_poison => unreachable,
|
|
},
|
|
.struct_type => {
|
|
const struct_type = ip.loadStructType(ty.toIntern());
|
|
switch (strat) {
|
|
.sema => try ty.resolveLayout(strat.pt(zcu, tid)),
|
|
.lazy => {
|
|
const pt = strat.pt(zcu, tid);
|
|
switch (struct_type.layout) {
|
|
.@"packed" => {
|
|
if (struct_type.backingIntTypeUnordered(ip) == .none) return .{
|
|
.val = Value.fromInterned(try pt.intern(.{ .int = .{
|
|
.ty = .comptime_int_type,
|
|
.storage = .{ .lazy_size = ty.toIntern() },
|
|
} })),
|
|
};
|
|
},
|
|
.auto, .@"extern" => {
|
|
if (!struct_type.haveLayout(ip)) return .{
|
|
.val = Value.fromInterned(try pt.intern(.{ .int = .{
|
|
.ty = .comptime_int_type,
|
|
.storage = .{ .lazy_size = ty.toIntern() },
|
|
} })),
|
|
};
|
|
},
|
|
}
|
|
},
|
|
.eager => {},
|
|
}
|
|
switch (struct_type.layout) {
|
|
.@"packed" => return .{
|
|
.scalar = Type.fromInterned(struct_type.backingIntTypeUnordered(ip)).abiSize(zcu),
|
|
},
|
|
.auto, .@"extern" => {
|
|
assert(struct_type.haveLayout(ip));
|
|
return .{ .scalar = struct_type.sizeUnordered(ip) };
|
|
},
|
|
}
|
|
},
|
|
.tuple_type => |tuple| {
|
|
switch (strat) {
|
|
.sema => try ty.resolveLayout(strat.pt(zcu, tid)),
|
|
.lazy, .eager => {},
|
|
}
|
|
const field_count = tuple.types.len;
|
|
if (field_count == 0) {
|
|
return .{ .scalar = 0 };
|
|
}
|
|
return .{ .scalar = ty.structFieldOffset(field_count, zcu) };
|
|
},
|
|
|
|
.union_type => {
|
|
const union_type = ip.loadUnionType(ty.toIntern());
|
|
switch (strat) {
|
|
.sema => try ty.resolveLayout(strat.pt(zcu, tid)),
|
|
.lazy => {
|
|
const pt = strat.pt(zcu, tid);
|
|
if (!union_type.flagsUnordered(ip).status.haveLayout()) return .{
|
|
.val = Value.fromInterned(try pt.intern(.{ .int = .{
|
|
.ty = .comptime_int_type,
|
|
.storage = .{ .lazy_size = ty.toIntern() },
|
|
} })),
|
|
};
|
|
},
|
|
.eager => {},
|
|
}
|
|
|
|
assert(union_type.haveLayout(ip));
|
|
return .{ .scalar = union_type.sizeUnordered(ip) };
|
|
},
|
|
.opaque_type => unreachable, // no size available
|
|
.enum_type => return .{ .scalar = Type.fromInterned(ip.loadEnumType(ty.toIntern()).tag_ty).abiSize(zcu) },
|
|
|
|
// values, not types
|
|
.undef,
|
|
.simple_value,
|
|
.variable,
|
|
.@"extern",
|
|
.func,
|
|
.int,
|
|
.err,
|
|
.error_union,
|
|
.enum_literal,
|
|
.enum_tag,
|
|
.empty_enum_value,
|
|
.float,
|
|
.ptr,
|
|
.slice,
|
|
.opt,
|
|
.aggregate,
|
|
.un,
|
|
// memoization, not types
|
|
.memoized_call,
|
|
=> unreachable,
|
|
},
|
|
}
|
|
}
|
|
|
|
fn abiSizeInnerOptional(
|
|
ty: Type,
|
|
comptime strat: ResolveStratLazy,
|
|
zcu: strat.ZcuPtr(),
|
|
tid: strat.Tid(),
|
|
) SemaError!AbiSizeInner {
|
|
const child_ty = ty.optionalChild(zcu);
|
|
|
|
if (child_ty.isNoReturn(zcu)) {
|
|
return .{ .scalar = 0 };
|
|
}
|
|
|
|
if (!(child_ty.hasRuntimeBitsInner(false, strat, zcu, tid) catch |err| switch (err) {
|
|
error.NeedLazy => if (strat == .lazy) {
|
|
const pt = strat.pt(zcu, tid);
|
|
return .{ .val = Value.fromInterned(try pt.intern(.{ .int = .{
|
|
.ty = .comptime_int_type,
|
|
.storage = .{ .lazy_size = ty.toIntern() },
|
|
} })) };
|
|
} else unreachable,
|
|
else => |e| return e,
|
|
})) return .{ .scalar = 1 };
|
|
|
|
if (ty.optionalReprIsPayload(zcu)) {
|
|
return child_ty.abiSizeInner(strat, zcu, tid);
|
|
}
|
|
|
|
const payload_size = switch (try child_ty.abiSizeInner(strat, zcu, tid)) {
|
|
.scalar => |elem_size| elem_size,
|
|
.val => switch (strat) {
|
|
.sema => unreachable,
|
|
.eager => unreachable,
|
|
.lazy => return .{ .val = Value.fromInterned(try strat.pt(zcu, tid).intern(.{ .int = .{
|
|
.ty = .comptime_int_type,
|
|
.storage = .{ .lazy_size = ty.toIntern() },
|
|
} })) },
|
|
},
|
|
};
|
|
|
|
// Optional types are represented as a struct with the child type as the first
|
|
// field and a boolean as the second. Since the child type's abi alignment is
|
|
// guaranteed to be >= that of bool's (1 byte) the added size is exactly equal
|
|
// to the child type's ABI alignment.
|
|
return .{
|
|
.scalar = (child_ty.abiAlignment(zcu).toByteUnits() orelse 0) + payload_size,
|
|
};
|
|
}
|
|
|
|
pub fn ptrAbiAlignment(target: Target) Alignment {
|
|
return Alignment.fromNonzeroByteUnits(@divExact(target.ptrBitWidth(), 8));
|
|
}
|
|
|
|
pub fn intAbiSize(bits: u16, target: Target) u64 {
|
|
return intAbiAlignment(bits, target).forward(@as(u16, @intCast((@as(u17, bits) + 7) / 8)));
|
|
}
|
|
|
|
pub fn intAbiAlignment(bits: u16, target: Target) Alignment {
|
|
return switch (target.cpu.arch) {
|
|
.x86 => switch (bits) {
|
|
0 => .none,
|
|
1...8 => .@"1",
|
|
9...16 => .@"2",
|
|
17...32 => .@"4",
|
|
33...64 => switch (target.os.tag) {
|
|
.uefi, .windows => .@"8",
|
|
else => .@"4",
|
|
},
|
|
else => .@"16",
|
|
},
|
|
.x86_64 => switch (bits) {
|
|
0 => .none,
|
|
1...8 => .@"1",
|
|
9...16 => .@"2",
|
|
17...32 => .@"4",
|
|
33...64 => .@"8",
|
|
else => .@"16",
|
|
},
|
|
else => return Alignment.fromByteUnits(@min(
|
|
std.math.ceilPowerOfTwoPromote(u16, @as(u16, @intCast((@as(u17, bits) + 7) / 8))),
|
|
maxIntAlignment(target),
|
|
)),
|
|
};
|
|
}
|
|
|
|
pub fn maxIntAlignment(target: std.Target) u16 {
|
|
return switch (target.cpu.arch) {
|
|
.avr => 1,
|
|
.msp430 => 2,
|
|
.xcore => 4,
|
|
.propeller => 4,
|
|
|
|
.arm,
|
|
.armeb,
|
|
.thumb,
|
|
.thumbeb,
|
|
.hexagon,
|
|
.mips,
|
|
.mipsel,
|
|
.powerpc,
|
|
.powerpcle,
|
|
.amdgcn,
|
|
.riscv32,
|
|
.sparc,
|
|
.s390x,
|
|
.lanai,
|
|
.wasm32,
|
|
.wasm64,
|
|
=> 8,
|
|
|
|
// For these, LLVMABIAlignmentOfType(i128) reports 8. Note that 16
|
|
// is a relevant number in three cases:
|
|
// 1. Different machine code instruction when loading into SIMD register.
|
|
// 2. The C ABI wants 16 for extern structs.
|
|
// 3. 16-byte cmpxchg needs 16-byte alignment.
|
|
// Same logic for powerpc64, mips64, sparc64.
|
|
.powerpc64,
|
|
.powerpc64le,
|
|
.mips64,
|
|
.mips64el,
|
|
.sparc64,
|
|
=> switch (target.ofmt) {
|
|
.c => 16,
|
|
else => 8,
|
|
},
|
|
|
|
.x86_64 => 16,
|
|
|
|
// Even LLVMABIAlignmentOfType(i128) agrees on these targets.
|
|
.x86,
|
|
.aarch64,
|
|
.aarch64_be,
|
|
.riscv64,
|
|
.bpfel,
|
|
.bpfeb,
|
|
.nvptx,
|
|
.nvptx64,
|
|
=> 16,
|
|
|
|
// Below this comment are unverified but based on the fact that C requires
|
|
// int128_t to be 16 bytes aligned, it's a safe default.
|
|
.csky,
|
|
.arc,
|
|
.m68k,
|
|
.kalimba,
|
|
.spirv,
|
|
.spirv32,
|
|
.ve,
|
|
.spirv64,
|
|
.loongarch32,
|
|
.loongarch64,
|
|
.xtensa,
|
|
=> 16,
|
|
};
|
|
}
|
|
|
|
pub fn bitSize(ty: Type, zcu: *const Zcu) u64 {
|
|
return bitSizeInner(ty, .normal, zcu, {}) catch unreachable;
|
|
}
|
|
|
|
pub fn bitSizeSema(ty: Type, pt: Zcu.PerThread) SemaError!u64 {
|
|
return bitSizeInner(ty, .sema, pt.zcu, pt.tid);
|
|
}
|
|
|
|
pub fn bitSizeInner(
|
|
ty: Type,
|
|
comptime strat: ResolveStrat,
|
|
zcu: strat.ZcuPtr(),
|
|
tid: strat.Tid(),
|
|
) SemaError!u64 {
|
|
const target = zcu.getTarget();
|
|
const ip = &zcu.intern_pool;
|
|
|
|
const strat_lazy: ResolveStratLazy = strat.toLazy();
|
|
|
|
switch (ip.indexToKey(ty.toIntern())) {
|
|
.int_type => |int_type| return int_type.bits,
|
|
.ptr_type => |ptr_type| switch (ptr_type.flags.size) {
|
|
.slice => return target.ptrBitWidth() * 2,
|
|
else => return target.ptrBitWidth(),
|
|
},
|
|
.anyframe_type => return target.ptrBitWidth(),
|
|
|
|
.array_type => |array_type| {
|
|
const len = array_type.lenIncludingSentinel();
|
|
if (len == 0) return 0;
|
|
const elem_ty = Type.fromInterned(array_type.child);
|
|
const elem_size = @max(
|
|
(try elem_ty.abiAlignmentInner(strat_lazy, zcu, tid)).scalar.toByteUnits() orelse 0,
|
|
(try elem_ty.abiSizeInner(strat_lazy, zcu, tid)).scalar,
|
|
);
|
|
if (elem_size == 0) return 0;
|
|
const elem_bit_size = try elem_ty.bitSizeInner(strat, zcu, tid);
|
|
return (len - 1) * 8 * elem_size + elem_bit_size;
|
|
},
|
|
.vector_type => |vector_type| {
|
|
const child_ty = Type.fromInterned(vector_type.child);
|
|
const elem_bit_size = try child_ty.bitSizeInner(strat, zcu, tid);
|
|
return elem_bit_size * vector_type.len;
|
|
},
|
|
.opt_type => {
|
|
// Optionals and error unions are not packed so their bitsize
|
|
// includes padding bits.
|
|
return (try ty.abiSizeInner(strat_lazy, zcu, tid)).scalar * 8;
|
|
},
|
|
|
|
.error_set_type, .inferred_error_set_type => return zcu.errorSetBits(),
|
|
|
|
.error_union_type => {
|
|
// Optionals and error unions are not packed so their bitsize
|
|
// includes padding bits.
|
|
return (try ty.abiSizeInner(strat_lazy, zcu, tid)).scalar * 8;
|
|
},
|
|
.func_type => unreachable, // represents machine code; not a pointer
|
|
.simple_type => |t| switch (t) {
|
|
.f16 => return 16,
|
|
.f32 => return 32,
|
|
.f64 => return 64,
|
|
.f80 => return 80,
|
|
.f128 => return 128,
|
|
|
|
.usize,
|
|
.isize,
|
|
=> return target.ptrBitWidth(),
|
|
|
|
.c_char => return target.cTypeBitSize(.char),
|
|
.c_short => return target.cTypeBitSize(.short),
|
|
.c_ushort => return target.cTypeBitSize(.ushort),
|
|
.c_int => return target.cTypeBitSize(.int),
|
|
.c_uint => return target.cTypeBitSize(.uint),
|
|
.c_long => return target.cTypeBitSize(.long),
|
|
.c_ulong => return target.cTypeBitSize(.ulong),
|
|
.c_longlong => return target.cTypeBitSize(.longlong),
|
|
.c_ulonglong => return target.cTypeBitSize(.ulonglong),
|
|
.c_longdouble => return target.cTypeBitSize(.longdouble),
|
|
|
|
.bool => return 1,
|
|
.void => return 0,
|
|
|
|
.anyerror,
|
|
.adhoc_inferred_error_set,
|
|
=> return zcu.errorSetBits(),
|
|
|
|
.anyopaque => unreachable,
|
|
.type => unreachable,
|
|
.comptime_int => unreachable,
|
|
.comptime_float => unreachable,
|
|
.noreturn => unreachable,
|
|
.null => unreachable,
|
|
.undefined => unreachable,
|
|
.enum_literal => unreachable,
|
|
.generic_poison => unreachable,
|
|
},
|
|
.struct_type => {
|
|
const struct_type = ip.loadStructType(ty.toIntern());
|
|
const is_packed = struct_type.layout == .@"packed";
|
|
if (strat == .sema) {
|
|
const pt = strat.pt(zcu, tid);
|
|
try ty.resolveFields(pt);
|
|
if (is_packed) try ty.resolveLayout(pt);
|
|
}
|
|
if (is_packed) {
|
|
return try Type.fromInterned(struct_type.backingIntTypeUnordered(ip))
|
|
.bitSizeInner(strat, zcu, tid);
|
|
}
|
|
return (try ty.abiSizeInner(strat_lazy, zcu, tid)).scalar * 8;
|
|
},
|
|
|
|
.tuple_type => {
|
|
return (try ty.abiSizeInner(strat_lazy, zcu, tid)).scalar * 8;
|
|
},
|
|
|
|
.union_type => {
|
|
const union_type = ip.loadUnionType(ty.toIntern());
|
|
const is_packed = ty.containerLayout(zcu) == .@"packed";
|
|
if (strat == .sema) {
|
|
const pt = strat.pt(zcu, tid);
|
|
try ty.resolveFields(pt);
|
|
if (is_packed) try ty.resolveLayout(pt);
|
|
}
|
|
if (!is_packed) {
|
|
return (try ty.abiSizeInner(strat_lazy, zcu, tid)).scalar * 8;
|
|
}
|
|
assert(union_type.flagsUnordered(ip).status.haveFieldTypes());
|
|
|
|
var size: u64 = 0;
|
|
for (0..union_type.field_types.len) |field_index| {
|
|
const field_ty = union_type.field_types.get(ip)[field_index];
|
|
size = @max(size, try Type.fromInterned(field_ty).bitSizeInner(strat, zcu, tid));
|
|
}
|
|
|
|
return size;
|
|
},
|
|
.opaque_type => unreachable,
|
|
.enum_type => return Type.fromInterned(ip.loadEnumType(ty.toIntern()).tag_ty)
|
|
.bitSizeInner(strat, zcu, tid),
|
|
|
|
// values, not types
|
|
.undef,
|
|
.simple_value,
|
|
.variable,
|
|
.@"extern",
|
|
.func,
|
|
.int,
|
|
.err,
|
|
.error_union,
|
|
.enum_literal,
|
|
.enum_tag,
|
|
.empty_enum_value,
|
|
.float,
|
|
.ptr,
|
|
.slice,
|
|
.opt,
|
|
.aggregate,
|
|
.un,
|
|
// memoization, not types
|
|
.memoized_call,
|
|
=> unreachable,
|
|
}
|
|
}
|
|
|
|
/// Returns true if the type's layout is already resolved and it is safe
|
|
/// to use `abiSize`, `abiAlignment` and `bitSize` on it.
|
|
pub fn layoutIsResolved(ty: Type, zcu: *const Zcu) bool {
|
|
const ip = &zcu.intern_pool;
|
|
return switch (ip.indexToKey(ty.toIntern())) {
|
|
.struct_type => ip.loadStructType(ty.toIntern()).haveLayout(ip),
|
|
.union_type => ip.loadUnionType(ty.toIntern()).haveLayout(ip),
|
|
.array_type => |array_type| {
|
|
if (array_type.lenIncludingSentinel() == 0) return true;
|
|
return Type.fromInterned(array_type.child).layoutIsResolved(zcu);
|
|
},
|
|
.opt_type => |child| Type.fromInterned(child).layoutIsResolved(zcu),
|
|
.error_union_type => |k| Type.fromInterned(k.payload_type).layoutIsResolved(zcu),
|
|
else => true,
|
|
};
|
|
}
|
|
|
|
pub fn isSinglePointer(ty: Type, zcu: *const Zcu) bool {
|
|
return switch (zcu.intern_pool.indexToKey(ty.toIntern())) {
|
|
.ptr_type => |ptr_info| ptr_info.flags.size == .one,
|
|
else => false,
|
|
};
|
|
}
|
|
|
|
/// Asserts `ty` is a pointer.
|
|
pub fn ptrSize(ty: Type, zcu: *const Zcu) std.builtin.Type.Pointer.Size {
|
|
return ty.ptrSizeOrNull(zcu).?;
|
|
}
|
|
|
|
/// Returns `null` if `ty` is not a pointer.
|
|
pub fn ptrSizeOrNull(ty: Type, zcu: *const Zcu) ?std.builtin.Type.Pointer.Size {
|
|
return switch (zcu.intern_pool.indexToKey(ty.toIntern())) {
|
|
.ptr_type => |ptr_info| ptr_info.flags.size,
|
|
else => null,
|
|
};
|
|
}
|
|
|
|
pub fn isSlice(ty: Type, zcu: *const Zcu) bool {
|
|
return switch (zcu.intern_pool.indexToKey(ty.toIntern())) {
|
|
.ptr_type => |ptr_type| ptr_type.flags.size == .slice,
|
|
else => false,
|
|
};
|
|
}
|
|
|
|
pub fn isSliceAtRuntime(ty: Type, zcu: *const Zcu) bool {
|
|
return switch (zcu.intern_pool.indexToKey(ty.toIntern())) {
|
|
.ptr_type => |ptr_type| ptr_type.flags.size == .slice,
|
|
.opt_type => |child| switch (zcu.intern_pool.indexToKey(child)) {
|
|
.ptr_type => |ptr_type| !ptr_type.flags.is_allowzero and ptr_type.flags.size == .slice,
|
|
else => false,
|
|
},
|
|
else => false,
|
|
};
|
|
}
|
|
|
|
pub fn slicePtrFieldType(ty: Type, zcu: *const Zcu) Type {
|
|
return Type.fromInterned(zcu.intern_pool.slicePtrType(ty.toIntern()));
|
|
}
|
|
|
|
pub fn isConstPtr(ty: Type, zcu: *const Zcu) bool {
|
|
return switch (zcu.intern_pool.indexToKey(ty.toIntern())) {
|
|
.ptr_type => |ptr_type| ptr_type.flags.is_const,
|
|
else => false,
|
|
};
|
|
}
|
|
|
|
pub fn isVolatilePtr(ty: Type, zcu: *const Zcu) bool {
|
|
return isVolatilePtrIp(ty, &zcu.intern_pool);
|
|
}
|
|
|
|
pub fn isVolatilePtrIp(ty: Type, ip: *const InternPool) bool {
|
|
return switch (ip.indexToKey(ty.toIntern())) {
|
|
.ptr_type => |ptr_type| ptr_type.flags.is_volatile,
|
|
else => false,
|
|
};
|
|
}
|
|
|
|
pub fn isAllowzeroPtr(ty: Type, zcu: *const Zcu) bool {
|
|
return switch (zcu.intern_pool.indexToKey(ty.toIntern())) {
|
|
.ptr_type => |ptr_type| ptr_type.flags.is_allowzero,
|
|
.opt_type => true,
|
|
else => false,
|
|
};
|
|
}
|
|
|
|
pub fn isCPtr(ty: Type, zcu: *const Zcu) bool {
|
|
return switch (zcu.intern_pool.indexToKey(ty.toIntern())) {
|
|
.ptr_type => |ptr_type| ptr_type.flags.size == .c,
|
|
else => false,
|
|
};
|
|
}
|
|
|
|
pub fn isPtrAtRuntime(ty: Type, zcu: *const Zcu) bool {
|
|
return switch (zcu.intern_pool.indexToKey(ty.toIntern())) {
|
|
.ptr_type => |ptr_type| switch (ptr_type.flags.size) {
|
|
.slice => false,
|
|
.one, .many, .c => true,
|
|
},
|
|
.opt_type => |child| switch (zcu.intern_pool.indexToKey(child)) {
|
|
.ptr_type => |p| switch (p.flags.size) {
|
|
.slice, .c => false,
|
|
.many, .one => !p.flags.is_allowzero,
|
|
},
|
|
else => false,
|
|
},
|
|
else => false,
|
|
};
|
|
}
|
|
|
|
/// For pointer-like optionals, returns true, otherwise returns the allowzero property
|
|
/// of pointers.
|
|
pub fn ptrAllowsZero(ty: Type, zcu: *const Zcu) bool {
|
|
if (ty.isPtrLikeOptional(zcu)) {
|
|
return true;
|
|
}
|
|
return ty.ptrInfo(zcu).flags.is_allowzero;
|
|
}
|
|
|
|
/// See also `isPtrLikeOptional`.
|
|
pub fn optionalReprIsPayload(ty: Type, zcu: *const Zcu) bool {
|
|
return switch (zcu.intern_pool.indexToKey(ty.toIntern())) {
|
|
.opt_type => |child_type| child_type == .anyerror_type or switch (zcu.intern_pool.indexToKey(child_type)) {
|
|
.ptr_type => |ptr_type| ptr_type.flags.size != .c and !ptr_type.flags.is_allowzero,
|
|
.error_set_type, .inferred_error_set_type => true,
|
|
else => false,
|
|
},
|
|
.ptr_type => |ptr_type| ptr_type.flags.size == .c,
|
|
else => false,
|
|
};
|
|
}
|
|
|
|
/// Returns true if the type is optional and would be lowered to a single pointer
|
|
/// address value, using 0 for null. Note that this returns true for C pointers.
|
|
/// This function must be kept in sync with `Sema.typePtrOrOptionalPtrTy`.
|
|
pub fn isPtrLikeOptional(ty: Type, zcu: *const Zcu) bool {
|
|
return switch (zcu.intern_pool.indexToKey(ty.toIntern())) {
|
|
.ptr_type => |ptr_type| ptr_type.flags.size == .c,
|
|
.opt_type => |child| switch (zcu.intern_pool.indexToKey(child)) {
|
|
.ptr_type => |ptr_type| switch (ptr_type.flags.size) {
|
|
.slice, .c => false,
|
|
.many, .one => !ptr_type.flags.is_allowzero,
|
|
},
|
|
else => false,
|
|
},
|
|
else => false,
|
|
};
|
|
}
|
|
|
|
/// For *[N]T, returns [N]T.
|
|
/// For *T, returns T.
|
|
/// For [*]T, returns T.
|
|
pub fn childType(ty: Type, zcu: *const Zcu) Type {
|
|
return childTypeIp(ty, &zcu.intern_pool);
|
|
}
|
|
|
|
pub fn childTypeIp(ty: Type, ip: *const InternPool) Type {
|
|
return Type.fromInterned(ip.childType(ty.toIntern()));
|
|
}
|
|
|
|
/// For *[N]T, returns T.
|
|
/// For ?*T, returns T.
|
|
/// For ?*[N]T, returns T.
|
|
/// For ?[*]T, returns T.
|
|
/// For *T, returns T.
|
|
/// For [*]T, returns T.
|
|
/// For [N]T, returns T.
|
|
/// For []T, returns T.
|
|
/// For anyframe->T, returns T.
|
|
pub fn elemType2(ty: Type, zcu: *const Zcu) Type {
|
|
return switch (zcu.intern_pool.indexToKey(ty.toIntern())) {
|
|
.ptr_type => |ptr_type| switch (ptr_type.flags.size) {
|
|
.one => Type.fromInterned(ptr_type.child).shallowElemType(zcu),
|
|
.many, .c, .slice => Type.fromInterned(ptr_type.child),
|
|
},
|
|
.anyframe_type => |child| {
|
|
assert(child != .none);
|
|
return Type.fromInterned(child);
|
|
},
|
|
.vector_type => |vector_type| Type.fromInterned(vector_type.child),
|
|
.array_type => |array_type| Type.fromInterned(array_type.child),
|
|
.opt_type => |child| Type.fromInterned(zcu.intern_pool.childType(child)),
|
|
else => unreachable,
|
|
};
|
|
}
|
|
|
|
/// Given that `ty` is an indexable pointer, returns its element type. Specifically:
|
|
/// * for `*[n]T`, returns `T`
|
|
/// * for `[]T`, returns `T`
|
|
/// * for `[*]T`, returns `T`
|
|
/// * for `[*c]T`, returns `T`
|
|
pub fn indexablePtrElem(ty: Type, zcu: *const Zcu) Type {
|
|
const ip = &zcu.intern_pool;
|
|
const ptr_type = ip.indexToKey(ty.toIntern()).ptr_type;
|
|
switch (ptr_type.flags.size) {
|
|
.many, .slice, .c => return .fromInterned(ptr_type.child),
|
|
.one => {},
|
|
}
|
|
const array_type = ip.indexToKey(ptr_type.child).array_type;
|
|
return .fromInterned(array_type.child);
|
|
}
|
|
|
|
fn shallowElemType(child_ty: Type, zcu: *const Zcu) Type {
|
|
return switch (child_ty.zigTypeTag(zcu)) {
|
|
.array, .vector => child_ty.childType(zcu),
|
|
else => child_ty,
|
|
};
|
|
}
|
|
|
|
/// For vectors, returns the element type. Otherwise returns self.
|
|
pub fn scalarType(ty: Type, zcu: *const Zcu) Type {
|
|
return switch (ty.zigTypeTag(zcu)) {
|
|
.vector => ty.childType(zcu),
|
|
else => ty,
|
|
};
|
|
}
|
|
|
|
/// Asserts that the type is an optional.
|
|
/// Note that for C pointers this returns the type unmodified.
|
|
pub fn optionalChild(ty: Type, zcu: *const Zcu) Type {
|
|
return switch (zcu.intern_pool.indexToKey(ty.toIntern())) {
|
|
.opt_type => |child| Type.fromInterned(child),
|
|
.ptr_type => |ptr_type| b: {
|
|
assert(ptr_type.flags.size == .c);
|
|
break :b ty;
|
|
},
|
|
else => unreachable,
|
|
};
|
|
}
|
|
|
|
/// Returns the tag type of a union, if the type is a union and it has a tag type.
|
|
/// Otherwise, returns `null`.
|
|
pub fn unionTagType(ty: Type, zcu: *const Zcu) ?Type {
|
|
const ip = &zcu.intern_pool;
|
|
switch (ip.indexToKey(ty.toIntern())) {
|
|
.union_type => {},
|
|
else => return null,
|
|
}
|
|
const union_type = ip.loadUnionType(ty.toIntern());
|
|
const union_flags = union_type.flagsUnordered(ip);
|
|
switch (union_flags.runtime_tag) {
|
|
.tagged => {
|
|
assert(union_flags.status.haveFieldTypes());
|
|
return Type.fromInterned(union_type.enum_tag_ty);
|
|
},
|
|
else => return null,
|
|
}
|
|
}
|
|
|
|
/// Same as `unionTagType` but includes safety tag.
|
|
/// Codegen should use this version.
|
|
pub fn unionTagTypeSafety(ty: Type, zcu: *const Zcu) ?Type {
|
|
const ip = &zcu.intern_pool;
|
|
return switch (ip.indexToKey(ty.toIntern())) {
|
|
.union_type => {
|
|
const union_type = ip.loadUnionType(ty.toIntern());
|
|
if (!union_type.hasTag(ip)) return null;
|
|
assert(union_type.haveFieldTypes(ip));
|
|
return Type.fromInterned(union_type.enum_tag_ty);
|
|
},
|
|
else => null,
|
|
};
|
|
}
|
|
|
|
/// Asserts the type is a union; returns the tag type, even if the tag will
|
|
/// not be stored at runtime.
|
|
pub fn unionTagTypeHypothetical(ty: Type, zcu: *const Zcu) Type {
|
|
const union_obj = zcu.typeToUnion(ty).?;
|
|
return Type.fromInterned(union_obj.enum_tag_ty);
|
|
}
|
|
|
|
pub fn unionFieldType(ty: Type, enum_tag: Value, zcu: *const Zcu) ?Type {
|
|
const ip = &zcu.intern_pool;
|
|
const union_obj = zcu.typeToUnion(ty).?;
|
|
const union_fields = union_obj.field_types.get(ip);
|
|
const index = zcu.unionTagFieldIndex(union_obj, enum_tag) orelse return null;
|
|
return Type.fromInterned(union_fields[index]);
|
|
}
|
|
|
|
pub fn unionFieldTypeByIndex(ty: Type, index: usize, zcu: *const Zcu) Type {
|
|
const ip = &zcu.intern_pool;
|
|
const union_obj = zcu.typeToUnion(ty).?;
|
|
return Type.fromInterned(union_obj.field_types.get(ip)[index]);
|
|
}
|
|
|
|
pub fn unionTagFieldIndex(ty: Type, enum_tag: Value, zcu: *const Zcu) ?u32 {
|
|
const union_obj = zcu.typeToUnion(ty).?;
|
|
return zcu.unionTagFieldIndex(union_obj, enum_tag);
|
|
}
|
|
|
|
pub fn unionHasAllZeroBitFieldTypes(ty: Type, zcu: *Zcu) bool {
|
|
const ip = &zcu.intern_pool;
|
|
const union_obj = zcu.typeToUnion(ty).?;
|
|
for (union_obj.field_types.get(ip)) |field_ty| {
|
|
if (Type.fromInterned(field_ty).hasRuntimeBits(zcu)) return false;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
/// Returns the type used for backing storage of this union during comptime operations.
|
|
/// Asserts the type is either an extern or packed union.
|
|
pub fn unionBackingType(ty: Type, pt: Zcu.PerThread) !Type {
|
|
const zcu = pt.zcu;
|
|
return switch (ty.containerLayout(zcu)) {
|
|
.@"extern" => try pt.arrayType(.{ .len = ty.abiSize(zcu), .child = .u8_type }),
|
|
.@"packed" => try pt.intType(.unsigned, @intCast(ty.bitSize(zcu))),
|
|
.auto => unreachable,
|
|
};
|
|
}
|
|
|
|
pub fn unionGetLayout(ty: Type, zcu: *const Zcu) Zcu.UnionLayout {
|
|
const union_obj = zcu.intern_pool.loadUnionType(ty.toIntern());
|
|
return Type.getUnionLayout(union_obj, zcu);
|
|
}
|
|
|
|
pub fn containerLayout(ty: Type, zcu: *const Zcu) std.builtin.Type.ContainerLayout {
|
|
const ip = &zcu.intern_pool;
|
|
return switch (ip.indexToKey(ty.toIntern())) {
|
|
.struct_type => ip.loadStructType(ty.toIntern()).layout,
|
|
.tuple_type => .auto,
|
|
.union_type => ip.loadUnionType(ty.toIntern()).flagsUnordered(ip).layout,
|
|
else => unreachable,
|
|
};
|
|
}
|
|
|
|
/// Asserts that the type is an error union.
|
|
pub fn errorUnionPayload(ty: Type, zcu: *const Zcu) Type {
|
|
return Type.fromInterned(zcu.intern_pool.indexToKey(ty.toIntern()).error_union_type.payload_type);
|
|
}
|
|
|
|
/// Asserts that the type is an error union.
|
|
pub fn errorUnionSet(ty: Type, zcu: *const Zcu) Type {
|
|
return Type.fromInterned(zcu.intern_pool.errorUnionSet(ty.toIntern()));
|
|
}
|
|
|
|
/// Returns false for unresolved inferred error sets.
|
|
pub fn errorSetIsEmpty(ty: Type, zcu: *const Zcu) bool {
|
|
const ip = &zcu.intern_pool;
|
|
return switch (ty.toIntern()) {
|
|
.anyerror_type, .adhoc_inferred_error_set_type => false,
|
|
else => switch (ip.indexToKey(ty.toIntern())) {
|
|
.error_set_type => |error_set_type| error_set_type.names.len == 0,
|
|
.inferred_error_set_type => |i| switch (ip.funcIesResolvedUnordered(i)) {
|
|
.none, .anyerror_type => false,
|
|
else => |t| ip.indexToKey(t).error_set_type.names.len == 0,
|
|
},
|
|
else => unreachable,
|
|
},
|
|
};
|
|
}
|
|
|
|
/// Returns true if it is an error set that includes anyerror, false otherwise.
|
|
/// Note that the result may be a false negative if the type did not get error set
|
|
/// resolution prior to this call.
|
|
pub fn isAnyError(ty: Type, zcu: *const Zcu) bool {
|
|
const ip = &zcu.intern_pool;
|
|
return switch (ty.toIntern()) {
|
|
.anyerror_type => true,
|
|
.adhoc_inferred_error_set_type => false,
|
|
else => switch (zcu.intern_pool.indexToKey(ty.toIntern())) {
|
|
.inferred_error_set_type => |i| ip.funcIesResolvedUnordered(i) == .anyerror_type,
|
|
else => false,
|
|
},
|
|
};
|
|
}
|
|
|
|
pub fn isError(ty: Type, zcu: *const Zcu) bool {
|
|
return switch (ty.zigTypeTag(zcu)) {
|
|
.error_union, .error_set => true,
|
|
else => false,
|
|
};
|
|
}
|
|
|
|
/// Returns whether ty, which must be an error set, includes an error `name`.
|
|
/// Might return a false negative if `ty` is an inferred error set and not fully
|
|
/// resolved yet.
|
|
pub fn errorSetHasFieldIp(
|
|
ip: *const InternPool,
|
|
ty: InternPool.Index,
|
|
name: InternPool.NullTerminatedString,
|
|
) bool {
|
|
return switch (ty) {
|
|
.anyerror_type => true,
|
|
else => switch (ip.indexToKey(ty)) {
|
|
.error_set_type => |error_set_type| error_set_type.nameIndex(ip, name) != null,
|
|
.inferred_error_set_type => |i| switch (ip.funcIesResolvedUnordered(i)) {
|
|
.anyerror_type => true,
|
|
.none => false,
|
|
else => |t| ip.indexToKey(t).error_set_type.nameIndex(ip, name) != null,
|
|
},
|
|
else => unreachable,
|
|
},
|
|
};
|
|
}
|
|
|
|
/// Returns whether ty, which must be an error set, includes an error `name`.
|
|
/// Might return a false negative if `ty` is an inferred error set and not fully
|
|
/// resolved yet.
|
|
pub fn errorSetHasField(ty: Type, name: []const u8, zcu: *const Zcu) bool {
|
|
const ip = &zcu.intern_pool;
|
|
return switch (ty.toIntern()) {
|
|
.anyerror_type => true,
|
|
else => switch (ip.indexToKey(ty.toIntern())) {
|
|
.error_set_type => |error_set_type| {
|
|
// If the string is not interned, then the field certainly is not present.
|
|
const field_name_interned = ip.getString(name).unwrap() orelse return false;
|
|
return error_set_type.nameIndex(ip, field_name_interned) != null;
|
|
},
|
|
.inferred_error_set_type => |i| switch (ip.funcIesResolvedUnordered(i)) {
|
|
.anyerror_type => true,
|
|
.none => false,
|
|
else => |t| {
|
|
// If the string is not interned, then the field certainly is not present.
|
|
const field_name_interned = ip.getString(name).unwrap() orelse return false;
|
|
return ip.indexToKey(t).error_set_type.nameIndex(ip, field_name_interned) != null;
|
|
},
|
|
},
|
|
else => unreachable,
|
|
},
|
|
};
|
|
}
|
|
|
|
/// Asserts the type is an array or vector or struct.
|
|
pub fn arrayLen(ty: Type, zcu: *const Zcu) u64 {
|
|
return ty.arrayLenIp(&zcu.intern_pool);
|
|
}
|
|
|
|
pub fn arrayLenIp(ty: Type, ip: *const InternPool) u64 {
|
|
return ip.aggregateTypeLen(ty.toIntern());
|
|
}
|
|
|
|
pub fn arrayLenIncludingSentinel(ty: Type, zcu: *const Zcu) u64 {
|
|
return zcu.intern_pool.aggregateTypeLenIncludingSentinel(ty.toIntern());
|
|
}
|
|
|
|
pub fn vectorLen(ty: Type, zcu: *const Zcu) u32 {
|
|
return switch (zcu.intern_pool.indexToKey(ty.toIntern())) {
|
|
.vector_type => |vector_type| vector_type.len,
|
|
.tuple_type => |tuple| @intCast(tuple.types.len),
|
|
else => unreachable,
|
|
};
|
|
}
|
|
|
|
/// Asserts the type is an array, pointer or vector.
|
|
pub fn sentinel(ty: Type, zcu: *const Zcu) ?Value {
|
|
return switch (zcu.intern_pool.indexToKey(ty.toIntern())) {
|
|
.vector_type,
|
|
.struct_type,
|
|
.tuple_type,
|
|
=> null,
|
|
|
|
.array_type => |t| if (t.sentinel != .none) Value.fromInterned(t.sentinel) else null,
|
|
.ptr_type => |t| if (t.sentinel != .none) Value.fromInterned(t.sentinel) else null,
|
|
|
|
else => unreachable,
|
|
};
|
|
}
|
|
|
|
/// Returns true if and only if the type is a fixed-width integer.
|
|
pub fn isInt(self: Type, zcu: *const Zcu) bool {
|
|
return self.toIntern() != .comptime_int_type and
|
|
zcu.intern_pool.isIntegerType(self.toIntern());
|
|
}
|
|
|
|
/// Returns true if and only if the type is a fixed-width, signed integer.
|
|
pub fn isSignedInt(ty: Type, zcu: *const Zcu) bool {
|
|
return switch (ty.toIntern()) {
|
|
.c_char_type => zcu.getTarget().charSignedness() == .signed,
|
|
.isize_type, .c_short_type, .c_int_type, .c_long_type, .c_longlong_type => true,
|
|
else => switch (zcu.intern_pool.indexToKey(ty.toIntern())) {
|
|
.int_type => |int_type| int_type.signedness == .signed,
|
|
else => false,
|
|
},
|
|
};
|
|
}
|
|
|
|
/// Returns true if and only if the type is a fixed-width, unsigned integer.
|
|
pub fn isUnsignedInt(ty: Type, zcu: *const Zcu) bool {
|
|
return switch (ty.toIntern()) {
|
|
.c_char_type => zcu.getTarget().charSignedness() == .unsigned,
|
|
.usize_type, .c_ushort_type, .c_uint_type, .c_ulong_type, .c_ulonglong_type => true,
|
|
else => switch (zcu.intern_pool.indexToKey(ty.toIntern())) {
|
|
.int_type => |int_type| int_type.signedness == .unsigned,
|
|
else => false,
|
|
},
|
|
};
|
|
}
|
|
|
|
/// Returns true for integers, enums, error sets, and packed structs.
|
|
/// If this function returns true, then intInfo() can be called on the type.
|
|
pub fn isAbiInt(ty: Type, zcu: *const Zcu) bool {
|
|
return switch (ty.zigTypeTag(zcu)) {
|
|
.int, .@"enum", .error_set => true,
|
|
.@"struct" => ty.containerLayout(zcu) == .@"packed",
|
|
else => false,
|
|
};
|
|
}
|
|
|
|
/// Asserts the type is an integer, enum, error set, or vector of one of them.
|
|
pub fn intInfo(starting_ty: Type, zcu: *const Zcu) InternPool.Key.IntType {
|
|
const ip = &zcu.intern_pool;
|
|
const target = zcu.getTarget();
|
|
var ty = starting_ty;
|
|
|
|
while (true) switch (ty.toIntern()) {
|
|
.anyerror_type, .adhoc_inferred_error_set_type => {
|
|
return .{ .signedness = .unsigned, .bits = zcu.errorSetBits() };
|
|
},
|
|
.usize_type => return .{ .signedness = .unsigned, .bits = target.ptrBitWidth() },
|
|
.isize_type => return .{ .signedness = .signed, .bits = target.ptrBitWidth() },
|
|
.c_char_type => return .{ .signedness = zcu.getTarget().charSignedness(), .bits = target.cTypeBitSize(.char) },
|
|
.c_short_type => return .{ .signedness = .signed, .bits = target.cTypeBitSize(.short) },
|
|
.c_ushort_type => return .{ .signedness = .unsigned, .bits = target.cTypeBitSize(.ushort) },
|
|
.c_int_type => return .{ .signedness = .signed, .bits = target.cTypeBitSize(.int) },
|
|
.c_uint_type => return .{ .signedness = .unsigned, .bits = target.cTypeBitSize(.uint) },
|
|
.c_long_type => return .{ .signedness = .signed, .bits = target.cTypeBitSize(.long) },
|
|
.c_ulong_type => return .{ .signedness = .unsigned, .bits = target.cTypeBitSize(.ulong) },
|
|
.c_longlong_type => return .{ .signedness = .signed, .bits = target.cTypeBitSize(.longlong) },
|
|
.c_ulonglong_type => return .{ .signedness = .unsigned, .bits = target.cTypeBitSize(.ulonglong) },
|
|
else => switch (ip.indexToKey(ty.toIntern())) {
|
|
.int_type => |int_type| return int_type,
|
|
.struct_type => ty = Type.fromInterned(ip.loadStructType(ty.toIntern()).backingIntTypeUnordered(ip)),
|
|
.enum_type => ty = Type.fromInterned(ip.loadEnumType(ty.toIntern()).tag_ty),
|
|
.vector_type => |vector_type| ty = Type.fromInterned(vector_type.child),
|
|
|
|
.error_set_type, .inferred_error_set_type => {
|
|
return .{ .signedness = .unsigned, .bits = zcu.errorSetBits() };
|
|
},
|
|
|
|
.tuple_type => unreachable,
|
|
|
|
.ptr_type => unreachable,
|
|
.anyframe_type => unreachable,
|
|
.array_type => unreachable,
|
|
|
|
.opt_type => unreachable,
|
|
.error_union_type => unreachable,
|
|
.func_type => unreachable,
|
|
.simple_type => unreachable, // handled via Index enum tag above
|
|
|
|
.union_type => unreachable,
|
|
.opaque_type => unreachable,
|
|
|
|
// values, not types
|
|
.undef,
|
|
.simple_value,
|
|
.variable,
|
|
.@"extern",
|
|
.func,
|
|
.int,
|
|
.err,
|
|
.error_union,
|
|
.enum_literal,
|
|
.enum_tag,
|
|
.empty_enum_value,
|
|
.float,
|
|
.ptr,
|
|
.slice,
|
|
.opt,
|
|
.aggregate,
|
|
.un,
|
|
// memoization, not types
|
|
.memoized_call,
|
|
=> unreachable,
|
|
},
|
|
};
|
|
}
|
|
|
|
pub fn isNamedInt(ty: Type) bool {
|
|
return switch (ty.toIntern()) {
|
|
.usize_type,
|
|
.isize_type,
|
|
.c_char_type,
|
|
.c_short_type,
|
|
.c_ushort_type,
|
|
.c_int_type,
|
|
.c_uint_type,
|
|
.c_long_type,
|
|
.c_ulong_type,
|
|
.c_longlong_type,
|
|
.c_ulonglong_type,
|
|
=> true,
|
|
|
|
else => false,
|
|
};
|
|
}
|
|
|
|
/// Returns `false` for `comptime_float`.
|
|
pub fn isRuntimeFloat(ty: Type) bool {
|
|
return switch (ty.toIntern()) {
|
|
.f16_type,
|
|
.f32_type,
|
|
.f64_type,
|
|
.f80_type,
|
|
.f128_type,
|
|
.c_longdouble_type,
|
|
=> true,
|
|
|
|
else => false,
|
|
};
|
|
}
|
|
|
|
/// Returns `true` for `comptime_float`.
|
|
pub fn isAnyFloat(ty: Type) bool {
|
|
return switch (ty.toIntern()) {
|
|
.f16_type,
|
|
.f32_type,
|
|
.f64_type,
|
|
.f80_type,
|
|
.f128_type,
|
|
.c_longdouble_type,
|
|
.comptime_float_type,
|
|
=> true,
|
|
|
|
else => false,
|
|
};
|
|
}
|
|
|
|
/// Asserts the type is a fixed-size float or comptime_float.
|
|
/// Returns 128 for comptime_float types.
|
|
pub fn floatBits(ty: Type, target: Target) u16 {
|
|
return switch (ty.toIntern()) {
|
|
.f16_type => 16,
|
|
.f32_type => 32,
|
|
.f64_type => 64,
|
|
.f80_type => 80,
|
|
.f128_type, .comptime_float_type => 128,
|
|
.c_longdouble_type => target.cTypeBitSize(.longdouble),
|
|
|
|
else => unreachable,
|
|
};
|
|
}
|
|
|
|
/// Asserts the type is a function or a function pointer.
|
|
pub fn fnReturnType(ty: Type, zcu: *const Zcu) Type {
|
|
return Type.fromInterned(zcu.intern_pool.funcTypeReturnType(ty.toIntern()));
|
|
}
|
|
|
|
/// Asserts the type is a function.
|
|
pub fn fnCallingConvention(ty: Type, zcu: *const Zcu) std.builtin.CallingConvention {
|
|
return zcu.intern_pool.indexToKey(ty.toIntern()).func_type.cc;
|
|
}
|
|
|
|
pub fn isValidParamType(self: Type, zcu: *const Zcu) bool {
|
|
if (self.toIntern() == .generic_poison_type) return true;
|
|
return switch (self.zigTypeTag(zcu)) {
|
|
.@"opaque", .noreturn => false,
|
|
else => true,
|
|
};
|
|
}
|
|
|
|
pub fn isValidReturnType(self: Type, zcu: *const Zcu) bool {
|
|
if (self.toIntern() == .generic_poison_type) return true;
|
|
return switch (self.zigTypeTag(zcu)) {
|
|
.@"opaque" => false,
|
|
else => true,
|
|
};
|
|
}
|
|
|
|
/// Asserts the type is a function.
|
|
pub fn fnIsVarArgs(ty: Type, zcu: *const Zcu) bool {
|
|
return zcu.intern_pool.indexToKey(ty.toIntern()).func_type.is_var_args;
|
|
}
|
|
|
|
pub fn fnPtrMaskOrNull(ty: Type, zcu: *const Zcu) ?u64 {
|
|
return switch (ty.zigTypeTag(zcu)) {
|
|
.@"fn" => target_util.functionPointerMask(zcu.getTarget()),
|
|
else => null,
|
|
};
|
|
}
|
|
|
|
pub fn isNumeric(ty: Type, zcu: *const Zcu) bool {
|
|
return switch (ty.toIntern()) {
|
|
.f16_type,
|
|
.f32_type,
|
|
.f64_type,
|
|
.f80_type,
|
|
.f128_type,
|
|
.c_longdouble_type,
|
|
.comptime_int_type,
|
|
.comptime_float_type,
|
|
.usize_type,
|
|
.isize_type,
|
|
.c_char_type,
|
|
.c_short_type,
|
|
.c_ushort_type,
|
|
.c_int_type,
|
|
.c_uint_type,
|
|
.c_long_type,
|
|
.c_ulong_type,
|
|
.c_longlong_type,
|
|
.c_ulonglong_type,
|
|
=> true,
|
|
|
|
else => switch (zcu.intern_pool.indexToKey(ty.toIntern())) {
|
|
.int_type => true,
|
|
else => false,
|
|
},
|
|
};
|
|
}
|
|
|
|
/// During semantic analysis, instead call `Sema.typeHasOnePossibleValue` which
|
|
/// resolves field types rather than asserting they are already resolved.
|
|
pub fn onePossibleValue(starting_type: Type, pt: Zcu.PerThread) !?Value {
|
|
const zcu = pt.zcu;
|
|
var ty = starting_type;
|
|
const ip = &zcu.intern_pool;
|
|
while (true) switch (ty.toIntern()) {
|
|
.empty_tuple_type => return Value.empty_tuple,
|
|
|
|
else => switch (ip.indexToKey(ty.toIntern())) {
|
|
.int_type => |int_type| {
|
|
if (int_type.bits == 0) {
|
|
return try pt.intValue(ty, 0);
|
|
} else {
|
|
return null;
|
|
}
|
|
},
|
|
|
|
.ptr_type,
|
|
.error_union_type,
|
|
.func_type,
|
|
.anyframe_type,
|
|
.error_set_type,
|
|
.inferred_error_set_type,
|
|
=> return null,
|
|
|
|
inline .array_type, .vector_type => |seq_type, seq_tag| {
|
|
const has_sentinel = seq_tag == .array_type and seq_type.sentinel != .none;
|
|
if (seq_type.len + @intFromBool(has_sentinel) == 0) return Value.fromInterned(try pt.intern(.{ .aggregate = .{
|
|
.ty = ty.toIntern(),
|
|
.storage = .{ .elems = &.{} },
|
|
} }));
|
|
if (try Type.fromInterned(seq_type.child).onePossibleValue(pt)) |opv| {
|
|
return Value.fromInterned(try pt.intern(.{ .aggregate = .{
|
|
.ty = ty.toIntern(),
|
|
.storage = .{ .repeated_elem = opv.toIntern() },
|
|
} }));
|
|
}
|
|
return null;
|
|
},
|
|
.opt_type => |child| {
|
|
if (child == .noreturn_type) {
|
|
return try pt.nullValue(ty);
|
|
} else {
|
|
return null;
|
|
}
|
|
},
|
|
|
|
.simple_type => |t| switch (t) {
|
|
.f16,
|
|
.f32,
|
|
.f64,
|
|
.f80,
|
|
.f128,
|
|
.usize,
|
|
.isize,
|
|
.c_char,
|
|
.c_short,
|
|
.c_ushort,
|
|
.c_int,
|
|
.c_uint,
|
|
.c_long,
|
|
.c_ulong,
|
|
.c_longlong,
|
|
.c_ulonglong,
|
|
.c_longdouble,
|
|
.anyopaque,
|
|
.bool,
|
|
.type,
|
|
.anyerror,
|
|
.comptime_int,
|
|
.comptime_float,
|
|
.enum_literal,
|
|
.adhoc_inferred_error_set,
|
|
=> return null,
|
|
|
|
.void => return Value.void,
|
|
.noreturn => return Value.@"unreachable",
|
|
.null => return Value.null,
|
|
.undefined => return Value.undef,
|
|
|
|
.generic_poison => unreachable,
|
|
},
|
|
.struct_type => {
|
|
const struct_type = ip.loadStructType(ty.toIntern());
|
|
assert(struct_type.haveFieldTypes(ip));
|
|
if (struct_type.knownNonOpv(ip))
|
|
return null;
|
|
const field_vals = try zcu.gpa.alloc(InternPool.Index, struct_type.field_types.len);
|
|
defer zcu.gpa.free(field_vals);
|
|
for (field_vals, 0..) |*field_val, i_usize| {
|
|
const i: u32 = @intCast(i_usize);
|
|
if (struct_type.fieldIsComptime(ip, i)) {
|
|
assert(struct_type.haveFieldInits(ip));
|
|
field_val.* = struct_type.field_inits.get(ip)[i];
|
|
continue;
|
|
}
|
|
const field_ty = Type.fromInterned(struct_type.field_types.get(ip)[i]);
|
|
if (try field_ty.onePossibleValue(pt)) |field_opv| {
|
|
field_val.* = field_opv.toIntern();
|
|
} else return null;
|
|
}
|
|
|
|
// In this case the struct has no runtime-known fields and
|
|
// therefore has one possible value.
|
|
return Value.fromInterned(try pt.intern(.{ .aggregate = .{
|
|
.ty = ty.toIntern(),
|
|
.storage = .{ .elems = field_vals },
|
|
} }));
|
|
},
|
|
|
|
.tuple_type => |tuple| {
|
|
for (tuple.values.get(ip)) |val| {
|
|
if (val == .none) return null;
|
|
}
|
|
// In this case the struct has all comptime-known fields and
|
|
// therefore has one possible value.
|
|
// TODO: write something like getCoercedInts to avoid needing to dupe
|
|
const duped_values = try zcu.gpa.dupe(InternPool.Index, tuple.values.get(ip));
|
|
defer zcu.gpa.free(duped_values);
|
|
return Value.fromInterned(try pt.intern(.{ .aggregate = .{
|
|
.ty = ty.toIntern(),
|
|
.storage = .{ .elems = duped_values },
|
|
} }));
|
|
},
|
|
|
|
.union_type => {
|
|
const union_obj = ip.loadUnionType(ty.toIntern());
|
|
const tag_val = (try Type.fromInterned(union_obj.enum_tag_ty).onePossibleValue(pt)) orelse
|
|
return null;
|
|
if (union_obj.field_types.len == 0) {
|
|
const only = try pt.intern(.{ .empty_enum_value = ty.toIntern() });
|
|
return Value.fromInterned(only);
|
|
}
|
|
const only_field_ty = union_obj.field_types.get(ip)[0];
|
|
const val_val = (try Type.fromInterned(only_field_ty).onePossibleValue(pt)) orelse
|
|
return null;
|
|
const only = try pt.internUnion(.{
|
|
.ty = ty.toIntern(),
|
|
.tag = tag_val.toIntern(),
|
|
.val = val_val.toIntern(),
|
|
});
|
|
return Value.fromInterned(only);
|
|
},
|
|
.opaque_type => return null,
|
|
.enum_type => {
|
|
const enum_type = ip.loadEnumType(ty.toIntern());
|
|
switch (enum_type.tag_mode) {
|
|
.nonexhaustive => {
|
|
if (enum_type.tag_ty == .comptime_int_type) return null;
|
|
|
|
if (try Type.fromInterned(enum_type.tag_ty).onePossibleValue(pt)) |int_opv| {
|
|
const only = try pt.intern(.{ .enum_tag = .{
|
|
.ty = ty.toIntern(),
|
|
.int = int_opv.toIntern(),
|
|
} });
|
|
return Value.fromInterned(only);
|
|
}
|
|
|
|
return null;
|
|
},
|
|
.auto, .explicit => {
|
|
if (Type.fromInterned(enum_type.tag_ty).hasRuntimeBits(zcu)) return null;
|
|
|
|
switch (enum_type.names.len) {
|
|
0 => {
|
|
const only = try pt.intern(.{ .empty_enum_value = ty.toIntern() });
|
|
return Value.fromInterned(only);
|
|
},
|
|
1 => {
|
|
if (enum_type.values.len == 0) {
|
|
const only = try pt.intern(.{ .enum_tag = .{
|
|
.ty = ty.toIntern(),
|
|
.int = try pt.intern(.{ .int = .{
|
|
.ty = enum_type.tag_ty,
|
|
.storage = .{ .u64 = 0 },
|
|
} }),
|
|
} });
|
|
return Value.fromInterned(only);
|
|
} else {
|
|
return Value.fromInterned(enum_type.values.get(ip)[0]);
|
|
}
|
|
},
|
|
else => return null,
|
|
}
|
|
},
|
|
}
|
|
},
|
|
|
|
// values, not types
|
|
.undef,
|
|
.simple_value,
|
|
.variable,
|
|
.@"extern",
|
|
.func,
|
|
.int,
|
|
.err,
|
|
.error_union,
|
|
.enum_literal,
|
|
.enum_tag,
|
|
.empty_enum_value,
|
|
.float,
|
|
.ptr,
|
|
.slice,
|
|
.opt,
|
|
.aggregate,
|
|
.un,
|
|
// memoization, not types
|
|
.memoized_call,
|
|
=> unreachable,
|
|
},
|
|
};
|
|
}
|
|
|
|
/// During semantic analysis, instead call `ty.comptimeOnlySema` which
|
|
/// resolves field types rather than asserting they are already resolved.
|
|
pub fn comptimeOnly(ty: Type, zcu: *const Zcu) bool {
|
|
return ty.comptimeOnlyInner(.normal, zcu, {}) catch unreachable;
|
|
}
|
|
|
|
pub fn comptimeOnlySema(ty: Type, pt: Zcu.PerThread) SemaError!bool {
|
|
return try ty.comptimeOnlyInner(.sema, pt.zcu, pt.tid);
|
|
}
|
|
|
|
/// `generic_poison` will return false.
|
|
/// May return false negatives when structs and unions are having their field types resolved.
|
|
pub fn comptimeOnlyInner(
|
|
ty: Type,
|
|
comptime strat: ResolveStrat,
|
|
zcu: strat.ZcuPtr(),
|
|
tid: strat.Tid(),
|
|
) SemaError!bool {
|
|
const ip = &zcu.intern_pool;
|
|
return switch (ty.toIntern()) {
|
|
.empty_tuple_type => false,
|
|
|
|
else => switch (ip.indexToKey(ty.toIntern())) {
|
|
.int_type => false,
|
|
.ptr_type => |ptr_type| {
|
|
const child_ty = Type.fromInterned(ptr_type.child);
|
|
switch (child_ty.zigTypeTag(zcu)) {
|
|
.@"fn" => return !try child_ty.fnHasRuntimeBitsInner(strat, zcu, tid),
|
|
.@"opaque" => return false,
|
|
else => return child_ty.comptimeOnlyInner(strat, zcu, tid),
|
|
}
|
|
},
|
|
.anyframe_type => |child| {
|
|
if (child == .none) return false;
|
|
return Type.fromInterned(child).comptimeOnlyInner(strat, zcu, tid);
|
|
},
|
|
.array_type => |array_type| return Type.fromInterned(array_type.child).comptimeOnlyInner(strat, zcu, tid),
|
|
.vector_type => |vector_type| return Type.fromInterned(vector_type.child).comptimeOnlyInner(strat, zcu, tid),
|
|
.opt_type => |child| return Type.fromInterned(child).comptimeOnlyInner(strat, zcu, tid),
|
|
.error_union_type => |error_union_type| return Type.fromInterned(error_union_type.payload_type).comptimeOnlyInner(strat, zcu, tid),
|
|
|
|
.error_set_type,
|
|
.inferred_error_set_type,
|
|
=> false,
|
|
|
|
// These are function bodies, not function pointers.
|
|
.func_type => true,
|
|
|
|
.simple_type => |t| switch (t) {
|
|
.f16,
|
|
.f32,
|
|
.f64,
|
|
.f80,
|
|
.f128,
|
|
.usize,
|
|
.isize,
|
|
.c_char,
|
|
.c_short,
|
|
.c_ushort,
|
|
.c_int,
|
|
.c_uint,
|
|
.c_long,
|
|
.c_ulong,
|
|
.c_longlong,
|
|
.c_ulonglong,
|
|
.c_longdouble,
|
|
.anyopaque,
|
|
.bool,
|
|
.void,
|
|
.anyerror,
|
|
.adhoc_inferred_error_set,
|
|
.noreturn,
|
|
.generic_poison,
|
|
=> false,
|
|
|
|
.type,
|
|
.comptime_int,
|
|
.comptime_float,
|
|
.null,
|
|
.undefined,
|
|
.enum_literal,
|
|
=> true,
|
|
},
|
|
.struct_type => {
|
|
const struct_type = ip.loadStructType(ty.toIntern());
|
|
// packed structs cannot be comptime-only because they have a well-defined
|
|
// memory layout and every field has a well-defined bit pattern.
|
|
if (struct_type.layout == .@"packed")
|
|
return false;
|
|
|
|
return switch (strat) {
|
|
.normal => switch (struct_type.requiresComptime(ip)) {
|
|
.wip => unreachable,
|
|
.no => false,
|
|
.yes => true,
|
|
.unknown => unreachable,
|
|
},
|
|
.sema => switch (struct_type.setRequiresComptimeWip(ip)) {
|
|
.no, .wip => false,
|
|
.yes => true,
|
|
.unknown => {
|
|
if (struct_type.flagsUnordered(ip).field_types_wip) {
|
|
struct_type.setRequiresComptime(ip, .unknown);
|
|
return false;
|
|
}
|
|
|
|
errdefer struct_type.setRequiresComptime(ip, .unknown);
|
|
|
|
const pt = strat.pt(zcu, tid);
|
|
try ty.resolveFields(pt);
|
|
|
|
for (0..struct_type.field_types.len) |i_usize| {
|
|
const i: u32 = @intCast(i_usize);
|
|
if (struct_type.fieldIsComptime(ip, i)) continue;
|
|
const field_ty = struct_type.field_types.get(ip)[i];
|
|
if (try Type.fromInterned(field_ty).comptimeOnlyInner(strat, zcu, tid)) {
|
|
// Note that this does not cause the layout to
|
|
// be considered resolved. Comptime-only types
|
|
// still maintain a layout of their
|
|
// runtime-known fields.
|
|
struct_type.setRequiresComptime(ip, .yes);
|
|
return true;
|
|
}
|
|
}
|
|
|
|
struct_type.setRequiresComptime(ip, .no);
|
|
return false;
|
|
},
|
|
},
|
|
};
|
|
},
|
|
|
|
.tuple_type => |tuple| {
|
|
for (tuple.types.get(ip), tuple.values.get(ip)) |field_ty, val| {
|
|
const have_comptime_val = val != .none;
|
|
if (!have_comptime_val and try Type.fromInterned(field_ty).comptimeOnlyInner(strat, zcu, tid)) return true;
|
|
}
|
|
return false;
|
|
},
|
|
|
|
.union_type => {
|
|
const union_type = ip.loadUnionType(ty.toIntern());
|
|
return switch (strat) {
|
|
.normal => switch (union_type.requiresComptime(ip)) {
|
|
.wip => unreachable,
|
|
.no => false,
|
|
.yes => true,
|
|
.unknown => unreachable,
|
|
},
|
|
.sema => switch (union_type.setRequiresComptimeWip(ip)) {
|
|
.no, .wip => return false,
|
|
.yes => return true,
|
|
.unknown => {
|
|
if (union_type.flagsUnordered(ip).status == .field_types_wip) {
|
|
union_type.setRequiresComptime(ip, .unknown);
|
|
return false;
|
|
}
|
|
|
|
errdefer union_type.setRequiresComptime(ip, .unknown);
|
|
|
|
const pt = strat.pt(zcu, tid);
|
|
try ty.resolveFields(pt);
|
|
|
|
for (0..union_type.field_types.len) |field_idx| {
|
|
const field_ty = union_type.field_types.get(ip)[field_idx];
|
|
if (try Type.fromInterned(field_ty).comptimeOnlyInner(strat, zcu, tid)) {
|
|
union_type.setRequiresComptime(ip, .yes);
|
|
return true;
|
|
}
|
|
}
|
|
|
|
union_type.setRequiresComptime(ip, .no);
|
|
return false;
|
|
},
|
|
},
|
|
};
|
|
},
|
|
|
|
.opaque_type => false,
|
|
|
|
.enum_type => return Type.fromInterned(ip.loadEnumType(ty.toIntern()).tag_ty).comptimeOnlyInner(strat, zcu, tid),
|
|
|
|
// values, not types
|
|
.undef,
|
|
.simple_value,
|
|
.variable,
|
|
.@"extern",
|
|
.func,
|
|
.int,
|
|
.err,
|
|
.error_union,
|
|
.enum_literal,
|
|
.enum_tag,
|
|
.empty_enum_value,
|
|
.float,
|
|
.ptr,
|
|
.slice,
|
|
.opt,
|
|
.aggregate,
|
|
.un,
|
|
// memoization, not types
|
|
.memoized_call,
|
|
=> unreachable,
|
|
},
|
|
};
|
|
}
|
|
|
|
pub fn isVector(ty: Type, zcu: *const Zcu) bool {
|
|
return ty.zigTypeTag(zcu) == .vector;
|
|
}
|
|
|
|
/// Returns 0 if not a vector, otherwise returns @bitSizeOf(Element) * vector_len.
|
|
pub fn totalVectorBits(ty: Type, zcu: *Zcu) u64 {
|
|
if (!ty.isVector(zcu)) return 0;
|
|
const v = zcu.intern_pool.indexToKey(ty.toIntern()).vector_type;
|
|
return v.len * Type.fromInterned(v.child).bitSize(zcu);
|
|
}
|
|
|
|
pub fn isArrayOrVector(ty: Type, zcu: *const Zcu) bool {
|
|
return switch (ty.zigTypeTag(zcu)) {
|
|
.array, .vector => true,
|
|
else => false,
|
|
};
|
|
}
|
|
|
|
pub fn isIndexable(ty: Type, zcu: *const Zcu) bool {
|
|
return switch (ty.zigTypeTag(zcu)) {
|
|
.array, .vector => true,
|
|
.pointer => switch (ty.ptrSize(zcu)) {
|
|
.slice, .many, .c => true,
|
|
.one => switch (ty.childType(zcu).zigTypeTag(zcu)) {
|
|
.array, .vector => true,
|
|
.@"struct" => ty.childType(zcu).isTuple(zcu),
|
|
else => false,
|
|
},
|
|
},
|
|
.@"struct" => ty.isTuple(zcu),
|
|
else => false,
|
|
};
|
|
}
|
|
|
|
pub fn indexableHasLen(ty: Type, zcu: *const Zcu) bool {
|
|
return switch (ty.zigTypeTag(zcu)) {
|
|
.array, .vector => true,
|
|
.pointer => switch (ty.ptrSize(zcu)) {
|
|
.many, .c => false,
|
|
.slice => true,
|
|
.one => switch (ty.childType(zcu).zigTypeTag(zcu)) {
|
|
.array, .vector => true,
|
|
.@"struct" => ty.childType(zcu).isTuple(zcu),
|
|
else => false,
|
|
},
|
|
},
|
|
.@"struct" => ty.isTuple(zcu),
|
|
else => false,
|
|
};
|
|
}
|
|
|
|
/// Asserts that the type can have a namespace.
|
|
pub fn getNamespaceIndex(ty: Type, zcu: *Zcu) InternPool.NamespaceIndex {
|
|
return ty.getNamespace(zcu).unwrap().?;
|
|
}
|
|
|
|
/// Returns null if the type has no namespace.
|
|
pub fn getNamespace(ty: Type, zcu: *Zcu) InternPool.OptionalNamespaceIndex {
|
|
const ip = &zcu.intern_pool;
|
|
return switch (ip.indexToKey(ty.toIntern())) {
|
|
.opaque_type => ip.loadOpaqueType(ty.toIntern()).namespace.toOptional(),
|
|
.struct_type => ip.loadStructType(ty.toIntern()).namespace.toOptional(),
|
|
.union_type => ip.loadUnionType(ty.toIntern()).namespace.toOptional(),
|
|
.enum_type => ip.loadEnumType(ty.toIntern()).namespace.toOptional(),
|
|
else => .none,
|
|
};
|
|
}
|
|
|
|
// TODO: new dwarf structure will also need the enclosing code block for types created in imperative scopes
|
|
pub fn getParentNamespace(ty: Type, zcu: *Zcu) InternPool.OptionalNamespaceIndex {
|
|
return zcu.namespacePtr(ty.getNamespace(zcu).unwrap() orelse return .none).parent;
|
|
}
|
|
|
|
// Works for vectors and vectors of integers.
|
|
pub fn minInt(ty: Type, pt: Zcu.PerThread, dest_ty: Type) !Value {
|
|
const zcu = pt.zcu;
|
|
const scalar = try minIntScalar(ty.scalarType(zcu), pt, dest_ty.scalarType(zcu));
|
|
return if (ty.zigTypeTag(zcu) == .vector) Value.fromInterned(try pt.intern(.{ .aggregate = .{
|
|
.ty = dest_ty.toIntern(),
|
|
.storage = .{ .repeated_elem = scalar.toIntern() },
|
|
} })) else scalar;
|
|
}
|
|
|
|
/// Asserts that the type is an integer.
|
|
pub fn minIntScalar(ty: Type, pt: Zcu.PerThread, dest_ty: Type) !Value {
|
|
const zcu = pt.zcu;
|
|
const info = ty.intInfo(zcu);
|
|
if (info.signedness == .unsigned or info.bits == 0) return pt.intValue(dest_ty, 0);
|
|
|
|
if (std.math.cast(u6, info.bits - 1)) |shift| {
|
|
const n = @as(i64, std.math.minInt(i64)) >> (63 - shift);
|
|
return pt.intValue(dest_ty, n);
|
|
}
|
|
|
|
var res = try std.math.big.int.Managed.init(zcu.gpa);
|
|
defer res.deinit();
|
|
|
|
try res.setTwosCompIntLimit(.min, info.signedness, info.bits);
|
|
|
|
return pt.intValue_big(dest_ty, res.toConst());
|
|
}
|
|
|
|
// Works for vectors and vectors of integers.
|
|
/// The returned Value will have type dest_ty.
|
|
pub fn maxInt(ty: Type, pt: Zcu.PerThread, dest_ty: Type) !Value {
|
|
const zcu = pt.zcu;
|
|
const scalar = try maxIntScalar(ty.scalarType(zcu), pt, dest_ty.scalarType(zcu));
|
|
return if (ty.zigTypeTag(zcu) == .vector) Value.fromInterned(try pt.intern(.{ .aggregate = .{
|
|
.ty = dest_ty.toIntern(),
|
|
.storage = .{ .repeated_elem = scalar.toIntern() },
|
|
} })) else scalar;
|
|
}
|
|
|
|
/// The returned Value will have type dest_ty.
|
|
pub fn maxIntScalar(ty: Type, pt: Zcu.PerThread, dest_ty: Type) !Value {
|
|
const info = ty.intInfo(pt.zcu);
|
|
|
|
switch (info.bits) {
|
|
0 => return pt.intValue(dest_ty, 0),
|
|
1 => return switch (info.signedness) {
|
|
.signed => try pt.intValue(dest_ty, 0),
|
|
.unsigned => try pt.intValue(dest_ty, 1),
|
|
},
|
|
else => {},
|
|
}
|
|
|
|
if (std.math.cast(u6, info.bits - 1)) |shift| switch (info.signedness) {
|
|
.signed => {
|
|
const n = @as(i64, std.math.maxInt(i64)) >> (63 - shift);
|
|
return pt.intValue(dest_ty, n);
|
|
},
|
|
.unsigned => {
|
|
const n = @as(u64, std.math.maxInt(u64)) >> (63 - shift);
|
|
return pt.intValue(dest_ty, n);
|
|
},
|
|
};
|
|
|
|
var res = try std.math.big.int.Managed.init(pt.zcu.gpa);
|
|
defer res.deinit();
|
|
|
|
try res.setTwosCompIntLimit(.max, info.signedness, info.bits);
|
|
|
|
return pt.intValue_big(dest_ty, res.toConst());
|
|
}
|
|
|
|
/// Asserts the type is an enum or a union.
|
|
pub fn intTagType(ty: Type, zcu: *const Zcu) Type {
|
|
const ip = &zcu.intern_pool;
|
|
return switch (ip.indexToKey(ty.toIntern())) {
|
|
.union_type => Type.fromInterned(ip.loadUnionType(ty.toIntern()).enum_tag_ty).intTagType(zcu),
|
|
.enum_type => Type.fromInterned(ip.loadEnumType(ty.toIntern()).tag_ty),
|
|
else => unreachable,
|
|
};
|
|
}
|
|
|
|
pub fn isNonexhaustiveEnum(ty: Type, zcu: *const Zcu) bool {
|
|
const ip = &zcu.intern_pool;
|
|
return switch (ip.indexToKey(ty.toIntern())) {
|
|
.enum_type => switch (ip.loadEnumType(ty.toIntern()).tag_mode) {
|
|
.nonexhaustive => true,
|
|
.auto, .explicit => false,
|
|
},
|
|
else => false,
|
|
};
|
|
}
|
|
|
|
// Asserts that `ty` is an error set and not `anyerror`.
|
|
// Asserts that `ty` is resolved if it is an inferred error set.
|
|
pub fn errorSetNames(ty: Type, zcu: *const Zcu) InternPool.NullTerminatedString.Slice {
|
|
const ip = &zcu.intern_pool;
|
|
return switch (ip.indexToKey(ty.toIntern())) {
|
|
.error_set_type => |x| x.names,
|
|
.inferred_error_set_type => |i| switch (ip.funcIesResolvedUnordered(i)) {
|
|
.none => unreachable, // unresolved inferred error set
|
|
.anyerror_type => unreachable,
|
|
else => |t| ip.indexToKey(t).error_set_type.names,
|
|
},
|
|
else => unreachable,
|
|
};
|
|
}
|
|
|
|
pub fn enumFields(ty: Type, zcu: *const Zcu) InternPool.NullTerminatedString.Slice {
|
|
return zcu.intern_pool.loadEnumType(ty.toIntern()).names;
|
|
}
|
|
|
|
pub fn enumFieldCount(ty: Type, zcu: *const Zcu) usize {
|
|
return zcu.intern_pool.loadEnumType(ty.toIntern()).names.len;
|
|
}
|
|
|
|
pub fn enumFieldName(ty: Type, field_index: usize, zcu: *const Zcu) InternPool.NullTerminatedString {
|
|
const ip = &zcu.intern_pool;
|
|
return ip.loadEnumType(ty.toIntern()).names.get(ip)[field_index];
|
|
}
|
|
|
|
pub fn enumFieldIndex(ty: Type, field_name: InternPool.NullTerminatedString, zcu: *const Zcu) ?u32 {
|
|
const ip = &zcu.intern_pool;
|
|
const enum_type = ip.loadEnumType(ty.toIntern());
|
|
return enum_type.nameIndex(ip, field_name);
|
|
}
|
|
|
|
/// Asserts `ty` is an enum. `enum_tag` can either be `enum_field_index` or
|
|
/// an integer which represents the enum value. Returns the field index in
|
|
/// declaration order, or `null` if `enum_tag` does not match any field.
|
|
pub fn enumTagFieldIndex(ty: Type, enum_tag: Value, zcu: *const Zcu) ?u32 {
|
|
const ip = &zcu.intern_pool;
|
|
const enum_type = ip.loadEnumType(ty.toIntern());
|
|
const int_tag = switch (ip.indexToKey(enum_tag.toIntern())) {
|
|
.int => enum_tag.toIntern(),
|
|
.enum_tag => |info| info.int,
|
|
else => unreachable,
|
|
};
|
|
assert(ip.typeOf(int_tag) == enum_type.tag_ty);
|
|
return enum_type.tagValueIndex(ip, int_tag);
|
|
}
|
|
|
|
/// Returns none in the case of a tuple which uses the integer index as the field name.
|
|
pub fn structFieldName(ty: Type, index: usize, zcu: *const Zcu) InternPool.OptionalNullTerminatedString {
|
|
const ip = &zcu.intern_pool;
|
|
return switch (ip.indexToKey(ty.toIntern())) {
|
|
.struct_type => ip.loadStructType(ty.toIntern()).fieldName(ip, index),
|
|
.tuple_type => .none,
|
|
else => unreachable,
|
|
};
|
|
}
|
|
|
|
pub fn structFieldCount(ty: Type, zcu: *const Zcu) u32 {
|
|
const ip = &zcu.intern_pool;
|
|
return switch (ip.indexToKey(ty.toIntern())) {
|
|
.struct_type => ip.loadStructType(ty.toIntern()).field_types.len,
|
|
.tuple_type => |tuple| tuple.types.len,
|
|
else => unreachable,
|
|
};
|
|
}
|
|
|
|
/// Returns the field type. Supports structs and unions.
|
|
pub fn fieldType(ty: Type, index: usize, zcu: *const Zcu) Type {
|
|
const ip = &zcu.intern_pool;
|
|
return switch (ip.indexToKey(ty.toIntern())) {
|
|
.struct_type => Type.fromInterned(ip.loadStructType(ty.toIntern()).field_types.get(ip)[index]),
|
|
.union_type => {
|
|
const union_obj = ip.loadUnionType(ty.toIntern());
|
|
return Type.fromInterned(union_obj.field_types.get(ip)[index]);
|
|
},
|
|
.tuple_type => |tuple| Type.fromInterned(tuple.types.get(ip)[index]),
|
|
else => unreachable,
|
|
};
|
|
}
|
|
|
|
pub fn fieldAlignment(ty: Type, index: usize, zcu: *Zcu) Alignment {
|
|
return ty.fieldAlignmentInner(index, .normal, zcu, {}) catch unreachable;
|
|
}
|
|
|
|
pub fn fieldAlignmentSema(ty: Type, index: usize, pt: Zcu.PerThread) SemaError!Alignment {
|
|
return try ty.fieldAlignmentInner(index, .sema, pt.zcu, pt.tid);
|
|
}
|
|
|
|
/// Returns the field alignment. Supports structs and unions.
|
|
/// If `strat` is `.sema`, may perform type resolution.
|
|
/// Asserts the layout is not packed.
|
|
///
|
|
/// Provide the struct field as the `ty`.
|
|
pub fn fieldAlignmentInner(
|
|
ty: Type,
|
|
index: usize,
|
|
comptime strat: ResolveStrat,
|
|
zcu: strat.ZcuPtr(),
|
|
tid: strat.Tid(),
|
|
) SemaError!Alignment {
|
|
const ip = &zcu.intern_pool;
|
|
switch (ip.indexToKey(ty.toIntern())) {
|
|
.struct_type => {
|
|
const struct_type = ip.loadStructType(ty.toIntern());
|
|
assert(struct_type.layout != .@"packed");
|
|
const explicit_align = struct_type.fieldAlign(ip, index);
|
|
const field_ty = Type.fromInterned(struct_type.field_types.get(ip)[index]);
|
|
return field_ty.structFieldAlignmentInner(explicit_align, struct_type.layout, strat, zcu, tid);
|
|
},
|
|
.tuple_type => |tuple| {
|
|
return (try Type.fromInterned(tuple.types.get(ip)[index]).abiAlignmentInner(
|
|
strat.toLazy(),
|
|
zcu,
|
|
tid,
|
|
)).scalar;
|
|
},
|
|
.union_type => {
|
|
const union_obj = ip.loadUnionType(ty.toIntern());
|
|
const layout = union_obj.flagsUnordered(ip).layout;
|
|
assert(layout != .@"packed");
|
|
const explicit_align = union_obj.fieldAlign(ip, index);
|
|
const field_ty = Type.fromInterned(union_obj.field_types.get(ip)[index]);
|
|
return field_ty.unionFieldAlignmentInner(explicit_align, layout, strat, zcu, tid);
|
|
},
|
|
else => unreachable,
|
|
}
|
|
}
|
|
|
|
/// Returns the alignment of a non-packed struct field. Assert the layout is not packed.
|
|
///
|
|
/// Asserts that all resolution needed was done.
|
|
pub fn structFieldAlignment(
|
|
field_ty: Type,
|
|
explicit_alignment: InternPool.Alignment,
|
|
layout: std.builtin.Type.ContainerLayout,
|
|
zcu: *Zcu,
|
|
) Alignment {
|
|
return field_ty.structFieldAlignmentInner(
|
|
explicit_alignment,
|
|
layout,
|
|
.normal,
|
|
zcu,
|
|
{},
|
|
) catch unreachable;
|
|
}
|
|
|
|
/// Returns the alignment of a non-packed struct field. Assert the layout is not packed.
|
|
/// May do type resolution when needed.
|
|
/// Asserts that all resolution needed was done.
|
|
pub fn structFieldAlignmentSema(
|
|
field_ty: Type,
|
|
explicit_alignment: InternPool.Alignment,
|
|
layout: std.builtin.Type.ContainerLayout,
|
|
pt: Zcu.PerThread,
|
|
) SemaError!Alignment {
|
|
return try field_ty.structFieldAlignmentInner(
|
|
explicit_alignment,
|
|
layout,
|
|
.sema,
|
|
pt.zcu,
|
|
pt.tid,
|
|
);
|
|
}
|
|
|
|
/// Returns the alignment of a non-packed struct field. Asserts the layout is not packed.
|
|
/// If `strat` is `.sema`, may perform type resolution.
|
|
pub fn structFieldAlignmentInner(
|
|
field_ty: Type,
|
|
explicit_alignment: Alignment,
|
|
layout: std.builtin.Type.ContainerLayout,
|
|
comptime strat: Type.ResolveStrat,
|
|
zcu: strat.ZcuPtr(),
|
|
tid: strat.Tid(),
|
|
) SemaError!Alignment {
|
|
assert(layout != .@"packed");
|
|
if (explicit_alignment != .none) return explicit_alignment;
|
|
const ty_abi_align = (try field_ty.abiAlignmentInner(
|
|
strat.toLazy(),
|
|
zcu,
|
|
tid,
|
|
)).scalar;
|
|
switch (layout) {
|
|
.@"packed" => unreachable,
|
|
.auto => if (zcu.getTarget().ofmt != .c) return ty_abi_align,
|
|
.@"extern" => {},
|
|
}
|
|
// extern
|
|
if (field_ty.isAbiInt(zcu) and field_ty.intInfo(zcu).bits >= 128) {
|
|
return ty_abi_align.maxStrict(.@"16");
|
|
}
|
|
return ty_abi_align;
|
|
}
|
|
|
|
pub fn unionFieldAlignmentSema(
|
|
field_ty: Type,
|
|
explicit_alignment: Alignment,
|
|
layout: std.builtin.Type.ContainerLayout,
|
|
pt: Zcu.PerThread,
|
|
) SemaError!Alignment {
|
|
return field_ty.unionFieldAlignmentInner(
|
|
explicit_alignment,
|
|
layout,
|
|
.sema,
|
|
pt.zcu,
|
|
pt.tid,
|
|
);
|
|
}
|
|
|
|
pub fn unionFieldAlignmentInner(
|
|
field_ty: Type,
|
|
explicit_alignment: Alignment,
|
|
layout: std.builtin.Type.ContainerLayout,
|
|
comptime strat: Type.ResolveStrat,
|
|
zcu: strat.ZcuPtr(),
|
|
tid: strat.Tid(),
|
|
) SemaError!Alignment {
|
|
assert(layout != .@"packed");
|
|
if (explicit_alignment != .none) return explicit_alignment;
|
|
if (field_ty.isNoReturn(zcu)) return .none;
|
|
return (try field_ty.abiAlignmentInner(strat.toLazy(), zcu, tid)).scalar;
|
|
}
|
|
|
|
pub fn structFieldDefaultValue(ty: Type, index: usize, zcu: *const Zcu) Value {
|
|
const ip = &zcu.intern_pool;
|
|
switch (ip.indexToKey(ty.toIntern())) {
|
|
.struct_type => {
|
|
const struct_type = ip.loadStructType(ty.toIntern());
|
|
const val = struct_type.fieldInit(ip, index);
|
|
// TODO: avoid using `unreachable` to indicate this.
|
|
if (val == .none) return Value.@"unreachable";
|
|
return Value.fromInterned(val);
|
|
},
|
|
.tuple_type => |tuple| {
|
|
const val = tuple.values.get(ip)[index];
|
|
// TODO: avoid using `unreachable` to indicate this.
|
|
if (val == .none) return Value.@"unreachable";
|
|
return Value.fromInterned(val);
|
|
},
|
|
else => unreachable,
|
|
}
|
|
}
|
|
|
|
pub fn structFieldValueComptime(ty: Type, pt: Zcu.PerThread, index: usize) !?Value {
|
|
const zcu = pt.zcu;
|
|
const ip = &zcu.intern_pool;
|
|
switch (ip.indexToKey(ty.toIntern())) {
|
|
.struct_type => {
|
|
const struct_type = ip.loadStructType(ty.toIntern());
|
|
if (struct_type.fieldIsComptime(ip, index)) {
|
|
assert(struct_type.haveFieldInits(ip));
|
|
return Value.fromInterned(struct_type.field_inits.get(ip)[index]);
|
|
} else {
|
|
return Type.fromInterned(struct_type.field_types.get(ip)[index]).onePossibleValue(pt);
|
|
}
|
|
},
|
|
.tuple_type => |tuple| {
|
|
const val = tuple.values.get(ip)[index];
|
|
if (val == .none) {
|
|
return Type.fromInterned(tuple.types.get(ip)[index]).onePossibleValue(pt);
|
|
} else {
|
|
return Value.fromInterned(val);
|
|
}
|
|
},
|
|
else => unreachable,
|
|
}
|
|
}
|
|
|
|
pub fn structFieldIsComptime(ty: Type, index: usize, zcu: *const Zcu) bool {
|
|
const ip = &zcu.intern_pool;
|
|
return switch (ip.indexToKey(ty.toIntern())) {
|
|
.struct_type => ip.loadStructType(ty.toIntern()).fieldIsComptime(ip, index),
|
|
.tuple_type => |tuple| tuple.values.get(ip)[index] != .none,
|
|
else => unreachable,
|
|
};
|
|
}
|
|
|
|
pub const FieldOffset = struct {
|
|
field: usize,
|
|
offset: u64,
|
|
};
|
|
|
|
/// Supports structs and unions.
|
|
pub fn structFieldOffset(ty: Type, index: usize, zcu: *const Zcu) u64 {
|
|
const ip = &zcu.intern_pool;
|
|
switch (ip.indexToKey(ty.toIntern())) {
|
|
.struct_type => {
|
|
const struct_type = ip.loadStructType(ty.toIntern());
|
|
assert(struct_type.haveLayout(ip));
|
|
assert(struct_type.layout != .@"packed");
|
|
return struct_type.offsets.get(ip)[index];
|
|
},
|
|
|
|
.tuple_type => |tuple| {
|
|
var offset: u64 = 0;
|
|
var big_align: Alignment = .none;
|
|
|
|
for (tuple.types.get(ip), tuple.values.get(ip), 0..) |field_ty, field_val, i| {
|
|
if (field_val != .none or !Type.fromInterned(field_ty).hasRuntimeBits(zcu)) {
|
|
// comptime field
|
|
if (i == index) return offset;
|
|
continue;
|
|
}
|
|
|
|
const field_align = Type.fromInterned(field_ty).abiAlignment(zcu);
|
|
big_align = big_align.max(field_align);
|
|
offset = field_align.forward(offset);
|
|
if (i == index) return offset;
|
|
offset += Type.fromInterned(field_ty).abiSize(zcu);
|
|
}
|
|
offset = big_align.max(.@"1").forward(offset);
|
|
return offset;
|
|
},
|
|
|
|
.union_type => {
|
|
const union_type = ip.loadUnionType(ty.toIntern());
|
|
if (!union_type.hasTag(ip))
|
|
return 0;
|
|
const layout = Type.getUnionLayout(union_type, zcu);
|
|
if (layout.tag_align.compare(.gte, layout.payload_align)) {
|
|
// {Tag, Payload}
|
|
return layout.payload_align.forward(layout.tag_size);
|
|
} else {
|
|
// {Payload, Tag}
|
|
return 0;
|
|
}
|
|
},
|
|
|
|
else => unreachable,
|
|
}
|
|
}
|
|
|
|
pub fn srcLocOrNull(ty: Type, zcu: *Zcu) ?Zcu.LazySrcLoc {
|
|
const ip = &zcu.intern_pool;
|
|
return .{
|
|
.base_node_inst = switch (ip.indexToKey(ty.toIntern())) {
|
|
.struct_type, .union_type, .opaque_type, .enum_type => |info| switch (info) {
|
|
.declared => |d| d.zir_index,
|
|
.reified => |r| r.zir_index,
|
|
.generated_tag => |gt| ip.loadUnionType(gt.union_type).zir_index,
|
|
},
|
|
else => return null,
|
|
},
|
|
.offset = Zcu.LazySrcLoc.Offset.nodeOffset(.zero),
|
|
};
|
|
}
|
|
|
|
pub fn srcLoc(ty: Type, zcu: *Zcu) Zcu.LazySrcLoc {
|
|
return ty.srcLocOrNull(zcu).?;
|
|
}
|
|
|
|
pub fn isGenericPoison(ty: Type) bool {
|
|
return ty.toIntern() == .generic_poison_type;
|
|
}
|
|
|
|
pub fn isTuple(ty: Type, zcu: *const Zcu) bool {
|
|
const ip = &zcu.intern_pool;
|
|
return switch (ip.indexToKey(ty.toIntern())) {
|
|
.tuple_type => true,
|
|
else => false,
|
|
};
|
|
}
|
|
|
|
/// Traverses optional child types and error union payloads until the type
|
|
/// is not a pointer. For `E!?u32`, returns `u32`; for `*u8`, returns `*u8`.
|
|
pub fn optEuBaseType(ty: Type, zcu: *const Zcu) Type {
|
|
var cur = ty;
|
|
while (true) switch (cur.zigTypeTag(zcu)) {
|
|
.optional => cur = cur.optionalChild(zcu),
|
|
.error_union => cur = cur.errorUnionPayload(zcu),
|
|
else => return cur,
|
|
};
|
|
}
|
|
|
|
pub fn toUnsigned(ty: Type, pt: Zcu.PerThread) !Type {
|
|
const zcu = pt.zcu;
|
|
return switch (ty.zigTypeTag(zcu)) {
|
|
.int => pt.intType(.unsigned, ty.intInfo(zcu).bits),
|
|
.vector => try pt.vectorType(.{
|
|
.len = ty.vectorLen(zcu),
|
|
.child = (try ty.childType(zcu).toUnsigned(pt)).toIntern(),
|
|
}),
|
|
else => unreachable,
|
|
};
|
|
}
|
|
|
|
pub fn typeDeclInst(ty: Type, zcu: *const Zcu) ?InternPool.TrackedInst.Index {
|
|
const ip = &zcu.intern_pool;
|
|
return switch (ip.indexToKey(ty.toIntern())) {
|
|
.struct_type => ip.loadStructType(ty.toIntern()).zir_index,
|
|
.union_type => ip.loadUnionType(ty.toIntern()).zir_index,
|
|
.enum_type => ip.loadEnumType(ty.toIntern()).zir_index.unwrap(),
|
|
.opaque_type => ip.loadOpaqueType(ty.toIntern()).zir_index,
|
|
else => null,
|
|
};
|
|
}
|
|
|
|
pub fn typeDeclInstAllowGeneratedTag(ty: Type, zcu: *const Zcu) ?InternPool.TrackedInst.Index {
|
|
const ip = &zcu.intern_pool;
|
|
return switch (ip.indexToKey(ty.toIntern())) {
|
|
.struct_type => ip.loadStructType(ty.toIntern()).zir_index,
|
|
.union_type => ip.loadUnionType(ty.toIntern()).zir_index,
|
|
.enum_type => |e| switch (e) {
|
|
.declared, .reified => ip.loadEnumType(ty.toIntern()).zir_index.unwrap().?,
|
|
.generated_tag => |gt| ip.loadUnionType(gt.union_type).zir_index,
|
|
},
|
|
.opaque_type => ip.loadOpaqueType(ty.toIntern()).zir_index,
|
|
else => null,
|
|
};
|
|
}
|
|
|
|
pub fn typeDeclSrcLine(ty: Type, zcu: *Zcu) ?u32 {
|
|
// Note that changes to ZIR instruction tracking only need to update this code
|
|
// if a newly-tracked instruction can be a type's owner `zir_index`.
|
|
comptime assert(Zir.inst_tracking_version == 0);
|
|
|
|
const ip = &zcu.intern_pool;
|
|
const tracked = switch (ip.indexToKey(ty.toIntern())) {
|
|
.struct_type, .union_type, .opaque_type, .enum_type => |info| switch (info) {
|
|
.declared => |d| d.zir_index,
|
|
.reified => |r| r.zir_index,
|
|
.generated_tag => |gt| ip.loadUnionType(gt.union_type).zir_index,
|
|
},
|
|
else => return null,
|
|
};
|
|
const info = tracked.resolveFull(&zcu.intern_pool) orelse return null;
|
|
const file = zcu.fileByIndex(info.file);
|
|
const zir = switch (file.getMode()) {
|
|
.zig => file.zir.?,
|
|
.zon => return 0,
|
|
};
|
|
const inst = zir.instructions.get(@intFromEnum(info.inst));
|
|
return switch (inst.tag) {
|
|
.struct_init, .struct_init_ref => zir.extraData(Zir.Inst.StructInit, inst.data.pl_node.payload_index).data.abs_line,
|
|
.struct_init_anon => zir.extraData(Zir.Inst.StructInitAnon, inst.data.pl_node.payload_index).data.abs_line,
|
|
.extended => switch (inst.data.extended.opcode) {
|
|
.struct_decl => zir.extraData(Zir.Inst.StructDecl, inst.data.extended.operand).data.src_line,
|
|
.union_decl => zir.extraData(Zir.Inst.UnionDecl, inst.data.extended.operand).data.src_line,
|
|
.enum_decl => zir.extraData(Zir.Inst.EnumDecl, inst.data.extended.operand).data.src_line,
|
|
.opaque_decl => zir.extraData(Zir.Inst.OpaqueDecl, inst.data.extended.operand).data.src_line,
|
|
.reify => zir.extraData(Zir.Inst.Reify, inst.data.extended.operand).data.src_line,
|
|
else => unreachable,
|
|
},
|
|
else => unreachable,
|
|
};
|
|
}
|
|
|
|
/// Given a namespace type, returns its list of captured values.
|
|
pub fn getCaptures(ty: Type, zcu: *const Zcu) InternPool.CaptureValue.Slice {
|
|
const ip = &zcu.intern_pool;
|
|
return switch (ip.indexToKey(ty.toIntern())) {
|
|
.struct_type => ip.loadStructType(ty.toIntern()).captures,
|
|
.union_type => ip.loadUnionType(ty.toIntern()).captures,
|
|
.enum_type => ip.loadEnumType(ty.toIntern()).captures,
|
|
.opaque_type => ip.loadOpaqueType(ty.toIntern()).captures,
|
|
else => unreachable,
|
|
};
|
|
}
|
|
|
|
pub fn arrayBase(ty: Type, zcu: *const Zcu) struct { Type, u64 } {
|
|
var cur_ty: Type = ty;
|
|
var cur_len: u64 = 1;
|
|
while (cur_ty.zigTypeTag(zcu) == .array) {
|
|
cur_len *= cur_ty.arrayLenIncludingSentinel(zcu);
|
|
cur_ty = cur_ty.childType(zcu);
|
|
}
|
|
return .{ cur_ty, cur_len };
|
|
}
|
|
|
|
pub fn packedStructFieldPtrInfo(struct_ty: Type, parent_ptr_ty: Type, field_idx: u32, pt: Zcu.PerThread) union(enum) {
|
|
/// The result is a bit-pointer with the same value and a new packed offset.
|
|
bit_ptr: InternPool.Key.PtrType.PackedOffset,
|
|
/// The result is a standard pointer.
|
|
byte_ptr: struct {
|
|
/// The byte offset of the field pointer from the parent pointer value.
|
|
offset: u64,
|
|
/// The alignment of the field pointer type.
|
|
alignment: InternPool.Alignment,
|
|
},
|
|
} {
|
|
comptime assert(Type.packed_struct_layout_version == 2);
|
|
|
|
const zcu = pt.zcu;
|
|
const parent_ptr_info = parent_ptr_ty.ptrInfo(zcu);
|
|
const field_ty = struct_ty.fieldType(field_idx, zcu);
|
|
|
|
var bit_offset: u16 = 0;
|
|
var running_bits: u16 = 0;
|
|
for (0..struct_ty.structFieldCount(zcu)) |i| {
|
|
const f_ty = struct_ty.fieldType(i, zcu);
|
|
if (i == field_idx) {
|
|
bit_offset = running_bits;
|
|
}
|
|
running_bits += @intCast(f_ty.bitSize(zcu));
|
|
}
|
|
|
|
const res_host_size: u16, const res_bit_offset: u16 = if (parent_ptr_info.packed_offset.host_size != 0)
|
|
.{ parent_ptr_info.packed_offset.host_size, parent_ptr_info.packed_offset.bit_offset + bit_offset }
|
|
else
|
|
.{ (running_bits + 7) / 8, bit_offset };
|
|
|
|
// If the field happens to be byte-aligned, simplify the pointer type.
|
|
// We can only do this if the pointee's bit size matches its ABI byte size,
|
|
// so that loads and stores do not interfere with surrounding packed bits.
|
|
//
|
|
// TODO: we do not attempt this with big-endian targets yet because of nested
|
|
// structs and floats. I need to double-check the desired behavior for big endian
|
|
// targets before adding the necessary complications to this code. This will not
|
|
// cause miscompilations; it only means the field pointer uses bit masking when it
|
|
// might not be strictly necessary.
|
|
if (res_bit_offset % 8 == 0 and field_ty.bitSize(zcu) == field_ty.abiSize(zcu) * 8 and zcu.getTarget().cpu.arch.endian() == .little) {
|
|
const byte_offset = res_bit_offset / 8;
|
|
const new_align = Alignment.fromLog2Units(@ctz(byte_offset | parent_ptr_ty.ptrAlignment(zcu).toByteUnits().?));
|
|
return .{ .byte_ptr = .{
|
|
.offset = byte_offset,
|
|
.alignment = new_align,
|
|
} };
|
|
}
|
|
|
|
return .{ .bit_ptr = .{
|
|
.host_size = res_host_size,
|
|
.bit_offset = res_bit_offset,
|
|
} };
|
|
}
|
|
|
|
pub fn resolveLayout(ty: Type, pt: Zcu.PerThread) SemaError!void {
|
|
const zcu = pt.zcu;
|
|
const ip = &zcu.intern_pool;
|
|
switch (ty.zigTypeTag(zcu)) {
|
|
.@"struct" => switch (ip.indexToKey(ty.toIntern())) {
|
|
.tuple_type => |tuple_type| for (0..tuple_type.types.len) |i| {
|
|
const field_ty = Type.fromInterned(tuple_type.types.get(ip)[i]);
|
|
try field_ty.resolveLayout(pt);
|
|
},
|
|
.struct_type => return ty.resolveStructInner(pt, .layout),
|
|
else => unreachable,
|
|
},
|
|
.@"union" => return ty.resolveUnionInner(pt, .layout),
|
|
.array => {
|
|
if (ty.arrayLenIncludingSentinel(zcu) == 0) return;
|
|
const elem_ty = ty.childType(zcu);
|
|
return elem_ty.resolveLayout(pt);
|
|
},
|
|
.optional => {
|
|
const payload_ty = ty.optionalChild(zcu);
|
|
return payload_ty.resolveLayout(pt);
|
|
},
|
|
.error_union => {
|
|
const payload_ty = ty.errorUnionPayload(zcu);
|
|
return payload_ty.resolveLayout(pt);
|
|
},
|
|
.@"fn" => {
|
|
const info = zcu.typeToFunc(ty).?;
|
|
if (info.is_generic) {
|
|
// Resolving of generic function types is deferred to when
|
|
// the function is instantiated.
|
|
return;
|
|
}
|
|
for (0..info.param_types.len) |i| {
|
|
const param_ty = info.param_types.get(ip)[i];
|
|
try Type.fromInterned(param_ty).resolveLayout(pt);
|
|
}
|
|
try Type.fromInterned(info.return_type).resolveLayout(pt);
|
|
},
|
|
else => {},
|
|
}
|
|
}
|
|
|
|
pub fn resolveFields(ty: Type, pt: Zcu.PerThread) SemaError!void {
|
|
const ip = &pt.zcu.intern_pool;
|
|
const ty_ip = ty.toIntern();
|
|
|
|
switch (ty_ip) {
|
|
.none => unreachable,
|
|
|
|
.u0_type,
|
|
.i0_type,
|
|
.u1_type,
|
|
.u8_type,
|
|
.i8_type,
|
|
.u16_type,
|
|
.i16_type,
|
|
.u29_type,
|
|
.u32_type,
|
|
.i32_type,
|
|
.u64_type,
|
|
.i64_type,
|
|
.u80_type,
|
|
.u128_type,
|
|
.i128_type,
|
|
.usize_type,
|
|
.isize_type,
|
|
.c_char_type,
|
|
.c_short_type,
|
|
.c_ushort_type,
|
|
.c_int_type,
|
|
.c_uint_type,
|
|
.c_long_type,
|
|
.c_ulong_type,
|
|
.c_longlong_type,
|
|
.c_ulonglong_type,
|
|
.c_longdouble_type,
|
|
.f16_type,
|
|
.f32_type,
|
|
.f64_type,
|
|
.f80_type,
|
|
.f128_type,
|
|
.anyopaque_type,
|
|
.bool_type,
|
|
.void_type,
|
|
.type_type,
|
|
.anyerror_type,
|
|
.adhoc_inferred_error_set_type,
|
|
.comptime_int_type,
|
|
.comptime_float_type,
|
|
.noreturn_type,
|
|
.anyframe_type,
|
|
.null_type,
|
|
.undefined_type,
|
|
.enum_literal_type,
|
|
.manyptr_u8_type,
|
|
.manyptr_const_u8_type,
|
|
.manyptr_const_u8_sentinel_0_type,
|
|
.single_const_pointer_to_comptime_int_type,
|
|
.slice_const_u8_type,
|
|
.slice_const_u8_sentinel_0_type,
|
|
.optional_noreturn_type,
|
|
.anyerror_void_error_union_type,
|
|
.generic_poison_type,
|
|
.empty_tuple_type,
|
|
=> {},
|
|
|
|
.undef => unreachable,
|
|
.zero => unreachable,
|
|
.zero_usize => unreachable,
|
|
.zero_u8 => unreachable,
|
|
.one => unreachable,
|
|
.one_usize => unreachable,
|
|
.one_u8 => unreachable,
|
|
.four_u8 => unreachable,
|
|
.negative_one => unreachable,
|
|
.void_value => unreachable,
|
|
.unreachable_value => unreachable,
|
|
.null_value => unreachable,
|
|
.bool_true => unreachable,
|
|
.bool_false => unreachable,
|
|
.empty_tuple => unreachable,
|
|
|
|
else => switch (ty_ip.unwrap(ip).getTag(ip)) {
|
|
.type_struct,
|
|
.type_struct_packed,
|
|
.type_struct_packed_inits,
|
|
=> return ty.resolveStructInner(pt, .fields),
|
|
|
|
.type_union => return ty.resolveUnionInner(pt, .fields),
|
|
|
|
else => {},
|
|
},
|
|
}
|
|
}
|
|
|
|
pub fn resolveFully(ty: Type, pt: Zcu.PerThread) SemaError!void {
|
|
const zcu = pt.zcu;
|
|
const ip = &zcu.intern_pool;
|
|
|
|
switch (ty.zigTypeTag(zcu)) {
|
|
.type,
|
|
.void,
|
|
.bool,
|
|
.noreturn,
|
|
.int,
|
|
.float,
|
|
.comptime_float,
|
|
.comptime_int,
|
|
.undefined,
|
|
.null,
|
|
.error_set,
|
|
.@"enum",
|
|
.@"opaque",
|
|
.frame,
|
|
.@"anyframe",
|
|
.vector,
|
|
.enum_literal,
|
|
=> {},
|
|
|
|
.pointer => return ty.childType(zcu).resolveFully(pt),
|
|
.array => return ty.childType(zcu).resolveFully(pt),
|
|
.optional => return ty.optionalChild(zcu).resolveFully(pt),
|
|
.error_union => return ty.errorUnionPayload(zcu).resolveFully(pt),
|
|
.@"fn" => {
|
|
const info = zcu.typeToFunc(ty).?;
|
|
if (info.is_generic) return;
|
|
for (0..info.param_types.len) |i| {
|
|
const param_ty = info.param_types.get(ip)[i];
|
|
try Type.fromInterned(param_ty).resolveFully(pt);
|
|
}
|
|
try Type.fromInterned(info.return_type).resolveFully(pt);
|
|
},
|
|
|
|
.@"struct" => switch (ip.indexToKey(ty.toIntern())) {
|
|
.tuple_type => |tuple_type| for (0..tuple_type.types.len) |i| {
|
|
const field_ty = Type.fromInterned(tuple_type.types.get(ip)[i]);
|
|
try field_ty.resolveFully(pt);
|
|
},
|
|
.struct_type => return ty.resolveStructInner(pt, .full),
|
|
else => unreachable,
|
|
},
|
|
.@"union" => return ty.resolveUnionInner(pt, .full),
|
|
}
|
|
}
|
|
|
|
pub fn resolveStructFieldInits(ty: Type, pt: Zcu.PerThread) SemaError!void {
|
|
// TODO: stop calling this for tuples!
|
|
_ = pt.zcu.typeToStruct(ty) orelse return;
|
|
return ty.resolveStructInner(pt, .inits);
|
|
}
|
|
|
|
pub fn resolveStructAlignment(ty: Type, pt: Zcu.PerThread) SemaError!void {
|
|
return ty.resolveStructInner(pt, .alignment);
|
|
}
|
|
|
|
pub fn resolveUnionAlignment(ty: Type, pt: Zcu.PerThread) SemaError!void {
|
|
return ty.resolveUnionInner(pt, .alignment);
|
|
}
|
|
|
|
/// `ty` must be a struct.
|
|
fn resolveStructInner(
|
|
ty: Type,
|
|
pt: Zcu.PerThread,
|
|
resolution: enum { fields, inits, alignment, layout, full },
|
|
) SemaError!void {
|
|
const zcu = pt.zcu;
|
|
const gpa = zcu.gpa;
|
|
|
|
const struct_obj = zcu.typeToStruct(ty).?;
|
|
const owner: InternPool.AnalUnit = .wrap(.{ .type = ty.toIntern() });
|
|
|
|
if (zcu.failed_analysis.contains(owner) or zcu.transitive_failed_analysis.contains(owner)) {
|
|
return error.AnalysisFail;
|
|
}
|
|
|
|
var analysis_arena = std.heap.ArenaAllocator.init(gpa);
|
|
defer analysis_arena.deinit();
|
|
|
|
var comptime_err_ret_trace = std.ArrayList(Zcu.LazySrcLoc).init(gpa);
|
|
defer comptime_err_ret_trace.deinit();
|
|
|
|
const zir = zcu.namespacePtr(struct_obj.namespace).fileScope(zcu).zir.?;
|
|
var sema: Sema = .{
|
|
.pt = pt,
|
|
.gpa = gpa,
|
|
.arena = analysis_arena.allocator(),
|
|
.code = zir,
|
|
.owner = owner,
|
|
.func_index = .none,
|
|
.func_is_naked = false,
|
|
.fn_ret_ty = Type.void,
|
|
.fn_ret_ty_ies = null,
|
|
.comptime_err_ret_trace = &comptime_err_ret_trace,
|
|
};
|
|
defer sema.deinit();
|
|
|
|
(switch (resolution) {
|
|
.fields => sema.resolveStructFieldTypes(ty.toIntern(), struct_obj),
|
|
.inits => sema.resolveStructFieldInits(ty),
|
|
.alignment => sema.resolveStructAlignment(ty.toIntern(), struct_obj),
|
|
.layout => sema.resolveStructLayout(ty),
|
|
.full => sema.resolveStructFully(ty),
|
|
}) catch |err| switch (err) {
|
|
error.AnalysisFail => {
|
|
if (!zcu.failed_analysis.contains(owner)) {
|
|
try zcu.transitive_failed_analysis.put(gpa, owner, {});
|
|
}
|
|
return error.AnalysisFail;
|
|
},
|
|
error.OutOfMemory => |e| return e,
|
|
};
|
|
}
|
|
|
|
/// `ty` must be a union.
|
|
fn resolveUnionInner(
|
|
ty: Type,
|
|
pt: Zcu.PerThread,
|
|
resolution: enum { fields, alignment, layout, full },
|
|
) SemaError!void {
|
|
const zcu = pt.zcu;
|
|
const gpa = zcu.gpa;
|
|
|
|
const union_obj = zcu.typeToUnion(ty).?;
|
|
const owner: InternPool.AnalUnit = .wrap(.{ .type = ty.toIntern() });
|
|
|
|
if (zcu.failed_analysis.contains(owner) or zcu.transitive_failed_analysis.contains(owner)) {
|
|
return error.AnalysisFail;
|
|
}
|
|
|
|
var analysis_arena = std.heap.ArenaAllocator.init(gpa);
|
|
defer analysis_arena.deinit();
|
|
|
|
var comptime_err_ret_trace = std.ArrayList(Zcu.LazySrcLoc).init(gpa);
|
|
defer comptime_err_ret_trace.deinit();
|
|
|
|
const zir = zcu.namespacePtr(union_obj.namespace).fileScope(zcu).zir.?;
|
|
var sema: Sema = .{
|
|
.pt = pt,
|
|
.gpa = gpa,
|
|
.arena = analysis_arena.allocator(),
|
|
.code = zir,
|
|
.owner = owner,
|
|
.func_index = .none,
|
|
.func_is_naked = false,
|
|
.fn_ret_ty = Type.void,
|
|
.fn_ret_ty_ies = null,
|
|
.comptime_err_ret_trace = &comptime_err_ret_trace,
|
|
};
|
|
defer sema.deinit();
|
|
|
|
(switch (resolution) {
|
|
.fields => sema.resolveUnionFieldTypes(ty, union_obj),
|
|
.alignment => sema.resolveUnionAlignment(ty, union_obj),
|
|
.layout => sema.resolveUnionLayout(ty),
|
|
.full => sema.resolveUnionFully(ty),
|
|
}) catch |err| switch (err) {
|
|
error.AnalysisFail => {
|
|
if (!zcu.failed_analysis.contains(owner)) {
|
|
try zcu.transitive_failed_analysis.put(gpa, owner, {});
|
|
}
|
|
return error.AnalysisFail;
|
|
},
|
|
error.OutOfMemory => |e| return e,
|
|
};
|
|
}
|
|
|
|
pub fn getUnionLayout(loaded_union: InternPool.LoadedUnionType, zcu: *const Zcu) Zcu.UnionLayout {
|
|
const ip = &zcu.intern_pool;
|
|
assert(loaded_union.haveLayout(ip));
|
|
var most_aligned_field: u32 = undefined;
|
|
var most_aligned_field_size: u64 = undefined;
|
|
var biggest_field: u32 = undefined;
|
|
var payload_size: u64 = 0;
|
|
var payload_align: InternPool.Alignment = .@"1";
|
|
for (loaded_union.field_types.get(ip), 0..) |field_ty, field_index| {
|
|
if (!Type.fromInterned(field_ty).hasRuntimeBitsIgnoreComptime(zcu)) continue;
|
|
|
|
const explicit_align = loaded_union.fieldAlign(ip, field_index);
|
|
const field_align = if (explicit_align != .none)
|
|
explicit_align
|
|
else
|
|
Type.fromInterned(field_ty).abiAlignment(zcu);
|
|
const field_size = Type.fromInterned(field_ty).abiSize(zcu);
|
|
if (field_size > payload_size) {
|
|
payload_size = field_size;
|
|
biggest_field = @intCast(field_index);
|
|
}
|
|
if (field_align.compare(.gte, payload_align)) {
|
|
payload_align = field_align;
|
|
most_aligned_field = @intCast(field_index);
|
|
most_aligned_field_size = field_size;
|
|
}
|
|
}
|
|
const have_tag = loaded_union.flagsUnordered(ip).runtime_tag.hasTag();
|
|
if (!have_tag or !Type.fromInterned(loaded_union.enum_tag_ty).hasRuntimeBits(zcu)) {
|
|
return .{
|
|
.abi_size = payload_align.forward(payload_size),
|
|
.abi_align = payload_align,
|
|
.most_aligned_field = most_aligned_field,
|
|
.most_aligned_field_size = most_aligned_field_size,
|
|
.biggest_field = biggest_field,
|
|
.payload_size = payload_size,
|
|
.payload_align = payload_align,
|
|
.tag_align = .none,
|
|
.tag_size = 0,
|
|
.padding = 0,
|
|
};
|
|
}
|
|
|
|
const tag_size = Type.fromInterned(loaded_union.enum_tag_ty).abiSize(zcu);
|
|
const tag_align = Type.fromInterned(loaded_union.enum_tag_ty).abiAlignment(zcu).max(.@"1");
|
|
return .{
|
|
.abi_size = loaded_union.sizeUnordered(ip),
|
|
.abi_align = tag_align.max(payload_align),
|
|
.most_aligned_field = most_aligned_field,
|
|
.most_aligned_field_size = most_aligned_field_size,
|
|
.biggest_field = biggest_field,
|
|
.payload_size = payload_size,
|
|
.payload_align = payload_align,
|
|
.tag_align = tag_align,
|
|
.tag_size = tag_size,
|
|
.padding = loaded_union.paddingUnordered(ip),
|
|
};
|
|
}
|
|
|
|
/// Returns the type of a pointer to an element.
|
|
/// Asserts that the type is a pointer, and that the element type is indexable.
|
|
/// If the element index is comptime-known, it must be passed in `offset`.
|
|
/// For *@Vector(n, T), return *align(a:b:h:v) T
|
|
/// For *[N]T, return *T
|
|
/// For [*]T, returns *T
|
|
/// For []T, returns *T
|
|
/// Handles const-ness and address spaces in particular.
|
|
/// This code is duplicated in `Sema.analyzePtrArithmetic`.
|
|
/// May perform type resolution and return a transitive `error.AnalysisFail`.
|
|
pub fn elemPtrType(ptr_ty: Type, offset: ?usize, pt: Zcu.PerThread) !Type {
|
|
const zcu = pt.zcu;
|
|
const ptr_info = ptr_ty.ptrInfo(zcu);
|
|
const elem_ty = ptr_ty.elemType2(zcu);
|
|
const is_allowzero = ptr_info.flags.is_allowzero and (offset orelse 0) == 0;
|
|
const parent_ty = ptr_ty.childType(zcu);
|
|
|
|
const VI = InternPool.Key.PtrType.VectorIndex;
|
|
|
|
const vector_info: struct {
|
|
host_size: u16 = 0,
|
|
alignment: Alignment = .none,
|
|
vector_index: VI = .none,
|
|
} = if (parent_ty.isVector(zcu) and ptr_info.flags.size == .one) blk: {
|
|
const elem_bits = elem_ty.bitSize(zcu);
|
|
if (elem_bits == 0) break :blk .{};
|
|
const is_packed = elem_bits < 8 or !std.math.isPowerOfTwo(elem_bits);
|
|
if (!is_packed) break :blk .{};
|
|
|
|
break :blk .{
|
|
.host_size = @intCast(parent_ty.arrayLen(zcu)),
|
|
.alignment = parent_ty.abiAlignment(zcu),
|
|
.vector_index = if (offset) |some| @enumFromInt(some) else .runtime,
|
|
};
|
|
} else .{};
|
|
|
|
const alignment: Alignment = a: {
|
|
// Calculate the new pointer alignment.
|
|
if (ptr_info.flags.alignment == .none) {
|
|
// In case of an ABI-aligned pointer, any pointer arithmetic
|
|
// maintains the same ABI-alignedness.
|
|
break :a vector_info.alignment;
|
|
}
|
|
// If the addend is not a comptime-known value we can still count on
|
|
// it being a multiple of the type size.
|
|
const elem_size = (try elem_ty.abiSizeInner(.sema, zcu, pt.tid)).scalar;
|
|
const addend = if (offset) |off| elem_size * off else elem_size;
|
|
|
|
// The resulting pointer is aligned to the lcd between the offset (an
|
|
// arbitrary number) and the alignment factor (always a power of two,
|
|
// non zero).
|
|
const new_align: Alignment = @enumFromInt(@min(
|
|
@ctz(addend),
|
|
ptr_info.flags.alignment.toLog2Units(),
|
|
));
|
|
assert(new_align != .none);
|
|
break :a new_align;
|
|
};
|
|
return pt.ptrTypeSema(.{
|
|
.child = elem_ty.toIntern(),
|
|
.flags = .{
|
|
.alignment = alignment,
|
|
.is_const = ptr_info.flags.is_const,
|
|
.is_volatile = ptr_info.flags.is_volatile,
|
|
.is_allowzero = is_allowzero,
|
|
.address_space = ptr_info.flags.address_space,
|
|
.vector_index = vector_info.vector_index,
|
|
},
|
|
.packed_offset = .{
|
|
.host_size = vector_info.host_size,
|
|
.bit_offset = 0,
|
|
},
|
|
});
|
|
}
|
|
|
|
pub fn containerTypeName(ty: Type, ip: *const InternPool) InternPool.NullTerminatedString {
|
|
return switch (ip.indexToKey(ty.toIntern())) {
|
|
.struct_type => ip.loadStructType(ty.toIntern()).name,
|
|
.union_type => ip.loadUnionType(ty.toIntern()).name,
|
|
.enum_type => ip.loadEnumType(ty.toIntern()).name,
|
|
.opaque_type => ip.loadOpaqueType(ty.toIntern()).name,
|
|
else => unreachable,
|
|
};
|
|
}
|
|
|
|
/// Returns `true` if a value of this type is always `null`.
|
|
/// Returns `false` if a value of this type is neve `null`.
|
|
/// Returns `null` otherwise.
|
|
pub fn isNullFromType(ty: Type, zcu: *const Zcu) ?bool {
|
|
if (ty.zigTypeTag(zcu) != .optional and !ty.isCPtr(zcu)) return false;
|
|
const child = ty.optionalChild(zcu);
|
|
if (child.zigTypeTag(zcu) == .noreturn) return true; // `?noreturn` is always null
|
|
return null;
|
|
}
|
|
|
|
pub const @"u1": Type = .{ .ip_index = .u1_type };
|
|
pub const @"u8": Type = .{ .ip_index = .u8_type };
|
|
pub const @"u16": Type = .{ .ip_index = .u16_type };
|
|
pub const @"u29": Type = .{ .ip_index = .u29_type };
|
|
pub const @"u32": Type = .{ .ip_index = .u32_type };
|
|
pub const @"u64": Type = .{ .ip_index = .u64_type };
|
|
pub const @"u80": Type = .{ .ip_index = .u80_type };
|
|
pub const @"u128": Type = .{ .ip_index = .u128_type };
|
|
|
|
pub const @"i8": Type = .{ .ip_index = .i8_type };
|
|
pub const @"i16": Type = .{ .ip_index = .i16_type };
|
|
pub const @"i32": Type = .{ .ip_index = .i32_type };
|
|
pub const @"i64": Type = .{ .ip_index = .i64_type };
|
|
pub const @"i128": Type = .{ .ip_index = .i128_type };
|
|
|
|
pub const @"f16": Type = .{ .ip_index = .f16_type };
|
|
pub const @"f32": Type = .{ .ip_index = .f32_type };
|
|
pub const @"f64": Type = .{ .ip_index = .f64_type };
|
|
pub const @"f80": Type = .{ .ip_index = .f80_type };
|
|
pub const @"f128": Type = .{ .ip_index = .f128_type };
|
|
|
|
pub const @"bool": Type = .{ .ip_index = .bool_type };
|
|
pub const @"usize": Type = .{ .ip_index = .usize_type };
|
|
pub const @"isize": Type = .{ .ip_index = .isize_type };
|
|
pub const @"comptime_int": Type = .{ .ip_index = .comptime_int_type };
|
|
pub const @"comptime_float": Type = .{ .ip_index = .comptime_float_type };
|
|
pub const @"void": Type = .{ .ip_index = .void_type };
|
|
pub const @"type": Type = .{ .ip_index = .type_type };
|
|
pub const @"anyerror": Type = .{ .ip_index = .anyerror_type };
|
|
pub const @"anyopaque": Type = .{ .ip_index = .anyopaque_type };
|
|
pub const @"anyframe": Type = .{ .ip_index = .anyframe_type };
|
|
pub const @"null": Type = .{ .ip_index = .null_type };
|
|
pub const @"undefined": Type = .{ .ip_index = .undefined_type };
|
|
pub const @"noreturn": Type = .{ .ip_index = .noreturn_type };
|
|
pub const enum_literal: Type = .{ .ip_index = .enum_literal_type };
|
|
|
|
pub const @"c_char": Type = .{ .ip_index = .c_char_type };
|
|
pub const @"c_short": Type = .{ .ip_index = .c_short_type };
|
|
pub const @"c_ushort": Type = .{ .ip_index = .c_ushort_type };
|
|
pub const @"c_int": Type = .{ .ip_index = .c_int_type };
|
|
pub const @"c_uint": Type = .{ .ip_index = .c_uint_type };
|
|
pub const @"c_long": Type = .{ .ip_index = .c_long_type };
|
|
pub const @"c_ulong": Type = .{ .ip_index = .c_ulong_type };
|
|
pub const @"c_longlong": Type = .{ .ip_index = .c_longlong_type };
|
|
pub const @"c_ulonglong": Type = .{ .ip_index = .c_ulonglong_type };
|
|
pub const @"c_longdouble": Type = .{ .ip_index = .c_longdouble_type };
|
|
|
|
pub const manyptr_u8: Type = .{ .ip_index = .manyptr_u8_type };
|
|
pub const manyptr_const_u8: Type = .{ .ip_index = .manyptr_const_u8_type };
|
|
pub const manyptr_const_u8_sentinel_0: Type = .{ .ip_index = .manyptr_const_u8_sentinel_0_type };
|
|
pub const single_const_pointer_to_comptime_int: Type = .{ .ip_index = .single_const_pointer_to_comptime_int_type };
|
|
pub const slice_const_u8: Type = .{ .ip_index = .slice_const_u8_type };
|
|
pub const slice_const_u8_sentinel_0: Type = .{ .ip_index = .slice_const_u8_sentinel_0_type };
|
|
|
|
pub const vector_16_i8: Type = .{ .ip_index = .vector_16_i8_type };
|
|
pub const vector_32_i8: Type = .{ .ip_index = .vector_32_i8_type };
|
|
pub const vector_1_u8: Type = .{ .ip_index = .vector_1_u8_type };
|
|
pub const vector_2_u8: Type = .{ .ip_index = .vector_2_u8_type };
|
|
pub const vector_4_u8: Type = .{ .ip_index = .vector_4_u8_type };
|
|
pub const vector_8_u8: Type = .{ .ip_index = .vector_8_u8_type };
|
|
pub const vector_16_u8: Type = .{ .ip_index = .vector_16_u8_type };
|
|
pub const vector_32_u8: Type = .{ .ip_index = .vector_32_u8_type };
|
|
pub const vector_8_i16: Type = .{ .ip_index = .vector_8_i16_type };
|
|
pub const vector_16_i16: Type = .{ .ip_index = .vector_16_i16_type };
|
|
pub const vector_8_u16: Type = .{ .ip_index = .vector_8_u16_type };
|
|
pub const vector_16_u16: Type = .{ .ip_index = .vector_16_u16_type };
|
|
pub const vector_4_i32: Type = .{ .ip_index = .vector_4_i32_type };
|
|
pub const vector_8_i32: Type = .{ .ip_index = .vector_8_i32_type };
|
|
pub const vector_4_u32: Type = .{ .ip_index = .vector_4_u32_type };
|
|
pub const vector_8_u32: Type = .{ .ip_index = .vector_8_u32_type };
|
|
pub const vector_2_i64: Type = .{ .ip_index = .vector_2_i64_type };
|
|
pub const vector_4_i64: Type = .{ .ip_index = .vector_4_i64_type };
|
|
pub const vector_2_u64: Type = .{ .ip_index = .vector_2_u64_type };
|
|
pub const vector_4_u64: Type = .{ .ip_index = .vector_4_u64_type };
|
|
pub const vector_4_f16: Type = .{ .ip_index = .vector_4_f16_type };
|
|
pub const vector_8_f16: Type = .{ .ip_index = .vector_8_f16_type };
|
|
pub const vector_2_f32: Type = .{ .ip_index = .vector_2_f32_type };
|
|
pub const vector_4_f32: Type = .{ .ip_index = .vector_4_f32_type };
|
|
pub const vector_8_f32: Type = .{ .ip_index = .vector_8_f32_type };
|
|
pub const vector_2_f64: Type = .{ .ip_index = .vector_2_f64_type };
|
|
pub const vector_4_f64: Type = .{ .ip_index = .vector_4_f64_type };
|
|
|
|
pub const empty_tuple: Type = .{ .ip_index = .empty_tuple_type };
|
|
|
|
pub const generic_poison: Type = .{ .ip_index = .generic_poison_type };
|
|
|
|
pub fn smallestUnsignedBits(max: u64) u16 {
|
|
if (max == 0) return 0;
|
|
const base = std.math.log2(max);
|
|
const upper = (@as(u64, 1) << @as(u6, @intCast(base))) - 1;
|
|
return @as(u16, @intCast(base + @intFromBool(upper < max)));
|
|
}
|
|
|
|
/// This is only used for comptime asserts. Bump this number when you make a change
|
|
/// to packed struct layout to find out all the places in the codebase you need to edit!
|
|
pub const packed_struct_layout_version = 2;
|
|
|
|
fn cTypeAlign(target: Target, c_type: Target.CType) Alignment {
|
|
return Alignment.fromByteUnits(target.cTypeAlignment(c_type));
|
|
}
|