ed/Odin
1
0
Fork 0
mirror of https://github.com/Ed94/Odin.git synced 2026-08-05 23:28:48 +00:00
Code Issues Packages Projects Releases Wiki Activity

Nearly finished Jai-like declarations

Browse Source
This commit is contained in:
Ginger Bill
2017-01-01 20:41:10 +00:00
parent a48e0c7179
commit 9202bd1b06
18 changed files with 858 additions and 1074 deletions
Download Patch File Download Diff File Expand all files Collapse all files
core/mem.odin
+38 -40
View File
@@ -3,32 +3,31 @@ import {
"os.odin";
}
proc set(data rawptr, value i32, len int) -> rawptr #link_name "__mem_set" {
proc llvm_memset_64bit(dst rawptr, val byte, len int, align i32, is_volatile bool) #foreign "llvm.memset.p0i8.i64"
set :: proc(data rawptr, value i32, len int) -> rawptr #link_name "__mem_set" {
llvm_memset_64bit :: proc(dst rawptr, val byte, len int, align i32, is_volatile bool) #foreign "llvm.memset.p0i8.i64"
llvm_memset_64bit(data, value as byte, len, 1, false);
return data;
}
proc zero(data rawptr, len int) -> rawptr #link_name "__mem_zero" {
zero :: proc(data rawptr, len int) -> rawptr #link_name "__mem_zero" {
return set(data, 0, len);
}
proc copy(dst, src rawptr, len int) -> rawptr #link_name "__mem_copy" {
copy :: proc(dst, src rawptr, len int) -> rawptr #link_name "__mem_copy" {
// NOTE(bill): This _must_ implemented like C's memmove
proc llvm_memmove_64bit(dst, src rawptr, len int, align i32, is_volatile bool) #foreign "llvm.memmove.p0i8.p0i8.i64"
llvm_memmove_64bit :: proc(dst, src rawptr, len int, align i32, is_volatile bool) #foreign "llvm.memmove.p0i8.p0i8.i64"
llvm_memmove_64bit(dst, src, len, 1, false);
return dst;
}
proc copy_non_overlapping(dst, src rawptr, len int) -> rawptr #link_name "__mem_copy_non_overlapping" {
copy_non_overlapping :: proc(dst, src rawptr, len int) -> rawptr #link_name "__mem_copy_non_overlapping" {
// NOTE(bill): This _must_ implemented like C's memcpy
proc llvm_memcpy_64bit(dst, src rawptr, len int, align i32, is_volatile bool) #foreign "llvm.memcpy.p0i8.p0i8.i64"
llvm_memcpy_64bit :: proc(dst, src rawptr, len int, align i32, is_volatile bool) #foreign "llvm.memcpy.p0i8.p0i8.i64"
llvm_memcpy_64bit(dst, src, len, 1, false);
return dst;
}
proc compare(dst, src rawptr, n int) -> int #link_name "__mem_compare" {
compare :: proc(dst, src rawptr, n int) -> int #link_name "__mem_compare" {
// Translation of http://mgronhol.github.io/fast-strcmp/
a := slice_ptr(dst as ^byte, n);
b := slice_ptr(src as ^byte, n);
@@ -65,19 +64,19 @@ proc compare(dst, src rawptr, n int) -> int #link_name "__mem_compare" {
proc kilobytes(x int) -> int #inline { return (x) * 1024; }
proc megabytes(x int) -> int #inline { return kilobytes(x) * 1024; }
proc gigabytes(x int) -> int #inline { return gigabytes(x) * 1024; }
proc terabytes(x int) -> int #inline { return terabytes(x) * 1024; }
kilobytes :: proc(x int) -> int #inline { return (x) * 1024; }
megabytes :: proc(x int) -> int #inline { return kilobytes(x) * 1024; }
gigabytes :: proc(x int) -> int #inline { return gigabytes(x) * 1024; }
terabytes :: proc(x int) -> int #inline { return terabytes(x) * 1024; }
proc is_power_of_two(x int) -> bool {
is_power_of_two :: proc(x int) -> bool {
if x <= 0 {
return false;
}
return (x & (x-1)) == 0;
}
proc align_forward(ptr rawptr, align int) -> rawptr {
align_forward :: proc(ptr rawptr, align int) -> rawptr {
assert(is_power_of_two(align));
a := align as uint;
@@ -91,11 +90,11 @@ proc align_forward(ptr rawptr, align int) -> rawptr {
type Allocation_Header struct {
Allocation_Header :: struct {
size int;
}
proc allocation_header_fill(header ^Allocation_Header, data rawptr, size int) {
allocation_header_fill :: proc(header ^Allocation_Header, data rawptr, size int) {
header.size = size;
ptr := (header+1) as ^int;
@@ -103,7 +102,7 @@ proc allocation_header_fill(header ^Allocation_Header, data rawptr, size int) {
(ptr+i)^ = -1;
}
}
proc allocation_header(data rawptr) -> ^Allocation_Header {
allocation_header :: proc(data rawptr) -> ^Allocation_Header {
p := data as ^int;
for (p-1)^ == -1 {
p = (p-1);
@@ -116,35 +115,34 @@ proc allocation_header(data rawptr) -> ^Allocation_Header {
// Custom allocators
type {
Arena struct {
backing Allocator;
memory []byte;
temp_count int;
}
Arena :: struct {
backing Allocator;
memory []byte;
temp_count int;
}
Arena_Temp_Memory struct {
arena ^Arena;
original_count int;
}
Arena_Temp_Memory :: struct {
arena ^Arena;
original_count int;
}
proc init_arena_from_memory(using a ^Arena, data []byte) {
init_arena_from_memory :: proc(using a ^Arena, data []byte) {
backing = Allocator{};
memory = data[:0];
temp_count = 0;
}
proc init_arena_from_context(using a ^Arena, size int) {
init_arena_from_context :: proc(using a ^Arena, size int) {
backing = context.allocator;
memory = new_slice(byte, 0, size);
temp_count = 0;
}
proc free_arena(using a ^Arena) {
free_arena :: proc(using a ^Arena) {
if backing.procedure != nil {
push_allocator backing {
free(memory.data);
@@ -153,14 +151,14 @@ proc free_arena(using a ^Arena) {
}
}
proc arena_allocator(arena ^Arena) -> Allocator {
arena_allocator :: proc(arena ^Arena) -> Allocator {
return Allocator{
procedure = arena_allocator_proc,
data = arena,
};
}
proc arena_allocator_proc(allocator_data rawptr, mode Allocator_Mode,
arena_allocator_proc :: proc(allocator_data rawptr, mode Allocator_Mode,
size, alignment int,
old_memory rawptr, old_size int, flags u64) -> rawptr {
using Allocator_Mode;
@@ -195,7 +193,7 @@ proc arena_allocator_proc(allocator_data rawptr, mode Allocator_Mode,
return nil;
}
proc begin_arena_temp_memory(a ^Arena) -> Arena_Temp_Memory {
begin_arena_temp_memory :: proc(a ^Arena) -> Arena_Temp_Memory {
tmp: Arena_Temp_Memory;
tmp.arena = a;
tmp.original_count = a.memory.count;
@@ -203,7 +201,7 @@ proc begin_arena_temp_memory(a ^Arena) -> Arena_Temp_Memory {
return tmp;
}
proc end_arena_temp_memory(using tmp Arena_Temp_Memory) {
end_arena_temp_memory :: proc(using tmp Arena_Temp_Memory) {
assert(arena.memory.count >= original_count);
assert(arena.temp_count > 0);
arena.memory.count = original_count;
@@ -216,8 +214,8 @@ proc end_arena_temp_memory(using tmp Arena_Temp_Memory) {
proc align_of_type_info(type_info ^Type_Info) -> int {
proc prev_pow2(n i64) -> i64 {
align_of_type_info :: proc(type_info ^Type_Info) -> int {
prev_pow2 :: proc(n i64) -> i64 {
if n <= 0 {
return 0;
}
@@ -271,12 +269,12 @@ proc align_of_type_info(type_info ^Type_Info) -> int {
return 0;
}
proc align_formula(size, align int) -> int {
align_formula :: proc(size, align int) -> int {
result := size + align-1;
return result - result%align;
}
proc size_of_type_info(type_info ^Type_Info) -> int {
size_of_type_info :: proc(type_info ^Type_Info) -> int {
WORD_SIZE :: size_of(int);
using Type_Info;
match type info : type_info {
@@ -310,7 +308,7 @@ proc size_of_type_info(type_info ^Type_Info) -> int {
case Slice:
return 3*WORD_SIZE;
case Vector:
proc is_bool(type_info ^Type_Info) -> bool {
is_bool :: proc(type_info ^Type_Info) -> bool {
match type info : type_info {
case Named:
return is_bool(info.base);