thepigeongenerator/mcaselector-lite
1
0
Fork 0
mirror of https://github.com/thepigeongenerator/mcaselector-lite.git synced 2025-12-18 20:35:45 +01:00
Code Issues Packages Projects Releases Wiki Activity

Compare commits

base: thepigeongenerator:f53e4315ee94859b20bbae65fdd225cfed666f87
Branches Tags
thepigeongenerator:main
..
compare: thepigeongenerator:3eb92541db0161243852769a0be1598cdf33736a
Branches Tags
thepigeongenerator:main

2 Commits
f53e4315ee ... 3eb92541db

Author SHA1 Message Date
Quinn
3eb92541db simplify the ptr increment a bit, so it's more clear what's going on 2025-08-20 19:00:57 +02:00
Quinn
df3720b966 refactor via swapping values to instead have n * len, to be len * n 
it is like this in other code, and makes it more obvious what the actual
unique value is.
At least to me, which is what mostly matters.
 2025-08-20 19:00:37 +02:00
1 changed files with 8 additions and 7 deletions
Expand all files Collapse all files

15
src/dat/nbt.c
View File

@@ -52,17 +52,18 @@ const u8 *nbt_nexttag(const u8 *restrict buf) {
case NBT_END: dpt--; break;
case NBT_COMPOUND: dpt++; break;
// TODO: move this into it's own function for readability.
case NBT_LIST: {
tag = ptr; // temporarily store the tag to cache later
switch (*(ptr++)) {
tag = ptr;
ptr++;
switch (*tag) {
case NBT_END: break;
case NBT_I8: ptr += 1 * (i32)be32toh(*(u32 *)ptr); break;
case NBT_I16: ptr += 2 * (i32)be32toh(*(u32 *)ptr); break;
case NBT_I8: ptr += (i32)be32toh(*(u32 *)ptr) * 1; break;
case NBT_I16: ptr += (i32)be32toh(*(u32 *)ptr) * 2; break;
case NBT_I32: // fall through
case NBT_F32: ptr += 4 * (i32)be32toh(*(u32 *)ptr); break;
case NBT_F32: ptr += (i32)be32toh(*(u32 *)ptr) * 4; break;
case NBT_I64: // fall through
case NBT_F64: ptr += 8 * (i32)be32toh(*(u32 *)ptr); break;
case NBT_F64: ptr += (i32)be32toh(*(u32 *)ptr) * 8; break;
default:
// TODO: handle out of bounds... Might not be required if we use flexible array member
dpt++;