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

Begin work on windows 386

Browse Source
This commit is contained in:
gingerBill
2020-06-29 17:35:33 +01:00
parent 8478b887a5
commit 0ea64182f1
7 changed files with 82 additions and 37 deletions
Download Patch File Download Diff File Expand all files Collapse all files
core/runtime/procs_windows_386.odin
+49 -16
View File
@@ -2,35 +2,68 @@ package runtime
foreign import kernel32 "system:Kernel32.lib"
@private
@(link_name="_tls_index")
_tls_index: u32;
windows_trap_array_bounds :: proc "contextless" () -> ! {
DWORD :: u32;
ULONG_PTR :: uint;
EXCEPTION_ARRAY_BOUNDS_EXCEEDED :: 0xC000008C;
foreign kernel32 {
RaiseException :: proc "stdcall" (dwExceptionCode, dwExceptionFlags, nNumberOfArguments: DWORD, lpArguments: ^ULONG_PTR) -> ! ---
}
RaiseException(EXCEPTION_ARRAY_BOUNDS_EXCEEDED, 0, 0, nil);
}
windows_trap_type_assertion :: proc "contextless" () -> ! {
windows_trap_array_bounds();
}
@(private, require, link_name="_fltused") _fltused: i32 = 0x9875;
@(private, require, link_name="_tls_index") _tls_index: u32;
@(private, require, link_name="_tls_array") _tls_array: u32;
@private
@(link_name="_fltused")
_fltused: i32 = 0x9875;
@(link_name="memcpy")
memcpy :: proc "c" (dst, src: rawptr, len: int) -> rawptr {
foreign kernel32 {
RtlCopyMemory :: proc "c" (dst, src: rawptr, len: int) ---
}
if dst == nil || src == nil || len == 0 {
if dst == nil || src == nil || len == 0 || dst == src {
return dst;
}
RtlCopyMemory(dst, src, len);
d := uintptr(dst);
s := uintptr(src);
n := uintptr(len);
for i in 0..<n {
(^byte)(d+i)^ = (^byte)(s+i)^;
}
return dst;
}
@(link_name="memmove")
memmove :: proc "c" (dst, src: rawptr, len: int) -> rawptr {
foreign kernel32 {
RtlMoveMemory :: proc "c" (dst, src: rawptr, len: int) ---
}
if dst == nil || src == nil || len == 0 {
if dst == nil || src == nil || len == 0 || dst == src {
return dst;
}
RtlMoveMemory(dst, src, len);
d := uintptr(dst);
s := uintptr(src);
n := uintptr(len);
if s < d && d < s+n {
// Overlap
for i := n-1; n >= 0; i -= 1 {
(^byte)(d+i)^ = (^byte)(s+i)^;
}
} else {
for i in 0..<n {
(^byte)(d+i)^ = (^byte)(s+i)^;
}
}
return dst;
}