|
@@ -2,16 +2,64 @@
|
|
#import "mem.odin";
|
|
#import "mem.odin";
|
|
#import "utf8.odin";
|
|
#import "utf8.odin";
|
|
|
|
|
|
-PRINT_BUF_SIZE :: 1<<12;
|
|
|
|
|
|
+DEFAULT_BUFFER_SIZE :: 1<<12;
|
|
|
|
|
|
Buffer :: struct {
|
|
Buffer :: struct {
|
|
data: []byte;
|
|
data: []byte;
|
|
length: int;
|
|
length: int;
|
|
}
|
|
}
|
|
|
|
|
|
|
|
+buffer_write :: proc(buf: ^Buffer, b: []byte) {
|
|
|
|
+ if buf.length < buf.data.count {
|
|
|
|
+ n := min(buf.data.count-buf.length, b.count);
|
|
|
|
+ if n > 0 {
|
|
|
|
+ copy(buf.data[buf.length:], b[:n]);
|
|
|
|
+ buf.length += n;
|
|
|
|
+ }
|
|
|
|
+ }
|
|
|
|
+}
|
|
|
|
+buffer_write_string :: proc(buf: ^Buffer, s: string) {
|
|
|
|
+ buffer_write(buf, s as []byte);
|
|
|
|
+}
|
|
|
|
+buffer_write_byte :: proc(buf: ^Buffer, b: byte) {
|
|
|
|
+ if buf.length < buf.data.count {
|
|
|
|
+ buf.data[buf.length] = b;
|
|
|
|
+ buf.length += 1;
|
|
|
|
+ }
|
|
|
|
+}
|
|
|
|
+buffer_write_rune :: proc(buf: ^Buffer, r: rune) {
|
|
|
|
+ if r < utf8.RUNE_SELF {
|
|
|
|
+ buffer_write_byte(buf, r as byte);
|
|
|
|
+ return;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ b, n := utf8.encode_rune(r);
|
|
|
|
+ buffer_write(buf, b[:n]);
|
|
|
|
+}
|
|
|
|
+
|
|
|
|
+Fmt_Info :: struct {
|
|
|
|
+ minus: bool;
|
|
|
|
+ plus: bool;
|
|
|
|
+ space: bool;
|
|
|
|
+ zero: bool;
|
|
|
|
+ hash: bool;
|
|
|
|
+ width_set: bool;
|
|
|
|
+ prec_set: bool;
|
|
|
|
+
|
|
|
|
+ width: int;
|
|
|
|
+ prec: int;
|
|
|
|
+
|
|
|
|
+ reordered: bool;
|
|
|
|
+ good_arg_index: bool;
|
|
|
|
+
|
|
|
|
+ buf: ^Buffer;
|
|
|
|
+ arg: any; // Temporary
|
|
|
|
+}
|
|
|
|
+
|
|
|
|
+
|
|
|
|
|
|
fprint :: proc(fd: os.Handle, args: ...any) -> int {
|
|
fprint :: proc(fd: os.Handle, args: ...any) -> int {
|
|
- data: [PRINT_BUF_SIZE]byte;
|
|
|
|
|
|
+ data: [DEFAULT_BUFFER_SIZE]byte;
|
|
buf := Buffer{data[:], 0};
|
|
buf := Buffer{data[:], 0};
|
|
bprint(^buf, ...args);
|
|
bprint(^buf, ...args);
|
|
os.write(fd, buf.data[:buf.length]);
|
|
os.write(fd, buf.data[:buf.length]);
|
|
@@ -19,14 +67,14 @@ fprint :: proc(fd: os.Handle, args: ...any) -> int {
|
|
}
|
|
}
|
|
|
|
|
|
fprintln :: proc(fd: os.Handle, args: ...any) -> int {
|
|
fprintln :: proc(fd: os.Handle, args: ...any) -> int {
|
|
- data: [PRINT_BUF_SIZE]byte;
|
|
|
|
|
|
+ data: [DEFAULT_BUFFER_SIZE]byte;
|
|
buf := Buffer{data[:], 0};
|
|
buf := Buffer{data[:], 0};
|
|
bprintln(^buf, ...args);
|
|
bprintln(^buf, ...args);
|
|
os.write(fd, buf.data[:buf.length]);
|
|
os.write(fd, buf.data[:buf.length]);
|
|
return buf.length;
|
|
return buf.length;
|
|
}
|
|
}
|
|
fprintf :: proc(fd: os.Handle, fmt: string, args: ...any) -> int {
|
|
fprintf :: proc(fd: os.Handle, fmt: string, args: ...any) -> int {
|
|
- data: [PRINT_BUF_SIZE]byte;
|
|
|
|
|
|
+ data: [DEFAULT_BUFFER_SIZE]byte;
|
|
buf := Buffer{data[:], 0};
|
|
buf := Buffer{data[:], 0};
|
|
bprintf(^buf, fmt, ...args);
|
|
bprintf(^buf, fmt, ...args);
|
|
os.write(fd, buf.data[:buf.length]);
|
|
os.write(fd, buf.data[:buf.length]);
|
|
@@ -45,133 +93,15 @@ printf :: proc(fmt: string, args: ...any) -> int {
|
|
}
|
|
}
|
|
|
|
|
|
|
|
|
|
-
|
|
|
|
fprint_type :: proc(fd: os.Handle, info: ^Type_Info) {
|
|
fprint_type :: proc(fd: os.Handle, info: ^Type_Info) {
|
|
- data: [PRINT_BUF_SIZE]byte;
|
|
|
|
|
|
+ data: [DEFAULT_BUFFER_SIZE]byte;
|
|
buf := Buffer{data[:], 0};
|
|
buf := Buffer{data[:], 0};
|
|
- bprint_type(^buf, info);
|
|
|
|
|
|
+ buffer_write_type(^buf, info);
|
|
os.write(fd, buf.data[:buf.length]);
|
|
os.write(fd, buf.data[:buf.length]);
|
|
}
|
|
}
|
|
|
|
|
|
|
|
|
|
-
|
|
|
|
-print_byte_buffer :: proc(buf: ^Buffer, b: []byte) {
|
|
|
|
- if buf.length < buf.data.count {
|
|
|
|
- n := min(buf.data.count-buf.length, b.count);
|
|
|
|
- if n > 0 {
|
|
|
|
- copy(buf.data[buf.length:], b[:n]);
|
|
|
|
- buf.length += n;
|
|
|
|
- }
|
|
|
|
- }
|
|
|
|
-}
|
|
|
|
-
|
|
|
|
-bprint_string :: proc(buf: ^Buffer, s: string) {
|
|
|
|
- print_byte_buffer(buf, s as []byte);
|
|
|
|
-}
|
|
|
|
-
|
|
|
|
-
|
|
|
|
-byte_reverse :: proc(b: []byte) {
|
|
|
|
- n := b.count;
|
|
|
|
- for i : 0..<n/2 {
|
|
|
|
- b[i], b[n-1-i] = b[n-1-i], b[i];
|
|
|
|
- }
|
|
|
|
-}
|
|
|
|
-
|
|
|
|
-bprint_rune :: proc(buf: ^Buffer, r: rune) {
|
|
|
|
- b, n := utf8.encode_rune(r);
|
|
|
|
- bprint_string(buf, b[:n] as string);
|
|
|
|
-}
|
|
|
|
-
|
|
|
|
-bprint_space :: proc(buf: ^Buffer) { bprint_rune(buf, ' '); }
|
|
|
|
-bprint_nl :: proc (buf: ^Buffer) { bprint_rune(buf, '\n'); }
|
|
|
|
-
|
|
|
|
-__NUM_TO_CHAR_TABLE := "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz@$";
|
|
|
|
-
|
|
|
|
-bprint_bool :: proc(buffer: ^Buffer, b: bool) {
|
|
|
|
- bprint_string(buffer, if b { give "true" } else { give "false" });
|
|
|
|
-}
|
|
|
|
-
|
|
|
|
-bprint_pointer :: proc(buffer: ^Buffer, p: rawptr) #inline {
|
|
|
|
- bprint_string(buffer, "0x");
|
|
|
|
- bprint_u64(buffer, p as uint as u64);
|
|
|
|
-}
|
|
|
|
-
|
|
|
|
-// bprint_f16 :: proc(buffer: ^Buffer, f: f32) #inline { print__f64(buffer, f as f64, 4); }
|
|
|
|
-bprint_f32 :: proc(buffer: ^Buffer, f: f32) #inline { print__f64(buffer, f as f64, 7); }
|
|
|
|
-bprint_f64 :: proc(buffer: ^Buffer, f: f64) #inline { print__f64(buffer, f as f64, 16); }
|
|
|
|
-bprint_u64 :: proc(buffer: ^Buffer, value: u64) {
|
|
|
|
- i := value;
|
|
|
|
- buf :[20]byte;
|
|
|
|
- len := 0;
|
|
|
|
- if i == 0 {
|
|
|
|
- buf[len] = '0';
|
|
|
|
- len += 1;
|
|
|
|
- }
|
|
|
|
- while i > 0 {
|
|
|
|
- buf[len] = __NUM_TO_CHAR_TABLE[i % 10];
|
|
|
|
- len += 1;
|
|
|
|
- i /= 10;
|
|
|
|
- }
|
|
|
|
- byte_reverse(buf[:len]);
|
|
|
|
- bprint_string(buffer, buf[:len] as string);
|
|
|
|
-}
|
|
|
|
-bprint_i64 :: proc(buffer: ^Buffer, value: i64) {
|
|
|
|
- // TODO(bill): Cleanup printing
|
|
|
|
- i := value;
|
|
|
|
- if i < 0 {
|
|
|
|
- i = -i;
|
|
|
|
- bprint_rune(buffer, '-');
|
|
|
|
- }
|
|
|
|
- bprint_u64(buffer, i as u64);
|
|
|
|
-}
|
|
|
|
-
|
|
|
|
-/*
|
|
|
|
-bprint_u128 :: proc(buffer: ^Buffer, value u128) {
|
|
|
|
- a := value transmute [2]u64;
|
|
|
|
- if a[1] != 0 {
|
|
|
|
- bprint_u64(buffer, a[1]);
|
|
|
|
- }
|
|
|
|
- bprint_u64(buffer, a[0]);
|
|
|
|
-}
|
|
|
|
-bprint_i128 :: proc(buffer: ^Buffer, value i128) {
|
|
|
|
- i := value;
|
|
|
|
- if i < 0 {
|
|
|
|
- i = -i;
|
|
|
|
- bprint_rune(buffer, '-');
|
|
|
|
- }
|
|
|
|
- bprint_u128(buffer, i as u128);
|
|
|
|
-}
|
|
|
|
-*/
|
|
|
|
-
|
|
|
|
-
|
|
|
|
-print__f64 :: proc(buffer: ^Buffer, value: f64, decimal_places: int) {
|
|
|
|
- f := value;
|
|
|
|
- if f == 0 {
|
|
|
|
- bprint_rune(buffer, '0');
|
|
|
|
- return;
|
|
|
|
- }
|
|
|
|
- if f < 0 {
|
|
|
|
- bprint_rune(buffer, '-');
|
|
|
|
- f = -f;
|
|
|
|
- }
|
|
|
|
-
|
|
|
|
- i := f as u64;
|
|
|
|
- bprint_u64(buffer, i);
|
|
|
|
- f -= i as f64;
|
|
|
|
-
|
|
|
|
- bprint_rune(buffer, '.');
|
|
|
|
-
|
|
|
|
- mult: f64 = 10.0;
|
|
|
|
- while decimal_places >= 0 {
|
|
|
|
- i = (f * mult) as u64;
|
|
|
|
- bprint_u64(buffer, i as u64);
|
|
|
|
- f -= i as f64 / mult;
|
|
|
|
- mult *= 10;
|
|
|
|
- decimal_places -= 1;
|
|
|
|
- }
|
|
|
|
-}
|
|
|
|
-
|
|
|
|
-bprint_type :: proc(buf: ^Buffer, ti: ^Type_Info) {
|
|
|
|
|
|
+buffer_write_type :: proc(buf: ^Buffer, ti: ^Type_Info) {
|
|
if ti == nil {
|
|
if ti == nil {
|
|
return;
|
|
return;
|
|
}
|
|
}
|
|
@@ -179,243 +109,584 @@ bprint_type :: proc(buf: ^Buffer, ti: ^Type_Info) {
|
|
using Type_Info;
|
|
using Type_Info;
|
|
match type info : ti {
|
|
match type info : ti {
|
|
case Named:
|
|
case Named:
|
|
- bprint_string(buf, info.name);
|
|
|
|
|
|
+ buffer_write_string(buf, info.name);
|
|
case Integer:
|
|
case Integer:
|
|
match {
|
|
match {
|
|
- case ti == type_info(int): bprint_string(buf, "int");
|
|
|
|
- case ti == type_info(uint): bprint_string(buf, "uint");
|
|
|
|
|
|
+ case ti == type_info(int): buffer_write_string(buf, "int");
|
|
|
|
+ case ti == type_info(uint): buffer_write_string(buf, "uint");
|
|
default:
|
|
default:
|
|
- bprint_string(buf, if info.signed { give "i" } else { give "u"});
|
|
|
|
- bprint_u64(buf, 8*info.size as u64);
|
|
|
|
|
|
+ buffer_write_string(buf, if info.signed { give "i" } else { give "u"});
|
|
|
|
+ fi := Fmt_Info{buf = buf};
|
|
|
|
+ fmt_int(^fi, 8*info.size as u64, false, 'd');
|
|
}
|
|
}
|
|
|
|
|
|
case Float:
|
|
case Float:
|
|
match info.size {
|
|
match info.size {
|
|
- case 4: bprint_string(buf, "f32");
|
|
|
|
- case 8: bprint_string(buf, "f64");
|
|
|
|
|
|
+ case 4: buffer_write_string(buf, "f32");
|
|
|
|
+ case 8: buffer_write_string(buf, "f64");
|
|
}
|
|
}
|
|
- case String: bprint_string(buf, "string");
|
|
|
|
- case Boolean: bprint_string(buf, "bool");
|
|
|
|
|
|
+ case String: buffer_write_string(buf, "string");
|
|
|
|
+ case Boolean: buffer_write_string(buf, "bool");
|
|
case Pointer:
|
|
case Pointer:
|
|
if info.elem == nil {
|
|
if info.elem == nil {
|
|
- bprint_string(buf, "rawptr");
|
|
|
|
|
|
+ buffer_write_string(buf, "rawptr");
|
|
} else {
|
|
} else {
|
|
- bprint_string(buf, "^");
|
|
|
|
- bprint_type(buf, info.elem);
|
|
|
|
|
|
+ buffer_write_string(buf, "^");
|
|
|
|
+ buffer_write_type(buf, info.elem);
|
|
}
|
|
}
|
|
case Maybe:
|
|
case Maybe:
|
|
- bprint_string(buf, "?");
|
|
|
|
- bprint_type(buf, info.elem);
|
|
|
|
|
|
+ buffer_write_string(buf, "?");
|
|
|
|
+ buffer_write_type(buf, info.elem);
|
|
case Procedure:
|
|
case Procedure:
|
|
- bprint_string(buf, "proc");
|
|
|
|
|
|
+ buffer_write_string(buf, "proc");
|
|
if info.params == nil {
|
|
if info.params == nil {
|
|
- bprint_string(buf, "()");
|
|
|
|
|
|
+ buffer_write_string(buf, "()");
|
|
} else {
|
|
} else {
|
|
count := (info.params as ^Tuple).fields.count;
|
|
count := (info.params as ^Tuple).fields.count;
|
|
- if count == 1 { bprint_string(buf, "("); }
|
|
|
|
- bprint_type(buf, info.params);
|
|
|
|
- if count == 1 { bprint_string(buf, ")"); }
|
|
|
|
|
|
+ if count == 1 { buffer_write_string(buf, "("); }
|
|
|
|
+ buffer_write_type(buf, info.params);
|
|
|
|
+ if count == 1 { buffer_write_string(buf, ")"); }
|
|
}
|
|
}
|
|
if info.results != nil {
|
|
if info.results != nil {
|
|
- bprint_string(buf, " -> ");
|
|
|
|
- bprint_type(buf, info.results);
|
|
|
|
|
|
+ buffer_write_string(buf, " -> ");
|
|
|
|
+ buffer_write_type(buf, info.results);
|
|
}
|
|
}
|
|
case Tuple:
|
|
case Tuple:
|
|
count := info.fields.count;
|
|
count := info.fields.count;
|
|
- if count != 1 { bprint_string(buf, "("); }
|
|
|
|
|
|
+ if count != 1 { buffer_write_string(buf, "("); }
|
|
for i : 0..<count {
|
|
for i : 0..<count {
|
|
- if i > 0 { bprint_string(buf, ", "); }
|
|
|
|
|
|
+ if i > 0 { buffer_write_string(buf, ", "); }
|
|
|
|
|
|
f := info.fields[i];
|
|
f := info.fields[i];
|
|
|
|
|
|
if f.name.count > 0 {
|
|
if f.name.count > 0 {
|
|
- bprint_string(buf, f.name);
|
|
|
|
- bprint_string(buf, ": ");
|
|
|
|
|
|
+ buffer_write_string(buf, f.name);
|
|
|
|
+ buffer_write_string(buf, ": ");
|
|
}
|
|
}
|
|
- bprint_type(buf, f.type_info);
|
|
|
|
|
|
+ buffer_write_type(buf, f.type_info);
|
|
}
|
|
}
|
|
- if count != 1 { bprint_string(buf, ")"); }
|
|
|
|
|
|
+ if count != 1 { buffer_write_string(buf, ")"); }
|
|
|
|
|
|
case Array:
|
|
case Array:
|
|
- bprint_string(buf, "[");
|
|
|
|
- bprint_i64(buf, info.count as i64);
|
|
|
|
- bprint_string(buf, "]");
|
|
|
|
- bprint_type(buf, info.elem);
|
|
|
|
|
|
+ buffer_write_string(buf, "[");
|
|
|
|
+ fi := Fmt_Info{buf = buf};
|
|
|
|
+ fmt_int(^fi, info.count as u64, false, 'd');
|
|
|
|
+ buffer_write_string(buf, "]");
|
|
|
|
+ buffer_write_type(buf, info.elem);
|
|
case Slice:
|
|
case Slice:
|
|
- bprint_string(buf, "[");
|
|
|
|
- bprint_string(buf, "]");
|
|
|
|
- bprint_type(buf, info.elem);
|
|
|
|
|
|
+ buffer_write_string(buf, "[");
|
|
|
|
+ buffer_write_string(buf, "]");
|
|
|
|
+ buffer_write_type(buf, info.elem);
|
|
case Vector:
|
|
case Vector:
|
|
- bprint_string(buf, "[vector ");
|
|
|
|
- bprint_i64(buf, info.count as i64);
|
|
|
|
- bprint_string(buf, "]");
|
|
|
|
- bprint_type(buf, info.elem);
|
|
|
|
|
|
+ buffer_write_string(buf, "[vector ");
|
|
|
|
+ fi := Fmt_Info{buf = buf};
|
|
|
|
+ fmt_int(^fi, info.count as u64, false, 'd');
|
|
|
|
+ buffer_write_string(buf, "]");
|
|
|
|
+ buffer_write_type(buf, info.elem);
|
|
|
|
|
|
case Struct:
|
|
case Struct:
|
|
- bprint_string(buf, "struct ");
|
|
|
|
- if info.packed { bprint_string(buf, "#packed "); }
|
|
|
|
- if info.ordered { bprint_string(buf, "#ordered "); }
|
|
|
|
- bprint_string(buf, "{");
|
|
|
|
|
|
+ buffer_write_string(buf, "struct ");
|
|
|
|
+ if info.packed { buffer_write_string(buf, "#packed "); }
|
|
|
|
+ if info.ordered { buffer_write_string(buf, "#ordered "); }
|
|
|
|
+ buffer_write_string(buf, "{");
|
|
for field, i : info.fields {
|
|
for field, i : info.fields {
|
|
if i > 0 {
|
|
if i > 0 {
|
|
- bprint_string(buf, ", ");
|
|
|
|
|
|
+ buffer_write_string(buf, ", ");
|
|
}
|
|
}
|
|
- bprint_any(buf, field.name);
|
|
|
|
- bprint_string(buf, ": ");
|
|
|
|
- bprint_type(buf, field.type_info);
|
|
|
|
|
|
+ buffer_write_string(buf, field.name);
|
|
|
|
+ buffer_write_string(buf, ": ");
|
|
|
|
+ buffer_write_type(buf, field.type_info);
|
|
}
|
|
}
|
|
- bprint_string(buf, "}");
|
|
|
|
|
|
+ buffer_write_string(buf, "}");
|
|
|
|
|
|
case Union:
|
|
case Union:
|
|
- bprint_string(buf, "union {");
|
|
|
|
|
|
+ buffer_write_string(buf, "union {");
|
|
for field, i : info.fields {
|
|
for field, i : info.fields {
|
|
if i > 0 {
|
|
if i > 0 {
|
|
- bprint_string(buf, ", ");
|
|
|
|
|
|
+ buffer_write_string(buf, ", ");
|
|
}
|
|
}
|
|
- bprint_any(buf, field.name);
|
|
|
|
- bprint_string(buf, ": ");
|
|
|
|
- bprint_type(buf, field.type_info);
|
|
|
|
|
|
+ buffer_write_string(buf, field.name);
|
|
|
|
+ buffer_write_string(buf, ": ");
|
|
|
|
+ buffer_write_type(buf, field.type_info);
|
|
}
|
|
}
|
|
- bprint_string(buf, "}");
|
|
|
|
|
|
+ buffer_write_string(buf, "}");
|
|
|
|
|
|
case Raw_Union:
|
|
case Raw_Union:
|
|
- bprint_string(buf, "raw_union {");
|
|
|
|
|
|
+ buffer_write_string(buf, "raw_union {");
|
|
for field, i : info.fields {
|
|
for field, i : info.fields {
|
|
if i > 0 {
|
|
if i > 0 {
|
|
- bprint_string(buf, ", ");
|
|
|
|
|
|
+ buffer_write_string(buf, ", ");
|
|
}
|
|
}
|
|
- bprint_any(buf, field.name);
|
|
|
|
- bprint_string(buf, ": ");
|
|
|
|
- bprint_type(buf, field.type_info);
|
|
|
|
|
|
+ buffer_write_string(buf, field.name);
|
|
|
|
+ buffer_write_string(buf, ": ");
|
|
|
|
+ buffer_write_type(buf, field.type_info);
|
|
}
|
|
}
|
|
- bprint_string(buf, "}");
|
|
|
|
|
|
+ buffer_write_string(buf, "}");
|
|
|
|
|
|
case Enum:
|
|
case Enum:
|
|
- bprint_string(buf, "enum ");
|
|
|
|
- bprint_type(buf, info.base);
|
|
|
|
- bprint_string(buf, " {}");
|
|
|
|
|
|
+ buffer_write_string(buf, "enum ");
|
|
|
|
+ buffer_write_type(buf, info.base);
|
|
|
|
+ buffer_write_string(buf, " {}");
|
|
|
|
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
|
|
|
|
make_any :: proc(type_info: ^Type_Info, data: rawptr) -> any {
|
|
make_any :: proc(type_info: ^Type_Info, data: rawptr) -> any {
|
|
- a :any;
|
|
|
|
|
|
+ a: any;
|
|
a.type_info = type_info;
|
|
a.type_info = type_info;
|
|
a.data = data;
|
|
a.data = data;
|
|
return a;
|
|
return a;
|
|
}
|
|
}
|
|
|
|
|
|
-bprint_any :: proc(buf: ^Buffer, arg: any) {
|
|
|
|
- if arg.type_info == nil {
|
|
|
|
- bprint_string(buf, "<nil>");
|
|
|
|
- return;
|
|
|
|
|
|
+
|
|
|
|
+bprint :: proc(buf: ^Buffer, args: ...any) -> int {
|
|
|
|
+ is_type_string :: proc(info: ^Type_Info) -> bool {
|
|
|
|
+ using Type_Info;
|
|
|
|
+ if info == nil {
|
|
|
|
+ return false;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ match type i : type_info_base(info) {
|
|
|
|
+ case String:
|
|
|
|
+ return true;
|
|
|
|
+ }
|
|
|
|
+ return false;
|
|
}
|
|
}
|
|
|
|
|
|
- if arg.data == nil {
|
|
|
|
- bprint_string(buf, "<nil>");
|
|
|
|
- return;
|
|
|
|
|
|
+ fi: Fmt_Info;
|
|
|
|
+ fi.buf = buf;
|
|
|
|
+
|
|
|
|
+ prev_string := false;
|
|
|
|
+ for arg, i : args {
|
|
|
|
+ is_string := arg.data != nil && is_type_string(arg.type_info);
|
|
|
|
+ if i > 0 && !is_string && !prev_string {
|
|
|
|
+ buffer_write_rune(buf, ' ');
|
|
|
|
+ }
|
|
|
|
+ fmt_value(^fi, arg, 'v');
|
|
|
|
+ prev_string = is_string;
|
|
}
|
|
}
|
|
|
|
+ return buf.length;
|
|
|
|
+}
|
|
|
|
|
|
- using Type_Info;
|
|
|
|
- match type info : arg.type_info {
|
|
|
|
- case Named:
|
|
|
|
- a := make_any(info.base, arg.data);
|
|
|
|
- match type b : info.base {
|
|
|
|
- case Struct:
|
|
|
|
- bprint_string(buf, info.name);
|
|
|
|
- bprint_string(buf, "{");
|
|
|
|
- for f, i : b.fields {
|
|
|
|
- if i > 0 {
|
|
|
|
- bprint_string(buf, ", ");
|
|
|
|
|
|
+bprintln :: proc(buf: ^Buffer, args: ...any) -> int {
|
|
|
|
+ fi: Fmt_Info;
|
|
|
|
+ fi.buf = buf;
|
|
|
|
+
|
|
|
|
+ for arg, i : args {
|
|
|
|
+ if i > 0 {
|
|
|
|
+ buffer_write_rune(buf, ' ');
|
|
|
|
+ }
|
|
|
|
+ fmt_value(^fi, arg, 'v');
|
|
|
|
+ }
|
|
|
|
+ buffer_write_rune(buf, '\n');
|
|
|
|
+ return buf.length;
|
|
|
|
+}
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+parse_int :: proc(s: string, offset: int) -> (int, int, bool) {
|
|
|
|
+ is_digit :: proc(r: rune) -> bool #inline {
|
|
|
|
+ return '0' <= r && r <= '9';
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ result := 0;
|
|
|
|
+ ok := true;
|
|
|
|
+
|
|
|
|
+ i := 0;
|
|
|
|
+ for _ : offset..<s.count {
|
|
|
|
+ c := s[offset] as rune;
|
|
|
|
+ if !is_digit(c) {
|
|
|
|
+ break;
|
|
|
|
+ }
|
|
|
|
+ i += 1;
|
|
|
|
+
|
|
|
|
+ result *= 10;
|
|
|
|
+ result += (c - '0') as int;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ return result, offset, i != 0;
|
|
|
|
+}
|
|
|
|
+
|
|
|
|
+arg_number :: proc(fi: ^Fmt_Info, arg_index: int, format: string, offset: int, arg_count: int) -> (int, int, bool) {
|
|
|
|
+ parse_arg_number :: proc(format: string) -> (int, int, bool) {
|
|
|
|
+ if format.count < 3 {
|
|
|
|
+ return 0, 1, false;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ for i : 1..<format.count {
|
|
|
|
+ if format[i] == ']' {
|
|
|
|
+ width, new_index, ok := parse_int(format, 1);
|
|
|
|
+ if !ok || new_index != i {
|
|
|
|
+ return 0, i+1, false;
|
|
}
|
|
}
|
|
- bprint_string(buf, f.name);
|
|
|
|
- // bprint_any(buf, f.offset);
|
|
|
|
- bprint_string(buf, " = ");
|
|
|
|
- data := arg.data as ^byte + f.offset;
|
|
|
|
- bprint_any(buf, make_any(f.type_info, data));
|
|
|
|
|
|
+ return width-1, i+1, true;
|
|
}
|
|
}
|
|
- bprint_string(buf, "}");
|
|
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ return 0, 1, false;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
|
|
|
|
+ if format.count <= offset || format[offset] != '[' {
|
|
|
|
+ return arg_index, offset, false;
|
|
|
|
+ }
|
|
|
|
+ fi.reordered = true;
|
|
|
|
+ index, width, ok := parse_arg_number(format[offset:]);
|
|
|
|
+ if ok && 0 <= index && index < arg_count {
|
|
|
|
+ return index, offset+width, true;
|
|
|
|
+ }
|
|
|
|
+ fi.good_arg_index = false;
|
|
|
|
+ return arg_index, offset+width, false;
|
|
|
|
+}
|
|
|
|
+
|
|
|
|
+int_from_arg :: proc(args: []any, arg_index: int) -> (int, int, bool) {
|
|
|
|
+ num := 0;
|
|
|
|
+ new_arg_index := arg_index;
|
|
|
|
+ ok := true;
|
|
|
|
+ if arg_index < args.count {
|
|
|
|
+ arg := args[arg_index];
|
|
|
|
+ arg.type_info = type_info_base(arg.type_info);
|
|
|
|
+ match type i : arg {
|
|
|
|
+ case int: num = i;
|
|
|
|
+ case i8: num = i as int;
|
|
|
|
+ case i16: num = i as int;
|
|
|
|
+ case i32: num = i as int;
|
|
|
|
+ case i64: num = i as int;
|
|
|
|
+ case u8: num = i as int;
|
|
|
|
+ case u16: num = i as int;
|
|
|
|
+ case u32: num = i as int;
|
|
|
|
+ case u64: num = i as int;
|
|
default:
|
|
default:
|
|
- bprint_any(buf, a);
|
|
|
|
|
|
+ ok = false;
|
|
}
|
|
}
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ return num, new_arg_index, ok;
|
|
|
|
+}
|
|
|
|
|
|
- case Integer:
|
|
|
|
- match type i : arg {
|
|
|
|
- case i8: bprint_i64(buf, i as i64);
|
|
|
|
- case u8: bprint_u64(buf, i as u64);
|
|
|
|
- case i16: bprint_i64(buf, i as i64);
|
|
|
|
- case u16: bprint_u64(buf, i as u64);
|
|
|
|
- case i32: bprint_i64(buf, i as i64);
|
|
|
|
- case u32: bprint_u64(buf, i as u64);
|
|
|
|
- case i64: bprint_i64(buf, i);
|
|
|
|
- case u64: bprint_u64(buf, i);
|
|
|
|
- // case i128: bprint_i128(buf, i);
|
|
|
|
- // case u128: bprint_u128(buf, i);
|
|
|
|
|
|
|
|
- case int: bprint_i64(buf, i as i64);
|
|
|
|
- case uint: bprint_u64(buf, i as u64);
|
|
|
|
|
|
+fmt_bad_verb :: proc(using fi: ^Fmt_Info, verb: rune) {
|
|
|
|
+ buffer_write_string(buf, "%!");
|
|
|
|
+ buffer_write_rune(buf, verb);
|
|
|
|
+ buffer_write_byte(buf, '(');
|
|
|
|
+ if arg.type_info != nil {
|
|
|
|
+ buffer_write_type(buf, arg.type_info);
|
|
|
|
+ buffer_write_byte(buf, '=');
|
|
|
|
+ fmt_value(fi, arg, 'v');
|
|
|
|
+ } else {
|
|
|
|
+ buffer_write_string(buf, "<nil>");
|
|
|
|
+ }
|
|
|
|
+ buffer_write_byte(buf, ')');
|
|
|
|
+}
|
|
|
|
+
|
|
|
|
+fmt_bool :: proc(using fi: ^Fmt_Info, b: bool, verb: rune) {
|
|
|
|
+ match verb {
|
|
|
|
+ case 't', 'v':
|
|
|
|
+ buffer_write_string(buf, if b { give "true" } else { give "false" });
|
|
|
|
+ default:
|
|
|
|
+ fmt_bad_verb(fi, verb);
|
|
|
|
+ }
|
|
|
|
+}
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+fmt_write_padding :: proc(fi: ^Fmt_Info, width: int) {
|
|
|
|
+ if width <= 0 {
|
|
|
|
+ return;
|
|
|
|
+ }
|
|
|
|
+ pad_byte: byte = ' ';
|
|
|
|
+ if fi.zero {
|
|
|
|
+ pad_byte = '0';
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ count := min(width, fi.buf.data.count-fi.buf.length);
|
|
|
|
+ start := fi.buf.length;
|
|
|
|
+ for i : start..<count {
|
|
|
|
+ fi.buf.data[i] = pad_byte;
|
|
|
|
+ }
|
|
|
|
+ fi.buf.length += count;
|
|
|
|
+}
|
|
|
|
+
|
|
|
|
+fmt_integer :: proc(fi: ^Fmt_Info, u: u64, base: int, signed: bool, digits: string) {
|
|
|
|
+ negative := signed && (u as i64) < 0;
|
|
|
|
+ if negative {
|
|
|
|
+ u = -u;
|
|
|
|
+ }
|
|
|
|
+ buf: [256]byte;
|
|
|
|
+ if fi.width_set || fi.prec_set {
|
|
|
|
+ width := fi.width + fi.prec + 3;
|
|
|
|
+ if width > buf.count {
|
|
|
|
+ // TODO(bill):????
|
|
|
|
+ panic("fmt_integer buffer overrun. Width and precision too big");
|
|
}
|
|
}
|
|
|
|
+ }
|
|
|
|
|
|
- case Float:
|
|
|
|
- match type f : arg {
|
|
|
|
- // case f16: bprint_f64(buf, f as f64);
|
|
|
|
- case f32: bprint_f32(buf, f);
|
|
|
|
- case f64: bprint_f64(buf, f);
|
|
|
|
- // case f128: bprint_f64(buf, f as f64);
|
|
|
|
|
|
+ prec := 0;
|
|
|
|
+ if fi.prec_set {
|
|
|
|
+ prec = fi.prec;
|
|
|
|
+ if prec == 0 && u == 0 {
|
|
|
|
+ old_zero := fi.zero;
|
|
|
|
+ fi.zero = false;
|
|
|
|
+ fmt_write_padding(fi, fi.width);
|
|
|
|
+ fi.zero = old_zero;
|
|
|
|
+ return;
|
|
|
|
+ }
|
|
|
|
+ } else if fi.zero && fi.width_set {
|
|
|
|
+ prec = fi.width;
|
|
|
|
+ if negative || fi.plus || fi.space {
|
|
|
|
+ // There needs to be space for the "sign"
|
|
|
|
+ prec -= 1;
|
|
}
|
|
}
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ i := buf.count;
|
|
|
|
|
|
- case String:
|
|
|
|
- match type s : arg {
|
|
|
|
- case string: bprint_string(buf, s);
|
|
|
|
|
|
+ match base {
|
|
|
|
+ case 2, 8, 10, 16:
|
|
|
|
+ break;
|
|
|
|
+ default:
|
|
|
|
+ panic("fmt_integer: unknown base, whoops");
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ while b := base as u64; u >= b {
|
|
|
|
+ i -= 1;
|
|
|
|
+ next := u / b;
|
|
|
|
+ buf[i] = digits[u%b];
|
|
|
|
+ u = next;
|
|
|
|
+ }
|
|
|
|
+ i -= 1;
|
|
|
|
+ buf[i] = digits[u];
|
|
|
|
+ while i > 0 && prec > buf.count-i {
|
|
|
|
+ i -= 1;
|
|
|
|
+ buf[i] = '0';
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ if fi.hash {
|
|
|
|
+ i -= 1;
|
|
|
|
+ match base {
|
|
|
|
+ case 2: buf[i] = 'b';
|
|
|
|
+ case 8: buf[i] = 'o';
|
|
|
|
+ case 10: buf[i] = 'd';
|
|
|
|
+ case 16: buf[i] = digits[16];
|
|
}
|
|
}
|
|
|
|
+ i -= 1;
|
|
|
|
+ buf[i] = '0';
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ if negative {
|
|
|
|
+ i -= 1;
|
|
|
|
+ buf[i] = '-';
|
|
|
|
+ } else if fi.plus {
|
|
|
|
+ i -= 1;
|
|
|
|
+ buf[i] = '+';
|
|
|
|
+ } else if fi.space {
|
|
|
|
+ i -= 1;
|
|
|
|
+ buf[i] = ' ';
|
|
|
|
+ }
|
|
|
|
|
|
- case Boolean:
|
|
|
|
- match type b : arg {
|
|
|
|
- case bool: bprint_bool(buf, b);
|
|
|
|
|
|
+ old_zero := fi.zero;
|
|
|
|
+ defer fi.zero = old_zero;
|
|
|
|
+ fi.zero = false;
|
|
|
|
+
|
|
|
|
+ if !fi.width_set || fi.width == 0 {
|
|
|
|
+ buffer_write(fi.buf, buf[i:]);
|
|
|
|
+ } else {
|
|
|
|
+ width := fi.width - utf8.rune_count(buf[i:] as string);
|
|
|
|
+ if fi.minus {
|
|
|
|
+ // Right pad
|
|
|
|
+ buffer_write(fi.buf, buf[i:]);
|
|
|
|
+ fmt_write_padding(fi, width);
|
|
|
|
+ } else {
|
|
|
|
+ // Left pad
|
|
|
|
+ fmt_write_padding(fi, width);
|
|
|
|
+ buffer_write(fi.buf, buf[i:]);
|
|
}
|
|
}
|
|
|
|
+ }
|
|
|
|
|
|
- case Pointer:
|
|
|
|
- match type p : arg {
|
|
|
|
- case ^Type_Info: bprint_type(buf, p);
|
|
|
|
- default: bprint_pointer(buf, (arg.data as ^rawptr)^);
|
|
|
|
|
|
+}
|
|
|
|
+
|
|
|
|
+__DIGITS_LOWER := "0123456789abcdefx";
|
|
|
|
+__DIGITS_UPPER := "0123456789ABCDEFX";
|
|
|
|
+
|
|
|
|
+fmt_rune :: proc(fi: ^Fmt_Info, r: rune) {
|
|
|
|
+ buffer_write_rune(fi.buf, r);
|
|
|
|
+}
|
|
|
|
+
|
|
|
|
+fmt_int :: proc(fi: ^Fmt_Info, u: u64, signed: bool, verb: rune) {
|
|
|
|
+ match verb {
|
|
|
|
+ case 'v': fmt_integer(fi, u, 10, signed, __DIGITS_LOWER);
|
|
|
|
+ case 'b': fmt_integer(fi, u, 2, signed, __DIGITS_LOWER);
|
|
|
|
+ case 'o': fmt_integer(fi, u, 8, signed, __DIGITS_LOWER);
|
|
|
|
+ case 'd': fmt_integer(fi, u, 10, signed, __DIGITS_LOWER);
|
|
|
|
+ case 'x': fmt_integer(fi, u, 16, signed, __DIGITS_LOWER);
|
|
|
|
+ case 'X': fmt_integer(fi, u, 16, signed, __DIGITS_UPPER);
|
|
|
|
+ case 'c': fmt_rune(fi, u as rune);
|
|
|
|
+ case 'U':
|
|
|
|
+ r := u as rune;
|
|
|
|
+ if r < 0 || r > utf8.MAX_RUNE {
|
|
|
|
+ fmt_bad_verb(fi, verb);
|
|
|
|
+ } else {
|
|
|
|
+ buffer_write_string(fi.buf, "U+");
|
|
|
|
+ fmt_integer(fi, u, 16, false, __DIGITS_UPPER);
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ default:
|
|
|
|
+ fmt_bad_verb(fi, verb);
|
|
|
|
+ }
|
|
|
|
+}
|
|
|
|
+fmt_float :: proc(fi: ^Fmt_Info, v: f64, bits: int, verb: rune) {
|
|
|
|
+ // TODO(bill): Actually print a float correctly
|
|
|
|
+ // THIS IS FUCKING SHIT!
|
|
|
|
+
|
|
|
|
+ match verb {
|
|
|
|
+ case 'e', 'E', 'f', 'F', 'g', 'G':
|
|
|
|
+ break;
|
|
|
|
+ default:
|
|
|
|
+ fmt_bad_verb(fi, verb);
|
|
|
|
+ return;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ f := v;
|
|
|
|
+
|
|
|
|
+ if f == 0 {
|
|
|
|
+ buffer_write_byte(fi.buf, '0');
|
|
|
|
+ return;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ if f < 0 {
|
|
|
|
+ buffer_write_byte(fi.buf, '-');
|
|
|
|
+ f = -f;
|
|
|
|
+ }
|
|
|
|
+ i := f as u64;
|
|
|
|
+ fmt_int(fi, i, false, 'd');
|
|
|
|
+ f -= i as f64;
|
|
|
|
+ buffer_write_byte(fi.buf, '.');
|
|
|
|
+
|
|
|
|
+ decimal_places := 5;
|
|
|
|
+ if bits == 64 {
|
|
|
|
+ decimal_places = 9;
|
|
|
|
+ }
|
|
|
|
+ if fi.prec_set {
|
|
|
|
+ decimal_places = fi.prec;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ while mult: f64 = 10.0; decimal_places >= 0 {
|
|
|
|
+ i = (f * mult) as u64;
|
|
|
|
+ fmt_int(fi, i, false, 'd');
|
|
|
|
+ f -= i as f64 / mult;
|
|
|
|
+ mult *= 10;
|
|
|
|
+ decimal_places -= 1;
|
|
|
|
+ }
|
|
|
|
+}
|
|
|
|
+fmt_string :: proc(fi: ^Fmt_Info, s: string, verb: rune) {
|
|
|
|
+ match verb {
|
|
|
|
+ case 'v', 's':
|
|
|
|
+ buffer_write_string(fi.buf, s);
|
|
|
|
+ default:
|
|
|
|
+ fmt_bad_verb(fi, verb);
|
|
|
|
+ }
|
|
|
|
+}
|
|
|
|
+
|
|
|
|
+fmt_pointer :: proc(fi: ^Fmt_Info, p: rawptr, verb: rune) {
|
|
|
|
+ if verb != 'p' {
|
|
|
|
+ fmt_bad_verb(fi, verb);
|
|
|
|
+ return;
|
|
|
|
+ }
|
|
|
|
+ u := p as uint as u64;
|
|
|
|
+ if !fi.hash {
|
|
|
|
+ buffer_write_string(fi.buf, "0x");
|
|
|
|
+ }
|
|
|
|
+ fmt_integer(fi, u, 16, false, __DIGITS_UPPER);
|
|
|
|
+}
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+fmt_value :: proc(fi: ^Fmt_Info, v: any, verb: rune) {
|
|
|
|
+ if v.data == nil || v.type_info == nil {
|
|
|
|
+ buffer_write_string(fi.buf, "<nil>");
|
|
|
|
+ return;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ using Type_Info;
|
|
|
|
+ match type info : v.type_info {
|
|
|
|
+ case Named:
|
|
|
|
+ if verb != 'v' {
|
|
|
|
+ fmt_bad_verb(fi, verb);
|
|
|
|
+ return;
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ a := make_any(info.base, v.data);
|
|
|
|
+ match type b : info.base {
|
|
|
|
+ case Struct:
|
|
|
|
+ buffer_write_string(fi.buf, info.name);
|
|
|
|
+ buffer_write_byte(fi.buf, '{');
|
|
|
|
+ for f, i : b.fields {
|
|
|
|
+ if i > 0 {
|
|
|
|
+ buffer_write_string(fi.buf, ", ");
|
|
|
|
+ }
|
|
|
|
+ buffer_write_string(fi.buf, f.name);
|
|
|
|
+ // bprint_any(fi.buf, f.offset);
|
|
|
|
+ buffer_write_string(fi.buf, " = ");
|
|
|
|
+ data := v.data as ^byte + f.offset;
|
|
|
|
+ fmt_arg(fi, make_any(f.type_info, data), 'v');
|
|
|
|
+ }
|
|
|
|
+ buffer_write_byte(fi.buf, '}');
|
|
|
|
+
|
|
|
|
+ default:
|
|
|
|
+ fmt_value(fi, a, verb);
|
|
}
|
|
}
|
|
|
|
|
|
|
|
+ case Boolean: fmt_arg(fi, v, verb);
|
|
|
|
+ case Float: fmt_arg(fi, v, verb);
|
|
|
|
+ case Integer: fmt_arg(fi, v, verb);
|
|
|
|
+ case String: fmt_arg(fi, v, verb);
|
|
|
|
+
|
|
|
|
+ case Pointer:
|
|
|
|
+ fmt_pointer(fi, (v.data as ^rawptr)^, verb);
|
|
|
|
+
|
|
case Maybe:
|
|
case Maybe:
|
|
|
|
+ // TODO(bill): Correct verbs for Maybe types?
|
|
size := mem.size_of_type_info(info.elem);
|
|
size := mem.size_of_type_info(info.elem);
|
|
- data := slice_ptr(arg.data as ^byte, size+1);
|
|
|
|
|
|
+ data := slice_ptr(v.data as ^byte, size+1);
|
|
if data[size] != 0 {
|
|
if data[size] != 0 {
|
|
- bprint_any(buf, make_any(info.elem, arg.data));
|
|
|
|
|
|
+ fmt_arg(fi, make_any(info.elem, v.data), verb);
|
|
} else {
|
|
} else {
|
|
- bprint_string(buf, "nil");
|
|
|
|
|
|
+ buffer_write_string(fi.buf, "nil");
|
|
}
|
|
}
|
|
|
|
|
|
case Array:
|
|
case Array:
|
|
- bprintf(buf, "[%]%{", info.count, info.elem);
|
|
|
|
- defer bprint_string(buf, "}");
|
|
|
|
|
|
+ if verb != 'v' {
|
|
|
|
+ fmt_bad_verb(fi, verb);
|
|
|
|
+ return;
|
|
|
|
+ }
|
|
|
|
|
|
|
|
+ buffer_write_byte(fi.buf, '[');
|
|
|
|
+ defer buffer_write_byte(fi.buf, ']');
|
|
for i : 0..<info.count {
|
|
for i : 0..<info.count {
|
|
if i > 0 {
|
|
if i > 0 {
|
|
- bprint_string(buf, ", ");
|
|
|
|
|
|
+ buffer_write_string(fi.buf, ", ");
|
|
}
|
|
}
|
|
-
|
|
|
|
- data := arg.data as ^byte + i*info.elem_size;
|
|
|
|
- bprint_any(buf, make_any(info.elem, data));
|
|
|
|
|
|
+ data := v.data as ^byte + i*info.elem_size;
|
|
|
|
+ fmt_arg(fi, make_any(info.elem, data), 'v');
|
|
}
|
|
}
|
|
|
|
|
|
case Slice:
|
|
case Slice:
|
|
- slice := arg.data as ^[]byte;
|
|
|
|
- bprintf(buf, "[]%{", info.elem);
|
|
|
|
- defer bprint_string(buf, "}");
|
|
|
|
|
|
+ if verb != 'v' {
|
|
|
|
+ fmt_bad_verb(fi, verb);
|
|
|
|
+ return;
|
|
|
|
+ }
|
|
|
|
|
|
|
|
+ buffer_write_byte(fi.buf, '[');
|
|
|
|
+ defer buffer_write_byte(fi.buf, ']');
|
|
|
|
+ slice := v.data as ^[]byte;
|
|
for i : 0..<slice.count {
|
|
for i : 0..<slice.count {
|
|
if i > 0 {
|
|
if i > 0 {
|
|
- bprint_string(buf, ", ");
|
|
|
|
|
|
+ buffer_write_string(fi.buf, ", ");
|
|
}
|
|
}
|
|
-
|
|
|
|
data := slice.data + i*info.elem_size;
|
|
data := slice.data + i*info.elem_size;
|
|
- bprint_any(buf, make_any(info.elem, data));
|
|
|
|
|
|
+ fmt_arg(fi, make_any(info.elem, data), 'v');
|
|
}
|
|
}
|
|
|
|
|
|
case Vector:
|
|
case Vector:
|
|
@@ -429,8 +700,8 @@ bprint_any :: proc(buf: ^Buffer, arg: any) {
|
|
return false;
|
|
return false;
|
|
}
|
|
}
|
|
|
|
|
|
- bprintf(buf, "[vector %]%{", info.count, info.elem);
|
|
|
|
- defer bprint_string(buf, "}");
|
|
|
|
|
|
+ buffer_write_byte(fi.buf, '<');
|
|
|
|
+ defer buffer_write_byte(fi.buf, '>');
|
|
|
|
|
|
if is_bool(info.elem) {
|
|
if is_bool(info.elem) {
|
|
return;
|
|
return;
|
|
@@ -438,144 +709,215 @@ bprint_any :: proc(buf: ^Buffer, arg: any) {
|
|
|
|
|
|
for i : 0..<info.count {
|
|
for i : 0..<info.count {
|
|
if i > 0 {
|
|
if i > 0 {
|
|
- bprint_string(buf, ", ");
|
|
|
|
|
|
+ buffer_write_string(fi.buf, ", ");
|
|
}
|
|
}
|
|
|
|
|
|
- data := arg.data as ^byte + i*info.elem_size;
|
|
|
|
- bprint_any(buf, make_any(info.elem, data));
|
|
|
|
|
|
+ data := v.data as ^byte + i*info.elem_size;
|
|
|
|
+ fmt_value(fi, make_any(info.elem, data), 'v');
|
|
}
|
|
}
|
|
|
|
|
|
-
|
|
|
|
case Struct:
|
|
case Struct:
|
|
- bprintf(buf, "%{", arg.type_info);
|
|
|
|
- defer bprint_string(buf, "}");
|
|
|
|
|
|
+ buffer_write_byte(fi.buf, '{');
|
|
|
|
+ defer buffer_write_byte(fi.buf, '}');
|
|
|
|
|
|
for f, i : info.fields {
|
|
for f, i : info.fields {
|
|
if i > 0 {
|
|
if i > 0 {
|
|
- bprint_string(buf, ", ");
|
|
|
|
|
|
+ buffer_write_string(fi.buf, ", ");
|
|
}
|
|
}
|
|
- bprint_string(buf, f.name);
|
|
|
|
- bprint_string(buf, " = ");
|
|
|
|
- data := arg.data as ^byte + f.offset;
|
|
|
|
|
|
+ buffer_write_string(fi.buf, f.name);
|
|
|
|
+ buffer_write_string(fi.buf, " = ");
|
|
|
|
+ data := v.data as ^byte + f.offset;
|
|
ti := f.type_info;
|
|
ti := f.type_info;
|
|
- bprint_any(buf, make_any(ti, data));
|
|
|
|
|
|
+ fmt_value(fi, make_any(ti, data), 'v');
|
|
}
|
|
}
|
|
|
|
|
|
case Union:
|
|
case Union:
|
|
- bprint_string(buf, "(union)");
|
|
|
|
|
|
+ buffer_write_string(fi.buf, "(union)");
|
|
case Raw_Union:
|
|
case Raw_Union:
|
|
- bprint_string(buf, "(raw_union)");
|
|
|
|
|
|
+ buffer_write_string(fi.buf, "(raw_union)");
|
|
|
|
|
|
case Enum:
|
|
case Enum:
|
|
- bprint_any(buf, make_any(info.base, arg.data));
|
|
|
|
|
|
+ fmt_value(fi, make_any(info.base, v.data), verb);
|
|
|
|
|
|
case Procedure:
|
|
case Procedure:
|
|
- bprint_type(buf, arg.type_info);
|
|
|
|
- bprint_string(buf, " @ ");
|
|
|
|
- bprint_pointer(buf, (arg.data as ^rawptr)^);
|
|
|
|
|
|
+ buffer_write_type(fi.buf, v.type_info);
|
|
|
|
+ buffer_write_string(fi.buf, " @ ");
|
|
|
|
+ fmt_pointer(fi, (v.data as ^rawptr)^, 'p');
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
|
|
+fmt_arg :: proc(fi: ^Fmt_Info, arg: any, verb: rune) {
|
|
|
|
+ if arg.data == nil || arg.type_info == nil {
|
|
|
|
+ buffer_write_string(fi.buf, "<nil>");
|
|
|
|
+ return;
|
|
|
|
+ }
|
|
|
|
+ fi.arg = arg;
|
|
|
|
|
|
-bprintf :: proc(buf: ^Buffer, fmt: string, args: ...any) -> int {
|
|
|
|
- is_digit :: proc(r: rune) -> bool #inline {
|
|
|
|
- return '0' <= r && r <= '9';
|
|
|
|
|
|
+ if verb == 'T' { // Type Info
|
|
|
|
+ buffer_write_type(fi.buf, arg.type_info);
|
|
|
|
+ return;
|
|
}
|
|
}
|
|
|
|
|
|
- parse_int :: proc(s: string, offset: int) -> (int, int) {
|
|
|
|
- result := 0;
|
|
|
|
|
|
+ base_arg := arg;
|
|
|
|
+ base_arg.type_info = type_info_base(base_arg.type_info);
|
|
|
|
+ match type a : base_arg {
|
|
|
|
+ case bool: fmt_bool(fi, a, verb);
|
|
|
|
+ case f32: fmt_float(fi, a as f64, 32, verb);
|
|
|
|
+ case f64: fmt_float(fi, a, 64, verb);
|
|
|
|
+
|
|
|
|
+ case int: fmt_int(fi, a as u64, true, verb);
|
|
|
|
+ case i8: fmt_int(fi, a as u64, true, verb);
|
|
|
|
+ case i16: fmt_int(fi, a as u64, true, verb);
|
|
|
|
+ case i32: fmt_int(fi, a as u64, true, verb);
|
|
|
|
+ case i64: fmt_int(fi, a as u64, true, verb);
|
|
|
|
+ case uint: fmt_int(fi, a as u64, false, verb);
|
|
|
|
+ case u8: fmt_int(fi, a as u64, false, verb);
|
|
|
|
+ case u16: fmt_int(fi, a as u64, false, verb);
|
|
|
|
+ case u32: fmt_int(fi, a as u64, false, verb);
|
|
|
|
+ case u64: fmt_int(fi, a as u64, false, verb);
|
|
|
|
+ case string: fmt_string(fi, a, verb);
|
|
|
|
+ default: fmt_value(fi, arg, verb);
|
|
|
|
+ }
|
|
|
|
|
|
- for _ : offset..<s.count {
|
|
|
|
- c := s[offset] as rune;
|
|
|
|
- if !is_digit(c) {
|
|
|
|
- break;
|
|
|
|
- }
|
|
|
|
|
|
+}
|
|
|
|
|
|
- result *= 10;
|
|
|
|
- result += (c - '0') as int;
|
|
|
|
- }
|
|
|
|
|
|
|
|
- return result, offset;
|
|
|
|
- }
|
|
|
|
|
|
+bprintf :: proc(b: ^Buffer, fmt: string, args: ...any) -> int {
|
|
|
|
+ fi := Fmt_Info{};
|
|
|
|
+ end := fmt.count;
|
|
|
|
+ arg_index := 0;
|
|
|
|
+ was_prev_index := false;
|
|
|
|
+ while i := 0; i < end {
|
|
|
|
+ fi = Fmt_Info{buf = b, good_arg_index = true};
|
|
|
|
|
|
- prev := 0;
|
|
|
|
- implicit_index := 0;
|
|
|
|
|
|
+ prev_i := i;
|
|
|
|
+ while i < end && fmt[i] != '%' {
|
|
|
|
+ i += 1;
|
|
|
|
+ }
|
|
|
|
+ if i > prev_i {
|
|
|
|
+ buffer_write_string(b, fmt[prev_i:i]);
|
|
|
|
+ }
|
|
|
|
+ if i >= end {
|
|
|
|
+ break;
|
|
|
|
+ }
|
|
|
|
|
|
- while i := 0; i < fmt.count { defer i += 1;
|
|
|
|
- r := fmt[i] as rune;
|
|
|
|
- index := implicit_index;
|
|
|
|
|
|
+ // Process a "verb"
|
|
|
|
+ i += 1;
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+ while i < end {
|
|
|
|
+ skip_loop := false;
|
|
|
|
+ c := fmt[i];
|
|
|
|
+ match c {
|
|
|
|
+ case '+':
|
|
|
|
+ fi.plus = true;
|
|
|
|
+ case '-':
|
|
|
|
+ fi.minus = true;
|
|
|
|
+ fi.zero = false;
|
|
|
|
+ case ' ':
|
|
|
|
+ fi.space = true;
|
|
|
|
+ case '#':
|
|
|
|
+ fi.hash = true;
|
|
|
|
+ case '0':
|
|
|
|
+ fi.zero = !fi.minus;
|
|
|
|
+ default:
|
|
|
|
+ skip_loop = true;
|
|
|
|
+ }
|
|
|
|
|
|
- if r != '%' {
|
|
|
|
- continue;
|
|
|
|
|
|
+ if skip_loop {
|
|
|
|
+ break;
|
|
|
|
+ }
|
|
|
|
+ i += 1;
|
|
}
|
|
}
|
|
|
|
|
|
- bprint_string(buf, fmt[prev:i]);
|
|
|
|
- i += 1; // Skip %
|
|
|
|
- if i < fmt.count {
|
|
|
|
- next := fmt[i] as rune;
|
|
|
|
|
|
+ arg_index, i, was_prev_index = arg_number(^fi, arg_index, fmt, i, args.count);
|
|
|
|
|
|
- if next == '%' {
|
|
|
|
- bprint_string(buf, "%");
|
|
|
|
- i += 1;
|
|
|
|
- prev = i;
|
|
|
|
- continue;
|
|
|
|
|
|
+ // Width
|
|
|
|
+ if i < end && fmt[i] == '*' {
|
|
|
|
+ i += 1;
|
|
|
|
+ fi.width, arg_index, fi.width_set = int_from_arg(args, arg_index);
|
|
|
|
+ if !fi.width_set {
|
|
|
|
+ buffer_write_string(b, "%!(BAD WIDTH)");
|
|
}
|
|
}
|
|
|
|
|
|
- if is_digit(next) {
|
|
|
|
- index, i = parse_int(fmt, i);
|
|
|
|
|
|
+ if fi.width < 0 {
|
|
|
|
+ fi.width = -fi.width;
|
|
|
|
+ fi.minus = true;
|
|
|
|
+ fi.zero = false;
|
|
}
|
|
}
|
|
- }
|
|
|
|
-
|
|
|
|
- if 0 <= index && index < args.count {
|
|
|
|
- bprint_any(buf, args[index]);
|
|
|
|
- implicit_index = index+1;
|
|
|
|
|
|
+ was_prev_index = false;
|
|
} else {
|
|
} else {
|
|
- // TODO(bill): Error check index out bounds
|
|
|
|
- bprint_string(buf, "<invalid>");
|
|
|
|
|
|
+ fi.width, i, fi.width_set = parse_int(fmt, i);
|
|
|
|
+ if was_prev_index && fi.width_set { // %[6]2d
|
|
|
|
+ fi.good_arg_index = false;
|
|
|
|
+ }
|
|
}
|
|
}
|
|
|
|
|
|
- prev = i;
|
|
|
|
- }
|
|
|
|
-
|
|
|
|
- bprint_string(buf, fmt[prev:]);
|
|
|
|
- return buf.length;
|
|
|
|
-}
|
|
|
|
-
|
|
|
|
|
|
+ // Precision
|
|
|
|
+ if i < end && fmt[i] == '.' {
|
|
|
|
+ i += 1;
|
|
|
|
+ if was_prev_index { // %[6].2d
|
|
|
|
+ fi.good_arg_index = false;
|
|
|
|
+ }
|
|
|
|
+ arg_index, i, was_prev_index = arg_number(^fi, arg_index, fmt, i, args.count);
|
|
|
|
+ if i < end && fmt[i] == '*' {
|
|
|
|
+ i += 1;
|
|
|
|
+ fi.prec, arg_index, fi.prec_set = int_from_arg(args, arg_index);
|
|
|
|
+ if fi.prec < 0 {
|
|
|
|
+ fi.prec = 0;
|
|
|
|
+ fi.prec_set = false;
|
|
|
|
+ }
|
|
|
|
+ if !fi.prec_set {
|
|
|
|
+ buffer_write_string(fi.buf, "%!(BAD PRECISION)");
|
|
|
|
+ }
|
|
|
|
+ was_prev_index = false;
|
|
|
|
+ } else {
|
|
|
|
+ fi.prec, i, fi.prec_set = parse_int(fmt, i);
|
|
|
|
+ if !fi.prec_set {
|
|
|
|
+ fi.prec_set = true;
|
|
|
|
+ fi.prec = 0;
|
|
|
|
+ }
|
|
|
|
+ }
|
|
|
|
+ }
|
|
|
|
|
|
-bprint :: proc(buf: ^Buffer, args: ...any) -> int {
|
|
|
|
- is_type_string :: proc(info: ^Type_Info) -> bool {
|
|
|
|
- using Type_Info;
|
|
|
|
- if info == nil {
|
|
|
|
- return false;
|
|
|
|
|
|
+ if !was_prev_index {
|
|
|
|
+ arg_index, i, was_prev_index = arg_number(^fi, arg_index, fmt, i, args.count);
|
|
}
|
|
}
|
|
|
|
|
|
- match type i : type_info_base(info) {
|
|
|
|
- case String:
|
|
|
|
- return true;
|
|
|
|
|
|
+ if i >= end {
|
|
|
|
+ buffer_write_string(b, "%!(NO VERB)");
|
|
|
|
+ break;
|
|
}
|
|
}
|
|
- return false;
|
|
|
|
- }
|
|
|
|
|
|
|
|
|
|
+ verb, w := utf8.decode_rune(fmt[i:]);
|
|
|
|
+ i += w;
|
|
|
|
|
|
- prev_string := false;
|
|
|
|
- for arg, i : args {
|
|
|
|
- is_string := arg.data != nil && is_type_string(arg.type_info);
|
|
|
|
- if i > 0 && !is_string && !prev_string {
|
|
|
|
- bprint_space(buf);
|
|
|
|
|
|
+ if verb == '%' {
|
|
|
|
+ buffer_write_byte(b, '%');
|
|
|
|
+ } else if !fi.good_arg_index {
|
|
|
|
+ buffer_write_string(b, "%!(BAD ARGUMENT NUMBER)");
|
|
|
|
+ } else if arg_index >= args.count {
|
|
|
|
+ buffer_write_string(b, "%!(MISSING ARGUMENT)");
|
|
|
|
+ } else {
|
|
|
|
+ fmt_arg(^fi, args[arg_index], verb);
|
|
|
|
+ arg_index += 1;
|
|
}
|
|
}
|
|
- bprint_any(buf, arg);
|
|
|
|
- prev_string = is_string;
|
|
|
|
}
|
|
}
|
|
- return buf.length;
|
|
|
|
-}
|
|
|
|
|
|
|
|
-bprintln :: proc(buf: ^Buffer, args: ...any) -> int {
|
|
|
|
- for arg, i : args {
|
|
|
|
- if i > 0 {
|
|
|
|
- bprint_space(buf);
|
|
|
|
|
|
+ if !fi.reordered && arg_index < args.count {
|
|
|
|
+ buffer_write_string(b, "%!(EXTRA ");
|
|
|
|
+ for arg, index : args[arg_index:] {
|
|
|
|
+ if index > 0 {
|
|
|
|
+ buffer_write_string(b, ", ");
|
|
|
|
+ }
|
|
|
|
+ if arg.data == nil || arg.type_info == nil {
|
|
|
|
+ buffer_write_string(b, "<nil>");
|
|
|
|
+ } else {
|
|
|
|
+ fmt_arg(^fi, arg, 'v');
|
|
|
|
+ }
|
|
}
|
|
}
|
|
- bprint_any(buf, arg);
|
|
|
|
|
|
+ buffer_write_string(b, ")");
|
|
}
|
|
}
|
|
- bprint_nl(buf);
|
|
|
|
- return buf.length;
|
|
|
|
|
|
+
|
|
|
|
+ return b.length;
|
|
}
|
|
}
|