| author | |
| committer | |
| log | 7e75e1075e14a124706bf5f22244ca6b6e814fdb |
| tree | 3d1b0eab80f6916a9758e32bbd1e939e765be9bd |
| parent | 8b97a1aee2b161b9604d3b0c88166d0f0aef7e64 |
| signature |
10 files changed, 15 insertions(+), 13 deletions(-)
std/event/loop.zig-1| ... | ... | @@ -627,7 +627,6 @@ pub const Loop = struct { |
| 627 | 627 | } |
| 628 | 628 | } |
| 629 | 629 | |
| 630 | ||
| 631 | 630 | /// call finishOneEvent when done |
| 632 | 631 | pub fn beginOneEvent(self: *Loop) void { |
| 633 | 632 | _ = @atomicRmw(usize, &self.pending_event_count, AtomicRmwOp.Add, 1, AtomicOrder.SeqCst); |
std/hash.zig-1| ... | ... | @@ -20,7 +20,6 @@ pub const SipHash128 = siphash.SipHash128; |
| 20 | 20 | pub const murmur = @import("hash/murmur.zig"); |
| 21 | 21 | pub const Murmur2_32 = murmur.Murmur2_32; |
| 22 | 22 | |
| 23 | ||
| 24 | 23 | pub const Murmur2_64 = murmur.Murmur2_64; |
| 25 | 24 | pub const Murmur3_32 = murmur.Murmur3_32; |
| 26 | 25 |
std/os/darwin.zig+1-1| ... | ... | @@ -5,4 +5,4 @@ pub const is_the_target = switch (builtin.os) { |
| 5 | 5 | else => false, |
| 6 | 6 | }; |
| 7 | 7 | pub usingnamespace std.c; |
| 8 | pub usingnamespace @import("bits.zig"); | |
| \ No newline at end of file | ||
| 8 | pub usingnamespace @import("bits.zig"); |
std/os/freebsd.zig+1-1| ... | ... | @@ -2,4 +2,4 @@ const std = @import("../std.zig"); |
| 2 | 2 | const builtin = @import("builtin"); |
| 3 | 3 | pub const is_the_target = builtin.os == .freebsd; |
| 4 | 4 | pub usingnamespace std.c; |
| 5 | pub usingnamespace @import("bits.zig"); | |
| \ No newline at end of file | ||
| 5 | pub usingnamespace @import("bits.zig"); |
std/os/windows.zig-1| ... | ... | @@ -875,7 +875,6 @@ pub fn unexpectedError(err: DWORD) std.os.UnexpectedError { |
| 875 | 875 | return error.Unexpected; |
| 876 | 876 | } |
| 877 | 877 | |
| 878 | ||
| 879 | 878 | /// Call this when you made a windows NtDll call |
| 880 | 879 | /// and you get an unexpected status. |
| 881 | 880 | pub fn unexpectedStatus(status: NTSTATUS) std.os.UnexpectedError { |
std/os/windows/bits.zig+2-2| ... | ... | @@ -209,7 +209,7 @@ pub const FILE_INFORMATION_CLASS = extern enum { |
| 209 | 209 | FileLinkInformationExBypassAccessCheck, |
| 210 | 210 | FileStorageReserveIdInformation, |
| 211 | 211 | FileCaseSensitiveInformationForceAccessCheck, |
| 212 | FileMaximumInformation | |
| 212 | FileMaximumInformation, | |
| 213 | 213 | }; |
| 214 | 214 | |
| 215 | 215 | pub const OVERLAPPED = extern struct { |
| ... | ... | @@ -731,4 +731,4 @@ pub const UNICODE_STRING = extern struct { |
| 731 | 731 | Length: USHORT, |
| 732 | 732 | MaximumLength: USHORT, |
| 733 | 733 | Buffer: [*]WCHAR, |
| 734 | }; | |
| \ No newline at end of file | ||
| 734 | }; |
std/os/windows/ntdll.zig+8-2| ... | ... | @@ -1,7 +1,13 @@ |
| 1 | 1 | usingnamespace @import("bits.zig"); |
| 2 | 2 | |
| 3 | 3 | pub extern "NtDll" stdcallcc fn RtlCaptureStackBackTrace(FramesToSkip: DWORD, FramesToCapture: DWORD, BackTrace: **c_void, BackTraceHash: ?*DWORD) WORD; |
| 4 | pub extern "NtDll" stdcallcc fn NtQueryInformationFile(FileHandle: HANDLE, IoStatusBlock: *IO_STATUS_BLOCK, FileInformation: *c_void, Length: ULONG, FileInformationClass: FILE_INFORMATION_CLASS,) NTSTATUS; | |
| 4 | pub extern "NtDll" stdcallcc fn NtQueryInformationFile( | |
| 5 | FileHandle: HANDLE, | |
| 6 | IoStatusBlock: *IO_STATUS_BLOCK, | |
| 7 | FileInformation: *c_void, | |
| 8 | Length: ULONG, | |
| 9 | FileInformationClass: FILE_INFORMATION_CLASS, | |
| 10 | ) NTSTATUS; | |
| 5 | 11 | pub extern "NtDll" stdcallcc fn NtCreateFile( |
| 6 | 12 | FileHandle: *HANDLE, |
| 7 | 13 | DesiredAccess: ACCESS_MASK, |
| ... | ... | @@ -15,4 +21,4 @@ pub extern "NtDll" stdcallcc fn NtCreateFile( |
| 15 | 21 | EaBuffer: *c_void, |
| 16 | 22 | EaLength: ULONG, |
| 17 | 23 | ) NTSTATUS; |
| 18 | pub extern "NtDll" stdcallcc fn NtClose(Handle: HANDLE) NTSTATUS; | |
| \ No newline at end of file | ||
| 24 | pub extern "NtDll" stdcallcc fn NtClose(Handle: HANDLE) NTSTATUS; |
std/os/windows/status.zig+2-2| ... | ... | @@ -1,5 +1,5 @@ |
| 1 | /// The operation completed successfully. | |
| 1 | /// The operation completed successfully. | |
| 2 | 2 | pub const SUCCESS = 0x00000000; |
| 3 | 3 | |
| 4 | 4 | /// The data was too large to fit into the specified buffer. |
| 5 | pub const BUFFER_OVERFLOW = 0x80000005; | |
| \ No newline at end of file | ||
| 5 | pub const BUFFER_OVERFLOW = 0x80000005; |
std/rb.zig-1| ... | ... | @@ -549,7 +549,6 @@ test "rb" { |
| 549 | 549 | } |
| 550 | 550 | } |
| 551 | 551 | |
| 552 | ||
| 553 | 552 | test "inserting and looking up" { |
| 554 | 553 | var tree: Tree = undefined; |
| 555 | 554 | tree.init(testCompare); |
test/stage1/behavior/muladd.zig+1-1| ... | ... | @@ -31,4 +31,4 @@ fn testMulAdd() void { |
| 31 | 31 | // var c: f128 = 6.25; |
| 32 | 32 | // expect(@mulAdd(f128, a, b, c) == 20); |
| 33 | 33 | //} |
| 34 | } | |
| \ No newline at end of file | ||
| 34 | } |