dusk: move project to https://github.com/hexops/mach-dusk
Signed-off-by: Stephen Gutekanst <stephen@hexops.com>
This commit is contained in:
Stephen Gutekanst
parent
33e27d9bf1
commit
e4e3da7e54
24 changed files with 0 additions and 6415 deletions
|
|
@ -7,7 +7,6 @@ const basisu = @import("libs/basisu/build.zig");
|
|||
const sysjs = @import("libs/sysjs/build.zig");
|
||||
const gamemode = @import("libs/gamemode/build.zig");
|
||||
const model3d = @import("libs/model3d/build.zig");
|
||||
const dusk = @import("libs/dusk/build.zig");
|
||||
pub const gpu_dawn = @import("libs/gpu-dawn/sdk.zig").Sdk(.{
|
||||
.glfw_include_dir = sdkPath("/libs/glfw/upstream/glfw/include"),
|
||||
.system_sdk = system_sdk,
|
||||
|
|
@ -92,7 +91,6 @@ pub fn build(b: *std.Build) !void {
|
|||
const basisu_test_step = b.step("test-basisu", "Run Basis-Universal library tests");
|
||||
const sysaudio_test_step = b.step("test-sysaudio", "Run sysaudio library tests");
|
||||
const model3d_test_step = b.step("test-model3d", "Run Model3D library tests");
|
||||
const dusk_test_step = b.step("test-dusk", "Run Dusk library tests");
|
||||
const mach_test_step = b.step("test-mach", "Run Engine library tests");
|
||||
|
||||
core_test_step.dependOn(&(try core.testStep(b, optimize, target)).step);
|
||||
|
|
@ -100,7 +98,6 @@ pub fn build(b: *std.Build) !void {
|
|||
basisu_test_step.dependOn(&basisu.testStep(b, optimize, target).step);
|
||||
sysaudio_test_step.dependOn(&sysaudio.testStep(b, optimize, target).step);
|
||||
model3d_test_step.dependOn(&model3d.testStep(b, optimize, target).step);
|
||||
dusk_test_step.dependOn(&dusk.testStep(b, optimize, target).step);
|
||||
mach_test_step.dependOn(&testStep(b, optimize, target).step);
|
||||
|
||||
all_tests_step.dependOn(core_test_step);
|
||||
|
|
@ -108,7 +105,6 @@ pub fn build(b: *std.Build) !void {
|
|||
all_tests_step.dependOn(freetype_test_step);
|
||||
all_tests_step.dependOn(sysaudio_test_step);
|
||||
all_tests_step.dependOn(model3d_test_step);
|
||||
all_tests_step.dependOn(dusk_test_step);
|
||||
all_tests_step.dependOn(mach_test_step);
|
||||
|
||||
const shaderexp_app = try App.init(
|
||||
|
|
|
|||
|
|
@ -9,7 +9,6 @@ const projects = [_][]const u8{
|
|||
".",
|
||||
"basisu",
|
||||
"core",
|
||||
"dusk",
|
||||
"earcut",
|
||||
"ecs",
|
||||
"freetype",
|
||||
|
|
|
|||
2
libs/dusk/.gitattributes
vendored
2
libs/dusk/.gitattributes
vendored
|
|
@ -1,2 +0,0 @@
|
|||
* text=auto eol=lf
|
||||
upstream/** linguist-vendored
|
||||
1
libs/dusk/.github/FUNDING.yml
vendored
1
libs/dusk/.github/FUNDING.yml
vendored
|
|
@ -1 +0,0 @@
|
|||
github: slimsag
|
||||
5
libs/dusk/.github/pull_request_template.md
vendored
5
libs/dusk/.github/pull_request_template.md
vendored
|
|
@ -1,5 +0,0 @@
|
|||
Please send your change to [the main repository](https://github.com/hexops/mach/tree/main/libs/dusk) instead, sorry for the trouble!
|
||||
|
||||
This helps us avoid some complex merge conflicts we run into when changes are made to both repositories and history needs to be reconciled. Keeping PRs in just that repository enables us to use `git subtree` to trivially keep the two repositories in sync.
|
||||
|
||||
Once your PR is merged over there, it'll automatically sync to this repository.
|
||||
16
libs/dusk/.github/workflows/ci.yml
vendored
16
libs/dusk/.github/workflows/ci.yml
vendored
|
|
@ -1,16 +0,0 @@
|
|||
name: CI
|
||||
on:
|
||||
- push
|
||||
- pull_request
|
||||
jobs:
|
||||
x86_64-linux:
|
||||
runs-on: ubuntu-latest
|
||||
steps:
|
||||
- name: Checkout
|
||||
uses: actions/checkout@v2
|
||||
- name: Setup Zig
|
||||
run: |
|
||||
sudo apt install xz-utils
|
||||
sudo sh -c 'wget -c https://ziglang.org/builds/zig-linux-x86_64-0.11.0-dev.2868+1a455b2dd.tar.xz -O - | tar -xJ --strip-components=1 -C /usr/local/bin'
|
||||
- name: test
|
||||
run: zig build test
|
||||
18
libs/dusk/.gitignore
vendored
18
libs/dusk/.gitignore
vendored
|
|
@ -1,18 +0,0 @@
|
|||
# This file is for zig-specific build artifacts.
|
||||
# If you have OS-specific or editor-specific files to ignore,
|
||||
# such as *.swp or .DS_Store, put those in your global
|
||||
# ~/.gitignore and put this in your ~/.gitconfig:
|
||||
#
|
||||
# [core]
|
||||
# excludesfile = ~/.gitignore
|
||||
#
|
||||
# Cheers!
|
||||
# -andrewrk
|
||||
|
||||
zig-cache/
|
||||
zig-out/
|
||||
/release/
|
||||
/debug/
|
||||
/build/
|
||||
/build-*/
|
||||
/docgen_tmp/
|
||||
|
|
@ -1,13 +0,0 @@
|
|||
Copyright 2021, Hexops Contributors (given via the Git commit history).
|
||||
|
||||
All documentation, image, sound, font, and 2D/3D model files are CC-BY-4.0 licensed unless
|
||||
otherwise noted. You may get a copy of this license at https://creativecommons.org/licenses/by/4.0
|
||||
|
||||
Files in a directory with a separate LICENSE file may contain files under different license terms,
|
||||
described within that LICENSE file.
|
||||
|
||||
All other files are licensed under the Apache License, Version 2.0 (see LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0)
|
||||
or the MIT license (see LICENSE-MIT or http://opensource.org/licenses/MIT), at your option.
|
||||
|
||||
All files in the project without exclusions may not be copied, modified, or distributed except
|
||||
according to the terms above.
|
||||
|
|
@ -1,202 +0,0 @@
|
|||
|
||||
Apache License
|
||||
Version 2.0, January 2004
|
||||
http://www.apache.org/licenses/
|
||||
|
||||
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
|
||||
|
||||
1. Definitions.
|
||||
|
||||
"License" shall mean the terms and conditions for use, reproduction,
|
||||
and distribution as defined by Sections 1 through 9 of this document.
|
||||
|
||||
"Licensor" shall mean the copyright owner or entity authorized by
|
||||
the copyright owner that is granting the License.
|
||||
|
||||
"Legal Entity" shall mean the union of the acting entity and all
|
||||
other entities that control, are controlled by, or are under common
|
||||
control with that entity. For the purposes of this definition,
|
||||
"control" means (i) the power, direct or indirect, to cause the
|
||||
direction or management of such entity, whether by contract or
|
||||
otherwise, or (ii) ownership of fifty percent (50%) or more of the
|
||||
outstanding shares, or (iii) beneficial ownership of such entity.
|
||||
|
||||
"You" (or "Your") shall mean an individual or Legal Entity
|
||||
exercising permissions granted by this License.
|
||||
|
||||
"Source" form shall mean the preferred form for making modifications,
|
||||
including but not limited to software source code, documentation
|
||||
source, and configuration files.
|
||||
|
||||
"Object" form shall mean any form resulting from mechanical
|
||||
transformation or translation of a Source form, including but
|
||||
not limited to compiled object code, generated documentation,
|
||||
and conversions to other media types.
|
||||
|
||||
"Work" shall mean the work of authorship, whether in Source or
|
||||
Object form, made available under the License, as indicated by a
|
||||
copyright notice that is included in or attached to the work
|
||||
(an example is provided in the Appendix below).
|
||||
|
||||
"Derivative Works" shall mean any work, whether in Source or Object
|
||||
form, that is based on (or derived from) the Work and for which the
|
||||
editorial revisions, annotations, elaborations, or other modifications
|
||||
represent, as a whole, an original work of authorship. For the purposes
|
||||
of this License, Derivative Works shall not include works that remain
|
||||
separable from, or merely link (or bind by name) to the interfaces of,
|
||||
the Work and Derivative Works thereof.
|
||||
|
||||
"Contribution" shall mean any work of authorship, including
|
||||
the original version of the Work and any modifications or additions
|
||||
to that Work or Derivative Works thereof, that is intentionally
|
||||
submitted to Licensor for inclusion in the Work by the copyright owner
|
||||
or by an individual or Legal Entity authorized to submit on behalf of
|
||||
the copyright owner. For the purposes of this definition, "submitted"
|
||||
means any form of electronic, verbal, or written communication sent
|
||||
to the Licensor or its representatives, including but not limited to
|
||||
communication on electronic mailing lists, source code control systems,
|
||||
and issue tracking systems that are managed by, or on behalf of, the
|
||||
Licensor for the purpose of discussing and improving the Work, but
|
||||
excluding communication that is conspicuously marked or otherwise
|
||||
designated in writing by the copyright owner as "Not a Contribution."
|
||||
|
||||
"Contributor" shall mean Licensor and any individual or Legal Entity
|
||||
on behalf of whom a Contribution has been received by Licensor and
|
||||
subsequently incorporated within the Work.
|
||||
|
||||
2. Grant of Copyright License. Subject to the terms and conditions of
|
||||
this License, each Contributor hereby grants to You a perpetual,
|
||||
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
||||
copyright license to reproduce, prepare Derivative Works of,
|
||||
publicly display, publicly perform, sublicense, and distribute the
|
||||
Work and such Derivative Works in Source or Object form.
|
||||
|
||||
3. Grant of Patent License. Subject to the terms and conditions of
|
||||
this License, each Contributor hereby grants to You a perpetual,
|
||||
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
||||
(except as stated in this section) patent license to make, have made,
|
||||
use, offer to sell, sell, import, and otherwise transfer the Work,
|
||||
where such license applies only to those patent claims licensable
|
||||
by such Contributor that are necessarily infringed by their
|
||||
Contribution(s) alone or by combination of their Contribution(s)
|
||||
with the Work to which such Contribution(s) was submitted. If You
|
||||
institute patent litigation against any entity (including a
|
||||
cross-claim or counterclaim in a lawsuit) alleging that the Work
|
||||
or a Contribution incorporated within the Work constitutes direct
|
||||
or contributory patent infringement, then any patent licenses
|
||||
granted to You under this License for that Work shall terminate
|
||||
as of the date such litigation is filed.
|
||||
|
||||
4. Redistribution. You may reproduce and distribute copies of the
|
||||
Work or Derivative Works thereof in any medium, with or without
|
||||
modifications, and in Source or Object form, provided that You
|
||||
meet the following conditions:
|
||||
|
||||
(a) You must give any other recipients of the Work or
|
||||
Derivative Works a copy of this License; and
|
||||
|
||||
(b) You must cause any modified files to carry prominent notices
|
||||
stating that You changed the files; and
|
||||
|
||||
(c) You must retain, in the Source form of any Derivative Works
|
||||
that You distribute, all copyright, patent, trademark, and
|
||||
attribution notices from the Source form of the Work,
|
||||
excluding those notices that do not pertain to any part of
|
||||
the Derivative Works; and
|
||||
|
||||
(d) If the Work includes a "NOTICE" text file as part of its
|
||||
distribution, then any Derivative Works that You distribute must
|
||||
include a readable copy of the attribution notices contained
|
||||
within such NOTICE file, excluding those notices that do not
|
||||
pertain to any part of the Derivative Works, in at least one
|
||||
of the following places: within a NOTICE text file distributed
|
||||
as part of the Derivative Works; within the Source form or
|
||||
documentation, if provided along with the Derivative Works; or,
|
||||
within a display generated by the Derivative Works, if and
|
||||
wherever such third-party notices normally appear. The contents
|
||||
of the NOTICE file are for informational purposes only and
|
||||
do not modify the License. You may add Your own attribution
|
||||
notices within Derivative Works that You distribute, alongside
|
||||
or as an addendum to the NOTICE text from the Work, provided
|
||||
that such additional attribution notices cannot be construed
|
||||
as modifying the License.
|
||||
|
||||
You may add Your own copyright statement to Your modifications and
|
||||
may provide additional or different license terms and conditions
|
||||
for use, reproduction, or distribution of Your modifications, or
|
||||
for any such Derivative Works as a whole, provided Your use,
|
||||
reproduction, and distribution of the Work otherwise complies with
|
||||
the conditions stated in this License.
|
||||
|
||||
5. Submission of Contributions. Unless You explicitly state otherwise,
|
||||
any Contribution intentionally submitted for inclusion in the Work
|
||||
by You to the Licensor shall be under the terms and conditions of
|
||||
this License, without any additional terms or conditions.
|
||||
Notwithstanding the above, nothing herein shall supersede or modify
|
||||
the terms of any separate license agreement you may have executed
|
||||
with Licensor regarding such Contributions.
|
||||
|
||||
6. Trademarks. This License does not grant permission to use the trade
|
||||
names, trademarks, service marks, or product names of the Licensor,
|
||||
except as required for reasonable and customary use in describing the
|
||||
origin of the Work and reproducing the content of the NOTICE file.
|
||||
|
||||
7. Disclaimer of Warranty. Unless required by applicable law or
|
||||
agreed to in writing, Licensor provides the Work (and each
|
||||
Contributor provides its Contributions) on an "AS IS" BASIS,
|
||||
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
|
||||
implied, including, without limitation, any warranties or conditions
|
||||
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
|
||||
PARTICULAR PURPOSE. You are solely responsible for determining the
|
||||
appropriateness of using or redistributing the Work and assume any
|
||||
risks associated with Your exercise of permissions under this License.
|
||||
|
||||
8. Limitation of Liability. In no event and under no legal theory,
|
||||
whether in tort (including negligence), contract, or otherwise,
|
||||
unless required by applicable law (such as deliberate and grossly
|
||||
negligent acts) or agreed to in writing, shall any Contributor be
|
||||
liable to You for damages, including any direct, indirect, special,
|
||||
incidental, or consequential damages of any character arising as a
|
||||
result of this License or out of the use or inability to use the
|
||||
Work (including but not limited to damages for loss of goodwill,
|
||||
work stoppage, computer failure or malfunction, or any and all
|
||||
other commercial damages or losses), even if such Contributor
|
||||
has been advised of the possibility of such damages.
|
||||
|
||||
9. Accepting Warranty or Additional Liability. While redistributing
|
||||
the Work or Derivative Works thereof, You may choose to offer,
|
||||
and charge a fee for, acceptance of support, warranty, indemnity,
|
||||
or other liability obligations and/or rights consistent with this
|
||||
License. However, in accepting such obligations, You may act only
|
||||
on Your own behalf and on Your sole responsibility, not on behalf
|
||||
of any other Contributor, and only if You agree to indemnify,
|
||||
defend, and hold each Contributor harmless for any liability
|
||||
incurred by, or claims asserted against, such Contributor by reason
|
||||
of your accepting any such warranty or additional liability.
|
||||
|
||||
END OF TERMS AND CONDITIONS
|
||||
|
||||
APPENDIX: How to apply the Apache License to your work.
|
||||
|
||||
To apply the Apache License to your work, attach the following
|
||||
boilerplate notice, with the fields enclosed by brackets "[]"
|
||||
replaced with your own identifying information. (Don't include
|
||||
the brackets!) The text should be enclosed in the appropriate
|
||||
comment syntax for the file format. We also recommend that a
|
||||
file or class name and description of purpose be included on the
|
||||
same "printed page" as the copyright notice for easier
|
||||
identification within third-party archives.
|
||||
|
||||
Copyright [yyyy] [name of copyright owner]
|
||||
|
||||
Licensed under the Apache License, Version 2.0 (the "License");
|
||||
you may not use this file except in compliance with the License.
|
||||
You may obtain a copy of the License at
|
||||
|
||||
http://www.apache.org/licenses/LICENSE-2.0
|
||||
|
||||
Unless required by applicable law or agreed to in writing, software
|
||||
distributed under the License is distributed on an "AS IS" BASIS,
|
||||
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
See the License for the specific language governing permissions and
|
||||
limitations under the License.
|
||||
|
|
@ -1,25 +0,0 @@
|
|||
Copyright (c) 2021 Hexops Contributors (given via the Git commit history).
|
||||
|
||||
Permission is hereby granted, free of charge, to any
|
||||
person obtaining a copy of this software and associated
|
||||
documentation files (the "Software"), to deal in the
|
||||
Software without restriction, including without
|
||||
limitation the rights to use, copy, modify, merge,
|
||||
publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software
|
||||
is furnished to do so, subject to the following
|
||||
conditions:
|
||||
|
||||
The above copyright notice and this permission notice
|
||||
shall be included in all copies or substantial portions
|
||||
of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
|
||||
ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
|
||||
TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
|
||||
PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
|
||||
SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
|
||||
CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
||||
OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
|
||||
IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
|
||||
DEALINGS IN THE SOFTWARE.
|
||||
|
|
@ -1,37 +0,0 @@
|
|||
# mach/dusk - WebGPU implementation in Zig
|
||||
|
||||
This repository is a separate copy of the same library in the [main Mach repository](https://github.com/hexops/mach), and is automatically kept in sync, so that anyone can use this library in their own project if they like!
|
||||
|
||||
## Experimental
|
||||
|
||||
This is an _experimental_ Mach library, according to our [stability guarantees](https://machengine.org/next/docs/libs/):
|
||||
|
||||
> Experimental libraries may have their APIs change without much notice, and you may have to look at recent changes in order to update your code.
|
||||
|
||||
[Why this library is not declared stable yet](https://machengine.org/next/docs/libs/experimental/#dusk)
|
||||
|
||||
## Current Status
|
||||
|
||||
Dusk is in **very early stages** and under heavy development; there are hundreds of known bugs/missing features.
|
||||
|
||||
### WGSL compiler
|
||||
|
||||
- [x] Parser
|
||||
- [ ] Ast analysis (WIP!)
|
||||
- [ ] Transpilation targets
|
||||
- [ ] GLSL
|
||||
- [ ] Spir-V
|
||||
- [ ] HLSL
|
||||
- [ ] Metal
|
||||
|
||||
## Join the community
|
||||
|
||||
Join the Mach community [on Discord](https://discord.gg/XNG3NZgCqp) to discuss this project, ask questions, get help, etc.
|
||||
|
||||
## Issues
|
||||
|
||||
Issues are tracked in the [main Mach repository](https://github.com/hexops/mach/issues?q=is%3Aissue+is%3Aopen+label%3Adusk).
|
||||
|
||||
## Contributing
|
||||
|
||||
Contributions are very welcome. Pull requests must be sent to [the main repository](https://github.com/hexops/mach/tree/main/libs/dusk) to avoid some complex merge conflicts we'd get by accepting contributions in both repositories. Once the changes are merged there, they'll get sync'd to this repository automatically.
|
||||
|
|
@ -1,50 +0,0 @@
|
|||
const std = @import("std");
|
||||
|
||||
pub fn build(b: *std.Build) !void {
|
||||
const optimize = b.standardOptimizeOption(.{});
|
||||
const target = b.standardTargetOptions(.{});
|
||||
|
||||
const test_step = b.step("test", "Run library tests");
|
||||
test_step.dependOn(&testStep(b, optimize, target).step);
|
||||
}
|
||||
|
||||
var _module: ?*std.build.Module = null;
|
||||
|
||||
pub fn module(b: *std.Build) *std.build.Module {
|
||||
if (_module) |m| return m;
|
||||
_module = b.createModule(.{
|
||||
.source_file = .{ .path = sdkPath("/src/main.zig") },
|
||||
});
|
||||
return _module.?;
|
||||
}
|
||||
|
||||
pub fn testStep(b: *std.Build, optimize: std.builtin.OptimizeMode, target: std.zig.CrossTarget) *std.build.RunStep {
|
||||
const lib_tests = b.addTest(.{
|
||||
.name = "dusk-lib-tests",
|
||||
.root_source_file = .{ .path = sdkPath("/src/main.zig") },
|
||||
.target = target,
|
||||
.optimize = optimize,
|
||||
});
|
||||
b.installArtifact(lib_tests);
|
||||
|
||||
const main_tests = b.addTest(.{
|
||||
.name = "dusk-tests",
|
||||
.root_source_file = .{ .path = sdkPath("/test/main.zig") },
|
||||
.target = target,
|
||||
.optimize = optimize,
|
||||
});
|
||||
main_tests.addModule("dusk", module(b));
|
||||
b.installArtifact(main_tests);
|
||||
|
||||
const run_step = b.addRunArtifact(main_tests);
|
||||
run_step.step.dependOn(&b.addRunArtifact(lib_tests).step);
|
||||
return b.addRunArtifact(main_tests);
|
||||
}
|
||||
|
||||
fn sdkPath(comptime suffix: []const u8) []const u8 {
|
||||
if (suffix[0] != '/') @compileError("suffix must be an absolute path");
|
||||
return comptime blk: {
|
||||
const root_dir = std.fs.path.dirname(@src().file) orelse ".";
|
||||
break :blk root_dir ++ suffix;
|
||||
};
|
||||
}
|
||||
|
|
@ -1,700 +0,0 @@
|
|||
const std = @import("std");
|
||||
const Parser = @import("Parser.zig");
|
||||
const Token = @import("Token.zig");
|
||||
const Tokenizer = @import("Tokenizer.zig");
|
||||
const ErrorList = @import("ErrorList.zig");
|
||||
const Extension = @import("main.zig").Extension;
|
||||
|
||||
const Ast = @This();
|
||||
|
||||
pub const NodeList = std.MultiArrayList(Node);
|
||||
pub const TokenList = std.MultiArrayList(Token);
|
||||
|
||||
source: [:0]const u8,
|
||||
tokens: TokenList.Slice,
|
||||
nodes: NodeList.Slice,
|
||||
extra: []const Index,
|
||||
errors: ErrorList,
|
||||
|
||||
pub fn deinit(tree: *Ast, allocator: std.mem.Allocator) void {
|
||||
tree.tokens.deinit(allocator);
|
||||
tree.nodes.deinit(allocator);
|
||||
allocator.free(tree.extra);
|
||||
tree.errors.deinit();
|
||||
tree.* = undefined;
|
||||
}
|
||||
|
||||
/// parses a TranslationUnit (WGSL Program)
|
||||
pub fn parse(allocator: std.mem.Allocator, source: [:0]const u8) error{OutOfMemory}!Ast {
|
||||
var p = Parser{
|
||||
.allocator = allocator,
|
||||
.source = source,
|
||||
.tok_i = 0,
|
||||
.tokens = blk: {
|
||||
const estimated_tokens = source.len / 8;
|
||||
|
||||
var tokens = std.MultiArrayList(Token){};
|
||||
errdefer tokens.deinit(allocator);
|
||||
|
||||
try tokens.ensureTotalCapacity(allocator, estimated_tokens);
|
||||
|
||||
var tokenizer = Tokenizer.init(source);
|
||||
while (true) {
|
||||
const tok = tokenizer.next();
|
||||
try tokens.append(allocator, tok);
|
||||
if (tok.tag == .eof) break;
|
||||
}
|
||||
|
||||
break :blk tokens;
|
||||
},
|
||||
.nodes = .{},
|
||||
.extra = .{},
|
||||
.scratch = .{},
|
||||
.errors = try ErrorList.init(allocator),
|
||||
.extensions = Extension.Array.initFill(false),
|
||||
};
|
||||
defer p.scratch.deinit(allocator);
|
||||
errdefer {
|
||||
p.tokens.deinit(allocator);
|
||||
p.nodes.deinit(allocator);
|
||||
p.extra.deinit(allocator);
|
||||
p.errors.deinit();
|
||||
}
|
||||
|
||||
// TODO: make sure tokens:nodes ratio is right
|
||||
const estimated_node_count = (p.tokens.len + 2) / 2;
|
||||
try p.nodes.ensureTotalCapacity(allocator, estimated_node_count);
|
||||
|
||||
try p.translationUnit();
|
||||
|
||||
return .{
|
||||
.source = source,
|
||||
.tokens = p.tokens.toOwnedSlice(),
|
||||
.nodes = p.nodes.toOwnedSlice(),
|
||||
.extra = try p.extra.toOwnedSlice(allocator),
|
||||
.errors = p.errors,
|
||||
};
|
||||
}
|
||||
|
||||
pub fn spanToList(tree: Ast, span: Ast.Index) []const Ast.Index {
|
||||
std.debug.assert(tree.nodeTag(span) == .span);
|
||||
return tree.extra[tree.nodeLHS(span)..tree.nodeRHS(span)];
|
||||
}
|
||||
|
||||
pub fn extraData(tree: Ast, comptime T: type, index: Ast.Index) T {
|
||||
const fields = std.meta.fields(T);
|
||||
var result: T = undefined;
|
||||
inline for (fields, 0..) |field, i| {
|
||||
comptime std.debug.assert(field.type == Ast.Index);
|
||||
@field(result, field.name) = tree.extra[index + i];
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
pub fn tokenTag(tree: Ast, i: Index) Token.Tag {
|
||||
return tree.tokens.items(.tag)[i];
|
||||
}
|
||||
|
||||
pub fn tokenLoc(tree: Ast, i: Index) Token.Loc {
|
||||
return tree.tokens.items(.loc)[i];
|
||||
}
|
||||
|
||||
pub fn nodeTag(tree: Ast, i: Index) Node.Tag {
|
||||
return tree.nodes.items(.tag)[i];
|
||||
}
|
||||
|
||||
pub fn nodeToken(tree: Ast, i: Index) Index {
|
||||
return tree.nodes.items(.main_token)[i];
|
||||
}
|
||||
|
||||
pub fn nodeLHS(tree: Ast, i: Index) Index {
|
||||
return tree.nodes.items(.lhs)[i];
|
||||
}
|
||||
|
||||
pub fn nodeRHS(tree: Ast, i: Index) Index {
|
||||
return tree.nodes.items(.rhs)[i];
|
||||
}
|
||||
|
||||
pub const Index = u32;
|
||||
pub const null_index: Index = 0;
|
||||
pub const Node = struct {
|
||||
tag: Tag,
|
||||
main_token: Index,
|
||||
lhs: Index = null_index,
|
||||
rhs: Index = null_index,
|
||||
|
||||
pub const Tag = enum {
|
||||
/// an slice to extra field [LHS..RHS]
|
||||
/// TOK : undefined
|
||||
/// LHS : Index
|
||||
/// RHS : Index
|
||||
span,
|
||||
|
||||
// ####### GlobalDecl #######
|
||||
|
||||
/// TOK : k_var
|
||||
/// LHS : GlobalVarDecl
|
||||
/// RHS : Expr?
|
||||
global_variable,
|
||||
|
||||
/// TOK : k_const
|
||||
/// LHS : Type
|
||||
/// RHS : Expr
|
||||
global_constant,
|
||||
|
||||
/// TOK : k_override
|
||||
/// LHS : OverrideDecl
|
||||
/// RHS : Expr
|
||||
override,
|
||||
|
||||
/// TOK : k_type
|
||||
/// LHS : Type
|
||||
/// RHS : --
|
||||
type_alias,
|
||||
|
||||
/// TOK : k_const_assert
|
||||
/// LHS : Expr
|
||||
/// RHS : --
|
||||
const_assert,
|
||||
|
||||
/// TOK : k_struct
|
||||
/// LHS : span(struct_member)
|
||||
/// RHS : --
|
||||
struct_decl,
|
||||
/// TOK : ident
|
||||
/// LHS : span(Attribute)
|
||||
/// RHS : Type
|
||||
struct_member,
|
||||
|
||||
/// TOK : k_fn
|
||||
/// LHS : FnProto
|
||||
/// RHS : block
|
||||
fn_decl,
|
||||
/// TOK : ident
|
||||
/// LHS : ?span(Attribute)
|
||||
/// RHS : type
|
||||
fn_param,
|
||||
|
||||
// ####### Statement #######
|
||||
|
||||
// block = span(Statement)
|
||||
|
||||
/// TOK : k_return
|
||||
/// LHS : Expr?
|
||||
/// RHS : --
|
||||
@"return",
|
||||
|
||||
/// TOK : k_discard
|
||||
/// LHS : --
|
||||
/// RHS : --
|
||||
discard,
|
||||
|
||||
/// TOK : k_loop
|
||||
/// LHS : block
|
||||
/// RHS : --
|
||||
loop,
|
||||
|
||||
/// TOK : k_continuing
|
||||
/// LHS : block
|
||||
/// RHS : --
|
||||
continuing,
|
||||
|
||||
/// TOK : k_break
|
||||
/// LHS : Expr
|
||||
/// RHS : --
|
||||
break_if,
|
||||
|
||||
/// TOK : k_break
|
||||
/// LHS : --
|
||||
/// RHS : --
|
||||
@"break",
|
||||
|
||||
/// TOK : k_continue
|
||||
/// LHS : --
|
||||
/// RHS : --
|
||||
@"continue",
|
||||
|
||||
/// TOK : k_if
|
||||
/// LHS : Expr
|
||||
/// RHS : blcok
|
||||
@"if",
|
||||
/// RHS is else body
|
||||
/// TOK : k_if
|
||||
/// LHS : if
|
||||
/// RHS : blcok
|
||||
if_else,
|
||||
/// TOK : k_if
|
||||
/// LHS : if
|
||||
/// RHS : if, if_else, if_else_if
|
||||
if_else_if,
|
||||
|
||||
/// TOK : k_switch
|
||||
/// LHS : Expr
|
||||
/// RHS : span(switch_case, switch_default, switch_case_default)
|
||||
@"switch",
|
||||
/// TOK : k_case
|
||||
/// LHS : span(Expr)
|
||||
/// RHS : block
|
||||
switch_case,
|
||||
/// TOK : k_default
|
||||
/// LHS : block
|
||||
/// RHS : --
|
||||
switch_default,
|
||||
/// switch_case with default (`case 1, 2, default {}`)
|
||||
/// TOK : k_case
|
||||
/// LHS : span(Expr)
|
||||
/// RHS : block
|
||||
switch_case_default,
|
||||
|
||||
/// TOK : k_var
|
||||
/// LHS : VarDecl
|
||||
/// RHS : Expr?
|
||||
var_decl,
|
||||
|
||||
/// TOK : k_const
|
||||
/// LHS : Type?
|
||||
/// RHS : Expr
|
||||
const_decl,
|
||||
|
||||
/// TOK : k_let
|
||||
/// LHS : Type?
|
||||
/// RHS : Expr
|
||||
let_decl,
|
||||
|
||||
/// TOK : k_while
|
||||
/// LHS : Expr
|
||||
/// RHS : block
|
||||
@"while",
|
||||
|
||||
/// TOK : k_for
|
||||
/// LHS : ForHeader
|
||||
/// RHS : block
|
||||
@"for",
|
||||
|
||||
/// TOK : plus_plus, minus_minus
|
||||
/// LHS : Expr
|
||||
increase_decrement,
|
||||
|
||||
/// TOK : plus_equal, minus_equal,
|
||||
/// times_equal, division_equal,
|
||||
/// modulo_equal, and_equal,
|
||||
/// or_equal, xor_equal,
|
||||
/// shift_right_equal, shift_left_equal
|
||||
/// LHS : Expr
|
||||
/// RHS : Expr
|
||||
compound_assign,
|
||||
|
||||
/// TOK : equal
|
||||
/// LHS : Expr
|
||||
/// RHS : --
|
||||
phony_assign,
|
||||
|
||||
// ####### Type #######
|
||||
|
||||
/// TOK : k_i32, k_u32, k_f32, k_f16, k_bool
|
||||
/// LHS : --
|
||||
/// RHS : --
|
||||
number_type,
|
||||
|
||||
/// TOK : k_bool
|
||||
/// LHS : --
|
||||
/// RHS : --
|
||||
bool_type,
|
||||
|
||||
/// TOK : k_sampler, k_comparison_sampler
|
||||
/// LHS : --
|
||||
/// RHS : --
|
||||
sampler_type,
|
||||
|
||||
/// TOK : k_vec2, k_vec3, k_vec4
|
||||
/// LHS : Type
|
||||
/// RHS : --
|
||||
vector_type,
|
||||
|
||||
/// TOK : k_mat2x2, k_mat2x3, k_mat2x4,
|
||||
/// k_mat3x2, k_mat3x3, k_mat3x4,
|
||||
/// k_mat4x2, k_mat4x3, k_mat4x4
|
||||
/// LHS : Type
|
||||
/// RHS : --
|
||||
matrix_type,
|
||||
|
||||
/// TOK : k_atomic
|
||||
/// LHS : Type
|
||||
/// RHS : --
|
||||
atomic_type,
|
||||
|
||||
/// TOK : k_array
|
||||
/// LHS : Type
|
||||
/// RHS : Expr?
|
||||
array_type,
|
||||
|
||||
/// TOK : k_ptr
|
||||
/// LHS : Type
|
||||
/// RHS : PtrType
|
||||
ptr_type,
|
||||
|
||||
/// TOK : k_texture_1d, k_texture_2d, k_texture_2d_array,
|
||||
/// k_texture_3d, k_texture_cube, k_texture_cube_array
|
||||
/// LHS : Type
|
||||
/// RHS : --
|
||||
sampled_texture_type,
|
||||
|
||||
/// TOK : k_texture_multisampled_2d
|
||||
/// LHS : Type
|
||||
/// RHS : --
|
||||
multisampled_texture_type,
|
||||
|
||||
/// TOK : k_texture_external
|
||||
/// LHS : Type
|
||||
/// RHS : --
|
||||
external_texture_type,
|
||||
|
||||
/// TOK : k_texture_storage_1d, k_texture_storage_2d,
|
||||
/// k_texture_storage_2d_array, k_texture_storage_3d
|
||||
/// LHS : Index(Token(TexelFormat))
|
||||
/// RHS : Index(Token(AccessMode))
|
||||
storage_texture_type,
|
||||
|
||||
/// TOK : k_texture_depth_2d, k_texture_depth_2d_array
|
||||
/// k_texture_depth_cube, k_texture_depth_cube_array
|
||||
/// k_texture_depth_multisampled_2d
|
||||
/// LHS : --
|
||||
/// RHS : --
|
||||
depth_texture_type,
|
||||
|
||||
// ####### Attribute #######
|
||||
|
||||
// TOK : attr
|
||||
attr,
|
||||
|
||||
/// TOK : attr
|
||||
/// LHS : Expr
|
||||
/// RHS : --
|
||||
attr_one_arg,
|
||||
|
||||
/// TOK : attr
|
||||
/// LHS : Index(Token(BuiltinValue))
|
||||
/// RHS : --
|
||||
attr_builtin,
|
||||
|
||||
/// TOK : attr
|
||||
/// LHS : WorkgroupSize
|
||||
/// RHS : --
|
||||
attr_workgroup_size,
|
||||
|
||||
/// TOK : attr
|
||||
/// LHS : Index(Token(InterpolationType))
|
||||
/// RHS : Index(Token(InterpolationSample))
|
||||
attr_interpolate,
|
||||
|
||||
// ####### Expr #######
|
||||
// see both Parser.zig and https://gpuweb.github.io/gpuweb/wgsl/#expression-grammar
|
||||
|
||||
/// TOK : *
|
||||
/// LHS : Expr
|
||||
/// RHS : Expr
|
||||
mul,
|
||||
|
||||
/// TOK : /
|
||||
/// LHS : Expr
|
||||
/// RHS : Expr
|
||||
div,
|
||||
|
||||
/// TOK : %
|
||||
/// LHS : Expr
|
||||
/// RHS : Expr
|
||||
mod,
|
||||
|
||||
/// TOK : +
|
||||
/// LHS : Expr
|
||||
/// RHS : Expr
|
||||
add,
|
||||
|
||||
/// TOK : -
|
||||
/// LHS : Expr
|
||||
/// RHS : Expr
|
||||
sub,
|
||||
|
||||
/// TOK : <<
|
||||
/// LHS : Expr
|
||||
/// RHS : Expr
|
||||
shift_left,
|
||||
|
||||
/// TOK : >>
|
||||
/// LHS : Expr
|
||||
/// RHS : Expr
|
||||
shift_right,
|
||||
|
||||
/// TOK : &
|
||||
/// LHS : Expr
|
||||
/// RHS : Expr
|
||||
binary_and,
|
||||
|
||||
/// TOK : |
|
||||
/// LHS : Expr
|
||||
/// RHS : Expr
|
||||
binary_or,
|
||||
|
||||
/// TOK : ^
|
||||
/// LHS : Expr
|
||||
/// RHS : Expr
|
||||
binary_xor,
|
||||
|
||||
/// TOK : &&
|
||||
/// LHS : Expr
|
||||
/// RHS : Expr
|
||||
circuit_and,
|
||||
|
||||
/// TOK : ||
|
||||
/// LHS : Expr
|
||||
/// RHS : Expr
|
||||
circuit_or,
|
||||
|
||||
/// TOK : !
|
||||
/// LHS : Expr
|
||||
/// RHS : --
|
||||
not,
|
||||
|
||||
/// TOK : -
|
||||
/// LHS : Expr
|
||||
/// RHS : --
|
||||
negate,
|
||||
|
||||
/// TOK : *
|
||||
/// LHS : Expr
|
||||
/// RHS : --
|
||||
deref,
|
||||
|
||||
/// TOK : &
|
||||
/// LHS : Expr
|
||||
/// RHS : --
|
||||
addr_of,
|
||||
|
||||
/// TOK : ==
|
||||
/// LHS : Expr
|
||||
/// RHS : Expr
|
||||
equal,
|
||||
|
||||
/// TOK : !=
|
||||
/// LHS : Expr
|
||||
/// RHS : Expr
|
||||
not_equal,
|
||||
|
||||
/// TOK : <
|
||||
/// LHS : Expr
|
||||
/// RHS : Expr
|
||||
less,
|
||||
|
||||
/// TOK : <=
|
||||
/// LHS : Expr
|
||||
/// RHS : Expr
|
||||
less_equal,
|
||||
|
||||
/// TOK : >
|
||||
/// LHS : Expr
|
||||
/// RHS : Expr
|
||||
greater,
|
||||
|
||||
/// TOK : >=
|
||||
/// LHS : Expr
|
||||
/// RHS : Expr
|
||||
greater_equal,
|
||||
|
||||
/// for identifier, array without element type specified,
|
||||
/// vector prefix (e.g. vec2) and matrix prefix (e.g. mat2x2) LHS is null
|
||||
/// see callExpr in Parser.zig if you don't understand this
|
||||
///
|
||||
/// TOK : ident, k_array, k_bool, 'number type keywords', 'vector keywords', 'matrix keywords'
|
||||
/// LHS : (number_type, bool_type, vector_type, matrix_type, array_type)?
|
||||
/// RHS : arguments (Expr span)
|
||||
call,
|
||||
|
||||
/// TOK : k_bitcast
|
||||
/// LHS : Type
|
||||
/// RHS : Expr
|
||||
bitcast,
|
||||
|
||||
/// TOK : ident
|
||||
/// LHS : --
|
||||
/// RHS : --
|
||||
ident_expr,
|
||||
|
||||
/// LHS is prefix expression
|
||||
/// TOK : ident
|
||||
/// LHS : Expr
|
||||
component_access,
|
||||
|
||||
/// LHS is prefix expression
|
||||
/// TOK : bracket_left
|
||||
/// LHS : Expr
|
||||
/// RHS : Expr
|
||||
index_access,
|
||||
|
||||
// ####### Literals #######
|
||||
|
||||
/// TOK : k_true
|
||||
/// LHS : --
|
||||
/// RHS : --
|
||||
bool_true,
|
||||
/// TOK : k_false
|
||||
/// LHS : --
|
||||
/// RHS : --
|
||||
bool_false,
|
||||
/// TOK : number
|
||||
/// LHS : --
|
||||
/// RHS : --
|
||||
number_literal,
|
||||
};
|
||||
|
||||
pub const GlobalVarDecl = struct {
|
||||
/// span(Attr)?
|
||||
attrs: Index = null_index,
|
||||
/// Token(ident)
|
||||
name: Index,
|
||||
/// Token(AddrSpace)?
|
||||
addr_space: Index = null_index,
|
||||
/// Token(AccessMode)?
|
||||
access_mode: Index = null_index,
|
||||
/// Type?
|
||||
type: Index = null_index,
|
||||
};
|
||||
|
||||
pub const VarDecl = struct {
|
||||
/// Token(ident)
|
||||
name: Index,
|
||||
/// Token(AddrSpace)?
|
||||
addr_space: Index = null_index,
|
||||
/// Token(AccessMode)?
|
||||
access_mode: Index = null_index,
|
||||
/// Type?
|
||||
type: Index = null_index,
|
||||
};
|
||||
|
||||
pub const OverrideDecl = struct {
|
||||
/// span(Attr)?
|
||||
attrs: Index = null_index,
|
||||
/// Type?
|
||||
type: Index = null_index,
|
||||
};
|
||||
|
||||
pub const PtrType = struct {
|
||||
/// Token(AddrSpace)
|
||||
addr_space: Index,
|
||||
/// Token(AccessMode)?
|
||||
access_mode: Index = null_index,
|
||||
};
|
||||
|
||||
pub const WorkgroupSize = struct {
|
||||
/// Expr
|
||||
x: Index,
|
||||
/// Expr?
|
||||
y: Index = null_index,
|
||||
/// Expr?
|
||||
z: Index = null_index,
|
||||
};
|
||||
|
||||
pub const FnProto = struct {
|
||||
/// span(Attr)?
|
||||
attrs: Index = null_index,
|
||||
/// span(fn_param)?
|
||||
params: Index = null_index,
|
||||
/// span(Attr)?
|
||||
result_attrs: Index = null_index,
|
||||
/// Type?
|
||||
result_type: Index = null_index,
|
||||
};
|
||||
|
||||
pub const IfStatement = struct {
|
||||
/// Expr
|
||||
cond: Index,
|
||||
/// block
|
||||
body: Index,
|
||||
};
|
||||
|
||||
pub const ForHeader = struct {
|
||||
/// var_decl, const_decl, let_decl, phony_assign, compound_assign
|
||||
init: Index = null_index,
|
||||
/// Expr
|
||||
cond: Index = null_index,
|
||||
/// call, phony_assign, compound_assign
|
||||
update: Index = null_index,
|
||||
};
|
||||
};
|
||||
|
||||
pub const BuiltinValue = enum {
|
||||
vertex_index,
|
||||
instance_index,
|
||||
position,
|
||||
front_facing,
|
||||
frag_depth,
|
||||
local_invocation_id,
|
||||
local_invocation_index,
|
||||
global_invocation_id,
|
||||
workgroup_id,
|
||||
num_workgroups,
|
||||
sample_index,
|
||||
sample_mask,
|
||||
};
|
||||
|
||||
pub const InterpolationType = enum {
|
||||
perspective,
|
||||
linear,
|
||||
flat,
|
||||
};
|
||||
|
||||
pub const InterpolationSample = enum {
|
||||
center,
|
||||
centroid,
|
||||
sample,
|
||||
};
|
||||
|
||||
pub const AddressSpace = enum {
|
||||
function,
|
||||
private,
|
||||
workgroup,
|
||||
uniform,
|
||||
storage,
|
||||
};
|
||||
|
||||
pub const AccessMode = enum {
|
||||
read,
|
||||
write,
|
||||
read_write,
|
||||
};
|
||||
|
||||
pub const Attribute = enum {
|
||||
invariant,
|
||||
@"const",
|
||||
vertex,
|
||||
fragment,
|
||||
compute,
|
||||
@"align",
|
||||
binding,
|
||||
group,
|
||||
id,
|
||||
location,
|
||||
size,
|
||||
builtin,
|
||||
workgroup_size,
|
||||
interpolate,
|
||||
};
|
||||
|
||||
pub const TexelFormat = enum {
|
||||
rgba8unorm,
|
||||
rgba8snorm,
|
||||
rgba8uint,
|
||||
rgba8sint,
|
||||
rgba16uint,
|
||||
rgba16sint,
|
||||
rgba16float,
|
||||
r32uint,
|
||||
r32sint,
|
||||
r32float,
|
||||
rg32uint,
|
||||
rg32sint,
|
||||
rg32float,
|
||||
rgba32uint,
|
||||
rgba32sint,
|
||||
rgba32float,
|
||||
bgra8unorm,
|
||||
};
|
||||
File diff suppressed because it is too large
Load diff
|
|
@ -1,131 +0,0 @@
|
|||
const std = @import("std");
|
||||
const Token = @import("Token.zig");
|
||||
pub const ErrorList = @This();
|
||||
|
||||
pub const ErrorMsg = struct {
|
||||
loc: Token.Loc,
|
||||
msg: []const u8,
|
||||
note: ?Note = null,
|
||||
|
||||
pub const Note = struct {
|
||||
loc: ?Token.Loc = null,
|
||||
msg: []const u8,
|
||||
};
|
||||
};
|
||||
|
||||
arena: std.heap.ArenaAllocator,
|
||||
list: std.ArrayListUnmanaged(ErrorMsg) = .{},
|
||||
|
||||
pub fn init(allocator: std.mem.Allocator) !ErrorList {
|
||||
return .{
|
||||
.arena = std.heap.ArenaAllocator.init(allocator),
|
||||
};
|
||||
}
|
||||
|
||||
pub fn deinit(self: *ErrorList) void {
|
||||
self.arena.deinit();
|
||||
self.* = undefined;
|
||||
}
|
||||
|
||||
pub fn add(
|
||||
self: *ErrorList,
|
||||
loc: Token.Loc,
|
||||
comptime format: []const u8,
|
||||
args: anytype,
|
||||
note: ?ErrorMsg.Note,
|
||||
) !void {
|
||||
const err_msg = .{
|
||||
.loc = loc,
|
||||
.msg = try std.fmt.allocPrint(self.arena.allocator(), comptime format, args),
|
||||
.note = note,
|
||||
};
|
||||
try self.list.append(self.arena.allocator(), err_msg);
|
||||
}
|
||||
|
||||
pub fn createNote(
|
||||
self: *ErrorList,
|
||||
loc: ?Token.Loc,
|
||||
comptime format: []const u8,
|
||||
args: anytype,
|
||||
) !ErrorMsg.Note {
|
||||
return .{
|
||||
.loc = loc,
|
||||
.msg = try std.fmt.allocPrint(self.arena.allocator(), comptime format, args),
|
||||
};
|
||||
}
|
||||
|
||||
pub fn print(self: ErrorList, source: []const u8, file_path: ?[]const u8) !void {
|
||||
const stderr = std.io.getStdErr();
|
||||
var bw = std.io.bufferedWriter(stderr.writer());
|
||||
const b = bw.writer();
|
||||
const term = if (stderr.supportsAnsiEscapeCodes())
|
||||
std.debug.TTY.Config{ .escape_codes = {} }
|
||||
else
|
||||
std.debug.TTY.Config{ .no_color = {} };
|
||||
|
||||
for (self.list.items) |*err| {
|
||||
const loc_extra = err.loc.extraInfo(source);
|
||||
|
||||
// 'file:line:column error: MSG'
|
||||
try term.setColor(b, .Bold);
|
||||
try b.print("{?s}:{d}:{d} ", .{ file_path, loc_extra.line, loc_extra.col });
|
||||
try term.setColor(b, .Red);
|
||||
try b.writeAll("error: ");
|
||||
try term.setColor(b, .Reset);
|
||||
try term.setColor(b, .Bold);
|
||||
try b.writeAll(err.msg);
|
||||
try b.writeByte('\n');
|
||||
|
||||
try printCode(b, term, source, err.loc);
|
||||
|
||||
// note
|
||||
if (err.note) |note| {
|
||||
if (note.loc) |note_loc| {
|
||||
const note_loc_extra = note_loc.extraInfo(source);
|
||||
|
||||
try term.setColor(b, .Reset);
|
||||
try term.setColor(b, .Bold);
|
||||
try b.print("{?s}:{d}:{d} ", .{ file_path, note_loc_extra.line, note_loc_extra.col });
|
||||
}
|
||||
try term.setColor(b, .Cyan);
|
||||
try b.writeAll("note: ");
|
||||
|
||||
try term.setColor(b, .Reset);
|
||||
try term.setColor(b, .Bold);
|
||||
try b.writeAll(note.msg);
|
||||
try b.writeByte('\n');
|
||||
|
||||
if (note.loc) |note_loc| {
|
||||
try printCode(b, term, source, note_loc);
|
||||
}
|
||||
}
|
||||
|
||||
try term.setColor(b, .Reset);
|
||||
}
|
||||
try bw.flush();
|
||||
}
|
||||
|
||||
fn printCode(writer: anytype, term: std.debug.TTY.Config, source: []const u8, loc: Token.Loc) !void {
|
||||
const loc_extra = loc.extraInfo(source);
|
||||
try term.setColor(writer, .Dim);
|
||||
try writer.print("{d} │ ", .{loc_extra.line});
|
||||
try term.setColor(writer, .Reset);
|
||||
try writer.writeAll(source[loc_extra.line_start..loc.start]);
|
||||
try term.setColor(writer, .Green);
|
||||
try writer.writeAll(source[loc.start..loc.end]);
|
||||
try term.setColor(writer, .Reset);
|
||||
try writer.writeAll(source[loc.end..loc_extra.line_end]);
|
||||
try writer.writeByte('\n');
|
||||
|
||||
// location pointer
|
||||
const line_number_len = (std.math.log10(loc_extra.line) + 1) + 3;
|
||||
try writer.writeByteNTimes(
|
||||
' ',
|
||||
line_number_len + (loc_extra.col - 1),
|
||||
);
|
||||
try term.setColor(writer, .Bold);
|
||||
try term.setColor(writer, .Green);
|
||||
try writer.writeByte('^');
|
||||
try writer.writeByteNTimes('~', loc.end - loc.start - 1);
|
||||
try writer.writeByte('\n');
|
||||
}
|
||||
|
|
@ -1,602 +0,0 @@
|
|||
const std = @import("std");
|
||||
const AstGen = @import("AstGen.zig");
|
||||
const Ast = @import("Ast.zig");
|
||||
const ErrorList = @import("ErrorList.zig");
|
||||
const IR = @This();
|
||||
|
||||
allocator: std.mem.Allocator,
|
||||
globals_index: u32,
|
||||
instructions: []const Inst,
|
||||
refs: []const Inst.Ref,
|
||||
strings: []const u8,
|
||||
errors: ErrorList,
|
||||
|
||||
pub fn deinit(self: *IR) void {
|
||||
self.allocator.free(self.instructions);
|
||||
self.allocator.free(self.refs);
|
||||
self.allocator.free(self.strings);
|
||||
self.errors.deinit();
|
||||
self.* = undefined;
|
||||
}
|
||||
|
||||
pub fn generate(allocator: std.mem.Allocator, tree: *const Ast) error{OutOfMemory}!IR {
|
||||
var astgen = AstGen{
|
||||
.allocator = allocator,
|
||||
.tree = tree,
|
||||
.errors = try ErrorList.init(allocator),
|
||||
.scope_pool = std.heap.MemoryPool(AstGen.Scope).init(allocator),
|
||||
};
|
||||
defer {
|
||||
astgen.scope_pool.deinit();
|
||||
astgen.scratch.deinit(allocator);
|
||||
}
|
||||
errdefer {
|
||||
astgen.instructions.deinit(allocator);
|
||||
astgen.refs.deinit(allocator);
|
||||
astgen.strings.deinit(allocator);
|
||||
}
|
||||
|
||||
const globals_index = try astgen.genTranslationUnit();
|
||||
|
||||
return .{
|
||||
.allocator = allocator,
|
||||
.globals_index = globals_index,
|
||||
.instructions = try astgen.instructions.toOwnedSlice(allocator),
|
||||
.refs = try astgen.refs.toOwnedSlice(allocator),
|
||||
.strings = try astgen.strings.toOwnedSlice(allocator),
|
||||
.errors = astgen.errors,
|
||||
};
|
||||
}
|
||||
|
||||
pub fn getStr(self: IR, index: u32) []const u8 {
|
||||
return std.mem.sliceTo(self.strings[index..], 0);
|
||||
}
|
||||
|
||||
pub const Inst = struct {
|
||||
tag: Tag,
|
||||
data: Data,
|
||||
|
||||
pub const List = std.ArrayListUnmanaged(Inst);
|
||||
pub const Index = u32;
|
||||
|
||||
const ref_start_index = @typeInfo(Ref).Enum.fields.len;
|
||||
pub fn toRef(index: Inst.Index) Ref {
|
||||
return @intToEnum(Ref, ref_start_index + index);
|
||||
}
|
||||
|
||||
pub const Ref = enum(u32) {
|
||||
none,
|
||||
|
||||
bool_type,
|
||||
i32_type,
|
||||
u32_type,
|
||||
f32_type,
|
||||
f16_type,
|
||||
sampler_type,
|
||||
comparison_sampler_type,
|
||||
external_sampled_texture_type,
|
||||
|
||||
true_literal,
|
||||
false_literal,
|
||||
|
||||
_,
|
||||
|
||||
pub fn toIndex(inst: Ref) ?Inst.Index {
|
||||
const ref_int = @enumToInt(inst);
|
||||
if (ref_int >= ref_start_index) {
|
||||
return @intCast(Inst.Index, ref_int - ref_start_index);
|
||||
} else {
|
||||
return null;
|
||||
}
|
||||
}
|
||||
|
||||
pub fn is(self: Ref, list: List, comptime expected: []const Inst.Tag) bool {
|
||||
inline for (expected) |e| {
|
||||
if (list.items[self.toIndex().?].tag == e) return true;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
pub fn isType(self: Ref, list: List) bool {
|
||||
return switch (self) {
|
||||
.none,
|
||||
.true_literal,
|
||||
.false_literal,
|
||||
=> false,
|
||||
.bool_type,
|
||||
.i32_type,
|
||||
.u32_type,
|
||||
.f32_type,
|
||||
.f16_type,
|
||||
.sampler_type,
|
||||
.comparison_sampler_type,
|
||||
.external_sampled_texture_type,
|
||||
=> true,
|
||||
_ => switch (list.items[self.toIndex().?].tag) {
|
||||
.struct_decl,
|
||||
.vector_type,
|
||||
.matrix_type,
|
||||
.atomic_type,
|
||||
.array_type,
|
||||
.ptr_type,
|
||||
.sampled_texture_type,
|
||||
.multisampled_texture_type,
|
||||
.storage_texture_type,
|
||||
.depth_texture_type,
|
||||
=> true,
|
||||
else => false,
|
||||
},
|
||||
};
|
||||
}
|
||||
|
||||
pub fn isNumberType(self: Ref) bool {
|
||||
return switch (self) {
|
||||
.i32_type,
|
||||
.u32_type,
|
||||
.f32_type,
|
||||
.f16_type,
|
||||
=> true,
|
||||
else => false,
|
||||
};
|
||||
}
|
||||
|
||||
pub fn isLiteral(self: Ref, list: List) bool {
|
||||
return switch (self) {
|
||||
.true_literal,
|
||||
.false_literal,
|
||||
=> true,
|
||||
.none,
|
||||
.bool_type,
|
||||
.i32_type,
|
||||
.u32_type,
|
||||
.f32_type,
|
||||
.f16_type,
|
||||
.sampler_type,
|
||||
.comparison_sampler_type,
|
||||
.external_sampled_texture_type,
|
||||
=> false,
|
||||
_ => switch (list.items[self.toIndex().?].tag) {
|
||||
.integer_literal,
|
||||
.float_literal,
|
||||
=> true,
|
||||
else => false,
|
||||
},
|
||||
};
|
||||
}
|
||||
|
||||
pub fn isBoolLiteral(self: Ref) bool {
|
||||
return switch (self) {
|
||||
.true_literal,
|
||||
.false_literal,
|
||||
=> true,
|
||||
else => false,
|
||||
};
|
||||
}
|
||||
|
||||
pub fn isNumberLiteral(self: Ref, list: List) bool {
|
||||
const i = self.toIndex() orelse return false;
|
||||
return switch (list.items[i].tag) {
|
||||
.integer_literal,
|
||||
.float_literal,
|
||||
=> true,
|
||||
else => false,
|
||||
};
|
||||
}
|
||||
|
||||
pub fn isExpr(self: Ref, list: List) bool {
|
||||
const i = self.toIndex() orelse return false;
|
||||
return switch (list.items[i].tag) {
|
||||
.index,
|
||||
.member_access,
|
||||
.bitcast,
|
||||
.ident,
|
||||
=> true,
|
||||
else => self.isBinaryExpr() or self.isUnaryExpr(),
|
||||
};
|
||||
}
|
||||
|
||||
pub fn isBinaryExpr(self: Ref, list: List) bool {
|
||||
const i = self.toIndex() orelse return false;
|
||||
return switch (list.items[i].tag) {
|
||||
.mul,
|
||||
.div,
|
||||
.mod,
|
||||
.add,
|
||||
.sub,
|
||||
.shift_left,
|
||||
.shift_right,
|
||||
.binary_and,
|
||||
.binary_or,
|
||||
.binary_xor,
|
||||
.circuit_and,
|
||||
.circuit_or,
|
||||
.equal,
|
||||
.not_equal,
|
||||
.less,
|
||||
.less_equal,
|
||||
.greater,
|
||||
.greater_equal,
|
||||
=> true,
|
||||
else => false,
|
||||
};
|
||||
}
|
||||
|
||||
pub fn isUnaryExpr(self: Ref, list: List) bool {
|
||||
const i = self.toIndex() orelse return false;
|
||||
return switch (list.items[i].tag) {
|
||||
.not,
|
||||
.negate,
|
||||
.deref,
|
||||
.addr_of,
|
||||
=> true,
|
||||
else => false,
|
||||
};
|
||||
}
|
||||
};
|
||||
|
||||
pub const Tag = enum(u6) {
|
||||
/// data is global_variable_decl
|
||||
global_variable_decl,
|
||||
|
||||
/// data is struct_decl
|
||||
struct_decl,
|
||||
/// data is struct_member
|
||||
struct_member,
|
||||
|
||||
/// data is attr_simple
|
||||
attr_simple,
|
||||
/// data is attr_expr
|
||||
attr_expr,
|
||||
/// data is attr_builtin
|
||||
attr_builtin,
|
||||
/// data is attr_workgroup
|
||||
attr_workgroup,
|
||||
/// data is attr_interpolate
|
||||
attr_interpolate,
|
||||
|
||||
/// data is vector_type
|
||||
vector_type,
|
||||
/// data is matrix_type
|
||||
matrix_type,
|
||||
/// data is atomic_type
|
||||
atomic_type,
|
||||
/// data is array_type
|
||||
array_type,
|
||||
/// data is ptr_type
|
||||
ptr_type,
|
||||
/// data is sampled_texture_type
|
||||
sampled_texture_type,
|
||||
/// data is multisampled_texture_type
|
||||
multisampled_texture_type,
|
||||
/// data is storage_texture_type
|
||||
storage_texture_type,
|
||||
/// data is depth_texture_type
|
||||
depth_texture_type,
|
||||
|
||||
/// data is integer_literal
|
||||
integer_literal,
|
||||
/// data is float_literal
|
||||
float_literal,
|
||||
|
||||
/// data is ref
|
||||
not,
|
||||
/// data is ref
|
||||
negate,
|
||||
/// data is ref
|
||||
deref,
|
||||
/// data is ref
|
||||
addr_of,
|
||||
|
||||
/// data is binary
|
||||
mul,
|
||||
/// data is binary
|
||||
div,
|
||||
/// data is binary
|
||||
mod,
|
||||
/// data is binary
|
||||
add,
|
||||
/// data is binary
|
||||
sub,
|
||||
/// data is binary
|
||||
shift_left,
|
||||
/// data is binary
|
||||
shift_right,
|
||||
/// data is binary
|
||||
binary_and,
|
||||
/// data is binary
|
||||
binary_or,
|
||||
/// data is binary
|
||||
binary_xor,
|
||||
/// data is binary
|
||||
circuit_and,
|
||||
/// data is binary
|
||||
circuit_or,
|
||||
/// data is binary
|
||||
equal,
|
||||
/// data is binary
|
||||
not_equal,
|
||||
/// data is binary
|
||||
less,
|
||||
/// data is binary
|
||||
less_equal,
|
||||
/// data is binary
|
||||
greater,
|
||||
/// data is binary
|
||||
greater_equal,
|
||||
|
||||
/// data is binary
|
||||
index,
|
||||
/// data is member_access
|
||||
member_access,
|
||||
/// data is binary (lhs is expr, rhs is type)
|
||||
bitcast,
|
||||
|
||||
/// data is var_ref
|
||||
var_ref,
|
||||
|
||||
pub fn isDecl(self: Tag) bool {
|
||||
return switch (self) {
|
||||
.global_variable_decl, .struct_decl => true,
|
||||
else => false,
|
||||
};
|
||||
}
|
||||
};
|
||||
|
||||
pub const Data = union {
|
||||
ref: Ref,
|
||||
var_ref: VarRef,
|
||||
global_variable_decl: GlobalVariableDecl,
|
||||
struct_decl: StructDecl,
|
||||
struct_member: StructMember,
|
||||
/// attributes with no argument.
|
||||
attr_simple: AttrSimple,
|
||||
/// attributes with an expression argument.
|
||||
attr_expr: AttrExpr,
|
||||
/// @builtin attribute which accepts a BuiltinValue argument.
|
||||
attr_builtin: BuiltinValue,
|
||||
/// @workgroup attribute. accepts at laest 1 argument.
|
||||
attr_workgroup: AttrWorkgroup,
|
||||
/// @interpolate attribute. accepts 2 arguments.
|
||||
attr_interpolate: AttrInterpolate,
|
||||
vector_type: VectorType,
|
||||
matrix_type: MatrixType,
|
||||
atomic_type: AtomicType,
|
||||
array_type: ArrayType,
|
||||
ptr_type: PointerType,
|
||||
sampled_texture_type: SampledTextureType,
|
||||
multisampled_texture_type: MultisampledTextureType,
|
||||
storage_texture_type: StorageTextureType,
|
||||
depth_texture_type: DepthTextureType,
|
||||
integer_literal: i64,
|
||||
float_literal: f64,
|
||||
/// meaning of LHS and RHS depends on the corresponding Tag.
|
||||
binary: BinaryExpr,
|
||||
member_access: MemberAccess,
|
||||
};
|
||||
|
||||
pub const VarRef = struct {
|
||||
/// index to null-terminated string in `strings`
|
||||
name: u32,
|
||||
variable: Ref,
|
||||
};
|
||||
|
||||
pub const GlobalVariableDecl = struct {
|
||||
/// index to null-terminated string in `strings`
|
||||
name: u32,
|
||||
type: Ref = .none,
|
||||
addr_space: AddressSpace,
|
||||
access_mode: AccessMode,
|
||||
/// length of attributes
|
||||
attrs: u4 = 0,
|
||||
expr: Ref = .none,
|
||||
|
||||
pub const AddressSpace = enum {
|
||||
none,
|
||||
function,
|
||||
private,
|
||||
workgroup,
|
||||
uniform,
|
||||
storage,
|
||||
};
|
||||
|
||||
pub const AccessMode = enum {
|
||||
none,
|
||||
read,
|
||||
write,
|
||||
read_write,
|
||||
};
|
||||
};
|
||||
|
||||
pub const StructDecl = struct {
|
||||
/// index to null-terminated string in `strings`
|
||||
name: u32,
|
||||
/// length of the member Ref's which comes after this
|
||||
members: u32,
|
||||
};
|
||||
|
||||
pub const StructMember = struct {
|
||||
/// index to null-terminated string in `strings`
|
||||
name: u32,
|
||||
type: Ref,
|
||||
@"align": u29, // 0 means null
|
||||
};
|
||||
|
||||
pub const BuiltinValue = enum {
|
||||
vertex_index,
|
||||
instance_index,
|
||||
position,
|
||||
front_facing,
|
||||
frag_depth,
|
||||
local_invocation_id,
|
||||
local_invocation_index,
|
||||
global_invocation_id,
|
||||
workgroup_id,
|
||||
num_workgroups,
|
||||
sample_index,
|
||||
sample_mask,
|
||||
};
|
||||
|
||||
pub const AttrSimple = enum {
|
||||
invariant,
|
||||
@"const",
|
||||
vertex,
|
||||
fragment,
|
||||
compute,
|
||||
};
|
||||
|
||||
pub const AttrExpr = struct {
|
||||
kind: Kind,
|
||||
expr: Ref,
|
||||
|
||||
pub const Kind = enum {
|
||||
@"align",
|
||||
binding,
|
||||
group,
|
||||
id,
|
||||
location,
|
||||
size,
|
||||
};
|
||||
};
|
||||
|
||||
pub const AttrWorkgroup = struct {
|
||||
expr0: Ref,
|
||||
expr1: Ref = .none,
|
||||
expr2: Ref = .none,
|
||||
};
|
||||
|
||||
pub const AttrInterpolate = struct {
|
||||
type: InterpolationType,
|
||||
sample: InterpolationSample,
|
||||
|
||||
pub const InterpolationType = enum {
|
||||
perspective,
|
||||
linear,
|
||||
flat,
|
||||
};
|
||||
|
||||
pub const InterpolationSample = enum {
|
||||
center,
|
||||
centroid,
|
||||
sample,
|
||||
};
|
||||
};
|
||||
|
||||
pub const VectorType = struct {
|
||||
component_type: Ref,
|
||||
size: Size,
|
||||
|
||||
pub const Size = enum { two, three, four };
|
||||
};
|
||||
|
||||
pub const MatrixType = struct {
|
||||
component_type: Ref,
|
||||
cols: VectorType.Size,
|
||||
rows: VectorType.Size,
|
||||
};
|
||||
|
||||
pub const AtomicType = struct { component_type: Ref };
|
||||
|
||||
pub const ArrayType = struct {
|
||||
component_type: Ref,
|
||||
size: Ref = .none,
|
||||
};
|
||||
|
||||
pub const PointerType = struct {
|
||||
component_type: Ref,
|
||||
addr_space: AddressSpace,
|
||||
access_mode: AccessMode,
|
||||
|
||||
pub const AddressSpace = enum {
|
||||
function,
|
||||
private,
|
||||
workgroup,
|
||||
uniform,
|
||||
storage,
|
||||
};
|
||||
|
||||
pub const AccessMode = enum {
|
||||
read,
|
||||
write,
|
||||
read_write,
|
||||
};
|
||||
};
|
||||
|
||||
pub const SampledTextureType = struct {
|
||||
kind: Kind,
|
||||
component_type: Ref,
|
||||
|
||||
pub const Kind = enum {
|
||||
@"1d",
|
||||
@"2d",
|
||||
@"2d_array",
|
||||
@"3d",
|
||||
cube,
|
||||
cube_array,
|
||||
};
|
||||
};
|
||||
|
||||
pub const MultisampledTextureType = struct {
|
||||
kind: Kind,
|
||||
component_type: Ref,
|
||||
|
||||
pub const Kind = enum { @"2d" };
|
||||
};
|
||||
|
||||
pub const StorageTextureType = struct {
|
||||
kind: Kind,
|
||||
texel_format: TexelFormat,
|
||||
access_mode: AccessMode,
|
||||
|
||||
pub const Kind = enum {
|
||||
@"1d",
|
||||
@"2d",
|
||||
@"2d_array",
|
||||
@"3d",
|
||||
};
|
||||
|
||||
pub const TexelFormat = enum {
|
||||
rgba8unorm,
|
||||
rgba8snorm,
|
||||
rgba8uint,
|
||||
rgba8sint,
|
||||
rgba16uint,
|
||||
rgba16sint,
|
||||
rgba16float,
|
||||
r32uint,
|
||||
r32sint,
|
||||
r32float,
|
||||
rg32uint,
|
||||
rg32sint,
|
||||
rg32float,
|
||||
rgba32uint,
|
||||
rgba32sint,
|
||||
rgba32float,
|
||||
bgra8unorm,
|
||||
};
|
||||
|
||||
pub const AccessMode = enum { write };
|
||||
};
|
||||
|
||||
pub const DepthTextureType = enum {
|
||||
@"2d",
|
||||
@"2d_array",
|
||||
cube,
|
||||
cube_array,
|
||||
multisampled_2d,
|
||||
};
|
||||
|
||||
pub const BinaryExpr = struct {
|
||||
lhs: Ref,
|
||||
rhs: Ref,
|
||||
};
|
||||
|
||||
pub const MemberAccess = struct {
|
||||
base: Ref,
|
||||
/// index to null-terminated string in `strings`
|
||||
name: u32,
|
||||
};
|
||||
|
||||
comptime {
|
||||
std.debug.assert(@sizeOf(Inst) <= 32);
|
||||
}
|
||||
};
|
||||
File diff suppressed because it is too large
Load diff
|
|
@ -1,471 +0,0 @@
|
|||
const std = @import("std");
|
||||
|
||||
tag: Tag,
|
||||
loc: Loc,
|
||||
|
||||
pub const Loc = struct {
|
||||
start: u32,
|
||||
end: u32,
|
||||
|
||||
pub const Extra = struct {
|
||||
line: u32,
|
||||
col: u32,
|
||||
line_start: u32,
|
||||
line_end: u32,
|
||||
};
|
||||
|
||||
pub fn slice(self: Loc, source: []const u8) []const u8 {
|
||||
return source[self.start..self.end];
|
||||
}
|
||||
|
||||
pub fn extraInfo(self: Loc, source: []const u8) Extra {
|
||||
var result = Extra{
|
||||
.line = 1,
|
||||
.col = 1,
|
||||
.line_start = 0,
|
||||
.line_end = @intCast(u32, source.len),
|
||||
};
|
||||
|
||||
for (source[0..self.start], 0..) |c, i| {
|
||||
if (c == '\n') {
|
||||
result.line += 1;
|
||||
result.line_start = @intCast(u32, i) + 1;
|
||||
}
|
||||
}
|
||||
|
||||
for (source[self.end..], 0..) |c, i| {
|
||||
if (c == '\n') {
|
||||
result.line_end = self.end + @intCast(u32, i);
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
result.col += self.start - result.line_start;
|
||||
return result;
|
||||
}
|
||||
};
|
||||
|
||||
pub const Tag = enum {
|
||||
eof,
|
||||
invalid,
|
||||
|
||||
ident,
|
||||
/// any number literal
|
||||
number,
|
||||
|
||||
/// '&'
|
||||
@"and",
|
||||
/// '&&'
|
||||
and_and,
|
||||
/// '->'
|
||||
arrow,
|
||||
/// '@'
|
||||
attr,
|
||||
/// '/'
|
||||
division,
|
||||
/// '!'
|
||||
bang,
|
||||
/// '{'
|
||||
brace_left,
|
||||
/// '}'
|
||||
brace_right,
|
||||
/// '['
|
||||
bracket_left,
|
||||
/// ']'
|
||||
bracket_right,
|
||||
/// ':'
|
||||
colon,
|
||||
/// ','
|
||||
comma,
|
||||
/// '='
|
||||
equal,
|
||||
/// '=='
|
||||
equal_equal,
|
||||
/// '>'
|
||||
greater_than,
|
||||
/// '>='
|
||||
greater_than_equal,
|
||||
/// '>>'
|
||||
shift_right,
|
||||
/// '<'
|
||||
less_than,
|
||||
/// '<='
|
||||
less_than_equal,
|
||||
/// '<<'
|
||||
shift_left,
|
||||
/// '%'
|
||||
mod,
|
||||
/// '-'
|
||||
minus,
|
||||
/// '--'
|
||||
minus_minus,
|
||||
/// '!='
|
||||
not_equal,
|
||||
/// '.'
|
||||
period,
|
||||
/// '+'
|
||||
plus,
|
||||
/// '++'
|
||||
plus_plus,
|
||||
/// '|'
|
||||
@"or",
|
||||
/// '||'
|
||||
or_or,
|
||||
/// '('
|
||||
paren_left,
|
||||
/// ')'
|
||||
paren_right,
|
||||
/// ';'
|
||||
semicolon,
|
||||
/// '*'
|
||||
star,
|
||||
/// '~'
|
||||
tilde,
|
||||
/// '_'
|
||||
underscore,
|
||||
/// '^'
|
||||
xor,
|
||||
/// '+='
|
||||
plus_equal,
|
||||
/// '-='
|
||||
minus_equal,
|
||||
/// '*='
|
||||
times_equal,
|
||||
/// '/='
|
||||
division_equal,
|
||||
/// '%='
|
||||
modulo_equal,
|
||||
/// '&='
|
||||
and_equal,
|
||||
/// '|='
|
||||
or_equal,
|
||||
/// '^='
|
||||
xor_equal,
|
||||
/// '>>='
|
||||
shift_right_equal,
|
||||
/// '<<='
|
||||
shift_left_equal,
|
||||
|
||||
/// 'array'
|
||||
k_array,
|
||||
/// 'atomic'
|
||||
k_atomic,
|
||||
/// 'bitcast'
|
||||
k_bitcast,
|
||||
/// 'bool'
|
||||
k_bool,
|
||||
/// 'break'
|
||||
k_break,
|
||||
/// 'case'
|
||||
k_case,
|
||||
/// 'const'
|
||||
k_const,
|
||||
/// 'continue'
|
||||
k_continue,
|
||||
/// 'continuing'
|
||||
k_continuing,
|
||||
/// 'discard'
|
||||
k_discard,
|
||||
/// 'default'
|
||||
k_default,
|
||||
/// 'else'
|
||||
k_else,
|
||||
/// 'enable'
|
||||
k_enable,
|
||||
/// 'f16'
|
||||
k_f16,
|
||||
/// 'f32'
|
||||
k_f32,
|
||||
/// 'fallthrough'
|
||||
k_fallthrough,
|
||||
/// 'false'
|
||||
k_false,
|
||||
/// 'fn'
|
||||
k_fn,
|
||||
/// 'for'
|
||||
k_for,
|
||||
/// 'i32'
|
||||
k_i32,
|
||||
/// 'if'
|
||||
k_if,
|
||||
/// 'let'
|
||||
k_let,
|
||||
/// 'loop'
|
||||
k_loop,
|
||||
/// 'mat2x2'
|
||||
k_mat2x2,
|
||||
/// 'mat2x3'
|
||||
k_mat2x3,
|
||||
/// 'mat2x4'
|
||||
k_mat2x4,
|
||||
/// 'mat3x2'
|
||||
k_mat3x2,
|
||||
/// 'mat3x3'
|
||||
k_mat3x3,
|
||||
/// 'mat3x4'
|
||||
k_mat3x4,
|
||||
/// 'mat4x2'
|
||||
k_mat4x2,
|
||||
/// 'mat4x3'
|
||||
k_mat4x3,
|
||||
/// 'mat4x4'
|
||||
k_mat4x4,
|
||||
/// 'override'
|
||||
k_override,
|
||||
/// 'ptr'
|
||||
k_ptr,
|
||||
/// 'require'
|
||||
k_require,
|
||||
/// 'return'
|
||||
k_return,
|
||||
/// 'sampler'
|
||||
k_sampler,
|
||||
/// 'sampler_comparison'
|
||||
k_comparison_sampler,
|
||||
/// 'const_assert'
|
||||
k_const_assert,
|
||||
/// 'struct'
|
||||
k_struct,
|
||||
/// 'switch'
|
||||
k_switch,
|
||||
/// 'texture_depth_2d'
|
||||
k_texture_depth_2d,
|
||||
/// 'texture_depth_2d_array'
|
||||
k_texture_depth_2d_array,
|
||||
/// 'texture_depth_cube'
|
||||
k_texture_depth_cube,
|
||||
/// 'texture_depth_cube_array'
|
||||
k_texture_depth_cube_array,
|
||||
/// 'texture_depth_multisampled_2d'
|
||||
k_texture_depth_multisampled_2d,
|
||||
/// 'texture_external'
|
||||
k_texture_external,
|
||||
/// 'texture_multisampled_2d'
|
||||
k_texture_multisampled_2d,
|
||||
/// 'texture_1d'
|
||||
k_texture_sampled_1d,
|
||||
/// 'texture_2d'
|
||||
k_texture_sampled_2d,
|
||||
/// 'texture_2d_array'
|
||||
k_texture_sampled_2d_array,
|
||||
/// 'texture_3d'
|
||||
k_texture_sampled_3d,
|
||||
/// 'texture_cube'
|
||||
k_texture_sampled_cube,
|
||||
/// 'texture_cube_array'
|
||||
k_texture_sampled_cube_array,
|
||||
/// 'texture_storage_1d'
|
||||
k_texture_storage_1d,
|
||||
/// 'texture_storage_2d'
|
||||
k_texture_storage_2d,
|
||||
/// 'texture_storage_2d_array'
|
||||
k_texture_storage_2d_array,
|
||||
/// 'texture_storage_3d'
|
||||
k_texture_storage_3d,
|
||||
/// 'true'
|
||||
k_true,
|
||||
/// 'type'
|
||||
k_type,
|
||||
/// 'u32'
|
||||
k_u32,
|
||||
/// 'var'
|
||||
k_var,
|
||||
/// 'vec2'
|
||||
k_vec2,
|
||||
/// 'vec3'
|
||||
k_vec3,
|
||||
/// 'vec4'
|
||||
k_vec4,
|
||||
/// 'while'
|
||||
k_while,
|
||||
|
||||
pub fn symbol(self: Tag) []const u8 {
|
||||
return switch (self) {
|
||||
.eof => "EOF",
|
||||
.invalid => "invalid bytes",
|
||||
.ident => "an identifier",
|
||||
.number => "a number literal",
|
||||
.@"and" => "&",
|
||||
.and_and => "&&",
|
||||
.arrow => "->",
|
||||
.attr => "@",
|
||||
.division => "/",
|
||||
.bang => "!",
|
||||
.brace_left => "{",
|
||||
.brace_right => "}",
|
||||
.bracket_left => "[",
|
||||
.bracket_right => "]",
|
||||
.colon => ":",
|
||||
.comma => ",",
|
||||
.equal => "=",
|
||||
.equal_equal => "==",
|
||||
.greater_than => ">",
|
||||
.greater_than_equal => ">=",
|
||||
.shift_right => ">>",
|
||||
.less_than => "<",
|
||||
.less_than_equal => "<=",
|
||||
.shift_left => "<<",
|
||||
.mod => "%",
|
||||
.minus => "-",
|
||||
.minus_minus => "--",
|
||||
.not_equal => "!=",
|
||||
.period => ".",
|
||||
.plus => "+",
|
||||
.plus_plus => "++",
|
||||
.@"or" => "|",
|
||||
.or_or => "||",
|
||||
.paren_left => "(",
|
||||
.paren_right => ")",
|
||||
.semicolon => ";",
|
||||
.star => "*",
|
||||
.tilde => "~",
|
||||
.underscore => "_",
|
||||
.xor => "^",
|
||||
.plus_equal => "+=",
|
||||
.minus_equal => "-=",
|
||||
.times_equal => "*=",
|
||||
.division_equal => "/=",
|
||||
.modulo_equal => "%=",
|
||||
.and_equal => "&=",
|
||||
.or_equal => "|=",
|
||||
.xor_equal => "^=",
|
||||
.shift_right_equal => ">>=",
|
||||
.shift_left_equal => "<<=",
|
||||
.k_array => "array",
|
||||
.k_atomic => "atomic",
|
||||
.k_bitcast => "bitcast",
|
||||
.k_bool => "bool",
|
||||
.k_break => "break",
|
||||
.k_case => "case",
|
||||
.k_const => "const",
|
||||
.k_continue => "continue",
|
||||
.k_continuing => "continuing",
|
||||
.k_discard => "discard",
|
||||
.k_default => "default",
|
||||
.k_else => "else",
|
||||
.k_enable => "enable",
|
||||
.k_f16 => "f16",
|
||||
.k_f32 => "f32",
|
||||
.k_fallthrough => "fallthrough",
|
||||
.k_false => "false",
|
||||
.k_fn => "fn",
|
||||
.k_for => "for",
|
||||
.k_i32 => "i32",
|
||||
.k_if => "if",
|
||||
.k_let => "let",
|
||||
.k_loop => "loop",
|
||||
.k_mat2x2 => "mat2x2",
|
||||
.k_mat2x3 => "mat2x3",
|
||||
.k_mat2x4 => "mat2x4",
|
||||
.k_mat3x2 => "mat3x2",
|
||||
.k_mat3x3 => "mat3x3",
|
||||
.k_mat3x4 => "mat3x4",
|
||||
.k_mat4x2 => "mat4x2",
|
||||
.k_mat4x3 => "mat4x3",
|
||||
.k_mat4x4 => "mat4x4",
|
||||
.k_override => "override",
|
||||
.k_ptr => "ptr",
|
||||
.k_require => "require",
|
||||
.k_return => "return",
|
||||
.k_sampler => "sampler",
|
||||
.k_comparison_sampler => "sampler_comparison",
|
||||
.k_const_assert => "const_assert",
|
||||
.k_struct => "struct",
|
||||
.k_switch => "switch",
|
||||
.k_texture_depth_2d => "texture_depth_2d",
|
||||
.k_texture_depth_2d_array => "texture_depth_2d_array",
|
||||
.k_texture_depth_cube => "texture_depth_cube",
|
||||
.k_texture_depth_cube_array => "texture_depth_cube_array",
|
||||
.k_texture_depth_multisampled_2d => "texture_depth_multisampled_2d",
|
||||
.k_texture_external => "texture_external",
|
||||
.k_texture_multisampled_2d => "texture_multisampled_2d",
|
||||
.k_texture_sampled_1d => "texture_1d",
|
||||
.k_texture_sampled_2d => "texture_2d",
|
||||
.k_texture_sampled_2d_array => "texture_2d_array",
|
||||
.k_texture_sampled_3d => "texture_3d",
|
||||
.k_texture_sampled_cube => "texture_cube",
|
||||
.k_texture_sampled_cube_array => "texture_cube_array",
|
||||
.k_texture_storage_1d => "texture_storage_1d",
|
||||
.k_texture_storage_2d => "texture_storage_2d",
|
||||
.k_texture_storage_2d_array => "texture_storage_2d_array",
|
||||
.k_texture_storage_3d => "texture_storage_3d",
|
||||
.k_true => "true",
|
||||
.k_type => "type",
|
||||
.k_u32 => "u32",
|
||||
.k_var => "var",
|
||||
.k_vec2 => "vec2",
|
||||
.k_vec3 => "vec3",
|
||||
.k_vec4 => "vec4",
|
||||
.k_while => "while",
|
||||
};
|
||||
}
|
||||
};
|
||||
|
||||
pub const keywords = std.ComptimeStringMap(Tag, .{
|
||||
.{ "array", .k_array },
|
||||
.{ "atomic", .k_atomic },
|
||||
.{ "bitcast", .k_bitcast },
|
||||
.{ "bool", .k_bool },
|
||||
.{ "break", .k_break },
|
||||
.{ "case", .k_case },
|
||||
.{ "const", .k_const },
|
||||
.{ "continue", .k_continue },
|
||||
.{ "continuing", .k_continuing },
|
||||
.{ "discard", .k_discard },
|
||||
.{ "default", .k_default },
|
||||
.{ "else", .k_else },
|
||||
.{ "enable", .k_enable },
|
||||
.{ "f16", .k_f16 },
|
||||
.{ "f32", .k_f32 },
|
||||
.{ "fallthrough", .k_fallthrough },
|
||||
.{ "false", .k_false },
|
||||
.{ "fn", .k_fn },
|
||||
.{ "for", .k_for },
|
||||
.{ "i32", .k_i32 },
|
||||
.{ "if", .k_if },
|
||||
.{ "let", .k_let },
|
||||
.{ "loop", .k_loop },
|
||||
.{ "mat2x2", .k_mat2x2 },
|
||||
.{ "mat2x3", .k_mat2x3 },
|
||||
.{ "mat2x4", .k_mat2x4 },
|
||||
.{ "mat3x2", .k_mat3x2 },
|
||||
.{ "mat3x3", .k_mat3x3 },
|
||||
.{ "mat3x4", .k_mat3x4 },
|
||||
.{ "mat4x2", .k_mat4x2 },
|
||||
.{ "mat4x3", .k_mat4x3 },
|
||||
.{ "mat4x4", .k_mat4x4 },
|
||||
.{ "override", .k_override },
|
||||
.{ "ptr", .k_ptr },
|
||||
.{ "require", .k_require },
|
||||
.{ "return", .k_return },
|
||||
.{ "sampler", .k_sampler },
|
||||
.{ "sampler_comparison", .k_comparison_sampler },
|
||||
.{ "const_assert", .k_const_assert },
|
||||
.{ "struct", .k_struct },
|
||||
.{ "switch", .k_switch },
|
||||
.{ "texture_depth_2d", .k_texture_depth_2d },
|
||||
.{ "texture_depth_2d_array", .k_texture_depth_2d_array },
|
||||
.{ "texture_depth_cube", .k_texture_depth_cube },
|
||||
.{ "texture_depth_cube_array", .k_texture_depth_cube_array },
|
||||
.{ "texture_depth_multisampled_2d", .k_texture_depth_multisampled_2d },
|
||||
.{ "texture_external", .k_texture_external },
|
||||
.{ "texture_multisampled_2d", .k_texture_multisampled_2d },
|
||||
.{ "texture_1d", .k_texture_sampled_1d },
|
||||
.{ "texture_2d", .k_texture_sampled_2d },
|
||||
.{ "texture_2d_array", .k_texture_sampled_2d_array },
|
||||
.{ "texture_3d", .k_texture_sampled_3d },
|
||||
.{ "texture_cube", .k_texture_sampled_cube },
|
||||
.{ "texture_cube_array", .k_texture_sampled_cube_array },
|
||||
.{ "texture_storage_1d", .k_texture_storage_1d },
|
||||
.{ "texture_storage_2d", .k_texture_storage_2d },
|
||||
.{ "texture_storage_2d_array", .k_texture_storage_2d_array },
|
||||
.{ "texture_storage_3d", .k_texture_storage_3d },
|
||||
.{ "true", .k_true },
|
||||
.{ "type", .k_type },
|
||||
.{ "u32", .k_u32 },
|
||||
.{ "var", .k_var },
|
||||
.{ "vec2", .k_vec2 },
|
||||
.{ "vec3", .k_vec3 },
|
||||
.{ "vec4", .k_vec4 },
|
||||
.{ "while", .k_while },
|
||||
});
|
||||
|
|
@ -1,420 +0,0 @@
|
|||
const std = @import("std");
|
||||
const Token = @import("Token.zig");
|
||||
|
||||
const Tokenizer = @This();
|
||||
|
||||
source: [:0]const u8,
|
||||
index: u32,
|
||||
|
||||
const State = enum {
|
||||
start,
|
||||
invalid,
|
||||
ident,
|
||||
underscore,
|
||||
number,
|
||||
block_comment,
|
||||
ampersand,
|
||||
bang,
|
||||
equal,
|
||||
greater,
|
||||
shift_right,
|
||||
less,
|
||||
shift_left,
|
||||
minus,
|
||||
mod,
|
||||
pipe,
|
||||
plus,
|
||||
slash,
|
||||
star,
|
||||
xor,
|
||||
};
|
||||
|
||||
pub fn dump(self: *Tokenizer, token: Token) void {
|
||||
std.debug.print("\x1b[0;33m{s} \x1b[0;90m\"{s}\"\x1b[0m\n", .{ @tagName(token.tag), token.loc.slice(self.source) });
|
||||
}
|
||||
|
||||
pub fn init(source: [:0]const u8) Tokenizer {
|
||||
// Skip the UTF-8 BOM if present
|
||||
const src_start: u32 = if (std.mem.startsWith(u8, source, "\xEF\xBB\xBF")) 3 else 0;
|
||||
return Tokenizer{
|
||||
.source = source[src_start..],
|
||||
.index = 0,
|
||||
};
|
||||
}
|
||||
|
||||
pub fn peek(self: *Tokenizer) Token {
|
||||
var index = self.index;
|
||||
var state = State.start;
|
||||
var result = Token{
|
||||
.tag = .eof,
|
||||
.loc = .{
|
||||
.start = index,
|
||||
.end = undefined,
|
||||
},
|
||||
};
|
||||
|
||||
while (true) : (index += 1) {
|
||||
const c = self.source[index];
|
||||
switch (state) {
|
||||
.start => switch (c) {
|
||||
0 => {
|
||||
if (index != self.source.len) {
|
||||
result.tag = .invalid;
|
||||
result.loc.start = index;
|
||||
index += 1;
|
||||
result.loc.end = index;
|
||||
return result;
|
||||
}
|
||||
break;
|
||||
},
|
||||
' ', '\n', '\t', '\r' => result.loc.start = index + 1,
|
||||
'a'...'z', 'A'...'Z' => state = .ident,
|
||||
'0'...'9' => state = .number,
|
||||
|
||||
'&' => state = .ampersand,
|
||||
'!' => state = .bang,
|
||||
'=' => state = .equal,
|
||||
'>' => state = .greater,
|
||||
'<' => state = .less,
|
||||
'-' => state = .minus,
|
||||
'%' => state = .mod,
|
||||
'|' => state = .pipe,
|
||||
'+' => state = .plus,
|
||||
'/' => state = .slash,
|
||||
'*' => state = .star,
|
||||
'_' => state = .underscore,
|
||||
'^' => state = .xor,
|
||||
|
||||
'@' => {
|
||||
result.tag = .attr;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
'[' => {
|
||||
result.tag = .bracket_left;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
']' => {
|
||||
result.tag = .bracket_right;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
'{' => {
|
||||
result.tag = .brace_left;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
'}' => {
|
||||
result.tag = .brace_right;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
':' => {
|
||||
result.tag = .colon;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
',' => {
|
||||
result.tag = .comma;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
'(' => {
|
||||
result.tag = .paren_left;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
')' => {
|
||||
result.tag = .paren_right;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
'.' => {
|
||||
result.tag = .period;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
';' => {
|
||||
result.tag = .semicolon;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
'~' => {
|
||||
result.tag = .tilde;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
|
||||
else => {
|
||||
state = .invalid;
|
||||
result.tag = .invalid;
|
||||
},
|
||||
},
|
||||
.invalid => break,
|
||||
|
||||
.ident => switch (c) {
|
||||
'a'...'z', 'A'...'Z', '0'...'9', '_' => {},
|
||||
else => {
|
||||
result.tag = .ident;
|
||||
if (Token.keywords.get(self.source[result.loc.start..index])) |tag| {
|
||||
result.tag = tag;
|
||||
}
|
||||
break;
|
||||
},
|
||||
},
|
||||
.underscore => switch (c) { // TODO: two underscore `__` https://www.w3.org/TR/WGSL/#identifiers
|
||||
'a'...'z', 'A'...'Z', '_', '0'...'9' => state = .ident,
|
||||
else => {
|
||||
result.tag = .underscore;
|
||||
break;
|
||||
},
|
||||
},
|
||||
|
||||
.number => switch (c) {
|
||||
'0'...'9', '.', 'i', 'u', 'f', 'h', 'e' => {},
|
||||
else => {
|
||||
result.tag = .number;
|
||||
break;
|
||||
},
|
||||
},
|
||||
|
||||
.block_comment => switch (c) {
|
||||
0 => break,
|
||||
'\n' => {
|
||||
state = .start;
|
||||
result.loc.start = index + 1;
|
||||
},
|
||||
else => {},
|
||||
},
|
||||
|
||||
.ampersand => switch (c) {
|
||||
'&' => {
|
||||
result.tag = .and_and;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
'=' => {
|
||||
result.tag = .and_equal;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
else => {
|
||||
result.tag = .@"and";
|
||||
break;
|
||||
},
|
||||
},
|
||||
.bang => switch (c) {
|
||||
'=' => {
|
||||
result.tag = .not_equal;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
else => {
|
||||
result.tag = .bang;
|
||||
break;
|
||||
},
|
||||
},
|
||||
.equal => switch (c) {
|
||||
'=' => {
|
||||
result.tag = .equal_equal;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
else => {
|
||||
result.tag = .equal;
|
||||
break;
|
||||
},
|
||||
},
|
||||
.greater => switch (c) {
|
||||
'>' => state = .shift_right,
|
||||
'=' => {
|
||||
result.tag = .greater_than_equal;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
else => {
|
||||
result.tag = .greater_than;
|
||||
break;
|
||||
},
|
||||
},
|
||||
.shift_right => switch (c) {
|
||||
'=' => {
|
||||
result.tag = .shift_right_equal;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
else => {
|
||||
result.tag = .shift_right;
|
||||
break;
|
||||
},
|
||||
},
|
||||
.less => switch (c) {
|
||||
'<' => state = .shift_left,
|
||||
'=' => {
|
||||
result.tag = .less_than_equal;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
else => {
|
||||
result.tag = .less_than;
|
||||
break;
|
||||
},
|
||||
},
|
||||
.shift_left => switch (c) {
|
||||
'=' => {
|
||||
result.tag = .shift_left_equal;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
else => {
|
||||
result.tag = .shift_left;
|
||||
break;
|
||||
},
|
||||
},
|
||||
.minus => switch (c) {
|
||||
'-' => {
|
||||
result.tag = .minus_minus;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
'=' => {
|
||||
result.tag = .minus_equal;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
'>' => {
|
||||
result.tag = .arrow;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
'0'...'9' => state = .number,
|
||||
else => {
|
||||
result.tag = .minus;
|
||||
break;
|
||||
},
|
||||
},
|
||||
.mod => switch (c) {
|
||||
'=' => {
|
||||
result.tag = .modulo_equal;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
else => {
|
||||
result.tag = .mod;
|
||||
break;
|
||||
},
|
||||
},
|
||||
.pipe => switch (c) {
|
||||
'|' => {
|
||||
result.tag = .or_or;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
'=' => {
|
||||
result.tag = .or_equal;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
else => {
|
||||
result.tag = .@"or";
|
||||
break;
|
||||
},
|
||||
},
|
||||
.plus => switch (c) {
|
||||
'+' => {
|
||||
result.tag = .plus_plus;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
'=' => {
|
||||
result.tag = .plus_equal;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
'0'...'9' => state = .number,
|
||||
else => {
|
||||
result.tag = .plus;
|
||||
break;
|
||||
},
|
||||
},
|
||||
.slash => switch (c) {
|
||||
'/' => state = .block_comment,
|
||||
'=' => {
|
||||
result.tag = .division_equal;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
else => {
|
||||
result.tag = .division;
|
||||
break;
|
||||
},
|
||||
},
|
||||
.star => switch (c) {
|
||||
'=' => {
|
||||
result.tag = .times_equal;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
else => {
|
||||
result.tag = .star;
|
||||
break;
|
||||
},
|
||||
},
|
||||
.xor => switch (c) {
|
||||
'=' => {
|
||||
result.tag = .xor_equal;
|
||||
index += 1;
|
||||
break;
|
||||
},
|
||||
else => {
|
||||
result.tag = .xor;
|
||||
break;
|
||||
},
|
||||
},
|
||||
}
|
||||
}
|
||||
|
||||
result.loc.end = index;
|
||||
return result;
|
||||
}
|
||||
|
||||
pub fn next(self: *Tokenizer) Token {
|
||||
const tok = self.peek();
|
||||
self.index = tok.loc.end;
|
||||
return tok;
|
||||
}
|
||||
|
||||
test "tokenize identifier and numbers" {
|
||||
const str =
|
||||
\\_ __ _iden iden -100i 100.8i // cc
|
||||
\\// commnet
|
||||
\\
|
||||
;
|
||||
var tokenizer = Tokenizer.init(str);
|
||||
try std.testing.expect(tokenizer.next().tag == .underscore);
|
||||
try std.testing.expect(tokenizer.next().tag == .ident);
|
||||
try std.testing.expect(tokenizer.next().tag == .ident);
|
||||
try std.testing.expect(tokenizer.next().tag == .ident);
|
||||
try std.testing.expectEqualStrings("-100i", tokenizer.next().loc.slice(str));
|
||||
try std.testing.expect(tokenizer.next().tag == .number);
|
||||
try std.testing.expect(tokenizer.next().tag == .eof);
|
||||
}
|
||||
|
||||
test "tokenize other" {
|
||||
comptime var str: [:0]const u8 = "";
|
||||
inline for (std.meta.fields(Token.Tag), 0..) |field, i| comptime {
|
||||
if (i > 3) {
|
||||
str = str ++ " " ++ (Token.Tag.symbol(@intToEnum(Token.Tag, field.value)));
|
||||
}
|
||||
};
|
||||
|
||||
var tokenizer = Tokenizer.init(str);
|
||||
|
||||
comptime var i = 4; // skip identifiers and nums
|
||||
inline while (i < std.meta.fields(Token.Tag).len) : (i += 1) {
|
||||
const tag = @intToEnum(Token.Tag, i);
|
||||
try std.testing.expect(tokenizer.next().tag == tag);
|
||||
}
|
||||
try std.testing.expect(tokenizer.next().tag == .eof);
|
||||
}
|
||||
|
|
@ -1,25 +0,0 @@
|
|||
const std = @import("std");
|
||||
|
||||
pub const IR = @import("IR.zig");
|
||||
pub const printIR = @import("print_ir.zig").printIR;
|
||||
pub const Ast = @import("Ast.zig");
|
||||
pub const Parser = @import("Parser.zig");
|
||||
pub const Token = @import("Token.zig");
|
||||
pub const Tokenizer = @import("Tokenizer.zig");
|
||||
pub const ErrorList = @import("ErrorList.zig");
|
||||
|
||||
pub const Extension = enum {
|
||||
f16,
|
||||
|
||||
pub const Array = std.enums.EnumArray(Extension, bool);
|
||||
};
|
||||
|
||||
test {
|
||||
std.testing.refAllDecls(IR);
|
||||
std.testing.refAllDecls(@import("print_ir.zig"));
|
||||
std.testing.refAllDecls(Ast);
|
||||
std.testing.refAllDecls(Parser);
|
||||
std.testing.refAllDecls(Token);
|
||||
std.testing.refAllDecls(Tokenizer);
|
||||
std.testing.refAllDecls(ErrorList);
|
||||
}
|
||||
|
|
@ -1,180 +0,0 @@
|
|||
const std = @import("std");
|
||||
const IR = @import("IR.zig");
|
||||
|
||||
const indention_size = 2;
|
||||
|
||||
pub fn printIR(ir: IR, writer: anytype) !void {
|
||||
var p = Printer(@TypeOf(writer)){ .ir = ir, .writer = writer };
|
||||
const globals = std.mem.sliceTo(ir.refs[ir.globals_index..], .none);
|
||||
for (globals) |ref| {
|
||||
try p.printInst(0, ref, false);
|
||||
}
|
||||
}
|
||||
|
||||
fn Printer(comptime Writer: type) type {
|
||||
return struct {
|
||||
ir: IR,
|
||||
writer: Writer,
|
||||
|
||||
fn printInst(self: @This(), indent: u16, ref: IR.Inst.Ref, decl_scope: bool) !void {
|
||||
switch (ref) {
|
||||
.none,
|
||||
.bool_type,
|
||||
.i32_type,
|
||||
.u32_type,
|
||||
.f32_type,
|
||||
.f16_type,
|
||||
.sampler_type,
|
||||
.comparison_sampler_type,
|
||||
.external_sampled_texture_type,
|
||||
.true_literal,
|
||||
.false_literal,
|
||||
=> {
|
||||
try self.writer.print("{s}()", .{@tagName(ref)});
|
||||
},
|
||||
_ => {
|
||||
const index = ref.toIndex().?;
|
||||
const inst = self.ir.instructions[index];
|
||||
|
||||
if (decl_scope and inst.tag.isDecl()) {
|
||||
try self.writer.print("&[{d}]", .{index});
|
||||
return;
|
||||
}
|
||||
|
||||
switch (inst.tag) {
|
||||
.global_variable_decl => try self.printGlobalVariable(indent, index),
|
||||
.struct_decl => try self.printStructDecl(indent, index),
|
||||
.struct_member => try self.printStructMember(indent, index),
|
||||
.integer_literal => {
|
||||
try self.writer.print("int({d})", .{inst.data.integer_literal});
|
||||
},
|
||||
.float_literal => {
|
||||
try self.writer.print("float({d})", .{inst.data.float_literal});
|
||||
},
|
||||
.mul,
|
||||
.div,
|
||||
.mod,
|
||||
.add,
|
||||
.sub,
|
||||
.shift_left,
|
||||
.shift_right,
|
||||
.binary_and,
|
||||
.binary_or,
|
||||
.binary_xor,
|
||||
.circuit_and,
|
||||
.circuit_or,
|
||||
.equal,
|
||||
.not_equal,
|
||||
.less,
|
||||
.less_equal,
|
||||
.greater,
|
||||
.greater_equal,
|
||||
=> {
|
||||
try self.instStart(index);
|
||||
defer self.instEnd() catch unreachable;
|
||||
try self.printInst(indent, inst.data.binary.lhs, true);
|
||||
try self.writer.writeAll(", ");
|
||||
try self.printInst(indent, inst.data.binary.rhs, true);
|
||||
},
|
||||
else => {
|
||||
try self.instStart(index);
|
||||
defer self.instEnd() catch unreachable;
|
||||
try self.writer.writeAll("TODO");
|
||||
},
|
||||
}
|
||||
},
|
||||
}
|
||||
}
|
||||
|
||||
fn printGlobalVariable(self: @This(), indent: u16, index: IR.Inst.Index) anyerror!void {
|
||||
const inst = self.ir.instructions[index];
|
||||
|
||||
try self.instBlockStart(index);
|
||||
defer self.instBlockEnd(indent) catch unreachable;
|
||||
|
||||
try self.printField(indent + 1, "type");
|
||||
try self.printInst(indent + 2, inst.data.global_variable_decl.type, true);
|
||||
try self.writer.writeAll(",\n");
|
||||
|
||||
try self.printField(indent + 1, "value");
|
||||
try self.printInst(indent + 2, inst.data.global_variable_decl.expr, true);
|
||||
try self.writer.writeAll(",\n");
|
||||
}
|
||||
|
||||
fn printStructDecl(self: @This(), indent: u16, index: IR.Inst.Index) anyerror!void {
|
||||
const inst = self.ir.instructions[index];
|
||||
|
||||
try self.instBlockStart(index);
|
||||
defer self.instBlockEnd(indent) catch unreachable;
|
||||
|
||||
try self.printField(indent + 1, "name");
|
||||
try self.printStr(inst.data.struct_decl.name);
|
||||
try self.writer.writeAll(",\n");
|
||||
|
||||
try self.printField(indent + 1, "members");
|
||||
try self.listStart();
|
||||
const members = std.mem.sliceTo(self.ir.refs[inst.data.struct_decl.members..], .none);
|
||||
for (members) |member| {
|
||||
try self.printIndent(indent + 2);
|
||||
try self.printStructMember(indent + 2, member.toIndex().?);
|
||||
}
|
||||
try self.listEnd(indent + 1);
|
||||
}
|
||||
|
||||
fn printStructMember(self: @This(), indent: u16, index: IR.Inst.Index) anyerror!void {
|
||||
const inst = self.ir.instructions[index];
|
||||
|
||||
try self.instBlockStart(index);
|
||||
defer self.instBlockEnd(indent) catch unreachable;
|
||||
|
||||
try self.printField(indent + 1, "name");
|
||||
try self.printStr(inst.data.struct_member.name);
|
||||
try self.writer.writeAll(",\n");
|
||||
|
||||
try self.printField(indent + 1, "type");
|
||||
try self.printInst(indent + 2, inst.data.struct_member.type, true);
|
||||
try self.writer.writeAll(",\n");
|
||||
}
|
||||
|
||||
fn instStart(self: @This(), index: IR.Inst.Index) !void {
|
||||
const inst = self.ir.instructions[index];
|
||||
try self.writer.print("[{d}] = {s}(", .{ index, @tagName(inst.tag) });
|
||||
}
|
||||
|
||||
fn instEnd(self: @This()) !void {
|
||||
try self.writer.writeAll(")");
|
||||
}
|
||||
|
||||
fn instBlockStart(self: @This(), index: IR.Inst.Index) !void {
|
||||
const inst = self.ir.instructions[index];
|
||||
try self.writer.print("[{d}] = {s}{{\n", .{ index, @tagName(inst.tag) });
|
||||
}
|
||||
|
||||
fn instBlockEnd(self: @This(), indent: u16) !void {
|
||||
try self.printIndent(indent);
|
||||
try self.writer.writeAll("},\n");
|
||||
}
|
||||
|
||||
fn listStart(self: @This()) !void {
|
||||
try self.writer.writeAll("{\n");
|
||||
}
|
||||
|
||||
fn listEnd(self: @This(), indent: u16) !void {
|
||||
try self.printIndent(indent);
|
||||
try self.writer.writeAll("},\n");
|
||||
}
|
||||
|
||||
fn printField(self: @This(), indent: u16, name: []const u8) !void {
|
||||
try self.printIndent(indent);
|
||||
try self.writer.print("{s} -> ", .{name});
|
||||
}
|
||||
|
||||
fn printStr(self: @This(), name_index: u32) !void {
|
||||
try self.writer.print("\"{s}\"", .{self.ir.getStr(name_index)});
|
||||
}
|
||||
|
||||
fn printIndent(self: @This(), indent: u16) !void {
|
||||
try self.writer.writeByteNTimes(' ', indent * indention_size);
|
||||
}
|
||||
};
|
||||
}
|
||||
|
|
@ -1,108 +0,0 @@
|
|||
const NUM_PARTICLES: u32 = 1500u;
|
||||
|
||||
struct Particles {
|
||||
particles : array<Particle>
|
||||
}
|
||||
|
||||
struct Particle {
|
||||
pos : vec2<f32>,
|
||||
vel : vec2<f32>,
|
||||
}
|
||||
|
||||
struct SimParams {
|
||||
deltaT : f32,
|
||||
rule1Distance : f32,
|
||||
rule2Distance : f32,
|
||||
rule3Distance : f32,
|
||||
rule1Scale : f32,
|
||||
rule2Scale : f32,
|
||||
rule3Scale : f32,
|
||||
}
|
||||
|
||||
var v0 = 5;
|
||||
@group(0) @binding(0) var<uniform> params : SimParams = *v0 * 1 + 2;
|
||||
@group(0) @binding(1) var<storage> particlesSrc : Particles;
|
||||
@group(0) @binding(2) var<storage,read_write> particlesDst : Particles;
|
||||
|
||||
// https://github.com/austinEng/Project6-Vulkan-Flocking/blob/master/data/shaders/computeparticles/particle.comp
|
||||
@compute @workgroup_size(64)
|
||||
fn main(@builtin(global_invocation_id) global_invocation_id : vec3<u32>) {
|
||||
let index : u32 = global_invocation_id.x;
|
||||
if index >= NUM_PARTICLES {
|
||||
return;
|
||||
}
|
||||
|
||||
var vPos = particlesSrc.particles[index].pos;
|
||||
var vVel = particlesSrc.particles[index].vel;
|
||||
|
||||
var cMass = vec2<f32>(0.0, 0.0);
|
||||
var cVel = vec2<f32>(0.0, 0.0);
|
||||
var colVel = vec2<f32>(0.0, 0.0);
|
||||
var cMassCount : i32 = 0;
|
||||
var cVelCount : i32 = 0;
|
||||
|
||||
var pos : vec2<f32>;
|
||||
var vel : vec2<f32>;
|
||||
var i : u32 = 0u;
|
||||
loop {
|
||||
if i >= NUM_PARTICLES {
|
||||
break;
|
||||
}
|
||||
if i == index {
|
||||
continue;
|
||||
}
|
||||
|
||||
pos = particlesSrc.particles[i].pos;
|
||||
vel = particlesSrc.particles[i].vel;
|
||||
|
||||
if distance(pos, vPos) < params.rule1Distance {
|
||||
cMass = cMass + pos;
|
||||
cMassCount = cMassCount + 1;
|
||||
}
|
||||
if distance(pos, vPos) < params.rule2Distance {
|
||||
colVel = colVel - (pos - vPos);
|
||||
}
|
||||
if distance(pos, vPos) < params.rule3Distance {
|
||||
cVel = cVel + vel;
|
||||
cVelCount = cVelCount + 1;
|
||||
}
|
||||
|
||||
continuing {
|
||||
i = i + 1u;
|
||||
}
|
||||
}
|
||||
if cMassCount > 0 {
|
||||
cMass = cMass / f32(cMassCount) - vPos;
|
||||
}
|
||||
if cVelCount > 0 {
|
||||
cVel = cVel / f32(cVelCount);
|
||||
}
|
||||
|
||||
vVel = vVel + (cMass * params.rule1Scale) +
|
||||
(colVel * params.rule2Scale) +
|
||||
(cVel * params.rule3Scale);
|
||||
|
||||
// clamp velocity for a more pleasing simulation
|
||||
vVel = normalize(vVel) * clamp(length(vVel), 0.0, 0.1);
|
||||
|
||||
// kinematic update
|
||||
vPos = vPos + (vVel * params.deltaT);
|
||||
|
||||
// Wrap around boundary
|
||||
if vPos.x < -1.0 {
|
||||
vPos.x = 1.0;
|
||||
}
|
||||
if vPos.x > 1.0 {
|
||||
vPos.x = -1.0;
|
||||
}
|
||||
if vPos.y < -1.0 {
|
||||
vPos.y = 1.0;
|
||||
}
|
||||
if vPos.y > 1.0 {
|
||||
vPos.y = -1.0;
|
||||
}
|
||||
|
||||
// Write back
|
||||
particlesDst.particles[index].pos = vPos;
|
||||
particlesDst.particles[index].vel = vVel;
|
||||
}
|
||||
|
|
@ -1,199 +0,0 @@
|
|||
struct FragUniform {
|
||||
type_: u32,
|
||||
padding: vec3<f32>,
|
||||
blend_color: vec4<f32>,
|
||||
}
|
||||
@binding(1) @group(0) var<storage> ubos: array<FragUniform>;
|
||||
@binding(2) @group(0) var mySampler: sampler;
|
||||
@binding(3) @group(0) var myTexture: texture_2d<f32>;
|
||||
|
||||
const wireframe = false;
|
||||
const antialiased = true;
|
||||
const aa_px = 1.0; // pixels to consume for AA
|
||||
const dist_scale_px = 300.0; // TODO: do not hard code
|
||||
|
||||
@fragment fn main(
|
||||
@location(0) uv: vec2<f32>,
|
||||
@interpolate(linear) @location(1) bary_in: vec2<f32>,
|
||||
@interpolate(flat) @location(2) triangle_index: u32,
|
||||
) -> @location(0) vec4<f32> {
|
||||
// Example 1: Visualize barycentric coordinates:
|
||||
// let bary = bary_in;
|
||||
// return vec4<f32>(bary.x, bary.y, 0.0, 1.0);
|
||||
// return vec4<f32>(0.0, bary.x, 0.0, 1.0); // [1.0 (bottom-left vertex), 0.0 (bottom-right vertex)]
|
||||
// return vec4<f32>(0.0, bary.y, 0.0, 1.0); // [1.0 (bottom-left vertex), 0.0 (top-right face)]
|
||||
|
||||
// Example 2: Very simple quadratic bezier
|
||||
// let bary = bary_in;
|
||||
// if (bary.x * bary.x - bary.y) > 0 {
|
||||
// discard;
|
||||
// }
|
||||
// return vec4<f32>(0.0, 1.0, 0.0, 1.0);
|
||||
|
||||
// Example 3: Render gkurve primitives
|
||||
let inversion = select( 1.0, -1.0, ubos[triangle_index].type_ == 0u || ubos[triangle_index].type_ == 1u);
|
||||
// Texture uvs
|
||||
var correct_uv = uv;
|
||||
correct_uv.y = 1.0 - correct_uv.y;
|
||||
var color = textureSample(myTexture, mySampler, correct_uv) * ubos[triangle_index].blend_color;
|
||||
|
||||
// Curve rendering
|
||||
let border_color = vec4<f32>(1.0, 0.0, 0.0, 1.0);
|
||||
let border_px = 30.0;
|
||||
let is_semicircle = ubos[triangle_index].type_ == 1u || ubos[triangle_index].type_ == 3u;
|
||||
var result = select(
|
||||
curveColor(bary_in, border_px, border_color, color, inversion, is_semicircle),
|
||||
color,
|
||||
ubos[triangle_index].type_ == 4u, // triangle rendering
|
||||
);
|
||||
|
||||
// Wireframe rendering
|
||||
let wireframe_px = 1.0;
|
||||
let wireframe_color = vec4<f32>(0.5, 0.5, 0.5, 1.0);
|
||||
if (wireframe) {
|
||||
result = wireframeColor(bary_in, wireframe_px, wireframe_color, result);
|
||||
}
|
||||
|
||||
if (result.a == 0.0) { discard; }
|
||||
return result;
|
||||
}
|
||||
|
||||
// Performs alpha 'over' blending between two premultiplied-alpha colors.
|
||||
fn alphaOver(a: vec4<f32>, b: vec4<f32>) -> vec4<f32> {
|
||||
return a + (b * (1.0 - a.a));
|
||||
}
|
||||
|
||||
// Calculates signed distance to a quadratic bézier curve using barycentric coordinates.
|
||||
fn distanceToQuadratic(bary: vec2<f32>) -> f32 {
|
||||
// Gradients
|
||||
let px = dpdx(bary.xy);
|
||||
let py = dpdy(bary.xy);
|
||||
|
||||
// Chain rule
|
||||
let fx = (2.0 * bary.x) * px.x - px.y;
|
||||
let fy = (2.0 * bary.x) * py.x - py.y;
|
||||
|
||||
return (bary.x * bary.x - bary.y) / sqrt(fx * fx + fy * fy);
|
||||
}
|
||||
|
||||
// Calculates signed distance to a semicircle using barycentric coordinates.
|
||||
fn distanceToSemicircle(bary: vec2<f32>) -> f32 {
|
||||
let x = abs(((bary.x - 0.5) * 2.0)); // [0.0 left, 1.0 center, 0.0 right]
|
||||
let y = ((bary.x-bary.y) * 4.0); // [2.0 bottom, 0.0 top]
|
||||
let c = x*x + y*y;
|
||||
|
||||
// Gradients
|
||||
let px = dpdx(bary.xy);
|
||||
let py = dpdy(bary.xy);
|
||||
|
||||
// Chain rule
|
||||
let fx = c * px.x - px.y;
|
||||
let fy = c * py.x - py.y;
|
||||
|
||||
let d = (1.0 - (x*x + y*y)) - 0.2;
|
||||
return (-d / 6.0) / sqrt(fx * fx + fy * fy);
|
||||
}
|
||||
|
||||
// Calculates signed distance to the wireframe (i.e. faces) of the triangle using barycentric
|
||||
// coordinates.
|
||||
fn distanceToWireframe(bary: vec2<f32>) -> f32 {
|
||||
let normal = vec3<f32>(
|
||||
bary.y, // distance to right face
|
||||
(bary.x - bary.y) * 2.0, // distance to bottom face
|
||||
1.0 - (((bary.x - bary.y)) + bary.x), // distance to left face
|
||||
);
|
||||
let fw = sqrt(dpdx(normal)*dpdx(normal) + dpdy(normal)*dpdy(normal));
|
||||
let d = normal / fw;
|
||||
return min(min(d.x, d.y), d.z);
|
||||
}
|
||||
|
||||
// Calculates the color of the wireframe, taking into account antialiasing and alpha blending with
|
||||
// the desired background blend color.
|
||||
fn wireframeColor(bary: vec2<f32>, px: f32, color: vec4<f32>, blend_color: vec4<f32>) -> vec4<f32> {
|
||||
let dist = distanceToWireframe(bary);
|
||||
if (antialiased) {
|
||||
let outer = dist;
|
||||
let inner = (px + (aa_px * 2.0)) - dist;
|
||||
let in_wireframe = outer >= 0.0 && inner >= 0.0;
|
||||
if (in_wireframe) {
|
||||
// Note: If this is the outer edge of the wireframe, we do not want to perform alpha
|
||||
// blending with the background blend color, since it is an antialiased edge and should
|
||||
// be transparent. However, if it is the internal edge of the wireframe, we do want to
|
||||
// perform alpha blending as it should be an overlay, not transparent.
|
||||
let is_outer_edge = outer < inner;
|
||||
if (is_outer_edge) {
|
||||
let alpha = smoothstep(0.0, 1.0, outer*(1.0 / aa_px));
|
||||
return vec4<f32>((color.rgb/color.a)*alpha, alpha);
|
||||
} else {
|
||||
let aa_inner = inner - aa_px;
|
||||
let alpha = smoothstep(0.0, 1.0, aa_inner*(1.0 / aa_px));
|
||||
let wireframe_color = vec4<f32>((color.rgb/color.a)*alpha, alpha);
|
||||
return alphaOver(wireframe_color, blend_color);
|
||||
}
|
||||
}
|
||||
return blend_color;
|
||||
} else {
|
||||
// If we're at the edge use the wireframe color, otherwise use the background blend_color.
|
||||
return select(blend_color, color, (px - dist) >= 0.0);
|
||||
}
|
||||
}
|
||||
|
||||
// Calculates the color for a curve, taking into account antialiasing and alpha blending with
|
||||
// the desired background blend color.
|
||||
//
|
||||
// inversion: concave (-1.0) or convex (1.0)
|
||||
// is_semicircle: quadratic bezier (false) or semicircle (true)
|
||||
fn curveColor(
|
||||
bary: vec2<f32>,
|
||||
border_px: f32,
|
||||
border_color: vec4<f32>,
|
||||
blend_color: vec4<f32>,
|
||||
inversion: f32,
|
||||
is_semicircle: bool,
|
||||
) -> vec4<f32> {
|
||||
let dist = select(
|
||||
distanceToQuadratic(bary),
|
||||
distanceToSemicircle(bary),
|
||||
is_semicircle,
|
||||
) * inversion;
|
||||
let is_inverted = (inversion + 1.0) / 2.0; // 1.0 if inverted, 0.0 otherwise
|
||||
|
||||
if (antialiased) {
|
||||
let outer = dist + ((border_px + (aa_px * 2.0)) * is_inverted); // bottom
|
||||
let inner = ((border_px + (aa_px * 2.0)) * (1.0-is_inverted)) - dist; // top
|
||||
let in_border = outer >= 0.0 && inner >= 0.0;
|
||||
if (in_border) {
|
||||
// Note: If this is the outer edge of the curve, we do not want to perform alpha
|
||||
// blending with the background blend color, since it is an antialiased edge and should
|
||||
// be transparent. However, if it is the internal edge of the curve, we do want to
|
||||
// perform alpha blending as it should be an overlay, not transparent.
|
||||
let is_outer_edge = outer < inner;
|
||||
if (is_outer_edge) {
|
||||
let aa_outer = outer - (aa_px * is_inverted);
|
||||
let alpha = smoothstep(0.0, 1.0, aa_outer*(1.0 / aa_px));
|
||||
return vec4<f32>((border_color.rgb/border_color.a)*alpha, alpha);
|
||||
} else {
|
||||
let aa_inner = inner - (aa_px * (1.0 - is_inverted));
|
||||
let alpha = smoothstep(0.0, 1.0, aa_inner*(1.0 / aa_px));
|
||||
let new_border_color = vec4<f32>((border_color.rgb/border_color.a)*alpha, alpha);
|
||||
return alphaOver(new_border_color, blend_color);
|
||||
}
|
||||
return border_color;
|
||||
} else if (outer >= 0.0) {
|
||||
return blend_color;
|
||||
} else {
|
||||
return vec4<f32>(0.0);
|
||||
}
|
||||
} else {
|
||||
let outer = dist + (border_px * is_inverted);
|
||||
let inner = (border_px * (1.0-is_inverted)) - dist;
|
||||
let in_border = outer >= 0.0 && inner >= 0.0;
|
||||
if (in_border) {
|
||||
return border_color;
|
||||
} else if (outer >= 0.0) {
|
||||
return blend_color;
|
||||
} else {
|
||||
return vec4<f32>(0.0);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
@ -1,184 +0,0 @@
|
|||
const std = @import("std");
|
||||
const dusk = @import("dusk");
|
||||
const expect = std.testing.expect;
|
||||
const allocator = std.testing.allocator;
|
||||
|
||||
fn sdkPath(comptime suffix: []const u8) []const u8 {
|
||||
if (suffix[0] != '/') @compileError("suffix must be an absolute path");
|
||||
return comptime blk: {
|
||||
const root_dir = std.fs.path.dirname(@src().file) orelse ".";
|
||||
break :blk root_dir ++ suffix;
|
||||
};
|
||||
}
|
||||
|
||||
fn expectIR(source: [:0]const u8) !dusk.IR {
|
||||
var tree = try dusk.Ast.parse(allocator, source);
|
||||
defer tree.deinit(allocator);
|
||||
|
||||
if (tree.errors.list.items.len > 0) {
|
||||
try tree.errors.print(source, null);
|
||||
return error.Parsing;
|
||||
}
|
||||
|
||||
var ir = try dusk.IR.generate(allocator, &tree);
|
||||
errdefer ir.deinit();
|
||||
|
||||
if (ir.errors.list.items.len > 0) {
|
||||
try ir.errors.print(source, null);
|
||||
return error.ExpectedIR;
|
||||
}
|
||||
|
||||
return ir;
|
||||
}
|
||||
|
||||
fn expectError(source: [:0]const u8, err: dusk.ErrorList.ErrorMsg) !void {
|
||||
var tree = try dusk.Ast.parse(allocator, source);
|
||||
defer tree.deinit(allocator);
|
||||
var err_list = tree.errors;
|
||||
|
||||
var ir: ?dusk.IR = null;
|
||||
defer if (ir != null) ir.?.deinit();
|
||||
|
||||
if (err_list.list.items.len == 0) {
|
||||
ir = try dusk.IR.generate(allocator, &tree);
|
||||
|
||||
err_list = ir.?.errors;
|
||||
if (err_list.list.items.len == 0) {
|
||||
return error.ExpectedError;
|
||||
}
|
||||
}
|
||||
|
||||
const first_error = err_list.list.items[0];
|
||||
{
|
||||
errdefer {
|
||||
std.debug.print(
|
||||
"\n\x1b[31mexpected error({d}..{d}):\n{s}\n\x1b[32mactual error({d}..{d}):\n{s}\n\x1b[0m",
|
||||
.{
|
||||
err.loc.start, err.loc.end, err.msg,
|
||||
first_error.loc.start, first_error.loc.end, first_error.msg,
|
||||
},
|
||||
);
|
||||
}
|
||||
try expect(std.mem.eql(u8, err.msg, first_error.msg));
|
||||
try expect(first_error.loc.start == err.loc.start);
|
||||
try expect(first_error.loc.end == err.loc.end);
|
||||
}
|
||||
if (first_error.note) |_| {
|
||||
errdefer {
|
||||
std.debug.print(
|
||||
"\n\x1b[31mexpected note msg:\n{s}\n\x1b[32mactual note msg:\n{s}\n\x1b[0m",
|
||||
.{ err.note.?.msg, first_error.note.?.msg },
|
||||
);
|
||||
}
|
||||
if (err.note == null) {
|
||||
std.debug.print("\x1b[31mnote missed: {s}\x1b[0m\n", .{first_error.note.?.msg});
|
||||
return error.NoteMissed;
|
||||
}
|
||||
try expect(std.mem.eql(u8, err.note.?.msg, first_error.note.?.msg));
|
||||
if (first_error.note.?.loc) |_| {
|
||||
errdefer {
|
||||
std.debug.print(
|
||||
"\n\x1b[31mexpected note loc: {d}..{d}\n\x1b[32mactual note loc: {d}..{d}\n\x1b[0m",
|
||||
.{
|
||||
err.note.?.loc.?.start, err.note.?.loc.?.end,
|
||||
first_error.note.?.loc.?.start, first_error.note.?.loc.?.end,
|
||||
},
|
||||
);
|
||||
}
|
||||
try expect(first_error.note.?.loc.?.start == err.note.?.loc.?.start);
|
||||
try expect(first_error.note.?.loc.?.end == err.note.?.loc.?.end);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
test "empty" {
|
||||
const source = "";
|
||||
var ir = try expectIR(source);
|
||||
defer ir.deinit();
|
||||
}
|
||||
|
||||
test "boids" {
|
||||
const source = @embedFile("boids.wgsl");
|
||||
var ir = try expectIR(source);
|
||||
defer ir.deinit();
|
||||
// try dusk.printIR(ir, std.io.getStdOut().writer());
|
||||
}
|
||||
|
||||
test "gkurve" {
|
||||
const source = @embedFile("gkurve.wgsl");
|
||||
var ir = try expectIR(source);
|
||||
defer ir.deinit();
|
||||
}
|
||||
|
||||
test "must error" {
|
||||
{
|
||||
const source = "^";
|
||||
try expectError(source, .{
|
||||
.msg = "expected global declaration, found '^'",
|
||||
.loc = .{ .start = 0, .end = 1 },
|
||||
});
|
||||
}
|
||||
{
|
||||
const source = "struct S { m0: array<f32>, m1: f32 }";
|
||||
try expectError(source, .{
|
||||
.msg = "struct member with runtime-sized array type, must be the last member of the structure",
|
||||
.loc = .{ .start = 11, .end = 13 },
|
||||
});
|
||||
}
|
||||
{
|
||||
const source = "struct S0 { m: S1 }";
|
||||
try expectError(source, .{
|
||||
.msg = "use of undeclared identifier 'S1'",
|
||||
.loc = .{ .start = 15, .end = 17 },
|
||||
});
|
||||
}
|
||||
{
|
||||
const source =
|
||||
\\var S1 = 0;
|
||||
\\struct S0 { m: S1 }
|
||||
;
|
||||
try expectError(source, .{
|
||||
.msg = "'S1' is not a type",
|
||||
.loc = .{ .start = 27, .end = 29 },
|
||||
});
|
||||
}
|
||||
{
|
||||
const source =
|
||||
\\struct S0 { m: sampler }
|
||||
;
|
||||
try expectError(source, .{
|
||||
.msg = "invalid struct member type 'sampler'",
|
||||
.loc = .{ .start = 12, .end = 13 },
|
||||
});
|
||||
}
|
||||
{
|
||||
const source =
|
||||
\\var d1 = 0;
|
||||
\\var d1 = 0;
|
||||
;
|
||||
try expectError(source, .{
|
||||
.msg = "redeclaration of 'd1'",
|
||||
.loc = .{ .start = 16, .end = 18 },
|
||||
.note = .{ .msg = "other declaration here", .loc = .{ .start = 4, .end = 6 } },
|
||||
});
|
||||
}
|
||||
{
|
||||
const source = "struct S { m0: vec2<sampler> }";
|
||||
try expectError(source, .{
|
||||
.msg = "invalid vector component type",
|
||||
.loc = .{ .start = 20, .end = 27 },
|
||||
.note = .{ .msg = "must be 'i32', 'u32', 'f32', 'f16' or 'bool'" },
|
||||
});
|
||||
}
|
||||
{
|
||||
const source =
|
||||
\\type T0 = sampler;
|
||||
\\type T1 = texture_1d<T0>;
|
||||
;
|
||||
try expectError(source, .{
|
||||
.msg = "invalid sampled texture component type",
|
||||
.loc = .{ .start = 40, .end = 42 },
|
||||
.note = .{ .msg = "must be 'i32', 'u32' or 'f32'" },
|
||||
});
|
||||
}
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue