A => COPYING +368 -0
@@ 1,368 @@
+Mozilla Public License Version 2.0
+==================================
+
+1. Definitions
+--------------
+
+1.1. "Contributor"
+ means each individual or legal entity that creates, contributes to
+ the creation of, or owns Covered Software.
+
+1.2. "Contributor Version"
+ means the combination of the Contributions of others (if any) used
+ by a Contributor and that particular Contributor's Contribution.
+
+1.3. "Contribution"
+ means Covered Software of a particular Contributor.
+
+1.4. "Covered Software"
+ means Source Code Form to which the initial Contributor has attached
+ the notice in Exhibit A, the Executable Form of such Source Code
+ Form, and Modifications of such Source Code Form, in each case
+ including portions thereof.
+
+1.5. "Incompatible With Secondary Licenses"
+ means
+
+ (a) that the initial Contributor has attached the notice described
+ in Exhibit B to the Covered Software; or
+
+ (b) that the Covered Software was made available under the terms of
+ version 1.1 or earlier of the License, but not also under the
+ terms of a Secondary License.
+
+1.6. "Executable Form"
+ means any form of the work other than Source Code Form.
+
+1.7. "Larger Work"
+ means a work that combines Covered Software with other material, in
+ a separate file or files, that is not Covered Software.
+
+1.8. "License"
+ means this document.
+
+1.9. "Licensable"
+ means having the right to grant, to the maximum extent possible,
+ whether at the time of the initial grant or subsequently, any and
+ all of the rights conveyed by this License.
+
+1.10. "Modifications"
+ means any of the following:
+
+ (a) any file in Source Code Form that results from an addition to,
+ deletion from, or modification of the contents of Covered
+ Software; or
+
+ (b) any new file in Source Code Form that contains any Covered
+ Software.
+
+1.11. "Patent Claims" of a Contributor
+ means any patent claim(s), including without limitation, method,
+ process, and apparatus claims, in any patent Licensable by such
+ Contributor that would be infringed, but for the grant of the
+ License, by the making, using, selling, offering for sale, having
+ made, import, or transfer of either its Contributions or its
+ Contributor Version.
+
+1.12. "Secondary License"
+ means either the GNU General Public License, Version 2.0, the GNU
+ Lesser General Public License, Version 2.1, the GNU Affero General
+ Public License, Version 3.0, or any later versions of those
+ licenses.
+
+1.13. "Source Code Form"
+ means the form of the work preferred for making modifications.
+
+1.14. "You" (or "Your")
+ means an individual or a legal entity exercising rights under this
+ License. For legal entities, "You" includes any entity that
+ controls, is controlled by, or is under common control with You. For
+ purposes of this definition, "control" means (a) the power, direct
+ or indirect, to cause the direction or management of such entity,
+ whether by contract or otherwise, or (b) ownership of more than
+ fifty percent (50%) of the outstanding shares or beneficial
+ ownership of such entity.
+
+2. License Grants and Conditions
+--------------------------------
+
+2.1. Grants
+
+Each Contributor hereby grants You a world-wide, royalty-free,
+non-exclusive license:
+
+(a) under intellectual property rights (other than patent or trademark)
+ Licensable by such Contributor to use, reproduce, make available,
+ modify, display, perform, distribute, and otherwise exploit its
+ Contributions, either on an unmodified basis, with Modifications, or
+ as part of a Larger Work; and
+
+(b) under Patent Claims of such Contributor to make, use, sell, offer
+ for sale, have made, import, and otherwise transfer either its
+ Contributions or its Contributor Version.
+
+2.2. Effective Date
+
+The licenses granted in Section 2.1 with respect to any Contribution
+become effective for each Contribution on the date the Contributor first
+distributes such Contribution.
+
+2.3. Limitations on Grant Scope
+
+The licenses granted in this Section 2 are the only rights granted under
+this License. No additional rights or licenses will be implied from the
+distribution or licensing of Covered Software under this License.
+Notwithstanding Section 2.1(b) above, no patent license is granted by a
+Contributor:
+
+(a) for any code that a Contributor has removed from Covered Software;
+ or
+
+(b) for infringements caused by: (i) Your and any other third party's
+ modifications of Covered Software, or (ii) the combination of its
+ Contributions with other software (except as part of its Contributor
+ Version); or
+
+(c) under Patent Claims infringed by Covered Software in the absence of
+ its Contributions.
+
+This License does not grant any rights in the trademarks, service marks,
+or logos of any Contributor (except as may be necessary to comply with
+the notice requirements in Section 3.4).
+
+2.4. Subsequent Licenses
+
+No Contributor makes additional grants as a result of Your choice to
+distribute the Covered Software under a subsequent version of this
+License (see Section 10.2) or under the terms of a Secondary License (if
+permitted under the terms of Section 3.3).
+
+2.5. Representation
+
+Each Contributor represents that the Contributor believes its
+Contributions are its original creation(s) or it has sufficient rights
+to grant the rights to its Contributions conveyed by this License.
+
+2.6. Fair Use
+
+This License is not intended to limit any rights You have under
+applicable copyright doctrines of fair use, fair dealing, or other
+equivalents.
+
+2.7. Conditions
+
+Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted
+in Section 2.1.
+
+3. Responsibilities
+-------------------
+
+3.1. Distribution of Source Form
+
+All distribution of Covered Software in Source Code Form, including any
+Modifications that You create or to which You contribute, must be under
+the terms of this License. You must inform recipients that the Source
+Code Form of the Covered Software is governed by the terms of this
+License, and how they can obtain a copy of this License. You may not
+attempt to alter or restrict the recipients' rights in the Source Code
+Form.
+
+3.2. Distribution of Executable Form
+
+If You distribute Covered Software in Executable Form then:
+
+(a) such Covered Software must also be made available in Source Code
+ Form, as described in Section 3.1, and You must inform recipients of
+ the Executable Form how they can obtain a copy of such Source Code
+ Form by reasonable means in a timely manner, at a charge no more
+ than the cost of distribution to the recipient; and
+
+(b) You may distribute such Executable Form under the terms of this
+ License, or sublicense it under different terms, provided that the
+ license for the Executable Form does not attempt to limit or alter
+ the recipients' rights in the Source Code Form under this License.
+
+3.3. Distribution of a Larger Work
+
+You may create and distribute a Larger Work under terms of Your choice,
+provided that You also comply with the requirements of this License for
+the Covered Software. If the Larger Work is a combination of Covered
+Software with a work governed by one or more Secondary Licenses, and the
+Covered Software is not Incompatible With Secondary Licenses, this
+License permits You to additionally distribute such Covered Software
+under the terms of such Secondary License(s), so that the recipient of
+the Larger Work may, at their option, further distribute the Covered
+Software under the terms of either this License or such Secondary
+License(s).
+
+3.4. Notices
+
+You may not remove or alter the substance of any license notices
+(including copyright notices, patent notices, disclaimers of warranty,
+or limitations of liability) contained within the Source Code Form of
+the Covered Software, except that You may alter any license notices to
+the extent required to remedy known factual inaccuracies.
+
+3.5. Application of Additional Terms
+
+You may choose to offer, and to charge a fee for, warranty, support,
+indemnity or liability obligations to one or more recipients of Covered
+Software. However, You may do so only on Your own behalf, and not on
+behalf of any Contributor. You must make it absolutely clear that any
+such warranty, support, indemnity, or liability obligation is offered by
+You alone, and You hereby agree to indemnify every Contributor for any
+liability incurred by such Contributor as a result of warranty, support,
+indemnity or liability terms You offer. You may include additional
+disclaimers of warranty and limitations of liability specific to any
+jurisdiction.
+
+4. Inability to Comply Due to Statute or Regulation
+---------------------------------------------------
+
+If it is impossible for You to comply with any of the terms of this
+License with respect to some or all of the Covered Software due to
+statute, judicial order, or regulation then You must: (a) comply with
+the terms of this License to the maximum extent possible; and (b)
+describe the limitations and the code they affect. Such description must
+be placed in a text file included with all distributions of the Covered
+Software under this License. Except to the extent prohibited by statute
+or regulation, such description must be sufficiently detailed for a
+recipient of ordinary skill to be able to understand it.
+
+5. Termination
+--------------
+
+5.1. The rights granted under this License will terminate automatically
+if You fail to comply with any of its terms. However, if You become
+compliant, then the rights granted under this License from a particular
+Contributor are reinstated (a) provisionally, unless and until such
+Contributor explicitly and finally terminates Your grants, and (b) on an
+ongoing basis, if such Contributor fails to notify You of the
+non-compliance by some reasonable means prior to 60 days after You have
+come back into compliance. Moreover, Your grants from a particular
+Contributor are reinstated on an ongoing basis if such Contributor
+notifies You of the non-compliance by some reasonable means, this is the
+first time You have received notice of non-compliance with this License
+from such Contributor, and You become compliant prior to 30 days after
+Your receipt of the notice.
+
+5.2. If You initiate litigation against any entity by asserting a patent
+infringement claim (excluding declaratory judgment actions,
+counter-claims, and cross-claims) alleging that a Contributor Version
+directly or indirectly infringes any patent, then the rights granted to
+You by any and all Contributors for the Covered Software under Section
+2.1 of this License shall terminate.
+
+5.3. In the event of termination under Sections 5.1 or 5.2 above, all
+end user license agreements (excluding distributors and resellers) which
+have been validly granted by You or Your distributors under this License
+prior to termination shall survive termination.
+
+************************************************************************
+* *
+* 6. Disclaimer of Warranty *
+* ------------------------- *
+* *
+* Covered Software is provided under this License on an "as is" *
+* basis, without warranty of any kind, either expressed, implied, or *
+* statutory, including, without limitation, warranties that the *
+* Covered Software is free of defects, merchantable, fit for a *
+* particular purpose or non-infringing. The entire risk as to the *
+* quality and performance of the Covered Software is with You. *
+* Should any Covered Software prove defective in any respect, You *
+* (not any Contributor) assume the cost of any necessary servicing, *
+* repair, or correction. This disclaimer of warranty constitutes an *
+* essential part of this License. No use of any Covered Software is *
+* authorized under this License except under this disclaimer. *
+* *
+************************************************************************
+
+************************************************************************
+* *
+* 7. Limitation of Liability *
+* -------------------------- *
+* *
+* Under no circumstances and under no legal theory, whether tort *
+* (including negligence), contract, or otherwise, shall any *
+* Contributor, or anyone who distributes Covered Software as *
+* permitted above, be liable to You for any direct, indirect, *
+* special, incidental, or consequential damages of any character *
+* including, without limitation, damages for lost profits, loss of *
+* goodwill, work stoppage, computer failure or malfunction, or any *
+* and all other commercial damages or losses, even if such party *
+* shall have been informed of the possibility of such damages. This *
+* limitation of liability shall not apply to liability for death or *
+* personal injury resulting from such party's negligence to the *
+* extent applicable law prohibits such limitation. Some *
+* jurisdictions do not allow the exclusion or limitation of *
+* incidental or consequential damages, so this exclusion and *
+* limitation may not apply to You. *
+* *
+************************************************************************
+
+8. Litigation
+-------------
+
+Any litigation relating to this License may be brought only in the
+courts of a jurisdiction where the defendant maintains its principal
+place of business and such litigation shall be governed by laws of that
+jurisdiction, without reference to its conflict-of-law provisions.
+Nothing in this Section shall prevent a party's ability to bring
+cross-claims or counter-claims.
+
+9. Miscellaneous
+----------------
+
+This License represents the complete agreement concerning the subject
+matter hereof. If any provision of this License is held to be
+unenforceable, such provision shall be reformed only to the extent
+necessary to make it enforceable. Any law or regulation which provides
+that the language of a contract shall be construed against the drafter
+shall not be used to construe this License against a Contributor.
+
+10. Versions of the License
+---------------------------
+
+10.1. New Versions
+
+Mozilla Foundation is the license steward. Except as provided in Section
+10.3, no one other than the license steward has the right to modify or
+publish new versions of this License. Each version will be given a
+distinguishing version number.
+
+10.2. Effect of New Versions
+
+You may distribute the Covered Software under the terms of the version
+of the License under which You originally received the Covered Software,
+or under the terms of any subsequent version published by the license
+steward.
+
+10.3. Modified Versions
+
+If you create software not governed by this License, and you want to
+create a new license for such software, you may create and use a
+modified version of this License if you rename the license and remove
+any references to the name of the license steward (except to note that
+such modified license differs from this License).
+
+10.4. Distributing Source Code Form that is Incompatible With Secondary
+Licenses
+
+If You choose to distribute Source Code Form that is Incompatible With
+Secondary Licenses under the terms of this version of the License, the
+notice described in Exhibit B of this License must be attached.
+
+Exhibit A - Source Code Form License Notice
+-------------------------------------------
+
+ This Source Code Form is subject to the terms of the Mozilla Public
+ License, v. 2.0. If a copy of the MPL was not distributed with this
+ file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+If it is not possible or desirable to put the notice in a particular
+file, then You may include the notice in a location (such as a LICENSE
+file in a relevant directory) where a recipient would be likely to look
+for such a notice.
+
+You may add additional accurate notices of copyright ownership.
+
A => Makefile +22 -0
@@ 1,22 @@
+.POSIX:
+.SUFFIXES:
+HARE=hare
+HAREFLAGS=
+
+DESTDIR=
+PREFIX=/usr/local
+SRCDIR=$(PREFIX)/src
+HARESRCDIR=$(SRCDIR)/hare
+THIRDPARTYDIR=$(HARESRCDIR)/third-party
+
+check:
+ $(HARE) test $(HAREFLAGS)
+
+install:
+ mkdir -p "$(DESTDIR)$(THIRDPARTYDIR)"/format/nbt
+ install -Dm644 format/nbt/* $(DESTDIR)$(THIRDPARTYDIR)/format/nbt
+
+uninstall:
+ rm -rf $(DESTDIR)$(THIRDPARTYDIR)/format/nbt
+
+.PHONY: check install uninstall
A => README.md +23 -0
@@ 1,23 @@
+# hare-json
+
+This package provides [Named Binary Tag](https://wiki.vg/NBT) support for Hare.
+
+## Installation
+
+### From your distribution
+
+The recommended name for this package is "hare-nbt". Look for this, or something
+similar, in your local package manager. This is the preferred way to install
+this package.
+
+### System-wide installation
+
+```
+make install
+```
+
+### Vendoring
+
+```
+git subtree -P vendor/hare-nbt/ add https://git.sr.ht/~arslee07/hare-nbt master
+```
A => cmd/bigtest/bigtest.ha +20 -0
@@ 1,20 @@
+use fmt;
+use format::nbt;
+use os;
+use io;
+use fs;
+
+export fn main() void = {
+ let f = os::open("cmd/bigtest/bigtest_decompressed.dat")!;
+ defer io::close(f)!;
+
+ let tag = nbt::load(f)!;
+ defer nbt::finish(tag);
+
+ let level = tag.payload as nbt::compound;
+ let longTest = nbt::get(&level, "longTest") as *nbt::tag;
+ let long = longTest.payload as i64;
+
+ fmt::println(tag.name)!;
+ fmt::println(long)!;
+};
A => cmd/bigtest/bigtest_decompressed.dat +0 -0
A => cmd/dump/dump.ha +31 -0
@@ 1,31 @@
+use fmt;
+use format::nbt;
+use os;
+use io;
+use fs;
+
+const tag = nbt::tag {
+ name = "value",
+ payload = [
+ nbt::tag {
+ name = "foo",
+ payload = 42i32,
+ },
+ nbt::tag {
+ name = "bar",
+ payload = 12.345f64,
+ },
+ nbt::tag {
+ name = "hello",
+ payload = "world",
+ },
+ ],
+};
+
+export fn main() void = {
+ let fout = os::open("dumptest.dat", fs::flag::WRONLY | fs::flag::CREATE)!;
+ defer io::close(fout)!;
+ os::fchmod(fout, fs::mode::USER_RW)!;
+
+ nbt::dump(fout, tag)!;
+};
A => format/nbt/README +2 -0
@@ 1,2 @@
+This module provides an implementation of the Named Binary Tag (NBT) format as
+defined in https://wiki.vg/NBT.
A => format/nbt/compound.ha +11 -0
@@ 1,11 @@
+// License: MPL-2.0
+// (c) 2024 arslee07 <mail@arslee.me>
+
+// Gets a refernce to compound value by its name.
+export fn get(compound: *compound, name: str) (*tag | void) = {
+ for (let entry &.. compound) {
+ if (entry.name == name) {
+ return entry;
+ };
+ };
+};
A => format/nbt/dump.ha +106 -0
@@ 1,106 @@
+// License: MPL-2.0
+// (c) 2024 arslee07 <mail@arslee.me>
+
+use io;
+use strings;
+use endian;
+use math;
+
+fn dump_uint(out: io::handle, value: (u8 | u16 | u32 | u64)) (size | io::error) = {
+ match (value) {
+ case let u: u8 =>
+ return io::write(out, [u]);
+ case let u: u16 => {
+ static const buf: [2]u8 = [0...];
+ endian::beputu16(buf, u);
+ return io::write(out, buf);
+ };
+ case let u: u32 => {
+ static const buf: [4]u8 = [0...];
+ endian::beputu32(buf, u);
+ return io::write(out, buf);
+ };
+ case let u: u64 => {
+ static const buf: [8]u8 = [0...];
+ endian::beputu64(buf, u);
+ return io::write(out, buf);
+ };
+ };
+};
+
+fn dump_str(out: io::handle, s: str) (size | io::error) = {
+ let z = 0z;
+
+ z += dump_uint(out, len(s): u16)?;
+ z += io::write(out, strings::toutf8(s))?;
+
+ return z;
+};
+
+fn dump_payload(out: io::handle, payload: payload) (size | io::error) = {
+ let z = 0z;
+
+ match (payload) {
+ case end =>
+ z += dump_uint(out, 0u8)?;
+ case let i: i8 =>
+ z += dump_uint(out, i: u8)?;
+ case let i: i16 =>
+ z += dump_uint(out, i: u16)?;
+ case let i: i32 =>
+ z += dump_uint(out, i: u32)?;
+ case let i: i64 =>
+ z += dump_uint(out, i: u64)?;
+ case let f: f32 => {
+ z += dump_uint(out, math::f32bits(f))?;
+ };
+ case let f: f64 =>
+ z += dump_uint(out, math::f64bits(f))?;
+ case let a: []i8 => {
+ z += dump_uint(out, len(a): u32)?;
+ for (let i .. a) {
+ z += dump_uint(out, i: u8)?;
+ };
+ };
+ case let a: []i32 => {
+ z += dump_uint(out, len(a): u32)?;
+ for (let i .. a) {
+ z += dump_uint(out, i: u32)?;
+ };
+ };
+ case let a: []i64 => {
+ z += dump_uint(out, len(a): u32)?;
+ for (let i .. a) {
+ z += dump_uint(out, i: u64)?;
+ };
+ };
+ case let s: str =>
+ z += dump_str(out, s)?;
+ case let ls: list => {
+ z += dump_uint(out, ls.0: u8)?;
+ z += dump_uint(out, len(ls.1): u32)?;
+ for (let e .. ls.1) {
+ z += dump_payload(out, e)?;
+ };
+ };
+ case let c: compound => {
+ for (let t .. c) {
+ z += dump(out, t)?;
+ };
+ z += dump_uint(out, 0u8)?;
+ };
+ };
+
+ return z;
+};
+
+// Dumps a [[tag]] into an [[io::handle]].
+export fn dump(out: io::handle, tag: tag) (size | io::error) = {
+ let z = 0z;
+
+ z += dump_uint(out, payload_type(tag.payload): u8)?;
+ z += dump_str(out, tag.name)?;
+ z += dump_payload(out, tag.payload)?;
+
+ return z;
+};
A => format/nbt/error.ha +13 -0
@@ 1,13 @@
+// License: MPL-2.0
+// (c) 2024 arslee07 <mail@arslee.me>
+
+use io;
+
+// Unexpected EOF while reading the stream.
+export type unexpected_eof = !void;
+
+// Invalid tag type.
+export type invalid_type = !void;
+
+// A tagged union of all possible errors returned from this module.
+export type error = !(unexpected_eof | invalid_type | io::error);
A => format/nbt/load.ha +209 -0
@@ 1,209 @@
+// License: MPL-2.0
+// (c) 2024 arslee07 <mail@arslee.me>
+
+use io;
+use bufio;
+use endian;
+use strings;
+use math;
+
+fn scan_buf(h: io::handle, buf: const []u8) (void | error) = {
+ let result = io::read(h, buf)?;
+ match (result) {
+ case let sz: size =>
+ if (sz != len(buf))
+ return unexpected_eof;
+ case io::EOF =>
+ return unexpected_eof;
+ };
+};
+
+fn scan_byte(h: io::handle) (i8 | error) = {
+ match (bufio::read_byte(h)) {
+ case let value: u8 =>
+ return value: i8;
+ case let eof: io::EOF =>
+ return unexpected_eof;
+ case let error: io::error =>
+ return error;
+ };
+};
+
+fn scan_short(h: io::handle) (i16 | error) = {
+ const buf: [2]u8 = [0...];
+ scan_buf(h, buf)?;
+ return endian::begetu16(buf): i16;
+};
+
+fn scan_int(h: io::handle) (i32 | error) = {
+ const buf: [4]u8 = [0...];
+ scan_buf(h, buf)?;
+ return endian::begetu32(buf): i32;
+};
+
+fn scan_long(h: io::handle) (i64 | error) = {
+ const buf: [8]u8 = [0...];
+ scan_buf(h, buf)?;
+ return endian::begetu64(buf): i64;
+};
+
+fn scan_float(h: io::handle) (f32 | error) = {
+ const buf: [4]u8 = [0...];
+ scan_buf(h, buf)?;
+ return math::f32frombits(endian::begetu32(buf));
+};
+
+fn scan_double(h: io::handle) (f64 | error) = {
+ const buf: [8]u8 = [0...];
+ scan_buf(h, buf)?;
+ return math::f64frombits(endian::begetu64(buf));
+};
+
+fn scan_byte_array(h: io::handle) ([]i8 | error) = {
+ let length = scan_int(h)?: size;
+ let buf = alloc([0i8...], length);
+ for (let i = 0z; i < length; i += 1) {
+ match (scan_byte(h)) {
+ case let err: error => {
+ free(buf);
+ return err;
+ };
+ case let val: i8 =>
+ buf[i] = val;
+ };
+ };
+ return buf;
+};
+
+fn scan_int_array(h: io::handle) ([]i32 | error) = {
+ let length = scan_int(h)?: size;
+ let buf = alloc([0i32...], length);
+ for (let i = 0z; i < length; i += 1) {
+ match (scan_int(h)) {
+ case let err: error => {
+ free(buf);
+ return err;
+ };
+ case let val: i32 =>
+ buf[i] = val;
+ };
+ };
+ return buf;
+};
+
+fn scan_long_array(h: io::handle) ([]i64 | error) = {
+ let length = scan_int(h)?: size;
+ let buf = alloc([0i64...], length);
+
+ for (let i = 0z; i < length; i += 1) {
+ match (scan_long(h)) {
+ case let err: error => {
+ free(buf);
+ return err;
+ };
+ case let val: i64 =>
+ buf[i] = val;
+ };
+ };
+
+ return buf;
+};
+
+fn scan_list(h: io::handle) (list | error) = {
+ let typ = scan_type(h)?;
+ let length = scan_int(h)?: size;
+ let list: []payload = alloc([end...], length);
+
+ for (let i = 0z; i < length; i += 1) {
+ match (scan_payload(h, typ)) {
+ case let err: error => {
+ free(list);
+ return err;
+ };
+ case let val: payload =>
+ list[i] = val;
+ };
+ };
+
+ return (typ, list);
+};
+
+fn scan_compound(h: io::handle) ([]tag | error) = {
+ let tags: []tag = [];
+
+ for (true) {
+ let tag = load(h)?;
+ if (tag.payload is end) {
+ break;
+ };
+ append(tags, tag);
+ };
+
+ return tags;
+};
+
+fn scan_type(h: io::handle) (tagtype | error) = {
+ let byte = scan_byte(h)?;
+ if (byte < 0 || byte > 12) {
+ return invalid_type;
+ };
+ return byte: tagtype;
+};
+
+fn scan_string(h: io::handle) (str | error) = {
+ let length = scan_short(h)?: u16;
+ let buf: []u8 = alloc([0...], length);
+ scan_buf(h, buf)?;
+ return strings::fromutf8_unsafe(buf);
+};
+
+fn scan_payload(h: io::handle, typ: tagtype) (payload | error) = {
+ switch (typ) {
+ case tagtype::END =>
+ return end;
+ case tagtype::BYTE =>
+ return scan_byte(h)?;
+ case tagtype::SHORT =>
+ return scan_short(h)?;
+ case tagtype::INT =>
+ return scan_int(h)?;
+ case tagtype::LONG =>
+ return scan_long(h)?;
+ case tagtype::FLOAT =>
+ return scan_float(h)?;
+ case tagtype::DOUBLE =>
+ return scan_double(h)?;
+ case tagtype::BYTE_ARRAY =>
+ return scan_byte_array(h)?;
+ case tagtype::STRING =>
+ return scan_string(h)?;
+ case tagtype::LIST =>
+ return scan_list(h)?;
+ case tagtype::COMPOUND =>
+ return scan_compound(h)?;
+ case tagtype::INT_ARRAY =>
+ return scan_int_array(h)?;
+ case tagtype::LONG_ARRAY =>
+ return scan_long_array(h)?;
+ };
+};
+
+// Parses an NBT from the given decompressed [[io::handle]], returning the value
+// or an error. The return value is allocated on the heap; use [[finish]] to
+// free it up when you're done using it.
+export fn load(src: io::handle) (tag | error) = {
+ let typ = scan_type(src)?;
+
+ if (typ == tagtype::END) {
+ return tag {
+ name = "",
+ payload = end,
+ };
+ };
+
+ return tag {
+ name = scan_string(src)?,
+ payload = scan_payload(src, typ)?,
+ };
+};
+
A => format/nbt/tag.ha +116 -0
@@ 1,116 @@
+// License: MPL-2.0
+// (c) 2024 arslee07 <mail@arslee.me>
+
+// Type of tag payload.
+export type tagtype = enum u8 {
+ END = 0,
+ BYTE = 1,
+ SHORT = 2,
+ INT = 3,
+ LONG = 4,
+ FLOAT = 5,
+ DOUBLE = 6,
+ BYTE_ARRAY = 7,
+ STRING = 8,
+ LIST = 9,
+ COMPOUND = 10,
+ INT_ARRAY = 11,
+ LONG_ARRAY = 12,
+};
+
+// Named Tag.
+export type tag = struct {
+ // Tag name.
+ name: str,
+ // Tag payload.
+ payload: payload,
+};
+
+// This type is used to mark the end of a list.
+export type end = void;
+
+// A sequential list of Tags (not Named Tags).
+export type list = (tagtype, []payload);
+
+// A sequential list of Named Tags.
+export type compound = []tag;
+
+// Contents of the tag.
+export type payload = (
+ end
+ | i8
+ | i16
+ | i32
+ | i64
+ | f32
+ | f64
+ | []i8
+ | str
+ | compound
+ | list
+ | []i32
+ | []i64
+);
+
+fn payload_type(payload: payload) tagtype = {
+ match (payload) {
+ case end =>
+ return tagtype::END;
+ case i8 =>
+ return tagtype::BYTE;
+ case i16 =>
+ return tagtype::SHORT;
+ case i32 =>
+ return tagtype::INT;
+ case i64 =>
+ return tagtype::LONG;
+ case f32 =>
+ return tagtype::FLOAT;
+ case f64 =>
+ return tagtype::DOUBLE;
+ case []i8 =>
+ return tagtype::BYTE_ARRAY;
+ case []i32 =>
+ return tagtype::INT_ARRAY;
+ case []i64 =>
+ return tagtype::LONG_ARRAY;
+ case str =>
+ return tagtype::STRING;
+ case list =>
+ return tagtype::LIST;
+ case compound =>
+ return tagtype::COMPOUND;
+ };
+};
+
+fn free_payload(payload: payload) void = {
+ match (payload) {
+ case let value: str =>
+ free(value);
+ case let value: list => {
+ for (let entry .. value.1) {
+ free_payload(entry);
+ };
+ free(value.1);
+ };
+ case let value: compound => {
+ for (let entry .. value) {
+ finish(entry);
+ };
+ free(value);
+ };
+ case let value: []i8 =>
+ free(value);
+ case let value: []i32 =>
+ free(value);
+ case let value: []i64 =>
+ free(value);
+ case => void;
+ };
+};
+
+// Frees state associated with an NBT.
+export fn finish(tag: tag) void = {
+ free(tag.name);
+ free_payload(tag.payload);
+};