mirror of
https://github.com/Ed94/Odin.git
synced 2026-06-22 05:34:59 -07:00
Merge remote-tracking branch 'offical/master'
This commit is contained in:
@@ -181,6 +181,14 @@ Type_Info_Matrix :: struct {
|
||||
Type_Info_Soa_Pointer :: struct {
|
||||
elem: ^Type_Info,
|
||||
}
|
||||
Type_Info_Bit_Field :: struct {
|
||||
backing_type: ^Type_Info,
|
||||
names: []string,
|
||||
types: []^Type_Info,
|
||||
bit_sizes: []uintptr,
|
||||
bit_offsets: []uintptr,
|
||||
tags: []string,
|
||||
}
|
||||
|
||||
Type_Info_Flag :: enum u8 {
|
||||
Comparable = 0,
|
||||
@@ -223,6 +231,7 @@ Type_Info :: struct {
|
||||
Type_Info_Relative_Multi_Pointer,
|
||||
Type_Info_Matrix,
|
||||
Type_Info_Soa_Pointer,
|
||||
Type_Info_Bit_Field,
|
||||
},
|
||||
}
|
||||
|
||||
@@ -256,6 +265,7 @@ Typeid_Kind :: enum u8 {
|
||||
Relative_Multi_Pointer,
|
||||
Matrix,
|
||||
Soa_Pointer,
|
||||
Bit_Field,
|
||||
}
|
||||
#assert(len(Typeid_Kind) < 32)
|
||||
|
||||
|
||||
@@ -1034,3 +1034,25 @@ fixdfti :: proc(a: u64) -> i128 {
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
|
||||
|
||||
__write_bits :: proc "contextless" (dst, src: [^]byte, offset: uintptr, size: uintptr) {
|
||||
for i in 0..<size {
|
||||
j := offset+i
|
||||
the_bit := byte((src[i/8]) & (1<<(i&7)) != 0)
|
||||
b := the_bit<<(j&7)
|
||||
dst[j/8] &~= b
|
||||
dst[j/8] |= b
|
||||
}
|
||||
}
|
||||
|
||||
__read_bits :: proc "contextless" (dst, src: [^]byte, offset: uintptr, size: uintptr) {
|
||||
for j in 0..<size {
|
||||
i := offset+j
|
||||
the_bit := byte((src[i/8]) & (1<<(i&7)) != 0)
|
||||
b := the_bit<<(j&7)
|
||||
dst[j/8] &~= b
|
||||
dst[j/8] |= b
|
||||
}
|
||||
}
|
||||
@@ -459,6 +459,20 @@ print_type :: proc "contextless" (ti: ^Type_Info) {
|
||||
}
|
||||
print_byte(']')
|
||||
|
||||
case Type_Info_Bit_Field:
|
||||
print_string("bit_field ")
|
||||
print_type(info.backing_type)
|
||||
print_string(" {")
|
||||
for name, i in info.names {
|
||||
if i > 0 { print_string(", ") }
|
||||
print_string(name)
|
||||
print_string(": ")
|
||||
print_type(info.types[i])
|
||||
print_string(" | ")
|
||||
print_u64(u64(info.bit_sizes[i]))
|
||||
}
|
||||
print_byte('}')
|
||||
|
||||
|
||||
case Type_Info_Simd_Vector:
|
||||
print_string("#simd[")
|
||||
|
||||
@@ -228,6 +228,9 @@ marshal_to_writer :: proc(w: io.Writer, v: any, opt: ^Marshal_Options) -> (err:
|
||||
case runtime.Type_Info_Matrix:
|
||||
return .Unsupported_Type
|
||||
|
||||
case runtime.Type_Info_Bit_Field:
|
||||
return .Unsupported_Type
|
||||
|
||||
case runtime.Type_Info_Array:
|
||||
opt_write_start(w, opt, '[') or_return
|
||||
for i in 0..<info.count {
|
||||
|
||||
@@ -2173,6 +2173,8 @@ fmt_named :: proc(fi: ^Info, v: any, verb: rune, info: runtime.Type_Info_Named)
|
||||
#partial switch b in info.base.variant {
|
||||
case runtime.Type_Info_Struct:
|
||||
fmt_struct(fi, v, verb, b, info.name)
|
||||
case runtime.Type_Info_Bit_Field:
|
||||
fmt_bit_field(fi, v, verb, b, info.name)
|
||||
case runtime.Type_Info_Bit_Set:
|
||||
fmt_bit_set(fi, v, verb = verb)
|
||||
case:
|
||||
@@ -2283,6 +2285,96 @@ fmt_matrix :: proc(fi: ^Info, v: any, verb: rune, info: runtime.Type_Info_Matrix
|
||||
fmt_write_indent(fi)
|
||||
}
|
||||
}
|
||||
|
||||
fmt_bit_field :: proc(fi: ^Info, v: any, verb: rune, info: runtime.Type_Info_Bit_Field, type_name: string) {
|
||||
read_bits :: proc(ptr: [^]byte, offset, size: uintptr) -> (res: u64) {
|
||||
for i in 0..<size {
|
||||
j := i+offset
|
||||
B := ptr[j/8]
|
||||
k := j&7
|
||||
if B & (u8(1)<<k) != 0 {
|
||||
res |= u64(1)<<u64(i)
|
||||
}
|
||||
}
|
||||
return
|
||||
}
|
||||
|
||||
handle_bit_field_tag :: proc(data: rawptr, info: reflect.Type_Info_Bit_Field, idx: int, verb: ^rune) -> (do_continue: bool) {
|
||||
tag := info.tags[idx]
|
||||
if vt, ok := reflect.struct_tag_lookup(reflect.Struct_Tag(tag), "fmt"); ok {
|
||||
value := strings.trim_space(string(vt))
|
||||
switch value {
|
||||
case "": return false
|
||||
case "-": return true
|
||||
}
|
||||
r, w := utf8.decode_rune_in_string(value)
|
||||
value = value[w:]
|
||||
if value == "" || value[0] == ',' {
|
||||
verb^ = r
|
||||
}
|
||||
}
|
||||
return false
|
||||
}
|
||||
|
||||
io.write_string(fi.writer, type_name if len(type_name) != 0 else "bit_field", &fi.n)
|
||||
io.write_string(fi.writer, "{", &fi.n)
|
||||
|
||||
hash := fi.hash; defer fi.hash = hash
|
||||
indent := fi.indent; defer fi.indent -= 1
|
||||
do_trailing_comma := hash
|
||||
|
||||
fi.indent += 1
|
||||
|
||||
if hash {
|
||||
io.write_byte(fi.writer, '\n', &fi.n)
|
||||
}
|
||||
defer {
|
||||
if hash {
|
||||
for _ in 0..<indent { io.write_byte(fi.writer, '\t', &fi.n) }
|
||||
}
|
||||
io.write_byte(fi.writer, '}', &fi.n)
|
||||
}
|
||||
|
||||
|
||||
field_count := -1
|
||||
for name, i in info.names {
|
||||
field_verb := verb
|
||||
if handle_bit_field_tag(v.data, info, i, &field_verb) {
|
||||
continue
|
||||
}
|
||||
|
||||
field_count += 1
|
||||
|
||||
if !do_trailing_comma && field_count > 0 {
|
||||
io.write_string(fi.writer, ", ")
|
||||
}
|
||||
if hash {
|
||||
fmt_write_indent(fi)
|
||||
}
|
||||
|
||||
io.write_string(fi.writer, name, &fi.n)
|
||||
io.write_string(fi.writer, " = ", &fi.n)
|
||||
|
||||
bit_offset := info.bit_offsets[i]
|
||||
bit_size := info.bit_sizes[i]
|
||||
|
||||
value := read_bits(([^]byte)(v.data), bit_offset, bit_size)
|
||||
type := info.types[i]
|
||||
|
||||
if !reflect.is_unsigned(runtime.type_info_core(type)) {
|
||||
// Sign Extension
|
||||
m := u64(1<<(bit_size-1))
|
||||
value = (value ~ m) - m
|
||||
}
|
||||
|
||||
fmt_value(fi, any{&value, type.id}, field_verb)
|
||||
if do_trailing_comma { io.write_string(fi.writer, ",\n", &fi.n) }
|
||||
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
|
||||
// Formats a value based on its type and formatting verb
|
||||
//
|
||||
// Inputs:
|
||||
@@ -2611,6 +2703,9 @@ fmt_value :: proc(fi: ^Info, v: any, verb: rune) {
|
||||
|
||||
case runtime.Type_Info_Matrix:
|
||||
fmt_matrix(fi, v, verb, info)
|
||||
|
||||
case runtime.Type_Info_Bit_Field:
|
||||
fmt_bit_field(fi, v, verb, info, "")
|
||||
}
|
||||
}
|
||||
// Formats a complex number based on the given formatting verb
|
||||
|
||||
@@ -34,7 +34,7 @@ Create_Socket_Error :: enum c.int {
|
||||
|
||||
Dial_Error :: enum c.int {
|
||||
None = 0,
|
||||
Port_Required = -1,
|
||||
Port_Required = -1, // Attempted to dial an endpointing without a port being set.
|
||||
|
||||
Address_In_Use = c.int(os.EADDRINUSE),
|
||||
In_Progress = c.int(os.EINPROGRESS),
|
||||
@@ -54,7 +54,9 @@ Dial_Error :: enum c.int {
|
||||
}
|
||||
|
||||
Bind_Error :: enum c.int {
|
||||
None = 0,
|
||||
None = 0,
|
||||
Privileged_Port_Without_Root = -1, // Attempted to bind to a port less than 1024 without root access.
|
||||
|
||||
Address_In_Use = c.int(os.EADDRINUSE), // Another application is currently bound to this endpoint.
|
||||
Given_Nonlocal_Address = c.int(os.EADDRNOTAVAIL), // The address is not a local address on this machine.
|
||||
Broadcast_Disabled = c.int(os.EACCES), // To bind a UDP socket to the broadcast address, the appropriate socket option must be set.
|
||||
|
||||
@@ -92,13 +92,20 @@ _dial_tcp_from_endpoint :: proc(endpoint: Endpoint, options := default_tcp_optio
|
||||
return
|
||||
}
|
||||
|
||||
// On Darwin, any port below 1024 is 'privileged' - which means that you need root access in order to use it.
|
||||
MAX_PRIVILEGED_PORT :: 1023
|
||||
|
||||
@(private)
|
||||
_bind :: proc(skt: Any_Socket, ep: Endpoint) -> (err: Network_Error) {
|
||||
sockaddr := _endpoint_to_sockaddr(ep)
|
||||
s := any_socket_to_socket(skt)
|
||||
res := os.bind(os.Socket(s), (^os.SOCKADDR)(&sockaddr), i32(sockaddr.len))
|
||||
if res != os.ERROR_NONE {
|
||||
err = Bind_Error(res)
|
||||
if res == os.EACCES && ep.port <= MAX_PRIVILEGED_PORT {
|
||||
err = .Privileged_Port_Without_Root
|
||||
} else {
|
||||
err = Bind_Error(res)
|
||||
}
|
||||
}
|
||||
return
|
||||
}
|
||||
|
||||
@@ -10,8 +10,8 @@ Array :: struct($T: typeid) {
|
||||
String :: distinct Array(byte)
|
||||
|
||||
Version_Type_Major :: 0
|
||||
Version_Type_Minor :: 2
|
||||
Version_Type_Patch :: 4
|
||||
Version_Type_Minor :: 3
|
||||
Version_Type_Patch :: 0
|
||||
|
||||
Version_Type :: struct {
|
||||
major, minor, patch: u8,
|
||||
@@ -110,6 +110,8 @@ Entity_Flag :: enum u32le {
|
||||
Param_No_Alias = 7, // #no_alias
|
||||
Param_Any_Int = 8, // #any_int
|
||||
|
||||
Bit_Field_Field = 19,
|
||||
|
||||
Type_Alias = 20,
|
||||
|
||||
Builtin_Pkg_Builtin = 30,
|
||||
@@ -137,6 +139,7 @@ Entity :: struct {
|
||||
// May be used by (Struct fields and procedure fields):
|
||||
// .Variable
|
||||
// .Constant
|
||||
// This is equal to the negative of the "bit size" it this is a `bit_field`s field
|
||||
field_group_index: i32le,
|
||||
|
||||
// May used by:
|
||||
@@ -187,6 +190,7 @@ Type_Kind :: enum u32le {
|
||||
Multi_Pointer = 22,
|
||||
Matrix = 23,
|
||||
Soa_Pointer = 24,
|
||||
Bit_Field = 25,
|
||||
}
|
||||
|
||||
Type_Elems_Cap :: 4
|
||||
@@ -247,6 +251,7 @@ Type :: struct {
|
||||
// .Multi_Pointer - 1 type: 0=element
|
||||
// .Matrix - 1 type: 0=element
|
||||
// .Soa_Pointer - 1 type: 0=element
|
||||
// .Bit_Field - 1 type: 0=backing type
|
||||
types: Array(Type_Index),
|
||||
|
||||
// Used by:
|
||||
|
||||
@@ -35,6 +35,7 @@ Type_Info_Relative_Pointer :: runtime.Type_Info_Relative_Pointer
|
||||
Type_Info_Relative_Multi_Pointer :: runtime.Type_Info_Relative_Multi_Pointer
|
||||
Type_Info_Matrix :: runtime.Type_Info_Matrix
|
||||
Type_Info_Soa_Pointer :: runtime.Type_Info_Soa_Pointer
|
||||
Type_Info_Bit_Field :: runtime.Type_Info_Bit_Field
|
||||
|
||||
Type_Info_Enum_Value :: runtime.Type_Info_Enum_Value
|
||||
|
||||
@@ -70,6 +71,7 @@ Type_Kind :: enum {
|
||||
Relative_Multi_Pointer,
|
||||
Matrix,
|
||||
Soa_Pointer,
|
||||
Bit_Field,
|
||||
}
|
||||
|
||||
|
||||
@@ -106,6 +108,7 @@ type_kind :: proc(T: typeid) -> Type_Kind {
|
||||
case Type_Info_Relative_Multi_Pointer: return .Relative_Multi_Pointer
|
||||
case Type_Info_Matrix: return .Matrix
|
||||
case Type_Info_Soa_Pointer: return .Soa_Pointer
|
||||
case Type_Info_Bit_Field: return .Bit_Field
|
||||
}
|
||||
|
||||
}
|
||||
@@ -1604,6 +1607,13 @@ equal :: proc(a, b: any, including_indirect_array_recursion := false, recursion_
|
||||
}
|
||||
}
|
||||
return true
|
||||
|
||||
case Type_Info_Bit_Field:
|
||||
x, y := a, b
|
||||
x.id = v.backing_type.id
|
||||
y.id = v.backing_type.id
|
||||
return equal(x, y, including_indirect_array_recursion, recursion_level+0)
|
||||
|
||||
}
|
||||
|
||||
runtime.print_typeid(a.id)
|
||||
|
||||
@@ -174,6 +174,23 @@ are_types_identical :: proc(a, b: ^Type_Info) -> bool {
|
||||
if x.row_count != y.row_count { return false }
|
||||
if x.column_count != y.column_count { return false }
|
||||
return are_types_identical(x.elem, y.elem)
|
||||
|
||||
case Type_Info_Bit_Field:
|
||||
y := b.variant.(Type_Info_Bit_Field) or_return
|
||||
if !are_types_identical(x.backing_type, y.backing_type) { return false }
|
||||
if len(x.names) != len(y.names) { return false }
|
||||
for _, i in x.names {
|
||||
if x.names[i] != y.names[i] {
|
||||
return false
|
||||
}
|
||||
if !are_types_identical(x.types[i], y.types[i]) {
|
||||
return false
|
||||
}
|
||||
if x.bit_sizes[i] != y.bit_sizes[i] {
|
||||
return false
|
||||
}
|
||||
}
|
||||
return true
|
||||
}
|
||||
|
||||
return false
|
||||
@@ -639,6 +656,20 @@ write_type_writer :: proc(w: io.Writer, ti: ^Type_Info, n_written: ^int = nil) -
|
||||
}
|
||||
io.write_byte(w, ']', &n) or_return
|
||||
|
||||
case Type_Info_Bit_Field:
|
||||
io.write_string(w, "bit_field ", &n) or_return
|
||||
write_type(w, info.backing_type, &n) or_return
|
||||
io.write_string(w, " {", &n) or_return
|
||||
for name, i in info.names {
|
||||
if i > 0 { io.write_string(w, ", ", &n) or_return }
|
||||
io.write_string(w, name, &n) or_return
|
||||
io.write_string(w, ": ", &n) or_return
|
||||
write_type(w, info.types[i], &n) or_return
|
||||
io.write_string(w, " | ", &n) or_return
|
||||
io.write_u64(w, u64(info.bit_sizes[i]), 10, &n) or_return
|
||||
}
|
||||
io.write_string(w, "}", &n) or_return
|
||||
|
||||
case Type_Info_Simd_Vector:
|
||||
io.write_string(w, "#simd[", &n) or_return
|
||||
io.write_i64(w, i64(info.count), 10, &n) or_return
|
||||
|
||||
@@ -210,6 +210,7 @@ gb_internal bool is_type_distinct(Ast *node) {
|
||||
case Ast_UnionType:
|
||||
case Ast_EnumType:
|
||||
case Ast_ProcType:
|
||||
case Ast_BitFieldType:
|
||||
return true;
|
||||
|
||||
case Ast_PointerType:
|
||||
|
||||
+160
-29
@@ -100,7 +100,7 @@ gb_internal void check_union_type (CheckerContext *c, Type *un
|
||||
gb_internal Type * check_init_variable (CheckerContext *c, Entity *e, Operand *operand, String context_name);
|
||||
|
||||
|
||||
gb_internal void check_assignment_error_suggestion(CheckerContext *c, Operand *o, Type *type);
|
||||
gb_internal void check_assignment_error_suggestion(CheckerContext *c, Operand *o, Type *type, i64 max_bit_size=0);
|
||||
gb_internal void add_map_key_type_dependencies(CheckerContext *ctx, Type *key);
|
||||
|
||||
gb_internal Type *make_soa_struct_slice(CheckerContext *ctx, Ast *array_typ_expr, Ast *elem_expr, Type *elem);
|
||||
@@ -1886,33 +1886,55 @@ gb_internal bool check_representable_as_constant(CheckerContext *c, ExactValue i
|
||||
|
||||
BigInt i = v.value_integer;
|
||||
|
||||
i64 bit_size = type_size_of(type);
|
||||
i64 byte_size = type_size_of(type);
|
||||
BigInt umax = {};
|
||||
BigInt imin = {};
|
||||
BigInt imax = {};
|
||||
|
||||
if (bit_size < 16) {
|
||||
big_int_from_u64(&umax, unsigned_integer_maxs[bit_size]);
|
||||
big_int_from_i64(&imin, signed_integer_mins[bit_size]);
|
||||
big_int_from_i64(&imax, signed_integer_maxs[bit_size]);
|
||||
} else {
|
||||
if (c->bit_field_bit_size > 0) {
|
||||
i64 bit_size = gb_min(cast(i64)(8*byte_size), cast(i64)c->bit_field_bit_size);
|
||||
|
||||
big_int_from_u64(&umax, 1);
|
||||
big_int_from_i64(&imin, 1);
|
||||
big_int_from_i64(&imax, 1);
|
||||
|
||||
BigInt bi128 = {};
|
||||
BigInt bi127 = {};
|
||||
big_int_from_i64(&bi128, 128);
|
||||
big_int_from_i64(&bi127, 127);
|
||||
BigInt bu = {};
|
||||
BigInt bi = {};
|
||||
big_int_from_i64(&bu, bit_size);
|
||||
big_int_from_i64(&bi, bit_size-1);
|
||||
|
||||
big_int_shl_eq(&umax, &bi128);
|
||||
big_int_shl_eq(&umax, &bu);
|
||||
mp_decr(&umax);
|
||||
|
||||
big_int_shl_eq(&imin, &bi127);
|
||||
big_int_shl_eq(&imin, &bi);
|
||||
big_int_neg(&imin, &imin);
|
||||
|
||||
big_int_shl_eq(&imax, &bi127);
|
||||
big_int_shl_eq(&imax, &bi);
|
||||
mp_decr(&imax);
|
||||
} else {
|
||||
if (byte_size < 16) {
|
||||
big_int_from_u64(&umax, unsigned_integer_maxs[byte_size]);
|
||||
big_int_from_i64(&imin, signed_integer_mins[byte_size]);
|
||||
big_int_from_i64(&imax, signed_integer_maxs[byte_size]);
|
||||
} else {
|
||||
big_int_from_u64(&umax, 1);
|
||||
big_int_from_i64(&imin, 1);
|
||||
big_int_from_i64(&imax, 1);
|
||||
|
||||
BigInt bi128 = {};
|
||||
BigInt bi127 = {};
|
||||
big_int_from_i64(&bi128, 128);
|
||||
big_int_from_i64(&bi127, 127);
|
||||
|
||||
big_int_shl_eq(&umax, &bi128);
|
||||
mp_decr(&umax);
|
||||
|
||||
big_int_shl_eq(&imin, &bi127);
|
||||
big_int_neg(&imin, &imin);
|
||||
|
||||
big_int_shl_eq(&imax, &bi127);
|
||||
mp_decr(&imax);
|
||||
}
|
||||
}
|
||||
|
||||
switch (type->Basic.kind) {
|
||||
@@ -2071,11 +2093,17 @@ gb_internal bool check_representable_as_constant(CheckerContext *c, ExactValue i
|
||||
}
|
||||
|
||||
|
||||
gb_internal bool check_integer_exceed_suggestion(CheckerContext *c, Operand *o, Type *type) {
|
||||
gb_internal bool check_integer_exceed_suggestion(CheckerContext *c, Operand *o, Type *type, i64 max_bit_size=0) {
|
||||
if (is_type_integer(type) && o->value.kind == ExactValue_Integer) {
|
||||
gbString b = type_to_string(type);
|
||||
|
||||
i64 sz = type_size_of(type);
|
||||
i64 bit_size = 8*sz;
|
||||
bool size_changed = false;
|
||||
if (max_bit_size > 0) {
|
||||
size_changed = (bit_size != max_bit_size);
|
||||
bit_size = gb_min(bit_size, max_bit_size);
|
||||
}
|
||||
BigInt *bi = &o->value.value_integer;
|
||||
if (is_type_unsigned(type)) {
|
||||
if (big_int_is_neg(bi)) {
|
||||
@@ -2083,25 +2111,36 @@ gb_internal bool check_integer_exceed_suggestion(CheckerContext *c, Operand *o,
|
||||
} else {
|
||||
BigInt one = big_int_make_u64(1);
|
||||
BigInt max_size = big_int_make_u64(1);
|
||||
BigInt bits = big_int_make_i64(8*sz);
|
||||
BigInt bits = big_int_make_i64(bit_size);
|
||||
big_int_shl_eq(&max_size, &bits);
|
||||
big_int_sub_eq(&max_size, &one);
|
||||
String max_size_str = big_int_to_string(temporary_allocator(), &max_size);
|
||||
error_line("\tThe maximum value that can be represented by '%s' is '%.*s'\n", b, LIT(max_size_str));
|
||||
|
||||
if (size_changed) {
|
||||
error_line("\tThe maximum value that can be represented with that bit_field's field of '%s | %u' is '%.*s'\n", b, bit_size, LIT(max_size_str));
|
||||
} else {
|
||||
error_line("\tThe maximum value that can be represented by '%s' is '%.*s'\n", b, LIT(max_size_str));
|
||||
}
|
||||
}
|
||||
} else {
|
||||
BigInt zero = big_int_make_u64(0);
|
||||
BigInt one = big_int_make_u64(1);
|
||||
BigInt max_size = big_int_make_u64(1);
|
||||
BigInt bits = big_int_make_i64(8*sz - 1);
|
||||
BigInt bits = big_int_make_i64(bit_size - 1);
|
||||
big_int_shl_eq(&max_size, &bits);
|
||||
|
||||
String max_size_str = {};
|
||||
if (big_int_is_neg(bi)) {
|
||||
big_int_neg(&max_size, &max_size);
|
||||
String max_size_str = big_int_to_string(temporary_allocator(), &max_size);
|
||||
error_line("\tThe minimum value that can be represented by '%s' is '%.*s'\n", b, LIT(max_size_str));
|
||||
max_size_str = big_int_to_string(temporary_allocator(), &max_size);
|
||||
} else {
|
||||
big_int_sub_eq(&max_size, &one);
|
||||
String max_size_str = big_int_to_string(temporary_allocator(), &max_size);
|
||||
max_size_str = big_int_to_string(temporary_allocator(), &max_size);
|
||||
}
|
||||
|
||||
if (size_changed) {
|
||||
error_line("\tThe maximum value that can be represented with that bit_field's field of '%s | %u' is '%.*s'\n", b, bit_size, LIT(max_size_str));
|
||||
} else {
|
||||
error_line("\tThe maximum value that can be represented by '%s' is '%.*s'\n", b, LIT(max_size_str));
|
||||
}
|
||||
}
|
||||
@@ -2112,7 +2151,7 @@ gb_internal bool check_integer_exceed_suggestion(CheckerContext *c, Operand *o,
|
||||
}
|
||||
return false;
|
||||
}
|
||||
gb_internal void check_assignment_error_suggestion(CheckerContext *c, Operand *o, Type *type) {
|
||||
gb_internal void check_assignment_error_suggestion(CheckerContext *c, Operand *o, Type *type, i64 max_bit_size) {
|
||||
gbString a = expr_to_string(o->expr);
|
||||
gbString b = type_to_string(type);
|
||||
defer(
|
||||
@@ -2143,7 +2182,7 @@ gb_internal void check_assignment_error_suggestion(CheckerContext *c, Operand *o
|
||||
error_line("\t whereas slices in general are assumed to be mutable.\n");
|
||||
} else if (is_type_u8_slice(src) && are_types_identical(dst, t_string) && o->mode != Addressing_Constant) {
|
||||
error_line("\tSuggestion: the expression may be casted to %s\n", b);
|
||||
} else if (check_integer_exceed_suggestion(c, o, type)) {
|
||||
} else if (check_integer_exceed_suggestion(c, o, type, max_bit_size)) {
|
||||
return;
|
||||
}
|
||||
}
|
||||
@@ -2217,13 +2256,18 @@ gb_internal bool check_is_expressible(CheckerContext *ctx, Operand *o, Type *typ
|
||||
if (!is_type_integer(o->type) && is_type_integer(type)) {
|
||||
error(o->expr, "'%s' truncated to '%s', got %s", a, b, s);
|
||||
} else {
|
||||
i64 max_bit_size = 0;
|
||||
if (ctx->bit_field_bit_size) {
|
||||
max_bit_size = ctx->bit_field_bit_size;
|
||||
}
|
||||
|
||||
if (are_types_identical(o->type, type)) {
|
||||
error(o->expr, "Numeric value '%s' from '%s' cannot be represented by '%s'", s, a, b);
|
||||
} else {
|
||||
error(o->expr, "Cannot convert numeric value '%s' from '%s' to '%s' from '%s'", s, a, b, c);
|
||||
}
|
||||
|
||||
check_assignment_error_suggestion(ctx, o, type);
|
||||
check_assignment_error_suggestion(ctx, o, type, max_bit_size);
|
||||
}
|
||||
} else {
|
||||
error(o->expr, "Cannot convert '%s' to '%s' from '%s', got %s", a, b, c, s);
|
||||
@@ -2234,6 +2278,11 @@ gb_internal bool check_is_expressible(CheckerContext *ctx, Operand *o, Type *typ
|
||||
}
|
||||
|
||||
gb_internal bool check_is_not_addressable(CheckerContext *c, Operand *o) {
|
||||
if (o->expr && o->expr->kind == Ast_SelectorExpr) {
|
||||
if (o->expr->SelectorExpr.is_bit_field) {
|
||||
return true;
|
||||
}
|
||||
}
|
||||
if (o->mode == Addressing_OptionalOk) {
|
||||
Ast *expr = unselector_expr(o->expr);
|
||||
if (expr->kind != Ast_TypeAssertion) {
|
||||
@@ -2306,6 +2355,8 @@ gb_internal void check_unary_expr(CheckerContext *c, Operand *o, Token op, Ast *
|
||||
Entity *e = entity_of_node(ue->expr);
|
||||
if (e != nullptr && (e->flags & EntityFlag_Param) != 0) {
|
||||
error(op, "Cannot take the pointer address of '%s' which is a procedure parameter", str);
|
||||
} else if (e != nullptr && (e->flags & EntityFlag_BitFieldField) != 0) {
|
||||
error(op, "Cannot take the pointer address of '%s' which is a bit_field's field", str);
|
||||
} else {
|
||||
switch (o->mode) {
|
||||
case Addressing_Constant:
|
||||
@@ -2879,6 +2930,13 @@ gb_internal bool check_is_castable_to(CheckerContext *c, Operand *operand, Type
|
||||
}
|
||||
}
|
||||
|
||||
if (is_type_bit_field(src)) {
|
||||
return are_types_identical(core_type(src->BitField.backing_type), dst);
|
||||
}
|
||||
if (is_type_bit_field(dst)) {
|
||||
return are_types_identical(src, core_type(dst->BitField.backing_type));
|
||||
}
|
||||
|
||||
if (is_type_integer(src) && is_type_rune(dst)) {
|
||||
return true;
|
||||
}
|
||||
@@ -5067,6 +5125,11 @@ gb_internal Entity *check_selector(CheckerContext *c, Operand *operand, Ast *nod
|
||||
operand->type = entity->type;
|
||||
operand->expr = node;
|
||||
|
||||
if (entity->flags & EntityFlag_BitFieldField) {
|
||||
add_package_dependency(c, "runtime", "__write_bits");
|
||||
add_package_dependency(c, "runtime", "__read_bits");
|
||||
}
|
||||
|
||||
switch (entity->kind) {
|
||||
case Entity_Constant:
|
||||
operand->value = entity->Constant.value;
|
||||
@@ -5080,6 +5143,9 @@ gb_internal Entity *check_selector(CheckerContext *c, Operand *operand, Ast *nod
|
||||
}
|
||||
break;
|
||||
case Entity_Variable:
|
||||
if (sel.is_bit_field) {
|
||||
se->is_bit_field = true;
|
||||
}
|
||||
if (sel.indirect) {
|
||||
operand->mode = Addressing_Variable;
|
||||
} else if (operand->mode == Addressing_Context) {
|
||||
@@ -8396,6 +8462,11 @@ gb_internal void check_compound_literal_field_values(CheckerContext *c, Slice<As
|
||||
StringMap<String> fields_visited_through_raw_union = {};
|
||||
defer (string_map_destroy(&fields_visited_through_raw_union));
|
||||
|
||||
String assignment_str = str_lit("structure literal");
|
||||
if (bt->kind == Type_BitField) {
|
||||
assignment_str = str_lit("bit_field literal");
|
||||
}
|
||||
|
||||
for (Ast *elem : elems) {
|
||||
if (elem->kind != Ast_FieldValue) {
|
||||
error(elem, "Mixture of 'field = value' and value elements in a literal is not allowed");
|
||||
@@ -8417,17 +8488,26 @@ gb_internal void check_compound_literal_field_values(CheckerContext *c, Slice<As
|
||||
continue;
|
||||
}
|
||||
|
||||
Entity *field = bt->Struct.fields[sel.index[0]];
|
||||
Entity *field = nullptr;
|
||||
if (bt->kind == Type_Struct) {
|
||||
field = bt->Struct.fields[sel.index[0]];
|
||||
} else if (bt->kind == Type_BitField) {
|
||||
field = bt->BitField.fields[sel.index[0]];
|
||||
} else {
|
||||
GB_PANIC("Unknown type");
|
||||
}
|
||||
|
||||
|
||||
add_entity_use(c, fv->field, field);
|
||||
if (string_set_update(&fields_visited, name)) {
|
||||
if (sel.index.count > 1) {
|
||||
if (String *found = string_map_get(&fields_visited_through_raw_union, sel.entity->token.string)) {
|
||||
error(fv->field, "Field '%.*s' is already initialized due to a previously assigned struct #raw_union field '%.*s'", LIT(sel.entity->token.string), LIT(*found));
|
||||
} else {
|
||||
error(fv->field, "Duplicate or reused field '%.*s' in structure literal", LIT(sel.entity->token.string));
|
||||
error(fv->field, "Duplicate or reused field '%.*s' in %.*s", LIT(sel.entity->token.string), LIT(assignment_str));
|
||||
}
|
||||
} else {
|
||||
error(fv->field, "Duplicate field '%.*s' in structure literal", LIT(field->token.string));
|
||||
error(fv->field, "Duplicate field '%.*s' in %.*s", LIT(field->token.string), LIT(assignment_str));
|
||||
}
|
||||
continue;
|
||||
} else if (String *found = string_map_get(&fields_visited_through_raw_union, sel.entity->token.string)) {
|
||||
@@ -8435,11 +8515,13 @@ gb_internal void check_compound_literal_field_values(CheckerContext *c, Slice<As
|
||||
continue;
|
||||
}
|
||||
if (sel.indirect) {
|
||||
error(fv->field, "Cannot assign to the %d-nested anonymous indirect field '%.*s' in a structure literal", cast(int)sel.index.count-1, LIT(name));
|
||||
error(fv->field, "Cannot assign to the %d-nested anonymous indirect field '%.*s' in a %.*s", cast(int)sel.index.count-1, LIT(name), LIT(assignment_str));
|
||||
continue;
|
||||
}
|
||||
|
||||
if (sel.index.count > 1) {
|
||||
GB_ASSERT(bt->kind == Type_Struct);
|
||||
|
||||
if (is_constant) {
|
||||
Type *ft = type;
|
||||
for (i32 index : sel.index) {
|
||||
@@ -8500,7 +8582,15 @@ gb_internal void check_compound_literal_field_values(CheckerContext *c, Slice<As
|
||||
is_constant = check_is_operand_compound_lit_constant(c, &o);
|
||||
}
|
||||
|
||||
check_assignment(c, &o, field->type, str_lit("structure literal"));
|
||||
u8 prev_bit_field_bit_size = c->bit_field_bit_size;
|
||||
if (field->kind == Entity_Variable && field->Variable.bit_field_bit_size) {
|
||||
// HACK NOTE(bill): This is a bit of a hack, but it will work fine for this use case
|
||||
c->bit_field_bit_size = field->Variable.bit_field_bit_size;
|
||||
}
|
||||
|
||||
check_assignment(c, &o, field->type, assignment_str);
|
||||
|
||||
c->bit_field_bit_size = prev_bit_field_bit_size;
|
||||
}
|
||||
}
|
||||
|
||||
@@ -9302,6 +9392,21 @@ gb_internal ExprKind check_compound_literal(CheckerContext *c, Operand *o, Ast *
|
||||
}
|
||||
break;
|
||||
}
|
||||
case Type_BitField: {
|
||||
if (cl->elems.count == 0) {
|
||||
break; // NOTE(bill): No need to init
|
||||
}
|
||||
is_constant = false;
|
||||
if (cl->elems[0]->kind != Ast_FieldValue) {
|
||||
gbString type_str = type_to_string(type);
|
||||
error(node, "%s ('bit_field') compound literals are only allowed to contain 'field = value' elements", type_str);
|
||||
gb_string_free(type_str);
|
||||
} else {
|
||||
check_compound_literal_field_values(c, cl->elems, o, type, is_constant);
|
||||
}
|
||||
break;
|
||||
}
|
||||
|
||||
|
||||
default: {
|
||||
if (cl->elems.count == 0) {
|
||||
@@ -11115,6 +11220,32 @@ gb_internal gbString write_expr_to_string(gbString str, Ast *node, bool shorthan
|
||||
case_end;
|
||||
|
||||
|
||||
case_ast_node(f, BitFieldField, node);
|
||||
str = write_expr_to_string(str, f->name, shorthand);
|
||||
str = gb_string_appendc(str, ": ");
|
||||
str = write_expr_to_string(str, f->type, shorthand);
|
||||
str = gb_string_appendc(str, " | ");
|
||||
str = write_expr_to_string(str, f->bit_size, shorthand);
|
||||
case_end;
|
||||
case_ast_node(bf, BitFieldType, node);
|
||||
str = gb_string_appendc(str, "bit_field ");
|
||||
if (!shorthand) {
|
||||
str = write_expr_to_string(str, bf->backing_type, shorthand);
|
||||
}
|
||||
str = gb_string_appendc(str, " {");
|
||||
if (shorthand) {
|
||||
str = gb_string_appendc(str, "...");
|
||||
} else {
|
||||
for_array(i, bf->fields) {
|
||||
if (i > 0) {
|
||||
str = gb_string_appendc(str, ", ");
|
||||
}
|
||||
str = write_expr_to_string(str, bf->fields[i], false);
|
||||
}
|
||||
}
|
||||
str = gb_string_appendc(str, "}");
|
||||
case_end;
|
||||
|
||||
case_ast_node(ia, InlineAsmExpr, node);
|
||||
str = gb_string_appendc(str, "asm(");
|
||||
for_array(i, ia->param_types) {
|
||||
|
||||
@@ -485,7 +485,17 @@ gb_internal Type *check_assignment_variable(CheckerContext *ctx, Operand *lhs, O
|
||||
}
|
||||
}
|
||||
|
||||
Entity *lhs_e = entity_of_node(lhs->expr);
|
||||
u8 prev_bit_field_bit_size = ctx->bit_field_bit_size;
|
||||
if (lhs_e && lhs_e->kind == Entity_Variable && lhs_e->Variable.bit_field_bit_size) {
|
||||
// HACK NOTE(bill): This is a bit of a hack, but it will work fine for this use case
|
||||
ctx->bit_field_bit_size = lhs_e->Variable.bit_field_bit_size;
|
||||
}
|
||||
|
||||
check_assignment(ctx, rhs, assignment_type, str_lit("assignment"));
|
||||
|
||||
ctx->bit_field_bit_size = prev_bit_field_bit_size;
|
||||
|
||||
if (rhs->mode == Addressing_Invalid) {
|
||||
return nullptr;
|
||||
}
|
||||
|
||||
@@ -89,6 +89,8 @@ gb_internal bool does_field_type_allow_using(Type *t) {
|
||||
return true;
|
||||
} else if (is_type_array(t)) {
|
||||
return t->Array.count <= 4;
|
||||
} else if (is_type_bit_field(t)) {
|
||||
return true;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
@@ -925,6 +927,202 @@ gb_internal void check_enum_type(CheckerContext *ctx, Type *enum_type, Type *nam
|
||||
enum_type->Enum.max_value_index = max_value_index;
|
||||
}
|
||||
|
||||
gb_internal bool is_valid_bit_field_backing_type(Type *type) {
|
||||
if (type == nullptr) {
|
||||
return false;
|
||||
}
|
||||
type = base_type(type);
|
||||
if (is_type_untyped(type)) {
|
||||
return false;
|
||||
}
|
||||
if (is_type_integer(type)) {
|
||||
return true;
|
||||
}
|
||||
if (type->kind == Type_Array) {
|
||||
return is_type_integer(type->Array.elem);
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
gb_internal void check_bit_field_type(CheckerContext *ctx, Type *bit_field_type, Type *named_type, Ast *node) {
|
||||
ast_node(bf, BitFieldType, node);
|
||||
GB_ASSERT(is_type_bit_field(bit_field_type));
|
||||
|
||||
Type *backing_type = check_type(ctx, bf->backing_type);
|
||||
if (backing_type == nullptr || !is_valid_bit_field_backing_type(backing_type)) {
|
||||
error(node, "Backing type for a bit_field must be an integer or an array of an integer");
|
||||
return;
|
||||
}
|
||||
|
||||
bit_field_type->BitField.backing_type = backing_type;
|
||||
bit_field_type->BitField.scope = ctx->scope;
|
||||
|
||||
auto fields = array_make<Entity *>(permanent_allocator(), 0, bf->fields.count);
|
||||
auto bit_sizes = array_make<u8> (permanent_allocator(), 0, bf->fields.count);
|
||||
auto tags = array_make<String> (permanent_allocator(), 0, bf->fields.count);
|
||||
|
||||
u64 maximum_bit_size = 8 * type_size_of(backing_type);
|
||||
u64 total_bit_size = 0;
|
||||
|
||||
for_array(i, bf->fields) {
|
||||
i32 field_src_index = cast(i32)i;
|
||||
Ast *field = bf->fields[i];
|
||||
if (field->kind != Ast_BitFieldField) {
|
||||
error(field, "Invalid AST for a bit_field");
|
||||
continue;
|
||||
}
|
||||
ast_node(f, BitFieldField, field);
|
||||
if (f->name == nullptr || f->name->kind != Ast_Ident) {
|
||||
error(field, "A bit_field's field name must be an identifier");
|
||||
continue;
|
||||
}
|
||||
CommentGroup *docs = f->docs;
|
||||
CommentGroup *comment = f->comment;
|
||||
|
||||
String name = f->name->Ident.token.string;
|
||||
|
||||
if (f->type == nullptr) {
|
||||
error(field, "A bit_field's field must have a type");
|
||||
continue;
|
||||
}
|
||||
|
||||
Type *type = check_type(ctx, f->type);
|
||||
if (type_size_of(type) > 8) {
|
||||
error(f->type, "The type of a bit_field's field must be <= 8 bytes, got %lld", cast(long long)type_size_of(type));
|
||||
}
|
||||
|
||||
if (is_type_untyped(type)) {
|
||||
gbString s = type_to_string(type);
|
||||
error(f->type, "The type of a bit_field's field must be a typed integer, enum, or boolean, got %s", s);
|
||||
gb_string_free(s);
|
||||
} else if (!(is_type_integer(type) || is_type_enum(type) || is_type_boolean(type))) {
|
||||
gbString s = type_to_string(type);
|
||||
error(f->type, "The type of a bit_field's field must be an integer, enum, or boolean, got %s", s);
|
||||
gb_string_free(s);
|
||||
}
|
||||
|
||||
if (f->bit_size == nullptr) {
|
||||
error(field, "A bit_field's field must have a specified bit size");
|
||||
continue;
|
||||
}
|
||||
|
||||
|
||||
Operand o = {};
|
||||
check_expr(ctx, &o, f->bit_size);
|
||||
if (o.mode != Addressing_Constant) {
|
||||
error(f->bit_size, "A bit_field's specified bit size must be a constant");
|
||||
o.mode = Addressing_Invalid;
|
||||
}
|
||||
if (o.value.kind == ExactValue_Float) {
|
||||
o.value = exact_value_to_integer(o.value);
|
||||
}
|
||||
if (f->bit_size->kind == Ast_BinaryExpr && f->bit_size->BinaryExpr.op.kind == Token_Or) {
|
||||
gbString s = expr_to_string(f->bit_size);
|
||||
error(f->bit_size, "Wrap the expression in parentheses, e.g. (%s)", s);
|
||||
gb_string_free(s);
|
||||
}
|
||||
|
||||
ExactValue bit_size = o.value;
|
||||
|
||||
if (bit_size.kind != ExactValue_Integer) {
|
||||
gbString s = expr_to_string(f->bit_size);
|
||||
error(f->bit_size, "Expected an integer constant value for the specified bit size, got %s", s);
|
||||
gb_string_free(s);
|
||||
}
|
||||
|
||||
if (scope_lookup_current(ctx->scope, name) != nullptr) {
|
||||
error(f->name, "'%.*s' is already declared in this bit_field", LIT(name));
|
||||
} else {
|
||||
i64 bit_size_i64 = exact_value_to_i64(bit_size);
|
||||
u8 bit_size_u8 = 0;
|
||||
if (bit_size_i64 <= 0) {
|
||||
error(f->bit_size, "A bit_field's specified bit size cannot be <= 0, got %lld", cast(long long)bit_size_i64);
|
||||
bit_size_i64 = 1;
|
||||
}
|
||||
if (bit_size_i64 > 64) {
|
||||
error(f->bit_size, "A bit_field's specified bit size cannot exceed 64 bits, got %lld", cast(long long)bit_size_i64);
|
||||
bit_size_i64 = 64;
|
||||
}
|
||||
i64 sz = 8*type_size_of(type);
|
||||
if (bit_size_i64 > sz) {
|
||||
error(f->bit_size, "A bit_field's specified bit size cannot exceed its type, got %lld, expect <=%lld", cast(long long)bit_size_i64, cast(long long)sz);
|
||||
bit_size_i64 = sz;
|
||||
}
|
||||
|
||||
bit_size_u8 = cast(u8)bit_size_i64;
|
||||
|
||||
Entity *e = alloc_entity_field(ctx->scope, f->name->Ident.token, type, false, field_src_index);
|
||||
e->Variable.docs = docs;
|
||||
e->Variable.comment = comment;
|
||||
e->Variable.bit_field_bit_size = bit_size_u8;
|
||||
e->flags |= EntityFlag_BitFieldField;
|
||||
|
||||
add_entity(ctx, ctx->scope, nullptr, e);
|
||||
array_add(&fields, e);
|
||||
array_add(&bit_sizes, bit_size_u8);
|
||||
|
||||
String tag = f->tag.string;
|
||||
if (tag.len != 0 && !unquote_string(permanent_allocator(), &tag, 0, tag.text[0] == '`')) {
|
||||
error(f->tag, "Invalid string literal");
|
||||
tag = {};
|
||||
}
|
||||
array_add(&tags, tag);
|
||||
|
||||
add_entity_use(ctx, field, e);
|
||||
}
|
||||
}
|
||||
|
||||
GB_ASSERT(fields.count <= bf->fields.count);
|
||||
|
||||
auto bit_offsets = slice_make<i64>(permanent_allocator(), fields.count);
|
||||
i64 curr_offset = 0;
|
||||
for_array(i, bit_sizes) {
|
||||
bit_offsets[i] = curr_offset;
|
||||
curr_offset += cast(i64)bit_sizes[i];
|
||||
}
|
||||
|
||||
if (total_bit_size > maximum_bit_size) {
|
||||
gbString s = type_to_string(backing_type);
|
||||
error(node, "The numbers required %llu exceeds the backing type's (%s) bit size %llu",
|
||||
cast(unsigned long long)total_bit_size,
|
||||
s,
|
||||
cast(unsigned long long)maximum_bit_size);
|
||||
gb_string_free(s);
|
||||
}
|
||||
|
||||
if (bit_sizes.count > 0 && is_type_integer(backing_type)) {
|
||||
bool all_booleans = is_type_boolean(fields[0]->type);
|
||||
bool all_ones = bit_sizes[0] == 1;
|
||||
if (all_ones && all_booleans) {
|
||||
for_array(i, bit_sizes) {
|
||||
all_ones = bit_sizes[i] == 1;
|
||||
if (!all_ones) {
|
||||
break;
|
||||
}
|
||||
all_booleans = is_type_boolean(fields[i]->type);
|
||||
if (!all_booleans) {
|
||||
break;
|
||||
}
|
||||
}
|
||||
if (all_ones && all_booleans) {
|
||||
if (build_context.vet_flags & VetFlag_Style) {
|
||||
char const *msg = "This 'bit_field' is better expressed as a 'bit_set' since all of the fields are booleans, of 1-bit in size, and the backing type is an integer (-vet-style)";
|
||||
error(node, msg);
|
||||
} else {
|
||||
char const *msg = "This 'bit_field' might be better expressed as a 'bit_set' since all of the fields are booleans, of 1-bit in size, and the backing type is an integer";
|
||||
warning(node, msg);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
bit_field_type->BitField.fields = slice_from_array(fields);
|
||||
bit_field_type->BitField.bit_sizes = slice_from_array(bit_sizes);
|
||||
bit_field_type->BitField.bit_offsets = bit_offsets;
|
||||
bit_field_type->BitField.tags = tags.data;
|
||||
}
|
||||
|
||||
gb_internal bool is_type_valid_bit_set_range(Type *t) {
|
||||
if (is_type_integer(t)) {
|
||||
return true;
|
||||
@@ -3051,6 +3249,20 @@ gb_internal bool check_type_internal(CheckerContext *ctx, Ast *e, Type **type, T
|
||||
return true;
|
||||
case_end;
|
||||
|
||||
case_ast_node(bf, BitFieldType, e);
|
||||
bool ips = ctx->in_polymorphic_specialization;
|
||||
defer (ctx->in_polymorphic_specialization = ips);
|
||||
ctx->in_polymorphic_specialization = false;
|
||||
|
||||
*type = alloc_type_bit_field();
|
||||
set_base_type(named_type, *type);
|
||||
check_open_scope(ctx, e);
|
||||
check_bit_field_type(ctx, *type, named_type, e);
|
||||
check_close_scope(ctx);
|
||||
(*type)->BitField.node = e;
|
||||
return true;
|
||||
case_end;
|
||||
|
||||
|
||||
case_ast_node(pt, ProcType, e);
|
||||
bool ips = ctx->in_polymorphic_specialization;
|
||||
|
||||
@@ -313,6 +313,7 @@ gb_internal void add_scope(CheckerContext *c, Ast *node, Scope *scope) {
|
||||
case Ast_StructType: node->StructType.scope = scope; break;
|
||||
case Ast_UnionType: node->UnionType.scope = scope; break;
|
||||
case Ast_EnumType: node->EnumType.scope = scope; break;
|
||||
case Ast_BitFieldType: node->BitFieldType.scope = scope; break;
|
||||
default: GB_PANIC("Invalid node for add_scope: %.*s", LIT(ast_strings[node->kind]));
|
||||
}
|
||||
}
|
||||
@@ -334,6 +335,7 @@ gb_internal Scope *scope_of_node(Ast *node) {
|
||||
case Ast_StructType: return node->StructType.scope;
|
||||
case Ast_UnionType: return node->UnionType.scope;
|
||||
case Ast_EnumType: return node->EnumType.scope;
|
||||
case Ast_BitFieldType: return node->BitFieldType.scope;
|
||||
}
|
||||
GB_PANIC("Invalid node for add_scope: %.*s", LIT(ast_strings[node->kind]));
|
||||
return nullptr;
|
||||
@@ -355,6 +357,7 @@ gb_internal void check_open_scope(CheckerContext *c, Ast *node) {
|
||||
case Ast_EnumType:
|
||||
case Ast_UnionType:
|
||||
case Ast_BitSetType:
|
||||
case Ast_BitFieldType:
|
||||
scope->flags |= ScopeFlag_Type;
|
||||
break;
|
||||
}
|
||||
@@ -2060,6 +2063,12 @@ gb_internal void add_type_info_type_internal(CheckerContext *c, Type *t) {
|
||||
add_type_info_type_internal(c, bt->SoaPointer.elem);
|
||||
break;
|
||||
|
||||
case Type_BitField:
|
||||
add_type_info_type_internal(c, bt->BitField.backing_type);
|
||||
for (Entity *f : bt->BitField.fields) {
|
||||
add_type_info_type_internal(c, f->type);
|
||||
}
|
||||
break;
|
||||
|
||||
case Type_Generic:
|
||||
break;
|
||||
@@ -2309,6 +2318,13 @@ gb_internal void add_min_dep_type_info(Checker *c, Type *t) {
|
||||
add_min_dep_type_info(c, bt->SoaPointer.elem);
|
||||
break;
|
||||
|
||||
case Type_BitField:
|
||||
add_min_dep_type_info(c, bt->BitField.backing_type);
|
||||
for (Entity *f : bt->BitField.fields) {
|
||||
add_min_dep_type_info(c, f->type);
|
||||
}
|
||||
break;
|
||||
|
||||
default:
|
||||
GB_PANIC("Unhandled type: %*.s", LIT(type_strings[bt->kind]));
|
||||
break;
|
||||
@@ -2907,6 +2923,7 @@ gb_internal void init_core_type_info(Checker *c) {
|
||||
t_type_info_relative_multi_pointer = find_core_type(c, str_lit("Type_Info_Relative_Multi_Pointer"));
|
||||
t_type_info_matrix = find_core_type(c, str_lit("Type_Info_Matrix"));
|
||||
t_type_info_soa_pointer = find_core_type(c, str_lit("Type_Info_Soa_Pointer"));
|
||||
t_type_info_bit_field = find_core_type(c, str_lit("Type_Info_Bit_Field"));
|
||||
|
||||
t_type_info_named_ptr = alloc_type_pointer(t_type_info_named);
|
||||
t_type_info_integer_ptr = alloc_type_pointer(t_type_info_integer);
|
||||
@@ -2936,6 +2953,7 @@ gb_internal void init_core_type_info(Checker *c) {
|
||||
t_type_info_relative_multi_pointer_ptr = alloc_type_pointer(t_type_info_relative_multi_pointer);
|
||||
t_type_info_matrix_ptr = alloc_type_pointer(t_type_info_matrix);
|
||||
t_type_info_soa_pointer_ptr = alloc_type_pointer(t_type_info_soa_pointer);
|
||||
t_type_info_bit_field_ptr = alloc_type_pointer(t_type_info_bit_field);
|
||||
}
|
||||
|
||||
gb_internal void init_mem_allocator(Checker *c) {
|
||||
|
||||
@@ -475,6 +475,7 @@ struct CheckerContext {
|
||||
bool hide_polymorphic_errors;
|
||||
bool in_polymorphic_specialization;
|
||||
bool allow_arrow_right_selector_expr;
|
||||
u8 bit_field_bit_size;
|
||||
Scope * polymorphic_scope;
|
||||
|
||||
Ast *assignment_lhs_hint;
|
||||
|
||||
+6
-3
@@ -14,8 +14,8 @@ struct OdinDocVersionType {
|
||||
};
|
||||
|
||||
#define OdinDocVersionType_Major 0
|
||||
#define OdinDocVersionType_Minor 2
|
||||
#define OdinDocVersionType_Patch 4
|
||||
#define OdinDocVersionType_Minor 3
|
||||
#define OdinDocVersionType_Patch 0
|
||||
|
||||
struct OdinDocHeaderBase {
|
||||
u8 magic[8];
|
||||
@@ -84,6 +84,7 @@ enum OdinDocTypeKind : u32 {
|
||||
OdinDocType_MultiPointer = 22,
|
||||
OdinDocType_Matrix = 23,
|
||||
OdinDocType_SoaPointer = 24,
|
||||
OdinDocType_BitField = 25,
|
||||
};
|
||||
|
||||
enum OdinDocTypeFlag_Basic : u32 {
|
||||
@@ -170,6 +171,8 @@ enum OdinDocEntityFlag : u64 {
|
||||
OdinDocEntityFlag_Param_NoAlias = 1ull<<7,
|
||||
OdinDocEntityFlag_Param_AnyInt = 1ull<<8,
|
||||
|
||||
OdinDocEntityFlag_BitField_Field = 1ull<<19,
|
||||
|
||||
OdinDocEntityFlag_Type_Alias = 1ull<<20,
|
||||
|
||||
OdinDocEntityFlag_Builtin_Pkg_Builtin = 1ull<<30,
|
||||
@@ -192,7 +195,7 @@ struct OdinDocEntity {
|
||||
u32 reserved_for_init;
|
||||
OdinDocString comment; // line comment
|
||||
OdinDocString docs; // preceding comment
|
||||
i32 field_group_index;
|
||||
i32 field_group_index; // For `bit_field`s this is the "bit_size"
|
||||
OdinDocEntityIndex foreign_library;
|
||||
OdinDocString link_name;
|
||||
OdinDocArray<OdinDocAttribute> attributes;
|
||||
|
||||
+24
-1
@@ -615,6 +615,20 @@ gb_internal OdinDocTypeIndex odin_doc_type(OdinDocWriter *w, Type *type) {
|
||||
doc_type.types = odin_write_slice(w, types, gb_count_of(types));
|
||||
}
|
||||
break;
|
||||
case Type_BitField:
|
||||
doc_type.kind = OdinDocType_BitField;
|
||||
{
|
||||
auto fields = array_make<OdinDocEntityIndex>(heap_allocator(), type->BitField.fields.count);
|
||||
defer (array_free(&fields));
|
||||
|
||||
for_array(i, type->BitField.fields) {
|
||||
fields[i] = odin_doc_add_entity(w, type->BitField.fields[i]);
|
||||
}
|
||||
doc_type.entities = odin_write_slice(w, fields.data, fields.count);
|
||||
doc_type.types = odin_doc_type_as_slice(w, type->BitField.backing_type);
|
||||
}
|
||||
break;
|
||||
|
||||
case Type_Struct:
|
||||
doc_type.kind = OdinDocType_Struct;
|
||||
if (type->Struct.soa_kind != StructSoa_None) {
|
||||
@@ -863,6 +877,10 @@ gb_internal OdinDocEntityIndex odin_doc_add_entity(OdinDocWriter *w, Entity *e)
|
||||
}
|
||||
break;
|
||||
case Entity_Variable:
|
||||
if (e->flags & EntityFlag_BitFieldField) {
|
||||
flags |= OdinDocEntityFlag_BitField_Field;
|
||||
}
|
||||
|
||||
if (e->Variable.is_foreign) { flags |= OdinDocEntityFlag_Foreign; }
|
||||
if (e->Variable.is_export) { flags |= OdinDocEntityFlag_Export; }
|
||||
if (e->Variable.thread_local_model != "") {
|
||||
@@ -873,7 +891,12 @@ gb_internal OdinDocEntityIndex odin_doc_add_entity(OdinDocWriter *w, Entity *e)
|
||||
if (init_expr == nullptr) {
|
||||
init_expr = e->Variable.init_expr;
|
||||
}
|
||||
field_group_index = e->Variable.field_group_index;
|
||||
|
||||
if (e->flags & EntityFlag_BitFieldField) {
|
||||
field_group_index = -cast(i32)e->Variable.bit_field_bit_size;
|
||||
} else {
|
||||
field_group_index = e->Variable.field_group_index;
|
||||
}
|
||||
break;
|
||||
case Entity_Constant:
|
||||
field_group_index = e->Constant.field_group_index;
|
||||
|
||||
@@ -43,6 +43,7 @@ enum EntityFlag : u64 {
|
||||
EntityFlag_NoAlias = 1ull<<9,
|
||||
EntityFlag_TypeField = 1ull<<10,
|
||||
EntityFlag_Value = 1ull<<11,
|
||||
EntityFlag_BitFieldField = 1ull<<12,
|
||||
|
||||
|
||||
|
||||
@@ -212,6 +213,7 @@ struct Entity {
|
||||
Ast *init_expr; // only used for some variables within procedure bodies
|
||||
i32 field_index;
|
||||
i32 field_group_index;
|
||||
u8 bit_field_bit_size;
|
||||
|
||||
ParameterValue param_value;
|
||||
|
||||
|
||||
@@ -2719,6 +2719,7 @@ gb_internal bool lb_generate_code(lbGenerator *gen) {
|
||||
{ // Type info member buffer
|
||||
// NOTE(bill): Removes need for heap allocation by making it global memory
|
||||
isize count = 0;
|
||||
isize offsets_extra = 0;
|
||||
|
||||
for (Type *t : m->info->type_info_types) {
|
||||
isize index = lb_type_info_index(m->info, t, false);
|
||||
@@ -2736,6 +2737,11 @@ gb_internal bool lb_generate_code(lbGenerator *gen) {
|
||||
case Type_Tuple:
|
||||
count += t->Tuple.variables.count;
|
||||
break;
|
||||
case Type_BitField:
|
||||
count += t->BitField.fields.count;
|
||||
// Twice is needed for the bit_offsets
|
||||
offsets_extra += t->BitField.fields.count;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
@@ -2752,7 +2758,7 @@ gb_internal bool lb_generate_code(lbGenerator *gen) {
|
||||
|
||||
lb_global_type_info_member_types = global_type_info_make(m, LB_TYPE_INFO_TYPES_NAME, t_type_info_ptr, count);
|
||||
lb_global_type_info_member_names = global_type_info_make(m, LB_TYPE_INFO_NAMES_NAME, t_string, count);
|
||||
lb_global_type_info_member_offsets = global_type_info_make(m, LB_TYPE_INFO_OFFSETS_NAME, t_uintptr, count);
|
||||
lb_global_type_info_member_offsets = global_type_info_make(m, LB_TYPE_INFO_OFFSETS_NAME, t_uintptr, count+offsets_extra);
|
||||
lb_global_type_info_member_usings = global_type_info_make(m, LB_TYPE_INFO_USINGS_NAME, t_bool, count);
|
||||
lb_global_type_info_member_tags = global_type_info_make(m, LB_TYPE_INFO_TAGS_NAME, t_string, count);
|
||||
}
|
||||
|
||||
@@ -84,6 +84,8 @@ enum lbAddrKind {
|
||||
|
||||
lbAddr_Swizzle,
|
||||
lbAddr_SwizzleLarge,
|
||||
|
||||
lbAddr_BitField,
|
||||
};
|
||||
|
||||
struct lbAddr {
|
||||
@@ -118,6 +120,12 @@ struct lbAddr {
|
||||
Type *type;
|
||||
Slice<i32> indices;
|
||||
} swizzle_large;
|
||||
struct {
|
||||
Type *type;
|
||||
i64 index;
|
||||
i64 bit_offset;
|
||||
i64 bit_size;
|
||||
} bitfield;
|
||||
};
|
||||
};
|
||||
|
||||
|
||||
@@ -461,6 +461,42 @@ gb_internal LLVMMetadataRef lb_debug_type_internal(lbModule *m, Type *type) {
|
||||
lb_debug_type(m, type->Matrix.elem),
|
||||
subscripts, gb_count_of(subscripts));
|
||||
}
|
||||
|
||||
case Type_BitField: {
|
||||
LLVMMetadataRef parent_scope = nullptr;
|
||||
LLVMMetadataRef scope = nullptr;
|
||||
LLVMMetadataRef file = nullptr;
|
||||
unsigned line = 0;
|
||||
u64 size_in_bits = 8*cast(u64)type_size_of(type);
|
||||
u32 align_in_bits = 8*cast(u32)type_align_of(type);
|
||||
LLVMDIFlags flags = LLVMDIFlagZero;
|
||||
|
||||
unsigned element_count = cast(unsigned)type->BitField.fields.count;
|
||||
LLVMMetadataRef *elements = gb_alloc_array(permanent_allocator(), LLVMMetadataRef, element_count);
|
||||
|
||||
u64 offset_in_bits = 0;
|
||||
for (unsigned i = 0; i < element_count; i++) {
|
||||
Entity *f = type->BitField.fields[i];
|
||||
u8 bit_size = type->BitField.bit_sizes[i];
|
||||
GB_ASSERT(f->kind == Entity_Variable);
|
||||
String name = f->token.string;
|
||||
unsigned field_line = 0;
|
||||
LLVMDIFlags field_flags = LLVMDIFlagZero;
|
||||
elements[i] = LLVMDIBuilderCreateBitFieldMemberType(m->debug_builder, scope, cast(char const *)name.text, name.len, file, field_line,
|
||||
bit_size, offset_in_bits, offset_in_bits,
|
||||
field_flags, lb_debug_type(m, f->type)
|
||||
);
|
||||
|
||||
offset_in_bits += bit_size;
|
||||
}
|
||||
|
||||
|
||||
return LLVMDIBuilderCreateStructType(m->debug_builder, parent_scope, "", 0, file, line,
|
||||
size_in_bits, align_in_bits, flags,
|
||||
nullptr, elements, element_count, 0, nullptr,
|
||||
"", 0
|
||||
);
|
||||
}
|
||||
}
|
||||
|
||||
GB_PANIC("Invalid type %s", type_to_string(type));
|
||||
|
||||
@@ -1946,6 +1946,24 @@ gb_internal lbValue lb_emit_conv(lbProcedure *p, lbValue value, Type *t) {
|
||||
}
|
||||
}
|
||||
|
||||
// bit_field <-> backing type
|
||||
if (is_type_bit_field(src)) {
|
||||
if (are_types_identical(src->BitField.backing_type, dst)) {
|
||||
lbValue res = {};
|
||||
res.type = t;
|
||||
res.value = value.value;
|
||||
return res;
|
||||
}
|
||||
}
|
||||
if (is_type_bit_field(dst)) {
|
||||
if (are_types_identical(src, dst->BitField.backing_type)) {
|
||||
lbValue res = {};
|
||||
res.type = t;
|
||||
res.value = value.value;
|
||||
return res;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
// Pointer <-> uintptr
|
||||
if (is_type_pointer(src) && is_type_uintptr(dst)) {
|
||||
@@ -4217,6 +4235,38 @@ gb_internal lbAddr lb_build_addr_compound_lit(lbProcedure *p, Ast *expr) {
|
||||
switch (bt->kind) {
|
||||
default: GB_PANIC("Unknown CompoundLit type: %s", type_to_string(type)); break;
|
||||
|
||||
case Type_BitField:
|
||||
for (Ast *elem : cl->elems) {
|
||||
ast_node(fv, FieldValue, elem);
|
||||
String name = fv->field->Ident.token.string;
|
||||
Selection sel = lookup_field(bt, name, false);
|
||||
GB_ASSERT(sel.is_bit_field);
|
||||
GB_ASSERT(!sel.indirect);
|
||||
GB_ASSERT(sel.index.count == 1);
|
||||
GB_ASSERT(sel.entity != nullptr);
|
||||
|
||||
i64 index = sel.index[0];
|
||||
i64 bit_offset = 0;
|
||||
i64 bit_size = -1;
|
||||
for_array(i, bt->BitField.fields) {
|
||||
Entity *f = bt->BitField.fields[i];
|
||||
if (f == sel.entity) {
|
||||
bit_offset = bt->BitField.bit_offsets[i];
|
||||
bit_size = bt->BitField.bit_sizes[i];
|
||||
break;
|
||||
}
|
||||
}
|
||||
GB_ASSERT(bit_size > 0);
|
||||
|
||||
Type *field_type = sel.entity->type;
|
||||
lbValue field_expr = lb_build_expr(p, fv->value);
|
||||
field_expr = lb_emit_conv(p, field_expr, field_type);
|
||||
|
||||
lbAddr field_addr = lb_addr_bit_field(v.addr, field_type, index, bit_offset, bit_size);
|
||||
lb_addr_store(p, field_addr, field_expr);
|
||||
}
|
||||
return v;
|
||||
|
||||
case Type_Struct: {
|
||||
// TODO(bill): "constant" '#raw_union's are not initialized constantly at the moment.
|
||||
// NOTE(bill): This is due to the layout of the unions when printed to LLVM-IR
|
||||
@@ -4634,6 +4684,30 @@ gb_internal lbAddr lb_build_addr_internal(lbProcedure *p, Ast *expr) {
|
||||
return lb_addr(lb_find_value_from_entity(p->module, e));
|
||||
}
|
||||
|
||||
if (sel.is_bit_field) {
|
||||
lbAddr addr = lb_build_addr(p, se->expr);
|
||||
|
||||
Selection sub_sel = sel;
|
||||
sub_sel.index.count -= 1;
|
||||
|
||||
lbValue ptr = lb_addr_get_ptr(p, addr);
|
||||
if (sub_sel.index.count > 0) {
|
||||
ptr = lb_emit_deep_field_gep(p, ptr, sub_sel);
|
||||
}
|
||||
|
||||
Type *bf_type = type_deref(ptr.type);
|
||||
bf_type = base_type(type_deref(bf_type));
|
||||
GB_ASSERT(bf_type->kind == Type_BitField);
|
||||
|
||||
i32 index = sel.index[sel.index.count-1];
|
||||
|
||||
Entity *f = bf_type->BitField.fields[index];
|
||||
u8 bit_size = bf_type->BitField.bit_sizes[index];
|
||||
i64 bit_offset = bf_type->BitField.bit_offsets[index];
|
||||
|
||||
return lb_addr_bit_field(ptr, f->type, index, bit_offset, bit_size);
|
||||
}
|
||||
|
||||
{
|
||||
lbAddr addr = lb_build_addr(p, se->expr);
|
||||
if (addr.kind == lbAddr_Map) {
|
||||
|
||||
@@ -451,6 +451,20 @@ gb_internal lbAddr lb_addr_swizzle_large(lbValue addr, Type *array_type, Slice<i
|
||||
return v;
|
||||
}
|
||||
|
||||
gb_internal lbAddr lb_addr_bit_field(lbValue addr, Type *type, i64 index, i64 bit_offset, i64 bit_size) {
|
||||
GB_ASSERT(is_type_pointer(addr.type));
|
||||
Type *mt = type_deref(addr.type);
|
||||
GB_ASSERT(is_type_bit_field(mt));
|
||||
|
||||
lbAddr v = {lbAddr_BitField, addr};
|
||||
v.bitfield.type = type;
|
||||
v.bitfield.index = index;
|
||||
v.bitfield.bit_offset = bit_offset;
|
||||
v.bitfield.bit_size = bit_size;
|
||||
return v;
|
||||
}
|
||||
|
||||
|
||||
gb_internal Type *lb_addr_type(lbAddr const &addr) {
|
||||
if (addr.addr.value == nullptr) {
|
||||
return nullptr;
|
||||
@@ -759,7 +773,17 @@ gb_internal void lb_addr_store(lbProcedure *p, lbAddr addr, lbValue value) {
|
||||
addr = lb_addr(lb_address_from_load(p, lb_addr_load(p, addr)));
|
||||
}
|
||||
|
||||
if (addr.kind == lbAddr_RelativePointer) {
|
||||
if (addr.kind == lbAddr_BitField) {
|
||||
lbValue dst = addr.addr;
|
||||
|
||||
auto args = array_make<lbValue>(temporary_allocator(), 4);
|
||||
args[0] = dst;
|
||||
args[1] = lb_address_from_load_or_generate_local(p, value);
|
||||
args[2] = lb_const_int(p->module, t_uintptr, addr.bitfield.bit_offset);
|
||||
args[3] = lb_const_int(p->module, t_uintptr, addr.bitfield.bit_size);
|
||||
lb_emit_runtime_call(p, "__write_bits", args);
|
||||
return;
|
||||
} else if (addr.kind == lbAddr_RelativePointer) {
|
||||
Type *rel_ptr = base_type(lb_addr_type(addr));
|
||||
GB_ASSERT(rel_ptr->kind == Type_RelativePointer ||
|
||||
rel_ptr->kind == Type_RelativeMultiPointer);
|
||||
@@ -1074,8 +1098,31 @@ gb_internal lbValue lb_emit_load(lbProcedure *p, lbValue value) {
|
||||
gb_internal lbValue lb_addr_load(lbProcedure *p, lbAddr const &addr) {
|
||||
GB_ASSERT(addr.addr.value != nullptr);
|
||||
|
||||
if (addr.kind == lbAddr_BitField) {
|
||||
lbAddr dst = lb_add_local_generated(p, addr.bitfield.type, true);
|
||||
lbValue src = addr.addr;
|
||||
|
||||
if (addr.kind == lbAddr_RelativePointer) {
|
||||
auto args = array_make<lbValue>(temporary_allocator(), 4);
|
||||
args[0] = dst.addr;
|
||||
args[1] = src;
|
||||
args[2] = lb_const_int(p->module, t_uintptr, addr.bitfield.bit_offset);
|
||||
args[3] = lb_const_int(p->module, t_uintptr, addr.bitfield.bit_size);
|
||||
lb_emit_runtime_call(p, "__read_bits", args);
|
||||
|
||||
lbValue r = lb_addr_load(p, dst);
|
||||
|
||||
if (!is_type_unsigned(core_type(addr.bitfield.type))) {
|
||||
// Sign extension
|
||||
// m := 1<<(bit_size-1)
|
||||
// r = (r XOR m) - m
|
||||
Type *t = addr.bitfield.type;
|
||||
lbValue m = lb_const_int(p->module, t, 1ull<<(addr.bitfield.bit_size-1));
|
||||
r = lb_emit_arith(p, Token_Xor, r, m, t);
|
||||
r = lb_emit_arith(p, Token_Sub, r, m, t);
|
||||
}
|
||||
|
||||
return r;
|
||||
} else if (addr.kind == lbAddr_RelativePointer) {
|
||||
Type *rel_ptr = base_type(lb_addr_type(addr));
|
||||
Type *base_integer = nullptr;
|
||||
Type *pointer_type = nullptr;
|
||||
@@ -2216,7 +2263,9 @@ gb_internal LLVMTypeRef lb_type_internal(lbModule *m, Type *type) {
|
||||
}
|
||||
return LLVMStructTypeInContext(ctx, fields, field_count, false);
|
||||
}
|
||||
|
||||
|
||||
case Type_BitField:
|
||||
return lb_type_internal(m, type->BitField.backing_type);
|
||||
}
|
||||
|
||||
GB_PANIC("Invalid type %s", type_to_string(type));
|
||||
|
||||
@@ -1788,6 +1788,77 @@ gb_internal void lb_setup_type_info_data(lbProcedure *p) { // NOTE(bill): Setup
|
||||
lb_emit_store(p, tag, res);
|
||||
}
|
||||
break;
|
||||
|
||||
case Type_BitField:
|
||||
{
|
||||
tag = lb_const_ptr_cast(m, variant_ptr, t_type_info_bit_field_ptr);
|
||||
LLVMValueRef vals[6] = {};
|
||||
|
||||
vals[0] = lb_type_info(m, t->BitField.backing_type).value;
|
||||
isize count = t->BitField.fields.count;
|
||||
if (count > 0) {
|
||||
i64 names_offset = 0;
|
||||
i64 types_offset = 0;
|
||||
i64 bit_sizes_offset = 0;
|
||||
i64 bit_offsets_offset = 0;
|
||||
i64 tags_offset = 0;
|
||||
lbValue memory_names = lb_type_info_member_names_offset (m, count, &names_offset);
|
||||
lbValue memory_types = lb_type_info_member_types_offset (m, count, &types_offset);
|
||||
lbValue memory_bit_sizes = lb_type_info_member_offsets_offset(m, count, &bit_sizes_offset);
|
||||
lbValue memory_bit_offsets = lb_type_info_member_offsets_offset(m, count, &bit_offsets_offset);
|
||||
lbValue memory_tags = lb_type_info_member_tags_offset (m, count, &tags_offset);
|
||||
|
||||
u64 bit_offset = 0;
|
||||
for (isize source_index = 0; source_index < count; source_index++) {
|
||||
Entity *f = t->BitField.fields[source_index];
|
||||
u64 bit_size = cast(u64)t->BitField.bit_sizes[source_index];
|
||||
|
||||
lbValue index = lb_const_int(m, t_int, source_index);
|
||||
if (f->token.string.len > 0) {
|
||||
lbValue name_ptr = lb_emit_ptr_offset(p, memory_names, index);
|
||||
lb_emit_store(p, name_ptr, lb_const_string(m, f->token.string));
|
||||
}
|
||||
lbValue type_ptr = lb_emit_ptr_offset(p, memory_types, index);
|
||||
lbValue bit_size_ptr = lb_emit_ptr_offset(p, memory_bit_sizes, index);
|
||||
lbValue bit_offset_ptr = lb_emit_ptr_offset(p, memory_bit_offsets, index);
|
||||
|
||||
lb_emit_store(p, type_ptr, lb_type_info(m, f->type));
|
||||
lb_emit_store(p, bit_size_ptr, lb_const_int(m, t_uintptr, bit_size));
|
||||
lb_emit_store(p, bit_offset_ptr, lb_const_int(m, t_uintptr, bit_offset));
|
||||
|
||||
if (t->BitField.tags) {
|
||||
String tag = t->BitField.tags[source_index];
|
||||
if (tag.len > 0) {
|
||||
lbValue tag_ptr = lb_emit_ptr_offset(p, memory_tags, index);
|
||||
lb_emit_store(p, tag_ptr, lb_const_string(m, tag));
|
||||
}
|
||||
}
|
||||
|
||||
bit_offset += bit_size;
|
||||
}
|
||||
|
||||
lbValue cv = lb_const_int(m, t_int, count);
|
||||
vals[1] = llvm_const_slice(m, memory_names, cv);
|
||||
vals[2] = llvm_const_slice(m, memory_types, cv);
|
||||
vals[3] = llvm_const_slice(m, memory_bit_sizes, cv);
|
||||
vals[4] = llvm_const_slice(m, memory_bit_offsets, cv);
|
||||
vals[5] = llvm_const_slice(m, memory_tags, cv);
|
||||
}
|
||||
|
||||
for (isize i = 0; i < gb_count_of(vals); i++) {
|
||||
if (vals[i] == nullptr) {
|
||||
vals[i] = LLVMConstNull(lb_type(m, get_struct_field_type(tag.type, i)));
|
||||
}
|
||||
}
|
||||
|
||||
lbValue res = {};
|
||||
res.type = type_deref(tag.type);
|
||||
res.value = llvm_const_named_struct(m, res.type, vals, gb_count_of(vals));
|
||||
lb_emit_store(p, tag, res);
|
||||
|
||||
break;
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
|
||||
|
||||
@@ -1332,7 +1332,7 @@ gb_internal lbValue lb_emit_deep_field_gep(lbProcedure *p, lbValue e, Selection
|
||||
if (index == 0) {
|
||||
type = t_rawptr;
|
||||
} else if (index == 1) {
|
||||
type = t_type_info_ptr;
|
||||
type = t_typeid;
|
||||
}
|
||||
e = lb_emit_struct_ep(p, e, index);
|
||||
break;
|
||||
|
||||
@@ -350,6 +350,11 @@ gb_internal Ast *clone_ast(Ast *node, AstFile *f) {
|
||||
n->Field.names = clone_ast_array(n->Field.names, f);
|
||||
n->Field.type = clone_ast(n->Field.type, f);
|
||||
break;
|
||||
case Ast_BitFieldField:
|
||||
n->BitFieldField.name = clone_ast(n->BitFieldField.name, f);
|
||||
n->BitFieldField.type = clone_ast(n->BitFieldField.type, f);
|
||||
n->BitFieldField.bit_size = clone_ast(n->BitFieldField.bit_size, f);
|
||||
break;
|
||||
case Ast_FieldList:
|
||||
n->FieldList.list = clone_ast_array(n->FieldList.list, f);
|
||||
break;
|
||||
@@ -406,6 +411,10 @@ gb_internal Ast *clone_ast(Ast *node, AstFile *f) {
|
||||
n->BitSetType.elem = clone_ast(n->BitSetType.elem, f);
|
||||
n->BitSetType.underlying = clone_ast(n->BitSetType.underlying, f);
|
||||
break;
|
||||
case Ast_BitFieldType:
|
||||
n->BitFieldType.backing_type = clone_ast(n->BitFieldType.backing_type, f);
|
||||
n->BitFieldType.fields = clone_ast_array(n->BitFieldType.fields, f);
|
||||
break;
|
||||
case Ast_MapType:
|
||||
n->MapType.count = clone_ast(n->MapType.count, f);
|
||||
n->MapType.key = clone_ast(n->MapType.key, f);
|
||||
@@ -1045,6 +1054,18 @@ gb_internal Ast *ast_field(AstFile *f, Array<Ast *> const &names, Ast *type, Ast
|
||||
return result;
|
||||
}
|
||||
|
||||
gb_internal Ast *ast_bit_field_field(AstFile *f, Ast *name, Ast *type, Ast *bit_size, Token tag,
|
||||
CommentGroup *docs, CommentGroup *comment) {
|
||||
Ast *result = alloc_ast_node(f, Ast_BitFieldField);
|
||||
result->BitFieldField.name = name;
|
||||
result->BitFieldField.type = type;
|
||||
result->BitFieldField.bit_size = bit_size;
|
||||
result->BitFieldField.tag = tag;
|
||||
result->BitFieldField.docs = docs;
|
||||
result->BitFieldField.comment = comment;
|
||||
return result;
|
||||
}
|
||||
|
||||
gb_internal Ast *ast_field_list(AstFile *f, Token token, Array<Ast *> const &list) {
|
||||
Ast *result = alloc_ast_node(f, Ast_FieldList);
|
||||
result->FieldList.token = token;
|
||||
@@ -1178,6 +1199,17 @@ gb_internal Ast *ast_bit_set_type(AstFile *f, Token token, Ast *elem, Ast *under
|
||||
return result;
|
||||
}
|
||||
|
||||
gb_internal Ast *ast_bit_field_type(AstFile *f, Token token, Ast *backing_type, Token open, Array<Ast *> const &fields, Token close) {
|
||||
Ast *result = alloc_ast_node(f, Ast_BitFieldType);
|
||||
result->BitFieldType.token = token;
|
||||
result->BitFieldType.backing_type = backing_type;
|
||||
result->BitFieldType.open = open;
|
||||
result->BitFieldType.fields = slice_from_array(fields);
|
||||
result->BitFieldType.close = close;
|
||||
return result;
|
||||
}
|
||||
|
||||
|
||||
gb_internal Ast *ast_map_type(AstFile *f, Token token, Ast *key, Ast *value) {
|
||||
Ast *result = alloc_ast_node(f, Ast_MapType);
|
||||
result->MapType.token = token;
|
||||
@@ -2549,6 +2581,66 @@ gb_internal Ast *parse_operand(AstFile *f, bool lhs) {
|
||||
return ast_matrix_type(f, token, row_count, column_count, type);
|
||||
} break;
|
||||
|
||||
case Token_bit_field: {
|
||||
Token token = expect_token(f, Token_bit_field);
|
||||
isize prev_level;
|
||||
|
||||
prev_level = f->expr_level;
|
||||
f->expr_level = -1;
|
||||
|
||||
Ast *backing_type = parse_type_or_ident(f);
|
||||
if (backing_type == nullptr) {
|
||||
Token token = advance_token(f);
|
||||
syntax_error(token, "Expected a backing type for a 'bit_field'");
|
||||
backing_type = ast_bad_expr(f, token, f->curr_token);
|
||||
}
|
||||
|
||||
skip_possible_newline_for_literal(f);
|
||||
Token open = expect_token_after(f, Token_OpenBrace, "bit_field");
|
||||
|
||||
|
||||
auto fields = array_make<Ast *>(ast_allocator(f), 0, 0);
|
||||
|
||||
while (f->curr_token.kind != Token_CloseBrace &&
|
||||
f->curr_token.kind != Token_EOF) {
|
||||
CommentGroup *docs = nullptr;
|
||||
CommentGroup *comment = nullptr;
|
||||
|
||||
Ast *name = parse_ident(f);
|
||||
bool err_once = false;
|
||||
while (allow_token(f, Token_Comma)) {
|
||||
Ast *dummy_name = parse_ident(f);
|
||||
if (!err_once) {
|
||||
error(dummy_name, "'bit_field' fields do not support multiple names per field");
|
||||
err_once = true;
|
||||
}
|
||||
}
|
||||
expect_token(f, Token_Colon);
|
||||
Ast *type = parse_type(f);
|
||||
expect_token(f, Token_Or);
|
||||
Ast *bit_size = parse_expr(f, true);
|
||||
|
||||
Token tag = {};
|
||||
if (f->curr_token.kind == Token_String) {
|
||||
tag = expect_token(f, Token_String);
|
||||
}
|
||||
|
||||
Ast *bf_field = ast_bit_field_field(f, name, type, bit_size, tag, docs, comment);
|
||||
array_add(&fields, bf_field);
|
||||
|
||||
if (!allow_field_separator(f)) {
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
Token close = expect_closing_brace_of_field_list(f);
|
||||
|
||||
f->expr_level = prev_level;
|
||||
|
||||
return ast_bit_field_type(f, token, backing_type, open, fields, close);
|
||||
}
|
||||
|
||||
|
||||
case Token_struct: {
|
||||
Token token = expect_token(f, Token_struct);
|
||||
Ast *polymorphic_params = nullptr;
|
||||
@@ -3923,6 +4015,10 @@ gb_internal Array<Ast *> convert_to_ident_list(AstFile *f, Array<AstAndFlags> li
|
||||
case Ast_Ident:
|
||||
case Ast_BadExpr:
|
||||
break;
|
||||
case Ast_Implicit:
|
||||
syntax_error(ident, "Expected an identifier, '%.*s' which is a keyword", LIT(ident->Implicit.string));
|
||||
ident = ast_ident(f, blank_token);
|
||||
break;
|
||||
|
||||
case Ast_PolyType:
|
||||
if (allow_poly_names) {
|
||||
@@ -3936,6 +4032,7 @@ gb_internal Array<Ast *> convert_to_ident_list(AstFile *f, Array<AstAndFlags> li
|
||||
}
|
||||
/*fallthrough*/
|
||||
|
||||
|
||||
default:
|
||||
syntax_error(ident, "Expected an identifier");
|
||||
ident = ast_ident(f, blank_token);
|
||||
|
||||
@@ -429,6 +429,7 @@ AST_KIND(_ExprBegin, "", bool) \
|
||||
Ast *expr, *selector; \
|
||||
u8 swizzle_count; /*maximum of 4 components, if set, count >= 2*/ \
|
||||
u8 swizzle_indices; /*2 bits per component*/ \
|
||||
bool is_bit_field; \
|
||||
}) \
|
||||
AST_KIND(ImplicitSelectorExpr, "implicit selector expression", struct { Token token; Ast *selector; }) \
|
||||
AST_KIND(SelectorCallExpr, "selector call expression", struct { \
|
||||
@@ -650,6 +651,14 @@ AST_KIND(_DeclEnd, "", bool) \
|
||||
CommentGroup * docs; \
|
||||
CommentGroup * comment; \
|
||||
}) \
|
||||
AST_KIND(BitFieldField, "bit field field", struct { \
|
||||
Ast * name; \
|
||||
Ast * type; \
|
||||
Ast * bit_size; \
|
||||
Token tag; \
|
||||
CommentGroup *docs; \
|
||||
CommentGroup *comment; \
|
||||
}) \
|
||||
AST_KIND(FieldList, "field list", struct { \
|
||||
Token token; \
|
||||
Slice<Ast *> list; \
|
||||
@@ -742,6 +751,14 @@ AST_KIND(_TypeBegin, "", bool) \
|
||||
Ast * elem; \
|
||||
Ast * underlying; \
|
||||
}) \
|
||||
AST_KIND(BitFieldType, "bit field type", struct { \
|
||||
Scope *scope; \
|
||||
Token token; \
|
||||
Ast * backing_type; \
|
||||
Token open; \
|
||||
Slice<Ast *> fields; /* BitFieldField */ \
|
||||
Token close; \
|
||||
}) \
|
||||
AST_KIND(MapType, "map type", struct { \
|
||||
Token token; \
|
||||
Ast *count; \
|
||||
|
||||
@@ -111,6 +111,7 @@ gb_internal Token ast_token(Ast *node) {
|
||||
case Ast_UnionType: return node->UnionType.token;
|
||||
case Ast_EnumType: return node->EnumType.token;
|
||||
case Ast_BitSetType: return node->BitSetType.token;
|
||||
case Ast_BitFieldType: return node->BitFieldType.token;
|
||||
case Ast_MapType: return node->MapType.token;
|
||||
case Ast_MatrixType: return node->MatrixType.token;
|
||||
}
|
||||
@@ -364,6 +365,8 @@ Token ast_end_token(Ast *node) {
|
||||
return ast_end_token(node->BitSetType.underlying);
|
||||
}
|
||||
return ast_end_token(node->BitSetType.elem);
|
||||
case Ast_BitFieldType:
|
||||
return node->BitFieldType.close;
|
||||
case Ast_MapType: return ast_end_token(node->MapType.value);
|
||||
case Ast_MatrixType: return ast_end_token(node->MatrixType.elem);
|
||||
}
|
||||
|
||||
+127
-3
@@ -282,6 +282,15 @@ struct TypeProc {
|
||||
Type *generic_column_count; \
|
||||
i64 stride_in_bytes; \
|
||||
}) \
|
||||
TYPE_KIND(BitField, struct { \
|
||||
Scope * scope; \
|
||||
Type * backing_type; \
|
||||
Slice<Entity *> fields; \
|
||||
String * tags; /*count == fields.count*/ \
|
||||
Slice<u8> bit_sizes; \
|
||||
Slice<i64> bit_offsets; \
|
||||
Ast * node; \
|
||||
}) \
|
||||
TYPE_KIND(SoaPointer, struct { Type *elem; })
|
||||
|
||||
|
||||
@@ -355,6 +364,7 @@ enum Typeid_Kind : u8 {
|
||||
Typeid_Relative_Multi_Pointer,
|
||||
Typeid_Matrix,
|
||||
Typeid_SoaPointer,
|
||||
Typeid_Bit_Field,
|
||||
};
|
||||
|
||||
// IMPORTANT NOTE(bill): This must match the same as the in core.odin
|
||||
@@ -376,6 +386,9 @@ enum : int {
|
||||
|
||||
gb_internal bool is_type_comparable(Type *t);
|
||||
gb_internal bool is_type_simple_compare(Type *t);
|
||||
gb_internal Type *type_deref(Type *t, bool allow_multi_pointer=false);
|
||||
gb_internal Type *base_type(Type *t);
|
||||
gb_internal Type *alloc_type_multi_pointer(Type *elem);
|
||||
|
||||
gb_internal u32 type_info_flags_of_type(Type *type) {
|
||||
if (type == nullptr) {
|
||||
@@ -400,6 +413,7 @@ struct Selection {
|
||||
bool indirect; // Set if there was a pointer deref anywhere down the line
|
||||
u8 swizzle_count; // maximum components = 4
|
||||
u8 swizzle_indices; // 2 bits per component, representing which swizzle index
|
||||
bool is_bit_field;
|
||||
bool pseudo_field;
|
||||
};
|
||||
gb_global Selection const empty_selection = {0};
|
||||
@@ -641,6 +655,7 @@ gb_global Type *t_type_info_relative_pointer = nullptr;
|
||||
gb_global Type *t_type_info_relative_multi_pointer = nullptr;
|
||||
gb_global Type *t_type_info_matrix = nullptr;
|
||||
gb_global Type *t_type_info_soa_pointer = nullptr;
|
||||
gb_global Type *t_type_info_bit_field = nullptr;
|
||||
|
||||
gb_global Type *t_type_info_named_ptr = nullptr;
|
||||
gb_global Type *t_type_info_integer_ptr = nullptr;
|
||||
@@ -670,6 +685,7 @@ gb_global Type *t_type_info_relative_pointer_ptr = nullptr;
|
||||
gb_global Type *t_type_info_relative_multi_pointer_ptr = nullptr;
|
||||
gb_global Type *t_type_info_matrix_ptr = nullptr;
|
||||
gb_global Type *t_type_info_soa_pointer_ptr = nullptr;
|
||||
gb_global Type *t_type_info_bit_field_ptr = nullptr;
|
||||
|
||||
gb_global Type *t_allocator = nullptr;
|
||||
gb_global Type *t_allocator_ptr = nullptr;
|
||||
@@ -750,7 +766,6 @@ gb_internal bool is_type_proc(Type *t);
|
||||
gb_internal bool is_type_slice(Type *t);
|
||||
gb_internal bool is_type_integer(Type *t);
|
||||
gb_internal bool type_set_offsets(Type *t);
|
||||
gb_internal Type *base_type(Type *t);
|
||||
|
||||
gb_internal i64 type_size_of_internal(Type *t, TypePath *path);
|
||||
gb_internal i64 type_align_of_internal(Type *t, TypePath *path);
|
||||
@@ -1040,6 +1055,11 @@ gb_internal Type *alloc_type_enum() {
|
||||
return t;
|
||||
}
|
||||
|
||||
gb_internal Type *alloc_type_bit_field() {
|
||||
Type *t = alloc_type(Type_BitField);
|
||||
return t;
|
||||
}
|
||||
|
||||
gb_internal Type *alloc_type_relative_pointer(Type *pointer_type, Type *base_integer) {
|
||||
GB_ASSERT(is_type_pointer(pointer_type));
|
||||
GB_ASSERT(is_type_integer(base_integer));
|
||||
@@ -1140,7 +1160,7 @@ gb_internal Type *alloc_type_simd_vector(i64 count, Type *elem, Type *generic_co
|
||||
////////////////////////////////////////////////////////////////
|
||||
|
||||
|
||||
gb_internal Type *type_deref(Type *t, bool allow_multi_pointer=false) {
|
||||
gb_internal Type *type_deref(Type *t, bool allow_multi_pointer) {
|
||||
if (t != nullptr) {
|
||||
Type *bt = base_type(t);
|
||||
if (bt == nullptr) {
|
||||
@@ -1707,6 +1727,10 @@ gb_internal bool is_type_bit_set(Type *t) {
|
||||
t = base_type(t);
|
||||
return (t->kind == Type_BitSet);
|
||||
}
|
||||
gb_internal bool is_type_bit_field(Type *t) {
|
||||
t = base_type(t);
|
||||
return (t->kind == Type_BitField);
|
||||
}
|
||||
gb_internal bool is_type_map(Type *t) {
|
||||
t = base_type(t);
|
||||
return t->kind == Type_Map;
|
||||
@@ -3168,6 +3192,21 @@ gb_internal Selection lookup_field_with_selection(Type *type_, String field_name
|
||||
else if (field_name == "a") mapped_field_name = str_lit("w");
|
||||
return lookup_field_with_selection(type, mapped_field_name, is_type, sel, allow_blank_ident);
|
||||
}
|
||||
} else if (type->kind == Type_BitField) {
|
||||
for_array(i, type->BitField.fields) {
|
||||
Entity *f = type->BitField.fields[i];
|
||||
if (f->kind != Entity_Variable || (f->flags & EntityFlag_Field) == 0) {
|
||||
continue;
|
||||
}
|
||||
String str = f->token.string;
|
||||
if (field_name == str) {
|
||||
selection_add_index(&sel, i); // HACK(bill): Leaky memory
|
||||
sel.entity = f;
|
||||
sel.is_bit_field = true;
|
||||
return sel;
|
||||
}
|
||||
}
|
||||
|
||||
} else if (type->kind == Type_Basic) {
|
||||
switch (type->Basic.kind) {
|
||||
case Basic_any: {
|
||||
@@ -3568,6 +3607,8 @@ gb_internal i64 type_align_of_internal(Type *t, TypePath *path) {
|
||||
case Type_Slice:
|
||||
return build_context.int_size;
|
||||
|
||||
case Type_BitField:
|
||||
return type_align_of_internal(t->BitField.backing_type, path);
|
||||
|
||||
case Type_Tuple: {
|
||||
i64 max = 1;
|
||||
@@ -3943,6 +3984,9 @@ gb_internal i64 type_size_of_internal(Type *t, TypePath *path) {
|
||||
return stride_in_bytes * t->Matrix.column_count;
|
||||
}
|
||||
|
||||
case Type_BitField:
|
||||
return type_size_of_internal(t->BitField.backing_type, path);
|
||||
|
||||
case Type_RelativePointer:
|
||||
return type_size_of_internal(t->RelativePointer.base_integer, path);
|
||||
case Type_RelativeMultiPointer:
|
||||
@@ -4219,7 +4263,70 @@ gb_internal Type *alloc_type_proc_from_types(Type **param_types, unsigned param_
|
||||
return t;
|
||||
}
|
||||
|
||||
|
||||
// gb_internal Type *type_from_selection(Type *type, Selection const &sel) {
|
||||
// for (i32 index : sel.index) {
|
||||
// Type *bt = base_type(type_deref(type));
|
||||
// switch (bt->kind) {
|
||||
// case Type_Struct:
|
||||
// type = bt->Struct.fields[index]->type;
|
||||
// break;
|
||||
// case Type_Tuple:
|
||||
// type = bt->Tuple.variables[index]->type;
|
||||
// break;
|
||||
// case Type_BitField:
|
||||
// type = bt->BitField.fields[index]->type;
|
||||
// break;
|
||||
// case Type_Array:
|
||||
// type = bt->Array.elem;
|
||||
// break;
|
||||
// case Type_EnumeratedArray:
|
||||
// type = bt->Array.elem;
|
||||
// break;
|
||||
// case Type_Slice:
|
||||
// switch (index) {
|
||||
// case 0: type = alloc_type_multi_pointer(bt->Slice.elem); break;
|
||||
// case 1: type = t_int; break;
|
||||
// }
|
||||
// break;
|
||||
// case Type_DynamicArray:
|
||||
// switch (index) {
|
||||
// case 0: type = alloc_type_multi_pointer(bt->DynamicArray.elem); break;
|
||||
// case 1: type = t_int; break;
|
||||
// case 2: type = t_int; break;
|
||||
// case 3: type = t_allocator; break;
|
||||
// }
|
||||
// break;
|
||||
// case Type_Map:
|
||||
// switch (index) {
|
||||
// case 0: type = t_uintptr; break;
|
||||
// case 1: type = t_int; break;
|
||||
// case 2: type = t_allocator; break;
|
||||
// }
|
||||
// break;
|
||||
// case Type_Basic:
|
||||
// if (is_type_complex_or_quaternion(bt)) {
|
||||
// type = base_complex_elem_type(bt);
|
||||
// } else {
|
||||
// switch (type->Basic.kind) {
|
||||
// case Basic_any:
|
||||
// switch (index) {
|
||||
// case 0: type = t_rawptr; break;
|
||||
// case 1: type = t_typeid; break;
|
||||
// }
|
||||
// break;
|
||||
// case Basic_string:
|
||||
// switch (index) {
|
||||
// case 0: type = t_u8_multi_ptr; break;
|
||||
// case 1: type = t_int; break;
|
||||
// }
|
||||
// break;
|
||||
// }
|
||||
// }
|
||||
// break;
|
||||
// }
|
||||
// }
|
||||
// return type;
|
||||
// }
|
||||
|
||||
gb_internal gbString write_type_to_string(gbString str, Type *type, bool shorthand=false) {
|
||||
if (type == nullptr) {
|
||||
@@ -4527,6 +4634,23 @@ gb_internal gbString write_type_to_string(gbString str, Type *type, bool shortha
|
||||
str = gb_string_appendc(str, gb_bprintf("matrix[%d, %d]", cast(int)type->Matrix.row_count, cast(int)type->Matrix.column_count));
|
||||
str = write_type_to_string(str, type->Matrix.elem);
|
||||
break;
|
||||
|
||||
case Type_BitField:
|
||||
str = gb_string_appendc(str, "bit_field ");
|
||||
str = write_type_to_string(str, type->BitField.backing_type);
|
||||
str = gb_string_appendc(str, " {");
|
||||
for (isize i = 0; i < type->BitField.fields.count; i++) {
|
||||
Entity *f = type->BitField.fields[i];
|
||||
if (i > 0) {
|
||||
str = gb_string_appendc(str, ", ");
|
||||
}
|
||||
str = gb_string_append_length(str, f->token.string.text, f->token.string.len);
|
||||
str = gb_string_appendc(str, ": ");
|
||||
str = write_type_to_string(str, f->type);
|
||||
str = gb_string_append_fmt(str, " | %u", type->BitField.bit_sizes[i]);
|
||||
}
|
||||
str = gb_string_appendc(str, " }");
|
||||
break;
|
||||
}
|
||||
|
||||
return str;
|
||||
|
||||
Reference in New Issue
Block a user