commit 770a6d47bea9e5c7d599456b66368ce75d529f5d Author: PikalaxALT Date: Fri Jul 5 21:55:31 2019 -0400 Initial commit diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..af66eca --- /dev/null +++ b/.gitignore @@ -0,0 +1,7 @@ +*.map +*.gba +*.elf +build/ +tools/agbcc +tools/binutils +*.exe diff --git a/Makefile b/Makefile new file mode 100644 index 0000000..0b602f4 --- /dev/null +++ b/Makefile @@ -0,0 +1,94 @@ +include $(DEVKITARM)/base_tools +AS := $(PREFIX)as +LD := $(PREFIX)ld +CPP := $(PREFIX)cpp +OBJCOPY := $(PREFIX)objcopy +PREPROC := tools/preproc/preproc +SCANINC := tools/scaninc/scaninc + +NAME := payload +ROM := $(NAME).gba +ELF := $(NAME).elf + +BUILD_DIR := build/$(NAME) + +ASM_SRCS := $(wildcard asm/*.s) +ASM_OBJS := $(ASM_SRCS:%.s=$(BUILD_DIR)/%.o) +C_SRCS := $(wildcard src/*.c) +C_OBJS := $(C_SRCS:%.c=$(BUILD_DIR)/%.o) +DATA_ASM_SRCS := $(wildcard data/*.s) +DATA_ASM_OBJS := $(DATA_ASM_SRCS:%.s=$(BUILD_DIR)/%.o) + +CC1 := tools/agbcc/bin/agbcc +CPPFLAGS := -I tools/agbcc/include -iquote include -nostdinc -undef +CFLAGS := -O2 -mthumb-interwork -fhex-asm +ASFLAGS := -mcpu=arm7tdmi +LIBS := -L../../tools/agbcc/lib -lgcc -lc + +SUBDIRS := asm src data + +ALL_OBJS := $(ASM_OBJS) $(C_OBJS) $(DATA_ASM_OBJS) + +TOOLDIRS := $(filter-out tools/agbcc tools/binutils,$(wildcard tools/*)) + +infoshell = $(foreach line, $(shell $1 | sed "s/ /__SPACE__/g"), $(info $(subst __SPACE__, ,$(line)))) + +# Build tools when building the rom +# Disable dependency scanning for clean/tidy/tools +ifeq (,$(filter-out all compare,$(MAKECMDGOALS))) +$(call infoshell, $(MAKE) tools) +else +NODEP := 1 +endif + +$(shell mkdir -p $(SUBDIRS:%=$(BUILD_DIR)/%)) + +.SUFFIXES: +.SECONDARY: +.DELETE_ON_ERROR: +.SECONDEXPANSION: + +.PHONY: all rom clean compare tools cleantools mostlyclean + +all: rom + +rom: $(ROM) + +mostlyclean: + rm -f $(ROM) $(ROM:%.gba=%.elf) $(ALL_OBJS) + +clean: mostlyclean + @$(foreach tool,$(TOOLDIRS),$(MAKE) clean -C $(tool);) + +compare: rom + sha1sum -c rom.sha1 + +tools: + @$(foreach tool,$(TOOLDIRS),$(MAKE) -C $(tool);) + +ifeq ($(NODEP),1) +$(BUILD_DIR)/asm/%.o: asm_dep := +$(BUILD_DIR)/src/%.o: c_dep := +$(BUILD_DIR)/data/%.o: data_dep := +else +$(BUILD_DIR)/asm/%.o: asm_dep = $(shell $(SCANINC) -I include $*.s) +$(BUILD_DIR)/src/%.o: c_dep = $(shell $(SCANINC) -I include $*.c) +$(BUILD_DIR)/data/%.o: data_dep = $(shell $(SCANINC) -I include $*.s) +endif + +$(ASM_OBJS): $(BUILD_DIR)/%.o: %.s $$(asm_dep) + $(AS) $(ASFLAGS) -o $@ $< + +$(C_OBJS): $(BUILD_DIR)/%.o: %.s $$(c_dep) + $(CPP) $(CPPFLAGS) -o $*.i $< + $(PREPROC) $*.i charmap.txt | $(CC1) $(CFLAGS) -o $*.s + $(AS) $(ASFLAGS) -o $@ $*.i + +$(DATA_ASM_OBJS): $(BUILD_DIR)/%.o: %.s $$(data_dep) + $(PREPROC) $< charmap.txt | $(CPP) $(CPPFLAGS) | $(AS) $(ASFLAGS) -o $@ + +$(ELF): ld_script.ld $(ALL_OBJS) + cd $(BUILD_DIR) && $(LD) -Map ../../$*.map -T ../../$< -o ../../$@ $(LIBS) + +$(ROM): $(ELF) + $(OBJCOPY) -O binary $< $@ diff --git a/README.md b/README.md new file mode 100644 index 0000000..b19ff36 --- /dev/null +++ b/README.md @@ -0,0 +1 @@ +This repository builds the Pokemon Colosseum Multiboot image which comes compressed within Pokemon FireRed (USA)(1.0). diff --git a/asm/all.s b/asm/all.s new file mode 100644 index 0000000..9150706 --- /dev/null +++ b/asm/all.s @@ -0,0 +1,11479 @@ + .include "asm/macros/function.inc" + .text + .syntax unified + + thumb_func_start sub_0200023C +sub_0200023C: @ 0x0200023C + push {lr} + bl sub_02006490 + ldr r1, =gUnknown_02024960 + ldrb r0, [r1, #3] + lsls r0, r0, #0x19 + cmp r0, #0 + bne _02000260 + ldr r2, =0x00000858 + adds r0, r1, r2 + ldrb r1, [r0] + movs r1, #1 + b _02000268 + .align 2, 0 + .pool +_02000260: + ldr r3, =0x00000858 + adds r0, r1, r3 + ldrb r1, [r0] + movs r1, #2 +_02000268: + strb r1, [r0] + bl sub_02006490 + adds r1, r0, #0 + movs r0, #0 + movs r2, #1 + bl sub_02002A9C + ldr r1, =gUnknown_02024960 + ldr r2, =0x0000087E + adds r0, r1, r2 + ldrb r2, [r0] + ldr r3, =0x0000087B + adds r0, r1, r3 + ldrb r0, [r0] + lsls r0, r0, #0x10 + orrs r0, r2 + adds r3, #5 + adds r2, r1, r3 + str r0, [r2] + ldr r0, =0x0000087F + adds r1, r1, r0 + ldrb r0, [r1] + movs r0, #1 + strb r0, [r1] + movs r0, #0 + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_020002B4 +sub_020002B4: @ 0x020002B4 + push {r4, r5, r6, r7, lr} + sub sp, #0x48 + bl sub_0200CBF8 + ldr r0, =gUnknown_0201F4AC + ldr r1, [r0] + movs r0, #2 + bl sub_020098D8 + bl sub_020094A8 + bl sub_02009958 + ldr r4, =gUnknown_020217B4 + bl sub_02009CD8 + strb r0, [r4] + ldr r5, =gUnknown_020217B8 + movs r0, #0 + str r0, [sp, #0x44] + movs r4, #0 + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + ldr r0, [r0, #4] + cmp r0, #2 + beq _02000304 + movs r0, #0 + ldr r6, =gRomHeader + 0xA8 + add r7, sp, #0x40 + b _0200032C + .align 2, 0 + .pool +_02000304: + ldr r6, =gRomHeader + 0xA8 + add r7, sp, #0x40 +_02000308: + add r0, sp, #0x44 + mov r1, sp + movs r2, #0 + bl sub_0200E4BC + ldr r1, [sp, #0x44] + cmp r1, #5 + bne _0200031A + movs r4, #1 +_0200031A: + cmp r1, #0xb + bne _02000320 + movs r4, #2 +_02000320: + subs r0, r1, #6 + cmp r0, #1 + bls _0200032A + cmp r1, #0xb + bne _02000308 +_0200032A: + adds r0, r4, #0 +_0200032C: + strb r0, [r5] + bl sub_020092F0 + bl sub_02002C44 + movs r0, #0x28 + movs r1, #5 + bl sub_020092A4 + ldr r0, =0x04000200 + movs r3, #1 + strh r3, [r0] + ldr r1, =0x04000004 + movs r0, #8 + strh r0, [r1] + movs r2, #0x80 + lsls r2, r2, #0x13 + ldrh r1, [r2] + ldr r0, =0x0000FF7F + ands r0, r1 + strh r0, [r2] + ldr r0, =0x04000208 + strh r3, [r0] + ldr r0, =gUnknown_02022ED8 + ldr r0, [r0] + ldr r1, =gUnknown_02022ECC + ldr r1, [r1] + ldr r2, =gUnknown_020217B4 + ldrb r2, [r2] + bl sub_0200C9C0 + adds r0, r6, #0 + bl sub_0200D924 + ldr r0, =sub_0200D9EC + bl sub_020086A0 + bl sub_0200930C + ldr r0, =0x03004000 + bl sub_0200902C + bl sub_020007F0 +_02000384: + bl sub_020047D4 + cmp r0, #0 + bne _020003EA + bl sub_02006344 + bl sub_02005BB8 + bl sub_020064B0 + cmp r0, #0 + bne _020003E4 + ldr r1, =gUnknown_02024960 + ldrb r0, [r1, #3] + lsls r0, r0, #0x19 + cmp r0, #0 + beq _020003DC + ldrb r0, [r1, #3] + lsls r0, r0, #0x19 + lsrs r0, r0, #0x19 + subs r0, #1 + b _020003DE + .align 2, 0 + .pool +_020003DC: + movs r0, #0 +_020003DE: + bl sub_02005704 + b _02000384 +_020003E4: + bl sub_0200023C + b _02000384 +_020003EA: + ldr r0, =gUnknown_02022EC4 + ldr r0, [r0] + ldr r1, =gUnknown_02022ECC + ldr r1, [r1] + ldr r2, =gUnknown_020251E8 + ldr r2, [r2] + adds r2, #0x8c + ldr r2, [r2] + lsls r2, r2, #0xa + lsrs r2, r2, #0xb + bl CpuSet + movs r0, #0 + strh r0, [r7] + movs r5, #0 + ldr r6, =gUnknown_02022EF4 + movs r4, #0 +_0200040C: + ldr r0, [r6] + adds r0, r0, r4 + movs r1, #0x37 + adds r2, r7, #0 + bl sub_0200C040 + adds r4, #0x64 + adds r5, #1 + cmp r5, #5 + ble _0200040C + movs r0, #1 + movs r1, #0 + movs r2, #0 + bl sub_02002A9C + b _02000384 + .align 2, 0 + .pool + + thumb_func_start sub_0200043C +sub_0200043C: @ 0x0200043C + push {r4, lr} + sub sp, #0x44 + movs r0, #0 + str r0, [sp, #0x40] + movs r4, #0 + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + ldr r0, [r0, #4] + cmp r0, #2 + beq _02000458 + movs r0, #0 + b _0200047C + .align 2, 0 + .pool +_02000458: + add r0, sp, #0x40 + mov r1, sp + movs r2, #0 + bl sub_0200E4BC + ldr r1, [sp, #0x40] + cmp r1, #5 + bne _0200046A + movs r4, #1 +_0200046A: + cmp r1, #0xb + bne _02000470 + movs r4, #2 +_02000470: + subs r0, r1, #6 + cmp r0, #1 + bls _0200047A + cmp r1, #0xb + bne _02000458 +_0200047A: + adds r0, r4, #0 +_0200047C: + add sp, #0x44 + pop {r4} + pop {r1} + bx r1 + + thumb_func_start sub_02000484 +sub_02000484: @ 0x02000484 + push {r4, r5, r6, r7, lr} + mov r7, sb + mov r6, r8 + push {r6, r7} + adds r4, r0, #0 + adds r5, r1, #0 + ldr r0, [r4, #0x10] + mov r8, r0 + ldr r1, [r4, #0x14] + mov sb, r1 + b _02000564 +_0200049A: + ldrb r1, [r5] + cmp r1, #0xfc + beq _020004EC + cmp r1, #0xfc + bgt _020004AA + cmp r1, #0xfb + beq _020004D0 + b _02000548 +_020004AA: + cmp r1, #0xfd + beq _020004BA + cmp r1, #0xfe + bne _02000548 + adds r0, r4, #0 + bl sub_02009154 + b _02000562 +_020004BA: + adds r5, #1 + ldrb r0, [r5] + lsls r1, r0, #5 + ldr r0, =gUnknown_020217C0 + adds r1, r1, r0 + adds r0, r4, #0 + bl sub_02000484 + b _02000562 + .align 2, 0 + .pool +_020004D0: + ldr r6, =gUnknown_02022EB0 + movs r7, #3 +_020004D4: + movs r0, #1 + bl sub_02008600 + adds r0, r7, #0 + ldrh r1, [r6] + ands r0, r1 + cmp r0, #0 + beq _020004D4 + b _02000562 + .align 2, 0 + .pool +_020004EC: + adds r5, #1 + adds r6, r5, #0 + ldrb r0, [r5] + cmp r0, #0x14 + beq _02000506 + cmp r0, #0x14 + bgt _02000500 + cmp r0, #0xf + beq _0200053C + b _02000544 +_02000500: + cmp r0, #0x15 + beq _0200050E + b _02000544 +_02000506: + ldrb r0, [r5, #1] + strb r0, [r4, #0x1c] + adds r6, r5, #2 + b _02000544 +_0200050E: + ldrb r0, [r4, #9] + cmp r0, #8 + bne _02000528 + ldr r0, =gUnknown_0201704C + str r0, [r4, #0x10] + ldr r0, =gUnknown_02017E0C + str r0, [r4, #0x14] + b _02000544 + .align 2, 0 + .pool +_02000528: + ldr r0, =gUnknown_02014F8C + str r0, [r4, #0x10] + ldr r0, =gUnknown_02016F4C + str r0, [r4, #0x14] + b _02000544 + .align 2, 0 + .pool +_0200053C: + adds r0, r4, #0 + movs r1, #0 + bl sub_020090B0 +_02000544: + adds r5, r6, #0 + b _02000562 +_02000548: + ldrb r0, [r4, #0x19] + cmp r0, #0 + bne _02000558 + ldrb r2, [r4, #0x18] + adds r0, r4, #0 + bl sub_02008D6C + b _02000562 +_02000558: + ldrb r2, [r4, #0x18] + ldrb r3, [r4, #0x19] + adds r0, r4, #0 + bl sub_02008E4C +_02000562: + adds r5, #1 +_02000564: + ldrb r0, [r5] + cmp r0, #0xff + bne _0200049A + movs r0, #0 + strb r0, [r4, #0x1c] + mov r1, r8 + str r1, [r4, #0x10] + mov r0, sb + str r0, [r4, #0x14] + pop {r3, r4} + mov r8, r3 + mov sb, r4 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start sub_02000584 +sub_02000584: @ 0x02000584 + push {r4, r5, r6, r7, lr} + mov r7, r8 + push {r7} + adds r4, r0, #0 + adds r5, r1, #0 + ldr r7, [r4, #0x10] + ldr r0, [r4, #0x14] + mov r8, r0 + b _02000638 +_02000596: + ldrb r1, [r5] + cmp r1, #0xfc + beq _020005D0 + cmp r1, #0xfc + bgt _020005A6 + cmp r1, #0xf9 + beq _020005B2 + b _0200062C +_020005A6: + cmp r1, #0xfe + bne _0200062C + adds r0, r4, #0 + bl sub_02009154 + b _02000636 +_020005B2: + ldr r1, [r4, #0x14] + ldr r0, =gUnknown_02017E0C + cmp r1, r0 + beq _020005C4 + adds r0, r4, #0 + movs r1, #5 + b _020005C8 + .align 2, 0 + .pool +_020005C4: + adds r0, r4, #0 + movs r1, #8 +_020005C8: + movs r2, #0 + bl sub_0200916C + b _02000636 +_020005D0: + adds r5, #1 + adds r6, r5, #0 + ldrb r0, [r5] + cmp r0, #0x14 + beq _020005EA + cmp r0, #0x14 + bgt _020005E4 + cmp r0, #0xf + beq _02000620 + b _02000628 +_020005E4: + cmp r0, #0x15 + beq _020005F2 + b _02000628 +_020005EA: + ldrb r0, [r5, #1] + strb r0, [r4, #0x1c] + adds r6, r5, #2 + b _02000628 +_020005F2: + ldrb r0, [r4, #9] + cmp r0, #8 + bne _0200060C + ldr r0, =gUnknown_0201704C + str r0, [r4, #0x10] + ldr r0, =gUnknown_02017E0C + str r0, [r4, #0x14] + b _02000628 + .align 2, 0 + .pool +_0200060C: + ldr r0, =gUnknown_02014F8C + str r0, [r4, #0x10] + ldr r0, =gUnknown_02016F4C + str r0, [r4, #0x14] + b _02000628 + .align 2, 0 + .pool +_02000620: + adds r0, r4, #0 + movs r1, #0 + bl sub_020090B0 +_02000628: + adds r5, r6, #0 + b _02000636 +_0200062C: + ldrb r2, [r4, #0x18] + ldrb r3, [r4, #0x19] + adds r0, r4, #0 + bl sub_02008E4C +_02000636: + adds r5, #1 +_02000638: + ldrb r0, [r5] + cmp r0, #0xff + bne _02000596 + str r7, [r4, #0x10] + mov r0, r8 + str r0, [r4, #0x14] + pop {r3} + mov r8, r3 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start sub_02000650 +sub_02000650: @ 0x02000650 + push {lr} + lsls r0, r0, #5 + ldr r2, =gUnknown_020217C0 + adds r0, r0, r2 + bl sub_0200CE5C + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02000664 +sub_02000664: @ 0x02000664 + push {r4, lr} + adds r3, r0, #0 + movs r2, #0 + ldrb r0, [r1] + cmp r0, #0xff + beq _02000682 + ldr r3, [r3, #0x14] +_02000672: + ldrb r4, [r1] + adds r0, r4, r3 + ldrb r0, [r0] + adds r2, r0, r2 + adds r1, #1 + ldrb r0, [r1] + cmp r0, #0xff + bne _02000672 +_02000682: + adds r0, r2, #0 + pop {r4} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200068C +sub_0200068C: @ 0x0200068C + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + mov sb, r0 + adds r7, r1, #0 + mov r8, r2 + adds r4, r3, #0 + ldr r3, =0x0000300A + bl sub_020088E8 + adds r1, r7, #1 + ldr r3, =0x0000300B + mov r0, sb + mov r2, r8 + bl sub_020088E8 + adds r1, r7, #0 + adds r1, #8 + ldr r3, =0x0000300C + mov r0, sb + mov r2, r8 + bl sub_020088E8 + ldr r5, =gUnknown_02022EF4 + movs r0, #0x64 + mov sl, r0 + mov r3, sl + muls r3, r4, r3 + adds r4, r3, #0 + ldr r0, [r5] + adds r0, r0, r4 + movs r1, #0x39 + movs r2, #0 + bl sub_0200C1B8 + adds r6, r0, #0 + ldr r0, [r5] + adds r0, r0, r4 + movs r1, #0x3a + movs r2, #0 + bl sub_0200C1B8 + adds r1, r0, #0 + cmp r6, r1 + ble _020006EC + adds r6, r1, #0 +_020006EC: + lsls r0, r1, #2 + adds r0, r0, r1 + lsls r0, r0, #2 + mov r2, sl + muls r2, r6, r2 + cmp r0, r2 + ble _02000714 + ldr r0, =0x00006001 + b _02000722 + .align 2, 0 + .pool +_02000714: + movs r0, #0x32 + muls r0, r1, r0 + ldr r3, =0x00004001 + mov sl, r3 + cmp r0, r2 + ble _02000724 + ldr r0, =0x00005001 +_02000722: + mov sl, r0 +_02000724: + lsls r0, r6, #1 + adds r0, r0, r6 + lsls r0, r0, #4 + bl Div + adds r4, r0, #0 + movs r5, #0 + adds r7, #2 + cmp r4, #8 + ble _02000752 + mov r0, sl + adds r0, #8 + lsls r6, r0, #0x10 +_0200073E: + adds r1, r7, r5 + mov r0, sb + mov r2, r8 + lsrs r3, r6, #0x10 + bl sub_020088E8 + adds r5, #1 + subs r4, #8 + cmp r4, #8 + bgt _0200073E +_02000752: + cmp r4, #0 + beq _02000782 + adds r1, r7, r5 + adds r5, #1 + mov r0, sl + adds r3, r0, r4 + lsls r3, r3, #0x10 + lsrs r3, r3, #0x10 + mov r0, sb + mov r2, r8 + bl sub_020088E8 + b _02000782 + .align 2, 0 + .pool +_02000774: + adds r1, r7, r5 + mov r0, sb + mov r2, r8 + mov r3, sl + bl sub_020088E8 + adds r5, #1 +_02000782: + cmp r5, #5 + ble _02000774 + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + + thumb_func_start sub_02000794 +sub_02000794: @ 0x02000794 + ldr r0, =gUnknown_02020A40 + ldrb r0, [r0] + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_020007A0 +sub_020007A0: @ 0x020007A0 + ldr r1, =gUnknown_02020A40 + strb r0, [r1] + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_020007AC +sub_020007AC: @ 0x020007AC + push {r4, r5, lr} + movs r0, #1 + bl sub_02008600 + ldr r2, =0x04000054 + movs r0, #0x1f + strh r0, [r2] + ldr r1, =0x04000050 + movs r0, #0xff + strh r0, [r1] + movs r4, #0x1d + adds r5, r2, #0 +_020007C4: + movs r0, #1 + bl sub_02008600 + strh r4, [r5] + subs r4, #2 + cmp r4, #0 + bgt _020007C4 + ldr r0, =0x04000050 + movs r1, #0 + strh r1, [r0] + ldr r0, =gUnknown_02020A40 + strb r1, [r0] + pop {r4, r5} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_020007F0 +sub_020007F0: @ 0x020007F0 + push {r4, r5, lr} + ldr r1, =gUnknown_02020A40 + movs r0, #1 + strb r0, [r1] + movs r0, #1 + bl sub_02008600 + ldr r2, =0x04000054 + movs r0, #0 + strh r0, [r2] + ldr r1, =0x04000050 + movs r0, #0xff + strh r0, [r1] + movs r4, #1 + adds r5, r2, #0 +_0200080E: + movs r0, #1 + bl sub_02008600 + strh r4, [r5] + adds r4, #2 + cmp r4, #0x1f + ble _0200080E + ldr r1, =0x04000054 + movs r0, #0x1f + strh r0, [r1] + bl sub_02008C80 + pop {r4, r5} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02000838 +sub_02000838: @ 0x02000838 + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #4 + adds r5, r2, #0 + adds r7, r3, #0 + ldr r6, [sp, #0x24] + lsls r1, r1, #6 + lsls r0, r0, #1 + ldr r2, =0x03002000 + adds r0, r0, r2 + adds r2, r1, r0 + strh r6, [r2] + movs r0, #1 + subs r3, r5, #1 + cmp r0, r3 + bge _02000870 + adds r4, r6, #1 + adds r1, r2, #2 + subs r0, r5, #2 +_02000864: + strh r4, [r1] + adds r1, #2 + subs r0, #1 + cmp r0, #0 + bne _02000864 + adds r0, r3, #0 +_02000870: + lsls r0, r0, #1 + adds r0, r0, r2 + adds r1, r6, #2 + strh r1, [r0] + adds r2, #0x40 + movs r1, #1 + subs r3, r7, #1 + subs r5, #1 + adds r0, r6, #6 + mov sl, r0 + adds r0, #2 + str r0, [sp] + cmp r1, r3 + bge _020008C4 + adds r0, r6, #3 + mov sb, r0 + mov r8, r5 + adds r0, r6, #5 + mov ip, r0 + adds r7, r3, #0 +_02000898: + mov r0, sb + strh r0, [r2] + movs r0, #1 + adds r4, r2, #0 + adds r4, #0x40 + adds r3, r1, #1 + cmp r0, r8 + bge _020008B4 + adds r1, r5, #0 + subs r0, r5, #1 +_020008AC: + subs r0, #1 + cmp r0, #0 + bne _020008AC + adds r0, r1, #0 +_020008B4: + lsls r0, r0, #1 + adds r0, r0, r2 + mov r1, ip + strh r1, [r0] + adds r1, r3, #0 + adds r2, r4, #0 + cmp r1, r7 + blt _02000898 +_020008C4: + mov r0, sl + strh r0, [r2] + movs r0, #1 + adds r1, r5, #0 + cmp r0, r1 + bge _020008E2 + adds r4, r6, #7 + adds r3, r2, #2 + subs r0, r1, #1 +_020008D6: + strh r4, [r3] + adds r3, #2 + subs r0, #1 + cmp r0, #0 + bne _020008D6 + adds r0, r1, #0 +_020008E2: + lsls r0, r0, #1 + adds r0, r0, r2 + mov r1, sp + ldrh r1, [r1] + strh r1, [r0] + add sp, #4 + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02000900 +sub_02000900: @ 0x02000900 + push {r4, r5, r6, lr} + adds r5, r0, #0 + adds r4, r1, #0 + adds r6, r2, #0 + movs r1, #0x64 + bl Div + adds r0, r0, r6 + strb r0, [r4] + adds r0, r5, #0 + movs r1, #0x64 + bl Mod + adds r5, r0, #0 + movs r1, #0xa + bl Div + adds r0, r0, r6 + strb r0, [r4, #1] + adds r0, r5, #0 + movs r1, #0xa + bl Mod + adds r0, r0, r6 + strb r0, [r4, #2] + movs r0, #0xff + strb r0, [r4, #3] + adds r0, r4, #0 + pop {r4, r5, r6} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_02000940 +sub_02000940: @ 0x02000940 + push {lr} + sub sp, #4 + movs r0, #0 + str r0, [sp] + movs r1, #0xc0 + lsls r1, r1, #0x13 + ldr r2, =0x05006000 + mov r0, sp + bl CpuSet + bl sub_020087B4 + add sp, #4 + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02000964 +sub_02000964: @ 0x02000964 + push {r4, r5, lr} + adds r5, r0, #0 + adds r4, r1, #0 + adds r0, r4, #0 + movs r1, #0x64 + bl Div + adds r0, #0xa1 + strb r0, [r5] + adds r0, r4, #0 + movs r1, #0x64 + bl Mod + adds r4, r0, #0 + movs r1, #0xa + bl Div + adds r0, #0xa1 + strb r0, [r5, #1] + adds r0, r4, #0 + movs r1, #0xa + bl Mod + adds r0, #0xa1 + strb r0, [r5, #2] + movs r0, #0xff + strb r0, [r5, #3] + ldrb r0, [r5, #1] + cmp r0, #0xff + beq _020009BA + ldrb r0, [r5] + cmp r0, #0xa1 + bne _020009BA + movs r2, #0 + adds r1, r5, #0 +_020009AA: + strb r2, [r1] + adds r1, #1 + ldrb r0, [r1, #1] + cmp r0, #0xff + beq _020009BA + ldrb r0, [r1] + cmp r0, #0xa1 + beq _020009AA +_020009BA: + adds r0, r5, #0 + pop {r4, r5} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_020009C4 +sub_020009C4: @ 0x020009C4 + push {r4, r5, lr} + adds r4, r0, #0 + adds r5, r3, #0 + bl sub_02009164 + adds r0, r4, #0 + adds r1, r5, #0 + bl sub_02000484 + pop {r4, r5} + pop {r0} + bx r0 + + thumb_func_start sub_020009DC +sub_020009DC: @ 0x020009DC + push {r4, r5, r6, r7, lr} + sub sp, #0x20 + adds r6, r0, #0 + adds r5, r3, #0 + ldr r7, [sp, #0x34] + ldr r4, [sp, #0x38] + mov r3, sp + movs r0, #0 + strb r0, [r3] + mov r0, sp + strb r1, [r0, #1] + strb r2, [r0, #2] + strb r5, [r0, #3] + strb r7, [r0, #4] + mov r1, sp + ldr r0, =gUnknown_02020A44 + ldrh r0, [r0] + strh r0, [r1, #6] + movs r0, #0xf + strb r0, [r1, #8] + mov r0, sp + strb r4, [r0, #9] + ldrh r0, [r0, #6] + lsls r0, r0, #5 + ldr r1, =0x06004000 + adds r0, r0, r1 + str r0, [sp, #0xc] + cmp r4, #8 + bne _02000A30 + ldr r0, =gUnknown_020140CC + str r0, [sp, #0x10] + ldr r0, =gUnknown_02014E8C + b _02000A36 + .align 2, 0 + .pool +_02000A30: + ldr r0, =gUnknown_0201004C + str r0, [sp, #0x10] + ldr r0, =gUnknown_02013FCC +_02000A36: + str r0, [sp, #0x14] + adds r0, r6, #0 + mov r1, sp + bl sub_02008F6C + adds r4, r0, #0 + movs r1, #0xf + movs r2, #1 + bl sub_0200914C + adds r0, r4, #0 + movs r1, #0 + bl sub_020090B0 + ldr r1, =gUnknown_02020A44 + adds r0, r5, #0 + muls r0, r7, r0 + ldrh r2, [r1] + adds r0, r2, r0 + strh r0, [r1] + adds r0, r4, #0 + add sp, #0x20 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_02000A74 +sub_02000A74: @ 0x02000A74 + push {r4, r5, r6, r7, lr} + sub sp, #0x10 + adds r3, r0, #0 + adds r4, r1, #0 + adds r6, r2, #0 + movs r0, #1 + str r0, [sp] + movs r0, #8 + str r0, [sp, #4] + movs r0, #1 + adds r1, r3, #0 + adds r2, r4, #0 + movs r3, #7 + bl sub_020009DC + adds r7, r0, #0 + movs r1, #0 + bl sub_020090B0 + ldr r5, =gUnknown_02022EF4 + movs r0, #0x64 + adds r4, r6, #0 + muls r4, r0, r4 + ldr r0, [r5] + adds r0, r0, r4 + movs r1, #0x39 + movs r2, #0 + bl sub_0200C1B8 + adds r6, r0, #0 + ldr r0, [r5] + adds r0, r0, r4 + movs r1, #0x3a + movs r2, #0 + bl sub_0200C1B8 + adds r5, r0, #0 + adds r0, r6, #0 + add r1, sp, #8 + movs r2, #0x76 + bl sub_02000900 + add r0, sp, #8 + add r4, sp, #0xc + ldrb r0, [r0] + cmp r0, #0x76 + bne _02000AE0 + movs r1, #0xf9 + add r0, sp, #8 +_02000AD6: + strb r1, [r0] + adds r0, #1 + ldrb r2, [r0] + cmp r2, #0x76 + beq _02000AD6 +_02000AE0: + add r1, sp, #8 + movs r0, #0x73 + strb r0, [r1, #3] + cmp r6, #0 + bne _02000AEE + movs r0, #0x76 + strb r0, [r1, #2] +_02000AEE: + adds r0, r5, #0 + adds r1, r4, #0 + movs r2, #0x76 + bl sub_02000900 + ldrb r4, [r4] + cmp r4, #0x76 + bne _02000B0C + movs r1, #0xf9 + add r0, sp, #0xc +_02000B02: + strb r1, [r0] + adds r0, #1 + ldrb r2, [r0] + cmp r2, #0x76 + beq _02000B02 +_02000B0C: + cmp r5, #0 + bne _02000B16 + add r1, sp, #8 + movs r0, #0x76 + strb r0, [r1, #6] +_02000B16: + adds r0, r7, #0 + movs r1, #4 + movs r2, #0 + bl sub_02009164 + adds r0, r7, #0 + add r1, sp, #8 + bl sub_02000584 + adds r0, r7, #0 + add sp, #0x10 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_02000B38 +sub_02000B38: @ 0x02000B38 + push {r4, r5, lr} + adds r4, r0, #0 + ldr r0, [r4, #0x18] + cmp r0, #7 + beq _02000B46 + cmp r0, #0x14 + bne _02000BF0 +_02000B46: + ldr r5, [r4, #0x14] + ldrb r1, [r5, #3] + cmp r1, #7 + beq _02000B5A + movs r0, #0 + str r0, [r4, #0x18] + ldr r0, [r4, #0x1c] + adds r0, #1 + str r0, [r4, #0x1c] + b _02000B66 +_02000B5A: + cmp r0, #7 + bne _02000B62 + movs r0, #8 + b _02000BF2 +_02000B62: + movs r0, #0 + str r0, [r4, #0x18] +_02000B66: + ldr r1, [r4, #0x1c] + movs r0, #1 + ands r1, r0 + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + ldr r2, [r0, #0x38] + ldrh r3, [r5, #6] + lsls r0, r3, #2 + adds r0, r0, r2 + lsls r1, r1, #9 + ldr r0, [r0] + adds r0, r0, r1 + ldrh r2, [r5, #8] + lsls r1, r2, #5 + ldr r3, =0x06010000 + adds r1, r1, r3 + movs r2, #0x80 + lsls r2, r2, #1 + bl CpuSet + ldrb r1, [r5, #1] + ldrb r2, [r5, #2] + adds r0, r4, #0 + bl sub_02008D3C + ldr r1, =gUnknown_02021860 + ldr r2, =0x0000011B + adds r0, r1, r2 + ldrb r0, [r0] + ldrb r3, [r5] + cmp r0, r3 + bne _02000BF4 + adds r2, #6 + adds r0, r1, r2 + ldrb r3, [r0] + cmp r3, #4 + bne _02000BCC + rsbs r2, r3, #0 + adds r0, r4, #0 + movs r1, #0 + bl sub_02008D44 + b _02000BD6 + .align 2, 0 + .pool +_02000BCC: + ldrb r1, [r5, #1] + ldrb r2, [r5, #2] + adds r0, r4, #0 + bl sub_02008D3C +_02000BD6: + ldr r0, =gUnknown_02021860 + ldr r2, =0x00000121 + adds r1, r0, r2 + movs r0, #4 + ldrb r3, [r1] + eors r0, r3 + strb r0, [r1] + b _02000BF4 + .align 2, 0 + .pool +_02000BF0: + adds r0, #1 +_02000BF2: + str r0, [r4, #0x18] +_02000BF4: + pop {r4, r5} + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start sub_02000BFC +sub_02000BFC: @ 0x02000BFC + push {r4, r5, r6, r7, lr} + mov r7, sb + mov r6, r8 + push {r6, r7} + sub sp, #4 + movs r7, #0 + ldr r2, =gUnknown_02021860 + movs r0, #0x92 + lsls r0, r0, #1 + adds r0, r0, r2 + mov r8, r0 + mov r6, sp + ldr r1, =0x0000011B + adds r1, r1, r2 + mov sb, r1 +_02000C1A: + movs r0, #0x2c + muls r0, r7, r0 + adds r1, r0, r2 + adds r4, r1, #0 + adds r4, #0x22 + ldrb r5, [r4] + mov r3, r8 + ldrb r3, [r3] + cmp r5, r3 + bne _02000C90 + movs r0, #0 + strb r0, [r4] + ldr r5, [r1, #0x24] + adds r0, r5, #0 + movs r1, #0 + bl sub_020090B0 + ldrb r0, [r4] + cmp r0, #0 + bne _02000C5C + adds r0, r5, #0 + movs r1, #0 + movs r2, #2 + ldr r3, =gUnknown_0202004D + bl sub_020009C4 + b _02000C7E + .align 2, 0 + .pool +_02000C5C: + adds r0, #0xa1 + strb r0, [r6] + movs r0, #0xff + strb r0, [r6, #1] + movs r0, #0 + mov r1, sp + bl sub_02000650 + adds r0, r5, #0 + movs r1, #0 + movs r2, #2 + bl sub_02009164 + adds r0, r5, #0 + ldr r1, =gUnknown_0202004F + bl sub_02000484 +_02000C7E: + mov r5, r8 + ldrb r0, [r5] + subs r0, #1 + strb r0, [r5] + mov r0, sb + strb r7, [r0] + b _02000C96 + .align 2, 0 + .pool +_02000C90: + adds r7, #1 + cmp r7, #5 + ble _02000C1A +_02000C96: + add sp, #4 + pop {r3, r4} + mov r8, r3 + mov sb, r4 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + + thumb_func_start sub_02000CA4 +sub_02000CA4: @ 0x02000CA4 + push {r4, r5, r6, r7, lr} + mov r7, sb + mov r6, r8 + push {r6, r7} + adds r6, r0, #0 + adds r4, r1, #0 + adds r7, r2, #0 + mov r8, r3 + ldr r0, =gUnknown_02022EF4 + mov sb, r0 + movs r0, #0x64 + adds r5, r4, #0 + muls r5, r0, r5 + mov r1, sb + ldr r0, [r1] + adds r0, r0, r5 + movs r1, #0x41 + movs r2, #0 + bl sub_0200C1B8 + strh r0, [r6, #4] + lsls r0, r0, #0x10 + cmp r0, #0 + beq _02000D64 + lsls r0, r4, #4 + adds r0, #0xc0 + strh r0, [r6, #8] + strb r4, [r6] + strb r7, [r6, #1] + mov r2, r8 + strb r2, [r6, #2] + mov r1, sb + ldr r0, [r1] + adds r0, r0, r5 + movs r1, #0 + movs r2, #0 + bl sub_0200C1B8 + adds r1, r0, #0 + ldrh r0, [r6, #4] + bl sub_0200C318 + strh r0, [r6, #6] + ldr r2, =gUnknown_0201F9F4 + adds r0, r7, #0 + mov r1, r8 + bl sub_02008A10 + adds r4, r0, #0 + str r6, [r4, #0x14] + ldr r0, =sub_02000B38 + str r0, [r4, #0x10] + ldr r5, =gUnknown_020251E8 + ldr r0, [r5] + ldr r0, [r0, #0x3c] + ldrh r2, [r6, #4] + adds r0, r2, r0 + ldrb r1, [r0] + adds r0, r4, #0 + bl sub_02008D54 + ldrh r1, [r6, #8] + adds r0, r4, #0 + bl sub_02008D5C + ldr r0, [r5] + ldr r1, [r0, #0x38] + ldrh r2, [r6, #6] + lsls r0, r2, #2 + adds r0, r0, r1 + ldr r0, [r0] + movs r1, #0x80 + lsls r1, r1, #2 + adds r0, r0, r1 + ldrh r2, [r6, #8] + lsls r1, r2, #5 + ldr r2, =0x06010000 + adds r1, r1, r2 + movs r2, #0x80 + lsls r2, r2, #1 + bl CpuSet + str r4, [r6, #0xc] + ldrh r0, [r6, #4] + b _02000D66 + .align 2, 0 + .pool +_02000D64: + movs r0, #0 +_02000D66: + pop {r3, r4} + mov r8, r3 + mov sb, r4 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_02000D74 +sub_02000D74: @ 0x02000D74 + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #0x5c + adds r6, r0, #0 + mov r8, r1 + mov sl, r2 + ldrb r1, [r1, #2] + lsls r0, r1, #2 + ldr r4, =gUnknown_0201F9B0 + adds r5, r0, r4 + movs r0, #0x2c + mov r2, sl + muls r2, r0, r2 + adds r0, r2, #0 + adds r0, r0, r6 + mov sb, r0 + mov r3, r8 + ldrb r3, [r3] + lsls r2, r3, #3 + mov r0, r8 + ldrb r0, [r0, #1] + lsls r3, r0, #3 + adds r3, #2 + mov r0, sb + mov r1, sl + bl sub_02000CA4 + str r0, [sp, #0x54] + cmp r0, #0 + bne _02000DE0 + adds r5, r4, #0 + adds r5, #8 + mov r2, r8 + ldrb r1, [r2] + ldrb r2, [r2, #1] + ldrb r3, [r4, #8] + ldrb r0, [r5, #1] + str r0, [sp] + ldrb r5, [r5, #2] + lsls r0, r5, #1 + ldr r4, =0x06014000 + adds r0, r0, r4 + str r0, [sp, #4] + movs r0, #3 + bl sub_0200880C + b _02001236 + .align 2, 0 + .pool +_02000DE0: + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + mov r1, sl + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + bl sub_0200B7D0 + mov r3, sb + strb r0, [r3, #3] + mov r4, r8 + ldrb r1, [r4] + ldrb r2, [r4, #1] + ldrb r3, [r5] + ldrb r0, [r5, #1] + str r0, [sp] + ldrb r4, [r5, #2] + lsls r0, r4, #1 + ldr r4, =0x06014000 + adds r0, r0, r4 + str r0, [sp, #4] + movs r0, #3 + bl sub_0200880C + mov r0, sb + ldrb r0, [r0, #3] + cmp r0, #7 + beq _02000E40 + ldr r1, =0x0000011B + adds r0, r6, r1 + ldrb r0, [r0] + cmp r0, sl + bne _02000E7E + mov r2, r8 + ldrb r1, [r2] + ldrb r2, [r2, #1] + ldrb r3, [r5] + ldrb r0, [r5, #1] + str r0, [sp] + movs r0, #7 + b _02000E58 + .align 2, 0 + .pool +_02000E40: + ldr r3, =0x0000011B + adds r0, r6, r3 + ldrb r0, [r0] + cmp r0, sl + bne _02000E68 + mov r4, r8 + ldrb r1, [r4] + ldrb r2, [r4, #1] + ldrb r3, [r5] + ldrb r0, [r5, #1] + str r0, [sp] + movs r0, #9 +_02000E58: + str r0, [sp, #4] + movs r0, #3 + bl sub_02008894 + b _02000E7E + .align 2, 0 + .pool +_02000E68: + mov r0, r8 + ldrb r1, [r0] + ldrb r2, [r0, #1] + ldrb r3, [r5] + ldrb r0, [r5, #1] + str r0, [sp] + movs r0, #5 + str r0, [sp, #4] + movs r0, #3 + bl sub_02008894 +_02000E7E: + mov r2, r8 + ldrb r1, [r2] + adds r1, #4 + ldrb r2, [r2, #1] + adds r2, #1 + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + adds r0, #0x77 + ldrb r3, [r0] + movs r0, #2 + str r0, [sp] + movs r0, #8 + str r0, [sp, #4] + movs r0, #1 + bl sub_020009DC + mov r3, sb + str r0, [r3, #0x14] + ldr r4, =gUnknown_02022EF4 + movs r0, #0x64 + mov r1, sl + muls r1, r0, r1 + ldr r0, [r4] + adds r0, r0, r1 + movs r1, #2 + add r2, sp, #8 + bl sub_0200C1B8 + add r0, sp, #8 + bl sub_0200CE1C + lsls r0, r0, #0x10 + add r3, sp, #8 + add r7, sp, #0x20 + lsrs r5, r0, #0x10 + ldrb r0, [r3] + adds r1, r0, #0 + cmp r1, #0xfc + beq _02000F18 + movs r6, #0 + mov r4, sp + adds r4, r4, r5 + adds r4, #0x20 + mov ip, r4 + lsls r5, r5, #1 + str r5, [sp, #0x58] + cmp r1, #0xff + beq _02000EFC + ldr r5, =gUnknown_0201F6B0 +_02000EE0: + ldrb r1, [r3] + lsls r0, r1, #1 + adds r0, r0, r5 + ldrh r2, [r0] + adds r1, r7, r6 + lsrs r0, r2, #8 + strb r0, [r1] + strb r2, [r4, #1] + adds r3, #1 + adds r4, #1 + adds r6, #1 + ldrb r0, [r3] + cmp r0, #0xff + bne _02000EE0 +_02000EFC: + movs r0, #0xfe + mov r2, ip + strb r0, [r2] + ldr r3, [sp, #0x58] + adds r1, r3, r7 + movs r0, #0xff + strb r0, [r1, #1] + b _02000F6A + .align 2, 0 + .pool +_02000F18: + add r1, sp, #0x20 + strb r0, [r1] + mov r3, sp + adds r3, #9 + ldrb r0, [r3] + movs r2, #0x21 + add r2, sp + strb r0, [r2] + adds r3, #1 + subs r5, #2 + movs r6, #2 + ldrb r0, [r3] + cmp r0, #0xff + beq _02000F5C + ldr r4, =gUnknown_0201F4B0 + mov ip, r4 + adds r0, r5, #0 + add r0, sp + adds r0, #0x20 + adds r4, r0, #2 +_02000F40: + ldrb r1, [r3] + lsls r0, r1, #1 + add r0, ip + ldrh r2, [r0] + adds r1, r7, r6 + lsrs r0, r2, #8 + strb r0, [r1] + strb r2, [r4, #1] + adds r3, #1 + adds r4, #1 + adds r6, #1 + ldrb r0, [r3] + cmp r0, #0xff + bne _02000F40 +_02000F5C: + adds r1, r5, r7 + movs r0, #0xfe + strb r0, [r1, #2] + lsls r0, r5, #1 + adds r0, r0, r7 + movs r1, #0xff + strb r1, [r0, #3] +_02000F6A: + movs r0, #0x64 + mov r1, sl + muls r1, r0, r1 + ldr r2, =gUnknown_02022EF4 + ldr r0, [r2] + adds r0, r0, r1 + movs r1, #3 + add r2, sp, #8 + bl sub_0200C1B8 + cmp r0, #1 + beq _02000F94 + mov r3, sb + ldr r1, [r3, #0x14] + movs r0, #1 + b _02000F9A + .align 2, 0 + .pool +_02000F94: + mov r4, sb + ldr r1, [r4, #0x14] + movs r0, #2 +_02000F9A: + strb r0, [r1, #0x1d] + mov r1, sb + ldr r0, [r1, #0x14] + ldrb r1, [r0, #0x1d] + movs r2, #0 + bl sub_02009164 + mov r2, sb + ldr r0, [r2, #0x14] + add r1, sp, #0x20 + bl sub_02000584 + mov r3, sb + ldrb r0, [r3, #3] + cmp r0, #0 + beq _02000FBE + cmp r0, #6 + bne _02001048 +_02000FBE: + mov r4, r8 + ldrb r1, [r4] + adds r1, #6 + ldrb r2, [r4, #1] + adds r2, #3 + movs r0, #1 + str r0, [sp] + movs r0, #8 + str r0, [sp, #4] + movs r0, #1 + movs r3, #3 + bl sub_020009DC + adds r6, r0, #0 + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + mov r1, sl + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + movs r1, #0x38 + movs r2, #0 + bl sub_0200C1B8 + adds r5, r0, #0 + add r4, sp, #0x4c + movs r0, #0x60 + strb r0, [r4] + movs r0, #0xff + strb r0, [r4, #1] + adds r0, r6, #0 + movs r1, #0 + movs r2, #0 + bl sub_02009164 + adds r0, r6, #0 + adds r1, r4, #0 + bl sub_02000484 + adds r0, r5, #0 + adds r1, r4, #0 + movs r2, #0x76 + bl sub_02000900 + movs r1, #0 + ldrb r0, [r4] + cmp r0, #0x76 + bne _0200102A + adds r2, r4, #0 +_02001020: + adds r1, #1 + adds r0, r2, r1 + ldrb r0, [r0] + cmp r0, #0x76 + beq _02001020 +_0200102A: + adds r0, r4, r1 + ldrb r0, [r0] + cmp r0, #0xff + bne _02001034 + subs r1, #1 +_02001034: + adds r1, r4, r1 + adds r0, r6, #0 + bl sub_02000584 + mov r1, sb + str r6, [r1, #0x18] + b _0200107A + .align 2, 0 + .pool +_02001048: + movs r4, #0 +_0200104A: + mov r2, sb + ldrb r2, [r2, #3] + lsls r3, r2, #2 + ldr r0, =0x0000B05C + adds r3, r3, r0 + adds r3, r4, r3 + adds r1, r4, #5 + mov r2, r8 + ldrb r2, [r2] + adds r1, r2, r1 + mov r0, r8 + ldrb r2, [r0, #1] + adds r2, #3 + lsls r3, r3, #0x10 + lsrs r3, r3, #0x10 + movs r0, #0 + bl sub_020088E8 + adds r4, #1 + cmp r4, #3 + ble _0200104A + ldr r1, =gUnknown_02022C20 + movs r0, #1 + strb r0, [r1] +_0200107A: + ldr r1, [sp, #0x54] + cmp r1, #0x20 + beq _020010CE + cmp r1, #0x1d + beq _020010CE + mov r2, r8 + ldrb r4, [r2] + adds r4, #9 + ldrb r5, [r2, #1] + adds r5, #3 + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + mov r1, sl + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + bl sub_0200C254 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + cmp r0, #0 + beq _020010BC + cmp r0, #0xfe + beq _020010C0 + movs r3, #0 + b _020010C2 + .align 2, 0 + .pool +_020010BC: + movs r3, #0xf + b _020010C2 +_020010C0: + movs r3, #0x11 +_020010C2: + movs r0, #0 + adds r1, r4, #0 + adds r2, r5, #0 + bl sub_020088E8 + b _02001120 +_020010CE: + add r0, sp, #0x20 + ldr r1, [sp, #0x54] + bl sub_0200C378 + add r0, sp, #8 + add r1, sp, #0x20 + bl sub_0200CEA0 + cmp r0, #0 + beq _02001120 + mov r3, r8 + ldrb r4, [r3] + adds r4, #9 + ldrb r5, [r3, #1] + adds r5, #3 + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + mov r1, sl + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + bl sub_0200C254 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + cmp r0, #0 + beq _02001110 + cmp r0, #0xfe + beq _02001114 + movs r3, #0 + b _02001116 + .align 2, 0 + .pool +_02001110: + movs r3, #0xf + b _02001116 +_02001114: + movs r3, #0x11 +_02001116: + movs r0, #0 + adds r1, r4, #0 + adds r2, r5, #0 + bl sub_020088E8 +_02001120: + ldr r4, =gUnknown_02021860 + movs r1, #0x8c + lsls r1, r1, #1 + adds r0, r4, r1 + ldrb r0, [r0] + cmp r0, #0 + bne _02001178 + mov r2, r8 + ldrb r0, [r2] + adds r0, #5 + ldrb r1, [r2, #1] + adds r1, #5 + mov r2, sl + bl sub_02000A74 + mov r3, sb + str r0, [r3, #0x1c] + mov r0, r8 + ldrb r1, [r0] + adds r1, #2 + ldrb r2, [r0, #1] + adds r2, #4 + movs r0, #0 + mov r3, sl + bl sub_0200068C + movs r0, #0x2c + mov r1, sl + muls r1, r0, r1 + adds r0, r1, #0 + adds r0, r0, r4 + mov r3, r8 + ldrb r2, [r3] + adds r2, #2 + adds r1, r0, #0 + adds r1, #0x20 + strb r2, [r1] + ldrb r1, [r3, #1] + adds r1, #4 + adds r0, #0x21 + strb r1, [r0] + b _020011F2 + .align 2, 0 + .pool +_02001178: + mov r4, r8 + ldrb r0, [r4] + adds r0, #3 + mov r1, sb + adds r1, #0x20 + strb r0, [r1] + ldrb r0, [r4, #1] + adds r0, #4 + mov r2, sb + adds r2, #0x21 + strb r0, [r2] + mov r0, sl + adds r0, #5 + ldrb r1, [r1] + ldrb r2, [r2] + movs r3, #2 + str r3, [sp] + movs r3, #0x10 + str r3, [sp, #4] + movs r3, #6 + bl sub_020009DC + adds r4, r0, #0 + mov r0, sb + str r4, [r0, #0x24] + adds r0, r4, #0 + movs r1, #0 + bl sub_020090B0 + mov r0, sb + adds r0, #0x22 + ldrb r0, [r0] + cmp r0, #0 + bne _020011D0 + ldr r3, =gUnknown_0202004D + adds r0, r4, #0 + movs r1, #0 + movs r2, #2 + bl sub_020009C4 + b _020011F2 + .align 2, 0 + .pool +_020011D0: + add r1, sp, #0x4c + adds r0, #0xa1 + strb r0, [r1] + movs r0, #0xff + strb r0, [r1, #1] + movs r0, #0 + bl sub_02000650 + adds r0, r4, #0 + movs r1, #0 + movs r2, #2 + bl sub_02009164 + ldr r1, =gUnknown_0202004F + adds r0, r4, #0 + bl sub_02000484 +_020011F2: + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + mov r1, sl + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + movs r1, #0xc + movs r2, #0 + bl sub_0200C1B8 + cmp r0, #0 + beq _0200122A + mov r1, r8 + ldrb r1, [r1] + lsls r0, r1, #3 + adds r0, #0x18 + mov r2, r8 + ldrb r2, [r2, #1] + lsls r1, r2, #3 + adds r1, #0x15 + ldr r2, =gUnknown_0201F958 + bl sub_02008A10 + mov r3, sb + str r0, [r3, #0x28] + movs r1, #0xc + bl sub_02008D54 +_0200122A: + ldr r0, =gUnknown_02021860 + movs r4, #0x90 + lsls r4, r4, #1 + adds r0, r0, r4 + mov r1, sl + strb r1, [r0] +_02001236: + add sp, #0x5c + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02001258 +sub_02001258: @ 0x02001258 + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #0x5c + adds r6, r0, #0 + mov r8, r1 + mov sl, r2 + ldrb r1, [r1, #2] + lsls r0, r1, #2 + ldr r4, =gUnknown_0201F9B0 + adds r5, r0, r4 + movs r0, #0x2c + mov r2, sl + muls r2, r0, r2 + adds r0, r2, #0 + adds r0, r0, r6 + mov sb, r0 + mov r3, r8 + ldrb r3, [r3] + lsls r2, r3, #3 + subs r2, #1 + mov r0, r8 + ldrb r3, [r0, #1] + subs r3, #1 + lsls r3, r3, #3 + adds r3, #2 + mov r0, sb + mov r1, sl + bl sub_02000CA4 + str r0, [sp, #0x54] + cmp r0, #0 + bne _020012C8 + adds r5, r4, #0 + adds r5, #8 + mov r2, r8 + ldrb r1, [r2] + ldrb r2, [r2, #1] + ldrb r3, [r4, #8] + ldrb r0, [r5, #1] + str r0, [sp] + ldrb r5, [r5, #2] + lsls r0, r5, #1 + ldr r4, =0x06014000 + adds r0, r0, r4 + str r0, [sp, #4] + movs r0, #3 + bl sub_0200880C + b _02001714 + .align 2, 0 + .pool +_020012C8: + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + mov r1, sl + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + bl sub_0200B7D0 + mov r3, sb + strb r0, [r3, #3] + mov r4, r8 + ldrb r1, [r4] + ldrb r2, [r4, #1] + ldrb r3, [r5] + ldrb r0, [r5, #1] + str r0, [sp] + ldrb r4, [r5, #2] + lsls r0, r4, #1 + ldr r4, =0x06014000 + adds r0, r0, r4 + str r0, [sp, #4] + movs r0, #3 + bl sub_0200880C + mov r0, sb + ldrb r0, [r0, #3] + cmp r0, #7 + beq _02001328 + ldr r1, =0x0000011B + adds r0, r6, r1 + ldrb r0, [r0] + cmp r0, sl + bne _02001366 + mov r2, r8 + ldrb r1, [r2] + ldrb r2, [r2, #1] + ldrb r3, [r5] + ldrb r0, [r5, #1] + str r0, [sp] + movs r0, #7 + b _02001340 + .align 2, 0 + .pool +_02001328: + ldr r3, =0x0000011B + adds r0, r6, r3 + ldrb r0, [r0] + cmp r0, sl + bne _02001350 + mov r4, r8 + ldrb r1, [r4] + ldrb r2, [r4, #1] + ldrb r3, [r5] + ldrb r0, [r5, #1] + str r0, [sp] + movs r0, #9 +_02001340: + str r0, [sp, #4] + movs r0, #3 + bl sub_02008894 + b _02001366 + .align 2, 0 + .pool +_02001350: + mov r0, r8 + ldrb r1, [r0] + ldrb r2, [r0, #1] + ldrb r3, [r5] + ldrb r0, [r5, #1] + str r0, [sp] + movs r0, #5 + str r0, [sp, #4] + movs r0, #3 + bl sub_02008894 +_02001366: + mov r2, r8 + ldrb r1, [r2] + adds r1, #3 + ldrb r2, [r2, #1] + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + adds r0, #0x77 + ldrb r3, [r0] + movs r0, #2 + str r0, [sp] + movs r0, #8 + str r0, [sp, #4] + movs r0, #1 + bl sub_020009DC + mov r3, sb + str r0, [r3, #0x14] + ldr r4, =gUnknown_02022EF4 + movs r0, #0x64 + mov r1, sl + muls r1, r0, r1 + ldr r0, [r4] + adds r0, r0, r1 + movs r1, #2 + add r2, sp, #8 + bl sub_0200C1B8 + add r0, sp, #8 + bl sub_0200CE1C + lsls r0, r0, #0x10 + add r3, sp, #8 + add r7, sp, #0x20 + lsrs r5, r0, #0x10 + ldrb r0, [r3] + adds r1, r0, #0 + cmp r1, #0xfc + beq _02001400 + movs r6, #0 + mov r4, sp + adds r4, r4, r5 + adds r4, #0x20 + mov ip, r4 + lsls r5, r5, #1 + str r5, [sp, #0x58] + cmp r1, #0xff + beq _020013E2 + ldr r5, =gUnknown_0201F6B0 +_020013C6: + ldrb r1, [r3] + lsls r0, r1, #1 + adds r0, r0, r5 + ldrh r2, [r0] + adds r1, r7, r6 + lsrs r0, r2, #8 + strb r0, [r1] + strb r2, [r4, #1] + adds r3, #1 + adds r4, #1 + adds r6, #1 + ldrb r0, [r3] + cmp r0, #0xff + bne _020013C6 +_020013E2: + movs r0, #0xfe + mov r2, ip + strb r0, [r2] + ldr r3, [sp, #0x58] + adds r1, r3, r7 + movs r0, #0xff + strb r0, [r1, #1] + b _02001452 + .align 2, 0 + .pool +_02001400: + add r1, sp, #0x20 + strb r0, [r1] + mov r3, sp + adds r3, #9 + ldrb r0, [r3] + movs r2, #0x21 + add r2, sp + strb r0, [r2] + adds r3, #1 + subs r5, #2 + movs r6, #2 + ldrb r0, [r3] + cmp r0, #0xff + beq _02001444 + ldr r4, =gUnknown_0201F4B0 + mov ip, r4 + adds r0, r5, #0 + add r0, sp + adds r0, #0x20 + adds r4, r0, #2 +_02001428: + ldrb r1, [r3] + lsls r0, r1, #1 + add r0, ip + ldrh r2, [r0] + adds r1, r7, r6 + lsrs r0, r2, #8 + strb r0, [r1] + strb r2, [r4, #1] + adds r3, #1 + adds r4, #1 + adds r6, #1 + ldrb r0, [r3] + cmp r0, #0xff + bne _02001428 +_02001444: + adds r1, r5, r7 + movs r0, #0xfe + strb r0, [r1, #2] + lsls r0, r5, #1 + adds r0, r0, r7 + movs r1, #0xff + strb r1, [r0, #3] +_02001452: + movs r0, #0x64 + mov r1, sl + muls r1, r0, r1 + ldr r2, =gUnknown_02022EF4 + ldr r0, [r2] + adds r0, r0, r1 + movs r1, #3 + add r2, sp, #8 + bl sub_0200C1B8 + cmp r0, #1 + beq _0200147C + mov r3, sb + ldr r1, [r3, #0x14] + movs r0, #6 + b _02001482 + .align 2, 0 + .pool +_0200147C: + mov r4, sb + ldr r1, [r4, #0x14] + movs r0, #8 +_02001482: + strb r0, [r1, #0x1d] + mov r1, sb + ldr r0, [r1, #0x14] + ldrb r1, [r0, #0x1d] + movs r2, #0 + bl sub_02009164 + mov r2, sb + ldr r0, [r2, #0x14] + add r1, sp, #0x20 + bl sub_02000584 + mov r3, sb + ldrb r0, [r3, #3] + cmp r0, #0 + beq _020014A6 + cmp r0, #6 + bne _02001530 +_020014A6: + mov r4, r8 + ldrb r1, [r4] + adds r1, #6 + ldrb r2, [r4, #1] + adds r2, #2 + movs r0, #1 + str r0, [sp] + movs r0, #8 + str r0, [sp, #4] + movs r0, #1 + movs r3, #3 + bl sub_020009DC + adds r6, r0, #0 + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + mov r1, sl + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + movs r1, #0x38 + movs r2, #0 + bl sub_0200C1B8 + adds r5, r0, #0 + add r4, sp, #0x4c + movs r0, #0x60 + strb r0, [r4] + movs r0, #0xff + strb r0, [r4, #1] + adds r0, r6, #0 + movs r1, #0 + movs r2, #0 + bl sub_02009164 + adds r0, r6, #0 + adds r1, r4, #0 + bl sub_02000484 + adds r0, r5, #0 + adds r1, r4, #0 + movs r2, #0x76 + bl sub_02000900 + movs r1, #0 + ldrb r0, [r4] + cmp r0, #0x76 + bne _02001512 + adds r2, r4, #0 +_02001508: + adds r1, #1 + adds r0, r2, r1 + ldrb r0, [r0] + cmp r0, #0x76 + beq _02001508 +_02001512: + adds r0, r4, r1 + ldrb r0, [r0] + cmp r0, #0xff + bne _0200151C + subs r1, #1 +_0200151C: + adds r1, r4, r1 + adds r0, r6, #0 + bl sub_02000584 + mov r1, sb + str r6, [r1, #0x18] + b _0200155C + .align 2, 0 + .pool +_02001530: + movs r4, #0 +_02001532: + mov r2, sb + ldrb r2, [r2, #3] + lsls r3, r2, #2 + ldr r0, =0x0000B05C + adds r3, r3, r0 + adds r3, r4, r3 + adds r1, r4, #5 + mov r2, r8 + ldrb r2, [r2] + adds r1, r2, r1 + mov r0, r8 + ldrb r2, [r0, #1] + adds r2, #2 + lsls r3, r3, #0x10 + lsrs r3, r3, #0x10 + movs r0, #0 + bl sub_020088E8 + adds r4, #1 + cmp r4, #3 + ble _02001532 +_0200155C: + ldr r1, [sp, #0x54] + cmp r1, #0x20 + beq _020015AA + cmp r1, #0x1d + beq _020015AA + mov r2, r8 + ldrb r4, [r2] + adds r4, #9 + ldrb r5, [r2, #1] + adds r5, #2 + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + mov r1, sl + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + bl sub_0200C254 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + cmp r0, #0 + beq _02001598 + cmp r0, #0xfe + beq _0200159C + movs r3, #0 + b _0200159E + .align 2, 0 + .pool +_02001598: + movs r3, #0xf + b _0200159E +_0200159C: + movs r3, #0x11 +_0200159E: + movs r0, #0 + adds r1, r4, #0 + adds r2, r5, #0 + bl sub_020088E8 + b _020015FC +_020015AA: + add r0, sp, #0x20 + ldr r1, [sp, #0x54] + bl sub_0200C378 + add r0, sp, #8 + add r1, sp, #0x20 + bl sub_0200CEA0 + cmp r0, #0 + beq _020015FC + mov r3, r8 + ldrb r4, [r3] + adds r4, #9 + ldrb r5, [r3, #1] + adds r5, #2 + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + mov r1, sl + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + bl sub_0200C254 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + cmp r0, #0 + beq _020015EC + cmp r0, #0xfe + beq _020015F0 + movs r3, #0 + b _020015F2 + .align 2, 0 + .pool +_020015EC: + movs r3, #0xf + b _020015F2 +_020015F0: + movs r3, #0x11 +_020015F2: + movs r0, #0 + adds r1, r4, #0 + adds r2, r5, #0 + bl sub_020088E8 +_020015FC: + ldr r4, =gUnknown_02021860 + movs r1, #0x8c + lsls r1, r1, #1 + adds r0, r4, r1 + ldrb r0, [r0] + cmp r0, #0 + bne _02001654 + mov r2, r8 + ldrb r0, [r2] + adds r0, #0xd + ldrb r1, [r2, #1] + adds r1, #2 + mov r2, sl + bl sub_02000A74 + mov r3, sb + str r0, [r3, #0x1c] + mov r0, r8 + ldrb r1, [r0] + adds r1, #0xa + ldrb r2, [r0, #1] + adds r2, #1 + movs r0, #0 + mov r3, sl + bl sub_0200068C + movs r0, #0x2c + mov r1, sl + muls r1, r0, r1 + adds r0, r1, #0 + adds r0, r0, r4 + mov r3, r8 + ldrb r2, [r3] + adds r2, #0xa + adds r1, r0, #0 + adds r1, #0x20 + strb r2, [r1] + ldrb r1, [r3, #1] + adds r1, #1 + adds r0, #0x21 + strb r1, [r0] + b _020016CA + .align 2, 0 + .pool +_02001654: + mov r4, r8 + ldrb r0, [r4] + adds r0, #0xb + mov r1, sb + adds r1, #0x20 + strb r0, [r1] + ldrb r0, [r4, #1] + mov r2, sb + adds r2, #0x21 + strb r0, [r2] + mov r0, sl + adds r0, #5 + ldrb r1, [r1] + ldrb r2, [r2] + movs r3, #2 + str r3, [sp] + movs r3, #0x10 + str r3, [sp, #4] + movs r3, #6 + bl sub_020009DC + adds r4, r0, #0 + mov r0, sb + str r4, [r0, #0x24] + adds r0, r4, #0 + movs r1, #0 + bl sub_020090B0 + mov r0, sb + adds r0, #0x22 + ldrb r0, [r0] + cmp r0, #0 + bne _020016A8 + ldr r3, =gUnknown_0202004D + adds r0, r4, #0 + movs r1, #0 + movs r2, #2 + bl sub_020009C4 + b _020016CA + .align 2, 0 + .pool +_020016A8: + add r1, sp, #0x4c + adds r0, #0xa1 + strb r0, [r1] + movs r0, #0xff + strb r0, [r1, #1] + movs r0, #0 + bl sub_02000650 + adds r0, r4, #0 + movs r1, #0 + movs r2, #2 + bl sub_02009164 + ldr r1, =gUnknown_0202004F + adds r0, r4, #0 + bl sub_02000484 +_020016CA: + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + mov r1, sl + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + movs r1, #0xc + movs r2, #0 + bl sub_0200C1B8 + cmp r0, #0 + beq _02001702 + mov r1, r8 + ldrb r1, [r1] + lsls r0, r1, #3 + adds r0, #0x18 + mov r2, r8 + ldrb r2, [r2, #1] + lsls r1, r2, #3 + adds r1, #0xf + ldr r2, =gUnknown_0201F958 + bl sub_02008A10 + mov r3, sb + str r0, [r3, #0x28] + movs r1, #0xc + bl sub_02008D54 +_02001702: + ldr r0, =gUnknown_02021860 + movs r4, #0x90 + lsls r4, r4, #1 + adds r0, r0, r4 + mov r1, sl + strb r1, [r0] + ldr r1, =gUnknown_02022C20 + movs r0, #1 + strb r0, [r1] +_02001714: + add sp, #0x5c + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02001738 +sub_02001738: @ 0x02001738 + push {r4, r5, r6, lr} + sub sp, #0xc + adds r6, r0, #0 + ldr r0, =0x0000E001 + str r0, [sp] + movs r0, #0 + movs r1, #0x10 + movs r2, #0x18 + movs r3, #4 + bl sub_02000838 + ldr r1, =gUnknown_02022C20 + movs r0, #1 + strb r0, [r1, #2] + ldr r1, =gUnknown_0201F8B0 + movs r0, #0 + bl sub_02008F6C + ldr r4, =gUnknown_02021860 + movs r1, #0x84 + lsls r1, r1, #1 + adds r5, r4, r1 + str r0, [r5] + movs r1, #1 + movs r2, #8 + bl sub_0200914C + ldr r0, [r5] + ldr r1, =0x0000FFFF + bl sub_020090B0 + ldr r1, =0x00000123 + adds r0, r4, r1 + ldrb r0, [r0] + cmp r0, #0 + beq _020017D4 + cmp r6, #0 + beq _020017A4 + cmp r6, #1 + beq _020017C4 + b _020017DC + .align 2, 0 + .pool +_020017A4: + add r1, sp, #4 + adds r0, #0xa1 + strb r0, [r1] + movs r0, #0xff + strb r0, [r1, #1] + movs r0, #0 + bl sub_02000650 + ldr r0, [r5] + ldr r1, =gUnknown_0201FF54 + bl sub_02000484 + b _020017DC + .align 2, 0 + .pool +_020017C4: + ldr r0, [r5] + ldr r1, =gUnknown_02020056 + bl sub_02000484 + b _020017DC + .align 2, 0 + .pool +_020017D4: + ldr r0, [r5] + ldr r1, =gUnknown_0201FF6E + bl sub_02000484 +_020017DC: + add sp, #0xc + pop {r4, r5, r6} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_020017E8 +sub_020017E8: @ 0x020017E8 + push {r4, r5, r6, lr} + sub sp, #0xc + adds r6, r0, #0 + ldr r1, =gUnknown_02020A44 + movs r0, #0x80 + strh r0, [r1] + bl sub_02000940 + movs r1, #0x80 + lsls r1, r1, #0x13 + movs r2, #0xfa + lsls r2, r2, #5 + adds r0, r2, #0 + strh r0, [r1] + adds r1, #8 + ldr r2, =0x00001C06 + adds r0, r2, #0 + strh r0, [r1] + adds r1, #2 + adds r2, #0xfd + adds r0, r2, #0 + strh r0, [r1] + adds r1, #2 + ldr r2, =0x00001E08 + adds r0, r2, #0 + strh r0, [r1] + adds r1, #2 + adds r2, #0xfa + adds r0, r2, #0 + strh r0, [r1] + movs r2, #1 + rsbs r2, r2, #0 + movs r0, #3 + movs r1, #0 + bl sub_020089A4 + ldr r0, =gUnknown_0201B1A0 + movs r1, #0xa0 + lsls r1, r1, #0x13 + bl sub_020092C0 + ldr r0, =gUnknown_0201A8B4 + ldr r1, =0x06004000 + bl sub_020092C0 + ldr r0, =gUnknown_0201AD0C + movs r1, #0xc0 + lsls r1, r1, #0x13 + bl sub_020092C0 + ldr r0, =gUnknown_0201B0FC + ldr r1, =0x06008000 + bl sub_020092C0 + ldr r0, =gUnknown_0201B2F8 + ldr r1, =0x03001000 + bl sub_020092C0 + ldr r0, =gUnknown_0201D05C + ldr r1, =0x05000200 + bl sub_020092C0 + ldr r0, =gUnknown_0201C5A4 + ldr r1, =0x06010000 + bl sub_020092C0 + ldr r0, =gUnknown_02021860 + movs r1, #0x8c + lsls r1, r1, #1 + adds r0, r0, r1 + ldrb r0, [r0] + adds r5, r0, #0 + cmp r0, #1 + beq _02001904 + cmp r0, #1 + bgt _020018C8 + cmp r0, #0 + beq _020018CE + b _0200191C + .align 2, 0 + .pool +_020018C8: + cmp r0, #2 + beq _020018D8 + b _0200191C +_020018CE: + movs r0, #2 + str r0, [sp] + movs r0, #0x18 + str r0, [sp, #4] + b _020018F2 +_020018D8: + str r5, [sp] + movs r4, #0x18 + str r4, [sp, #4] + movs r0, #0x10 + str r0, [sp, #8] + movs r0, #1 + movs r1, #0xc + movs r2, #0x14 + movs r3, #6 + bl sub_02008948 + str r5, [sp] + str r4, [sp, #4] +_020018F2: + movs r0, #0x12 + str r0, [sp, #8] + movs r0, #1 + movs r1, #0 + movs r2, #0x14 + movs r3, #6 + bl sub_02008948 + b _0200191C +_02001904: + movs r0, #2 + str r0, [sp] + movs r0, #0x18 + str r0, [sp, #4] + movs r0, #0x12 + str r0, [sp, #8] + movs r0, #1 + movs r1, #0xc + movs r2, #0x14 + movs r3, #6 + bl sub_02008948 +_0200191C: + ldr r1, =gUnknown_02022C20 + movs r0, #1 + strb r0, [r1, #1] + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + ldr r0, [r0, #0x40] + ldr r1, =0x040000D4 + ldr r0, [r0] + str r0, [r1] + ldr r0, =0x05000200 + str r0, [r1, #4] + ldr r0, =0x80000030 + str r0, [r1, #8] + ldr r0, [r1, #8] + ldr r0, =gUnknown_0201B430 + ldr r1, =0x06014000 + bl sub_020092C0 + movs r2, #0x8d + lsls r2, r2, #1 + adds r0, r6, r2 + ldrb r0, [r0] + ldr r5, =gUnknown_0201F9D4 + cmp r0, #0 + bne _02001950 + ldr r5, =gUnknown_0201F9BC +_02001950: + movs r4, #0 +_02001952: + ldrb r0, [r5, #2] + cmp r0, #0 + bne _02001988 + adds r0, r6, #0 + adds r1, r5, #0 + adds r2, r4, #0 + bl sub_02000D74 + b _02001992 + .align 2, 0 + .pool +_02001988: + adds r0, r6, #0 + adds r1, r5, #0 + adds r2, r4, #0 + bl sub_02001258 +_02001992: + adds r4, #1 + adds r5, #4 + cmp r4, #5 + ble _02001952 + ldr r1, =gUnknown_02022C20 + movs r0, #1 + strb r0, [r1] + strb r0, [r1, #3] + movs r0, #0 + bl sub_02001738 + add sp, #0xc + pop {r4, r5, r6} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_020019B4 +sub_020019B4: @ 0x020019B4 + push {r4, r5, r6, r7, lr} + mov r7, r8 + push {r7} + sub sp, #0x20 + adds r7, r0, #0 + adds r5, r1, #0 + ldr r6, =gUnknown_02021860 + movs r0, #0x8a + lsls r0, r0, #1 + adds r4, r6, r0 + ldr r0, [r4] + cmp r0, #0 + beq _020019D6 + bl sub_02008CEC + movs r0, #0 + str r0, [r4] +_020019D6: + movs r0, #8 + str r0, [sp] + movs r1, #0 + mov r8, r1 + str r1, [sp, #4] + movs r0, #2 + movs r2, #0xc + movs r3, #0x1e + bl sub_02008904 + ldr r0, =0x0000E001 + str r0, [sp] + movs r0, #3 + movs r1, #0xe + movs r2, #0x18 + movs r3, #6 + bl sub_02000838 + ldr r1, =gUnknown_0201F8F0 + movs r0, #0 + bl sub_02008F6C + movs r1, #0x88 + lsls r1, r1, #1 + adds r4, r6, r1 + str r0, [r4] + movs r1, #1 + movs r2, #8 + bl sub_0200914C + ldr r0, [r4] + ldr r1, =0x0000FFFF + bl sub_020090B0 + ldr r1, =gUnknown_02022C20 + movs r0, #1 + strb r0, [r1, #2] + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + adds r1, r7, #0 + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + movs r1, #2 + add r2, sp, #8 + bl sub_0200C1B8 + movs r0, #4 + add r1, sp, #8 + bl sub_02000650 + movs r0, #1 + bl sub_02009344 + ldr r0, [r4] + ldr r2, =gUnknown_0201FEC4 + lsls r1, r5, #2 + adds r1, r1, r2 + ldr r1, [r1] + bl sub_02000484 + movs r0, #6 + str r0, [sp] + mov r0, r8 + str r0, [sp, #4] + movs r0, #2 + movs r1, #3 + movs r2, #0xe + movs r3, #0x18 + bl sub_02008904 + add sp, #0x20 + pop {r3} + mov r8, r3 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02001A8C +sub_02001A8C: @ 0x02001A8C + push {r4, r5, r6, r7, lr} + mov r7, sb + mov r6, r8 + push {r6, r7} + sub sp, #0x18 + mov r8, r0 + movs r5, #0 + movs r0, #1 + mov sb, r0 +_02001A9E: + cmp r5, #4 + bls _02001AA4 + b _02001EE6 +_02001AA4: + lsls r0, r5, #2 + ldr r1, =_02001AB4 + adds r0, r0, r1 + ldr r0, [r0] + mov pc, r0 + .align 2, 0 + .pool +_02001AB4: @ jump table + .4byte _02001AC8 @ case 0 + .4byte _02001C14 @ case 1 + .4byte _02001CDC @ case 2 + .4byte _02001D18 @ case 3 + .4byte _02001E90 @ case 4 +_02001AC8: + ldr r7, =gUnknown_02021860 + movs r1, #0x84 + lsls r1, r1, #1 + adds r5, r7, r1 + ldr r0, [r5] + ldr r6, =0x0000FFFF + adds r1, r6, #0 + bl sub_020090B0 + ldr r0, [r5] + bl sub_020091B0 + ldr r4, =0x0000E001 + str r4, [sp] + movs r0, #0 + movs r1, #0x10 + movs r2, #0x14 + movs r3, #4 + bl sub_02000838 + str r4, [sp] + movs r0, #0x14 + movs r1, #0xc + movs r2, #0xa + movs r3, #8 + bl sub_02000838 + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + mov r1, r8 + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + movs r1, #2 + add r2, sp, #8 + bl sub_0200C1B8 + movs r0, #4 + add r1, sp, #8 + bl sub_02000650 + ldr r0, [r5] + movs r1, #0 + movs r2, #0 + bl sub_02009164 + ldr r0, [r5] + ldr r1, =gUnknown_0201FF87 + bl sub_02000484 + ldr r1, =gUnknown_0201F8D0 + movs r0, #2 + bl sub_02008F6C + movs r2, #0x86 + lsls r2, r2, #1 + adds r4, r7, r2 + str r0, [r4] + movs r1, #1 + movs r2, #8 + bl sub_0200914C + ldr r0, [r4] + bl sub_020091B0 + ldr r0, [r4] + adds r1, r6, #0 + bl sub_020090B0 + ldr r3, =0x00000125 + adds r0, r7, r3 + ldrb r0, [r0] + cmp r0, #0 + bne _02001B8C + ldr r0, [r4] + ldr r3, =gUnknown_0201FF98 + movs r1, #0 + movs r2, #0 + bl sub_020009C4 + b _02001B98 + .align 2, 0 + .pool +_02001B8C: + ldr r0, [r4] + ldr r3, =gUnknown_0201FF9F + movs r1, #0 + movs r2, #0 + bl sub_020009C4 +_02001B98: + ldr r5, =gUnknown_02021860 + movs r0, #0x86 + lsls r0, r0, #1 + adds r4, r5, r0 + ldr r0, [r4] + ldr r3, =gUnknown_0201FFA8 + movs r1, #0 + movs r2, #0x10 + bl sub_020009C4 + ldr r0, [r4] + ldr r3, =gUnknown_0201FFB0 + movs r1, #0 + movs r2, #0x20 + bl sub_020009C4 + ldr r2, =gUnknown_0201F910 + movs r0, #0 + movs r1, #0 + bl sub_02008A10 + movs r1, #0x8a + lsls r1, r1, #1 + adds r4, r5, r1 + str r0, [r4] + movs r1, #5 + bl sub_02008D54 + ldr r2, =0x00000119 + adds r1, r5, r2 + movs r0, #0 + strb r0, [r1] + ldr r0, [r4] + movs r1, #0xa8 + movs r2, #0x68 + bl sub_02008D3C + ldr r1, =gUnknown_02022C20 + movs r0, #1 + strb r0, [r1, #2] + bl sub_02000794 + cmp r0, #0 + beq _02001BF4 + bl sub_020007AC +_02001BF4: + movs r5, #1 + b _02001EE6 + .align 2, 0 + .pool +_02001C14: + movs r0, #1 + bl sub_02008600 + ldr r0, =gUnknown_02022EB0 + ldrh r4, [r0] + movs r0, #2 + ands r0, r4 + cmp r0, #0 + beq _02001C28 + movs r5, #2 +_02001C28: + movs r2, #1 + ands r2, r4 + cmp r2, #0 + beq _02001C58 + ldr r0, =gUnknown_02021860 + ldr r3, =0x00000119 + adds r0, r0, r3 + ldrb r0, [r0] + movs r5, #3 + cmp r0, #0 + bne _02001C40 + b _02001EE6 +_02001C40: + movs r5, #2 + cmp r0, #1 + beq _02001C48 + b _02001EE6 +_02001C48: + movs r5, #4 + b _02001EE6 + .align 2, 0 + .pool +_02001C58: + ldr r0, =gUnknown_02022EB4 + ldrh r4, [r0] + movs r0, #0x80 + ands r0, r4 + cmp r0, #0 + beq _02001C8C + ldr r0, =gUnknown_02021860 + ldr r3, =0x00000119 + adds r1, r0, r3 + ldrb r0, [r1] + cmp r0, #2 + beq _02001C84 + adds r0, #1 + strb r0, [r1] + b _02001C86 + .align 2, 0 + .pool +_02001C84: + strb r2, [r1] +_02001C86: + movs r0, #0 + bl sub_02009344 +_02001C8C: + movs r0, #0x40 + ands r4, r0 + cmp r4, #0 + beq _02001CB6 + ldr r0, =gUnknown_02021860 + ldr r2, =0x00000119 + adds r1, r0, r2 + ldrb r0, [r1] + cmp r0, #0 + beq _02001CAC + subs r0, #1 + b _02001CAE + .align 2, 0 + .pool +_02001CAC: + movs r0, #2 +_02001CAE: + strb r0, [r1] + movs r0, #0 + bl sub_02009344 +_02001CB6: + ldr r1, =gUnknown_02021860 + movs r3, #0x8a + lsls r3, r3, #1 + adds r0, r1, r3 + ldr r0, [r0] + ldr r2, =0x00000119 + adds r1, r1, r2 + ldrb r1, [r1] + lsls r2, r1, #4 + adds r2, #0x68 + movs r1, #0xa8 + bl sub_02008D3C + b _02001EE6 + .align 2, 0 + .pool +_02001CDC: + movs r0, #0 + bl sub_02009344 + ldr r0, =gUnknown_02021860 + movs r3, #0x8a + lsls r3, r3, #1 + adds r4, r0, r3 + ldr r0, [r4] + cmp r0, #0 + beq _02001CF8 + bl sub_02008CEC + movs r0, #0 + str r0, [r4] +_02001CF8: + movs r0, #8 + str r0, [sp] + movs r0, #0 + str r0, [sp, #4] + movs r0, #2 + movs r1, #0x14 + movs r2, #0xc + movs r3, #0xa + bl sub_02008904 + movs r0, #0 + bl sub_02001738 + b _02001EEE + .align 2, 0 + .pool +_02001D18: + bl sub_020063FC + adds r4, r0, #0 + ldr r0, =0x0000FFFF + ands r0, r4 + cmp r0, #1 + bne _02001D44 + movs r0, #1 + bl sub_02009344 + ldr r0, =gUnknown_02021860 + movs r1, #0x91 + lsls r1, r1, #1 + adds r0, r0, r1 + ldrb r0, [r0] + movs r1, #0 + b _02001E1C + .align 2, 0 + .pool +_02001D44: + cmp r0, #2 + bne _02001D78 + movs r0, #1 + bl sub_02009344 + asrs r0, r4, #0x10 + lsls r1, r0, #1 + adds r1, r1, r0 + lsls r1, r1, #2 + ldr r0, =gUnknown_0202517C + adds r1, r1, r0 + movs r0, #0 + bl sub_02000650 + ldr r0, =gUnknown_02021860 + movs r2, #0x91 + lsls r2, r2, #1 + adds r0, r0, r2 + ldrb r0, [r0] + movs r1, #1 + b _02001E1C + .align 2, 0 + .pool +_02001D78: + cmp r0, #4 + bne _02001DAC + movs r0, #1 + bl sub_02009344 + asrs r0, r4, #0x10 + lsls r1, r0, #1 + adds r1, r1, r0 + lsls r1, r1, #2 + ldr r0, =gUnknown_0202517C + adds r1, r1, r0 + movs r0, #0 + bl sub_02000650 + ldr r0, =gUnknown_02021860 + movs r3, #0x91 + lsls r3, r3, #1 + adds r0, r0, r3 + ldrb r0, [r0] + movs r1, #2 + b _02001E1C + .align 2, 0 + .pool +_02001DAC: + cmp r0, #3 + bne _02001DE0 + movs r0, #1 + bl sub_02009344 + asrs r0, r4, #0x10 + lsls r1, r0, #1 + adds r1, r1, r0 + lsls r1, r1, #2 + ldr r0, =gUnknown_0202517C + adds r1, r1, r0 + movs r0, #0 + bl sub_02000650 + ldr r0, =gUnknown_02021860 + movs r1, #0x91 + lsls r1, r1, #1 + adds r0, r0, r1 + ldrb r0, [r0] + movs r1, #3 + b _02001E1C + .align 2, 0 + .pool +_02001DE0: + ldr r4, =gUnknown_02021860 + ldr r2, =0x0000011B + adds r5, r4, r2 + ldrb r0, [r5] + bl sub_0200646C + cmp r0, #1 + bne _02001E04 + movs r0, #1 + bl sub_02009344 + ldrb r0, [r5] + movs r1, #0xa + b _02001E1C + .align 2, 0 + .pool +_02001E04: + movs r3, #0x91 + lsls r3, r3, #1 + adds r0, r4, r3 + ldrb r0, [r0] + ldrb r1, [r5] + cmp r0, r1 + bne _02001E24 +_02001E12: + movs r0, #1 + bl sub_02009344 + ldrb r0, [r5] + movs r1, #0xb +_02001E1C: + bl sub_020019B4 +_02001E20: + movs r5, #2 + b _02001EE6 +_02001E24: + ldr r4, =gUnknown_02024960 + ldr r0, [r4, #4] + lsls r0, r0, #8 + lsrs r0, r0, #8 + ldrb r1, [r5] + bl sub_020064BC + cmp r0, #1 + beq _02001E74 + cmp r0, #1 + bgt _02001E44 + cmp r0, #0 + beq _02001E4E + b _02001E20 + .align 2, 0 + .pool +_02001E44: + cmp r0, #2 + beq _02001E12 + cmp r0, #3 + beq _02001E80 + b _02001E20 +_02001E4E: + movs r0, #0 + bl sub_02009344 + ldrb r2, [r5] + ldr r3, =0x0000087E + adds r0, r4, r3 + ldrb r1, [r0] + strb r2, [r0] + ldr r0, =0x0000087B + adds r1, r4, r0 + ldrb r0, [r1] + movs r0, #2 + strb r0, [r1] + subs r0, #3 + b _02001EF0 + .align 2, 0 + .pool +_02001E74: + movs r0, #1 + bl sub_02009344 + ldrb r0, [r5] + movs r1, #0xd + b _02001E1C +_02001E80: + movs r0, #1 + bl sub_02009344 + ldrb r0, [r5] + movs r1, #0xc + bl sub_020019B4 + b _02001E20 +_02001E90: + movs r0, #0 + bl sub_02009344 + bl sub_020007F0 + ldr r5, =gUnknown_02021860 + ldr r1, =0x0000011B + adds r4, r5, r1 + ldrb r0, [r4] + bl sub_020044F0 + strb r0, [r4] + ldrb r4, [r4] + mov r8, r4 + movs r2, #0x8d + lsls r2, r2, #1 + adds r0, r5, r2 + ldrb r0, [r0] + cmp r0, #1 + bne _02001EDE + mov r0, r8 + cmp r0, #0 + bne _02001ED0 + movs r3, #0x8f + lsls r3, r3, #1 + adds r1, r5, r3 + movs r0, #2 + b _02001EDC + .align 2, 0 + .pool +_02001ED0: + cmp r0, #1 + bne _02001EDE + movs r0, #0x8f + lsls r0, r0, #1 + adds r1, r5, r0 + movs r0, #4 +_02001EDC: + strb r0, [r1] +_02001EDE: + ldr r0, =gUnknown_02021860 + bl sub_020017E8 + movs r5, #0 +_02001EE6: + mov r1, sb + cmp r1, #0 + beq _02001EEE + b _02001A9E +_02001EEE: + movs r0, #0 +_02001EF0: + add sp, #0x18 + pop {r3, r4} + mov r8, r3 + mov sb, r4 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_02001F04 +sub_02001F04: @ 0x02001F04 + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #0x24 + str r0, [sp, #0x1c] + movs r0, #0x2c + ldr r2, [sp, #0x1c] + adds r1, r2, #0 + muls r1, r0, r1 + ldr r0, =gUnknown_02021860 + adds r1, r1, r0 + str r1, [sp, #0x20] + movs r4, #0 +_02001F22: + cmp r4, #4 + bls _02001F28 + b _020023C6 +_02001F28: + lsls r0, r4, #2 + ldr r1, =_02001F3C + adds r0, r0, r1 + ldr r0, [r0] + mov pc, r0 + .align 2, 0 + .pool +_02001F3C: @ jump table + .4byte _02001F50 @ case 0 + .4byte _020020A0 @ case 1 + .4byte _02002164 @ case 2 + .4byte _020021A0 @ case 3 + .4byte _0200235C @ case 4 +_02001F50: + ldr r7, =gUnknown_02021860 + movs r3, #0x84 + lsls r3, r3, #1 + adds r5, r7, r3 + ldr r0, [r5] + ldr r6, =0x0000FFFF + adds r1, r6, #0 + bl sub_020090B0 + ldr r0, [r5] + bl sub_020091B0 + ldr r4, =0x0000E001 + str r4, [sp] + movs r0, #0 + movs r1, #0x10 + movs r2, #0x14 + movs r3, #4 + bl sub_02000838 + str r4, [sp] + movs r0, #0x14 + movs r1, #0xc + movs r2, #0xa + movs r3, #8 + bl sub_02000838 + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + ldr r3, [sp, #0x1c] + adds r1, r3, #0 + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + movs r1, #2 + add r2, sp, #8 + bl sub_0200C1B8 + movs r0, #4 + add r1, sp, #8 + bl sub_02000650 + ldr r0, [r5] + movs r1, #0 + movs r2, #0 + bl sub_02009164 + ldr r0, [r5] + ldr r1, =gUnknown_0201FF87 + bl sub_02000484 + ldr r1, =gUnknown_0201F8D0 + movs r0, #2 + bl sub_02008F6C + movs r1, #0x86 + lsls r1, r1, #1 + adds r5, r7, r1 + str r0, [r5] + movs r1, #1 + movs r2, #8 + bl sub_0200914C + ldr r0, [r5] + bl sub_020091B0 + ldr r0, [r5] + adds r1, r6, #0 + bl sub_020090B0 + ldr r0, [sp, #0x20] + adds r0, #0x22 + ldrb r0, [r0] + cmp r0, #0 + bne _02002010 + ldr r0, [r5] + ldr r3, =gUnknown_0201FFB7 + movs r1, #0 + movs r2, #0 + bl sub_020009C4 + b _0200201C + .align 2, 0 + .pool +_02002010: + ldr r0, [r5] + ldr r3, =gUnknown_0201FFBE + movs r1, #0 + movs r2, #0 + bl sub_020009C4 +_0200201C: + ldr r5, =gUnknown_02021860 + movs r2, #0x86 + lsls r2, r2, #1 + adds r4, r5, r2 + ldr r0, [r4] + ldr r3, =gUnknown_0201FFA8 + movs r1, #0 + movs r2, #0x10 + bl sub_020009C4 + ldr r0, [r4] + ldr r3, =gUnknown_0201FFB0 + movs r1, #0 + movs r2, #0x20 + bl sub_020009C4 + ldr r2, =gUnknown_0201F910 + movs r0, #0 + movs r1, #0 + bl sub_02008A10 + movs r3, #0x8a + lsls r3, r3, #1 + adds r4, r5, r3 + str r0, [r4] + movs r1, #5 + bl sub_02008D54 + ldr r0, =0x00000119 + adds r1, r5, r0 + movs r0, #0 + strb r0, [r1] + ldr r0, [r4] + movs r1, #0xa8 + movs r2, #0x68 + bl sub_02008D3C + ldr r1, =gUnknown_02022C20 + movs r0, #1 + strb r0, [r1, #2] + bl sub_02000794 + cmp r0, #0 + beq _02002098 + bl sub_020007AC + b _020021C6 + .align 2, 0 + .pool +_02002098: + movs r0, #0 + bl sub_02009344 + b _020021C6 +_020020A0: + movs r0, #1 + bl sub_02008600 + ldr r0, =gUnknown_02022EB4 + ldrh r1, [r0] + movs r3, #2 + adds r0, r1, #0 + ands r0, r3 + cmp r0, #0 + beq _020020B6 + movs r4, #2 +_020020B6: + movs r2, #1 + ands r2, r1 + cmp r2, #0 + beq _020020E8 + ldr r0, =gUnknown_02021860 + ldr r1, =0x00000119 + adds r0, r0, r1 + ldrb r0, [r0] + movs r4, #3 + cmp r0, #0 + bne _020020CE + b _020023C6 +_020020CE: + movs r4, #2 + cmp r0, #1 + beq _020020D6 + b _020023C6 +_020020D6: + movs r4, #4 + b _020023C6 + .align 2, 0 + .pool +_020020E8: + movs r0, #0x80 + ands r0, r1 + cmp r0, #0 + beq _02002110 + ldr r0, =gUnknown_02021860 + ldr r3, =0x00000119 + adds r1, r0, r3 + ldrb r0, [r1] + cmp r0, #2 + beq _0200210C + adds r0, #1 + strb r0, [r1] + b _02002136 + .align 2, 0 + .pool +_0200210C: + strb r2, [r1] + b _02002136 +_02002110: + movs r0, #0x40 + ands r1, r0 + cmp r1, #0 + beq _0200213E + ldr r0, =gUnknown_02021860 + ldr r2, =0x00000119 + adds r1, r0, r2 + ldrb r0, [r1] + cmp r0, #0 + beq _02002134 + subs r0, #1 + strb r0, [r1] + b _02002136 + .align 2, 0 + .pool +_02002134: + strb r3, [r1] +_02002136: + movs r0, #0 + bl sub_02009344 + b _020023C6 +_0200213E: + ldr r1, =gUnknown_02021860 + movs r3, #0x8a + lsls r3, r3, #1 + adds r0, r1, r3 + ldr r0, [r0] + ldr r2, =0x00000119 + adds r1, r1, r2 + ldrb r1, [r1] + lsls r2, r1, #4 + adds r2, #0x68 + movs r1, #0xa8 + bl sub_02008D3C + b _020023C6 + .align 2, 0 + .pool +_02002164: + movs r0, #0 + bl sub_02009344 + ldr r0, =gUnknown_02021860 + movs r3, #0x8a + lsls r3, r3, #1 + adds r4, r0, r3 + ldr r0, [r4] + cmp r0, #0 + beq _02002180 + bl sub_02008CEC + movs r0, #0 + str r0, [r4] +_02002180: + movs r0, #8 + str r0, [sp] + movs r0, #0 + str r0, [sp, #4] + movs r0, #2 + movs r1, #0x14 + movs r2, #0xc + movs r3, #0xa + bl sub_02008904 + movs r0, #0 + bl sub_02001738 + b _020023CE + .align 2, 0 + .pool +_020021A0: + ldr r0, [sp, #0x20] + adds r0, #0x22 + ldrb r1, [r0] + adds r7, r0, #0 + cmp r1, #0 + bne _02002268 + ldr r0, =gUnknown_02021860 + movs r1, #0x92 + lsls r1, r1, #1 + adds r4, r0, r1 + ldr r2, =0x00000123 + adds r0, r0, r2 + ldrb r3, [r4] + ldrb r0, [r0] + cmp r3, r0 + bne _020021D4 + movs r0, #1 + bl sub_02009344 +_020021C6: + movs r4, #1 + b _020023C6 + .align 2, 0 + .pool +_020021D4: + movs r0, #0 + bl sub_02009344 + ldrb r0, [r4] + adds r0, #1 + strb r0, [r4] + movs r5, #0xff + strb r0, [r7] + ldr r0, [sp, #0x20] + ldr r4, [r0, #0x24] + adds r0, r4, #0 + movs r1, #0 + bl sub_020090B0 + ldrb r0, [r7] + cmp r0, #0 + bne _02002208 + ldr r3, =gUnknown_0202004D + adds r0, r4, #0 + movs r1, #0 + movs r2, #2 + bl sub_020009C4 + b _0200222C + .align 2, 0 + .pool +_02002208: + add r1, sp, #0x18 + adds r0, #0xa1 + strb r0, [r1] + ldrb r0, [r1, #1] + orrs r0, r5 + strb r0, [r1, #1] + movs r0, #0 + bl sub_02000650 + adds r0, r4, #0 + movs r1, #0 + movs r2, #2 + bl sub_02009164 + ldr r1, =gUnknown_0202004F + adds r0, r4, #0 + bl sub_02000484 +_0200222C: + ldr r0, =0x04000154 + movs r1, #0x80 + lsls r1, r1, #0x11 + str r1, [r0] + ldr r1, =gUnknown_02021860 + movs r2, #0x92 + lsls r2, r2, #1 + adds r0, r1, r2 + ldr r3, =0x00000123 + adds r2, r1, r3 + ldrb r0, [r0] + ldrb r2, [r2] + cmp r0, r2 + beq _0200224A + b _0200234C +_0200224A: + ldr r0, =0x0000011B + adds r1, r1, r0 + movs r0, #6 + strb r0, [r1] + b _0200234C + .align 2, 0 + .pool +_02002268: + movs r1, #0 + mov r8, r1 + ldr r2, =gUnknown_02021860 + mov sb, r2 + movs r3, #0x24 + add r3, sb + mov sl, r3 + add r6, sp, #0x18 +_02002278: + movs r0, #0x2c + mov r1, r8 + muls r1, r0, r1 + mov r2, sb + adds r0, r1, r2 + adds r4, r0, #0 + adds r4, #0x22 + ldrb r0, [r4] + ldrb r3, [r7] + cmp r0, r3 + bls _020022DE + subs r0, #1 + strb r0, [r4] + mov r2, sl + adds r0, r1, r2 + ldr r5, [r0] + adds r0, r5, #0 + movs r1, #0 + bl sub_020090B0 + ldrb r0, [r4] + cmp r0, #0 + bne _020022BC + adds r0, r5, #0 + movs r1, #0 + movs r2, #2 + ldr r3, =gUnknown_0202004D + bl sub_020009C4 + b _020022DE + .align 2, 0 + .pool +_020022BC: + adds r0, #0xa1 + strb r0, [r6] + movs r0, #0xff + strb r0, [r6, #1] + movs r0, #0 + adds r1, r6, #0 + bl sub_02000650 + adds r0, r5, #0 + movs r1, #0 + movs r2, #2 + bl sub_02009164 + adds r0, r5, #0 + ldr r1, =gUnknown_0202004F + bl sub_02000484 +_020022DE: + movs r3, #1 + add r8, r3 + mov r0, r8 + cmp r0, #5 + ble _02002278 + movs r0, #0 + strb r0, [r7] + ldr r1, [sp, #0x20] + ldr r4, [r1, #0x24] + adds r0, r4, #0 + movs r1, #0 + bl sub_020090B0 + ldrb r0, [r7] + cmp r0, #0 + bne _02002314 + ldr r3, =gUnknown_0202004D + adds r0, r4, #0 + movs r1, #0 + movs r2, #2 + bl sub_020009C4 + b _02002336 + .align 2, 0 + .pool +_02002314: + add r1, sp, #0x18 + adds r0, #0xa1 + strb r0, [r1] + movs r0, #0xff + strb r0, [r1, #1] + movs r0, #0 + bl sub_02000650 + adds r0, r4, #0 + movs r1, #0 + movs r2, #2 + bl sub_02009164 + ldr r1, =gUnknown_0202004F + adds r0, r4, #0 + bl sub_02000484 +_02002336: + ldr r1, =0x04000154 + movs r0, #0xff + lsls r0, r0, #0x18 + str r0, [r1] + ldr r0, =gUnknown_02021860 + movs r2, #0x92 + lsls r2, r2, #1 + adds r0, r0, r2 + ldrb r1, [r0] + subs r1, #1 + strb r1, [r0] +_0200234C: + movs r4, #2 + b _020023C6 + .align 2, 0 + .pool +_0200235C: + movs r0, #0 + bl sub_02009344 + bl sub_020007F0 + ldr r4, =gUnknown_02021860 + ldr r3, =0x0000011B + adds r5, r4, r3 + ldrb r0, [r5] + bl sub_020044F0 + strb r0, [r5] + movs r2, #0x8d + lsls r2, r2, #1 + adds r1, r4, r2 + ldrb r1, [r1] + cmp r1, #1 + bne _020023AA + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + cmp r0, #0 + bne _0200239C + movs r3, #0x8f + lsls r3, r3, #1 + adds r1, r4, r3 + movs r0, #2 + b _020023A8 + .align 2, 0 + .pool +_0200239C: + cmp r0, #1 + bne _020023AA + movs r0, #0x8f + lsls r0, r0, #1 + adds r1, r4, r0 + movs r0, #4 +_020023A8: + strb r0, [r1] +_020023AA: + ldr r4, =gUnknown_02021860 + adds r0, r4, #0 + bl sub_020017E8 + ldr r1, =0x0000011B + adds r0, r4, r1 + ldrb r0, [r0] + str r0, [sp, #0x1c] + movs r0, #0x2c + ldr r2, [sp, #0x1c] + muls r0, r2, r0 + adds r0, r0, r4 + str r0, [sp, #0x20] + movs r4, #0 +_020023C6: + movs r3, #1 + cmp r3, #0 + beq _020023CE + b _02001F22 +_020023CE: + ldr r0, [sp, #0x1c] + add sp, #0x24 + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_020023E8 +sub_020023E8: @ 0x020023E8 + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #0xc + ldr r0, =gUnknown_0201F9A8 + ldr r2, =gUnknown_02021860 + movs r3, #0x8d + lsls r3, r3, #1 + adds r1, r2, r3 + ldrb r1, [r1] + lsls r1, r1, #2 + adds r0, r1, r0 + ldr r0, [r0] + mov sb, r0 + ldr r0, =gUnknown_0201F9EC + adds r1, r1, r0 + ldr r1, [r1] + str r1, [sp, #8] + mov r8, r2 + movs r4, #0x8f + lsls r4, r4, #1 + add r4, r8 + mov sl, r4 +_0200241A: + movs r0, #1 + bl sub_02008600 + ldr r0, =gUnknown_02022EB4 + ldrh r5, [r0] + cmp r5, #0 + beq _0200241A + movs r0, #2 + ands r0, r5 + cmp r0, #0 + beq _02002450 + ldr r1, =gUnknown_02021985 + ldrb r0, [r1] + cmp r0, #0 + beq _0200246C + b _02002484 + .align 2, 0 + .pool +_02002450: + movs r0, #1 + ands r0, r5 + cmp r0, #0 + beq _020024A8 + ldr r0, =gUnknown_02021860 + ldr r3, =0x0000011B + adds r4, r0, r3 + ldrb r0, [r4] + cmp r0, #6 + bne _0200248C + ldr r1, =gUnknown_02021985 + ldrb r0, [r1] + cmp r0, #0 + bne _02002484 +_0200246C: + movs r0, #0 + bl sub_02009344 + movs r0, #1 + rsbs r0, r0, #0 + b _020026E4 + .align 2, 0 + .pool +_02002484: + movs r0, #1 + bl sub_02009344 + b _0200241A +_0200248C: + movs r0, #0 + bl sub_02009344 + ldrb r0, [r4] + bl sub_02001A8C + adds r1, r0, #0 + movs r0, #1 + rsbs r0, r0, #0 + cmp r1, r0 + bne _020024A8 + movs r0, #1 + rsbs r0, r0, #0 + b _020026E4 +_020024A8: + ldr r6, =gUnknown_02021860 + ldr r3, =0x0000011B + adds r4, r6, r3 + ldrb r7, [r4] + movs r0, #0x40 + ands r0, r5 + cmp r0, #0 + beq _020024F6 + movs r0, #0 + bl sub_02009344 + ldrb r0, [r4] + adds r1, r0, #0 + cmp r1, #0 + bne _020024D4 + movs r0, #6 + b _020024E4 + .align 2, 0 + .pool +_020024D4: + cmp r1, #6 + bne _020024E2 + movs r1, #0x90 + lsls r1, r1, #1 + adds r0, r6, r1 + ldrb r0, [r0] + b _020024E4 +_020024E2: + subs r0, #1 +_020024E4: + strb r0, [r4] + ldr r0, =0x0000011B + add r0, r8 + ldrb r0, [r0] + lsls r0, r0, #2 + add r0, sb + ldrb r0, [r0, #2] + mov r3, sl + strb r0, [r3] +_020024F6: + movs r0, #0x80 + ands r0, r5 + cmp r0, #0 + beq _0200253C + movs r0, #0 + bl sub_02009344 + ldr r3, =0x0000011B + add r3, r8 + movs r0, #0x90 + lsls r0, r0, #1 + add r0, r8 + ldrb r2, [r3] + adds r1, r2, #0 + ldrb r0, [r0] + cmp r1, r0 + bne _02002520 + movs r0, #6 + b _0200252A + .align 2, 0 + .pool +_02002520: + cmp r1, #6 + bne _02002528 + movs r0, #0 + b _0200252A +_02002528: + adds r0, r2, #1 +_0200252A: + strb r0, [r3] + ldr r0, =0x0000011B + add r0, r8 + ldrb r0, [r0] + lsls r0, r0, #2 + add r0, sb + ldrb r0, [r0, #2] + mov r4, sl + strb r0, [r4] +_0200253C: + movs r0, #0x20 + ands r0, r5 + cmp r0, #0 + beq _0200256A + movs r0, #0 + bl sub_02009344 + ldr r0, =gUnknown_02021860 + ldr r1, =0x0000011B + adds r2, r0, r1 + ldrb r1, [r2] + lsls r0, r1, #2 + add r0, sb + ldrb r0, [r0, #1] + cmp r0, #0xff + beq _0200256A + mov r3, sl + strb r1, [r3] + ldrb r4, [r2] + lsls r0, r4, #2 + add r0, sb + ldrb r0, [r0, #1] + strb r0, [r2] +_0200256A: + movs r0, #0x10 + ands r5, r0 + cmp r5, #0 + beq _020025C8 + movs r0, #0 + bl sub_02009344 + ldr r2, =gUnknown_02021860 + ldr r0, =0x0000011B + adds r3, r2, r0 + ldrb r1, [r3] + lsls r0, r1, #2 + add r0, sb + ldrb r0, [r0] + cmp r0, #7 + beq _02002598 + cmp r0, #0xff + bne _020025C6 + b _020025C8 + .align 2, 0 + .pool +_02002598: + mov r4, sl + ldrb r1, [r4] + strb r1, [r3] + movs r4, #0x90 + lsls r4, r4, #1 + adds r0, r2, r4 + ldrb r0, [r0] + lsls r1, r1, #0x18 + lsrs r1, r1, #0x18 + cmp r1, r0 + bls _020025C8 + strb r0, [r3] + movs r0, #0x8d + lsls r0, r0, #1 + adds r1, r2, r0 + subs r0, #0x19 + ldrh r1, [r1] + cmp r1, r0 + bne _020025C8 + cmp r7, #0 + bne _020025C8 + strb r7, [r3] + b _020025C8 +_020025C6: + strb r0, [r3] +_020025C8: + ldr r0, =0x0000011B + add r0, r8 + ldrb r0, [r0] + cmp r7, r0 + bne _020025D4 + b _0200241A +_020025D4: + cmp r7, #6 + beq _02002632 + lsls r0, r7, #2 + ldr r1, [sp, #8] + adds r4, r1, r0 + ldrb r3, [r4, #2] + lsls r1, r3, #2 + ldr r0, =gUnknown_0201F9B0 + adds r5, r1, r0 + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + adds r1, r7, #0 + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + bl sub_0200B7D0 + cmp r0, #7 + beq _0200261C + ldrb r1, [r4] + ldrb r2, [r4, #1] + ldrb r3, [r5] + ldrb r0, [r5, #1] + str r0, [sp] + movs r0, #3 + str r0, [sp, #4] + bl sub_02008894 + b _02002644 + .align 2, 0 + .pool +_0200261C: + ldrb r1, [r4] + ldrb r2, [r4, #1] + ldrb r3, [r5] + ldrb r0, [r5, #1] + str r0, [sp] + movs r0, #5 + str r0, [sp, #4] + movs r0, #3 + bl sub_02008894 + b _02002644 +_02002632: + movs r0, #2 + str r0, [sp] + movs r0, #1 + str r0, [sp, #4] + movs r1, #0x18 + movs r2, #0x12 + movs r3, #6 + bl sub_02008894 +_02002644: + ldr r5, =gUnknown_02021860 + ldr r4, =0x0000011B + adds r0, r5, r4 + ldrb r1, [r0] + cmp r1, #6 + beq _020026AA + ldrb r3, [r0] + lsls r0, r3, #2 + ldr r1, [sp, #8] + adds r4, r1, r0 + ldrb r0, [r4, #2] + lsls r1, r0, #2 + ldr r0, =gUnknown_0201F9B0 + adds r5, r1, r0 + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + adds r1, r3, #0 + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + bl sub_0200B7D0 + cmp r0, #7 + beq _02002694 + ldrb r1, [r4] + ldrb r2, [r4, #1] + ldrb r3, [r5] + ldrb r0, [r5, #1] + str r0, [sp] + movs r0, #7 + b _020026A0 + .align 2, 0 + .pool +_02002694: + ldrb r1, [r4] + ldrb r2, [r4, #1] + ldrb r3, [r5] + ldrb r0, [r5, #1] + str r0, [sp] + movs r0, #9 +_020026A0: + str r0, [sp, #4] + movs r0, #3 + bl sub_02008894 + b _020026D4 +_020026AA: + movs r4, #2 + str r4, [sp] + str r4, [sp, #4] + movs r0, #1 + movs r1, #0x18 + movs r2, #0x12 + movs r3, #6 + bl sub_02008894 + movs r1, #0x8d + lsls r1, r1, #1 + adds r0, r5, r1 + ldrb r0, [r0] + cmp r0, #0 + bne _020026D0 + movs r0, #1 + mov r3, sl + strb r0, [r3] + b _020026D4 +_020026D0: + mov r0, sl + strb r4, [r0] +_020026D4: + ldr r1, =gUnknown_02022C20 + movs r0, #1 + strb r0, [r1, #3] + strb r0, [r1, #1] + b _0200241A + .align 2, 0 + .pool +_020026E4: + add sp, #0xc + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + + thumb_func_start sub_020026F4 +sub_020026F4: @ 0x020026F4 + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #8 + ldr r0, =gUnknown_0201F9A8 + ldr r2, =gUnknown_02021860 + movs r3, #0x8d + lsls r3, r3, #1 + adds r1, r2, r3 + ldrb r1, [r1] + lsls r1, r1, #2 + adds r0, r1, r0 + ldr r0, [r0] + mov r8, r0 + ldr r0, =gUnknown_0201F9EC + adds r1, r1, r0 + ldr r1, [r1] + mov sl, r1 + adds r7, r2, #0 + movs r4, #0x8f + lsls r4, r4, #1 + adds r4, r4, r7 + mov sb, r4 +_02002726: + movs r0, #1 + bl sub_02008600 + ldr r0, =gUnknown_02022EB4 + ldrh r4, [r0] + cmp r4, #0 + beq _02002726 + ldr r1, =gUnknown_02021860 + ldr r2, =0x0000011B + adds r0, r1, r2 + ldrb r6, [r0] + movs r0, #2 + ands r0, r4 + cmp r0, #0 + beq _02002788 + movs r3, #0x92 + lsls r3, r3, #1 + adds r0, r1, r3 + ldrb r0, [r0] + cmp r0, #0 + beq _0200277C + bl sub_02000BFC + movs r0, #0 + bl sub_02009344 + ldr r1, =0x04000154 + movs r0, #0xff + lsls r0, r0, #0x18 + str r0, [r1] + b _02002788 + .align 2, 0 + .pool +_0200277C: + movs r0, #1 + bl sub_02001738 + movs r0, #1 + bl sub_02009344 +_02002788: + adds r0, r4, #0 + movs r1, #1 + ands r0, r1 + cmp r0, #0 + beq _02002854 + ldr r1, =gUnknown_02021860 + ldr r2, =0x0000011B + adds r0, r1, r2 + ldrb r3, [r0] + cmp r3, #6 + bne _02002838 + movs r4, #0x92 + lsls r4, r4, #1 + adds r2, r1, r4 + ldr r3, =0x00000123 + adds r0, r1, r3 + ldrb r4, [r2] + ldrb r0, [r0] + cmp r4, r0 + beq _020027CC + movs r0, #1 + bl sub_02009344 + movs r0, #1 + bl sub_02001738 + b _02002726 + .align 2, 0 + .pool +_020027CC: + movs r7, #0 + movs r6, #0 + movs r3, #1 + ldrb r0, [r2] + adds r0, #1 + ldr r2, =gUnknown_02024960 + mov sl, r2 + cmp r3, r0 + bge _0200281C + mov r8, r1 + mov ip, r0 + movs r4, #1 + rsbs r4, r4, #0 + mov sb, r4 +_020027E8: + movs r2, #0 + adds r5, r6, #4 + adds r4, r3, #1 + mov r1, r8 + adds r1, #0x22 +_020027F2: + ldrb r0, [r1] + cmp r0, r3 + bne _02002800 + adds r0, r2, #0 + b _0200280C + .align 2, 0 + .pool +_02002800: + adds r1, #0x2c + adds r2, #1 + cmp r2, #5 + ble _020027F2 + movs r0, #1 + rsbs r0, r0, #0 +_0200280C: + cmp r0, sb + beq _02002814 + lsls r0, r6 + orrs r7, r0 +_02002814: + adds r6, r5, #0 + adds r3, r4, #0 + cmp r3, ip + blt _020027E8 +_0200281C: + movs r0, #0x88 + lsls r0, r0, #4 + add r0, sl + str r7, [r0] + ldr r0, =0x0000087F + add r0, sl + ldrb r1, [r0] + movs r1, #1 + strb r1, [r0] + movs r0, #1 + rsbs r0, r0, #0 + b _02002A8C + .align 2, 0 + .pool +_02002838: + ldrb r0, [r0] + bl sub_02001F04 + adds r1, r0, #0 + movs r0, #1 + rsbs r0, r0, #0 + cmp r1, r0 + bne _0200284E + movs r0, #1 + rsbs r0, r0, #0 + b _02002A8C +_0200284E: + cmp r1, r6 + beq _02002854 + adds r6, r1, #0 +_02002854: + movs r0, #0x40 + ands r0, r4 + cmp r0, #0 + beq _0200289E + movs r0, #0 + bl sub_02009344 + ldr r2, =gUnknown_02021860 + ldr r0, =0x0000011B + adds r3, r2, r0 + ldrb r0, [r3] + adds r1, r0, #0 + cmp r1, #0 + bne _0200287C + movs r0, #6 + b _0200288C + .align 2, 0 + .pool +_0200287C: + cmp r1, #6 + bne _0200288A + movs r1, #0x90 + lsls r1, r1, #1 + adds r0, r2, r1 + ldrb r0, [r0] + b _0200288C +_0200288A: + subs r0, #1 +_0200288C: + strb r0, [r3] + ldr r2, =0x0000011B + adds r0, r7, r2 + ldrb r0, [r0] + lsls r0, r0, #2 + add r0, r8 + ldrb r0, [r0, #2] + mov r3, sb + strb r0, [r3] +_0200289E: + movs r0, #0x80 + ands r0, r4 + cmp r0, #0 + beq _020028E4 + movs r0, #0 + bl sub_02009344 + ldr r0, =0x0000011B + adds r3, r7, r0 + movs r1, #0x90 + lsls r1, r1, #1 + adds r0, r7, r1 + ldrb r2, [r3] + adds r1, r2, #0 + ldrb r0, [r0] + cmp r1, r0 + bne _020028C8 + movs r0, #6 + b _020028D2 + .align 2, 0 + .pool +_020028C8: + cmp r1, #6 + bne _020028D0 + movs r0, #0 + b _020028D2 +_020028D0: + adds r0, r2, #1 +_020028D2: + strb r0, [r3] + ldr r2, =0x0000011B + adds r0, r7, r2 + ldrb r0, [r0] + lsls r0, r0, #2 + add r0, r8 + ldrb r0, [r0, #2] + mov r3, sb + strb r0, [r3] +_020028E4: + movs r0, #0x20 + ands r0, r4 + cmp r0, #0 + beq _02002912 + movs r0, #0 + bl sub_02009344 + ldr r0, =gUnknown_02021860 + ldr r1, =0x0000011B + adds r2, r0, r1 + ldrb r1, [r2] + lsls r0, r1, #2 + add r0, r8 + ldrb r0, [r0, #1] + cmp r0, #0xff + beq _02002912 + mov r3, sb + strb r1, [r3] + ldrb r1, [r2] + lsls r0, r1, #2 + add r0, r8 + ldrb r0, [r0, #1] + strb r0, [r2] +_02002912: + movs r0, #0x10 + ands r4, r0 + cmp r4, #0 + beq _02002970 + movs r0, #0 + bl sub_02009344 + ldr r2, =gUnknown_02021860 + ldr r4, =0x0000011B + adds r3, r2, r4 + ldrb r1, [r3] + lsls r0, r1, #2 + add r0, r8 + ldrb r0, [r0] + cmp r0, #7 + beq _02002940 + cmp r0, #0xff + bne _0200296E + b _02002970 + .align 2, 0 + .pool +_02002940: + mov r4, sb + ldrb r1, [r4] + strb r1, [r3] + movs r4, #0x90 + lsls r4, r4, #1 + adds r0, r2, r4 + ldrb r0, [r0] + lsls r1, r1, #0x18 + lsrs r1, r1, #0x18 + cmp r1, r0 + bls _02002970 + strb r0, [r3] + movs r0, #0x8d + lsls r0, r0, #1 + adds r1, r2, r0 + subs r0, #0x19 + ldrh r1, [r1] + cmp r1, r0 + bne _02002970 + cmp r6, #0 + bne _02002970 + strb r6, [r3] + b _02002970 +_0200296E: + strb r0, [r3] +_02002970: + ldr r1, =0x0000011B + adds r0, r7, r1 + ldrb r0, [r0] + cmp r6, r0 + bne _0200297C + b _02002726 +_0200297C: + cmp r6, #6 + beq _020029DA + lsls r0, r6, #2 + mov r2, sl + adds r4, r2, r0 + ldrb r3, [r4, #2] + lsls r1, r3, #2 + ldr r0, =gUnknown_0201F9B0 + adds r5, r1, r0 + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + adds r1, r6, #0 + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + bl sub_0200B7D0 + cmp r0, #7 + beq _020029C4 + ldrb r1, [r4] + ldrb r2, [r4, #1] + ldrb r3, [r5] + ldrb r0, [r5, #1] + str r0, [sp] + movs r0, #3 + str r0, [sp, #4] + bl sub_02008894 + b _020029EE + .align 2, 0 + .pool +_020029C4: + ldrb r1, [r4] + ldrb r2, [r4, #1] + ldrb r3, [r5] + ldrb r0, [r5, #1] + str r0, [sp] + movs r0, #5 + str r0, [sp, #4] + movs r0, #3 + bl sub_02008894 + b _020029EE +_020029DA: + movs r0, #2 + str r0, [sp] + movs r4, #1 + str r4, [sp, #4] + movs r0, #1 + movs r1, #0x18 + movs r2, #0x12 + movs r3, #6 + bl sub_02008894 +_020029EE: + ldr r5, =gUnknown_02021860 + ldr r1, =0x0000011B + adds r0, r5, r1 + ldrb r2, [r0] + cmp r2, #6 + beq _02002A52 + ldrb r3, [r0] + lsls r0, r3, #2 + mov r1, sl + adds r4, r1, r0 + ldrb r2, [r4, #2] + lsls r1, r2, #2 + ldr r0, =gUnknown_0201F9B0 + adds r5, r1, r0 + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + adds r1, r3, #0 + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + bl sub_0200B7D0 + cmp r0, #7 + beq _02002A3C + ldrb r1, [r4] + ldrb r2, [r4, #1] + ldrb r3, [r5] + ldrb r0, [r5, #1] + str r0, [sp] + movs r0, #7 + b _02002A48 + .align 2, 0 + .pool +_02002A3C: + ldrb r1, [r4] + ldrb r2, [r4, #1] + ldrb r3, [r5] + ldrb r0, [r5, #1] + str r0, [sp] + movs r0, #9 +_02002A48: + str r0, [sp, #4] + movs r0, #3 + bl sub_02008894 + b _02002A7C +_02002A52: + movs r4, #2 + str r4, [sp] + str r4, [sp, #4] + movs r0, #1 + movs r1, #0x18 + movs r2, #0x12 + movs r3, #6 + bl sub_02008894 + movs r3, #0x8d + lsls r3, r3, #1 + adds r0, r5, r3 + ldrb r0, [r0] + cmp r0, #0 + bne _02002A78 + movs r0, #1 + mov r4, sb + strb r0, [r4] + b _02002A7C +_02002A78: + mov r1, sb + strb r4, [r1] +_02002A7C: + ldr r0, =gUnknown_02022C20 + movs r2, #1 + strb r2, [r0, #3] + strb r2, [r0, #1] + b _02002726 + .align 2, 0 + .pool +_02002A8C: + add sp, #8 + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + + thumb_func_start sub_02002A9C +sub_02002A9C: @ 0x02002A9C + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #0xc + adds r4, r0, #0 + ldr r3, =gUnknown_02021860 + movs r5, #0x91 + lsls r5, r5, #1 + adds r0, r3, r5 + movs r5, #0 + strb r1, [r0] + ldr r1, =0x0000011B + adds r0, r3, r1 + strb r5, [r0] + adds r1, #0xa + adds r0, r3, r1 + strb r2, [r0] + movs r0, #0x8d + lsls r0, r0, #1 + adds r2, r3, r0 + strb r5, [r2] + ldr r1, =gUnknown_02024960 + ldr r0, =0x00000858 + adds r6, r1, r0 + ldrb r0, [r6] + adds r7, r1, #0 + cmp r0, #1 + bne _02002AF4 + movs r1, #0x8f + lsls r1, r1, #1 + adds r2, r3, r1 + strb r0, [r2] + b _02002B08 + .align 2, 0 + .pool +_02002AF4: + ldrb r0, [r6] + adds r1, r0, #0 + cmp r1, #2 + bne _02002B08 + movs r0, #1 + strb r0, [r2] + movs r2, #0x8f + lsls r2, r2, #1 + adds r0, r3, r2 + strb r1, [r0] +_02002B08: + cmp r4, #0 + beq _02002B12 + cmp r4, #1 + beq _02002B38 + b _02002C1E +_02002B12: + movs r5, #0x8c + lsls r5, r5, #1 + adds r0, r3, r5 + strb r4, [r0] + ldr r1, =0x00000123 + adds r0, r3, r1 + strb r4, [r0] + adds r0, r3, #0 + bl sub_020017E8 + bl sub_020007AC + bl sub_020023E8 + bl sub_020007F0 + b _02002C1E + .align 2, 0 + .pool +_02002B38: + movs r2, #0x8c + lsls r2, r2, #1 + adds r0, r3, r2 + strb r4, [r0] + ldr r5, =0x00000859 + adds r0, r7, r5 + ldrb r0, [r0] + ldr r1, =0x00000123 + adds r4, r3, r1 + strb r0, [r4] + lsls r0, r0, #0x18 + lsrs r1, r0, #0x18 + ldr r2, =gUnknown_02022EF0 + cmp r1, #0 + beq _02002B5E + ldr r0, [r2] + ldrb r0, [r0] + cmp r1, r0 + bls _02002B64 +_02002B5E: + ldr r0, [r2] + ldrb r0, [r0] + strb r0, [r4] +_02002B64: + movs r2, #0x92 + lsls r2, r2, #1 + adds r0, r3, r2 + movs r1, #0 + strb r1, [r0] + movs r6, #0 + mov r5, sp + adds r5, #4 + str r5, [sp, #8] + mov r0, sp + adds r0, #2 + mov sl, r6 + ldr r7, =gUnknown_02022EF4 + mov sb, r0 +_02002B80: + movs r0, #0x2c + muls r0, r6, r0 + adds r0, r0, r3 + adds r0, #0x22 + mov r1, sl + strb r1, [r0] + movs r2, #0x64 + adds r4, r6, #0 + muls r4, r2, r4 + ldr r0, [r7] + adds r0, r0, r4 + movs r1, #0x3a + movs r2, #0 + bl sub_0200C1B8 + mov r1, sp + strh r0, [r1] + ldr r0, [r7] + adds r0, r0, r4 + movs r1, #0x39 + mov r2, sp + bl sub_0200C040 + mov r5, sl + str r5, [sp, #4] + ldr r0, [r7] + adds r0, r0, r4 + movs r1, #0x37 + ldr r2, [sp, #8] + bl sub_0200C040 + movs r5, #0 + adds r6, #1 + mov r8, r6 + adds r6, r4, #0 +_02002BC6: + ldr r0, [r7] + adds r0, r0, r6 + adds r1, r5, #0 + bl sub_0200B6F4 + adds r4, r0, #0 + lsls r4, r4, #0x10 + lsrs r4, r4, #0x10 + ldr r0, [r7] + adds r0, r0, r6 + movs r1, #0x15 + movs r2, #0 + bl sub_0200C1B8 + adds r1, r0, #0 + adds r0, r4, #0 + adds r2, r5, #0 + bl sub_0200C478 + mov r1, sb + strh r0, [r1] + ldr r0, [r7] + adds r0, r0, r6 + adds r1, r5, #0 + adds r1, #0x11 + mov r2, sb + bl sub_0200C040 + adds r5, #1 + cmp r5, #3 + ble _02002BC6 + mov r6, r8 + ldr r3, =gUnknown_02021860 + cmp r6, #5 + ble _02002B80 + adds r0, r3, #0 + bl sub_020017E8 + bl sub_020007AC + bl sub_020026F4 + bl sub_020007F0 +_02002C1E: + add sp, #0xc + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02002C44 +sub_02002C44: @ 0x02002C44 + push {r4, r5, lr} + sub sp, #4 + mov r0, sp + movs r4, #0 + strh r4, [r0] + ldr r5, =gUnknown_02021860 + ldr r2, =0x01000094 + adds r1, r5, #0 + bl CpuSet + movs r1, #0x8d + lsls r1, r1, #1 + adds r0, r5, r1 + strb r4, [r0] + adds r1, #1 + adds r0, r5, r1 + strb r4, [r0] + movs r0, #0x8f + lsls r0, r0, #1 + adds r1, r5, r0 + movs r0, #1 + strb r0, [r1] + add sp, #4 + pop {r4, r5} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02002C80 +sub_02002C80: @ 0x02002C80 + ldr r1, =gUnknown_02021860 + ldr r0, =0x0000011B + adds r2, r1, r0 + movs r0, #0 + strb r0, [r2] + movs r2, #0x8d + lsls r2, r2, #1 + adds r0, r1, r2 + ldrb r0, [r0] + cmp r0, #0 + bne _02002CA8 + movs r0, #0x8f + lsls r0, r0, #1 + adds r1, r1, r0 + movs r0, #1 + b _02002CB0 + .align 2, 0 + .pool +_02002CA8: + movs r2, #0x8f + lsls r2, r2, #1 + adds r1, r1, r2 + movs r0, #2 +_02002CB0: + strb r0, [r1] + bx lr + + thumb_func_start sub_02002CB4 +sub_02002CB4: @ 0x02002CB4 + push {r4, r5, r6, r7, lr} + mov r7, r8 + push {r7} + adds r4, r0, #0 + adds r6, r1, #0 + adds r5, r2, #0 + ldrb r0, [r4] + adds r1, r0, #0 + cmp r1, #0xfc + beq _02002D0C + movs r7, #0 + adds r0, r6, r5 + mov ip, r0 + lsls r5, r5, #1 + mov r8, r5 + cmp r1, #0xff + beq _02002CF6 + ldr r5, =gUnknown_0201F6B0 + mov r2, ip +_02002CDA: + ldrb r1, [r4] + lsls r0, r1, #1 + adds r0, r0, r5 + ldrh r3, [r0] + adds r1, r6, r7 + lsrs r0, r3, #8 + strb r0, [r1] + strb r3, [r2, #1] + adds r4, #1 + adds r2, #1 + adds r7, #1 + ldrb r0, [r4] + cmp r0, #0xff + bne _02002CDA +_02002CF6: + movs r0, #0xfe + mov r1, ip + strb r0, [r1] + mov r0, r8 + adds r1, r0, r6 + movs r0, #0xff + strb r0, [r1, #1] + b _02002D52 + .align 2, 0 + .pool +_02002D0C: + strb r0, [r6] + adds r4, #1 + ldrb r0, [r4] + strb r0, [r6, #1] + adds r4, #1 + subs r5, #2 + movs r7, #2 + ldrb r0, [r4] + cmp r0, #0xff + beq _02002D44 + ldr r1, =gUnknown_0201F4B0 + mov r8, r1 + adds r0, r5, r6 + adds r2, r0, #2 +_02002D28: + ldrb r1, [r4] + lsls r0, r1, #1 + add r0, r8 + ldrh r3, [r0] + adds r1, r6, r7 + lsrs r0, r3, #8 + strb r0, [r1] + strb r3, [r2, #1] + adds r4, #1 + adds r2, #1 + adds r7, #1 + ldrb r0, [r4] + cmp r0, #0xff + bne _02002D28 +_02002D44: + adds r1, r5, r6 + movs r0, #0xfe + strb r0, [r1, #2] + lsls r0, r5, #1 + adds r0, r0, r6 + movs r1, #0xff + strb r1, [r0, #3] +_02002D52: + pop {r3} + mov r8, r3 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02002D60 +sub_02002D60: @ 0x02002D60 + push {r4, r5, r6, lr} + sub sp, #0x10 + adds r3, r0, #0 + adds r4, r1, #0 + adds r5, r2, #0 + movs r0, #1 + str r0, [sp] + movs r0, #8 + str r0, [sp, #4] + movs r0, #1 + adds r1, r3, #0 + adds r2, r4, #0 + movs r3, #3 + bl sub_020009DC + adds r6, r0, #0 + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + adds r1, r5, #0 + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + movs r1, #0x38 + movs r2, #0 + bl sub_0200C1B8 + adds r4, r0, #0 + add r1, sp, #8 + movs r0, #0x60 + strb r0, [r1] + movs r0, #0xff + strb r0, [r1, #1] + adds r0, r6, #0 + movs r1, #0 + movs r2, #0 + bl sub_02009164 + adds r0, r6, #0 + add r1, sp, #8 + bl sub_02000484 + adds r0, r4, #0 + add r1, sp, #8 + movs r2, #0x76 + bl sub_02000900 + movs r1, #0 + add r0, sp, #8 + b _02002DD0 + .align 2, 0 + .pool +_02002DC8: + adds r1, #1 + mov r0, sp + adds r0, r0, r1 + adds r0, #8 +_02002DD0: + ldrb r0, [r0] + cmp r0, #0x76 + beq _02002DC8 + mov r0, sp + adds r0, r0, r1 + adds r0, #8 + ldrb r0, [r0] + cmp r0, #0xff + bne _02002DE4 + subs r1, #1 +_02002DE4: + add r1, sp + adds r1, #8 + adds r0, r6, #0 + bl sub_02000584 + adds r0, r6, #0 + add sp, #0x10 + pop {r4, r5, r6} + pop {r1} + bx r1 + + thumb_func_start sub_02002DF8 +sub_02002DF8: @ 0x02002DF8 + push {r4, r5, lr} + adds r4, r0, #0 + adds r5, r1, #0 + ldr r3, =gUnknown_02022EF4 + movs r0, #0x64 + adds r1, r2, #0 + muls r1, r0, r1 + ldr r0, [r3] + adds r0, r0, r1 + bl sub_0200C254 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + cmp r0, #0 + beq _02002E24 + cmp r0, #0xfe + beq _02002E28 + movs r3, #0 + b _02002E2A + .align 2, 0 + .pool +_02002E24: + movs r3, #0xf + b _02002E2A +_02002E28: + movs r3, #0x11 +_02002E2A: + movs r0, #0 + adds r1, r4, #0 + adds r2, r5, #0 + bl sub_020088E8 + pop {r4, r5} + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start sub_02002E3C +sub_02002E3C: @ 0x02002E3C + push {r4, lr} + adds r3, r0, #0 + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + ldr r2, [r0, #0x38] + ldrh r4, [r3, #6] + lsls r0, r4, #2 + adds r0, r0, r2 + lsls r1, r1, #9 + ldr r0, [r0] + adds r0, r0, r1 + ldrh r3, [r3, #8] + lsls r1, r3, #5 + ldr r2, =0x06010000 + adds r1, r1, r2 + movs r2, #0x80 + lsls r2, r2, #1 + bl CpuSet + pop {r4} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02002E70 +sub_02002E70: @ 0x02002E70 + push {r4, r5, lr} + sub sp, #0xc + adds r5, r0, #0 + cmp r5, #1 + beq _02002EC0 + cmp r5, #1 + bgt _02002E84 + cmp r5, #0 + beq _02002E8A + b _02002ED8 +_02002E84: + cmp r5, #2 + beq _02002E94 + b _02002ED8 +_02002E8A: + movs r0, #2 + str r0, [sp] + movs r0, #0x18 + str r0, [sp, #4] + b _02002EAE +_02002E94: + str r5, [sp] + movs r4, #0x18 + str r4, [sp, #4] + movs r0, #0x10 + str r0, [sp, #8] + movs r0, #1 + movs r1, #0xc + movs r2, #0x14 + movs r3, #6 + bl sub_02008948 + str r5, [sp] + str r4, [sp, #4] +_02002EAE: + movs r0, #0x12 + str r0, [sp, #8] + movs r0, #1 + movs r1, #0 + movs r2, #0x14 + movs r3, #6 + bl sub_02008948 + b _02002ED8 +_02002EC0: + movs r0, #2 + str r0, [sp] + movs r0, #0x18 + str r0, [sp, #4] + movs r0, #0x12 + str r0, [sp, #8] + movs r0, #1 + movs r1, #0xc + movs r2, #0x14 + movs r3, #6 + bl sub_02008948 +_02002ED8: + add sp, #0xc + pop {r4, r5} + pop {r0} + bx r0 + + thumb_func_start sub_02002EE0 +sub_02002EE0: @ 0x02002EE0 + push {r4, r5, lr} + sub sp, #4 + adds r5, r0, #0 + adds r4, r1, #0 + movs r1, #0 + bl sub_020090B0 + adds r4, #0x22 + ldrb r0, [r4] + cmp r0, #0 + bne _02002F08 + ldr r3, =gUnknown_0202004D + adds r0, r5, #0 + movs r1, #0 + movs r2, #2 + bl sub_020009C4 + b _02002F2A + .align 2, 0 + .pool +_02002F08: + mov r1, sp + adds r0, #0xa1 + strb r0, [r1] + movs r0, #0xff + strb r0, [r1, #1] + movs r0, #0 + bl sub_02000650 + adds r0, r5, #0 + movs r1, #0 + movs r2, #2 + bl sub_02009164 + ldr r1, =gUnknown_0202004F + adds r0, r5, #0 + bl sub_02000484 +_02002F2A: + add sp, #4 + pop {r4, r5} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02002F38 +sub_02002F38: @ 0x02002F38 + adds r3, r0, #0 + movs r1, #0 + ldr r0, =gUnknown_02021860 + adds r2, r0, #0 + adds r2, #0x22 +_02002F42: + ldrb r0, [r2] + cmp r0, r3 + bne _02002F50 + adds r0, r1, #0 + b _02002F5C + .align 2, 0 + .pool +_02002F50: + adds r2, #0x2c + adds r1, #1 + cmp r1, #5 + ble _02002F42 + movs r0, #1 + rsbs r0, r0, #0 +_02002F5C: + bx lr + .align 2, 0 + + thumb_func_start sub_02002F60 +sub_02002F60: @ 0x02002F60 + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + movs r7, #0 + movs r6, #0 + movs r1, #1 + ldr r2, =gUnknown_02021860 + movs r3, #0x92 + lsls r3, r3, #1 + adds r0, r2, r3 + ldrb r0, [r0] + adds r0, #1 + ldr r3, =gUnknown_02024960 + mov sl, r3 + cmp r1, r0 + bge _02002FC8 + mov r8, r2 + mov ip, r0 + movs r0, #1 + rsbs r0, r0, #0 + mov sb, r0 +_02002F8E: + movs r3, #0 + adds r4, r6, #4 + adds r5, r1, #1 + mov r2, r8 + adds r2, #0x22 +_02002F98: + ldrb r0, [r2] + cmp r0, r1 + bne _02002FAC + adds r0, r3, #0 + b _02002FB8 + .align 2, 0 + .pool +_02002FAC: + adds r2, #0x2c + adds r3, #1 + cmp r3, #5 + ble _02002F98 + movs r0, #1 + rsbs r0, r0, #0 +_02002FB8: + cmp r0, sb + beq _02002FC0 + lsls r0, r6 + orrs r7, r0 +_02002FC0: + adds r6, r4, #0 + adds r1, r5, #0 + cmp r1, ip + blt _02002F8E +_02002FC8: + movs r0, #0x88 + lsls r0, r0, #4 + add r0, sl + str r7, [r0] + ldr r1, =0x0000087F + add r1, sl + ldrb r0, [r1] + movs r0, #1 + strb r0, [r1] + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02002FEC +sub_02002FEC: @ 0x02002FEC + push {r4, lr} + sub sp, #4 + bl sub_02000940 + movs r1, #0x80 + lsls r1, r1, #0x13 + movs r2, #0xfa + lsls r2, r2, #5 + adds r0, r2, #0 + strh r0, [r1] + adds r1, #8 + movs r2, #0xd8 + lsls r2, r2, #5 + adds r0, r2, #0 + strh r0, [r1] + adds r1, #2 + ldr r2, =0x00001C09 + adds r0, r2, #0 + strh r0, [r1] + adds r1, #2 + ldr r2, =0x00005E0A + adds r0, r2, #0 + strh r0, [r1] + adds r1, #2 + ldr r2, =0x00001D0B + adds r0, r2, #0 + strh r0, [r1] + ldr r0, =gUnknown_0201C10C + movs r1, #0xa0 + lsls r1, r1, #0x13 + bl sub_020092C0 + ldr r0, =gUnknown_0201B4AC + ldr r1, =0x06008000 + bl sub_020092C0 + ldr r0, =gUnknown_0201BFF8 + movs r1, #0xc0 + lsls r1, r1, #0x13 + bl sub_020092C0 + ldr r0, =gUnknown_0201C428 + ldr r1, =0x03002000 + bl sub_020092C0 + ldr r0, =gUnknown_0201C228 + ldr r1, =0x03003000 + bl sub_020092C0 + ldr r1, =gUnknown_02022C20 + movs r4, #0 + movs r0, #1 + strb r0, [r1, #2] + strb r0, [r1, #3] + ldr r0, =gUnknown_0201D05C + ldr r1, =0x05000200 + bl sub_020092C0 + ldr r0, =gUnknown_0201C5A4 + ldr r1, =0x06010000 + bl sub_020092C0 + mov r0, sp + strh r4, [r0] + ldr r4, =gUnknown_02021990 + ldr r2, =0x0100002A + adds r1, r4, #0 + bl CpuSet + ldr r1, =gUnknown_0201FB50 + movs r0, #0 + bl sub_02008F6C + str r0, [r4, #0x24] + ldr r1, =gUnknown_0201FB30 + movs r0, #3 + bl sub_02008F6C + str r0, [r4, #0x20] + add sp, #4 + pop {r4} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_020030E4 +sub_020030E4: @ 0x020030E4 + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #8 + adds r6, r0, #0 + mov sb, r1 + str r2, [sp] + str r3, [sp, #4] + ldr r0, =gUnknown_020251E8 + mov sl, r0 + ldr r0, [r0] + adds r0, #0xbc + ldr r7, [r0] + ldr r5, =gUnknown_02022EF4 + movs r0, #0x64 + mov r4, sb + muls r4, r0, r4 + ldr r0, [r5] + adds r0, r0, r4 + movs r1, #0xb + movs r2, #0 + bl sub_0200C1B8 + strh r0, [r6, #0x14] + lsls r0, r0, #0x10 + cmp r0, #0 + beq _020031DE + ldr r0, [r5] + adds r0, r0, r4 + movs r1, #0 + movs r2, #0 + bl sub_0200C1B8 + mov r8, r0 + ldrh r0, [r6, #0x14] + mov r1, r8 + bl sub_0200C318 + strh r0, [r6, #0x16] + ldr r0, [r6] + cmp r0, #0 + beq _02003140 + bl sub_02008CEC +_02003140: + ldrh r1, [r6, #0x14] + lsls r0, r1, #3 + subs r0, r0, r1 + lsls r0, r0, #2 + adds r0, r0, r7 + ldrb r0, [r0, #0x19] + lsrs r5, r0, #7 + movs r0, #1 + bl sub_02008600 + mov r2, sl + ldr r0, [r2] + ldrh r2, [r6, #0x16] + lsls r1, r2, #3 + ldr r4, [r0, #0x28] + adds r4, r4, r1 + bl sub_020098D0 + adds r7, r0, #0 + ldr r0, [r4] + adds r1, r7, #0 + bl LZ77UnCompVRAM + ldrh r0, [r6, #0x14] + mov r1, r8 + adds r2, r7, #0 + bl sub_0200B89C + mov r0, sb + bl sub_0200B4E0 + movs r1, #0x80 + lsls r1, r1, #6 + adds r4, r7, r1 + ldr r0, [r0] + adds r1, r4, #0 + bl LZ77UnCompWRAM + ldr r1, =gUnknown_0201FA3C + lsls r0, r5, #2 + adds r0, r0, r1 + ldr r2, [r0] + ldr r0, [sp] + ldr r1, [sp, #4] + bl sub_02008A10 + str r0, [r6] + movs r1, #4 + bl sub_02008D54 + cmp r5, #0 + bne _020031C8 + ldr r1, =0x06016000 + movs r2, #0x80 + lsls r2, r2, #3 + adds r0, r7, #0 + bl CpuSet + b _020031D4 + .align 2, 0 + .pool +_020031C8: + ldr r1, =0x06012000 + movs r2, #0x80 + lsls r2, r2, #3 + adds r0, r7, #0 + bl CpuSet +_020031D4: + ldr r1, =0x05000280 + adds r0, r4, #0 + movs r2, #0x10 + bl CpuSet +_020031DE: + add sp, #8 + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_020031F8 +sub_020031F8: @ 0x020031F8 + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #0x24 + mov sb, r0 + movs r1, #0xa0 + rsbs r1, r1, #0 + movs r0, #2 + movs r2, #0 + bl sub_020089A4 + ldr r7, =gUnknown_02021990 + ldr r0, [r7, #0x24] + movs r1, #0 + movs r2, #0 + bl sub_02009164 + ldr r0, [r7, #0x24] + movs r1, #1 + movs r2, #8 + bl sub_0200914C + movs r5, #2 + str r5, [sp] + movs r4, #0xf + str r4, [sp, #4] + movs r0, #0 + movs r1, #0xb + movs r2, #8 + movs r3, #0x12 + bl sub_02008894 + str r5, [sp] + str r4, [sp, #4] + movs r0, #0 + movs r1, #0x10 + movs r2, #0xb + movs r3, #6 + bl sub_02008894 + movs r0, #4 + str r0, [sp] + str r4, [sp, #4] + movs r0, #0 + movs r1, #0x11 + movs r2, #0xd + movs r3, #5 + bl sub_02008894 + movs r0, #6 + str r0, [sp] + str r4, [sp, #4] + movs r0, #0 + movs r1, #0x1b + movs r2, #0xb + movs r3, #3 + bl sub_02008894 + str r5, [sp] + str r4, [sp, #4] + movs r0, #0 + movs r1, #0xb + movs r2, #0x12 + movs r3, #0x12 + bl sub_02008894 + ldr r0, [r7, #0x24] + ldr r1, =gUnknown_0201FFE3 + bl sub_02000484 + ldr r5, =gUnknown_02022EF4 + movs r0, #0x64 + mov r4, sb + muls r4, r0, r4 + ldr r0, [r5] + adds r0, r0, r4 + movs r1, #1 + bl sub_0200C3FC + adds r6, r0, #0 + ldr r0, [r5] + adds r0, r0, r4 + movs r1, #2 + bl sub_0200C3FC + adds r5, r0, #0 + ldr r0, [r7, #4] + cmp r0, #0 + bne _020032C8 + ldr r4, =gUnknown_0201FA44 + movs r0, #0x7a + movs r1, #0x18 + adds r2, r4, #0 + bl sub_02008A10 + str r0, [r7, #4] + movs r0, #0xa2 + movs r1, #0x18 + adds r2, r4, #0 + bl sub_02008A10 + str r0, [r7, #8] +_020032C8: + ldr r0, [r7, #4] + lsls r1, r6, #3 + bl sub_02008D5C + ldr r4, [r7, #4] + adds r0, r6, #0 + bl sub_0200C440 + adds r1, r0, #0 + adds r0, r4, #0 + bl sub_02008D54 + cmp r5, #0 + beq _0200331C + cmp r6, r5 + beq _0200331C + ldr r0, [r7, #8] + lsls r1, r5, #3 + bl sub_02008D5C + ldr r4, [r7, #8] + adds r0, r5, #0 + bl sub_0200C440 + adds r1, r0, #0 + adds r0, r4, #0 + bl sub_02008D54 + ldr r0, [r7, #8] + movs r1, #0 + bl sub_02008D60 + b _02003326 + .align 2, 0 + .pool +_0200331C: + ldr r0, =gUnknown_02021990 + ldr r0, [r0, #8] + movs r1, #1 + bl sub_02008D60 +_02003326: + ldr r0, =gUnknown_02022EF4 + mov sl, r0 + movs r0, #0x64 + mov r1, sb + muls r1, r0, r1 + mov r8, r1 + mov r1, sl + ldr r0, [r1] + add r0, r8 + bl sub_0200B57C + adds r5, r0, #0 + ldr r6, =gUnknown_02021990 + ldr r0, [r6, #0x24] + movs r1, #4 + str r1, [sp] + movs r7, #0 + str r7, [sp, #4] + movs r1, #0 + movs r2, #3 + movs r3, #0x12 + bl sub_020090E4 + ldr r0, [r6, #0x24] + movs r1, #0 + movs r2, #0x18 + bl sub_02009164 + ldr r4, [r6, #0x24] + adds r0, r5, #0 + bl sub_0200C44C + adds r1, r0, #0 + adds r0, r4, #0 + bl sub_02000484 + ldr r0, [r6, #0x24] + movs r1, #0 + movs r2, #0x28 + bl sub_02009164 + ldr r4, [r6, #0x24] + adds r0, r5, #0 + bl sub_0200C464 + adds r1, r0, #0 + adds r0, r4, #0 + bl sub_02000484 + ldrb r0, [r6, #0x18] + cmp r0, #0 + bne _020033A0 + ldr r0, [r6, #0x24] + movs r1, #0xf + movs r2, #0x40 + bl sub_02009164 + ldr r0, [r6, #0x24] + ldr r1, =gUnknown_0201FFE8 + bl sub_02000484 +_020033A0: + mov r1, sl + ldr r0, [r1] + add r0, r8 + movs r1, #0x39 + movs r2, #0 + bl sub_0200C1B8 + adds r1, r0, #0 + add r0, sp, #0xc + bl sub_02000964 + add r1, sp, #0xc + movs r0, #0xba + strb r0, [r1, #3] + mov r1, sl + ldr r0, [r1] + add r0, r8 + movs r1, #0x3a + movs r2, #0 + bl sub_0200C1B8 + adds r1, r0, #0 + add r0, sp, #0x10 + bl sub_02000964 + ldr r0, [r6, #0x24] + movs r1, #0x2d + movs r2, #0x40 + bl sub_02009164 + ldr r0, [r6, #0x24] + movs r5, #6 + strb r5, [r0, #0x1c] + ldr r0, [r6, #0x24] + movs r4, #2 + str r4, [sp] + str r7, [sp, #4] + movs r1, #5 + movs r2, #8 + movs r3, #6 + bl sub_020090E4 + ldr r0, [r6, #0x24] + add r1, sp, #0xc + bl sub_02000484 + ldrb r0, [r6, #0x18] + cmp r0, #0 + bne _02003414 + ldr r0, [r6, #0x24] + movs r1, #2 + movs r2, #0x50 + bl sub_02009164 + ldr r0, [r6, #0x24] + ldr r1, =gUnknown_0201FFEB + bl sub_02000484 +_02003414: + ldr r0, [r6, #0x24] + strb r5, [r0, #0x1c] + ldr r0, [r6, #0x24] + str r4, [sp] + str r7, [sp, #4] + movs r1, #5 + movs r2, #0xa + movs r3, #6 + bl sub_020090E4 + ldr r7, [r6, #0x24] + movs r6, #0x2d + mov r1, sl + ldr r0, [r1] + add r0, r8 + movs r1, #0x3b + movs r2, #0 + bl sub_0200C1B8 + adds r4, r0, #0 + add r0, sp, #0x1c + adds r1, r4, #0 + bl sub_02000964 + movs r5, #1 + cmp r4, #9 + ble _02003452 + movs r5, #3 + cmp r4, #0x63 + bgt _02003452 + movs r5, #2 +_02003452: + adds r1, r6, #0 + adds r1, #0x15 + lsls r0, r5, #1 + adds r0, r0, r5 + subs r6, r1, r0 + adds r0, r7, #0 + adds r1, r6, #0 + movs r2, #0x50 + bl sub_02009164 + mov r4, sp + adds r4, #0x1f + subs r1, r4, r5 + adds r0, r7, #0 + bl sub_02000484 + ldr r5, =gUnknown_02021990 + ldrb r0, [r5, #0x18] + mov r8, r4 + cmp r0, #0 + bne _0200348E + ldr r0, [r5, #0x24] + movs r1, #0 + movs r2, #0x60 + bl sub_02009164 + ldr r0, [r5, #0x24] + ldr r1, =gUnknown_0201FFF2 + bl sub_02000484 +_0200348E: + ldr r1, [r5, #0x24] + movs r2, #0 + movs r0, #6 + strb r0, [r1, #0x1c] + ldr r0, [r5, #0x24] + movs r1, #2 + str r1, [sp] + str r2, [sp, #4] + movs r1, #6 + movs r2, #0xc + movs r3, #5 + bl sub_020090E4 + ldr r7, [r5, #0x24] + movs r6, #0x2d + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + mov r1, sb + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + movs r1, #0x3c + movs r2, #0 + bl sub_0200C1B8 + adds r5, r0, #0 + add r0, sp, #0x1c + adds r1, r5, #0 + bl sub_02000964 + movs r4, #1 + cmp r5, #9 + ble _020034D8 + movs r4, #3 + cmp r5, #0x63 + bgt _020034D8 + movs r4, #2 +_020034D8: + adds r1, r6, #0 + adds r1, #0x15 + lsls r0, r4, #1 + adds r0, r0, r4 + subs r6, r1, r0 + adds r0, r7, #0 + adds r1, r6, #0 + movs r2, #0x60 + bl sub_02009164 + mov r0, r8 + subs r1, r0, r4 + adds r0, r7, #0 + bl sub_02000484 + ldr r5, =gUnknown_02021990 + ldr r0, [r5, #0x24] + movs r1, #6 + str r1, [sp] + movs r1, #0 + str r1, [sp, #4] + movs r1, #0x10 + movs r2, #8 + movs r3, #3 + bl sub_020090E4 + ldrb r0, [r5, #0x18] + cmp r0, #0 + bne _02003524 + ldr r0, [r5, #0x24] + movs r1, #0x58 + movs r2, #0x40 + bl sub_02009164 + ldr r0, [r5, #0x24] + ldr r1, =gUnknown_0201FFFA + bl sub_02000484 +_02003524: + ldr r7, [r5, #0x24] + movs r6, #0x80 + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + mov r1, sb + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + movs r1, #0x3e + movs r2, #0 + bl sub_0200C1B8 + adds r5, r0, #0 + add r0, sp, #0x1c + adds r1, r5, #0 + bl sub_02000964 + movs r4, #1 + cmp r5, #9 + ble _02003554 + movs r4, #3 + cmp r5, #0x63 + bgt _02003554 + movs r4, #2 +_02003554: + adds r1, r6, #0 + adds r1, #9 + lsls r0, r4, #1 + adds r0, r0, r4 + subs r6, r1, r0 + adds r0, r7, #0 + adds r1, r6, #0 + movs r2, #0x40 + bl sub_02009164 + mov r0, r8 + subs r1, r0, r4 + adds r0, r7, #0 + bl sub_02000484 + ldr r5, =gUnknown_02021990 + ldrb r0, [r5, #0x18] + cmp r0, #0 + bne _0200358C + ldr r0, [r5, #0x24] + movs r1, #0x58 + movs r2, #0x50 + bl sub_02009164 + ldr r0, [r5, #0x24] + ldr r1, =gUnknown_02020002 + bl sub_02000484 +_0200358C: + ldr r7, [r5, #0x24] + movs r6, #0x80 + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + mov r1, sb + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + movs r1, #0x3f + movs r2, #0 + bl sub_0200C1B8 + adds r5, r0, #0 + add r0, sp, #0x1c + adds r1, r5, #0 + bl sub_02000964 + movs r4, #1 + cmp r5, #9 + ble _020035BC + movs r4, #3 + cmp r5, #0x63 + bgt _020035BC + movs r4, #2 +_020035BC: + adds r1, r6, #0 + adds r1, #9 + lsls r0, r4, #1 + adds r0, r0, r4 + subs r6, r1, r0 + adds r0, r7, #0 + adds r1, r6, #0 + movs r2, #0x50 + bl sub_02009164 + mov r0, r8 + subs r1, r0, r4 + adds r0, r7, #0 + bl sub_02000484 + ldr r5, =gUnknown_02021990 + ldrb r0, [r5, #0x18] + cmp r0, #0 + bne _020035F4 + ldr r0, [r5, #0x24] + movs r1, #0x58 + movs r2, #0x60 + bl sub_02009164 + ldr r0, [r5, #0x24] + ldr r1, =gUnknown_0202000A + bl sub_02000484 +_020035F4: + ldr r7, [r5, #0x24] + movs r6, #0x80 + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + mov r1, sb + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + movs r1, #0x3d + movs r2, #0 + bl sub_0200C1B8 + adds r5, r0, #0 + add r0, sp, #0x1c + adds r1, r5, #0 + bl sub_02000964 + movs r4, #1 + cmp r5, #9 + ble _02003624 + movs r4, #3 + cmp r5, #0x63 + bgt _02003624 + movs r4, #2 +_02003624: + adds r1, r6, #0 + adds r1, #9 + lsls r0, r4, #1 + adds r0, r0, r4 + subs r6, r1, r0 + adds r0, r7, #0 + adds r1, r6, #0 + movs r2, #0x60 + bl sub_02009164 + mov r0, r8 + subs r1, r0, r4 + adds r0, r7, #0 + bl sub_02000484 + ldr r4, =gUnknown_02021990 + ldr r0, [r4, #0x24] + movs r1, #2 + str r1, [sp] + movs r1, #0 + str r1, [sp, #4] + movs r2, #0xf + movs r3, #0x12 + bl sub_020090E4 + ldr r0, [r4, #0x24] + movs r1, #0 + movs r2, #0x78 + bl sub_02009164 + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + mov r1, sb + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + movs r1, #0xc + movs r2, #0 + bl sub_0200C1B8 + adds r1, r0, #0 + cmp r1, #0 + bne _020036A8 + ldr r0, [r4, #0x24] + ldr r1, =gUnknown_02020010 + bl sub_02000484 + b _020036BA + .align 2, 0 + .pool +_020036A8: + ldr r2, =gUnknown_02020015 + adds r0, r1, #0 + add r1, sp, #0xc + bl sub_0200C6A4 + ldr r0, [r4, #0x24] + add r1, sp, #0xc + bl sub_02000484 +_020036BA: + ldr r4, =gUnknown_02021990 + ldr r0, [r4, #0x28] + cmp r0, #0 + bne _020036CC + ldr r1, =gUnknown_0201FB70 + movs r0, #1 + bl sub_02008F6C + str r0, [r4, #0x28] +_020036CC: + ldr r0, [r4, #0x28] + movs r1, #0 + bl sub_020090B0 + ldr r3, =0x0000F00B + movs r0, #0 + movs r1, #0x17 + movs r2, #0 + bl sub_020088E8 + ldr r3, =0x0000F00D + movs r0, #0 + movs r1, #0x18 + movs r2, #0 + bl sub_020088E8 + ldr r3, =0x0000F00C + movs r0, #0 + movs r1, #0x17 + movs r2, #1 + bl sub_020088E8 + ldr r3, =0x0000F00E + movs r0, #0 + movs r1, #0x18 + movs r2, #1 + bl sub_020088E8 + ldr r0, [r4, #0x28] + movs r1, #1 + movs r2, #8 + bl sub_0200914C + ldr r0, [r4, #0x24] + movs r1, #0 + movs r2, #0 + bl sub_02009164 + ldr r0, [r4, #0x28] + ldr r1, =gUnknown_0202001B + bl sub_02000484 + movs r0, #2 + str r0, [sp] + movs r0, #0xb + str r0, [sp, #4] + movs r0, #0 + str r0, [sp, #8] + movs r0, #3 + movs r1, #0 + movs r2, #0x14 + movs r3, #4 + bl sub_02008948 + ldr r0, [r4, #0x1c] + movs r1, #0 + bl sub_020090B0 + ldr r0, [r4, #0x1c] + ldr r1, =gUnknown_0201FFC7 + bl sub_02000484 + ldr r1, =gUnknown_02022C20 + movs r0, #1 + strb r0, [r1] + strb r0, [r1, #3] + strb r0, [r4, #0x18] + add sp, #0x24 + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200378C +sub_0200378C: @ 0x0200378C + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #0x40 + ldr r2, =gUnknown_02022EF4 + movs r1, #0x64 + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + str r0, [sp, #0x24] + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + adds r0, #0xcc + ldr r0, [r0] + str r0, [sp, #0x28] + ldr r4, =gUnknown_02021990 + ldr r0, [r4, #0x24] + movs r1, #1 + movs r2, #8 + bl sub_0200914C + movs r0, #8 + str r0, [sp] + movs r0, #0xf + str r0, [sp, #4] + movs r0, #0 + movs r1, #0x18 + movs r2, #4 + movs r3, #5 + bl sub_02008894 + adds r4, #0x4c + ldr r0, =0x0000FFFF + strh r0, [r4] + movs r0, #0 + mov sb, r0 + add r1, sp, #0xc + mov r8, r1 + movs r2, #5 + str r2, [sp, #0x2c] + movs r0, #4 + str r0, [sp, #0x30] + movs r1, #8 + mov sl, r1 + movs r2, #0 + str r2, [sp, #0x34] + movs r0, #1 + str r0, [sp, #0x38] + movs r1, #0 + str r1, [sp, #0x3c] +_020037F4: + ldr r0, [sp, #0x24] + mov r1, sb + bl sub_0200B6F4 + adds r6, r0, #0 + mov r2, sb + lsls r1, r2, #0x18 + lsrs r1, r1, #0x18 + ldr r0, [sp, #0x24] + bl sub_0200B728 + str r0, [sp, #0x1c] + ldr r0, [sp, #0x24] + movs r1, #0x15 + movs r2, #0 + bl sub_0200C1B8 + adds r1, r0, #0 + adds r0, r6, #0 + mov r2, sb + bl sub_0200C478 + str r0, [sp, #0x20] + lsls r0, r6, #1 + adds r0, r0, r6 + lsls r0, r0, #2 + ldr r1, [sp, #0x28] + adds r0, r0, r1 + ldrb r7, [r0, #2] + ldr r1, =gUnknown_02021990 + adds r0, r1, #0 + adds r0, #0x44 + ldr r2, [sp, #0x3c] + adds r0, r2, r0 + strh r6, [r0] + mov r2, sb + lsls r0, r2, #2 + adds r1, #0x2c + adds r5, r0, r1 + ldr r0, [r5] + cmp r0, #0 + bne _02003856 + ldr r1, [sp, #0x34] + adds r1, #0x20 + movs r0, #0x57 + ldr r2, =gUnknown_0201FA44 + bl sub_02008A10 + str r0, [r5] +_02003856: + cmp r6, #0 + beq _02003890 + ldr r0, [r5] + lsls r1, r7, #3 + bl sub_02008D5C + ldr r4, [r5] + adds r0, r7, #0 + bl sub_0200C440 + adds r1, r0, #0 + adds r0, r4, #0 + bl sub_02008D54 + ldr r0, [r5] + movs r1, #0 + bl sub_02008D60 + b _02003898 + .align 2, 0 + .pool +_02003890: + ldr r0, [r5] + movs r1, #1 + bl sub_02008D60 +_02003898: + ldr r4, =gUnknown_02021990 + ldr r0, [r4, #0x24] + movs r1, #2 + str r1, [sp] + movs r2, #0 + str r2, [sp, #4] + movs r1, #4 + ldr r2, [sp, #0x38] + movs r3, #9 + bl sub_020090E4 + add r0, sp, #0xc + adds r1, r6, #0 + bl sub_0200C4B8 + ldr r0, [r4, #0x24] + movs r1, #0x20 + mov r2, sl + bl sub_02009164 + ldr r0, [r4, #0x24] + add r1, sp, #0xc + bl sub_02000484 + ldr r0, [r4, #0x24] + movs r1, #2 + str r1, [sp] + movs r2, #0 + str r2, [sp, #4] + movs r1, #0xd + ldr r2, [sp, #0x38] + movs r3, #5 + bl sub_020090E4 + cmp r6, #0 + beq _02003944 + add r0, sp, #0xc + ldr r1, [sp, #0x1c] + bl sub_02000964 + movs r0, #0xba + mov r1, r8 + strb r0, [r1, #3] + add r0, sp, #0x10 + ldr r1, [sp, #0x20] + bl sub_02000964 + mov r2, r8 + ldrb r0, [r2, #5] + strb r0, [r2, #4] + ldrb r0, [r2, #6] + strb r0, [r2, #5] + ldrb r0, [r2, #7] + strb r0, [r2, #6] + ldr r1, [r4, #0x24] + movs r0, #6 + strb r0, [r1, #0x1c] + ldr r0, [r4, #0x24] + movs r1, #0x6c + mov r2, sl + bl sub_02009164 + ldr r0, [r4, #0x24] + add r1, sp, #0xc + bl sub_02000484 + movs r0, #0 + movs r1, #0x18 + ldr r2, [sp, #0x30] + ldr r3, =0x0000F003 + bl sub_020088E8 + movs r0, #0 + movs r1, #0x18 + ldr r2, [sp, #0x2c] + ldr r3, =0x0000F004 + bl sub_020088E8 + b _02003972 + .align 2, 0 + .pool +_02003944: + ldr r0, [r4, #0x24] + movs r1, #0x78 + mov r2, sl + bl sub_02009164 + ldr r0, [r4, #0x24] + ldr r1, =gUnknown_02020029 + bl sub_02000484 + movs r4, #0xf0 + lsls r4, r4, #8 + movs r0, #0 + movs r1, #0x18 + ldr r2, [sp, #0x30] + adds r3, r4, #0 + bl sub_020088E8 + movs r0, #0 + movs r1, #0x18 + ldr r2, [sp, #0x2c] + adds r3, r4, #0 + bl sub_020088E8 +_02003972: + ldr r0, [sp, #0x2c] + adds r0, #2 + str r0, [sp, #0x2c] + ldr r1, [sp, #0x30] + adds r1, #2 + str r1, [sp, #0x30] + movs r2, #0x10 + add sl, r2 + ldr r0, [sp, #0x34] + adds r0, #0x10 + str r0, [sp, #0x34] + ldr r1, [sp, #0x38] + adds r1, #2 + str r1, [sp, #0x38] + ldr r2, [sp, #0x3c] + adds r2, #2 + str r2, [sp, #0x3c] + movs r0, #1 + add sb, r0 + mov r1, sb + cmp r1, #3 + bgt _020039A0 + b _020037F4 +_020039A0: + ldr r4, =gUnknown_02021990 + ldr r0, [r4, #0x28] + cmp r0, #0 + bne _020039B2 + ldr r1, =gUnknown_0201FB70 + movs r0, #1 + bl sub_02008F6C + str r0, [r4, #0x28] +_020039B2: + ldr r0, [r4, #0x28] + movs r1, #0 + bl sub_020090B0 + ldr r3, =0x0000F00B + movs r0, #0 + movs r1, #0x17 + movs r2, #0 + bl sub_020088E8 + ldr r3, =0x0000F00D + movs r0, #0 + movs r1, #0x18 + movs r2, #0 + bl sub_020088E8 + ldr r3, =0x0000F00C + movs r0, #0 + movs r1, #0x17 + movs r2, #1 + bl sub_020088E8 + ldr r3, =0x0000F00E + movs r0, #0 + movs r1, #0x18 + movs r2, #1 + bl sub_020088E8 + ldr r0, [r4, #0x28] + movs r1, #1 + movs r2, #8 + bl sub_0200914C + ldr r0, [r4, #0x28] + movs r1, #0 + movs r2, #0 + bl sub_02009164 + ldr r0, [r4, #0x28] + ldr r1, =gUnknown_02020022 + bl sub_02000484 + movs r0, #2 + str r0, [sp] + movs r0, #0xb + str r0, [sp, #4] + movs r0, #0 + str r0, [sp, #8] + movs r0, #3 + movs r1, #4 + movs r2, #0x14 + movs r3, #4 + bl sub_02008948 + ldr r0, [r4, #0x1c] + movs r1, #0 + bl sub_020090B0 + ldr r0, [r4, #0x1c] + ldr r1, =gUnknown_0201FFD6 + bl sub_02000484 + ldr r1, =gUnknown_02022C20 + movs r0, #1 + strb r0, [r1] + strb r0, [r1, #2] + strb r0, [r1, #3] + add sp, #0x40 + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02003A70 +sub_02003A70: @ 0x02003A70 + push {r4, r5, r6, r7, lr} + mov r7, r8 + push {r7} + sub sp, #0x10 + adds r6, r1, #0 + ldr r2, =gUnknown_02022EF4 + movs r1, #0x64 + muls r1, r0, r1 + ldr r0, [r2] + adds r7, r0, r1 + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + adds r0, #0xcc + ldr r0, [r0] + mov r8, r0 + ldr r5, =gUnknown_02021990 + ldr r0, [r5, #0x20] + movs r4, #4 + str r4, [sp] + movs r1, #0 + str r1, [sp, #4] + movs r1, #6 + movs r2, #3 + movs r3, #3 + bl sub_020090E4 + str r4, [sp] + movs r0, #0xf + str r0, [sp, #4] + movs r0, #0 + movs r1, #7 + movs r2, #0xf + movs r3, #3 + bl sub_02008894 + cmp r6, #4 + bne _02003AF4 + ldr r0, [r5, #0x20] + movs r1, #0x30 + movs r2, #0x18 + bl sub_02009164 + ldr r0, [r5, #0x20] + ldr r4, =gUnknown_0202002C + adds r1, r4, #0 + bl sub_02000484 + ldr r0, [r5, #0x20] + movs r1, #0x30 + movs r2, #0x28 + bl sub_02009164 + ldr r0, [r5, #0x20] + adds r1, r4, #0 + bl sub_02000484 + b _02003B92 + .align 2, 0 + .pool +_02003AF4: + adds r0, r7, #0 + adds r1, r6, #0 + bl sub_0200B6F4 + adds r6, r0, #0 + ldr r0, =0x0000FFFF + cmp r6, r0 + beq _02003B8C + ldr r0, [r5, #0x20] + movs r1, #0x34 + movs r2, #0x18 + bl sub_02009164 + ldr r1, [r5, #0x20] + movs r0, #6 + strb r0, [r1, #0x1c] + lsls r1, r6, #1 + adds r0, r1, r6 + lsls r0, r0, #2 + add r0, r8 + adds r7, r1, #0 + ldrb r1, [r0, #1] + cmp r1, #1 + bhi _02003B38 + ldr r0, [r5, #0x20] + ldr r1, =gUnknown_0202002C + bl sub_02000484 + b _02003B48 + .align 2, 0 + .pool +_02003B38: + ldrb r1, [r0, #1] + add r0, sp, #8 + bl sub_02000964 + ldr r0, [r5, #0x20] + add r1, sp, #8 + bl sub_02000484 +_02003B48: + ldr r4, =gUnknown_02021990 + ldr r0, [r4, #0x20] + movs r1, #0x34 + movs r2, #0x28 + bl sub_02009164 + ldr r1, [r4, #0x20] + movs r0, #6 + strb r0, [r1, #0x1c] + adds r0, r7, r6 + lsls r0, r0, #2 + mov r2, r8 + adds r1, r0, r2 + ldrb r0, [r1, #3] + cmp r0, #0 + bne _02003B7C + ldr r0, [r4, #0x20] + ldr r1, =gUnknown_0202002C + bl sub_02000484 + b _02003B8C + .align 2, 0 + .pool +_02003B7C: + ldrb r1, [r1, #3] + add r0, sp, #8 + bl sub_02000964 + ldr r0, [r4, #0x20] + add r1, sp, #8 + bl sub_02000484 +_02003B8C: + ldr r1, =gUnknown_02022C20 + movs r0, #1 + strb r0, [r1] +_02003B92: + add sp, #0x10 + pop {r3} + mov r8, r3 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02003BA4 +sub_02003BA4: @ 0x02003BA4 + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #0x10 + str r0, [sp, #0xc] + mov sb, r1 + ldr r7, =gUnknown_02021990 + ldr r0, =gUnknown_020219DF + ldrb r6, [r0] + cmp r6, #0 + bne _02003CB4 + ldr r0, [r7, #0x20] + movs r1, #6 + str r1, [sp] + str r6, [sp, #4] + movs r1, #0 + movs r2, #2 + movs r3, #9 + bl sub_020090E4 + ldr r0, [r7, #0x10] + cmp r0, #0 + beq _02003BDC + movs r1, #1 + bl sub_02008D60 +_02003BDC: + ldr r0, [r7, #0x20] + bl sub_020091B0 + movs r0, #2 + str r0, [sp] + movs r0, #0xf0 + lsls r0, r0, #8 + str r0, [sp, #4] + movs r0, #3 + movs r1, #0 + movs r2, #0x12 + movs r3, #0xa + bl sub_02008904 + movs r1, #1 + mov r8, r1 + mov r1, r8 + ldr r0, =gUnknown_02022C20 + strb r1, [r0, #3] + movs r4, #7 + str r4, [sp] + str r4, [sp, #4] + movs r5, #0xd + str r5, [sp, #8] + movs r0, #2 + movs r1, #0x14 + movs r2, #0x14 + movs r3, #3 + bl sub_02008948 + mov r1, r8 + ldr r0, =gUnknown_02022C20 + strb r1, [r0, #2] + movs r0, #1 + bl sub_02008600 + str r4, [sp] + movs r0, #4 + str r0, [sp, #4] + str r5, [sp, #8] + movs r0, #2 + movs r1, #0x14 + movs r2, #0x14 + movs r3, #6 + bl sub_02008948 + mov r1, r8 + ldr r0, =gUnknown_02022C20 + strb r1, [r0, #2] + movs r0, #1 + bl sub_02008600 + str r4, [sp] + str r6, [sp, #4] + str r5, [sp, #8] + movs r0, #2 + movs r1, #0x14 + movs r2, #0x14 + movs r3, #0xa + bl sub_02008948 + mov r1, r8 + ldr r0, =gUnknown_02022C20 + strb r1, [r0, #2] + ldr r0, [r7, #0xc] + movs r1, #1 + bl sub_02008D60 + ldr r0, [r7, #0x20] + movs r1, #0 + movs r2, #0x18 + bl sub_02009164 + ldr r0, [r7, #0x20] + ldr r1, =gUnknown_02020030 + bl sub_02000484 + ldr r0, [r7, #0x20] + movs r1, #0 + movs r2, #0x28 + bl sub_02009164 + ldr r0, [r7, #0x20] + ldr r1, =gUnknown_02020036 + bl sub_02000484 + ldr r0, [sp, #0xc] + mov r1, sb + bl sub_02003A70 + movs r0, #1 + bl sub_02008600 + mov r1, r8 + ldr r0, =gUnknown_020219DF + strb r1, [r0] + b _02003D66 + .align 2, 0 + .pool +_02003CB4: + ldr r0, [r7, #0x20] + movs r1, #5 + str r1, [sp] + movs r1, #0 + mov sb, r1 + str r1, [sp, #4] + movs r2, #2 + movs r3, #9 + bl sub_020090E4 + movs r5, #7 + str r5, [sp] + mov r0, sb + str r0, [sp, #4] + movs r1, #0xd + mov sl, r1 + str r1, [sp, #8] + movs r0, #2 + movs r1, #0 + movs r2, #0 + movs r3, #0xa + bl sub_02008948 + str r5, [sp] + movs r0, #4 + str r0, [sp, #4] + mov r0, sl + str r0, [sp, #8] + movs r0, #2 + movs r1, #0x14 + movs r2, #0x14 + movs r3, #6 + bl sub_02008948 + ldr r0, [r7, #0xc] + movs r1, #0 + bl sub_02008D60 + ldr r1, =gUnknown_02022C20 + mov r8, r1 + movs r4, #1 + strb r4, [r1, #2] + movs r0, #1 + bl sub_02008600 + str r5, [sp] + str r4, [sp, #4] + mov r0, sl + str r0, [sp, #8] + movs r0, #2 + movs r1, #0 + movs r2, #0 + movs r3, #9 + bl sub_02008948 + str r5, [sp] + str r5, [sp, #4] + mov r1, sl + str r1, [sp, #8] + movs r0, #2 + movs r1, #0x14 + movs r2, #0x14 + movs r3, #3 + bl sub_02008948 + mov r0, r8 + strb r4, [r0, #2] + movs r0, #1 + bl sub_02008600 + str r5, [sp] + str r4, [sp, #4] + mov r1, sl + str r1, [sp, #8] + movs r0, #2 + movs r1, #0 + movs r2, #0 + movs r3, #9 + bl sub_02008948 + mov r0, r8 + strb r4, [r0, #2] + ldr r0, [sp, #0xc] + movs r1, #1 + bl sub_02003D80 + mov r0, sb + ldr r1, =gUnknown_020219DF + strb r0, [r1] +_02003D66: + add sp, #0x10 + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02003D80 +sub_02003D80: @ 0x02003D80 + push {r4, r5, r6, r7, lr} + mov r7, r8 + push {r7} + sub sp, #0x2c + adds r5, r0, #0 + ldr r3, =gUnknown_02022EF4 + movs r0, #0x64 + adds r2, r5, #0 + muls r2, r0, r2 + ldr r0, [r3] + adds r6, r0, r2 + cmp r1, #0 + bne _02003DEE + ldr r4, =gUnknown_02021990 + adds r0, r4, #0 + adds r1, r5, #0 + movs r2, #8 + movs r3, #0x20 + bl sub_020030E4 + ldr r0, [r4, #0x1c] + cmp r0, #0 + bne _02003DC0 + ldr r1, =gUnknown_0201FB10 + movs r0, #2 + bl sub_02008F6C + str r0, [r4, #0x1c] + movs r1, #1 + movs r2, #8 + bl sub_0200914C +_02003DC0: + ldr r0, [r4, #0x20] + movs r1, #0 + bl sub_020090B0 + ldr r0, [r4, #0x20] + movs r1, #1 + movs r2, #8 + bl sub_0200914C + adds r0, r6, #0 + movs r1, #2 + add r2, sp, #0xc + bl sub_0200C1B8 + ldr r0, [r4, #0x20] + movs r1, #0 + movs r2, #0 + bl sub_02009164 + ldr r0, [r4, #0x20] + add r1, sp, #0xc + bl sub_02000484 +_02003DEE: + add r1, sp, #0xc + movs r0, #0x34 + strb r0, [r1] + movs r0, #0xff + strb r0, [r1, #1] + ldr r4, =gUnknown_02021990 + ldr r0, [r4, #0x20] + movs r1, #0x10 + movs r2, #0x20 + bl sub_02009164 + ldr r0, [r4, #0x20] + add r1, sp, #0xc + bl sub_02000484 + adds r0, r6, #0 + movs r1, #0x38 + movs r2, #0 + bl sub_0200C1B8 + add r1, sp, #0xc + movs r2, #0xa1 + bl sub_02000900 + movs r5, #0 + add r0, sp, #0xc + add r7, sp, #0x1c + movs r1, #0x1d + add r1, sp + mov r8, r1 + b _02003E40 + .align 2, 0 + .pool +_02003E38: + adds r5, #1 + mov r0, sp + adds r0, r0, r5 + adds r0, #0xc +_02003E40: + ldrb r0, [r0] + cmp r0, #0xa1 + beq _02003E38 + mov r0, sp + adds r0, r0, r5 + adds r0, #0xc + ldrb r0, [r0] + cmp r0, #0xff + bne _02003E54 + subs r5, #1 +_02003E54: + ldr r4, =gUnknown_02021990 + ldr r0, [r4, #0x20] + movs r1, #0x19 + movs r2, #0x20 + bl sub_02009164 + ldr r1, [r4, #0x20] + movs r0, #6 + strb r0, [r1, #0x1c] + ldr r0, [r4, #0x20] + mov r1, sp + adds r1, r1, r5 + adds r1, #0xc + bl sub_02000484 + movs r0, #2 + str r0, [sp] + movs r0, #0xd + str r0, [sp, #4] + movs r0, #0 + movs r1, #1 + movs r2, #0xe + movs r3, #9 + bl sub_02008894 + adds r0, r6, #0 + movs r1, #0xb + movs r2, #0 + bl sub_0200C1B8 + adds r5, r0, #0 + mov r0, r8 + adds r1, r5, #0 + bl sub_0200C378 + movs r0, #0xba + strb r0, [r7] + ldr r0, [r4, #0x20] + movs r1, #0 + movs r2, #0x10 + bl sub_02009164 + ldr r0, [r4, #0x20] + adds r1, r7, #0 + bl sub_02000484 + cmp r5, #0x20 + beq _02003F0C + cmp r5, #0x1d + beq _02003F0C + adds r0, r6, #0 + bl sub_0200C254 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + cmp r0, #0 + beq _02003ED8 + cmp r0, #0xfe + bne _02003F0C + add r1, sp, #0xc + movs r0, #0xb6 + strb r0, [r1] + movs r5, #0xc + b _02003EE0 + .align 2, 0 + .pool +_02003ED8: + add r1, sp, #0xc + movs r0, #0xb5 + strb r0, [r1] + movs r5, #0xb +_02003EE0: + add r1, sp, #0xc + movs r0, #0xff + strb r0, [r1, #1] + ldr r4, =gUnknown_02021990 + ldr r0, [r4, #0x20] + movs r1, #0x30 + movs r2, #0x20 + bl sub_02009164 + movs r0, #2 + str r0, [sp] + str r5, [sp, #4] + movs r0, #0 + movs r1, #7 + movs r2, #0x10 + movs r3, #1 + bl sub_02008894 + ldr r0, [r4, #0x20] + add r1, sp, #0xc + bl sub_02000484 +_02003F0C: + ldr r5, =gUnknown_02021990 + ldr r0, [r5, #0xc] + cmp r0, #0 + bne _02003F20 + ldr r2, =gUnknown_0201FA5C + movs r0, #0 + movs r1, #0x80 + bl sub_02008A10 + str r0, [r5, #0xc] +_02003F20: + ldr r0, [r5, #0xc] + movs r1, #3 + bl sub_02008D54 + adds r0, r6, #0 + bl sub_0200B5C4 + ldr r1, =0x06012800 + bl LZ77UnCompVRAM + adds r0, r6, #0 + bl sub_0200B65C + ldr r1, =0x05000260 + bl LZ77UnCompVRAM + adds r0, r6, #0 + bl sub_0200B7D0 + adds r4, r0, #0 + cmp r4, #0 + beq _02003FB0 + movs r0, #2 + str r0, [sp] + movs r0, #0 + str r0, [sp, #4] + movs r0, #0x12 + str r0, [sp, #8] + movs r0, #3 + movs r1, #8 + movs r2, #0x14 + movs r3, #0xa + bl sub_02008948 + ldr r0, [r5, #0x20] + ldr r3, =gUnknown_02020046 + movs r1, #0 + movs r2, #0x30 + bl sub_020009C4 + ldr r0, [r5, #0x10] + cmp r0, #0 + bne _02003F82 + ldr r2, =gUnknown_0201FAF8 + movs r0, #0x2f + movs r1, #0x94 + bl sub_02008A10 + str r0, [r5, #0x10] +_02003F82: + ldr r0, [r5, #0x10] + movs r1, #0 + bl sub_02008D60 + ldr r0, [r5, #0x10] + subs r1, r4, #1 + lsls r1, r1, #2 + bl sub_02008D5C + b _02003FCE + .align 2, 0 + .pool +_02003FB0: + movs r0, #2 + str r0, [sp] + str r4, [sp, #4] + movs r0, #3 + movs r1, #0 + movs r2, #0x12 + movs r3, #0xa + bl sub_02008904 + ldr r0, [r5, #0x10] + cmp r0, #0 + beq _02003FCE + movs r1, #1 + bl sub_02008D60 +_02003FCE: + adds r0, r6, #0 + movs r1, #0 + bl sub_0200B838 + adds r4, r0, #0 + adds r0, r6, #0 + movs r1, #0 + bl sub_0200B764 + cmp r0, #0 + bne _02003FFC + cmp r4, #0 + beq _02003FFC + ldr r3, =0x0000F013 + movs r0, #0 + movs r1, #2 + movs r2, #0x11 + bl sub_020088E8 + b _0200400A + .align 2, 0 + .pool +_02003FFC: + movs r3, #0xf0 + lsls r3, r3, #8 + movs r0, #0 + movs r1, #2 + movs r2, #0x11 + bl sub_020088E8 +_0200400A: + ldr r1, =gUnknown_02022C20 + movs r0, #1 + strb r0, [r1] + strb r0, [r1, #3] + add sp, #0x2c + pop {r3} + mov r8, r3 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02004024 +sub_02004024: @ 0x02004024 + push {r4, r5, lr} + adds r5, r0, #0 + ldr r1, =gUnknown_02021990 + movs r0, #0 + strb r0, [r1, #0x18] + adds r0, r5, #0 + bl sub_020031F8 +_02004034: + movs r0, #1 + bl sub_02008600 + ldr r0, =gUnknown_02022EB0 + ldrh r4, [r0] + movs r0, #0x40 + ands r0, r4 + cmp r0, #0 + beq _02004060 + cmp r5, #0 + beq _02004060 + movs r0, #0 + bl sub_02009344 + subs r5, #1 + adds r0, r5, #0 + movs r1, #0 + bl sub_02003D80 + adds r0, r5, #0 + bl sub_020031F8 +_02004060: + movs r0, #0x80 + ands r0, r4 + cmp r0, #0 + beq _0200409C + cmp r5, #5 + beq _0200409C + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + adds r1, r5, #0 + muls r1, r0, r1 + adds r1, #0x64 + ldr r0, [r2] + adds r0, r0, r1 + movs r1, #0xb + movs r2, #0 + bl sub_0200C1B8 + cmp r0, #0 + beq _0200409C + movs r0, #0 + bl sub_02009344 + adds r5, #1 + adds r0, r5, #0 + movs r1, #0 + bl sub_02003D80 + adds r0, r5, #0 + bl sub_020031F8 +_0200409C: + movs r0, #0x10 + ands r0, r4 + cmp r0, #0 + beq _020040B8 + movs r0, #0 + bl sub_02009344 + b _020040D0 + .align 2, 0 + .pool +_020040B8: + movs r0, #3 + ands r4, r0 + cmp r4, #0 + beq _02004034 + movs r0, #0 + bl sub_02009344 + ldr r0, =gUnknown_02021990 + adds r0, #0x50 + strb r5, [r0] + movs r5, #1 + rsbs r5, r5, #0 +_020040D0: + movs r0, #1 + rsbs r0, r0, #0 + cmp r5, r0 + beq _020040E6 + ldr r4, =gUnknown_02021990 + ldr r0, [r4, #4] + bl sub_02008CEC + ldr r0, [r4, #8] + bl sub_02008CEC +_020040E6: + ldr r1, =gUnknown_02021990 + movs r0, #0 + str r0, [r1, #4] + str r0, [r1, #8] + adds r0, r5, #0 + pop {r4, r5} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_020040FC +sub_020040FC: @ 0x020040FC + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #0x14 + mov r8, r0 + ldr r4, =gUnknown_02021990 + movs r0, #0 + strb r0, [r4, #0x18] + movs r0, #2 + movs r1, #0 + movs r2, #0 + bl sub_020089A4 + mov r0, r8 + bl sub_0200378C + movs r0, #0 + str r0, [sp, #0xc] + mov sb, r4 +_02004126: + movs r0, #1 + bl sub_02008600 + ldr r0, =gUnknown_02022EB0 + ldrh r5, [r0] + movs r0, #0x40 + ands r0, r5 + cmp r0, #0 + beq _02004158 + mov r1, r8 + cmp r1, #0 + beq _02004158 + movs r0, #0 + bl sub_02009344 + movs r0, #1 + rsbs r0, r0, #0 + add r8, r0 + mov r0, r8 + movs r1, #0 + bl sub_02003D80 + mov r0, r8 + bl sub_0200378C +_02004158: + movs r0, #0x80 + ands r0, r5 + cmp r0, #0 + beq _02004198 + mov r1, r8 + cmp r1, #5 + beq _02004198 + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + mov r1, r8 + muls r1, r0, r1 + adds r1, #0x64 + ldr r0, [r2] + adds r0, r0, r1 + movs r1, #0xb + movs r2, #0 + bl sub_0200C1B8 + cmp r0, #0 + beq _02004198 + movs r0, #0 + bl sub_02009344 + movs r0, #1 + add r8, r0 + mov r0, r8 + movs r1, #0 + bl sub_02003D80 + mov r0, r8 + bl sub_0200378C +_02004198: + movs r0, #0x20 + ands r0, r5 + cmp r0, #0 + beq _020041B4 + movs r0, #0 + bl sub_02009344 + b _020044AC + .align 2, 0 + .pool +_020041B4: + movs r4, #2 + adds r0, r5, #0 + ands r0, r4 + lsls r0, r0, #0x10 + lsrs r6, r0, #0x10 + cmp r6, #0 + beq _020041DC + movs r0, #0 + bl sub_02009344 + mov r0, r8 + ldr r1, =gUnknown_020219E0 + strb r0, [r1] + movs r1, #1 + rsbs r1, r1, #0 + mov r8, r1 + b _020044AC + .align 2, 0 + .pool +_020041DC: + ldr r0, [sp, #0xc] + cmp r0, #1 + beq _0200420E + cmp r0, #1 + bgt _020041EC + cmp r0, #0 + beq _020041FA + b _02004126 +_020041EC: + ldr r1, [sp, #0xc] + cmp r1, #2 + beq _020042D6 + cmp r1, #3 + bne _020041F8 + b _0200441C +_020041F8: + b _02004126 +_020041FA: + movs r0, #1 + ands r5, r0 + cmp r5, #0 + beq _02004126 + movs r0, #0 + bl sub_02009344 + movs r0, #1 + str r0, [sp, #0xc] + b _02004126 +_0200420E: + mov r0, sb + adds r0, #0x4e + strb r6, [r0] + movs r0, #0x50 + movs r1, #0x20 + ldr r2, =gUnknown_0201FA74 + bl sub_02008A10 + mov r1, sb + str r0, [r1, #0x40] + movs r1, #5 + bl sub_02008D54 + mov r0, sb + ldr r1, [r0, #0x40] + ldr r0, =sub_0200461C + str r0, [r1, #0x10] + movs r0, #3 + str r0, [sp] + movs r0, #0xa + str r0, [sp, #4] + movs r0, #0xb + str r0, [sp, #8] + movs r0, #2 + movs r1, #0 + movs r2, #0x14 + movs r3, #0x14 + bl sub_02008948 + mov r1, sb + ldr r0, [r1, #0x24] + movs r1, #0x20 + movs r2, #0x48 + bl sub_02009164 + mov r1, sb + ldr r0, [r1, #0x24] + ldr r4, =gUnknown_0202003F + adds r1, r4, #0 + bl sub_02000484 + mov r1, sb + ldr r0, [r1, #0x28] + movs r1, #0 + bl sub_020090B0 + mov r1, sb + ldr r0, [r1, #0x28] + adds r1, r4, #0 + bl sub_02000484 + mov r0, sp + ldrb r1, [r0, #0xc] + ldr r0, =gUnknown_02022C20 + strb r1, [r0] + mov r0, r8 + movs r1, #0 + bl sub_02003BA4 + mov r0, r8 + bl sub_0200CB34 + adds r4, r0, #0 + movs r0, #4 + str r0, [sp] + movs r0, #0xf + str r0, [sp, #4] + movs r0, #0 + movs r1, #0xb + movs r2, #0xf + movs r3, #0x12 + bl sub_02008894 + mov r1, sb + ldr r0, [r1, #0x24] + movs r1, #4 + str r1, [sp] + str r6, [sp, #4] + movs r1, #0 + movs r2, #0xc + movs r3, #0x12 + bl sub_020090E4 + mov r1, sb + ldr r0, [r1, #0x24] + movs r1, #0 + movs r2, #0x60 + bl sub_02009164 + mov r1, sb + ldr r0, [r1, #0x24] + adds r1, r4, #0 + bl sub_02000484 + mov r0, sp + ldrb r1, [r0, #0xc] + ldr r0, =gUnknown_02022C20 + strb r1, [r0] + movs r0, #2 + str r0, [sp, #0xc] +_020042D6: + movs r0, #1 + bl sub_02008600 + ldr r0, =gUnknown_02022EB0 + ldrh r5, [r0] + ldr r1, =gUnknown_020219DE + ldrb r1, [r1] + str r1, [sp, #0x10] + movs r0, #0x80 + ands r0, r5 + cmp r0, #0 + beq _0200431E + movs r0, #0 + bl sub_02009344 + movs r2, #1 + rsbs r2, r2, #0 + ldr r0, =gUnknown_020219DE + ldrb r1, [r0] + adds r1, #1 + ldr r4, =gUnknown_020219D4 + adds r3, r2, #0 +_02004302: + cmp r1, #5 + bne _02004308 + movs r1, #0 +_02004308: + lsls r0, r1, #1 + adds r0, r0, r4 + ldrh r0, [r0] + cmp r0, #0 + beq _02004314 + adds r2, r1, #0 +_02004314: + adds r1, #1 + cmp r2, r3 + beq _02004302 + ldr r1, =gUnknown_020219DE + strb r2, [r1] +_0200431E: + movs r0, #0x40 + ands r0, r5 + cmp r0, #0 + beq _02004356 + movs r0, #0 + bl sub_02009344 + movs r2, #1 + rsbs r2, r2, #0 + ldr r0, =gUnknown_020219DE + ldrb r1, [r0] + subs r1, #1 + adds r3, r2, #0 + ldr r4, =gUnknown_020219D4 +_0200433A: + cmp r1, r3 + bne _02004340 + movs r1, #4 +_02004340: + lsls r0, r1, #1 + adds r0, r0, r4 + ldrh r0, [r0] + cmp r0, #0 + beq _0200434C + adds r2, r1, #0 +_0200434C: + subs r1, #1 + cmp r2, r3 + beq _0200433A + ldr r1, =gUnknown_020219DE + strb r2, [r1] +_02004356: + ldr r6, =gUnknown_02021990 + adds r7, r6, #0 + adds r7, #0x4e + ldrb r1, [r7] + ldr r0, [sp, #0x10] + cmp r0, r1 + beq _020043DE + mov r0, r8 + bl sub_02003A70 + ldrb r4, [r7] + mov r0, r8 + bl sub_0200CB34 + mov sl, r0 + movs r1, #4 + str r1, [sp] + movs r0, #0xf + str r0, [sp, #4] + movs r0, #0 + movs r1, #0xb + movs r2, #0xf + movs r3, #0x12 + bl sub_02008894 + ldr r0, [r6, #0x24] + movs r1, #4 + str r1, [sp] + movs r1, #0 + str r1, [sp, #4] + movs r2, #0xc + movs r3, #0x12 + bl sub_020090E4 + cmp r4, #4 + beq _020043BC + ldr r0, [r6, #0x24] + movs r1, #0 + movs r2, #0x60 + bl sub_02009164 + ldr r0, [r6, #0x24] + lsls r1, r4, #2 + adds r1, r1, r4 + lsls r1, r1, #4 + add r1, sl + bl sub_02000484 + movs r0, #1 + ldr r1, =gUnknown_02022C20 + strb r0, [r1] +_020043BC: + ldr r0, [r6, #0x40] + ldrb r1, [r7] + lsls r2, r1, #4 + adds r2, #0x20 + movs r1, #0x50 + bl sub_02008D3C + ldr r0, [sp, #0x10] + cmp r0, #4 + beq _020043D6 + ldrb r1, [r7] + cmp r1, #4 + bne _020043DE +_020043D6: + ldrb r1, [r7] + mov r0, r8 + bl sub_02003BA4 +_020043DE: + movs r0, #3 + ands r5, r0 + cmp r5, #0 + beq _020043F0 + movs r0, #0 + bl sub_02009344 + movs r0, #3 + str r0, [sp, #0xc] +_020043F0: + ldr r1, [sp, #0xc] + cmp r1, #2 + bne _020043F8 + b _020042D6 +_020043F8: + b _02004126 + .align 2, 0 + .pool +_0200441C: + mov r1, sb + ldr r0, [r1, #0x40] + bl sub_02008CEC + ldr r0, [sp, #0xc] + str r0, [sp] + movs r0, #0xa + str r0, [sp, #4] + movs r0, #0xb + str r0, [sp, #8] + movs r0, #2 + movs r1, #0 + movs r2, #0x17 + movs r3, #0x14 + bl sub_02008948 + mov r1, sb + ldr r0, [r1, #0x24] + str r4, [sp] + str r6, [sp, #4] + movs r1, #4 + movs r2, #9 + movs r3, #5 + bl sub_020090E4 + mov r1, sb + ldr r0, [r1, #0x24] + movs r1, #0x20 + movs r2, #0x48 + bl sub_02009164 + mov r1, sb + ldr r0, [r1, #0x24] + movs r1, #4 + str r1, [sp] + str r6, [sp, #4] + movs r1, #0 + movs r2, #0xc + movs r3, #0x12 + bl sub_020090E4 + mov r1, sb + ldr r0, [r1, #0x28] + movs r1, #0 + bl sub_020090B0 + mov r1, sb + ldr r0, [r1, #0x28] + ldr r1, =gUnknown_02020022 + bl sub_02000484 + movs r0, #1 + ldr r1, =gUnknown_02022C20 + strb r0, [r1] + strb r0, [r1, #2] + mov r0, sb + adds r0, #0x4e + ldrb r0, [r0] + cmp r0, #4 + beq _0200449C + mov r0, r8 + movs r1, #0 + bl sub_02003BA4 +_0200449C: + movs r0, #0 + str r0, [sp, #0xc] + b _02004126 + .align 2, 0 + .pool +_020044AC: + movs r0, #1 + rsbs r0, r0, #0 + cmp r8, r0 + beq _020044C8 + ldr r0, =gUnknown_02021990 + adds r5, r0, #0 + adds r5, #0x2c + movs r4, #3 +_020044BC: + ldm r5!, {r0} + bl sub_02008CEC + subs r4, #1 + cmp r4, #0 + bge _020044BC +_020044C8: + ldr r0, =gUnknown_02021990 + movs r1, #0 + movs r4, #3 + adds r0, #0x38 +_020044D0: + str r1, [r0] + subs r0, #4 + subs r4, #1 + cmp r4, #0 + bge _020044D0 + mov r0, r8 + add sp, #0x14 + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_020044F0 +sub_020044F0: @ 0x020044F0 + push {r4, r5, r6, r7, lr} + mov r7, r8 + push {r7} + adds r6, r0, #0 + bl sub_02002FEC + adds r0, r6, #0 + movs r1, #0 + bl sub_02003D80 + ldr r4, =gUnknown_02021990 + movs r0, #0 + strb r0, [r4, #0x18] + adds r0, r6, #0 + bl sub_020031F8 + bl sub_020007AC + mov r8, r4 + b _0200458E + .align 2, 0 + .pool +_0200451C: + mov r1, r8 + ldr r0, [r1, #0x24] + movs r1, #0 + bl sub_020090B0 + mov r1, r8 + ldr r0, [r1, #0x24] + bl sub_020091B0 + movs r4, #4 + adds r7, r5, #0 + movs r5, #0x80 + rsbs r5, r5, #0 +_02004536: + movs r0, #1 + bl sub_02008600 + movs r0, #2 + adds r1, r5, #0 + movs r2, #0 + bl sub_020089A4 + adds r5, #0x20 + subs r4, #1 + cmp r4, r7 + bne _02004536 + adds r0, r6, #0 + bl sub_020040FC + adds r6, r0, #0 + movs r0, #1 + rsbs r0, r0, #0 + cmp r6, r0 + beq _0200459E + mov r1, r8 + ldr r0, [r1, #0x24] + movs r1, #0 + bl sub_020090B0 + mov r1, r8 + ldr r0, [r1, #0x24] + bl sub_020091B0 + movs r5, #0x20 + rsbs r5, r5, #0 + movs r4, #4 +_02004576: + movs r0, #1 + bl sub_02008600 + movs r0, #2 + adds r1, r5, #0 + movs r2, #0 + bl sub_020089A4 + subs r5, #0x20 + subs r4, #1 + cmp r4, #0 + bge _02004576 +_0200458E: + adds r0, r6, #0 + bl sub_02004024 + adds r6, r0, #0 + movs r5, #1 + rsbs r5, r5, #0 + cmp r6, r5 + bne _0200451C +_0200459E: + bl sub_020007F0 + ldr r0, =gUnknown_02021990 + adds r0, #0x50 + ldrb r0, [r0] + pop {r3} + mov r8, r3 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_020045B8 +sub_020045B8: @ 0x020045B8 + push {r4, r5, r6, r7, lr} + sub sp, #8 + adds r5, r1, #0 + bl sub_0200CB34 + adds r7, r0, #0 + movs r4, #4 + str r4, [sp] + movs r0, #0xf + str r0, [sp, #4] + movs r0, #0 + movs r1, #0xb + movs r2, #0xf + movs r3, #0x12 + bl sub_02008894 + ldr r6, =gUnknown_02021990 + ldr r0, [r6, #0x24] + str r4, [sp] + movs r1, #0 + str r1, [sp, #4] + movs r2, #0xc + movs r3, #0x12 + bl sub_020090E4 + cmp r5, #4 + beq _0200460C + ldr r0, [r6, #0x24] + movs r1, #0 + movs r2, #0x60 + bl sub_02009164 + ldr r0, [r6, #0x24] + lsls r1, r5, #2 + adds r1, r1, r5 + lsls r1, r1, #4 + adds r1, r7, r1 + bl sub_02000484 + ldr r1, =gUnknown_02022C20 + movs r0, #1 + strb r0, [r1] +_0200460C: + add sp, #8 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200461C +sub_0200461C: @ 0x0200461C + push {r4, lr} + adds r4, r0, #0 + ldr r0, [r4, #0x14] + cmp r0, #0x24 + beq _02004640 + cmp r0, #0x24 + bhi _02004630 + cmp r0, #1 + beq _02004636 + b _0200464E +_02004630: + cmp r0, #0x27 + beq _0200464A + b _0200464E +_02004636: + adds r0, r4, #0 + movs r1, #0 + bl sub_02008D60 + b _0200464E +_02004640: + adds r0, r4, #0 + movs r1, #1 + bl sub_02008D60 + b _0200464E +_0200464A: + movs r0, #0 + str r0, [r4, #0x14] +_0200464E: + ldr r0, [r4, #0x14] + adds r0, #1 + str r0, [r4, #0x14] + pop {r4} + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start sub_0200465C +sub_0200465C: @ 0x0200465C + push {r4, lr} + sub sp, #4 + bl sub_02000940 + movs r1, #0x80 + lsls r1, r1, #0x13 + movs r2, #0xaa + lsls r2, r2, #5 + adds r0, r2, #0 + strh r0, [r1] + ldr r2, =0x04000008 + ldr r3, =0x00001F01 + adds r0, r3, #0 + strh r0, [r2] + adds r1, #0xc + subs r3, #0xf9 + adds r0, r3, #0 + strh r0, [r1] + ldrh r0, [r2] + movs r1, #0x80 + orrs r0, r1 + strh r0, [r2] + ldr r0, =gUnknown_0201B1A0 + movs r4, #0xa0 + lsls r4, r4, #0x13 + adds r1, r4, #0 + bl sub_020092C0 + ldr r0, =gUnknown_0201A894 + ldr r1, =0x050001C0 + bl sub_020092C0 + ldr r0, =gUnknown_0201B0FC + ldr r1, =0x06008000 + bl sub_020092C0 + ldr r0, =gUnknown_0201A450 + adds r1, r4, #0 + bl sub_020092C0 + ldr r0, =gUnknown_02017F0C + movs r1, #0xc0 + lsls r1, r1, #0x13 + bl sub_020092C0 + ldr r0, =gUnknown_0201A618 + movs r1, #0xc0 + lsls r1, r1, #0x12 + bl sub_020092C0 + ldr r0, =0x0000E001 + str r0, [sp] + movs r0, #0 + movs r1, #0x10 + movs r2, #0x1e + movs r3, #4 + bl sub_02000838 + ldr r1, =gUnknown_0201FB90 + movs r0, #0 + bl sub_02008F6C + ldr r1, =gUnknown_020219E4 + str r0, [r1] + movs r1, #1 + movs r2, #8 + bl sub_0200914C + ldr r1, =gUnknown_02022C20 + movs r0, #1 + strb r0, [r1] + strb r0, [r1, #2] + add sp, #4 + pop {r4} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200472C +sub_0200472C: @ 0x0200472C + push {r4, lr} + ldr r0, =gUnknown_020217B4 + ldrb r0, [r0] + cmp r0, #2 + beq _0200474A + cmp r0, #2 + bgt _02004744 + cmp r0, #0 + beq _02004788 + b _020047AC + .align 2, 0 + .pool +_02004744: + cmp r0, #0xff + beq _02004768 + b _020047AC +_0200474A: + ldr r0, =gUnknown_020219E4 + ldr r4, [r0] + adds r0, r4, #0 + ldr r1, =0x0000FFFF + bl sub_020090B0 + ldr r0, =gUnknown_0201FBB0 + ldr r1, [r0, #0x18] + b _02004798 + .align 2, 0 + .pool +_02004768: + ldr r0, =gUnknown_020219E4 + ldr r4, [r0] + adds r0, r4, #0 + ldr r1, =0x0000FFFF + bl sub_020090B0 + ldr r0, =gUnknown_0201FBB0 + ldr r1, [r0, #0x1c] + b _02004798 + .align 2, 0 + .pool +_02004788: + ldr r0, =gUnknown_020219E4 + ldr r4, [r0] + adds r0, r4, #0 + ldr r1, =0x0000FFFF + bl sub_020090B0 + ldr r0, =gUnknown_0201FBB0 + ldr r1, [r0, #0x20] +_02004798: + adds r0, r4, #0 + bl sub_02000484 + b _020047C2 + .align 2, 0 + .pool +_020047AC: + ldr r0, =gUnknown_020219E4 + ldr r4, [r0] + adds r0, r4, #0 + ldr r1, =0x0000FFFF + bl sub_020090B0 + ldr r0, =gUnknown_0201FBB0 + ldr r1, [r0, #4] + adds r0, r4, #0 + bl sub_02000484 +_020047C2: + pop {r4} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_020047D4 +sub_020047D4: @ 0x020047D4 + push {r4, r5, r6, lr} + sub sp, #0x30 + ldr r0, =gUnknown_02024960 + ldr r1, =0x0000087B + adds r0, r0, r1 + ldrb r1, [r0] + movs r4, #4 + strb r4, [r0] + bl sub_0200465C + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + adds r0, #0xb8 + ldrb r0, [r0] + lsls r0, r0, #0x1e + cmp r0, #0 + blt _020047FE + ldr r0, =gUnknown_020251E4 + ldrb r0, [r0] + cmp r0, #0 + bne _02004898 +_020047FE: + movs r0, #1 + bl sub_020007A0 + add r1, sp, #0x10 + ldr r0, =gUnknown_0201002C + ldm r0!, {r2, r3, r5} + stm r1!, {r2, r3, r5} + ldm r0!, {r2, r3, r5} + stm r1!, {r2, r3, r5} + ldm r0!, {r2, r3} + stm r1!, {r2, r3} + str r4, [sp] + movs r0, #0 + str r0, [sp, #4] + movs r0, #2 + movs r1, #0 + movs r2, #0x10 + movs r3, #0x1e + bl sub_02008904 + ldr r0, =0x0000E001 + str r0, [sp] + movs r0, #3 + movs r1, #0xe + movs r2, #0x18 + movs r3, #6 + bl sub_02000838 + movs r0, #0 + add r1, sp, #0x10 + bl sub_02008F6C + adds r4, r0, #0 + movs r1, #1 + movs r2, #8 + bl sub_0200914C + adds r0, r4, #0 + ldr r1, =0x0000FFFF + bl sub_020090B0 + ldr r1, =gUnknown_02022C20 + movs r0, #1 + strb r0, [r1, #2] + bl sub_02000794 + cmp r0, #1 + bne _02004862 + bl sub_020007AC +_02004862: + ldr r0, =gUnknown_0201FBB0 + ldr r1, [r0, #0x24] + adds r0, r4, #0 + bl sub_02000484 +_0200486C: + movs r0, #0x64 + bl sub_02008600 + b _0200486C + .align 2, 0 + .pool +_02004898: + ldr r0, =gUnknown_020217B8 + ldrb r0, [r0] + cmp r0, #1 + beq _020048AC + bl sub_0200472C + b _020048B6 + .align 2, 0 + .pool +_020048AC: + ldr r0, =gUnknown_020219E4 + ldr r0, [r0] + ldr r1, =0x0000FFFF + bl sub_020090B0 +_020048B6: + ldr r1, =gUnknown_02024960 + ldr r4, =0x00000859 + adds r0, r1, r4 + ldrb r2, [r0] + movs r4, #0 + strb r4, [r0] + ldr r5, =0x0000084C + adds r3, r1, r5 + ldrb r2, [r3] + movs r0, #3 + rsbs r0, r0, #0 + ands r0, r2 + strb r0, [r3] + ldr r0, =0x0000087A + adds r1, r1, r0 + ldrb r0, [r1] + strb r4, [r1] + ldrb r1, [r3] + movs r0, #2 + rsbs r0, r0, #0 + ands r0, r1 + strb r0, [r3] + bl sub_020007AC + ldr r0, =gUnknown_020217B4 + ldrb r0, [r0] + cmp r0, #2 + beq _020048F6 + cmp r0, #0xff + beq _020048F6 + cmp r0, #0 + bne _0200491C +_020048F6: + movs r0, #0xff + bl sub_02008600 + b _020048F6 + .align 2, 0 + .pool +_0200491C: + ldr r0, =gUnknown_020217B8 + ldrb r0, [r0] + cmp r0, #1 + bne _02004932 + ldr r0, =gUnknown_020219E4 + ldr r0, [r0] + ldr r1, =gUnknown_02020508 + bl sub_02000484 + bl sub_0200472C +_02004932: + ldr r3, =gUnknown_02024960 + ldr r1, =0x0000087F + adds r2, r3, r1 + ldrb r0, [r2] + cmp r0, #0 + beq _02004950 + ldr r1, =0x04000154 + movs r4, #0x88 + lsls r4, r4, #4 + adds r0, r3, r4 + ldr r0, [r0] + str r0, [r1] + ldrb r0, [r2] + movs r0, #0 + strb r0, [r2] +_02004950: + movs r5, #0 + ldr r0, =0x00000859 + adds r6, r3, r0 +_02004956: + movs r0, #1 + bl sub_02008600 + ldrb r0, [r6] + cmp r0, #0 + beq _0200496C + bl sub_0200CB54 + cmp r0, #1 + bne _0200496C + movs r5, #2 +_0200496C: + ldr r4, =gUnknown_02024960 + ldr r1, =0x0000084C + adds r2, r4, r1 + ldrb r1, [r2] + movs r0, #1 + ands r0, r1 + cmp r0, #0 + beq _0200498C + ldrb r0, [r2] + movs r3, #2 + rsbs r3, r3, #0 + adds r1, r3, #0 + ands r0, r1 + strb r0, [r2] + bl sub_02006058 +_0200498C: + ldr r1, =0x0000087A + adds r0, r4, r1 + ldrb r0, [r0] + cmp r0, #1 + bne _02004998 + movs r5, #1 +_02004998: + ldr r2, =0x0000085A + adds r1, r4, r2 + ldrb r0, [r1] + cmp r0, #1 + bne _020049C2 + ldrb r0, [r1] + movs r0, #0 + strb r0, [r1] + bl sub_02006264 + ldr r0, =gUnknown_020219E4 + ldr r4, [r0] + adds r0, r4, #0 + ldr r1, =0x0000FFFF + bl sub_020090B0 + ldr r0, =gUnknown_0201FBB0 + ldr r1, [r0, #4] + adds r0, r4, #0 + bl sub_02000484 +_020049C2: + cmp r5, #0 + beq _02004956 + bl sub_020007F0 + subs r0, r5, #1 + add sp, #0x30 + pop {r4, r5, r6} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_02004A04 +sub_02004A04: @ 0x02004A04 + push {r4, r5, lr} + adds r4, r0, #0 + ldr r0, =gUnknown_020219E4 + ldr r5, [r0] + ldr r1, =0x0000FFFF + adds r0, r5, #0 + bl sub_020090B0 + ldr r0, =gUnknown_0201FBB0 + lsls r4, r4, #2 + adds r4, r4, r0 + ldr r1, [r4] + adds r0, r5, #0 + bl sub_02000484 + pop {r4, r5} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02004A34 +sub_02004A34: @ 0x02004A34 + push {r4, r5, lr} + sub sp, #0x28 + adds r5, r0, #0 + add r1, sp, #8 + ldr r0, =gUnknown_0201002C + ldm r0!, {r2, r3, r4} + stm r1!, {r2, r3, r4} + ldm r0!, {r2, r3, r4} + stm r1!, {r2, r3, r4} + ldm r0!, {r2, r3} + stm r1!, {r2, r3} + movs r0, #4 + str r0, [sp] + movs r0, #0 + str r0, [sp, #4] + movs r0, #2 + movs r1, #0 + movs r2, #0x10 + movs r3, #0x1e + bl sub_02008904 + ldr r0, =0x0000E001 + str r0, [sp] + movs r0, #3 + movs r1, #0xe + movs r2, #0x18 + movs r3, #6 + bl sub_02000838 + movs r0, #0 + add r1, sp, #8 + bl sub_02008F6C + adds r4, r0, #0 + movs r1, #1 + movs r2, #8 + bl sub_0200914C + ldr r1, =0x0000FFFF + adds r0, r4, #0 + bl sub_020090B0 + ldr r1, =gUnknown_02022C20 + movs r0, #1 + strb r0, [r1, #2] + bl sub_02000794 + cmp r0, #1 + bne _02004A9A + bl sub_020007AC +_02004A9A: + ldr r0, =gUnknown_0201FBB0 + lsls r1, r5, #2 + adds r1, r1, r0 + ldr r1, [r1] + adds r0, r4, #0 + bl sub_02000484 +_02004AA8: + movs r0, #0x64 + bl sub_02008600 + b _02004AA8 + .align 2, 0 + .pool + + thumb_func_start sub_02004AC4 +sub_02004AC4: @ 0x02004AC4 + push {r4, r5, lr} + sub sp, #4 + bl sub_02000940 + movs r1, #0x80 + lsls r1, r1, #0x13 + movs r2, #0xfa + lsls r2, r2, #5 + adds r0, r2, #0 + strh r0, [r1] + adds r1, #8 + movs r2, #0xd8 + lsls r2, r2, #5 + adds r0, r2, #0 + strh r0, [r1] + adds r1, #2 + ldr r2, =0x00000F01 + adds r0, r2, #0 + strh r0, [r1] + adds r1, #2 + ldr r2, =0x00005C0A + adds r0, r2, #0 + strh r0, [r1] + adds r1, #2 + ldr r2, =0x00001E0B + adds r0, r2, #0 + strh r0, [r1] + ldr r0, =gUnknown_0201B1A0 + movs r5, #0xa0 + lsls r5, r5, #0x13 + adds r1, r5, #0 + bl sub_020092C0 + ldr r0, =gUnknown_0201A8B4 + movs r1, #0xc0 + lsls r1, r1, #0x13 + bl sub_020092C0 + ldr r0, =gUnknown_0201D180 + ldr r1, =0x06008000 + bl sub_020092C0 + ldr r0, =gUnknown_0201D3F0 + ldr r1, =0x05000140 + bl sub_020092C0 + ldr r0, =gUnknown_0201D420 + ldr r1, =0x03003000 + bl sub_020092C0 + ldr r0, =gUnknown_0201D5A4 + ldr r1, =0x03002800 + bl sub_020092C0 + ldr r1, =gUnknown_02022C20 + movs r4, #0 + movs r0, #1 + strb r0, [r1, #2] + strb r0, [r1, #3] + ldr r0, =gUnknown_0201D05C + ldr r1, =0x05000200 + bl sub_020092C0 + ldr r0, =gUnknown_0201C5A4 + ldr r1, =0x06010000 + bl sub_020092C0 + ldr r1, =0x00005108 + adds r0, r1, #0 + strh r0, [r5] + mov r0, sp + strh r4, [r0] + ldr r4, =gUnknown_02021A20 + ldr r2, =0x0100000E + adds r1, r4, #0 + bl CpuSet + ldr r1, =gUnknown_0201FE3C + movs r0, #0 + bl sub_02008F6C + str r0, [r4, #0x14] + ldr r1, =gUnknown_0201FE5C + movs r0, #1 + bl sub_02008F6C + str r0, [r4, #0x18] + ldr r0, [r4, #0x14] + movs r1, #1 + movs r2, #8 + bl sub_0200914C + ldr r0, [r4, #0x18] + movs r1, #1 + movs r2, #8 + bl sub_0200914C + add sp, #4 + pop {r4, r5} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02004BEC +sub_02004BEC: @ 0x02004BEC + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + adds r6, r0, #0 + adds r5, r2, #0 + mov sb, r3 + ldr r0, =gUnknown_020251E8 + mov sl, r0 + ldr r0, [r0] + adds r0, #0xbc + ldr r4, [r0] + ldr r1, =gUnknown_02024960 + mov r8, r1 + ldrh r0, [r1, #0x10] + strh r0, [r6, #0xc] + lsls r0, r0, #0x10 + cmp r0, #0 + beq _02004CBC + ldr r7, [r1, #8] + ldrh r0, [r6, #0xc] + adds r1, r7, #0 + bl sub_0200C318 + strh r0, [r6, #0xe] + ldr r0, [r6] + cmp r0, #0 + beq _02004C2A + bl sub_02008CEC +_02004C2A: + ldr r1, =gUnknown_0201FC44 + ldrh r2, [r6, #0xc] + lsls r0, r2, #3 + subs r0, r0, r2 + lsls r0, r0, #2 + adds r0, r0, r4 + ldrb r0, [r0, #0x19] + lsrs r0, r0, #7 + lsls r0, r0, #2 + adds r0, r0, r1 + ldr r2, [r0] + adds r0, r5, #0 + mov r1, sb + bl sub_02008A10 + str r0, [r6] + movs r1, #4 + bl sub_02008D54 + mov r1, sl + ldr r0, [r1] + ldrh r2, [r6, #0xe] + lsls r1, r2, #3 + ldr r4, [r0, #0x28] + adds r4, r4, r1 + bl sub_020098D0 + adds r5, r0, #0 + ldr r0, [r4] + adds r1, r5, #0 + bl LZ77UnCompVRAM + ldr r4, =0x00000181 + ldrh r0, [r6, #0xc] + cmp r0, r4 + bne _02004C7A + mov r1, r8 + ldrh r0, [r1, #0x12] + lsls r0, r0, #0xb + adds r5, r5, r0 +_02004C7A: + ldrh r0, [r6, #0xc] + adds r1, r7, #0 + adds r2, r5, #0 + bl sub_0200B89C + ldr r1, =0x06012000 + movs r2, #0x80 + lsls r2, r2, #3 + adds r0, r5, #0 + bl CpuSet + ldrh r0, [r6, #0xc] + mov r2, r8 + ldr r1, [r2, #0xc] + adds r2, r7, #0 + bl sub_0200C2BC + ldr r0, [r0] + adds r1, r5, #0 + bl LZ77UnCompWRAM + ldrh r6, [r6, #0xc] + cmp r6, r4 + bne _02004CB2 + mov r1, r8 + ldrh r0, [r1, #0x12] + lsls r0, r0, #5 + adds r5, r5, r0 +_02004CB2: + ldr r1, =0x05000280 + adds r0, r5, #0 + movs r2, #0x10 + bl CpuSet +_02004CBC: + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02004CE4 +sub_02004CE4: @ 0x02004CE4 + push {r4, r5, lr} + sub sp, #0x18 + bl sub_0200C254 + lsls r0, r0, #0x18 + lsrs r4, r0, #0x18 + cmp r4, #0 + beq _02004CF8 + cmp r4, #0xfe + bne _02004D5A +_02004CF8: + add r0, sp, #8 + movs r1, #0xff + strb r1, [r0, #1] + ldr r5, =gUnknown_02021A20 + ldr r0, [r5, #0x14] + movs r1, #0x48 + movs r2, #0x10 + bl sub_02009164 + cmp r4, #0 + bne _02004D24 + add r0, sp, #8 + movs r1, #0xb5 + strb r1, [r0] + ldr r0, [r5, #0x14] + movs r1, #4 + movs r2, #5 + bl sub_0200914C + b _02004D34 + .align 2, 0 + .pool +_02004D24: + add r0, sp, #8 + movs r1, #0xb6 + strb r1, [r0] + ldr r0, [r5, #0x14] + movs r1, #7 + movs r2, #8 + bl sub_0200914C +_02004D34: + ldr r4, =gUnknown_02021A20 + ldr r0, [r4, #0x14] + add r1, sp, #8 + bl sub_02000484 + movs r0, #2 + str r0, [sp] + movs r0, #0 + str r0, [sp, #4] + movs r1, #0x14 + movs r2, #8 + movs r3, #1 + bl sub_02008894 + ldr r0, [r4, #0x14] + movs r1, #1 + movs r2, #8 + bl sub_0200914C +_02004D5A: + add sp, #0x18 + pop {r4, r5} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02004D68 +sub_02004D68: @ 0x02004D68 + push {r4, r5, r6, r7, lr} + mov r7, r8 + push {r7} + sub sp, #0x20 + adds r6, r0, #0 + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + adds r1, r6, #0 + muls r1, r0, r1 + ldr r0, [r2] + adds r7, r0, r1 + ldr r4, =gUnknown_02021A20 + adds r0, r4, #0 + adds r1, r6, #0 + movs r2, #8 + movs r3, #0x20 + bl sub_02004BEC + mov r1, sp + movs r0, #0x34 + strb r0, [r1] + movs r0, #0xff + strb r0, [r1, #1] + ldr r0, [r4, #0x14] + movs r1, #8 + movs r2, #0 + bl sub_02009164 + ldr r0, [r4, #0x14] + mov r1, sp + bl sub_02000484 + adds r0, r7, #0 + movs r1, #0x38 + movs r2, #0 + bl sub_0200C1B8 + mov r1, sp + movs r2, #0xa1 + bl sub_02000900 + movs r5, #0 + mov r0, sp + add r1, sp, #4 + mov r8, r1 + b _02004DD2 + .align 2, 0 + .pool +_02004DCC: + adds r5, #1 + mov r2, sp + adds r0, r2, r5 +_02004DD2: + ldrb r0, [r0] + cmp r0, #0xa1 + beq _02004DCC + mov r1, sp + adds r0, r1, r5 + ldrb r0, [r0] + cmp r0, #0xff + bne _02004DE4 + subs r5, #1 +_02004DE4: + ldr r4, =gUnknown_02021A20 + ldr r0, [r4, #0x14] + movs r1, #0x11 + movs r2, #0 + bl sub_02009164 + ldr r0, [r4, #0x14] + mov r2, sp + adds r1, r2, r5 + bl sub_02000484 + adds r0, r7, #0 + movs r1, #2 + mov r2, sp + bl sub_0200C1B8 + movs r0, #4 + mov r1, sp + bl sub_02000650 + ldr r0, [r4, #0x14] + movs r1, #0x2c + movs r2, #0 + bl sub_02009164 + ldr r0, [r4, #0x14] + mov r1, sp + bl sub_02000484 + adds r0, r7, #0 + movs r1, #0xb + movs r2, #0 + bl sub_0200C1B8 + adds r4, r0, #0 + cmp r4, #0x20 + beq _02004E38 + cmp r4, #0x1d + beq _02004E38 + adds r0, r7, #0 + bl sub_02004CE4 +_02004E38: + mov r0, sp + adds r1, r4, #0 + bl sub_0200C378 + ldr r5, =gUnknown_02021A20 + ldr r0, [r5, #0x14] + movs r1, #8 + movs r2, #0x10 + bl sub_02009164 + ldr r0, [r5, #0x14] + mov r1, sp + bl sub_02000484 + adds r0, r7, #0 + bl sub_0200B7D0 + adds r4, r0, #0 + cmp r4, #0 + beq _02004E84 + ldr r0, [r5, #4] + cmp r0, #0 + bne _02004E72 + ldr r2, =gUnknown_0201FC4C + movs r0, #0xa6 + movs r1, #0x44 + bl sub_02008A10 + str r0, [r5, #4] +_02004E72: + ldr r0, [r5, #4] + movs r1, #0 + bl sub_02008D60 + ldr r0, [r5, #4] + subs r1, r4, #1 + lsls r1, r1, #2 + bl sub_02008D5C +_02004E84: + movs r0, #1 + movs r1, #0xc + movs r2, #0xa + adds r3, r6, #0 + bl sub_0200068C + movs r2, #4 + rsbs r2, r2, #0 + movs r0, #1 + movs r1, #0 + bl sub_020089A4 + ldr r6, =gUnknown_02022C20 + movs r5, #1 + strb r5, [r6, #1] + adds r0, r7, #0 + movs r1, #0x39 + movs r2, #0 + bl sub_0200C1B8 + adds r4, r0, #0 + mov r0, sp + adds r1, r4, #0 + bl sub_02000964 + mov r1, sp + movs r0, #0xba + strb r0, [r1, #3] + adds r0, r7, #0 + movs r1, #0x3a + movs r2, #0 + bl sub_0200C1B8 + adds r4, r0, #0 + mov r0, r8 + adds r1, r4, #0 + bl sub_02000964 + ldr r4, =gUnknown_02021A20 + ldr r0, [r4, #0x14] + movs r1, #0x50 + movs r2, #0x20 + bl sub_02009164 + ldr r1, [r4, #0x14] + movs r0, #6 + strb r0, [r1, #0x1c] + ldr r0, [r4, #0x14] + mov r1, sp + bl sub_02000484 + strb r5, [r6] + add sp, #0x20 + pop {r3} + mov r8, r3 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02004F04 +sub_02004F04: @ 0x02004F04 + push {r4, r5, r6, r7, lr} + adds r6, r0, #0 + adds r7, r1, #0 + adds r4, r7, #0 + cmp r2, #0 + ble _02004F32 + adds r5, r2, #0 +_02004F12: + ldrb r0, [r6, #1] + lsls r1, r0, #3 + ldrb r0, [r4] + subs r1, r0, r1 + ldrb r0, [r6, #2] + lsls r2, r0, #3 + ldrb r0, [r4, #1] + subs r2, r0, r2 + ldr r3, [r4, #4] + adds r0, r6, #0 + bl sub_020009C4 + subs r5, #1 + adds r4, #0xc + cmp r5, #0 + bne _02004F12 +_02004F32: + ldr r4, =gUnknown_02021A20 + ldr r0, [r4, #8] + cmp r0, #0 + beq _02004F42 + bl sub_02008CEC + movs r0, #0 + str r0, [r4, #8] +_02004F42: + ldr r0, =gUnknown_0201FD94 + cmp r7, r0 + bne _02004F58 + ldr r2, =gUnknown_0201FC64 + b _02004F88 + .align 2, 0 + .pool +_02004F58: + ldr r0, =gUnknown_0201FDC4 + cmp r7, r0 + bne _02004F6C + ldr r2, =gUnknown_0201FCA0 + b _02004F88 + .align 2, 0 + .pool +_02004F6C: + ldr r0, =gUnknown_0201FDF4 + cmp r7, r0 + bne _02004F80 + ldr r2, =gUnknown_0201FCF4 + b _02004F88 + .align 2, 0 + .pool +_02004F80: + ldr r0, =gUnknown_0201FE24 + cmp r7, r0 + bne _02004F92 + ldr r2, =gUnknown_0201FD60 +_02004F88: + movs r0, #0 + movs r1, #0 + bl sub_02008A10 + str r0, [r4, #8] +_02004F92: + ldr r4, =gUnknown_02021A20 + ldr r0, [r4, #8] + movs r1, #5 + bl sub_02008D54 + ldr r0, [r4, #8] + ldrb r1, [r7] + ldrb r2, [r7, #1] + bl sub_02008D3C + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02004FB8 +sub_02004FB8: @ 0x02004FB8 + push {r4, r5, r6, r7, lr} + mov r7, r8 + push {r7} + adds r5, r0, #0 + mov r8, r1 + movs r6, #0 + ldr r0, [r5, #4] + ldrb r0, [r0] + ldr r2, =gUnknown_0201FDF4 + cmp r0, #0xff + bne _02004FDC + adds r1, r5, #0 +_02004FD0: + adds r1, #0xc + adds r6, #1 + ldr r0, [r1, #4] + ldrb r0, [r0] + cmp r0, #0xff + beq _02004FD0 +_02004FDC: + cmp r5, r2 + bne _02004FEE + cmp r6, #1 + bne _02004FEE + ldr r0, [r5, #0x1c] + ldrb r0, [r0] + cmp r0, #0xff + beq _02004FEE + movs r6, #2 +_02004FEE: + cmp r6, r8 + blt _02004FF4 + b _0200515A +_02004FF4: + ldr r0, =gUnknown_02021A20 + ldr r0, [r0, #8] + lsls r4, r6, #1 + adds r4, r4, r6 + lsls r4, r4, #2 + adds r4, r4, r5 + ldrb r1, [r4] + ldrb r2, [r4, #1] + bl sub_02008D3C +_02005008: + movs r0, #1 + bl sub_02008600 + ldr r0, =gUnknown_02022EB0 + ldrh r7, [r0] + adds r3, r6, #0 + movs r0, #0x10 + ands r0, r7 + cmp r0, #0 + beq _0200507C + cmp r6, #0 + bne _02005052 + ldr r0, [r5, #0x10] + ldrb r0, [r0] + cmp r0, #0xff + beq _02005040 + cmp r0, #0xae + beq _02005040 + adds r4, r5, #0 + adds r4, #0xc + movs r6, #1 + b _02005052 + .align 2, 0 + .pool +_02005040: + ldr r0, [r5, #0x28] + ldrb r0, [r0] + cmp r0, #0xff + beq _02005052 + cmp r0, #0xae + beq _02005052 + adds r4, r5, #0 + adds r4, #0x24 + movs r6, #3 +_02005052: + cmp r6, #2 + bne _0200507C + ldr r0, [r5, #0x28] + ldrb r0, [r0] + cmp r0, #0xff + beq _0200506A + cmp r0, #0xae + beq _0200506A + adds r4, r5, #0 + adds r4, #0x24 + movs r6, #3 + b _0200507C +_0200506A: + ldr r0, [r5, #0x10] + ldrb r0, [r0] + cmp r0, #0xff + beq _0200507C + cmp r0, #0xae + beq _0200507C + adds r4, r5, #0 + adds r4, #0xc + movs r6, #1 +_0200507C: + movs r0, #0x20 + ands r0, r7 + cmp r0, #0 + beq _020050D4 + cmp r6, #1 + bne _020050AC + ldr r0, [r5, #4] + ldrb r0, [r0] + cmp r0, #0xff + beq _0200509A + cmp r0, #0xae + beq _0200509A + adds r4, r5, #0 + movs r6, #0 + b _020050AC +_0200509A: + ldr r0, [r5, #0x1c] + ldrb r0, [r0] + cmp r0, #0xff + beq _020050AC + cmp r0, #0xae + beq _020050AC + adds r4, r5, #0 + adds r4, #0x18 + movs r6, #2 +_020050AC: + cmp r6, #3 + bne _020050D4 + ldr r0, [r5, #0x1c] + ldrb r0, [r0] + cmp r0, #0xff + beq _020050C4 + cmp r0, #0xae + beq _020050C4 + adds r4, r5, #0 + adds r4, #0x18 + movs r6, #2 + b _020050D4 +_020050C4: + ldr r0, [r5, #4] + ldrb r0, [r0] + cmp r0, #0xff + beq _020050D4 + cmp r0, #0xae + beq _020050D4 + adds r4, r5, #0 + movs r6, #0 +_020050D4: + movs r0, #0x80 + ands r0, r7 + cmp r0, #0 + beq _020050EE + adds r1, r6, #2 + cmp r1, r8 + bge _020050EE + ldr r0, [r4, #0x1c] + ldrb r0, [r0] + cmp r0, #0xff + beq _020050EE + adds r4, #0x18 + adds r6, r1, #0 +_020050EE: + movs r0, #0x40 + ands r0, r7 + cmp r0, #0 + beq _0200510C + subs r2, r6, #2 + cmp r2, #0 + blt _0200510C + adds r1, r4, #0 + subs r1, #0x18 + ldr r0, [r1, #4] + ldrb r0, [r0] + cmp r0, #0xff + beq _0200510C + adds r4, r1, #0 + adds r6, r2, #0 +_0200510C: + cmp r3, r6 + beq _0200512E + movs r0, #0 + bl sub_02009344 + ldr r0, =gUnknown_02021A20 + ldr r0, [r0, #8] + ldrb r1, [r4] + ldrb r2, [r4, #1] + bl sub_02008D3C + ldr r1, [r4, #8] + cmp r1, #0 + beq _0200512E + adds r0, r6, #0 + bl _call_via_r1 +_0200512E: + movs r0, #2 + ands r0, r7 + cmp r0, #0 + bne _02005154 + movs r0, #1 + ands r7, r0 + cmp r7, #0 + bne _02005140 + b _02005008 +_02005140: + movs r0, #0 + bl sub_02009344 + ldr r0, =gUnknown_02021A20 + strb r6, [r0, #0x10] + ldrb r0, [r4, #2] + b _0200515C + .align 2, 0 + .pool +_02005154: + movs r0, #0 + bl sub_02009344 +_0200515A: + movs r0, #0 +_0200515C: + pop {r3} + mov r8, r3 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_02005168 +sub_02005168: @ 0x02005168 + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #0x18 + mov sl, r0 + ldr r2, =gUnknown_02022EF4 + ldr r0, =gUnknown_02020A48 + ldr r1, [r0] + movs r0, #0x64 + muls r0, r1, r0 + ldr r6, [r2] + adds r6, r6, r0 + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + adds r0, #0xcc + ldr r7, [r0] + ldr r4, =gUnknown_02024960 + mov r1, sl + lsls r0, r1, #1 + adds r1, r4, #0 + adds r1, #0x14 + adds r0, r0, r1 + ldrh r5, [r0] + ldr r2, =gUnknown_02021A20 + ldr r0, [r2, #0x18] + movs r1, #2 + mov r8, r1 + str r1, [sp] + movs r2, #0 + mov sb, r2 + str r2, [sp, #4] + movs r1, #0x16 + movs r2, #2 + movs r3, #6 + bl sub_020090E4 + lsls r1, r5, #1 + adds r1, r1, r5 + lsls r1, r1, #2 + adds r1, r1, r7 + ldr r2, =gUnknown_02021A20 + ldr r0, [r2, #0x18] + ldr r2, =gUnknown_0201FE7C + ldrb r1, [r1, #2] + lsls r1, r1, #2 + adds r1, r1, r2 + ldr r3, [r1] + movs r1, #0xb0 + movs r2, #0x10 + bl sub_020009C4 + ldr r1, =gUnknown_02021A20 + ldr r0, [r1, #0x18] + mov r2, r8 + str r2, [sp] + mov r1, sb + str r1, [sp, #4] + movs r1, #0x18 + movs r2, #0 + movs r3, #4 + bl sub_020090E4 + adds r4, #0x1c + add r4, sl + ldrb r4, [r4] + adds r0, r6, #0 + movs r1, #0x15 + movs r2, #0 + bl sub_0200C1B8 + adds r1, r0, #0 + adds r0, r5, #0 + mov r2, sl + bl sub_0200C478 + adds r5, r0, #0 + add r0, sp, #8 + adds r1, r4, #0 + bl sub_02000964 + add r1, sp, #8 + movs r0, #0xba + strb r0, [r1, #3] + add r0, sp, #0xc + adds r1, r5, #0 + bl sub_02000964 + add r1, sp, #8 + adds r0, r1, #0 + ldrb r0, [r0, #5] + strb r0, [r1, #4] + adds r0, r1, #0 + ldrb r0, [r0, #6] + strb r0, [r1, #5] + adds r0, r1, #0 + ldrb r0, [r0, #7] + strb r0, [r1, #6] + ldr r2, =gUnknown_02021A20 + ldr r0, [r2, #0x18] + movs r1, #0xbf + movs r2, #0 + add r3, sp, #8 + bl sub_020009C4 + add sp, #0x18 + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02005264 +sub_02005264: @ 0x02005264 + push {r4, r5, r6, lr} + sub sp, #0x1c + movs r5, #6 + str r5, [sp] + movs r4, #0 + str r4, [sp, #4] + movs r0, #0xe + str r0, [sp, #8] + movs r0, #2 + movs r1, #0 + movs r2, #0x26 + movs r3, #0x1e + bl sub_02008948 + str r5, [sp] + str r4, [sp, #4] + movs r0, #3 + movs r1, #0 + movs r2, #0xe + movs r3, #0x1e + bl sub_02008904 + ldr r4, =gUnknown_02021A20 + ldr r0, [r4, #0x18] + movs r1, #0 + bl sub_020090B0 + ldr r0, [r4, #0x18] + ldr r3, =gUnknown_02020098 + movs r1, #0xb0 + movs r2, #0 + bl sub_020009C4 + movs r0, #0 + bl sub_02005168 + movs r6, #0 + movs r4, #0 + ldr r0, =gUnknown_02024960 + adds r5, r0, #0 + adds r5, #0x14 +_020052B6: + ldrh r0, [r5] + adds r1, r0, #0 + cmp r1, #0 + beq _020052D4 + add r0, sp, #0xc + bl sub_0200C4B8 + adds r6, #1 + b _020052DC + .align 2, 0 + .pool +_020052D4: + add r0, sp, #0xc + ldr r1, =gUnknown_02020027 + bl sub_0200CE5C +_020052DC: + adds r0, r4, #0 + add r1, sp, #0xc + bl sub_02000650 + adds r5, #2 + adds r4, #1 + cmp r4, #3 + ble _020052B6 + ldr r0, =gUnknown_02021A20 + ldr r0, [r0, #0x18] + ldr r1, =gUnknown_0201FDC4 + movs r2, #4 + bl sub_02004F04 + ldr r1, =gUnknown_02022C20 + movs r0, #1 + strb r0, [r1, #2] + strb r0, [r1, #3] + adds r0, r6, #0 + add sp, #0x1c + pop {r4, r5, r6} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200531C +sub_0200531C: @ 0x0200531C + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #0x18 + adds r4, r0, #0 + ldr r7, =gUnknown_02021A00 + add r0, sp, #0x14 + movs r5, #0 + strh r5, [r0] + ldr r2, =0x01000010 + adds r1, r7, #0 + bl CpuSet + ldr r0, =gUnknown_02024960 + mov sb, r0 + lsls r2, r4, #1 + adds r0, r2, r4 + lsls r0, r0, #2 + mov r8, r0 + mov r1, r8 + add r1, sb + ldr r3, =0x0000081C + mov sl, r3 + adds r0, r1, r3 + ldrb r0, [r0] + cmp r0, #0xff + bne _0200536C + strb r0, [r7] + b _02005454 + .align 2, 0 + .pool +_0200536C: + ldr r0, =0x00000826 + adds r1, r1, r0 + ldrb r0, [r1] + lsls r0, r0, #0x1d + lsrs r0, r0, #0x1d + adds r0, #0xa1 + strb r0, [r7] + movs r0, #0xca + strb r0, [r7, #1] + movs r0, #0xf0 + strb r0, [r7, #2] + strb r5, [r7, #3] + movs r5, #4 + ldrb r0, [r1] + lsls r0, r0, #0x1c + cmp r0, #0 + bge _02005398 + movs r0, #0xfc + strb r0, [r7, #4] + movs r0, #0x15 + strb r0, [r7, #5] + movs r5, #6 +_02005398: + movs r6, #0 + ldr r3, =gUnknown_020251E8 + ldr r0, [r3] + adds r0, #0x77 + mov ip, r2 + ldrb r0, [r0] + cmp r6, r0 + bge _020053D2 + mov r0, sl + add r0, sb + mov r2, r8 + adds r1, r2, r0 + ldrb r0, [r1] + cmp r0, #0xff + beq _020053D2 + adds r2, r5, r7 +_020053B8: + ldrb r0, [r1] + strb r0, [r2] + adds r1, #1 + adds r2, #1 + adds r6, #1 + ldr r0, [r3] + adds r0, #0x77 + ldrb r0, [r0] + cmp r6, r0 + bge _020053D2 + ldrb r0, [r1] + cmp r0, #0xff + bne _020053B8 +_020053D2: + adds r6, r6, r5 + mov r3, ip + adds r0, r3, r4 + lsls r0, r0, #2 + mov r8, r0 + add r0, sb + ldr r1, =0x00000826 + adds r5, r0, r1 + ldrb r0, [r5] + lsls r0, r0, #0x1a + cmp r0, #0 + blt _020053F2 + ldrb r0, [r5] + lsls r0, r0, #0x1b + cmp r0, #0 + bge _02005430 +_020053F2: + ldrb r0, [r5] + lsls r0, r0, #0x1a + movs r1, #0x1d + cmp r0, #0 + bge _020053FE + movs r1, #0x20 +_020053FE: + add r4, sp, #4 + adds r0, r4, #0 + bl sub_0200C378 + ldr r0, =0x0000081C + add r0, sb + add r0, r8 + adds r1, r4, #0 + bl sub_0200CEA0 + cmp r0, #0 + bne _0200544E + ldrb r0, [r5] + lsrs r0, r0, #6 + cmp r0, #0 + bne _0200543E + adds r1, r7, r6 + movs r0, #0xb5 + b _0200544A + .align 2, 0 + .pool +_02005430: + ldrb r0, [r5] + lsrs r0, r0, #6 + cmp r0, #0 + bne _0200543E + adds r1, r7, r6 + movs r0, #0xb5 + b _0200544A +_0200543E: + ldrb r0, [r5] + lsrs r0, r0, #6 + cmp r0, #1 + bne _0200544E + adds r1, r7, r6 + movs r0, #0xb6 +_0200544A: + strb r0, [r1] + adds r6, #1 +_0200544E: + adds r1, r7, r6 + movs r0, #0xff + strb r0, [r1] +_02005454: + adds r0, r7, #0 + add sp, #0x18 + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_02005468 +sub_02005468: @ 0x02005468 + push {r4, r5, lr} + sub sp, #0x10 + movs r0, #1 + rsbs r0, r0, #0 + adds r1, r0, #0 + add r0, sp, #0xc + strb r1, [r0] + movs r5, #6 + str r5, [sp] + movs r4, #0 + str r4, [sp, #4] + movs r0, #0xe + str r0, [sp, #8] + movs r0, #3 + movs r1, #0 + movs r2, #0x14 + movs r3, #0x1e + bl sub_02008948 + str r5, [sp] + str r4, [sp, #4] + movs r0, #2 + movs r1, #0 + movs r2, #0xe + movs r3, #0x1e + bl sub_02008904 + ldr r0, =gUnknown_02021A20 + ldr r0, [r0, #0x18] + ldr r1, =0x0000FFFF + bl sub_020090B0 + ldr r5, =gUnknown_020217C0 + movs r0, #0 + bl sub_0200531C + adds r1, r0, #0 + adds r0, r5, #0 + bl sub_0200CE5C + adds r4, r5, #0 + adds r4, #0x20 + movs r0, #1 + bl sub_0200531C + adds r1, r0, #0 + adds r0, r4, #0 + bl sub_0200CE5C + ldr r0, =gUnknown_02024960 + ldrb r0, [r0, #7] + cmp r0, #4 + bne _02005504 + adds r4, #0x20 + movs r0, #2 + bl sub_0200531C + adds r1, r0, #0 + adds r0, r4, #0 + bl sub_0200CE5C + adds r4, #0x20 + movs r0, #3 + bl sub_0200531C + adds r1, r0, #0 + adds r0, r4, #0 + bl sub_0200CE5C + b _02005518 + .align 2, 0 + .pool +_02005504: + adds r0, r5, #0 + adds r0, #0x40 + add r1, sp, #0xc + bl sub_0200CE5C + adds r0, r5, #0 + adds r0, #0x60 + add r1, sp, #0xc + bl sub_0200CE5C +_02005518: + ldr r0, =gUnknown_02021A20 + ldr r0, [r0, #0x18] + ldr r1, =gUnknown_0201FDF4 + movs r2, #4 + bl sub_02004F04 + ldr r1, =gUnknown_02022C20 + movs r0, #1 + strb r0, [r1, #3] + strb r0, [r1, #2] + ldr r0, =gUnknown_02024960 + ldrb r0, [r0, #7] + add sp, #0x10 + pop {r4, r5} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_02005548 +sub_02005548: @ 0x02005548 + push {r4, r5, lr} + sub sp, #0xc + movs r5, #6 + str r5, [sp] + movs r4, #0 + str r4, [sp, #4] + movs r0, #0xe + str r0, [sp, #8] + movs r0, #3 + movs r1, #0 + movs r2, #0x14 + movs r3, #0x1e + bl sub_02008948 + str r5, [sp] + str r4, [sp, #4] + movs r0, #2 + movs r1, #0 + movs r2, #0xe + movs r3, #0x1e + bl sub_02008904 + ldr r5, =gUnknown_02021A20 + ldr r0, [r5, #0x18] + ldr r1, =0x0000FFFF + bl sub_020090B0 + ldr r0, [r5, #0x18] + ldr r3, =gUnknown_0202010F + movs r1, #0 + movs r2, #0 + bl sub_020009C4 + ldr r0, [r5, #0x18] + ldr r4, =gUnknown_0201FE24 + adds r1, r4, #0 + movs r2, #2 + bl sub_02004F04 + ldr r1, =gUnknown_02022C20 + movs r0, #1 + strb r0, [r1, #3] + strb r0, [r1, #2] + adds r0, r4, #0 + movs r1, #2 + bl sub_02004FB8 + adds r4, r0, #0 + cmp r4, #1 + beq _020055B4 + ldr r0, [r5, #0x18] + movs r1, #0 + bl sub_020090B0 +_020055B4: + adds r0, r4, #0 + add sp, #0xc + pop {r4, r5} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_020055D4 +sub_020055D4: @ 0x020055D4 + push {r4, r5, r6, r7, lr} + mov r7, sb + mov r6, r8 + push {r6, r7} + sub sp, #0x40 + mov r8, r0 + adds r6, r1, #0 + mov sb, r2 + adds r7, r3, #0 + movs r4, #6 + str r4, [sp] + movs r5, #0 + str r5, [sp, #4] + movs r0, #2 + movs r1, #0 + movs r2, #0xe + movs r3, #0x1e + bl sub_02008904 + str r4, [sp] + str r5, [sp, #4] + movs r0, #0xe + str r0, [sp, #8] + movs r0, #3 + movs r1, #0 + movs r2, #0x14 + movs r3, #0x1e + bl sub_02008948 + ldr r4, =gUnknown_02021A20 + ldr r0, [r4, #0x18] + movs r1, #0 + bl sub_020090B0 + ldr r0, [r4, #8] + bl sub_02008CEC + str r5, [r4, #8] + cmp r6, #0 + beq _02005658 + subs r0, r6, #1 + ldr r1, =gUnknown_02024960 + lsls r0, r0, #1 + adds r1, #0x14 + adds r0, r0, r1 + ldrh r0, [r0] + adds r1, r0, #0 + cmp r1, #0 + beq _02005648 + add r0, sp, #0x24 + bl sub_0200C4B8 + b _02005650 + .align 2, 0 + .pool +_02005648: + ldr r1, =gUnknown_02020027 + add r0, sp, #0x24 + bl sub_0200CE5C +_02005650: + movs r0, #0 + add r1, sp, #0x24 + bl sub_02000650 +_02005658: + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + mov r1, r8 + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + movs r1, #2 + add r2, sp, #0xc + bl sub_0200C1B8 + movs r0, #4 + add r1, sp, #0xc + bl sub_02000650 + ldr r6, =gUnknown_02022C20 + movs r5, #1 + strb r5, [r6, #2] + strb r5, [r6, #3] + ldr r4, =gUnknown_02021A20 + ldr r0, [r4, #0x18] + ldr r2, =gUnknown_0201FEC4 + mov r3, sb + lsls r1, r3, #2 + adds r1, r1, r2 + ldr r1, [r1] + bl sub_02000484 + cmp r7, #0 + bne _020056DA + ldr r0, [r4, #0x18] + movs r1, #0 + bl sub_020090B0 + movs r0, #6 + str r0, [sp] + str r7, [sp, #4] + movs r0, #0xe + str r0, [sp, #8] + movs r0, #2 + movs r1, #0 + movs r2, #0x20 + movs r3, #0x1e + bl sub_02008948 + ldr r0, [r4, #0x18] + movs r1, #4 + str r1, [sp] + str r7, [sp, #4] + movs r1, #0x12 + movs r2, #0 + movs r3, #0xa + bl sub_020090E4 + ldr r0, [r4, #0x18] + ldr r3, =gUnknown_02020087 + movs r1, #0 + movs r2, #0 + bl sub_020009C4 + ldr r0, [r4, #0x18] + ldr r1, =gUnknown_0201FD94 + movs r2, #4 + bl sub_02004F04 + strb r5, [r6, #2] +_020056DA: + add sp, #0x40 + pop {r3, r4} + mov r8, r3 + mov sb, r4 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02005704 +sub_02005704: @ 0x02005704 + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #0xc + mov sl, r0 + ldr r7, =gUnknown_020219F0 + ldr r0, =gUnknown_02020A48 + mov r1, sl + str r1, [r0] + bl sub_02004AC4 + mov r0, sl + bl sub_02004D68 + movs r0, #6 + str r0, [sp] + movs r5, #0 + str r5, [sp, #4] + movs r0, #0xe + str r0, [sp, #8] + movs r0, #2 + movs r1, #0 + movs r2, #0x20 + movs r3, #0x1e + bl sub_02008948 + ldr r4, =gUnknown_02021A20 + ldr r0, [r4, #0x18] + movs r1, #4 + str r1, [sp] + str r5, [sp, #4] + movs r1, #0x12 + movs r2, #0 + movs r3, #0xa + bl sub_020090E4 + ldr r0, [r4, #0x18] + ldr r3, =gUnknown_02020087 + movs r1, #0 + movs r2, #0 + bl sub_020009C4 + ldr r0, [r4, #0x18] + ldr r1, =gUnknown_0201FD94 + movs r2, #4 + bl sub_02004F04 + ldr r1, =gUnknown_02022C20 + movs r0, #1 + strb r0, [r1, #2] + bl sub_020007AC + movs r2, #1 + mov r8, r2 +_02005774: + ldrb r0, [r7] + cmp r0, #4 + bls _0200577C + b _02005B1E +_0200577C: + lsls r0, r0, #2 + ldr r1, =_020057A4 + adds r0, r0, r1 + ldr r0, [r0] + mov pc, r0 + .align 2, 0 + .pool +_020057A4: @ jump table + .4byte _020057B8 @ case 0 + .4byte _02005848 @ case 1 + .4byte _02005978 @ case 2 + .4byte _020059A4 @ case 3 + .4byte _02005A64 @ case 4 +_020057B8: + movs r0, #6 + str r0, [sp] + movs r5, #0 + str r5, [sp, #4] + movs r0, #0xe + str r0, [sp, #8] + movs r0, #2 + movs r1, #0 + movs r2, #0x20 + movs r3, #0x1e + bl sub_02008948 + ldr r4, =gUnknown_02021A20 + ldr r0, [r4, #0x18] + movs r1, #4 + str r1, [sp] + str r5, [sp, #4] + movs r1, #0x12 + movs r2, #0 + movs r3, #0xa + bl sub_020090E4 + ldr r0, [r4, #0x18] + ldr r3, =gUnknown_02020087 + movs r1, #0 + movs r2, #0 + bl sub_020009C4 + ldr r0, [r4, #0x18] + ldr r4, =gUnknown_0201FD94 + adds r1, r4, #0 + movs r2, #4 + bl sub_02004F04 + ldr r1, =gUnknown_02022C20 + movs r0, #1 + strb r0, [r1, #2] + adds r0, r4, #0 + movs r1, #4 + bl sub_02004FB8 + strb r0, [r7] + lsls r0, r0, #0x18 + lsrs r2, r0, #0x18 + cmp r2, #0 + beq _02005816 + b _02005B1E +_02005816: + ldr r1, =gUnknown_02024960 + ldrb r0, [r1, #3] + lsls r0, r0, #0x19 + lsrs r0, r0, #0x19 + cmp r0, #2 + beq _02005824 + b _02005B1E +_02005824: + ldr r3, =0x0000087B + adds r0, r1, r3 + ldrb r1, [r0] + strb r2, [r0] + b _02005996 + .align 2, 0 + .pool +_02005848: + bl sub_0200644C + adds r4, r0, #0 + cmp r4, #1 + bne _02005888 + ldr r0, =gUnknown_02020A48 + ldr r0, [r0] + movs r1, #0 + movs r2, #0xe + movs r3, #1 + bl sub_020055D4 + ldr r0, =gUnknown_02024960 + ldr r2, =0x0000087C + adds r1, r0, r2 + ldrb r2, [r1] + movs r2, #0 + strb r2, [r1] + ldr r3, =0x0000087B + adds r0, r0, r3 + ldrb r1, [r0] + strb r4, [r0] + b _020058A6 + .align 2, 0 + .pool +_02005888: + bl sub_0200644C + cmp r0, #2 + bne _020058B8 + ldr r1, =gUnknown_02024960 + ldr r2, =0x0000087C + adds r0, r1, r2 + ldrb r2, [r0] + movs r2, #0 + strb r2, [r0] + ldr r3, =0x0000087B + adds r1, r1, r3 + ldrb r0, [r1] + movs r0, #1 + strb r0, [r1] +_020058A6: + strb r2, [r7] + mov r8, r2 + b _02005B1E + .align 2, 0 + .pool +_020058B8: + mov r0, sl + bl sub_02005264 + adds r1, r0, #0 + ldr r0, =gUnknown_0201FDC4 + bl sub_02004FB8 + strb r0, [r7, #2] + lsls r0, r0, #0x18 + lsrs r1, r0, #0x18 + cmp r1, #0 + bne _02005908 + strb r1, [r7] + movs r0, #6 + str r0, [sp] + str r1, [sp, #4] + movs r0, #0xe + str r0, [sp, #8] + movs r0, #3 + movs r1, #0 + movs r2, #0x14 + movs r3, #0x1e + bl sub_02008948 + ldr r0, =gUnknown_02021A20 + ldr r0, [r0, #0x18] + movs r1, #0 + bl sub_020090B0 + ldr r1, =gUnknown_02022C20 + movs r0, #1 + strb r0, [r1, #3] + b _02005B1E + .align 2, 0 + .pool +_02005908: + ldrb r0, [r7, #2] + subs r0, #1 + bl sub_02006430 + cmp r0, #0 + bne _02005974 + ldr r0, =gUnknown_02020A48 + ldr r4, [r0] + ldrb r5, [r7, #2] + subs r0, r5, #1 + bl sub_02006414 + cmp r0, #6 + bls _02005926 + b _02005B1A +_02005926: + lsls r0, r0, #2 + ldr r1, =_02005938 + adds r0, r0, r1 + ldr r0, [r0] + mov pc, r0 + .align 2, 0 + .pool +_02005938: @ jump table + .4byte _02005B00 @ case 0 + .4byte _02005954 @ case 1 + .4byte _0200595C @ case 2 + .4byte _02005964 @ case 3 + .4byte _0200596C @ case 4 + .4byte _02005AE0 @ case 5 + .4byte _02005AF2 @ case 6 +_02005954: + adds r0, r4, #0 + adds r1, r5, #0 + movs r2, #4 + b _02005AEA +_0200595C: + adds r0, r4, #0 + adds r1, r5, #0 + movs r2, #5 + b _02005AEA +_02005964: + adds r0, r4, #0 + adds r1, r5, #0 + movs r2, #6 + b _02005AEA +_0200596C: + adds r0, r4, #0 + adds r1, r5, #0 + movs r2, #7 + b _02005AEA +_02005974: + movs r0, #4 + b _02005B1C +_02005978: + bl sub_02005548 + mov sb, r0 + movs r0, #0 + strb r0, [r7] + mov r2, sb + cmp r2, #1 + beq _0200598A + b _02005B1E +_0200598A: + ldr r0, =gUnknown_02024960 + ldr r3, =0x0000087B + adds r0, r0, r3 + ldrb r1, [r0] + movs r1, #3 + strb r1, [r0] +_02005996: + movs r0, #0 + mov r8, r0 + b _02005B1E + .align 2, 0 + .pool +_020059A4: + bl sub_020007F0 + bl sub_02002C80 + ldr r1, =gUnknown_02024960 + ldrb r0, [r1, #3] + lsls r0, r0, #0x19 + cmp r0, #0 + bne _020059C8 + ldr r2, =0x00000858 + adds r0, r1, r2 + ldrb r1, [r0] + movs r1, #1 + b _020059D0 + .align 2, 0 + .pool +_020059C8: + ldr r3, =0x00000858 + adds r0, r1, r3 + ldrb r1, [r0] + movs r1, #2 +_020059D0: + strb r1, [r0] + movs r0, #0 + mov r1, sl + movs r2, #0 + bl sub_02002A9C + movs r6, #0 + strb r6, [r7] + ldr r0, =gUnknown_02024960 + ldr r1, =0x0000087B + adds r0, r0, r1 + ldrb r0, [r0] + adds r5, r0, #0 + cmp r5, #4 + beq _02005A00 + mov r8, r6 + b _02005B1E + .align 2, 0 + .pool +_02005A00: + bl sub_02004AC4 + mov r0, sl + bl sub_02004D68 + movs r0, #6 + str r0, [sp] + str r6, [sp, #4] + movs r0, #0xe + str r0, [sp, #8] + movs r0, #2 + movs r1, #0 + movs r2, #0x20 + movs r3, #0x1e + bl sub_02008948 + ldr r4, =gUnknown_02021A20 + ldr r0, [r4, #0x18] + str r5, [sp] + str r6, [sp, #4] + movs r1, #0x12 + movs r2, #0 + movs r3, #0xa + bl sub_020090E4 + ldr r0, [r4, #0x18] + ldr r3, =gUnknown_02020087 + movs r1, #0 + movs r2, #0 + bl sub_020009C4 + ldr r0, [r4, #0x18] + ldr r1, =gUnknown_0201FD94 + movs r2, #4 + bl sub_02004F04 + ldr r1, =gUnknown_02022C20 + movs r0, #1 + strb r0, [r1, #2] + bl sub_020007AC + b _02005B1E + .align 2, 0 + .pool +_02005A64: + bl sub_02005468 + ldr r0, =gUnknown_0201FDF4 + movs r1, #4 + bl sub_02004FB8 + mov sb, r0 + cmp r0, #0 + bne _02005A80 + movs r0, #1 + b _02005B1C + .align 2, 0 + .pool +_02005A80: + ldr r0, =gUnknown_02020A48 + ldr r4, [r0] + ldrb r5, [r7, #2] + subs r0, r5, #1 + bl sub_02006414 + cmp r0, #6 + bhi _02005B1A + lsls r0, r0, #2 + ldr r1, =_02005AA4 + adds r0, r0, r1 + ldr r0, [r0] + mov pc, r0 + .align 2, 0 + .pool +_02005AA4: @ jump table + .4byte _02005B00 @ case 0 + .4byte _02005AC0 @ case 1 + .4byte _02005AC8 @ case 2 + .4byte _02005AD0 @ case 3 + .4byte _02005AD8 @ case 4 + .4byte _02005AE0 @ case 5 + .4byte _02005AF2 @ case 6 +_02005AC0: + adds r0, r4, #0 + adds r1, r5, #0 + movs r2, #4 + b _02005AEA +_02005AC8: + adds r0, r4, #0 + adds r1, r5, #0 + movs r2, #5 + b _02005AEA +_02005AD0: + adds r0, r4, #0 + adds r1, r5, #0 + movs r2, #6 + b _02005AEA +_02005AD8: + adds r0, r4, #0 + adds r1, r5, #0 + movs r2, #7 + b _02005AEA +_02005AE0: + bl sub_0200645C + adds r1, r0, #0 + adds r0, r4, #0 + movs r2, #8 +_02005AEA: + movs r3, #0 + bl sub_020055D4 + b _02005B1A +_02005AF2: + adds r0, r4, #0 + adds r1, r5, #0 + movs r2, #9 + movs r3, #0 + bl sub_020055D4 + b _02005B1A +_02005B00: + ldr r1, =gUnknown_02024960 + ldr r2, =0x0000087C + adds r0, r1, r2 + ldrb r2, [r0] + mov r3, sb + strb r3, [r0] + ldr r0, =0x0000087B + adds r1, r1, r0 + ldrb r0, [r1] + movs r0, #1 + strb r0, [r1] + movs r1, #0 + mov r8, r1 +_02005B1A: + movs r0, #0 +_02005B1C: + strb r0, [r7] +_02005B1E: + movs r0, #1 + bl sub_02008600 + mov r2, r8 + cmp r2, #0 + beq _02005B2C + b _02005774 +_02005B2C: + movs r2, #0 + ldr r0, =gUnknown_02024960 + ldr r3, =0x0000087B + adds r1, r0, r3 + ldrb r1, [r1] + adds r3, r0, #0 + cmp r1, #1 + beq _02005B50 + cmp r1, #2 + beq _02005B6C + b _02005B74 + .align 2, 0 + .pool +_02005B50: + ldrb r2, [r7, #2] + subs r2, #1 + ldr r1, =0x0000087C + adds r0, r3, r1 + ldrb r0, [r0] + subs r0, #1 + lsls r0, r0, #8 + movs r1, #0xff + lsls r1, r1, #8 + ands r0, r1 + orrs r2, r0 + b _02005B74 + .align 2, 0 + .pool +_02005B6C: + ldr r2, =0x0000087E + adds r0, r3, r2 + ldrb r0, [r0] + adds r2, r0, #0 +_02005B74: + ldr r1, =0x0000087B + adds r0, r3, r1 + ldrb r0, [r0] + lsls r0, r0, #0x10 + orrs r2, r0 + adds r1, #5 + adds r0, r3, r1 + str r2, [r0] + ldr r2, =0x0000087F + adds r1, r3, r2 + ldrb r0, [r1] + movs r0, #1 + strb r0, [r1] + bl sub_02000794 + cmp r0, #0 + bne _02005B9A + bl sub_020007F0 +_02005B9A: + movs r0, #0 + add sp, #0xc + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_02005BB8 +sub_02005BB8: @ 0x02005BB8 + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #0xc + mov r1, sp + movs r0, #0 + strh r0, [r1] + ldr r0, =gUnknown_02022EF4 + ldr r1, [r0] + ldr r2, =0x0100012C + mov r0, sp + bl CpuSet + ldr r0, =gUnknown_02024960 + ldr r0, [r0] + lsls r0, r0, #8 + lsrs r0, r0, #8 + str r0, [sp, #4] + movs r0, #0 + mov sl, r0 + movs r1, #0 + str r1, [sp, #8] +_02005BE8: + ldr r1, [sp, #4] + movs r2, #0xf + ands r1, r2 + cmp r1, #0xf + bne _02005BF4 + b _02005D66 +_02005BF4: + ldr r0, =gUnknown_02022EEC + movs r2, #0x64 + muls r1, r2, r1 + ldr r0, [r0] + adds r0, r0, r1 + ldr r3, =gUnknown_02022EF4 + mov r8, r3 + mov r6, sl + muls r6, r2, r6 + ldr r1, [r3] + adds r1, r1, r6 + movs r2, #0x32 + bl CpuSet + ldr r0, [sp, #8] + ldr r1, =gUnknown_02024960 + adds r7, r0, r1 + ldrh r0, [r7, #0x24] + mov r4, sp + adds r4, #2 + strh r0, [r4] + mov r2, r8 + ldr r0, [r2] + adds r0, r0, r6 + movs r1, #0x39 + adds r2, r4, #0 + bl sub_0200C040 + ldrh r0, [r7, #0x26] + lsls r0, r0, #0x14 + lsrs r0, r0, #0x14 + strh r0, [r4] + mov r3, r8 + ldr r0, [r3] + adds r0, r0, r6 + movs r1, #0x37 + adds r2, r4, #0 + bl sub_0200C040 + movs r0, #0 + mov sb, r0 + strh r0, [r4] + adds r5, r7, #0 + adds r5, #0x27 + ldrb r0, [r5] + lsls r0, r0, #0x1b + cmp r0, #0 + bge _02005C58 + movs r1, #0xf + strh r1, [r4] +_02005C58: + ldrb r0, [r5] + lsls r0, r0, #0x1a + cmp r0, #0 + bge _02005C68 + movs r0, #0xf0 + ldrh r2, [r4] + orrs r0, r2 + strh r0, [r4] +_02005C68: + mov r3, r8 + ldr r0, [r3] + adds r0, r0, r6 + movs r1, #0x22 + adds r2, r4, #0 + bl sub_0200C040 + ldrb r0, [r5] + lsls r0, r0, #0x19 + cmp r0, #0 + bge _02005C90 + movs r0, #1 + strh r0, [r4] + mov r1, r8 + ldr r0, [r1] + adds r0, r0, r6 + movs r1, #0x40 + adds r2, r4, #0 + bl sub_0200C040 +_02005C90: + mov r2, sb + strh r2, [r4] + ldrb r0, [r5] + lsrs r0, r0, #7 + cmp r0, #0 + beq _02005CA0 + ldrh r0, [r7, #0x28] + strh r0, [r4] +_02005CA0: + mov r3, r8 + ldr r0, [r3] + adds r0, r0, r6 + movs r1, #0xc + adds r2, r4, #0 + bl sub_0200C040 + ldrh r0, [r7, #0x2c] + strh r0, [r4] + mov r1, r8 + ldr r0, [r1] + adds r0, r0, r6 + movs r1, #0xd + adds r2, r4, #0 + bl sub_0200C040 + ldrh r0, [r7, #0x2e] + strh r0, [r4] + mov r2, r8 + ldr r0, [r2] + adds r0, r0, r6 + movs r1, #0xe + adds r2, r4, #0 + bl sub_0200C040 + ldrh r0, [r7, #0x30] + strh r0, [r4] + mov r3, r8 + ldr r0, [r3] + adds r0, r0, r6 + movs r1, #0xf + adds r2, r4, #0 + bl sub_0200C040 + ldrh r0, [r7, #0x32] + strh r0, [r4] + mov r1, r8 + ldr r0, [r1] + adds r0, r0, r6 + movs r1, #0x10 + adds r2, r4, #0 + bl sub_0200C040 + adds r0, r7, #0 + adds r0, #0x34 + ldrb r0, [r0] + strh r0, [r4] + mov r2, r8 + ldr r0, [r2] + adds r0, r0, r6 + movs r1, #0x11 + adds r2, r4, #0 + bl sub_0200C040 + adds r0, r7, #0 + adds r0, #0x35 + ldrb r0, [r0] + strh r0, [r4] + mov r3, r8 + ldr r0, [r3] + adds r0, r0, r6 + movs r1, #0x12 + adds r2, r4, #0 + bl sub_0200C040 + adds r0, r7, #0 + adds r0, #0x36 + ldrb r0, [r0] + strh r0, [r4] + mov r1, r8 + ldr r0, [r1] + adds r0, r0, r6 + movs r1, #0x13 + adds r2, r4, #0 + bl sub_0200C040 + adds r0, r7, #0 + adds r0, #0x37 + ldrb r0, [r0] + strh r0, [r4] + mov r2, r8 + ldr r0, [r2] + adds r0, r0, r6 + movs r1, #0x14 + adds r2, r4, #0 + bl sub_0200C040 + ldr r4, =gUnknown_02024960 + adds r4, #0x38 + ldr r3, [sp, #8] + adds r4, r3, r4 + mov r0, sl + bl sub_0200CB34 + adds r1, r0, #0 + adds r0, r4, #0 + movs r2, #0xa0 + bl CpuSet +_02005D66: + ldr r0, [sp, #8] + movs r1, #0xaa + lsls r1, r1, #1 + adds r0, r0, r1 + str r0, [sp, #8] + movs r2, #1 + add sl, r2 + ldr r3, [sp, #4] + lsrs r3, r3, #4 + str r3, [sp, #4] + mov r0, sl + cmp r0, #5 + bgt _02005D82 + b _02005BE8 +_02005D82: + ldr r1, =gUnknown_02024960 + ldrb r0, [r1, #3] + lsls r0, r0, #0x19 + lsrs r2, r0, #0x19 + cmp r2, #0 + beq _02005DB0 + ldr r2, =0x00000858 + adds r0, r1, r2 + ldrb r1, [r0] + movs r1, #1 + strb r1, [r0] + b _02005DB8 + .align 2, 0 + .pool +_02005DB0: + ldr r3, =0x00000858 + adds r0, r1, r3 + ldrb r1, [r0] + strb r2, [r0] +_02005DB8: + add sp, #0xc + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02005DCC +sub_02005DCC: @ 0x02005DCC + push {r4, r5, r6, lr} + mov r6, r8 + push {r6} + sub sp, #0x24 + mov r8, r0 + adds r6, r1, #0 + ldr r0, =gUnknown_02020A48 + mov r1, r8 + str r1, [r0] + bl sub_02004AC4 + mov r0, r8 + bl sub_02004D68 + movs r5, #6 + str r5, [sp] + movs r4, #0 + str r4, [sp, #4] + movs r0, #0xe + str r0, [sp, #8] + movs r0, #2 + movs r1, #0 + movs r2, #0x26 + movs r3, #0x1e + bl sub_02008948 + str r5, [sp] + str r4, [sp, #4] + movs r0, #3 + movs r1, #0 + movs r2, #0xe + movs r3, #0x1e + bl sub_02008904 + ldr r4, =gUnknown_02021A20 + ldr r0, [r4, #0x18] + movs r1, #0 + bl sub_020090B0 + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + mov r1, r8 + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + movs r1, #2 + add r2, sp, #0xc + bl sub_0200C1B8 + movs r0, #4 + add r1, sp, #0xc + bl sub_02000650 + bl sub_020007AC + ldr r0, [r4, #0x18] + ldr r1, =gUnknown_0201FEC4 + lsls r6, r6, #2 + adds r6, r6, r1 + ldr r1, [r6] + bl sub_02000484 + bl sub_020007F0 + add sp, #0x24 + pop {r3} + mov r8, r3 + pop {r4, r5, r6} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_02005E68 +sub_02005E68: @ 0x02005E68 + push {r4, r5, lr} + sub sp, #0xc + movs r0, #6 + str r0, [sp] + movs r5, #0 + str r5, [sp, #4] + movs r0, #0xe + str r0, [sp, #8] + movs r0, #2 + movs r1, #0 + movs r2, #0x20 + movs r3, #0x1e + bl sub_02008948 + ldr r4, =gUnknown_02021A20 + ldr r0, [r4, #0x18] + movs r1, #4 + str r1, [sp] + str r5, [sp, #4] + movs r1, #0x12 + movs r2, #0 + movs r3, #0xa + bl sub_020090E4 + ldr r0, [r4, #0x18] + ldr r3, =gUnknown_02020087 + movs r1, #0 + movs r2, #0 + bl sub_020009C4 + ldr r0, [r4, #0x18] + ldr r1, =gUnknown_0201FD94 + movs r2, #4 + bl sub_02004F04 + ldr r1, =gUnknown_02022C20 + movs r0, #1 + strb r0, [r1, #2] + add sp, #0xc + pop {r4, r5} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02005ECC +sub_02005ECC: @ 0x02005ECC + push {lr} + sub sp, #0xc + movs r0, #6 + str r0, [sp] + movs r0, #0 + str r0, [sp, #4] + movs r0, #0xe + str r0, [sp, #8] + movs r0, #3 + movs r1, #0 + movs r2, #0x14 + movs r3, #0x1e + bl sub_02008948 + ldr r0, =gUnknown_02021A20 + ldr r0, [r0, #0x18] + movs r1, #0 + bl sub_020090B0 + ldr r1, =gUnknown_02022C20 + movs r0, #1 + strb r0, [r1, #3] + add sp, #0xc + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02005F08 +sub_02005F08: @ 0x02005F08 + push {lr} + sub sp, #0x1c + ldr r0, =gUnknown_02024960 + lsls r1, r1, #1 + adds r0, #0x14 + adds r1, r1, r0 + ldrh r0, [r1] + adds r1, r0, #0 + cmp r1, #0 + beq _02005F28 + mov r0, sp + bl sub_0200C4B8 + b _02005F30 + .align 2, 0 + .pool +_02005F28: + ldr r1, =gUnknown_02020027 + mov r0, sp + bl sub_0200CE5C +_02005F30: + movs r0, #0 + mov r1, sp + bl sub_02000650 + add sp, #0x1c + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02005F44 +sub_02005F44: @ 0x02005F44 + push {r4, r5, lr} + adds r4, r0, #0 + adds r5, r1, #0 + subs r0, r5, #1 + bl sub_02006414 + cmp r0, #6 + bhi _02005FC2 + lsls r0, r0, #2 + ldr r1, =_02005F64 + adds r0, r0, r1 + ldr r0, [r0] + mov pc, r0 + .align 2, 0 + .pool +_02005F64: @ jump table + .4byte _02005F80 @ case 0 + .4byte _02005F84 @ case 1 + .4byte _02005F8C @ case 2 + .4byte _02005F94 @ case 3 + .4byte _02005F9C @ case 4 + .4byte _02005FA4 @ case 5 + .4byte _02005FB6 @ case 6 +_02005F80: + movs r0, #1 + b _02005FC4 +_02005F84: + adds r0, r4, #0 + adds r1, r5, #0 + movs r2, #4 + b _02005FAE +_02005F8C: + adds r0, r4, #0 + adds r1, r5, #0 + movs r2, #5 + b _02005FAE +_02005F94: + adds r0, r4, #0 + adds r1, r5, #0 + movs r2, #6 + b _02005FAE +_02005F9C: + adds r0, r4, #0 + adds r1, r5, #0 + movs r2, #7 + b _02005FAE +_02005FA4: + bl sub_0200645C + adds r1, r0, #0 + adds r0, r4, #0 + movs r2, #8 +_02005FAE: + movs r3, #0 + bl sub_020055D4 + b _02005FC2 +_02005FB6: + adds r0, r4, #0 + adds r1, r5, #0 + movs r2, #9 + movs r3, #0 + bl sub_020055D4 +_02005FC2: + movs r0, #0 +_02005FC4: + pop {r4, r5} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_02005FCC +sub_02005FCC: @ 0x02005FCC + push {r4, lr} + movs r0, #0 + bl sub_0200A2C8 + adds r2, r0, #0 + ldr r0, =gUnknown_02024960 + ldr r1, =0x0000084C + adds r3, r0, r1 + ldrb r1, [r3] + movs r0, #5 + rsbs r0, r0, #0 + ands r0, r1 + strb r0, [r3] + cmp r2, #0 + bne _02006044 + ldr r0, =0x04000154 + str r2, [r0] + ldrb r1, [r3] + movs r0, #4 + ands r0, r1 + cmp r0, #0 + bne _02006006 + adds r2, r3, #0 + movs r3, #4 +_02005FFC: + ldrb r1, [r2] + adds r0, r3, #0 + ands r0, r1 + cmp r0, #0 + beq _02005FFC +_02006006: + movs r0, #1 + bl sub_0200A2C8 + adds r2, r0, #0 + ldr r0, =gUnknown_02024960 + ldr r1, =0x0000084C + adds r3, r0, r1 + ldrb r1, [r3] + movs r0, #8 + ands r0, r1 + cmp r0, #0 + beq _0200602A + movs r4, #8 +_02006020: + ldrb r1, [r3] + adds r0, r4, #0 + ands r0, r1 + cmp r0, #0 + bne _02006020 +_0200602A: + cmp r2, #0 + bne _02006044 + ldr r0, =0x04000154 + str r2, [r0] + movs r0, #0 + b _0200604E + .align 2, 0 + .pool +_02006044: + ldr r1, =0x04000154 + movs r0, #1 + rsbs r0, r0, #0 + str r0, [r1] + movs r0, #1 +_0200604E: + pop {r4} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_02006058 +sub_02006058: @ 0x02006058 + push {r4, r5, r6, lr} + movs r0, #2 + bl sub_02004A04 + ldr r0, =gUnknown_02024960 + ldr r1, =0x0000084C + adds r2, r0, r1 + ldrb r1, [r2] + movs r0, #2 + ands r0, r1 + cmp r0, #0 + bne _02006084 + ldr r4, =gUnknown_020251F0 + movs r3, #2 +_02006074: + ldrb r0, [r4, #0xc] + cmp r0, #0 + beq _020060A6 + ldrb r1, [r2] + adds r0, r3, #0 + ands r0, r1 + cmp r0, #0 + beq _02006074 +_02006084: + ldr r0, =gUnknown_020251EC + ldrb r0, [r0] + cmp r0, #0 + beq _020060C0 + bl sub_0200CD38 + movs r1, #2 + ands r1, r0 + cmp r1, #0 + bne _02006144 + ldr r1, =0x04000154 + movs r0, #1 + rsbs r0, r0, #0 + str r0, [r1] + movs r0, #5 + bl sub_02004A04 +_020060A6: + movs r0, #2 + b _02006256 + .align 2, 0 + .pool +_020060C0: + ldr r6, =gUnknown_020251E8 + ldr r0, [r6] + ldr r5, =gUnknown_02022ED8 + ldr r1, [r5] + adds r0, #0xd8 + ldr r0, [r0] + adds r1, r1, r0 + ldrh r4, [r1] + ldr r0, =0x0000FFFE + ands r0, r4 + cmp r0, #0 + bne _020060E6 + ldr r1, =0x04000154 + movs r0, #1 + rsbs r0, r0, #0 + str r0, [r1] + movs r0, #0xa + bl sub_02004A34 +_020060E6: + ldr r0, [r6] + ldr r1, [r5] + adds r0, #0x98 + ldr r0, [r0] + adds r1, r1, r0 + movs r0, #7 + ldrb r1, [r1] + ands r0, r1 + cmp r0, #0 + bne _02006108 + ldr r1, =0x04000154 + movs r0, #1 + rsbs r0, r0, #0 + str r0, [r1] + movs r0, #0xa + bl sub_02004A34 +_02006108: + ldr r2, =gUnknown_02022EF4 + ldr r0, =gUnknown_02024960 + ldr r1, =0x0000084C + adds r0, r0, r1 + ldrb r0, [r0] + lsrs r0, r0, #4 + movs r1, #0x64 + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + movs r1, #0x25 + movs r2, #0 + bl sub_0200C1B8 + lsls r0, r0, #0x10 + lsrs r0, r0, #0x10 + movs r1, #0x80 + lsls r1, r1, #9 + lsls r1, r0 + lsrs r1, r1, #0x10 + ands r4, r1 + cmp r4, #0 + bne _02006144 + ldr r1, =0x04000154 + movs r0, #1 + rsbs r0, r0, #0 + str r0, [r1] + movs r0, #0xa + bl sub_02004A34 +_02006144: + movs r0, #3 + bl sub_02004A04 + ldr r5, =gUnknown_02024960 + ldr r0, =0x0000084C + adds r1, r5, r0 + ldr r0, [r1] + lsls r0, r0, #8 + lsrs r0, r0, #0x10 + ldr r6, =gUnknown_02022EF4 + ldr r1, [r1] + lsls r1, r1, #8 + lsrs r1, r1, #0x10 + movs r4, #0x64 + adds r2, r1, #0 + muls r2, r4, r2 + ldr r1, [r6] + adds r1, r1, r2 + bl sub_0200C94C + ldr r1, =0x0000084F + adds r2, r5, r1 + ldrb r1, [r2] + movs r0, #0x85 + lsls r0, r0, #4 + adds r3, r5, r0 + ldrb r0, [r3] + lsls r0, r0, #8 + orrs r0, r1 + cmp r0, #0 + beq _0200619E + ldrb r1, [r2] + ldrb r0, [r3] + lsls r0, r0, #8 + orrs r0, r1 + ldrb r2, [r2] + ldrb r1, [r3] + lsls r1, r1, #8 + orrs r1, r2 + adds r2, r1, #0 + muls r2, r4, r2 + ldr r1, [r6] + adds r1, r1, r2 + bl sub_0200C94C +_0200619E: + movs r4, #0 + ldr r1, =0x0000085C + adds r5, r5, r1 +_020061A4: + ldr r0, =gUnknown_02022EDC + ldr r0, [r0] + adds r2, r0, r4 + ldrb r0, [r2] + cmp r0, #0 + bne _020061C4 + adds r1, r4, r5 + ldrb r0, [r1] + cmp r0, #0 + beq _020061C4 + ldrb r0, [r1] + strb r0, [r2] + ldrb r1, [r1] + adds r0, r4, #0 + bl sub_0200C130 +_020061C4: + adds r4, #1 + cmp r4, #0xa + ble _020061A4 + bl sub_02005FCC + adds r4, r0, #0 + bl sub_020085F4 + adds r1, r0, #0 + movs r0, #0x3f + ands r0, r1 + bl sub_02008600 + cmp r4, #1 + beq _02006222 + cmp r4, #1 + bgt _02006214 + cmp r4, #0 + beq _0200621A + b _02006230 + .align 2, 0 + .pool +_02006214: + cmp r4, #2 + beq _0200622A + b _02006230 +_0200621A: + movs r0, #1 + bl sub_02004A04 + b _02006230 +_02006222: + movs r0, #4 + bl sub_02004A04 + b _02006230 +_0200622A: + movs r0, #5 + bl sub_02004A04 +_02006230: + ldr r1, =gUnknown_02024960 + ldr r0, =0x0000084C + adds r1, r1, r0 + ldrb r2, [r1] + movs r0, #2 + rsbs r0, r0, #0 + ands r0, r2 + strb r0, [r1] + ldrb r2, [r1] + movs r0, #3 + rsbs r0, r0, #0 + ands r0, r2 + strb r0, [r1] + ldrb r2, [r1] + movs r0, #5 + rsbs r0, r0, #0 + ands r0, r2 + strb r0, [r1] + adds r0, r4, #0 +_02006256: + pop {r4, r5, r6} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_02006264 +sub_02006264: @ 0x02006264 + push {r4, r5, lr} + movs r0, #3 + bl sub_02004A04 + ldr r5, =gUnknown_02024960 + ldr r0, =0x0000085B + adds r4, r5, r0 + ldrb r0, [r4] + cmp r0, #0 + beq _020062CA + ldr r0, =gUnknown_02022EF0 + ldr r1, [r0] + ldrb r0, [r1] + adds r0, #1 + strb r0, [r1] + ldrb r0, [r4] + movs r1, #1 + bl sub_0200C7A0 + cmp r0, #0 + bne _0200629E + ldrb r0, [r4] + movs r1, #2 + bl sub_0200C7A0 + ldrb r0, [r4] + movs r1, #3 + bl sub_0200C7A0 +_0200629E: + movs r4, #0 + ldr r0, =0x0000085C + adds r5, r5, r0 +_020062A4: + ldr r0, =gUnknown_02022EDC + ldr r0, [r0] + adds r2, r0, r4 + ldrb r0, [r2] + cmp r0, #0 + bne _020062C4 + adds r1, r4, r5 + ldrb r0, [r1] + cmp r0, #0 + beq _020062C4 + ldrb r0, [r1] + strb r0, [r2] + ldrb r1, [r1] + adds r0, r4, #0 + bl sub_0200C130 +_020062C4: + adds r4, #1 + cmp r4, #0xa + ble _020062A4 +_020062CA: + bl sub_02005FCC + adds r4, r0, #0 + cmp r4, #1 + beq _02006302 + cmp r4, #1 + bgt _020062F4 + cmp r4, #0 + beq _020062FA + b _02006310 + .align 2, 0 + .pool +_020062F4: + cmp r4, #2 + beq _0200630A + b _02006310 +_020062FA: + movs r0, #1 + bl sub_02004A04 + b _02006310 +_02006302: + movs r0, #4 + bl sub_02004A04 + b _02006310 +_0200630A: + movs r0, #5 + bl sub_02004A04 +_02006310: + ldr r1, =gUnknown_02024960 + ldr r0, =0x0000084C + adds r1, r1, r0 + ldrb r2, [r1] + movs r0, #2 + rsbs r0, r0, #0 + ands r0, r2 + strb r0, [r1] + ldrb r2, [r1] + movs r0, #3 + rsbs r0, r0, #0 + ands r0, r2 + strb r0, [r1] + ldrb r2, [r1] + movs r0, #5 + rsbs r0, r0, #0 + ands r0, r2 + strb r0, [r1] + adds r0, r4, #0 + pop {r4, r5} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_02006344 +sub_02006344: @ 0x02006344 + push {r4, r5, r6, lr} + ldr r5, =gUnknown_02024960 + ldrh r0, [r5, #0x10] + adds r6, r0, #0 + cmp r6, #0 + bne _020063EA + ldr r0, =0x00000858 + adds r1, r5, r0 + ldrb r0, [r1] + movs r0, #2 + strb r0, [r1] + ldr r4, =gUnknown_02022EF4 + ldr r0, [r4] + movs r1, #0 + movs r2, #0 + bl sub_0200C1B8 + str r0, [r5, #8] + ldr r0, [r4] + movs r1, #1 + movs r2, #0 + bl sub_0200C1B8 + str r0, [r5, #0xc] + ldr r0, [r4] + movs r1, #0xb + movs r2, #0 + bl sub_0200C1B8 + lsls r0, r0, #0x10 + lsrs r0, r0, #0x10 + ldrh r1, [r5, #0x10] + strh r0, [r5, #0x10] + ldrh r0, [r5, #0x12] + strh r6, [r5, #0x12] + ldr r0, [r4] + movs r1, #0 + bl sub_0200B6F4 + ldrh r1, [r5, #0x14] + strh r0, [r5, #0x14] + ldr r0, [r4] + movs r1, #1 + bl sub_0200B6F4 + ldrh r1, [r5, #0x16] + strh r0, [r5, #0x16] + ldr r0, [r4] + movs r1, #2 + bl sub_0200B6F4 + ldrh r1, [r5, #0x18] + strh r0, [r5, #0x18] + ldr r0, [r4] + movs r1, #3 + bl sub_0200B6F4 + ldrh r1, [r5, #0x1a] + strh r0, [r5, #0x1a] + ldr r0, [r4] + movs r1, #0 + bl sub_0200B728 + ldrb r1, [r5, #0x1c] + strb r0, [r5, #0x1c] + ldr r0, [r4] + movs r1, #1 + bl sub_0200B728 + ldrb r1, [r5, #0x1d] + strb r0, [r5, #0x1d] + ldr r0, [r4] + movs r1, #2 + bl sub_0200B728 + ldrb r1, [r5, #0x1e] + strb r0, [r5, #0x1e] + ldr r0, [r4] + movs r1, #3 + bl sub_0200B728 + ldrb r1, [r5, #0x1f] + strb r0, [r5, #0x1f] +_020063EA: + pop {r4, r5, r6} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_020063FC +sub_020063FC: @ 0x020063FC + ldr r1, =gUnknown_02024960 + adds r1, #0x23 + ldrb r0, [r1] + lsls r0, r0, #0x1c + lsrs r0, r0, #0x1c + ldrb r1, [r1] + lsrs r1, r1, #4 + lsls r1, r1, #0x10 + orrs r0, r1 + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_02006414 +sub_02006414: @ 0x02006414 + push {lr} + adds r1, r0, #0 + ldr r0, =gUnknown_02024960 + ldrh r0, [r0, #0x20] + bl sub_020064BC + adds r1, r0, #0 + movs r0, #7 + ands r0, r1 + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_02006430 +sub_02006430: @ 0x02006430 + push {lr} + adds r1, r0, #0 + ldr r0, =gUnknown_02024960 + ldrh r0, [r0, #0x20] + bl sub_020064BC + lsrs r0, r0, #3 + movs r1, #1 + ands r0, r1 + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200644C +sub_0200644C: @ 0x0200644C + ldr r0, =gUnknown_02024960 + adds r0, #0x22 + ldrb r0, [r0] + lsls r0, r0, #0x1c + lsrs r0, r0, #0x1c + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_0200645C +sub_0200645C: @ 0x0200645C + ldr r0, =gUnknown_02024960 + adds r0, #0x22 + ldrb r0, [r0] + lsrs r0, r0, #4 + adds r0, #1 + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_0200646C +sub_0200646C: @ 0x0200646C + push {lr} + ldr r2, =gUnknown_02022EF4 + movs r1, #0x64 + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + bl sub_0200B7D0 + movs r1, #0 + cmp r0, #7 + bne _02006484 + movs r1, #1 +_02006484: + adds r0, r1, #0 + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_02006490 +sub_02006490: @ 0x02006490 + ldr r1, =gUnknown_02024960 + ldrb r0, [r1, #3] + lsls r0, r0, #0x19 + cmp r0, #0 + bne _020064A4 + movs r0, #0 + b _020064AC + .align 2, 0 + .pool +_020064A4: + ldrb r0, [r1, #3] + lsls r0, r0, #0x19 + lsrs r0, r0, #0x19 + subs r0, #1 +_020064AC: + bx lr + .align 2, 0 + + thumb_func_start sub_020064B0 +sub_020064B0: @ 0x020064B0 + ldr r0, =gUnknown_02024960 + ldrb r0, [r0, #3] + lsrs r0, r0, #7 + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_020064BC +sub_020064BC: @ 0x020064BC + adds r2, r0, #0 + cmp r1, #0 + ble _020064CA +_020064C2: + lsrs r2, r2, #4 + subs r1, #1 + cmp r1, #0 + bne _020064C2 +_020064CA: + movs r0, #0xf + ands r0, r2 + bx lr + + thumb_func_start sub_020064D0 +sub_020064D0: @ 0x020064D0 + adds r2, r0, #0 + ldr r0, =gUnknown_02024960 + ldr r0, [r0] + lsls r0, r0, #8 + lsrs r1, r0, #8 + cmp r2, #0 + ble _020064E8 + adds r0, r2, #0 +_020064E0: + lsrs r1, r1, #4 + subs r0, #1 + cmp r0, #0 + bne _020064E0 +_020064E8: + movs r0, #0xf + ands r1, r0 + adds r0, r1, #0 + bx lr + .align 2, 0 + .pool diff --git a/asm/crt0.s b/asm/crt0.s new file mode 100644 index 0000000..deb5da4 --- /dev/null +++ b/asm/crt0.s @@ -0,0 +1,126 @@ + .include "asm/macros/function.inc" + .text + .syntax unified + + arm_func_start _start +_start: @ 0x02000000 + b _init + .global gRomHeader +gRomHeader: + .byte 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 + .byte 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 + .byte 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 + .byte 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 + .byte 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 + .byte 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 + .byte 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 + .byte 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 + .byte 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 + .byte 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 + .byte 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x41, 0x58, 0x56, 0x45 + .byte 0x30, 0x31, 0x96, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xF0, 0x00, 0x00 +_init: + mov r0, #0x12 + msr cpsr_fc, r0 + ldr sp, _020000F8 @=0x03007fa0 + mov r0, #0x1f + msr cpsr_fc, r0 + ldr sp, _020000F4 @=0x03007e60 + ldr r1, _020000FC @=0x03007ffc + adr r0, _intr + str r0, [r1] + ldr r1, _02000100 @=AgbMain + mov lr, pc + bx r1 + b _init + .align 2, 0 + +_020000F4: .4byte 0x03007e60 +_020000F8: .4byte 0x03007fa0 +_020000FC: .4byte 0x03007ffc +_02000100: .4byte AgbMain + + arm_func_start _intr +_intr: @ 0x02000104 + mov r3, #0x4000000 + add r3, r3, #0x200 + ldr r2, [r3] + ldrh r1, [r3, #8] + mrs r0, spsr + push {r0, r1, r2, r3, lr} + mov r0, #1 + strh r0, [r3, #8] + and r1, r2, r2, lsr #16 + mov ip, #0 + ands r0, r1, #0x80 + bne _020001D4 + add ip, ip, #4 + ands r0, r1, #1 + bne _020001D4 + add ip, ip, #4 + ands r0, r1, #2 + bne _020001D4 + add ip, ip, #4 + ands r0, r1, #4 + bne _020001D4 + add ip, ip, #4 + ands r0, r1, #8 + bne _020001D4 + add ip, ip, #4 + ands r0, r1, #0x10 + bne _020001D4 + add ip, ip, #4 + ands r0, r1, #0x20 + bne _020001D4 + add ip, ip, #4 + ands r0, r1, #0x40 + bne _020001D4 + add ip, ip, #4 + ands r0, r1, #0x100 + bne _020001D4 + add ip, ip, #4 + ands r0, r1, #0x200 + bne _020001D4 + add ip, ip, #4 + ands r0, r1, #0x400 + bne _020001D4 + add ip, ip, #4 + ands r0, r1, #0x800 + bne _020001D4 + add ip, ip, #4 + ands r0, r1, #0x1000 + bne _020001D4 + add ip, ip, #4 + ands r0, r1, #0x2000 + strbne r0, [r3, #-0x17c] +_020001D0: + bne _020001D0 +_020001D4: + strh r0, [r3, #2] + mov r1, #0x20c0 + bic r2, r2, r0 + and r1, r1, r2 + strh r1, [r3] + mrs r3, apsr + bic r3, r3, #0xdf + orr r3, r3, #0x1f + msr cpsr_fc, r3 + ldr r1, =gUnknown_02022BD0 + add r1, r1, ip + ldr r0, [r1] + stmdb sp!, {lr} + adr lr, _intr_ret + bx r0 +_intr_ret: @ 0x02000210 + ldm sp!, {lr} + mrs r3, apsr + bic r3, r3, #0xdf + orr r3, r3, #0x92 + msr cpsr_fc, r3 + pop {r0, r1, r2, r3, lr} + strh r2, [r3] + strh r1, [r3, #8] + msr spsr_fc, r0 + bx lr + .align 2, 0 + .pool diff --git a/asm/libagbsyscall.s b/asm/libagbsyscall.s new file mode 100644 index 0000000..f848e14 --- /dev/null +++ b/asm/libagbsyscall.s @@ -0,0 +1,82 @@ + .include "asm/macros/function.inc" + .text + .syntax unified + + thumb_func_start CpuSet +CpuSet: @ 0x0200FD04 + svc #0xb + bx lr + + thumb_func_start Div +Div: @ 0x0200FD08 + svc #6 + bx lr + + thumb_func_start Mod +Mod: @ 0x0200FD0C + svc #6 + adds r0, r1, #0 + bx lr + .align 2, 0 + + thumb_func_start HuffUnComp +HuffUnComp: @ 0x0200FD14 + svc #0x13 + bx lr + + thumb_func_start LZ77UnCompVRAM +LZ77UnCompVRAM: @ 0x0200FD18 + svc #0x12 + bx lr + + thumb_func_start LZ77UnCompWRAM +LZ77UnCompWRAM: @ 0x0200FD1C + svc #0x11 + bx lr + + thumb_func_start RLUnCompVRAM +RLUnCompVRAM: @ 0x0200FD20 + svc #0x15 + bx lr + + thumb_func_start RegisterRamReset +RegisterRamReset: @ 0x0200FD24 + svc #1 + bx lr + + thumb_func_start SoftReset +SoftReset: @ 0x0200FD28 + ldr r3, =0x04000208 + movs r2, #0 + strb r2, [r3] + ldr r1, =0x03007F00 + mov sp, r1 + svc #1 + svc #0 + movs r0, r0 + .align 2, 0 + .pool + + thumb_func_start VBlankIntrWait +VBlankIntrWait: @ 0x0200FD40 + movs r2, #0 + svc #5 + bx lr + .align 2, 0 + + thumb_func_start SoftResetRom +SoftResetRom: @ 0x0200FD48 + ldr r3, =0x04000208 + movs r2, #0 + strb r2, [r3] + ldr r3, =0x03007FFA + movs r2, #1 + strb r2, [r3] + subs r3, #0xfa + mov sp, r3 + movs r2, #1 + bics r0, r2 + svc #1 + svc #0 + .align 2, 0 + .pool diff --git a/asm/m4a.s b/asm/m4a.s new file mode 100644 index 0000000..a5aeef1 --- /dev/null +++ b/asm/m4a.s @@ -0,0 +1,4308 @@ + .include "asm/macros/function.inc" + .text + .syntax unified + + thumb_func_start umul3232H32 +umul3232H32: @ 0x020064F4 + adr r2, __umul3232H32 + bx r2 + .arm +__umul3232H32: @ 0x020064F8 + umull r2, r3, r0, r1 + add r0, r3, #0 + bx lr + + thumb_func_start SoundMain +SoundMain: @ 0x02006504 + ldr r0, =0x03007FF0 + ldr r0, [r0] + ldr r2, =0x68736D53 + ldr r3, [r0] + cmp r2, r3 + beq _02006512 + bx lr +_02006512: + adds r3, #1 + str r3, [r0] + push {r4, r5, r6, r7, lr} + mov r1, r8 + mov r2, sb + mov r3, sl + mov r4, fp + push {r0, r1, r2, r3, r4} + sub sp, #0x18 + ldrb r1, [r0, #0xc] + cmp r1, #0 + beq _02006536 + ldr r2, _0200657C @=0x04000006 + ldrb r2, [r2] + cmp r2, #0xa0 + bhs _02006534 + adds r2, #0xe4 +_02006534: + adds r1, r1, r2 +_02006536: + str r1, [sp, #0x14] + ldr r3, [r0, #0x20] + cmp r3, #0 + beq _02006546 + ldr r0, [r0, #0x24] + bl sub_02006926 + ldr r0, [sp, #0x18] +_02006546: + ldr r3, [r0, #0x28] + bl sub_02006926 + ldr r0, [sp, #0x18] + ldr r3, [r0, #0x10] + mov r8, r3 + ldr r5, _02006580 @=0x00000350 + adds r5, r5, r0 + ldrb r4, [r0, #4] + subs r7, r4, #1 + bls _02006566 + ldrb r1, [r0, #0xb] + subs r1, r1, r7 + mov r2, r8 + muls r2, r1, r2 + adds r5, r5, r2 +_02006566: + str r5, [sp, #8] + ldr r6, _02006584 @=0x00000630 + ldr r3, =gUnknown_020213B5 + bx r3 + .align 2, 0 + .pool +_0200657C: .4byte 0x04000006 +_02006580: .4byte 0x00000350 +_02006584: .4byte 0x00000630 + + thumb_func_start SoundMainRAM +SoundMainRAM: @ 0x02006588 + ldrb r3, [r0, #5] + cmp r3, #0 + beq _020065E8 + adr r1, SoundMainRAM_Reverb + bx r1 + .align 2, 0 + .arm +SoundMainRAM_Reverb: @ 0x02006594 + cmp r4, #2 + addeq r7, r0, #0x350 + addne r7, r5, r8 + mov r4, r8 +_020065A4: + ldrsb r0, [r5, r6] + ldrsb r1, [r5] + add r0, r0, r1 + ldrsb r1, [r7, r6] + add r0, r0, r1 + ldrsb r1, [r7], #1 + add r0, r0, r1 + mul r1, r0, r3 + asr r0, r1, #9 + tst r0, #0x80 + addne r0, r0, #1 + strb r0, [r5, r6] + strb r0, [r5], #1 + subs r4, r4, #1 + bgt _020065A4 + adr r0, _02006616 + 1 + bx r0 + .thumb +_020065E8: + movs r0, #0 + mov r1, r8 + adds r6, r6, r5 + lsrs r1, r1, #3 + blo _020065F6 + stm r5!, {r0} + stm r6!, {r0} +_020065F6: + lsrs r1, r1, #1 + blo _02006602 + stm r5!, {r0} + stm r6!, {r0} + stm r5!, {r0} + stm r6!, {r0} +_02006602: + stm r5!, {r0} + stm r6!, {r0} + stm r5!, {r0} + stm r6!, {r0} + stm r5!, {r0} + stm r6!, {r0} + stm r5!, {r0} + stm r6!, {r0} + subs r1, #1 + bgt _02006602 +_02006616: + ldr r4, [sp, #0x18] + ldr r0, [r4, #0x18] + mov ip, r0 + ldrb r0, [r4, #6] + adds r4, #0x50 +_02006620: + str r0, [sp, #4] + ldr r3, [r4, #0x24] + ldr r0, [sp, #0x14] + cmp r0, #0 + beq _02006640 + ldr r1, =0x04000006 + ldrb r1, [r1] + cmp r1, #0xa0 + bhs _02006634 + adds r1, #0xe4 +_02006634: + cmp r1, r0 + blo _02006640 + b _02006912 + .align 2, 0 + .pool +_02006640: + ldrb r6, [r4] + movs r0, #0xc7 + tst r0, r6 + bne _0200664A + b _02006908 +_0200664A: + movs r0, #0x80 + tst r0, r6 + beq _0200667A + movs r0, #0x40 + tst r0, r6 + bne _0200668A + movs r6, #3 + strb r6, [r4] + adds r0, r3, #0 + adds r0, #0x10 + str r0, [r4, #0x28] + ldr r0, [r3, #0xc] + str r0, [r4, #0x18] + movs r5, #0 + strb r5, [r4, #9] + str r5, [r4, #0x1c] + ldrb r2, [r3, #3] + movs r0, #0xc0 + tst r0, r2 + beq _020066D2 + movs r0, #0x10 + orrs r6, r0 + strb r6, [r4] + b _020066D2 +_0200667A: + ldrb r5, [r4, #9] + movs r0, #4 + tst r0, r6 + beq _02006690 + ldrb r0, [r4, #0xd] + subs r0, #1 + strb r0, [r4, #0xd] + bhi _020066E0 +_0200668A: + movs r0, #0 + strb r0, [r4] + b _02006908 +_02006690: + movs r0, #0x40 + tst r0, r6 + beq _020066B0 + ldrb r0, [r4, #7] + muls r5, r0, r5 + lsrs r5, r5, #8 + ldrb r0, [r4, #0xc] + cmp r5, r0 + bhi _020066E0 +_020066A2: + ldrb r5, [r4, #0xc] + cmp r5, #0 + beq _0200668A + movs r0, #4 + orrs r6, r0 + strb r6, [r4] + b _020066E0 +_020066B0: + movs r2, #3 + ands r2, r6 + cmp r2, #2 + bne _020066CE + ldrb r0, [r4, #5] + muls r5, r0, r5 + lsrs r5, r5, #8 + ldrb r0, [r4, #6] + cmp r5, r0 + bhi _020066E0 + adds r5, r0, #0 + beq _020066A2 + subs r6, #1 + strb r6, [r4] + b _020066E0 +_020066CE: + cmp r2, #3 + bne _020066E0 +_020066D2: + ldrb r0, [r4, #4] + adds r5, r5, r0 + cmp r5, #0xff + blo _020066E0 + movs r5, #0xff + subs r6, #1 + strb r6, [r4] +_020066E0: + strb r5, [r4, #9] + ldr r0, [sp, #0x18] + ldrb r0, [r0, #7] + adds r0, #1 + muls r0, r5, r0 + lsrs r5, r0, #4 + ldrb r0, [r4, #2] + muls r0, r5, r0 + lsrs r0, r0, #8 + strb r0, [r4, #0xa] + ldrb r0, [r4, #3] + muls r0, r5, r0 + lsrs r0, r0, #8 + strb r0, [r4, #0xb] + movs r0, #0x10 + ands r0, r6 + str r0, [sp, #0x10] + beq _02006714 + adds r0, r3, #0 + adds r0, #0x10 + ldr r1, [r3, #8] + adds r0, r0, r1 + str r0, [sp, #0xc] + ldr r0, [r3, #0xc] + subs r0, r0, r1 + str r0, [sp, #0x10] +_02006714: + ldr r5, [sp, #8] + ldr r2, [r4, #0x18] + ldr r3, [r4, #0x28] + adr r0, _02006720 + bx r0 + .align 2, 0 + .arm +_02006720: @ 0x02006720 + str r8, [sp] + ldrb sl, [r4, #0xa] + lsl sl, sl, #0x10 + ldrb fp, [r4, #0xb] + lsl fp, fp, #0x10 + ldrb r0, [r4, #1] + tst r0, #8 + beq _02006860 +_02006740: + cmp r2, #4 + ble _020067B0 + subs r2, r2, r8 + movgt lr, #0 + bgt _0200676C + mov lr, r8 + add r2, r2, r8 + sub r8, r2, #4 + sub lr, lr, r8 + ands r2, r2, #3 + moveq r2, #4 +_0200676C: + ldr r6, [r5] + ldr r7, [r5, #0x630] +_02006774: + ldrsb r0, [r3], #1 + mul r1, sl, r0 + bic r1, r1, #0xff0000 + add r6, r1, r6, ror #8 + mul r1, fp, r0 + bic r1, r1, #0xff0000 + add r7, r1, r7, ror #8 + adds r5, r5, #0x40000000 + blo _02006774 + str r7, [r5, #0x630] + str r6, [r5], #4 + subs r8, r8, #4 + bgt _0200676C + adds r8, r8, lr + beq _020068F4 +_020067B0: + ldr r6, [r5] + ldr r7, [r5, #0x630] +_020067B8: + ldrsb r0, [r3], #1 + mul r1, sl, r0 + bic r1, r1, #0xff0000 + add r6, r1, r6, ror #8 + mul r1, fp, r0 + bic r1, r1, #0xff0000 + add r7, r1, r7, ror #8 + subs r2, r2, #1 + beq _02006828 +_020067DC: + adds r5, r5, #0x40000000 + blo _020067B8 + str r7, [r5, #0x630] + str r6, [r5], #4 + subs r8, r8, #4 + bgt _02006740 + b _020068F4 +_020067F8: + ldr r0, [sp, #0x18] + cmp r0, #0 + beq _0200681C + ldr r3, [sp, #0x14] + rsb sb, r2, #0 +_0200680C: + adds r2, r0, r2 + bgt _020068C4 + sub sb, sb, r0 + b _0200680C +_0200681C: + pop {r4, ip} + mov r2, #0 + b _02006838 +_02006828: + ldr r2, [sp, #0x10] + cmp r2, #0 + ldrne r3, [sp, #0xc] + bne _020067DC +_02006838: + strb r2, [r4] + lsr r0, r5, #0x1e + bic r5, r5, #0xc0000000 + rsb r0, r0, #3 + lsl r0, r0, #3 + ror r6, r6, r0 + ror r7, r7, r0 + str r7, [r5, #0x630] + str r6, [r5], #4 + b _020068FC +_02006860: + push {r4, ip} + ldr lr, [r4, #0x1c] + ldr r1, [r4, #0x20] + mul r4, ip, r1 + ldrsb r0, [r3] + ldrsb r1, [r3, #1]! + sub r1, r1, r0 +_0200687C: + ldr r6, [r5] + ldr r7, [r5, #0x630] +_02006884: + mul sb, lr, r1 + add sb, r0, sb, asr #23 + mul ip, sl, sb + bic ip, ip, #0xff0000 + add r6, ip, r6, ror #8 + mul ip, fp, sb + bic ip, ip, #0xff0000 + add r7, ip, r7, ror #8 + add lr, lr, r4 + lsrs sb, lr, #0x17 + beq _020068D0 + bic lr, lr, #0x3f800000 + subs r2, r2, sb + ble _020067F8 + subs sb, sb, #1 + addeq r0, r0, r1 +_020068C4: + ldrsbne r0, [r3, sb]! + ldrsb r1, [r3, #1]! + sub r1, r1, r0 +_020068D0: + adds r5, r5, #0x40000000 + blo _02006884 + str r7, [r5, #0x630] + str r6, [r5], #4 + subs r8, r8, #4 + bgt _0200687C + sub r3, r3, #1 + pop {r4, ip} + str lr, [r4, #0x1c] +_020068F4: + str r2, [r4, #0x18] + str r3, [r4, #0x28] +_020068FC: + ldr r8, [sp] + adr r0, _02006908+1 + bx r0 + .thumb +_02006908: + ldr r0, [sp, #4] + subs r0, #1 + ble _02006912 + adds r4, #0x40 + b _02006620 +_02006912: + ldr r0, [sp, #0x18] + ldr r3, =0x68736D53 + str r3, [r0] + add sp, #0x1c + pop {r0, r1, r2, r3, r4, r5, r6, r7} + mov r8, r0 + mov sb, r1 + mov sl, r2 + mov fp, r3 + pop {r3} +sub_02006926: @ 0x02006926 + bx r3 + .align 2, 0 + .pool + + thumb_func_start SoundMainBTM +SoundMainBTM: @ 0x0200692C + mov ip, r4 + movs r1, #0 + movs r2, #0 + movs r3, #0 + movs r4, #0 + stm r0!, {r1, r2, r3, r4} + stm r0!, {r1, r2, r3, r4} + stm r0!, {r1, r2, r3, r4} + stm r0!, {r1, r2, r3, r4} + mov r4, ip + bx lr + .align 2, 0 + + thumb_func_start RealClearChain +RealClearChain: @ 0x02006944 + ldr r3, [r0, #0x2c] + cmp r3, #0 + beq _02006962 + ldr r1, [r0, #0x34] + ldr r2, [r0, #0x30] + cmp r2, #0 + beq _02006956 + str r1, [r2, #0x34] + b _02006958 +_02006956: + str r1, [r3, #0x20] +_02006958: + cmp r1, #0 + beq _0200695E + str r2, [r1, #0x30] +_0200695E: + movs r1, #0 + str r1, [r0, #0x2c] +_02006962: + bx lr +ply_fine: + push {r4, r5, lr} + adds r5, r1, #0 + ldr r4, [r5, #0x20] + cmp r4, #0 + beq _02006988 +_0200696E: + ldrb r1, [r4] + movs r0, #0xc7 + tst r0, r1 + beq _0200697C + movs r0, #0x40 + orrs r1, r0 + strb r1, [r4] +_0200697C: + adds r0, r4, #0 + bl RealClearChain + ldr r4, [r4, #0x34] + cmp r4, #0 + bne _0200696E +_02006988: + movs r0, #0 + strb r0, [r5] + pop {r4, r5} + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start MPlayJumpTableCopy +MPlayJumpTableCopy: @ 0x02006994 + mov ip, lr + movs r1, #0x24 + ldr r2, =gUnknown_0201D6C4 +_0200699A: + ldr r3, [r2] + bl chk_adr_r2 + stm r0!, {r3} + adds r2, #4 + subs r1, #1 + bgt _0200699A + bx ip + .align 2, 0 + + thumb_func_start ldrb_r3_r2 +ldrb_r3_r2: @ 0x020069AC + ldrb r3, [r2] +chk_adr_r2: + push {r0} + lsrs r0, r2, #0x19 + bne _020069C0 + ldr r0, =gUnknown_0201D6C4 + cmp r2, r0 + blo _020069BE + lsrs r0, r2, #0xe + beq _020069C0 +_020069BE: + movs r3, #0 +_020069C0: + pop {r0} + bx lr + .align 2, 0 + .pool + + thumb_func_start ld_r3_tp_adr_i +ld_r3_tp_adr_i: @ 0x020069C8 + ldr r2, [r1, #0x40] + non_word_aligned_thumb_func_start sub_020069CA +sub_020069CA: @ 0x020069CA + adds r3, r2, #1 + str r3, [r1, #0x40] + ldrb r3, [r2] + b chk_adr_r2 + .align 2, 0 +ply_goto: + push {lr} +_020069D6: + ldr r2, [r1, #0x40] + ldrb r0, [r2, #3] + lsls r0, r0, #8 + ldrb r3, [r2, #2] + orrs r0, r3 + lsls r0, r0, #8 + ldrb r3, [r2, #1] + orrs r0, r3 + lsls r0, r0, #8 + bl ldrb_r3_r2 + orrs r0, r3 + str r0, [r1, #0x40] + pop {r0} + bx r0 + + thumb_func_start ply_patt +ply_patt: @ 0x020069F4 + ldrb r2, [r1, #2] + cmp r2, #3 + bhs _02006A0C + lsls r2, r2, #2 + adds r3, r1, r2 + ldr r2, [r1, #0x40] + adds r2, #4 + str r2, [r3, #0x44] + ldrb r2, [r1, #2] + adds r2, #1 + strb r2, [r1, #2] + b ply_goto +_02006A0C: + b ply_fine + .align 2, 0 + + thumb_func_start ply_pend +ply_pend: @ 0x02006A10 + ldrb r2, [r1, #2] + cmp r2, #0 + beq _02006A22 + subs r2, #1 + strb r2, [r1, #2] + lsls r2, r2, #2 + adds r3, r1, r2 + ldr r2, [r3, #0x44] + str r2, [r1, #0x40] +_02006A22: + bx lr + + thumb_func_start ply_rept +ply_rept: @ 0x02006A24 + push {lr} + ldr r2, [r1, #0x40] + ldrb r3, [r2] + cmp r3, #0 + bne _02006A34 + adds r2, #1 + str r2, [r1, #0x40] + b _020069D6 +_02006A34: + ldrb r3, [r1, #3] + adds r3, #1 + strb r3, [r1, #3] + mov ip, r3 + bl ld_r3_tp_adr_i + cmp ip, r3 + bhs _02006A46 + b _020069D6 +_02006A46: + movs r3, #0 + strb r3, [r1, #3] + adds r2, #5 + str r2, [r1, #0x40] + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start ply_prio +ply_prio: @ 0x02006A54 + mov ip, lr + bl ld_r3_tp_adr_i + strb r3, [r1, #0x1d] + bx ip + .align 2, 0 + + thumb_func_start ply_tempo +ply_tempo: @ 0x02006A60 + mov ip, lr + bl ld_r3_tp_adr_i + lsls r3, r3, #1 + strh r3, [r0, #0x1c] + ldrh r2, [r0, #0x1e] + muls r3, r2, r3 + lsrs r3, r3, #8 + strh r3, [r0, #0x20] + bx ip + + thumb_func_start ply_keysh +ply_keysh: @ 0x02006A74 + mov ip, lr + bl ld_r3_tp_adr_i + strb r3, [r1, #0xa] + ldrb r3, [r1] + movs r2, #0xc + orrs r3, r2 + strb r3, [r1] + bx ip + .align 2, 0 + + thumb_func_start ply_voice +ply_voice: @ 0x02006A88 + mov ip, lr + ldr r2, [r1, #0x40] + ldrb r3, [r2] + adds r2, #1 + str r2, [r1, #0x40] + lsls r2, r3, #1 + adds r2, r2, r3 + lsls r2, r2, #2 + ldr r3, [r0, #0x30] + adds r2, r2, r3 + ldr r3, [r2] + bl chk_adr_r2 + str r3, [r1, #0x24] + ldr r3, [r2, #4] + bl chk_adr_r2 + str r3, [r1, #0x28] + ldr r3, [r2, #8] + bl chk_adr_r2 + str r3, [r1, #0x2c] + bx ip + .align 2, 0 + + thumb_func_start ply_vol +ply_vol: @ 0x02006AB8 + mov ip, lr + bl ld_r3_tp_adr_i + strb r3, [r1, #0x12] + ldrb r3, [r1] + movs r2, #3 + orrs r3, r2 + strb r3, [r1] + bx ip + .align 2, 0 + + thumb_func_start ply_pan +ply_pan: @ 0x02006ACC + mov ip, lr + bl ld_r3_tp_adr_i + subs r3, #0x40 + strb r3, [r1, #0x14] + ldrb r3, [r1] + movs r2, #3 + orrs r3, r2 + strb r3, [r1] + bx ip + + thumb_func_start ply_bend +ply_bend: @ 0x02006AE0 + mov ip, lr + bl ld_r3_tp_adr_i + subs r3, #0x40 + strb r3, [r1, #0xe] + ldrb r3, [r1] + movs r2, #0xc + orrs r3, r2 + strb r3, [r1] + bx ip + + thumb_func_start ply_bendr +ply_bendr: @ 0x02006AF4 + mov ip, lr + bl ld_r3_tp_adr_i + strb r3, [r1, #0xf] + ldrb r3, [r1] + movs r2, #0xc + orrs r3, r2 + strb r3, [r1] + bx ip + .align 2, 0 + + thumb_func_start ply_lfodl +ply_lfodl: @ 0x02006B08 + mov ip, lr + bl ld_r3_tp_adr_i + strb r3, [r1, #0x1b] + bx ip + .align 2, 0 + + thumb_func_start ply_modt +ply_modt: @ 0x02006B14 + mov ip, lr + bl ld_r3_tp_adr_i + ldrb r0, [r1, #0x18] + cmp r0, r3 + beq _02006B2A + strb r3, [r1, #0x18] + ldrb r3, [r1] + movs r2, #0xf + orrs r3, r2 + strb r3, [r1] +_02006B2A: + bx ip + + thumb_func_start ply_tune +ply_tune: @ 0x02006B2C + mov ip, lr + bl ld_r3_tp_adr_i + subs r3, #0x40 + strb r3, [r1, #0xc] + ldrb r3, [r1] + movs r2, #0xc + orrs r3, r2 + strb r3, [r1] + bx ip + + thumb_func_start ply_port +ply_port: @ 0x02006B40 + mov ip, lr + ldr r2, [r1, #0x40] + ldrb r3, [r2] + adds r2, #1 + ldr r0, =0x04000060 + adds r0, r0, r3 + bl sub_020069CA + strb r3, [r0] + bx ip + .align 2, 0 + .pool + + thumb_func_start m4aSoundVSync +m4aSoundVSync: @ 0x02006B58 + ldr r0, _02006DF4 @=0x03007FF0 + ldr r0, [r0] + ldr r2, _02006DF8 @=0x68736D53 + ldr r3, [r0] + subs r3, r3, r2 + cmp r3, #1 + bhi _02006B84 + ldrb r1, [r0, #4] + subs r1, #1 + strb r1, [r0, #4] + bgt _02006B84 + ldrb r1, [r0, #0xb] + strb r1, [r0, #4] + movs r0, #0 + movs r1, #0xb6 + lsls r1, r1, #8 + ldr r2, =0x040000C6 + ldr r3, =0x040000D2 + strh r0, [r2] + strh r0, [r3] + strh r1, [r2] + strh r1, [r3] +_02006B84: + bx lr + .align 2, 0 + .pool + + thumb_func_start MPlayMain +MPlayMain: @ 0x02006B90 + ldr r2,_02006DF8 @=0x68736D53 + ldr r3, [r0, #0x34] + cmp r2, r3 + beq _02006B9A + bx lr +_02006B9A: + adds r3, #1 + str r3, [r0, #0x34] + push {r0, lr} + ldr r3, [r0, #0x38] + cmp r3, #0 + beq _02006BAC + ldr r0, [r0, #0x3c] + bl sub_02006DEC +_02006BAC: + pop {r0} + push {r4, r5, r6, r7} + mov r4, r8 + mov r5, sb + mov r6, sl + mov r7, fp + push {r4, r5, r6, r7} + adds r7, r0, #0 + ldr r0, [r7, #4] + cmp r0, #0 + bge _02006BC4 + b _02006DDC +_02006BC4: + ldr r0, _02006DF4 @=0x03007FF0 + ldr r0, [r0] + mov r8, r0 + adds r0, r7, #0 + bl FadeOutBody + ldrh r0, [r7, #0x22] + ldrh r1, [r7, #0x20] + adds r0, r0, r1 + b _02006D20 +_02006BD8: + ldrb r6, [r7, #8] + ldr r5, [r7, #0x2c] + movs r3, #1 + movs r4, #0 +_02006BE0: + ldrb r0, [r5] + movs r1, #0x80 + tst r1, r0 + bne _02006BEA + b _02006CFC +_02006BEA: + mov sl, r3 + orrs r4, r3 + mov fp, r4 + ldr r4, [r5, #0x20] + cmp r4, #0 + beq _02006C1E +_02006BF6: + ldrb r1, [r4] + movs r0, #0xc7 + tst r0, r1 + beq _02006C12 + ldrb r0, [r4, #0x10] + cmp r0, #0 + beq _02006C18 + subs r0, #1 + strb r0, [r4, #0x10] + bne _02006C18 + movs r0, #0x40 + orrs r1, r0 + strb r1, [r4] + b _02006C18 +_02006C12: + adds r0, r4, #0 + bl sub_0200753C +_02006C18: + ldr r4, [r4, #0x34] + cmp r4, #0 + bne _02006BF6 +_02006C1E: + ldrb r3, [r5] + movs r0, #0x40 + tst r0, r3 + beq _02006C9C + adds r0, r5, #0 + bl sub_02007550 + movs r0, #0x80 + strb r0, [r5] + movs r0, #2 + strb r0, [r5, #0xf] + movs r0, #0x40 + strb r0, [r5, #0x13] + movs r0, #0x16 + strb r0, [r5, #0x19] + movs r0, #1 + adds r1, r5, #6 + strb r0, [r1, #0x1e] + b _02006C9C +_02006C44: + ldr r2, [r5, #0x40] + ldrb r1, [r2] + cmp r1, #0x80 + bhs _02006C50 + ldrb r1, [r5, #7] + b _02006C5A +_02006C50: + adds r2, #1 + str r2, [r5, #0x40] + cmp r1, #0xbd + blo _02006C5A + strb r1, [r5, #7] +_02006C5A: + cmp r1, #0xcf + blo _02006C70 + mov r0, r8 + ldr r3, [r0, #0x38] + adds r0, r1, #0 + subs r0, #0xcf + adds r1, r7, #0 + adds r2, r5, #0 + bl sub_02006DEC + b _02006C9C +_02006C70: + cmp r1, #0xb0 + bls _02006C92 + adds r0, r1, #0 + subs r0, #0xb1 + strb r0, [r7, #0xa] + mov r3, r8 + ldr r3, [r3, #0x34] + lsls r0, r0, #2 + ldr r3, [r3, r0] + adds r0, r7, #0 + adds r1, r5, #0 + bl sub_02006DEC + ldrb r0, [r5] + cmp r0, #0 + beq _02006CF8 + b _02006C9C +_02006C92: + ldr r0, =gUnknown_0201D938 + subs r1, #0x80 + adds r1, r1, r0 + ldrb r0, [r1] + strb r0, [r5, #1] +_02006C9C: + ldrb r0, [r5, #1] + cmp r0, #0 + beq _02006C44 + subs r0, #1 + strb r0, [r5, #1] + ldrb r1, [r5, #0x19] + cmp r1, #0 + beq _02006CF8 + ldrb r0, [r5, #0x17] + cmp r0, #0 + beq _02006CF8 + ldrb r0, [r5, #0x1c] + cmp r0, #0 + beq _02006CBE + subs r0, #1 + strb r0, [r5, #0x1c] + b _02006CF8 +_02006CBE: + ldrb r0, [r5, #0x1a] + adds r0, r0, r1 + strb r0, [r5, #0x1a] + adds r1, r0, #0 + subs r0, #0x40 + lsls r0, r0, #0x18 + bpl _02006CD2 + lsls r2, r1, #0x18 + asrs r2, r2, #0x18 + b _02006CD6 +_02006CD2: + movs r0, #0x80 + subs r2, r0, r1 +_02006CD6: + ldrb r0, [r5, #0x17] + muls r0, r2, r0 + asrs r2, r0, #6 + ldrb r0, [r5, #0x16] + eors r0, r2 + lsls r0, r0, #0x18 + beq _02006CF8 + strb r2, [r5, #0x16] + ldrb r0, [r5] + ldrb r1, [r5, #0x18] + cmp r1, #0 + bne _02006CF2 + movs r1, #0xc + b _02006CF4 +_02006CF2: + movs r1, #3 +_02006CF4: + orrs r0, r1 + strb r0, [r5] +_02006CF8: + mov r3, sl + mov r4, fp +_02006CFC: + subs r6, #1 + ble _02006D08 + movs r0, #0x50 + adds r5, r5, r0 + lsls r3, r3, #1 + b _02006BE0 +_02006D08: + ldr r0, [r7, #0xc] + adds r0, #1 + str r0, [r7, #0xc] + cmp r4, #0 + bne _02006D1A + movs r0, #0x80 + lsls r0, r0, #0x18 + str r0, [r7, #4] + b _02006DDC +_02006D1A: + str r4, [r7, #4] + ldrh r0, [r7, #0x22] + subs r0, #0x96 +_02006D20: + strh r0, [r7, #0x22] + cmp r0, #0x96 + blo _02006D28 + b _02006BD8 +_02006D28: + ldrb r2, [r7, #8] + ldr r5, [r7, #0x2c] +_02006D2C: + ldrb r0, [r5] + movs r1, #0x80 + tst r1, r0 + beq _02006DD2 + movs r1, #0xf + tst r1, r0 + beq _02006DD2 + mov sb, r2 + adds r0, r7, #0 + adds r1, r5, #0 + bl TrkVolPitSet + ldr r4, [r5, #0x20] + cmp r4, #0 + beq _02006DC8 +_02006D4A: + ldrb r1, [r4] + movs r0, #0xc7 + tst r0, r1 + bne _02006D5A + adds r0, r4, #0 + bl sub_0200753C + b _02006DC2 +_02006D5A: + ldrb r0, [r4, #1] + movs r6, #7 + ands r6, r0 + ldrb r3, [r5] + movs r0, #3 + tst r0, r3 + beq _02006D86 + ldrb r1, [r4, #0x12] + ldrb r0, [r5, #0x10] + muls r0, r1, r0 + asrs r0, r0, #7 + strb r0, [r4, #2] + ldrb r0, [r5, #0x11] + muls r0, r1, r0 + asrs r0, r0, #7 + strb r0, [r4, #3] + cmp r6, #0 + beq _02006D86 + ldrb r0, [r4, #0x1d] + movs r1, #1 + orrs r0, r1 + strb r0, [r4, #0x1d] +_02006D86: + movs r0, #0xc + tst r0, r3 + beq _02006DC2 + ldrb r1, [r4, #8] + movs r0, #8 + ldrsb r0, [r5, r0] + adds r2, r1, r0 + bpl _02006D98 + movs r2, #0 +_02006D98: + cmp r6, #0 + beq _02006DB6 + mov r0, r8 + ldr r3, [r0, #0x30] + adds r1, r2, #0 + ldrb r2, [r5, #9] + adds r0, r6, #0 + bl sub_02006DEC + str r0, [r4, #0x20] + ldrb r0, [r4, #0x1d] + movs r1, #2 + orrs r0, r1 + strb r0, [r4, #0x1d] + b _02006DC2 +_02006DB6: + adds r1, r2, #0 + ldrb r2, [r5, #9] + ldr r0, [r4, #0x24] + bl MidiKeyToFreq + str r0, [r4, #0x20] +_02006DC2: + ldr r4, [r4, #0x34] + cmp r4, #0 + bne _02006D4A +_02006DC8: + ldrb r0, [r5] + movs r1, #0xf0 + ands r0, r1 + strb r0, [r5] + mov r2, sb +_02006DD2: + subs r2, #1 + ble _02006DDC + movs r0, #0x50 + adds r5, r5, r0 + bgt _02006D2C +_02006DDC: + ldr r0, _02006DF8 @=0x68736D53 + str r0, [r7, #0x34] + pop {r0, r1, r2, r3, r4, r5, r6, r7} + mov r8, r0 + mov sb, r1 + mov sl, r2 + mov fp, r3 + pop {r3} + + thumb_func_start sub_02006DEC +sub_02006DEC: @ 0x02006DEC + bx r3 + .align 2, 0 + .pool +_02006DF4: .4byte 0x03007FF0 +_02006DF8: .4byte 0x68736D53 + + thumb_func_start TrackStop +TrackStop: @ 0x02006DFC + push {r4, r5, r6, lr} + adds r5, r1, #0 + ldrb r1, [r5] + movs r0, #0x80 + tst r0, r1 + beq _02006E34 + ldr r4, [r5, #0x20] + cmp r4, #0 + beq _02006E32 + movs r6, #0 +_02006E10: + ldrb r0, [r4] + cmp r0, #0 + beq _02006E2A + ldrb r0, [r4, #1] + movs r3, #7 + ands r0, r3 + beq _02006E28 + ldr r3, =0x03007FF0 + ldr r3, [r3] + ldr r3, [r3, #0x2c] + bl sub_02006DEC +_02006E28: + strb r6, [r4] +_02006E2A: + str r6, [r4, #0x2c] + ldr r4, [r4, #0x34] + cmp r4, #0 + bne _02006E10 +_02006E32: + str r4, [r5, #0x20] +_02006E34: + pop {r4, r5, r6} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start ply_note +ply_note: @ 0x02006E40 + push {r4, r5, r6, r7, lr} + mov r4, r8 + mov r5, sb + mov r6, sl + mov r7, fp + push {r4, r5, r6, r7} + sub sp, #0x18 + str r1, [sp] + adds r5, r2, #0 + ldr r1, =0x03007FF0 + ldr r1, [r1] + str r1, [sp, #4] + ldr r1, =gUnknown_0201D938 + adds r0, r0, r1 + ldrb r0, [r0] + strb r0, [r5, #4] + ldr r3, [r5, #0x40] + ldrb r0, [r3] + cmp r0, #0x80 + bhs _02006E86 + strb r0, [r5, #5] + adds r3, #1 + ldrb r0, [r3] + cmp r0, #0x80 + bhs _02006E84 + strb r0, [r5, #6] + adds r3, #1 + ldrb r0, [r3] + cmp r0, #0x80 + bhs _02006E84 + ldrb r1, [r5, #4] + adds r1, r1, r0 + strb r1, [r5, #4] + adds r3, #1 +_02006E84: + str r3, [r5, #0x40] +_02006E86: + movs r0, #0 + str r0, [sp, #0x14] + adds r4, r5, #0 + adds r4, #0x24 + ldrb r2, [r4] + movs r0, #0xc0 + tst r0, r2 + beq _02006ED4 + ldrb r3, [r5, #5] + movs r0, #0x40 + tst r0, r2 + beq _02006EA6 + ldr r1, [r5, #0x2c] + adds r1, r1, r3 + ldrb r0, [r1] + b _02006EA8 +_02006EA6: + adds r0, r3, #0 +_02006EA8: + lsls r1, r0, #1 + adds r1, r1, r0 + lsls r1, r1, #2 + ldr r0, [r5, #0x28] + adds r1, r1, r0 + mov sb, r1 + mov r6, sb + ldrb r1, [r6] + movs r0, #0xc0 + tst r0, r1 + beq _02006EC0 + b _02007040 +_02006EC0: + movs r0, #0x80 + tst r0, r2 + beq _02006ED8 + ldrb r1, [r6, #3] + movs r0, #0x80 + tst r0, r1 + beq _02006ED0 + str r1, [sp, #0x14] +_02006ED0: + ldrb r3, [r6, #1] + b _02006ED8 +_02006ED4: + mov sb, r4 + ldrb r3, [r5, #5] +_02006ED8: + str r3, [sp, #8] + ldr r6, [sp] + ldrb r1, [r6, #9] + ldrb r0, [r5, #0x1d] + adds r0, r0, r1 + cmp r0, #0xff + bls _02006EE8 + movs r0, #0xff +_02006EE8: + str r0, [sp, #0x10] + mov r6, sb + ldrb r0, [r6] + movs r6, #7 + ands r6, r0 + str r6, [sp, #0xc] + beq _02006F28 + ldr r0, [sp, #4] + ldr r4, [r0, #0x1c] + cmp r4, #0 + bne _02006F00 + b _02007040 +_02006F00: + subs r6, #1 + lsls r0, r6, #6 + adds r4, r4, r0 + ldrb r1, [r4] + movs r0, #0xc7 + tst r0, r1 + beq _02006F7C + movs r0, #0x40 + tst r0, r1 + bne _02006F7C + ldrb r1, [r4, #0x13] + ldr r0, [sp, #0x10] + cmp r1, r0 + blo _02006F7C + beq _02006F20 + b _02007040 +_02006F20: + ldr r0, [r4, #0x2c] + cmp r0, r5 + bhs _02006F7C + b _02007040 +_02006F28: + ldr r6, [sp, #0x10] + adds r7, r5, #0 + movs r2, #0 + mov r8, r2 + ldr r4, [sp, #4] + ldrb r3, [r4, #6] + adds r4, #0x50 +_02006F36: + ldrb r1, [r4] + movs r0, #0xc7 + tst r0, r1 + beq _02006F7C + movs r0, #0x40 + tst r0, r1 + beq _02006F50 + cmp r2, #0 + bne _02006F54 + adds r2, #1 + ldrb r6, [r4, #0x13] + ldr r7, [r4, #0x2c] + b _02006F6E +_02006F50: + cmp r2, #0 + bne _02006F70 +_02006F54: + ldrb r0, [r4, #0x13] + cmp r0, r6 + bhs _02006F60 + adds r6, r0, #0 + ldr r7, [r4, #0x2c] + b _02006F6E +_02006F60: + bhi _02006F70 + ldr r0, [r4, #0x2c] + cmp r0, r7 + bls _02006F6C + adds r7, r0, #0 + b _02006F6E +_02006F6C: + blo _02006F70 +_02006F6E: + mov r8, r4 +_02006F70: + adds r4, #0x40 + subs r3, #1 + bgt _02006F36 + mov r4, r8 + cmp r4, #0 + beq _02007040 +_02006F7C: + adds r0, r4, #0 + bl sub_0200753C + movs r1, #0 + str r1, [r4, #0x30] + ldr r3, [r5, #0x20] + str r3, [r4, #0x34] + cmp r3, #0 + beq _02006F90 + str r4, [r3, #0x30] +_02006F90: + str r4, [r5, #0x20] + str r5, [r4, #0x2c] + ldrb r0, [r5, #0x1b] + strb r0, [r5, #0x1c] + cmp r0, r1 + beq _02006FA2 + adds r1, r5, #0 + bl clear_modM +_02006FA2: + ldr r1, [sp, #0x14] + cmp r1, #0 + beq _02006FB6 + subs r1, #0xc0 + lsls r1, r1, #1 + strb r1, [r5, #0x15] + ldrb r0, [r5] + movs r1, #3 + orrs r0, r1 + strb r0, [r5] +_02006FB6: + ldr r0, [sp] + adds r1, r5, #0 + bl TrkVolPitSet + ldr r0, [r5, #4] + str r0, [r4, #0x10] + ldr r0, [sp, #0x10] + strb r0, [r4, #0x13] + ldr r0, [sp, #8] + strb r0, [r4, #8] + mov r6, sb + ldrb r0, [r6] + strb r0, [r4, #1] + ldr r7, [r6, #4] + str r7, [r4, #0x24] + ldr r0, [r6, #8] + str r0, [r4, #4] + ldrh r0, [r5, #0x1e] + strh r0, [r4, #0xc] + ldrb r1, [r4, #0x12] + ldrb r0, [r5, #0x10] + muls r0, r1, r0 + asrs r0, r0, #7 + strb r0, [r4, #2] + ldrb r0, [r5, #0x11] + muls r0, r1, r0 + asrs r0, r0, #7 + strb r0, [r4, #3] + ldrb r1, [r4, #8] + movs r0, #8 + ldrsb r0, [r5, r0] + adds r3, r1, r0 + bpl _02006FFA + movs r3, #0 +_02006FFA: + ldr r6, [sp, #0xc] + cmp r6, #0 + beq _02007028 + mov r6, sb + ldrb r0, [r6, #2] + strb r0, [r4, #0x1e] + ldrb r1, [r6, #3] + movs r0, #0x80 + tst r0, r1 + bne _02007014 + movs r0, #0x70 + tst r0, r1 + bne _02007016 +_02007014: + movs r1, #8 +_02007016: + strb r1, [r4, #0x1f] + ldrb r2, [r5, #9] + adds r1, r3, #0 + ldr r0, [sp, #0xc] + ldr r3, [sp, #4] + ldr r3, [r3, #0x30] + bl sub_02006DEC + b _02007032 +_02007028: + ldrb r2, [r5, #9] + adds r1, r3, #0 + adds r0, r7, #0 + bl MidiKeyToFreq +_02007032: + str r0, [r4, #0x20] + movs r0, #0x80 + strb r0, [r4] + ldrb r1, [r5] + movs r0, #0xf0 + ands r0, r1 + strb r0, [r5] +_02007040: + add sp, #0x18 + pop {r0, r1, r2, r3, r4, r5, r6, r7} + mov r8, r0 + mov sb, r1 + mov sl, r2 + mov fp, r3 + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start ply_endtie +ply_endtie: @ 0x02007058 + push {r4, r5} + ldr r2, [r1, #0x40] + ldrb r3, [r2] + cmp r3, #0x80 + bhs _0200706A + strb r3, [r1, #5] + adds r2, #1 + str r2, [r1, #0x40] + b _0200706C +_0200706A: + ldrb r3, [r1, #5] +_0200706C: + ldr r1, [r1, #0x20] + cmp r1, #0 + beq _02007094 + movs r4, #0x83 + movs r5, #0x40 +_02007076: + ldrb r2, [r1] + tst r2, r4 + beq _0200708E + tst r2, r5 + bne _0200708E + ldrb r0, [r1, #0x11] + cmp r0, r3 + bne _0200708E + movs r0, #0x40 + orrs r2, r0 + strb r2, [r1] + b _02007094 +_0200708E: + ldr r1, [r1, #0x34] + cmp r1, #0 + bne _02007076 +_02007094: + pop {r4, r5} + bx lr + + thumb_func_start clear_modM +clear_modM: @ 0x02007098 + movs r2, #0 + strb r2, [r1, #0x16] + strb r2, [r1, #0x1a] + ldrb r2, [r1, #0x18] + cmp r2, #0 + bne _020070A8 + movs r2, #0xc + b _020070AA +_020070A8: + movs r2, #3 +_020070AA: + ldrb r3, [r1] + orrs r3, r2 + strb r3, [r1] + bx lr + .align 2, 0 + + thumb_func_start ld_r3_tp_adr_i_unchecked +ld_r3_tp_adr_i_unchecked: @ 0x020070B4 + ldr r2, [r1, #0x40] + adds r3, r2, #1 + str r3, [r1, #0x40] + ldrb r3, [r2] + bx lr + .align 2, 0 + + thumb_func_start ply_lfos +ply_lfos: @ 0x020070C0 + mov ip, lr + bl ld_r3_tp_adr_i_unchecked + strb r3, [r1, #0x19] + cmp r3, #0 + bne _020070D0 + bl clear_modM +_020070D0: + bx ip + .align 2, 0 + + thumb_func_start ply_mod +ply_mod: @ 0x020070D4 + mov ip, lr + bl ld_r3_tp_adr_i_unchecked + strb r3, [r1, #0x17] + cmp r3, #0 + bne _020070E4 + bl clear_modM +_020070E4: + bx ip + .align 2, 0 + + thumb_func_start MidiKeyToFreq +MidiKeyToFreq: @ 0x020070E8 + push {r4, r5, r6, r7, lr} + mov ip, r0 + lsls r1, r1, #0x18 + lsrs r6, r1, #0x18 + lsls r7, r2, #0x18 + cmp r6, #0xb2 + bls _020070FC + movs r6, #0xb2 + movs r7, #0xff + lsls r7, r7, #0x18 +_020070FC: + ldr r3, =gUnknown_0201D754 + adds r0, r6, r3 + ldrb r5, [r0] + ldr r4, =gUnknown_0201D808 + movs r2, #0xf + adds r0, r5, #0 + ands r0, r2 + lsls r0, r0, #2 + adds r0, r0, r4 + lsrs r1, r5, #4 + ldr r5, [r0] + lsrs r5, r1 + adds r0, r6, #1 + adds r0, r0, r3 + ldrb r1, [r0] + adds r0, r1, #0 + ands r0, r2 + lsls r0, r0, #2 + adds r0, r0, r4 + lsrs r1, r1, #4 + ldr r0, [r0] + lsrs r0, r1 + mov r1, ip + ldr r4, [r1, #4] + subs r0, r0, r5 + adds r1, r7, #0 + bl umul3232H32 + adds r1, r0, #0 + adds r1, r5, r1 + adds r0, r4, #0 + bl umul3232H32 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start UnusedDummyFunc +UnusedDummyFunc: @ 0x0200714C + bx lr + .align 2, 0 + + thumb_func_start MPlayContinue +MPlayContinue: @ 0x02007150 + adds r2, r0, #0 + ldr r3, [r2, #0x34] + ldr r0, =0x68736D53 + cmp r3, r0 + bne _02007162 + ldr r0, [r2, #4] + ldr r1, =0x7FFFFFFF + ands r0, r1 + str r0, [r2, #4] +_02007162: + bx lr + .align 2, 0 + .pool + + thumb_func_start MPlayFadeOut +MPlayFadeOut: @ 0x0200716C + adds r2, r0, #0 + lsls r1, r1, #0x10 + lsrs r1, r1, #0x10 + ldr r3, [r2, #0x34] + ldr r0, =0x68736D53 + cmp r3, r0 + bne _02007184 + strh r1, [r2, #0x26] + strh r1, [r2, #0x24] + movs r0, #0x80 + lsls r0, r0, #1 + strh r0, [r2, #0x28] +_02007184: + bx lr + .align 2, 0 + .pool + + thumb_func_start m4aSoundInit +m4aSoundInit: @ 0x0200718C + push {r4, r5, r6, r7, lr} + mov r7, r8 + push {r7} + ldr r0, =SoundMainRAM + movs r1, #2 + rsbs r1, r1, #0 + ands r0, r1 + ldr r1, =gUnknown_020213B4 + ldr r2, =0x04000100 + bl CpuSet + ldr r0, =gUnknown_02021A40 + bl SoundInit + ldr r0, =gUnknown_02022A80 + bl MPlayExtender + ldr r0, =0x0093F800 + bl m4aSoundMode + ldr r0, =0x00000001 + lsls r0, r0, #0x10 + lsrs r0, r0, #0x10 + cmp r0, #0 + beq _020071E8 + ldr r1, =gUnknown_0201DDF8 + mov r8, r1 + mov r5, r8 + movs r7, #0 + adds r6, r0, #0 +_020071C8: + ldr r4, [r5] + mov r0, r8 + adds r0, #4 + adds r0, r7, r0 + ldr r1, [r0] + ldrb r2, [r5, #8] + adds r0, r4, #0 + bl MPlayOpen + ldr r0, =gUnknown_02022BC0 + str r0, [r4, #0x18] + adds r5, #0xc + adds r7, #0xc + subs r6, #1 + cmp r6, #0 + bne _020071C8 +_020071E8: + pop {r3} + mov r8, r3 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start m4aSoundMain +m4aSoundMain: @ 0x02007218 + push {lr} + bl SoundMain + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start m4aSongNumStart +m4aSongNumStart: @ 0x02007224 + push {lr} + lsls r0, r0, #0x10 + ldr r2, =gUnknown_0201DDF8 + ldr r1, =gUnknown_0201DE04 + lsrs r0, r0, #0xd + adds r0, r0, r1 + ldrh r3, [r0, #4] + lsls r1, r3, #1 + adds r1, r1, r3 + lsls r1, r1, #2 + adds r1, r1, r2 + ldr r2, [r1] + ldr r1, [r0] + adds r0, r2, #0 + bl MPlayStart + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start m4aSongNumStartOrChange +m4aSongNumStartOrChange: @ 0x02007250 + push {lr} + lsls r0, r0, #0x10 + ldr r2, =gUnknown_0201DDF8 + ldr r1, =gUnknown_0201DE04 + lsrs r0, r0, #0xd + adds r0, r0, r1 + ldrh r3, [r0, #4] + lsls r1, r3, #1 + adds r1, r1, r3 + lsls r1, r1, #2 + adds r1, r1, r2 + ldr r1, [r1] + ldr r3, [r1] + ldr r2, [r0] + cmp r3, r2 + beq _02007284 + adds r0, r1, #0 + adds r1, r2, #0 + bl MPlayStart + b _02007298 + .align 2, 0 + .pool +_02007284: + ldr r2, [r1, #4] + ldrh r0, [r1, #4] + cmp r0, #0 + beq _02007290 + cmp r2, #0 + bge _02007298 +_02007290: + adds r0, r1, #0 + adds r1, r3, #0 + bl MPlayStart +_02007298: + pop {r0} + bx r0 + + thumb_func_start m4aSongNumStartOrContinue +m4aSongNumStartOrContinue: @ 0x0200729C + push {lr} + lsls r0, r0, #0x10 + ldr r2, =gUnknown_0201DDF8 + ldr r1, =gUnknown_0201DE04 + lsrs r0, r0, #0xd + adds r0, r0, r1 + ldrh r3, [r0, #4] + lsls r1, r3, #1 + adds r1, r1, r3 + lsls r1, r1, #2 + adds r1, r1, r2 + ldr r1, [r1] + ldr r3, [r1] + ldr r2, [r0] + cmp r3, r2 + beq _020072D0 + adds r0, r1, #0 + adds r1, r2, #0 + bl MPlayStart + b _020072EC + .align 2, 0 + .pool +_020072D0: + ldr r2, [r1, #4] + ldrh r0, [r1, #4] + cmp r0, #0 + bne _020072E2 + adds r0, r1, #0 + adds r1, r3, #0 + bl MPlayStart + b _020072EC +_020072E2: + cmp r2, #0 + bge _020072EC + adds r0, r1, #0 + bl MPlayContinue +_020072EC: + pop {r0} + bx r0 + + thumb_func_start m4aSongNumStop +m4aSongNumStop: @ 0x020072F0 + push {lr} + lsls r0, r0, #0x10 + ldr r2, =gUnknown_0201DDF8 + ldr r1, =gUnknown_0201DE04 + lsrs r0, r0, #0xd + adds r0, r0, r1 + ldrh r3, [r0, #4] + lsls r1, r3, #1 + adds r1, r1, r3 + lsls r1, r1, #2 + adds r1, r1, r2 + ldr r2, [r1] + ldr r1, [r2] + ldr r0, [r0] + cmp r1, r0 + bne _02007316 + adds r0, r2, #0 + bl m4aMPlayStop +_02007316: + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start m4aSongNumContinue +m4aSongNumContinue: @ 0x02007324 + push {lr} + lsls r0, r0, #0x10 + ldr r2, =gUnknown_0201DDF8 + ldr r1, =gUnknown_0201DE04 + lsrs r0, r0, #0xd + adds r0, r0, r1 + ldrh r3, [r0, #4] + lsls r1, r3, #1 + adds r1, r1, r3 + lsls r1, r1, #2 + adds r1, r1, r2 + ldr r2, [r1] + ldr r1, [r2] + ldr r0, [r0] + cmp r1, r0 + bne _0200734A + adds r0, r2, #0 + bl MPlayContinue +_0200734A: + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start m4aMPlayAllStop +m4aMPlayAllStop: @ 0x02007358 + push {r4, r5, lr} + ldr r0, =0x00000001 + lsls r0, r0, #0x10 + lsrs r0, r0, #0x10 + cmp r0, #0 + beq _02007376 + ldr r5, =gUnknown_0201DDF8 + adds r4, r0, #0 +_02007368: + ldr r0, [r5] + bl m4aMPlayStop + adds r5, #0xc + subs r4, #1 + cmp r4, #0 + bne _02007368 +_02007376: + pop {r4, r5} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start m4aMPlayContinue +m4aMPlayContinue: @ 0x02007384 + push {lr} + bl MPlayContinue + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start m4aMPlayAllContinue +m4aMPlayAllContinue: @ 0x02007390 + push {r4, r5, lr} + ldr r0, =0x00000001 + lsls r0, r0, #0x10 + lsrs r0, r0, #0x10 + cmp r0, #0 + beq _020073AE + ldr r5, =gUnknown_0201DDF8 + adds r4, r0, #0 +_020073A0: + ldr r0, [r5] + bl MPlayContinue + adds r5, #0xc + subs r4, #1 + cmp r4, #0 + bne _020073A0 +_020073AE: + pop {r4, r5} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start m4aMPlayFadeOut +m4aMPlayFadeOut: @ 0x020073BC + push {lr} + lsls r1, r1, #0x10 + lsrs r1, r1, #0x10 + bl MPlayFadeOut + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start m4aMPlayFadeOutTemporarily +m4aMPlayFadeOutTemporarily: @ 0x020073CC + push {r4, r5, r6, r7, lr} + ldrb r5, [r0, #8] + ldr r4, [r0, #0x2c] + cmp r5, #0 + ble _0200740E + movs r7, #0x80 +_020073D8: + ldrb r1, [r4] + adds r0, r7, #0 + ands r0, r1 + cmp r0, #0 + beq _02007406 + movs r6, #0x40 + adds r0, r6, #0 + ands r0, r1 + cmp r0, #0 + beq _02007406 + adds r0, r4, #0 + bl sub_02007550 + strb r7, [r4] + movs r0, #2 + strb r0, [r4, #0xf] + strb r6, [r4, #0x13] + movs r0, #0x16 + strb r0, [r4, #0x19] + adds r1, r4, #0 + adds r1, #0x24 + movs r0, #1 + strb r0, [r1] +_02007406: + subs r5, #1 + adds r4, #0x50 + cmp r5, #0 + bgt _020073D8 +_0200740E: + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + + thumb_func_start MPlayExtender +MPlayExtender: @ 0x02007414 + push {r4, r5, r6, lr} + sub sp, #4 + adds r5, r0, #0 + ldr r1, =0x04000084 + movs r0, #0x8f + strh r0, [r1] + ldr r2, =0x04000080 + movs r0, #0x77 + strh r0, [r2] + ldr r0, =0x04000063 + movs r1, #8 + strb r1, [r0] + adds r0, #6 + strb r1, [r0] + adds r0, #0x10 + strb r1, [r0] + subs r0, #0x14 + movs r1, #0x80 + strb r1, [r0] + adds r0, #8 + strb r1, [r0] + adds r0, #0x10 + strb r1, [r0] + ldr r1, =0x04000070 + movs r0, #0 + strb r0, [r1] + ldr r1, =0x0000FF77 + adds r0, r1, #0 + strh r0, [r2] + ldr r0, =0x03007FF0 + ldr r4, [r0] + ldr r6, [r4] + ldr r0, =0x68736D53 + cmp r6, r0 + bne _020074D8 + adds r0, r6, #1 + str r0, [r4] + ldr r1, =gUnknown_020229F0 + ldr r0, =ply_memacc + str r0, [r1, #0x20] + ldr r0, =ply_lfos + str r0, [r1, #0x44] + ldr r0, =ply_mod + str r0, [r1, #0x4c] + ldr r0, =ply_xcmd + str r0, [r1, #0x70] + ldr r0, =ply_endtie + str r0, [r1, #0x74] + ldr r0, =sub_0200762C + str r0, [r1, #0x78] + ldr r0, =TrackStop + str r0, [r1, #0x7c] + adds r2, r1, #0 + adds r2, #0x80 + ldr r0, =FadeOutBody + str r0, [r2] + adds r1, #0x84 + ldr r0, =TrkVolPitSet + str r0, [r1] + str r5, [r4, #0x1c] + ldr r0, =CgbSound + str r0, [r4, #0x28] + ldr r0, =CgbOscOff + str r0, [r4, #0x2c] + ldr r0, =MidiKeyToCgbFreq + str r0, [r4, #0x30] + ldr r0, =0x00000000 + movs r1, #0 + strb r0, [r4, #0xc] + str r1, [sp] + ldr r2, =0x05000040 + mov r0, sp + adds r1, r5, #0 + bl CpuSet + movs r0, #1 + strb r0, [r5, #1] + movs r0, #0x11 + strb r0, [r5, #0x1c] + adds r1, r5, #0 + adds r1, #0x41 + movs r0, #2 + strb r0, [r1] + adds r1, #0x1b + movs r0, #0x22 + strb r0, [r1] + adds r1, #0x25 + movs r0, #3 + strb r0, [r1] + adds r1, #0x1b + movs r0, #0x44 + strb r0, [r1] + adds r1, #0x24 + movs r0, #4 + strb r0, [r1, #1] + movs r0, #0x88 + strb r0, [r1, #0x1c] + str r6, [r4] +_020074D8: + add sp, #4 + pop {r4, r5, r6} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start MusicPlayerJumpTableCopy +MusicPlayerJumpTableCopy: @ 0x02007538 + svc #0x2a + bx lr + + thumb_func_start sub_0200753C +sub_0200753C: @ 0x0200753C + push {lr} + ldr r1, =gUnknown_02022A78 + ldr r1, [r1] + bl _call_via_r1 + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02007550 +sub_02007550: @ 0x02007550 + push {lr} + ldr r1, =gUnknown_02022A7C + ldr r1, [r1] + bl _call_via_r1 + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start SoundInit +SoundInit: @ 0x02007564 + push {r4, r5, lr} + sub sp, #4 + adds r5, r0, #0 + movs r3, #0 + str r3, [r5] + ldr r0, =0x040000C6 + strh r3, [r0] + adds r0, #0xc + strh r3, [r0] + ldr r1, =0x04000084 + movs r0, #0x8f + strh r0, [r1] + subs r1, #2 + ldr r2, =0x0000A90E + adds r0, r2, #0 + strh r0, [r1] + ldr r2, =0x04000089 + ldrb r1, [r2] + movs r0, #0x3f + ands r0, r1 + movs r1, #0x40 + orrs r0, r1 + strb r0, [r2] + ldr r1, =0x040000BC + movs r2, #0xd4 + lsls r2, r2, #2 + adds r0, r5, r2 + str r0, [r1] + adds r1, #4 + ldr r0, =0x040000A0 + str r0, [r1] + adds r1, #8 + movs r2, #0x98 + lsls r2, r2, #4 + adds r0, r5, r2 + str r0, [r1] + adds r1, #4 + ldr r0, =0x040000A4 + str r0, [r1] + ldr r0, =0x03007FF0 + str r5, [r0] + str r3, [sp] + ldr r2, =0x050003EC + mov r0, sp + adds r1, r5, #0 + bl CpuSet + movs r0, #8 + strb r0, [r5, #6] + movs r0, #0xf + strb r0, [r5, #7] + ldr r0, =ply_note + str r0, [r5, #0x38] + ldr r0, =sub_02008588 + str r0, [r5, #0x28] + str r0, [r5, #0x2c] + str r0, [r5, #0x30] + str r0, [r5, #0x3c] + ldr r4, =gUnknown_020229F0 + adds r0, r4, #0 + bl MPlayJumpTableCopy + str r4, [r5, #0x34] + movs r0, #0x80 + lsls r0, r0, #0xb + bl sub_0200762C + ldr r0, =0x68736D53 + str r0, [r5] + add sp, #4 + pop {r4, r5} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200762C +sub_0200762C: @ 0x0200762C + push {r4, r5, r6, lr} + adds r2, r0, #0 + ldr r0, =0x03007FF0 + ldr r4, [r0] + movs r0, #0xf0 + lsls r0, r0, #0xc + ands r0, r2 + lsrs r2, r0, #0x10 + movs r6, #0 + strb r2, [r4, #8] + ldr r1, =gUnknown_0201D838 + subs r0, r2, #1 + lsls r0, r0, #1 + adds r0, r0, r1 + ldrh r5, [r0] + str r5, [r4, #0x10] + movs r0, #0xc6 + lsls r0, r0, #3 + adds r1, r5, #0 + bl __divsi3 + strb r0, [r4, #0xb] + ldr r0, =0x00091D1B + muls r0, r5, r0 + ldr r1, =0x00001388 + adds r0, r0, r1 + ldr r1, =0x00002710 + bl __divsi3 + adds r1, r0, #0 + str r1, [r4, #0x14] + movs r0, #0x80 + lsls r0, r0, #0x11 + bl __divsi3 + adds r0, #1 + asrs r0, r0, #1 + str r0, [r4, #0x18] + ldr r0, =0x04000102 + strh r6, [r0] + ldr r4, =0x04000100 + ldr r0, =0x00044940 + adds r1, r5, #0 + bl __divsi3 + rsbs r0, r0, #0 + strh r0, [r4] + bl m4aSoundVSyncOn + ldr r1, =0x04000006 +_02007690: + ldrb r0, [r1] + cmp r0, #0x9f + beq _02007690 + ldr r1, =0x04000006 +_02007698: + ldrb r0, [r1] + cmp r0, #0x9f + bne _02007698 + ldr r1, =0x04000102 + movs r0, #0x80 + strh r0, [r1] + pop {r4, r5, r6} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start m4aSoundMode +m4aSoundMode: @ 0x020076D0 + push {r4, r5, lr} + adds r3, r0, #0 + ldr r0, =0x03007FF0 + ldr r5, [r0] + ldr r1, [r5] + ldr r0, =0x68736D53 + cmp r1, r0 + bne _02007756 + adds r0, r1, #1 + str r0, [r5] + movs r4, #0xff + ands r4, r3 + cmp r4, #0 + beq _020076F2 + movs r0, #0x7f + ands r4, r0 + strb r4, [r5, #5] +_020076F2: + movs r4, #0xf0 + lsls r4, r4, #4 + ands r4, r3 + cmp r4, #0 + beq _02007712 + lsrs r0, r4, #8 + strb r0, [r5, #6] + movs r4, #0xc + adds r0, r5, #0 + adds r0, #0x50 + movs r1, #0 +_02007708: + strb r1, [r0] + subs r4, #1 + adds r0, #0x40 + cmp r4, #0 + bne _02007708 +_02007712: + movs r4, #0xf0 + lsls r4, r4, #8 + ands r4, r3 + cmp r4, #0 + beq _02007720 + lsrs r0, r4, #0xc + strb r0, [r5, #7] +_02007720: + movs r4, #0xb0 + lsls r4, r4, #0x10 + ands r4, r3 + cmp r4, #0 + beq _0200773E + movs r0, #0xc0 + lsls r0, r0, #0xe + ands r0, r4 + lsrs r4, r0, #0xe + ldr r2, =0x04000089 + ldrb r1, [r2] + movs r0, #0x3f + ands r0, r1 + orrs r0, r4 + strb r0, [r2] +_0200773E: + movs r4, #0xf0 + lsls r4, r4, #0xc + ands r4, r3 + cmp r4, #0 + beq _02007752 + bl m4aSoundVSyncOff + adds r0, r4, #0 + bl sub_0200762C +_02007752: + ldr r0, =0x68736D53 + str r0, [r5] +_02007756: + pop {r4, r5} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start SoundClear +SoundClear: @ 0x02007768 + push {r4, r5, r6, r7, lr} + ldr r0, =0x03007FF0 + ldr r6, [r0] + ldr r1, [r6] + ldr r0, =0x68736D53 + cmp r1, r0 + bne _020077AE + adds r0, r1, #1 + str r0, [r6] + movs r5, #0xc + adds r4, r6, #0 + adds r4, #0x50 + movs r0, #0 +_02007782: + strb r0, [r4] + subs r5, #1 + adds r4, #0x40 + cmp r5, #0 + bgt _02007782 + ldr r4, [r6, #0x1c] + cmp r4, #0 + beq _020077AA + movs r5, #1 + movs r7, #0 +_02007796: + lsls r0, r5, #0x18 + lsrs r0, r0, #0x18 + ldr r1, [r6, #0x2c] + bl _call_via_r1 + strb r7, [r4] + adds r5, #1 + adds r4, #0x40 + cmp r5, #4 + ble _02007796 +_020077AA: + ldr r0, =0x68736D53 + str r0, [r6] +_020077AE: + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start m4aSoundVSyncOff +m4aSoundVSyncOff: @ 0x020077BC + push {lr} + sub sp, #4 + ldr r0, =0x03007FF0 + ldr r2, [r0] + ldr r1, [r2] + ldr r3, =0x978C92AD + adds r0, r1, r3 + cmp r0, #1 + bhi _020077F0 + adds r0, r1, #0 + adds r0, #0xa + str r0, [r2] + ldr r0, =0x040000C6 + movs r1, #0 + strh r1, [r0] + adds r0, #0xc + strh r1, [r0] + movs r0, #0 + str r0, [sp] + movs r0, #0xd4 + lsls r0, r0, #2 + adds r1, r2, r0 + ldr r2, =0x05000318 + mov r0, sp + bl CpuSet +_020077F0: + add sp, #4 + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start m4aSoundVSyncOn +m4aSoundVSyncOn: @ 0x02007808 + push {r4, lr} + ldr r0, =0x03007FF0 + ldr r2, [r0] + ldr r3, [r2] + ldr r0, =0x68736D53 + cmp r3, r0 + beq _02007830 + ldr r0, =0x040000C6 + movs r4, #0xb6 + lsls r4, r4, #8 + adds r1, r4, #0 + strh r1, [r0] + adds r0, #0xc + strh r1, [r0] + ldrb r0, [r2, #4] + movs r0, #0 + strb r0, [r2, #4] + adds r0, r3, #0 + subs r0, #0xa + str r0, [r2] +_02007830: + pop {r4} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start MPlayOpen +MPlayOpen: @ 0x02007844 + push {r4, r5, r6, r7, lr} + adds r7, r0, #0 + adds r6, r1, #0 + lsls r2, r2, #0x18 + lsrs r4, r2, #0x18 + cmp r4, #0 + beq _020078A8 + cmp r4, #0x10 + bls _02007858 + movs r4, #0x10 +_02007858: + ldr r0, =0x03007FF0 + ldr r5, [r0] + ldr r1, [r5] + ldr r0, =0x68736D53 + cmp r1, r0 + bne _020078A8 + adds r0, r1, #1 + str r0, [r5] + adds r0, r7, #0 + bl sub_02007550 + str r6, [r7, #0x2c] + strb r4, [r7, #8] + movs r0, #0x80 + lsls r0, r0, #0x18 + str r0, [r7, #4] + cmp r4, #0 + beq _0200788C + movs r1, #0 +_0200787E: + strb r1, [r6] + subs r0, r4, #1 + lsls r0, r0, #0x18 + lsrs r4, r0, #0x18 + adds r6, #0x50 + cmp r4, #0 + bne _0200787E +_0200788C: + ldr r0, [r5, #0x20] + cmp r0, #0 + beq _0200789C + str r0, [r7, #0x38] + ldr r0, [r5, #0x24] + str r0, [r7, #0x3c] + movs r0, #0 + str r0, [r5, #0x20] +_0200789C: + str r7, [r5, #0x24] + ldr r0, =MPlayMain + str r0, [r5, #0x20] + ldr r0, =0x68736D53 + str r0, [r5] + str r0, [r7, #0x34] +_020078A8: + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start MPlayStart +MPlayStart: @ 0x020078BC + push {r4, r5, r6, r7, lr} + mov r7, r8 + push {r7} + adds r5, r0, #0 + adds r7, r1, #0 + ldr r1, [r5, #0x34] + ldr r0, =0x68736D53 + cmp r1, r0 + bne _02007962 + adds r0, r1, #1 + str r0, [r5, #0x34] + movs r1, #0 + str r1, [r5, #4] + str r7, [r5] + ldr r0, [r7, #4] + str r0, [r5, #0x30] + ldrb r0, [r7, #2] + strb r0, [r5, #9] + str r1, [r5, #0xc] + movs r0, #0x96 + strh r0, [r5, #0x1c] + strh r0, [r5, #0x20] + adds r0, #0x6a + strh r0, [r5, #0x1e] + strh r1, [r5, #0x22] + strh r1, [r5, #0x24] + movs r6, #0 + ldr r4, [r5, #0x2c] + ldrb r0, [r7] + cmp r6, r0 + bge _0200792E + ldrb r1, [r5, #8] + cmp r6, r1 + bge _0200794E + mov r8, r6 +_02007902: + adds r0, r5, #0 + adds r1, r4, #0 + bl TrackStop + movs r0, #0xc0 + strb r0, [r4] + mov r0, r8 + str r0, [r4, #0x20] + lsls r1, r6, #2 + adds r0, r7, #0 + adds r0, #8 + adds r0, r0, r1 + ldr r0, [r0] + str r0, [r4, #0x40] + adds r6, #1 + adds r4, #0x50 + ldrb r1, [r7] + cmp r6, r1 + bge _0200792E + ldrb r0, [r5, #8] + cmp r6, r0 + blt _02007902 +_0200792E: + ldrb r1, [r5, #8] + cmp r6, r1 + bge _0200794E + movs r0, #0 + mov r8, r0 +_02007938: + adds r0, r5, #0 + adds r1, r4, #0 + bl TrackStop + mov r1, r8 + strb r1, [r4] + adds r6, #1 + adds r4, #0x50 + ldrb r0, [r5, #8] + cmp r6, r0 + blt _02007938 +_0200794E: + movs r0, #0x80 + ldrb r1, [r7, #3] + ands r0, r1 + cmp r0, #0 + beq _0200795E + ldrb r0, [r7, #3] + bl m4aSoundMode +_0200795E: + ldr r0, =0x68736D53 + str r0, [r5, #0x34] +_02007962: + pop {r3} + mov r8, r3 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start m4aMPlayStop +m4aMPlayStop: @ 0x02007970 + push {r4, r5, r6, lr} + adds r6, r0, #0 + ldr r1, [r6, #0x34] + ldr r0, =0x68736D53 + cmp r1, r0 + bne _020079A6 + adds r0, r1, #1 + str r0, [r6, #0x34] + ldr r0, [r6, #4] + movs r1, #0x80 + lsls r1, r1, #0x18 + orrs r0, r1 + str r0, [r6, #4] + ldrb r4, [r6, #8] + ldr r5, [r6, #0x2c] + cmp r4, #0 + ble _020079A2 +_02007992: + adds r0, r6, #0 + adds r1, r5, #0 + bl TrackStop + subs r4, #1 + adds r5, #0x50 + cmp r4, #0 + bgt _02007992 +_020079A2: + ldr r0, =0x68736D53 + str r0, [r6, #0x34] +_020079A6: + pop {r4, r5, r6} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start FadeOutBody +FadeOutBody: @ 0x020079B0 + push {r4, r5, r6, r7, lr} + adds r6, r0, #0 + ldrh r2, [r6, #0x24] + cmp r2, #0 + beq _02007A2A + ldrh r0, [r6, #0x26] + subs r0, #1 + strh r0, [r6, #0x26] + ldr r3, =0x0000FFFF + adds r1, r3, #0 + lsls r0, r0, #0x10 + cmp r0, #0 + bne _02007A2A + ldrh r0, [r6, #0x28] + subs r0, #0x10 + strh r0, [r6, #0x28] + ands r0, r1 + lsls r0, r0, #0x10 + cmp r0, #0 + bgt _020079FC + ldrb r5, [r6, #8] + ldr r4, [r6, #0x2c] + cmp r5, #0 + ble _02007A2A + movs r7, #0 +_020079E2: + adds r0, r6, #0 + adds r1, r4, #0 + bl TrackStop + strb r7, [r4] + subs r5, #1 + adds r4, #0x50 + cmp r5, #0 + bgt _020079E2 + b _02007A2A + .align 2, 0 + .pool +_020079FC: + strh r2, [r6, #0x26] + ldrb r5, [r6, #8] + ldr r4, [r6, #0x2c] + cmp r5, #0 + ble _02007A2A + movs r3, #0x80 + movs r7, #0 + movs r2, #3 +_02007A0C: + ldrb r1, [r4] + adds r0, r3, #0 + ands r0, r1 + cmp r0, #0 + beq _02007A22 + ldrh r7, [r6, #0x28] + lsrs r0, r7, #2 + strb r0, [r4, #0x13] + adds r0, r1, #0 + orrs r0, r2 + strb r0, [r4] +_02007A22: + subs r5, #1 + adds r4, #0x50 + cmp r5, #0 + bgt _02007A0C +_02007A2A: + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + + thumb_func_start TrkVolPitSet +TrkVolPitSet: @ 0x02007A30 + push {r4, lr} + adds r2, r1, #0 + movs r0, #1 + ldrb r1, [r2] + ands r0, r1 + cmp r0, #0 + beq _02007AA8 + ldrb r3, [r2, #0x13] + ldrb r1, [r2, #0x12] + adds r0, r3, #0 + muls r0, r1, r0 + lsrs r3, r0, #5 + ldrb r4, [r2, #0x18] + cmp r4, #1 + bne _02007A58 + movs r0, #0x16 + ldrsb r0, [r2, r0] + adds r0, #0x80 + muls r0, r3, r0 + lsrs r3, r0, #7 +_02007A58: + movs r0, #0x14 + ldrsb r0, [r2, r0] + lsls r0, r0, #1 + movs r1, #0x15 + ldrsb r1, [r2, r1] + adds r1, r0, r1 + cmp r4, #2 + bne _02007A6E + movs r0, #0x16 + ldrsb r0, [r2, r0] + adds r1, r1, r0 +_02007A6E: + movs r0, #0x80 + rsbs r0, r0, #0 + cmp r1, r0 + bge _02007A7A + adds r1, r0, #0 + b _02007A80 +_02007A7A: + cmp r1, #0x7f + ble _02007A80 + movs r1, #0x7f +_02007A80: + adds r0, r1, #0 + adds r0, #0x80 + muls r0, r3, r0 + lsrs r0, r0, #8 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + cmp r0, #0xff + bls _02007A92 + movs r0, #0xff +_02007A92: + strb r0, [r2, #0x10] + movs r0, #0x7f + subs r0, r0, r1 + muls r0, r3, r0 + lsrs r0, r0, #8 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + cmp r0, #0xff + bls _02007AA6 + movs r0, #0xff +_02007AA6: + strb r0, [r2, #0x11] +_02007AA8: + ldrb r1, [r2] + movs r0, #4 + ands r0, r1 + adds r3, r1, #0 + cmp r0, #0 + beq _02007AEC + movs r0, #0xe + ldrsb r0, [r2, r0] + ldrb r1, [r2, #0xf] + muls r0, r1, r0 + movs r1, #0xc + ldrsb r1, [r2, r1] + adds r1, r1, r0 + lsls r1, r1, #2 + movs r0, #0xa + ldrsb r0, [r2, r0] + lsls r0, r0, #8 + adds r1, r1, r0 + movs r0, #0xb + ldrsb r0, [r2, r0] + lsls r0, r0, #8 + adds r1, r1, r0 + ldrb r0, [r2, #0xd] + adds r1, r0, r1 + ldrb r0, [r2, #0x18] + cmp r0, #0 + bne _02007AE6 + movs r0, #0x16 + ldrsb r0, [r2, r0] + lsls r0, r0, #4 + adds r1, r1, r0 +_02007AE6: + asrs r0, r1, #8 + strb r0, [r2, #8] + strb r1, [r2, #9] +_02007AEC: + movs r0, #0xfa + ands r0, r3 + strb r0, [r2] + pop {r4} + pop {r0} + bx r0 + + thumb_func_start MidiKeyToCgbFreq +MidiKeyToCgbFreq: @ 0x02007AF8 + push {r4, r5, r6, r7, lr} + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + lsls r1, r1, #0x18 + lsrs r5, r1, #0x18 + lsls r2, r2, #0x18 + lsrs r2, r2, #0x18 + mov ip, r2 + cmp r0, #4 + bne _02007B30 + cmp r5, #0x14 + bhi _02007B14 + movs r5, #0 + b _02007B22 +_02007B14: + adds r0, r5, #0 + subs r0, #0x15 + lsls r0, r0, #0x18 + lsrs r5, r0, #0x18 + cmp r5, #0x3b + bls _02007B22 + movs r5, #0x3b +_02007B22: + ldr r0, =gUnknown_0201D8EC + adds r0, r5, r0 + ldrb r0, [r0] + b _02007B92 + .align 2, 0 + .pool +_02007B30: + cmp r5, #0x23 + bhi _02007B3C + movs r0, #0 + mov ip, r0 + movs r5, #0 + b _02007B4E +_02007B3C: + adds r0, r5, #0 + subs r0, #0x24 + lsls r0, r0, #0x18 + lsrs r5, r0, #0x18 + cmp r5, #0x82 + bls _02007B4E + movs r5, #0x82 + movs r1, #0xff + mov ip, r1 +_02007B4E: + ldr r3, =gUnknown_0201D850 + adds r0, r5, r3 + ldrb r6, [r0] + ldr r4, =gUnknown_0201D8D4 + movs r2, #0xf + adds r0, r6, #0 + ands r0, r2 + lsls r0, r0, #1 + adds r0, r0, r4 + movs r7, #0 + ldrsh r1, [r0, r7] + asrs r0, r6, #4 + adds r6, r1, #0 + asrs r6, r0 + adds r0, r5, #1 + adds r0, r0, r3 + ldrb r1, [r0] + adds r0, r1, #0 + ands r0, r2 + lsls r0, r0, #1 + adds r0, r0, r4 + movs r2, #0 + ldrsh r0, [r0, r2] + asrs r1, r1, #4 + asrs r0, r1 + subs r0, r0, r6 + mov r7, ip + muls r7, r0, r7 + adds r0, r7, #0 + asrs r0, r0, #8 + adds r0, r6, r0 + movs r1, #0x80 + lsls r1, r1, #4 + adds r0, r0, r1 +_02007B92: + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start CgbOscOff +CgbOscOff: @ 0x02007BA0 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + adds r1, r0, #0 + cmp r0, #2 + beq _02007BC8 + cmp r0, #2 + bgt _02007BB4 + cmp r0, #1 + beq _02007BBA + b _02007BDC +_02007BB4: + cmp r1, #3 + beq _02007BD0 + b _02007BDC +_02007BBA: + ldr r1, =0x04000063 + movs r0, #8 + strb r0, [r1] + adds r1, #2 + b _02007BE4 + .align 2, 0 + .pool +_02007BC8: + ldr r1, =0x04000069 + b _02007BDE + .align 2, 0 + .pool +_02007BD0: + ldr r1, =0x04000070 + movs r0, #0 + b _02007BE6 + .align 2, 0 + .pool +_02007BDC: + ldr r1, =0x04000079 +_02007BDE: + movs r0, #8 + strb r0, [r1] + adds r1, #4 +_02007BE4: + movs r0, #0x80 +_02007BE6: + strb r0, [r1] + bx lr + .align 2, 0 + .pool + + thumb_func_start GcbModVol +GcbModVol: @ 0x02007BF0 + push {r4, lr} + adds r1, r0, #0 + ldrb r0, [r1, #2] + lsls r2, r0, #0x18 + lsrs r4, r2, #0x18 + ldrb r3, [r1, #3] + lsls r0, r3, #0x18 + lsrs r3, r0, #0x18 + cmp r4, r3 + blo _02007C10 + lsrs r0, r2, #0x19 + cmp r0, r3 + blo _02007C1C + movs r0, #0xf + strb r0, [r1, #0x1b] + b _02007C2A +_02007C10: + lsrs r0, r0, #0x19 + cmp r0, r4 + blo _02007C1C + movs r0, #0xf0 + strb r0, [r1, #0x1b] + b _02007C2A +_02007C1C: + movs r0, #0xff + strb r0, [r1, #0x1b] + ldrb r2, [r1, #3] + ldrb r3, [r1, #2] + adds r0, r2, r3 + lsrs r0, r0, #4 + b _02007C3A +_02007C2A: + ldrb r2, [r1, #3] + ldrb r3, [r1, #2] + adds r0, r2, r3 + lsrs r0, r0, #4 + strb r0, [r1, #0xa] + cmp r0, #0xf + bls _02007C3C + movs r0, #0xf +_02007C3A: + strb r0, [r1, #0xa] +_02007C3C: + ldrb r2, [r1, #6] + ldrb r3, [r1, #0xa] + adds r0, r2, #0 + muls r0, r3, r0 + adds r0, #0xf + asrs r0, r0, #4 + strb r0, [r1, #0x19] + ldrb r0, [r1, #0x1c] + ldrb r2, [r1, #0x1b] + ands r0, r2 + strb r0, [r1, #0x1b] + pop {r4} + pop {r0} + bx r0 + + thumb_func_start CgbSound +CgbSound: @ 0x02007C58 + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #0x20 + ldr r0, =0x03007FF0 + ldr r0, [r0] + str r0, [sp, #4] + ldrb r0, [r0, #0xa] + cmp r0, #0 + beq _02007C7C + subs r0, #1 + ldr r1, [sp, #4] + strb r0, [r1, #0xa] + b _02007C82 + .align 2, 0 + .pool +_02007C7C: + movs r0, #0xe + ldr r2, [sp, #4] + strb r0, [r2, #0xa] +_02007C82: + movs r6, #1 + ldr r0, [sp, #4] + ldr r4, [r0, #0x1c] +_02007C88: + ldrb r1, [r4] + movs r0, #0xc7 + ands r0, r1 + adds r2, r6, #1 + mov sb, r2 + movs r2, #0x40 + adds r2, r2, r4 + mov r8, r2 + cmp r0, #0 + bne _02007C9E + b _02008082 +_02007C9E: + cmp r6, #2 + beq _02007CD0 + cmp r6, #2 + bgt _02007CAC + cmp r6, #1 + beq _02007CB2 + b _02007D08 +_02007CAC: + cmp r6, #3 + beq _02007CE8 + b _02007D08 +_02007CB2: + ldr r0, =0x04000060 + str r0, [sp, #8] + ldr r7, =0x04000062 + ldr r2, =0x04000063 + str r2, [sp, #0xc] + adds r0, #4 + str r0, [sp, #0x10] + adds r2, #2 + b _02007D18 + .align 2, 0 + .pool +_02007CD0: + ldr r0, =0x04000061 + str r0, [sp, #8] + ldr r7, =0x04000068 + ldr r2, =0x04000069 + b _02007D10 + .align 2, 0 + .pool +_02007CE8: + ldr r0, =0x04000070 + str r0, [sp, #8] + ldr r7, =0x04000072 + ldr r2, =0x04000073 + str r2, [sp, #0xc] + adds r0, #4 + str r0, [sp, #0x10] + adds r2, #2 + b _02007D18 + .align 2, 0 + .pool +_02007D08: + ldr r0, =0x04000071 + str r0, [sp, #8] + ldr r7, =0x04000078 + ldr r2, =0x04000079 +_02007D10: + str r2, [sp, #0xc] + adds r0, #0xb + str r0, [sp, #0x10] + adds r2, #4 +_02007D18: + str r2, [sp, #0x14] + ldr r0, [sp, #4] + ldrb r0, [r0, #0xa] + str r0, [sp] + adds r2, r1, #0 + movs r0, #0x80 + mov sl, r0 + ands r0, r2 + cmp r0, #0 + beq _02007E12 + movs r3, #0x40 + adds r0, r3, #0 + ands r0, r2 + lsls r0, r0, #0x18 + lsrs r5, r0, #0x18 + adds r1, r6, #1 + mov sb, r1 + movs r2, #0x40 + adds r2, r2, r4 + mov r8, r2 + cmp r5, #0 + bne _02007E36 + movs r0, #3 + strb r0, [r4] + strb r0, [r4, #0x1d] + adds r0, r4, #0 + str r3, [sp, #0x1c] + bl GcbModVol + ldr r3, [sp, #0x1c] + cmp r6, #2 + beq _02007D7C + cmp r6, #2 + bgt _02007D70 + cmp r6, #1 + beq _02007D76 + b _02007DD4 + .align 2, 0 + .pool +_02007D70: + cmp r6, #3 + beq _02007D88 + b _02007DD4 +_02007D76: + ldrb r0, [r4, #0x1f] + ldr r1, [sp, #8] + strb r0, [r1] +_02007D7C: + ldr r0, [r4, #0x24] + lsls r0, r0, #6 + ldrb r2, [r4, #0x1e] + adds r0, r2, r0 + strb r0, [r7] + b _02007DE0 +_02007D88: + ldr r1, [r4, #0x24] + ldr r0, [r4, #0x28] + cmp r1, r0 + beq _02007DB0 + ldr r0, [sp, #8] + strb r3, [r0] + ldr r1, =0x04000090 + ldr r2, [r4, #0x24] + ldr r0, [r2] + str r0, [r1] + adds r1, #4 + ldr r0, [r2, #4] + str r0, [r1] + adds r1, #4 + ldr r0, [r2, #8] + str r0, [r1] + adds r1, #4 + ldr r0, [r2, #0xc] + str r0, [r1] + str r2, [r4, #0x28] +_02007DB0: + ldr r1, [sp, #8] + strb r5, [r1] + ldrb r0, [r4, #0x1e] + strb r0, [r7] + ldrb r0, [r4, #0x1e] + cmp r0, #0 + beq _02007DCC + movs r0, #0xc0 + strb r0, [r4, #0x1a] + ldrb r1, [r4, #4] + b _02007DF6 + .align 2, 0 + .pool +_02007DCC: + mov r2, sl + strb r2, [r4, #0x1a] + ldrb r1, [r4, #4] + b _02007DF6 +_02007DD4: + ldrb r0, [r4, #0x1e] + strb r0, [r7] + ldr r0, [r4, #0x24] + lsls r0, r0, #3 + ldr r1, [sp, #0x10] + strb r0, [r1] +_02007DE0: + ldrb r1, [r4, #4] + adds r0, r1, #0 + adds r0, #8 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + str r0, [sp, #0x18] + ldrb r0, [r4, #0x1e] + cmp r0, #0 + beq _02007DF4 + movs r0, #0x40 +_02007DF4: + strb r0, [r4, #0x1a] +_02007DF6: + movs r2, #0 + strb r1, [r4, #0xb] + movs r0, #0xff + ands r0, r1 + adds r1, r6, #1 + mov sb, r1 + movs r1, #0x40 + adds r1, r1, r4 + mov r8, r1 + cmp r0, #0 + bne _02007E0E + b _02007F42 +_02007E0E: + strb r2, [r4, #9] + b _02007F70 +_02007E12: + movs r0, #4 + ands r0, r2 + cmp r0, #0 + beq _02007E44 + ldrb r0, [r4, #0xd] + subs r0, #1 + strb r0, [r4, #0xd] + movs r2, #0xff + ands r0, r2 + lsls r0, r0, #0x18 + adds r1, r6, #1 + mov sb, r1 + movs r2, #0x40 + adds r2, r2, r4 + mov r8, r2 + cmp r0, #0 + ble _02007E36 + b _02007F82 +_02007E36: + lsls r0, r6, #0x18 + lsrs r0, r0, #0x18 + bl CgbOscOff + movs r0, #0 + strb r0, [r4] + b _0200807E +_02007E44: + movs r0, #0x40 + ands r0, r1 + adds r2, r6, #1 + mov sb, r2 + movs r2, #0x40 + adds r2, r2, r4 + mov r8, r2 + cmp r0, #0 + beq _02007E84 + movs r0, #3 + ands r0, r1 + cmp r0, #0 + beq _02007E84 + movs r0, #0xfc + ands r0, r1 + movs r2, #0 + strb r0, [r4] + ldrb r1, [r4, #7] + strb r1, [r4, #0xb] + movs r0, #0xff + ands r0, r1 + cmp r0, #0 + beq _02007EB6 + movs r0, #1 + ldrb r1, [r4, #0x1d] + orrs r0, r1 + strb r0, [r4, #0x1d] + cmp r6, #3 + beq _02007F70 + ldrb r2, [r4, #7] + str r2, [sp, #0x18] + b _02007F70 +_02007E84: + ldrb r0, [r4, #0xb] + cmp r0, #0 + bne _02007F70 + cmp r6, #3 + bne _02007E96 + movs r0, #1 + ldrb r1, [r4, #0x1d] + orrs r0, r1 + strb r0, [r4, #0x1d] +_02007E96: + adds r0, r4, #0 + bl GcbModVol + movs r0, #3 + ldrb r2, [r4] + ands r0, r2 + cmp r0, #0 + bne _02007EE2 + ldrb r0, [r4, #9] + subs r0, #1 + strb r0, [r4, #9] + movs r1, #0xff + ands r0, r1 + lsls r0, r0, #0x18 + cmp r0, #0 + bgt _02007EDE +_02007EB6: + ldrb r2, [r4, #0xc] + ldrb r1, [r4, #0xa] + adds r0, r2, #0 + muls r0, r1, r0 + adds r0, #0xff + asrs r0, r0, #8 + movs r1, #0 + strb r0, [r4, #9] + lsls r0, r0, #0x18 + cmp r0, #0 + beq _02007E36 + movs r0, #4 + ldrb r2, [r4] + orrs r0, r2 + strb r0, [r4] + movs r0, #1 + ldrb r1, [r4, #0x1d] + orrs r0, r1 + strb r0, [r4, #0x1d] + b _02007F82 +_02007EDE: + ldrb r0, [r4, #7] + b _02007F6E +_02007EE2: + cmp r0, #1 + bne _02007EEE +_02007EE6: + ldrb r0, [r4, #0x19] + strb r0, [r4, #9] + movs r0, #7 + b _02007F6E +_02007EEE: + cmp r0, #2 + bne _02007F32 + ldrb r0, [r4, #9] + subs r0, #1 + strb r0, [r4, #9] + movs r2, #0xff + ands r0, r2 + lsls r0, r0, #0x18 + ldrb r2, [r4, #0x19] + lsls r1, r2, #0x18 + cmp r0, r1 + bgt _02007F2E +_02007F06: + ldrb r0, [r4, #6] + cmp r0, #0 + bne _02007F16 + movs r0, #0xfc + ldrb r1, [r4] + ands r0, r1 + strb r0, [r4] + b _02007EB6 +_02007F16: + ldrb r0, [r4] + subs r0, #1 + strb r0, [r4] + movs r0, #1 + ldrb r2, [r4, #0x1d] + orrs r0, r2 + strb r0, [r4, #0x1d] + cmp r6, #3 + beq _02007EE6 + movs r0, #8 + str r0, [sp, #0x18] + b _02007EE6 +_02007F2E: + ldrb r0, [r4, #5] + b _02007F6E +_02007F32: + ldrb r0, [r4, #9] + adds r0, #1 + strb r0, [r4, #9] + movs r1, #0xff + ands r0, r1 + ldrb r2, [r4, #0xa] + cmp r0, r2 + blo _02007F6C +_02007F42: + ldrb r0, [r4] + subs r0, #1 + movs r2, #0 + strb r0, [r4] + ldrb r1, [r4, #5] + strb r1, [r4, #0xb] + movs r0, #0xff + ands r0, r1 + cmp r0, #0 + beq _02007F06 + movs r0, #1 + ldrb r1, [r4, #0x1d] + orrs r0, r1 + strb r0, [r4, #0x1d] + ldrb r0, [r4, #0xa] + strb r0, [r4, #9] + cmp r6, #3 + beq _02007F70 + ldrb r2, [r4, #5] + str r2, [sp, #0x18] + b _02007F70 +_02007F6C: + ldrb r0, [r4, #4] +_02007F6E: + strb r0, [r4, #0xb] +_02007F70: + ldrb r0, [r4, #0xb] + subs r0, #1 + strb r0, [r4, #0xb] + ldr r0, [sp] + cmp r0, #0 + bne _02007F82 + subs r0, #1 + str r0, [sp] + b _02007E84 +_02007F82: + movs r0, #2 + ldrb r1, [r4, #0x1d] + ands r0, r1 + cmp r0, #0 + beq _02007FFA + cmp r6, #3 + bgt _02007FC2 + movs r0, #8 + ldrb r2, [r4, #1] + ands r0, r2 + cmp r0, #0 + beq _02007FC2 + ldr r0, =0x04000089 + ldrb r0, [r0] + cmp r0, #0x3f + bgt _02007FB4 + ldr r0, [r4, #0x20] + adds r0, #2 + ldr r1, =0x000007FC + b _02007FBE + .align 2, 0 + .pool +_02007FB4: + cmp r0, #0x7f + bgt _02007FC2 + ldr r0, [r4, #0x20] + adds r0, #1 + ldr r1, =0x000007FE +_02007FBE: + ands r0, r1 + str r0, [r4, #0x20] +_02007FC2: + cmp r6, #4 + beq _02007FD4 + ldr r0, [r4, #0x20] + ldr r1, [sp, #0x10] + strb r0, [r1] + b _02007FE2 + .align 2, 0 + .pool +_02007FD4: + ldr r2, [sp, #0x10] + ldrb r0, [r2] + movs r1, #8 + ands r1, r0 + ldr r0, [r4, #0x20] + orrs r0, r1 + strb r0, [r2] +_02007FE2: + movs r0, #0xc0 + ldrb r1, [r4, #0x1a] + ands r0, r1 + adds r1, r4, #0 + adds r1, #0x21 + ldrb r1, [r1] + adds r0, r1, r0 + strb r0, [r4, #0x1a] + movs r2, #0xff + ands r0, r2 + ldr r1, [sp, #0x14] + strb r0, [r1] +_02007FFA: + movs r0, #1 + ldrb r2, [r4, #0x1d] + ands r0, r2 + cmp r0, #0 + beq _0200807E + ldr r1, =0x04000081 + ldrb r0, [r1] + ldrb r2, [r4, #0x1c] + bics r0, r2 + ldrb r2, [r4, #0x1b] + orrs r0, r2 + strb r0, [r1] + cmp r6, #3 + bne _0200804C + ldr r0, =gUnknown_0201D928 + ldrb r1, [r4, #9] + adds r0, r1, r0 + ldrb r0, [r0] + ldr r2, [sp, #0xc] + strb r0, [r2] + movs r1, #0x80 + adds r0, r1, #0 + ldrb r2, [r4, #0x1a] + ands r0, r2 + cmp r0, #0 + beq _0200807E + ldr r0, [sp, #8] + strb r1, [r0] + ldrb r0, [r4, #0x1a] + ldr r1, [sp, #0x14] + strb r0, [r1] + movs r0, #0x7f + ldrb r2, [r4, #0x1a] + ands r0, r2 + strb r0, [r4, #0x1a] + b _0200807E + .align 2, 0 + .pool +_0200804C: + movs r0, #0xf + ldr r1, [sp, #0x18] + ands r0, r1 + ldrb r2, [r4, #9] + lsls r1, r2, #4 + adds r0, r0, r1 + ldr r1, [sp, #0xc] + strb r0, [r1] + movs r2, #0x80 + ldrb r0, [r4, #0x1a] + orrs r0, r2 + ldr r1, [sp, #0x14] + strb r0, [r1] + cmp r6, #1 + bne _0200807E + ldr r0, [sp, #8] + ldrb r1, [r0] + movs r0, #8 + ands r0, r1 + cmp r0, #0 + bne _0200807E + ldrb r0, [r4, #0x1a] + orrs r0, r2 + ldr r1, [sp, #0x14] + strb r0, [r1] +_0200807E: + movs r0, #0 + strb r0, [r4, #0x1d] +_02008082: + mov r6, sb + mov r4, r8 + cmp r6, #4 + bgt _0200808C + b _02007C88 +_0200808C: + add sp, #0x20 + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + + thumb_func_start m4aMPlayTempoControl +m4aMPlayTempoControl: @ 0x0200809C + push {r4, lr} + adds r2, r0, #0 + lsls r1, r1, #0x10 + lsrs r1, r1, #0x10 + ldr r3, [r2, #0x34] + ldr r0, =0x68736D53 + cmp r3, r0 + bne _020080B8 + strh r1, [r2, #0x1e] + ldrh r4, [r2, #0x1c] + adds r0, r1, #0 + muls r0, r4, r0 + asrs r0, r0, #8 + strh r0, [r2, #0x20] +_020080B8: + pop {r4} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start m4aMPlayVolumeControl +m4aMPlayVolumeControl: @ 0x020080C4 + push {r4, r5, r6, r7, lr} + mov r7, sb + mov r6, r8 + push {r6, r7} + adds r4, r0, #0 + lsls r1, r1, #0x10 + lsrs r7, r1, #0x10 + lsls r6, r2, #0x10 + ldr r3, [r4, #0x34] + ldr r0, =0x68736D53 + cmp r3, r0 + bne _0200811C + adds r0, r3, #1 + str r0, [r4, #0x34] + ldrb r2, [r4, #8] + ldr r1, [r4, #0x2c] + movs r5, #1 + cmp r2, #0 + ble _02008118 + movs r0, #0x80 + mov r8, r0 + lsrs r6, r6, #0x12 + movs r0, #3 + mov ip, r0 +_020080F4: + adds r0, r7, #0 + ands r0, r5 + cmp r0, #0 + beq _0200810E + ldrb r3, [r1] + mov r0, r8 + ands r0, r3 + cmp r0, #0 + beq _0200810E + strb r6, [r1, #0x13] + mov r0, ip + orrs r0, r3 + strb r0, [r1] +_0200810E: + subs r2, #1 + adds r1, #0x50 + lsls r5, r5, #1 + cmp r2, #0 + bgt _020080F4 +_02008118: + ldr r0, =0x68736D53 + str r0, [r4, #0x34] +_0200811C: + pop {r3, r4} + mov r8, r3 + mov sb, r4 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start m4aMPlayPitchControl +m4aMPlayPitchControl: @ 0x0200812C + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + adds r4, r0, #0 + lsls r1, r1, #0x10 + lsrs r1, r1, #0x10 + mov ip, r1 + lsls r2, r2, #0x10 + lsrs r6, r2, #0x10 + ldr r3, [r4, #0x34] + ldr r0, =0x68736D53 + cmp r3, r0 + bne _0200818E + adds r0, r3, #1 + str r0, [r4, #0x34] + ldrb r2, [r4, #8] + ldr r3, [r4, #0x2c] + movs r5, #1 + cmp r2, #0 + ble _0200818A + movs r0, #0x80 + mov sb, r0 + lsls r0, r6, #0x10 + asrs r7, r0, #0x18 + movs r0, #0xc + mov r8, r0 +_02008164: + mov r0, ip + ands r0, r5 + cmp r0, #0 + beq _02008180 + ldrb r1, [r3] + mov r0, sb + ands r0, r1 + cmp r0, #0 + beq _02008180 + strb r7, [r3, #0xb] + strb r6, [r3, #0xd] + mov r0, r8 + orrs r0, r1 + strb r0, [r3] +_02008180: + subs r2, #1 + adds r3, #0x50 + lsls r5, r5, #1 + cmp r2, #0 + bgt _02008164 +_0200818A: + ldr r0, =0x68736D53 + str r0, [r4, #0x34] +_0200818E: + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start m4aMPlayPanpotControl +m4aMPlayPanpotControl: @ 0x020081A0 + push {r4, r5, r6, r7, lr} + mov r7, sb + mov r6, r8 + push {r6, r7} + adds r4, r0, #0 + lsls r1, r1, #0x10 + lsrs r7, r1, #0x10 + lsls r2, r2, #0x18 + lsrs r6, r2, #0x18 + ldr r3, [r4, #0x34] + ldr r0, =0x68736D53 + cmp r3, r0 + bne _020081F8 + adds r0, r3, #1 + str r0, [r4, #0x34] + ldrb r2, [r4, #8] + ldr r1, [r4, #0x2c] + movs r5, #1 + cmp r2, #0 + ble _020081F4 + movs r0, #0x80 + mov r8, r0 + movs r0, #3 + mov ip, r0 +_020081D0: + adds r0, r7, #0 + ands r0, r5 + cmp r0, #0 + beq _020081EA + ldrb r3, [r1] + mov r0, r8 + ands r0, r3 + cmp r0, #0 + beq _020081EA + strb r6, [r1, #0x15] + mov r0, ip + orrs r0, r3 + strb r0, [r1] +_020081EA: + subs r2, #1 + adds r1, #0x50 + lsls r5, r5, #1 + cmp r2, #0 + bgt _020081D0 +_020081F4: + ldr r0, =0x68736D53 + str r0, [r4, #0x34] +_020081F8: + pop {r3, r4} + mov r8, r3 + mov sb, r4 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start ClearModM +ClearModM: @ 0x02008208 + adds r1, r0, #0 + movs r2, #0 + movs r0, #0 + strb r0, [r1, #0x1a] + strb r0, [r1, #0x16] + ldrb r0, [r1, #0x18] + cmp r0, #0 + bne _0200821C + movs r0, #0xc + b _0200821E +_0200821C: + movs r0, #3 +_0200821E: + ldrb r2, [r1] + orrs r0, r2 + strb r0, [r1] + bx lr + .align 2, 0 + + thumb_func_start m4aMPlayModDepthSet +m4aMPlayModDepthSet: @ 0x02008228 + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + adds r6, r0, #0 + lsls r1, r1, #0x10 + lsrs r1, r1, #0x10 + mov sl, r1 + lsls r2, r2, #0x18 + lsrs r2, r2, #0x18 + mov r8, r2 + ldr r1, [r6, #0x34] + ldr r0, =0x68736D53 + cmp r1, r0 + bne _02008288 + adds r0, r1, #1 + str r0, [r6, #0x34] + ldrb r5, [r6, #8] + ldr r4, [r6, #0x2c] + movs r7, #1 + cmp r5, #0 + ble _02008284 + mov sb, r8 +_02008258: + mov r0, sl + ands r0, r7 + cmp r0, #0 + beq _0200827A + movs r0, #0x80 + ldrb r1, [r4] + ands r0, r1 + cmp r0, #0 + beq _0200827A + mov r0, r8 + strb r0, [r4, #0x17] + mov r1, sb + cmp r1, #0 + bne _0200827A + adds r0, r4, #0 + bl ClearModM +_0200827A: + subs r5, #1 + adds r4, #0x50 + lsls r7, r7, #1 + cmp r5, #0 + bgt _02008258 +_02008284: + ldr r0, =0x68736D53 + str r0, [r6, #0x34] +_02008288: + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start m4aMPlayLFOSpeedSet +m4aMPlayLFOSpeedSet: @ 0x0200829C + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + adds r6, r0, #0 + lsls r1, r1, #0x10 + lsrs r1, r1, #0x10 + mov sl, r1 + lsls r2, r2, #0x18 + lsrs r2, r2, #0x18 + mov r8, r2 + ldr r1, [r6, #0x34] + ldr r0, =0x68736D53 + cmp r1, r0 + bne _020082FC + adds r0, r1, #1 + str r0, [r6, #0x34] + ldrb r5, [r6, #8] + ldr r4, [r6, #0x2c] + movs r7, #1 + cmp r5, #0 + ble _020082F8 + mov sb, r8 +_020082CC: + mov r0, sl + ands r0, r7 + cmp r0, #0 + beq _020082EE + movs r0, #0x80 + ldrb r1, [r4] + ands r0, r1 + cmp r0, #0 + beq _020082EE + mov r0, r8 + strb r0, [r4, #0x19] + mov r1, sb + cmp r1, #0 + bne _020082EE + adds r0, r4, #0 + bl ClearModM +_020082EE: + subs r5, #1 + adds r4, #0x50 + lsls r7, r7, #1 + cmp r5, #0 + bgt _020082CC +_020082F8: + ldr r0, =0x68736D53 + str r0, [r6, #0x34] +_020082FC: + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start ply_memacc +ply_memacc: @ 0x02008310 + push {r4, r5, r6, lr} + adds r4, r0, #0 + adds r6, r1, #0 + ldr r1, [r6, #0x40] + ldrb r5, [r1] + adds r2, r1, #1 + str r2, [r6, #0x40] + ldr r0, [r4, #0x18] + ldrb r1, [r1, #1] + adds r3, r1, r0 + adds r0, r2, #1 + str r0, [r6, #0x40] + ldrb r2, [r2, #1] + adds r0, #1 + str r0, [r6, #0x40] + cmp r5, #0x11 + bls _02008334 + b _02008462 +_02008334: + lsls r0, r5, #2 + ldr r1, =_02008344 + adds r0, r0, r1 + ldr r0, [r0] + mov pc, r0 + .align 2, 0 + .pool +_02008344: @ jump table + .4byte _0200838C @ case 0 + .4byte _02008390 @ case 1 + .4byte _02008398 @ case 2 + .4byte _020083A0 @ case 3 + .4byte _020083AA @ case 4 + .4byte _020083B8 @ case 5 + .4byte _020083C6 @ case 6 + .4byte _020083CE @ case 7 + .4byte _020083D6 @ case 8 + .4byte _020083DE @ case 9 + .4byte _020083E6 @ case 10 + .4byte _020083EE @ case 11 + .4byte _020083F6 @ case 12 + .4byte _02008404 @ case 13 + .4byte _02008412 @ case 14 + .4byte _02008420 @ case 15 + .4byte _0200842E @ case 16 + .4byte _0200843C @ case 17 +_0200838C: + strb r2, [r3] + b _02008462 +_02008390: + ldrb r1, [r3] + adds r0, r1, r2 + strb r0, [r3] + b _02008462 +_02008398: + ldrb r1, [r3] + subs r0, r1, r2 + strb r0, [r3] + b _02008462 +_020083A0: + ldr r0, [r4, #0x18] + adds r0, r0, r2 + ldrb r0, [r0] + strb r0, [r3] + b _02008462 +_020083AA: + ldr r0, [r4, #0x18] + adds r0, r0, r2 + ldrb r1, [r3] + ldrb r0, [r0] + adds r0, r1, r0 + strb r0, [r3] + b _02008462 +_020083B8: + ldr r0, [r4, #0x18] + adds r0, r0, r2 + ldrb r1, [r3] + ldrb r0, [r0] + subs r0, r1, r0 + strb r0, [r3] + b _02008462 +_020083C6: + ldrb r3, [r3] + cmp r3, r2 + beq _02008448 + b _0200845C +_020083CE: + ldrb r3, [r3] + cmp r3, r2 + bne _02008448 + b _0200845C +_020083D6: + ldrb r3, [r3] + cmp r3, r2 + bhi _02008448 + b _0200845C +_020083DE: + ldrb r3, [r3] + cmp r3, r2 + bhs _02008448 + b _0200845C +_020083E6: + ldrb r3, [r3] + cmp r3, r2 + bls _02008448 + b _0200845C +_020083EE: + ldrb r3, [r3] + cmp r3, r2 + blo _02008448 + b _0200845C +_020083F6: + ldr r0, [r4, #0x18] + adds r0, r0, r2 + ldrb r3, [r3] + ldrb r0, [r0] + cmp r3, r0 + beq _02008448 + b _0200845C +_02008404: + ldr r0, [r4, #0x18] + adds r0, r0, r2 + ldrb r3, [r3] + ldrb r0, [r0] + cmp r3, r0 + bne _02008448 + b _0200845C +_02008412: + ldr r0, [r4, #0x18] + adds r0, r0, r2 + ldrb r3, [r3] + ldrb r0, [r0] + cmp r3, r0 + bhi _02008448 + b _0200845C +_02008420: + ldr r0, [r4, #0x18] + adds r0, r0, r2 + ldrb r3, [r3] + ldrb r0, [r0] + cmp r3, r0 + bhs _02008448 + b _0200845C +_0200842E: + ldr r0, [r4, #0x18] + adds r0, r0, r2 + ldrb r3, [r3] + ldrb r0, [r0] + cmp r3, r0 + bls _02008448 + b _0200845C +_0200843C: + ldr r0, [r4, #0x18] + adds r0, r0, r2 + ldrb r3, [r3] + ldrb r0, [r0] + cmp r3, r0 + bhs _0200845C +_02008448: + ldr r0, =gUnknown_020229F4 + ldr r2, [r0] + adds r0, r4, #0 + adds r1, r6, #0 + bl _call_via_r2 + b _02008462 + .align 2, 0 + .pool +_0200845C: + ldr r0, [r6, #0x40] + adds r0, #4 + str r0, [r6, #0x40] +_02008462: + pop {r4, r5, r6} + pop {r0} + bx r0 + + thumb_func_start ply_xcmd +ply_xcmd: @ 0x02008468 + push {lr} + ldr r2, [r1, #0x40] + ldrb r3, [r2] + adds r2, #1 + str r2, [r1, #0x40] + ldr r2, =gUnknown_0201D96C + lsls r3, r3, #2 + adds r3, r3, r2 + ldr r2, [r3] + bl _call_via_r2 + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start ply_xxx +ply_xxx: @ 0x02008488 + push {lr} + ldr r2, =gUnknown_020229F0 + ldr r2, [r2] + bl _call_via_r2 + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start ply_xwave +ply_xwave: @ 0x0200849C + push {r4, lr} + ldr r2, [r1, #0x40] + ldr r0, =0xFFFFFF00 + ands r4, r0 + ldrb r0, [r2] + orrs r4, r0 + ldrb r0, [r2, #1] + lsls r3, r0, #8 + ldr r0, =0xFFFF00FF + ands r4, r0 + orrs r4, r3 + ldrb r0, [r2, #2] + lsls r3, r0, #0x10 + ldr r0, =0xFF00FFFF + ands r4, r0 + orrs r4, r3 + ldrb r0, [r2, #3] + lsls r3, r0, #0x18 + ldr r0, =0x00FFFFFF + ands r4, r0 + orrs r4, r3 + str r4, [r1, #0x28] + adds r2, #4 + str r2, [r1, #0x40] + pop {r4} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start ply_xtype +ply_xtype: @ 0x020084E4 + ldr r0, [r1, #0x40] + ldrb r2, [r0] + adds r0, r1, #0 + adds r0, #0x24 + strb r2, [r0] + ldr r0, [r1, #0x40] + adds r0, #1 + str r0, [r1, #0x40] + bx lr + .align 2, 0 + + thumb_func_start ply_xatta +ply_xatta: @ 0x020084F8 + ldr r0, [r1, #0x40] + ldrb r2, [r0] + adds r0, r1, #0 + adds r0, #0x2c + strb r2, [r0] + ldr r0, [r1, #0x40] + adds r0, #1 + str r0, [r1, #0x40] + bx lr + .align 2, 0 + + thumb_func_start ply_xdeca +ply_xdeca: @ 0x0200850C + ldr r0, [r1, #0x40] + ldrb r0, [r0] + adds r2, r1, #0 + adds r2, #0x2d + strb r0, [r2] + ldr r0, [r1, #0x40] + adds r0, #1 + str r0, [r1, #0x40] + bx lr + .align 2, 0 + + thumb_func_start ply_xsust +ply_xsust: @ 0x02008520 + ldr r0, [r1, #0x40] + ldrb r0, [r0] + adds r2, r1, #0 + adds r2, #0x2e + strb r0, [r2] + ldr r0, [r1, #0x40] + adds r0, #1 + str r0, [r1, #0x40] + bx lr + .align 2, 0 + + thumb_func_start ply_xrele +ply_xrele: @ 0x02008534 + ldr r0, [r1, #0x40] + ldrb r0, [r0] + adds r2, r1, #0 + adds r2, #0x2f + strb r0, [r2] + ldr r0, [r1, #0x40] + adds r0, #1 + str r0, [r1, #0x40] + bx lr + .align 2, 0 + + thumb_func_start ply_xiecv +ply_xiecv: @ 0x02008548 + ldr r0, [r1, #0x40] + ldrb r2, [r0] + strb r2, [r1, #0x1e] + adds r0, #1 + str r0, [r1, #0x40] + bx lr + + thumb_func_start ply_xiecl +ply_xiecl: @ 0x02008554 + ldr r0, [r1, #0x40] + ldrb r2, [r0] + strb r2, [r1, #0x1f] + adds r0, #1 + str r0, [r1, #0x40] + bx lr + + thumb_func_start ply_xleng +ply_xleng: @ 0x02008560 + ldr r0, [r1, #0x40] + ldrb r0, [r0] + adds r2, r1, #0 + adds r2, #0x26 + strb r0, [r2] + ldr r0, [r1, #0x40] + adds r0, #1 + str r0, [r1, #0x40] + bx lr + .align 2, 0 + + thumb_func_start ply_xswee +ply_xswee: @ 0x02008574 + ldr r0, [r1, #0x40] + ldrb r0, [r0] + adds r2, r1, #0 + adds r2, #0x27 + strb r0, [r2] + ldr r0, [r1, #0x40] + adds r0, #1 + str r0, [r1, #0x40] + bx lr + .align 2, 0 + + thumb_func_start sub_02008588 +sub_02008588: @ 0x02008588 + bx lr + .align 2, 0 diff --git a/asm/macros.inc b/asm/macros.inc new file mode 100644 index 0000000..e6813d3 --- /dev/null +++ b/asm/macros.inc @@ -0,0 +1,155 @@ + .include "asm/macros/asm.inc" + .include "asm/macros/function.inc" + .include "asm/macros/movement.inc" + .include "asm/macros/pokemon_data.inc" + .include "asm/macros/ec.inc" + .include "asm/macros/map.inc" + .include "asm/macros/m4a.inc" + + .macro region_map_location x, y, width, height, name + .byte \x + .byte \y + .byte \width + .byte \height + .4byte gMapName_\name + .endm + + .macro obj_tiles address, uncompressed_size, tag + .4byte \address + .2byte \uncompressed_size + .2byte \tag + .endm + + .macro null_obj_tiles + obj_tiles 0, 0, 0 + .endm + + .macro obj_pal address, tag + .4byte \address + .2byte \tag + .2byte 0 @ padding + .endm + + .macro null_obj_pal + obj_pal 0, 0 + .endm + + .macro paired_pals tag, address + .2byte \tag + .2byte 0 @ padding + .4byte \address + .endm + +@ For object animation frames. + .macro obj_frame_tiles address, uncompressed_size + .4byte \address + .2byte \uncompressed_size + .2byte 0 @ padding + .endm + + .macro spr_template tile_tag, pal_tag, oam, anims, images, affine_anims, callback + .2byte \tile_tag + .2byte \pal_tag + .4byte \oam + .4byte \anims + .4byte \images + .4byte \affine_anims + .4byte \callback + .endm + +@ Berry trees have a table defining the palette slot used for each of their 5 +@ stages. However, the first 2 stages always use the same slots regardless of +@ the type of tree and the slots of the last 3 stages always equal each other. + .macro berry_tree_palette_slot_table slot + .byte 3, 4, \slot, \slot, \slot + .endm + + .macro subsprite x, y, priority, tile_num_offset, size + .2byte \x + .2byte \y + .2byte ((\priority) << 14) | ((\tile_num_offset) << 4) | SPRITE_SIZE_\size + .2byte 0 @ padding + .endm + + .macro obj_image_anim_frame pic_id, duration, flags = 0 + .2byte \pic_id + .byte (\flags) | (\duration) + .byte 0 @ padding + .endm + + .macro obj_image_anim_loop count + .2byte 0xfffd + .byte \count + .byte 0 @ padding + .endm + + .macro obj_image_anim_jump target_index + .2byte 0xfffe + .byte \target_index + .byte 0 @ padding + .endm + + .macro obj_image_anim_end + .2byte 0xffff + .2byte 0 @ padding + .endm + + .macro obj_rot_scal_anim_frame delta_x_scale, delta_y_scale, delta_angle, duration + .2byte \delta_x_scale + .2byte \delta_y_scale + .byte \delta_angle + .byte \duration + .2byte 0 @ padding + .endm + + .macro obj_rot_scal_anim_loop count + .2byte 0x7ffd + .2byte \count + .4byte 0 @ padding + .endm + + .macro obj_rot_scal_anim_jump target_index + .2byte 0x7ffe + .2byte \target_index + .4byte 0 @ padding + .endm + + .macro obj_rot_scal_anim_end unknown=0 + .2byte 0x7fff + .2byte \unknown + .fill 4 @ padding + .endm + + .macro credits_entry number, text + .4byte \number + .4byte \text + .endm + + .macro door_anim_frame unknown, offset + .byte \unknown + .byte 0 @ padding + .2byte \offset + .endm + + .macro door_anim_gfx metatile_num, unknown, tile_addr, palette_addr + .2byte \metatile_num + .2byte \unknown + .4byte \tile_addr + .4byte \palette_addr + .endm + + .macro trainer_eye_trainer opp_1, opp_2, opp_3, opp_4, opp_5, map_name + .2byte OPPONENT_\opp_1 + .2byte OPPONENT_\opp_2 + .2byte OPPONENT_\opp_3 + .2byte OPPONENT_\opp_4 + .2byte OPPONENT_\opp_5 + .2byte GROUP_\map_name + .2byte MAP_\map_name + .space 2 + .endm + + .macro window_template bg, top, left, height, width, palno, baseBlock + .byte \bg, \top, \left, \height, \width, \palno + .2byte \baseBlock + .endm diff --git a/asm/macros/asm.inc b/asm/macros/asm.inc new file mode 100644 index 0000000..26b2707 --- /dev/null +++ b/asm/macros/asm.inc @@ -0,0 +1,17 @@ + .ifndef GUARD_ASM_MACROS_ASM_INC + .set GUARD_ASM_MACROS_ASM_INC, 1 + + .macro inc x + .set \x, \x + 1 + .endm + + .macro enum_start x=0 + .set __enum__, \x + .endm + + .macro enum constant + .equiv \constant, __enum__ + inc __enum__ + .endm + + .endif @ GUARD_ASM_MACROS_ASM_INC diff --git a/asm/macros/battle_ai_script.inc b/asm/macros/battle_ai_script.inc new file mode 100644 index 0000000..679e303 --- /dev/null +++ b/asm/macros/battle_ai_script.inc @@ -0,0 +1,554 @@ + .macro if_random_less_than percent, address + .byte 0x00 + .byte \percent + .4byte \address + .endm + + @ unused + .macro if_random_greater_than percent, address + .byte 0x01 + .byte \percent + .4byte \address + .endm + + @ unused + .macro if_random_equal address + .byte 0x02 + .4byte \address + .endm + + @ unused + .macro if_random_not_equal address + .byte 0x03 + .4byte \address + .endm + + .macro score score + .byte 0x04 + .byte \score + .endm + + .macro if_hp_less_than target, percent, address + .byte 0x05 + .byte \target + .byte \percent + .4byte \address + .endm + + .macro if_hp_more_than target, percent, address + .byte 0x06 + .byte \target + .byte \percent + .4byte \address + .endm + + .macro if_hp_equal target, percent, address + .byte 0x07 + .byte \target + .byte \percent + .4byte \address + .endm + + .macro if_hp_not_equal target, percent, address + .byte 0x08 + .byte \target + .byte \percent + .4byte \address + .endm + + .macro if_status target, status, address + .byte 0x09 + .byte \target + .4byte \status + .4byte \address + .endm + + .macro if_not_status target, status, address + .byte 0x0a + .byte \target + .4byte \status + .4byte \address + .endm + + .macro if_status2 target, status, address + .byte 0x0b + .byte \target + .4byte \status + .4byte \address + .endm + + .macro if_not_status2 target, status, address + .byte 0x0c + .byte \target + .4byte \status + .4byte \address + .endm + + .macro if_status3 target, status, address + .byte 0x0d + .byte \target + .4byte \status + .4byte \address + .endm + + .macro if_not_status3 target, status, address + .byte 0x0e + .byte \target + .4byte \status + .4byte \address + .endm + + .macro if_status4 target, status, address + .byte 0x0f + .byte \target + .4byte \status + .4byte \address + .endm + + .macro if_not_status4 target, status, address + .byte 0x10 + .byte \target + .4byte \status + .4byte \address + .endm + + .macro if_less_than value, address + .byte 0x11 + .byte \value + .4byte \address + .endm + + .macro if_more_than value, address + .byte 0x12 + .byte \value + .4byte \address + .endm + + .macro if_equal value, address + .byte 0x13 + .byte \value + .4byte \address + .endm + + .macro if_not_equal value, address + .byte 0x14 + .byte \value + .4byte \address + .endm + + .macro if_less_than_32 value, address + .byte 0x15 + .4byte \value + .4byte \address + .endm + + .macro if_more_than_32 value, address + .byte 0x16 + .4byte \value + .4byte \address + .endm + + .macro if_equal_32 value, address + .byte 0x17 + .4byte \value + .4byte \address + .endm + + .macro if_not_equal_32 value, address + .byte 0x18 + .4byte \value + .4byte \address + .endm + + .macro if_move move, address + .byte 0x19 + .2byte \move + .4byte \address + .endm + + .macro if_not_move move, address + .byte 0x1a + .2byte \move + .4byte \address + .endm + + .macro if_in_bytes list, address + .byte 0x1b + .4byte \list + .4byte \address + .endm + + .macro if_not_in_bytes list, address + .byte 0x1c + .4byte \list + .4byte \address + .endm + + .macro if_in_words list, address + .byte 0x1d + .4byte \list + .4byte \address + .endm + + .macro if_not_in_words list, address + .byte 0x1e + .4byte \list + .4byte \address + .endm + + .macro if_user_can_damage address + .byte 0x1f + .4byte \address + .endm + + .macro if_user_cant_damage address + .byte 0x20 + .4byte \address + .endm + + .macro get_turn_count + .byte 0x21 + .endm + + .macro get_type byte + .byte 0x22 + .byte \byte + .endm + + @ unused + .macro get_move_power + .byte 0x23 + .endm + + .macro is_most_powerful_move + .byte 0x24 + .endm + + .macro get_move target + .byte 0x25 + .byte \target + .endm + + .macro if_arg_equal type, address + .byte 0x26 + .byte \type + .4byte \address + .endm + + @ unused + .macro if_arg_not_equal type, address + .byte 0x27 + .byte \type + .4byte \address + .endm + + .macro if_would_go_first target, address + .byte 0x28 + .byte \target + .4byte \address + .endm + + .macro if_would_not_go_first target, address + .byte 0x29 + .byte \target + .4byte \address + .endm + + @ nullsub + .macro ai_2a + .byte 0x2a + .endm + + @ nullsub + .macro ai_2b + .byte 0x2b + .endm + + .macro count_alive_pokemon target + .byte 0x2c + .byte \target + .endm + + @ unused + .macro get_considered_move + .byte 0x2d + .endm + + .macro get_effect + .byte 0x2e + .endm + + .macro get_ability target + .byte 0x2f + .byte \target + .endm + + @ unused + .macro get_highest_possible_damage + .byte 0x30 + .endm + + .macro if_damage_bonus value, address + .byte 0x31 + .byte \value + .4byte \address + .endm + + @ nullsub + .macro ai_32 + .byte 0x32 + .endm + + @ nullsub + .macro ai_33 + .byte 0x33 + .endm + + .macro if_status_in_party target, status, address + .byte 0x34 + .byte \target + .4byte \status + .4byte \address + .endm + + @ bugged + .macro if_status_not_in_party target, status, address + .byte 0x35 + .byte \target + .4byte \status + .4byte \address + .endm + + .macro get_weather + .byte 0x36 + .endm + + .macro if_effect byte, address + .byte 0x37 + .byte \byte + .4byte \address + .endm + + .macro if_not_effect byte, address + .byte 0x38 + .byte \byte + .4byte \address + .endm + + .macro if_stat_level_less_than target, stat, level, address + .byte 0x39 + .byte \target + .byte \stat + .byte \level + .4byte \address + .endm + + .macro if_stat_level_more_than target, stat, level, address + .byte 0x3a + .byte \target + .byte \stat + .byte \level + .4byte \address + .endm + + .macro if_stat_level_equal target, stat, level, address + .byte 0x3b + .byte \target + .byte \stat + .byte \level + .4byte \address + .endm + + .macro if_stat_level_not_equal target, stat, level, address + .byte 0x3c + .byte \target + .byte \stat + .byte \level + .4byte \address + .endm + + .macro if_can_faint address + .byte 0x3d + .4byte \address + .endm + + .macro if_cant_faint address + .byte 0x3e + .4byte \address + .endm + + @ unused + .macro if_has_move, target, move, address + .byte 0x3f + .byte \target + .2byte \move + .4byte \address + .endm + + @ unused + .macro if_dont_have_move, target, move, address + .byte 0x40 + .byte \target + .2byte \move + .4byte \address + .endm + + .macro if_move_effect target, effect, address + .byte 0x41 + .byte \target + .byte \effect + .4byte \address + .endm + + .macro if_not_move_effect target, effect, address + .byte 0x42 + .byte \target + .byte \effect + .4byte \address + .endm + + .macro if_last_move_did_damage target, byte, address + .byte 0x43 + .byte \target + .byte \byte + .4byte \address + .endm + + .macro if_encored target, address + .byte 0x44 + .byte \target + .4byte \address + .endm + + .macro flee + .byte 0x45 + .endm + + .macro if_random_100 address + .byte 0x46 + .4byte \address + .endm + + .macro watch + .byte 0x47 + .endm + + .macro get_hold_effect target + .byte 0x48 + .byte \target + .endm + + .macro get_gender target + .byte 0x49 + .byte \target + .endm + + .macro is_first_turn target + .byte 0x4a + .byte \target + .endm + + .macro get_stockpile_count target + .byte 0x4b + .byte \target + .endm + + .macro is_double_battle + .byte 0x4c + .endm + + .macro get_item target + .byte 0x4d + .byte \target + .endm + + .macro get_move_type_from_result + .byte 0x4e + .endm + + .macro get_move_power_from_result + .byte 0x4f + .endm + + .macro get_move_effect_from_result + .byte 0x50 + .endm + + .macro get_protect_count target + .byte 0x51 + .byte \target + .endm + + @ nullsub + .macro ai_52 + .byte 0x52 + .endm + + @ nullsub + .macro ai_53 + .byte 0x53 + .endm + + @ nullsub + .macro ai_54 + .byte 0x54 + .endm + + @ nullsub + .macro ai_55 + .byte 0x55 + .endm + + @ nullsub + .macro ai_56 + .byte 0x56 + .endm + + @ nullsub + .macro ai_57 + .byte 0x57 + .endm + + @ unused + .macro call address + .byte 0x58 + .4byte \address + .endm + + .macro jump address + .byte 0x59 + .4byte \address + .endm + + .macro end + .byte 0x5a + .endm + + .macro if_level_cond cond, address + .byte 0x5b + .byte \cond + .4byte \address + .endm + + .macro if_user_higher_level address + if_level_cond 0, \address + .endm + + .macro if_target_higher_level address + if_level_cond 1, \address + .endm + + .macro if_equal_levels address + if_level_cond 2, \address + .endm + + @ unused + .macro if_taunted address + .byte 0x5c + .4byte \address + .endm + + .macro if_not_taunted address + .byte 0x5d + .4byte \address + .endm diff --git a/asm/macros/battle_anim.inc b/asm/macros/battle_anim.inc new file mode 100644 index 0000000..4ff8450 --- /dev/null +++ b/asm/macros/battle_anim.inc @@ -0,0 +1,266 @@ + .macro loadsprite id + .byte 0x00 + .2byte \id + .endm + + .macro unloadsprite id + .byte 0x01 + .2byte \id + .endm + + .macro sprite template, priority, argv:vararg + .byte 0x02 + .4byte \template + .byte \priority + .byte (.Lsprite_\@_2 - .Lsprite_\@_1) / 2 +.Lsprite_\@_1: + .2byte \argv +.Lsprite_\@_2: + .endm + + .macro createtask addr, priority, argv:vararg + .byte 0x03 + .4byte \addr + .byte \priority + .byte (.Lcreatetask_\@_2 - .Lcreatetask_\@_1) / 2 +.Lcreatetask_\@_1: + .2byte \argv +.Lcreatetask_\@_2: + .endm + + .macro pause delay + .byte 0x04 + .byte \delay + .endm + + .macro wait + .byte 0x05 + .endm + + .macro hang1 + .byte 0x06 + .endm + + .macro hang2 + .byte 0x07 + .endm + + .macro end + .byte 0x08 + .endm + + .macro playse id + .byte 0x09 + .2byte \id + .endm + + .macro monbg which + .byte 0x0A + .byte \which + .endm + + .macro clearmonbg which + .byte 0x0B + .byte \which + .endm + + .macro setalpha eva, evb + .byte 0x0C + .2byte ((\evb) << 8) | (\eva) + .endm + + .macro blendoff + .byte 0x0D + .endm + + .macro call addr + .byte 0x0E + .4byte \addr + .endm + + .macro ret + .byte 0x0F + .endm + + .macro setvar var_num, value + .byte 0x10 + .byte \var_num + .2byte \value + .endm + + .macro ifelse addr1, addr2 + .byte 0x11 + .4byte \addr1 + .4byte \addr2 + .endm + + .macro jumpif cond, addr + .byte 0x12 + .byte \cond + .4byte \addr + .endm + + .macro jump addr + .byte 0x13 + .4byte \addr + .endm + + .macro fadetobg id + .byte 0x14 + .byte \id + .endm + + .macro restorebg + .byte 0x15 + .endm + + .macro waitbgfadeout + .byte 0x16 + .endm + + .macro waitbgfadein + .byte 0x17 + .endm + + .macro changebg id + .byte 0x18 + .byte \id + .endm + + .macro panse_19 id, pan + .byte 0x19 + .2byte \id + .byte \pan + .endm + + .macro setpan pan + .byte 0x1A + .byte \pan + .endm + + .macro panse_1B id, pan_start, pan_end, step, delay + .byte 0x1B + .2byte \id + .byte \pan_start + .byte \pan_end + .byte \step + .byte \delay + .endm + + .macro panse_1C id, pan, delay, count + .byte 0x1C + .2byte \id + .byte \pan + .byte \delay + .byte \count + .endm + + .macro panse_1D id, pan, count + .byte 0x1D + .2byte \id + .byte \pan + .byte \count + .endm + + .macro setbldcnt bldcnt + .byte 0x1E + .2byte \bldcnt + .endm + + .macro createtask_1F addr, argv:vararg + .byte 0x1F + .4byte \addr + .byte (.Lcreatetask_1F_\@_2 - .Lcreatetask_1F_\@_1) / 2 +.Lcreatetask_1F_\@_1: + .2byte \argv +.Lcreatetask_1F_\@_2: + .endm + + .macro waitsound + .byte 0x20 + .endm + + .macro jumpvareq var_num, value, addr + .byte 0x21 + .byte \var_num + .2byte \value + .4byte \addr + .endm + + .macro monbg_22 unk + .byte 0x22 + .byte \unk + .endm + + .macro clearmonbg_23 unk + .byte 0x23 + .byte \unk + .endm + + .macro jumpunkcond addr + .byte 0x24 + .4byte \addr + .endm + + .macro fadetobg_25 a, b, c + .byte 0x25 + .byte \a + .byte \b + .byte \c + .endm + + .macro panse_26 id, pan_start, pan_end, step, delay + .byte 0x26 + .2byte \id + .byte \pan_start + .byte \pan_end + .byte \step + .byte \delay + .endm + + .macro panse_27 id, pan_start, pan_end, step, delay + .byte 0x27 + .2byte \id + .byte \pan_start + .byte \pan_end + .byte \step + .byte \delay + .endm + + .macro monbgprio_28 unk + .byte 0x28 + .byte \unk + .endm + + .macro monbgprio_29 + .byte 0x29 + .endm + + .macro monbgprio_2A unk + .byte 0x2A + .byte \unk + .endm + + .macro invisible side + .byte 0x2B + .byte \side + .endm + + .macro visible side + .byte 0x2C + .byte \side + .endm + + .macro doublebattle_2D unk + .byte 0x2D + .byte \unk + .endm + + .macro doublebattle_2E unk + .byte 0x2E + .byte \unk + .endm + + .macro stopsound + .byte 0x2F + .endm diff --git a/asm/macros/battle_script.inc b/asm/macros/battle_script.inc new file mode 100644 index 0000000..5dd1d5a --- /dev/null +++ b/asm/macros/battle_script.inc @@ -0,0 +1,1228 @@ +@ 0 == +@ 1 != +@ 2 < +@ 3 > +@ 4 &= + + .macro calculatedamage + critical + atk5 + atk6 + atk7 + .endm + + + .macro attackcanceler + .byte 0x00 + .endm + + .macro accuracycheck address, param1 + .byte 0x01 + .4byte \address + .2byte \param1 + .endm + + .macro attackstring + .byte 0x02 + .endm + + .macro ppreduce + .byte 0x03 + .endm + + .macro critcalc + .byte 0x04 + .endm + + .macro atk5 + .byte 0x05 + .endm + + .macro atk6 + .byte 0x06 + .endm + + .macro atk7 + .byte 0x07 + .endm + + .macro atk8 + .byte 0x08 + .endm + + .macro attackanimation + .byte 0x09 + .endm + + .macro waitanimation + .byte 0x0a + .endm + + .macro graphicalhpupdate bank + .byte 0x0b + .byte \bank + .endm + + .macro datahpupdate bank + .byte 0x0c + .byte \bank + .endm + + .macro critmessage + .byte 0x0d + .endm + + .macro missmessage + .byte 0x0e + .endm + + .macro resultmessage + .byte 0x0f + .endm + + .macro printstring string + .byte 0x10 + .2byte \string + .endm + + .macro printstring2 string + .byte 0x11 + .2byte \string + .endm + + .macro waitmessage delay + .byte 0x12 + .2byte \delay + .endm + + .macro printfromtable table + .byte 0x13 + .4byte \table + .endm + + .macro printfromtable2 table + .byte 0x14 + .4byte \table + .endm + + .macro seteffectwithchancetarget + .byte 0x15 + .endm + + .macro seteffecttarget + .byte 0x16 + .endm + + .macro seteffectuser + .byte 0x17 + .endm + + .macro clearstatus bank + .byte 0x18 + .byte \bank + .endm + + .macro faintpokemon bank, param2, param3 + .byte 0x19 + .byte \bank + .byte \param2 + .4byte \param3 + .endm + + .macro atk1a param1 + .byte 0x1a + .byte \param1 + .endm + + .macro atk1b bank + .byte 0x1b + .byte \bank + .endm + + .macro jumpifstatus bank, status, address + .byte 0x1c + .byte \bank + .4byte \status + .4byte \address + .endm + + .macro jumpifsecondarytstatus bank, status, address + .byte 0x1d + .byte \bank + .4byte \status + .4byte \address + .endm + + .macro jumpifability bank, ability, address + .byte 0x1e + .byte \bank + .byte \ability + .4byte \address + .endm + + .macro jumpifhalverset bank, status, address + .byte 0x1f + .byte \bank + .2byte \status + .4byte \address + .endm + + .macro jumpifstat bank, flag, quantity, statid, address + .byte 0x20 + .byte \bank + .byte \flag + .byte \quantity + .byte \statid + .4byte \address + .endm + + .macro jumpifspecialstatusflag bank, mask, status, address + .byte 0x21 + .byte \bank + .4byte \mask + .byte \status + .4byte \address + .endm + + .macro jumpiftype bank, type, address + .byte 0x22 + .byte \bank + .byte \type + .4byte \address + .endm + + .macro atk23 bank + .byte 0x23 + .byte \bank + .endm + + .macro atk24 address + .byte 0x24 + .4byte \address + .endm + + .macro atk25 + .byte 0x25 + .endm + + .macro atk26 param1 + .byte 0x26 + .byte \param1 + .endm + + .macro atk27 address + .byte 0x27 + .4byte \address + .endm + + .macro jump address + .byte 0x28 + .4byte \address + .endm + + .macro jumpifbyte ifflag, checkaddr, compare, address + .byte 0x29 + .byte \ifflag + .4byte \checkaddr + .byte \compare + .4byte \address + .endm + + .macro jumpifhalfword ifflag, checkaddr, compare, address + .byte 0x2a + .byte \ifflag + .4byte \checkaddr + .2byte \compare + .4byte \address + .endm + + .macro jumpifword ifflag, checkaddr, compare, address + .byte 0x2b + .byte \ifflag + .4byte \checkaddr + .4byte \compare + .4byte \address + .endm + + .macro jumpifarrayequal mem1, mem2, size, address + .byte 0x2c + .4byte \mem1 + .4byte \mem2 + .byte \size + .4byte \address + .endm + + .macro jumpifarraynotequal mem1, mem2, size, address + .byte 0x2d + .4byte \mem1 + .4byte \mem2 + .byte \size + .4byte \address + .endm + + .macro setbyte pointer, value + .byte 0x2e + .4byte \pointer + .byte \value + .endm + + .macro addbyte pointer, value + .byte 0x2f + .4byte \pointer + .byte \value + .endm + + .macro subtractbyte pointer, value + .byte 0x30 + .4byte \pointer + .byte \value + .endm + + .macro copyarray destination, source, size + .byte 0x31 + .4byte \destination + .4byte \source + .byte \size + .endm + + .macro atk32 param1, param2, param3, byte + .byte 0x32 + .4byte \param1 + .4byte \param2 + .4byte \param3 + .byte \byte + .endm + + .macro orbyte pointer, value + .byte 0x33 + .4byte \pointer + .byte \value + .endm + + .macro orhalfword pointer, value + .byte 0x34 + .4byte \pointer + .2byte \value + .endm + + .macro orword pointer, value + .byte 0x35 + .4byte \pointer + .4byte \value + .endm + + .macro bicbyte pointer, value + .byte 0x36 + .4byte \pointer + .byte \value + .endm + + .macro bichalfword pointer, value + .byte 0x37 + .4byte \pointer + .2byte \value + .endm + + .macro bicword pointer, value + .byte 0x38 + .4byte \pointer + .4byte \value + .endm + + .macro pause pause_duration + .byte 0x39 + .2byte \pause_duration + .endm + + .macro waitstateatk + .byte 0x3a + .endm + + .macro somethinghealatk3b bank + .byte 0x3b + .byte \bank + .endm + + .macro return + .byte 0x3c + .endm + + .macro end + .byte 0x3d + .endm + + .macro end2 + .byte 0x3e + .endm + + .macro end3 + .byte 0x3f + .endm + + .macro atk40 address + .byte 0x40 + .4byte \address + .endm + + .macro callatk address + .byte 0x41 + .4byte \address + .endm + + .macro jumpiftype2 bank, type, address + .byte 0x42 + .byte \bank + .byte \type + .4byte \address + .endm + + .macro jumpifabilitypresent ability, address + .byte 0x43 + .byte \ability + .4byte \address + .endm + + .macro atk44 + .byte 0x44 + .endm + + .macro playanimation bank, animation, var_address + .byte 0x45 + .byte \bank + .byte \animation + .4byte \var_address + .endm + + .macro atk46 bank, address, int + .byte 0x46 + .byte \bank + .4byte \address + .4byte \int + .endm + + .macro atk47 + .byte 0x47 + .endm + + .macro playstatchangeanimation bank, color, byte + .byte 0x48 + .byte \bank + .byte \color + .byte \byte + .endm + + .macro atk49 byte1, byte2 + .byte 0x49 + .byte \byte1 + .byte \byte2 + .endm + + .macro damagecalc2 + .byte 0x4a + .endm + + .macro atk4b + .byte 0x4b + .endm + + .macro switch1 bank + .byte 0x4c + .byte \bank + .endm + + .macro switch2 bank + .byte 0x4d + .byte \bank + .endm + + .macro switch3 bank, byte + .byte 0x4e + .byte \bank + .byte \byte + .endm + + .macro jumpifcannotswitch bank, address + .byte 0x4f + .byte \bank + .4byte \address + .endm + + .macro openpartyscreen bank, address + .byte 0x50 + .byte \bank + .4byte \address + .endm + + .macro atk51 bank, param2 + .byte 0x51 + .byte \bank + .byte \param2 + .endm + + .macro atk52 bank + .byte 0x52 + .byte \bank + .endm + + .macro atk53 bank + .byte 0x53 + .byte \bank + .endm + + .macro atk54 word + .byte 0x54 + .2byte \word + .endm + + .macro atk55 int + .byte 0x55 + .4byte \int + .endm + + .macro atk56 bank_or_side + .byte 0x56 + .byte \bank_or_side + .endm + + .macro atk57 + .byte 0x57 + .endm + + .macro atk58 bank + .byte 0x58 + .byte \bank + .endm + + .macro checkiflearnmoveinbattle param1, param2, bank_maybe + .byte 0x59 + .4byte \param1 + .4byte \param2 + .byte \bank_maybe + .endm + + .macro atk5a address + .byte 0x5a + .4byte \address + .endm + + .macro atk5b address + .byte 0x5b + .4byte \address + .endm + + .macro atk5c bank + .byte 0x5c + .byte \bank + .endm + + .macro atk5d + .byte 0x5d + .endm + + .macro atk5e bank + .byte 0x5e + .byte \bank + .endm + + .macro atk5f + .byte 0x5f + .endm + + .macro atk60 byte + .byte 0x60 + .byte \byte + .endm + + .macro atk61 bank_or_side + .byte 0x61 + .byte \bank_or_side + .endm + + .macro atk62 bank_or_side + .byte 0x62 + .byte \bank_or_side + .endm + + .macro jumptoattack bank + .byte 0x63 + .byte \bank + .endm + + .macro statusanimation bank + .byte 0x64 + .byte \bank + .endm + + .macro atk65 bank_or_side, address + .byte 0x65 + .byte \bank_or_side + .4byte \address + .endm + + .macro atk66 bank_or_side, bank_or_side2, address + .byte 0x66 + .byte \bank_or_side + .byte \bank_or_side2 + .4byte \address + .endm + + .macro atk67 + .byte 0x67 + .endm + + .macro atk68 + .byte 0x68 + .endm + + .macro atk69 + .byte 0x69 + .endm + + .macro removeitem bank + .byte 0x6a + .byte \bank + .endm + + .macro atk6b + .byte 0x6b + .endm + + .macro atk6c + .byte 0x6c + .endm + + .macro atk6d + .byte 0x6d + .endm + + .macro atk6e + .byte 0x6e + .endm + + .macro atk6f bank + .byte 0x6f + .byte \bank + .endm + + .macro atk70 bank + .byte 0x70 + .byte \bank + .endm + + .macro atk71 + .byte 0x71 + .endm + + .macro atk72 address + .byte 0x72 + .4byte \address + .endm + + .macro atk73 bank + .byte 0x73 + .byte \bank + .endm + + .macro atk74 bank + .byte 0x74 + .byte \bank + .endm + + .macro atk75 + .byte 0x75 + .endm + + .macro atk76 bank, byte + .byte 0x76 + .byte \bank + .byte \byte + .endm + + .macro setprotect + .byte 0x77 + .endm + + .macro faintifabilitynotdamp + .byte 0x78 + .endm + + .macro setuserhptozero + .byte 0x79 + .endm + + .macro jumpwhiletargetvalid address + .byte 0x7a + .4byte \address + .endm + + .macro setdamageasrestorehalfmaxhp address, byte + .byte 0x7b + .4byte \address + .byte \byte + .endm + + .macro jumptolastusedattack + .byte 0x7c + .endm + + .macro setrain + .byte 0x7d + .endm + + .macro setreflect + .byte 0x7e + .endm + + .macro setleechseed + .byte 0x7f + .endm + + .macro manipulatedamage id + .byte 0x80 + .byte \id + .endm + + .macro setrest address + .byte 0x81 + .4byte \address + .endm + + .macro jumpifnotfirstturn address + .byte 0x82 + .4byte \address + .endm + + .macro nop3 + .byte 0x83 + .endm + + .macro jumpifcannotsleep address + .byte 0x84 + .4byte \address + .endm + + .macro stockpile + .byte 0x85 + .endm + + .macro stockpiletobasedamage address + .byte 0x86 + .4byte \address + .endm + + .macro stockpiletohprecovery address + .byte 0x87 + .4byte \address + .endm + + .macro negativedamage + .byte 0x88 + .endm + + .macro statbuffchange target, address + .byte 0x89 + .byte \target + .4byte \address + .endm + + .macro normalisebuffs + .byte 0x8a + .endm + + .macro setbide + .byte 0x8b + .endm + + .macro confuseifrepeatingattackends + .byte 0x8c + .endm + + .macro setloopcounter count + .byte 0x8d + .byte \count + .endm + + .macro atk8e + .byte 0x8e + .endm + + .macro forcerandomswitch address + .byte 0x8f + .4byte \address + .endm + + .macro changetypestoenemyattacktype address + .byte 0x90 + .4byte \address + .endm + + .macro givemoney + .byte 0x91 + .endm + + .macro setlightscreen + .byte 0x92 + .endm + + .macro koplussomethings address + .byte 0x93 + .4byte \address + .endm + + .macro gethalfcurrentenemyhp + .byte 0x94 + .endm + + .macro setsandstorm + .byte 0x95 + .endm + + .macro weatherdamage + .byte 0x96 + .endm + + .macro tryinfatuatetarget address + .byte 0x97 + .4byte \address + .endm + + .macro atk98 byte + .byte 0x98 + .byte \byte + .endm + + .macro setmisteffect + .byte 0x99 + .endm + + .macro setincreasedcriticalchance + .byte 0x9a + .endm + + .macro transformdataexecution + .byte 0x9b + .endm + + .macro setsubstituteeffect + .byte 0x9c + .endm + + .macro copyattack address + .byte 0x9d + .4byte \address + .endm + + .macro metronomeeffect + .byte 0x9e + .endm + + .macro nightshadedamageeffect + .byte 0x9f + .endm + + .macro psywavedamageeffect + .byte 0xa0 + .endm + + .macro counterdamagecalculator address + .byte 0xa1 + .4byte \address + .endm + + .macro mirrorcoatdamagecalculator address + .byte 0xa2 + .4byte \address + .endm + + .macro disablelastusedattack address + .byte 0xa3 + .4byte \address + .endm + + .macro setencore address + .byte 0xa4 + .4byte \address + .endm + + .macro painsplitdamagecalculator address + .byte 0xa5 + .4byte \address + .endm + + .macro settypetorandomresistance address + .byte 0xa6 + .4byte \address + .endm + + .macro setalwayshitflag + .byte 0xa7 + .endm + + .macro copymovepermanently address + .byte 0xa8 + .4byte \address + .endm + + .macro selectrandommovefromusermoves address + .byte 0xa9 + .4byte \address + .endm + + .macro destinybondeffect + .byte 0xaa + .endm + + .macro atkab + .byte 0xab + .endm + + .macro remaininghptopower + .byte 0xac + .endm + + .macro reducepprandom address + .byte 0xad + .4byte \address + .endm + + .macro clearstatusifnotsoundproofed + .byte 0xae + .endm + + .macro cursetarget address + .byte 0xaf + .4byte \address + .endm + + .macro setspikes address + .byte 0xb0 + .4byte \address + .endm + + .macro setforesight + .byte 0xb1 + .endm + + .macro setperishsong address + .byte 0xb2 + .4byte \address + .endm + + .macro rolloutdamagecalculation + .byte 0xb3 + .endm + + .macro jumpifconfusedandattackmaxed bank, address + .byte 0xb4 + .byte \bank + .4byte \address + .endm + + .macro furycutterdamagecalculation + .byte 0xb5 + .endm + + .macro happinesstodamagecalculation + .byte 0xb6 + .endm + + .macro presentdamagecalculation + .byte 0xb7 + .endm + + .macro setsafeguard + .byte 0xb8 + .endm + + .macro magnitudedamagecalculation + .byte 0xb9 + .endm + + .macro atkba address + .byte 0xba + .4byte \address + .endm + + .macro setsunny + .byte 0xbb + .endm + + .macro maxattackhalvehp address + .byte 0xbc + .4byte \address + .endm + + .macro copyfoestats address + .byte 0xbd + .4byte \address + .endm + + .macro breakfree + .byte 0xbe + .endm + + .macro setcurled + .byte 0xbf + .endm + + .macro recoverbasedonsunlight address + .byte 0xc0 + .4byte \address + .endm + + .macro hiddenpowerdamagecalculation + .byte 0xc1 + .endm + + .macro selectnexttarget + .byte 0xc2 + .endm + + .macro setfutureattack address + .byte 0xc3 + .4byte \address + .endm + + .macro beatupcalculation address1, address2 + .byte 0xc4 + .4byte \address1 + .4byte \address2 + .endm + + .macro hidepreattack + .byte 0xc5 + .endm + + .macro unhidepostattack + .byte 0xc6 + .endm + + .macro setminimize + .byte 0xc7 + .endm + + .macro sethail + .byte 0xc8 + .endm + + .macro jumpifattackandspecialattackcannotfall address + .byte 0xc9 + .4byte \address + .endm + + .macro setforcedtarget + .byte 0xca + .endm + + .macro setcharge + .byte 0xcb + .endm + + .macro callterrainattack + .byte 0xcc + .endm + + .macro cureifburnedparalysedorpoisoned address + .byte 0xcd + .4byte \address + .endm + + .macro settorment address + .byte 0xce + .4byte \address + .endm + + .macro jumpifnodamage address + .byte 0xcf + .4byte \address + .endm + + .macro settaunt address + .byte 0xd0 + .4byte \address + .endm + + .macro sethelpinghand address + .byte 0xd1 + .4byte \address + .endm + + .macro itemswap address + .byte 0xd2 + .4byte \address + .endm + + .macro copyability address + .byte 0xd3 + .4byte \address + .endm + + .macro atkd4 byte, address + .byte 0xd4 + .byte \byte + .4byte \address + .endm + + .macro setroots address + .byte 0xd5 + .4byte \address + .endm + + .macro doubledamagedealtifdamaged + .byte 0xd6 + .endm + + .macro setyawn address + .byte 0xd7 + .4byte \address + .endm + + .macro setdamagetohealthdifference address + .byte 0xd8 + .4byte \address + .endm + + .macro scaledamagebyhealthratio + .byte 0xd9 + .endm + + .macro abilityswap address + .byte 0xda + .4byte \address + .endm + + .macro imprisoneffect address + .byte 0xdb + .4byte \address + .endm + + .macro setgrudge address + .byte 0xdc + .4byte \address + .endm + + .macro weightdamagecalculation + .byte 0xdd + .endm + + .macro assistattackselect address + .byte 0xde + .4byte \address + .endm + + .macro setmagiccoat address + .byte 0xdf + .4byte \address + .endm + + .macro setstealstatchange address + .byte 0xe0 + .4byte \address + .endm + + .macro atke1 address + .byte 0xe1 + .4byte \address + .endm + + .macro atke2 bank + .byte 0xe2 + .byte \bank + .endm + + .macro jumpiffainted bank, address + .byte 0xe3 + .byte \bank + .4byte \address + .endm + + .macro naturepowereffect + .byte 0xe4 + .endm + + .macro pickupitemcalculation + .byte 0xe5 + .endm + + .macro actualcastformswitch + .byte 0xe6 + .endm + + .macro castformswitch + .byte 0xe7 + .endm + + .macro settypebasedhalvers address + .byte 0xe8 + .4byte \address + .endm + + .macro seteffectbyweather + .byte 0xe9 + .endm + + .macro recycleitem address + .byte 0xea + .4byte \address + .endm + + .macro settypetoterrain address + .byte 0xeb + .4byte \address + .endm + + .macro pursuitwhenswitched address + .byte 0xec + .4byte \address + .endm + + .macro snatchmove + .byte 0xed + .endm + + .macro removereflectlightscreen + .byte 0xee + .endm + + .macro pokemoncatchfunction + .byte 0xef + .endm + + .macro catchpoke + .byte 0xf0 + .endm + + .macro capturesomethingf1 address + .byte 0xf1 + .4byte \address + .endm + + .macro capturesomethingf2 + .byte 0xf2 + .endm + + .macro capturesomethingf3 address + .byte 0xf3 + .4byte \address + .endm + + .macro removehp + .byte 0xf4 + .endm + + .macro curestatusfirstword + .byte 0xf5 + .endm + + .macro atkf6 + .byte 0xf6 + .endm + + .macro activesidesomething + .byte 0xf7 + .endm + + .macro atkf8 bank + .byte 0xf8 + .byte \bank + .endm diff --git a/asm/macros/contest_ai_script.inc b/asm/macros/contest_ai_script.inc new file mode 100644 index 0000000..05d70e3 --- /dev/null +++ b/asm/macros/contest_ai_script.inc @@ -0,0 +1,506 @@ +@ Add a positive/negative value to the score of the move being evaluated. + + .macro score score + .byte 0x00 + .byte \score + .endm + +@ turn (AKA "Appeal No.") + + .macro get_turn + .byte 0x01 + .endm + + .macro if_turn_less_than param, addr + .byte 0x02 + .byte \param + .4byte \addr + .endm + + .macro if_turn_more_than param, addr + .byte 0x03 + .byte \param + .4byte \addr + .endm + + .macro if_turn_eq param, addr + .byte 0x04 + .byte \param + .4byte \addr + .endm + + .macro if_turn_not_eq param, addr + .byte 0x05 + .byte \param + .4byte \addr + .endm + +@ audience excitement + + .macro get_excitement + .byte 0x06 + .endm + + .macro if_excitement_less_than param, addr + .byte 0x07 + .byte \param + .4byte \addr + .endm + + .macro if_excitement_more_than param, addr + .byte 0x08 + .byte \param + .4byte \addr + .endm + + .macro if_excitement_eq param, addr + .byte 0x09 + .byte \param + .4byte \addr + .endm + + .macro if_excitement_not_eq param, addr + .byte 0x0A + .byte \param + .4byte \addr + .endm + +@ the order that the user goes in the current turn + + .macro get_user_order + .byte 0x0B + .endm + + .macro if_user_order_less_than param addr + .byte 0x0C + .byte \param + .4byte \addr + .endm + + .macro if_user_order_more_than param addr + .byte 0x0D + .byte \param + .4byte \addr + .endm + + .macro if_user_order_eq param addr + .byte 0x0E + .byte \param + .4byte \addr + .endm + + .macro if_user_order_not_eq param addr + .byte 0x0F + .byte \param + .4byte \addr + .endm + +@ user condition + + .macro get_user_condition + .byte 0x10 + .endm + + .macro if_user_condition_less_than param, addr + .byte 0x11 + .byte \param + .4byte \addr + .endm + + .macro if_user_condition_more_than param, addr + .byte 0x12 + .byte \param + .4byte \addr + .endm + + .macro if_user_condition_eq param, addr + .byte 0x13 + .byte \param + .4byte \addr + .endm + + .macro if_user_condition_not_eq param, addr + .byte 0x14 + .byte \param + .4byte \addr + .endm + +@ 15 +@ 16 +@ 17 +@ 18 +@ 19 +@ 1A +@ 1B +@ 1C +@ 1D +@ 1E + +@ contest type + + .macro get_contest_type + .byte 0x1F + .endm + + .macro if_contest_type_eq param, addr + .byte 0x20 + .byte \param + .4byte \addr + .endm + + .macro if_contest_type_not_eq param, addr + .byte 0x21 + .byte \param + .4byte \addr + .endm + +@ move excitement (change in excitement due to move) + + .macro get_move_excitement + .byte 0x22 + .endm + + .macro if_move_excitement_less_than param, addr + .byte 0x23 + .byte \param + .4byte \addr + .endm + + .macro if_move_excitement_more_than param, addr + .byte 0x24 + .byte \param + .4byte \addr + .endm + + .macro if_move_excitement_eq param, addr + .byte 0x25 + .byte \param + .4byte \addr + .endm + + .macro if_move_excitement_not_eq param, addr + .byte 0x26 + .byte \param + .4byte \addr + .endm + +@ move effect + + .macro get_effect + .byte 0x27 + .endm + + .macro if_effect_eq param, addr + .byte 0x28 + .byte \param + .4byte \addr + .endm + + .macro if_effect_not_eq param, addr + .byte 0x29 + .byte \param + .4byte \addr + .endm + +@ move effect type + + .macro get_effect_type + .byte 0x2A + .endm + + .macro if_effect_type_eq param, addr + .byte 0x2B + .byte \param + .4byte \addr + .endm + + .macro if_effect_type_not_eq param, addr + .byte 0x2C + .byte \param + .4byte \addr + .endm + +@ whether the current move is the most appealing in the user's moveset + + .macro check_most_appealing_move + .byte 0x2D + .endm + + .macro if_most_appealing_move addr + .byte 0x2E + .4byte \addr + .endm + +@ 2F +@ 30 +@ 31 +@ 32 +@ 33 +@ 34 +@ 35 +@ 36 +@ 37 +@ 38 +@ 39 +@ 3A + +@ number of times current move has been used + + .macro get_move_used_count + .byte 0x3B + .endm + + .macro if_move_used_count_less_than param, addr + .byte 0x3C + .byte \param + .4byte \addr + .endm + + .macro if_move_used_count_more_than param, addr + .byte 0x3D + .byte \param + .4byte \addr + .endm + + .macro if_move_used_count_eq param, addr + .byte 0x3E + .byte \param + .4byte \addr + .endm + + .macro if_move_used_count_not_eq param, addr + .byte 0x3F + .byte \param + .4byte \addr + .endm + +@ whether the current move is a combo starter (with another move in the moveset) + + .macro check_combo_starter + .byte 0x40 + .endm + + .macro if_combo_starter addr + .byte 0x41 + .4byte \addr + .endm + + .macro if_not_combo_starter addr + .byte 0x42 + .4byte \addr + .endm + +@ whether the current move is a combo finisher (with another move in the moveset) + + .macro check_combo_finisher + .byte 0x43 + .endm + + .macro if_combo_finisher addr + .byte 0x44 + .4byte \addr + .endm + + .macro if_not_combo_finisher addr + .byte 0x45 + .4byte \addr + .endm + +@ whether the current move would finish a combo + + .macro check_would_finish_combo + .byte 0x46 + .endm + + .macro if_would_finish_combo addr + .byte 0x47 + .4byte \addr + .endm + + .macro if_would_not_finish_combo addr + .byte 0x48 + .4byte \addr + .endm + +@ condition of mon (indexed by order) + + .macro get_condition mon + .byte 0x49 + .byte \mon + .endm + + .macro if_condition_less_than mon, value, addr + .byte 0x4A + .byte \mon + .byte \value + .4byte \addr + .endm + + .macro if_condition_more_than mon, value, addr + .byte 0x4B + .byte \mon + .byte \value + .4byte \addr + .endm + + .macro if_condition_eq mon, value, addr + .byte 0x4C + .byte \mon + .byte \value + .4byte \addr + .endm + + .macro if_condition_not_eq mon, value, addr + .byte 0x4D + .byte \mon + .byte \value + .4byte \addr + .endm + +@ whether the mon used a combo starter move +@ Even though this value is always 1 or 0 (i.e. TRUE/FALSE), +@ there are less-than and greater-than comparison operations for some reason. + + .macro get_used_combo_starter mon + .byte 0x4E + .byte \mon + .endm + + .macro if_used_combo_starter_less_than mon, value, addr + .byte 0x4F + .byte \mon + .byte \value + .4byte \addr + .endm + + .macro if_used_combo_starter_more_than mon, value, addr + .byte 0x50 + .byte \mon + .byte \value + .4byte \addr + .endm + + + .macro if_used_combo_starter_eq mon, value, addr + .byte 0x51 + .byte \mon + .byte \value + .4byte \addr + .endm + + .macro if_used_combo_starter_not_eq mon, value, addr + .byte 0x52 + .byte \mon + .byte \value + .4byte \addr + .endm + +@ whether the mon can make an appeal + + .macro check_can_participate mon + .byte 0x53 + .byte \mon + .endm + + .macro if_can_participate mon, addr + .byte 0x54 + .byte \mon + .4byte \addr + .endm + + .macro if_cannot_participate mon, addr + .byte 0x55 + .byte \mon + .4byte \addr + .endm + +@ 56 +@ 57 + + .macro contest_58 param addr + .byte 0x58 + .byte \param + .4byte \addr + .endm + +@ 59 +@ 5A +@ 5B +@ 5C +@ 5D +@ 5E +@ 5F +@ 60 +@ 61 +@ 62 +@ 63 +@ 64 +@ 65 +@ 66 +@ 67 +@ 68 +@ 69 +@ 6A +@ 6B +@ 6C +@ 6D +@ 6E +@ 6F +@ 70 +@ 71 +@ 72 +@ 73 +@ 74 +@ 75 +@ 76 +@ 77 +@ 78 +@ 79 +@ 7A +@ 7B +@ 7C + + .macro if_random param addr + .byte 0x7D + .byte \param + .4byte \addr + .endm + +@ 7E + + .macro jump addr + .byte 0x7F + .4byte \addr + .endm + + .macro call addr + .byte 0x80 + .4byte \addr + .endm + + .macro end + .byte 0x81 + .endm + + .macro check_user_has_exciting_move + .byte 0x82 + .endm + + .macro if_user_has_exciting_move addr + .byte 0x83 + .4byte \addr + .endm + + .macro if_user_doesnt_have_exciting_move addr + .byte 0x84 + .4byte \addr + .endm + +@ 85 +@ 86 + + .macro if_effect_in_user_moveset param addr + .byte 0x87 + .2byte \param + .4byte \addr + .endm diff --git a/asm/macros/ec.inc b/asm/macros/ec.inc new file mode 100644 index 0000000..d3fd45c --- /dev/null +++ b/asm/macros/ec.inc @@ -0,0 +1,8 @@ + + .macro ec_duplicates count + .2byte 0xff00 + \count + .endm + + .macro ec_words_by_letter label + .2byte (gEasyChatWordsByLetter_\label - gEasyChatWordsAlphabetized) / 2 + .endm diff --git a/asm/macros/event.inc b/asm/macros/event.inc new file mode 100644 index 0000000..7ce50a5 --- /dev/null +++ b/asm/macros/event.inc @@ -0,0 +1,1444 @@ + @ Does nothing. + .macro nop + .byte 0x00 + .endm + + @ Does nothing. + .macro nop1 + .byte 0x01 + .endm + + @ Terminates script execution. + .macro end + .byte 0x02 + .endm + + @ Jumps back to after the last-executed call statement, and continues script execution from there. + .macro return + .byte 0x03 + .endm + + @ Jumps to destination and continues script execution from there. The location of the calling script is remembered and can be returned to later. + .macro call destination + .byte 0x04 + .4byte \destination + .endm + + @ Jumps to destination and continues script execution from there. + .macro goto destination + .byte 0x05 + .4byte \destination + .endm + + @ If the result of the last comparison matches condition (see Comparison operators), jumps to destination and continues script execution from there. + .macro goto_if condition, destination + .byte 0x06 + .byte \condition + .4byte \destination + .endm + + @ If the result of the last comparison matches condition (see Comparison operators), calls destination. + .macro call_if condition, destination + .byte 0x07 + .byte \condition + .4byte \destination + .endm + + @ Jumps to the standard function at index function. + .macro gotostd function + .byte 0x08 + .byte \function + .endm + + @ Calls the standard function at index function. + .macro callstd function + .byte 0x09 + .byte \function + .endm + + @ If the result of the last comparison matches condition (see Comparison operators), jumps to the standard function at index function. + .macro gotostd_if condition, function + .byte 0x0a + .byte \condition + .byte \function + .endm + + @ If the result of the last comparison matches condition (see Comparison operators), calls the standard function at index function. + .macro callstd_if condition, function + .byte 0x0b + .byte \condition + .byte \function + .endm + + @ Executes a script stored in a default RAM location. + .macro gotoram + .byte 0x0c + .endm + + @ Terminates script execution and "resets the script RAM". + .macro killscript + .byte 0x0d + .endm + + @ Sets mystery event status + .macro setmysteryeventstatus value + .byte 0x0e + .byte \value + .endm + + @ Sets the specified script bank to immediate value. + .macro loadword destination, value + .byte 0x0f + .byte \destination + .4byte \value + .endm + + @ Sets the specified script bank to immediate value. + .macro loadbyte destination, value + .byte 0x10 + .byte \destination + .byte \value + .endm + + @ Sets the byte at offset to value. + .macro writebytetoaddr value, offset + .byte 0x11 + .byte \value + .4byte \offset + .endm + + @ Copies the byte value at source into the specified script bank. + .macro loadbytefromaddr destination, source + .byte 0x12 + .byte \destination + .4byte \source + .endm + + @ Not sure. Judging from XSE's description I think it takes the least-significant byte in bank source and writes it to destination. + .macro setptrbyte source, destination + .byte 0x13 + .byte \source + .4byte \destination + .endm + + @ Copies the contents of bank source into bank destination. + .macro copylocal destination, source + .byte 0x14 + .byte \destination + .byte \source + .endm + + @ Copies the byte at source to destination, replacing whatever byte was previously there. + .macro copybyte destination, source + .byte 0x15 + .4byte \destination + .4byte \source + .endm + + @ Changes the value of destination to value. + .macro setvar destination, value + .byte 0x16 + .2byte \destination + .2byte \value + .endm + + @ Changes the value of destination by adding value to it. Overflow is not prevented (0xFFFF + 1 = 0x0000). + .macro addvar destination, value + .byte 0x17 + .2byte \destination + .2byte \value + .endm + + @ Changes the value of destination by subtracting value to it. Overflow is not prevented (0x0000 - 1 = 0xFFFF). + .macro subvar destination, value + .byte 0x18 + .2byte \destination + .2byte \value + .endm + + @ Copies the value of source into destination. + .macro copyvar destination, source + .byte 0x19 + .2byte \destination + .2byte \source + .endm + + @ If source is not a variable, then this function acts like setvar. Otherwise, it acts like copyvar. + .macro setorcopyvar destination, source + .byte 0x1a + .2byte \destination + .2byte \source + .endm + + @ Compares the values of script banks a and b, after forcing the values to bytes. + .macro compare_local_to_local byte1, byte2 + .byte 0x1b + .byte \byte1 + .byte \byte2 + .endm + + @ Compares the least-significant byte of the value of script bank a to a fixed byte value (b). + .macro compare_local_to_value a, b + .byte 0x1c + .byte \a + .byte \b + .endm + + @ Compares the least-significant byte of the value of script bank a to the byte located at offset b. + .macro compare_local_to_addr a, b + .byte 0x1d + .byte \a + .4byte \b + .endm + + @ Compares the byte located at offset a to the least-significant byte of the value of script bank b. + .macro compare_addr_to_local a, b + .byte 0x1e + .4byte \a + .byte \b + .endm + + @ Compares the byte located at offset a to a fixed byte value (b). + .macro compare_addr_to_value a, b + .byte 0x1f + .4byte \a + .byte \b + .endm + + @ Compares the byte located at offset a to the byte located at offset b. + .macro compare_addr_to_addr a, b + .byte 0x20 + .4byte \a + .4byte \b + .endm + + @ Compares the value of `var` to a fixed word value (b). + .macro compare_var_to_value var, value + .byte 0x21 + .2byte \var + .2byte \value + .endm + + @ Compares the value of `var` to the value of `var2`. + .macro compare_var_to_var var1, var2 + .byte 0x22 + .2byte \var1 + .2byte \var2 + .endm + + @ Generic compare macro which attempts to deduce argument types based on their values + @ Any values between 0x4000 to 0x4FFF and 0x8000 to 0x8FFF are considered event variable identifiers + .macro compare arg1, arg2 + .if ((\arg1 >> 12) == 4 || (\arg1 >> 12) == 8) && ((\arg2 >> 12) == 4 || (\arg2 >> 12) == 8) + compare_var_to_var \arg1, \arg2 + .elseif ((\arg1 >> 12) == 4 || (\arg1 >> 12) == 8) && (\arg2 >= 0 && \arg2 <= 0xFFFF) + compare_var_to_value \arg1, \arg2 + .else + .error "Invalid arguments for 'compare'" + .endif + .endm + + @ Calls the native C function stored at `func`. + .macro callnative func + .byte 0x23 + .4byte \func + .endm + + @ Replaces the script with the function stored at `func`. Execution returns to the bytecode script when func returns TRUE. + .macro gotonative func + .byte 0x24 + .4byte \func + .endm + + @ Calls a special function; that is, a piece of ASM code designed for use by scripts and listed in a table of pointers. + .macro special function + .byte 0x25 + .2byte SPECIAL_\function + .endm + + @ Calls a special function. That function's output (if any) will be written to the variable you specify. + .macro specialvar output, function + .byte 0x26 + .2byte \output + .2byte SPECIAL_\function + .endm + + @ Blocks script execution until a command or ASM code manually unblocks it. Generally used with specific commands and specials. If this command runs, and a subsequent command or piece of ASM does not unblock state, the script will remain blocked indefinitely (essentially a hang). + .macro waitstate + .byte 0x27 + .endm + + @ Blocks script execution for time (frames? milliseconds?). + .macro delay time + .byte 0x28 + .2byte \time + .endm + + @ Sets a to 1. + .macro setflag a + .byte 0x29 + .2byte \a + .endm + + @ Sets a to 0. + .macro clearflag a + .byte 0x2a + .2byte \a + .endm + + @ Compares a to 1. + .macro checkflag a + .byte 0x2b + .2byte \a + .endm + + @ In FireRed, this command is a nop. + .macro initclock hour minute + .byte 0x2c + .endm + + @ In FireRed, this command is a nop. + .macro dodailyevents + .byte 0x2d + .endm + + @ Resets the values of variables 0x8000, 0x8001, and 0x8002. + .macro gettime + .byte 0x2e + .endm + + @ Plays the specified (sound_number) sound. Only one sound may play at a time, with newer ones interrupting older ones. + .macro playse sound_number + .byte 0x2f + .2byte \sound_number + .endm + + @ Blocks script execution until the currently-playing sound (triggered by sound) finishes playing. + .macro waitse + .byte 0x30 + .endm + + @ Plays the specified (fanfare_number) fanfare. + .macro playfanfare fanfare_number + .byte 0x31 + .2byte \fanfare_number + .endm + + @ Blocks script execution until all currently-playing fanfares finish. + .macro waitfanfare + .byte 0x32 + .endm + + @ Plays the specified (song_number) song. The byte is apparently supposed to be 0x00. + .macro playbgm song_number, unknown + .byte 0x33 + .2byte \song_number + .byte \unknown + .endm + + @ Plays the specified (song_number) song. + .macro savebgm song_number + .byte 0x34 + .2byte \song_number + .endm + + @ Crossfades the currently-playing song into the map's default song. + .macro fadedefaultbgm + .byte 0x35 + .endm + + @ Crossfades the currently-playng song into the specified (song_number) song. + .macro fadenewbgm song_number + .byte 0x36 + .2byte \song_number + .endm + + @ Fades out the currently-playing song. + .macro fadeoutbgm speed + .byte 0x37 + .byte \speed + .endm + + @ Fades the currently-playing song back in. + .macro fadeinbgm speed + .byte 0x38 + .byte \speed + .endm + + @ Sends the player to Warp warp on Map bank.map. If the specified warp is 0xFF, then the player will instead be sent to (X, Y) on the map. + .macro warp map, warp, X, Y + .byte 0x39 + map \map + .byte \warp + .2byte \X + .2byte \Y + .endm + + @ Clone of warp that does not play a sound effect. + .macro warpsilent map, warp, X, Y + .byte 0x3a + map \map + .byte \warp + .2byte \X + .2byte \Y + .endm + + @ Clone of warp that uses "a walking effect". + .macro warpdoor map, warp, X, Y + .byte 0x3b + map \map + .byte \warp + .2byte \X + .2byte \Y + .endm + + @ Warps the player to another map using a hole animation. + .macro warphole map + .byte 0x3c + map \map + .endm + + @ Clone of warp that uses a teleport effect. It is apparently only used in R/S/E.[source] + .macro warpteleport map, warp, X, Y + .byte 0x3d + map \map + .byte \warp + .2byte \X + .2byte \Y + .endm + + @ Clone of warp. Used by an (unused?) Safari Zone script to return the player to the gatehouse and end the Safari Game. + .macro setwarp map, warp, X, Y + .byte 0x3e + map \map + .byte \warp + .2byte \X + .2byte \Y + .endm + + @ Sets a default warp place. If a warp tries to send the player to Warp 127 on Map 127.127, they will instead be sent here. Useful when a map has warps that need to go to script-controlled locations (i.e. elevators). + .macro setdynamicwarp map, warp, X, Y + .byte 0x3f + map \map + .byte \warp + .2byte \X + .2byte \Y + .endm + + @ Clone of warp3, except that this writes data to different offsets... + .macro setdivewarp map, warp, X, Y + .byte 0x40 + map \map + .byte \warp + .2byte \X + .2byte \Y + .endm + + @ Clone of warp3, except that this writes data to different offsets... + .macro setholewarp map, warp, X, Y + .byte 0x41 + map \map + .byte \warp + .2byte \X + .2byte \Y + .endm + + @ Retrieves the player's zero-indexed X- and Y-coordinates in the map, and stores them in the specified variables. + .macro getplayerxy X, Y + .byte 0x42 + .2byte \X + .2byte \Y + .endm + + @ Retrieves the number of Pokmon in the player's party, and stores that number in variable 0x800D (LASTRESULT). + .macro countpokemon + .byte 0x43 + .endm + + @ Attempts to add quantity of item index to the player's Bag. If the player has enough room, the item will be added and variable 0x800D (LASTRESULT) will be set to 0x0001; otherwise, LASTRESULT is set to 0x0000. + .macro additem index, quantity + .byte 0x44 + .2byte \index + .2byte \quantity + .endm + + @ Removes quantity of item index from the player's Bag. + .macro removeitem index, quantity + .byte 0x45 + .2byte \index + .2byte \quantity + .endm + + @ Checks if the player has enough space in their Bag to hold quantity more of item index. Sets variable 0x800D (LASTRESULT) to 0x0001 if there is room, or 0x0000 is there is no room. + .macro checkitemspace index, quantity + .byte 0x46 + .2byte \index + .2byte \quantity + .endm + + @ Checks if the player has quantity or more of item index in their Bag. Sets variable 0x800D (LASTRESULT) to 0x0001 if the player has enough of the item, or 0x0000 if they have fewer than quantity of the item. + .macro checkitem index, quantity + .byte 0x47 + .2byte \index + .2byte \quantity + .endm + + @ Checks which Bag pocket the specified (index) item belongs in, and writes the value to variable 0x800D (LASTRESULT). This script is used to show the name of the proper Bag pocket when the player receives an item via callstd (simplified to giveitem in XSE). + .macro checkitemtype index + .byte 0x48 + .2byte \index + .endm + + @ Adds a quantity amount of item index to the player's PC. Both arguments can be variables. + .macro givepcitem index, quantity + .byte 0x49 + .2byte \index + .2byte \quantity + .endm + + @ Checks for quantity amount of item index in the player's PC. Both arguments can be variables. + .macro checkpcitem index, quantity + .byte 0x4a + .2byte \index + .2byte \quantity + .endm + + @ In FireRed, this command is a nop. (The argument is read, but not used for anything.) + .macro adddecor decoration + .byte 0x4b + .2byte \decoration + .endm + + @ In FireRed, this command is a nop. (The argument is read, but not used for anything.) + .macro removedecor decoration + .byte 0x4c + .2byte \decoration + .endm + + @ In FireRed, this command is a nop. (The argument is read, but not used for anything.) + .macro hasdecor decoration + .byte 0x4d + .2byte \decoration + .endm + + @ In FireRed, this command is a nop. (The argument is read, but not used for anything.) + .macro checkdecor decoration + .byte 0x4e + .2byte \decoration + .endm + + @ Applies the movement data at movements to the specified (index) Person event. Also closes any standard message boxes that are still open. + @ This command in fact uses variables to access the Person event ID. So, for example, if you setvar 0x8000 to 0x3, and then use applymovementpos 0x8000 @move1, Person event 3 will have the movements at @move1 applied to them. Thank you Shiny Quagsire for bringing this to my attention. + .macro applymovement index, movements, mapGroup, mapNum + .ifb \mapGroup + .byte 0x4f + .2byte \index + .4byte \movements + .else + .byte 0x50 + .2byte \index + .4byte \movements + .byte \mapGroup + .byte \mapNum + .endif + .endm + + @ Blocks script execution until the movements being applied to the specified (index) Person event finish. If the specified Person event is 0x0000, then the command will block script execution until all Person events affected by applymovement finish their movements. If the specified Person event is not currently being manipulated with applymovement, then this command does nothing. + .macro waitmovement index, mapBank, mapNum + .ifb \mapBank + .byte 0x51 + .2byte \index + .else + .byte 0x52 + .2byte \index + .byte \mapBank + .byte \mapNum + .endif + .endm + + @ Attempts to hide the specified (local_ID, a local ID) Person event on the specified map, by setting its visibility flag if it has a valid one. If the Person does not have a valid visibility flag, this command does nothing. + @ If no map is specified, then the current map is used + .macro removeobject localId, mapGroup, mapNum + .ifb \mapGroup + .byte 0x53 + .2byte \localId + .else + .byte 0x54 + .2byte \localId + .byte \mapGroup + .byte \mapNum + .endif + .endm + + .macro addobject localId, mapGroup, mapNum + .ifb \mapGroup + .byte 0x55 + .2byte \localId + .else + .byte 0x56 + .2byte \localId + .byte \mapGroup + .byte \mapNum + .endif + .endm + + @ Sets the specified (index) Object's position on the current map. + .macro setobjectxy index, x, y + .byte 0x57 + .2byte \index + .2byte \x + .2byte \y + .endm + + .macro showobject index, map + .byte 0x58 + .2byte \index + map \map + .endm + + .macro hideobject index, map + .byte 0x59 + .2byte \index + map \map + .endm + + @ If the script was called by an Object, then that Object will turn to face toward the metatile that the player is standing on. + .macro faceplayer + .byte 0x5a + .endm + + .macro turnobject index, direction + .byte 0x5b + .2byte \index + .byte \direction + .endm + + @ If the Trainer flag for Trainer index is not set, this command does absolutely nothing. + .macro trainerbattle type, trainer, word, pointer1, pointer2, pointer3, pointer4 + .byte 0x5c + .byte \type + .2byte \trainer + .2byte \word + .if \type == 0 + .4byte \pointer1 @ text + .4byte \pointer2 @ text + .elseif \type == 1 + .4byte \pointer1 @ text + .4byte \pointer2 @ text + .4byte \pointer3 @ event script + .elseif \type == 2 + .4byte \pointer1 @ text + .4byte \pointer2 @ text + .4byte \pointer3 @ event script + .elseif \type == 3 + .4byte \pointer1 @ text + .elseif \type == 4 + .4byte \pointer1 @ text + .4byte \pointer2 @ text + .4byte \pointer3 @ text + .elseif \type == 5 + .4byte \pointer1 @ text + .4byte \pointer2 @ text + .elseif \type == 6 + .4byte \pointer1 @ text + .4byte \pointer2 @ text + .4byte \pointer3 @ text + .4byte \pointer4 @ event script + .elseif \type == 7 + .4byte \pointer1 @ text + .4byte \pointer2 @ text + .4byte \pointer3 @ text + .elseif \type == 8 + .4byte \pointer1 @ text + .4byte \pointer2 @ text + .4byte \pointer3 @ text + .4byte \pointer4 @ event script + .elseif \type == 9 + .4byte \pointer1 @ text + .4byte \pointer2 @ text + .endif + .endm + + + @ Starts a trainer battle using the battle information stored in RAM (usually by trainerbattle, which actually calls this command behind-the-scenes), and blocks script execution until the battle finishes. + .macro battlebegin + .byte 0x5d + .endm + + .macro ontrainerbattleend + .byte 0x5e + .endm + + .macro ontrainerbattleendgoto + .byte 0x5f + .endm + + @ Compares Flag (trainer + 0x500) to 1. (If the flag is set, then the trainer has been defeated by the player.) + .macro checktrainerflag trainer + .byte 0x60 + .2byte \trainer + .endm + + @ Sets Flag (trainer + 0x500). (I didn't make a mistake. The command names actually are backwards.) + .macro settrainerflag trainer + .byte 0x61 + .2byte \trainer + .endm + + @ Clears Flag (trainer + 0x500). (I didn't make a mistake. The command names actually are backwards.) + .macro cleartrainerflag trainer + .byte 0x62 + .2byte \trainer + .endm + + .macro setobjectxyperm index, x, y + .byte 0x63 + .2byte \index + .2byte \x + .2byte \y + .endm + + .macro moveobjectoffscreen index + .byte 0x64 + .2byte \index + .endm + + .macro setobjectmovementtype word, byte + .byte 0x65 + .2byte \word + .byte \byte + .endm + + @ If a standard message box (or its text) is being drawn on-screen, this command blocks script execution until the box and its text have been fully drawn. + .macro waitmessage + .byte 0x66 + .endm + + @ Starts displaying a standard message box containing the specified text. If text is a pointer, then the string at that offset will be loaded and used. If text is script bank 0, then the value of script bank 0 will be treated as a pointer to the text. (You can use loadpointer to place a string pointer in a script bank.) + .macro message text + .byte 0x67 + .4byte \text + .endm + + @ Holds the current message box open until the player presses a key. The message box is then closed. + .macro closemessage + .byte 0x68 + .endm + + @ Ceases movement for all Objects on-screen. + .macro lockall + .byte 0x69 + .endm + + @ If the script was called by an Object, then that Object's movement will cease. + .macro lock + .byte 0x6a + .endm + + @ Resumes normal movement for all Objects on-screen, and closes any standard message boxes that are still open. + .macro releaseall + .byte 0x6b + .endm + + @ If the script was called by an Object, then that Object's movement will resume. This command also closes any standard message boxes that are still open. + .macro release + .byte 0x6c + .endm + + @ Blocks script execution until the player presses any key. + .macro waitbuttonpress + .byte 0x6d + .endm + + @ Displays a YES/NO multichoice box at the specified coordinates, and blocks script execution until the user makes a selection. Their selection is stored in variable 0x800D (LASTRESULT); 0x0000 for "NO" or if the user pressed B, and 0x0001 for "YES". + .macro yesnobox x, y + .byte 0x6e + .byte \x + .byte \y + .endm + + @ Displays a multichoice box from which the user can choose a selection, and blocks script execution until a selection is made. Lists of options are predefined and the one to be used is specified with list. If b is set to a non-zero value, then the user will not be allowed to back out of the multichoice with the B button. + .macro multichoice x, y, list, b + .byte 0x6f + .byte \x + .byte \y + .byte \list + .byte \b + .endm + + @ Displays a multichoice box from which the user can choose a selection, and blocks script execution until a selection is made. Lists of options are predefined and the one to be used is specified with list. The default argument determines the initial position of the cursor when the box is first opened; it is zero-indexed, and if it is too large, it is treated as 0x00. If b is set to a non-zero value, then the user will not be allowed to back out of the multichoice with the B button. + .macro multichoicedefault x, y, list, default, b + .byte 0x70 + .byte \x + .byte \y + .byte \list + .byte \default + .byte \b + .endm + + @ Displays a multichoice box from which the user can choose a selection, and blocks script execution until a selection is made. Lists of options are predefined and the one to be used is specified with list. The per_row argument determines how many list items will be shown on a single row of the box. + .macro multichoicegrid x, y, list, per_row, B + .byte 0x71 + .byte \x + .byte \y + .byte \list + .byte \per_row + .byte \B + .endm + + .macro drawbox + .byte 0x72 + .endm + + .macro erasebox byte1, byte2, byte3, byte4 + .byte 0x73 + .byte \byte1 + .byte \byte2 + .byte \byte3 + .byte \byte4 + .endm + + .macro drawboxtext + .byte 0x74 + .endm + + @ Displays a box containing the front sprite for the specified (species) Pokemon species. + .macro drawmonpic species, x, y + .byte 0x75 + .2byte \species + .byte \x + .byte \y + .endm + + @ Hides all boxes displayed with drawmonpic. + .macro erasemonpic + .byte 0x76 + .endm + + @ Draws an image of the winner of the contest. In FireRed, this command is a nop. (The argument is discarded.) + .macro drawcontestwinner a + .byte 0x77 + .byte \a + .endm + + @ Displays the string at pointer as braille text in a standard message box. The string must be formatted to use braille characters. + .macro braillemessage text + .byte 0x78 + .4byte \text + .endm + + @ RENAMED! + @ Gives the player one of the specified (species) Pokmon at level level holding item. The unknown arguments should all be zeroes. + .macro givemon species, level, item, unknown1, unknown2, unknown3 + .byte 0x79 + .2byte \species + .byte \level + .2byte \item + .4byte \unknown1 + .4byte \unknown2 + .byte \unknown3 + .endm + + .macro giveegg species + .byte 0x7a + .2byte \species + .endm + + @ RENAMED! + .macro setmonmove byte1, byte2, word + .byte 0x7b + .byte \byte1 + .byte \byte2 + .2byte \word + .endm + + @ Checks if at least one Pokémon in the player's party knows the specified (index) attack. If so, variable 0x800D (LASTRESULT) is set to the (zero-indexed) slot number of the first Pokémon that knows the move. If not, LASTRESULT is set to 0x0006. Variable 0x8004 is also set to this Pokémon's species. + .macro checkpartymove index + .byte 0x7c + .2byte \index + .endm + + @ Writes the name of the Pokemon at index species to the specified buffer. + .macro getspeciesname out, species + .byte 0x7d + .byte \out + .2byte \species + .endm + + @ RENAMED! + @ Writes the name of the species of the first Pokémon in the player's party to the specified buffer. + .macro getfirstpartymonname out + .byte 0x7e + .byte \out + .endm + + @ RENAMED! + @ Writes the nickname of the Pokemon in slot slot (zero-indexed) of the player's party to the specified buffer. If an empty or invalid slot is specified, ten spaces ("") are written to the buffer. + .macro getpartymonname out, slot + .byte 0x7f + .byte \out + .2byte \slot + .endm + + @ Writes the name of the item at index item to the specified buffer. If the specified index is larger than the number of items in the game (0x176), the name of item 0 ("????????") is buffered instead. + .macro getitemname out, item + .byte 0x80 + .byte \out + .2byte \item + .endm + + @ Writes the name of the decoration at index decoration to the specified buffer. In FireRed, this command is a nop. + .macro getdecorname out, decoration + .byte 0x81 + .byte \out + .2byte \decoration + .endm + + @ Writes the name of the move at index move to the specified buffer. + .macro getmovename out, move + .byte 0x82 + .byte \out + .2byte \move + .endm + + @ Converts the value of input to a decimal string, and writes that string to the specified buffer. + .macro getnumberstring out, input + .byte 0x83 + .byte \out + .2byte \input + .endm + + @ Writes the standard string identified by index to the specified buffer. This command has no protections in place at all, so specifying an invalid standard string (e.x. 0x2B) can and usually will cause data corruption. + .macro getstdstring out, index + .byte 0x84 + .byte \out + .2byte \index + .endm + + @ Copies the string at offset to the specified buffer. + .macro getstring out, offset + .byte 0x85 + .byte \out + .4byte \offset + .endm + + @ Opens the Pokemart system, offering the specified products for sale. + .macro pokemart products + .byte 0x86 + .4byte \products + .endm + + @ Apparent clone of pokemart. + .macro pokemartdecor products + .byte 0x87 + .4byte \products + .endm + + @ Apparent clone of pokemart. + .macro pokemartbp products + .byte 0x88 + .4byte \products + .endm + + @ Starts up the slot machine minigame. + .macro playslotmachine word + .byte 0x89 + .2byte \word + .endm + + @ In FireRed, this command is a nop. + .macro plantberrytree + .byte 0x8a + .endm + + @ In FireRed, this command sets the byte at 0x03000EA8 to 0x01. I do not know what that means. + .macro choosecontestpkmn + .byte 0x8b + .endm + + @ In FireRed, this command is a nop. + .macro startcontest + .byte 0x8c + .endm + + @ In FireRed, this command is a nop. + .macro showcontestresults + .byte 0x8d + .endm + + @ In FireRed, this command is a nop. + .macro contestlinktransfer + .byte 0x8e + .endm + + @ Stores a random integer between 0 and limit in variable 0x800D (LASTRESULT). + .macro random limit + .byte 0x8f + .2byte \limit + .endm + + @ If check is 0x00, this command adds value to the player's money. + .macro givemoney value, check + .byte 0x90 + .4byte \value + .byte \check + .endm + + @ If check is 0x00, this command subtracts value from the player's money. + .macro takemoney value, check + .byte 0x91 + .4byte \value + .byte \check + .endm + + @ If check is 0x00, this command will check if the player has value or more money; script variable 0x800D (LASTRESULT) is set to 0x0001 if the player has enough money, or 0x0000 if the do not. + .macro checkmoney value, check + .byte 0x92 + .4byte \value + .byte \check + .endm + + @ Spawns a secondary box showing how much money the player has. + .macro showmoneybox x, y, check + .byte 0x93 + .byte \x + .byte \y + .byte \check + .endm + + @ Hides the secondary box spawned by showmoney. + .macro hidemoneybox + .byte 0x94 + .endm + + @ Updates the secondary box spawned by showmoney. Consumes but does not use arguments. + .macro updatemoneybox x, y, check + .byte 0x95 + .byte \x + .byte \y + .byte \check + .endm + + @ In FireRed, this command is a nop. + .macro getpricereduction + .byte 0x96 + .endm + + @ Fades the screen to black or back, using the specified effect. Effect 0x00 fades in, and effect 0x01 fades out. I don't know if other effects exist. + .macro fadescreen effect + .byte 0x97 + .byte \effect + .endm + + @ Fades the screen to and from black and white. Mode 0x00 fades from black, mode 0x01 fades out to black, mode 0x2 fades in from white, and mode 0x3 fades out to white. Other modes may exist. + .macro fadescreenspeed effect, speed + .byte 0x98 + .byte \effect + .byte \speed + .endm + + .macro setflashradius word + .byte 0x99 + .2byte \word + .endm + + .macro animateflash byte + .byte 0x9a + .byte \byte + .endm + + .macro messageautoscroll pointer + .byte 0x9b + .4byte \pointer + .endm + + @ Executes the specified field move animation. + .macro dofieldeffect animation + .byte 0x9c + .2byte \animation + .endm + + @ Sets up the field effect argument argument with the value value. + .macro setfieldeffectarg argument, param + .byte 0x9d + .byte \argument + .2byte \param + .endm + + @ Blocks script execution until all playing field move animations complete. + .macro waitfieldeffect animation + .byte 0x9e + .2byte \animation + .endm + + @ Sets which healing place the player will return to if all of the Pokemon in their party faint. + .macro setrespawn flightspot + .byte 0x9f + .2byte \flightspot + .endm + + @ Checks the player's gender. If male, then 0x0000 is stored in variable 0x800D (LASTRESULT). If female, then 0x0001 is stored in LASTRESULT. + .macro checkplayergender + .byte 0xa0 + .endm + + @ Plays the specified (species) Pokemon's cry. You can use waitcry to block script execution until the sound finishes. + .macro playmoncry species, effect + .byte 0xa1 + .2byte \species + .2byte \effect + .endm + + @ Changes the metatile at (x, y) on the current map. + .macro setmetatile x, y, metatile_number, tile_attrib + .byte 0xa2 + .2byte \x + .2byte \y + .2byte \metatile_number + .2byte \tile_attrib + .endm + + @ Queues a weather change to the default weather for the map. + .macro resetweather + .byte 0xa3 + .endm + + @ Queues a weather change to type weather. + .macro setweather type + .byte 0xa4 + .2byte \type + .endm + + @ Executes the weather change queued with resetweather or setweather. The current weather will smoothly fade into the queued weather. + .macro doweather + .byte 0xa5 + .endm + + @ This command manages cases in which maps have tiles that change state when stepped on (specifically, cracked/breakable floors). + .macro setstepcallback subroutine + .byte 0xa6 + .byte \subroutine + .endm + + .macro setmaplayoutindex index + .byte 0xa7 + .2byte \index + .endm + + .macro setobjectpriority index, map, priority + .byte 0xa8 + .2byte \index + map \map + .byte \priority + .endm + + .macro resetobjectpriority index, map + .byte 0xa9 + .2byte \index + map \map + .endm + + .macro createvobject sprite, byte2, x, y, elevation, direction + .byte 0xaa + .byte \sprite + .byte \byte2 + .2byte \x + .2byte \y + .byte \elevation + .byte \direction + .endm + + .macro turnvobject index, direction + .byte 0xab + .byte \index + .byte \direction + .endm + + @ Opens the door metatile at (X, Y) with an animation. + .macro opendoor x, y + .byte 0xac + .2byte \x + .2byte \y + .endm + + @ Closes the door metatile at (X, Y) with an animation. + .macro closedoor x, y + .byte 0xad + .2byte \x + .2byte \y + .endm + + @ Waits for the door animation started with opendoor or closedoor to finish. + .macro waitdooranim + .byte 0xae + .endm + + @ Sets the door tile at (x, y) to be open without an animation. + .macro setdooropen x, y + .byte 0xaf + .2byte \x + .2byte \y + .endm + + @ Sets the door tile at (x, y) to be closed without an animation. + .macro setdoorclosed2 x, y + .byte 0xb0 + .2byte \x + .2byte \y + .endm + + @ In Emerald, this command consumes its parameters and does nothing. In FireRed, this command is a nop. + .macro addelevmenuitem + .byte 0xb1 + .endm + + @ In FireRed and Emerald, this command is a nop. + .macro showelevmenu + .byte 0xb2 + .endm + + .macro checkcoins out + .byte 0xb3 + .2byte \out + .endm + + .macro givecoins count + .byte 0xb4 + .2byte \count + .endm + + .macro takecoins word + .byte 0xb5 + .2byte \word + .endm + + @ Prepares to start a wild battle against a species at Level level holding item. Running this command will not affect normal wild battles. You start the prepared battle with dowildbattle. + .macro setwildbattle species, level, item + .byte 0xb6 + .2byte \species + .byte \level + .2byte \item + .endm + + @ Starts a wild battle against the Pokemon generated by setwildbattle. Blocks script execution until the battle finishes. + .macro dowildbattle + .byte 0xb7 + .endm + + .macro setvaddress long, word + .byte 0xb8 + .4byte \long + .2byte \word + .endm + + .macro vgoto pointer + .byte 0xb9 + .4byte \pointer + .endm + + .macro vcall pointer + .byte 0xba + .4byte \pointer + .endm + + .macro vgoto_if byte, pointer + .byte 0xbb + .byte \byte + .4byte \pointer + .endm + + .macro vcall_if byte, pointer + .byte 0xbc + .byte \byte + .4byte \pointer + .endm + + .macro vmessage pointer + .byte 0xbd + .4byte \pointer + .endm + + .macro vloadptr pointer + .byte 0xbe + .4byte \pointer + .endm + + .macro vbufferstring byte, pointer + .byte 0xbf + .byte \byte + .4byte \pointer + .endm + + @ Spawns a secondary box showing how many Coins the player has. + .macro showcoinsbox x, y + .byte 0xc0 + .byte \x + .byte \y + .endm + + @ Hides the secondary box spawned by showcoins. It consumes its arguments but doesn't use them. + .macro hidecoinsbox x, y + .byte 0xc1 + .byte \x + .byte \y + .endm + + @ Updates the secondary box spawned by showcoins. It consumes its arguments but doesn't use them. + .macro updatecoinsbox x, y + .byte 0xc2 + .byte \x + .byte \y + .endm + + @ Increases the value of the specified game stat by 1. The stat's value will not be allowed to exceed 0x00FFFFFF. + .macro incrementgamestat stat + .byte 0xc3 + .byte \stat + .endm + + @ Sets the destination that using an Escape Rope or Dig will take the player to. + .macro setescapewarp map, warp, x, y + .byte 0xc4 + map \map + .byte \warp + .2byte \x + .2byte \y + .endm + + @ Blocks script execution until cry finishes. + .macro waitmoncry + .byte 0xc5 + .endm + + @ Writes the name of the specified (box) PC box to the specified buffer. + .macro bufferboxname out, box + .byte 0xc6 + .byte \out + .2byte \box + .endm + + @ Sets the color of the text in standard message boxes. 0x00 produces blue (male) text, 0x01 produces red (female) text, 0xFF resets the color to the default for the current OW's gender, and all other values produce black text. + .macro textcolor color + .byte 0xc7 + .byte \color + .endm + + @ The exact purpose of this command is unknown, but it is related to the blue help-text box that appears on the bottom of the screen when the Main Menu is opened. + .macro loadhelp pointer + .byte 0xc8 + .4byte \pointer + .endm + + @ The exact purpose of this command is unknown, but it is related to the blue help-text box that appears on the bottom of the screen when the Main Menu is opened. + .macro unloadhelp + .byte 0xc9 + .endm + + @ After using this command, all standard message boxes will use the signpost frame. + .macro signmsg + .byte 0xca + .endm + + @ Ends the effects of signmsg, returning message box frames to normal. + .macro normalmsg + .byte 0xcb + .endm + + @ Compares the value of a hidden variable to a dword. + .macro comparehiddenvar a, value + .byte 0xcc + .byte \a + .4byte \value + .endm + + @ Makes the Pokemon in the specified slot of the player's party obedient. It will not randomly disobey orders in battle. + .macro setmonobedient slot + .byte 0xcd + .2byte \slot + .endm + + @ Checks if the Pokemon in the specified slot of the player's party is obedient. If the Pokemon is disobedient, 0x0001 is written to script variable 0x800D (LASTRESULT). If the Pokemon is obedient (or if the specified slot is empty or invalid), 0x0000 is written. + .macro checkmonobedience slot + .byte 0xce + .2byte \slot + .endm + + @ Depending on factors I haven't managed to understand yet, this command may cause script execution to jump to the offset specified by the pointer at 0x020375C0. + .macro execram + .byte 0xcf + .endm + + @ Sets worldmapflag to 1. This allows the player to Fly to the corresponding map, if that map has a flightspot. + .macro setworldmapflag worldmapflag + .byte 0xd0 + .2byte \worldmapflag + .endm + + @ Clone of warpteleport? It is apparently only used in FR/LG, and only with specials.[source] + .macro warpteleport2 map, warp, x, y + .byte 0xd1 + map \map + .byte \warp + .2byte \x + .2byte \y + .endm + + @ Changes the location where the player caught the Pokemon in the specified slot of their party. + .macro setmonmetlocation slot, location + .byte 0xd2 + .2byte \slot + .byte \location + .endm + + .macro getbraillestringwidth pointer + .byte 0xd3 + .4byte \pointer + .endm + + .macro bufferitemnameplural out, item, quantity + .byte 0xd4 + .byte \out + .2byte \item + .2byte \quantity + .endm + + +@ Supplementary + + .macro goto_if_eq dest + goto_if 1, \dest + .endm + + .macro switch var + copyvar 0x8000, \var + .endm + + .macro case condition, dest + compare_var_to_value 0x8000, \condition + goto_if_eq \dest + .endm + + .macro msgbox text, type=4 + loadword 0, \text + callstd \type + .endm + + @ Message box types + MSGBOX_YESNO = 5 + + YES = 1 + NO = 0 + + .macro giveitem item, amount=1, function=0 + setorcopyvar 0x8000, \item + setorcopyvar 0x8001, \amount + callstd \function + .endm + + .macro giveitemfanfaremsg msg, item, amount=1, fanfare=MUS_FANFA1 + loadword 0, \msg + setorcopyvar 0x8000, \item + setorcopyvar 0x8001, \amount + setorcopyvar 0x8002, \fanfare + callstd 9 + .endm diff --git a/asm/macros/field_effect_script.inc b/asm/macros/field_effect_script.inc new file mode 100644 index 0000000..d5895b0 --- /dev/null +++ b/asm/macros/field_effect_script.inc @@ -0,0 +1,42 @@ + .macro loadtiles address + .byte 0 + .4byte \address + .endm + + .macro loadfadedpal address + .byte 1 + .4byte \address + .endm + + .macro loadpal address + .byte 2 + .4byte \address + .endm + + .macro callnative address + .byte 3 + .4byte \address + .endm + + .macro end + .byte 4 + .endm + + .macro loadgfx_callnative tiles_address, palette_address, function_address + .byte 5 + .4byte \tiles_address + .4byte \palette_address + .4byte \function_address + .endm + + .macro loadtiles_callnative tiles_address, function_address + .byte 6 + .4byte \tiles_address + .4byte \function_address + .endm + + .macro loadfadedpal_callnative palette_address, function_address + .byte 7 + .4byte \palette_address + .4byte \function_address + .endm diff --git a/asm/macros/function.inc b/asm/macros/function.inc new file mode 100644 index 0000000..67fb373 --- /dev/null +++ b/asm/macros/function.inc @@ -0,0 +1,29 @@ + .macro arm_func_start name + .align 2, 0 + .global \name + .arm + .type \name, function + .endm + + .macro arm_func_end name + .size \name, .-\name + .endm + + .macro thumb_func_start name + .align 2, 0 + .global \name + .thumb + .thumb_func + .type \name, function + .endm + + .macro non_word_aligned_thumb_func_start name + .global \name + .thumb + .thumb_func + .type \name, function + .endm + + .macro thumb_func_end name + .size \name, .-\name + .endm diff --git a/asm/macros/m4a.inc b/asm/macros/m4a.inc new file mode 100644 index 0000000..6c5abc0 --- /dev/null +++ b/asm/macros/m4a.inc @@ -0,0 +1,13 @@ + .macro song label, music_player, unknown + .4byte \label + .2byte \music_player + .2byte \unknown + .endm + + .macro music_player info_struct, track_struct, unknown_1, unknown_2 + .4byte \info_struct + .4byte \track_struct + .byte \unknown_1 + .space 1 + .2byte \unknown_2 + .endm diff --git a/asm/macros/map.inc b/asm/macros/map.inc new file mode 100644 index 0000000..075993f --- /dev/null +++ b/asm/macros/map.inc @@ -0,0 +1,90 @@ + .macro map map_id + .byte \map_id >> 8 @ map group + .byte \map_id & 0xFF @ map num + .endm + + .macro map_script type, address + .byte \type + .4byte \address + .endm + + .macro map_script_2 word1, word2, address + .2byte \word1 + .2byte \word2 + .4byte \address + .endm + + .macro object_event index:req, gfx:req, x:req, y:req, elevation:req, movement_type:req, x_radius:req, y_radius:req, trainer_type:req, sight_radius_tree_etc:req, script:req, event_flag:req + .byte \index + .2byte \gfx + .byte 0 + .2byte \x, \y + .byte \elevation, \movement_type, ((\y_radius << 4) | \x_radius), 0 + .2byte \trainer_type, \sight_radius_tree_etc + .4byte \script + .2byte \event_flag, 0 + inc _num_npcs + .endm + + .macro warp_def x, y, byte, warp, map_id + .2byte \x, \y + .byte \byte, \warp + .byte \map_id & 0xFF @ map num + .byte \map_id >> 8 @ map group + inc _num_warps + .endm + + .macro coord_event x, y, byte1, byte2, word1, word2, word3, script + .2byte \x, \y + .byte \byte1, \byte2 + .2byte \word1, \word2, \word3 + .4byte \script + inc _num_traps + .endm + + .macro bg_event x, y, byte, kind, word, arg6, arg7, arg8 + .2byte \x, \y + .byte \byte, \kind + .2byte \word + .if \kind < 5 + .4byte \arg6 + .else + .2byte \arg6 + .byte \arg7, \arg8 + .endif + inc _num_signs + .endm + + .macro bg_hidden_item_event x, y, height, item, flag, unknown + bg_event \x, \y, \height, 7, 0, \item, \flag, \unknown + .endm + + .macro map_events npcs, warps, traps, signs + .byte _num_npcs, _num_warps, _num_traps, _num_signs + .4byte \npcs, \warps, \traps, \signs + reset_map_events + .endm + + .macro reset_map_events + .set _num_npcs, 0 + .set _num_warps, 0 + .set _num_traps, 0 + .set _num_signs, 0 + .endm + + reset_map_events + + + .equiv connection_down, 1 + .equiv connection_up, 2 + .equiv connection_left, 3 + .equiv connection_right, 4 + .equiv connection_dive, 5 + .equiv connection_emerge, 6 + + .macro connection direction, offset, map, filler + .4byte connection_\direction + .4byte \offset + map \map + .space 2 + .endm diff --git a/asm/macros/movement.inc b/asm/macros/movement.inc new file mode 100644 index 0000000..f077a8f --- /dev/null +++ b/asm/macros/movement.inc @@ -0,0 +1,122 @@ + .macro create_movement name + enum _\name + .macro \name + .byte _\name + .endm + .endm + + enum_start 0 + create_movement step_00 + create_movement step_01 + create_movement step_02 + create_movement step_03 + create_movement slow_step_down + create_movement slow_step_up + create_movement slow_step_left + create_movement slow_step_right + create_movement step_down + create_movement step_up + create_movement step_left + create_movement step_right + create_movement fast_step_down + create_movement fast_step_up + create_movement fast_step_left + create_movement fast_step_right + create_movement step_10 + create_movement step_11 + create_movement step_12 + create_movement step_13 + create_movement step_14 + create_movement step_15 + create_movement step_16 + create_movement step_17 + create_movement step_18 + create_movement step_19 + create_movement step_1a + create_movement step_1b + create_movement step_1c + create_movement step_1d + create_movement step_1e + create_movement step_1f + create_movement step_20 + create_movement step_21 + create_movement step_22 + create_movement step_23 + create_movement step_24 + create_movement step_25 + create_movement step_26 + create_movement step_27 + create_movement step_28 + create_movement step_29 + create_movement step_2a + create_movement step_2b + create_movement step_2c + create_movement step_2d + create_movement step_2e + create_movement step_2f + create_movement step_30 + create_movement step_31 + create_movement step_32 + create_movement step_33 + create_movement step_34 + create_movement step_35 + create_movement step_36 + create_movement step_37 + create_movement step_38 + create_movement step_39 + create_movement step_3a + create_movement step_3b + create_movement step_3c + create_movement step_3d + create_movement step_3e + create_movement step_3f + create_movement step_40 + create_movement step_41 + create_movement step_42 + create_movement step_43 + create_movement step_44 + create_movement step_45 + create_movement step_46 + create_movement step_47 + create_movement step_48 + create_movement step_49 + create_movement step_4a + create_movement step_4b + create_movement step_4c + create_movement step_4d + create_movement step_4e + create_movement step_4f + create_movement step_50 + create_movement step_51 + create_movement step_52 + create_movement step_53 + create_movement step_54 + create_movement step_55 + create_movement step_56 + create_movement step_57 + create_movement step_58 + create_movement step_59 + create_movement step_5a + create_movement step_5b + create_movement step_5c + create_movement step_5d + create_movement step_5e + create_movement step_5f + create_movement step_60 + create_movement step_61 + create_movement step_62 + create_movement step_63 + create_movement step_64 + create_movement step_65 + create_movement step_66 + create_movement step_67 + + enum_start 0x91 + create_movement step_91 + create_movement step_92 + + enum_start 0x96 + create_movement step_96 + + enum_start 0xfe + create_movement step_end diff --git a/asm/macros/music_voice.inc b/asm/macros/music_voice.inc new file mode 100644 index 0000000..b7a9e7f --- /dev/null +++ b/asm/macros/music_voice.inc @@ -0,0 +1,125 @@ + .macro voice_directsound base_midi_key, pan, sample_data_pointer, attack, decay, sustain, release + .byte 0 + _voice_directsound \base_midi_key, \pan, \sample_data_pointer, \attack, \decay, \sustain, \release + .endm + + .macro voice_directsound_no_resample base_midi_key, pan, sample_data_pointer, attack, decay, sustain, release + .byte 8 + _voice_directsound \base_midi_key, \pan, \sample_data_pointer, \attack, \decay, \sustain, \release + .endm + + .macro voice_directsound_alt base_midi_key, pan, sample_data_pointer, attack, decay, sustain, release + .byte 16 + _voice_directsound \base_midi_key, \pan, \sample_data_pointer, \attack, \decay, \sustain, \release + .endm + + .macro _voice_directsound base_midi_key, pan, sample_data_pointer, attack, decay, sustain, release + .byte \base_midi_key + .byte 0 + .if \pan != 0 + .byte (0x80 | \pan) + .else + .byte 0 + .endif + .4byte \sample_data_pointer + .byte \attack + .byte \decay + .byte \sustain + .byte \release + .endm + + .macro voice_square_1 sweep, duty_cycle, attack, decay, sustain, release + _voice_square_1 1, \sweep, \duty_cycle, \attack, \decay, \sustain, \release + .endm + + .macro voice_square_1_alt sweep, duty_cycle, attack, decay, sustain, release + _voice_square_1 9, \sweep, \duty_cycle, \attack, \decay, \sustain, \release + .endm + + .macro _voice_square_1 type, sweep, duty_cycle, attack, decay, sustain, release + .byte \type, 60, 0 + .byte \sweep + .byte (\duty_cycle & 0x3) + .byte 0, 0, 0 + .byte (\attack & 0x7) + .byte (\decay & 0x7) + .byte (\sustain & 0xF) + .byte (\release & 0x7) + .endm + + .macro voice_square_2 duty_cycle, attack, decay, sustain, release + _voice_square_2 2, \duty_cycle, \attack, \decay, \sustain, \release + .endm + + .macro voice_square_2_alt duty_cycle, attack, decay, sustain, release + _voice_square_2 10, \duty_cycle, \attack, \decay, \sustain, \release + .endm + + .macro _voice_square_2 type, duty_cycle, attack, decay, sustain, release + .byte \type, 60, 0, 0 + .byte (\duty_cycle & 0x3) + .byte 0, 0, 0 + .byte (\attack & 0x7) + .byte (\decay & 0x7) + .byte (\sustain & 0xF) + .byte (\release & 0x7) + .endm + + .macro voice_programmable_wave wave_samples_pointer, attack, decay, sustain, release + _voice_programmable_wave 3, \wave_samples_pointer, \attack, \decay, \sustain, \release + .endm + + .macro voice_programmable_wave_alt wave_samples_pointer, attack, decay, sustain, release + _voice_programmable_wave 11, \wave_samples_pointer, \attack, \decay, \sustain, \release + .endm + + .macro _voice_programmable_wave type, wave_samples_pointer, attack, decay, sustain, release + .byte \type, 60, 0, 0 + .4byte \wave_samples_pointer + .byte (\attack & 0x7) + .byte (\decay & 0x7) + .byte (\sustain & 0xF) + .byte (\release & 0x7) + .endm + + .macro voice_noise period, attack, decay, sustain, release + _voice_noise 4, \period, \attack, \decay, \sustain, \release + .endm + + .macro voice_noise_alt period, attack, decay, sustain, release + _voice_noise 12, \period, \attack, \decay, \sustain, \release + .endm + + .macro _voice_noise type, period, attack, decay, sustain, release + .byte \type, 60, 0, 0 + .byte (\period & 0x1) + .byte 0, 0, 0 + .byte (\attack & 0x7) + .byte (\decay & 0x7) + .byte (\sustain & 0xF) + .byte (\release & 0x7) + .endm + + .macro voice_keysplit voice_group_pointer, keysplit_table_pointer + .byte 0x40, 0, 0, 0 + .4byte \voice_group_pointer + .4byte \keysplit_table_pointer + .endm + + .macro voice_keysplit_all voice_group_pointer + .byte 0x80, 0, 0, 0 + .4byte \voice_group_pointer + .4byte 0 + .endm + + .macro cry sample + .byte 0x20, 60, 0, 0 + .4byte \sample + .byte 0xff, 0, 0xff, 0 + .endm + + .macro cry2 sample + .byte 0x30, 60, 0, 0 + .4byte \sample + .byte 0xff, 0, 0xff, 0 + .endm diff --git a/asm/macros/pokemon_data.inc b/asm/macros/pokemon_data.inc new file mode 100644 index 0000000..b0a5f22 --- /dev/null +++ b/asm/macros/pokemon_data.inc @@ -0,0 +1,57 @@ + .macro pokedex_entry pokemon_name, height, weight, pokemon_scale, pokemon_offset, trainer_scale, trainer_offset + .2byte \height @ in decimeters + .2byte \weight @ in hectograms + .4byte DexDescription_\pokemon_name\()_1 + .4byte DexDescription_\pokemon_name\()_2 + .2byte 0 @ unused + .2byte \pokemon_scale + .2byte \pokemon_offset + .2byte \trainer_scale + .2byte \trainer_offset + .2byte 0 @ padding + .endm + + .macro base_stats hp, attack, defense, speed, sp_attack, sp_defense + .byte \hp + .byte \attack + .byte \defense + .byte \speed + .byte \sp_attack + .byte \sp_defense + .endm + + .macro ev_yield hp, attack, defense, speed, sp_attack, sp_defense + .2byte (\sp_defense << 10) | (\sp_attack << 8) | (\speed << 6) | (\defense << 4) | (\attack << 2) | \hp + .endm + + .macro level_up_move level, move + .2byte (\level << 9) | \move + .endm + + .macro evo_entry method, parameter, target_species + .2byte \method + .2byte \parameter + .2byte \target_species + .2byte 0 @ padding + .endm + + .macro empty_evo_entries count + .fill 8 * \count, 1, 0 + .endm + + .macro egg_moves_begin species + .2byte 20000 + \species + .endm + +@ If the min level equals the max level, only one level argument is needed. + .macro wild_mon species, min_level, max_level + .byte \min_level + + .ifb \max_level + .byte \min_level + .else + .byte \max_level + .endif + + .2byte SPECIES_\species + .endm diff --git a/asm/main.s b/asm/main.s new file mode 100644 index 0000000..d8e2778 --- /dev/null +++ b/asm/main.s @@ -0,0 +1,12049 @@ + .include "asm/macros/function.inc" + .text + .syntax unified + + thumb_func_start AgbMain +AgbMain: @ 0x0200858C + push {r4, lr} + sub sp, #4 + ldr r0, =0x04000208 + movs r4, #0 + strh r4, [r0] + movs r0, #0xfc + bl RegisterRamReset + mov r0, sp + strh r4, [r0] + ldr r1, =gUnknown_02020A34 + ldr r2, =gUnknown_0202526C + subs r2, r2, r1 + lsrs r0, r2, #0x1f + adds r2, r2, r0 + lsls r2, r2, #0xa + lsrs r2, r2, #0xb + movs r0, #0x80 + lsls r0, r0, #0x11 + orrs r2, r0 + mov r0, sp + bl CpuSet + ldr r1, =0x04000204 + ldr r2, =0x000045B4 + adds r0, r2, #0 + strh r0, [r1] + bl sub_02008638 + bl sub_020087B4 + bl sub_02008C80 + bl sub_020002B4 + movs r0, #0xff + bl SoftReset + add sp, #4 + pop {r4} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_020085F4 +sub_020085F4: @ 0x020085F4 + ldr r0, =gUnknown_02022C08 + ldr r0, [r0] + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_02008600 +sub_02008600: @ 0x02008600 + push {r4, lr} + adds r4, r0, #0 + cmp r4, #0 + beq _0200862C +_02008608: + bl sub_02008C00 + bl VBlankIntrWait + bl sub_02009228 + ldr r1, =gUnknown_02022EB8 + movs r0, #0xf + ldrh r1, [r1] + ands r0, r1 + cmp r0, #0xf + bne _02008626 + movs r0, #0 + bl SoftReset +_02008626: + subs r4, #1 + cmp r4, #0 + bne _02008608 +_0200862C: + pop {r4} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02008638 +sub_02008638: @ 0x02008638 + push {r4, r5, lr} + ldr r1, =gUnknown_02022C0C + movs r0, #0 + str r0, [r1] + ldr r1, =gUnknown_02022BD0 + ldr r5, =sub_02008708 + ldr r4, =sub_020086B8 + adds r2, r5, #0 + adds r3, r1, #0 +_0200864A: + stm r3!, {r2} + adds r0, #1 + cmp r0, #0xd + bls _0200864A + cmp r4, #0 + beq _0200866C + str r4, [r1, #4] + b _0200866E + .align 2, 0 + .pool +_0200866C: + str r5, [r1, #4] +_0200866E: + pop {r4, r5} + pop {r0} + bx r0 + + thumb_func_start sub_02008674 +sub_02008674: @ 0x02008674 + adds r3, r0, #0 + adds r2, r1, #0 + cmp r2, #0 + beq _0200868C + ldr r1, =gUnknown_02022BD0 + lsls r0, r3, #2 + adds r0, r0, r1 + str r2, [r0] + b _02008696 + .align 2, 0 + .pool +_0200868C: + ldr r0, =gUnknown_02022BD0 + lsls r1, r3, #2 + adds r1, r1, r0 + ldr r0, =sub_02008708 + str r0, [r1] +_02008696: + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_020086A0 +sub_020086A0: @ 0x020086A0 + ldr r3, =0x04000208 + ldrh r2, [r3] + movs r1, #0 + strh r1, [r3] + ldr r1, =gUnknown_02022C0C + str r0, [r1] + strh r2, [r3] + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_020086B8 +sub_020086B8: @ 0x020086B8 + push {lr} + movs r0, #0 + bl sub_02009324 + cmp r0, #0 + beq _020086C8 + bl m4aSoundVSync +_020086C8: + bl sub_02008D1C + bl sub_0200870C + ldr r1, =gUnknown_02022C08 + ldr r0, [r1] + adds r0, #1 + str r0, [r1] + ldr r1, =0x03007FF8 + movs r0, #1 + strh r0, [r1] + ldr r0, =gUnknown_02022C0C + ldr r0, [r0] + cmp r0, #0 + beq _020086EA + bl _call_via_r0 +_020086EA: + movs r0, #1 + bl sub_02009324 + cmp r0, #0 + beq _020086F8 + bl m4aSoundMain +_020086F8: + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02008708 +sub_02008708: @ 0x02008708 + bx lr + .align 2, 0 + + thumb_func_start sub_0200870C +sub_0200870C: @ 0x0200870C + push {r4, r5, r6, lr} + ldr r2, =0x04000010 + ldr r1, =gUnknown_02022C10 + ldrh r0, [r1] + strh r0, [r2] + adds r2, #4 + ldrh r0, [r1, #2] + strh r0, [r2] + adds r2, #4 + ldrh r0, [r1, #4] + strh r0, [r2] + adds r2, #4 + ldrh r0, [r1, #6] + strh r0, [r2] + subs r2, #0xa + ldr r1, =gUnknown_02022C18 + ldrh r0, [r1] + strh r0, [r2] + adds r2, #4 + ldrh r0, [r1, #2] + strh r0, [r2] + adds r2, #4 + ldrh r0, [r1, #4] + strh r0, [r2] + adds r2, #4 + ldrh r0, [r1, #6] + strh r0, [r2] + movs r4, #0 + movs r6, #0xc0 + lsls r6, r6, #0x12 + ldr r5, =0x04000008 +_0200874A: + ldr r0, =gUnknown_02022C20 + adds r1, r4, r0 + ldrb r0, [r1] + cmp r0, #0 + beq _0200878C + movs r0, #0 + strb r0, [r1] + ldrh r1, [r5] + movs r0, #0xf8 + lsls r0, r0, #5 + adds r2, r0, #0 + adds r0, r1, #0 + ands r0, r2 + lsls r0, r0, #3 + movs r2, #0xc0 + lsls r2, r2, #0x13 + adds r3, r0, r2 + movs r2, #0xc0 + lsls r2, r2, #8 + adds r0, r2, #0 + ands r1, r0 + movs r2, #1 + cmp r1, #0 + beq _0200877C + movs r2, #2 +_0200877C: + lsls r2, r2, #9 + movs r0, #0x80 + lsls r0, r0, #0x13 + orrs r2, r0 + adds r0, r6, #0 + adds r1, r3, #0 + bl CpuSet +_0200878C: + movs r0, #0x80 + lsls r0, r0, #5 + adds r6, r6, r0 + adds r5, #2 + adds r4, #1 + cmp r4, #3 + ble _0200874A + pop {r4, r5, r6} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_020087B4 +sub_020087B4: @ 0x020087B4 + push {r4, r5, lr} + sub sp, #8 + mov r0, sp + movs r4, #0 + strh r4, [r0] + movs r1, #0xc0 + lsls r1, r1, #0x12 + ldr r2, =0x01002000 + bl CpuSet + mov r0, sp + adds r0, #2 + strh r4, [r0] + ldr r1, =gUnknown_02022C10 + ldr r5, =0x01000004 + adds r2, r5, #0 + bl CpuSet + add r0, sp, #4 + strh r4, [r0] + ldr r1, =gUnknown_02022C18 + adds r2, r5, #0 + bl CpuSet + ldr r0, =gUnknown_02022C20 + strb r4, [r0, #3] + strb r4, [r0, #2] + strb r4, [r0, #1] + strb r4, [r0] + add sp, #8 + pop {r4, r5} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200880C +sub_0200880C: @ 0x0200880C + push {r4, r5, r6, lr} + adds r6, r3, #0 + ldr r3, [sp, #0x10] + ldr r4, [sp, #0x14] + lsls r0, r0, #0xc + lsls r2, r2, #6 + movs r5, #0xc0 + lsls r5, r5, #0x12 + adds r2, r2, r5 + adds r0, r0, r2 + lsls r1, r1, #1 + adds r0, r0, r1 + cmp r3, #0 + beq _0200884A +_02008828: + adds r5, r0, #0 + adds r5, #0x40 + subs r3, #1 + cmp r6, #0 + ble _02008844 + adds r1, r0, #0 + adds r2, r6, #0 +_02008836: + ldrh r0, [r4] + strh r0, [r1] + adds r1, #2 + subs r2, #1 + adds r4, #2 + cmp r2, #0 + bne _02008836 +_02008844: + adds r0, r5, #0 + cmp r3, #0 + bne _02008828 +_0200884A: + pop {r4, r5, r6} + pop {r0} + bx r0 + + thumb_func_start sub_02008850 +sub_02008850: @ 0x02008850 + push {r4, r5, r6, lr} + adds r6, r3, #0 + ldr r3, [sp, #0x10] + ldr r4, [sp, #0x14] + lsls r0, r0, #0xc + lsls r2, r2, #6 + movs r5, #0xc0 + lsls r5, r5, #0x12 + adds r2, r2, r5 + adds r0, r0, r2 + lsls r1, r1, #1 + adds r0, r0, r1 + cmp r3, #0 + beq _0200888E +_0200886C: + adds r5, r0, #0 + adds r5, #0x40 + subs r3, #1 + cmp r6, #0 + ble _02008888 + adds r1, r0, #0 + adds r2, r6, #0 +_0200887A: + ldrh r0, [r1] + strh r0, [r4] + adds r1, #2 + subs r2, #1 + adds r4, #2 + cmp r2, #0 + bne _0200887A +_02008888: + adds r0, r5, #0 + cmp r3, #0 + bne _0200886C +_0200888E: + pop {r4, r5, r6} + pop {r0} + bx r0 + + thumb_func_start sub_02008894 +sub_02008894: @ 0x02008894 + push {r4, r5, r6, r7, lr} + mov ip, r3 + ldr r3, [sp, #0x14] + lsls r0, r0, #0xc + lsls r2, r2, #6 + movs r4, #0xc0 + lsls r4, r4, #0x12 + adds r2, r2, r4 + adds r0, r0, r2 + lsls r1, r1, #1 + adds r0, r0, r1 + cmp r3, #0 + beq _020088DE +_020088AE: + adds r4, r0, #0 + adds r4, #0x40 + subs r5, r3, #1 + mov r7, ip + cmp r7, #0 + ble _020088D6 + ldr r6, =0x00000FFF + ldr r1, [sp, #0x18] + lsls r3, r1, #0xc + adds r1, r0, #0 + mov r2, ip +_020088C4: + adds r0, r6, #0 + ldrh r7, [r1] + ands r0, r7 + orrs r0, r3 + strh r0, [r1] + adds r1, #2 + subs r2, #1 + cmp r2, #0 + bne _020088C4 +_020088D6: + adds r0, r4, #0 + adds r3, r5, #0 + cmp r3, #0 + bne _020088AE +_020088DE: + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_020088E8 +sub_020088E8: @ 0x020088E8 + push {r4, lr} + lsls r0, r0, #0xc + lsls r2, r2, #6 + movs r4, #0xc0 + lsls r4, r4, #0x12 + adds r2, r2, r4 + adds r0, r0, r2 + lsls r1, r1, #1 + adds r0, r0, r1 + strh r3, [r0] + pop {r4} + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start sub_02008904 +sub_02008904: @ 0x02008904 + push {r4, r5, r6, lr} + adds r5, r3, #0 + ldr r4, [sp, #0x10] + ldr r3, [sp, #0x14] + lsls r3, r3, #0x10 + lsrs r3, r3, #0x10 + lsls r0, r0, #0xc + lsls r2, r2, #6 + movs r6, #0xc0 + lsls r6, r6, #0x12 + adds r2, r2, r6 + adds r0, r0, r2 + lsls r1, r1, #1 + adds r0, r0, r1 + cmp r4, #0 + beq _02008940 +_02008924: + adds r2, r0, #0 + adds r2, #0x40 + subs r4, #1 + cmp r5, #0 + ble _0200893A + adds r1, r5, #0 +_02008930: + strh r3, [r0] + adds r0, #2 + subs r1, #1 + cmp r1, #0 + bne _02008930 +_0200893A: + adds r0, r2, #0 + cmp r4, #0 + bne _02008924 +_02008940: + pop {r4, r5, r6} + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start sub_02008948 +sub_02008948: @ 0x02008948 + push {r4, r5, r6, r7, lr} + mov ip, r3 + ldr r6, [sp, #0x14] + ldr r4, [sp, #0x18] + ldr r3, [sp, #0x1c] + lsls r0, r0, #0xc + lsls r2, r2, #6 + movs r5, #0xc0 + lsls r5, r5, #0x12 + adds r2, r2, r5 + adds r2, r0, r2 + lsls r1, r1, #1 + adds r2, r2, r1 + lsls r3, r3, #6 + adds r3, r3, r5 + adds r0, r0, r3 + lsls r4, r4, #1 + adds r0, r0, r4 + cmp r6, #0 + beq _0200899C +_02008970: + adds r5, r2, #0 + adds r5, #0x40 + adds r7, r0, #0 + adds r7, #0x40 + subs r4, r6, #1 + mov r1, ip + cmp r1, #0 + ble _02008992 + adds r1, r0, #0 + mov r3, ip +_02008984: + ldrh r0, [r2] + strh r0, [r1] + adds r2, #2 + adds r1, #2 + subs r3, #1 + cmp r3, #0 + bne _02008984 +_02008992: + adds r2, r5, #0 + adds r0, r7, #0 + adds r6, r4, #0 + cmp r6, #0 + bne _02008970 +_0200899C: + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start sub_020089A4 +sub_020089A4: @ 0x020089A4 + ldr r3, =gUnknown_02022C10 + lsls r0, r0, #1 + adds r3, r0, r3 + strh r1, [r3] + ldr r1, =gUnknown_02022C18 + adds r0, r0, r1 + strh r2, [r0] + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_020089BC +sub_020089BC: @ 0x020089BC + push {r4, r5, lr} + ldrb r2, [r0, #1] + strb r2, [r1, #1] + ldr r5, =gUnknown_02020CD0 + subs r4, r0, r5 + lsls r3, r4, #3 + subs r3, r3, r4 + lsls r2, r3, #6 + adds r3, r3, r2 + lsls r3, r3, #3 + adds r3, r3, r4 + lsls r2, r3, #0xf + subs r2, r2, r3 + lsls r2, r2, #3 + adds r2, r2, r4 + asrs r2, r2, #2 + strb r2, [r1] + ldrb r2, [r0, #1] + lsls r4, r2, #3 + adds r4, r4, r2 + lsls r4, r4, #2 + adds r4, r4, r5 + subs r1, r1, r5 + lsls r3, r1, #3 + subs r3, r3, r1 + lsls r2, r3, #6 + adds r3, r3, r2 + lsls r3, r3, #3 + adds r3, r3, r1 + lsls r2, r3, #0xf + subs r2, r2, r3 + lsls r2, r2, #3 + adds r2, r2, r1 + asrs r2, r2, #2 + strb r2, [r4] + strb r2, [r0, #1] + pop {r4, r5} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02008A10 +sub_02008A10: @ 0x02008A10 + push {r4, r5, r6, r7, lr} + mov r7, r8 + push {r7} + adds r5, r0, #0 + adds r6, r1, #0 + mov r8, r2 + ldr r0, =gUnknown_02020CD0 + ldrb r2, [r0, #1] + lsls r1, r2, #3 + adds r1, r1, r2 + lsls r1, r1, #2 + adds r7, r1, r0 + ldrb r2, [r7] + lsls r1, r2, #3 + adds r1, r1, r2 + lsls r1, r1, #2 + adds r1, r1, r0 + ldrb r2, [r7, #1] + movs r4, #0 + strb r2, [r1, #1] + ldrb r2, [r7, #1] + lsls r1, r2, #3 + adds r1, r1, r2 + lsls r1, r1, #2 + adds r1, r1, r0 + ldrb r2, [r7] + strb r2, [r1] + adds r0, #0x24 + adds r1, r7, #0 + bl sub_020089BC + movs r0, #0 + strh r5, [r7, #8] + strh r6, [r7, #0xa] + mov r1, r8 + str r1, [r7, #0xc] + strb r0, [r7, #2] + strh r4, [r7, #4] + strh r4, [r7, #6] + str r4, [r7, #0x10] + movs r2, #0 + movs r1, #3 + adds r0, r7, #0 + adds r0, #0x20 +_02008A68: + str r2, [r0] + subs r0, #4 + subs r1, #1 + cmp r1, #0 + bge _02008A68 + adds r0, r7, #0 + pop {r3} + mov r8, r3 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_02008A84 +sub_02008A84: @ 0x02008A84 + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + adds r6, r0, #0 + ldr r1, =gUnknown_02020F58 + movs r2, #0x80 + lsls r2, r2, #3 + adds r0, r1, r2 + ldrb r0, [r0] + mov ip, r0 + lsls r0, r0, #3 + adds r7, r0, r1 + ldr r4, [r6, #0xc] + ldr r2, [r4] + ldr r0, =0x0000FFFF + mov sl, r1 + cmp r2, r0 + bne _02008AAE + b _02008BDC +_02008AAE: + mov r0, ip + cmp r0, #0x80 + bne _02008AB6 + b _02008BE6 +_02008AB6: + movs r2, #4 + ldrsh r1, [r4, r2] + movs r2, #8 + ldrsh r0, [r6, r2] + adds r5, r1, r0 + cmp r5, #0xef + ble _02008AC6 + b _02008BD0 +_02008AC6: + movs r0, #6 + ldrsh r1, [r4, r0] + movs r2, #0xa + ldrsh r0, [r6, r2] + adds r3, r1, r0 + cmp r3, #0x9f + ble _02008AD6 + b _02008BD0 +_02008AD6: + ldr r0, [r4] + movs r1, #0xc0 + lsls r1, r1, #8 + ands r1, r0 + lsrs r1, r1, #0xc + lsrs r2, r0, #0x1e + adds r2, r1, r2 + mov r8, r0 + cmp r2, #0xb + bhi _02008B40 + lsls r0, r2, #2 + ldr r1, =_02008B00 + adds r0, r0, r1 + ldr r0, [r0] + mov pc, r0 + .align 2, 0 + .pool +_02008B00: @ jump table + .4byte _02008B30 @ case 0 + .4byte _02008B34 @ case 1 + .4byte _02008B38 @ case 2 + .4byte _02008B3C @ case 3 + .4byte _02008B34 @ case 4 + .4byte _02008B38 @ case 5 + .4byte _02008B38 @ case 6 + .4byte _02008B3C @ case 7 + .4byte _02008B30 @ case 8 + .4byte _02008B30 @ case 9 + .4byte _02008B34 @ case 10 + .4byte _02008B38 @ case 11 +_02008B30: + movs r0, #8 + b _02008B42 +_02008B34: + movs r0, #0x10 + b _02008B42 +_02008B38: + movs r0, #0x20 + b _02008B42 +_02008B3C: + movs r0, #0x40 + b _02008B42 +_02008B40: + movs r0, #0 +_02008B42: + adds r0, r5, r0 + cmp r0, #0 + blt _02008BD0 + cmp r2, #0xb + bhi _02008BA0 + lsls r0, r2, #2 + ldr r1, =_02008B5C + adds r0, r0, r1 + ldr r0, [r0] + mov pc, r0 + .align 2, 0 + .pool +_02008B5C: @ jump table + .4byte _02008B8C @ case 0 + .4byte _02008B90 @ case 1 + .4byte _02008B96 @ case 2 + .4byte _02008B9C @ case 3 + .4byte _02008B8C @ case 4 + .4byte _02008B8C @ case 5 + .4byte _02008B90 @ case 6 + .4byte _02008B96 @ case 7 + .4byte _02008B90 @ case 8 + .4byte _02008B96 @ case 9 + .4byte _02008B96 @ case 10 + .4byte _02008B9C @ case 11 +_02008B8C: + movs r0, #8 + b _02008B9E +_02008B90: + movs r1, #0x10 + mov sb, r1 + b _02008BA0 +_02008B96: + movs r2, #0x20 + mov sb, r2 + b _02008BA0 +_02008B9C: + movs r0, #0x40 +_02008B9E: + mov sb, r0 +_02008BA0: + mov r1, sb + adds r0, r3, r1 + cmp r0, #0 + blt _02008BD0 + ldr r0, =0x000001FF + ands r5, r0 + movs r0, #0xff + ands r3, r0 + lsls r0, r5, #0x10 + mov r2, r8 + orrs r0, r2 + orrs r3, r0 + str r3, [r7] + ldr r0, =0x00000FFF + ldrh r1, [r4, #8] + ands r0, r1 + ldrh r2, [r6, #4] + orrs r0, r2 + ldrh r1, [r6, #6] + adds r0, r1, r0 + strh r0, [r7, #4] + adds r7, #8 + movs r2, #1 + add ip, r2 +_02008BD0: + adds r4, #0xc + ldr r1, [r4] + ldr r0, =0x0000FFFF + cmp r1, r0 + beq _02008BDC + b _02008AAE +_02008BDC: + movs r0, #0x80 + lsls r0, r0, #3 + add r0, sl + mov r1, ip + strb r1, [r0] +_02008BE6: + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02008C00 +sub_02008C00: @ 0x02008C00 + push {r4, r5, lr} + ldr r0, =gUnknown_02020CD0 + adds r0, #0x25 + ldrb r1, [r0] + cmp r1, #1 + beq _02008C38 +_02008C0C: + lsls r0, r1, #3 + adds r0, r0, r1 + lsls r0, r0, #2 + ldr r1, =gUnknown_02020CD0 + adds r4, r0, r1 + ldr r1, [r4, #0x10] + cmp r1, #0 + beq _02008C22 + adds r0, r4, #0 + bl _call_via_r1 +_02008C22: + movs r0, #1 + ldrb r1, [r4, #2] + ands r0, r1 + cmp r0, #0 + bne _02008C32 + adds r0, r4, #0 + bl sub_02008A84 +_02008C32: + ldrb r1, [r4, #1] + cmp r1, #1 + bne _02008C0C +_02008C38: + ldr r1, =gUnknown_02020F58 + movs r2, #0x80 + lsls r2, r2, #3 + adds r0, r1, r2 + ldrb r2, [r0] + lsls r0, r2, #3 + adds r0, r0, r1 + cmp r2, #0x7f + bgt _02008C66 + movs r3, #0x80 + lsls r3, r3, #2 + ldrh r4, [r0] + cmp r4, r3 + beq _02008C66 + adds r4, r3, #0 +_02008C56: + strh r4, [r0] + adds r2, #1 + adds r0, #8 + cmp r2, #0x7f + bgt _02008C66 + ldrh r5, [r0] + cmp r5, r3 + bne _02008C56 +_02008C66: + movs r0, #0x80 + lsls r0, r0, #3 + adds r1, r1, r0 + movs r0, #0 + strb r0, [r1] + pop {r4, r5} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02008C80 +sub_02008C80: @ 0x02008C80 + push {r4, r5, r6, lr} + sub sp, #4 + mov r0, sp + movs r5, #0 + strh r5, [r0] + ldr r4, =gUnknown_02020CD0 + ldr r2, =0x01000144 + adds r1, r4, #0 + bl CpuSet + strb r5, [r4, #1] + strb r5, [r4] + adds r0, r4, #0 + adds r0, #0x25 + movs r1, #1 + strb r1, [r0] + subs r0, #1 + strb r1, [r0] + adds r6, r4, #0 + adds r4, #0x48 + movs r5, #0xf +_02008CAA: + adds r0, r6, #0 + adds r1, r4, #0 + bl sub_020089BC + adds r4, #0x24 + subs r5, #1 + cmp r5, #0 + bge _02008CAA + ldr r2, =gUnknown_02020F58 + movs r0, #0x80 + lsls r0, r0, #3 + adds r1, r2, r0 + movs r0, #0 + strb r0, [r1] + movs r1, #0x80 + lsls r1, r1, #2 + adds r0, r1, #0 + movs r5, #0x7f +_02008CCE: + strh r0, [r2] + subs r5, #1 + adds r2, #8 + cmp r5, #0 + bge _02008CCE + add sp, #4 + pop {r4, r5, r6} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02008CEC +sub_02008CEC: @ 0x02008CEC + push {lr} + adds r1, r0, #0 + ldr r0, =gUnknown_02020CD0 + ldrb r3, [r1] + lsls r2, r3, #3 + adds r2, r2, r3 + lsls r2, r2, #2 + adds r2, r2, r0 + ldrb r3, [r1, #1] + strb r3, [r2, #1] + ldrb r3, [r1, #1] + lsls r2, r3, #3 + adds r2, r2, r3 + lsls r2, r2, #2 + adds r2, r2, r0 + ldrb r3, [r1] + strb r3, [r2] + bl sub_020089BC + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02008D1C +sub_02008D1C: @ 0x02008D1C + ldr r1, =0x040000D4 + ldr r0, =gUnknown_02020F58 + str r0, [r1] + movs r0, #0xe0 + lsls r0, r0, #0x13 + str r0, [r1, #4] + ldr r0, =0x84000100 + str r0, [r1, #8] + ldr r0, [r1, #8] + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_02008D3C +sub_02008D3C: @ 0x02008D3C + strh r1, [r0, #8] + strh r2, [r0, #0xa] + bx lr + .align 2, 0 + + thumb_func_start sub_02008D44 +sub_02008D44: @ 0x02008D44 + ldrh r3, [r0, #8] + adds r1, r3, r1 + strh r1, [r0, #8] + ldrh r1, [r0, #0xa] + adds r2, r1, r2 + strh r2, [r0, #0xa] + bx lr + .align 2, 0 + + thumb_func_start sub_02008D54 +sub_02008D54: @ 0x02008D54 + lsls r1, r1, #0xc + strh r1, [r0, #4] + bx lr + .align 2, 0 + + thumb_func_start sub_02008D5C +sub_02008D5C: @ 0x02008D5C + strh r1, [r0, #6] + bx lr + + thumb_func_start sub_02008D60 +sub_02008D60: @ 0x02008D60 + movs r2, #0xfe + ldrb r3, [r0, #2] + ands r2, r3 + orrs r2, r1 + strb r2, [r0, #2] + bx lr + + thumb_func_start sub_02008D6C +sub_02008D6C: @ 0x02008D6C + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #4 + adds r4, r0, #0 + str r1, [sp] + mov ip, r2 + ldrb r1, [r4, #0x1b] + lsrs r0, r1, #3 + ldrb r2, [r4, #3] + muls r0, r2, r0 + lsls r0, r0, #5 + ldr r1, [r4, #0xc] + adds r1, r1, r0 + ldrb r2, [r4, #0x1a] + lsrs r0, r2, #3 + lsls r0, r0, #5 + adds r3, r1, r0 + mov sl, r3 + movs r0, #7 + ands r0, r2 + movs r1, #8 + subs r0, r1, r0 + mov sb, r0 + ldrb r2, [r4, #9] + ldr r0, [sp] + adds r1, r0, #0 + muls r1, r2, r1 + ldr r0, [r4, #0x10] + adds r7, r0, r1 + subs r3, #4 + movs r6, #0 + cmp r6, r2 + bge _02008E1E + ldr r1, =gUnknown_0202135C + mov r8, r1 +_02008DB8: + cmp r6, #8 + beq _02008DC4 + adds r3, #4 + b _02008DCC + .align 2, 0 + .pool +_02008DC4: + ldrb r2, [r4, #3] + lsls r0, r2, #5 + mov r1, sl + adds r3, r1, r0 +_02008DCC: + ldrb r0, [r7] + mov r2, sb + lsls r0, r2 + lsls r0, r0, #0x10 + lsrs r5, r0, #0x10 + adds r7, #1 + cmp r5, #0 + beq _02008E16 + lsrs r0, r0, #0x18 + mov r2, r8 + ldr r1, [r2] + lsls r0, r0, #2 + adds r0, r0, r1 + ldr r2, [r0] + lsls r1, r2, #4 + subs r1, r1, r2 + ldr r0, [r3] + bics r0, r1 + mov r1, ip + muls r1, r2, r1 + orrs r0, r1 + str r0, [r3] + movs r0, #0xff + ands r0, r5 + mov r2, r8 + ldr r1, [r2] + lsls r0, r0, #2 + adds r0, r0, r1 + ldr r2, [r0] + lsls r1, r2, #4 + subs r1, r1, r2 + ldr r0, [r3, #0x20] + bics r0, r1 + mov r1, ip + muls r1, r2, r1 + orrs r0, r1 + str r0, [r3, #0x20] +_02008E16: + adds r6, #1 + ldrb r0, [r4, #9] + cmp r6, r0 + blt _02008DB8 +_02008E1E: + ldrb r0, [r4, #0x1c] + cmp r0, #0 + bne _02008E36 + ldrb r1, [r4, #0x1a] + adds r1, #3 + ldr r0, [r4, #0x14] + ldr r2, [sp] + adds r0, r0, r2 + ldrb r0, [r0] + adds r1, r0, r1 + strb r1, [r4, #0x1a] + b _02008E3C +_02008E36: + ldrb r1, [r4, #0x1a] + adds r0, r0, r1 + strb r0, [r4, #0x1a] +_02008E3C: + add sp, #4 + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + + thumb_func_start sub_02008E4C +sub_02008E4C: @ 0x02008E4C + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #0xc + adds r4, r0, #0 + str r1, [sp] + str r2, [sp, #4] + mov sl, r3 + movs r0, #7 + ldrb r1, [r4, #0x1a] + ands r0, r1 + movs r1, #8 + subs r0, r1, r0 + mov sb, r0 + ldrb r3, [r4, #9] + ldr r2, [sp] + adds r0, r2, #0 + muls r0, r3, r0 + lsls r0, r0, #1 + ldr r1, [r4, #0x10] + adds r1, r1, r0 + mov ip, r1 + movs r5, #0 + mov r8, r5 + cmp r8, r3 + bge _02008F3C +_02008E84: + ldrb r2, [r4, #0x1b] + add r2, r8 + asrs r0, r2, #3 + ldrb r6, [r4, #3] + muls r0, r6, r0 + lsls r0, r0, #5 + ldr r1, [r4, #0xc] + adds r1, r1, r0 + ldrb r7, [r4, #0x1a] + lsrs r0, r7, #3 + lsls r0, r0, #5 + adds r5, r1, r0 + movs r0, #7 + ands r2, r0 + lsls r2, r2, #2 + adds r5, r5, r2 + mov r1, ip + ldrb r0, [r1] + mov r1, sb + lsls r0, r1 + lsls r1, r0, #0x10 + lsrs r6, r1, #0x10 + mov r2, ip + adds r0, r2, r3 + ldrb r0, [r0] + mov r3, sb + lsls r0, r3 + lsls r3, r0, #0x10 + lsrs r7, r3, #0x10 + str r7, [sp, #8] + movs r0, #1 + add ip, r0 + adds r0, r6, #0 + orrs r0, r7 + cmp r0, #0 + beq _02008F32 + lsrs r1, r1, #0x18 + ldr r7, =gUnknown_0202135C + ldr r2, [r7] + lsls r1, r1, #2 + adds r1, r1, r2 + lsrs r0, r3, #0x18 + lsls r0, r0, #2 + adds r0, r0, r2 + ldr r2, [r1] + ldr r3, [r0] + adds r0, r2, #0 + orrs r0, r3 + lsls r1, r0, #4 + subs r1, r1, r0 + ldr r0, [r5] + bics r0, r1 + ldr r7, [sp, #4] + adds r1, r2, #0 + muls r1, r7, r1 + orrs r0, r1 + mov r1, sl + muls r1, r3, r1 + orrs r0, r1 + str r0, [r5] + adds r1, r6, #0 + movs r0, #0xff + ands r1, r0 + ldr r3, =gUnknown_0202135C + ldr r2, [r3] + lsls r1, r1, #2 + adds r1, r1, r2 + ldr r0, [sp, #8] + movs r6, #0xff + ands r0, r6 + lsls r0, r0, #2 + adds r0, r0, r2 + ldr r2, [r1] + ldr r3, [r0] + adds r0, r2, #0 + orrs r0, r3 + lsls r1, r0, #4 + subs r1, r1, r0 + ldr r0, [r5, #0x20] + bics r0, r1 + adds r1, r2, #0 + muls r1, r7, r1 + orrs r0, r1 + mov r1, sl + muls r1, r3, r1 + orrs r0, r1 + str r0, [r5, #0x20] +_02008F32: + movs r7, #1 + add r8, r7 + ldrb r3, [r4, #9] + cmp r8, r3 + blt _02008E84 +_02008F3C: + ldrb r0, [r4, #0x1c] + cmp r0, #0 + bne _02008F54 + ldr r0, [r4, #0x14] + ldr r1, [sp] + adds r0, r0, r1 + ldrb r2, [r4, #0x1a] + ldrb r0, [r0] + adds r0, r2, r0 + b _02008F58 + .align 2, 0 + .pool +_02008F54: + ldrb r3, [r4, #0x1a] + adds r0, r0, r3 +_02008F58: + strb r0, [r4, #0x1a] + add sp, #0xc + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start sub_02008F6C +sub_02008F6C: @ 0x02008F6C + push {r4, r5, r6, r7, lr} + mov r7, r8 + push {r7} + lsls r0, r0, #5 + ldr r2, =gUnknown_02022C30 + adds r3, r0, r2 + ldrb r0, [r1] + strb r0, [r3] + ldrb r0, [r1, #9] + strb r0, [r3, #9] + ldrb r0, [r1, #1] + strb r0, [r3, #1] + ldrb r0, [r1, #2] + strb r0, [r3, #2] + ldrb r0, [r1, #3] + strb r0, [r3, #3] + ldrb r0, [r1, #4] + strb r0, [r3, #4] + ldrh r0, [r1, #6] + movs r2, #0 + strh r0, [r3, #6] + ldrb r0, [r1, #8] + strb r0, [r3, #8] + ldr r0, [r1, #0xc] + str r0, [r3, #0xc] + ldr r0, [r1, #0x10] + str r0, [r3, #0x10] + ldr r0, [r1, #0x14] + str r0, [r3, #0x14] + strb r2, [r3, #0x1b] + strb r2, [r3, #0x1a] + ldr r0, [r1, #0x10] + str r0, [r3, #0x10] + ldr r0, [r1, #0x14] + str r0, [r3, #0x14] + strb r2, [r3, #0x19] + strb r2, [r3, #0x1c] + strb r2, [r3, #0x1d] + ldrb r1, [r3] + lsls r0, r1, #0xc + movs r2, #0xc0 + lsls r2, r2, #0x12 + adds r2, r2, r0 + mov r8, r2 + ldrh r5, [r3, #6] + ldrb r4, [r3, #2] + ldrb r7, [r3, #4] + adds r0, r7, r4 + ldr r1, =gUnknown_02022C20 + mov ip, r1 + cmp r4, r0 + bge _02009010 +_02008FD4: + ldrb r2, [r3, #1] + ldrb r7, [r3, #3] + adds r0, r7, r2 + adds r6, r4, #1 + cmp r2, r0 + bge _02009004 + lsls r1, r2, #1 + lsls r0, r4, #6 + add r0, r8 + adds r1, r1, r0 +_02008FE8: + ldrb r4, [r3, #8] + lsls r0, r4, #0xc + orrs r0, r5 + strh r0, [r1] + adds r0, r5, #1 + lsls r0, r0, #0x10 + lsrs r5, r0, #0x10 + adds r1, #2 + adds r2, #1 + ldrb r7, [r3, #3] + ldrb r4, [r3, #1] + adds r0, r7, r4 + cmp r2, r0 + blt _02008FE8 +_02009004: + adds r4, r6, #0 + ldrb r7, [r3, #4] + ldrb r1, [r3, #2] + adds r0, r7, r1 + cmp r4, r0 + blt _02008FD4 +_02009010: + ldrb r1, [r3] + add r1, ip + movs r0, #1 + strb r0, [r1] + adds r0, r3, #0 + pop {r3} + mov r8, r3 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200902C +sub_0200902C: @ 0x0200902C + push {r4, lr} + adds r3, r0, #0 + ldr r0, =gUnknown_0202135C + str r3, [r0] + movs r2, #0 + movs r4, #0x10 +_02009038: + movs r0, #0x80 + ands r0, r2 + rsbs r0, r0, #0 + lsrs r1, r0, #0x1f + movs r0, #0x40 + ands r0, r2 + cmp r0, #0 + beq _0200904A + orrs r1, r4 +_0200904A: + movs r0, #0x20 + ands r0, r2 + cmp r0, #0 + beq _02009058 + movs r0, #0x80 + lsls r0, r0, #1 + orrs r1, r0 +_02009058: + adds r0, r2, #0 + ands r0, r4 + cmp r0, #0 + beq _02009066 + movs r0, #0x80 + lsls r0, r0, #5 + orrs r1, r0 +_02009066: + movs r0, #8 + ands r0, r2 + cmp r0, #0 + beq _02009074 + movs r0, #0x80 + lsls r0, r0, #9 + orrs r1, r0 +_02009074: + movs r0, #4 + ands r0, r2 + cmp r0, #0 + beq _02009082 + movs r0, #0x80 + lsls r0, r0, #0xd + orrs r1, r0 +_02009082: + movs r0, #2 + ands r0, r2 + cmp r0, #0 + beq _02009090 + movs r0, #0x80 + lsls r0, r0, #0x11 + orrs r1, r0 +_02009090: + movs r0, #1 + ands r0, r2 + cmp r0, #0 + beq _0200909E + movs r0, #0x80 + lsls r0, r0, #0x15 + orrs r1, r0 +_0200909E: + stm r3!, {r1} + adds r2, #1 + cmp r2, #0xff + ble _02009038 + pop {r4} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_020090B0 +sub_020090B0: @ 0x020090B0 + push {r4, lr} + sub sp, #4 + adds r4, r0, #0 + mov r0, sp + strh r1, [r0] + ldr r1, [r4, #0xc] + ldrb r0, [r4, #4] + ldrb r3, [r4, #3] + adds r2, r0, #0 + muls r2, r3, r2 + lsls r2, r2, #4 + movs r0, #0x80 + lsls r0, r0, #0x11 + orrs r2, r0 + mov r0, sp + bl CpuSet + adds r0, r4, #0 + movs r1, #0 + movs r2, #0 + bl sub_02009164 + add sp, #4 + pop {r4} + pop {r0} + bx r0 + + thumb_func_start sub_020090E4 +sub_020090E4: @ 0x020090E4 + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #4 + adds r6, r0, #0 + mov sb, r1 + adds r7, r2, #0 + ldr r0, [sp, #0x24] + mov r8, r0 + adds r4, r7, #0 + adds r0, r4, r0 + cmp r4, r0 + bge _02009136 + lsls r5, r3, #4 + ldr r0, =0x001FFFFF + ands r5, r0 + movs r1, #0x80 + lsls r1, r1, #0x11 + mov sl, r1 +_0200910E: + mov r0, sp + ldrh r2, [r0, #0x28] + strh r2, [r0] + ldrb r1, [r6, #3] + adds r0, r1, #0 + muls r0, r4, r0 + add r0, sb + lsls r0, r0, #5 + ldr r1, [r6, #0xc] + adds r1, r1, r0 + mov r0, sp + mov r2, sl + orrs r2, r5 + bl CpuSet + adds r4, #1 + mov r2, r8 + adds r0, r7, r2 + cmp r4, r0 + blt _0200910E +_02009136: + add sp, #4 + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200914C +sub_0200914C: @ 0x0200914C + strb r1, [r0, #0x18] + strb r2, [r0, #0x19] + bx lr + .align 2, 0 + + thumb_func_start sub_02009154 +sub_02009154: @ 0x02009154 + ldrb r1, [r0, #0x1d] + strb r1, [r0, #0x1a] + ldrb r2, [r0, #0x1b] + ldrb r3, [r0, #9] + adds r1, r2, r3 + strb r1, [r0, #0x1b] + bx lr + .align 2, 0 + + thumb_func_start sub_02009164 +sub_02009164: @ 0x02009164 + strb r1, [r0, #0x1a] + strb r2, [r0, #0x1b] + bx lr + .align 2, 0 + + thumb_func_start sub_0200916C +sub_0200916C: @ 0x0200916C + ldrb r3, [r0, #0x1a] + adds r1, r3, r1 + strb r1, [r0, #0x1a] + ldrb r1, [r0, #0x1b] + adds r2, r1, r2 + strb r2, [r0, #0x1b] + bx lr + .align 2, 0 + + thumb_func_start sub_0200917C +sub_0200917C: @ 0x0200917C + push {r4, r5, lr} + adds r4, r0, #0 + adds r5, r1, #0 + b _020091A4 +_02009184: + ldrb r0, [r4, #0x19] + cmp r0, #0 + bne _02009196 + ldrb r1, [r5] + ldrb r2, [r4, #0x18] + adds r0, r4, #0 + bl sub_02008D6C + b _020091A2 +_02009196: + ldrb r1, [r5] + ldrb r2, [r4, #0x18] + ldrb r3, [r4, #0x19] + adds r0, r4, #0 + bl sub_02008E4C +_020091A2: + adds r5, #1 +_020091A4: + ldrb r0, [r5] + cmp r0, #0 + bne _02009184 + pop {r4, r5} + pop {r0} + bx r0 + + thumb_func_start sub_020091B0 +sub_020091B0: @ 0x020091B0 + push {r4, r5, r6, r7, lr} + mov r7, sb + mov r6, r8 + push {r6, r7} + adds r4, r0, #0 + ldrb r0, [r4] + lsls r1, r0, #0xc + movs r0, #0xc0 + lsls r0, r0, #0x12 + adds r1, r1, r0 + mov ip, r1 + ldrh r5, [r4, #6] + ldrb r3, [r4, #2] + ldrb r1, [r4, #4] + adds r0, r1, r3 + ldr r7, =gUnknown_02022C20 + mov r8, r7 + cmp r3, r0 + bge _0200920E + mov sb, r0 +_020091D8: + ldrb r2, [r4, #1] + ldrb r1, [r4, #3] + adds r0, r1, r2 + adds r6, r3, #1 + cmp r2, r0 + bge _02009208 + lsls r1, r2, #1 + lsls r0, r3, #6 + add r0, ip + adds r1, r1, r0 +_020091EC: + ldrb r3, [r4, #8] + lsls r0, r3, #0xc + orrs r0, r5 + strh r0, [r1] + adds r0, r5, #1 + lsls r0, r0, #0x10 + lsrs r5, r0, #0x10 + adds r1, #2 + adds r2, #1 + ldrb r7, [r4, #3] + ldrb r3, [r4, #1] + adds r0, r7, r3 + cmp r2, r0 + blt _020091EC +_02009208: + adds r3, r6, #0 + cmp r3, sb + blt _020091D8 +_0200920E: + ldrb r1, [r4] + add r1, r8 + movs r0, #1 + strb r0, [r1] + pop {r3, r4} + mov r8, r3 + mov sb, r4 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02009228 +sub_02009228: @ 0x02009228 + ldr r2, =gUnknown_02022EB8 + ldr r0, =0x04000130 + ldrh r1, [r0] + ldr r3, =0x000003FF + adds r0, r3, #0 + adds r3, r0, #0 + eors r3, r1 + adds r0, r3, #0 + ldrh r1, [r2] + bics r0, r1 + ldr r1, =gUnknown_02022EB0 + strh r0, [r1] + ldrh r0, [r2] + cmp r0, r3 + beq _02009270 + ldr r0, =gUnknown_02022EB4 + strh r3, [r0] + ldr r1, =gUnknown_02021364 + ldr r0, =gUnknown_02021360 + ldrh r0, [r0] + b _02009298 + .align 2, 0 + .pool +_02009270: + ldr r1, =gUnknown_02021364 + ldrh r0, [r1] + subs r0, #1 + strh r0, [r1] + lsls r0, r0, #0x10 + cmp r0, #0 + bne _02009294 + ldr r0, =gUnknown_02022EB4 + strh r3, [r0] + ldr r0, =gUnknown_02021362 + ldrh r0, [r0] + b _02009298 + .align 2, 0 + .pool +_02009294: + ldr r1, =gUnknown_02022EB4 + movs r0, #0 +_02009298: + strh r0, [r1] + strh r3, [r2] + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_020092A4 +sub_020092A4: @ 0x020092A4 + ldr r2, =gUnknown_02021360 + strh r0, [r2] + ldr r0, =gUnknown_02021362 + strh r1, [r0] + ldr r1, =gUnknown_02021364 + movs r0, #1 + strh r0, [r1] + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_020092C0 +sub_020092C0: @ 0x020092C0 + push {lr} + movs r2, #0xf0 + ldrb r3, [r0] + ands r2, r3 + cmp r2, #0x20 + beq _020092E2 + cmp r2, #0x20 + bgt _020092D6 + cmp r2, #0x10 + beq _020092DC + b _020092EC +_020092D6: + cmp r2, #0x30 + beq _020092E8 + b _020092EC +_020092DC: + bl LZ77UnCompVRAM + b _020092EC +_020092E2: + bl HuffUnComp + b _020092EC +_020092E8: + bl RLUnCompVRAM +_020092EC: + pop {r0} + bx r0 + + thumb_func_start sub_020092F0 +sub_020092F0: @ 0x020092F0 + push {lr} + ldr r0, =gUnknown_02021368 + movs r1, #0 + strb r1, [r0] + ldr r0, =gUnknown_02021369 + strb r1, [r0] + bl m4aSoundInit + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200930C +sub_0200930C: @ 0x0200930C + ldr r1, =gUnknown_02021368 + movs r0, #1 + strb r0, [r1] + ldr r1, =gUnknown_02021369 + movs r0, #0 + strb r0, [r1] + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_02009324 +sub_02009324: @ 0x02009324 + ldr r1, =gUnknown_02021369 + cmp r0, #0 + beq _02009336 + ldr r0, =gUnknown_02021368 + ldrb r0, [r0] + cmp r0, #0 + beq _02009336 + movs r0, #1 + strb r0, [r1] +_02009336: + ldrb r0, [r1] + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_02009344 +sub_02009344: @ 0x02009344 + push {r4, lr} + lsls r0, r0, #0x10 + ldr r2, =gUnknown_0201DDF8 + ldr r1, =gUnknown_0201DE04 + lsrs r0, r0, #0xd + adds r0, r0, r1 + ldrh r3, [r0, #4] + lsls r1, r3, #1 + adds r1, r1, r3 + lsls r1, r1, #2 + adds r1, r1, r2 + ldr r4, [r1] + ldr r1, [r0] + adds r0, r4, #0 + bl MPlayStart + adds r0, r4, #0 + bl m4aMPlayFadeOutTemporarily + pop {r4} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02009378 +sub_02009378: @ 0x02009378 + push {lr} + lsls r0, r0, #0x10 + ldr r2, =gUnknown_0201DDF8 + ldr r1, =gUnknown_0201DE04 + lsrs r0, r0, #0xd + adds r0, r0, r1 + ldrh r3, [r0, #4] + lsls r1, r3, #1 + adds r1, r1, r3 + lsls r1, r1, #2 + adds r1, r1, r2 + ldr r0, [r1] + bl m4aMPlayStop + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_020093A0 +sub_020093A0: @ 0x020093A0 + push {lr} + bl m4aMPlayAllStop + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start sub_020093AC +sub_020093AC: @ 0x020093AC + movs r0, #1 + bx lr + + thumb_func_start sub_020093B0 +sub_020093B0: @ 0x020093B0 + push {r4, lr} + lsls r0, r0, #0x10 + lsrs r4, r0, #0x10 + lsls r1, r1, #0x10 + lsrs r3, r1, #0x14 + cmp r3, #0 + bne _020093C0 + movs r3, #1 +_020093C0: + ldr r2, =gUnknown_0201DDF8 + ldr r0, =gUnknown_0201DE04 + lsls r1, r4, #3 + adds r1, r1, r0 + ldrh r4, [r1, #4] + lsls r0, r4, #1 + adds r0, r0, r4 + lsls r0, r0, #2 + adds r0, r0, r2 + ldr r0, [r0] + adds r1, r3, #0 + bl m4aMPlayFadeOut + pop {r4} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_020093E8 +sub_020093E8: @ 0x020093E8 + push {r4, lr} + adds r2, r1, #0 + lsls r0, r0, #0x10 + lsls r2, r2, #0x10 + lsrs r2, r2, #0x10 + ldr r3, =gUnknown_0201DDF8 + ldr r1, =gUnknown_0201DE04 + lsrs r0, r0, #0xd + adds r0, r0, r1 + ldrh r4, [r0, #4] + lsls r1, r4, #1 + adds r1, r1, r4 + lsls r1, r1, #2 + adds r1, r1, r3 + ldr r0, [r1] + movs r1, #0xff + bl m4aMPlayVolumeControl + pop {r4} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200941C +sub_0200941C: @ 0x0200941C + push {r4, lr} + lsls r0, r0, #0x10 + lsls r1, r1, #0x10 + lsrs r1, r1, #0x10 + ldr r3, =gUnknown_0201DDF8 + ldr r2, =gUnknown_0201DE04 + lsrs r0, r0, #0xd + adds r0, r0, r2 + ldrh r4, [r0, #4] + lsls r2, r4, #1 + adds r2, r2, r4 + lsls r2, r2, #2 + adds r2, r2, r3 + ldr r0, [r2] + bl m4aMPlayTempoControl + pop {r4} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200944C +sub_0200944C: @ 0x0200944C + push {r4, lr} + adds r2, r1, #0 + lsls r0, r0, #0x10 + ldr r3, =gUnknown_0201DDF8 + ldr r1, =gUnknown_0201DE04 + lsrs r0, r0, #0xd + adds r0, r0, r1 + ldrh r4, [r0, #4] + lsls r1, r4, #1 + adds r1, r1, r4 + lsls r1, r1, #2 + adds r1, r1, r3 + ldr r0, [r1] + lsls r2, r2, #0x10 + asrs r2, r2, #0x10 + movs r1, #0xff + bl m4aMPlayPitchControl + pop {r4} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02009480 +sub_02009480: @ 0x02009480 + push {lr} + ldr r1, =gUnknown_02021369 + movs r0, #0 + strb r0, [r1] + bl m4aSoundVSyncOff + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02009494 +sub_02009494: @ 0x02009494 + push {lr} + bl m4aSoundVSyncOn + ldr r1, =gUnknown_02021369 + movs r0, #1 + strb r0, [r1] + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_020094A8 +sub_020094A8: @ 0x020094A8 + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + bl sub_02009D48 + adds r1, r0, #0 + movs r5, #0 + movs r4, #0 + ldr r2, =0x00000FFF +_020094BE: + adds r0, r1, r4 + ldrb r0, [r0] + adds r5, r0, r5 + adds r4, #1 + cmp r4, r2 + ble _020094BE + ldr r2, =gUnknown_02022EFC + movs r3, #0xff + ands r3, r5 + lsls r0, r3, #2 + ldr r1, =gUnknown_0202526C + adds r0, r0, r1 + str r0, [r2] + ldr r0, =gUnknown_02022ED0 + strh r5, [r0] + cmp r3, #0 + beq _020094EC + adds r4, r3, #0 +_020094E2: + bl sub_02009890 + subs r4, #1 + cmp r4, #0 + bne _020094E2 +_020094EC: + bl sub_02009890 + movs r1, #3 + ands r1, r0 + cmp r1, #1 + beq _020095D0 + cmp r1, #1 + bgt _02009514 + cmp r1, #0 + beq _02009522 + b _020097BE + .align 2, 0 + .pool +_02009514: + cmp r1, #2 + bne _0200951A + b _02009680 +_0200951A: + cmp r1, #3 + bne _02009520 + b _0200972C +_02009520: + b _020097BE +_02009522: + ldr r7, =gUnknown_02022ECC + ldr r0, =gUnknown_020251E8 + mov sl, r0 + ldr r0, [r0] + adds r0, #0x8c + ldr r4, [r0] + ldr r1, =gUnknown_02022EFC + mov r8, r1 + ldr r2, [r1] + mov sb, r2 + bl sub_02009890 + mov r1, r8 + ldr r6, [r1] + adds r6, r6, r4 + movs r5, #0xf + adds r1, r5, #0 + ands r1, r0 + lsls r1, r1, #2 + adds r6, r6, r1 + mov r2, r8 + str r6, [r2] + mov r0, sb + str r0, [r7] + ldr r7, =gUnknown_02022ED8 + mov r1, sl + ldr r0, [r1] + adds r0, #0x88 + ldr r0, [r0] + mov sb, r0 + bl sub_02009890 + mov r2, r8 + ldr r4, [r2] + add r4, sb + adds r1, r5, #0 + ands r1, r0 + lsls r1, r1, #2 + adds r4, r4, r1 + str r4, [r2] + str r6, [r7] + ldr r0, =gUnknown_02022EC0 + mov sb, r0 + bl sub_02009890 + mov r1, r8 + ldr r6, [r1] + ldr r2, =0x000083D0 + adds r6, r6, r2 + adds r1, r5, #0 + ands r1, r0 + lsls r1, r1, #2 + adds r6, r6, r1 + mov r0, r8 + str r6, [r0] + mov r1, sb + str r4, [r1] + ldr r2, =gUnknown_02022EC4 + mov sb, r2 + mov r1, sl + ldr r0, [r1] + adds r0, #0x8c + ldr r4, [r0] + bl sub_02009890 + mov r2, r8 + ldr r1, [r2] + adds r1, r1, r4 + ands r5, r0 + lsls r5, r5, #2 + adds r1, r1, r5 + b _0200965C + .align 2, 0 + .pool +_020095D0: + ldr r1, =gUnknown_02022EC0 + mov sb, r1 + ldr r2, =gUnknown_02022EFC + mov r8, r2 + ldr r5, [r2] + bl sub_02009890 + mov r1, r8 + ldr r6, [r1] + ldr r2, =0x000083D0 + adds r6, r6, r2 + movs r4, #0xf + adds r1, r4, #0 + ands r1, r0 + lsls r1, r1, #2 + adds r6, r6, r1 + mov r0, r8 + str r6, [r0] + mov r1, sb + str r5, [r1] + ldr r7, =gUnknown_02022EC4 + ldr r2, =gUnknown_020251E8 + mov sl, r2 + ldr r0, [r2] + adds r0, #0x8c + ldr r0, [r0] + mov sb, r0 + bl sub_02009890 + mov r1, r8 + ldr r5, [r1] + add r5, sb + adds r1, r4, #0 + ands r1, r0 + lsls r1, r1, #2 + adds r5, r5, r1 + mov r2, r8 + str r5, [r2] + str r6, [r7] + ldr r7, =gUnknown_02022ECC + mov r1, sl + ldr r0, [r1] + adds r0, #0x8c + ldr r0, [r0] + mov sb, r0 + bl sub_02009890 + mov r2, r8 + ldr r6, [r2] + add r6, sb + adds r1, r4, #0 + ands r1, r0 + lsls r1, r1, #2 + adds r6, r6, r1 + str r6, [r2] + str r5, [r7] + ldr r0, =gUnknown_02022ED8 + mov sb, r0 + mov r1, sl + ldr r0, [r1] + adds r0, #0x88 + ldr r5, [r0] + bl sub_02009890 + mov r2, r8 + ldr r1, [r2] + adds r1, r1, r5 + ands r4, r0 + lsls r4, r4, #2 + adds r1, r1, r4 +_0200965C: + str r1, [r2] + mov r0, sb + str r6, [r0] + b _020097BE + .align 2, 0 + .pool +_02009680: + ldr r1, =gUnknown_02022ED8 + mov sb, r1 + ldr r2, =gUnknown_020251E8 + mov sl, r2 + ldr r0, [r2] + adds r0, #0x88 + ldr r5, [r0] + ldr r0, =gUnknown_02022EFC + mov r8, r0 + ldr r6, [r0] + bl sub_02009890 + mov r1, r8 + ldr r4, [r1] + adds r4, r4, r5 + movs r5, #0xf + adds r1, r5, #0 + ands r1, r0 + lsls r1, r1, #2 + adds r4, r4, r1 + mov r2, r8 + str r4, [r2] + mov r0, sb + str r6, [r0] + ldr r7, =gUnknown_02022ECC + mov r1, sl + ldr r0, [r1] + adds r0, #0x8c + ldr r0, [r0] + mov sb, r0 + bl sub_02009890 + mov r2, r8 + ldr r6, [r2] + add r6, sb + adds r1, r5, #0 + ands r1, r0 + lsls r1, r1, #2 + adds r6, r6, r1 + str r6, [r2] + str r4, [r7] + ldr r7, =gUnknown_02022EC4 + mov r1, sl + ldr r0, [r1] + adds r0, #0x8c + ldr r0, [r0] + mov sb, r0 + bl sub_02009890 + mov r2, r8 + ldr r4, [r2] + add r4, sb + adds r1, r5, #0 + ands r1, r0 + lsls r1, r1, #2 + adds r4, r4, r1 + str r4, [r2] + str r6, [r7] + ldr r6, =gUnknown_02022EC0 + bl sub_02009890 + mov r2, r8 + ldr r1, [r2] + ldr r2, =0x000083D0 + adds r1, r1, r2 + ands r5, r0 + lsls r5, r5, #2 + adds r1, r1, r5 + mov r0, r8 + str r1, [r0] + str r4, [r6] + b _020097BE + .align 2, 0 + .pool +_0200972C: + ldr r1, =gUnknown_02022EC4 + mov sb, r1 + ldr r2, =gUnknown_020251E8 + mov sl, r2 + ldr r0, [r2] + adds r0, #0x8c + ldr r4, [r0] + ldr r0, =gUnknown_02022EFC + mov r8, r0 + ldr r6, [r0] + bl sub_02009890 + mov r1, r8 + ldr r5, [r1] + adds r5, r5, r4 + movs r4, #0xf + adds r1, r4, #0 + ands r1, r0 + lsls r1, r1, #2 + adds r5, r5, r1 + mov r2, r8 + str r5, [r2] + mov r0, sb + str r6, [r0] + ldr r1, =gUnknown_02022EC0 + mov sb, r1 + bl sub_02009890 + mov r2, r8 + ldr r6, [r2] + ldr r1, =0x000083D0 + adds r6, r6, r1 + adds r1, r4, #0 + ands r1, r0 + lsls r1, r1, #2 + adds r6, r6, r1 + str r6, [r2] + mov r2, sb + str r5, [r2] + ldr r7, =gUnknown_02022ED8 + mov r1, sl + ldr r0, [r1] + adds r0, #0x88 + ldr r0, [r0] + mov sb, r0 + bl sub_02009890 + mov r2, r8 + ldr r5, [r2] + add r5, sb + adds r1, r4, #0 + ands r1, r0 + lsls r1, r1, #2 + adds r5, r5, r1 + str r5, [r2] + str r6, [r7] + ldr r0, =gUnknown_02022ECC + mov sb, r0 + mov r1, sl + ldr r0, [r1] + adds r0, #0x8c + ldr r6, [r0] + bl sub_02009890 + mov r2, r8 + ldr r1, [r2] + adds r1, r1, r6 + ands r4, r0 + lsls r4, r4, #2 + adds r1, r1, r4 + str r1, [r2] + mov r0, sb + str r5, [r0] +_020097BE: + ldr r3, =gUnknown_02022EF4 + ldr r1, =gUnknown_02022ECC + ldr r0, =gUnknown_020251E8 + ldr r4, [r0] + adds r0, r4, #0 + adds r0, #0x94 + ldr r2, [r1] + ldr r1, [r0] + adds r0, r2, r1 + str r0, [r3] + ldr r3, =gUnknown_02022EEC + ldr r0, =gUnknown_02022EC4 + ldr r0, [r0] + adds r0, r0, r1 + str r0, [r3] + ldr r1, =gUnknown_02022EF0 + adds r0, r4, #0 + adds r0, #0x90 + ldr r0, [r0] + adds r0, r2, r0 + str r0, [r1] + ldr r3, =gUnknown_02022EC8 + ldr r0, =gUnknown_02022ED8 + ldr r0, [r0] + ldr r1, [r4, #0x58] + adds r0, r0, r1 + str r0, [r3] + ldr r1, =gUnknown_02022EF8 + ldr r0, [r4, #0x5c] + adds r0, r2, r0 + str r0, [r1] + ldr r1, =gUnknown_02022EE0 + ldr r0, [r4, #0x60] + adds r0, r2, r0 + str r0, [r1] + ldr r1, =gUnknown_02022ED4 + ldr r0, [r4, #0x50] + adds r0, r2, r0 + str r0, [r1] + ldr r1, =gUnknown_02022EE4 + ldr r0, [r4, #0x54] + adds r0, r2, r0 + str r0, [r1] + ldr r1, =gUnknown_02022EDC + adds r0, r4, #0 + adds r0, #0xf0 + ldr r0, [r0] + adds r0, r2, r0 + str r0, [r1] + ldr r1, =gUnknown_02022EE8 + adds r0, r4, #0 + adds r0, #0xf4 + ldr r0, [r0] + adds r0, r2, r0 + str r0, [r1] + ldr r1, =gUnknown_02022EBC + adds r0, r4, #0 + adds r0, #0xec + ldr r0, [r0] + adds r2, r2, r0 + str r2, [r1] + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02009890 +sub_02009890: @ 0x02009890 + ldr r1, =gUnknown_02022ED0 + ldr r0, =0x0000080D + ldrh r2, [r1] + muls r0, r2, r0 + adds r0, #7 + strh r0, [r1] + ldrh r0, [r1] + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_020098A8 +sub_020098A8: @ 0x020098A8 + push {r4, r5, r6, lr} + adds r5, r0, #0 + ldr r4, =gUnknown_02022EFC + ldr r6, [r4] + bl sub_02009890 + ldr r2, [r4] + adds r2, r2, r5 + movs r1, #0xf + ands r1, r0 + lsls r1, r1, #2 + adds r2, r2, r1 + str r2, [r4] + adds r0, r6, #0 + pop {r4, r5, r6} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_020098D0 +sub_020098D0: @ 0x020098D0 + ldr r0, =0x03004400 + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_020098D8 +sub_020098D8: @ 0x020098D8 + push {r4, r5, r6, lr} + adds r5, r0, #0 + adds r6, r1, #0 + ldr r4, =gUnknown_0202054C + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + adds r1, r0, #0 + adds r1, #0x88 + ldr r1, [r1] + strh r1, [r4, #4] + adds r0, #0x8c + ldr r0, [r0] + movs r1, #0xf8 + lsls r1, r1, #4 + bl __umodsi3 + strh r0, [r4, #0x24] + adds r4, #0x6c + movs r0, #0xfa + lsls r0, r0, #3 + strh r0, [r4] + bl sub_0200DF50 + lsls r0, r0, #0x10 + cmp r0, #0 + bne _0200994C + lsls r0, r5, #0x18 + lsrs r0, r0, #0x18 + adds r1, r6, #0 + bl sub_0200DB38 + lsls r0, r0, #0x10 + lsrs r1, r0, #0x10 + cmp r1, #0 + bne _0200994C + ldr r0, =gUnknown_02022F2C + str r1, [r0] + ldr r0, =gUnknown_02022F00 + strh r1, [r0] + ldr r0, =gUnknown_02022F28 + str r1, [r0] + ldr r1, =gUnknown_02021370 + movs r0, #0x80 + str r0, [r1] + movs r0, #0 + b _02009950 + .align 2, 0 + .pool +_0200994C: + movs r0, #1 + rsbs r0, r0, #0 +_02009950: + pop {r4, r5, r6} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_02009958 +sub_02009958: @ 0x02009958 + push {r4, r5, lr} + ldr r2, =gUnknown_0202054C + ldr r0, =gUnknown_02022ED8 + ldr r0, [r0] + str r0, [r2] + ldr r0, =gUnknown_02022ECC + ldr r1, [r0] + str r1, [r2, #8] + movs r5, #0xf8 + lsls r5, r5, #4 + adds r0, r1, r5 + str r0, [r2, #0x10] + movs r4, #0xf8 + lsls r4, r4, #5 + adds r0, r1, r4 + str r0, [r2, #0x18] + movs r3, #0xba + lsls r3, r3, #6 + adds r1, r1, r3 + str r1, [r2, #0x20] + ldr r0, =gUnknown_02022EC0 + ldr r0, [r0] + str r0, [r2, #0x28] + adds r5, r0, r5 + str r5, [r2, #0x30] + adds r4, r0, r4 + str r4, [r2, #0x38] + adds r3, r0, r3 + str r3, [r2, #0x40] + movs r3, #0xf8 + lsls r3, r3, #6 + adds r1, r0, r3 + str r1, [r2, #0x48] + movs r3, #0x9b + lsls r3, r3, #7 + adds r1, r0, r3 + str r1, [r2, #0x50] + movs r3, #0xba + lsls r3, r3, #7 + adds r1, r0, r3 + str r1, [r2, #0x58] + movs r3, #0xd9 + lsls r3, r3, #7 + adds r1, r0, r3 + str r1, [r2, #0x60] + movs r1, #0xf8 + lsls r1, r1, #7 + adds r0, r0, r1 + str r0, [r2, #0x68] + pop {r4, r5} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_020099D0 +sub_020099D0: @ 0x020099D0 + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #8 + str r0, [sp] + movs r0, #0 + mov sb, r0 + mov sl, r0 + movs r7, #0 + movs r1, #0 + mov r8, r1 + movs r5, #0 + ldr r6, =gUnknown_02022F30 +_020099EE: + lsls r0, r5, #0x18 + lsrs r0, r0, #0x18 + ldr r2, [r6] + movs r1, #0 + movs r3, #0x80 + lsls r3, r3, #5 + bl sub_0200DCC8 + ldr r2, [r6] + ldr r3, =0x00000FF8 + adds r0, r2, r3 + ldr r1, [r0] + ldr r0, =0x08012025 + cmp r1, r0 + bne _02009A6E + movs r0, #1 + mov r8, r0 + ldr r1, =0x00000FF4 + adds r0, r2, r1 + ldrh r0, [r0] + lsls r0, r0, #3 + ldr r3, [sp] + adds r0, r0, r3 + adds r4, r2, #0 + ldrh r3, [r0, #4] + movs r2, #0 + movs r1, #0 + b _02009A3E + .align 2, 0 + .pool +_02009A38: + ldm r4!, {r0} + adds r2, r2, r0 + adds r1, #1 +_02009A3E: + adds r0, r3, #0 + asrs r0, r0, #2 + cmp r1, r0 + blt _02009A38 + lsrs r0, r2, #0x10 + adds r0, r0, r2 + lsls r0, r0, #0x10 + lsrs r2, r0, #0x10 + ldr r1, [r6] + ldr r3, =0x00000FF6 + adds r0, r1, r3 + ldrh r0, [r0] + cmp r0, r2 + bne _02009A6E + ldr r2, =0x00000FFC + adds r0, r1, r2 + ldr r0, [r0] + mov sb, r0 + subs r3, #2 + adds r1, r1, r3 + movs r0, #1 + ldrh r1, [r1] + lsls r0, r1 + orrs r7, r0 +_02009A6E: + adds r0, r5, #1 + lsls r0, r0, #0x10 + lsrs r5, r0, #0x10 + cmp r5, #0xd + bls _020099EE + mov r0, r8 + cmp r0, #0 + beq _02009A9C + ldr r0, =0x00003FFF + movs r1, #0xff + str r1, [sp, #4] + cmp r7, r0 + bne _02009AA0 + movs r2, #1 + str r2, [sp, #4] + b _02009AA0 + .align 2, 0 + .pool +_02009A9C: + movs r3, #0 + str r3, [sp, #4] +_02009AA0: + movs r7, #0 + movs r0, #0 + mov r8, r0 + movs r5, #0 +_02009AA8: + adds r0, r5, #0 + adds r0, #0xe + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + ldr r1, =gUnknown_02022F30 + ldr r2, [r1] + movs r1, #0 + movs r3, #0x80 + lsls r3, r3, #5 + bl sub_0200DCC8 + ldr r3, =gUnknown_02022F30 + ldr r2, [r3] + ldr r1, =0x00000FF8 + adds r0, r2, r1 + ldr r1, [r0] + ldr r0, =0x08012025 + adds r6, r3, #0 + adds r5, #1 + cmp r1, r0 + bne _02009B32 + movs r3, #1 + mov r8, r3 + ldr r1, =0x00000FF4 + adds r0, r2, r1 + ldrh r0, [r0] + lsls r0, r0, #3 + ldr r3, [sp] + adds r0, r0, r3 + adds r4, r2, #0 + ldrh r3, [r0, #4] + movs r2, #0 + movs r1, #0 + b _02009B02 + .align 2, 0 + .pool +_02009AFC: + ldm r4!, {r0} + adds r2, r2, r0 + adds r1, #1 +_02009B02: + adds r0, r3, #0 + asrs r0, r0, #2 + cmp r1, r0 + blt _02009AFC + lsrs r0, r2, #0x10 + adds r0, r0, r2 + lsls r0, r0, #0x10 + lsrs r2, r0, #0x10 + ldr r1, [r6] + ldr r3, =0x00000FF6 + adds r0, r1, r3 + ldrh r0, [r0] + cmp r0, r2 + bne _02009B32 + ldr r2, =0x00000FFC + adds r0, r1, r2 + ldr r0, [r0] + mov sl, r0 + subs r3, #2 + adds r1, r1, r3 + movs r0, #1 + ldrh r1, [r1] + lsls r0, r1 + orrs r7, r0 +_02009B32: + lsls r0, r5, #0x10 + lsrs r5, r0, #0x10 + cmp r5, #0xd + bls _02009AA8 + mov r0, r8 + cmp r0, #0 + beq _02009B58 + ldr r0, =0x00003FFF + movs r1, #0xff + cmp r7, r0 + bne _02009B5A + movs r1, #1 + b _02009B5A + .align 2, 0 + .pool +_02009B58: + movs r1, #0 +_02009B5A: + ldr r2, [sp, #4] + cmp r2, #1 + bne _02009BCC + cmp r1, #1 + bne _02009BBC + movs r0, #1 + rsbs r0, r0, #0 + cmp sb, r0 + bne _02009B72 + mov r3, sl + cmp r3, #0 + beq _02009B7C +_02009B72: + mov r1, sb + cmp r1, #0 + bne _02009BA0 + cmp sl, r0 + bne _02009BA0 +_02009B7C: + mov r1, sb + adds r1, #1 + mov r0, sl + adds r0, #1 + cmp r1, r0 + bhs _02009B94 + ldr r0, =gUnknown_02022F2C + mov r2, sl + b _02009BB4 + .align 2, 0 + .pool +_02009B94: + ldr r0, =gUnknown_02022F2C + mov r3, sb + str r3, [r0] + b _02009BE4 + .align 2, 0 + .pool +_02009BA0: + cmp sb, sl + bhs _02009BB0 + ldr r0, =gUnknown_02022F2C + mov r1, sl + str r1, [r0] + b _02009BE4 + .align 2, 0 + .pool +_02009BB0: + ldr r0, =gUnknown_02022F2C + mov r2, sb +_02009BB4: + str r2, [r0] + b _02009BE4 + .align 2, 0 + .pool +_02009BBC: + ldr r0, =gUnknown_02022F2C + mov r3, sb + str r3, [r0] + cmp r1, #0xff + beq _02009BDC + b _02009BE4 + .align 2, 0 + .pool +_02009BCC: + cmp r1, #1 + bne _02009BE8 + ldr r0, =gUnknown_02022F2C + mov r1, sl + str r1, [r0] + ldr r2, [sp, #4] + cmp r2, #0xff + bne _02009BE4 +_02009BDC: + movs r0, #0xff + b _02009C14 + .align 2, 0 + .pool +_02009BE4: + movs r0, #1 + b _02009C14 +_02009BE8: + ldr r3, [sp, #4] + cmp r3, #0 + bne _02009C08 + cmp r1, #0 + bne _02009C08 + ldr r0, =gUnknown_02022F2C + str r1, [r0] + ldr r0, =gUnknown_02022F00 + strh r1, [r0] + movs r0, #0 + b _02009C14 + .align 2, 0 + .pool +_02009C08: + ldr r0, =gUnknown_02022F2C + movs r1, #0 + str r1, [r0] + ldr r0, =gUnknown_02022F00 + strh r1, [r0] + movs r0, #2 +_02009C14: + add sp, #8 + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_02009C2C +sub_02009C2C: @ 0x02009C2C + push {r4, r5, r6, r7, lr} + adds r5, r1, #0 + adds r6, r2, #0 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + ldr r4, =gUnknown_02022F30 + ldr r2, [r4] + movs r1, #0 + movs r3, #0x80 + lsls r3, r3, #5 + bl sub_0200DCC8 + ldr r0, [r4] + ldr r1, =0x00000FF4 + adds r0, r0, r1 + ldrh r1, [r0] + cmp r1, #0 + bne _02009C54 + ldr r0, =gUnknown_02022F00 + strh r5, [r0] +_02009C54: + lsls r0, r1, #3 + adds r1, r0, r6 + ldr r5, [r4] + ldrh r2, [r1, #4] + movs r3, #0 + movs r1, #0 + adds r7, r4, #0 + mov ip, r0 + b _02009C7A + .align 2, 0 + .pool +_02009C74: + ldm r5!, {r0} + adds r3, r3, r0 + adds r1, #1 +_02009C7A: + adds r0, r2, #0 + asrs r0, r0, #2 + cmp r1, r0 + blt _02009C74 + lsrs r0, r3, #0x10 + adds r0, r0, r3 + lsls r0, r0, #0x10 + lsrs r4, r0, #0x10 + ldr r3, [r7] + ldr r1, =0x00000FF8 + adds r0, r3, r1 + ldr r1, [r0] + ldr r0, =0x08012025 + cmp r1, r0 + bne _02009CC6 + ldr r1, =0x00000FF6 + adds r0, r3, r1 + ldrh r0, [r0] + cmp r0, r4 + bne _02009CC6 + movs r4, #0 + mov r3, ip + adds r0, r3, r6 + ldrh r0, [r0, #4] + cmp r4, r0 + bge _02009CC6 + adds r5, r7, #0 +_02009CB0: + adds r2, r3, r6 + ldr r1, [r2] + adds r1, r1, r4 + ldr r0, [r5] + adds r0, r0, r4 + ldrb r0, [r0] + strb r0, [r1] + adds r4, #1 + ldrh r2, [r2, #4] + cmp r4, r2 + blt _02009CB0 +_02009CC6: + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_02009CD8 +sub_02009CD8: @ 0x02009CD8 + push {r4, r5, r6, lr} + ldr r6, =gUnknown_0202054C + ldr r1, =gUnknown_02022F30 + ldr r0, =gUnknown_02022F40 + str r0, [r1] + ldr r0, =gUnknown_02022F2C + ldr r1, [r0] + movs r0, #1 + ands r1, r0 + lsls r0, r1, #3 + subs r0, r0, r1 + lsls r5, r0, #1 + movs r4, #0 +_02009CF2: + adds r0, r4, r5 + adds r1, r4, #0 + adds r2, r6, #0 + bl sub_02009C2C + adds r4, #1 + cmp r4, #0xd + ble _02009CF2 + ldr r0, =gUnknown_02021370 + ldr r4, [r0] + ldr r0, =gUnknown_02022ECC + ldr r0, [r0] + ldr r1, =gUnknown_02022EC4 + ldr r1, [r1] + ldr r2, =gUnknown_020251E8 + ldr r2, [r2] + adds r2, #0x8c + ldr r2, [r2] + lsls r2, r2, #0xa + lsrs r2, r2, #0xb + bl CpuSet + adds r0, r4, #0 + pop {r4, r5, r6} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_02009D48 +sub_02009D48: @ 0x02009D48 + push {r4, r5, r6, lr} + ldr r5, =gUnknown_020205BC + ldr r0, =gUnknown_02022F30 + ldr r6, =gUnknown_02022F40 + str r6, [r0] + ldr r4, =gUnknown_02021370 + adds r0, r5, #0 + bl sub_020099D0 + lsls r0, r0, #0x10 + lsrs r0, r0, #0x10 + str r0, [r4] + ldr r0, =gUnknown_02022F2C + ldr r1, [r0] + movs r0, #1 + ands r1, r0 + lsls r0, r1, #3 + subs r0, r0, r1 + lsls r0, r0, #1 + movs r1, #0 + adds r2, r5, #0 + bl sub_02009C2C + adds r0, r6, #0 + pop {r4, r5, r6} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_02009D94 +sub_02009D94: @ 0x02009D94 + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + adds r4, r1, #0 + lsls r0, r0, #0x10 + lsrs r6, r0, #0x10 + ldr r0, =gUnknown_02022F00 + ldrh r0, [r0] + adds r0, r0, r6 + lsls r0, r0, #0x10 + lsrs r5, r0, #0x10 + adds r0, r5, #0 + movs r1, #0xe + bl __umodsi3 + lsls r0, r0, #0x10 + lsrs r5, r0, #0x10 + ldr r2, =gUnknown_02022F2C + ldr r1, [r2] + movs r0, #1 + ands r1, r0 + lsls r0, r1, #3 + subs r0, r0, r1 + lsls r0, r0, #1 + adds r0, r5, r0 + lsls r0, r0, #0x10 + lsrs r5, r0, #0x10 + lsls r0, r6, #3 + adds r0, r0, r4 + ldr r1, [r0] + mov sl, r1 + ldrh r4, [r0, #4] + movs r3, #0 + mov sb, r2 + ldr r2, =gUnknown_02022F30 + mov r8, r2 + mov ip, r8 + movs r2, #0 + ldr r1, =0x00000FFF +_02009DE6: + mov r7, ip + ldr r0, [r7] + adds r0, r0, r3 + strb r2, [r0] + adds r0, r3, #1 + lsls r0, r0, #0x10 + lsrs r3, r0, #0x10 + cmp r3, r1 + bls _02009DE6 + mov r0, r8 + ldr r1, [r0] + ldr r2, =0x00000FF4 + adds r0, r1, r2 + strh r6, [r0] + ldr r6, =0x00000FF8 + adds r2, r1, r6 + ldr r0, =0x08012025 + str r0, [r2] + ldr r7, =0x00000FFC + adds r1, r1, r7 + mov r2, sb + ldr r0, [r2] + str r0, [r1] + movs r3, #0 + lsls r5, r5, #0x18 + cmp r3, r4 + bhs _02009E34 + mov r2, r8 +_02009E1E: + ldr r1, [r2] + adds r1, r1, r3 + mov r6, sl + adds r0, r6, r3 + ldrb r0, [r0] + strb r0, [r1] + adds r0, r3, #1 + lsls r0, r0, #0x10 + lsrs r3, r0, #0x10 + cmp r3, r4 + blo _02009E1E +_02009E34: + mov r3, sl + movs r2, #0 + movs r1, #0 + b _02009E62 + .align 2, 0 + .pool +_02009E5C: + ldm r3!, {r0} + adds r2, r2, r0 + adds r1, #1 +_02009E62: + adds r0, r4, #0 + asrs r0, r0, #2 + cmp r1, r0 + blt _02009E5C + lsrs r0, r2, #0x10 + adds r0, r0, r2 + mov r7, r8 + ldr r4, [r7] + ldr r2, =0x00000FF6 + adds r1, r4, r2 + strh r0, [r1] + lsrs r5, r5, #0x18 + bl sub_02009480 + adds r0, r5, #0 + adds r1, r4, #0 + bl sub_0200DEC4 + adds r4, r0, #0 + bl sub_02009494 + cmp r4, #0 + beq _02009EA8 + ldr r2, =gUnknown_02022F28 + movs r1, #1 + lsls r1, r5 + ldr r0, [r2] + orrs r0, r1 + str r0, [r2] + movs r0, #0xff + b _02009EB6 + .align 2, 0 + .pool +_02009EA8: + ldr r2, =gUnknown_02022F28 + movs r1, #1 + lsls r1, r5 + ldr r0, [r2] + bics r0, r1 + str r0, [r2] + movs r0, #1 +_02009EB6: + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_02009EC8 +sub_02009EC8: @ 0x02009EC8 + push {r4, r5, r6, lr} + ldr r6, =gUnknown_0202054C + ldr r1, =gUnknown_02022F30 + ldr r0, =gUnknown_02022F40 + str r0, [r1] + ldr r0, =gUnknown_02022F24 + ldr r4, =gUnknown_02022F00 + ldrh r1, [r4] + strh r1, [r0] + ldr r2, =gUnknown_02022F04 + ldr r5, =gUnknown_02022F2C + ldr r0, [r5] + str r0, [r2] + adds r1, #1 + strh r1, [r4] + ldrh r0, [r4] + movs r1, #0xe + bl __umodsi3 + strh r0, [r4] + ldr r0, [r5] + adds r0, #1 + str r0, [r5] + movs r5, #1 + movs r4, #0 +_02009EFA: + lsls r0, r4, #0x10 + lsrs r0, r0, #0x10 + adds r1, r6, #0 + bl sub_02009D94 + adds r4, #1 + cmp r4, #0xd + ble _02009EFA + ldr r0, =gUnknown_02022F28 + ldr r0, [r0] + cmp r0, #0 + beq _02009F24 + movs r5, #0xff + ldr r1, =gUnknown_02022F00 + ldr r0, =gUnknown_02022F24 + ldrh r0, [r0] + strh r0, [r1] + ldr r1, =gUnknown_02022F2C + ldr r0, =gUnknown_02022F04 + ldr r0, [r0] + str r0, [r1] +_02009F24: + adds r0, r5, #0 + pop {r4, r5, r6} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_02009F4C +sub_02009F4C: @ 0x02009F4C + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #4 + adds r4, r1, #0 + lsls r0, r0, #0x10 + lsrs r6, r0, #0x10 + ldr r0, =gUnknown_02022F00 + ldrh r0, [r0] + adds r0, r0, r6 + lsls r0, r0, #0x10 + lsrs r5, r0, #0x10 + adds r0, r5, #0 + movs r1, #0xe + bl __umodsi3 + lsls r0, r0, #0x10 + lsrs r5, r0, #0x10 + ldr r2, =gUnknown_02022F2C + ldr r1, [r2] + movs r0, #1 + ands r1, r0 + lsls r0, r1, #3 + subs r0, r0, r1 + lsls r0, r0, #1 + adds r0, r5, r0 + lsls r0, r0, #0x10 + lsrs r5, r0, #0x10 + lsls r0, r6, #3 + adds r0, r0, r4 + ldr r1, [r0] + str r1, [sp] + ldrh r3, [r0, #4] + movs r4, #0 + mov sb, r2 + ldr r2, =gUnknown_02022F30 + mov r8, r2 + ldr r7, =gUnknown_02025244 + mov sl, r7 + mov ip, r8 + movs r2, #0 + ldr r1, =0x00000FFF +_02009FA4: + mov r7, ip + ldr r0, [r7] + adds r0, r0, r4 + strb r2, [r0] + adds r0, r4, #1 + lsls r0, r0, #0x10 + lsrs r4, r0, #0x10 + cmp r4, r1 + bls _02009FA4 + mov r0, r8 + ldr r1, [r0] + ldr r2, =0x00000FF4 + adds r0, r1, r2 + strh r6, [r0] + ldr r6, =0x00000FF8 + adds r2, r1, r6 + ldr r0, =0x08012025 + str r0, [r2] + ldr r7, =0x00000FFC + adds r1, r1, r7 + mov r2, sb + ldr r0, [r2] + str r0, [r1] + movs r4, #0 + lsls r6, r5, #0x18 + mov sb, r6 + cmp r4, r3 + bhs _02009FF4 + mov r2, r8 +_02009FDE: + ldr r1, [r2] + adds r1, r1, r4 + ldr r7, [sp] + adds r0, r7, r4 + ldrb r0, [r0] + strb r0, [r1] + adds r0, r4, #1 + lsls r0, r0, #0x10 + lsrs r4, r0, #0x10 + cmp r4, r3 + blo _02009FDE +_02009FF4: + ldr r4, [sp] + movs r2, #0 + movs r1, #0 + b _0200A026 + .align 2, 0 + .pool +_0200A020: + ldm r4!, {r0} + adds r2, r2, r0 + adds r1, #1 +_0200A026: + adds r0, r3, #0 + asrs r0, r0, #2 + cmp r1, r0 + blt _0200A020 + lsrs r0, r2, #0x10 + adds r0, r0, r2 + mov r2, r8 + ldr r1, [r2] + ldr r6, =0x00000FF6 + adds r1, r1, r6 + strh r0, [r1] + mov r7, sl + ldr r1, [r7] + adds r0, r5, #0 + bl _call_via_r1 + movs r6, #1 + movs r4, #0 + ldr r0, =0x00000FF7 + mov r8, r0 + ldr r7, =gUnknown_02025238 + b _0200A066 + .align 2, 0 + .pool +_0200A060: + adds r0, r4, #1 + lsls r0, r0, #0x10 + lsrs r4, r0, #0x10 +_0200A066: + cmp r4, r8 + bhi _0200A084 + ldr r0, =gUnknown_02022F30 + ldr r0, [r0] + adds r0, r0, r4 + ldrb r2, [r0] + ldr r3, [r7] + adds r0, r5, #0 + adds r1, r4, #0 + bl _call_via_r3 + lsls r0, r0, #0x10 + cmp r0, #0 + beq _0200A060 + movs r6, #0xff +_0200A084: + cmp r6, #0xff + bne _0200A094 + mov r1, sb + lsrs r0, r1, #0x18 + b _0200A0F4 + .align 2, 0 + .pool +_0200A094: + movs r6, #1 + movs r4, #0 + ldr r2, =gUnknown_02025238 + mov r8, r2 + ldr r7, =0x00000FF9 + b _0200A0AE + .align 2, 0 + .pool +_0200A0A8: + adds r0, r4, #1 + lsls r0, r0, #0x10 + lsrs r4, r0, #0x10 +_0200A0AE: + cmp r4, #6 + bhi _0200A0D0 + adds r1, r4, r7 + ldr r0, =gUnknown_02022F30 + ldr r0, [r0] + adds r0, r4, r0 + adds r0, r0, r7 + ldrb r2, [r0] + mov r0, r8 + ldr r3, [r0] + adds r0, r5, #0 + bl _call_via_r3 + lsls r0, r0, #0x10 + cmp r0, #0 + beq _0200A0A8 + movs r6, #0xff +_0200A0D0: + cmp r6, #0xff + beq _0200A0F0 + mov r1, sb + lsrs r0, r1, #0x18 + ldr r2, =gUnknown_02022F28 + movs r1, #1 + lsls r1, r0 + ldr r0, [r2] + bics r0, r1 + str r0, [r2] + movs r0, #1 + b _0200A102 + .align 2, 0 + .pool +_0200A0F0: + mov r2, sb + lsrs r0, r2, #0x18 +_0200A0F4: + ldr r2, =gUnknown_02022F28 + movs r1, #1 + lsls r1, r0 + ldr r0, [r2] + orrs r0, r1 + str r0, [r2] + movs r0, #0xff +_0200A102: + add sp, #4 + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200A118 +sub_0200A118: @ 0x0200A118 + push {r4, r5, lr} + lsls r0, r0, #0x10 + lsrs r0, r0, #0x10 + ldr r1, =gUnknown_02022F00 + ldrh r1, [r1] + adds r0, r1, r0 + subs r0, #1 + lsls r0, r0, #0x10 + lsrs r4, r0, #0x10 + adds r0, r4, #0 + movs r1, #0xe + bl __umodsi3 + lsls r0, r0, #0x10 + lsrs r4, r0, #0x10 + ldr r0, =gUnknown_02022F2C + ldr r1, [r0] + movs r5, #1 + ands r1, r5 + lsls r0, r1, #3 + subs r0, r0, r1 + lsls r0, r0, #1 + adds r0, r4, r0 + lsls r0, r0, #0x10 + lsrs r4, r0, #0x10 + bl sub_02009480 + ldr r3, =gUnknown_02025238 + ldr r1, =0x00000FF8 + ldr r0, =gUnknown_02022F30 + ldr r0, [r0] + adds r0, r0, r1 + ldrb r2, [r0] + ldr r3, [r3] + adds r0, r4, #0 + bl _call_via_r3 + lsls r0, r0, #0x10 + cmp r0, #0 + bne _0200A198 + lsls r0, r4, #0x18 + lsrs r0, r0, #0x18 + ldr r2, =gUnknown_02022F28 + adds r1, r5, #0 + lsls r1, r0 + ldr r0, [r2] + bics r0, r1 + str r0, [r2] + bl sub_02009494 + movs r0, #1 + b _0200A1AE + .align 2, 0 + .pool +_0200A198: + lsls r0, r4, #0x18 + lsrs r0, r0, #0x18 + ldr r2, =gUnknown_02022F28 + adds r1, r5, #0 + lsls r1, r0 + ldr r0, [r2] + orrs r0, r1 + str r0, [r2] + bl sub_02009494 + movs r0, #0xff +_0200A1AE: + pop {r4, r5} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200A1B8 +sub_0200A1B8: @ 0x0200A1B8 + push {r4, r5, lr} + lsls r0, r0, #0x10 + lsrs r0, r0, #0x10 + ldr r1, =gUnknown_02022F00 + ldrh r1, [r1] + adds r0, r1, r0 + subs r0, #1 + lsls r0, r0, #0x10 + lsrs r4, r0, #0x10 + adds r0, r4, #0 + movs r1, #0xe + bl __umodsi3 + lsls r0, r0, #0x10 + lsrs r4, r0, #0x10 + ldr r0, =gUnknown_02022F2C + ldr r1, [r0] + movs r5, #1 + ands r1, r5 + lsls r0, r1, #3 + subs r0, r0, r1 + lsls r0, r0, #1 + adds r0, r4, r0 + lsls r0, r0, #0x10 + lsrs r4, r0, #0x10 + bl sub_02009480 + ldr r3, =gUnknown_02025238 + ldr r1, =0x00000FF8 + ldr r0, =gUnknown_02022F30 + ldr r0, [r0] + adds r0, r0, r1 + ldrb r0, [r0] + mvns r2, r0 + lsls r2, r2, #0x18 + lsrs r2, r2, #0x18 + ldr r3, [r3] + adds r0, r4, #0 + bl _call_via_r3 + lsls r0, r0, #0x10 + cmp r0, #0 + bne _0200A240 + lsls r0, r4, #0x18 + lsrs r0, r0, #0x18 + ldr r2, =gUnknown_02022F28 + adds r1, r5, #0 + lsls r1, r0 + ldr r0, [r2] + bics r0, r1 + str r0, [r2] + bl sub_02009494 + movs r0, #1 + b _0200A256 + .align 2, 0 + .pool +_0200A240: + lsls r0, r4, #0x18 + lsrs r0, r0, #0x18 + ldr r2, =gUnknown_02022F28 + adds r1, r5, #0 + lsls r1, r0 + ldr r0, [r2] + orrs r0, r1 + str r0, [r2] + bl sub_02009494 + movs r0, #0xff +_0200A256: + pop {r4, r5} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200A260 +sub_0200A260: @ 0x0200A260 + push {r4, lr} +_0200A262: + ldr r1, =gUnknown_0202054C + ldr r4, =gUnknown_02023F40 + ldrh r0, [r4] + cmp r0, #0xd + bge _0200A290 + bl sub_02009D94 + ldr r0, =gUnknown_02022F28 + ldr r0, [r0] + movs r1, #0xff + cmp r0, #0 + bne _0200A292 + movs r1, #1 + ldrh r0, [r4] + adds r0, #1 + strh r0, [r4] + b _0200A292 + .align 2, 0 + .pool +_0200A290: + movs r1, #0xff +_0200A292: + adds r4, r1, #0 + ldr r0, =gUnknown_02022F28 + ldr r0, [r0] + cmp r0, #0 + beq _0200A2B0 + bl sub_0200A554 + lsls r0, r0, #0x18 + cmp r0, #0 + beq _0200A262 + ldr r0, =gUnknown_02022F10 + movs r1, #1 + ldrb r2, [r0, #4] + orrs r1, r2 + strb r1, [r0, #4] +_0200A2B0: + cmp r4, #0xff + beq _0200A2C0 + movs r0, #0 + b _0200A2C2 + .align 2, 0 + .pool +_0200A2C0: + movs r0, #1 +_0200A2C2: + pop {r4} + pop {r1} + bx r1 + + thumb_func_start sub_0200A2C8 +sub_0200A2C8: @ 0x0200A2C8 + push {r4, r5, lr} + cmp r0, #1 + bne _0200A2D0 + b _0200A42C +_0200A2D0: + cmp r0, #1 + bgt _0200A2DA + cmp r0, #0 + beq _0200A2E2 + b _0200A4AE +_0200A2DA: + cmp r0, #2 + bne _0200A2E0 + b _0200A478 +_0200A2E0: + b _0200A4AE +_0200A2E2: + ldr r2, =gUnknown_02022F10 + ldr r1, [r2, #8] + movs r0, #1 + orrs r1, r0 + movs r0, #0xfe + ldrb r3, [r2, #4] + ands r0, r3 + strb r0, [r2, #4] + movs r0, #7 + rsbs r0, r0, #0 + ands r1, r0 + str r1, [r2, #8] + ldr r0, =gUnknown_02022ED8 + ldr r3, [r0] + movs r1, #0 + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + adds r0, #0x88 + ldr r0, [r0] + cmp r1, r0 + bhs _0200A31C + adds r2, r0, #0 +_0200A30E: + adds r0, r3, r1 + ldrb r0, [r0] + cmp r0, #0 + bne _0200A354 + adds r1, #1 + cmp r1, r2 + blo _0200A30E +_0200A31C: + movs r4, #0 + ldr r5, =gUnknown_02025244 +_0200A320: + lsls r0, r4, #0x10 + lsrs r0, r0, #0x10 + ldr r1, [r5] + bl _call_via_r1 + adds r4, #1 + cmp r4, #0x1f + ble _0200A320 + ldr r0, =gUnknown_02022F2C + movs r3, #0 + str r3, [r0] + ldr r0, =gUnknown_02022F00 + strh r3, [r0] + ldr r0, =gUnknown_02022F28 + str r3, [r0] + ldr r1, =gUnknown_02021370 + movs r0, #0x80 + str r0, [r1] + ldr r2, =gUnknown_02022F10 + ldr r0, [r2, #8] + movs r1, #8 + orrs r0, r1 + str r0, [r2, #8] + movs r0, #4 + strb r0, [r2, #1] + strh r3, [r2, #0x10] +_0200A354: + ldr r1, =gUnknown_02022F30 + ldr r0, =gUnknown_02022F40 + str r0, [r1] + ldr r0, =gUnknown_02022F24 + ldr r4, =gUnknown_02022F00 + ldrh r1, [r4] + strh r1, [r0] + ldr r2, =gUnknown_02022F04 + ldr r5, =gUnknown_02022F2C + ldr r0, [r5] + str r0, [r2] + adds r1, #1 + strh r1, [r4] + ldrh r0, [r4] + movs r1, #0xe + bl __umodsi3 + strh r0, [r4] + ldr r0, [r5] + adds r0, #1 + str r0, [r5] + ldr r1, =gUnknown_02023F40 + movs r0, #0 + strh r0, [r1] + ldr r0, =gUnknown_02022F28 + movs r1, #0 + str r1, [r0] + ldr r4, =gUnknown_02022F10 + ldrb r0, [r4, #1] + adds r0, #1 + strb r0, [r4, #1] + strh r1, [r4, #0x10] + movs r0, #5 + bl sub_02008600 + movs r5, #1 + b _0200A3DE + .align 2, 0 + .pool +_0200A3D4: + adds r0, r5, #0 + ldrb r1, [r4, #4] + ands r0, r1 + cmp r0, #0 + bne _0200A46E +_0200A3DE: + bl sub_0200A260 + cmp r0, #0 + beq _0200A3D4 + ldr r1, =gUnknown_0202136C + movs r0, #0 + strb r0, [r1] +_0200A3EC: + ldr r4, =gUnknown_0202054C + bl sub_02009480 + movs r0, #0xd + adds r1, r4, #0 + bl sub_02009F4C + bl sub_02009494 + ldr r0, =gUnknown_02022F28 + ldr r0, [r0] + cmp r0, #0 + beq _0200A462 + bl sub_0200A554 + lsls r0, r0, #0x18 + cmp r0, #0 + beq _0200A3EC + ldr r0, =gUnknown_02022F10 + movs r1, #1 + ldrb r2, [r0, #4] + orrs r1, r2 + b _0200A460 + .align 2, 0 + .pool +_0200A42C: + movs r4, #0 +_0200A42E: + ldr r1, =gUnknown_0202054C + movs r0, #0xe + bl sub_0200A118 + ldr r1, =gUnknown_02022F28 + ldr r0, [r1] + cmp r0, #0 + beq _0200A462 + adds r0, r4, #1 + lsls r0, r0, #0x18 + lsrs r4, r0, #0x18 + cmp r4, #3 + bhi _0200A458 + movs r0, #0 + str r0, [r1] + b _0200A42E + .align 2, 0 + .pool +_0200A458: + ldr r0, =gUnknown_02022F10 + movs r1, #1 + ldrb r3, [r0, #4] + orrs r1, r3 +_0200A460: + strb r1, [r0, #4] +_0200A462: + ldr r1, =gUnknown_02022F10 + movs r0, #1 + ldrb r1, [r1, #4] + ands r0, r1 + cmp r0, #0 + beq _0200A4AE +_0200A46E: + movs r0, #1 + b _0200A4B0 + .align 2, 0 + .pool +_0200A478: + movs r4, #0 +_0200A47A: + ldr r1, =gUnknown_0202054C + movs r0, #0xe + bl sub_0200A1B8 + ldr r1, =gUnknown_02022F28 + ldr r0, [r1] + cmp r0, #0 + beq _0200A4AE + adds r0, r4, #1 + lsls r0, r0, #0x18 + lsrs r4, r0, #0x18 + cmp r4, #3 + bhi _0200A4A4 + movs r0, #0 + str r0, [r1] + b _0200A47A + .align 2, 0 + .pool +_0200A4A4: + ldr r0, =gUnknown_02022F10 + movs r1, #1 + ldrb r2, [r0, #4] + orrs r1, r2 + strb r1, [r0, #4] +_0200A4AE: + movs r0, #0 +_0200A4B0: + pop {r4, r5} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200A4BC +sub_0200A4BC: @ 0x0200A4BC + push {r4, r5, r6, r7, lr} + mov r7, sb + mov r6, r8 + push {r6, r7} + lsls r0, r0, #0x10 + lsrs r6, r0, #0x10 + movs r5, #0 + bl sub_02009480 + ldr r0, =0x00000FFF + mov sb, r0 + ldr r0, =gUnknown_02025238 + mov r8, r0 + ldr r7, =gUnknown_02022F40 +_0200A4D8: + movs r4, #0 + adds r5, #1 +_0200A4DC: + mov r0, r8 + ldr r3, [r0] + adds r0, r6, #0 + adds r1, r4, #0 + movs r2, #0 + bl _call_via_r3 + adds r0, r4, #1 + lsls r0, r0, #0x10 + lsrs r4, r0, #0x10 + cmp r4, sb + bls _0200A4DC + adds r0, r6, #0 + movs r1, #0 + adds r2, r7, #0 + movs r3, #0x80 + lsls r3, r3, #5 + bl sub_0200DCC8 + adds r2, r7, #0 + movs r1, #0 + ldr r3, =0x000003FF +_0200A508: + ldr r0, [r2] + cmp r0, #0 + beq _0200A524 + movs r0, #1 + b _0200A532 + .align 2, 0 + .pool +_0200A524: + adds r0, r1, #1 + lsls r0, r0, #0x10 + lsrs r1, r0, #0x10 + adds r2, #4 + cmp r1, r3 + bls _0200A508 + movs r0, #0 +_0200A532: + adds r4, r0, #0 + lsls r0, r5, #0x10 + lsrs r5, r0, #0x10 + cmp r4, #0 + beq _0200A540 + cmp r5, #0x81 + bls _0200A4D8 +_0200A540: + bl sub_02009494 + adds r0, r4, #0 + pop {r3, r4} + mov r8, r3 + mov sb, r4 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200A554 +sub_0200A554: @ 0x0200A554 + push {r4, r5, r6, lr} + ldr r2, =gUnknown_02022F10 + ldr r0, [r2, #8] + movs r1, #2 + orrs r0, r1 + str r0, [r2, #8] + ldr r0, =gUnknown_02022F28 + ldr r1, [r0] + cmp r1, #0 + beq _0200A5B8 + ldr r0, =gUnknown_0202136C + ldrb r0, [r0] + cmp r0, #2 + bhi _0200A5B8 + adds r6, r1, #0 + movs r4, #0 +_0200A574: + movs r5, #1 + lsls r5, r4 + adds r0, r6, #0 + ands r0, r5 + cmp r0, #0 + beq _0200A58E + adds r0, r4, #0 + bl sub_0200A4BC + lsls r0, r0, #0x18 + cmp r0, #0 + bne _0200A58E + bics r6, r5 +_0200A58E: + adds r0, r4, #1 + lsls r0, r0, #0x10 + lsrs r4, r0, #0x10 + cmp r4, #0x1f + bls _0200A574 + ldr r0, =gUnknown_02022F28 + str r6, [r0] + ldr r1, =gUnknown_0202136C + ldrb r0, [r1] + adds r0, #1 + strb r0, [r1] + cmp r6, #0 + bne _0200A5B8 + movs r0, #0 + b _0200A5BA + .align 2, 0 + .pool +_0200A5B8: + movs r0, #1 +_0200A5BA: + pop {r4, r5, r6} + pop {r1} + bx r1 + + thumb_func_start sub_0200A5C0 +sub_0200A5C0: @ 0x0200A5C0 + ldr r0, =gUnknown_02022F40 + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_0200A5C8 +sub_0200A5C8: @ 0x0200A5C8 + ldr r0, =gUnknown_02022F2C + movs r1, #0 + str r1, [r0] + ldr r0, =gUnknown_02022F00 + strh r1, [r0] + ldr r0, =gUnknown_02022F28 + str r1, [r0] + ldr r1, =gUnknown_02021370 + movs r0, #0x80 + str r0, [r1] + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_0200A5F0 +sub_0200A5F0: @ 0x0200A5F0 + push {r4, r5, lr} + movs r4, #0 + ldr r5, =gUnknown_02025244 +_0200A5F6: + lsls r0, r4, #0x10 + lsrs r0, r0, #0x10 + ldr r1, [r5] + bl _call_via_r1 + adds r4, #1 + cmp r4, #0x1f + ble _0200A5F6 + ldr r0, =gUnknown_02022F2C + movs r1, #0 + str r1, [r0] + ldr r0, =gUnknown_02022F00 + strh r1, [r0] + ldr r0, =gUnknown_02022F28 + str r1, [r0] + ldr r1, =gUnknown_02021370 + movs r0, #0x80 + str r0, [r1] + pop {r4, r5} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200A634 +sub_0200A634: @ 0x0200A634 + push {r4, r5, r6, lr} + adds r6, r0, #0 + ldr r0, =gUnknown_02022F2C + ldr r1, [r0] + movs r0, #1 + ands r1, r0 + lsls r0, r1, #3 + subs r0, r0, r1 + lsls r5, r0, #1 + movs r4, #0 +_0200A648: + adds r0, r4, r5 + adds r1, r4, #0 + adds r2, r6, #0 + bl sub_02009C2C + adds r4, #1 + cmp r4, #0xd + ble _0200A648 + movs r0, #1 + pop {r4, r5, r6} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200A664 +sub_0200A664: @ 0x0200A664 + push {r4, r5, r6, lr} + adds r2, r0, #0 + adds r6, r1, #0 + ldr r1, =gUnknown_02022F30 + ldr r0, =gUnknown_02022F40 + str r0, [r1] + cmp r2, #0 + beq _0200A684 + cmp r2, #1 + beq _0200A6B4 + b _0200A6D6 + .align 2, 0 + .pool +_0200A684: + ldr r4, =gUnknown_02021370 + adds r0, r6, #0 + bl sub_020099D0 + lsls r0, r0, #0x10 + lsrs r0, r0, #0x10 + str r0, [r4] + ldr r0, =gUnknown_02022F2C + ldr r1, [r0] + movs r0, #1 + ands r1, r0 + lsls r0, r1, #3 + subs r0, r0, r1 + lsls r0, r0, #1 + movs r1, #0 + adds r2, r6, #0 + bl sub_02009C2C + ldr r0, [r4] + b _0200A6D6 + .align 2, 0 + .pool +_0200A6B4: + ldr r0, =gUnknown_02022F2C + ldr r1, [r0] + ands r1, r2 + lsls r0, r1, #3 + subs r0, r0, r1 + lsls r5, r0, #1 + movs r4, #0 +_0200A6C2: + adds r0, r4, r5 + adds r1, r4, #0 + adds r2, r6, #0 + bl sub_02009C2C + adds r4, #1 + cmp r4, #0xd + ble _0200A6C2 + ldr r0, =gUnknown_02021370 + ldr r0, [r0] +_0200A6D6: + pop {r4, r5, r6} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200A6E4 +sub_0200A6E4: @ 0x0200A6E4 + push {r4, r5, r6, r7, lr} + adds r7, r1, #0 + lsls r0, r0, #0x10 + lsrs r2, r0, #0x10 + ldr r1, =gUnknown_02022F30 + ldr r0, =gUnknown_02022F40 + str r0, [r1] + ldr r0, =0x0000FFFF + cmp r2, r0 + beq _0200A710 + adds r0, r2, #0 + adds r1, r7, #0 + bl sub_02009D94 + adds r5, r0, #0 + b _0200A760 + .align 2, 0 + .pool +_0200A710: + ldr r1, =gUnknown_02022F24 + ldr r5, =gUnknown_02022F00 + ldrh r0, [r5] + strh r0, [r1] + ldr r1, =gUnknown_02022F04 + ldr r6, =gUnknown_02022F2C + ldr r4, [r6] + str r4, [r1] + adds r0, #1 + strh r0, [r5] + ldrh r0, [r5] + movs r1, #0xe + bl __umodsi3 + strh r0, [r5] + adds r4, #1 + str r4, [r6] + movs r5, #1 + movs r4, #0 +_0200A736: + lsls r0, r4, #0x10 + lsrs r0, r0, #0x10 + adds r1, r7, #0 + bl sub_02009D94 + adds r4, #1 + cmp r4, #0xd + ble _0200A736 + ldr r0, =gUnknown_02022F28 + ldr r0, [r0] + cmp r0, #0 + beq _0200A760 + movs r5, #0xff + ldr r1, =gUnknown_02022F00 + ldr r0, =gUnknown_02022F24 + ldrh r0, [r0] + strh r0, [r1] + ldr r1, =gUnknown_02022F2C + ldr r0, =gUnknown_02022F04 + ldr r0, [r0] + str r0, [r1] +_0200A760: + adds r0, r5, #0 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200A77C +sub_0200A77C: @ 0x0200A77C + push {r4, r5, r6, lr} + ldr r1, =gUnknown_02022F30 + ldr r0, =gUnknown_02022F40 + str r0, [r1] + ldr r1, =gUnknown_02022F24 + ldr r5, =gUnknown_02022F00 + ldrh r0, [r5] + strh r0, [r1] + ldr r1, =gUnknown_02022F04 + ldr r6, =gUnknown_02022F2C + ldr r4, [r6] + str r4, [r1] + adds r0, #1 + strh r0, [r5] + ldrh r0, [r5] + movs r1, #0xe + bl __umodsi3 + strh r0, [r5] + adds r4, #1 + str r4, [r6] + ldr r1, =gUnknown_02023F40 + movs r0, #0 + strh r0, [r1] + ldr r1, =gUnknown_02022F28 + movs r0, #0 + str r0, [r1] + pop {r4, r5, r6} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200A7D8 +sub_0200A7D8: @ 0x0200A7D8 + ldr r1, =gUnknown_02022F30 + ldr r0, =gUnknown_02022F40 + str r0, [r1] + ldr r1, =gUnknown_02022F24 + ldr r0, =gUnknown_02022F00 + ldrh r0, [r0] + strh r0, [r1] + ldr r1, =gUnknown_02022F04 + ldr r0, =gUnknown_02022F2C + ldr r0, [r0] + str r0, [r1] + ldr r1, =gUnknown_02023F40 + movs r0, #0 + strh r0, [r1] + ldr r1, =gUnknown_02022F28 + movs r0, #0 + str r0, [r1] + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_0200A81C +sub_0200A81C: @ 0x0200A81C + ldr r1, =gUnknown_02022F00 + ldr r0, =gUnknown_02022F24 + ldrh r0, [r0] + strh r0, [r1] + ldr r1, =gUnknown_02022F2C + ldr r0, =gUnknown_02022F04 + ldr r0, [r0] + str r0, [r1] + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_0200A840 +sub_0200A840: @ 0x0200A840 + push {r4, lr} + lsls r0, r0, #0x10 + lsrs r0, r0, #0x10 + ldr r4, =gUnknown_02023F40 + ldrh r2, [r4] + subs r0, #1 + cmp r2, r0 + bge _0200A874 + adds r0, r2, #0 + bl sub_02009D94 + ldr r0, =gUnknown_02022F28 + ldr r0, [r0] + movs r1, #0xff + cmp r0, #0 + bne _0200A876 + movs r1, #1 + ldrh r0, [r4] + adds r0, #1 + strh r0, [r4] + b _0200A876 + .align 2, 0 + .pool +_0200A874: + movs r1, #0xff +_0200A876: + adds r0, r1, #0 + pop {r4} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200A880 +sub_0200A880: @ 0x0200A880 + push {r4, r5, r6, lr} + adds r4, r0, #0 + adds r5, r1, #0 + lsls r4, r4, #0x10 + lsrs r4, r4, #0x10 + movs r6, #1 + bl sub_02009480 + subs r4, #1 + lsls r4, r4, #0x10 + lsrs r4, r4, #0x10 + adds r0, r4, #0 + adds r1, r5, #0 + bl sub_02009F4C + bl sub_02009494 + ldr r0, =gUnknown_02022F28 + ldr r0, [r0] + cmp r0, #0 + beq _0200A8AC + movs r6, #0xff +_0200A8AC: + adds r0, r6, #0 + pop {r4, r5, r6} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200A8B8 +sub_0200A8B8: @ 0x0200A8B8 + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #0x4c + lsls r2, r2, #0x18 + lsrs r4, r2, #0x18 + movs r5, #0 + adds r0, #0x20 + str r0, [sp, #4] + str r0, [sp] + str r0, [sp, #0xc] + str r0, [sp, #8] + str r0, [sp, #0x14] + str r0, [sp, #0x10] + str r0, [sp, #0x1c] + str r0, [sp, #0x18] + str r0, [sp, #0x24] + str r0, [sp, #0x20] + str r0, [sp, #0x2c] + str r0, [sp, #0x28] + mov sl, r0 + str r0, [sp, #0x30] + mov r8, sl + str r0, [sp, #0x34] + mov r3, r8 + str r3, [sp, #0x38] + adds r7, r3, #0 + str r7, [sp, #0x3c] + adds r6, r7, #0 + str r6, [sp, #0x40] + adds r2, r6, #0 + mov sb, r2 + adds r0, r1, #0 + movs r1, #0x18 + str r2, [sp, #0x44] + str r3, [sp, #0x48] + bl __umodsi3 + ldr r2, [sp, #0x44] + ldr r3, [sp, #0x48] + cmp r0, #0x17 + bls _0200A912 + b _0200ADCE +_0200A912: + lsls r0, r0, #2 + ldr r1, =_0200A920 + adds r0, r0, r1 + ldr r0, [r0] + mov pc, r0 + .align 2, 0 + .pool +_0200A920: @ jump table + .4byte _0200A980 @ case 0 + .4byte _0200A9AE @ case 1 + .4byte _0200A9DC @ case 2 + .4byte _0200AA0A @ case 3 + .4byte _0200AA38 @ case 4 + .4byte _0200AA66 @ case 5 + .4byte _0200AA94 @ case 6 + .4byte _0200AAC2 @ case 7 + .4byte _0200AAF0 @ case 8 + .4byte _0200AB1E @ case 9 + .4byte _0200AB4C @ case 10 + .4byte _0200AB7A @ case 11 + .4byte _0200ABA8 @ case 12 + .4byte _0200ABD6 @ case 13 + .4byte _0200AC04 @ case 14 + .4byte _0200AC32 @ case 15 + .4byte _0200AC60 @ case 16 + .4byte _0200AC8E @ case 17 + .4byte _0200ACBC @ case 18 + .4byte _0200ACEA @ case 19 + .4byte _0200AD18 @ case 20 + .4byte _0200AD46 @ case 21 + .4byte _0200AD74 @ case 22 + .4byte _0200ADA2 @ case 23 +_0200A980: + cmp r4, #1 + beq _0200A99C + cmp r4, #1 + bgt _0200A98E + cmp r4, #0 + beq _0200A998 + b _0200ADCE +_0200A98E: + cmp r4, #2 + beq _0200A9A2 + cmp r4, #3 + beq _0200A9A8 + b _0200ADCE +_0200A998: + ldr r5, [sp] + b _0200ADCE +_0200A99C: + ldr r5, [sp] + adds r5, #0xc + b _0200ADCE +_0200A9A2: + ldr r5, [sp] + adds r5, #0x18 + b _0200ADCE +_0200A9A8: + ldr r5, [sp] + adds r5, #0x24 + b _0200ADCE +_0200A9AE: + cmp r4, #1 + beq _0200A9CA + cmp r4, #1 + bgt _0200A9BC + cmp r4, #0 + beq _0200A9C6 + b _0200ADCE +_0200A9BC: + cmp r4, #2 + beq _0200A9D0 + cmp r4, #3 + beq _0200A9D6 + b _0200ADCE +_0200A9C6: + ldr r5, [sp, #4] + b _0200ADCE +_0200A9CA: + ldr r5, [sp, #4] + adds r5, #0xc + b _0200ADCE +_0200A9D0: + ldr r5, [sp, #4] + adds r5, #0x24 + b _0200ADCE +_0200A9D6: + ldr r5, [sp, #4] + adds r5, #0x18 + b _0200ADCE +_0200A9DC: + cmp r4, #1 + beq _0200A9F8 + cmp r4, #1 + bgt _0200A9EA + cmp r4, #0 + beq _0200A9F4 + b _0200ADCE +_0200A9EA: + cmp r4, #2 + beq _0200A9FE + cmp r4, #3 + beq _0200AA04 + b _0200ADCE +_0200A9F4: + ldr r5, [sp, #8] + b _0200ADCE +_0200A9F8: + ldr r5, [sp, #8] + adds r5, #0x18 + b _0200ADCE +_0200A9FE: + ldr r5, [sp, #8] + adds r5, #0xc + b _0200ADCE +_0200AA04: + ldr r5, [sp, #8] + adds r5, #0x24 + b _0200ADCE +_0200AA0A: + cmp r4, #1 + beq _0200AA26 + cmp r4, #1 + bgt _0200AA18 + cmp r4, #0 + beq _0200AA22 + b _0200ADCE +_0200AA18: + cmp r4, #2 + beq _0200AA2C + cmp r4, #3 + beq _0200AA32 + b _0200ADCE +_0200AA22: + ldr r5, [sp, #0xc] + b _0200ADCE +_0200AA26: + ldr r5, [sp, #0xc] + adds r5, #0x24 + b _0200ADCE +_0200AA2C: + ldr r5, [sp, #0xc] + adds r5, #0xc + b _0200ADCE +_0200AA32: + ldr r5, [sp, #0xc] + adds r5, #0x18 + b _0200ADCE +_0200AA38: + cmp r4, #1 + beq _0200AA54 + cmp r4, #1 + bgt _0200AA46 + cmp r4, #0 + beq _0200AA50 + b _0200ADCE +_0200AA46: + cmp r4, #2 + beq _0200AA5A + cmp r4, #3 + beq _0200AA60 + b _0200ADCE +_0200AA50: + ldr r5, [sp, #0x10] + b _0200ADCE +_0200AA54: + ldr r5, [sp, #0x10] + adds r5, #0x18 + b _0200ADCE +_0200AA5A: + ldr r5, [sp, #0x10] + adds r5, #0x24 + b _0200ADCE +_0200AA60: + ldr r5, [sp, #0x10] + adds r5, #0xc + b _0200ADCE +_0200AA66: + cmp r4, #1 + beq _0200AA82 + cmp r4, #1 + bgt _0200AA74 + cmp r4, #0 + beq _0200AA7E + b _0200ADCE +_0200AA74: + cmp r4, #2 + beq _0200AA88 + cmp r4, #3 + beq _0200AA8E + b _0200ADCE +_0200AA7E: + ldr r5, [sp, #0x14] + b _0200ADCE +_0200AA82: + ldr r5, [sp, #0x14] + adds r5, #0x24 + b _0200ADCE +_0200AA88: + ldr r5, [sp, #0x14] + adds r5, #0x18 + b _0200ADCE +_0200AA8E: + ldr r5, [sp, #0x14] + adds r5, #0xc + b _0200ADCE +_0200AA94: + cmp r4, #1 + beq _0200AAB2 + cmp r4, #1 + bgt _0200AAA2 + cmp r4, #0 + beq _0200AAAC + b _0200ADCE +_0200AAA2: + cmp r4, #2 + beq _0200AAB6 + cmp r4, #3 + beq _0200AABC + b _0200ADCE +_0200AAAC: + ldr r5, [sp, #0x18] + adds r5, #0xc + b _0200ADCE +_0200AAB2: + ldr r5, [sp, #0x18] + b _0200ADCE +_0200AAB6: + ldr r5, [sp, #0x18] + adds r5, #0x18 + b _0200ADCE +_0200AABC: + ldr r5, [sp, #0x18] + adds r5, #0x24 + b _0200ADCE +_0200AAC2: + cmp r4, #1 + beq _0200AAE0 + cmp r4, #1 + bgt _0200AAD0 + cmp r4, #0 + beq _0200AADA + b _0200ADCE +_0200AAD0: + cmp r4, #2 + beq _0200AAE4 + cmp r4, #3 + beq _0200AAEA + b _0200ADCE +_0200AADA: + ldr r5, [sp, #0x1c] + adds r5, #0xc + b _0200ADCE +_0200AAE0: + ldr r5, [sp, #0x1c] + b _0200ADCE +_0200AAE4: + ldr r5, [sp, #0x1c] + adds r5, #0x24 + b _0200ADCE +_0200AAEA: + ldr r5, [sp, #0x1c] + adds r5, #0x18 + b _0200ADCE +_0200AAF0: + cmp r4, #1 + beq _0200AB0E + cmp r4, #1 + bgt _0200AAFE + cmp r4, #0 + beq _0200AB08 + b _0200ADCE +_0200AAFE: + cmp r4, #2 + beq _0200AB12 + cmp r4, #3 + beq _0200AB18 + b _0200ADCE +_0200AB08: + ldr r5, [sp, #0x20] + adds r5, #0x18 + b _0200ADCE +_0200AB0E: + ldr r5, [sp, #0x20] + b _0200ADCE +_0200AB12: + ldr r5, [sp, #0x20] + adds r5, #0xc + b _0200ADCE +_0200AB18: + ldr r5, [sp, #0x20] + adds r5, #0x24 + b _0200ADCE +_0200AB1E: + cmp r4, #1 + beq _0200AB3C + cmp r4, #1 + bgt _0200AB2C + cmp r4, #0 + beq _0200AB36 + b _0200ADCE +_0200AB2C: + cmp r4, #2 + beq _0200AB40 + cmp r4, #3 + beq _0200AB46 + b _0200ADCE +_0200AB36: + ldr r5, [sp, #0x24] + adds r5, #0x24 + b _0200ADCE +_0200AB3C: + ldr r5, [sp, #0x24] + b _0200ADCE +_0200AB40: + ldr r5, [sp, #0x24] + adds r5, #0xc + b _0200ADCE +_0200AB46: + ldr r5, [sp, #0x24] + adds r5, #0x18 + b _0200ADCE +_0200AB4C: + cmp r4, #1 + beq _0200AB6A + cmp r4, #1 + bgt _0200AB5A + cmp r4, #0 + beq _0200AB64 + b _0200ADCE +_0200AB5A: + cmp r4, #2 + beq _0200AB6E + cmp r4, #3 + beq _0200AB74 + b _0200ADCE +_0200AB64: + ldr r5, [sp, #0x28] + adds r5, #0x18 + b _0200ADCE +_0200AB6A: + ldr r5, [sp, #0x28] + b _0200ADCE +_0200AB6E: + ldr r5, [sp, #0x28] + adds r5, #0x24 + b _0200ADCE +_0200AB74: + ldr r5, [sp, #0x28] + adds r5, #0xc + b _0200ADCE +_0200AB7A: + cmp r4, #1 + beq _0200AB98 + cmp r4, #1 + bgt _0200AB88 + cmp r4, #0 + beq _0200AB92 + b _0200ADCE +_0200AB88: + cmp r4, #2 + beq _0200AB9C + cmp r4, #3 + beq _0200ABA2 + b _0200ADCE +_0200AB92: + ldr r5, [sp, #0x2c] + adds r5, #0x24 + b _0200ADCE +_0200AB98: + ldr r5, [sp, #0x2c] + b _0200ADCE +_0200AB9C: + ldr r5, [sp, #0x2c] + adds r5, #0x18 + b _0200ADCE +_0200ABA2: + ldr r5, [sp, #0x2c] + adds r5, #0xc + b _0200ADCE +_0200ABA8: + cmp r4, #1 + beq _0200ABC6 + cmp r4, #1 + bgt _0200ABB6 + cmp r4, #0 + beq _0200ABC0 + b _0200ADCE +_0200ABB6: + cmp r4, #2 + beq _0200ABCC + cmp r4, #3 + beq _0200ABD0 + b _0200ADCE +_0200ABC0: + ldr r5, [sp, #0x30] + adds r5, #0xc + b _0200ADCE +_0200ABC6: + ldr r5, [sp, #0x30] + adds r5, #0x18 + b _0200ADCE +_0200ABCC: + ldr r5, [sp, #0x30] + b _0200ADCE +_0200ABD0: + ldr r5, [sp, #0x30] + adds r5, #0x24 + b _0200ADCE +_0200ABD6: + cmp r4, #1 + beq _0200ABF4 + cmp r4, #1 + bgt _0200ABE4 + cmp r4, #0 + beq _0200ABEE + b _0200ADCE +_0200ABE4: + cmp r4, #2 + beq _0200ABFA + cmp r4, #3 + beq _0200ABFE + b _0200ADCE +_0200ABEE: + mov r5, sl + adds r5, #0xc + b _0200ADCE +_0200ABF4: + mov r5, sl + adds r5, #0x24 + b _0200ADCE +_0200ABFA: + mov r5, sl + b _0200ADCE +_0200ABFE: + mov r5, sl + adds r5, #0x18 + b _0200ADCE +_0200AC04: + cmp r4, #1 + beq _0200AC22 + cmp r4, #1 + bgt _0200AC12 + cmp r4, #0 + beq _0200AC1C + b _0200ADCE +_0200AC12: + cmp r4, #2 + beq _0200AC28 + cmp r4, #3 + beq _0200AC2C + b _0200ADCE +_0200AC1C: + ldr r5, [sp, #0x34] + adds r5, #0x18 + b _0200ADCE +_0200AC22: + ldr r5, [sp, #0x34] + adds r5, #0xc + b _0200ADCE +_0200AC28: + ldr r5, [sp, #0x34] + b _0200ADCE +_0200AC2C: + ldr r5, [sp, #0x34] + adds r5, #0x24 + b _0200ADCE +_0200AC32: + cmp r4, #1 + beq _0200AC50 + cmp r4, #1 + bgt _0200AC40 + cmp r4, #0 + beq _0200AC4A + b _0200ADCE +_0200AC40: + cmp r4, #2 + beq _0200AC56 + cmp r4, #3 + beq _0200AC5A + b _0200ADCE +_0200AC4A: + mov r5, r8 + adds r5, #0x24 + b _0200ADCE +_0200AC50: + mov r5, r8 + adds r5, #0xc + b _0200ADCE +_0200AC56: + mov r5, r8 + b _0200ADCE +_0200AC5A: + mov r5, r8 + adds r5, #0x18 + b _0200ADCE +_0200AC60: + cmp r4, #1 + beq _0200AC7E + cmp r4, #1 + bgt _0200AC6E + cmp r4, #0 + beq _0200AC78 + b _0200ADCE +_0200AC6E: + cmp r4, #2 + beq _0200AC84 + cmp r4, #3 + beq _0200AC88 + b _0200ADCE +_0200AC78: + ldr r5, [sp, #0x38] + adds r5, #0x18 + b _0200ADCE +_0200AC7E: + ldr r5, [sp, #0x38] + adds r5, #0x24 + b _0200ADCE +_0200AC84: + ldr r5, [sp, #0x38] + b _0200ADCE +_0200AC88: + ldr r5, [sp, #0x38] + adds r5, #0xc + b _0200ADCE +_0200AC8E: + cmp r4, #1 + beq _0200ACAC + cmp r4, #1 + bgt _0200AC9C + cmp r4, #0 + beq _0200ACA6 + b _0200ADCE +_0200AC9C: + cmp r4, #2 + beq _0200ACB2 + cmp r4, #3 + beq _0200ACB6 + b _0200ADCE +_0200ACA6: + adds r5, r3, #0 + adds r5, #0x24 + b _0200ADCE +_0200ACAC: + adds r5, r3, #0 + adds r5, #0x18 + b _0200ADCE +_0200ACB2: + adds r5, r3, #0 + b _0200ADCE +_0200ACB6: + adds r5, r3, #0 + adds r5, #0xc + b _0200ADCE +_0200ACBC: + cmp r4, #1 + beq _0200ACDA + cmp r4, #1 + bgt _0200ACCA + cmp r4, #0 + beq _0200ACD4 + b _0200ADCE +_0200ACCA: + cmp r4, #2 + beq _0200ACE0 + cmp r4, #3 + beq _0200ACE6 + b _0200ADCE +_0200ACD4: + ldr r5, [sp, #0x3c] + adds r5, #0xc + b _0200ADCE +_0200ACDA: + ldr r5, [sp, #0x3c] + adds r5, #0x18 + b _0200ADCE +_0200ACE0: + ldr r5, [sp, #0x3c] + adds r5, #0x24 + b _0200ADCE +_0200ACE6: + ldr r5, [sp, #0x3c] + b _0200ADCE +_0200ACEA: + cmp r4, #1 + beq _0200AD08 + cmp r4, #1 + bgt _0200ACF8 + cmp r4, #0 + beq _0200AD02 + b _0200ADCE +_0200ACF8: + cmp r4, #2 + beq _0200AD0E + cmp r4, #3 + beq _0200AD14 + b _0200ADCE +_0200AD02: + adds r5, r7, #0 + adds r5, #0xc + b _0200ADCE +_0200AD08: + adds r5, r7, #0 + adds r5, #0x24 + b _0200ADCE +_0200AD0E: + adds r5, r7, #0 + adds r5, #0x18 + b _0200ADCE +_0200AD14: + adds r5, r7, #0 + b _0200ADCE +_0200AD18: + cmp r4, #1 + beq _0200AD36 + cmp r4, #1 + bgt _0200AD26 + cmp r4, #0 + beq _0200AD30 + b _0200ADCE +_0200AD26: + cmp r4, #2 + beq _0200AD3C + cmp r4, #3 + beq _0200AD42 + b _0200ADCE +_0200AD30: + ldr r5, [sp, #0x40] + adds r5, #0x18 + b _0200ADCE +_0200AD36: + ldr r5, [sp, #0x40] + adds r5, #0xc + b _0200ADCE +_0200AD3C: + ldr r5, [sp, #0x40] + adds r5, #0x24 + b _0200ADCE +_0200AD42: + ldr r5, [sp, #0x40] + b _0200ADCE +_0200AD46: + cmp r4, #1 + beq _0200AD64 + cmp r4, #1 + bgt _0200AD54 + cmp r4, #0 + beq _0200AD5E + b _0200ADCE +_0200AD54: + cmp r4, #2 + beq _0200AD6A + cmp r4, #3 + beq _0200AD70 + b _0200ADCE +_0200AD5E: + adds r5, r6, #0 + adds r5, #0x24 + b _0200ADCE +_0200AD64: + adds r5, r6, #0 + adds r5, #0xc + b _0200ADCE +_0200AD6A: + adds r5, r6, #0 + adds r5, #0x18 + b _0200ADCE +_0200AD70: + adds r5, r6, #0 + b _0200ADCE +_0200AD74: + cmp r4, #1 + beq _0200AD92 + cmp r4, #1 + bgt _0200AD82 + cmp r4, #0 + beq _0200AD8C + b _0200ADCE +_0200AD82: + cmp r4, #2 + beq _0200AD98 + cmp r4, #3 + beq _0200AD9E + b _0200ADCE +_0200AD8C: + mov r5, sb + adds r5, #0x18 + b _0200ADCE +_0200AD92: + mov r5, sb + adds r5, #0x24 + b _0200ADCE +_0200AD98: + mov r5, sb + adds r5, #0xc + b _0200ADCE +_0200AD9E: + mov r5, sb + b _0200ADCE +_0200ADA2: + cmp r4, #1 + beq _0200ADC0 + cmp r4, #1 + bgt _0200ADB0 + cmp r4, #0 + beq _0200ADBA + b _0200ADCE +_0200ADB0: + cmp r4, #2 + beq _0200ADC6 + cmp r4, #3 + beq _0200ADCC + b _0200ADCE +_0200ADBA: + adds r5, r2, #0 + adds r5, #0x24 + b _0200ADCE +_0200ADC0: + adds r5, r2, #0 + adds r5, #0x18 + b _0200ADCE +_0200ADC6: + adds r5, r2, #0 + adds r5, #0xc + b _0200ADCE +_0200ADCC: + adds r5, r2, #0 +_0200ADCE: + adds r0, r5, #0 + add sp, #0x4c + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + + thumb_func_start sub_0200ADE0 +sub_0200ADE0: @ 0x0200ADE0 + push {r4, r5, r6, r7, lr} + mov r7, r8 + push {r7} + adds r4, r0, #0 + movs r6, #0 + ldr r1, [r4] + movs r2, #0 + bl sub_0200A8B8 + adds r5, r0, #0 + ldr r1, [r4] + adds r0, r4, #0 + movs r2, #1 + bl sub_0200A8B8 + adds r7, r0, #0 + ldr r1, [r4] + adds r0, r4, #0 + movs r2, #2 + bl sub_0200A8B8 + mov r8, r0 + ldr r1, [r4] + adds r0, r4, #0 + movs r2, #3 + bl sub_0200A8B8 + adds r3, r0, #0 + movs r1, #5 +_0200AE1A: + ldrh r2, [r5] + adds r0, r2, r6 + lsls r0, r0, #0x10 + lsrs r6, r0, #0x10 + adds r5, #2 + subs r1, #1 + cmp r1, #0 + bge _0200AE1A + adds r2, r7, #0 + movs r1, #5 +_0200AE2E: + ldrh r4, [r2] + adds r0, r4, r6 + lsls r0, r0, #0x10 + lsrs r6, r0, #0x10 + adds r2, #2 + subs r1, #1 + cmp r1, #0 + bge _0200AE2E + mov r2, r8 + movs r1, #5 +_0200AE42: + ldrh r4, [r2] + adds r0, r4, r6 + lsls r0, r0, #0x10 + lsrs r6, r0, #0x10 + adds r2, #2 + subs r1, #1 + cmp r1, #0 + bge _0200AE42 + adds r2, r3, #0 + movs r1, #5 +_0200AE56: + ldrh r3, [r2] + adds r0, r3, r6 + lsls r0, r0, #0x10 + lsrs r6, r0, #0x10 + adds r2, #2 + subs r1, #1 + cmp r1, #0 + bge _0200AE56 + adds r0, r6, #0 + pop {r3} + mov r8, r3 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200AE74 +sub_0200AE74: @ 0x0200AE74 + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #0x18 + mov r8, r0 + str r1, [sp, #0x10] + adds r6, r2, #0 + movs r4, #0 + mov sb, r4 + mov sl, r4 + movs r7, #0 + movs r5, #0 + cmp r1, #0xa + ble _0200AF14 + ldr r1, [r0] + movs r2, #0 + bl sub_0200A8B8 + mov sb, r0 + mov r0, r8 + ldr r1, [r0] + movs r2, #1 + bl sub_0200A8B8 + mov sl, r0 + mov r2, r8 + ldr r1, [r2] + mov r0, r8 + movs r2, #2 + bl sub_0200A8B8 + adds r7, r0, #0 + mov r3, r8 + ldr r1, [r3] + mov r0, r8 + movs r2, #3 + bl sub_0200A8B8 + adds r5, r0, #0 + movs r0, #0 + str r0, [sp, #0x14] + mov r2, r8 + adds r2, #0x20 +_0200AECE: + ldr r0, [r2] + mov r1, r8 + ldr r1, [r1, #4] + eors r0, r1 + str r0, [r2] + mov r3, r8 + ldr r3, [r3] + eors r0, r3 + stm r2!, {r0} + ldr r0, [sp, #0x14] + adds r0, #1 + str r0, [sp, #0x14] + cmp r0, #0xb + bls _0200AECE + mov r0, r8 + bl sub_0200ADE0 + lsls r0, r0, #0x10 + lsrs r0, r0, #0x10 + mov r1, r8 + ldrh r1, [r1, #0x1c] + cmp r0, r1 + beq _0200AF14 + movs r0, #1 + mov r2, r8 + ldrb r2, [r2, #0x13] + orrs r0, r2 + movs r1, #4 + orrs r0, r1 + mov r3, r8 + strb r0, [r3, #0x13] + movs r0, #0x40 + ldrb r1, [r5, #7] + orrs r0, r1 + strb r0, [r5, #7] +_0200AF14: + ldr r2, [sp, #0x10] + cmp r2, #0x52 + bls _0200AF1C + b _0200B4AC +_0200AF1C: + lsls r0, r2, #2 + ldr r1, =_0200AF2C + adds r0, r0, r1 + ldr r0, [r0] + mov pc, r0 + .align 2, 0 + .pool +_0200AF2C: @ jump table + .4byte _0200B078 @ case 0 + .4byte _0200B07E @ case 1 + .4byte _0200B084 @ case 2 + .4byte _0200B108 @ case 3 + .4byte _0200B10E @ case 4 + .4byte _0200B114 @ case 5 + .4byte _0200B11E @ case 6 + .4byte _0200B128 @ case 7 + .4byte _0200B16C @ case 8 + .4byte _0200B172 @ case 9 + .4byte _0200B178 @ case 10 + .4byte _0200B17E @ case 11 + .4byte _0200B196 @ case 12 + .4byte _0200B1AE @ case 13 + .4byte _0200B1AE @ case 14 + .4byte _0200B1AE @ case 15 + .4byte _0200B1AE @ case 16 + .4byte _0200B1BA @ case 17 + .4byte _0200B1BA @ case 18 + .4byte _0200B1BA @ case 19 + .4byte _0200B1BA @ case 20 + .4byte _0200B1A2 @ case 21 + .4byte _0200B1DC @ case 22 + .4byte _0200B1E0 @ case 23 + .4byte _0200B1E4 @ case 24 + .4byte _0200B19C @ case 25 + .4byte _0200B1C4 @ case 26 + .4byte _0200B1C8 @ case 27 + .4byte _0200B1CC @ case 28 + .4byte _0200B1D0 @ case 29 + .4byte _0200B1D4 @ case 30 + .4byte _0200B1D8 @ case 31 + .4byte _0200B1A8 @ case 32 + .4byte _0200B1E8 @ case 33 + .4byte _0200B1F4 @ case 34 + .4byte _0200B1F8 @ case 35 + .4byte _0200B1FC @ case 36 + .4byte _0200B204 @ case 37 + .4byte _0200B20C @ case 38 + .4byte _0200B21A @ case 39 + .4byte _0200B222 @ case 40 + .4byte _0200B22A @ case 41 + .4byte _0200B232 @ case 42 + .4byte _0200B23A @ case 43 + .4byte _0200B242 @ case 44 + .4byte _0200B24A @ case 45 + .4byte _0200B24E @ case 46 + .4byte _0200B1EC @ case 47 + .4byte _0200B1F0 @ case 48 + .4byte _0200B214 @ case 49 + .4byte _0200B254 @ case 50 + .4byte _0200B25C @ case 51 + .4byte _0200B264 @ case 52 + .4byte _0200B26C @ case 53 + .4byte _0200B274 @ case 54 + .4byte _0200B4AC @ case 55 + .4byte _0200B4AC @ case 56 + .4byte _0200B4AC @ case 57 + .4byte _0200B4AC @ case 58 + .4byte _0200B4AC @ case 59 + .4byte _0200B4AC @ case 60 + .4byte _0200B4AC @ case 61 + .4byte _0200B4AC @ case 62 + .4byte _0200B4AC @ case 63 + .4byte _0200B4AC @ case 64 + .4byte _0200B2D2 @ case 65 + .4byte _0200B2F8 @ case 66 + .4byte _0200B27C @ case 67 + .4byte _0200B282 @ case 68 + .4byte _0200B286 @ case 69 + .4byte _0200B28A @ case 70 + .4byte _0200B28E @ case 71 + .4byte _0200B296 @ case 72 + .4byte _0200B29E @ case 73 + .4byte _0200B2A6 @ case 74 + .4byte _0200B2AE @ case 75 + .4byte _0200B2B4 @ case 76 + .4byte _0200B2BC @ case 77 + .4byte _0200B2C4 @ case 78 + .4byte _0200B2CC @ case 79 + .4byte _0200B332 @ case 80 + .4byte _0200B390 @ case 81 + .4byte _0200B412 @ case 82 +_0200B078: + mov r3, r8 + ldr r4, [r3] + b _0200B4AC +_0200B07E: + mov r5, r8 + ldr r4, [r5, #4] + b _0200B4AC +_0200B084: + mov r7, r8 + ldrb r1, [r7, #0x13] + movs r0, #1 + ands r0, r1 + cmp r0, #0 + beq _0200B0A0 + ldr r1, =gUnknown_0202062C +_0200B092: + adds r0, r6, #0 + bl sub_0200CE5C + b _0200B0FC + .align 2, 0 + .pool +_0200B0A0: + movs r0, #4 + ands r0, r1 + cmp r0, #0 + beq _0200B0B0 + ldr r1, =gUnknown_0201E808 + b _0200B092 + .align 2, 0 + .pool +_0200B0B0: + movs r4, #0 + mov r1, r8 + adds r1, #8 + mov r2, r8 + ldrb r0, [r2, #8] + ldrb r3, [r2, #0x12] + cmp r0, #0xff + beq _0200B0D6 + adds r2, r1, #0 +_0200B0C2: + adds r1, r6, r4 + ldrb r0, [r2] + strb r0, [r1] + adds r2, #1 + adds r4, #1 + cmp r4, #9 + bhi _0200B0D6 + ldrb r0, [r2] + cmp r0, #0xff + bne _0200B0C2 +_0200B0D6: + adds r1, r6, r4 + movs r0, #0xff + strb r0, [r1] + cmp r3, #1 + bne _0200B0FC + mov r1, sp + movs r0, #0xfc + strb r0, [r1] + movs r0, #0x15 + strb r0, [r1, #1] + mov r0, sp + adds r0, #2 + adds r1, r6, #0 + bl sub_0200CE5C + adds r0, r6, #0 + mov r1, sp + bl sub_0200CE5C +_0200B0FC: + adds r0, r6, #0 + bl sub_0200CE1C + lsls r0, r0, #0x10 + lsrs r4, r0, #0x10 + b _0200B4AC +_0200B108: + mov r3, r8 + ldrb r4, [r3, #0x12] + b _0200B4AC +_0200B10E: + mov r5, r8 + ldrb r5, [r5, #0x13] + b _0200B2B6 +_0200B114: + mov r6, r8 + ldrb r6, [r6, #0x13] + lsls r0, r6, #0x1e + lsrs r4, r0, #0x1f + b _0200B4AC +_0200B11E: + mov r7, r8 + ldrb r7, [r7, #0x13] + lsls r0, r7, #0x1d + lsrs r4, r0, #0x1f + b _0200B4AC +_0200B128: + movs r4, #0 + ldr r3, =gUnknown_020251E8 + ldr r0, [r3] + adds r0, #0x74 + ldrb r0, [r0] + cmp r4, r0 + bhs _0200B15E + mov r1, r8 + adds r1, #0x14 + mov r2, r8 + ldrb r0, [r2, #0x14] + cmp r0, #0xff + beq _0200B15E + adds r2, r1, #0 +_0200B144: + adds r1, r6, r4 + ldrb r0, [r2] + strb r0, [r1] + adds r2, #1 + adds r4, #1 + ldr r0, [r3] + adds r0, #0x74 + ldrb r0, [r0] + cmp r4, r0 + bhs _0200B15E + ldrb r0, [r2] + cmp r0, #0xff + bne _0200B144 +_0200B15E: + adds r1, r6, r4 + movs r0, #0xff + strb r0, [r1] + b _0200B4AC + .align 2, 0 + .pool +_0200B16C: + mov r3, r8 + ldrb r4, [r3, #0x1b] + b _0200B4AC +_0200B172: + mov r5, r8 + ldrh r4, [r5, #0x1c] + b _0200B4AC +_0200B178: + mov r6, r8 + ldrh r4, [r6, #0x1e] + b _0200B4AC +_0200B17E: + movs r0, #1 + mov r7, r8 + ldrb r7, [r7, #0x13] + ands r0, r7 + movs r4, #0xce + lsls r4, r4, #1 + cmp r0, #0 + beq _0200B190 + b _0200B4AC +_0200B190: + mov r0, sb + ldrh r4, [r0] + b _0200B4AC +_0200B196: + mov r1, sb + ldrh r4, [r1, #2] + b _0200B4AC +_0200B19C: + mov r2, sb + ldr r4, [r2, #4] + b _0200B4AC +_0200B1A2: + mov r3, sb + ldrb r4, [r3, #8] + b _0200B4AC +_0200B1A8: + mov r5, sb + ldrb r4, [r5, #9] + b _0200B4AC +_0200B1AE: + ldr r0, [sp, #0x10] + subs r0, #0xd + lsls r0, r0, #1 + add r0, sl + ldrh r4, [r0] + b _0200B4AC +_0200B1BA: + ldr r0, [sp, #0x10] + add r0, sl + subs r0, #9 + ldrb r4, [r0] + b _0200B4AC +_0200B1C4: + ldrb r4, [r7] + b _0200B4AC +_0200B1C8: + ldrb r4, [r7, #1] + b _0200B4AC +_0200B1CC: + ldrb r4, [r7, #2] + b _0200B4AC +_0200B1D0: + ldrb r4, [r7, #3] + b _0200B4AC +_0200B1D4: + ldrb r4, [r7, #4] + b _0200B4AC +_0200B1D8: + ldrb r4, [r7, #5] + b _0200B4AC +_0200B1DC: + ldrb r4, [r7, #6] + b _0200B4AC +_0200B1E0: + ldrb r4, [r7, #7] + b _0200B4AC +_0200B1E4: + ldrb r4, [r7, #8] + b _0200B4AC +_0200B1E8: + ldrb r4, [r7, #9] + b _0200B4AC +_0200B1EC: + ldrb r4, [r7, #0xa] + b _0200B4AC +_0200B1F0: + ldrb r4, [r7, #0xb] + b _0200B4AC +_0200B1F4: + ldrb r4, [r5] + b _0200B4AC +_0200B1F8: + ldrb r4, [r5, #1] + b _0200B4AC +_0200B1FC: + ldrb r5, [r5, #2] + lsls r0, r5, #0x19 + lsrs r4, r0, #0x19 + b _0200B4AC +_0200B204: + ldrh r5, [r5, #2] + lsls r0, r5, #0x15 + lsrs r4, r0, #0x1c + b _0200B4AC +_0200B20C: + ldrb r5, [r5, #3] + lsls r0, r5, #0x19 + lsrs r4, r0, #0x1c + b _0200B4AC +_0200B214: + ldrb r5, [r5, #3] + lsrs r4, r5, #7 + b _0200B4AC +_0200B21A: + ldrb r5, [r5, #4] + lsls r0, r5, #0x1b + lsrs r4, r0, #0x1b + b _0200B4AC +_0200B222: + ldrh r5, [r5, #4] + lsls r0, r5, #0x16 + lsrs r4, r0, #0x1b + b _0200B4AC +_0200B22A: + ldrb r5, [r5, #5] + lsls r0, r5, #0x19 + lsrs r4, r0, #0x1b + b _0200B4AC +_0200B232: + ldr r0, [r5, #4] + lsls r0, r0, #0xc + lsrs r4, r0, #0x1b + b _0200B4AC +_0200B23A: + ldrh r5, [r5, #6] + lsls r0, r5, #0x17 + lsrs r4, r0, #0x1b + b _0200B4AC +_0200B242: + ldrb r5, [r5, #7] + lsls r0, r5, #0x1a + lsrs r4, r0, #0x1b + b _0200B4AC +_0200B24A: + ldrb r5, [r5, #7] + b _0200B2A8 +_0200B24E: + ldrb r5, [r5, #7] + lsrs r4, r5, #7 + b _0200B4AC +_0200B254: + ldrb r5, [r5, #8] + lsls r0, r5, #0x1d + lsrs r4, r0, #0x1d + b _0200B4AC +_0200B25C: + ldrb r5, [r5, #8] + lsls r0, r5, #0x1a + lsrs r4, r0, #0x1d + b _0200B4AC +_0200B264: + ldrh r5, [r5, #8] + lsls r0, r5, #0x17 + lsrs r4, r0, #0x1d + b _0200B4AC +_0200B26C: + ldrb r5, [r5, #9] + lsls r0, r5, #0x1c + lsrs r4, r0, #0x1d + b _0200B4AC +_0200B274: + ldrb r5, [r5, #9] + lsls r0, r5, #0x19 + lsrs r4, r0, #0x1d + b _0200B4AC +_0200B27C: + ldrb r5, [r5, #9] + lsrs r4, r5, #7 + b _0200B4AC +_0200B282: + ldrb r5, [r5, #0xa] + b _0200B2B6 +_0200B286: + ldrb r5, [r5, #0xa] + b _0200B2BE +_0200B28A: + ldrb r5, [r5, #0xa] + b _0200B2C6 +_0200B28E: + ldrb r5, [r5, #0xa] + lsls r0, r5, #0x1c + lsrs r4, r0, #0x1f + b _0200B4AC +_0200B296: + ldrb r5, [r5, #0xa] + lsls r0, r5, #0x1b + lsrs r4, r0, #0x1f + b _0200B4AC +_0200B29E: + ldrb r5, [r5, #0xa] + lsls r0, r5, #0x1a + lsrs r4, r0, #0x1f + b _0200B4AC +_0200B2A6: + ldrb r5, [r5, #0xa] +_0200B2A8: + lsls r0, r5, #0x19 + lsrs r4, r0, #0x1f + b _0200B4AC +_0200B2AE: + ldrb r5, [r5, #0xa] + lsrs r4, r5, #7 + b _0200B4AC +_0200B2B4: + ldrb r5, [r5, #0xb] +_0200B2B6: + lsls r0, r5, #0x1f + lsrs r4, r0, #0x1f + b _0200B4AC +_0200B2BC: + ldrb r5, [r5, #0xb] +_0200B2BE: + lsls r0, r5, #0x1e + lsrs r4, r0, #0x1f + b _0200B4AC +_0200B2C4: + ldrb r5, [r5, #0xb] +_0200B2C6: + lsls r0, r5, #0x1d + lsrs r4, r0, #0x1f + b _0200B4AC +_0200B2CC: + ldrb r5, [r5, #0xb] + lsrs r4, r5, #3 + b _0200B4AC +_0200B2D2: + mov r6, sb + ldrh r4, [r6] + cmp r4, #0 + bne _0200B2DC + b _0200B4AC +_0200B2DC: + ldrb r5, [r5, #7] + lsls r0, r5, #0x19 + cmp r0, #0 + blt _0200B2F2 + movs r0, #1 + mov r7, r8 + ldrb r7, [r7, #0x13] + ands r0, r7 + cmp r0, #0 + bne _0200B2F2 + b _0200B4AC +_0200B2F2: + movs r4, #0xce + lsls r4, r4, #1 + b _0200B4AC +_0200B2F8: + ldrb r1, [r5, #4] + lsls r0, r1, #0x1b + lsrs r4, r0, #0x1b + movs r0, #0xf8 + lsls r0, r0, #2 + ldrh r2, [r5, #4] + ands r0, r2 + orrs r4, r0 + ldrb r3, [r5, #5] + lsls r0, r3, #0x19 + lsrs r0, r0, #0x1b + lsls r0, r0, #0xa + orrs r4, r0 + ldr r0, [r5, #4] + movs r1, #0xf8 + lsls r1, r1, #0xc + ands r0, r1 + orrs r4, r0 + ldrh r6, [r5, #6] + lsls r0, r6, #0x17 + lsrs r0, r0, #0x1b + lsls r0, r0, #0x14 + orrs r4, r0 + ldrb r5, [r5, #7] + lsls r0, r5, #0x1a + lsrs r0, r0, #0x1b + lsls r0, r0, #0x19 + orrs r4, r0 + b _0200B4AC +_0200B332: + mov r7, sb + ldrh r0, [r7] + cmp r0, #0 + bne _0200B33C + b _0200B4AC +_0200B33C: + ldrb r5, [r5, #7] + lsls r0, r5, #0x19 + cmp r0, #0 + bge _0200B346 + b _0200B4AC +_0200B346: + ldr r0, =0x00000163 + ldrh r1, [r6] + cmp r1, r0 + bne _0200B350 + b _0200B4AC +_0200B350: + mov r2, sl + ldrh r3, [r2] + adds r5, r0, #0 + adds r1, r6, #0 + ldr r2, =gUnknown_0201ECC0 +_0200B35A: + ldrh r0, [r1] + cmp r3, r0 + beq _0200B378 + mov r6, sl + ldrh r6, [r6, #2] + cmp r6, r0 + beq _0200B378 + mov r7, sl + ldrh r7, [r7, #4] + cmp r7, r0 + beq _0200B378 + mov r6, sl + ldrh r6, [r6, #6] + cmp r6, r0 + bne _0200B37C +_0200B378: + ldr r0, [r2] + orrs r4, r0 +_0200B37C: + adds r1, #2 + adds r2, #4 + ldrh r7, [r1] + cmp r7, r5 + bne _0200B35A + b _0200B4AC + .align 2, 0 + .pool +_0200B390: + movs r4, #0 + mov r1, sb + ldrh r0, [r1] + cmp r0, #0 + bne _0200B39C + b _0200B4AC +_0200B39C: + ldrb r2, [r5, #7] + lsls r0, r2, #0x19 + cmp r0, #0 + bge _0200B3A6 + b _0200B4AC +_0200B3A6: + ldrb r0, [r5, #8] + lsls r1, r0, #0x1d + lsrs r4, r1, #0x1d + lsls r0, r0, #0x1a + lsrs r0, r0, #0x1d + adds r4, r4, r0 + ldrh r3, [r5, #8] + lsls r0, r3, #0x17 + lsrs r0, r0, #0x1d + adds r4, r4, r0 + ldrb r1, [r5, #9] + lsls r0, r1, #0x1c + lsrs r0, r0, #0x1d + adds r4, r4, r0 + lsls r0, r1, #0x19 + lsrs r0, r0, #0x1d + adds r4, r4, r0 + lsrs r1, r1, #7 + adds r4, r4, r1 + ldrb r1, [r5, #0xa] + lsls r0, r1, #0x1f + lsrs r0, r0, #0x1f + adds r4, r4, r0 + lsls r0, r1, #0x1e + lsrs r0, r0, #0x1f + adds r4, r4, r0 + lsls r0, r1, #0x1d + lsrs r0, r0, #0x1f + adds r4, r4, r0 + lsls r0, r1, #0x1c + lsrs r0, r0, #0x1f + adds r4, r4, r0 + lsls r0, r1, #0x1b + lsrs r0, r0, #0x1f + adds r4, r4, r0 + lsls r0, r1, #0x1a + lsrs r0, r0, #0x1f + adds r4, r4, r0 + lsls r0, r1, #0x19 + lsrs r0, r0, #0x1f + adds r4, r4, r0 + lsrs r1, r1, #7 + adds r4, r4, r1 + ldrb r1, [r5, #0xb] + lsls r0, r1, #0x1f + lsrs r0, r0, #0x1f + adds r4, r4, r0 + lsls r0, r1, #0x1e + lsrs r0, r0, #0x1f + adds r4, r4, r0 + lsls r1, r1, #0x1d + lsrs r1, r1, #0x1f + adds r4, r4, r1 + b _0200B4AC +_0200B412: + movs r4, #0 + mov r6, sb + ldrh r0, [r6] + cmp r0, #0 + beq _0200B4AC + ldrb r7, [r5, #7] + lsls r0, r7, #0x19 + cmp r0, #0 + blt _0200B4AC + ldrb r2, [r5, #9] + lsrs r4, r2, #7 + ldrb r1, [r5, #8] + lsls r0, r1, #0x1d + lsrs r0, r0, #0x1c + orrs r4, r0 + lsls r1, r1, #0x1a + lsrs r1, r1, #0x1d + lsls r1, r1, #4 + orrs r4, r1 + ldrh r1, [r5, #8] + lsls r0, r1, #0x17 + lsrs r0, r0, #0x1d + lsls r0, r0, #7 + orrs r4, r0 + lsls r0, r2, #0x1c + lsrs r0, r0, #0x1d + lsls r0, r0, #0xa + orrs r4, r0 + lsls r2, r2, #0x19 + lsrs r2, r2, #0x1d + lsls r2, r2, #0xd + orrs r4, r2 + ldrb r1, [r5, #0xa] + lsls r0, r1, #0x1f + lsrs r0, r0, #0x1f + lsls r0, r0, #0x10 + orrs r4, r0 + lsls r0, r1, #0x1e + lsrs r0, r0, #0x1f + lsls r0, r0, #0x11 + orrs r4, r0 + lsls r0, r1, #0x1d + lsrs r0, r0, #0x1f + lsls r0, r0, #0x12 + orrs r4, r0 + lsls r0, r1, #0x1c + lsrs r0, r0, #0x1f + lsls r0, r0, #0x13 + orrs r4, r0 + lsls r0, r1, #0x1b + lsrs r0, r0, #0x1f + lsls r0, r0, #0x14 + orrs r4, r0 + lsls r0, r1, #0x1a + lsrs r0, r0, #0x1f + lsls r0, r0, #0x15 + orrs r4, r0 + lsls r0, r1, #0x19 + lsrs r0, r0, #0x1f + lsls r0, r0, #0x16 + orrs r4, r0 + lsrs r1, r1, #7 + lsls r1, r1, #0x17 + orrs r4, r1 + ldrb r1, [r5, #0xb] + lsls r0, r1, #0x1f + lsrs r0, r0, #0x1f + lsls r0, r0, #0x18 + orrs r4, r0 + lsls r0, r1, #0x1e + lsrs r0, r0, #0x1f + lsls r0, r0, #0x19 + orrs r4, r0 + lsls r1, r1, #0x1d + lsrs r1, r1, #0x1f + lsls r1, r1, #0x1a + orrs r4, r1 +_0200B4AC: + ldr r2, [sp, #0x10] + cmp r2, #0xa + ble _0200B4CE + movs r3, #0 + mov r2, r8 + adds r2, #0x20 +_0200B4B8: + ldr r0, [r2] + mov r5, r8 + ldr r1, [r5] + eors r0, r1 + str r0, [r2] + ldr r1, [r5, #4] + eors r0, r1 + stm r2!, {r0} + adds r3, #1 + cmp r3, #0xb + bls _0200B4B8 +_0200B4CE: + adds r0, r4, #0 + add sp, #0x18 + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + + thumb_func_start sub_0200B4E0 +sub_0200B4E0: @ 0x0200B4E0 + push {r4, r5, r6, r7, lr} + mov r7, r8 + push {r7} + movs r1, #0x64 + adds r4, r0, #0 + muls r4, r1, r4 + ldr r5, =gUnknown_02022EF4 + ldr r0, [r5] + adds r0, r4, r0 + movs r1, #0x41 + movs r2, #0 + bl sub_0200AE74 + lsls r0, r0, #0x10 + lsrs r7, r0, #0x10 + mov r8, r7 + ldr r0, [r5] + adds r0, r4, r0 + movs r1, #1 + movs r2, #0 + bl sub_0200AE74 + adds r6, r0, #0 + ldr r0, [r5] + adds r4, r4, r0 + adds r0, r4, #0 + movs r1, #0 + movs r2, #0 + bl sub_0200AE74 + adds r3, r0, #0 + movs r0, #0xce + lsls r0, r0, #1 + cmp r7, r0 + bls _0200B538 + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + ldr r0, [r0, #0x30] + b _0200B56C + .align 2, 0 + .pool +_0200B538: + lsrs r0, r6, #0x10 + ldr r2, =0x0000FFFF + ands r6, r2 + eors r0, r6 + lsrs r1, r3, #0x10 + eors r0, r1 + ands r3, r2 + eors r0, r3 + cmp r0, #7 + bhi _0200B560 + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + lsls r1, r7, #3 + ldr r0, [r0, #0x34] + b _0200B56A + .align 2, 0 + .pool +_0200B560: + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + mov r2, r8 + lsls r1, r2, #3 + ldr r0, [r0, #0x30] +_0200B56A: + adds r0, r0, r1 +_0200B56C: + pop {r3} + mov r8, r3 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200B57C +sub_0200B57C: @ 0x0200B57C + push {r4, r5, r6, lr} + adds r4, r0, #0 + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + adds r0, #0xbc + ldr r6, [r0] + adds r0, r4, #0 + movs r1, #0xb + movs r2, #0 + bl sub_0200AE74 + adds r5, r0, #0 + adds r0, r4, #0 + movs r1, #0x2e + movs r2, #0 + bl sub_0200AE74 + cmp r0, #0 + bne _0200B5B4 + lsls r0, r5, #3 + subs r0, r0, r5 + lsls r0, r0, #2 + adds r0, r0, r6 + ldrb r0, [r0, #0x16] + b _0200B5BE + .align 2, 0 + .pool +_0200B5B4: + lsls r0, r5, #3 + subs r0, r0, r5 + lsls r0, r0, #2 + adds r0, r0, r6 + ldrb r0, [r0, #0x17] +_0200B5BE: + pop {r4, r5, r6} + pop {r1} + bx r1 + + thumb_func_start sub_0200B5C4 +sub_0200B5C4: @ 0x0200B5C4 + push {lr} + movs r1, #0x26 + movs r2, #0 + bl sub_0200AE74 + lsls r0, r0, #0x10 + lsrs r0, r0, #0x10 + subs r0, #1 + cmp r0, #0xb + bhi _0200B644 + lsls r0, r0, #2 + ldr r1, =_0200B5E8 + adds r0, r0, r1 + ldr r0, [r0] + mov pc, r0 + .align 2, 0 + .pool +_0200B5E8: @ jump table + .4byte _0200B618 @ case 0 + .4byte _0200B61C @ case 1 + .4byte _0200B620 @ case 2 + .4byte _0200B644 @ case 3 + .4byte _0200B624 @ case 4 + .4byte _0200B628 @ case 5 + .4byte _0200B62C @ case 6 + .4byte _0200B630 @ case 7 + .4byte _0200B634 @ case 8 + .4byte _0200B638 @ case 9 + .4byte _0200B63C @ case 10 + .4byte _0200B640 @ case 11 +_0200B618: + movs r2, #4 + b _0200B646 +_0200B61C: + movs r2, #3 + b _0200B646 +_0200B620: + movs r2, #1 + b _0200B646 +_0200B624: + movs r2, #2 + b _0200B646 +_0200B628: + movs r2, #5 + b _0200B646 +_0200B62C: + movs r2, #6 + b _0200B646 +_0200B630: + movs r2, #7 + b _0200B646 +_0200B634: + movs r2, #8 + b _0200B646 +_0200B638: + movs r2, #9 + b _0200B646 +_0200B63C: + movs r2, #0xa + b _0200B646 +_0200B640: + movs r2, #0xb + b _0200B646 +_0200B644: + movs r2, #0 +_0200B646: + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + adds r0, #0xd0 + ldr r1, [r0] + lsls r0, r2, #3 + adds r0, r0, r1 + ldr r0, [r0] + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200B65C +sub_0200B65C: @ 0x0200B65C + push {lr} + movs r1, #0x26 + movs r2, #0 + bl sub_0200AE74 + lsls r0, r0, #0x10 + lsrs r0, r0, #0x10 + subs r0, #1 + cmp r0, #0xb + bhi _0200B6DC + lsls r0, r0, #2 + ldr r1, =_0200B680 + adds r0, r0, r1 + ldr r0, [r0] + mov pc, r0 + .align 2, 0 + .pool +_0200B680: @ jump table + .4byte _0200B6B0 @ case 0 + .4byte _0200B6B4 @ case 1 + .4byte _0200B6B8 @ case 2 + .4byte _0200B6DC @ case 3 + .4byte _0200B6BC @ case 4 + .4byte _0200B6C0 @ case 5 + .4byte _0200B6C4 @ case 6 + .4byte _0200B6C8 @ case 7 + .4byte _0200B6CC @ case 8 + .4byte _0200B6D0 @ case 9 + .4byte _0200B6D4 @ case 10 + .4byte _0200B6D8 @ case 11 +_0200B6B0: + movs r2, #4 + b _0200B6DE +_0200B6B4: + movs r2, #3 + b _0200B6DE +_0200B6B8: + movs r2, #1 + b _0200B6DE +_0200B6BC: + movs r2, #2 + b _0200B6DE +_0200B6C0: + movs r2, #5 + b _0200B6DE +_0200B6C4: + movs r2, #6 + b _0200B6DE +_0200B6C8: + movs r2, #7 + b _0200B6DE +_0200B6CC: + movs r2, #8 + b _0200B6DE +_0200B6D0: + movs r2, #9 + b _0200B6DE +_0200B6D4: + movs r2, #0xa + b _0200B6DE +_0200B6D8: + movs r2, #0xb + b _0200B6DE +_0200B6DC: + movs r2, #0 +_0200B6DE: + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + adds r0, #0xd4 + ldr r1, [r0] + lsls r0, r2, #3 + adds r0, r0, r1 + ldr r0, [r0] + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200B6F4 +sub_0200B6F4: @ 0x0200B6F4 + push {lr} + cmp r1, #1 + beq _0200B70E + cmp r1, #1 + bgt _0200B704 + cmp r1, #0 + beq _0200B70A + b _0200B71C +_0200B704: + cmp r1, #2 + beq _0200B712 + b _0200B71C +_0200B70A: + movs r1, #0xd + b _0200B714 +_0200B70E: + movs r1, #0xe + b _0200B714 +_0200B712: + movs r1, #0xf +_0200B714: + movs r2, #0 + bl sub_0200AE74 + b _0200B724 +_0200B71C: + movs r1, #0x10 + movs r2, #0 + bl sub_0200AE74 +_0200B724: + pop {r1} + bx r1 + + thumb_func_start sub_0200B728 +sub_0200B728: @ 0x0200B728 + push {lr} + lsls r1, r1, #0x18 + lsrs r1, r1, #0x18 + adds r2, r1, #0 + cmp r1, #1 + beq _0200B748 + cmp r1, #1 + bgt _0200B73E + cmp r1, #0 + beq _0200B744 + b _0200B756 +_0200B73E: + cmp r2, #2 + beq _0200B74C + b _0200B756 +_0200B744: + movs r1, #0x11 + b _0200B74E +_0200B748: + movs r1, #0x12 + b _0200B74E +_0200B74C: + movs r1, #0x13 +_0200B74E: + movs r2, #0 + bl sub_0200AE74 + b _0200B75E +_0200B756: + movs r1, #0x14 + movs r2, #0 + bl sub_0200AE74 +_0200B75E: + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200B764 +sub_0200B764: @ 0x0200B764 + push {r4, r5, r6, r7, lr} + mov r7, r8 + push {r7} + adds r6, r0, #0 + lsls r1, r1, #0x18 + lsrs r4, r1, #0x18 + movs r7, #0 + movs r5, #1 + movs r0, #0 + mov r8, r0 + cmp r4, #0 + beq _0200B7AC +_0200B77C: + movs r0, #1 + ands r0, r4 + cmp r0, #0 + beq _0200B7A0 + movs r0, #0x64 + muls r0, r7, r0 + adds r0, r0, r6 + movs r1, #0x22 + movs r2, #0 + bl sub_0200AE74 + movs r1, #0xf + ands r1, r0 + cmp r1, #0 + beq _0200B7A0 + mov r0, r8 + orrs r0, r5 + mov r8, r0 +_0200B7A0: + adds r7, #1 + lsls r5, r5, #1 + lsrs r4, r4, #1 + cmp r4, #0 + bne _0200B77C + b _0200B7C2 +_0200B7AC: + adds r0, r6, #0 + movs r1, #0x22 + movs r2, #0 + bl sub_0200AE74 + movs r1, #0xf + ands r1, r0 + cmp r1, #0 + beq _0200B7C2 + movs r0, #1 + mov r8, r0 +_0200B7C2: + mov r0, r8 + pop {r3} + mov r8, r3 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200B7D0 +sub_0200B7D0: @ 0x0200B7D0 + push {lr} + adds r2, r0, #0 + adds r0, #0x56 + ldrh r0, [r0] + cmp r0, #0 + bne _0200B7E0 + movs r0, #7 + b _0200B834 +_0200B7E0: + ldr r1, [r2, #0x50] + movs r0, #0x88 + ands r0, r1 + cmp r0, #0 + beq _0200B7EE + movs r0, #1 + b _0200B834 +_0200B7EE: + movs r0, #0x40 + ands r0, r1 + cmp r0, #0 + beq _0200B7FA + movs r0, #2 + b _0200B834 +_0200B7FA: + movs r0, #7 + ands r0, r1 + cmp r0, #0 + beq _0200B806 + movs r0, #3 + b _0200B834 +_0200B806: + movs r0, #0x20 + ands r0, r1 + cmp r0, #0 + beq _0200B812 + movs r0, #4 + b _0200B834 +_0200B812: + movs r0, #0x10 + ands r1, r0 + movs r0, #0 + cmp r1, #0 + beq _0200B81E + movs r0, #5 +_0200B81E: + cmp r0, #0 + bne _0200B834 + adds r0, r2, #0 + movs r1, #0 + bl sub_0200B764 + cmp r0, #0 + bne _0200B832 + movs r0, #0 + b _0200B834 +_0200B832: + movs r0, #6 +_0200B834: + pop {r1} + bx r1 + + thumb_func_start sub_0200B838 +sub_0200B838: @ 0x0200B838 + push {r4, r5, r6, r7, lr} + mov r7, r8 + push {r7} + adds r6, r0, #0 + lsls r1, r1, #0x18 + lsrs r4, r1, #0x18 + movs r7, #0 + movs r5, #1 + movs r0, #0 + mov r8, r0 + cmp r4, #0 + beq _0200B87C +_0200B850: + movs r0, #1 + ands r0, r4 + cmp r0, #0 + beq _0200B870 + movs r0, #0x64 + muls r0, r7, r0 + adds r0, r0, r6 + movs r1, #0x22 + movs r2, #0 + bl sub_0200AE74 + cmp r0, #0 + beq _0200B870 + mov r0, r8 + orrs r0, r5 + mov r8, r0 +_0200B870: + adds r7, #1 + lsls r5, r5, #1 + lsrs r4, r4, #1 + cmp r4, #0 + bne _0200B850 + b _0200B88E +_0200B87C: + adds r0, r6, #0 + movs r1, #0x22 + movs r2, #0 + bl sub_0200AE74 + cmp r0, #0 + beq _0200B88E + movs r0, #1 + mov r8, r0 +_0200B88E: + mov r0, r8 + pop {r3} + mov r8, r3 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200B89C +sub_0200B89C: @ 0x0200B89C + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #0xc + adds r5, r1, #0 + str r2, [sp] + lsls r0, r0, #0x10 + movs r1, #0x9a + lsls r1, r1, #0x11 + cmp r0, r1 + bne _0200B9AE + ldr r0, =gUnknown_020251EC + ldrb r0, [r0] + movs r1, #7 + str r1, [sp, #4] + cmp r0, #0 + beq _0200B8C6 + movs r3, #0 + str r3, [sp, #4] +_0200B8C6: + movs r6, #0 +_0200B8C8: + lsls r3, r6, #3 + adds r3, r3, r6 + lsls r3, r3, #2 + ldr r0, =gUnknown_0201E778 + adds r4, r3, r0 + ldrb r1, [r4] + adds r1, #0xf8 + movs r2, #0xf + adds r0, r5, #0 + ands r0, r2 + adds r1, r1, r0 + lsls r1, r1, #0x18 + lsrs r1, r1, #0x18 + mov ip, r1 + ldrb r1, [r4, #1] + adds r1, #0xf8 + movs r0, #0xf0 + ands r0, r5 + lsrs r0, r0, #4 + adds r1, r1, r0 + ldr r0, [sp, #4] + subs r1, r1, r0 + lsls r1, r1, #0x18 + lsrs r1, r1, #0x18 + movs r2, #0 + lsrs r5, r5, #8 + str r5, [sp, #8] + adds r6, #1 + mov sl, r6 + mov sb, r3 +_0200B904: + lsls r0, r2, #1 + add r0, sb + ldr r3, =gUnknown_0201E77A + adds r0, r0, r3 + ldrh r3, [r0] + mov r4, ip + adds r0, r4, #0 + adds r0, #0x10 + adds r7, r1, #1 + adds r2, #1 + mov r8, r2 + cmp r4, r0 + bge _0200B99C + lsrs r0, r1, #3 + lsls r6, r0, #8 + movs r0, #7 + ands r1, r0 + lsls r5, r1, #2 +_0200B928: + adds r0, r4, #0 + cmp r4, #0 + bge _0200B930 + adds r0, r4, #7 +_0200B930: + asrs r0, r0, #3 + lsls r2, r0, #5 + ldr r1, [sp] + adds r2, r1, r2 + lsls r0, r0, #3 + subs r0, r4, r0 + lsrs r1, r0, #0x1f + adds r0, r0, r1 + asrs r0, r0, #1 + adds r2, r2, r0 + adds r2, r2, r6 + adds r2, r2, r5 + movs r1, #1 + adds r0, r3, #0 + ands r0, r1 + cmp r0, #0 + beq _0200B990 + adds r0, r4, #0 + ands r0, r1 + cmp r0, #0 + beq _0200B97C + ldrb r1, [r2] + movs r0, #0xf0 + ands r0, r1 + subs r0, #0x10 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + cmp r0, #0x20 + bhi _0200B990 + adds r0, r1, #0 + adds r0, #0x40 + b _0200B98E + .align 2, 0 + .pool +_0200B97C: + ldrb r1, [r2] + movs r0, #0xf + ands r0, r1 + subs r0, #1 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + cmp r0, #2 + bhi _0200B990 + adds r0, r1, #4 +_0200B98E: + strb r0, [r2] +_0200B990: + asrs r3, r3, #1 + adds r4, #1 + mov r0, ip + adds r0, #0x10 + cmp r4, r0 + blt _0200B928 +_0200B99C: + lsls r0, r7, #0x18 + lsrs r1, r0, #0x18 + mov r2, r8 + cmp r2, #0xf + ble _0200B904 + ldr r5, [sp, #8] + mov r6, sl + cmp r6, #3 + ble _0200B8C8 +_0200B9AE: + add sp, #0xc + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start sub_0200B9C0 +sub_0200B9C0: @ 0x0200B9C0 + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #4 + adds r6, r0, #0 + str r1, [sp] + adds r4, r2, #0 + movs r0, #0 + mov sb, r0 + mov sl, r0 + movs r7, #0 + movs r5, #0 + cmp r1, #0xa + ble _0200BA6C + ldr r1, [r6] + adds r0, r6, #0 + movs r2, #0 + bl sub_0200A8B8 + mov sb, r0 + ldr r1, [r6] + adds r0, r6, #0 + movs r2, #1 + bl sub_0200A8B8 + mov sl, r0 + ldr r1, [r6] + adds r0, r6, #0 + movs r2, #2 + bl sub_0200A8B8 + adds r7, r0, #0 + ldr r1, [r6] + adds r0, r6, #0 + movs r2, #3 + bl sub_0200A8B8 + adds r5, r0, #0 + movs r3, #0 + movs r1, #0x20 + adds r1, r1, r6 + mov r8, r1 + mov r2, r8 +_0200BA1A: + ldr r0, [r2] + ldr r1, [r6, #4] + eors r0, r1 + str r0, [r2] + ldr r1, [r6] + eors r0, r1 + stm r2!, {r0} + adds r3, #1 + cmp r3, #0xb + bls _0200BA1A + adds r0, r6, #0 + bl sub_0200ADE0 + lsls r0, r0, #0x10 + lsrs r0, r0, #0x10 + ldrh r2, [r6, #0x1c] + cmp r0, r2 + beq _0200BA6C + movs r0, #1 + ldrb r4, [r6, #0x13] + orrs r0, r4 + movs r1, #4 + orrs r0, r1 + strb r0, [r6, #0x13] + movs r0, #0x40 + ldrb r1, [r5, #7] + orrs r0, r1 + strb r0, [r5, #7] + movs r3, #0 + mov r2, r8 +_0200BA56: + ldr r0, [r2] + ldr r1, [r6] + eors r0, r1 + str r0, [r2] + ldr r1, [r6, #4] + eors r0, r1 + stm r2!, {r0} + adds r3, #1 + cmp r3, #0xb + bls _0200BA56 + b _0200C024 +_0200BA6C: + ldr r2, [sp] + cmp r2, #0x4f + bls _0200BA74 + b _0200BFFC +_0200BA74: + lsls r0, r2, #2 + ldr r1, =_0200BA84 + adds r0, r0, r1 + ldr r0, [r0] + mov pc, r0 + .align 2, 0 + .pool +_0200BA84: @ jump table + .4byte _0200BBC4 @ case 0 + .4byte _0200BBDC @ case 1 + .4byte _0200BBF4 @ case 2 + .4byte _0200BC24 @ case 3 + .4byte _0200BC2A @ case 4 + .4byte _0200BC36 @ case 5 + .4byte _0200BC48 @ case 6 + .4byte _0200BC5E @ case 7 + .4byte _0200BC8C @ case 8 + .4byte _0200BC92 @ case 9 + .4byte _0200BC9E @ case 10 + .4byte _0200BCAA @ case 11 + .4byte _0200BCC4 @ case 12 + .4byte _0200BCFC @ case 13 + .4byte _0200BCFC @ case 14 + .4byte _0200BCFC @ case 15 + .4byte _0200BCFC @ case 16 + .4byte _0200BD10 @ case 17 + .4byte _0200BD10 @ case 18 + .4byte _0200BD10 @ case 19 + .4byte _0200BD10 @ case 20 + .4byte _0200BCEC @ case 21 + .4byte _0200BD40 @ case 22 + .4byte _0200BD46 @ case 23 + .4byte _0200BD4C @ case 24 + .4byte _0200BCD2 @ case 25 + .4byte _0200BD1C @ case 26 + .4byte _0200BD22 @ case 27 + .4byte _0200BD28 @ case 28 + .4byte _0200BD2E @ case 29 + .4byte _0200BD34 @ case 30 + .4byte _0200BD3A @ case 31 + .4byte _0200BCF4 @ case 32 + .4byte _0200BD52 @ case 33 + .4byte _0200BD64 @ case 34 + .4byte _0200BD6A @ case 35 + .4byte _0200BD70 @ case 36 + .4byte _0200BD84 @ case 37 + .4byte _0200BD9C @ case 38 + .4byte _0200BDBE @ case 39 + .4byte _0200BDD2 @ case 40 + .4byte _0200BDEC @ case 41 + .4byte _0200BE02 @ case 42 + .4byte _0200BE1C @ case 43 + .4byte _0200BE34 @ case 44 + .4byte _0200BE48 @ case 45 + .4byte _0200BE78 @ case 46 + .4byte _0200BD58 @ case 47 + .4byte _0200BD5E @ case 48 + .4byte _0200BDAE @ case 49 + .4byte _0200BE86 @ case 50 + .4byte _0200BE96 @ case 51 + .4byte _0200BEAC @ case 52 + .4byte _0200BEC4 @ case 53 + .4byte _0200BED2 @ case 54 + .4byte _0200BFFC @ case 55 + .4byte _0200BFFC @ case 56 + .4byte _0200BFFC @ case 57 + .4byte _0200BFFC @ case 58 + .4byte _0200BFFC @ case 59 + .4byte _0200BFFC @ case 60 + .4byte _0200BFFC @ case 61 + .4byte _0200BFFC @ case 62 + .4byte _0200BFFC @ case 63 + .4byte _0200BFFC @ case 64 + .4byte _0200BFFC @ case 65 + .4byte _0200BFB4 @ case 66 + .4byte _0200BEE4 @ case 67 + .4byte _0200BEF4 @ case 68 + .4byte _0200BF04 @ case 69 + .4byte _0200BF12 @ case 70 + .4byte _0200BF24 @ case 71 + .4byte _0200BF32 @ case 72 + .4byte _0200BF44 @ case 73 + .4byte _0200BF52 @ case 74 + .4byte _0200BF64 @ case 75 + .4byte _0200BF74 @ case 76 + .4byte _0200BF84 @ case 77 + .4byte _0200BF92 @ case 78 + .4byte _0200BFA4 @ case 79 +_0200BBC4: + ldrb r1, [r4, #1] + lsls r0, r1, #8 + ldrb r2, [r4] + orrs r0, r2 + ldrb r2, [r4, #2] + lsls r1, r2, #0x10 + adds r0, r0, r1 + ldrb r4, [r4, #3] + lsls r1, r4, #0x18 + adds r0, r0, r1 + str r0, [r6] + b _0200BFFC +_0200BBDC: + ldrb r1, [r4, #1] + lsls r0, r1, #8 + ldrb r2, [r4] + orrs r0, r2 + ldrb r2, [r4, #2] + lsls r1, r2, #0x10 + adds r0, r0, r1 + ldrb r4, [r4, #3] + lsls r1, r4, #0x18 + adds r0, r0, r1 + str r0, [r6, #4] + b _0200BFFC +_0200BBF4: + movs r2, #0 + ldr r5, =gUnknown_020251E8 + ldr r0, [r5] + adds r0, #0x76 + ldrb r0, [r0] + cmp r2, r0 + blt _0200BC04 + b _0200BFFC +_0200BC04: + adds r3, r6, #0 + adds r3, #8 +_0200BC08: + adds r1, r3, r2 + adds r0, r4, r2 + ldrb r0, [r0] + strb r0, [r1] + adds r2, #1 + ldr r0, [r5] + adds r0, #0x76 + ldrb r0, [r0] + cmp r2, r0 + blt _0200BC08 + b _0200BFFC + .align 2, 0 + .pool +_0200BC24: + ldrb r0, [r4] + strb r0, [r6, #0x12] + b _0200BFFC +_0200BC2A: + movs r1, #1 + ldrb r4, [r4] + ands r1, r4 + movs r0, #2 + rsbs r0, r0, #0 + b _0200BC54 +_0200BC36: + movs r1, #1 + ldrb r4, [r4] + ands r1, r4 + lsls r1, r1, #1 + movs r0, #3 + rsbs r0, r0, #0 + ldrb r2, [r6, #0x13] + ands r0, r2 + b _0200BC58 +_0200BC48: + movs r1, #1 + ldrb r4, [r4] + ands r1, r4 + lsls r1, r1, #2 + movs r0, #5 + rsbs r0, r0, #0 +_0200BC54: + ldrb r4, [r6, #0x13] + ands r0, r4 +_0200BC58: + orrs r0, r1 + strb r0, [r6, #0x13] + b _0200BFFC +_0200BC5E: + movs r2, #0 + ldr r5, =gUnknown_020251E8 + ldr r0, [r5] + adds r0, #0x74 + ldrb r0, [r0] + cmp r2, r0 + blt _0200BC6E + b _0200BFFC +_0200BC6E: + adds r3, r6, #0 + adds r3, #0x14 +_0200BC72: + adds r1, r3, r2 + adds r0, r4, r2 + ldrb r0, [r0] + strb r0, [r1] + adds r2, #1 + ldr r0, [r5] + adds r0, #0x74 + ldrb r0, [r0] + cmp r2, r0 + blt _0200BC72 + b _0200BFFC + .align 2, 0 + .pool +_0200BC8C: + ldrb r0, [r4] + strb r0, [r6, #0x1b] + b _0200BFFC +_0200BC92: + ldrb r1, [r4, #1] + lsls r0, r1, #8 + ldrb r4, [r4] + orrs r0, r4 + strh r0, [r6, #0x1c] + b _0200BFFC +_0200BC9E: + ldrb r2, [r4, #1] + lsls r0, r2, #8 + ldrb r4, [r4] + orrs r0, r4 + strh r0, [r6, #0x1e] + b _0200BFFC +_0200BCAA: + ldrb r1, [r4, #1] + lsls r0, r1, #8 + ldrb r4, [r4] + orrs r0, r4 + mov r2, sb + strh r0, [r2] + cmp r0, #0 + beq _0200BCBE + movs r0, #2 + b _0200BE64 +_0200BCBE: + movs r0, #3 + rsbs r0, r0, #0 + b _0200BE70 +_0200BCC4: + ldrb r2, [r4, #1] + lsls r0, r2, #8 + ldrb r4, [r4] + orrs r0, r4 + mov r4, sb + strh r0, [r4, #2] + b _0200BFFC +_0200BCD2: + ldrb r1, [r4, #1] + lsls r0, r1, #8 + ldrb r2, [r4] + orrs r0, r2 + ldrb r2, [r4, #2] + lsls r1, r2, #0x10 + adds r0, r0, r1 + ldrb r4, [r4, #3] + lsls r1, r4, #0x18 + adds r0, r0, r1 + mov r4, sb + str r0, [r4, #4] + b _0200BFFC +_0200BCEC: + ldrb r0, [r4] + mov r1, sb + strb r0, [r1, #8] + b _0200BFFC +_0200BCF4: + ldrb r0, [r4] + mov r2, sb + strb r0, [r2, #9] + b _0200BFFC +_0200BCFC: + ldr r1, [sp] + subs r1, #0xd + lsls r1, r1, #1 + add r1, sl + ldrb r2, [r4, #1] + lsls r0, r2, #8 + ldrb r4, [r4] + orrs r0, r4 + strh r0, [r1] + b _0200BFFC +_0200BD10: + ldr r0, [sp] + add r0, sl + subs r0, #9 + ldrb r1, [r4] + strb r1, [r0] + b _0200BFFC +_0200BD1C: + ldrb r0, [r4] + strb r0, [r7] + b _0200BFFC +_0200BD22: + ldrb r0, [r4] + strb r0, [r7, #1] + b _0200BFFC +_0200BD28: + ldrb r0, [r4] + strb r0, [r7, #2] + b _0200BFFC +_0200BD2E: + ldrb r0, [r4] + strb r0, [r7, #3] + b _0200BFFC +_0200BD34: + ldrb r0, [r4] + strb r0, [r7, #4] + b _0200BFFC +_0200BD3A: + ldrb r0, [r4] + strb r0, [r7, #5] + b _0200BFFC +_0200BD40: + ldrb r0, [r4] + strb r0, [r7, #6] + b _0200BFFC +_0200BD46: + ldrb r0, [r4] + strb r0, [r7, #7] + b _0200BFFC +_0200BD4C: + ldrb r0, [r4] + strb r0, [r7, #8] + b _0200BFFC +_0200BD52: + ldrb r0, [r4] + strb r0, [r7, #9] + b _0200BFFC +_0200BD58: + ldrb r0, [r4] + strb r0, [r7, #0xa] + b _0200BFFC +_0200BD5E: + ldrb r0, [r4] + strb r0, [r7, #0xb] + b _0200BFFC +_0200BD64: + ldrb r0, [r4] + strb r0, [r5] + b _0200BFFC +_0200BD6A: + ldrb r0, [r4] + strb r0, [r5, #1] + b _0200BFFC +_0200BD70: + movs r1, #0x7f + ldrb r4, [r4] + ands r1, r4 + movs r0, #0x80 + rsbs r0, r0, #0 + ldrb r4, [r5, #2] + ands r0, r4 + orrs r0, r1 + strb r0, [r5, #2] + b _0200BFFC +_0200BD84: + movs r1, #0xf + ldrb r4, [r4] + ands r1, r4 + lsls r1, r1, #7 + ldr r0, =0xFFFFF87F + ldrh r2, [r5, #2] + ands r0, r2 + orrs r0, r1 + strh r0, [r5, #2] + b _0200BFFC + .align 2, 0 + .pool +_0200BD9C: + movs r1, #0xf + ldrb r4, [r4] + ands r1, r4 + lsls r1, r1, #3 + movs r0, #0x79 + rsbs r0, r0, #0 + ldrb r4, [r5, #3] + ands r0, r4 + b _0200BDB8 +_0200BDAE: + ldrb r4, [r4] + lsls r1, r4, #7 + movs r0, #0x7f + ldrb r2, [r5, #3] + ands r0, r2 +_0200BDB8: + orrs r0, r1 + strb r0, [r5, #3] + b _0200BFFC +_0200BDBE: + movs r1, #0x1f + ldrb r4, [r4] + ands r1, r4 + movs r0, #0x20 + rsbs r0, r0, #0 + ldrb r4, [r5, #4] + ands r0, r4 + orrs r0, r1 + strb r0, [r5, #4] + b _0200BFFC +_0200BDD2: + movs r1, #0x1f + ldrb r4, [r4] + ands r1, r4 + lsls r1, r1, #5 + ldr r0, =0xFFFFFC1F + ldrh r2, [r5, #4] + ands r0, r2 + orrs r0, r1 + strh r0, [r5, #4] + b _0200BFFC + .align 2, 0 + .pool +_0200BDEC: + movs r1, #0x1f + ldrb r4, [r4] + ands r1, r4 + lsls r1, r1, #2 + movs r0, #0x7d + rsbs r0, r0, #0 + ldrb r4, [r5, #5] + ands r0, r4 + orrs r0, r1 + strb r0, [r5, #5] + b _0200BFFC +_0200BE02: + movs r0, #0x1f + ldrb r4, [r4] + ands r0, r4 + lsls r0, r0, #0xf + ldr r1, [r5, #4] + ldr r2, =0xFFF07FFF + ands r1, r2 + orrs r1, r0 + str r1, [r5, #4] + b _0200BFFC + .align 2, 0 + .pool +_0200BE1C: + movs r1, #0x1f + ldrb r4, [r4] + ands r1, r4 + lsls r1, r1, #4 + ldr r0, =0xFFFFFE0F + ldrh r2, [r5, #6] + ands r0, r2 + orrs r0, r1 + strh r0, [r5, #6] + b _0200BFFC + .align 2, 0 + .pool +_0200BE34: + movs r1, #0x1f + ldrb r4, [r4] + ands r1, r4 + lsls r1, r1, #1 + movs r0, #0x3f + rsbs r0, r0, #0 + ldrb r4, [r5, #7] + ands r0, r4 + orrs r0, r1 + b _0200BFFA +_0200BE48: + movs r1, #1 + ldrb r4, [r4] + ands r1, r4 + lsls r1, r1, #6 + movs r0, #0x41 + rsbs r0, r0, #0 + ldrb r2, [r5, #7] + ands r0, r2 + orrs r0, r1 + strb r0, [r5, #7] + lsls r0, r0, #0x19 + cmp r0, #0 + bge _0200BE6C + movs r0, #4 +_0200BE64: + ldrb r4, [r6, #0x13] + orrs r0, r4 + strb r0, [r6, #0x13] + b _0200BFFC +_0200BE6C: + movs r0, #5 + rsbs r0, r0, #0 +_0200BE70: + ldrb r1, [r6, #0x13] + ands r0, r1 + strb r0, [r6, #0x13] + b _0200BFFC +_0200BE78: + ldrb r4, [r4] + lsls r1, r4, #7 + movs r0, #0x7f + ldrb r2, [r5, #7] + ands r0, r2 + orrs r0, r1 + b _0200BFFA +_0200BE86: + movs r1, #7 + ldrb r4, [r4] + ands r1, r4 + movs r0, #8 + rsbs r0, r0, #0 + ldrb r4, [r5, #8] + ands r0, r4 + b _0200BEA6 +_0200BE96: + movs r1, #7 + ldrb r4, [r4] + ands r1, r4 + lsls r1, r1, #3 + movs r0, #0x39 + rsbs r0, r0, #0 + ldrb r2, [r5, #8] + ands r0, r2 +_0200BEA6: + orrs r0, r1 + strb r0, [r5, #8] + b _0200BFFC +_0200BEAC: + movs r1, #7 + ldrb r4, [r4] + ands r1, r4 + lsls r1, r1, #6 + ldr r0, =0xFFFFFE3F + ldrh r4, [r5, #8] + ands r0, r4 + orrs r0, r1 + strh r0, [r5, #8] + b _0200BFFC + .align 2, 0 + .pool +_0200BEC4: + movs r1, #7 + ldrb r4, [r4] + ands r1, r4 + lsls r1, r1, #1 + movs r0, #0xf + rsbs r0, r0, #0 + b _0200BEEA +_0200BED2: + movs r1, #7 + ldrb r4, [r4] + ands r1, r4 + lsls r1, r1, #4 + movs r0, #0x71 + rsbs r0, r0, #0 + ldrb r4, [r5, #9] + ands r0, r4 + b _0200BEEE +_0200BEE4: + ldrb r4, [r4] + lsls r1, r4, #7 + movs r0, #0x7f +_0200BEEA: + ldrb r2, [r5, #9] + ands r0, r2 +_0200BEEE: + orrs r0, r1 + strb r0, [r5, #9] + b _0200BFFC +_0200BEF4: + movs r1, #1 + ldrb r4, [r4] + ands r1, r4 + movs r0, #2 + rsbs r0, r0, #0 + ldrb r4, [r5, #0xa] + ands r0, r4 + b _0200BF6E +_0200BF04: + movs r1, #1 + ldrb r4, [r4] + ands r1, r4 + lsls r1, r1, #1 + movs r0, #3 + rsbs r0, r0, #0 + b _0200BF6A +_0200BF12: + movs r1, #1 + ldrb r4, [r4] + ands r1, r4 + lsls r1, r1, #2 + movs r0, #5 + rsbs r0, r0, #0 + ldrb r4, [r5, #0xa] + ands r0, r4 + b _0200BF6E +_0200BF24: + movs r1, #1 + ldrb r4, [r4] + ands r1, r4 + lsls r1, r1, #3 + movs r0, #9 + rsbs r0, r0, #0 + b _0200BF6A +_0200BF32: + movs r1, #1 + ldrb r4, [r4] + ands r1, r4 + lsls r1, r1, #4 + movs r0, #0x11 + rsbs r0, r0, #0 + ldrb r4, [r5, #0xa] + ands r0, r4 + b _0200BF6E +_0200BF44: + movs r1, #1 + ldrb r4, [r4] + ands r1, r4 + lsls r1, r1, #5 + movs r0, #0x21 + rsbs r0, r0, #0 + b _0200BF6A +_0200BF52: + movs r1, #1 + ldrb r4, [r4] + ands r1, r4 + lsls r1, r1, #6 + movs r0, #0x41 + rsbs r0, r0, #0 + ldrb r4, [r5, #0xa] + ands r0, r4 + b _0200BF6E +_0200BF64: + ldrb r4, [r4] + lsls r1, r4, #7 + movs r0, #0x7f +_0200BF6A: + ldrb r2, [r5, #0xa] + ands r0, r2 +_0200BF6E: + orrs r0, r1 + strb r0, [r5, #0xa] + b _0200BFFC +_0200BF74: + movs r1, #1 + ldrb r4, [r4] + ands r1, r4 + movs r0, #2 + rsbs r0, r0, #0 + ldrb r4, [r5, #0xb] + ands r0, r4 + b _0200BFAE +_0200BF84: + movs r1, #1 + ldrb r4, [r4] + ands r1, r4 + lsls r1, r1, #1 + movs r0, #3 + rsbs r0, r0, #0 + b _0200BFAA +_0200BF92: + movs r1, #1 + ldrb r4, [r4] + ands r1, r4 + lsls r1, r1, #2 + movs r0, #5 + rsbs r0, r0, #0 + ldrb r4, [r5, #0xb] + ands r0, r4 + b _0200BFAE +_0200BFA4: + ldrb r4, [r4] + lsls r1, r4, #3 + movs r0, #7 +_0200BFAA: + ldrb r2, [r5, #0xb] + ands r0, r2 +_0200BFAE: + orrs r0, r1 + strb r0, [r5, #0xb] + b _0200BFFC +_0200BFB4: + ldrb r1, [r4] + movs r3, #0x1f + adds r2, r1, #0 + ands r2, r3 + movs r0, #0x20 + rsbs r0, r0, #0 + ldrb r4, [r5, #4] + ands r0, r4 + orrs r0, r2 + strb r0, [r5, #4] + lsrs r1, r1, #5 + ands r1, r3 + lsls r1, r1, #5 + ldr r0, =0xFFFFFC1F + ldrh r2, [r5, #4] + ands r0, r2 + orrs r0, r1 + strh r0, [r5, #4] + movs r0, #0x7d + rsbs r0, r0, #0 + ldrb r4, [r5, #5] + ands r0, r4 + strb r0, [r5, #5] + ldr r0, [r5, #4] + ldr r1, =0xFFF07FFF + ands r0, r1 + str r0, [r5, #4] + ldr r0, =0xFFFFFE0F + ldrh r1, [r5, #6] + ands r0, r1 + strh r0, [r5, #6] + movs r0, #0x3f + rsbs r0, r0, #0 + ldrb r2, [r5, #7] + ands r0, r2 +_0200BFFA: + strb r0, [r5, #7] +_0200BFFC: + ldr r4, [sp] + cmp r4, #0xa + ble _0200C024 + adds r0, r6, #0 + bl sub_0200ADE0 + strh r0, [r6, #0x1c] + movs r3, #0 + adds r2, r6, #0 + adds r2, #0x20 +_0200C010: + ldr r0, [r2] + ldr r1, [r6] + eors r0, r1 + str r0, [r2] + ldr r1, [r6, #4] + eors r0, r1 + stm r2!, {r0} + adds r3, #1 + cmp r3, #0xb + bls _0200C010 +_0200C024: + add sp, #4 + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200C040 +sub_0200C040: @ 0x0200C040 + push {r4, lr} + adds r3, r0, #0 + adds r0, r1, #0 + subs r0, #0x37 + cmp r0, #0xa + bhi _0200C124 + lsls r0, r0, #2 + ldr r1, =_0200C05C + adds r0, r0, r1 + ldr r0, [r0] + mov pc, r0 + .align 2, 0 + .pool +_0200C05C: @ jump table + .4byte _0200C088 @ case 0 + .4byte _0200C0A0 @ case 1 + .4byte _0200C0AA @ case 2 + .4byte _0200C0BA @ case 3 + .4byte _0200C0CA @ case 4 + .4byte _0200C0DA @ case 5 + .4byte _0200C0EA @ case 6 + .4byte _0200C0FA @ case 7 + .4byte _0200C10A @ case 8 + .4byte _0200C11A @ case 9 + .4byte _0200C12A @ case 10 +_0200C088: + ldrb r1, [r2, #1] + lsls r0, r1, #8 + ldrb r4, [r2] + orrs r0, r4 + ldrb r4, [r2, #2] + lsls r1, r4, #0x10 + adds r0, r0, r1 + ldrb r2, [r2, #3] + lsls r1, r2, #0x18 + adds r0, r0, r1 + str r0, [r3, #0x50] + b _0200C12A +_0200C0A0: + ldrb r1, [r2] + adds r0, r3, #0 + adds r0, #0x54 + strb r1, [r0] + b _0200C12A +_0200C0AA: + ldrb r1, [r2, #1] + lsls r0, r1, #8 + ldrb r2, [r2] + orrs r0, r2 + adds r1, r3, #0 + adds r1, #0x56 + strh r0, [r1] + b _0200C12A +_0200C0BA: + ldrb r4, [r2, #1] + lsls r0, r4, #8 + ldrb r2, [r2] + orrs r0, r2 + adds r1, r3, #0 + adds r1, #0x58 + strh r0, [r1] + b _0200C12A +_0200C0CA: + ldrb r1, [r2, #1] + lsls r0, r1, #8 + ldrb r2, [r2] + orrs r0, r2 + adds r1, r3, #0 + adds r1, #0x5a + strh r0, [r1] + b _0200C12A +_0200C0DA: + ldrb r4, [r2, #1] + lsls r0, r4, #8 + ldrb r2, [r2] + orrs r0, r2 + adds r1, r3, #0 + adds r1, #0x5c + strh r0, [r1] + b _0200C12A +_0200C0EA: + ldrb r1, [r2, #1] + lsls r0, r1, #8 + ldrb r2, [r2] + orrs r0, r2 + adds r1, r3, #0 + adds r1, #0x5e + strh r0, [r1] + b _0200C12A +_0200C0FA: + ldrb r4, [r2, #1] + lsls r0, r4, #8 + ldrb r2, [r2] + orrs r0, r2 + adds r1, r3, #0 + adds r1, #0x60 + strh r0, [r1] + b _0200C12A +_0200C10A: + ldrb r1, [r2, #1] + lsls r0, r1, #8 + ldrb r2, [r2] + orrs r0, r2 + adds r1, r3, #0 + adds r1, #0x62 + strh r0, [r1] + b _0200C12A +_0200C11A: + ldrb r1, [r2] + adds r0, r3, #0 + adds r0, #0x55 + strb r1, [r0] + b _0200C12A +_0200C124: + adds r0, r3, #0 + bl sub_0200B9C0 +_0200C12A: + pop {r4} + pop {r0} + bx r0 + + thumb_func_start sub_0200C130 +sub_0200C130: @ 0x0200C130 + push {r4, r5, r6, r7, lr} + sub sp, #8 + lsls r0, r0, #0x18 + lsrs r4, r0, #0x18 + lsls r1, r1, #0x18 + lsrs r5, r1, #0x18 + movs r7, #0 + ldr r1, =gUnknown_0201ED5B + mov r0, sp + movs r2, #7 + bl memcpy + cmp r4, #0xa + bhi _0200C19E + cmp r5, #0x40 + bhi _0200C19E + cmp r4, #6 + bhi _0200C19E + ldr r0, =gUnknown_02022EDC + ldr r0, [r0] + adds r0, r0, r4 + strb r5, [r0] + movs r5, #0 + ldr r6, =gUnknown_02022EF4 +_0200C160: + movs r0, #0x64 + adds r4, r5, #0 + muls r4, r0, r4 + ldr r0, [r6] + adds r0, r4, r0 + movs r1, #0xb + movs r2, #0 + bl sub_0200AE74 + cmp r0, #0 + beq _0200C188 + ldr r0, [r6] + adds r0, r4, r0 + movs r1, #6 + movs r2, #0 + bl sub_0200AE74 + cmp r0, #0 + bne _0200C188 + movs r7, #1 +_0200C188: + adds r5, #1 + cmp r5, #5 + ble _0200C160 + cmp r7, #0 + beq _0200C19E + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + adds r0, #0xf0 + ldr r0, [r0] + bl sub_0200CB60 +_0200C19E: + add sp, #8 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200C1B8 +sub_0200C1B8: @ 0x0200C1B8 + push {lr} + adds r3, r0, #0 + adds r0, r1, #0 + subs r0, #0x37 + cmp r0, #9 + bhi _0200C248 + lsls r0, r0, #2 + ldr r1, =_0200C1D4 + adds r0, r0, r1 + ldr r0, [r0] + mov pc, r0 + .align 2, 0 + .pool +_0200C1D4: @ jump table + .4byte _0200C1FC @ case 0 + .4byte _0200C200 @ case 1 + .4byte _0200C208 @ case 2 + .4byte _0200C210 @ case 3 + .4byte _0200C218 @ case 4 + .4byte _0200C220 @ case 5 + .4byte _0200C228 @ case 6 + .4byte _0200C230 @ case 7 + .4byte _0200C238 @ case 8 + .4byte _0200C240 @ case 9 +_0200C1FC: + ldr r0, [r3, #0x50] + b _0200C24E +_0200C200: + adds r0, r3, #0 + adds r0, #0x54 + ldrb r0, [r0] + b _0200C24E +_0200C208: + adds r0, r3, #0 + adds r0, #0x56 + ldrh r0, [r0] + b _0200C24E +_0200C210: + adds r0, r3, #0 + adds r0, #0x58 + ldrh r0, [r0] + b _0200C24E +_0200C218: + adds r0, r3, #0 + adds r0, #0x5a + ldrh r0, [r0] + b _0200C24E +_0200C220: + adds r0, r3, #0 + adds r0, #0x5c + ldrh r0, [r0] + b _0200C24E +_0200C228: + adds r0, r3, #0 + adds r0, #0x5e + ldrh r0, [r0] + b _0200C24E +_0200C230: + adds r0, r3, #0 + adds r0, #0x60 + ldrh r0, [r0] + b _0200C24E +_0200C238: + adds r0, r3, #0 + adds r0, #0x62 + ldrh r0, [r0] + b _0200C24E +_0200C240: + adds r0, r3, #0 + adds r0, #0x55 + ldrb r0, [r0] + b _0200C24E +_0200C248: + adds r0, r3, #0 + bl sub_0200AE74 +_0200C24E: + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200C254 +sub_0200C254: @ 0x0200C254 + push {r4, r5, r6, lr} + adds r4, r0, #0 + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + adds r0, #0xbc + ldr r6, [r0] + adds r0, r4, #0 + movs r1, #0xb + movs r2, #0 + bl sub_0200AE74 + lsls r0, r0, #0x10 + lsrs r5, r0, #0x10 + adds r0, r4, #0 + movs r1, #0 + movs r2, #0 + bl sub_0200AE74 + adds r2, r0, #0 + lsls r0, r5, #3 + subs r0, r0, r5 + lsls r0, r0, #2 + adds r0, r0, r6 + ldrb r0, [r0, #0x10] + cmp r0, #0 + beq _0200C2B2 + cmp r0, #0 + blt _0200C294 + cmp r0, #0xff + bgt _0200C294 + cmp r0, #0xfe + bge _0200C2B2 +_0200C294: + lsls r0, r5, #3 + subs r0, r0, r5 + lsls r0, r0, #2 + adds r0, r0, r6 + movs r1, #0xff + ands r1, r2 + ldrb r0, [r0, #0x10] + cmp r0, r1 + bls _0200C2B0 + movs r0, #0xfe + b _0200C2B2 + .align 2, 0 + .pool +_0200C2B0: + movs r0, #0 +_0200C2B2: + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + pop {r4, r5, r6} + pop {r1} + bx r1 + + thumb_func_start sub_0200C2BC +sub_0200C2BC: @ 0x0200C2BC + push {r4, r5, lr} + adds r3, r2, #0 + lsls r0, r0, #0x10 + lsrs r4, r0, #0x10 + adds r5, r4, #0 + movs r0, #0xce + lsls r0, r0, #1 + cmp r4, r0 + bls _0200C2DC + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + ldr r0, [r0, #0x30] + b _0200C30E + .align 2, 0 + .pool +_0200C2DC: + lsrs r0, r1, #0x10 + ldr r2, =0x0000FFFF + ands r1, r2 + eors r0, r1 + lsrs r1, r3, #0x10 + eors r0, r1 + ands r3, r2 + eors r0, r3 + cmp r0, #7 + bls _0200C304 + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + lsls r1, r4, #3 + ldr r0, [r0, #0x30] + b _0200C30C + .align 2, 0 + .pool +_0200C304: + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + lsls r1, r5, #3 + ldr r0, [r0, #0x34] +_0200C30C: + adds r0, r0, r1 +_0200C30E: + pop {r4, r5} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200C318 +sub_0200C318: @ 0x0200C318 + push {lr} + adds r2, r1, #0 + lsls r0, r0, #0x10 + lsrs r1, r0, #0x10 + cmp r1, #0xc9 + bne _0200C366 + movs r0, #0xc0 + lsls r0, r0, #0x12 + ands r0, r2 + lsrs r0, r0, #0x12 + movs r1, #0xc0 + lsls r1, r1, #0xa + ands r1, r2 + lsrs r1, r1, #0xc + orrs r0, r1 + movs r1, #0xc0 + lsls r1, r1, #2 + ands r1, r2 + lsrs r1, r1, #6 + orrs r0, r1 + movs r1, #3 + ands r1, r2 + orrs r0, r1 + movs r1, #0x1c + bl __umodsi3 + lsls r0, r0, #0x10 + lsrs r0, r0, #0x10 + cmp r0, #0 + bne _0200C358 + movs r0, #0xc9 + b _0200C362 +_0200C358: + movs r1, #0xce + lsls r1, r1, #1 + adds r0, r0, r1 + lsls r0, r0, #0x10 + lsrs r0, r0, #0x10 +_0200C362: + adds r1, r0, #0 + b _0200C372 +_0200C366: + movs r0, #0xce + lsls r0, r0, #1 + cmp r1, r0 + bls _0200C372 + movs r1, #0x82 + lsls r1, r1, #1 +_0200C372: + adds r0, r1, #0 + pop {r1} + bx r1 + + thumb_func_start sub_0200C378 +sub_0200C378: @ 0x0200C378 + push {r4, r5, r6, r7, lr} + mov r7, sl + mov r6, sb + mov r5, r8 + push {r5, r6, r7} + sub sp, #4 + mov ip, r0 + adds r5, r1, #0 + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + ldr r3, [r0, #0x44] + movs r1, #0 + adds r4, r0, #0 + adds r4, #0x76 + adds r2, r0, #0 + adds r2, #0x82 + ldrb r6, [r2] + ldrb r7, [r4] + adds r0, r6, r7 + cmp r1, r0 + bge _0200C3E4 + movs r0, #0xb + muls r0, r5, r0 + adds r0, r0, r3 + mov sl, r0 + mov sb, r2 + mov r2, ip + movs r0, #0xce + lsls r0, r0, #1 + mov r8, r0 + str r4, [sp] +_0200C3B6: + cmp r5, r8 + ble _0200C3C4 + adds r0, r3, r1 + b _0200C3C8 + .align 2, 0 + .pool +_0200C3C4: + mov r4, sl + adds r0, r4, r1 +_0200C3C8: + ldrb r0, [r0] + strb r0, [r2] + ldrb r0, [r2] + cmp r0, #0xff + beq _0200C3E4 + adds r2, #1 + adds r1, #1 + mov r6, sb + ldrb r7, [r6] + ldr r6, [sp] + ldrb r6, [r6] + adds r0, r7, r6 + cmp r1, r0 + blt _0200C3B6 +_0200C3E4: + add r1, ip + movs r0, #0xff + strb r0, [r1] + add sp, #4 + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start sub_0200C3FC +sub_0200C3FC: @ 0x0200C3FC + push {r4, r5, lr} + adds r4, r1, #0 + ldr r1, =gUnknown_020251E8 + ldr r1, [r1] + adds r1, #0xbc + ldr r5, [r1] + movs r1, #0xb + movs r2, #0 + bl sub_0200AE74 + adds r1, r0, #0 + cmp r4, #1 + beq _0200C424 + cmp r4, #2 + beq _0200C430 + movs r0, #0 + b _0200C43A + .align 2, 0 + .pool +_0200C424: + lsls r0, r1, #3 + subs r0, r0, r1 + lsls r0, r0, #2 + adds r0, r0, r5 + ldrb r0, [r0, #6] + b _0200C43A +_0200C430: + lsls r0, r1, #3 + subs r0, r0, r1 + lsls r0, r0, #2 + adds r0, r0, r5 + ldrb r0, [r0, #7] +_0200C43A: + pop {r4, r5} + pop {r1} + bx r1 + + thumb_func_start sub_0200C440 +sub_0200C440: @ 0x0200C440 + ldr r1, =gUnknown_0201ED40 + adds r0, r0, r1 + ldrb r0, [r0] + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_0200C44C +sub_0200C44C: @ 0x0200C44C + adds r2, r0, #0 + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + adds r0, #0xc0 + ldr r0, [r0] + movs r1, #0xd + muls r1, r2, r1 + adds r0, r0, r1 + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_0200C464 +sub_0200C464: @ 0x0200C464 + ldr r1, =gUnknown_020251E8 + ldr r1, [r1] + adds r1, #0xc4 + ldr r1, [r1] + lsls r0, r0, #2 + adds r0, r0, r1 + ldr r0, [r0] + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_0200C478 +sub_0200C478: @ 0x0200C478 + push {r4, lr} + ldr r3, =gUnknown_020251E8 + ldr r3, [r3] + adds r3, #0xcc + ldr r4, [r3] + lsls r3, r0, #1 + adds r3, r3, r0 + lsls r3, r3, #2 + adds r3, r3, r4 + ldrb r4, [r3, #4] + ldr r0, =gUnknown_0201ED57 + adds r0, r2, r0 + ldrb r0, [r0] + ands r1, r0 + lsls r2, r2, #1 + asrs r1, r2 + lsls r0, r1, #2 + adds r0, r0, r1 + lsls r0, r0, #2 + muls r0, r4, r0 + movs r1, #0x64 + bl __divsi3 + adds r4, r4, r0 + adds r0, r4, #0 + pop {r4} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200C4B8 +sub_0200C4B8: @ 0x0200C4B8 + push {r4, r5, r6, r7, lr} + adds r3, r0, #0 + mov ip, r1 + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + ldr r1, [r0, #0x48] + movs r2, #0 + adds r7, r0, #0 + adds r7, #0x78 + adds r4, r0, #0 + adds r4, #0x82 + ldrb r5, [r4] + ldrb r6, [r7] + adds r0, r5, r6 + cmp r2, r0 + bge _0200C510 + movs r0, #0xd + mov r5, ip + muls r5, r0, r5 + adds r0, r5, #0 + adds r1, r0, r1 + ldrb r0, [r1] + strb r0, [r3] + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + cmp r0, #0xff + beq _0200C510 + adds r6, r4, #0 + adds r5, r1, #0 + adds r4, r7, #0 +_0200C4F4: + adds r2, #1 + ldrb r7, [r6] + ldrb r1, [r4] + adds r0, r7, r1 + cmp r2, r0 + bge _0200C510 + adds r1, r3, r2 + adds r0, r5, r2 + ldrb r0, [r0] + strb r0, [r1] + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + cmp r0, #0xff + bne _0200C4F4 +_0200C510: + adds r1, r3, r2 + movs r0, #0xff + strb r0, [r1] + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200C520 +sub_0200C520: @ 0x0200C520 + ldr r0, =gUnknown_02022EF0 + ldr r1, [r0] + ldrb r0, [r1] + cmp r0, #6 + beq _0200C540 + ldr r2, =gUnknown_02022EF4 + movs r0, #0x64 + ldrb r1, [r1] + muls r1, r0, r1 + ldr r0, [r2] + adds r0, r0, r1 + b _0200C542 + .align 2, 0 + .pool +_0200C540: + movs r0, #0 +_0200C542: + bx lr + + thumb_func_start sub_0200C544 +sub_0200C544: @ 0x0200C544 + push {r4, r5, r6, lr} + adds r4, r0, #0 + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + adds r0, #0xbc + ldr r6, [r0] + adds r0, r4, #0 + movs r1, #0xb + movs r2, #0 + bl sub_0200AE74 + lsls r0, r0, #0x10 + lsrs r5, r0, #0x10 + adds r0, r4, #0 + movs r1, #0 + movs r2, #0 + bl sub_0200AE74 + adds r2, r0, #0 + lsls r0, r5, #3 + subs r0, r0, r5 + lsls r0, r0, #2 + adds r0, r0, r6 + ldrb r0, [r0, #0x10] + cmp r0, #0 + beq _0200C5A2 + cmp r0, #0 + blt _0200C584 + cmp r0, #0xff + bgt _0200C584 + cmp r0, #0xfe + bge _0200C5A2 +_0200C584: + lsls r0, r5, #3 + subs r0, r0, r5 + lsls r0, r0, #2 + adds r0, r0, r6 + movs r1, #0xff + ands r1, r2 + ldrb r0, [r0, #0x10] + cmp r0, r1 + bhi _0200C5A0 + movs r0, #0 + b _0200C5A2 + .align 2, 0 + .pool +_0200C5A0: + movs r0, #0xfe +_0200C5A2: + pop {r4, r5, r6} + pop {r1} + bx r1 + + thumb_func_start sub_0200C5A8 +sub_0200C5A8: @ 0x0200C5A8 + push {lr} + adds r2, r0, #0 + movs r0, #0xc0 + lsls r0, r0, #0x12 + ands r0, r2 + lsrs r0, r0, #0x12 + movs r1, #0xc0 + lsls r1, r1, #0xa + ands r1, r2 + lsrs r1, r1, #0xc + orrs r0, r1 + movs r1, #0xc0 + lsls r1, r1, #2 + ands r1, r2 + lsrs r1, r1, #6 + orrs r0, r1 + movs r1, #3 + ands r1, r2 + orrs r0, r1 + movs r1, #0x1c + bl __umodsi3 + lsls r0, r0, #0x10 + lsrs r0, r0, #0x10 + pop {r1} + bx r1 + + thumb_func_start sub_0200C5DC +sub_0200C5DC: @ 0x0200C5DC + push {r4, r5, r6, r7, lr} + ldr r3, =gUnknown_02022EE8 + ldr r1, [r3] + ldr r6, [r1, #0xc] + ldr r7, [r1, #0x10] + movs r2, #0 + str r2, [r1, #0xc] + str r2, [r1, #0x10] + adds r5, r0, #0 + movs r4, #0 + movs r1, #0 + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + adds r0, #0xf8 + ldr r0, [r0] + subs r0, #4 + cmp r4, r0 + bhs _0200C60E + adds r2, r0, #0 +_0200C602: + adds r0, r5, r1 + ldrb r0, [r0] + adds r4, r0, r4 + adds r1, #1 + cmp r1, r2 + blo _0200C602 +_0200C60E: + ldr r0, [r3] + str r6, [r0, #0xc] + str r7, [r0, #0x10] + adds r0, r4, #0 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200C624 +sub_0200C624: @ 0x0200C624 + ldr r0, =gUnknown_02022EE8 + ldr r1, [r0] + ldrb r0, [r1, #0x14] + cmp r0, #0 + beq _0200C63C + ldrb r0, [r1, #0xa] + cmp r0, #0 + beq _0200C63C + movs r0, #1 + b _0200C63E + .align 2, 0 + .pool +_0200C63C: + movs r0, #0 +_0200C63E: + bx lr + + thumb_func_start sub_0200C640 +sub_0200C640: @ 0x0200C640 + lsls r0, r0, #0x18 + lsrs r2, r0, #0x18 + cmp r2, #0x2b + bne _0200C664 + ldr r0, =gUnknown_02022EE8 + ldr r1, [r0] + ldrb r0, [r1, #0x14] + cmp r0, #0 + beq _0200C664 + ldrb r3, [r1, #0xa] + rsbs r0, r3, #0 + cmp r0, #0 + bge _0200C664 + adds r0, r1, #0 + b _0200C67A + .align 2, 0 + .pool +_0200C664: + subs r0, r2, #1 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + cmp r0, #0x2a + bls _0200C670 + movs r2, #1 +_0200C670: + lsls r0, r2, #3 + subs r0, r0, r2 + lsls r0, r0, #2 + ldr r1, =gUnknown_0201E7F0 + adds r0, r0, r1 +_0200C67A: + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_0200C680 +sub_0200C680: @ 0x0200C680 + lsls r0, r0, #0x10 + lsrs r1, r0, #0x10 + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + adds r0, #0xc8 + ldr r2, [r0] + movs r0, #0xae + lsls r0, r0, #1 + cmp r1, r0 + bls _0200C696 + movs r1, #0 +_0200C696: + movs r0, #0x2c + muls r0, r1, r0 + adds r0, r2, r0 + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_0200C6A4 +sub_0200C6A4: @ 0x0200C6A4 + push {r4, r5, lr} + adds r4, r1, #0 + adds r5, r2, #0 + lsls r0, r0, #0x10 + lsrs r1, r0, #0x10 + adds r2, r1, #0 + cmp r1, #0xaf + bne _0200C6F8 + movs r2, #0x2b + ldr r0, =gUnknown_02022EE8 + ldr r1, [r0] + ldrb r0, [r1, #0x14] + cmp r0, #0 + beq _0200C6C8 + ldrb r3, [r1, #0xa] + rsbs r0, r3, #0 + cmp r0, #0 + blt _0200C6DE +_0200C6C8: + subs r0, r2, #1 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + cmp r0, #0x2a + bls _0200C6D4 + movs r2, #1 +_0200C6D4: + lsls r0, r2, #3 + subs r0, r0, r2 + lsls r0, r0, #2 + ldr r1, =gUnknown_0201E7F0 + adds r1, r0, r1 +_0200C6DE: + adds r0, r4, #0 + bl sub_0200CE5C + adds r0, r4, #0 + adds r1, r5, #0 + bl sub_0200CE78 + b _0200C722 + .align 2, 0 + .pool +_0200C6F8: + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + adds r0, #0xc8 + ldr r3, [r0] + movs r0, #0xae + lsls r0, r0, #1 + cmp r1, r0 + bls _0200C710 + movs r1, #0 + b _0200C712 + .align 2, 0 + .pool +_0200C710: + adds r1, r2, #0 +_0200C712: + movs r0, #0x2c + adds r2, r1, #0 + muls r2, r0, r2 + adds r1, r2, #0 + adds r1, r3, r1 + adds r0, r4, #0 + bl sub_0200CE5C +_0200C722: + pop {r4, r5} + pop {r0} + bx r0 + + thumb_func_start sub_0200C728 +sub_0200C728: @ 0x0200C728 + lsls r0, r0, #0x10 + lsrs r0, r0, #0x10 + subs r0, #1 + cmp r0, #0xb + bhi _0200C79C + lsls r0, r0, #2 + ldr r1, =_0200C740 + adds r0, r0, r1 + ldr r0, [r0] + mov pc, r0 + .align 2, 0 + .pool +_0200C740: @ jump table + .4byte _0200C770 @ case 0 + .4byte _0200C774 @ case 1 + .4byte _0200C778 @ case 2 + .4byte _0200C79C @ case 3 + .4byte _0200C77C @ case 4 + .4byte _0200C780 @ case 5 + .4byte _0200C784 @ case 6 + .4byte _0200C788 @ case 7 + .4byte _0200C78C @ case 8 + .4byte _0200C790 @ case 9 + .4byte _0200C794 @ case 10 + .4byte _0200C798 @ case 11 +_0200C770: + movs r0, #4 + b _0200C79E +_0200C774: + movs r0, #3 + b _0200C79E +_0200C778: + movs r0, #1 + b _0200C79E +_0200C77C: + movs r0, #2 + b _0200C79E +_0200C780: + movs r0, #5 + b _0200C79E +_0200C784: + movs r0, #6 + b _0200C79E +_0200C788: + movs r0, #7 + b _0200C79E +_0200C78C: + movs r0, #8 + b _0200C79E +_0200C790: + movs r0, #9 + b _0200C79E +_0200C794: + movs r0, #0xa + b _0200C79E +_0200C798: + movs r0, #0xb + b _0200C79E +_0200C79C: + movs r0, #0 +_0200C79E: + bx lr + + thumb_func_start sub_0200C7A0 +sub_0200C7A0: @ 0x0200C7A0 + push {r4, r5, r6, r7, lr} + lsls r0, r0, #0x10 + lsls r1, r1, #0x18 + lsrs r2, r1, #0x18 + adds r4, r2, #0 + ldr r1, =0xFFFF0000 + adds r0, r0, r1 + lsrs r1, r0, #0x10 + lsrs r0, r0, #0x13 + lsls r0, r0, #0x18 + lsrs r3, r0, #0x18 + movs r0, #7 + ands r1, r0 + movs r0, #0x80 + lsls r0, r0, #0x11 + lsls r0, r1 + lsrs r5, r0, #0x18 + movs r6, #0 + cmp r2, #1 + beq _0200C834 + cmp r2, #1 + bgt _0200C7D8 + cmp r2, #0 + beq _0200C7E4 + b _0200C914 + .align 2, 0 + .pool +_0200C7D8: + cmp r4, #2 + beq _0200C8CA + cmp r4, #3 + bne _0200C7E2 + b _0200C904 +_0200C7E2: + b _0200C914 +_0200C7E4: + ldr r1, =gUnknown_02022EC8 + ldr r0, [r1] + adds r0, #0x44 + adds r0, r0, r3 + adds r4, r5, #0 + ldrb r0, [r0] + ands r4, r0 + adds r7, r1, #0 + cmp r4, #0 + bne _0200C7FA + b _0200C914 +_0200C7FA: + ldr r0, =gUnknown_02022EF8 + ldr r1, [r0] + adds r1, r1, r3 + adds r2, r5, #0 + ldrb r1, [r1] + ands r2, r1 + adds r6, r0, #0 + ldr r0, =gUnknown_02022EE0 + mov ip, r0 + cmp r4, r2 + bne _0200C81E + ldr r0, [r0] + adds r0, r0, r3 + adds r1, r5, #0 + ldrb r0, [r0] + ands r1, r0 + cmp r4, r1 + beq _0200C87E +_0200C81E: + ldr r1, [r7] + adds r1, #0x44 + adds r1, r1, r3 + mvns r2, r5 + b _0200C8A6 + .align 2, 0 + .pool +_0200C834: + ldr r1, =gUnknown_02022EC8 + ldr r4, [r1] + adds r0, r4, #0 + adds r0, #0x10 + adds r0, r0, r3 + adds r2, r5, #0 + ldrb r0, [r0] + ands r2, r0 + adds r7, r1, #0 + cmp r2, #0 + beq _0200C914 + adds r0, r4, #0 + adds r0, #0x44 + adds r0, r0, r3 + adds r1, r5, #0 + ldrb r0, [r0] + ands r1, r0 + ldr r6, =gUnknown_02022EF8 + ldr r0, =gUnknown_02022EE0 + mov ip, r0 + cmp r2, r1 + bne _0200C890 + ldr r0, [r6] + adds r0, r0, r3 + adds r1, r5, #0 + ldrb r0, [r0] + ands r1, r0 + cmp r2, r1 + bne _0200C890 + mov r1, ip + ldr r0, [r1] + adds r0, r0, r3 + adds r1, r5, #0 + ldrb r0, [r0] + ands r1, r0 + cmp r2, r1 + bne _0200C890 +_0200C87E: + movs r6, #1 + b _0200C914 + .align 2, 0 + .pool +_0200C890: + ldr r1, [r7] + adds r1, #0x10 + adds r1, r1, r3 + mvns r2, r5 + adds r0, r2, #0 + ldrb r4, [r1] + ands r0, r4 + strb r0, [r1] + ldr r1, [r7] + adds r1, #0x44 + adds r1, r1, r3 +_0200C8A6: + adds r0, r2, #0 + ldrb r4, [r1] + ands r0, r4 + strb r0, [r1] + ldr r1, [r6] + adds r1, r1, r3 + adds r0, r2, #0 + ldrb r4, [r1] + ands r0, r4 + strb r0, [r1] + mov r1, ip + ldr r0, [r1] + adds r0, r0, r3 + ldrb r4, [r0] + ands r2, r4 + strb r2, [r0] + movs r6, #0 + b _0200C914 +_0200C8CA: + ldr r0, =gUnknown_02022EC8 + ldr r1, [r0] + adds r1, #0x44 + adds r1, r1, r3 + adds r0, r5, #0 + ldrb r2, [r1] + orrs r0, r2 + strb r0, [r1] + ldr r0, =gUnknown_02022EF8 + ldr r1, [r0] + adds r1, r1, r3 + adds r0, r5, #0 + ldrb r4, [r1] + orrs r0, r4 + strb r0, [r1] + ldr r0, =gUnknown_02022EE0 + ldr r1, [r0] + adds r1, r1, r3 + adds r0, r5, #0 + ldrb r2, [r1] + orrs r0, r2 + b _0200C912 + .align 2, 0 + .pool +_0200C904: + ldr r0, =gUnknown_02022EC8 + ldr r1, [r0] + adds r1, #0x10 + adds r1, r1, r3 + adds r0, r5, #0 + ldrb r4, [r1] + orrs r0, r4 +_0200C912: + strb r0, [r1] +_0200C914: + adds r0, r6, #0 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200C920 +sub_0200C920: @ 0x0200C920 + lsls r0, r0, #0x10 + lsrs r0, r0, #0x10 + adds r2, r0, #0 + cmp r2, #0 + bne _0200C92E + movs r0, #0 + b _0200C944 +_0200C92E: + subs r1, r2, #1 + movs r0, #0xcd + lsls r0, r0, #1 + cmp r1, r0 + bls _0200C93C + adds r0, r2, #0 + b _0200C944 +_0200C93C: + ldr r0, =gUnknown_0201ED64 + lsls r1, r1, #1 + adds r1, r1, r0 + ldrh r0, [r1] +_0200C944: + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_0200C94C +sub_0200C94C: @ 0x0200C94C + push {r4, r5, r6, lr} + adds r4, r0, #0 + adds r6, r1, #0 + lsls r0, r4, #0x10 + lsrs r0, r0, #0x10 + adds r1, r0, #0 + cmp r0, #0 + bne _0200C960 + movs r0, #0 + b _0200C97A +_0200C960: + subs r2, r0, #1 + movs r0, #0xcd + lsls r0, r0, #1 + cmp r2, r0 + bhi _0200C978 + ldr r1, =gUnknown_0201ED64 + lsls r0, r2, #1 + adds r0, r0, r1 + ldrh r0, [r0] + b _0200C97A + .align 2, 0 + .pool +_0200C978: + adds r0, r1, #0 +_0200C97A: + adds r5, r0, #0 + movs r1, #1 + bl sub_0200C7A0 + cmp r0, #0 + bne _0200C9A2 + cmp r4, #0xc9 + bne _0200C992 + ldr r0, =gUnknown_02022EC8 + ldr r1, [r0] + ldr r0, [r6] + str r0, [r1, #4] +_0200C992: + movs r0, #0x9a + lsls r0, r0, #1 + cmp r4, r0 + bne _0200C9A2 + ldr r0, =gUnknown_02022EC8 + ldr r1, [r0] + ldr r0, [r6] + str r0, [r1, #8] +_0200C9A2: + adds r4, r5, #0 + adds r0, r4, #0 + movs r1, #2 + bl sub_0200C7A0 + adds r0, r4, #0 + movs r1, #3 + bl sub_0200C7A0 + pop {r4, r5, r6} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200C9C0 +sub_0200C9C0: @ 0x0200C9C0 + push {r4, r5, r6, r7, lr} + mov r7, r8 + push {r7} + sub sp, #4 + adds r6, r0, #0 + adds r5, r2, #0 + ldr r7, =gUnknown_02023F50 + mov r0, sp + movs r1, #0 + strh r1, [r0] + ldr r2, =0x0100013C + adds r1, r7, #0 + bl CpuSet + cmp r5, #1 + beq _0200C9E2 + b _0200CAF0 +_0200C9E2: + ldr r0, =gUnknown_020251E8 + mov r8, r0 + ldr r0, [r0] + adds r0, #0xb8 + ldrb r0, [r0] + lsls r0, r0, #0x1e + cmp r0, #0 + blt _0200CA60 + bl sub_0200CD88 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + movs r4, #1 + ands r0, r4 + movs r1, #2 + rsbs r1, r1, #0 + ldrb r2, [r7] + ands r1, r2 + orrs r1, r0 + strb r1, [r7] + bl sub_0200CD38 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x19 + ands r0, r5 + ands r0, r4 + lsls r0, r0, #1 + movs r1, #3 + rsbs r1, r1, #0 + ldrb r2, [r7] + ands r1, r2 + orrs r1, r0 + strb r1, [r7] + bl sub_0200CDD0 + ands r0, r4 + lsls r0, r0, #2 + movs r1, #5 + rsbs r1, r1, #0 + ldrb r2, [r7] + ands r1, r2 + orrs r1, r0 + strb r1, [r7] + bl sub_0200CD38 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x1f + ands r0, r4 + lsls r0, r0, #3 + movs r1, #9 + rsbs r1, r1, #0 + ldrb r2, [r7] + ands r1, r2 + orrs r1, r0 + strb r1, [r7] + mov r2, r8 + ldr r0, [r2] + ldr r0, [r0, #4] + lsls r0, r0, #4 + movs r2, #0xf + ands r1, r2 + orrs r1, r0 + strb r1, [r7] +_0200CA60: + mov r1, r8 + ldr r0, [r1] + adds r0, #0xa0 + ldr r0, [r0] + adds r2, r6, r0 + adds r0, r7, #4 + adds r1, r2, #0 + bl sub_0200CE5C + mov r2, r8 + ldr r1, [r2] + adds r0, r1, #0 + adds r0, #0xa4 + ldr r0, [r0] + adds r2, r6, r0 + ldrb r0, [r2] + str r0, [r7, #0xc] + adds r1, #0x9c + ldr r0, [r1] + adds r2, r6, r0 + movs r4, #0 + adds r3, r7, #0 + adds r3, #0x10 +_0200CA8E: + adds r0, r3, r4 + adds r1, r2, r4 + ldrb r1, [r1] + strb r1, [r0] + adds r4, #1 + cmp r4, #3 + ble _0200CA8E + movs r4, #0 + ldr r0, =gUnknown_02022EF4 + mov r8, r0 + adds r5, r7, #0 + adds r5, #0x14 + movs r6, #0 +_0200CAA8: + mov r1, r8 + ldr r0, [r1] + adds r0, r0, r6 + adds r1, r5, #0 + movs r2, #0x32 + bl CpuSet + adds r5, #0x64 + adds r6, #0x64 + adds r4, #1 + cmp r4, #5 + ble _0200CAA8 + movs r4, #0 + movs r0, #0x9b + lsls r0, r0, #2 + adds r2, r7, r0 + ldr r3, =gUnknown_02022EDC +_0200CACA: + adds r0, r2, r4 + ldr r1, [r3] + adds r1, r1, r4 + ldrb r1, [r1] + strb r1, [r0] + adds r4, #1 + cmp r4, #0xa + ble _0200CACA + b _0200CB1C + .align 2, 0 + .pool +_0200CAF0: + cmp r5, #2 + bne _0200CB00 + movs r0, #4 + rsbs r0, r0, #0 + ldrb r1, [r7, #1] + ands r0, r1 + movs r1, #1 + b _0200CB18 +_0200CB00: + cmp r5, #0xff + bne _0200CB10 + movs r0, #4 + rsbs r0, r0, #0 + ldrb r2, [r7, #1] + ands r0, r2 + movs r1, #2 + b _0200CB18 +_0200CB10: + cmp r5, #0 + bne _0200CB1C + movs r0, #3 + ldrb r1, [r7, #1] +_0200CB18: + orrs r0, r1 + strb r0, [r7, #1] +_0200CB1C: + adds r0, r7, #0 + add sp, #4 + pop {r3} + mov r8, r3 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200CB2C +sub_0200CB2C: @ 0x0200CB2C + ldr r0, =gUnknown_02023F50 + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_0200CB34 +sub_0200CB34: @ 0x0200CB34 + adds r1, r0, #0 + lsls r0, r1, #2 + adds r0, r0, r1 + lsls r0, r0, #6 + ldr r1, =gUnknown_020241D0 + adds r0, r0, r1 + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_0200CB48 +sub_0200CB48: @ 0x0200CB48 + ldr r1, =gUnknown_02024950 + strb r0, [r1] + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_0200CB54 +sub_0200CB54: @ 0x0200CB54 + ldr r0, =gUnknown_02024950 + ldrb r0, [r0] + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_0200CB60 +sub_0200CB60: @ 0x0200CB60 + adds r2, r0, #0 + cmp r2, #0 + beq _0200CB88 + ldr r0, =gUnknown_02022ED4 + adds r1, r2, #0 + cmp r2, #0 + bge _0200CB70 + adds r1, r2, #7 +_0200CB70: + asrs r1, r1, #3 + ldr r0, [r0] + adds r3, r0, r1 + cmp r3, #0 + beq _0200CB88 + lsls r1, r1, #3 + subs r1, r2, r1 + movs r0, #1 + lsls r0, r1 + ldrb r1, [r3] + orrs r0, r1 + strb r0, [r3] +_0200CB88: + movs r0, #0 + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_0200CB90 +sub_0200CB90: @ 0x0200CB90 + adds r1, r0, #0 + cmp r1, #0 + beq _0200CBB8 + ldr r2, =gUnknown_02022ED4 + adds r0, r1, #0 + cmp r1, #0 + bge _0200CBA0 + adds r0, r1, #7 +_0200CBA0: + asrs r3, r0, #3 + ldr r0, [r2] + adds r2, r0, r3 + cmp r2, #0 + beq _0200CBB8 + lsls r0, r3, #3 + subs r0, r1, r0 + movs r1, #1 + lsls r1, r0 + ldrb r0, [r2] + bics r0, r1 + strb r0, [r2] +_0200CBB8: + movs r0, #0 + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_0200CBC0 +sub_0200CBC0: @ 0x0200CBC0 + adds r1, r0, #0 + cmp r1, #0 + beq _0200CBF4 + ldr r2, =gUnknown_02022ED4 + adds r0, r1, #0 + cmp r1, #0 + bge _0200CBD0 + adds r0, r1, #7 +_0200CBD0: + asrs r3, r0, #3 + ldr r0, [r2] + adds r2, r0, r3 + cmp r2, #0 + beq _0200CBF4 + lsls r0, r3, #3 + subs r0, r1, r0 + ldrb r2, [r2] + asrs r2, r0 + adds r0, r2, #0 + movs r1, #1 + ands r0, r1 + cmp r0, #0 + beq _0200CBF4 + movs r0, #1 + b _0200CBF6 + .align 2, 0 + .pool +_0200CBF4: + movs r0, #0 +_0200CBF6: + bx lr + + thumb_func_start sub_0200CBF8 +sub_0200CBF8: @ 0x0200CBF8 + push {r4, r5, lr} + ldr r2, =gUnknown_020251EC + movs r0, #0 + strb r0, [r2] + ldr r1, =gUnknown_020251E4 + strb r0, [r1] + movs r4, #0 + ldr r0, =0x080000AC + ldr r3, [r0] + ldr r0, =0x46505841 + adds r5, r1, #0 + cmp r3, r0 + beq _0200CCA8 + cmp r3, r0 + bhi _0200CC54 + ldr r0, =0x44565841 + cmp r3, r0 + beq _0200CCA8 + cmp r3, r0 + bhi _0200CC3C + ldr r0, =0x44505841 + b _0200CC7C + .align 2, 0 + .pool +_0200CC3C: + ldr r0, =0x45505841 + cmp r3, r0 + beq _0200CC9C + ldr r0, =0x45565841 + cmp r3, r0 + beq _0200CC90 + b _0200CC80 + .align 2, 0 + .pool +_0200CC54: + ldr r0, =0x49565841 + cmp r3, r0 + beq _0200CCA8 + cmp r3, r0 + bhi _0200CC74 + ldr r0, =0x46565841 + cmp r3, r0 + beq _0200CCA8 + ldr r0, =0x49505841 + b _0200CC7C + .align 2, 0 + .pool +_0200CC74: + ldr r0, =0x53505841 + cmp r3, r0 + beq _0200CCA8 + ldr r0, =0x53565841 +_0200CC7C: + cmp r3, r0 + beq _0200CCA8 +_0200CC80: + movs r3, #1 + strb r3, [r5] + b _0200CCAC + .align 2, 0 + .pool +_0200CC90: + movs r0, #1 + strb r0, [r5] + movs r4, #2 + movs r3, #0 + strb r0, [r2] + b _0200CCAC +_0200CC9C: + movs r0, #1 + strb r0, [r5] + movs r4, #1 + movs r3, #0 + strb r4, [r2] + b _0200CCAC +_0200CCA8: + movs r3, #1 + strb r3, [r2] +_0200CCAC: + cmp r3, #0 + beq _0200CCC0 + ldr r1, =gUnknown_020251E8 + ldr r0, =0x08000100 + b _0200CD10 + .align 2, 0 + .pool +_0200CCC0: + cmp r4, #2 + bne _0200CCF0 + ldr r0, =0x080000BC + ldrb r0, [r0] + cmp r0, #0 + bne _0200CCE0 + ldr r1, =gUnknown_020251E8 + ldr r0, =gUnknown_02020634 + b _0200CD10 + .align 2, 0 + .pool +_0200CCE0: + ldr r1, =gUnknown_020251E8 + ldr r0, =gUnknown_02020734 + b _0200CD10 + .align 2, 0 + .pool +_0200CCF0: + ldr r0, =0x080000BC + ldrb r0, [r0] + cmp r0, #0 + bne _0200CD0C + ldr r1, =gUnknown_020251E8 + ldr r0, =gUnknown_02020834 + b _0200CD10 + .align 2, 0 + .pool +_0200CD0C: + ldr r1, =gUnknown_020251E8 + ldr r0, =gUnknown_02020934 +_0200CD10: + str r0, [r1] + cmp r3, #1 + bne _0200CD30 + ldr r0, [r1] + ldr r0, [r0, #4] + cmp r0, #2 + bne _0200CD2C + strb r3, [r5] + b _0200CD30 + .align 2, 0 + .pool +_0200CD2C: + movs r0, #0 + strb r0, [r5] +_0200CD30: + pop {r4, r5} + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start sub_0200CD38 +sub_0200CD38: @ 0x0200CD38 + push {lr} + ldr r0, =gUnknown_020251EC + ldrb r0, [r0] + cmp r0, #0 + bne _0200CD60 + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + ldr r1, =gUnknown_02022ED8 + ldr r1, [r1] + adds r0, #0x98 + ldr r0, [r0] + adds r1, r1, r0 + ldrb r1, [r1] + b _0200CD78 + .align 2, 0 + .pool +_0200CD60: + ldr r0, =gUnknown_02022ECC + ldr r0, [r0] + bl sub_0200CED8 + lsls r0, r0, #0x18 + lsrs r1, r0, #0x18 + movs r0, #1 + ands r0, r1 + cmp r0, #0 + beq _0200CD78 + movs r0, #0x80 + orrs r1, r0 +_0200CD78: + adds r0, r1, #0 + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200CD84 +sub_0200CD84: @ 0x0200CD84 + bx lr + .align 2, 0 + + thumb_func_start sub_0200CD88 +sub_0200CD88: @ 0x0200CD88 + push {lr} + ldr r0, =gUnknown_020251EC + ldrb r0, [r0] + cmp r0, #0 + bne _0200CDB4 + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + ldr r1, =gUnknown_02022ED8 + ldr r1, [r1] + adds r0, #0xd8 + ldr r0, [r0] + adds r1, r1, r0 + movs r0, #1 + ldrb r1, [r1] + ands r0, r1 + b _0200CDBA + .align 2, 0 + .pool +_0200CDB4: + ldr r0, =0x00000801 + bl sub_0200CBC0 +_0200CDBA: + cmp r0, #0 + beq _0200CDC8 + movs r0, #1 + b _0200CDCA + .align 2, 0 + .pool +_0200CDC8: + movs r0, #0 +_0200CDCA: + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200CDD0 +sub_0200CDD0: @ 0x0200CDD0 + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + ldr r0, [r0] + subs r0, #4 + cmp r0, #1 + bls _0200CDE4 + movs r0, #0 + b _0200CDE6 + .align 2, 0 + .pool +_0200CDE4: + movs r0, #1 +_0200CDE6: + bx lr + + thumb_func_start sub_0200CDE8 +sub_0200CDE8: @ 0x0200CDE8 + ldr r1, =gUnknown_02022ECC + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + ldr r2, [r1] + ldr r1, [r0, #0x50] + adds r1, r2, r1 + adds r0, #0xdc + ldr r3, [r0] + adds r0, r3, #0 + cmp r3, #0 + bge _0200CE00 + adds r0, r3, #7 +_0200CE00: + asrs r0, r0, #3 + adds r1, r1, r0 + lsls r0, r0, #3 + subs r0, r3, r0 + ldrb r1, [r1] + asrs r1, r0 + adds r0, r1, #0 + movs r1, #1 + ands r0, r1 + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_0200CE1C +sub_0200CE1C: @ 0x0200CE1C + push {r4, r5, lr} + adds r4, r0, #0 + movs r5, #0 + ldrb r0, [r4] + cmp r0, #0xff + beq _0200CE52 +_0200CE28: + adds r1, r5, #0 + adds r0, r1, #1 + lsls r0, r0, #0x10 + lsrs r5, r0, #0x10 + adds r1, r4, r1 + ldrb r1, [r1] + cmp r1, #0xfc + bne _0200CE4A + adds r0, r4, r5 + ldrb r0, [r0] + bl sub_0200CEC0 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + adds r0, r5, r0 + lsls r0, r0, #0x10 + lsrs r5, r0, #0x10 +_0200CE4A: + adds r0, r4, r5 + ldrb r0, [r0] + cmp r0, #0xff + bne _0200CE28 +_0200CE52: + adds r0, r5, #0 + pop {r4, r5} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200CE5C +sub_0200CE5C: @ 0x0200CE5C + adds r3, r0, #0 + b _0200CE66 +_0200CE60: + strb r2, [r3] + adds r3, #1 + adds r1, #1 +_0200CE66: + ldrb r2, [r1] + adds r0, r2, #0 + cmp r0, #0xff + bne _0200CE60 + movs r0, #0xff + strb r0, [r3] + adds r0, r3, #0 + bx lr + .align 2, 0 + + thumb_func_start sub_0200CE78 +sub_0200CE78: @ 0x0200CE78 + adds r2, r0, #0 + b _0200CE7E +_0200CE7C: + adds r2, #1 +_0200CE7E: + ldrb r0, [r2] + cmp r0, #0xff + bne _0200CE7C + adds r3, r2, #0 + b _0200CE8E +_0200CE88: + strb r2, [r3] + adds r3, #1 + adds r1, #1 +_0200CE8E: + ldrb r2, [r1] + adds r0, r2, #0 + cmp r0, #0xff + bne _0200CE88 + movs r0, #0xff + strb r0, [r3] + adds r0, r3, #0 + bx lr + .align 2, 0 + + thumb_func_start sub_0200CEA0 +sub_0200CEA0: @ 0x0200CEA0 + adds r2, r0, #0 + b _0200CEB0 +_0200CEA4: + cmp r0, #0xff + bne _0200CEAC + movs r0, #0 + b _0200CEBE +_0200CEAC: + adds r2, #1 + adds r1, #1 +_0200CEB0: + ldrb r0, [r2] + ldrb r3, [r1] + cmp r0, r3 + beq _0200CEA4 + ldrb r2, [r2] + ldrb r1, [r1] + subs r0, r2, r1 +_0200CEBE: + bx lr + + thumb_func_start sub_0200CEC0 +sub_0200CEC0: @ 0x0200CEC0 + lsls r0, r0, #0x18 + lsrs r1, r0, #0x18 + movs r0, #0 + cmp r1, #0x16 + bhi _0200CED0 + ldr r0, =gUnknown_0201F09C + adds r0, r1, r0 + ldrb r0, [r0] +_0200CED0: + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_0200CED8 +sub_0200CED8: @ 0x0200CED8 + push {r4, lr} + movs r1, #4 + ldrsb r1, [r0, r1] + lsls r1, r1, #0x10 + lsrs r1, r1, #8 + ldrb r0, [r0, #5] + lsls r0, r0, #0x18 + asrs r0, r0, #0x18 + adds r0, r0, r1 + lsls r0, r0, #0x10 + lsrs r0, r0, #0x10 + ldr r2, =gUnknown_0201F0B4 + ldr r1, =0x0000FFFF + ldrh r3, [r2] + cmp r3, r1 + beq _0200CF1A + adds r3, r1, #0 + adds r1, r2, #0 +_0200CEFC: + ldrh r4, [r2] + cmp r4, r0 + bne _0200CF10 + movs r0, #2 + b _0200CF48 + .align 2, 0 + .pool +_0200CF10: + adds r1, #2 + adds r2, #2 + ldrh r4, [r1] + cmp r4, r3 + bne _0200CEFC +_0200CF1A: + ldr r2, =gUnknown_0201F0FC + ldr r1, =0x0000FFFF + ldrh r3, [r2] + cmp r3, r1 + beq _0200CF46 + adds r3, r1, #0 + adds r1, r2, #0 +_0200CF28: + ldrh r4, [r2] + cmp r4, r0 + bne _0200CF3C + movs r0, #4 + b _0200CF48 + .align 2, 0 + .pool +_0200CF3C: + adds r1, #2 + adds r2, #2 + ldrh r4, [r1] + cmp r4, r3 + bne _0200CF28 +_0200CF46: + movs r0, #0 +_0200CF48: + pop {r4} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200CF50 +sub_0200CF50: @ 0x0200CF50 + push {r4, r5, r6, r7, lr} + adds r6, r0, #0 + ldr r7, =gUnknown_020251F0 + ldrb r0, [r7, #0xa] + cmp r0, #1 + beq _0200CF98 + cmp r0, #1 + bgt _0200CF6C + cmp r0, #0 + beq _0200CF76 + b _0200D07E + .align 2, 0 + .pool +_0200CF6C: + cmp r0, #2 + beq _0200D00C + cmp r0, #3 + beq _0200D050 + b _0200D07E +_0200CF76: + ldr r1, =gUnknown_02024960 + movs r0, #7 + ands r6, r0 + ldr r0, =0x0000084C + adds r1, r1, r0 + lsls r3, r6, #4 + ldrb r2, [r1] + movs r0, #0xf + ands r0, r2 + orrs r0, r3 + strb r0, [r1] + b _0200D03A + .align 2, 0 + .pool +_0200CF98: + ldr r3, =gUnknown_02024960 + ldr r4, =0x0000FFFF + ldr r1, =0x0000084C + adds r5, r3, r1 + adds r1, r6, #0 + ands r1, r4 + lsls r1, r1, #8 + ldr r0, [r5] + ldr r2, =0xFF0000FF + ands r0, r2 + orrs r0, r1 + str r0, [r5] + lsrs r0, r6, #0x10 + ands r0, r4 + movs r4, #0xff + adds r1, r0, #0 + ands r1, r4 + ldr r6, =0x0000084F + adds r2, r3, r6 + ldrb r6, [r2] + movs r6, #0 + strb r1, [r2] + lsrs r0, r0, #8 + ands r0, r4 + movs r2, #0x85 + lsls r2, r2, #4 + adds r1, r3, r2 + ldrb r2, [r1] + strb r0, [r1] + ldr r0, =0x00000854 + adds r3, r3, r0 + ldr r4, =gUnknown_02022EF4 + ldrb r0, [r5] + lsrs r0, r0, #4 + movs r2, #0x64 + adds r1, r0, #0 + muls r1, r2, r1 + ldr r0, [r4] + adds r0, r0, r1 + str r0, [r3] + str r2, [r7, #4] + str r6, [r7, #0x1c] + b _0200D03A + .align 2, 0 + .pool +_0200D00C: + ldr r2, =gUnknown_02024960 + ldr r0, [r7, #0x1c] + lsrs r0, r0, #2 + ldr r3, =0x00000854 + adds r1, r2, r3 + ldr r1, [r1] + lsls r0, r0, #2 + adds r0, r0, r1 + str r6, [r0] + ldr r0, [r7, #0x1c] + adds r0, #4 + str r0, [r7, #0x1c] + ldr r1, [r7, #0x1c] + ldr r0, [r7, #4] + cmp r1, r0 + blo _0200D07E + ldr r6, =0x0000085C + adds r0, r2, r6 + str r0, [r7] + movs r0, #0xc + str r0, [r7, #4] + movs r0, #0 + str r0, [r7, #0x1c] +_0200D03A: + ldrb r0, [r7, #0xa] + adds r0, #1 + ldrb r1, [r7, #0xa] + strb r0, [r7, #0xa] + b _0200D07E + .align 2, 0 + .pool +_0200D050: + ldr r0, [r7, #0x1c] + lsrs r0, r0, #2 + ldr r1, [r7] + lsls r0, r0, #2 + adds r0, r0, r1 + str r6, [r0] + ldr r0, [r7, #0x1c] + adds r0, #4 + str r0, [r7, #0x1c] + ldr r1, [r7, #0x1c] + ldr r0, [r7, #4] + cmp r1, r0 + blo _0200D07E + ldr r1, =gUnknown_02024960 + ldr r0, =0x0000084C + adds r1, r1, r0 + ldrb r0, [r1] + movs r2, #2 + orrs r0, r2 + strb r0, [r1] + ldrb r0, [r7, #0x11] + movs r0, #0 + strb r0, [r7, #0x11] +_0200D07E: + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200D08C +sub_0200D08C: @ 0x0200D08C + push {r4, r5, r6, r7, lr} + adds r3, r0, #0 + ldr r2, =gUnknown_020251F0 + ldrb r0, [r2, #0xa] + adds r4, r0, #0 + adds r5, r2, #0 + cmp r4, #1 + beq _0200D12C + cmp r4, #1 + bgt _0200D0AC + cmp r4, #0 + beq _0200D0B2 + b _0200D19C + .align 2, 0 + .pool +_0200D0AC: + cmp r4, #2 + beq _0200D170 + b _0200D19C +_0200D0B2: + ldr r0, [r2, #0x1c] + lsrs r0, r0, #2 + ldr r1, [r2] + lsls r0, r0, #2 + adds r0, r0, r1 + str r3, [r0] + ldr r0, [r2, #0x1c] + adds r0, #4 + str r0, [r2, #0x1c] + ldr r1, [r2, #0x1c] + ldr r0, [r2, #4] + cmp r1, r0 + blo _0200D19C + ldr r1, =gUnknown_02024960 + ldr r0, [r1] + lsls r0, r0, #8 + lsrs r3, r0, #8 + ldr r2, =0x00000879 + adds r0, r1, r2 + ldrb r2, [r0] + strb r4, [r0] + adds r7, r1, #0 + adds r7, #0x24 + movs r6, #0xf + adds r4, r0, #0 + movs r2, #5 +_0200D0E6: + adds r0, r3, #0 + ands r0, r6 + cmp r0, #0xf + beq _0200D0F6 + ldrb r0, [r4] + adds r0, #1 + ldrb r1, [r4] + strb r0, [r4] +_0200D0F6: + lsrs r3, r3, #4 + subs r2, #1 + cmp r2, #0 + bge _0200D0E6 + movs r0, #0 + str r0, [r5, #0x1c] + str r7, [r5] + ldr r1, =0x00000855 + adds r0, r7, r1 + ldrb r1, [r0] + lsls r0, r1, #2 + adds r0, r0, r1 + lsls r1, r0, #4 + adds r0, r0, r1 + lsls r0, r0, #2 + str r0, [r5, #4] + ldrb r0, [r5, #0xa] + adds r0, #1 + ldrb r1, [r5, #0xa] + strb r0, [r5, #0xa] + b _0200D19C + .align 2, 0 + .pool +_0200D12C: + ldr r0, [r2, #0x1c] + lsrs r0, r0, #2 + ldr r1, [r2] + lsls r0, r0, #2 + adds r0, r0, r1 + str r3, [r0] + ldr r0, [r2, #0x1c] + adds r0, #4 + str r0, [r2, #0x1c] + ldr r1, [r2, #0x1c] + ldr r0, [r2, #4] + cmp r1, r0 + blo _0200D19C + movs r0, #0 + str r0, [r2, #0x1c] + ldr r0, =gUnknown_0202517C + str r0, [r2] + ldr r1, =0xFFFFF7E4 + adds r0, r0, r1 + ldrb r1, [r0, #7] + lsls r0, r1, #1 + adds r0, r0, r1 + lsls r0, r0, #2 + str r0, [r2, #4] + ldrb r0, [r2, #0xa] + adds r0, #1 + ldrb r1, [r2, #0xa] + strb r0, [r2, #0xa] + b _0200D19C + .align 2, 0 + .pool +_0200D170: + ldr r0, [r2, #0x1c] + lsrs r0, r0, #2 + ldr r1, [r2] + lsls r0, r0, #2 + adds r0, r0, r1 + str r3, [r0] + ldr r0, [r2, #0x1c] + adds r0, #4 + str r0, [r2, #0x1c] + ldr r1, [r2, #0x1c] + ldr r0, [r2, #4] + cmp r1, r0 + blo _0200D19C + ldrb r0, [r2, #0x11] + movs r0, #0 + strb r0, [r2, #0x11] + ldr r0, =gUnknown_02024960 + ldr r2, =0x0000087A + adds r0, r0, r2 + ldrb r1, [r0] + movs r1, #1 + strb r1, [r0] +_0200D19C: + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200D1AC +sub_0200D1AC: @ 0x0200D1AC + push {r4, r5, r6, lr} + adds r3, r0, #0 + ldr r1, =gUnknown_02022ECC + ldr r0, =gUnknown_020251E8 + ldr r0, [r0] + adds r0, #0xb4 + ldr r1, [r1] + ldr r0, [r0] + adds r6, r1, r0 + ldr r5, =gUnknown_020251C8 + ldr r1, =gUnknown_020251F0 + ldrb r0, [r1, #0xa] + adds r4, r1, #0 + cmp r0, #6 + bls _0200D1CC + b _0200D384 +_0200D1CC: + lsls r0, r0, #2 + ldr r1, =_0200D1EC + adds r0, r0, r1 + ldr r0, [r0] + mov pc, r0 + .align 2, 0 + .pool +_0200D1EC: @ jump table + .4byte _0200D208 @ case 0 + .4byte _0200D220 @ case 1 + .4byte _0200D238 @ case 2 + .4byte _0200D2A6 @ case 3 + .4byte _0200D2D4 @ case 4 + .4byte _0200D322 @ case 5 + .4byte _0200D358 @ case 6 +_0200D208: + ldr r2, =0x00FFFFFF + ands r2, r3 + ldr r0, [r5, #8] + movs r1, #0xff + lsls r1, r1, #0x18 + ands r0, r1 + orrs r0, r2 + str r0, [r5, #8] + b _0200D348 + .align 2, 0 + .pool +_0200D220: + ldr r2, =0x00FFFFFF + ands r2, r3 + ldr r0, [r5, #0xc] + movs r1, #0xff + lsls r1, r1, #0x18 + ands r0, r1 + orrs r0, r2 + str r0, [r5, #0xc] + b _0200D348 + .align 2, 0 + .pool +_0200D238: + movs r2, #9 + rsbs r2, r2, #0 + ldrb r0, [r5, #0xb] + ands r2, r0 + movs r0, #5 + rsbs r0, r0, #0 + ands r2, r0 + adds r0, #2 + ands r2, r0 + adds r0, #1 + ands r2, r0 + strb r2, [r5, #0xb] + movs r0, #1 + ands r0, r3 + cmp r0, #0 + beq _0200D260 + movs r1, #1 + adds r0, r2, #0 + orrs r0, r1 + strb r0, [r5, #0xb] +_0200D260: + movs r0, #2 + ands r0, r3 + cmp r0, #0 + beq _0200D270 + movs r0, #2 + ldrb r1, [r5, #0xb] + orrs r0, r1 + strb r0, [r5, #0xb] +_0200D270: + movs r0, #4 + ands r0, r3 + cmp r0, #0 + beq _0200D280 + movs r0, #4 + ldrb r2, [r5, #0xb] + orrs r0, r2 + strb r0, [r5, #0xb] +_0200D280: + movs r0, #8 + ands r0, r3 + cmp r0, #0 + beq _0200D290 + movs r0, #8 + ldrb r1, [r5, #0xb] + orrs r0, r1 + strb r0, [r5, #0xb] +_0200D290: + movs r3, #0x10 + adds r1, r6, #0 + adds r2, r5, #0 +_0200D296: + ldrb r0, [r2] + strb r0, [r1] + adds r2, #1 + adds r1, #1 + subs r3, #1 + cmp r3, #0 + bne _0200D296 + b _0200D348 +_0200D2A6: + ldr r0, =gUnknown_02024960 + lsrs r1, r3, #0x10 + ldr r2, =0x0000085B + adds r0, r0, r2 + ldrb r2, [r0] + movs r2, #0 + strb r1, [r0] + ldr r0, =0x0000FFFF + ands r0, r3 + str r0, [r4, #4] + str r2, [r4, #0x1c] + ldr r0, =gUnknown_02022EBC + ldr r0, [r0] + b _0200D346 + .align 2, 0 + .pool +_0200D2D4: + ldr r1, [r4, #0x1c] + ldr r2, [r4] + lsls r0, r1, #2 + adds r0, r0, r2 + str r3, [r0] + adds r1, #1 + str r1, [r4, #0x1c] + ldr r1, [r4, #0x1c] + ldr r0, [r4, #4] + cmp r1, r0 + blo _0200D384 + ldr r1, =gUnknown_02024960 + ldr r2, =0x0000085B + adds r0, r1, r2 + ldrb r0, [r0] + adds r2, r0, #0 + cmp r2, #0 + bne _0200D314 + ldrb r0, [r4, #0x11] + strb r2, [r4, #0x11] + ldr r0, =0x0000085A + adds r1, r1, r0 + ldrb r0, [r1] + movs r0, #1 + strb r0, [r1] + b _0200D384 + .align 2, 0 + .pool +_0200D314: + movs r0, #0x64 + str r0, [r4, #4] + movs r0, #0 + str r0, [r4, #0x1c] + bl sub_0200C520 + b _0200D346 +_0200D322: + ldr r0, [r4, #0x1c] + lsrs r0, r0, #2 + ldr r1, [r4] + lsls r0, r0, #2 + adds r0, r0, r1 + str r3, [r0] + ldr r0, [r4, #0x1c] + adds r0, #4 + str r0, [r4, #0x1c] + ldr r1, [r4, #0x1c] + ldr r0, [r4, #4] + cmp r1, r0 + blo _0200D384 + movs r0, #0xc + str r0, [r4, #4] + movs r0, #0 + str r0, [r4, #0x1c] + ldr r0, =gUnknown_020251BC +_0200D346: + str r0, [r4] +_0200D348: + ldrb r0, [r4, #0xa] + adds r0, #1 + ldrb r1, [r4, #0xa] + strb r0, [r4, #0xa] + b _0200D384 + .align 2, 0 + .pool +_0200D358: + ldr r0, [r4, #0x1c] + lsrs r0, r0, #2 + ldr r1, [r4] + lsls r0, r0, #2 + adds r0, r0, r1 + str r3, [r0] + ldr r0, [r4, #0x1c] + adds r0, #4 + str r0, [r4, #0x1c] + ldr r1, [r4, #0x1c] + ldr r0, [r4, #4] + cmp r1, r0 + blo _0200D384 + ldr r0, =gUnknown_02024960 + ldr r1, =0x0000085A + adds r0, r0, r1 + ldrb r1, [r0] + movs r2, #0 + movs r1, #1 + strb r1, [r0] + ldrb r0, [r4, #0x11] + strb r2, [r4, #0x11] +_0200D384: + pop {r4, r5, r6} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200D394 +sub_0200D394: @ 0x0200D394 + push {r4, r5, r6, lr} + adds r4, r0, #0 + ldr r5, =gUnknown_020251F0 + ldrb r0, [r5, #0xc] + adds r3, r0, #0 + adds r2, r5, #0 + cmp r3, #0 + bne _0200D3F8 + ldrb r0, [r5, #0xd] + cmp r0, #2 + bne _0200D3D2 + ldr r0, [r5, #0x28] + cmp r4, r0 + bne _0200D3CC + ldr r1, =0x04000158 + movs r0, #0x10 + strh r0, [r1] + str r4, [r5, #0x24] + ldrb r0, [r5, #0xc] + movs r0, #1 + strb r0, [r5, #0xc] + ldrb r1, [r5, #0x11] + strb r0, [r5, #0x11] + b _0200D3E8 + .align 2, 0 + .pool +_0200D3CC: + ldr r0, [r5, #0x2c] + cmp r4, r0 + beq _0200D3D6 +_0200D3D2: + movs r0, #0 + b _0200D61C +_0200D3D6: + ldr r0, =0x04000158 + movs r1, #0 + strh r3, [r0] + str r4, [r5, #0x24] + ldrb r0, [r5, #0xc] + movs r0, #1 + strb r0, [r5, #0xc] + ldrb r0, [r5, #0x11] + strb r1, [r5, #0x11] +_0200D3E8: + ldrb r0, [r2, #0xd] + movs r0, #0 + strb r0, [r2, #0xd] + ldrb r1, [r2, #0x10] + strb r0, [r2, #0x10] + b _0200D61A + .align 2, 0 + .pool +_0200D3F8: + ldrb r0, [r5, #0x11] + adds r6, r0, #0 + cmp r6, #0x55 + bne _0200D402 + b _0200D60C +_0200D402: + cmp r6, #0x55 + bgt _0200D412 + cmp r6, #0 + beq _0200D42C + cmp r6, #0x22 + bne _0200D410 + b _0200D614 +_0200D410: + b _0200D3D2 +_0200D412: + cmp r6, #0x77 + bne _0200D418 + b _0200D5CC +_0200D418: + cmp r6, #0x77 + bgt _0200D424 + cmp r6, #0x66 + bne _0200D422 + b _0200D604 +_0200D422: + b _0200D3D2 +_0200D424: + cmp r6, #0x88 + bne _0200D42A + b _0200D598 +_0200D42A: + b _0200D3D2 +_0200D42C: + lsrs r4, r4, #0x18 + cmp r4, #0xaa + bne _0200D448 + ldr r1, =0x04000154 + ldr r0, =gUnknown_02022EB8 + ldrh r0, [r0] + lsls r0, r0, #0x10 + orrs r0, r4 + str r0, [r1] + b _0200D61A + .align 2, 0 + .pool +_0200D448: + cmp r4, #0x99 + bne _0200D46C + bl sub_0200CB2C + str r0, [r5] + ldr r0, =0x04000154 + str r4, [r0] + movs r0, #0x9e + lsls r0, r0, #2 + str r0, [r5, #4] + str r6, [r5, #0x1c] + ldrb r0, [r5, #0x11] + movs r0, #4 + strb r0, [r5, #0x11] + b _0200D61A + .align 2, 0 + .pool +_0200D46C: + cmp r4, #0x88 + bne _0200D490 + movs r0, #0 + bl sub_0200CB34 + str r0, [r5] + movs r0, #0 + bl sub_0200CB48 + ldr r0, =0x04000154 + str r4, [r0] + movs r0, #0xf0 + lsls r0, r0, #3 + str r0, [r5, #4] + str r6, [r5, #0x1c] + b _0200D498 + .align 2, 0 + .pool +_0200D490: + cmp r4, #0x77 + bne _0200D4A4 + ldr r0, =0x04000154 + str r4, [r0] +_0200D498: + ldrb r0, [r5, #0x11] + strb r4, [r5, #0x11] + b _0200D61A + .align 2, 0 + .pool +_0200D4A4: + cmp r4, #0x66 + bne _0200D4D4 + ldr r0, =0x04000154 + str r4, [r0] + ldrb r0, [r5, #0x11] + strb r4, [r5, #0x11] + ldr r1, =gUnknown_02024960 + str r1, [r5] + movs r0, #0x24 + str r0, [r5, #4] + str r6, [r5, #0x1c] + ldrb r0, [r5, #0xa] + strb r6, [r5, #0xa] + ldr r0, =0x0000087A + adds r1, r1, r0 + ldrb r0, [r1] + strb r6, [r1] + b _0200D61A + .align 2, 0 + .pool +_0200D4D4: + cmp r4, #0x55 + bne _0200D50C + ldr r2, =gUnknown_02024960 + ldr r3, =0x0000084C + adds r2, r2, r3 + ldrb r0, [r2] + movs r1, #1 + orrs r0, r1 + strb r0, [r2] + ldrb r1, [r2] + movs r0, #3 + rsbs r0, r0, #0 + ands r0, r1 + strb r0, [r2] + ldr r0, =0x04000154 + str r4, [r0] + ldrb r0, [r5, #0x11] + strb r4, [r5, #0x11] + ldrb r0, [r5, #0xa] + strb r6, [r5, #0xa] + b _0200D61A + .align 2, 0 + .pool +_0200D50C: + cmp r4, #0x44 + bne _0200D53C + ldr r0, =0x04000154 + str r4, [r0] + ldrb r0, [r5, #0x11] + strb r4, [r5, #0x11] + ldr r2, =gUnknown_02024960 + ldr r0, =0x0000084C + adds r2, r2, r0 + ldrb r0, [r2] + movs r1, #4 + orrs r0, r1 + strb r0, [r2] + ldrb r0, [r2] + movs r1, #8 + orrs r0, r1 + strb r0, [r2] + b _0200D61A + .align 2, 0 + .pool +_0200D53C: + cmp r4, #0x33 + beq _0200D544 + cmp r4, #0x22 + bne _0200D558 +_0200D544: + ldr r0, =0x04000154 + str r4, [r0] + ldrb r0, [r2, #0x11] + movs r0, #0 + strb r4, [r2, #0x11] + ldrb r1, [r2, #0xa] + strb r0, [r2, #0xa] + b _0200D61A + .align 2, 0 + .pool +_0200D558: + cmp r4, #0x60 + bne _0200D578 + ldr r0, =0x04000154 + str r4, [r0] + ldr r1, =0x04000208 + movs r0, #0 + strh r0, [r1] + movs r0, #0 + bl SoftResetRom + b _0200D61A + .align 2, 0 + .pool +_0200D578: + cmp r4, #0x61 + bne _0200D61A + ldr r0, =0x04000154 + str r4, [r0] + ldr r1, =0x04000208 + movs r0, #0 + strh r0, [r1] + movs r0, #0 + bl SoftReset + b _0200D61A + .align 2, 0 + .pool +_0200D598: + ldr r0, [r5, #0x1c] + lsrs r0, r0, #2 + ldr r1, [r5] + lsls r0, r0, #2 + adds r0, r0, r1 + str r4, [r0] + ldr r0, [r5, #0x1c] + adds r0, #4 + str r0, [r5, #0x1c] + ldr r1, [r5, #0x1c] + ldr r0, [r5, #4] + cmp r1, r0 + blo _0200D61A + ldr r1, =0x04000158 + movs r0, #0 + strh r0, [r1] + ldrb r1, [r5, #0x11] + strb r0, [r5, #0x11] + ldrb r1, [r5, #0xc] + strb r0, [r5, #0xc] + movs r0, #1 + bl sub_0200CB48 + b _0200D61A + .align 2, 0 + .pool +_0200D5CC: + ldr r1, =gUnknown_02024960 + lsrs r2, r4, #0x18 + ldr r3, =0x00000858 + adds r0, r1, r3 + ldrb r3, [r0] + movs r3, #0 + strb r2, [r0] + ldr r2, =0x00000859 + adds r0, r1, r2 + ldrb r2, [r0] + strb r4, [r0] + ldr r0, =0x00000878 + adds r1, r1, r0 + ldrb r0, [r1] + movs r0, #1 + strb r0, [r1] + ldrb r0, [r5, #0x11] + strb r3, [r5, #0x11] + b _0200D61A + .align 2, 0 + .pool +_0200D604: + adds r0, r4, #0 + bl sub_0200D08C + b _0200D61A +_0200D60C: + adds r0, r4, #0 + bl sub_0200CF50 + b _0200D61A +_0200D614: + adds r0, r4, #0 + bl sub_0200D1AC +_0200D61A: + movs r0, #1 +_0200D61C: + pop {r4, r5, r6} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200D624 +sub_0200D624: @ 0x0200D624 + push {r4, r5, r6, lr} + ldr r1, =gUnknown_02022ECC + ldr r2, =gUnknown_020251E8 + ldr r0, [r2] + adds r0, #0xb4 + ldr r1, [r1] + ldr r0, [r0] + adds r6, r1, r0 + ldr r5, =gUnknown_020251C8 + ldr r1, =gUnknown_020251F0 + ldrb r0, [r1, #0xa] + adds r4, r1, #0 + cmp r0, #4 + bls _0200D642 + b _0200D73C +_0200D642: + lsls r0, r0, #2 + ldr r1, =_0200D660 + adds r0, r0, r1 + ldr r0, [r0] + mov pc, r0 + .align 2, 0 + .pool +_0200D660: @ jump table + .4byte _0200D674 @ case 0 + .4byte _0200D698 @ case 1 + .4byte _0200D6A8 @ case 2 + .4byte _0200D6E0 @ case 3 + .4byte _0200D718 @ case 4 +_0200D674: + movs r3, #0x10 + adds r2, r5, #0 + adds r1, r6, #0 +_0200D67A: + ldrb r0, [r1] + strb r0, [r2] + adds r1, #1 + adds r2, #1 + subs r3, #1 + cmp r3, #0 + bne _0200D67A + ldr r1, =0x04000154 + ldr r0, [r5, #8] + lsls r0, r0, #8 + lsrs r0, r0, #8 + str r0, [r1] + b _0200D702 + .align 2, 0 + .pool +_0200D698: + ldr r1, =0x04000154 + ldr r0, [r5, #0xc] + lsls r0, r0, #8 + lsrs r0, r0, #8 + str r0, [r1] + b _0200D702 + .align 2, 0 + .pool +_0200D6A8: + bl sub_0200CDE8 + ldrb r3, [r5, #0xb] + lsls r2, r3, #0x1f + lsrs r2, r2, #0x1f + movs r1, #2 + ands r1, r3 + orrs r2, r1 + movs r1, #4 + ands r1, r3 + orrs r2, r1 + movs r1, #8 + ands r1, r3 + orrs r2, r1 + lsls r0, r0, #4 + orrs r2, r0 + ldr r0, =0x04000154 + str r2, [r0] + ldr r1, =gUnknown_020251F0 + ldrb r0, [r1, #0xa] + adds r0, #1 + ldrb r2, [r1, #0xa] + strb r0, [r1, #0xa] + b _0200D73C + .align 2, 0 + .pool +_0200D6E0: + ldr r0, [r2] + adds r0, #0xe9 + ldrb r0, [r0] + str r0, [r4, #4] + movs r0, #0 + str r0, [r4, #0x1c] + ldr r0, =gUnknown_02022EF0 + ldr r0, [r0] + ldrb r0, [r0] + lsls r1, r0, #0x10 + ldr r0, [r4, #4] + orrs r1, r0 + ldr r0, =0x04000154 + str r1, [r0] + ldr r0, =gUnknown_02022EBC + ldr r0, [r0] + str r0, [r4] +_0200D702: + ldrb r0, [r4, #0xa] + adds r0, #1 + ldrb r1, [r4, #0xa] + strb r0, [r4, #0xa] + b _0200D73C + .align 2, 0 + .pool +_0200D718: + ldr r3, =0x04000154 + ldr r1, [r4, #0x1c] + ldr r2, [r4] + lsls r0, r1, #2 + adds r0, r0, r2 + ldr r0, [r0] + str r0, [r3] + adds r1, #1 + str r1, [r4, #0x1c] + ldr r1, [r4, #0x1c] + ldr r0, [r4, #4] + cmp r1, r0 + bne _0200D73C + ldrb r0, [r4, #0x11] + movs r0, #0 + strb r0, [r4, #0x11] + ldrb r1, [r4, #0xc] + strb r0, [r4, #0xc] +_0200D73C: + pop {r4, r5, r6} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200D748 +sub_0200D748: @ 0x0200D748 + push {lr} + ldr r3, =gUnknown_020251F0 + ldrb r0, [r3, #0xc] + cmp r0, #0 + bne _0200D764 + ldrb r0, [r3, #0xd] + cmp r0, #1 + bne _0200D800 + ldrb r0, [r3, #0xd] + movs r0, #2 + strb r0, [r3, #0xd] + b _0200D804 + .align 2, 0 + .pool +_0200D764: + ldrb r0, [r3, #0x11] + cmp r0, #0x55 + beq _0200D804 + cmp r0, #0x55 + bgt _0200D786 + cmp r0, #0x22 + beq _0200D804 + cmp r0, #0x22 + bgt _0200D77C + cmp r0, #4 + beq _0200D79E + b _0200D800 +_0200D77C: + cmp r0, #0x33 + beq _0200D7D8 + cmp r0, #0x44 + beq _0200D7DE + b _0200D800 +_0200D786: + cmp r0, #0x66 + beq _0200D804 + cmp r0, #0x66 + bgt _0200D794 + cmp r0, #0x60 + beq _0200D804 + b _0200D800 +_0200D794: + cmp r0, #0x77 + beq _0200D804 + cmp r0, #0x88 + beq _0200D804 + b _0200D800 +_0200D79E: + ldr r1, [r3, #0x1c] + ldr r0, [r3, #4] + cmp r1, r0 + bhs _0200D7C4 + ldr r2, =0x04000154 + ldr r0, [r3, #0x1c] + lsrs r0, r0, #2 + ldr r1, [r3] + lsls r0, r0, #2 + adds r0, r0, r1 + ldr r0, [r0] + str r0, [r2] + ldr r0, [r3, #0x1c] + adds r0, #4 + str r0, [r3, #0x1c] + b _0200D804 + .align 2, 0 + .pool +_0200D7C4: + ldr r1, =0x04000158 + movs r0, #0 + strh r0, [r1] + ldrb r1, [r3, #0x11] + strb r0, [r3, #0x11] + ldrb r1, [r3, #0xc] + strb r0, [r3, #0xc] + b _0200D804 + .align 2, 0 + .pool +_0200D7D8: + bl sub_0200D624 + b _0200D804 +_0200D7DE: + ldr r1, =gUnknown_02024960 + ldr r0, =0x0000084C + adds r1, r1, r0 + ldrb r2, [r1] + movs r0, #9 + rsbs r0, r0, #0 + ands r0, r2 + strb r0, [r1] + ldrb r0, [r3, #0x11] + movs r0, #0 + strb r0, [r3, #0x11] + b _0200D804 + .align 2, 0 + .pool +_0200D800: + movs r0, #0 + b _0200D806 +_0200D804: + movs r0, #1 +_0200D806: + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200D80C +sub_0200D80C: @ 0x0200D80C + push {r4, lr} + ldr r0, =0x04000140 + ldrh r0, [r0] + adds r4, r0, #0 + movs r0, #4 + ands r0, r4 + cmp r0, #0 + beq _0200D824 + bl sub_0200D748 + cmp r0, #0 + beq _0200D840 +_0200D824: + movs r0, #2 + ands r0, r4 + cmp r0, #0 + beq _0200D850 + ldr r1, =gUnknown_020251F0 + ldrb r0, [r1, #0xb] + movs r0, #1 + strb r0, [r1, #0xb] + ldr r0, =0x04000150 + ldr r0, [r0] + bl sub_0200D394 + cmp r0, #0 + bne _0200D850 +_0200D840: + ldr r0, =0x04000158 + movs r1, #0 + strh r1, [r0] + ldr r0, =gUnknown_020251F0 + ldrb r2, [r0, #0xc] + strb r1, [r0, #0xc] + ldrb r2, [r0, #0xd] + strb r1, [r0, #0xd] +_0200D850: + movs r3, #1 + adds r0, r4, #0 + ands r0, r3 + ldr r2, =gUnknown_020251F0 + cmp r0, #0 + beq _0200D87C + ldr r0, =0x04000150 + ldr r0, [r0] + ldr r1, =0x04000154 + ldr r0, [r2, #0x20] + str r0, [r1] + ldr r0, =0x04000158 + movs r1, #0 + strh r1, [r0] + ldrb r0, [r2, #0xc] + strb r1, [r2, #0xc] + ldrb r0, [r2, #0xd] + strb r3, [r2, #0xd] + ldr r0, =0x04000006 + ldrh r0, [r0] + ldrb r1, [r2, #0x14] + strb r0, [r2, #0x14] +_0200D87C: + ldr r0, =0x04000140 + strh r4, [r0] + ldrb r0, [r2, #0xf] + movs r0, #0 + strb r0, [r2, #0xf] + pop {r4} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200D8A4 +sub_0200D8A4: @ 0x0200D8A4 + push {r4, r5, r6, lr} + ldr r5, =0x04000208 + ldrh r0, [r5] + adds r6, r0, #0 + movs r4, #0 + strh r4, [r5] + ldr r3, =gUnknown_020251F0 + ldrb r0, [r3, #0x12] + cmp r0, #0 + bne _0200D8C2 + ldr r1, =0x04000134 + movs r2, #0x80 + lsls r2, r2, #8 + adds r0, r2, #0 + strh r0, [r1] +_0200D8C2: + ldr r1, =0x04000134 + movs r2, #0xc0 + lsls r2, r2, #8 + adds r0, r2, #0 + strh r0, [r1] + ldr r0, =0x04000158 + strh r4, [r0] + subs r0, #8 + ldr r0, [r0] + adds r1, #0x20 + movs r0, #0 + str r0, [r1] + subs r1, #0x14 + movs r0, #0x47 + strh r0, [r1] + ldr r0, =0x04000202 + movs r2, #0x80 + strh r2, [r0] + adds r1, #0xc0 + ldrh r0, [r1] + orrs r0, r2 + strh r0, [r1] + ldrb r0, [r3, #0xf] + strb r4, [r3, #0xf] + ldrb r0, [r3, #0xc] + strb r4, [r3, #0xc] + ldrb r0, [r3, #0xd] + strb r4, [r3, #0xd] + ldrb r0, [r3, #0x12] + strb r4, [r3, #0x12] + ldrb r0, [r3, #0x11] + strb r4, [r3, #0x11] + ldrb r0, [r3, #0xb] + strb r4, [r3, #0xb] + strh r6, [r5] + pop {r4, r5, r6} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200D924 +sub_0200D924: @ 0x0200D924 + push {r4, r5, r6, lr} + adds r4, r0, #0 + ldr r0, =0x04000208 + ldrh r1, [r0] + adds r6, r1, #0 + movs r1, #0 + strh r1, [r0] + movs r1, #0 + ldr r3, =gUnknown_020251F0 + movs r2, #0 +_0200D938: + adds r0, r1, r3 + strb r2, [r0] + adds r1, #1 + cmp r1, #0x33 + bls _0200D938 + ldr r5, =gUnknown_020251F0 + ldrb r0, [r5, #0x12] + movs r0, #1 + strb r0, [r5, #0x12] + bl sub_0200D8A4 + ldr r2, =0x04000200 + ldrh r0, [r2] + movs r1, #0x80 + orrs r0, r1 + strh r0, [r2] + ldrb r0, [r4] + cmp r0, #0x54 + bne _0200D988 + ldrb r1, [r4, #1] + cmp r1, #0x45 + bne _0200D988 + ldrb r3, [r4, #2] + cmp r3, #0x53 + bne _0200D988 + ldrb r0, [r4, #3] + cmp r0, #0x54 + bne _0200D988 + ldrb r0, [r5, #0xe] + movs r0, #0xfe + strb r0, [r5, #0xe] + adds r2, r5, #0 + b _0200D992 + .align 2, 0 + .pool +_0200D988: + ldr r0, =gUnknown_020251F0 + ldrb r1, [r0, #0xe] + movs r1, #0x28 + strb r1, [r0, #0xe] + adds r2, r0, #0 +_0200D992: + ldrb r1, [r4, #3] + lsls r0, r1, #0x18 + ldrb r3, [r4, #2] + lsls r1, r3, #0x10 + orrs r0, r1 + ldrb r3, [r4, #1] + lsls r1, r3, #8 + orrs r0, r1 + ldrb r1, [r4] + orrs r0, r1 + str r0, [r2, #0x20] + ldr r0, [r2, #0x20] + str r0, [r2, #0x2c] + ldr r0, [r2, #0x20] + ldr r1, =0x20202020 + orrs r0, r1 + str r0, [r2, #0x28] + ldrb r3, [r4, #4] + lsls r0, r3, #0x18 + ldrb r3, [r4, #5] + lsls r1, r3, #0x10 + orrs r0, r1 + ldrb r3, [r4, #6] + lsls r1, r3, #8 + orrs r0, r1 + ldrb r4, [r4, #7] + orrs r0, r4 + str r0, [r2, #0x30] + ldr r1, =sub_0200D80C + movs r0, #0 + bl sub_02008674 + ldr r0, =0x04000208 + strh r6, [r0] + pop {r4, r5, r6} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200D9EC +sub_0200D9EC: @ 0x0200D9EC + push {lr} + ldr r0, =0x080000B2 + ldrb r0, [r0] + cmp r0, #0x96 + beq _0200D9FC + movs r0, #0 + bl SoftReset +_0200D9FC: + ldr r3, =gUnknown_020251F0 + ldrb r1, [r3, #0xf] + ldrb r0, [r3, #0xe] + cmp r1, r0 + bhi _0200DA28 + ldr r1, =0x04000208 + movs r0, #0 + strh r0, [r1] + ldrb r0, [r3, #0xf] + adds r0, #1 + ldrb r2, [r3, #0xf] + strb r0, [r3, #0xf] + movs r0, #1 + strh r0, [r1] + movs r0, #0 + b _0200DA34 + .align 2, 0 + .pool +_0200DA28: + ldrb r0, [r3, #0x10] + movs r0, #1 + strb r0, [r3, #0x10] + movs r0, #0 + bl SoftReset +_0200DA34: + pop {r1} + bx r1 + + thumb_func_start sub_0200DA38 +sub_0200DA38: @ 0x0200DA38 + adds r3, r0, #0 + cmp r2, #0 + beq _0200DA4C +_0200DA3E: + ldrb r0, [r1] + strb r0, [r3] + adds r1, #1 + adds r3, #1 + subs r2, #1 + cmp r2, #0 + bne _0200DA3E +_0200DA4C: + bx lr + .align 2, 0 + + thumb_func_start sub_0200DA50 +sub_0200DA50: @ 0x0200DA50 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + ldr r3, =0x0E005555 + movs r1, #0xaa + strb r1, [r3] + ldr r2, =0x0E002AAA + movs r1, #0x55 + strb r1, [r2] + movs r1, #0xb0 + strb r1, [r3] + movs r1, #0xe0 + lsls r1, r1, #0x14 + strb r0, [r1] + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_0200DA74 +sub_0200DA74: @ 0x0200DA74 + push {r4, r5, lr} + sub sp, #0x44 + mov r0, sp + bl sub_0200DC64 + mov r5, sp + adds r5, #1 + ldr r2, =0x0E005555 + movs r0, #0xaa + strb r0, [r2] + ldr r1, =0x0E002AAA + movs r0, #0x55 + strb r0, [r1] + movs r0, #0x90 + strb r0, [r2] + add r1, sp, #0x40 + ldr r2, =0x00004E20 + adds r0, r2, #0 + b _0200DAAC + .align 2, 0 + .pool +_0200DAA8: + ldrh r0, [r1] + subs r0, #1 +_0200DAAC: + strh r0, [r1] + ldrh r0, [r1] + cmp r0, #0 + bne _0200DAA8 + ldr r0, =0x0E000001 + bl _call_via_r5 + lsls r0, r0, #0x18 + lsrs r4, r0, #0x10 + movs r0, #0xe0 + lsls r0, r0, #0x14 + bl _call_via_r5 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + orrs r4, r0 + ldr r1, =0x0E005555 + movs r0, #0xaa + strb r0, [r1] + ldr r2, =0x0E002AAA + movs r0, #0x55 + strb r0, [r2] + movs r0, #0xf0 + strb r0, [r1] + strb r0, [r1] + add r1, sp, #0x40 + ldr r2, =0x00004E20 + adds r0, r2, #0 + b _0200DAFC + .align 2, 0 + .pool +_0200DAF8: + ldrh r0, [r1] + subs r0, #1 +_0200DAFC: + strh r0, [r1] + ldrh r0, [r1] + cmp r0, #0 + bne _0200DAF8 + adds r0, r4, #0 + add sp, #0x44 + pop {r4, r5} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200DB10 +sub_0200DB10: @ 0x0200DB10 + push {lr} + ldr r1, =gUnknown_02021376 + ldrh r0, [r1] + cmp r0, #0 + beq _0200DB2C + ldrh r0, [r1] + subs r0, #1 + strh r0, [r1] + lsls r0, r0, #0x10 + cmp r0, #0 + bne _0200DB2C + ldr r1, =gUnknown_02025224 + movs r0, #1 + strb r0, [r1] +_0200DB2C: + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200DB38 +sub_0200DB38: @ 0x0200DB38 + push {lr} + adds r2, r1, #0 + lsls r0, r0, #0x18 + lsrs r1, r0, #0x18 + cmp r1, #3 + bhi _0200DB6C + ldr r0, =gUnknown_02021374 + strb r1, [r0] + ldr r1, =gUnknown_02021378 + ldrb r0, [r0] + lsls r0, r0, #2 + ldr r3, =0x04000100 + adds r0, r0, r3 + str r0, [r1] + ldr r0, =sub_0200DB10 + str r0, [r2] + movs r0, #0 + b _0200DB6E + .align 2, 0 + .pool +_0200DB6C: + movs r0, #1 +_0200DB6E: + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200DB74 +sub_0200DB74: @ 0x0200DB74 + push {r4, r5, r6, lr} + mov r6, sl + mov r5, sb + mov r4, r8 + push {r4, r5, r6} + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + ldr r1, =gUnknown_02025248 + lsls r2, r0, #1 + adds r2, r2, r0 + lsls r2, r2, #1 + ldr r0, [r1] + adds r2, r2, r0 + ldr r1, =gUnknown_0202137C + ldr r0, =0x04000208 + mov sb, r0 + ldrh r0, [r0] + strh r0, [r1] + movs r3, #0 + mov r1, sb + strh r3, [r1] + ldr r0, =gUnknown_02021378 + mov r8, r0 + ldr r4, [r0] + strh r3, [r4, #2] + ldr r6, =0x04000200 + ldr r1, =gUnknown_02021374 + mov sl, r1 + ldrb r1, [r1] + movs r5, #8 + adds r0, r5, #0 + lsls r0, r1 + adds r1, r0, #0 + ldrh r0, [r6] + orrs r0, r1 + strh r0, [r6] + ldr r0, =gUnknown_02025224 + strb r3, [r0] + ldr r1, =gUnknown_02021376 + ldrh r0, [r2] + strh r0, [r1] + adds r2, #2 + ldrh r0, [r2] + strh r0, [r4] + adds r0, r4, #2 + mov r1, r8 + str r0, [r1] + ldrh r0, [r2, #2] + strh r0, [r4, #2] + str r4, [r1] + ldr r1, =0x04000202 + mov r2, sl + ldrb r0, [r2] + lsls r5, r0 + strh r5, [r1] + movs r0, #1 + mov r3, sb + strh r0, [r3] + pop {r3, r4, r5} + mov r8, r3 + mov sb, r4 + mov sl, r5 + pop {r4, r5, r6} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200DC1C +sub_0200DC1C: @ 0x0200DC1C + ldr r3, =0x04000208 + movs r1, #0 + strh r1, [r3] + ldr r2, =gUnknown_02021378 + ldr r0, [r2] + strh r1, [r0] + adds r0, #2 + str r0, [r2] + strh r1, [r0] + subs r0, #2 + str r0, [r2] + ldr r2, =0x04000200 + ldr r0, =gUnknown_02021374 + ldrb r0, [r0] + movs r1, #8 + lsls r1, r0 + ldrh r0, [r2] + bics r0, r1 + strh r0, [r2] + ldr r0, =gUnknown_0202137C + ldrh r0, [r0] + strh r0, [r3] + bx lr + .align 2, 0 + .pool + + thumb_func_start sub_0200DC60 +sub_0200DC60: @ 0x0200DC60 + ldrb r0, [r0] + bx lr + + thumb_func_start sub_0200DC64 +sub_0200DC64: @ 0x0200DC64 + push {lr} + adds r2, r0, #0 + ldr r1, =gUnknown_02025228 + adds r0, r2, #1 + str r0, [r1] + ldr r3, =sub_0200DC60 + movs r0, #1 + eors r3, r0 + ldr r0, =sub_0200DC64 + ldr r1, =sub_0200DC60 + subs r0, r0, r1 + lsls r0, r0, #0xf + b _0200DC98 + .align 2, 0 + .pool +_0200DC8C: + ldrh r0, [r3] + strh r0, [r2] + adds r3, #2 + adds r2, #2 + subs r0, r1, #1 + lsls r0, r0, #0x10 +_0200DC98: + lsrs r1, r0, #0x10 + cmp r1, #0 + bne _0200DC8C + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start sub_0200DCA4 +sub_0200DCA4: @ 0x0200DCA4 + push {r4, lr} + adds r4, r0, #0 + subs r3, r2, #1 + cmp r2, #0 + beq _0200DCC0 + movs r2, #1 + rsbs r2, r2, #0 +_0200DCB2: + ldrb r0, [r4] + strb r0, [r1] + adds r4, #1 + adds r1, #1 + subs r3, #1 + cmp r3, r2 + bne _0200DCB2 +_0200DCC0: + pop {r4} + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start sub_0200DCC8 +sub_0200DCC8: @ 0x0200DCC8 + push {r4, r5, r6, r7, lr} + sub sp, #0x80 + adds r5, r1, #0 + adds r6, r2, #0 + adds r7, r3, #0 + lsls r3, r0, #0x10 + lsrs r4, r3, #0x10 + ldr r2, =0x04000204 + ldrh r0, [r2] + ldr r1, =0x0000FFFC + ands r0, r1 + movs r1, #3 + orrs r0, r1 + strh r0, [r2] + ldr r0, =gUnknown_02025234 + ldr r0, [r0] + ldr r1, [r0] + movs r0, #0x80 + lsls r0, r0, #0xa + cmp r1, r0 + bne _0200DD00 + lsrs r0, r3, #0x14 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + bl sub_0200DA50 + movs r0, #0xf + ands r4, r0 +_0200DD00: + ldr r3, =sub_0200DCA4 + movs r0, #1 + eors r3, r0 + mov r2, sp + ldr r0, =sub_0200DCC8 + ldr r1, =sub_0200DCA4 + subs r0, r0, r1 + lsls r0, r0, #0xf + b _0200DD34 + .align 2, 0 + .pool +_0200DD28: + ldrh r0, [r3] + strh r0, [r2] + adds r3, #2 + adds r2, #2 + subs r0, r1, #1 + lsls r0, r0, #0x10 +_0200DD34: + lsrs r1, r0, #0x10 + cmp r1, #0 + bne _0200DD28 + mov r3, sp + adds r3, #1 + ldr r0, =gUnknown_02025234 + ldr r0, [r0] + ldrb r0, [r0, #8] + lsls r4, r0 + adds r0, r4, #0 + movs r2, #0xe0 + lsls r2, r2, #0x14 + adds r1, r5, r2 + adds r0, r0, r1 + adds r1, r6, #0 + adds r2, r7, #0 + bl _call_via_r3 + add sp, #0x80 + pop {r4, r5, r6, r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200DD64 +sub_0200DD64: @ 0x0200DD64 + push {r4, r5, lr} + adds r5, r0, #0 + adds r3, r1, #0 + subs r4, r2, #1 + cmp r2, #0 + beq _0200DD8A + movs r2, #1 + rsbs r2, r2, #0 +_0200DD74: + ldrb r1, [r3] + ldrb r0, [r5] + adds r5, #1 + adds r3, #1 + cmp r1, r0 + beq _0200DD84 + subs r0, r3, #1 + b _0200DD8C +_0200DD84: + subs r4, #1 + cmp r4, r2 + bne _0200DD74 +_0200DD8A: + movs r0, #0 +_0200DD8C: + pop {r4, r5} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200DD94 +sub_0200DD94: @ 0x0200DD94 + push {r4, r5, lr} + sub sp, #0x100 + adds r5, r1, #0 + lsls r3, r0, #0x10 + lsrs r4, r3, #0x10 + ldr r2, =0x04000204 + ldrh r0, [r2] + ldr r1, =0x0000FFFC + ands r0, r1 + movs r1, #3 + orrs r0, r1 + strh r0, [r2] + ldr r0, =gUnknown_02025234 + ldr r0, [r0] + ldr r1, [r0] + movs r0, #0x80 + lsls r0, r0, #0xa + cmp r1, r0 + bne _0200DDC8 + lsrs r0, r3, #0x14 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + bl sub_0200DA50 + movs r0, #0xf + ands r4, r0 +_0200DDC8: + ldr r3, =sub_0200DD64 + movs r0, #1 + eors r3, r0 + mov r2, sp + ldr r0, =sub_0200DD94 + ldr r1, =sub_0200DD64 + subs r0, r0, r1 + lsls r0, r0, #0xf + b _0200DDFC + .align 2, 0 + .pool +_0200DDF0: + ldrh r0, [r3] + strh r0, [r2] + adds r3, #2 + adds r2, #2 + subs r0, r1, #1 + lsls r0, r0, #0x10 +_0200DDFC: + lsrs r1, r0, #0x10 + cmp r1, #0 + bne _0200DDF0 + mov r3, sp + adds r3, #1 + ldr r0, =gUnknown_02025234 + ldr r0, [r0] + ldrb r1, [r0, #8] + lsls r4, r1 + adds r1, r4, #0 + movs r2, #0xe0 + lsls r2, r2, #0x14 + adds r1, r1, r2 + ldrh r2, [r0, #4] + adds r0, r5, #0 + bl _call_via_r3 + add sp, #0x100 + pop {r4, r5} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200DE2C +sub_0200DE2C: @ 0x0200DE2C + push {r4, r5, r6, lr} + sub sp, #0x100 + adds r5, r1, #0 + adds r6, r2, #0 + lsls r2, r0, #0x10 + lsrs r4, r2, #0x10 + ldr r0, =gUnknown_02025234 + ldr r0, [r0] + ldr r1, [r0] + movs r0, #0x80 + lsls r0, r0, #0xa + cmp r1, r0 + bne _0200DE54 + lsrs r0, r2, #0x14 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + bl sub_0200DA50 + movs r0, #0xf + ands r4, r0 +_0200DE54: + ldr r2, =0x04000204 + ldrh r0, [r2] + ldr r1, =0x0000FFFC + ands r0, r1 + movs r1, #3 + orrs r0, r1 + strh r0, [r2] + ldr r3, =sub_0200DD64 + movs r0, #1 + eors r3, r0 + mov r2, sp + ldr r0, =sub_0200DD94 + ldr r1, =sub_0200DD64 + subs r0, r0, r1 + lsls r0, r0, #0xf + b _0200DE94 + .align 2, 0 + .pool +_0200DE88: + ldrh r0, [r3] + strh r0, [r2] + adds r3, #2 + adds r2, #2 + subs r0, r1, #1 + lsls r0, r0, #0x10 +_0200DE94: + lsrs r1, r0, #0x10 + cmp r1, #0 + bne _0200DE88 + mov r3, sp + adds r3, #1 + ldr r0, =gUnknown_02025234 + ldr r0, [r0] + ldrb r1, [r0, #8] + lsls r4, r1 + adds r1, r4, #0 + movs r0, #0xe0 + lsls r0, r0, #0x14 + adds r1, r1, r0 + adds r0, r5, #0 + adds r2, r6, #0 + bl _call_via_r3 + add sp, #0x100 + pop {r4, r5, r6} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200DEC4 +sub_0200DEC4: @ 0x0200DEC4 + push {r4, r5, r6, lr} + adds r5, r1, #0 + lsls r0, r0, #0x10 + lsrs r4, r0, #0x10 + movs r6, #0 + b _0200DED6 +_0200DED0: + adds r0, r6, #1 + lsls r0, r0, #0x18 + lsrs r6, r0, #0x18 +_0200DED6: + cmp r6, #2 + bhi _0200DEFC + ldr r0, =gUnknown_02025230 + ldr r2, [r0] + adds r0, r4, #0 + adds r1, r5, #0 + bl _call_via_r2 + lsls r0, r0, #0x10 + lsrs r2, r0, #0x10 + cmp r2, #0 + bne _0200DED0 + adds r0, r4, #0 + adds r1, r5, #0 + bl sub_0200DD94 + adds r2, r0, #0 + cmp r2, #0 + bne _0200DED0 +_0200DEFC: + adds r0, r2, #0 + pop {r4, r5, r6} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200DF08 +sub_0200DF08: @ 0x0200DF08 + push {r4, r5, r6, r7, lr} + adds r5, r1, #0 + adds r7, r2, #0 + lsls r0, r0, #0x10 + lsrs r4, r0, #0x10 + movs r6, #0 + b _0200DF1C +_0200DF16: + adds r0, r6, #1 + lsls r0, r0, #0x18 + lsrs r6, r0, #0x18 +_0200DF1C: + cmp r6, #2 + bhi _0200DF44 + ldr r0, =gUnknown_02025230 + ldr r2, [r0] + adds r0, r4, #0 + adds r1, r5, #0 + bl _call_via_r2 + lsls r0, r0, #0x10 + lsrs r3, r0, #0x10 + cmp r3, #0 + bne _0200DF16 + adds r0, r4, #0 + adds r1, r5, #0 + adds r2, r7, #0 + bl sub_0200DE2C + adds r3, r0, #0 + cmp r3, #0 + bne _0200DF16 +_0200DF44: + adds r0, r3, #0 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200DF50 +sub_0200DF50: @ 0x0200DF50 + push {r4, lr} + ldr r2, =0x04000204 + ldrh r0, [r2] + ldr r1, =0x0000FFFC + ands r0, r1 + movs r1, #3 + orrs r0, r1 + strh r0, [r2] + bl sub_0200DA74 + lsls r0, r0, #0x10 + lsrs r3, r0, #0x10 + ldr r2, =gUnknown_0201F180 + movs r4, #1 + b _0200DF7E + .align 2, 0 + .pool +_0200DF7C: + adds r2, #4 +_0200DF7E: + ldr r1, [r2] + adds r0, r1, #0 + adds r0, #0x2c + ldrb r0, [r0] + cmp r0, #0 + beq _0200DF92 + ldrh r0, [r1, #0x2c] + cmp r3, r0 + bne _0200DF7C + movs r4, #0 +_0200DF92: + ldr r1, =gUnknown_02025238 + ldr r0, [r2] + ldr r0, [r0] + str r0, [r1] + ldr r1, =gUnknown_02025230 + ldr r0, [r2] + ldr r0, [r0, #4] + str r0, [r1] + ldr r1, =gUnknown_02025240 + ldr r0, [r2] + ldr r0, [r0, #8] + str r0, [r1] + ldr r1, =gUnknown_02025244 + ldr r0, [r2] + ldr r0, [r0, #0xc] + str r0, [r1] + ldr r1, =gUnknown_0202522C + ldr r0, [r2] + ldr r0, [r0, #0x10] + str r0, [r1] + ldr r1, =gUnknown_02025248 + ldr r0, [r2] + ldr r0, [r0, #0x14] + str r0, [r1] + ldr r1, =gUnknown_02025234 + ldr r0, [r2] + adds r0, #0x18 + str r0, [r1] + adds r0, r4, #0 + pop {r4} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200DFF0 +sub_0200DFF0: @ 0x0200DFF0 + push {r4, r5, r6, r7, lr} + mov r7, sb + mov r6, r8 + push {r6, r7} + adds r4, r1, #0 + lsls r0, r0, #0x18 + lsrs r7, r0, #0x18 + lsls r2, r2, #0x18 + lsrs r5, r2, #0x18 + movs r0, #0 + mov r8, r0 + adds r0, r7, #0 + bl sub_0200DB74 + ldr r6, =gUnknown_02025228 + ldr r1, =0x0E005555 + mov sb, r1 + b _0200E054 + .align 2, 0 + .pool +_0200E01C: + movs r0, #0xf0 + mov r1, sb + strb r0, [r1] + movs r0, #0xa0 + lsls r0, r0, #8 + b _0200E04A +_0200E028: + ldr r0, =gUnknown_02025224 + ldrb r0, [r0] + cmp r0, #0 + beq _0200E054 + ldr r1, [r6] + adds r0, r4, #0 + bl _call_via_r1 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + cmp r0, r5 + beq _0200E07C + movs r0, #0xf0 + mov r1, sb + strb r0, [r1] + movs r0, #0xc0 + lsls r0, r0, #8 +_0200E04A: + orrs r7, r0 + mov r8, r7 + b _0200E07C + .align 2, 0 + .pool +_0200E054: + ldr r1, [r6] + adds r0, r4, #0 + bl _call_via_r1 + lsls r0, r0, #0x18 + lsrs r1, r0, #0x18 + cmp r1, r5 + beq _0200E07C + movs r0, #0x20 + ands r0, r1 + cmp r0, #0 + beq _0200E028 + ldr r1, [r6] + adds r0, r4, #0 + bl _call_via_r1 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + cmp r0, r5 + bne _0200E01C +_0200E07C: + bl sub_0200DC1C + mov r0, r8 + pop {r3, r4} + mov r8, r3 + mov sb, r4 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200E090 +sub_0200E090: @ 0x0200E090 + push {r4, r5, r6, lr} + sub sp, #0x40 + ldr r5, =0x04000204 + ldrh r1, [r5] + ldr r6, =0x0000FFFC + ands r1, r6 + ldr r0, =gUnknown_02025234 + ldr r0, [r0] + ldrh r0, [r0, #0x10] + orrs r1, r0 + strh r1, [r5] + ldr r1, =0x0E005555 + movs r4, #0xaa + strb r4, [r1] + ldr r3, =0x0E002AAA + movs r2, #0x55 + strb r2, [r3] + movs r0, #0x80 + strb r0, [r1] + strb r4, [r1] + strb r2, [r3] + movs r0, #0x10 + strb r0, [r1] + mov r0, sp + bl sub_0200DC64 + ldr r0, =gUnknown_0202522C + movs r1, #0xe0 + lsls r1, r1, #0x14 + ldr r3, [r0] + movs r0, #3 + movs r2, #0xff + bl _call_via_r3 + lsls r0, r0, #0x10 + lsrs r0, r0, #0x10 + ldrh r1, [r5] + ands r1, r6 + movs r2, #3 + orrs r1, r2 + strh r1, [r5] + add sp, #0x40 + pop {r4, r5, r6} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200E104 +sub_0200E104: @ 0x0200E104 + push {r4, r5, r6, r7, lr} + sub sp, #0x40 + lsls r0, r0, #0x10 + lsrs r6, r0, #0x10 + ldr r0, =gUnknown_02025234 + ldr r0, [r0] + ldrh r0, [r0, #0xa] + cmp r6, r0 + blo _0200E124 + ldr r0, =0x000080FF + b _0200E1C4 + .align 2, 0 + .pool +_0200E124: + lsrs r0, r6, #4 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + bl sub_0200DA50 + movs r0, #0xf + ands r6, r0 + movs r7, #0 +_0200E134: + ldr r3, =0x04000204 + ldrh r1, [r3] + ldr r0, =0x0000FFFC + ands r1, r0 + ldr r0, =gUnknown_02025234 + ldr r2, [r0] + ldrh r0, [r2, #0x10] + orrs r1, r0 + strh r1, [r3] + ldrb r4, [r2, #8] + adds r0, r6, #0 + lsls r0, r4 + adds r4, r0, #0 + movs r0, #0xe0 + lsls r0, r0, #0x14 + adds r4, r4, r0 + ldr r1, =0x0E005555 + movs r5, #0xaa + strb r5, [r1] + ldr r3, =0x0E002AAA + movs r2, #0x55 + strb r2, [r3] + movs r0, #0x80 + strb r0, [r1] + strb r5, [r1] + strb r2, [r3] + movs r0, #0x30 + strb r0, [r4] + mov r0, sp + bl sub_0200DC64 + ldr r0, =gUnknown_0202522C + ldr r3, [r0] + movs r0, #2 + adds r1, r4, #0 + movs r2, #0xff + bl _call_via_r3 + lsls r0, r0, #0x10 + lsrs r3, r0, #0x10 + movs r0, #0xa0 + lsls r0, r0, #8 + ands r0, r3 + cmp r0, #0 + beq _0200E1B4 + cmp r7, #3 + bhi _0200E1B4 + adds r0, r7, #1 + lsls r0, r0, #0x10 + lsrs r7, r0, #0x10 + b _0200E134 + .align 2, 0 + .pool +_0200E1B4: + ldr r2, =0x04000204 + ldrh r0, [r2] + ldr r1, =0x0000FFFC + ands r0, r1 + movs r1, #3 + orrs r0, r1 + strh r0, [r2] + adds r0, r3, #0 +_0200E1C4: + add sp, #0x40 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200E1D4 +sub_0200E1D4: @ 0x0200E1D4 + push {r4, r5, r6, r7, lr} + sub sp, #0x40 + adds r6, r1, #0 + lsls r1, r0, #0x10 + lsrs r4, r1, #0x10 + lsls r2, r2, #0x18 + lsrs r7, r2, #0x18 + ldr r5, =gUnknown_02025234 + ldr r0, [r5] + ldr r0, [r0, #4] + cmp r6, r0 + bhs _0200E25C + lsrs r0, r1, #0x14 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + bl sub_0200DA50 + movs r0, #0xf + ldr r1, [r5] + ands r4, r0 + ldrb r1, [r1, #8] + lsls r4, r1 + movs r1, #0xe0 + lsls r1, r1, #0x14 + adds r0, r6, r1 + adds r4, r4, r0 + mov r0, sp + bl sub_0200DC64 + ldr r2, =0x04000204 + ldrh r0, [r2] + ldr r1, =0x0000FFFC + ands r0, r1 + ldr r1, [r5] + ldrh r1, [r1, #0x10] + orrs r0, r1 + strh r0, [r2] + ldr r2, =0x0E005555 + movs r0, #0xaa + strb r0, [r2] + ldr r1, =0x0E002AAA + movs r0, #0x55 + strb r0, [r1] + movs r0, #0xa0 + strb r0, [r2] + strb r7, [r4] + ldr r0, =gUnknown_0202522C + ldr r3, [r0] + movs r0, #1 + adds r1, r4, #0 + adds r2, r7, #0 + bl _call_via_r3 + lsls r0, r0, #0x10 + lsrs r0, r0, #0x10 + b _0200E260 + .align 2, 0 + .pool +_0200E25C: + movs r0, #0x80 + lsls r0, r0, #8 +_0200E260: + add sp, #0x40 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + + thumb_func_start sub_0200E268 +sub_0200E268: @ 0x0200E268 + push {r4, lr} + ldr r4, =0x0E005555 + movs r2, #0xaa + strb r2, [r4] + ldr r3, =0x0E002AAA + movs r2, #0x55 + strb r2, [r3] + movs r2, #0xa0 + strb r2, [r4] + ldrb r2, [r0] + strb r2, [r1] + ldr r3, =gUnknown_0202522C + ldrb r2, [r0] + ldr r3, [r3] + movs r0, #1 + bl _call_via_r3 + lsls r0, r0, #0x10 + lsrs r0, r0, #0x10 + pop {r4} + pop {r1} + bx r1 + .align 2, 0 + .pool + + thumb_func_start sub_0200E2A0 +sub_0200E2A0: @ 0x0200E2A0 + push {r4, r5, r6, r7, lr} + sub sp, #0x40 + adds r7, r1, #0 + lsls r0, r0, #0x10 + lsrs r4, r0, #0x10 + ldr r0, =gUnknown_02025234 + ldr r0, [r0] + ldrh r0, [r0, #0xa] + cmp r4, r0 + blo _0200E2C0 + ldr r0, =0x000080FF + b _0200E33A + .align 2, 0 + .pool +_0200E2C0: + adds r0, r4, #0 + bl sub_0200E104 + lsls r0, r0, #0x10 + lsrs r5, r0, #0x10 + cmp r5, #0 + bne _0200E338 + lsrs r0, r4, #4 + lsls r0, r0, #0x18 + lsrs r0, r0, #0x18 + bl sub_0200DA50 + movs r0, #0xf + ands r4, r0 + mov r0, sp + bl sub_0200DC64 + ldr r3, =0x04000204 + ldrh r1, [r3] + ldr r0, =0x0000FFFC + ands r1, r0 + ldr r0, =gUnknown_02025234 + ldr r2, [r0] + ldrh r0, [r2, #0x10] + orrs r1, r0 + strh r1, [r3] + ldr r1, =gUnknown_0202523C + ldr r0, [r2, #4] + strh r0, [r1] + ldrb r0, [r2, #8] + lsls r4, r0 + movs r0, #0xe0 + lsls r0, r0, #0x14 + adds r4, r4, r0 + adds r6, r1, #0 + b _0200E322 + .align 2, 0 + .pool +_0200E318: + ldrh r0, [r6] + subs r0, #1 + strh r0, [r6] + adds r7, #1 + adds r4, #1 +_0200E322: + ldrh r0, [r6] + cmp r0, #0 + beq _0200E338 + adds r0, r7, #0 + adds r1, r4, #0 + bl sub_0200E268 + lsls r0, r0, #0x10 + lsrs r5, r0, #0x10 + cmp r5, #0 + beq _0200E318 +_0200E338: + adds r0, r5, #0 +_0200E33A: + add sp, #0x40 + pop {r4, r5, r6, r7} + pop {r1} + bx r1 + .align 2, 0 diff --git a/asm/siirtc.s b/asm/siirtc.s new file mode 100644 index 0000000..114d8f8 --- /dev/null +++ b/asm/siirtc.s @@ -0,0 +1,1154 @@ + .include "asm/macros/function.inc" + .text + .syntax unified + + thumb_func_start SiiRtcUnprotect +SiiRtcUnprotect: @ 0x0200F43C + push {r7, lr} + mov r7, sp + bl EnableGpioPortRead + ldr r0, =gUnknown_020213B2 + movs r1, #0 + strb r1, [r0] + pop {r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start SiiRtcProtect +SiiRtcProtect: @ 0x0200F454 + push {r7, lr} + mov r7, sp + bl DisableGpioPortRead + ldr r0, =gUnknown_020213B2 + movs r1, #1 + strb r1, [r0] + pop {r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start SiiRtcProbe +SiiRtcProbe: @ 0x0200F46C + push {r7, lr} + sub sp, #0x10 + mov r7, sp + adds r1, r7, #4 + adds r0, r1, #0 + bl SiiRtcGetStatus + lsls r1, r0, #0x18 + lsrs r0, r1, #0x18 + cmp r0, #0 + bne _0200F486 + movs r0, #0 + b _0200F53A +_0200F486: + adds r0, r7, #0 + movs r1, #0 + strb r1, [r0] + adds r0, r7, #4 + ldrb r1, [r0, #7] + movs r2, #0xc0 + adds r0, r1, #0 + ands r0, r2 + adds r2, r0, #0 + lsls r1, r2, #0x18 + lsrs r0, r1, #0x18 + cmp r0, #0x80 + beq _0200F4B6 + adds r0, r7, #4 + ldrb r1, [r0, #7] + movs r2, #0xc0 + adds r0, r1, #0 + ands r0, r2 + adds r2, r0, #0 + lsls r1, r2, #0x18 + lsrs r0, r1, #0x18 + cmp r0, #0 + bne _0200F4D4 + b _0200F4B6 +_0200F4B6: + bl SiiRtcReset + lsls r1, r0, #0x18 + lsrs r0, r1, #0x18 + cmp r0, #0 + bne _0200F4C6 + movs r0, #0 + b _0200F53A +_0200F4C6: + adds r1, r7, #0 + adds r0, r7, #0 + adds r1, r7, #0 + ldrb r2, [r1] + adds r1, r2, #1 + adds r2, r1, #0 + strb r2, [r0] +_0200F4D4: + adds r1, r7, #4 + adds r0, r1, #0 + bl SiiRtcGetTime + adds r0, r7, #4 + ldrb r1, [r0, #6] + movs r2, #0x80 + adds r0, r1, #0 + ands r0, r2 + adds r2, r0, #0 + lsls r1, r2, #0x18 + lsrs r0, r1, #0x18 + cmp r0, #0 + beq _0200F522 + bl SiiRtcReset + lsls r1, r0, #0x18 + lsrs r0, r1, #0x18 + cmp r0, #0 + bne _0200F514 + adds r0, r7, #0 + ldrb r1, [r0] + lsls r0, r1, #4 + adds r1, r0, #0 + movs r2, #0xf + adds r0, r1, #0 + bics r0, r2 + adds r1, r0, #0 + lsls r0, r1, #0x18 + lsrs r1, r0, #0x18 + adds r0, r1, #0 + b _0200F53A +_0200F514: + adds r1, r7, #0 + adds r0, r7, #0 + adds r1, r7, #0 + ldrb r2, [r1] + adds r1, r2, #1 + adds r2, r1, #0 + strb r2, [r0] +_0200F522: + adds r0, r7, #0 + ldrb r1, [r0] + lsls r0, r1, #4 + adds r1, r0, #0 + movs r2, #1 + adds r0, r1, #0 + orrs r0, r2 + adds r1, r0, #0 + lsls r0, r1, #0x18 + lsrs r1, r0, #0x18 + adds r0, r1, #0 + b _0200F53A +_0200F53A: + add sp, #0x10 + pop {r7} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start SiiRtcReset +SiiRtcReset: @ 0x0200F544 + push {r7, lr} + sub sp, #0x10 + mov r7, sp + ldr r0, =gUnknown_020213B2 + ldrb r1, [r0] + cmp r1, #1 + bne _0200F55C + movs r0, #0 + b _0200F5C0 + .align 2, 0 + .pool +_0200F55C: + ldr r0, =gUnknown_020213B2 + movs r1, #1 + strb r1, [r0] + ldr r0, =0x080000C4 + movs r1, #1 + strh r1, [r0] + ldr r0, =0x080000C4 + movs r1, #5 + strh r1, [r0] + ldr r0, =0x080000C6 + movs r1, #7 + strh r1, [r0] + movs r0, #0x60 + bl WriteCommand + ldr r0, =0x080000C4 + movs r1, #1 + strh r1, [r0] + ldr r0, =0x080000C4 + movs r1, #1 + strh r1, [r0] + ldr r0, =gUnknown_020213B2 + movs r1, #0 + strb r1, [r0] + adds r0, r7, #4 + ldrb r1, [r0, #7] + movs r2, #0 + ands r1, r2 + adds r2, r1, #0 + movs r3, #0x40 + adds r1, r2, #0 + orrs r1, r3 + adds r2, r1, #0 + strb r2, [r0, #7] + adds r1, r7, #4 + adds r0, r1, #0 + bl SiiRtcSetStatus + adds r1, r7, #0 + strb r0, [r1] + adds r0, r7, #0 + ldrb r1, [r0] + adds r0, r1, #0 + b _0200F5C0 + .align 2, 0 + .pool +_0200F5C0: + add sp, #0x10 + pop {r7} + pop {r1} + bx r1 + + thumb_func_start SiiRtcGetStatus +SiiRtcGetStatus: @ 0x0200F5C8 + push {r4, r7, lr} + sub sp, #8 + mov r7, sp + str r0, [r7] + ldr r0, =gUnknown_020213B2 + ldrb r1, [r0] + cmp r1, #1 + bne _0200F5E0 + movs r0, #0 + b _0200F68C + .align 2, 0 + .pool +_0200F5E0: + ldr r0, =gUnknown_020213B2 + movs r1, #1 + strb r1, [r0] + ldr r0, =0x080000C4 + movs r1, #1 + strh r1, [r0] + ldr r0, =0x080000C4 + movs r1, #5 + strh r1, [r0] + ldr r0, =0x080000C6 + movs r1, #7 + strh r1, [r0] + movs r0, #0x63 + bl WriteCommand + ldr r0, =0x080000C6 + movs r1, #5 + strh r1, [r0] + bl ReadData + adds r1, r7, #4 + strb r0, [r1] + ldr r0, [r7] + adds r1, r7, #4 + ldrb r2, [r1] + movs r3, #0xc0 + adds r1, r2, #0 + ands r1, r3 + adds r2, r7, #4 + ldrb r3, [r2] + movs r4, #0x20 + adds r2, r3, #0 + ands r2, r4 + adds r4, r2, #0 + lsls r3, r4, #0x18 + lsrs r2, r3, #0x18 + lsrs r3, r2, #3 + adds r2, r3, #0 + orrs r1, r2 + adds r2, r7, #4 + ldrb r3, [r2] + movs r4, #8 + adds r2, r3, #0 + ands r2, r4 + adds r4, r2, #0 + lsls r3, r4, #0x18 + lsrs r2, r3, #0x18 + lsrs r3, r2, #2 + adds r2, r3, #0 + orrs r1, r2 + adds r2, r7, #4 + ldrb r3, [r2] + movs r4, #2 + adds r2, r3, #0 + ands r2, r4 + adds r4, r2, #0 + lsls r3, r4, #0x18 + lsrs r2, r3, #0x18 + lsrs r3, r2, #1 + adds r2, r3, #0 + orrs r1, r2 + ldrb r2, [r0, #7] + movs r3, #0 + ands r2, r3 + adds r3, r2, #0 + adds r2, r3, #0 + orrs r2, r1 + adds r1, r2, #0 + strb r1, [r0, #7] + ldr r0, =0x080000C4 + movs r1, #1 + strh r1, [r0] + ldr r0, =0x080000C4 + movs r1, #1 + strh r1, [r0] + ldr r0, =gUnknown_020213B2 + movs r1, #0 + strb r1, [r0] + movs r0, #1 + b _0200F68C + .align 2, 0 + .pool +_0200F68C: + add sp, #8 + pop {r4, r7} + pop {r1} + bx r1 + + thumb_func_start SiiRtcSetStatus +SiiRtcSetStatus: @ 0x0200F694 + push {r4, r7, lr} + sub sp, #8 + mov r7, sp + str r0, [r7] + ldr r0, =gUnknown_020213B2 + ldrb r1, [r0] + cmp r1, #1 + bne _0200F6AC + movs r0, #0 + b _0200F734 + .align 2, 0 + .pool +_0200F6AC: + ldr r0, =gUnknown_020213B2 + movs r1, #1 + strb r1, [r0] + ldr r0, =0x080000C4 + movs r1, #1 + strh r1, [r0] + ldr r0, =0x080000C4 + movs r1, #5 + strh r1, [r0] + adds r0, r7, #4 + ldr r1, [r7] + ldrb r2, [r1, #7] + movs r3, #4 + adds r1, r2, #0 + ands r1, r3 + adds r2, r1, #0 + lsls r1, r2, #3 + ldr r2, [r7] + ldrb r3, [r2, #7] + movs r4, #2 + adds r2, r3, #0 + ands r2, r4 + adds r3, r2, #0 + lsls r2, r3, #2 + adds r3, r2, #0 + movs r4, #0x40 + adds r2, r3, #0 + orrs r2, r4 + orrs r1, r2 + ldr r2, [r7] + ldrb r3, [r2, #7] + movs r4, #1 + adds r2, r3, #0 + ands r2, r4 + adds r3, r2, #0 + lsls r2, r3, #1 + orrs r1, r2 + adds r2, r1, #0 + strb r2, [r0] + ldr r0, =0x080000C6 + movs r1, #7 + strh r1, [r0] + movs r0, #0x62 + bl WriteCommand + adds r0, r7, #4 + ldrb r1, [r0] + adds r0, r1, #0 + bl WriteData + ldr r0, =0x080000C4 + movs r1, #1 + strh r1, [r0] + ldr r0, =0x080000C4 + movs r1, #1 + strh r1, [r0] + ldr r0, =gUnknown_020213B2 + movs r1, #0 + strb r1, [r0] + movs r0, #1 + b _0200F734 + .align 2, 0 + .pool +_0200F734: + add sp, #8 + pop {r4, r7} + pop {r1} + bx r1 + + thumb_func_start SiiRtcGetDateTime +SiiRtcGetDateTime: @ 0x0200F73C + push {r7, lr} + sub sp, #8 + mov r7, sp + str r0, [r7] + ldr r0, =gUnknown_020213B2 + ldrb r1, [r0] + cmp r1, #1 + bne _0200F754 + movs r0, #0 + b _0200F7E4 + .align 2, 0 + .pool +_0200F754: + ldr r0, =gUnknown_020213B2 + movs r1, #1 + strb r1, [r0] + ldr r0, =0x080000C4 + movs r1, #1 + strh r1, [r0] + ldr r0, =0x080000C4 + movs r1, #5 + strh r1, [r0] + ldr r0, =0x080000C6 + movs r1, #7 + strh r1, [r0] + movs r0, #0x65 + bl WriteCommand + ldr r0, =0x080000C6 + movs r1, #5 + strh r1, [r0] + adds r0, r7, #4 + movs r1, #0 + strb r1, [r0] +_0200F77E: + adds r0, r7, #4 + ldrb r1, [r0] + cmp r1, #6 + bls _0200F794 + b _0200F7B2 + .align 2, 0 + .pool +_0200F794: + bl ReadData + adds r1, r7, #4 + ldrb r2, [r1] + ldr r3, [r7] + adds r1, r2, r3 + strb r0, [r1] + adds r1, r7, #4 + adds r0, r7, #4 + adds r1, r7, #4 + ldrb r2, [r1] + adds r1, r2, #1 + adds r2, r1, #0 + strb r2, [r0] + b _0200F77E +_0200F7B2: + ldr r1, [r7] + adds r0, r1, #4 + ldr r2, [r7] + adds r1, r2, #4 + ldrb r2, [r1] + movs r3, #0x7f + adds r1, r2, #0 + ands r1, r3 + adds r2, r1, #0 + strb r2, [r0] + ldr r0, =0x080000C4 + movs r1, #1 + strh r1, [r0] + ldr r0, =0x080000C4 + movs r1, #1 + strh r1, [r0] + ldr r0, =gUnknown_020213B2 + movs r1, #0 + strb r1, [r0] + movs r0, #1 + b _0200F7E4 + .align 2, 0 + .pool +_0200F7E4: + add sp, #8 + pop {r7} + pop {r1} + bx r1 + + thumb_func_start SiiRtcSetDateTime +SiiRtcSetDateTime: @ 0x0200F7EC + push {r7, lr} + sub sp, #8 + mov r7, sp + str r0, [r7] + ldr r0, =gUnknown_020213B2 + ldrb r1, [r0] + cmp r1, #1 + bne _0200F804 + movs r0, #0 + b _0200F880 + .align 2, 0 + .pool +_0200F804: + ldr r0, =gUnknown_020213B2 + movs r1, #1 + strb r1, [r0] + ldr r0, =0x080000C4 + movs r1, #1 + strh r1, [r0] + ldr r0, =0x080000C4 + movs r1, #5 + strh r1, [r0] + ldr r0, =0x080000C6 + movs r1, #7 + strh r1, [r0] + movs r0, #0x64 + bl WriteCommand + adds r0, r7, #4 + movs r1, #0 + strb r1, [r0] +_0200F828: + adds r0, r7, #4 + ldrb r1, [r0] + cmp r1, #6 + bls _0200F840 + b _0200F860 + .align 2, 0 + .pool +_0200F840: + adds r0, r7, #4 + ldrb r1, [r0] + ldr r2, [r7] + adds r0, r1, r2 + ldrb r1, [r0] + adds r0, r1, #0 + bl WriteData + adds r1, r7, #4 + adds r0, r7, #4 + adds r1, r7, #4 + ldrb r2, [r1] + adds r1, r2, #1 + adds r2, r1, #0 + strb r2, [r0] + b _0200F828 +_0200F860: + ldr r0, =0x080000C4 + movs r1, #1 + strh r1, [r0] + ldr r0, =0x080000C4 + movs r1, #1 + strh r1, [r0] + ldr r0, =gUnknown_020213B2 + movs r1, #0 + strb r1, [r0] + movs r0, #1 + b _0200F880 + .align 2, 0 + .pool +_0200F880: + add sp, #8 + pop {r7} + pop {r1} + bx r1 + + thumb_func_start SiiRtcGetTime +SiiRtcGetTime: @ 0x0200F888 + push {r7, lr} + sub sp, #8 + mov r7, sp + str r0, [r7] + ldr r0, =gUnknown_020213B2 + ldrb r1, [r0] + cmp r1, #1 + bne _0200F8A0 + movs r0, #0 + b _0200F934 + .align 2, 0 + .pool +_0200F8A0: + ldr r0, =gUnknown_020213B2 + movs r1, #1 + strb r1, [r0] + ldr r0, =0x080000C4 + movs r1, #1 + strh r1, [r0] + ldr r0, =0x080000C4 + movs r1, #5 + strh r1, [r0] + ldr r0, =0x080000C6 + movs r1, #7 + strh r1, [r0] + movs r0, #0x67 + bl WriteCommand + ldr r0, =0x080000C6 + movs r1, #5 + strh r1, [r0] + adds r0, r7, #4 + movs r1, #0 + strb r1, [r0] +_0200F8CA: + adds r0, r7, #4 + ldrb r1, [r0] + cmp r1, #2 + bls _0200F8E0 + b _0200F900 + .align 2, 0 + .pool +_0200F8E0: + bl ReadData + adds r1, r7, #4 + ldrb r2, [r1] + ldr r3, [r7] + adds r1, r2, r3 + adds r2, r1, #4 + strb r0, [r2] + adds r1, r7, #4 + adds r0, r7, #4 + adds r1, r7, #4 + ldrb r2, [r1] + adds r1, r2, #1 + adds r2, r1, #0 + strb r2, [r0] + b _0200F8CA +_0200F900: + ldr r1, [r7] + adds r0, r1, #4 + ldr r2, [r7] + adds r1, r2, #4 + ldrb r2, [r1] + movs r3, #0x7f + adds r1, r2, #0 + ands r1, r3 + adds r2, r1, #0 + strb r2, [r0] + ldr r0, =0x080000C4 + movs r1, #1 + strh r1, [r0] + ldr r0, =0x080000C4 + movs r1, #1 + strh r1, [r0] + ldr r0, =gUnknown_020213B2 + movs r1, #0 + strb r1, [r0] + movs r0, #1 + b _0200F934 + .align 2, 0 + .pool +_0200F934: + add sp, #8 + pop {r7} + pop {r1} + bx r1 + + thumb_func_start SiiRtcSetTime +SiiRtcSetTime: @ 0x0200F93C + push {r7, lr} + sub sp, #8 + mov r7, sp + str r0, [r7] + ldr r0, =gUnknown_020213B2 + ldrb r1, [r0] + cmp r1, #1 + bne _0200F954 + movs r0, #0 + b _0200F9D0 + .align 2, 0 + .pool +_0200F954: + ldr r0, =gUnknown_020213B2 + movs r1, #1 + strb r1, [r0] + ldr r0, =0x080000C4 + movs r1, #1 + strh r1, [r0] + ldr r0, =0x080000C4 + movs r1, #5 + strh r1, [r0] + ldr r0, =0x080000C6 + movs r1, #7 + strh r1, [r0] + movs r0, #0x66 + bl WriteCommand + adds r0, r7, #4 + movs r1, #0 + strb r1, [r0] +_0200F978: + adds r0, r7, #4 + ldrb r1, [r0] + cmp r1, #2 + bls _0200F990 + b _0200F9B2 + .align 2, 0 + .pool +_0200F990: + adds r0, r7, #4 + ldrb r1, [r0] + ldr r2, [r7] + adds r0, r1, r2 + adds r1, r0, #4 + ldrb r2, [r1] + adds r0, r2, #0 + bl WriteData + adds r1, r7, #4 + adds r0, r7, #4 + adds r1, r7, #4 + ldrb r2, [r1] + adds r1, r2, #1 + adds r2, r1, #0 + strb r2, [r0] + b _0200F978 +_0200F9B2: + ldr r0, =0x080000C4 + movs r1, #1 + strh r1, [r0] + ldr r0, =0x080000C4 + movs r1, #1 + strh r1, [r0] + ldr r0, =gUnknown_020213B2 + movs r1, #0 + strb r1, [r0] + movs r0, #1 + b _0200F9D0 + .align 2, 0 + .pool +_0200F9D0: + add sp, #8 + pop {r7} + pop {r1} + bx r1 + + thumb_func_start SiiRtcSetAlarm +SiiRtcSetAlarm: @ 0x0200F9D8 + push {r4, r7, lr} + sub sp, #0xc + mov r7, sp + str r0, [r7] + ldr r0, =gUnknown_020213B2 + ldrb r1, [r0] + cmp r1, #1 + bne _0200F9F0 + movs r0, #0 + b _0200FB04 + .align 2, 0 + .pool +_0200F9F0: + ldr r0, =gUnknown_020213B2 + movs r1, #1 + strb r1, [r0] + adds r0, r7, #0 + adds r0, #8 + ldr r1, [r7] + ldrb r2, [r1, #8] + movs r3, #0xf + adds r1, r2, #0 + ands r1, r3 + ldr r2, [r7] + ldrb r3, [r2, #8] + lsrs r2, r3, #4 + adds r3, r2, #0 + movs r4, #0xf + adds r2, r3, #0 + ands r2, r4 + adds r4, r2, #0 + lsls r3, r4, #0x18 + lsrs r2, r3, #0x18 + adds r4, r2, #0 + lsls r3, r4, #2 + adds r3, r3, r2 + lsls r2, r3, #1 + adds r1, r1, r2 + ldrb r2, [r0] + movs r3, #0 + ands r2, r3 + adds r3, r2, #0 + adds r2, r3, #0 + orrs r2, r1 + adds r1, r2, #0 + strb r1, [r0] + adds r0, r7, #0 + adds r0, #8 + ldrb r1, [r0] + cmp r1, #0xb + bhi _0200FA5C + adds r0, r7, #0 + adds r0, #8 + ldr r1, [r7] + ldrb r2, [r0] + movs r3, #0 + ands r2, r3 + adds r3, r2, #0 + ldrb r1, [r1, #8] + adds r2, r3, #0 + orrs r2, r1 + adds r1, r2, #0 + strb r1, [r0] + b _0200FA7A + .align 2, 0 + .pool +_0200FA5C: + adds r0, r7, #0 + adds r0, #8 + ldr r1, [r7] + ldrb r2, [r1, #8] + movs r3, #0x80 + adds r1, r2, #0 + orrs r1, r3 + ldrb r2, [r0] + movs r3, #0 + ands r2, r3 + adds r3, r2, #0 + adds r2, r3, #0 + orrs r2, r1 + adds r1, r2, #0 + strb r1, [r0] +_0200FA7A: + adds r0, r7, #0 + adds r0, #8 + ldr r1, [r7] + ldrb r2, [r0, #1] + movs r3, #0 + ands r2, r3 + adds r3, r2, #0 + ldrb r1, [r1, #9] + adds r2, r3, #0 + orrs r2, r1 + adds r1, r2, #0 + strb r1, [r0, #1] + ldr r0, =0x080000C4 + movs r1, #1 + strh r1, [r0] + ldr r0, =0x080000C4 + movs r1, #5 + strh r1, [r0] + ldr r0, =0x080000C6 + movs r1, #7 + strh r1, [r0] + movs r0, #0x68 + bl WriteCommand + adds r0, r7, #4 + movs r1, #0 + strb r1, [r0] +_0200FAB0: + adds r0, r7, #4 + ldrb r1, [r0] + cmp r1, #1 + bls _0200FAC4 + b _0200FAE6 + .align 2, 0 + .pool +_0200FAC4: + adds r0, r7, #0 + adds r0, #8 + adds r1, r7, #4 + ldrb r2, [r1] + adds r0, r0, r2 + ldrb r1, [r0] + adds r0, r1, #0 + bl WriteData + adds r1, r7, #4 + adds r0, r7, #4 + adds r1, r7, #4 + ldrb r2, [r1] + adds r1, r2, #1 + adds r2, r1, #0 + strb r2, [r0] + b _0200FAB0 +_0200FAE6: + ldr r0, =0x080000C4 + movs r1, #1 + strh r1, [r0] + ldr r0, =0x080000C4 + movs r1, #1 + strh r1, [r0] + ldr r0, =gUnknown_020213B2 + movs r1, #0 + strb r1, [r0] + movs r0, #1 + b _0200FB04 + .align 2, 0 + .pool +_0200FB04: + add sp, #0xc + pop {r4, r7} + pop {r1} + bx r1 + + thumb_func_start WriteCommand +WriteCommand: @ 0x0200FB0C + push {r4, r5, r7, lr} + sub sp, #4 + mov r7, sp + adds r1, r0, #0 + adds r2, r7, #0 + strb r1, [r2] + adds r1, r7, #1 + movs r2, #0 + strb r2, [r1] +_0200FB1E: + adds r1, r7, #1 + ldrb r2, [r1] + cmp r2, #7 + bls _0200FB28 + b _0200FBA8 +_0200FB28: + adds r1, r7, #2 + adds r3, r7, #0 + ldrb r2, [r3] + adds r3, r7, #1 + ldrb r4, [r3] + movs r5, #7 + subs r3, r5, r4 + asrs r2, r3 + adds r3, r2, #0 + movs r4, #1 + adds r2, r3, #0 + ands r2, r4 + adds r3, r2, #0 + strb r3, [r1] + ldr r1, =0x080000C4 + adds r2, r7, #2 + ldrb r3, [r2] + adds r2, r3, #0 + lsls r3, r2, #1 + adds r2, r3, #0 + movs r3, #4 + orrs r2, r3 + adds r3, r2, #0 + strh r3, [r1] + ldr r1, =0x080000C4 + adds r2, r7, #2 + ldrb r3, [r2] + adds r2, r3, #0 + lsls r3, r2, #1 + adds r2, r3, #0 + movs r3, #4 + orrs r2, r3 + adds r3, r2, #0 + strh r3, [r1] + ldr r1, =0x080000C4 + adds r2, r7, #2 + ldrb r3, [r2] + adds r2, r3, #0 + lsls r3, r2, #1 + adds r2, r3, #0 + movs r3, #4 + orrs r2, r3 + adds r3, r2, #0 + strh r3, [r1] + ldr r1, =0x080000C4 + adds r2, r7, #2 + ldrb r3, [r2] + adds r2, r3, #0 + lsls r3, r2, #1 + adds r2, r3, #0 + movs r3, #5 + orrs r2, r3 + adds r3, r2, #0 + strh r3, [r1] + adds r2, r7, #1 + adds r1, r7, #1 + adds r2, r7, #1 + ldrb r3, [r2] + adds r2, r3, #1 + adds r3, r2, #0 + strb r3, [r1] + b _0200FB1E + .align 2, 0 + .pool +_0200FBA8: + add sp, #4 + pop {r4, r5, r7} + pop {r1} + bx r1 + + thumb_func_start WriteData +WriteData: @ 0x0200FBB0 + push {r4, r7, lr} + sub sp, #4 + mov r7, sp + adds r1, r0, #0 + adds r2, r7, #0 + strb r1, [r2] + adds r1, r7, #1 + movs r2, #0 + strb r2, [r1] +_0200FBC2: + adds r1, r7, #1 + ldrb r2, [r1] + cmp r2, #7 + bls _0200FBCC + b _0200FC48 +_0200FBCC: + adds r1, r7, #2 + adds r3, r7, #0 + ldrb r2, [r3] + adds r3, r7, #1 + ldrb r4, [r3] + asrs r2, r4 + adds r3, r2, #0 + movs r4, #1 + adds r2, r3, #0 + ands r2, r4 + adds r3, r2, #0 + strb r3, [r1] + ldr r1, =0x080000C4 + adds r2, r7, #2 + ldrb r3, [r2] + adds r2, r3, #0 + lsls r3, r2, #1 + adds r2, r3, #0 + movs r3, #4 + orrs r2, r3 + adds r3, r2, #0 + strh r3, [r1] + ldr r1, =0x080000C4 + adds r2, r7, #2 + ldrb r3, [r2] + adds r2, r3, #0 + lsls r3, r2, #1 + adds r2, r3, #0 + movs r3, #4 + orrs r2, r3 + adds r3, r2, #0 + strh r3, [r1] + ldr r1, =0x080000C4 + adds r2, r7, #2 + ldrb r3, [r2] + adds r2, r3, #0 + lsls r3, r2, #1 + adds r2, r3, #0 + movs r3, #4 + orrs r2, r3 + adds r3, r2, #0 + strh r3, [r1] + ldr r1, =0x080000C4 + adds r2, r7, #2 + ldrb r3, [r2] + adds r2, r3, #0 + lsls r3, r2, #1 + adds r2, r3, #0 + movs r3, #5 + orrs r2, r3 + adds r3, r2, #0 + strh r3, [r1] + adds r2, r7, #1 + adds r1, r7, #1 + adds r2, r7, #1 + ldrb r3, [r2] + adds r2, r3, #1 + adds r3, r2, #0 + strb r3, [r1] + b _0200FBC2 + .align 2, 0 + .pool +_0200FC48: + add sp, #4 + pop {r4, r7} + pop {r1} + bx r1 + + thumb_func_start ReadData +ReadData: @ 0x0200FC50 + push {r7, lr} + sub sp, #4 + mov r7, sp + adds r0, r7, #0 + movs r1, #0 + strb r1, [r0] +_0200FC5C: + adds r0, r7, #0 + ldrb r1, [r0] + cmp r1, #7 + bls _0200FC66 + b _0200FCCC +_0200FC66: + ldr r0, =0x080000C4 + movs r1, #4 + strh r1, [r0] + ldr r0, =0x080000C4 + movs r1, #4 + strh r1, [r0] + ldr r0, =0x080000C4 + movs r1, #4 + strh r1, [r0] + ldr r0, =0x080000C4 + movs r1, #4 + strh r1, [r0] + ldr r0, =0x080000C4 + movs r1, #4 + strh r1, [r0] + ldr r0, =0x080000C4 + movs r1, #5 + strh r1, [r0] + adds r0, r7, #1 + ldr r1, =0x080000C4 + ldrh r2, [r1] + movs r3, #2 + adds r1, r2, #0 + ands r1, r3 + adds r3, r1, #0 + lsls r2, r3, #0x10 + lsrs r1, r2, #0x10 + lsrs r2, r1, #1 + adds r1, r2, #0 + strb r1, [r0] + adds r0, r7, #2 + adds r1, r7, #2 + ldrb r2, [r1] + lsrs r1, r2, #1 + adds r2, r7, #1 + ldrb r3, [r2] + lsls r2, r3, #7 + orrs r1, r2 + adds r2, r1, #0 + strb r2, [r0] + adds r1, r7, #0 + adds r0, r7, #0 + adds r1, r7, #0 + ldrb r2, [r1] + adds r1, r2, #1 + adds r2, r1, #0 + strb r2, [r0] + b _0200FC5C + .align 2, 0 + .pool +_0200FCCC: + adds r0, r7, #2 + ldrb r1, [r0] + adds r0, r1, #0 + b _0200FCD4 +_0200FCD4: + add sp, #4 + pop {r7} + pop {r1} + bx r1 + + thumb_func_start EnableGpioPortRead +EnableGpioPortRead: @ 0x0200FCDC + push {r7, lr} + mov r7, sp + ldr r0, =0x080000C8 + movs r1, #1 + strh r1, [r0] + pop {r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start DisableGpioPortRead +DisableGpioPortRead: @ 0x0200FCF0 + push {r7, lr} + mov r7, sp + ldr r0, =0x080000C8 + movs r1, #0 + strh r1, [r0] + pop {r7} + pop {r0} + bx r0 + .align 2, 0 + .pool diff --git a/asm/unk_200E344.s b/asm/unk_200E344.s new file mode 100644 index 0000000..7b54eec --- /dev/null +++ b/asm/unk_200E344.s @@ -0,0 +1,2272 @@ + .include "asm/macros/function.inc" + .text + .syntax unified + + thumb_func_start sub_0200E344 +sub_0200E344: @ 0x0200E344 + push {r7, lr} + sub sp, #0x10 + mov r7, sp + str r0, [r7] + str r1, [r7, #4] + str r2, [r7, #8] + movs r0, #0 + str r0, [r7, #0xc] +_0200E354: + ldr r0, [r7, #0xc] + ldr r1, [r7, #8] + cmp r0, r1 + blo _0200E35E + b _0200E37E +_0200E35E: + ldr r0, [r7] + ldr r1, [r7, #0xc] + adds r0, r0, r1 + ldr r1, [r7, #4] + ldr r2, [r7, #0xc] + adds r1, r1, r2 + ldrb r0, [r0] + ldrb r1, [r1] + cmp r0, r1 + beq _0200E376 + movs r0, #0 + b _0200E382 +_0200E376: + ldr r0, [r7, #0xc] + adds r1, r0, #1 + str r1, [r7, #0xc] + b _0200E354 +_0200E37E: + movs r0, #1 + b _0200E382 +_0200E382: + add sp, #0x10 + pop {r7} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200E38C +sub_0200E38C: @ 0x0200E38C + push {r7, lr} + sub sp, #0x10 + mov r7, sp + ldr r0, =0x080000AF + ldrb r1, [r0] + str r1, [r7, #8] + ldr r0, =0x080000BC + ldrb r1, [r0] + str r1, [r7, #0xc] + movs r0, #1 + rsbs r0, r0, #0 + str r0, [r7, #4] + movs r0, #0 + str r0, [r7] +_0200E3A8: + ldr r0, [r7] + cmp r0, #5 + bls _0200E3B8 + b _0200E3FE + .align 2, 0 + .pool +_0200E3B8: + ldr r0, =gUnknown_0201F298 + ldr r1, [r7] + adds r2, r1, #0 + lsls r1, r2, #1 + adds r0, r0, r1 + ldrb r1, [r0] + ldr r0, [r7, #8] + cmp r0, r1 + beq _0200E3D0 + b _0200E3F6 + .align 2, 0 + .pool +_0200E3D0: + ldr r0, =gUnknown_0201F298 + ldr r1, [r7] + adds r2, r1, #0 + lsls r1, r2, #1 + adds r0, #1 + adds r1, r0, r1 + ldrb r0, [r1] + ldr r1, [r7, #0xc] + cmp r1, r0 + blt _0200E3F0 + movs r0, #0 + str r0, [r7, #4] + b _0200E3F4 + .align 2, 0 + .pool +_0200E3F0: + movs r0, #1 + str r0, [r7, #4] +_0200E3F4: + b _0200E3FE +_0200E3F6: + ldr r0, [r7] + adds r1, r0, #1 + str r1, [r7] + b _0200E3A8 +_0200E3FE: + ldr r0, [r7, #4] + movs r1, #1 + cmn r0, r1 + bne _0200E40A + movs r0, #6 + b _0200E470 +_0200E40A: + ldr r0, =0x080000A0 + ldr r1, =gUnknown_0201F2A4 + movs r2, #0xf + bl sub_0200E344 + cmp r0, #1 + bne _0200E43C + ldr r0, [r7, #4] + cmp r0, #0 + bne _0200E42E + movs r0, #5 + b _0200E470 + .align 2, 0 + .pool +_0200E42C: @ 0x0200E42C + b _0200E43C +_0200E42E: + ldr r0, =gUnknown_02025250 + movs r1, #2 + str r1, [r0] + movs r0, #3 + b _0200E470 + .align 2, 0 + .pool +_0200E43C: + ldr r0, =0x080000A0 + ldr r1, =gUnknown_0201F2B4 + movs r2, #0xf + bl sub_0200E344 + cmp r0, #1 + bne _0200E46C + ldr r0, [r7, #4] + cmp r0, #0 + bne _0200E45E + movs r0, #4 + b _0200E470 + .align 2, 0 + .pool +_0200E45C: @ 0x0200E45C + b _0200E46C +_0200E45E: + ldr r0, =gUnknown_02025250 + movs r1, #1 + str r1, [r0] + movs r0, #2 + b _0200E470 + .align 2, 0 + .pool +_0200E46C: + movs r0, #6 + b _0200E470 +_0200E470: + add sp, #0x10 + pop {r7} + pop {r1} + bx r1 + + thumb_func_start sub_0200E478 +sub_0200E478: @ 0x0200E478 + push {r7, lr} + mov r7, sp + ldr r0, =0x080000B0 + ldrb r1, [r0] + cmp r1, #0x30 + beq _0200E48C + movs r0, #6 + b _0200E4B6 + .align 2, 0 + .pool +_0200E48C: + ldr r0, =0x080000B1 + ldrb r1, [r0] + cmp r1, #0x31 + beq _0200E49C + movs r0, #6 + b _0200E4B6 + .align 2, 0 + .pool +_0200E49C: + ldr r0, =0x080000B2 + ldrb r1, [r0] + cmp r1, #0x96 + beq _0200E4AC + movs r0, #6 + b _0200E4B6 + .align 2, 0 + .pool +_0200E4AC: + bl sub_0200E38C + adds r1, r0, #0 + adds r0, r1, #0 + b _0200E4B6 +_0200E4B6: + pop {r7} + pop {r1} + bx r1 + + thumb_func_start sub_0200E4BC +sub_0200E4BC: @ 0x0200E4BC + push {r7, lr} + sub sp, #0x14 + mov r7, sp + str r0, [r7] + str r1, [r7, #4] + str r2, [r7, #8] + ldr r0, [r7] + ldr r1, [r0] + cmp r1, #0xb + bls _0200E4D2 + b _0200E66A +_0200E4D2: + ldr r0, [r0] + adds r1, r0, #0 + lsls r0, r1, #2 + ldr r1, =_0200E4E4 + adds r0, r0, r1 + ldr r1, [r0] + mov pc, r1 + .align 2, 0 + .pool +_0200E4E4: @ jump table + .4byte _0200E514 @ case 0 + .4byte _0200E578 @ case 1 + .4byte _0200E596 @ case 2 + .4byte _0200E5A4 @ case 3 + .4byte _0200E5B2 @ case 4 + .4byte _0200E600 @ case 5 + .4byte _0200E664 @ case 6 + .4byte _0200E664 @ case 7 + .4byte _0200E65C @ case 8 + .4byte _0200E61C @ case 9 + .4byte _0200E634 @ case 10 + .4byte _0200E668 @ case 11 +_0200E514: + ldr r0, =gUnknown_02021380 + movs r1, #0 + str r1, [r0] + ldr r0, =gUnknown_0202524C + movs r1, #0 + str r1, [r0] + bl sub_0200E478 + str r0, [r7, #0x10] + ldr r1, [r7, #0x10] + subs r0, r1, #2 + cmp r0, #4 + bhi _0200E576 + lsls r1, r0, #2 + ldr r2, =_0200E544 + adds r0, r1, r2 + ldr r1, [r0] + mov pc, r1 + .align 2, 0 + .pool +_0200E544: @ jump table + .4byte _0200E568 @ case 0 + .4byte _0200E568 @ case 1 + .4byte _0200E560 @ case 2 + .4byte _0200E560 @ case 3 + .4byte _0200E558 @ case 4 +_0200E558: + ldr r0, [r7] + movs r1, #0xb + str r1, [r0] + b _0200E576 +_0200E560: + ldr r0, [r7] + movs r1, #6 + str r1, [r0] + b _0200E576 +_0200E568: + ldr r1, [r7] + ldr r0, [r7] + ldr r1, [r7] + ldr r2, [r1] + adds r1, r2, #1 + str r1, [r0] + b _0200E576 +_0200E576: + b _0200E66A +_0200E578: + bl sub_0200E674 + cmp r0, #0 + bne _0200E588 + ldr r0, [r7] + movs r1, #0xb + str r1, [r0] + b _0200E594 +_0200E588: + ldr r1, [r7] + ldr r0, [r7] + ldr r1, [r7] + ldr r2, [r1] + adds r1, r2, #1 + str r1, [r0] +_0200E594: + b _0200E66A +_0200E596: + ldr r1, [r7] + ldr r0, [r7] + ldr r1, [r7] + ldr r2, [r1] + adds r1, r2, #1 + str r1, [r0] + b _0200E66A +_0200E5A4: + ldr r1, [r7] + ldr r0, [r7] + ldr r1, [r7] + ldr r2, [r1] + adds r1, r2, #1 + str r1, [r0] + b _0200E66A +_0200E5B2: + adds r1, r7, #0 + adds r1, #0xc + adds r0, r1, #0 + bl sub_0200E6D0 + cmp r0, #1 + bne _0200E5E0 + adds r0, r7, #0 + adds r0, #0xc + ldrb r1, [r0] + cmp r1, #0 + bne _0200E5D8 + ldr r1, [r7] + ldr r0, [r7] + ldr r1, [r7] + ldr r2, [r1] + adds r1, r2, #1 + str r1, [r0] + b _0200E5DE +_0200E5D8: + ldr r0, [r7] + movs r1, #9 + str r1, [r0] +_0200E5DE: + b _0200E5FE +_0200E5E0: + adds r0, r7, #0 + adds r0, #0xc + ldrb r1, [r0] + cmp r1, #1 + beq _0200E5F2 + ldr r0, [r7] + movs r1, #7 + str r1, [r0] + b _0200E5FE +_0200E5F2: + ldr r1, [r7] + ldr r0, [r7] + ldr r1, [r7] + ldr r2, [r1] + adds r1, r2, #1 + str r1, [r0] +_0200E5FE: + b _0200E66A +_0200E600: + bl sub_0200E934 + ldr r0, =gUnknown_0202524C + ldr r1, =gUnknown_0202524C + ldr r2, [r1] + movs r1, #1 + orrs r2, r1 + str r2, [r0] + ldr r0, [r7] + movs r1, #9 + str r1, [r0] + b _0200E66A + .align 2, 0 + .pool +_0200E61C: + bl sub_0200F3A0 + cmp r0, #1 + bne _0200E62C + ldr r0, [r7] + movs r1, #8 + str r1, [r0] + b _0200E632 +_0200E62C: + ldr r0, [r7] + movs r1, #0xa + str r1, [r0] +_0200E632: + b _0200E66A +_0200E634: + bl sub_0200F3E4 + cmp r0, #1 + bne _0200E654 + ldr r0, =gUnknown_0202524C + ldr r1, =gUnknown_0202524C + ldr r2, [r1] + movs r1, #1 + orrs r2, r1 + str r2, [r0] + ldr r0, [r7] + movs r1, #8 + str r1, [r0] + b _0200E65A + .align 2, 0 + .pool +_0200E654: + ldr r0, [r7] + movs r1, #0xb + str r1, [r0] +_0200E65A: + b _0200E66A +_0200E65C: + ldr r0, [r7] + movs r1, #6 + str r1, [r0] + b _0200E66A +_0200E664: + b _0200E66A +_0200E666: @ 0x0200E666 + b _0200E66A +_0200E668: + b _0200E66A +_0200E66A: + add sp, #0x14 + pop {r7} + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start sub_0200E674 +sub_0200E674: @ 0x0200E674 + push {r7, lr} + mov r7, sp + bl sub_0200ED5C + bl sub_0200EDEC + movs r1, #0xff + lsls r1, r1, #4 + ands r0, r1 + adds r2, r0, #0 + lsls r1, r2, #0x10 + lsrs r0, r1, #0x10 + cmp r0, #0 + beq _0200E696 + movs r0, #0 + b _0200E69A +_0200E694: @ 0x0200E694 + b _0200E69A +_0200E696: + movs r0, #1 + b _0200E69A +_0200E69A: + pop {r7} + pop {r1} + bx r1 + + thumb_func_start sub_0200E6A0 +sub_0200E6A0: @ 0x0200E6A0 + push {r7, lr} + sub sp, #8 + mov r7, sp + str r0, [r7] + adds r0, r7, #4 + ldr r1, =0x04000208 + ldrh r2, [r1] + strh r2, [r0] + ldr r0, =0x04000208 + movs r1, #0 + strh r1, [r0] + ldr r0, [r7] + bl SiiRtcSetDateTime + ldr r0, =0x04000208 + adds r1, r7, #4 + ldrh r2, [r1] + strh r2, [r0] + add sp, #8 + pop {r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200E6D0 +sub_0200E6D0: @ 0x0200E6D0 + push {r7, lr} + sub sp, #8 + mov r7, sp + str r0, [r7] + ldr r1, =gUnknown_02021388 + adds r0, r1, #0 + bl sub_0200EE84 + ldr r0, =gUnknown_02021388 + ldrb r1, [r0] + adds r0, r1, #0 + bl sub_0200EB5C + ldr r1, [r7] + strb r0, [r1] + ldr r0, =gUnknown_02021388 + ldr r1, =gUnknown_02025260 + ldr r2, =gUnknown_02022ED8 + ldr r3, [r2] + adds r2, r3, #0 + adds r2, #0x98 + bl sub_0200F080 + ldr r0, =gUnknown_02025258 + ldr r1, =gUnknown_02022ED8 + ldr r2, [r1] + adds r1, r2, #0 + adds r1, #0xa0 + ldr r2, =gUnknown_02025260 + bl sub_0200F1E4 + ldr r1, =gUnknown_02025258 + movs r2, #0 + ldrsh r0, [r1, r2] + adds r1, r0, #0 + lsls r2, r1, #1 + adds r2, r2, r0 + lsls r1, r2, #4 + subs r1, r1, r2 + lsls r0, r1, #5 + ldr r2, =gUnknown_02025258 + movs r1, #2 + ldrsb r1, [r2, r1] + adds r3, r1, #0 + lsls r2, r3, #4 + subs r2, r2, r1 + lsls r1, r2, #2 + adds r0, r0, r1 + ldr r1, =gUnknown_02025258 + movs r2, #3 + ldrsb r2, [r1, r2] + adds r0, r0, r2 + str r0, [r7, #4] + ldr r0, [r7, #4] + cmp r0, #0 + blt _0200E756 + movs r0, #1 + b _0200E75A + .align 2, 0 + .pool +_0200E754: @ 0x0200E754 + b _0200E75A +_0200E756: + movs r0, #0 + b _0200E75A +_0200E75A: + add sp, #8 + pop {r7} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200E764 +sub_0200E764: @ 0x0200E764 + push {r7, lr} + sub sp, #8 + mov r7, sp + adds r1, r7, #0 + strb r0, [r1] + movs r0, #0 + str r0, [r7, #4] + adds r0, r7, #0 + ldrb r1, [r0] + cmp r1, #0x63 + bls _0200E77E + movs r0, #0xff + b _0200E7A6 +_0200E77E: + adds r0, r7, #0 + ldrb r1, [r0] + adds r0, r1, #0 + movs r1, #0xa + bl Div + lsls r1, r0, #4 + str r1, [r7, #4] + adds r0, r7, #0 + ldrb r1, [r0] + adds r0, r1, #0 + movs r1, #0xa + bl Mod + ldr r1, [r7, #4] + orrs r0, r1 + str r0, [r7, #4] + ldr r1, [r7, #4] + adds r0, r1, #0 + b _0200E7A6 +_0200E7A6: + add sp, #8 + pop {r7} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200E7B0 +sub_0200E7B0: @ 0x0200E7B0 + push {r7, lr} + sub sp, #4 + mov r7, sp + str r0, [r7] + ldr r0, [r7] + ldrb r1, [r0] + adds r0, r1, #0 + bl sub_0200EB5C + adds r1, r0, #0 + adds r0, r1, #1 + adds r1, r0, #0 + lsls r0, r1, #0x18 + lsrs r1, r0, #0x18 + adds r0, r1, #0 + bl sub_0200E764 + ldr r1, [r7] + strb r0, [r1] + add sp, #4 + pop {r7} + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start sub_0200E7E0 +sub_0200E7E0: @ 0x0200E7E0 + push {r7, lr} + sub sp, #4 + mov r7, sp + str r0, [r7] + ldr r0, [r7] + adds r1, r0, #1 + adds r0, r1, #0 + bl sub_0200E7B0 + ldr r0, [r7] + ldrb r1, [r0, #1] + adds r0, r1, #0 + bl sub_0200EB5C + cmp r0, #0xc + bgt _0200E802 + b _0200E81C +_0200E802: + ldr r0, [r7] + bl sub_0200E7B0 + ldr r0, [r7] + ldrb r1, [r0, #1] + movs r2, #0 + ands r1, r2 + adds r2, r1, #0 + movs r3, #1 + adds r1, r2, #0 + orrs r1, r3 + adds r2, r1, #0 + strb r2, [r0, #1] +_0200E81C: + add sp, #4 + pop {r7} + pop {r0} + bx r0 + + thumb_func_start sub_0200E824 +sub_0200E824: @ 0x0200E824 + push {r4, r5, r7, lr} + sub sp, #4 + mov r7, sp + str r0, [r7] + ldr r0, [r7] + adds r1, r0, #2 + adds r0, r1, #0 + bl sub_0200E7B0 + ldr r0, [r7] + ldrb r1, [r0, #2] + adds r0, r1, #0 + bl sub_0200EB5C + adds r4, r0, #0 + ldr r5, =gUnknown_0201F318 + ldr r0, [r7] + ldrb r1, [r0, #1] + adds r0, r1, #0 + bl sub_0200EB5C + subs r1, r0, #1 + adds r0, r1, #0 + lsls r1, r0, #2 + adds r0, r5, r1 + ldr r1, [r0] + cmp r4, r1 + bgt _0200E864 + b _0200E8BA + .align 2, 0 + .pool +_0200E864: + ldr r0, [r7] + ldrb r1, [r0] + adds r0, r1, #0 + bl sub_0200EB5C + adds r1, r0, #0 + lsls r0, r1, #0x18 + lsrs r1, r0, #0x18 + adds r0, r1, #0 + bl sub_0200EBC4 + lsls r1, r0, #0x18 + lsrs r0, r1, #0x18 + cmp r0, #0 + beq _0200E8A0 + ldr r0, [r7] + ldrb r1, [r0, #1] + adds r0, r1, #0 + bl sub_0200EB5C + cmp r0, #2 + bne _0200E8A0 + ldr r0, [r7] + ldrb r1, [r0, #2] + adds r0, r1, #0 + bl sub_0200EB5C + cmp r0, #0x1d + bne _0200E8A0 + b _0200E8BA +_0200E8A0: + ldr r0, [r7] + ldrb r1, [r0, #2] + movs r2, #0 + ands r1, r2 + adds r2, r1, #0 + movs r3, #1 + adds r1, r2, #0 + orrs r1, r3 + adds r2, r1, #0 + strb r2, [r0, #2] + ldr r0, [r7] + bl sub_0200E7E0 +_0200E8BA: + add sp, #4 + pop {r4, r5, r7} + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start sub_0200E8C4 +sub_0200E8C4: @ 0x0200E8C4 + push {r7, lr} + sub sp, #4 + mov r7, sp + str r0, [r7] + ldr r0, [r7] + ldrb r1, [r0] + adds r0, r1, #0 + bl sub_0200EB5C + cmp r0, #0 + bne _0200E914 + ldr r0, [r7] + ldrb r1, [r0, #1] + adds r0, r1, #0 + bl sub_0200EB5C + cmp r0, #1 + bne _0200E8EC + movs r0, #0 + b _0200E92A +_0200E8EC: + ldr r0, [r7] + ldrb r1, [r0, #1] + adds r0, r1, #0 + bl sub_0200EB5C + cmp r0, #2 + ble _0200E8FE + movs r0, #1 + b _0200E92A +_0200E8FE: + ldr r0, [r7] + ldrb r1, [r0, #2] + adds r0, r1, #0 + bl sub_0200EB5C + cmp r0, #0x1d + bne _0200E910 + movs r0, #1 + b _0200E92A +_0200E910: + movs r0, #0 + b _0200E92A +_0200E914: + ldr r0, [r7] + ldrb r1, [r0] + adds r0, r1, #0 + bl sub_0200EB5C + cmp r0, #1 + bne _0200E926 + movs r0, #1 + b _0200E92A +_0200E926: + movs r0, #0 + b _0200E92A +_0200E92A: + add sp, #4 + pop {r7} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200E934 +sub_0200E934: @ 0x0200E934 + push {r7, lr} + mov r7, sp + ldr r1, =gUnknown_02021388 + adds r0, r1, #0 + bl sub_0200EE84 + ldr r0, =gUnknown_02021388 + ldrb r1, [r0] + adds r0, r1, #0 + bl sub_0200EB5C + cmp r0, #0 + beq _0200E964 + ldr r0, =gUnknown_02021388 + ldrb r1, [r0] + adds r0, r1, #0 + bl sub_0200EB5C + cmp r0, #1 + beq _0200E964 + b _0200E9F0 + .align 2, 0 + .pool +_0200E964: + ldr r0, =gUnknown_02021388 + ldrb r1, [r0] + adds r0, r1, #0 + bl sub_0200EB5C + cmp r0, #1 + bne _0200E9BC + ldr r0, =gUnknown_02021388 + ldrb r1, [r0] + movs r2, #0 + ands r1, r2 + adds r2, r1, #0 + movs r3, #2 + adds r1, r2, #0 + orrs r1, r3 + adds r2, r1, #0 + strb r2, [r0] + ldr r0, =gUnknown_02021388 + ldrb r1, [r0, #1] + movs r2, #0 + ands r1, r2 + adds r2, r1, #0 + movs r3, #1 + adds r1, r2, #0 + orrs r1, r3 + adds r2, r1, #0 + strb r2, [r0, #1] + ldr r0, =gUnknown_02021388 + ldrb r1, [r0, #2] + movs r2, #0 + ands r1, r2 + adds r2, r1, #0 + movs r3, #2 + adds r1, r2, #0 + orrs r1, r3 + adds r2, r1, #0 + strb r2, [r0, #2] + ldr r1, =gUnknown_02021388 + adds r0, r1, #0 + bl sub_0200E6A0 + b _0200E9F0 + .align 2, 0 + .pool +_0200E9BC: + ldr r1, =gUnknown_02021388 + adds r0, r1, #0 + bl sub_0200E8C4 + cmp r0, #1 + bne _0200E9E0 + ldr r1, =gUnknown_02021388 + adds r0, r1, #0 + bl sub_0200E824 + ldr r1, =gUnknown_02021388 + adds r0, r1, #0 + bl sub_0200E7B0 + b _0200E9E8 + .align 2, 0 + .pool +_0200E9E0: + ldr r1, =gUnknown_02021388 + adds r0, r1, #0 + bl sub_0200E7B0 +_0200E9E8: + ldr r1, =gUnknown_02021388 + adds r0, r1, #0 + bl sub_0200E6A0 +_0200E9F0: + pop {r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200E9FC +sub_0200E9FC: @ 0x0200E9FC + push {r7, lr} + sub sp, #8 + mov r7, sp + str r0, [r7] + adds r0, r1, #0 + adds r1, r7, #4 + strb r0, [r1] + ldr r0, [r7] + adds r1, r7, #4 + ldrb r2, [r1] + movs r3, #0xf0 + adds r1, r2, #0 + ands r1, r3 + adds r3, r1, #0 + lsls r2, r3, #0x18 + lsrs r1, r2, #0x18 + lsrs r2, r1, #4 + adds r1, r2, #0 + adds r2, r1, #0 + adds r2, #0x30 + adds r1, r2, #0 + strb r1, [r0] + ldr r0, [r7] + adds r1, r0, #1 + str r1, [r7] + ldr r0, [r7] + adds r1, r7, #4 + ldrb r2, [r1] + movs r3, #0xf + adds r1, r2, #0 + ands r1, r3 + adds r2, r1, #0 + adds r1, r2, #0 + adds r1, #0x30 + adds r2, r1, #0 + strb r2, [r0] + ldr r0, [r7] + adds r1, r0, #1 + str r1, [r7] + ldr r0, [r7] + movs r1, #0 + strb r1, [r0] + ldr r1, [r7] + adds r0, r1, #0 + b _0200EA56 +_0200EA56: + add sp, #8 + pop {r7} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200EA60 +sub_0200EA60: @ 0x0200EA60 + push {r7, lr} + sub sp, #4 + mov r7, sp + str r0, [r7] + ldr r0, =gUnknown_02025250 + ldr r1, [r0] + cmp r1, #1 + beq _0200EA80 + ldr r0, =gUnknown_02025250 + ldr r1, [r0] + cmp r1, #2 + beq _0200EA80 + b _0200EA88 + .align 2, 0 + .pool +_0200EA80: + ldr r1, =gUnknown_02021388 + adds r0, r1, #0 + bl sub_0200EE84 +_0200EA88: + ldr r0, =gUnknown_02021388 + ldrb r1, [r0] + ldr r0, [r7] + bl sub_0200E9FC + str r0, [r7] + ldr r0, [r7] + movs r1, #0x20 + strb r1, [r0] + adds r0, #1 + str r0, [r7] + ldr r0, =gUnknown_02021388 + ldrb r1, [r0, #1] + ldr r0, [r7] + bl sub_0200E9FC + str r0, [r7] + ldr r0, [r7] + movs r1, #0x20 + strb r1, [r0] + adds r0, #1 + str r0, [r7] + ldr r0, =gUnknown_02021388 + ldrb r1, [r0, #2] + ldr r0, [r7] + bl sub_0200E9FC + str r0, [r7] + ldr r0, [r7] + movs r1, #0x20 + strb r1, [r0] + adds r0, #1 + str r0, [r7] + ldr r0, =gUnknown_02021388 + ldrb r1, [r0, #4] + ldr r0, [r7] + bl sub_0200E9FC + str r0, [r7] + ldr r0, [r7] + movs r1, #0x3a + strb r1, [r0] + adds r0, #1 + str r0, [r7] + ldr r0, =gUnknown_02021388 + ldrb r1, [r0, #5] + ldr r0, [r7] + bl sub_0200E9FC + str r0, [r7] + ldr r0, [r7] + movs r1, #0x3a + strb r1, [r0] + adds r0, #1 + str r0, [r7] + ldr r0, =gUnknown_02021388 + ldrb r1, [r0, #6] + ldr r0, [r7] + bl sub_0200E9FC + str r0, [r7] + ldr r0, [r7] + movs r1, #0 + strb r1, [r0] + adds r0, #1 + str r0, [r7] + ldr r1, [r7] + adds r0, r1, #0 + b _0200EB18 + .align 2, 0 + .pool +_0200EB18: + add sp, #4 + pop {r7} + pop {r1} + bx r1 + + thumb_func_start sub_0200EB20 +sub_0200EB20: @ 0x0200EB20 + push {r7, lr} + mov r7, sp + ldr r0, =gUnknown_020213AE + ldr r1, =0x04000208 + ldrh r2, [r1] + strh r2, [r0] + ldr r0, =0x04000208 + movs r1, #0 + strh r1, [r0] + pop {r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200EB40 +sub_0200EB40: @ 0x0200EB40 + push {r7, lr} + mov r7, sp + ldr r0, =0x04000208 + ldr r1, =gUnknown_020213AE + ldrh r2, [r1] + strh r2, [r0] + pop {r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200EB5C +sub_0200EB5C: @ 0x0200EB5C + push {r4, r7, lr} + sub sp, #4 + mov r7, sp + adds r1, r7, #0 + strb r0, [r1] + adds r0, r7, #0 + ldrb r1, [r0] + cmp r1, #0x9f + bhi _0200EB84 + adds r0, r7, #0 + ldrb r1, [r0] + movs r2, #0xf + adds r0, r1, #0 + ands r0, r2 + adds r2, r0, #0 + lsls r1, r2, #0x18 + lsrs r0, r1, #0x18 + cmp r0, #9 + bhi _0200EB84 + b _0200EB88 +_0200EB84: + movs r0, #0xff + b _0200EBBA +_0200EB88: + adds r0, r7, #0 + ldrb r1, [r0] + lsrs r0, r1, #4 + adds r1, r0, #0 + movs r2, #0xf + adds r0, r1, #0 + ands r0, r2 + adds r1, r0, #0 + lsls r0, r1, #0x18 + lsrs r1, r0, #0x18 + adds r0, r1, #0 + lsls r2, r0, #2 + adds r2, r2, r1 + lsls r0, r2, #1 + adds r2, r7, #0 + ldrb r3, [r2] + movs r4, #0xf + adds r2, r3, #0 + ands r2, r4 + adds r4, r2, #0 + lsls r3, r4, #0x18 + lsrs r2, r3, #0x18 + adds r1, r0, r2 + adds r0, r1, #0 + b _0200EBBA +_0200EBBA: + add sp, #4 + pop {r4, r7} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200EBC4 +sub_0200EBC4: @ 0x0200EBC4 + push {r7, lr} + sub sp, #4 + mov r7, sp + adds r1, r7, #0 + strb r0, [r1] + adds r0, r7, #0 + ldrb r1, [r0] + movs r2, #3 + adds r0, r1, #0 + ands r0, r2 + adds r2, r0, #0 + lsls r1, r2, #0x18 + lsrs r0, r1, #0x18 + cmp r0, #0 + bne _0200EBFA + adds r0, r7, #0 + ldrb r1, [r0] + adds r0, r1, #0 + movs r1, #0x64 + bl __umodsi3 + adds r2, r0, #0 + lsls r1, r2, #0x18 + lsrs r0, r1, #0x18 + cmp r0, #0 + bne _0200EC0E + b _0200EBFA +_0200EBFA: + adds r0, r7, #0 + ldrb r1, [r0] + adds r0, r1, #0 + movs r1, #0xc8 + lsls r1, r1, #1 + bl __modsi3 + cmp r0, #0 + bne _0200EC14 + b _0200EC0E +_0200EC0E: + movs r0, #1 + b _0200EC18 +_0200EC12: @ 0x0200EC12 + b _0200EC18 +_0200EC14: + movs r0, #0 + b _0200EC18 +_0200EC18: + add sp, #4 + pop {r7} + pop {r1} + bx r1 + + thumb_func_start sub_0200EC20 +sub_0200EC20: @ 0x0200EC20 + push {r4, r7, lr} + sub sp, #0xc + mov r7, sp + adds r3, r0, #0 + adds r0, r2, #0 + adds r2, r7, #0 + strb r3, [r2] + adds r2, r7, #1 + strb r1, [r2] + adds r1, r7, #2 + strb r0, [r1] + adds r0, r7, #4 + movs r1, #0 + strh r1, [r0] + adds r0, r7, #0 + ldrb r1, [r0] + subs r0, r1, #1 + str r0, [r7, #8] +_0200EC44: + ldr r0, [r7, #8] + cmp r0, #0 + bgt _0200EC4C + b _0200EC8C +_0200EC4C: + adds r0, r7, #4 + adds r1, r7, #4 + ldrh r2, [r1] + ldr r3, =0x0000016D + adds r1, r2, r3 + adds r2, r1, #0 + strh r2, [r0] + ldr r1, [r7, #8] + adds r0, r1, #0 + lsls r2, r0, #0x18 + lsrs r1, r2, #0x18 + adds r0, r1, #0 + bl sub_0200EBC4 + lsls r1, r0, #0x18 + lsrs r0, r1, #0x18 + cmp r0, #1 + bne _0200EC7E + adds r1, r7, #4 + adds r0, r7, #4 + adds r1, r7, #4 + ldrh r2, [r1] + adds r1, r2, #1 + adds r2, r1, #0 + strh r2, [r0] +_0200EC7E: + ldr r0, [r7, #8] + subs r1, r0, #1 + str r1, [r7, #8] + b _0200EC44 + .align 2, 0 + .pool +_0200EC8C: + movs r0, #0 + str r0, [r7, #8] +_0200EC90: + adds r0, r7, #1 + ldrb r1, [r0] + subs r0, r1, #1 + ldr r1, [r7, #8] + cmp r1, r0 + blt _0200EC9E + b _0200ECC4 +_0200EC9E: + adds r0, r7, #4 + adds r1, r7, #4 + ldr r2, =gUnknown_0201F318 + ldr r3, [r7, #8] + adds r4, r3, #0 + lsls r3, r4, #2 + adds r2, r2, r3 + ldr r3, [r2] + adds r2, r3, #0 + ldrh r1, [r1] + adds r2, r1, r2 + adds r1, r2, #0 + strh r1, [r0] + ldr r0, [r7, #8] + adds r1, r0, #1 + str r1, [r7, #8] + b _0200EC90 + .align 2, 0 + .pool +_0200ECC4: + adds r0, r7, #1 + ldrb r1, [r0] + cmp r1, #2 + bls _0200ECEA + adds r0, r7, #0 + ldrb r1, [r0] + adds r0, r1, #0 + bl sub_0200EBC4 + lsls r1, r0, #0x18 + lsrs r0, r1, #0x18 + cmp r0, #1 + bne _0200ECEA + adds r0, r7, #4 + adds r1, r7, #4 + ldrh r2, [r1] + adds r1, r2, #1 + adds r2, r1, #0 + strh r2, [r0] +_0200ECEA: + adds r0, r7, #4 + adds r1, r7, #4 + adds r2, r7, #2 + ldrb r3, [r2] + adds r2, r3, #0 + ldrh r1, [r1] + adds r2, r1, r2 + adds r1, r2, #0 + strh r1, [r0] + adds r0, r7, #4 + ldrh r1, [r0] + adds r0, r1, #0 + b _0200ED04 +_0200ED04: + add sp, #0xc + pop {r4, r7} + pop {r1} + bx r1 + + thumb_func_start sub_0200ED0C +sub_0200ED0C: @ 0x0200ED0C + push {r4, r5, r7, lr} + sub sp, #4 + mov r7, sp + str r0, [r7] + ldr r0, [r7] + ldrb r1, [r0] + adds r0, r1, #0 + bl sub_0200EB5C + adds r1, r0, #0 + lsls r0, r1, #0x18 + lsrs r4, r0, #0x18 + ldr r0, [r7] + ldrb r1, [r0, #1] + adds r0, r1, #0 + bl sub_0200EB5C + adds r1, r0, #0 + lsls r0, r1, #0x18 + lsrs r5, r0, #0x18 + ldr r0, [r7] + ldrb r1, [r0, #2] + adds r0, r1, #0 + bl sub_0200EB5C + adds r1, r0, #0 + lsls r0, r1, #0x18 + lsrs r2, r0, #0x18 + adds r0, r4, #0 + adds r1, r5, #0 + bl sub_0200EC20 + lsls r2, r0, #0x10 + lsrs r1, r2, #0x10 + adds r0, r1, #0 + b _0200ED54 +_0200ED54: + add sp, #4 + pop {r4, r5, r7} + pop {r1} + bx r1 + + thumb_func_start sub_0200ED5C +sub_0200ED5C: @ 0x0200ED5C + push {r7, lr} + mov r7, sp + ldr r0, =gUnknown_02021398 + movs r1, #0 + strh r1, [r0] + bl sub_0200EB20 + bl SiiRtcUnprotect + bl SiiRtcProbe + ldr r1, =gUnknown_020213AC + strb r0, [r1] + bl sub_0200EB40 + ldr r0, =gUnknown_020213AC + ldrb r1, [r0] + movs r2, #0xf + adds r0, r1, #0 + ands r0, r2 + adds r2, r0, #0 + lsls r1, r2, #0x18 + lsrs r0, r1, #0x18 + cmp r0, #1 + beq _0200EDA0 + ldr r0, =gUnknown_02021398 + movs r1, #1 + strh r1, [r0] + b _0200EDDE + .align 2, 0 + .pool +_0200EDA0: + ldr r0, =gUnknown_020213AC + ldrb r1, [r0] + movs r2, #0xf0 + adds r0, r1, #0 + ands r0, r2 + adds r2, r0, #0 + lsls r1, r2, #0x18 + lsrs r0, r1, #0x18 + cmp r0, #0 + beq _0200EDC4 + ldr r0, =gUnknown_02021398 + movs r1, #2 + strh r1, [r0] + b _0200EDCA + .align 2, 0 + .pool +_0200EDC4: + ldr r0, =gUnknown_02021398 + movs r1, #0 + strh r1, [r0] +_0200EDCA: + ldr r1, =gUnknown_020213A0 + adds r0, r1, #0 + bl sub_0200EE84 + ldr r1, =gUnknown_020213A0 + adds r0, r1, #0 + bl sub_0200EEA0 + ldr r1, =gUnknown_02021398 + strh r0, [r1] +_0200EDDE: + pop {r7} + pop {r0} + bx r0 + .align 2, 0 + .pool + + thumb_func_start sub_0200EDEC +sub_0200EDEC: @ 0x0200EDEC + push {r7, lr} + mov r7, sp + ldr r0, =gUnknown_02021398 + ldrh r1, [r0] + adds r0, r1, #0 + b _0200EDFC + .align 2, 0 + .pool +_0200EDFC: + pop {r7} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200EE04 +sub_0200EE04: @ 0x0200EE04 + push {r4, r7, lr} + sub sp, #4 + mov r7, sp + str r0, [r7] + ldr r0, =gUnknown_02021398 + ldrh r1, [r0] + movs r2, #0xff + lsls r2, r2, #4 + adds r0, r1, #0 + ands r0, r2 + adds r2, r0, #0 + lsls r1, r2, #0x10 + lsrs r0, r1, #0x10 + cmp r0, #0 + beq _0200EE34 + ldr r0, [r7] + ldr r1, =gUnknown_0201F304 + ldm r1!, {r2, r3, r4} + stm r0!, {r2, r3, r4} + b _0200EE3A + .align 2, 0 + .pool +_0200EE34: + ldr r0, [r7] + bl sub_0200EE84 +_0200EE3A: + add sp, #4 + pop {r4, r7} + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start sub_0200EE44 +sub_0200EE44: @ 0x0200EE44 + push {r7, lr} + sub sp, #4 + mov r7, sp + str r0, [r7] + bl sub_0200EB20 + ldr r0, [r7] + bl SiiRtcGetDateTime + bl sub_0200EB40 + add sp, #4 + pop {r7} + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start sub_0200EE64 +sub_0200EE64: @ 0x0200EE64 + push {r7, lr} + sub sp, #4 + mov r7, sp + str r0, [r7] + bl sub_0200EB20 + ldr r0, [r7] + bl SiiRtcGetStatus + bl sub_0200EB40 + add sp, #4 + pop {r7} + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start sub_0200EE84 +sub_0200EE84: @ 0x0200EE84 + push {r7, lr} + sub sp, #4 + mov r7, sp + str r0, [r7] + ldr r0, [r7] + bl sub_0200EE64 + ldr r0, [r7] + bl sub_0200EE44 + add sp, #4 + pop {r7} + pop {r0} + bx r0 + + thumb_func_start sub_0200EEA0 +sub_0200EEA0: @ 0x0200EEA0 + push {r7, lr} + sub sp, #0x14 + mov r7, sp + str r0, [r7] + adds r0, r7, #4 + movs r1, #0 + strh r1, [r0] + ldr r0, [r7] + ldrb r1, [r0, #7] + movs r2, #0x80 + adds r0, r1, #0 + ands r0, r2 + adds r2, r0, #0 + lsls r1, r2, #0x18 + lsrs r0, r1, #0x18 + cmp r0, #0 + beq _0200EED2 + adds r0, r7, #4 + adds r1, r7, #4 + ldrh r2, [r1] + movs r3, #0x20 + adds r1, r2, #0 + orrs r1, r3 + adds r2, r1, #0 + strh r2, [r0] +_0200EED2: + ldr r0, [r7] + ldrb r1, [r0, #7] + movs r2, #0x40 + adds r0, r1, #0 + ands r0, r2 + adds r2, r0, #0 + lsls r1, r2, #0x18 + lsrs r0, r1, #0x18 + cmp r0, #0 + bne _0200EEF6 + adds r0, r7, #4 + adds r1, r7, #4 + ldrh r2, [r1] + movs r3, #0x10 + adds r1, r2, #0 + orrs r1, r3 + adds r2, r1, #0 + strh r2, [r0] +_0200EEF6: + ldr r0, [r7] + ldrb r1, [r0] + adds r0, r1, #0 + bl sub_0200EB5C + str r0, [r7, #8] + ldr r0, [r7, #8] + cmp r0, #0xff + bne _0200EF18 + adds r0, r7, #4 + adds r1, r7, #4 + ldrh r2, [r1] + movs r3, #0x40 + adds r1, r2, #0 + orrs r1, r3 + adds r2, r1, #0 + strh r2, [r0] +_0200EF18: + ldr r0, [r7] + ldrb r1, [r0, #1] + adds r0, r1, #0 + bl sub_0200EB5C + str r0, [r7, #0xc] + ldr r0, [r7, #0xc] + cmp r0, #0xff + beq _0200EF38 + ldr r0, [r7, #0xc] + cmp r0, #0 + beq _0200EF38 + ldr r0, [r7, #0xc] + cmp r0, #0xc + bgt _0200EF38 + b _0200EF48 +_0200EF38: + adds r0, r7, #4 + adds r1, r7, #4 + ldrh r2, [r1] + movs r3, #0x80 + adds r1, r2, #0 + orrs r1, r3 + adds r2, r1, #0 + strh r2, [r0] +_0200EF48: + ldr r0, [r7] + ldrb r1, [r0, #2] + adds r0, r1, #0 + bl sub_0200EB5C + str r0, [r7, #0x10] + ldr r0, [r7, #0x10] + cmp r0, #0xff + bne _0200EF6C + adds r0, r7, #4 + adds r1, r7, #4 + ldrh r2, [r1] + movs r3, #0x80 + lsls r3, r3, #1 + adds r1, r2, #0 + orrs r1, r3 + adds r2, r1, #0 + strh r2, [r0] +_0200EF6C: + ldr r0, [r7, #0xc] + cmp r0, #2 + bne _0200EFA8 + ldr r1, [r7, #8] + adds r0, r1, #0 + lsls r2, r0, #0x18 + lsrs r1, r2, #0x18 + adds r0, r1, #0 + bl sub_0200EBC4 + lsls r1, r0, #0x18 + lsrs r0, r1, #0x18 + ldr r1, =gUnknown_0201F318 + ldr r2, [r1, #4] + adds r0, r0, r2 + ldr r1, [r7, #0x10] + cmp r1, r0 + ble _0200EFA2 + adds r0, r7, #4 + adds r1, r7, #4 + ldrh r2, [r1] + movs r3, #0x80 + lsls r3, r3, #1 + adds r1, r2, #0 + orrs r1, r3 + adds r2, r1, #0 + strh r2, [r0] +_0200EFA2: + b _0200EFCE + .align 2, 0 + .pool +_0200EFA8: + ldr r0, =gUnknown_0201F318 + ldr r2, [r7, #0xc] + subs r1, r2, #1 + adds r2, r1, #0 + lsls r1, r2, #2 + adds r0, r0, r1 + ldr r1, [r7, #0x10] + ldr r0, [r0] + cmp r1, r0 + ble _0200EFCE + adds r0, r7, #4 + adds r1, r7, #4 + ldrh r2, [r1] + movs r3, #0x80 + lsls r3, r3, #1 + adds r1, r2, #0 + orrs r1, r3 + adds r2, r1, #0 + strh r2, [r0] +_0200EFCE: + ldr r0, [r7] + ldrb r1, [r0, #4] + adds r0, r1, #0 + bl sub_0200EB5C + str r0, [r7, #0x10] + ldr r0, [r7, #0x10] + cmp r0, #0xff + beq _0200EFEC + ldr r0, [r7, #0x10] + cmp r0, #0x18 + bgt _0200EFEC + b _0200EFFE + .align 2, 0 + .pool +_0200EFEC: + adds r0, r7, #4 + adds r1, r7, #4 + ldrh r2, [r1] + movs r3, #0x80 + lsls r3, r3, #2 + adds r1, r2, #0 + orrs r1, r3 + adds r2, r1, #0 + strh r2, [r0] +_0200EFFE: + ldr r0, [r7] + ldrb r1, [r0, #5] + adds r0, r1, #0 + bl sub_0200EB5C + str r0, [r7, #0x10] + ldr r0, [r7, #0x10] + cmp r0, #0xff + beq _0200F018 + ldr r0, [r7, #0x10] + cmp r0, #0x3c + bgt _0200F018 + b _0200F02A +_0200F018: + adds r0, r7, #4 + adds r1, r7, #4 + ldrh r2, [r1] + movs r3, #0x80 + lsls r3, r3, #3 + adds r1, r2, #0 + orrs r1, r3 + adds r2, r1, #0 + strh r2, [r0] +_0200F02A: + ldr r0, [r7] + ldrb r1, [r0, #6] + adds r0, r1, #0 + bl sub_0200EB5C + str r0, [r7, #0x10] + ldr r0, [r7, #0x10] + cmp r0, #0xff + beq _0200F044 + ldr r0, [r7, #0x10] + cmp r0, #0x3c + bgt _0200F044 + b _0200F056 +_0200F044: + adds r0, r7, #4 + adds r1, r7, #4 + ldrh r2, [r1] + movs r3, #0x80 + lsls r3, r3, #4 + adds r1, r2, #0 + orrs r1, r3 + adds r2, r1, #0 + strh r2, [r0] +_0200F056: + adds r0, r7, #4 + ldrh r1, [r0] + adds r0, r1, #0 + b _0200F05E +_0200F05E: + add sp, #0x14 + pop {r7} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200F068 +sub_0200F068: @ 0x0200F068 + push {r7, lr} + mov r7, sp + bl sub_0200EB20 + bl SiiRtcReset + bl sub_0200EB40 + pop {r7} + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start sub_0200F080 +sub_0200F080: @ 0x0200F080 + push {r7, lr} + sub sp, #0x10 + mov r7, sp + str r0, [r7] + str r1, [r7, #4] + str r2, [r7, #8] + ldr r0, [r7] + bl sub_0200ED0C + adds r1, r7, #0 + adds r1, #0xc + strh r0, [r1] + ldr r0, [r7] + ldrb r1, [r0, #6] + adds r0, r1, #0 + bl sub_0200EB5C + adds r1, r0, #0 + ldr r0, [r7, #4] + ldr r2, [r7, #8] + ldrb r2, [r2, #4] + subs r1, r1, r2 + ldrb r2, [r0, #4] + movs r3, #0 + ands r2, r3 + adds r3, r2, #0 + adds r2, r3, #0 + orrs r2, r1 + adds r1, r2, #0 + strb r1, [r0, #4] + ldr r0, [r7] + ldrb r1, [r0, #5] + adds r0, r1, #0 + bl sub_0200EB5C + adds r1, r0, #0 + ldr r0, [r7, #4] + ldr r2, [r7, #8] + ldrb r2, [r2, #3] + subs r1, r1, r2 + ldrb r2, [r0, #3] + movs r3, #0 + ands r2, r3 + adds r3, r2, #0 + adds r2, r3, #0 + orrs r2, r1 + adds r1, r2, #0 + strb r1, [r0, #3] + ldr r0, [r7] + ldrb r1, [r0, #4] + adds r0, r1, #0 + bl sub_0200EB5C + adds r1, r0, #0 + ldr r0, [r7, #4] + ldr r2, [r7, #8] + ldrb r2, [r2, #2] + subs r1, r1, r2 + ldrb r2, [r0, #2] + movs r3, #0 + ands r2, r3 + adds r3, r2, #0 + adds r2, r3, #0 + orrs r2, r1 + adds r1, r2, #0 + strb r1, [r0, #2] + ldr r0, [r7, #4] + adds r1, r7, #0 + adds r1, #0xc + ldr r2, [r7, #8] + ldrh r1, [r1] + ldrh r2, [r2] + subs r1, r1, r2 + ldrh r2, [r0] + movs r3, #0 + ands r2, r3 + adds r3, r2, #0 + adds r2, r3, #0 + orrs r2, r1 + adds r1, r2, #0 + strh r1, [r0] + ldr r0, [r7, #4] + movs r1, #4 + ldrsb r1, [r0, r1] + cmp r1, #0 + bge _0200F160 + ldr r0, [r7, #4] + ldr r1, [r7, #4] + ldrb r2, [r1, #4] + adds r1, r2, #0 + adds r1, #0x3c + ldrb r2, [r0, #4] + movs r3, #0 + ands r2, r3 + adds r3, r2, #0 + adds r2, r3, #0 + orrs r2, r1 + adds r1, r2, #0 + strb r1, [r0, #4] + ldr r1, [r7, #4] + ldr r0, [r7, #4] + ldr r1, [r7, #4] + ldrb r2, [r1, #3] + subs r1, r2, #1 + ldrb r2, [r0, #3] + movs r3, #0 + ands r2, r3 + adds r3, r2, #0 + adds r2, r3, #0 + orrs r2, r1 + adds r1, r2, #0 + strb r1, [r0, #3] +_0200F160: + ldr r0, [r7, #4] + movs r1, #3 + ldrsb r1, [r0, r1] + cmp r1, #0 + bge _0200F19E + ldr r0, [r7, #4] + ldr r1, [r7, #4] + ldrb r2, [r1, #3] + adds r1, r2, #0 + adds r1, #0x3c + ldrb r2, [r0, #3] + movs r3, #0 + ands r2, r3 + adds r3, r2, #0 + adds r2, r3, #0 + orrs r2, r1 + adds r1, r2, #0 + strb r1, [r0, #3] + ldr r1, [r7, #4] + ldr r0, [r7, #4] + ldr r1, [r7, #4] + ldrb r2, [r1, #2] + subs r1, r2, #1 + ldrb r2, [r0, #2] + movs r3, #0 + ands r2, r3 + adds r3, r2, #0 + adds r2, r3, #0 + orrs r2, r1 + adds r1, r2, #0 + strb r1, [r0, #2] +_0200F19E: + ldr r0, [r7, #4] + movs r1, #2 + ldrsb r1, [r0, r1] + cmp r1, #0 + bge _0200F1DC + ldr r0, [r7, #4] + ldr r1, [r7, #4] + ldrb r2, [r1, #2] + adds r1, r2, #0 + adds r1, #0x18 + ldrb r2, [r0, #2] + movs r3, #0 + ands r2, r3 + adds r3, r2, #0 + adds r2, r3, #0 + orrs r2, r1 + adds r1, r2, #0 + strb r1, [r0, #2] + ldr r1, [r7, #4] + ldr r0, [r7, #4] + ldr r1, [r7, #4] + ldrh r2, [r1] + subs r1, r2, #1 + ldrh r2, [r0] + movs r3, #0 + ands r2, r3 + adds r3, r2, #0 + adds r2, r3, #0 + orrs r2, r1 + adds r1, r2, #0 + strh r1, [r0] +_0200F1DC: + add sp, #0x10 + pop {r7} + pop {r0} + bx r0 + + thumb_func_start sub_0200F1E4 +sub_0200F1E4: @ 0x0200F1E4 + push {r7, lr} + sub sp, #0xc + mov r7, sp + str r0, [r7] + str r1, [r7, #4] + str r2, [r7, #8] + ldr r0, [r7] + ldr r1, [r7, #8] + ldr r2, [r7, #4] + ldrb r1, [r1, #4] + ldrb r2, [r2, #4] + subs r1, r1, r2 + ldrb r2, [r0, #4] + movs r3, #0 + ands r2, r3 + adds r3, r2, #0 + adds r2, r3, #0 + orrs r2, r1 + adds r1, r2, #0 + strb r1, [r0, #4] + ldr r0, [r7] + ldr r1, [r7, #8] + ldr r2, [r7, #4] + ldrb r1, [r1, #3] + ldrb r2, [r2, #3] + subs r1, r1, r2 + ldrb r2, [r0, #3] + movs r3, #0 + ands r2, r3 + adds r3, r2, #0 + adds r2, r3, #0 + orrs r2, r1 + adds r1, r2, #0 + strb r1, [r0, #3] + ldr r0, [r7] + ldr r1, [r7, #8] + ldr r2, [r7, #4] + ldrb r1, [r1, #2] + ldrb r2, [r2, #2] + subs r1, r1, r2 + ldrb r2, [r0, #2] + movs r3, #0 + ands r2, r3 + adds r3, r2, #0 + adds r2, r3, #0 + orrs r2, r1 + adds r1, r2, #0 + strb r1, [r0, #2] + ldr r0, [r7] + ldr r1, [r7, #8] + ldr r2, [r7, #4] + ldrh r1, [r1] + ldrh r2, [r2] + subs r1, r1, r2 + ldrh r2, [r0] + movs r3, #0 + ands r2, r3 + adds r3, r2, #0 + adds r2, r3, #0 + orrs r2, r1 + adds r1, r2, #0 + strh r1, [r0] + ldr r0, [r7] + movs r1, #4 + ldrsb r1, [r0, r1] + cmp r1, #0 + bge _0200F29E + ldr r0, [r7] + ldr r1, [r7] + ldrb r2, [r1, #4] + adds r1, r2, #0 + adds r1, #0x3c + ldrb r2, [r0, #4] + movs r3, #0 + ands r2, r3 + adds r3, r2, #0 + adds r2, r3, #0 + orrs r2, r1 + adds r1, r2, #0 + strb r1, [r0, #4] + ldr r1, [r7] + ldr r0, [r7] + ldr r1, [r7] + ldrb r2, [r1, #3] + subs r1, r2, #1 + ldrb r2, [r0, #3] + movs r3, #0 + ands r2, r3 + adds r3, r2, #0 + adds r2, r3, #0 + orrs r2, r1 + adds r1, r2, #0 + strb r1, [r0, #3] +_0200F29E: + ldr r0, [r7] + movs r1, #3 + ldrsb r1, [r0, r1] + cmp r1, #0 + bge _0200F2DC + ldr r0, [r7] + ldr r1, [r7] + ldrb r2, [r1, #3] + adds r1, r2, #0 + adds r1, #0x3c + ldrb r2, [r0, #3] + movs r3, #0 + ands r2, r3 + adds r3, r2, #0 + adds r2, r3, #0 + orrs r2, r1 + adds r1, r2, #0 + strb r1, [r0, #3] + ldr r1, [r7] + ldr r0, [r7] + ldr r1, [r7] + ldrb r2, [r1, #2] + subs r1, r2, #1 + ldrb r2, [r0, #2] + movs r3, #0 + ands r2, r3 + adds r3, r2, #0 + adds r2, r3, #0 + orrs r2, r1 + adds r1, r2, #0 + strb r1, [r0, #2] +_0200F2DC: + ldr r0, [r7] + movs r1, #2 + ldrsb r1, [r0, r1] + cmp r1, #0 + bge _0200F31A + ldr r0, [r7] + ldr r1, [r7] + ldrb r2, [r1, #2] + adds r1, r2, #0 + adds r1, #0x18 + ldrb r2, [r0, #2] + movs r3, #0 + ands r2, r3 + adds r3, r2, #0 + adds r2, r3, #0 + orrs r2, r1 + adds r1, r2, #0 + strb r1, [r0, #2] + ldr r1, [r7] + ldr r0, [r7] + ldr r1, [r7] + ldrh r2, [r1] + subs r1, r2, #1 + ldrh r2, [r0] + movs r3, #0 + ands r2, r3 + adds r3, r2, #0 + adds r2, r3, #0 + orrs r2, r1 + adds r1, r2, #0 + strh r1, [r0] +_0200F31A: + add sp, #0xc + pop {r7} + pop {r0} + bx r0 + .align 2, 0 + + thumb_func_start sub_0200F324 +sub_0200F324: @ 0x0200F324 + push {r7, lr} + sub sp, #4 + mov r7, sp + adds r1, r7, #0 + strb r0, [r1] + b _0200F330 +_0200F330: + add sp, #4 + pop {r7} + pop {r0} + bx r0 + + thumb_func_start sub_0200F338 +sub_0200F338: @ 0x0200F338 + push {r7, lr} + mov r7, sp + b _0200F33E +_0200F33E: + pop {r7} + pop {r0} + bx r0 + + thumb_func_start sub_0200F344 +sub_0200F344: @ 0x0200F344 + push {r7, lr} + mov r7, sp + b _0200F34A +_0200F34A: + pop {r7} + pop {r0} + bx r0 + + thumb_func_start sub_0200F350 +sub_0200F350: @ 0x0200F350 + push {r7, lr} + sub sp, #4 + mov r7, sp + adds r1, r7, #0 + strh r0, [r1] + adds r0, r7, #0 + ldrh r1, [r0] + ldr r0, =0x00003FFF + cmp r1, r0 + bhi _0200F36C + movs r0, #0 + b _0200F398 + .align 2, 0 + .pool +_0200F36C: + adds r0, r7, #0 + movs r2, #0 + ldrsh r1, [r0, r2] + cmp r1, #0 + blt _0200F394 + ldr r0, =gUnknown_02022EE4 + adds r1, r7, #0 + ldrh r2, [r1] + adds r1, r2, #0 + lsls r2, r1, #1 + ldr r3, =0xFFFF8000 + adds r1, r2, r3 + ldr r0, [r0] + adds r1, r1, r0 + adds r0, r1, #0 + b _0200F398 + .align 2, 0 + .pool +_0200F394: + movs r0, #0 + b _0200F398 +_0200F398: + add sp, #4 + pop {r7} + pop {r1} + bx r1 + + thumb_func_start sub_0200F3A0 +sub_0200F3A0: @ 0x0200F3A0 + push {r7, lr} + sub sp, #8 + mov r7, sp + ldr r1, =0x000040C2 + adds r0, r1, #0 + bl sub_0200F350 + str r0, [r7, #4] + adds r1, r7, #0 + adds r0, r1, #0 + bl sub_0200E6D0 + ldr r1, [r7, #4] + ldrh r0, [r1] + ldr r1, =gUnknown_02025260 + movs r3, #0 + ldrsh r2, [r1, r3] + cmp r0, r2 + bgt _0200F3D6 + movs r0, #1 + b _0200F3DA + .align 2, 0 + .pool +_0200F3D4: @ 0x0200F3D4 + b _0200F3DA +_0200F3D6: + movs r0, #0 + b _0200F3DA +_0200F3DA: + add sp, #8 + pop {r7} + pop {r1} + bx r1 + .align 2, 0 + + thumb_func_start sub_0200F3E4 +sub_0200F3E4: @ 0x0200F3E4 + push {r7, lr} + sub sp, #8 + mov r7, sp + bl sub_0200F3A0 + cmp r0, #1 + bne _0200F3F6 + movs r0, #1 + b _0200F434 +_0200F3F6: + adds r1, r7, #4 + adds r0, r1, #0 + bl sub_0200E6D0 + ldr r0, =gUnknown_02025260 + movs r2, #0 + ldrsh r1, [r0, r2] + cmp r1, #0 + bge _0200F410 + movs r0, #0 + b _0200F434 + .align 2, 0 + .pool +_0200F410: + ldr r1, =0x000040C2 + adds r0, r1, #0 + bl sub_0200F350 + str r0, [r7] + ldr r0, [r7] + movs r1, #1 + strh r1, [r0] + bl sub_02009EC8 + cmp r0, #1 + beq _0200F430 + movs r0, #0 + b _0200F434 + .align 2, 0 + .pool +_0200F430: + movs r0, #1 + b _0200F434 +_0200F434: + add sp, #8 + pop {r7} + pop {r1} + bx r1 diff --git a/charmap.txt b/charmap.txt new file mode 100644 index 0000000..fe07476 --- /dev/null +++ b/charmap.txt @@ -0,0 +1,783 @@ +' ' = 00 +'À' = 01 +'Á' = 02 +'Â' = 03 +'Ç' = 04 +'È' = 05 +'É' = 06 +'Ê' = 07 +'Ë' = 08 +'Ì' = 09 +'Î' = 0B +'Ï' = 0C +'Ò' = 0D +'Ó' = 0E +'Ô' = 0F +'Œ' = 10 +'Ù' = 11 +'Ú' = 12 +'Û' = 13 +'Ñ' = 14 +'ß' = 15 +'à' = 16 +'á' = 17 +'ç' = 19 +'è' = 1A +'é' = 1B +'ê' = 1C +'ë' = 1D +'ì' = 1E +'î' = 20 +'ï' = 21 +'ò' = 22 +'ó' = 23 +'ô' = 24 +'œ' = 25 +'ù' = 26 +'ú' = 27 +'û' = 28 +'ñ' = 29 +'º' = 2A +'ª' = 2B +SUPER_ER = 2C +'&' = 2D +'+' = 2E +LV = 34 +'=' = 35 +'¿' = 51 +'¡' = 52 +PK = 53 +PKMN = 53 54 +POKEBLOCK = 55 56 57 58 59 +'Í' = 5A +'%' = 5B +'(' = 5C +')' = 5D +'â' = 68 +'í' = 6F +UP_ARROW = 79 +DOWN_ARROW = 7A +LEFT_ARROW = 7B +RIGHT_ARROW = 7C +'0' = A1 +'1' = A2 +'2' = A3 +'3' = A4 +'4' = A5 +'5' = A6 +'6' = A7 +'7' = A8 +'8' = A9 +'9' = AA +'!' = AB +'?' = AC +'.' = AD +'-' = AE +'…' = B0 +'“' = B1 +'”' = B2 +'‘' = B3 +'\'' = B4 +'♂' = B5 +'♀' = B6 +'¥' = B7 +',' = B8 +'×' = B9 +'/' = BA +'A' = BB +'B' = BC +'C' = BD +'D' = BE +'E' = BF +'F' = C0 +'G' = C1 +'H' = C2 +'I' = C3 +'J' = C4 +'K' = C5 +'L' = C6 +'M' = C7 +'N' = C8 +'O' = C9 +'P' = CA +'Q' = CB +'R' = CC +'S' = CD +'T' = CE +'U' = CF +'V' = D0 +'W' = D1 +'X' = D2 +'Y' = D3 +'Z' = D4 +'a' = D5 +'b' = D6 +'c' = D7 +'d' = D8 +'e' = D9 +'f' = DA +'g' = DB +'h' = DC +'i' = DD +'j' = DE +'k' = DF +'l' = E0 +'m' = E1 +'n' = E2 +'o' = E3 +'p' = E4 +'q' = E5 +'r' = E6 +'s' = E7 +'t' = E8 +'u' = E9 +'v' = EA +'w' = EB +'x' = EC +'y' = ED +'z' = EE +'▶' = EF +':' = F0 +'Ä' = F1 +'Ö' = F2 +'Ü' = F3 +'ä' = F4 +'ö' = F5 +'ü' = F6 +@ Arrows at F7-FA are duplicates of 79-7C. Unused? +TALL_PLUS = FC 0C FB +'$' = FF + +@ Hiragana +'あ' = 01 +'い' = 02 +'う' = 03 +'え' = 04 +'お' = 05 +'か' = 06 +'き' = 07 +'く' = 08 +'け' = 09 +'こ' = 0A +'さ' = 0B +'し' = 0C +'す' = 0D +'せ' = 0E +'そ' = 0F +'た' = 10 +'ち' = 11 +'つ' = 12 +'て' = 13 +'と' = 14 +'な' = 15 +'に' = 16 +'ぬ' = 17 +'ね' = 18 +'の' = 19 +'は' = 1A +'ひ' = 1B +'ふ' = 1C +'へ' = 1D +'ほ' = 1E +'ま' = 1F +'み' = 20 +'む' = 21 +'め' = 22 +'も' = 23 +'や' = 24 +'ゆ' = 25 +'よ' = 26 +'ら' = 27 +'り' = 28 +'る' = 29 +'れ' = 2A +'ろ' = 2B +'わ' = 2C +'を' = 2D +'ん' = 2E +'ぁ' = 2F +'ぃ' = 30 +'ぅ' = 31 +'ぇ' = 32 +'ぉ' = 33 +'ゃ' = 34 +'ゅ' = 35 +'ょ' = 36 +'が' = 37 +'ぎ' = 38 +'ぐ' = 39 +'げ' = 3A +'ご' = 3B +'ざ' = 3C +'じ' = 3D +'ず' = 3E +'ぜ' = 3F +'ぞ' = 40 +'だ' = 41 +'ぢ' = 42 +'づ' = 43 +'で' = 44 +'ど' = 45 +'ば' = 46 +'び' = 47 +'ぶ' = 48 +'べ' = 49 +'ぼ' = 4A +'ぱ' = 4B +'ぴ' = 4C +'ぷ' = 4D +'ぺ' = 4E +'ぽ' = 4F +'っ' = 50 + +@ Katakana +'ア' = 51 +'イ' = 52 +'ウ' = 53 +'エ' = 54 +'オ' = 55 +'カ' = 56 +'キ' = 57 +'ク' = 58 +'ケ' = 59 +'コ' = 5A +'サ' = 5B +'シ' = 5C +'ス' = 5D +'セ' = 5E +'ソ' = 5F +'タ' = 60 +'チ' = 61 +'ツ' = 62 +'テ' = 63 +'ト' = 64 +'ナ' = 65 +'ニ' = 66 +'ヌ' = 67 +'ネ' = 68 +'ノ' = 69 +'ハ' = 6A +'ヒ' = 6B +'フ' = 6C +'ヘ' = 6D +'ホ' = 6E +'マ' = 6F +'ミ' = 70 +'ム' = 71 +'メ' = 72 +'モ' = 73 +'ヤ' = 74 +'ユ' = 75 +'ヨ' = 76 +'ラ' = 77 +'リ' = 78 +'ル' = 79 +'レ' = 7A +'ロ' = 7B +'ワ' = 7C +'ヲ' = 7D +'ン' = 7E +'ァ' = 7F +'ィ' = 80 +'ゥ' = 81 +'ェ' = 82 +'ォ' = 83 +'ャ' = 84 +'ュ' = 85 +'ョ' = 86 +'ガ' = 87 +'ギ' = 88 +'グ' = 89 +'ゲ' = 8A +'ゴ' = 8B +'ザ' = 8C +'ジ' = 8D +'ズ' = 8E +'ゼ' = 8F +'ゾ' = 90 +'ダ' = 91 +'ヂ' = 92 +'ヅ' = 93 +'デ' = 94 +'ド' = 95 +'バ' = 96 +'ビ' = 97 +'ブ' = 98 +'ベ' = 99 +'ボ' = 9A +'パ' = 9B +'ピ' = 9C +'プ' = 9D +'ペ' = 9E +'ポ' = 9F +'ッ' = A0 + +@ Japanese punctuation +'　' = 00 +'！' = AB +'？' = AC +'。' = AD +'ー' = AE +'·' = AF +'‥' = B0 + +@ TODO: Identify and declare F7 control codes +UNKNOWN_F7 = F7 +KEYGFX = F8 +EXTRA = F9 + +KEYGFX_A_BUTTON = F8 00 +KEYGFX_B_BUTTON = F8 01 +KEYGFX_L_BUTTON = F8 02 +KEYGFX_R_BUTTON = F8 03 +KEYGFX_START_BUTTON = F8 04 +KEYGFX_SELECT_BUTTON = F8 05 +KEYGFX_DPAD_UP = F8 06 +KEYGFX_DPAD_DOWN = F8 07 +KEYGFX_DPAD_LEFT = F8 08 +KEYGFX_DPAD_RIGHT = F8 09 +KEYGFX_DPAD_UP_DOWN = F8 0A +KEYGFX_DPAD_LEFT_RIGHT = F8 0B +KEYGFX_DPAD_ANY = F8 0C + +EXTRA_UPARROW = F9 00 +EXTRA_DOWNARROW = F9 01 +EXTRA_LEFTARROW = F9 02 +EXTRA_RIGHTARROW = F9 03 +EXTRA_PLUS = F9 04 +EXTRA_LV = F9 05 +EXTRA_PP = F9 06 +EXTRA_ID = F9 07 +EXTRA_NO = F9 08 +EXTRA_UNDERSCORE = F9 09 +EXTRA_CIRCLE_1 = F9 0A +EXTRA_CIRCLE_2 = F9 0B +EXTRA_CIRCLE_3 = F9 0C +EXTRA_CIRCLE_4 = F9 0D +EXTRA_CIRCLE_5 = F9 0E +EXTRA_CIRCLE_6 = F9 0F +EXTRA_CIRCLE_7 = F9 10 +EXTRA_CIRCLE_8 = F9 11 +EXTRA_CIRCLE_9 = F9 12 +EXTRA_LEFT_PAREN = F9 13 +EXTRA_RIGHT_PAREN = F9 14 +EXTRA_TARGET = F9 15 +EXTRA_TRIANGLE = F9 16 +EXTRA_X = F9 17 + +STRING = FD + +@ string placeholders +PLAYER = FD 01 +STR_VAR_1 = FD 02 +STR_VAR_2 = FD 03 +STR_VAR_3 = FD 04 +KUN = FD 05 +RIVAL = FD 06 +@ version-dependent strings +VERSION = FD 07 @ "RUBY" / "SAPPHIRE" +EVIL_TEAM = FD 08 @ "MAGMA" / "AQUA" +GOOD_TEAM = FD 09 @ "AQUA" / "MAGMA" +EVIL_LEADER = FD 0A @ "MAXIE" / "ARCHIE" +GOOD_LEADER = FD 0B @ "ARCHIE" / "MAXIE" +EVIL_LEGENDARY = FD 0C @ "GROUDON" / "KYOGRE" +GOOD_LEGENDARY = FD 0D @ "KYOGRE" / "GROUDON" + +@ battle macros + +UNKNOWN_STR = FD 00 + +ATTACKING_TRAINER = FD 08 +DEFENDING_TRAINER = FD 09 + +ATTACKING_MON = FD 0C +DEFENDING_MON = FD 0D + +@ indicates the end of a town/city name (before " TOWN" or " CITY") +NAME_END = FC 00 + +@ more text functions + +COLOR = FC 01 @ use a color listed below right after +HIGHLIGHT = FC 02 @ same as fc 01 +SHADOW = FC 03 @ same as fc 01 +COLOR_HIGHLIGHT_SHADOW = FC 04 @ takes 3 bytes +PALETTE = FC 05 @ used in credits +SIZE = FC 06 @ note that anything other than "SMALL" is invalid +UNKNOWN_7 = FC 07 +PAUSE = FC 08 @ manually print the wait byte after this, havent mapped them +PAUSE_UNTIL_PRESS = FC 09 +UNKNOWN_A = FC 0A +PLAY_BGM = FC 0B +ESCAPE = FC 0C +SHIFT_TEXT = FC 0D +UNKNOWN_E = FC 0E +UNKNOWN_F = FC 0F +PLAY_SE = FC 10 +CLEAR = FC 11 +SKIP = FC 12 +CLEAR_TO = FC 13 +UNKNOWN_14 = FC 14 +JPN = FC 15 +ENG = FC 16 +PAUSE_MUSIC = FC 17 +RESUME_MUSIC = FC 18 + +@ font sizes + +SMALL = FC 06 00 +BIG = FC 06 04 + +@ colors + +TRANSPARENT = 00 +DARK_GREY = 01 +RED = 02 +GREEN = 03 +BLUE = 04 +YELLOW = 05 +CYAN = 06 +MAGENTA = 07 +LIGHT_GRAY = 08 +BLACK = 09 +BLACK2 = 0A @ duplicate of black? +SILVER = 0B +WHITE = 0C +SKY_BLUE = 0D +LIGHT_BLUE = 0E +WHITE2 = 0F @ duplicate of white? + +@ sound and music + +SE_STOP = 00 00 +SE_KAIFUKU = 01 00 +SE_PC_LOGON = 02 00 +SE_PC_OFF = 03 00 +SE_PC_ON = 04 00 +SE_SELECT = 05 00 +SE_WIN_OPEN = 06 00 +SE_WALL_HIT = 07 00 +SE_DOOR = 08 00 +SE_KAIDAN = 09 00 +SE_DANSA = 0A 00 +SE_JITENSYA = 0B 00 +SE_KOUKA_L = 0C 00 +SE_KOUKA_M = 0D 00 +SE_KOUKA_H = 0E 00 +SE_BOWA2 = 0F 00 +SE_POKE_DEAD = 10 00 +SE_NIGERU = 11 00 +SE_JIDO_DOA = 12 00 +SE_NAMINORI = 13 00 +SE_BAN = 14 00 +SE_PIN = 15 00 +SE_BOO = 16 00 +SE_BOWA = 17 00 +SE_JYUNI = 18 00 +SE_A = 19 00 +SE_I = 1A 00 +SE_U = 1B 00 +SE_E = 1C 00 +SE_O = 1D 00 +SE_N = 1E 00 +SE_SEIKAI = 1F 00 +SE_HAZURE = 20 00 +SE_EXP = 21 00 +SE_JITE_PYOKO = 22 00 +SE_MU_PACHI = 23 00 +SE_TK_KASYA = 24 00 +SE_FU_ZAKU = 25 00 +SE_FU_ZAKU2 = 26 00 +SE_FU_ZUZUZU = 27 00 +SE_RU_GASHIN = 28 00 +SE_RU_GASYAN = 29 00 +SE_RU_BARI = 2A 00 +SE_RU_HYUU = 2B 00 +SE_KI_GASYAN = 2C 00 +SE_TK_WARPIN = 2D 00 +SE_TK_WARPOUT = 2E 00 +SE_TU_SAA = 2F 00 +SE_HI_TURUN = 30 00 +SE_TRACK_MOVE = 31 00 +SE_TRACK_STOP = 32 00 +SE_TRACK_HAIK = 33 00 +SE_TRACK_DOOR = 34 00 +SE_MOTER = 35 00 +SE_CARD = 36 00 +SE_SAVE = 37 00 +SE_KON = 38 00 +SE_KON2 = 39 00 +SE_KON3 = 3A 00 +SE_KON4 = 3B 00 +SE_SUIKOMU = 3C 00 +SE_NAGERU = 3D 00 +SE_TOY_C = 3E 00 +SE_TOY_D = 3F 00 +SE_TOY_E = 40 00 +SE_TOY_F = 41 00 +SE_TOY_G = 42 00 +SE_TOY_A = 43 00 +SE_TOY_B = 44 00 +SE_TOY_C1 = 45 00 +SE_MIZU = 46 00 +SE_HASHI = 47 00 +SE_DAUGI = 48 00 +SE_PINPON = 49 00 +SE_FUUSEN1 = 4A 00 +SE_FUUSEN2 = 4B 00 +SE_FUUSEN3 = 4C 00 +SE_TOY_KABE = 4D 00 +SE_TOY_DANGO = 4E 00 +SE_DOKU = 4F 00 +SE_ESUKA = 50 00 +SE_T_AME = 51 00 +SE_T_AME_E = 52 00 +SE_T_OOAME = 53 00 +SE_T_OOAME_E = 54 00 +SE_T_KOAME = 55 00 +SE_T_KOAME_E = 56 00 +SE_T_KAMI = 57 00 +SE_T_KAMI2 = 58 00 +SE_ELEBETA = 59 00 +SE_HINSI = 5A 00 +SE_EXPMAX = 5B 00 +SE_TAMAKORO = 5C 00 +SE_TAMAKORO_E = 5D 00 +SE_BASABASA = 5E 00 +SE_REGI = 5F 00 +SE_C_GAJI = 60 00 +SE_C_MAKU_U = 61 00 +SE_C_MAKU_D = 62 00 +SE_C_PASI = 63 00 +SE_C_SYU = 64 00 +SE_C_PIKON = 65 00 +SE_REAPOKE = 66 00 +SE_OP_BASYU = 67 00 +SE_BT_START = 68 00 +SE_DENDOU = 69 00 +SE_JIHANKI = 6A 00 +SE_TAMA = 6B 00 +SE_Z_SCROLL = 6C 00 +SE_Z_PAGE = 6D 00 +SE_PN_ON = 6E 00 +SE_PN_OFF = 6F 00 +SE_Z_SEARCH = 70 00 +SE_TAMAGO = 71 00 +SE_TB_START = 72 00 +SE_TB_KON = 73 00 +SE_TB_KARA = 74 00 +SE_BIDORO = 75 00 + +MUS_ME_ASA = 00 01 +MUS_FANFA1 = 01 01 +MUS_FANFA4 = 02 01 +MUS_FANFA5 = 03 01 +MUS_ME_BACHI = 04 01 +MUS_ME_WAZA = 05 01 +MUS_ME_KINOMI = 06 01 +MUS_ME_SHINKA = 07 01 +BGM_FRLG_SAFARI_ZONE = 08 01 +MUS_SHINKA = 08 01 +BGM_FRLG_CHANSEY_DANCE = 0B 01 +MUS_ME_B_BIG = 0C 01 +MUS_ME_B_SMALL = 0D 01 +MUS_ME_WASURE = 0E 01 +MUS_ME_ZANNEN = 0F 01 +BGM_FRLG_FOLLOW_ME = 10 01 +BGM_FRLG_GAMECORNER = 11 01 +BGM_FRLG_ROCKET_HIDEOUT = 12 01 +BGM_FRLG_GYM = 13 01 +BGM_FRLG_JIGGLYPUFF = 14 01 +BGM_FRLG_OPENING = 15 01 +BGM_FRLG_TITLE = 16 01 +BGM_FRLG_CINNABAR_ISLAND = 17 01 +BGM_FRLG_LAVENDER_TOWN = 18 01 +BGM_FRLG_HEALING_TEST = 19 01 +BGM_FRLG_BICYCLE = 1A 01 +BGM_FRLG_SUSPICIOUS_EYE = 1B 01 +BGM_FRLG_GIRL_EYE = 1C 01 +BGM_FRLG_BOY_EYE = 1D 01 +BGM_FRLG_CONGRATULATIONS_HALL_OF_FAME = 1E 01 +BGM_FRLG_VIRIDIAN_FOREST = 1F 01 +BGM_FRLG_MT_MOON = 20 01 +BGM_FRLG_POKEMON_MANSION = 21 01 +BGM_FRLG_CREDITS = 22 01 +BGM_FRLG_ROUTE_1 = 23 01 +BGM_FRLG_ROUTE_24 = 24 01 +BGM_FRLG_ROUTE_3 = 25 01 +BGM_FRLG_ROUTE_11 = 26 01 +BGM_FRLG_INDIGO_PLATEAU = 27 01 +BGM_FRLG_BATTLE_LEADER = 28 01 +BGM_FRLG_BATTLE_TRAINER = 29 01 +BGM_FRLG_BATTLE_WILD_POKEMON = 2A 01 +BGM_FRLG_BATTLE_CHAMPION = 2B 01 +BGM_FRLG_PALLET_TOWN = 2C 01 +BGM_FRLG_OAK_LAB = 2D 01 +BGM_FRLG_PROF_OAK = 2E 01 +BGM_FRLG_POKEMON_CENTER = 2F 01 +BGM_FRLG_SS_ANNE = 30 01 +BGM_FRLG_SURF = 31 01 +BGM_FRLG_POKEMON_TOWER = 32 01 +BGM_FRLG_SILPH = 33 01 +BGM_FRLG_CERULEAN_CITY = 34 01 +BGM_FRLG_CELADON_CITY = 35 01 +BGM_FRLG_KACHI_TRAINER = 36 01 +BGM_FRLG_KACHI_WILD_POKEMON = 37 01 +BGM_FRLG_KACHI_LEADER = 38 01 +BGM_FRLG_VERMILION_CITY = 39 01 +BGM_FRLG_VIRIDIAN_CITY = 3A 01 +BGM_FRLG_RIVAL = 3B 01 +BGM_FRLG_RIVAL_POSTBATTLE = 3C 01 +BGM_FRLG_ME_POKEDEX_EVAL = 3D 01 +BGM_FRLG_ME_KEYITEM = 3E 01 +BGM_FRLG_FANFA_POKEMON_CAUGHT = 3F 01 +BGM_FRLG_FANFA_TRAINERCARD_PHOTO = 40 01 +BGM_FRLG_GAMEFREAK_LOGO = 41 01 +BGM_FRLG_CAUGHT_POKEMON = 42 01 +BGM_FRLG_GAME_EXPLANATION_START = 43 01 +BGM_FRLG_GAME_EXPLANATION_MIDDLE = 44 01 +BGM_FRLG_GAME_EXPLANATION_END = 45 01 +BGM_FRLG_POKEMON_JUMP = 46 01 +BGM_FRLG_UNION_ROOM = 47 01 +BGM_FRLG_POKEMON_NETWORK_CENTER = 48 01 +BGM_FRLG_MYSTERY_GIFT = 49 01 +BGM_FRLG_DODRIO_BERRY_PICK = 4A 01 +BGM_FRLG_MT_EMBER = 4B 01 +BGM_FRLG_TEACHY_TV_EPISODE = 4C 01 +BGM_FRLG_SEVII_ISLANDS = 4D 01 +BGM_FRLG_TANOBY_RUINS = 4E 01 +BGM_FRLG_ISLAND_ONE = 4F 01 +BGM_FRLG_ISLAND_FOUR = 50 01 +BGM_FRLG_ISLAND_SIX = 51 01 +BGM_FRLG_FLUTE = 52 01 +BGM_FRLG_BATTLE_DEOXYS = 53 01 +BGM_FRLG_BATTLE_MEWTWO = 54 01 +BGM_FRLG_BATTLE_LEGENDARY = 55 01 +BGM_FRLG_LEADER_EYE = 56 01 +BGM_FRLG_DEOXYS_EYE = 57 01 +BGM_FRLG_TRAINER_TOWER = 58 01 +BGM_FRLG_HALL_OF_FAME_PALLET_TOWN = 59 01 +BGM_FRLG_TEACHY_TV = 5A 01 + +BGM_STOP = 5D 01 +BGM_TETSUJI = 5E 01 +BGM_FIELD13 = 5F 01 +BGM_KACHI22 = 60 01 +BGM_KACHI2 = 61 01 +BGM_KACHI3 = 62 01 +BGM_KACHI5 = 63 01 +BGM_PCC = 64 01 +BGM_NIBI = 65 01 +BGM_SUIKUN = 66 01 +BGM_DOORO1 = 67 01 +BGM_DOORO_X1 = 68 01 +BGM_DOORO_X3 = 69 01 +BGM_MACHI_S2 = 6A 01 +BGM_MACHI_S4 = 6B 01 +BGM_GIM = 6C 01 +BGM_NAMINORI = 6D 01 +BGM_DAN01 = 6E 01 +BGM_FANFA1 = 6F 01 +BGM_ME_ASA = 70 01 +BGM_ME_BACHI = 71 01 +BGM_FANFA4 = 72 01 +BGM_FANFA5 = 73 01 +BGM_ME_WAZA = 74 01 +BGM_BIJYUTU = 75 01 +BGM_DOORO_X4 = 76 01 +BGM_FUNE_KAN = 77 01 +BGM_ME_SHINKA = 78 01 +BGM_SHINKA = 79 01 +BGM_ME_WASURE = 7A 01 +BGM_SYOUJOEYE = 7B 01 +BGM_BOYEYE = 7C 01 +BGM_DAN02 = 7D 01 +BGM_MACHI_S3 = 7E 01 +BGM_ODAMAKI = 7F 01 +BGM_B_TOWER = 80 01 +BGM_SWIMEYE = 81 01 +BGM_DAN03 = 82 01 +BGM_ME_KINOMI = 83 01 +BGM_ME_TAMA = 84 01 +BGM_ME_B_BIG = 85 01 +BGM_ME_B_SMALL = 86 01 +BGM_ME_ZANNEN = 87 01 +BGM_BD_TIME = 88 01 +BGM_TEST1 = 89 01 +BGM_TEST2 = 8A 01 +BGM_TEST3 = 8B 01 +BGM_TEST4 = 8C 01 +BGM_TEST = 8D 01 +BGM_GOMACHI0 = 8E 01 +BGM_GOTOWN = 8F 01 +BGM_POKECEN = 90 01 +BGM_NEXTROAD = 91 01 +BGM_GRANROAD = 92 01 +BGM_CYCLING = 93 01 +BGM_FRIENDLY = 94 01 +BGM_MISHIRO = 95 01 +BGM_TOZAN = 96 01 +BGM_GIRLEYE = 97 01 +BGM_MINAMO = 98 01 +BGM_ASHROAD = 99 01 +BGM_EVENT0 = 9A 01 +BGM_DEEPDEEP = 9B 01 +BGM_KACHI1 = 9C 01 +BGM_TITLE3 = 9D 01 +BGM_DEMO1 = 9E 01 +BGM_GIRL_SUP = 9F 01 +BGM_HAGESHII = A0 01 +BGM_KAKKOII = A1 01 +BGM_KAZANBAI = A2 01 +BGM_AQA_0 = A3 01 +BGM_TSURETEK = A4 01 +BGM_BOY_SUP = A5 01 +BGM_RAINBOW = A6 01 +BGM_AYASII = A7 01 +BGM_KACHI4 = A8 01 +BGM_ROPEWAY = A9 01 +BGM_CASINO = AA 01 +BGM_HIGHTOWN = AB 01 +BGM_SAFARI = AC 01 +BGM_C_ROAD = AD 01 +BGM_AJITO = AE 01 +BGM_M_BOAT = AF 01 +BGM_M_DUNGON = B0 01 +BGM_FINECITY = B1 01 +BGM_MACHUPI = B2 01 +BGM_P_SCHOOL = B3 01 +BGM_DENDOU = B4 01 +BGM_TONEKUSA = B5 01 +BGM_MABOROSI = B6 01 +BGM_CON_FAN = B7 01 +BGM_CONTEST0 = B8 01 +BGM_MGM0 = B9 01 +BGM_T_BATTLE = BA 01 +BGM_OOAME = BB 01 +BGM_HIDERI = BC 01 +BGM_RUNECITY = BD 01 +BGM_CON_K = BE 01 +BGM_EIKOU_R = BF 01 +BGM_KARAKURI = C0 01 +BGM_HUTAGO = C1 01 +BGM_SITENNOU = C2 01 +BGM_YAMA_EYE = C3 01 +BGM_CONLOBBY = C4 01 +BGM_INTER_V = C5 01 +BGM_DAIGO = C6 01 +BGM_THANKFOR = C7 01 +BGM_END = C8 01 +BGM_BATTLE27 = C9 01 +BGM_BATTLE31 = CA 01 +BGM_BATTLE20 = CB 01 +BGM_BATTLE32 = CC 01 +BGM_BATTLE33 = CD 01 +BGM_BATTLE36 = CE 01 +BGM_BATTLE34 = CF 01 +BGM_BATTLE35 = D0 01 +BGM_BATTLE38 = D1 01 +BGM_BATTLE30 = D2 01 + +'\l' = FA @ scroll up window text +'\p' = FB @ new paragraph +'\n' = FE @ new line diff --git a/data/data.s b/data/data.s new file mode 100644 index 0000000..71bbc6e --- /dev/null +++ b/data/data.s @@ -0,0 +1,426 @@ + .section .rodata +gUnknown_0201002C:: + .incbin "baserom.gba", 0x1002C, 0x20 + +gUnknown_0201004C:: + .incbin "baserom.gba", 0x1004C, 0x3f80 + +gUnknown_02013FCC:: + .incbin "baserom.gba", 0x13FCC, 0x100 + +gUnknown_020140CC:: + .incbin "baserom.gba", 0x140CC, 0xdc0 + +gUnknown_02014E8C:: + .incbin "baserom.gba", 0x14E8C, 0x100 + +gUnknown_02014F8C:: + .incbin "baserom.gba", 0x14F8C, 0x1fc0 + +gUnknown_02016F4C:: + .incbin "baserom.gba", 0x16F4C, 0x100 + +gUnknown_0201704C:: + .incbin "baserom.gba", 0x1704C, 0xdc0 + +gUnknown_02017E0C:: + .incbin "baserom.gba", 0x17E0C, 0x100 + +gUnknown_02017F0C:: + .incbin "baserom.gba", 0x17F0C, 0x2544 + +gUnknown_0201A450:: + .incbin "baserom.gba", 0x1A450, 0x1c8 + +gUnknown_0201A618:: + .incbin "baserom.gba", 0x1A618, 0x27c + +gUnknown_0201A894:: + .incbin "baserom.gba", 0x1A894, 0x20 + +gUnknown_0201A8B4:: + .incbin "baserom.gba", 0x1A8B4, 0x458 + +gUnknown_0201AD0C:: + .incbin "baserom.gba", 0x1AD0C, 0x3f0 + +gUnknown_0201B0FC:: + .incbin "baserom.gba", 0x1B0FC, 0xa4 + +gUnknown_0201B1A0:: + .incbin "baserom.gba", 0x1B1A0, 0x158 + +gUnknown_0201B2F8:: + .incbin "baserom.gba", 0x1B2F8, 0x138 + +gUnknown_0201B430:: + .incbin "baserom.gba", 0x1B430, 0x7c + +gUnknown_0201B4AC:: + .incbin "baserom.gba", 0x1B4AC, 0xb4c + +gUnknown_0201BFF8:: + .incbin "baserom.gba", 0x1BFF8, 0x114 + +gUnknown_0201C10C:: + .incbin "baserom.gba", 0x1C10C, 0x11c + +gUnknown_0201C228:: + .incbin "baserom.gba", 0x1C228, 0x200 + +gUnknown_0201C428:: + .incbin "baserom.gba", 0x1C428, 0x17c + +gUnknown_0201C5A4:: + .incbin "baserom.gba", 0x1C5A4, 0xab8 + +gUnknown_0201D05C:: + .incbin "baserom.gba", 0x1D05C, 0x124 + +gUnknown_0201D180:: + .incbin "baserom.gba", 0x1D180, 0x270 + +gUnknown_0201D3F0:: + .incbin "baserom.gba", 0x1D3F0, 0x30 + +gUnknown_0201D420:: + .incbin "baserom.gba", 0x1D420, 0x184 + +gUnknown_0201D5A4:: + .incbin "baserom.gba", 0x1D5A4, 0x120 + +gUnknown_0201D6C4:: + .incbin "baserom.gba", 0x1D6C4, 0x90 + +gUnknown_0201D754:: + .incbin "baserom.gba", 0x1D754, 0xb4 + +gUnknown_0201D808:: + .incbin "baserom.gba", 0x1D808, 0x30 + +gUnknown_0201D838:: + .incbin "baserom.gba", 0x1D838, 0x18 + +gUnknown_0201D850:: + .incbin "baserom.gba", 0x1D850, 0x84 + +gUnknown_0201D8D4:: + .incbin "baserom.gba", 0x1D8D4, 0x18 + +gUnknown_0201D8EC:: + .incbin "baserom.gba", 0x1D8EC, 0x3c + +gUnknown_0201D928:: + .incbin "baserom.gba", 0x1D928, 0x10 + +gUnknown_0201D938:: + .incbin "baserom.gba", 0x1D938, 0x34 + +gUnknown_0201D96C:: + .incbin "baserom.gba", 0x1D96C, 0x48c + +gUnknown_0201DDF8:: + .incbin "baserom.gba", 0x1DDF8, 0xc + +gUnknown_0201DE04:: + .incbin "baserom.gba", 0x1DE04, 0x974 + +gUnknown_0201E778:: + .incbin "baserom.gba", 0x1E778, 0x2 + +gUnknown_0201E77A:: + .incbin "baserom.gba", 0x1E77A, 0x76 + +gUnknown_0201E7F0:: + .incbin "baserom.gba", 0x1E7F0, 0x18 + +gUnknown_0201E808:: + .incbin "baserom.gba", 0x1E808, 0x4b8 + +gUnknown_0201ECC0:: + .incbin "baserom.gba", 0x1ECC0, 0x80 + +gUnknown_0201ED40:: + .incbin "baserom.gba", 0x1ED40, 0x17 + +gUnknown_0201ED57:: + .incbin "baserom.gba", 0x1ED57, 0x4 + +gUnknown_0201ED5B:: + .incbin "baserom.gba", 0x1ED5B, 0x9 + +gUnknown_0201ED64:: + .incbin "baserom.gba", 0x1ED64, 0x338 + +gUnknown_0201F09C:: + .incbin "baserom.gba", 0x1F09C, 0x18 + +gUnknown_0201F0B4:: + .incbin "baserom.gba", 0x1F0B4, 0x48 + +gUnknown_0201F0FC:: + .incbin "baserom.gba", 0x1F0FC, 0x84 + +gUnknown_0201F180:: + .incbin "baserom.gba", 0x1F180, 0x118 + +gUnknown_0201F298:: + .incbin "baserom.gba", 0x1F298, 0xc + +gUnknown_0201F2A4:: + .incbin "baserom.gba", 0x1F2A4, 0x10 + +gUnknown_0201F2B4:: + .incbin "baserom.gba", 0x1F2B4, 0x50 + +gUnknown_0201F304:: + .incbin "baserom.gba", 0x1F304, 0x14 + +gUnknown_0201F318:: + .incbin "baserom.gba", 0x1F318, 0x194 + +gUnknown_0201F4AC:: + .incbin "baserom.gba", 0x1F4AC, 0x4 + +gUnknown_0201F4B0:: + .incbin "baserom.gba", 0x1F4B0, 0x200 + +gUnknown_0201F6B0:: + .incbin "baserom.gba", 0x1F6B0, 0x200 + +gUnknown_0201F8B0:: + .incbin "baserom.gba", 0x1F8B0, 0x20 + +gUnknown_0201F8D0:: + .incbin "baserom.gba", 0x1F8D0, 0x20 + +gUnknown_0201F8F0:: + .incbin "baserom.gba", 0x1F8F0, 0x20 + +gUnknown_0201F910:: + .incbin "baserom.gba", 0x1F910, 0x48 + +gUnknown_0201F958:: + .incbin "baserom.gba", 0x1F958, 0x50 + +gUnknown_0201F9A8:: + .incbin "baserom.gba", 0x1F9A8, 0x8 + +gUnknown_0201F9B0:: + .incbin "baserom.gba", 0x1F9B0, 0xc + +gUnknown_0201F9BC:: + .incbin "baserom.gba", 0x1F9BC, 0x18 + +gUnknown_0201F9D4:: + .incbin "baserom.gba", 0x1F9D4, 0x18 + +gUnknown_0201F9EC:: + .incbin "baserom.gba", 0x1F9EC, 0x8 + +gUnknown_0201F9F4:: + .incbin "baserom.gba", 0x1F9F4, 0x48 + +gUnknown_0201FA3C:: + .incbin "baserom.gba", 0x1FA3C, 0x8 + +gUnknown_0201FA44:: + .incbin "baserom.gba", 0x1FA44, 0x18 + +gUnknown_0201FA5C:: + .incbin "baserom.gba", 0x1FA5C, 0x18 + +gUnknown_0201FA74:: + .incbin "baserom.gba", 0x1FA74, 0x84 + +gUnknown_0201FAF8:: + .incbin "baserom.gba", 0x1FAF8, 0x18 + +gUnknown_0201FB10:: + .incbin "baserom.gba", 0x1FB10, 0x20 + +gUnknown_0201FB30:: + .incbin "baserom.gba", 0x1FB30, 0x20 + +gUnknown_0201FB50:: + .incbin "baserom.gba", 0x1FB50, 0x20 + +gUnknown_0201FB70:: + .incbin "baserom.gba", 0x1FB70, 0x20 + +gUnknown_0201FB90:: + .incbin "baserom.gba", 0x1FB90, 0x20 + +gUnknown_0201FBB0:: + .incbin "baserom.gba", 0x1FBB0, 0x94 + +gUnknown_0201FC44:: + .incbin "baserom.gba", 0x1FC44, 0x8 + +gUnknown_0201FC4C:: + .incbin "baserom.gba", 0x1FC4C, 0x18 + +gUnknown_0201FC64:: + .incbin "baserom.gba", 0x1FC64, 0x3c + +gUnknown_0201FCA0:: + .incbin "baserom.gba", 0x1FCA0, 0x54 + +gUnknown_0201FCF4:: + .incbin "baserom.gba", 0x1FCF4, 0x6c + +gUnknown_0201FD60:: + .incbin "baserom.gba", 0x1FD60, 0x34 + +gUnknown_0201FD94:: + .incbin "baserom.gba", 0x1FD94, 0x30 + +gUnknown_0201FDC4:: + .incbin "baserom.gba", 0x1FDC4, 0x30 + +gUnknown_0201FDF4:: + .incbin "baserom.gba", 0x1FDF4, 0x30 + +gUnknown_0201FE24:: + .incbin "baserom.gba", 0x1FE24, 0x18 + +gUnknown_0201FE3C:: + .incbin "baserom.gba", 0x1FE3C, 0x20 + +gUnknown_0201FE5C:: + .incbin "baserom.gba", 0x1FE5C, 0x20 + +gUnknown_0201FE7C:: + .incbin "baserom.gba", 0x1FE7C, 0x48 + +gUnknown_0201FEC4:: + .incbin "baserom.gba", 0x1FEC4, 0x90 + +gUnknown_0201FF54:: + .incbin "baserom.gba", 0x1FF54, 0x1a + +gUnknown_0201FF6E:: + .incbin "baserom.gba", 0x1FF6E, 0x19 + +gUnknown_0201FF87:: + .incbin "baserom.gba", 0x1FF87, 0x11 + +gUnknown_0201FF98:: + .incbin "baserom.gba", 0x1FF98, 0x7 + +gUnknown_0201FF9F:: + .incbin "baserom.gba", 0x1FF9F, 0x9 + +gUnknown_0201FFA8:: + .incbin "baserom.gba", 0x1FFA8, 0x8 + +gUnknown_0201FFB0:: + .incbin "baserom.gba", 0x1FFB0, 0x7 + +gUnknown_0201FFB7:: + .incbin "baserom.gba", 0x1FFB7, 0x7 + +gUnknown_0201FFBE:: + .incbin "baserom.gba", 0x1FFBE, 0x9 + +gUnknown_0201FFC7:: + .incbin "baserom.gba", 0x1FFC7, 0xf + +gUnknown_0201FFD6:: + .incbin "baserom.gba", 0x1FFD6, 0xd + +gUnknown_0201FFE3:: + .incbin "baserom.gba", 0x1FFE3, 0x5 + +gUnknown_0201FFE8:: + .incbin "baserom.gba", 0x1FFE8, 0x3 + +gUnknown_0201FFEB:: + .incbin "baserom.gba", 0x1FFEB, 0x7 + +gUnknown_0201FFF2:: + .incbin "baserom.gba", 0x1FFF2, 0x8 + +gUnknown_0201FFFA:: + .incbin "baserom.gba", 0x1FFFA, 0x8 + +gUnknown_02020002:: + .incbin "baserom.gba", 0x20002, 0x8 + +gUnknown_0202000A:: + .incbin "baserom.gba", 0x2000A, 0x6 + +gUnknown_02020010:: + .incbin "baserom.gba", 0x20010, 0x5 + +gUnknown_02020015:: + .incbin "baserom.gba", 0x20015, 0x6 + +gUnknown_0202001B:: + .incbin "baserom.gba", 0x2001B, 0x7 + +gUnknown_02020022:: + .incbin "baserom.gba", 0x20022, 0x5 + +gUnknown_02020027:: + .incbin "baserom.gba", 0x20027, 0x2 + +gUnknown_02020029:: + .incbin "baserom.gba", 0x20029, 0x3 + +gUnknown_0202002C:: + .incbin "baserom.gba", 0x2002C, 0x4 + +gUnknown_02020030:: + .incbin "baserom.gba", 0x20030, 0x6 + +gUnknown_02020036:: + .incbin "baserom.gba", 0x20036, 0x9 + +gUnknown_0202003F:: + .incbin "baserom.gba", 0x2003F, 0x7 + +gUnknown_02020046:: + .incbin "baserom.gba", 0x20046, 0x7 + +gUnknown_0202004D:: + .incbin "baserom.gba", 0x2004D, 0x2 + +gUnknown_0202004F:: + .incbin "baserom.gba", 0x2004F, 0x7 + +gUnknown_02020056:: + .incbin "baserom.gba", 0x20056, 0x31 + +gUnknown_02020087:: + .incbin "baserom.gba", 0x20087, 0x11 + +gUnknown_02020098:: + .incbin "baserom.gba", 0x20098, 0x77 + +gUnknown_0202010F:: + .incbin "baserom.gba", 0x2010F, 0x3f9 + +gUnknown_02020508:: + .incbin "baserom.gba", 0x20508, 0x44 + +gUnknown_0202054C:: + .incbin "baserom.gba", 0x2054C, 0x70 + +gUnknown_020205BC:: + .incbin "baserom.gba", 0x205BC, 0x70 + +gUnknown_0202062C:: + .incbin "baserom.gba", 0x2062C, 0x8 + +gUnknown_02020634:: + .incbin "baserom.gba", 0x20634, 0x100 + +gUnknown_02020734:: + .incbin "baserom.gba", 0x20734, 0x100 + +gUnknown_02020834:: + .incbin "baserom.gba", 0x20834, 0x100 + +gUnknown_02020934:: + .incbin "baserom.gba", 0x20934, 0x100 diff --git a/include/gba/defines.h b/include/gba/defines.h new file mode 100644 index 0000000..3920a24 --- /dev/null +++ b/include/gba/defines.h @@ -0,0 +1,65 @@ +#ifndef GUARD_GBA_DEFINES +#define GUARD_GBA_DEFINES + +#include + +#define TRUE 1 +#define FALSE 0 + +#define BSS_DATA __attribute__((section(".bss"))) +#define IWRAM_DATA __attribute__((section("iwram_data"))) +#define EWRAM_DATA __attribute__((section("ewram_data"))) +#define UNUSED __attribute__((unused)) +#define NAKED __attribute__((naked)) + +#define ALIGNED(n) __attribute__((aligned(n))) + +#define SOUND_INFO_PTR (*(struct SoundInfo **)0x3007FF0) +#define INTR_CHECK (*(u16 *)0x3007FF8) +#define INTR_VECTOR (*(void **)0x3007FFC) + +#define PLTT 0x5000000 +#define PLTT_SIZE 0x400 + +#define BG_PLTT PLTT +#define BG_PLTT_SIZE 0x200 + +#define OBJ_PLTT (PLTT + 0x200) +#define OBJ_PLTT_SIZE 0x200 + +#define VRAM 0x6000000 +#define VRAM_SIZE 0x18000 + +#define BG_VRAM VRAM +#define BG_VRAM_SIZE 0x10000 +#define BG_CHAR_ADDR(n) (void *)(BG_VRAM + (0x4000 * (n))) +#define BG_SCREEN_ADDR(n) (void *)(BG_VRAM + (0x800 * (n))) +#define BG_TILE_ADDR(n) (void *)(BG_VRAM + (0x80 * (n))) + +// text-mode BG +#define OBJ_VRAM0 (void *)(VRAM + 0x10000) +#define OBJ_VRAM0_SIZE 0x8000 + +// bitmap-mode BG +#define OBJ_VRAM1 (void *)(VRAM + 0x14000) +#define OBJ_VRAM1_SIZE 0x4000 + +#define OAM 0x7000000 +#define OAM_SIZE 0x400 + +#define DISPLAY_WIDTH 240 +#define DISPLAY_HEIGHT 160 + +#define TILE_SIZE_4BPP 32 +#define TILE_SIZE_8BPP 64 + +#define TOTAL_OBJ_TILE_COUNT 1024 + +#define RGB(r, g, b) ((r) | ((g) << 5) | ((b) << 10)) + +#define RGB_BLACK RGB(0, 0, 0) +#define RGB_WHITE RGB(31, 31, 31) + +#define WIN_RANGE(a, b) (((a) << 8) | (b)) + +#endif // GUARD_GBA_DEFINES diff --git a/include/gba/flash_internal.h b/include/gba/flash_internal.h new file mode 100644 index 0000000..39e14ef --- /dev/null +++ b/include/gba/flash_internal.h @@ -0,0 +1,83 @@ +#ifndef GUARD_GBA_FLASH_INTERNAL_H +#define GUARD_GBA_FLASH_INTERNAL_H + +#define FLASH_BASE ((u8 *)0xE000000) + +#define FLASH_WRITE(addr, data) ((*(vu8 *)(FLASH_BASE + (addr))) = (data)) + +#define FLASH_ROM_SIZE_1M 131072 // 1 megabit ROM + +#define SECTORS_PER_BANK 16 + +struct FlashSector +{ + u32 size; + u8 shift; + u16 count; + u16 top; +}; + +struct FlashType { + u32 romSize; + struct FlashSector sector; + u16 wait[2]; // game pak bus read/write wait + + // TODO: add support for anonymous unions/structs if possible + union { + struct { + u8 makerId; + u8 deviceId; + } separate; + u16 joined; + } ids; +}; + +struct FlashSetupInfo +{ + u16 (*programFlashByte)(u16, u32, u8); + u16 (*programFlashSector)(u16, void *); + u16 (*eraseFlashChip)(void); + u16 (*eraseFlashSector)(u16); + u16 (*WaitForFlashWrite)(u8, u8 *, u8); + const u16 *maxTime; + struct FlashType type; +}; + +extern u16 gFlashNumRemainingBytes; + +extern u16 (*ProgramFlashByte)(u16, u32, u8); +extern u16 (*ProgramFlashSector)(u16, void *); +extern u16 (*EraseFlashChip)(void); +extern u16 (*EraseFlashSector)(u16); +extern u16 (*WaitForFlashWrite)(u8, u8 *, u8); +extern const u16 *gFlashMaxTime; +extern const struct FlashType *gFlash; + +extern u8 (*PollFlashStatus)(u8 *); +extern u8 gFlashTimeoutFlag; + +extern const struct FlashSetupInfo MX29L010; +extern const struct FlashSetupInfo LE26FV10N1TS; +extern const struct FlashSetupInfo DefaultFlash; + +void SwitchFlashBank(u8 bankNum); +u16 ReadFlashId(void); +void StartFlashTimer(u8 phase); +void SetReadFlash1(u16 *dest); +void StopFlashTimer(void); +u16 SetFlashTimerIntr(u8 timerNum, void (**intrFunc)(void)); +u32 ProgramFlashSectorAndVerify(u16 sectorNum, u8 *src); +void ReadFlash(u16 sectorNum, u32 offset, void *dest, u32 size); +u32 ProgramFlashSectorAndVerifyNBytes(u16 sectorNum, void *dataSrc, u32 n); + +u16 WaitForFlashWrite_Common(u8 phase, u8 *addr, u8 lastData); + +u16 EraseFlashChip_MX(void); +u16 EraseFlashSector_MX(u16 sectorNum); +u16 ProgramFlashByte_MX(u16 sectorNum, u32 offset, u8 data); +u16 ProgramFlashSector_MX(u16 sectorNum, void *src); + +// agb_flash_1m +u16 IdentifyFlash(void); + +#endif // GUARD_GBA_FLASH_INTERNAL_H diff --git a/include/gba/gba.h b/include/gba/gba.h new file mode 100644 index 0000000..3493440 --- /dev/null +++ b/include/gba/gba.h @@ -0,0 +1,12 @@ +#ifndef GUARD_GBA_GBA_H +#define GUARD_GBA_GBA_H + +#include "gba/defines.h" +#include "gba/io_reg.h" +#include "gba/types.h" +#include "gba/multiboot.h" +#include "gba/syscall.h" +#include "gba/macro.h" +#include "gba/isagbprint.h" + +#endif // GUARD_GBA_GBA_H diff --git a/include/gba/io_reg.h b/include/gba/io_reg.h new file mode 100644 index 0000000..2dda7b5 --- /dev/null +++ b/include/gba/io_reg.h @@ -0,0 +1,763 @@ +#ifndef GUARD_GBA_IO_REG_H +#define GUARD_GBA_IO_REG_H + +#define REG_BASE 0x4000000 // I/O register base address + +// I/O register offsets + +#define REG_OFFSET_DISPCNT 0x0 +#define REG_OFFSET_DISPSTAT 0x4 +#define REG_OFFSET_VCOUNT 0x6 +#define REG_OFFSET_BG0CNT 0x8 +#define REG_OFFSET_BG1CNT 0xa +#define REG_OFFSET_BG2CNT 0xc +#define REG_OFFSET_BG3CNT 0xe +#define REG_OFFSET_BG0HOFS 0x10 +#define REG_OFFSET_BG0VOFS 0x12 +#define REG_OFFSET_BG1HOFS 0x14 +#define REG_OFFSET_BG1VOFS 0x16 +#define REG_OFFSET_BG2HOFS 0x18 +#define REG_OFFSET_BG2VOFS 0x1a +#define REG_OFFSET_BG3HOFS 0x1c +#define REG_OFFSET_BG3VOFS 0x1e +#define REG_OFFSET_BG2PA 0x20 +#define REG_OFFSET_BG2PB 0x22 +#define REG_OFFSET_BG2PC 0x24 +#define REG_OFFSET_BG2PD 0x26 +#define REG_OFFSET_BG2X 0x28 +#define REG_OFFSET_BG2X_L 0x28 +#define REG_OFFSET_BG2X_H 0x2a +#define REG_OFFSET_BG2Y 0x2c +#define REG_OFFSET_BG2Y_L 0x2c +#define REG_OFFSET_BG2Y_H 0x2e +#define REG_OFFSET_BG3PA 0x30 +#define REG_OFFSET_BG3PB 0x32 +#define REG_OFFSET_BG3PC 0x34 +#define REG_OFFSET_BG3PD 0x36 +#define REG_OFFSET_BG3X 0x38 +#define REG_OFFSET_BG3X_L 0x38 +#define REG_OFFSET_BG3X_H 0x3a +#define REG_OFFSET_BG3Y 0x3c +#define REG_OFFSET_BG3Y_L 0x3c +#define REG_OFFSET_BG3Y_H 0x3e +#define REG_OFFSET_WIN0H 0x40 +#define REG_OFFSET_WIN1H 0x42 +#define REG_OFFSET_WIN0V 0x44 +#define REG_OFFSET_WIN1V 0x46 +#define REG_OFFSET_WININ 0x48 +#define REG_OFFSET_WINOUT 0x4a +#define REG_OFFSET_MOSAIC 0x4c +#define REG_OFFSET_BLDCNT 0x50 +#define REG_OFFSET_BLDALPHA 0x52 +#define REG_OFFSET_BLDY 0x54 + +#define REG_OFFSET_SOUND1CNT_L 0x60 +#define REG_OFFSET_NR10 0x60 +#define REG_OFFSET_SOUND1CNT_H 0x62 +#define REG_OFFSET_NR11 0x62 +#define REG_OFFSET_NR12 0x63 +#define REG_OFFSET_SOUND1CNT_X 0x64 +#define REG_OFFSET_NR13 0x64 +#define REG_OFFSET_NR14 0x65 +#define REG_OFFSET_SOUND2CNT_L 0x68 +#define REG_OFFSET_NR21 0x68 +#define REG_OFFSET_NR22 0x69 +#define REG_OFFSET_SOUND2CNT_H 0x6c +#define REG_OFFSET_NR23 0x6c +#define REG_OFFSET_NR24 0x6d +#define REG_OFFSET_SOUND3CNT_L 0x70 +#define REG_OFFSET_NR30 0x70 +#define REG_OFFSET_SOUND3CNT_H 0x72 +#define REG_OFFSET_NR31 0x72 +#define REG_OFFSET_NR32 0x73 +#define REG_OFFSET_SOUND3CNT_X 0x74 +#define REG_OFFSET_NR33 0x74 +#define REG_OFFSET_NR34 0x75 +#define REG_OFFSET_SOUND4CNT_L 0x78 +#define REG_OFFSET_NR41 0x78 +#define REG_OFFSET_NR42 0x79 +#define REG_OFFSET_SOUND4CNT_H 0x7c +#define REG_OFFSET_NR43 0x7c +#define REG_OFFSET_NR44 0x7d +#define REG_OFFSET_SOUNDCNT_L 0x80 +#define REG_OFFSET_NR50 0x80 +#define REG_OFFSET_NR51 0x81 +#define REG_OFFSET_SOUNDCNT_H 0x82 +#define REG_OFFSET_SOUNDCNT_X 0x84 +#define REG_OFFSET_NR52 0x84 +#define REG_OFFSET_SOUNDBIAS 0x88 +#define REG_OFFSET_SOUNDBIAS_L 0x88 +#define REG_OFFSET_SOUNDBIAS_H 0x89 +#define REG_OFFSET_WAVE_RAM0 0x90 +#define REG_OFFSET_WAVE_RAM1 0x94 +#define REG_OFFSET_WAVE_RAM2 0x98 +#define REG_OFFSET_WAVE_RAM3 0x9c +#define REG_OFFSET_FIFO_A 0xa0 +#define REG_OFFSET_FIFO_B 0xa4 + +#define REG_OFFSET_DMA0 0xb0 +#define REG_OFFSET_DMA0SAD 0xb0 +#define REG_OFFSET_DMA0SAD_L 0xb0 +#define REG_OFFSET_DMA0SAD_H 0xb2 +#define REG_OFFSET_DMA0DAD 0xb4 +#define REG_OFFSET_DMA0DAD_L 0xb4 +#define REG_OFFSET_DMA0DAD_H 0xb6 +#define REG_OFFSET_DMA0CNT 0xb8 +#define REG_OFFSET_DMA0CNT_L 0xb8 +#define REG_OFFSET_DMA0CNT_H 0xba +#define REG_OFFSET_DMA1 0xbc +#define REG_OFFSET_DMA1SAD 0xbc +#define REG_OFFSET_DMA1SAD_L 0xbc +#define REG_OFFSET_DMA1SAD_H 0xbe +#define REG_OFFSET_DMA1DAD 0xc0 +#define REG_OFFSET_DMA1DAD_L 0xc0 +#define REG_OFFSET_DMA1DAD_H 0xc2 +#define REG_OFFSET_DMA1CNT 0xc4 +#define REG_OFFSET_DMA1CNT_L 0xc4 +#define REG_OFFSET_DMA1CNT_H 0xc6 +#define REG_OFFSET_DMA2 0xc8 +#define REG_OFFSET_DMA2SAD 0xc8 +#define REG_OFFSET_DMA2SAD_L 0xc8 +#define REG_OFFSET_DMA2SAD_H 0xca +#define REG_OFFSET_DMA2DAD 0xcc +#define REG_OFFSET_DMA2DAD_L 0xcc +#define REG_OFFSET_DMA2DAD_H 0xce +#define REG_OFFSET_DMA2CNT 0xd0 +#define REG_OFFSET_DMA2CNT_L 0xd0 +#define REG_OFFSET_DMA2CNT_H 0xd2 +#define REG_OFFSET_DMA3 0xd4 +#define REG_OFFSET_DMA3SAD 0xd4 +#define REG_OFFSET_DMA3SAD_L 0xd4 +#define REG_OFFSET_DMA3SAD_H 0xd6 +#define REG_OFFSET_DMA3DAD 0xd8 +#define REG_OFFSET_DMA3DAD_L 0xd8 +#define REG_OFFSET_DMA3DAD_H 0xda +#define REG_OFFSET_DMA3CNT 0xdc +#define REG_OFFSET_DMA3CNT_L 0xdc +#define REG_OFFSET_DMA3CNT_H 0xde + +#define REG_OFFSET_TMCNT 0x100 +#define REG_OFFSET_TM0CNT 0x100 +#define REG_OFFSET_TM0CNT_L 0x100 +#define REG_OFFSET_TM0CNT_H 0x102 +#define REG_OFFSET_TM1CNT 0x104 +#define REG_OFFSET_TM1CNT_L 0x104 +#define REG_OFFSET_TM1CNT_H 0x106 +#define REG_OFFSET_TM2CNT 0x108 +#define REG_OFFSET_TM2CNT_L 0x108 +#define REG_OFFSET_TM2CNT_H 0x10a +#define REG_OFFSET_TM3CNT 0x10c +#define REG_OFFSET_TM3CNT_L 0x10c +#define REG_OFFSET_TM3CNT_H 0x10e + +#define REG_OFFSET_SIOCNT 0x128 +#define REG_OFFSET_SIODATA8 0x12a +#define REG_OFFSET_SIODATA32 0x120 +#define REG_OFFSET_SIOMLT_SEND 0x12a +#define REG_OFFSET_SIOMLT_RECV 0x120 +#define REG_OFFSET_SIOMULTI0 0x120 +#define REG_OFFSET_SIOMULTI1 0x122 +#define REG_OFFSET_SIOMULTI2 0x124 +#define REG_OFFSET_SIOMULTI3 0x126 + +#define REG_OFFSET_KEYINPUT 0x130 +#define REG_OFFSET_KEYCNT 0x132 + +#define REG_OFFSET_RCNT 0x134 + +#define REG_OFFSET_JOYCNT 0x140 +#define REG_OFFSET_JOYSTAT 0x158 +#define REG_OFFSET_JOY_RECV 0x150 +#define REG_OFFSET_JOY_RECV_L 0x150 +#define REG_OFFSET_JOY_RECV_H 0x152 +#define REG_OFFSET_JOY_TRANS 0x154 +#define REG_OFFSET_JOY_TRANS_L 0x154 +#define REG_OFFSET_JOY_TRANS_H 0x156 + +#define REG_OFFSET_IME 0x208 +#define REG_OFFSET_IE 0x200 +#define REG_OFFSET_IF 0x202 + +#define REG_OFFSET_WAITCNT 0x204 + +// I/O register addresses + +#define REG_ADDR_DISPCNT (REG_BASE + REG_OFFSET_DISPCNT) +#define REG_ADDR_DISPSTAT (REG_BASE + REG_OFFSET_DISPSTAT) +#define REG_ADDR_VCOUNT (REG_BASE + REG_OFFSET_VCOUNT) +#define REG_ADDR_BG0CNT (REG_BASE + REG_OFFSET_BG0CNT) +#define REG_ADDR_BG1CNT (REG_BASE + REG_OFFSET_BG1CNT) +#define REG_ADDR_BG2CNT (REG_BASE + REG_OFFSET_BG2CNT) +#define REG_ADDR_BG3CNT (REG_BASE + REG_OFFSET_BG3CNT) +#define REG_ADDR_BG0HOFS (REG_BASE + REG_OFFSET_BG0HOFS) +#define REG_ADDR_BG0VOFS (REG_BASE + REG_OFFSET_BG0VOFS) +#define REG_ADDR_BG1HOFS (REG_BASE + REG_OFFSET_BG1HOFS) +#define REG_ADDR_BG1VOFS (REG_BASE + REG_OFFSET_BG1VOFS) +#define REG_ADDR_BG2HOFS (REG_BASE + REG_OFFSET_BG2HOFS) +#define REG_ADDR_BG2VOFS (REG_BASE + REG_OFFSET_BG2VOFS) +#define REG_ADDR_BG3HOFS (REG_BASE + REG_OFFSET_BG3HOFS) +#define REG_ADDR_BG3VOFS (REG_BASE + REG_OFFSET_BG3VOFS) +#define REG_ADDR_BG2PA (REG_BASE + REG_OFFSET_BG2PA) +#define REG_ADDR_BG2PB (REG_BASE + REG_OFFSET_BG2PB) +#define REG_ADDR_BG2PC (REG_BASE + REG_OFFSET_BG2PC) +#define REG_ADDR_BG2PD (REG_BASE + REG_OFFSET_BG2PD) +#define REG_ADDR_BG2X (REG_BASE + REG_OFFSET_BG2X) +#define REG_ADDR_BG2X_L (REG_BASE + REG_OFFSET_BG2X_L) +#define REG_ADDR_BG2X_H (REG_BASE + REG_OFFSET_BG2X_H) +#define REG_ADDR_BG2Y (REG_BASE + REG_OFFSET_BG2Y) +#define REG_ADDR_BG2Y_L (REG_BASE + REG_OFFSET_BG2Y_L) +#define REG_ADDR_BG2Y_H (REG_BASE + REG_OFFSET_BG2Y_H) +#define REG_ADDR_BG3PA (REG_BASE + REG_OFFSET_BG3PA) +#define REG_ADDR_BG3PB (REG_BASE + REG_OFFSET_BG3PB) +#define REG_ADDR_BG3PC (REG_BASE + REG_OFFSET_BG3PC) +#define REG_ADDR_BG3PD (REG_BASE + REG_OFFSET_BG3PD) +#define REG_ADDR_BG3X (REG_BASE + REG_OFFSET_BG3X) +#define REG_ADDR_BG3X_L (REG_BASE + REG_OFFSET_BG3X_L) +#define REG_ADDR_BG3X_H (REG_BASE + REG_OFFSET_BG3X_H) +#define REG_ADDR_BG3Y (REG_BASE + REG_OFFSET_BG3Y) +#define REG_ADDR_BG3Y_L (REG_BASE + REG_OFFSET_BG3Y_L) +#define REG_ADDR_BG3Y_H (REG_BASE + REG_OFFSET_BG3Y_H) +#define REG_ADDR_WIN0H (REG_BASE + REG_OFFSET_WIN0H) +#define REG_ADDR_WIN1H (REG_BASE + REG_OFFSET_WIN1H) +#define REG_ADDR_WIN0V (REG_BASE + REG_OFFSET_WIN0V) +#define REG_ADDR_WIN1V (REG_BASE + REG_OFFSET_WIN1V) +#define REG_ADDR_WININ (REG_BASE + REG_OFFSET_WININ) +#define REG_ADDR_WINOUT (REG_BASE + REG_OFFSET_WINOUT) +#define REG_ADDR_MOSAIC (REG_BASE + REG_OFFSET_MOSAIC) +#define REG_ADDR_BLDCNT (REG_BASE + REG_OFFSET_BLDCNT) +#define REG_ADDR_BLDALPHA (REG_BASE + REG_OFFSET_BLDALPHA) +#define REG_ADDR_BLDY (REG_BASE + REG_OFFSET_BLDY) + +#define REG_ADDR_SOUND1CNT_L (REG_BASE + REG_OFFSET_SOUND1CNT_L) +#define REG_ADDR_NR10 (REG_BASE + REG_OFFSET_NR10) +#define REG_ADDR_SOUND1CNT_H (REG_BASE + REG_OFFSET_SOUND1CNT_H) +#define REG_ADDR_NR11 (REG_BASE + REG_OFFSET_NR11) +#define REG_ADDR_NR12 (REG_BASE + REG_OFFSET_NR12) +#define REG_ADDR_SOUND1CNT_X (REG_BASE + REG_OFFSET_SOUND1CNT_X) +#define REG_ADDR_NR13 (REG_BASE + REG_OFFSET_NR13) +#define REG_ADDR_NR14 (REG_BASE + REG_OFFSET_NR14) +#define REG_ADDR_SOUND2CNT_L (REG_BASE + REG_OFFSET_SOUND2CNT_L) +#define REG_ADDR_NR21 (REG_BASE + REG_OFFSET_NR21) +#define REG_ADDR_NR22 (REG_BASE + REG_OFFSET_NR22) +#define REG_ADDR_SOUND2CNT_H (REG_BASE + REG_OFFSET_SOUND2CNT_H) +#define REG_ADDR_NR23 (REG_BASE + REG_OFFSET_NR23) +#define REG_ADDR_NR24 (REG_BASE + REG_OFFSET_NR24) +#define REG_ADDR_SOUND3CNT_L (REG_BASE + REG_OFFSET_SOUND3CNT_L) +#define REG_ADDR_NR30 (REG_BASE + REG_OFFSET_NR30) +#define REG_ADDR_SOUND3CNT_H (REG_BASE + REG_OFFSET_SOUND3CNT_H) +#define REG_ADDR_NR31 (REG_BASE + REG_OFFSET_NR31) +#define REG_ADDR_NR32 (REG_BASE + REG_OFFSET_NR32) +#define REG_ADDR_SOUND3CNT_X (REG_BASE + REG_OFFSET_SOUND3CNT_X) +#define REG_ADDR_NR33 (REG_BASE + REG_OFFSET_NR33) +#define REG_ADDR_NR34 (REG_BASE + REG_OFFSET_NR34) +#define REG_ADDR_SOUND4CNT_L (REG_BASE + REG_OFFSET_SOUND4CNT_L) +#define REG_ADDR_NR41 (REG_BASE + REG_OFFSET_NR41) +#define REG_ADDR_NR42 (REG_BASE + REG_OFFSET_NR42) +#define REG_ADDR_SOUND4CNT_H (REG_BASE + REG_OFFSET_SOUND4CNT_H) +#define REG_ADDR_NR43 (REG_BASE + REG_OFFSET_NR43) +#define REG_ADDR_NR44 (REG_BASE + REG_OFFSET_NR44) +#define REG_ADDR_SOUNDCNT_L (REG_BASE + REG_OFFSET_SOUNDCNT_L) +#define REG_ADDR_NR50 (REG_BASE + REG_OFFSET_NR50) +#define REG_ADDR_NR51 (REG_BASE + REG_OFFSET_NR51) +#define REG_ADDR_SOUNDCNT_H (REG_BASE + REG_OFFSET_SOUNDCNT_H) +#define REG_ADDR_SOUNDCNT_X (REG_BASE + REG_OFFSET_SOUNDCNT_X) +#define REG_ADDR_NR52 (REG_BASE + REG_OFFSET_NR52) +#define REG_ADDR_SOUNDBIAS (REG_BASE + REG_OFFSET_SOUNDBIAS) +#define REG_ADDR_SOUNDBIAS_L (REG_BASE + REG_OFFSET_SOUNDBIAS_L) +#define REG_ADDR_SOUNDBIAS_H (REG_BASE + REG_OFFSET_SOUNDBIAS_H) +#define REG_ADDR_WAVE_RAM0 (REG_BASE + REG_OFFSET_WAVE_RAM0) +#define REG_ADDR_WAVE_RAM1 (REG_BASE + REG_OFFSET_WAVE_RAM1) +#define REG_ADDR_WAVE_RAM2 (REG_BASE + REG_OFFSET_WAVE_RAM2) +#define REG_ADDR_WAVE_RAM3 (REG_BASE + REG_OFFSET_WAVE_RAM3) +#define REG_ADDR_FIFO_A (REG_BASE + REG_OFFSET_FIFO_A) +#define REG_ADDR_FIFO_B (REG_BASE + REG_OFFSET_FIFO_B) + +#define REG_ADDR_DMA0 (REG_BASE + REG_OFFSET_DMA0) +#define REG_ADDR_DMA0SAD (REG_BASE + REG_OFFSET_DMA0SAD) +#define REG_ADDR_DMA0DAD (REG_BASE + REG_OFFSET_DMA0DAD) +#define REG_ADDR_DMA0CNT (REG_BASE + REG_OFFSET_DMA0CNT) +#define REG_ADDR_DMA0CNT_L (REG_BASE + REG_OFFSET_DMA0CNT_L) +#define REG_ADDR_DMA0CNT_H (REG_BASE + REG_OFFSET_DMA0CNT_H) +#define REG_ADDR_DMA1 (REG_BASE + REG_OFFSET_DMA1) +#define REG_ADDR_DMA1SAD (REG_BASE + REG_OFFSET_DMA1SAD) +#define REG_ADDR_DMA1DAD (REG_BASE + REG_OFFSET_DMA1DAD) +#define REG_ADDR_DMA1CNT (REG_BASE + REG_OFFSET_DMA1CNT) +#define REG_ADDR_DMA1CNT_L (REG_BASE + REG_OFFSET_DMA1CNT_L) +#define REG_ADDR_DMA1CNT_H (REG_BASE + REG_OFFSET_DMA1CNT_H) +#define REG_ADDR_DMA2 (REG_BASE + REG_OFFSET_DMA2) +#define REG_ADDR_DMA2SAD (REG_BASE + REG_OFFSET_DMA2SAD) +#define REG_ADDR_DMA2DAD (REG_BASE + REG_OFFSET_DMA2DAD) +#define REG_ADDR_DMA2CNT (REG_BASE + REG_OFFSET_DMA2CNT) +#define REG_ADDR_DMA2CNT_L (REG_BASE + REG_OFFSET_DMA2CNT_L) +#define REG_ADDR_DMA2CNT_H (REG_BASE + REG_OFFSET_DMA2CNT_H) +#define REG_ADDR_DMA3 (REG_BASE + REG_OFFSET_DMA3) +#define REG_ADDR_DMA3SAD (REG_BASE + REG_OFFSET_DMA3SAD) +#define REG_ADDR_DMA3DAD (REG_BASE + REG_OFFSET_DMA3DAD) +#define REG_ADDR_DMA3CNT (REG_BASE + REG_OFFSET_DMA3CNT) +#define REG_ADDR_DMA3CNT_L (REG_BASE + REG_OFFSET_DMA3CNT_L) +#define REG_ADDR_DMA3CNT_H (REG_BASE + REG_OFFSET_DMA3CNT_H) + +#define REG_ADDR_TMCNT (REG_BASE + REG_OFFSET_TMCNT) +#define REG_ADDR_TM0CNT (REG_BASE + REG_OFFSET_TM0CNT) +#define REG_ADDR_TM0CNT_L (REG_BASE + REG_OFFSET_TM0CNT_L) +#define REG_ADDR_TM0CNT_H (REG_BASE + REG_OFFSET_TM0CNT_H) +#define REG_ADDR_TM1CNT (REG_BASE + REG_OFFSET_TM1CNT) +#define REG_ADDR_TM1CNT_L (REG_BASE + REG_OFFSET_TM1CNT_L) +#define REG_ADDR_TM1CNT_H (REG_BASE + REG_OFFSET_TM1CNT_H) +#define REG_ADDR_TM2CNT (REG_BASE + REG_OFFSET_TM2CNT) +#define REG_ADDR_TM2CNT_L (REG_BASE + REG_OFFSET_TM2CNT_L) +#define REG_ADDR_TM2CNT_H (REG_BASE + REG_OFFSET_TM2CNT_H) +#define REG_ADDR_TM3CNT (REG_BASE + REG_OFFSET_TM3CNT) +#define REG_ADDR_TM3CNT_L (REG_BASE + REG_OFFSET_TM3CNT_L) +#define REG_ADDR_TM3CNT_H (REG_BASE + REG_OFFSET_TM3CNT_H) + +#define REG_ADDR_SIOCNT (REG_BASE + REG_OFFSET_SIOCNT) +#define REG_ADDR_SIODATA8 (REG_BASE + REG_OFFSET_SIODATA8) +#define REG_ADDR_SIODATA32 (REG_BASE + REG_OFFSET_SIODATA32) +#define REG_ADDR_SIOMLT_SEND (REG_BASE + REG_OFFSET_SIOMLT_SEND) +#define REG_ADDR_SIOMLT_RECV (REG_BASE + REG_OFFSET_SIOMLT_RECV) +#define REG_ADDR_SIOMULTI0 (REG_BASE + REG_OFFSET_SIOMULTI0) +#define REG_ADDR_SIOMULTI1 (REG_BASE + REG_OFFSET_SIOMULTI1) +#define REG_ADDR_SIOMULTI2 (REG_BASE + REG_OFFSET_SIOMULTI2) +#define REG_ADDR_SIOMULTI3 (REG_BASE + REG_OFFSET_SIOMULTI3) + +#define REG_ADDR_KEYINPUT (REG_BASE + REG_OFFSET_KEYINPUT) +#define REG_ADDR_KEYCNT (REG_BASE + REG_OFFSET_KEYCNT) + +#define REG_ADDR_RCNT (REG_BASE + REG_OFFSET_RCNT) + +#define REG_ADDR_JOYCNT (REG_BASE + REG_OFFSET_JOYCNT) +#define REG_ADDR_JOYSTAT (REG_BASE + REG_OFFSET_JOYSTAT) +#define REG_ADDR_JOY_RECV (REG_BASE + REG_OFFSET_JOY_RECV) +#define REG_ADDR_JOY_RECV_L (REG_BASE + REG_OFFSET_JOY_RECV_L) +#define REG_ADDR_JOY_RECV_H (REG_BASE + REG_OFFSET_JOY_RECV_H) +#define REG_ADDR_JOY_TRANS (REG_BASE + REG_OFFSET_JOY_TRANS) +#define REG_ADDR_JOY_TRANS_L (REG_BASE + REG_OFFSET_JOY_TRANS_L) +#define REG_ADDR_JOY_TRANS_H (REG_BASE + REG_OFFSET_JOY_TRANS_H) + +#define REG_ADDR_IME (REG_BASE + REG_OFFSET_IME) +#define REG_ADDR_IE (REG_BASE + REG_OFFSET_IE) +#define REG_ADDR_IF (REG_BASE + REG_OFFSET_IF) + +#define REG_ADDR_WAITCNT (REG_BASE + REG_OFFSET_WAITCNT) + +// I/O registers + +#define REG_DISPCNT (*(vu16 *)REG_ADDR_DISPCNT) +#define REG_DISPSTAT (*(vu16 *)REG_ADDR_DISPSTAT) +#define REG_VCOUNT (*(vu16 *)REG_ADDR_VCOUNT) +#define REG_BG0CNT (*(vu16 *)REG_ADDR_BG0CNT) +#define REG_BG1CNT (*(vu16 *)REG_ADDR_BG1CNT) +#define REG_BG2CNT (*(vu16 *)REG_ADDR_BG2CNT) +#define REG_BG3CNT (*(vu16 *)REG_ADDR_BG3CNT) +#define REG_BG0HOFS (*(vu16 *)REG_ADDR_BG0HOFS) +#define REG_BG0VOFS (*(vu16 *)REG_ADDR_BG0VOFS) +#define REG_BG1HOFS (*(vu16 *)REG_ADDR_BG1HOFS) +#define REG_BG1VOFS (*(vu16 *)REG_ADDR_BG1VOFS) +#define REG_BG2HOFS (*(vu16 *)REG_ADDR_BG2HOFS) +#define REG_BG2VOFS (*(vu16 *)REG_ADDR_BG2VOFS) +#define REG_BG3HOFS (*(vu16 *)REG_ADDR_BG3HOFS) +#define REG_BG3VOFS (*(vu16 *)REG_ADDR_BG3VOFS) +#define REG_BG2PA (*(vu16 *)REG_ADDR_BG2PA) +#define REG_BG2PB (*(vu16 *)REG_ADDR_BG2PB) +#define REG_BG2PC (*(vu16 *)REG_ADDR_BG2PC) +#define REG_BG2PD (*(vu16 *)REG_ADDR_BG2PD) +#define REG_BG2X (*(vu32 *)REG_ADDR_BG2X) +#define REG_BG2X_L (*(vu16 *)REG_ADDR_BG2X_L) +#define REG_BG2X_H (*(vu16 *)REG_ADDR_BG2X_H) +#define REG_BG2Y (*(vu32 *)REG_ADDR_BG2Y) +#define REG_BG2Y_L (*(vu16 *)REG_ADDR_BG2Y_L) +#define REG_BG2Y_H (*(vu16 *)REG_ADDR_BG2Y_H) +#define REG_BG3PA (*(vu16 *)REG_ADDR_BG3PA) +#define REG_BG3PB (*(vu16 *)REG_ADDR_BG3PB) +#define REG_BG3PC (*(vu16 *)REG_ADDR_BG3PC) +#define REG_BG3PD (*(vu16 *)REG_ADDR_BG3PD) +#define REG_BG3X (*(vu32 *)REG_ADDR_BG3X) +#define REG_BG3X_L (*(vu16 *)REG_ADDR_BG3X_L) +#define REG_BG3X_H (*(vu16 *)REG_ADDR_BG3X_H) +#define REG_BG3Y (*(vu32 *)REG_ADDR_BG3Y) +#define REG_BG3Y_L (*(vu16 *)REG_ADDR_BG3Y_L) +#define REG_BG3Y_H (*(vu16 *)REG_ADDR_BG3Y_H) +#define REG_WIN0H (*(vu16 *)REG_ADDR_WIN0H) +#define REG_WIN1H (*(vu16 *)REG_ADDR_WIN1H) +#define REG_WIN0V (*(vu16 *)REG_ADDR_WIN0V) +#define REG_WIN1V (*(vu16 *)REG_ADDR_WIN1V) +#define REG_WININ (*(vu16 *)REG_ADDR_WININ) +#define REG_WINOUT (*(vu16 *)REG_ADDR_WINOUT) +#define REG_MOSAIC (*(vu16 *)REG_ADDR_MOSAIC) +#define REG_BLDCNT (*(vu16 *)REG_ADDR_BLDCNT) +#define REG_BLDALPHA (*(vu16 *)REG_ADDR_BLDALPHA) +#define REG_BLDY (*(vu16 *)REG_ADDR_BLDY) + +#define REG_SOUND1CNT_L (*(vu16 *)REG_ADDR_SOUND1CNT_L) +#define REG_NR10 (*(vu8 *)REG_ADDR_NR10) +#define REG_SOUND1CNT_H (*(vu16 *)REG_ADDR_SOUND1CNT_H) +#define REG_NR11 (*(vu8 *)REG_ADDR_NR11) +#define REG_NR12 (*(vu8 *)REG_ADDR_NR12) +#define REG_SOUND1CNT_X (*(vu16 *)REG_ADDR_SOUND1CNT_X) +#define REG_NR13 (*(vu8 *)REG_ADDR_NR13) +#define REG_NR14 (*(vu8 *)REG_ADDR_NR14) +#define REG_SOUND2CNT_L (*(vu16 *)REG_ADDR_SOUND2CNT_L) +#define REG_NR21 (*(vu8 *)REG_ADDR_NR21) +#define REG_NR22 (*(vu8 *)REG_ADDR_NR22) +#define REG_SOUND2CNT_H (*(vu16 *)REG_ADDR_SOUND2CNT_H) +#define REG_NR23 (*(vu8 *)REG_ADDR_NR23) +#define REG_NR24 (*(vu8 *)REG_ADDR_NR24) +#define REG_SOUND3CNT_L (*(vu16 *)REG_ADDR_SOUND3CNT_L) +#define REG_NR30 (*(vu8 *)REG_ADDR_NR30) +#define REG_SOUND3CNT_H (*(vu16 *)REG_ADDR_SOUND3CNT_H) +#define REG_NR31 (*(vu8 *)REG_ADDR_NR31) +#define REG_NR32 (*(vu8 *)REG_ADDR_NR32) +#define REG_SOUND3CNT_X (*(vu16 *)REG_ADDR_SOUND3CNT_X) +#define REG_NR33 (*(vu8 *)REG_ADDR_NR33) +#define REG_NR34 (*(vu8 *)REG_ADDR_NR34) +#define REG_SOUND4CNT_L (*(vu16 *)REG_ADDR_SOUND4CNT_L) +#define REG_NR41 (*(vu8 *)REG_ADDR_NR41) +#define REG_NR42 (*(vu8 *)REG_ADDR_NR42) +#define REG_SOUND4CNT_H (*(vu16 *)REG_ADDR_SOUND4CNT_H) +#define REG_NR43 (*(vu8 *)REG_ADDR_NR43) +#define REG_NR44 (*(vu8 *)REG_ADDR_NR44) +#define REG_SOUNDCNT_L (*(vu16 *)REG_ADDR_SOUNDCNT_L) +#define REG_NR50 (*(vu8 *)REG_ADDR_NR50) +#define REG_NR51 (*(vu8 *)REG_ADDR_NR51) +#define REG_SOUNDCNT_H (*(vu16 *)REG_ADDR_SOUNDCNT_H) +#define REG_SOUNDCNT_X (*(vu16 *)REG_ADDR_SOUNDCNT_X) +#define REG_NR52 (*(vu8 *)REG_ADDR_NR52) +#define REG_SOUNDBIAS (*(vu16 *)REG_ADDR_SOUNDBIAS) +#define REG_SOUNDBIAS_L (*(vu8 *)REG_ADDR_SOUNDBIAS_L) +#define REG_SOUNDBIAS_H (*(vu8 *)REG_ADDR_SOUNDBIAS_H) +#define REG_WAVE_RAM0 (*(vu32 *)REG_ADDR_WAVE_RAM0) +#define REG_WAVE_RAM1 (*(vu32 *)REG_ADDR_WAVE_RAM1) +#define REG_WAVE_RAM2 (*(vu32 *)REG_ADDR_WAVE_RAM2) +#define REG_WAVE_RAM3 (*(vu32 *)REG_ADDR_WAVE_RAM3) +#define REG_FIFO_A (*(vu32 *)REG_ADDR_FIFO_A) +#define REG_FIFO_B (*(vu32 *)REG_ADDR_FIFO_B) + +#define REG_DMA0SAD (*(vu32 *)REG_ADDR_DMA0SAD) +#define REG_DMA0DAD (*(vu32 *)REG_ADDR_DMA0DAD) +#define REG_DMA0CNT (*(vu32 *)REG_ADDR_DMA0CNT) +#define REG_DMA0CNT_L (*(vu16 *)REG_ADDR_DMA0CNT_L) +#define REG_DMA0CNT_H (*(vu16 *)REG_ADDR_DMA0CNT_H) + +#define REG_DMA1SAD (*(vu32 *)REG_ADDR_DMA1SAD) +#define REG_DMA1DAD (*(vu32 *)REG_ADDR_DMA1DAD) +#define REG_DMA1CNT (*(vu32 *)REG_ADDR_DMA1CNT) +#define REG_DMA1CNT_L (*(vu16 *)REG_ADDR_DMA1CNT_L) +#define REG_DMA1CNT_H (*(vu16 *)REG_ADDR_DMA1CNT_H) + +#define REG_DMA2SAD (*(vu32 *)REG_ADDR_DMA2SAD) +#define REG_DMA2DAD (*(vu32 *)REG_ADDR_DMA2DAD) +#define REG_DMA2CNT (*(vu32 *)REG_ADDR_DMA2CNT) +#define REG_DMA2CNT_L (*(vu16 *)REG_ADDR_DMA2CNT_L) +#define REG_DMA2CNT_H (*(vu16 *)REG_ADDR_DMA2CNT_H) + +#define REG_DMA3SAD (*(vu32 *)REG_ADDR_DMA3SAD) +#define REG_DMA3DAD (*(vu32 *)REG_ADDR_DMA3DAD) +#define REG_DMA3CNT (*(vu32 *)REG_ADDR_DMA3CNT) +#define REG_DMA3CNT_L (*(vu16 *)REG_ADDR_DMA3CNT_L) +#define REG_DMA3CNT_H (*(vu16 *)REG_ADDR_DMA3CNT_H) + +#define REG_TMCNT(n) (*(vu16 *)(REG_ADDR_TMCNT + ((n) * 4))) +#define REG_TM0CNT (*(vu32 *)REG_ADDR_TM0CNT) +#define REG_TM0CNT_L (*(vu16 *)REG_ADDR_TM0CNT_L) +#define REG_TM0CNT_H (*(vu16 *)REG_ADDR_TM0CNT_H) +#define REG_TM1CNT (*(vu32 *)REG_ADDR_TM1CNT) +#define REG_TM1CNT_L (*(vu16 *)REG_ADDR_TM1CNT_L) +#define REG_TM1CNT_H (*(vu16 *)REG_ADDR_TM1CNT_H) +#define REG_TM2CNT (*(vu32 *)REG_ADDR_TM2CNT) +#define REG_TM2CNT_L (*(vu16 *)REG_ADDR_TM2CNT_L) +#define REG_TM2CNT_H (*(vu16 *)REG_ADDR_TM2CNT_H) +#define REG_TM3CNT (*(vu32 *)REG_ADDR_TM3CNT) +#define REG_TM3CNT_L (*(vu16 *)REG_ADDR_TM3CNT_L) +#define REG_TM3CNT_H (*(vu16 *)REG_ADDR_TM3CNT_H) + +#define REG_SIOCNT (*(vu16 *)REG_ADDR_SIOCNT) +#define REG_SIODATA8 (*(vu16 *)REG_ADDR_SIODATA8) +#define REG_SIODATA32 (*(vu32 *)REG_ADDR_SIODATA32) +#define REG_SIOMLT_SEND (*(vu16 *)REG_ADDR_SIOMLT_SEND) +#define REG_SIOMLT_RECV (*(vu64 *)REG_ADDR_SIOMLT_RECV) +#define REG_SIOMULTI0 (*(vu16 *)REG_ADDR_SIOMULTI0) +#define REG_SIOMULTI1 (*(vu16 *)REG_ADDR_SIOMULTI1) +#define REG_SIOMULTI2 (*(vu16 *)REG_ADDR_SIOMULTI2) +#define REG_SIOMULTI3 (*(vu16 *)REG_ADDR_SIOMULTI3) + +#define REG_KEYINPUT (*(vu16 *)REG_ADDR_KEYINPUT) +#define REG_KEYCNT (*(vu16 *)REG_ADDR_KEYCNT) + +#define REG_RCNT (*(vu16 *)REG_ADDR_RCNT) + +#define REG_IME (*(vu16 *)REG_ADDR_IME) +#define REG_IE (*(vu16 *)REG_ADDR_IE) +#define REG_IF (*(vu16 *)REG_ADDR_IF) + +#define REG_WAITCNT (*(vu16 *)REG_ADDR_WAITCNT) + +// I/O register fields + +// DISPCNT +#define DISPCNT_MODE_0 0x0000 // BG0: text, BG1: text, BG2: text, BG3: text +#define DISPCNT_MODE_1 0x0001 // BG0: text, BG1: text, BG2: affine, BG3: off +#define DISPCNT_MODE_2 0x0002 // BG0: off, BG1: off, BG2: affine, BG3: affine +#define DISPCNT_MODE_3 0x0003 // Bitmap mode, 240x160, BGR555 color +#define DISPCNT_MODE_4 0x0004 // Bitmap mode, 240x160, 256 color palette +#define DISPCNT_MODE_5 0x0005 // Bitmap mode, 160x128, BGR555 color +#define DISPCNT_OBJ_1D_MAP 0x0040 +#define DISPCNT_FORCED_BLANK 0x0080 +#define DISPCNT_BG0_ON 0x0100 +#define DISPCNT_BG1_ON 0x0200 +#define DISPCNT_BG2_ON 0x0400 +#define DISPCNT_BG3_ON 0x0800 +#define DISPCNT_BG_ALL_ON 0x0F00 +#define DISPCNT_OBJ_ON 0x1000 +#define DISPCNT_WIN0_ON 0x2000 +#define DISPCNT_WIN1_ON 0x4000 +#define DISPCNT_OBJWIN_ON 0x8000 + +// DISPSTAT +#define DISPSTAT_VBLANK 0x0001 // in V-Blank +#define DISPSTAT_HBLANK 0x0002 // in H-Blank +#define DISPSTAT_VCOUNT 0x0004 // V-Count match +#define DISPSTAT_VBLANK_INTR 0x0008 // V-Blank interrupt enabled +#define DISPSTAT_HBLANK_INTR 0x0010 // H-Blank interrupt enabled +#define DISPSTAT_VCOUNT_INTR 0x0020 // V-Count interrupt enabled + +// BGCNT +#define BGCNT_PRIORITY(n) (n) // Values 0 - 3. Lower priority BGs will be drawn on top of higher priority BGs. +#define BGCNT_CHARBASE(n) ((n) << 2) // Values 0 - 3. Base block for tile pixel data. +#define BGCNT_MOSAIC 0x0040 +#define BGCNT_16COLOR 0x0000 // 4 bits per pixel +#define BGCNT_256COLOR 0x0080 // 8 bits per pixel +#define BGCNT_SCREENBASE(n) ((n) << 8) // Values 0 - 31. Base block for tile map. +#define BGCNT_WRAP 0x2000 // Only affects affine BGs. Text BGs wrap by default. +#define BGCNT_TXT256x256 0x0000 // Internal screen size size of text mode BG in pixels. +#define BGCNT_TXT512x256 0x4000 +#define BGCNT_TXT256x512 0x8000 +#define BGCNT_TXT512x512 0xC000 +#define BGCNT_AFF128x128 0x0000 // Internal screen size size of affine mode BG in pixels. +#define BGCNT_AFF256x256 0x4000 +#define BGCNT_AFF512x512 0x8000 +#define BGCNT_AFF1024x1024 0xC000 + +// WININ/OUT +#define WININ_WIN0_BG0 (1 << 0) +#define WININ_WIN0_BG1 (1 << 1) +#define WININ_WIN0_BG2 (1 << 2) +#define WININ_WIN0_BG3 (1 << 3) +#define WININ_WIN0_BG_ALL (WININ_WIN0_BG0 | WININ_WIN0_BG1 | WININ_WIN0_BG2 | WININ_WIN0_BG3) +#define WININ_WIN0_OBJ (1 << 4) +#define WININ_WIN0_CLR (1 << 5) +#define WININ_WIN1_BG0 (1 << 8) +#define WININ_WIN1_BG1 (1 << 9) +#define WININ_WIN1_BG2 (1 << 10) +#define WININ_WIN1_BG3 (1 << 11) +#define WININ_WIN1_BG_ALL (WININ_WIN1_BG0 | WININ_WIN1_BG1 | WININ_WIN1_BG2 | WININ_WIN1_BG3) +#define WININ_WIN1_OBJ (1 << 12) +#define WININ_WIN1_CLR (1 << 13) + +#define WINOUT_WIN01_BG0 (1 << 0) +#define WINOUT_WIN01_BG1 (1 << 1) +#define WINOUT_WIN01_BG2 (1 << 2) +#define WINOUT_WIN01_BG3 (1 << 3) +#define WINOUT_WIN01_BG_ALL (WINOUT_WIN01_BG0 | WINOUT_WIN01_BG1 | WINOUT_WIN01_BG2 | WINOUT_WIN01_BG3) +#define WINOUT_WIN01_OBJ (1 << 4) +#define WINOUT_WIN01_CLR (1 << 5) +#define WINOUT_WINOBJ_BG0 (1 << 8) +#define WINOUT_WINOBJ_BG1 (1 << 9) +#define WINOUT_WINOBJ_BG2 (1 << 10) +#define WINOUT_WINOBJ_BG3 (1 << 11) +#define WINOUT_WINOBJ_BG_ALL (WINOUT_WINOBJ_BG0 | WINOUT_WINOBJ_BG1 | WINOUT_WINOBJ_BG2 | WINOUT_WINOBJ_BG3) +#define WINOUT_WINOBJ_OBJ (1 << 12) +#define WINOUT_WINOBJ_CLR (1 << 13) + +#define WIN_RANGE(a, b) (((a) << 8) | (b)) +#define WIN_RANGE2(a, b) ((b) | ((a) << 8)) + +// BLDCNT +// Bits 0-5 select layers for the 1st target +#define BLDCNT_TGT1_BG0 (1 << 0) +#define BLDCNT_TGT1_BG1 (1 << 1) +#define BLDCNT_TGT1_BG2 (1 << 2) +#define BLDCNT_TGT1_BG3 (1 << 3) +#define BLDCNT_TGT1_OBJ (1 << 4) +#define BLDCNT_TGT1_BD (1 << 5) +#define BLDCNT_TGT1_ALL (BLDCNT_TGT1_BG0 | BLDCNT_TGT1_BG1 | BLDCNT_TGT1_BG2 | BLDCNT_TGT1_BG3 | BLDCNT_TGT1_OBJ | BLDCNT_TGT1_BD) +// Bits 6-7 select the special effect +#define BLDCNT_EFFECT_NONE (0 << 6) // no special effect +#define BLDCNT_EFFECT_BLEND (1 << 6) // 1st+2nd targets mixed (controlled by BLDALPHA) +#define BLDCNT_EFFECT_LIGHTEN (2 << 6) // 1st target becomes whiter (controlled by BLDY) +#define BLDCNT_EFFECT_DARKEN (3 << 6) // 1st target becomes blacker (controlled by BLDY) +// Bits 8-13 select layers for the 2nd target +#define BLDCNT_TGT2_BG0 (1 << 8) +#define BLDCNT_TGT2_BG1 (1 << 9) +#define BLDCNT_TGT2_BG2 (1 << 10) +#define BLDCNT_TGT2_BG3 (1 << 11) +#define BLDCNT_TGT2_OBJ (1 << 12) +#define BLDCNT_TGT2_BD (1 << 13) +#define BLDCNT_TGT2_ALL (BLDCNT_TGT2_BG0 | BLDCNT_TGT2_BG1 | BLDCNT_TGT2_BG2 | BLDCNT_TGT2_BG3 | BLDCNT_TGT2_OBJ | BLDCNT_TGT2_BD) + +// BLDALPHA +#define BLDALPHA_BLEND(target1, target2) (((target2) << 8) | (target1)) + +// SOUNDCNT_H +#define SOUND_CGB_MIX_QUARTER 0x0000 +#define SOUND_CGB_MIX_HALF 0x0001 +#define SOUND_CGB_MIX_FULL 0x0002 +#define SOUND_A_MIX_HALF 0x0000 +#define SOUND_A_MIX_FULL 0x0004 +#define SOUND_B_MIX_HALF 0x0000 +#define SOUND_B_MIX_FULL 0x0008 +#define SOUND_ALL_MIX_FULL 0x000E +#define SOUND_A_RIGHT_OUTPUT 0x0100 +#define SOUND_A_LEFT_OUTPUT 0x0200 +#define SOUND_A_TIMER_0 0x0000 +#define SOUND_A_TIMER_1 0x0400 +#define SOUND_A_FIFO_RESET 0x0800 +#define SOUND_B_RIGHT_OUTPUT 0x1000 +#define SOUND_B_LEFT_OUTPUT 0x2000 +#define SOUND_B_TIMER_0 0x0000 +#define SOUND_B_TIMER_1 0x4000 +#define SOUND_B_FIFO_RESET 0x8000 + +// SOUNDCNT_X +#define SOUND_1_ON 0x0001 +#define SOUND_2_ON 0x0002 +#define SOUND_3_ON 0x0004 +#define SOUND_4_ON 0x0008 +#define SOUND_MASTER_ENABLE 0x0080 + +// DMA +#define DMA_DEST_INC 0x0000 +#define DMA_DEST_DEC 0x0020 +#define DMA_DEST_FIXED 0x0040 +#define DMA_DEST_RELOAD 0x0060 +#define DMA_SRC_INC 0x0000 +#define DMA_SRC_DEC 0x0080 +#define DMA_SRC_FIXED 0x0100 +#define DMA_REPEAT 0x0200 +#define DMA_16BIT 0x0000 +#define DMA_32BIT 0x0400 +#define DMA_DREQ_ON 0x0800 +#define DMA_START_NOW 0x0000 +#define DMA_START_VBLANK 0x1000 +#define DMA_START_HBLANK 0x2000 +#define DMA_START_SPECIAL 0x3000 +#define DMA_START_MASK 0x3000 +#define DMA_INTR_ENABLE 0x4000 +#define DMA_ENABLE 0x8000 + +// timer +#define TIMER_1CLK 0x00 +#define TIMER_64CLK 0x01 +#define TIMER_256CLK 0x02 +#define TIMER_1024CLK 0x03 +#define TIMER_INTR_ENABLE 0x40 +#define TIMER_ENABLE 0x80 + +// serial +#define SIO_ID 0x0030 // Communication ID + +#define SIO_8BIT_MODE 0x0000 // Normal 8-bit communication mode +#define SIO_32BIT_MODE 0x1000 // Normal 32-bit communication mode +#define SIO_MULTI_MODE 0x2000 // Multi-player communication mode +#define SIO_UART_MODE 0x3000 // UART communication mode + +#define SIO_9600_BPS 0x0000 // baud rate 9600 bps +#define SIO_38400_BPS 0x0001 // 38400 bps +#define SIO_57600_BPS 0x0002 // 57600 bps +#define SIO_115200_BPS 0x0003 // 115200 bps + +#define SIO_MULTI_SI 0x0004 // Multi-player communication SI terminal +#define SIO_MULTI_SD 0x0008 // SD terminal +#define SIO_MULTI_BUSY 0x0080 + +#define SIO_ERROR 0x0040 // Detect error +#define SIO_START 0x0080 // Start transfer +#define SIO_ENABLE 0x0080 // Enable SIO + +#define SIO_INTR_ENABLE 0x4000 + +#define SIO_MULTI_SI_SHIFT 2 +#define SIO_MULTI_SI_MASK 0x1 +#define SIO_MULTI_DI_SHIFT 3 +#define SIO_MULTI_DI_MASK 0x1 + +// keys +#define A_BUTTON 0x0001 +#define B_BUTTON 0x0002 +#define SELECT_BUTTON 0x0004 +#define START_BUTTON 0x0008 +#define DPAD_RIGHT 0x0010 +#define DPAD_LEFT 0x0020 +#define DPAD_UP 0x0040 +#define DPAD_DOWN 0x0080 +#define R_BUTTON 0x0100 +#define L_BUTTON 0x0200 +#define KEYS_MASK 0x03FF +#define KEY_INTR_ENABLE 0x0400 +#define KEY_OR_INTR 0x0000 +#define KEY_AND_INTR 0x8000 +#define DPAD_ANY 0x00F0 +#define JOY_EXCL_DPAD 0x030F + +// interrupt flags +#define INTR_FLAG_VBLANK (1 << 0) +#define INTR_FLAG_HBLANK (1 << 1) +#define INTR_FLAG_VCOUNT (1 << 2) +#define INTR_FLAG_TIMER0 (1 << 3) +#define INTR_FLAG_TIMER1 (1 << 4) +#define INTR_FLAG_TIMER2 (1 << 5) +#define INTR_FLAG_TIMER3 (1 << 6) +#define INTR_FLAG_SERIAL (1 << 7) +#define INTR_FLAG_DMA0 (1 << 8) +#define INTR_FLAG_DMA1 (1 << 9) +#define INTR_FLAG_DMA2 (1 << 10) +#define INTR_FLAG_DMA3 (1 << 11) +#define INTR_FLAG_KEYPAD (1 << 12) +#define INTR_FLAG_GAMEPAK (1 << 13) + +// WAITCNT +#define WAITCNT_SRAM_4 (0 << 0) +#define WAITCNT_SRAM_3 (1 << 0) +#define WAITCNT_SRAM_2 (2 << 0) +#define WAITCNT_SRAM_8 (3 << 0) +#define WAITCNT_SRAM_MASK (3 << 0) + +#define WAITCNT_WS0_N_4 (0 << 2) +#define WAITCNT_WS0_N_3 (1 << 2) +#define WAITCNT_WS0_N_2 (2 << 2) +#define WAITCNT_WS0_N_8 (3 << 2) +#define WAITCNT_WS0_N_MASK (3 << 2) + +#define WAITCNT_WS0_S_2 (0 << 4) +#define WAITCNT_WS0_S_1 (1 << 4) + +#define WAITCNT_WS1_N_4 (0 << 5) +#define WAITCNT_WS1_N_3 (1 << 5) +#define WAITCNT_WS1_N_2 (2 << 5) +#define WAITCNT_WS1_N_8 (3 << 5) +#define WAITCNT_WS1_N_MASK (3 << 5) + +#define WAITCNT_WS1_S_4 (0 << 7) +#define WAITCNT_WS1_S_1 (1 << 7) + +#define WAITCNT_WS2_N_4 (0 << 8) +#define WAITCNT_WS2_N_3 (1 << 8) +#define WAITCNT_WS2_N_2 (2 << 8) +#define WAITCNT_WS2_N_8 (3 << 8) +#define WAITCNT_WS2_N_MASK (3 << 8) + +#define WAITCNT_WS2_S_8 (0 << 10) +#define WAITCNT_WS2_S_1 (1 << 10) + +#define WAITCNT_PHI_OUT_NONE (0 << 11) +#define WAITCNT_PHI_OUT_4MHZ (1 << 11) +#define WAITCNT_PHI_OUT_8MHZ (2 << 11) +#define WAITCNT_PHI_OUT_16MHZ (3 << 11) +#define WAITCNT_PHI_OUT_MASK (3 << 11) + +#define WAITCNT_PREFETCH_ENABLE (1 << 14) + +#define WAITCNT_AGB (0 << 15) +#define WAITCNT_CGB (1 << 15) + +#endif // GUARD_GBA_IO_REG_H diff --git a/include/gba/isagbprint.h b/include/gba/isagbprint.h new file mode 100644 index 0000000..c5eb456 --- /dev/null +++ b/include/gba/isagbprint.h @@ -0,0 +1,50 @@ +#ifndef GUARD_GBA_ISAGBPRINT_H +#define GUARD_GBA_ISAGBPRINT_H + +#ifdef NDEBUG +#define AGBPrintInit() +#define AGBPutc(cChr) +#define AGBPrint(pBuf) +#define AGBPrintf(pBuf, ...) +#define AGBPrintFlush1Block() +#define AGBPrintFlush() +#define AGBAssert(pFile, nLine, pExpression, nStopProgram) +#else +void AGBPrintInit(void); +void AGBPutc(const char cChr); +void AGBPrint(const char *pBuf); +void AGBPrintf(const char *pBuf, ...); +void AGBPrintFlush1Block(void); +void AGBPrintFlush(void); +void AGBAssert(const char *pFile, int nLine, const char *pExpression, int nStopProgram); +#endif + +#undef AGB_ASSERT +#ifdef NDEBUG +#define AGB_ASSERT(exp) +#else +#define AGB_ASSERT(exp) (exp) ? ((void*)0) : AGBAssert(__FILE__, __LINE__, #exp, 1); +#endif + +#undef AGB_WARNING +#ifdef NDEBUG +#define AGB_WARNING(exp) +#else +#define AGB_WARNING(exp) (exp) ? ((void*)0) : AGBAssert(__FILE__, __LINE__, #exp, 0); +#endif + +// for matching purposes + +#ifdef NDEBUG +#define AGB_ASSERT_EX(exp, file, line) +#else +#define AGB_ASSERT_EX(exp, file, line) (exp) ? ((void*)0) : AGBAssert(file, line, #exp, 1); +#endif + +#ifdef NDEBUG +#define AGB_WARNING_EX(exp, file, line) +#else +#define AGB_WARNING_EX(exp, file, line) (exp) ? ((void*)0) : AGBAssert(file, line, #exp, 0); +#endif + +#endif // GUARD_GBA_ISAGBPRINT_H diff --git a/include/gba/m4a_internal.h b/include/gba/m4a_internal.h new file mode 100644 index 0000000..488ccfb --- /dev/null +++ b/include/gba/m4a_internal.h @@ -0,0 +1,463 @@ +#ifndef GUARD_M4A_INTERNAL_H +#define GUARD_M4A_INTERNAL_H + +#include "gba/gba.h" + +// ASCII encoding of 'Smsh' in reverse +// This is presumably short for SMASH, the developer of MKS4AGB. +#define ID_NUMBER 0x68736D53 + +#define C_V 0x40 // center value for PAN, BEND, and TUNE + +#define SOUND_MODE_REVERB_VAL 0x0000007F +#define SOUND_MODE_REVERB_SET 0x00000080 +#define SOUND_MODE_MAXCHN 0x00000F00 +#define SOUND_MODE_MAXCHN_SHIFT 8 +#define SOUND_MODE_MASVOL 0x0000F000 +#define SOUND_MODE_MASVOL_SHIFT 12 +#define SOUND_MODE_FREQ_05734 0x00010000 +#define SOUND_MODE_FREQ_07884 0x00020000 +#define SOUND_MODE_FREQ_10512 0x00030000 +#define SOUND_MODE_FREQ_13379 0x00040000 +#define SOUND_MODE_FREQ_15768 0x00050000 +#define SOUND_MODE_FREQ_18157 0x00060000 +#define SOUND_MODE_FREQ_21024 0x00070000 +#define SOUND_MODE_FREQ_26758 0x00080000 +#define SOUND_MODE_FREQ_31536 0x00090000 +#define SOUND_MODE_FREQ_36314 0x000A0000 +#define SOUND_MODE_FREQ_40137 0x000B0000 +#define SOUND_MODE_FREQ_42048 0x000C0000 +#define SOUND_MODE_FREQ 0x000F0000 +#define SOUND_MODE_FREQ_SHIFT 16 +#define SOUND_MODE_DA_BIT_9 0x00800000 +#define SOUND_MODE_DA_BIT_8 0x00900000 +#define SOUND_MODE_DA_BIT_7 0x00A00000 +#define SOUND_MODE_DA_BIT_6 0x00B00000 +#define SOUND_MODE_DA_BIT 0x00B00000 +#define SOUND_MODE_DA_BIT_SHIFT 20 + +struct WaveData +{ + u16 type; + u16 status; + u32 freq; + u32 loopStart; + u32 size; // number of samples + s8 data[1]; // samples +}; + +#define TONEDATA_TYPE_CGB 0x07 +#define TONEDATA_TYPE_FIX 0x08 +#define TONEDATA_TYPE_SPL 0x40 // key split +#define TONEDATA_TYPE_RHY 0x80 // rhythm + +#define TONEDATA_P_S_PAN 0xc0 +#define TONEDATA_P_S_PAM TONEDATA_P_S_PAN + +struct ToneData +{ + u8 type; + u8 key; + u8 length; // sound length (compatible sound) + u8 pan_sweep; // pan or sweep (compatible sound ch. 1) + struct WaveData *wav; + u8 attack; + u8 decay; + u8 sustain; + u8 release; +}; + +struct CgbChannel +{ + u8 sf; + u8 ty; + u8 rightVolume; + u8 leftVolume; + u8 at; + u8 de; + u8 su; + u8 re; + u8 ky; + u8 ev; + u8 eg; + u8 ec; + u8 echoVolume; + u8 echoLength; + u8 d1; + u8 d2; + u8 gt; + u8 mk; + u8 ve; + u8 pr; + u8 rp; + u8 d3[3]; + u8 d5; + u8 sg; + u8 n4; + u8 pan; + u8 panMask; + u8 mo; + u8 le; + u8 sw; + u32 fr; + u32* wp; + u32 cp; + u32 tp; + u32 pp; + u32 np; + u8 d4[8]; +}; + +struct MusicPlayerTrack; + +struct SoundChannel +{ + u8 status; + u8 type; + u8 rightVolume; + u8 leftVolume; + u8 attack; + u8 decay; + u8 sustain; + u8 release; + u8 ky; + u8 ev; + u8 er; + u8 el; + u8 echoVolume; + u8 echoLength; + u8 d1; + u8 d2; + u8 gt; + u8 mk; + u8 ve; + u8 pr; + u8 rp; + u8 d3[3]; + u32 ct; + u32 fw; + u32 freq; + struct WaveData *wav; + u32 cp; + struct MusicPlayerTrack *track; + u32 pp; + u32 np; + u32 d4; + u16 xpi; + u16 xpc; +}; + +#define MAX_DIRECTSOUND_CHANNELS 12 + +#define PCM_DMA_BUF_SIZE 1584 // size of Direct Sound buffer + +struct SoundInfo +{ + // This field is normally equal to ID_NUMBER but it is set to other + // values during sensitive operations for locking purposes. + // This field should be volatile but isn't. This could potentially cause + // race conditions. + u32 ident; + + vu8 pcmDmaCounter; + + // Direct Sound + u8 reverb; + u8 maxChans; + u8 masterVolume; + u8 freq; + + u8 mode; + u8 c15; + u8 pcmDmaPeriod; // number of V-blanks per PCM DMA + u8 maxLines; + u8 gap[3]; + s32 pcmSamplesPerVBlank; + s32 pcmFreq; + s32 divFreq; + struct CgbChannel *cgbChans; + u32 func; + u32 intp; + void (*CgbSound)(void); + void (*CgbOscOff)(u8); + u32 (*MidiKeyToCgbFreq)(u8, u8, u8); + u32 MPlayJumpTable; + u32 plynote; + u32 ExtVolPit; + u8 gap2[16]; + struct SoundChannel chans[MAX_DIRECTSOUND_CHANNELS]; + s8 pcmBuffer[PCM_DMA_BUF_SIZE * 2]; +}; + +struct SongHeader +{ + u8 trackCount; + u8 blockCount; + u8 priority; + u8 reverb; + struct ToneData *tone; + u8 *part[1]; +}; + +struct PokemonCrySong +{ + u8 trackCount; + u8 blockCount; + u8 priority; + u8 reverb; + struct ToneData *tone; + u8 *part[2]; + u8 gap; + u8 part0; // 0x11 + u8 tuneValue; // 0x12 + u8 gotoCmd; // 0x13 + u32 gotoTarget; // 0x14 + u8 part1; // 0x18 + u8 tuneValue2; // 0x19 + u8 cont[2]; // 0x1A + u8 volCmd; // 0x1C + u8 volumeValue; // 0x1D + u8 unkCmd0D[2]; // 0x1E + u32 unkCmd0DParam; // 0x20 + u8 xreleCmd[2]; // 0x24 + u8 releaseValue; // 0x26 + u8 panCmd; + u8 panValue; // 0x28 + u8 tieCmd; // 0x29 + u8 tieKeyValue; // 0x2A + u8 tieVelocityValue; // 0x2B + u8 unkCmd0C[2]; // 0x2C + u16 unkCmd0CParam; // 0x2E + u8 end[2]; // 0x30 +}; + +#define MPT_FLG_VOLSET 0x01 +#define MPT_FLG_VOLCHG 0x03 +#define MPT_FLG_PITSET 0x04 +#define MPT_FLG_PITCHG 0x0C +#define MPT_FLG_START 0x40 +#define MPT_FLG_EXIST 0x80 + +struct MusicPlayerTrack +{ + u8 flags; + u8 wait; + u8 patternLevel; + u8 repN; + u8 gateTime; + u8 key; + u8 velocity; + u8 runningStatus; + u8 keyM; + u8 pitM; + s8 keyShift; + s8 keyShiftX; + s8 tune; + u8 pitX; + s8 bend; + u8 bendRange; + u8 volMR; + u8 volML; + u8 vol; + u8 volX; + s8 pan; + s8 panX; + s8 modM; + u8 mod; + u8 modT; + u8 lfoSpeed; + u8 lfoSpeedC; + u8 lfoDelay; + u8 lfoDelayC; + u8 priority; + u8 echoVolume; + u8 echoLength; + struct SoundChannel *chan; + struct ToneData tone; + u8 gap[10]; + u16 unk_3A; + u32 unk_3C; + u8 *cmdPtr; + u8 *patternStack[3]; +}; + +#define MUSICPLAYER_STATUS_TRACK 0x0000ffff +#define MUSICPLAYER_STATUS_PAUSE 0x80000000 + +#define MAX_MUSICPLAYER_TRACKS 16 + +#define TEMPORARY_FADE 0x0001 +#define FADE_IN 0x0002 +#define FADE_VOL_MAX 64 +#define FADE_VOL_SHIFT 2 + +struct MusicPlayerInfo +{ + struct SongHeader *songHeader; + u32 status; + u8 trackCount; + u8 priority; + u8 cmd; + u8 unk_B; + u32 clock; + u8 gap[8]; + u8 *memAccArea; + u16 tempoD; + u16 tempoU; + u16 tempoI; + u16 tempoC; + u16 fadeOI; + u16 fadeOC; + u16 fadeOV; + struct MusicPlayerTrack *tracks; + struct ToneData *tone; + u32 ident; + u32 func; + u32 intp; +}; + +struct MusicPlayer +{ + struct MusicPlayerInfo *info; + struct MusicPlayerTrack *track; + u8 unk_8; + u16 unk_A; +}; + +struct Song +{ + struct SongHeader *header; + u16 ms; + u16 me; +}; + +extern const struct MusicPlayer gMPlayTable[]; +extern const struct Song gSongTable[]; + + + +extern u8 gMPlayMemAccArea[]; + +//u8 gPokemonCrySong[52]; +//u8 gPokemonCrySongs[52 * MAX_POKEMON_CRIES]; + +#define MAX_POKEMON_CRIES 2 + +extern struct PokemonCrySong gPokemonCrySong; +extern struct PokemonCrySong gPokemonCrySongs[]; + +extern struct MusicPlayerInfo gPokemonCryMusicPlayers[]; +extern struct MusicPlayerTrack gPokemonCryTracks[]; + +extern char SoundMainRAM[]; + +extern void *gMPlayJumpTable[]; + +typedef void (*XcmdFunc)(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +extern const XcmdFunc gXcmdTable[]; + +extern struct CgbChannel gCgbChans[]; + +extern const u8 gScaleTable[]; +extern const u32 gFreqTable[]; +extern const u16 gPcmSamplesPerVBlankTable[]; + +extern const u8 gCgbScaleTable[]; +extern const s16 gCgbFreqTable[]; +extern const u8 gNoiseTable[]; + +extern const struct PokemonCrySong gPokemonCrySongTemplate; + +extern const struct ToneData voicegroup000; + +extern char gNumMusicPlayers[]; +extern char gMaxLines[]; + +#define NUM_MUSIC_PLAYERS ((u16)gNumMusicPlayers) +#define MAX_LINES ((u32)gMaxLines) + +u32 umul3232H32(u32 multiplier, u32 multiplicand); +void SoundMain(void); +void SoundMainBTM(void); +void TrackStop(struct MusicPlayerInfo *mplayInfo, struct MusicPlayerTrack *track); +void MPlayMain(void); +void RealClearChain(void *x); + +void MPlayContinue(struct MusicPlayerInfo *mplayInfo); +void MPlayStart(struct MusicPlayerInfo *mplayInfo, struct SongHeader *songHeader); +void m4aMPlayStop(struct MusicPlayerInfo *mplayInfo); +void FadeOutBody(struct MusicPlayerInfo *mplayInfo); +void TrkVolPitSet(struct MusicPlayerInfo *mplayInfo, struct MusicPlayerTrack *track); +void MPlayFadeOut(struct MusicPlayerInfo *mplayInfo, u16 speed); +void ClearChain(void *x); +void Clear64byte(void *addr); +void SoundInit(struct SoundInfo *soundInfo); +void MPlayExtender(struct CgbChannel *cgbChans); +void m4aSoundMode(u32 mode); +void MPlayOpen(struct MusicPlayerInfo *mplayInfo, struct MusicPlayerTrack *track, u8 a3); +void CgbSound(void); +void CgbOscOff(u8); +u32 MidiKeyToCgbFreq(u8, u8, u8); +void DummyFunc(void); +void MPlayJumpTableCopy(void **mplayJumpTable); +void SampleFreqSet(u32 freq); +void m4aSoundVSyncOn(void); +void m4aSoundVSyncOff(void); + +void ClearModM(struct MusicPlayerTrack *track); +void m4aMPlayModDepthSet(struct MusicPlayerInfo *mplayInfo, u16 trackBits, u8 modDepth); +void m4aMPlayLFOSpeedSet(struct MusicPlayerInfo *mplayInfo, u16 trackBits, u8 lfoSpeed); + +struct MusicPlayerInfo *SetPokemonCryTone(struct ToneData *tone); +void SetPokemonCryVolume(u8 val); +void SetPokemonCryPanpot(s8 val); +void SetPokemonCryPitch(s16 val); +void SetPokemonCryLength(u16 val); +void SetPokemonCryRelease(u8 val); +void SetPokemonCryProgress(u32 val); +int IsPokemonCryPlaying(struct MusicPlayerInfo *mplayInfo); +void SetPokemonCryChorus(s8 val); +void SetPokemonCryStereo(u32 val); +void SetPokemonCryPriority(u8 val); + +// sound command handler functions +void ply_fine(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_goto(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_patt(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_pend(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_rept(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_memacc(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_prio(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_tempo(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_keysh(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_voice(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_vol(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_pan(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_bend(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_bendr(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_lfos(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_lfodl(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_mod(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_modt(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_tune(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_port(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_xcmd(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_endtie(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_note(struct MusicPlayerInfo *, struct MusicPlayerTrack *); + +// extended sound command handler functions +void ply_xxx(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_xwave(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_xtype(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_xatta(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_xdeca(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_xsust(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_xrele(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_xiecv(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_xiecl(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_xleng(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_xswee(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_xcmd_0C(struct MusicPlayerInfo *, struct MusicPlayerTrack *); +void ply_xcmd_0D(struct MusicPlayerInfo *, struct MusicPlayerTrack *); + +#endif // GUARD_M4A_INTERNAL_H diff --git a/include/gba/macro.h b/include/gba/macro.h new file mode 100644 index 0000000..ab42c9d --- /dev/null +++ b/include/gba/macro.h @@ -0,0 +1,223 @@ +#ifndef GUARD_GBA_MACRO_H +#define GUARD_GBA_MACRO_H + +#define CPU_FILL(value, dest, size, bit) \ +{ \ + vu##bit tmp = (vu##bit)(value); \ + CpuSet((void *)&tmp, \ + dest, \ + CPU_SET_##bit##BIT | CPU_SET_SRC_FIXED | ((size)/(bit/8) & 0x1FFFFF)); \ +} + +#define CpuFill16(value, dest, size) CPU_FILL(value, dest, size, 16) +#define CpuFill32(value, dest, size) CPU_FILL(value, dest, size, 32) + +#define CPU_COPY(src, dest, size, bit) CpuSet(src, dest, CPU_SET_##bit##BIT | ((size)/(bit/8) & 0x1FFFFF)) + +#define CpuCopy16(src, dest, size) CPU_COPY(src, dest, size, 16) +#define CpuCopy32(src, dest, size) CPU_COPY(src, dest, size, 32) + +#define CpuFastFill(value, dest, size) \ +{ \ + vu32 tmp = (vu32)(value); \ + CpuFastSet((void *)&tmp, \ + dest, \ + CPU_FAST_SET_SRC_FIXED | ((size)/(32/8) & 0x1FFFFF)); \ +} + +#define CpuFastFill16(value, dest, size) CpuFastFill(((value) << 16) | (value), (dest), (size)) + +#define CpuFastCopy(src, dest, size) CpuFastSet(src, dest, ((size)/(32/8) & 0x1FFFFF)) + +#define DmaSet(dmaNum, src, dest, control) \ +{ \ + vu32 *dmaRegs = (vu32 *)REG_ADDR_DMA##dmaNum; \ + dmaRegs[0] = (vu32)(src); \ + dmaRegs[1] = (vu32)(dest); \ + dmaRegs[2] = (vu32)(control); \ + dmaRegs[2]; \ +} + +#define DMA_FILL(dmaNum, value, dest, size, bit) \ +{ \ + vu##bit tmp = (vu##bit)(value); \ + DmaSet(dmaNum, \ + &tmp, \ + dest, \ + (DMA_ENABLE | DMA_START_NOW | DMA_##bit##BIT | DMA_SRC_FIXED | DMA_DEST_INC) << 16 \ + | ((size)/(bit/8))); \ +} + +#define DmaFill16(dmaNum, value, dest, size) DMA_FILL(dmaNum, value, dest, size, 16) +#define DmaFill32(dmaNum, value, dest, size) DMA_FILL(dmaNum, value, dest, size, 32) + +// Note that the DMA clear macros cause the DMA control value to be calculated +// at runtime rather than compile time. The size is divided by the DMA transfer +// unit size (2 or 4 bytes) and then combined with the DMA control flags using a +// bitwise OR operation. + +#define DMA_CLEAR(dmaNum, dest, size, bit) \ +{ \ + vu##bit *_dest = (vu##bit *)(dest); \ + u32 _size = size; \ + DmaFill##bit(dmaNum, 0, _dest, _size); \ +} + +#define DmaClear16(dmaNum, dest, size) DMA_CLEAR(dmaNum, dest, size, 16) +#define DmaClear32(dmaNum, dest, size) DMA_CLEAR(dmaNum, dest, size, 32) + +#define DMA_COPY(dmaNum, src, dest, size, bit) \ + DmaSet(dmaNum, \ + src, \ + dest, \ + (DMA_ENABLE | DMA_START_NOW | DMA_##bit##BIT | DMA_SRC_INC | DMA_DEST_INC) << 16 \ + | ((size)/(bit/8))) + +#define DmaCopy16(dmaNum, src, dest, size) DMA_COPY(dmaNum, src, dest, size, 16) +#define DmaCopy32(dmaNum, src, dest, size) DMA_COPY(dmaNum, src, dest, size, 32) + +#define DmaStop(dmaNum) \ +{ \ + vu16 *dmaRegs = (vu16 *)REG_ADDR_DMA##dmaNum; \ + dmaRegs[5] &= ~(DMA_START_MASK | DMA_DREQ_ON | DMA_REPEAT); \ + dmaRegs[5] &= ~DMA_ENABLE; \ + dmaRegs[5]; \ +} + +#define DmaCopyLarge(dmaNum, src, dest, size, block, bit) \ +{ \ + const void *_src = src; \ + void *_dest = (void *)(dest); \ + u32 _size = size; \ + while (1) \ + { \ + DmaCopy##bit(dmaNum, _src, _dest, (block)); \ + _src += (block); \ + _dest += (block); \ + _size -= (block); \ + if (_size <= (block)) \ + { \ + DmaCopy##bit(dmaNum, _src, _dest, _size); \ + break; \ + } \ + } \ +} + +#define DmaClearLarge(dmaNum, dest, size, block, bit) \ +{ \ + void *_dest = dest; \ + u32 _size = size; \ + while (1) \ + { \ + DmaFill##bit(dmaNum, 0, _dest, (block)); \ + _dest += (block); \ + _size -= (block); \ + if (_size <= (block)) \ + { \ + DmaFill##bit(dmaNum, 0, _dest, _size); \ + break; \ + } \ + } \ +} + +#define DmaCopyLarge16(dmaNum, src, dest, size, block) DmaCopyLarge(dmaNum, src, dest, size, block, 16) +#define DmaCopyLarge32(dmaNum, src, dest, size, block) DmaCopyLarge(dmaNum, src, dest, size, block, 32) + +#define DmaClearLarge16(dmaNum, dest, size, block) DmaClearLarge(dmaNum, dest, size, block, 16) +#define DmaClearLarge32(dmaNum, dest, size, block) DmaClearLarge(dmaNum, dest, size, block, 32) + +#define DmaCopyDefvars(dmaNum, src, dest, size, bit) \ +{ \ + const void *_src = src; \ + void *_dest = (void *)(dest); \ + u32 _size = size; \ + DmaCopy##bit(dmaNum, _src, _dest, _size); \ +} + +#define DmaCopy16Defvars(dmaNum, src, dest, size) DmaCopyDefvars(dmaNum, src, dest, size, 16) +#define DmaCopy32Defvars(dmaNum, src, dest, size) DmaCopyDefvars(dmaNum, src, dest, size, 32) + +#define DmaFillLarge(dmaNum, fillval, dest, size, block, bit) \ +{ \ + void *_dest = (void *)(dest); \ + u32 _size = (u32)(size); \ + while (1) \ + { \ + DmaFill##bit(dmaNum, fillval, _dest, (block)); \ + _dest += (block); \ + _size -= (block); \ + if (_size <= (block)) \ + { \ + DmaFill##bit(dmaNum, fillval, _dest, _size); \ + break; \ + } \ + } \ +} + +#define DmaFill16Large(dmaNum, fillval, dest, size, block) DmaFillLarge(dmaNum, fillval, dest, size, block, 16) +#define DmaFill32Large(dmaNum, fillval, dest, size, block) DmaFillLarge(dmaNum, fillval, dest, size, block, 32) + +#define DmaFillDefvars(dmaNum, fillval, dest, size, bit) \ +{ \ + void *_dest = (void *)(dest); \ + u32 _size = (u##bit)(size); \ + DmaFill##bit(dmaNum, fillval, _dest, _size); \ +} + +#define DmaFill16Defvars(dmaNum, fillval, dest, size) DmaFillDefvars(dmaNum, fillval, dest, size, 16) +#define DmaFill32Defvars(dmaNum, fillval, dest, size) DmaFillDefvars(dmaNum, fillval, dest, size, 32) + +// from pokeemerald +// Maximum amount of data we will transfer in one operation +#define MAX_DMA_BLOCK_SIZE 0x1000 + +#define MAX_DMA_REQUESTS 128 + +#define DMA_REQUEST_COPY32 1 +#define DMA_REQUEST_FILL32 2 +#define DMA_REQUEST_COPY16 3 +#define DMA_REQUEST_FILL16 4 + +#define Dma3CopyLarge_(src, dest, size, bit) \ +{ \ + const void *_src = src; \ + void *_dest = dest; \ + u32 _size = size; \ + while (1) \ + { \ + if (_size <= MAX_DMA_BLOCK_SIZE) \ + { \ + DmaCopy##bit(3, _src, _dest, _size); \ + break; \ + } \ + DmaCopy##bit(3, _src, _dest, MAX_DMA_BLOCK_SIZE); \ + _src += MAX_DMA_BLOCK_SIZE; \ + _dest += MAX_DMA_BLOCK_SIZE; \ + _size -= MAX_DMA_BLOCK_SIZE; \ + } \ +} + +#define Dma3CopyLarge16_(src, dest, size) Dma3CopyLarge_(src, dest, size, 16) +#define Dma3CopyLarge32_(src, dest, size) Dma3CopyLarge_(src, dest, size, 32) + +#define Dma3FillLarge_(value, dest, size, bit) \ +{ \ + void *_dest = dest; \ + u32 _size = size; \ + while (1) \ + { \ + if (_size <= MAX_DMA_BLOCK_SIZE) \ + { \ + DmaFill##bit(3, value, _dest, _size); \ + break; \ + } \ + DmaFill##bit(3, value, _dest, MAX_DMA_BLOCK_SIZE); \ + _dest += MAX_DMA_BLOCK_SIZE; \ + _size -= MAX_DMA_BLOCK_SIZE; \ + } \ +} + +#define Dma3FillLarge16_(value, dest, size) Dma3FillLarge_(value, dest, size, 16) +#define Dma3FillLarge32_(value, dest, size) Dma3FillLarge_(value, dest, size, 32) + +#endif // GUARD_GBA_MACRO_H diff --git a/include/gba/multiboot.h b/include/gba/multiboot.h new file mode 100644 index 0000000..e88b43a --- /dev/null +++ b/include/gba/multiboot.h @@ -0,0 +1,55 @@ +#ifndef GUARD_GBA_MULTIBOOT_H +#define GUARD_GBA_MULTIBOOT_H + +#define MULTIBOOT_NCHILD 3 // Maximum number of slaves +#define MULTIBOOT_HEADER_SIZE 0xc0 // Header size +#define MULTIBOOT_SEND_SIZE_MIN 0x100 // Minimum transmission size +#define MULTIBOOT_SEND_SIZE_MAX 0x40000 // Maximum transmission size + +struct MultiBootParam +{ + u32 system_work[5]; + u8 handshake_data; + u8 padding; + u16 handshake_timeout; + u8 probe_count; + u8 client_data[MULTIBOOT_NCHILD]; + u8 palette_data; + u8 response_bit; + u8 client_bit; + u8 reserved1; + u8 *boot_srcp; + u8 *boot_endp; + u8 *masterp; + u8 *reserved2[MULTIBOOT_NCHILD]; + u32 system_work2[4]; + u8 sendflag; + u8 probe_target_bit; + u8 check_wait; + u8 server_type; +}; + +#define MULTIBOOT_ERROR_04 0x04 +#define MULTIBOOT_ERROR_08 0x08 +#define MULTIBOOT_ERROR_0c 0x0c +#define MULTIBOOT_ERROR_40 0x40 +#define MULTIBOOT_ERROR_44 0x44 +#define MULTIBOOT_ERROR_48 0x48 +#define MULTIBOOT_ERROR_4c 0x4c +#define MULTIBOOT_ERROR_80 0x80 +#define MULTIBOOT_ERROR_84 0x84 +#define MULTIBOOT_ERROR_88 0x88 +#define MULTIBOOT_ERROR_8c 0x8c +#define MULTIBOOT_ERROR_NO_PROBE_TARGET 0x50 +#define MULTIBOOT_ERROR_NO_DLREADY 0x60 +#define MULTIBOOT_ERROR_BOOT_FAILURE 0x70 +#define MULTIBOOT_ERROR_HANDSHAKE_FAILURE 0x71 + +#define MULTIBOOT_CONNECTION_CHECK_WAIT 15 + +#define MULTIBOOT_SERVER_TYPE_NORMAL 0 +#define MULTIBOOT_SERVER_TYPE_QUICK 1 + +#define MULTIBOOT_HANDSHAKE_TIMEOUT 400 + +#endif // GUARD_GBA_MULTIBOOT_H diff --git a/include/gba/syscall.h b/include/gba/syscall.h new file mode 100644 index 0000000..deddec5 --- /dev/null +++ b/include/gba/syscall.h @@ -0,0 +1,48 @@ +#ifndef GUARD_GBA_SYSCALL_H +#define GUARD_GBA_SYSCALL_H + +#define RESET_EWRAM 0x01 +#define RESET_IWRAM 0x02 +#define RESET_PALETTE 0x04 +#define RESET_VRAM 0x08 +#define RESET_OAM 0x10 +#define RESET_SIO_REGS 0x20 +#define RESET_SOUND_REGS 0x40 +#define RESET_REGS 0x80 +#define RESET_ALL 0xFF + +void SoftReset(u32 resetFlags); + +void RegisterRamReset(u32 resetFlags); + +void VBlankIntrWait(void); + +u16 Sqrt(u32 num); + +u16 ArcTan2(s16 x, s16 y); + +#define CPU_SET_SRC_FIXED 0x01000000 +#define CPU_SET_16BIT 0x00000000 +#define CPU_SET_32BIT 0x04000000 + +void CpuSet(const void *src, void *dest, u32 control); + +#define CPU_FAST_SET_SRC_FIXED 0x01000000 + +void CpuFastSet(const void *src, void *dest, u32 control); + +void BgAffineSet(struct BgAffineSrcData *src, struct BgAffineDstData *dest, s32 count); + +void ObjAffineSet(struct ObjAffineSrcData *src, void *dest, s32 count, s32 offset); + +void LZ77UnCompWram(const void *src, void *dest); + +void LZ77UnCompVram(const void *src, void *dest); + +void RLUnCompWram(const void *src, void *dest); + +void RLUnCompVram(const void *src, void *dest); + +int MultiBoot(struct MultiBootParam *mp); + +#endif // GUARD_GBA_SYSCALL_H diff --git a/include/gba/types.h b/include/gba/types.h new file mode 100644 index 0000000..4d6c24a --- /dev/null +++ b/include/gba/types.h @@ -0,0 +1,142 @@ +#ifndef GUARD_GBA_TYPES_H +#define GUARD_GBA_TYPES_H + +#include + +typedef uint8_t u8; +typedef uint16_t u16; +typedef uint32_t u32; +typedef uint64_t u64; +typedef int8_t s8; +typedef int16_t s16; +typedef int32_t s32; +typedef int64_t s64; + +typedef volatile u8 vu8; +typedef volatile u16 vu16; +typedef volatile u32 vu32; +typedef volatile u64 vu64; +typedef volatile s8 vs8; +typedef volatile s16 vs16; +typedef volatile s32 vs32; +typedef volatile s64 vs64; + +typedef float f32; +typedef double f64; + +typedef u8 bool8; +typedef u16 bool16; +typedef u32 bool32; + +struct BgCnt +{ + u16 priority:2; + u16 charBaseBlock:2; + u16 dummy:2; + u16 mosaic:1; + u16 palettes:1; + u16 screenBaseBlock:5; + u16 areaOverflowMode:1; + u16 screenSize:2; +}; +typedef volatile struct BgCnt vBgCnt; + +struct PlttData +{ + u16 r:5; // red + u16 g:5; // green + u16 b:5; // blue + u16 unused_15:1; +} /*__attribute__((packed))*/; + +struct OamData +{ + /*0x00*/ u32 y:8; + /*0x01*/ u32 affineMode:2; // 0x1, 0x2 = 0x3 + u32 objMode:2; // 0x4, 0x8 = 0xC + u32 mosaic:1; // 0x10 + u32 bpp:1; // 0x20 + u32 shape:2; // 0x40, 0x80 + + /*0x02*/ u32 x:9; + u32 matrixNum:5; // bits 3/4 are h-flip/v-flip if not in affine mode + u32 size:2; + + /*0x04*/ u16 tileNum:10; + u16 priority:2; + u16 paletteNum:4; + /*0x06*/ u16 affineParam; +}; + +#define ST_OAM_OBJ_NORMAL 0 +#define ST_OAM_OBJ_BLEND 1 +#define ST_OAM_OBJ_WINDOW 2 + +#define ST_OAM_AFFINE_OFF 0 +#define ST_OAM_AFFINE_NORMAL 1 +#define ST_OAM_AFFINE_ERASE 2 +#define ST_OAM_AFFINE_DOUBLE 3 + +#define ST_OAM_AFFINE_ON_MASK 1 +#define ST_OAM_AFFINE_DOUBLE_MASK 2 + +#define ST_OAM_4BPP 0 +#define ST_OAM_8BPP 1 + +#define ST_OAM_SQUARE 0 +#define ST_OAM_H_RECTANGLE 1 +#define ST_OAM_V_RECTANGLE 2 + +struct BgAffineSrcData +{ + s32 texX; + s32 texY; + s16 scrX; + s16 scrY; + s16 sx; + s16 sy; + u16 alpha; +}; + +struct BgAffineDstData +{ + s16 pa; + s16 pb; + s16 pc; + s16 pd; + s32 dx; + s32 dy; +}; + +struct ObjAffineSrcData +{ + s16 xScale; + s16 yScale; + u16 rotation; +}; + +// Multi-player SIO Control Structure +struct SioMultiCnt +{ + u16 baudRate:2; // baud rate + u16 si:1; // SI terminal + u16 sd:1; // SD terminal + u16 id:2; // ID + u16 error:1; // error flag + u16 enable:1; // SIO enable + u16 unused_11_8:4; + u16 mode:2; // communication mode (should equal 2) + u16 intrEnable:1; // IRQ enable + u16 unused_15:1; + u16 data; // data +}; + +#define ST_SIO_MULTI_MODE 2 // Multi-player communication mode + +// baud rate +#define ST_SIO_9600_BPS 0 // 9600 bps +#define ST_SIO_38400_BPS 1 // 38400 bps +#define ST_SIO_57600_BPS 2 // 57600 bps +#define ST_SIO_115200_BPS 3 // 115200 bps + +#endif // GUARD_GBA_TYPES_H diff --git a/ld_script.ld b/ld_script.ld new file mode 100644 index 0000000..db16c7c --- /dev/null +++ b/ld_script.ld @@ -0,0 +1,40 @@ +SECTIONS { + . = 0x02000000; + .text : + ALIGN(4) + { + asm/crt0.o(.text); + asm/all.o(.text); + asm/m4a.o(.text); + asm/main.o(.text); + asm/unk_200E344.o(.text); + asm/siirtc.o(.text); + asm/libagbsyscall.o(.text); + *libgcc.a:_call_via_rX.o(.text); + *libgcc.a:_divsi3.o(.text); + *libgcc.a:_dvmd_tls.o(.text); + *libgcc.a:_modsi3.o(.text); + *libgcc.a:_umodsi3.o(.text); + *libc.a:memcpy.o(.text); + } =0 + .rodata : + ALIGN(4) + { + data/data.o(.rodata); + } =0 + ewram_data : + ALIGN(4) + { + asm/ewram.o(ewram_data); + } =0 + . = 0x03000000; + iwram : + ALIGN(4) + { + asm/all.o(.bss); + } + /DISCARD/ : + { + *(*); + } +} diff --git a/rom.sha1 b/rom.sha1 new file mode 100644 index 0000000..c307c4c --- /dev/null +++ b/rom.sha1 @@ -0,0 +1 @@ +24d4b01fb2970f89fff487b9192812f3370a5be0 payload.gba diff --git a/tools/aif2pcm/.gitignore b/tools/aif2pcm/.gitignore new file mode 100644 index 0000000..3153179 --- /dev/null +++ b/tools/aif2pcm/.gitignore @@ -0,0 +1,2 @@ +aif2pcm + diff --git a/tools/aif2pcm/LICENSE b/tools/aif2pcm/LICENSE new file mode 100644 index 0000000..966b92b --- /dev/null +++ b/tools/aif2pcm/LICENSE @@ -0,0 +1,20 @@ +Copyright (c) 2016 huderlem +Copyright (c) 2005, 2006 by Marco Trillo + +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. diff --git a/tools/aif2pcm/Makefile b/tools/aif2pcm/Makefile new file mode 100644 index 0000000..e5cb6ad --- /dev/null +++ b/tools/aif2pcm/Makefile @@ -0,0 +1,15 @@ +CC = gcc + +CFLAGS = -Wall -Wextra -Wno-switch -Werror -std=c11 -O2 + +LIBS = -lm + +SRCS = main.c extended.c + +.PHONY: clean + +aif2pcm: $(SRCS) + $(CC) $(CFLAGS) $(SRCS) -o $@ $(LDFLAGS) $(LIBS) + +clean: + $(RM) aif2pcm aif2pcm.exe diff --git a/tools/aif2pcm/extended.c b/tools/aif2pcm/extended.c new file mode 100644 index 0000000..9444916 --- /dev/null +++ b/tools/aif2pcm/extended.c @@ -0,0 +1,172 @@ +/* $Id: extended.c,v 1.8 2006/12/23 11:17:49 toad32767 Exp $ */ +/*- + * Copyright (c) 2005, 2006 by Marco Trillo + * + * 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. + */ + +#include +#include +#include + +/* + * Infinite & NAN values + * for non-IEEE systems + */ +#ifndef HUGE_VAL +#ifdef HUGE +#define INFINITE_VALUE HUGE +#define NAN_VALUE HUGE +#endif +#else +#define INFINITE_VALUE HUGE_VAL +#define NAN_VALUE HUGE_VAL +#endif + +/* + * IEEE 754 Extended Precision + * + * Implementation here is the 80-bit extended precision + * format of Motorola 68881, Motorola 68882 and Motorola + * 68040 FPUs, as well as Intel 80x87 FPUs. + * + * See: + * http://www.freescale.com/files/32bit/doc/fact_sheet/BR509.pdf + */ +/* + * Exponent range: [-16383,16383] + * Precision for mantissa: 64 bits with no hidden bit + * Bias: 16383 + */ + +/* + * Write IEEE Extended Precision Numbers + */ +void +ieee754_write_extended(double in, uint8_t* out) +{ + int sgn, exp, shift; + double fraction, t; + unsigned int lexp, hexp; + unsigned long low, high; + + if (in == 0.0) { + memset(out, 0, 10); + return; + } + if (in < 0.0) { + in = fabs(in); + sgn = 1; + } else + sgn = 0; + + fraction = frexp(in, &exp); + + if (exp == 0 || exp > 16384) { + if (exp > 16384) /* infinite value */ + low = high = 0; + else { + low = 0x80000000; + high = 0; + } + exp = 32767; + goto done; + } + fraction = ldexp(fraction, 32); + t = floor(fraction); + low = (unsigned long) t; + fraction -= t; + t = floor(ldexp(fraction, 32)); + high = (unsigned long) t; + + /* Convert exponents < -16382 to -16382 (then they will be + * stored as -16383) */ + if (exp < -16382) { + shift = 0 - exp - 16382; + high >>= shift; + high |= (low << (32 - shift)); + low >>= shift; + exp = -16382; + } + exp += 16383 - 1; /* bias */ + +done: + lexp = ((unsigned int) exp) >> 8; + hexp = ((unsigned int) exp) & 0xFF; + + /* big endian */ + out[0] = ((uint8_t) sgn) << 7; + out[0] |= (uint8_t) lexp; + out[1] = (uint8_t) hexp; + out[2] = (uint8_t) (low >> 24); + out[3] = (uint8_t) ((low >> 16) & 0xFF); + out[4] = (uint8_t) ((low >> 8) & 0xFF); + out[5] = (uint8_t) (low & 0xFF); + out[6] = (uint8_t) (high >> 24); + out[7] = (uint8_t) ((high >> 16) & 0xFF); + out[8] = (uint8_t) ((high >> 8) & 0xFF); + out[9] = (uint8_t) (high & 0xFF); + + return; +} + + +/* + * Read IEEE Extended Precision Numbers + */ +double +ieee754_read_extended(uint8_t* in) +{ + int sgn, exp; + unsigned long low, high; + double out; + + /* Extract the components from the big endian buffer */ + sgn = (int) (in[0] >> 7); + exp = ((int) (in[0] & 0x7F) << 8) | ((int) in[1]); + low = (((unsigned long) in[2]) << 24) + | (((unsigned long) in[3]) << 16) + | (((unsigned long) in[4]) << 8) | (unsigned long) in[5]; + high = (((unsigned long) in[6]) << 24) + | (((unsigned long) in[7]) << 16) + | (((unsigned long) in[8]) << 8) | (unsigned long) in[9]; + + if (exp == 0 && low == 0 && high == 0) + return (sgn ? -0.0 : 0.0); + + switch (exp) { + case 32767: + if (low == 0 && high == 0) + return (sgn ? -INFINITE_VALUE : INFINITE_VALUE); + else + return (sgn ? -NAN_VALUE : NAN_VALUE); + default: + exp -= 16383; /* unbias exponent */ + + } + + out = ldexp((double) low, -31 + exp); + out += ldexp((double) high, -63 + exp); + + return (sgn ? -out : out); +} diff --git a/tools/aif2pcm/main.c b/tools/aif2pcm/main.c new file mode 100644 index 0000000..51dbf1b --- /dev/null +++ b/tools/aif2pcm/main.c @@ -0,0 +1,830 @@ +// Copyright(c) 2016 huderlem +// +// 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. + +#include +#include +#include +#include +#include +#include + +/* extended.c */ +void ieee754_write_extended (double, uint8_t*); +double ieee754_read_extended (uint8_t*); + +#ifdef _MSC_VER + +#define FATAL_ERROR(format, ...) \ +do \ +{ \ + fprintf(stderr, format, __VA_ARGS__); \ + exit(1); \ +} while (0) + +#else + +#define FATAL_ERROR(format, ...) \ +do \ +{ \ + fprintf(stderr, format, ##__VA_ARGS__); \ + exit(1); \ +} while (0) + +#endif // _MSC_VER + +typedef struct { + unsigned long num_samples; + uint8_t *samples; + uint8_t midi_note; + bool has_loop; + unsigned long loop_offset; + double sample_rate; + unsigned long real_num_samples; +} AifData; + +struct Bytes { + unsigned long length; + uint8_t *data; +}; + +struct Bytes *read_bytearray(const char *filename) +{ + struct Bytes *bytes = malloc(sizeof(struct Bytes)); + FILE *f = fopen(filename, "rb"); + if (!f) + { + FATAL_ERROR("Failed to open '%s' for reading!\n", filename); + } + fseek(f, 0, SEEK_END); + bytes->length = ftell(f); + fseek(f, 0, SEEK_SET); + bytes->data = malloc(bytes->length); + unsigned long read = fread(bytes->data, bytes->length, 1, f); + fclose(f); + if (read <= 0) + { + FATAL_ERROR("Failed to read data from '%s'!\n", filename); + } + return bytes; +} + +void write_bytearray(const char *filename, struct Bytes *bytes) +{ + FILE *f = fopen(filename, "wb"); + if (!f) + { + FATAL_ERROR("Failed to open '%s' for writing!\n", filename); + } + fwrite(bytes->data, bytes->length, 1, f); + fclose(f); +} + +void free_bytearray(struct Bytes *bytes) +{ + free(bytes->data); + free(bytes); +} + +char *get_file_extension(char *filename) +{ + char *index = strrchr(filename, '.'); + if (!index || index == filename) + { + return NULL; + } + return index + 1; +} + +char *new_file_extension(char *filename, char *ext) +{ + char *index = strrchr(filename, '.'); + if (!index || index == filename) + { + index = filename + strlen(filename); + } + int length = index - filename; + char *new_filename = malloc(length + 1 + strlen(ext) + 1); + if (new_filename) + { + strcpy(new_filename, filename); + new_filename[length] = '.'; + strcpy(new_filename + length + 1, ext); + } + return new_filename; +} + +void read_aif(struct Bytes *aif, AifData *aif_data) +{ + aif_data->has_loop = false; + aif_data->num_samples = 0; + + unsigned long pos = 0; + char chunk_name[5]; chunk_name[4] = '\0'; + char chunk_type[5]; chunk_type[4] = '\0'; + + // Check for FORM Chunk + memcpy(chunk_name, &aif->data[pos], 4); + pos += 4; + if (strcmp(chunk_name, "FORM") != 0) + { + FATAL_ERROR("Input .aif file has invalid header Chunk '%s'!\n", chunk_name); + } + + // Read size of whole file. + unsigned long whole_chunk_size = aif->data[pos++] << 24; + whole_chunk_size |= (aif->data[pos++] << 16); + whole_chunk_size |= (aif->data[pos++] << 8); + whole_chunk_size |= (uint8_t)aif->data[pos++]; + + unsigned long expected_whole_chunk_size = aif->length - 8; + if (whole_chunk_size != expected_whole_chunk_size) + { + FATAL_ERROR("FORM Chunk ckSize '%lu' doesn't match actual size '%lu'!\n", whole_chunk_size, expected_whole_chunk_size); + } + + // Check for AIFF Form Type + memcpy(chunk_type, &aif->data[pos], 4); + pos += 4; + if (strcmp(chunk_type, "AIFF") != 0) + { + FATAL_ERROR("FORM Type is '%s', but it must be AIFF!", chunk_type); + } + + unsigned long num_sample_frames = 0; + + // Read all the Chunks to populate the AifData struct. + while ((pos + 8) < aif->length) + { + // Read Chunk id + memcpy(chunk_name, &aif->data[pos], 4); + pos += 4; + + unsigned long chunk_size = (aif->data[pos++] << 24); + chunk_size |= (aif->data[pos++] << 16); + chunk_size |= (aif->data[pos++] << 8); + chunk_size |= aif->data[pos++]; + + if ((pos + chunk_size) > aif->length) + { + FATAL_ERROR("%s chunk at 0x%lx reached end of file before finishing\n", chunk_name, pos); + } + + if (strcmp(chunk_name, "COMM") == 0) + { + short num_channels = (aif->data[pos++] << 8); + num_channels |= (uint8_t)aif->data[pos++]; + if (num_channels != 1) + { + FATAL_ERROR("numChannels (%d) in the COMM Chunk must be 1!\n", num_channels); + } + + num_sample_frames = (aif->data[pos++] << 24); + num_sample_frames |= (aif->data[pos++] << 16); + num_sample_frames |= (aif->data[pos++] << 8); + num_sample_frames |= (uint8_t)aif->data[pos++]; + + short sample_size = (aif->data[pos++] << 8); + sample_size |= (uint8_t)aif->data[pos++]; + if (sample_size != 8) + { + FATAL_ERROR("sampleSize (%d) in the COMM Chunk must be 8!\n", sample_size); + } + + double sample_rate = ieee754_read_extended((uint8_t*)(aif->data + pos)); + pos += 10; + + aif_data->sample_rate = sample_rate; + + if (aif_data->num_samples == 0) + { + aif_data->num_samples = num_sample_frames; + } + } + else if (strcmp(chunk_name, "MARK") == 0) + { + unsigned short num_markers = (aif->data[pos++] << 8); + num_markers |= (uint8_t)aif->data[pos++]; + + // Read each marker and look for the "START" marker. + for (int i = 0; i < num_markers; i++) + { + unsigned short marker_id = (aif->data[pos++] << 8); + marker_id |= (uint8_t)aif->data[pos++]; + + unsigned long marker_position = (aif->data[pos++] << 24); + marker_position |= (aif->data[pos++] << 16); + marker_position |= (aif->data[pos++] << 8); + marker_position |= (uint8_t)aif->data[pos++]; + + // Marker id is a pascal-style string. + uint8_t marker_name_size = aif->data[pos++]; + char *marker_name = (char *)malloc((marker_name_size + 1) * sizeof(char)); + memcpy(marker_name, &aif->data[pos], marker_name_size); + marker_name[marker_name_size] = '\0'; + pos += marker_name_size; + + if (strcmp(marker_name, "START") == 0) + { + aif_data->loop_offset = marker_position; + aif_data->has_loop = true; + } + else if (strcmp(marker_name, "END") == 0) + { + if (!aif_data->has_loop) { + aif_data->loop_offset = marker_position; + aif_data->has_loop = true; + } + aif_data->num_samples = marker_position; + } + + free(marker_name); + } + } + else if (strcmp(chunk_name, "INST") == 0) + { + uint8_t midi_note = (uint8_t)aif->data[pos++]; + + aif_data->midi_note = midi_note; + + // Skip over data we don't need. + pos += 19; + } + else if (strcmp(chunk_name, "SSND") == 0) + { + // SKip offset and blockSize + pos += 8; + + unsigned long num_samples = chunk_size - 8; + uint8_t *sample_data = (uint8_t *)malloc(num_samples * sizeof(uint8_t)); + memcpy(sample_data, &aif->data[pos], num_samples); + + aif_data->samples = sample_data; + aif_data->real_num_samples = num_samples; + pos += chunk_size - 8; + } + else + { + // Skip over unsupported chunks. + pos += chunk_size; + } + } +} + +// This is a table of deltas between sample values in compressed PCM data. +const int gDeltaEncodingTable[] = { + 0, 1, 4, 9, 16, 25, 36, 49, + -64, -49, -36, -25, -16, -9, -4, -1, +}; + +struct Bytes *delta_decompress(struct Bytes *delta, unsigned int expected_length) +{ + struct Bytes *pcm = malloc(sizeof(struct Bytes)); + pcm->length = expected_length; + pcm->data = malloc(pcm->length + 0x40); + + uint8_t hi, lo; + unsigned int i = 0; + unsigned int j = 0; + int k; + int8_t base; + while (i < delta->length) + { + base = (int8_t)delta->data[i++]; + pcm->data[j++] = (uint8_t)base; + if (i >= delta->length) + { + break; + } + if (j >= pcm->length) + { + break; + } + lo = delta->data[i] & 0xf; + base += gDeltaEncodingTable[lo]; + pcm->data[j++] = base; + i++; + if (i >= delta->length) + { + break; + } + if (j >= pcm->length) + { + break; + } + for (k = 0; k < 31; k++) + { + hi = (delta->data[i] >> 4) & 0xf; + base += gDeltaEncodingTable[hi]; + pcm->data[j++] = base; + if (j >= pcm->length) + { + break; + } + lo = delta->data[i] & 0xf; + base += gDeltaEncodingTable[lo]; + pcm->data[j++] = base; + i++; + if (i >= delta->length) + { + break; + } + if (j >= pcm->length) + { + break; + } + } + if (j >= pcm->length) + { + break; + } + } + + pcm->length = j; + return pcm; +} + +int get_delta_index(uint8_t sample, uint8_t prev_sample) +{ + int best_error = INT_MAX; + int best_index = -1; + + for (int i = 0; i < 16; i++) + { + uint8_t new_sample = prev_sample + gDeltaEncodingTable[i]; + int error = sample > new_sample ? sample - new_sample : new_sample - sample; + + if (error < best_error) + { + best_error = error; + best_index = i; + } + } + + return best_index; +} + +struct Bytes *delta_compress(struct Bytes *pcm) +{ + struct Bytes *delta = malloc(sizeof(struct Bytes)); + // estimate the length so we can malloc + int num_blocks = pcm->length / 64; + delta->length = num_blocks * 33; + + int extra = pcm->length % 64; + if (extra) + { + delta->length += 1; + extra -= 1; + } + if (extra) + { + delta->length += 1; + extra -= 1; + } + if (extra) + { + delta->length += (extra + 1) / 2; + } + + delta->data = malloc(delta->length + 33); + + unsigned int i = 0; + unsigned int j = 0; + int k; + uint8_t base; + int delta_index; + + while (i < pcm->length) + { + base = pcm->data[i++]; + delta->data[j++] = base; + + if (i >= pcm->length) + { + break; + } + delta_index = get_delta_index(pcm->data[i++], base); + base += gDeltaEncodingTable[delta_index]; + delta->data[j++] = delta_index; + + for (k = 0; k < 31; k++) + { + if (i >= pcm->length) + { + break; + } + delta_index = get_delta_index(pcm->data[i++], base); + base += gDeltaEncodingTable[delta_index]; + delta->data[j] = (delta_index << 4); + + if (i >= pcm->length) + { + break; + } + delta_index = get_delta_index(pcm->data[i++], base); + base += gDeltaEncodingTable[delta_index]; + delta->data[j++] |= delta_index; + } + } + + delta->length = j; + + return delta; +} + +#define STORE_U32_LE(dest, value) \ +do { \ + *(dest) = (value) & 0xff; \ + *((dest) + 1) = ((value) >> 8) & 0xff; \ + *((dest) + 2) = ((value) >> 16) & 0xff; \ + *((dest) + 3) = ((value) >> 24) & 0xff; \ +} while (0) + +#define LOAD_U32_LE(var, src) \ +do { \ + (var) = *(src); \ + (var) |= (*((src) + 1) << 8); \ + (var) |= (*((src) + 2) << 16); \ + (var) |= (*((src) + 3) << 24); \ +} while (0) + +// Reads an .aif file and produces a .pcm file containing an array of 8-bit samples. +void aif2pcm(const char *aif_filename, const char *pcm_filename, bool compress) +{ + struct Bytes *aif = read_bytearray(aif_filename); + AifData aif_data = {0,0,0,0,0,0,0}; + read_aif(aif, &aif_data); + + int header_size = 0x10; + struct Bytes *pcm; + struct Bytes output = {0,0}; + + if (compress) + { + struct Bytes *input = malloc(sizeof(struct Bytes)); + input->data = aif_data.samples; + input->length = aif_data.real_num_samples; + pcm = delta_compress(input); + free(input); + } + else + { + pcm = malloc(sizeof(struct Bytes)); + pcm->data = aif_data.samples; + pcm->length = aif_data.real_num_samples; + } + output.length = header_size + pcm->length; + output.data = malloc(output.length); + + uint32_t pitch_adjust = (uint32_t)(aif_data.sample_rate * 1024); + uint32_t loop_offset = (uint32_t)(aif_data.loop_offset); + uint32_t adjusted_num_samples = (uint32_t)(aif_data.num_samples - 1); + uint32_t flags = 0; + if (aif_data.has_loop) flags |= 0x40000000; + if (compress) flags |= 1; + STORE_U32_LE(output.data + 0, flags); + STORE_U32_LE(output.data + 4, pitch_adjust); + STORE_U32_LE(output.data + 8, loop_offset); + STORE_U32_LE(output.data + 12, adjusted_num_samples); + memcpy(&output.data[header_size], pcm->data, pcm->length); + write_bytearray(pcm_filename, &output); + + free(aif->data); + free(aif); + free(pcm); + free(output.data); + free(aif_data.samples); +} + +// Reads a .pcm file containing an array of 8-bit samples and produces an .aif file. +// See http://www-mmsp.ece.mcgill.ca/documents/audioformats/aiff/Docs/AIFF-1.3.pdf for .aif file specification. +void pcm2aif(const char *pcm_filename, const char *aif_filename, uint32_t base_note) +{ + struct Bytes *pcm = read_bytearray(pcm_filename); + + AifData *aif_data = malloc(sizeof(AifData)); + + uint32_t flags; + LOAD_U32_LE(flags, pcm->data + 0); + aif_data->has_loop = flags & 0x40000000; + bool compressed = flags & 1; + + uint32_t pitch_adjust; + LOAD_U32_LE(pitch_adjust, pcm->data + 4); + aif_data->sample_rate = pitch_adjust / 1024.0; + + LOAD_U32_LE(aif_data->loop_offset, pcm->data + 8); + LOAD_U32_LE(aif_data->num_samples, pcm->data + 12); + aif_data->num_samples += 1; + + if (compressed) + { + struct Bytes *delta = pcm; + uint8_t *pcm_data = pcm->data; + delta->length -= 0x10; + delta->data += 0x10; + pcm = delta_decompress(delta, aif_data->num_samples); + free(pcm_data); + free(delta); + } + else + { + pcm->length -= 0x10; + pcm->data += 0x10; + } + + aif_data->samples = malloc(pcm->length); + memcpy(aif_data->samples, pcm->data, pcm->length); + + struct Bytes *aif = malloc(sizeof(struct Bytes)); + aif->length = 54 + 60 + pcm->length; + aif->data = malloc(aif->length); + + long pos = 0; + + // First, write the FORM header chunk. + // FORM Chunk ckID + aif->data[pos++] = 'F'; + aif->data[pos++] = 'O'; + aif->data[pos++] = 'R'; + aif->data[pos++] = 'M'; + + // FORM Chunk ckSize + unsigned long form_size = pos; + unsigned long data_size = aif->length - 8; + aif->data[pos++] = ((data_size >> 24) & 0xFF); + aif->data[pos++] = ((data_size >> 16) & 0xFF); + aif->data[pos++] = ((data_size >> 8) & 0xFF); + aif->data[pos++] = (data_size & 0xFF); + + // FORM Chunk formType + aif->data[pos++] = 'A'; + aif->data[pos++] = 'I'; + aif->data[pos++] = 'F'; + aif->data[pos++] = 'F'; + + // Next, write the Common Chunk + // Common Chunk ckID + aif->data[pos++] = 'C'; + aif->data[pos++] = 'O'; + aif->data[pos++] = 'M'; + aif->data[pos++] = 'M'; + + // Common Chunk ckSize + aif->data[pos++] = 0; + aif->data[pos++] = 0; + aif->data[pos++] = 0; + aif->data[pos++] = 18; + + // Common Chunk numChannels + aif->data[pos++] = 0; + aif->data[pos++] = 1; // 1 channel + + // Common Chunk numSampleFrames + aif->data[pos++] = ((aif_data->num_samples >> 24) & 0xFF); + aif->data[pos++] = ((aif_data->num_samples >> 16) & 0xFF); + aif->data[pos++] = ((aif_data->num_samples >> 8) & 0xFF); + aif->data[pos++] = (aif_data->num_samples & 0xFF); + + // Common Chunk sampleSize + aif->data[pos++] = 0; + aif->data[pos++] = 8; // 8 bits per sample + + // Common Chunk sampleRate + //double sample_rate = pitch_adjust / 1024.0; + uint8_t sample_rate_buffer[10]; + ieee754_write_extended(aif_data->sample_rate, sample_rate_buffer); + for (int i = 0; i < 10; i++) + { + aif->data[pos++] = sample_rate_buffer[i]; + } + + if (aif_data->has_loop) + { + + // Marker Chunk ckID + aif->data[pos++] = 'M'; + aif->data[pos++] = 'A'; + aif->data[pos++] = 'R'; + aif->data[pos++] = 'K'; + + // Marker Chunk ckSize + aif->data[pos++] = 0; + aif->data[pos++] = 0; + aif->data[pos++] = 0; + aif->data[pos++] = 12 + (aif_data->has_loop ? 12 : 0); + + // Marker Chunk numMarkers + aif->data[pos++] = 0; + aif->data[pos++] = (aif_data->has_loop ? 2 : 1); + + // Marker loop start + aif->data[pos++] = 0; + aif->data[pos++] = 1; // id = 1 + + long loop_start = aif_data->loop_offset; + aif->data[pos++] = ((loop_start >> 24) & 0xFF); + aif->data[pos++] = ((loop_start >> 16) & 0xFF); + aif->data[pos++] = ((loop_start >> 8) & 0xFF); + aif->data[pos++] = (loop_start & 0xFF); // position + + aif->data[pos++] = 5; // pascal-style string length + aif->data[pos++] = 'S'; + aif->data[pos++] = 'T'; + aif->data[pos++] = 'A'; + aif->data[pos++] = 'R'; + aif->data[pos++] = 'T'; // markerName + + // Marker loop end + aif->data[pos++] = 0; + aif->data[pos++] = (aif_data->has_loop ? 2 : 1); // id = 2 + + long loop_end = aif_data->num_samples; + aif->data[pos++] = ((loop_end >> 24) & 0xFF); + aif->data[pos++] = ((loop_end >> 16) & 0xFF); + aif->data[pos++] = ((loop_end >> 8) & 0xFF); + aif->data[pos++] = (loop_end & 0xFF); // position + + aif->data[pos++] = 3; // pascal-style string length + aif->data[pos++] = 'E'; + aif->data[pos++] = 'N'; + aif->data[pos++] = 'D'; + } + + // Instrument Chunk ckID + aif->data[pos++] = 'I'; + aif->data[pos++] = 'N'; + aif->data[pos++] = 'S'; + aif->data[pos++] = 'T'; + + // Instrument Chunk ckSize + aif->data[pos++] = 0; + aif->data[pos++] = 0; + aif->data[pos++] = 0; + aif->data[pos++] = 20; + + aif->data[pos++] = base_note; // baseNote + aif->data[pos++] = 0; // detune + aif->data[pos++] = 0; // lowNote + aif->data[pos++] = 127; // highNote + aif->data[pos++] = 1; // lowVelocity + aif->data[pos++] = 127; // highVelocity + aif->data[pos++] = 0; // gain (hi) + aif->data[pos++] = 0; // gain (lo) + + // Instrument Chunk sustainLoop + aif->data[pos++] = 0; + aif->data[pos++] = 1; // playMode = ForwardLooping + + aif->data[pos++] = 0; + aif->data[pos++] = 1; // beginLoop marker id + + aif->data[pos++] = 0; + aif->data[pos++] = 2; // endLoop marker id + + // Instrument Chunk releaseLoop + aif->data[pos++] = 0; + aif->data[pos++] = 1; // playMode = ForwardLooping + + aif->data[pos++] = 0; + aif->data[pos++] = 1; // beginLoop marker id + + aif->data[pos++] = 0; + aif->data[pos++] = 2; // endLoop marker id + + // Finally, write the Sound Data Chunk + // Sound Data Chunk ckID + aif->data[pos++] = 'S'; + aif->data[pos++] = 'S'; + aif->data[pos++] = 'N'; + aif->data[pos++] = 'D'; + + // Sound Data Chunk ckSize + unsigned long sound_data_size = pcm->length + 8; + aif->data[pos++] = ((sound_data_size >> 24) & 0xFF); + aif->data[pos++] = ((sound_data_size >> 16) & 0xFF); + aif->data[pos++] = ((sound_data_size >> 8) & 0xFF); + aif->data[pos++] = (sound_data_size & 0xFF); + + // Sound Data Chunk offset + aif->data[pos++] = 0; + aif->data[pos++] = 0; + aif->data[pos++] = 0; + aif->data[pos++] = 0; + + // Sound Data Chunk blockSize + aif->data[pos++] = 0; + aif->data[pos++] = 0; + aif->data[pos++] = 0; + aif->data[pos++] = 0; + + // Sound Data Chunk soundData + for (unsigned int i = 0; i < aif_data->loop_offset; i++) + { + aif->data[pos++] = aif_data->samples[i]; + } + + int j = 0; + for (unsigned int i = aif_data->loop_offset; i < pcm->length; i++) + { + int pcm_index = aif_data->loop_offset + (j++ % (pcm->length - aif_data->loop_offset)); + aif->data[pos++] = aif_data->samples[pcm_index]; + } + + aif->length = pos; + + // Go back and rewrite ckSize + data_size = aif->length - 8; + aif->data[form_size + 0] = ((data_size >> 24) & 0xFF); + aif->data[form_size + 1] = ((data_size >> 16) & 0xFF); + aif->data[form_size + 2] = ((data_size >> 8) & 0xFF); + aif->data[form_size + 3] = (data_size & 0xFF); + + write_bytearray(aif_filename, aif); + + free(aif->data); + free(aif); +} + +void usage(void) +{ + fprintf(stderr, "Usage: aif2pcm bin_file [aif_file]\n"); + fprintf(stderr, " aif2pcm aif_file [bin_file] [--compress]\n"); +} + +int main(int argc, char **argv) +{ + if (argc < 2) + { + usage(); + exit(1); + } + + char *input_file = argv[1]; + char *extension = get_file_extension(input_file); + char *output_file; + bool compressed = false; + + if (argc > 3) + { + for (int i = 3; i < argc; i++) + { + if (strcmp(argv[i], "--compress") == 0) + { + compressed = true; + } + } + } + + if (strcmp(extension, "aif") == 0 || strcmp(extension, "aiff") == 0) + { + if (argc >= 3) + { + output_file = argv[2]; + aif2pcm(input_file, output_file, compressed); + } + else + { + output_file = new_file_extension(input_file, "bin"); + aif2pcm(input_file, output_file, compressed); + free(output_file); + } + } + else if (strcmp(extension, "bin") == 0) + { + if (argc >= 3) + { + output_file = argv[2]; + pcm2aif(input_file, output_file, 60); + } + else + { + output_file = new_file_extension(input_file, "aif"); + pcm2aif(input_file, output_file, 60); + free(output_file); + } + } + else + { + FATAL_ERROR("Input file must be .aif or .bin: '%s'\n", input_file); + } + + return 0; +} diff --git a/tools/bin2c/.gitignore b/tools/bin2c/.gitignore new file mode 100644 index 0000000..366f3d3 --- /dev/null +++ b/tools/bin2c/.gitignore @@ -0,0 +1 @@ +bin2c diff --git a/tools/bin2c/LICENSE b/tools/bin2c/LICENSE new file mode 100644 index 0000000..534d153 --- /dev/null +++ b/tools/bin2c/LICENSE @@ -0,0 +1,19 @@ +Copyright (c) 2016 YamaArashi + +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. diff --git a/tools/bin2c/Makefile b/tools/bin2c/Makefile new file mode 100644 index 0000000..73f7898 --- /dev/null +++ b/tools/bin2c/Makefile @@ -0,0 +1,13 @@ +CC = gcc + +CFLAGS = -Wall -Wextra -Werror -std=c11 -O2 + +.PHONY: clean + +SRCS = bin2c.c + +bin2c: $(SRCS) + $(CC) $(CFLAGS) $(SRCS) -o $@ $(LDFLAGS) + +clean: + $(RM) bin2c bin2c.exe diff --git a/tools/bin2c/bin2c.c b/tools/bin2c/bin2c.c new file mode 100644 index 0000000..b4bd437 --- /dev/null +++ b/tools/bin2c/bin2c.c @@ -0,0 +1,201 @@ +// Copyright(c) 2015-2016 YamaArashi +// +// 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. + +#include +#include +#include +#include + +#ifdef _MSC_VER + +#define FATAL_ERROR(format, ...) \ +do \ +{ \ + fprintf(stderr, format, __VA_ARGS__); \ + exit(1); \ +} while (0) + +#else + +#define FATAL_ERROR(format, ...) \ +do \ +{ \ + fprintf(stderr, format, ##__VA_ARGS__); \ + exit(1); \ +} while (0) + +#endif // _MSC_VER + +unsigned char *ReadWholeFile(char *path, int *size) +{ + FILE *fp = fopen(path, "rb"); + + if (fp == NULL) + FATAL_ERROR("Failed to open \"%s\" for reading.\n", path); + + fseek(fp, 0, SEEK_END); + + *size = ftell(fp); + + unsigned char *buffer = malloc(*size); + + if (buffer == NULL) + FATAL_ERROR("Failed to allocate memory for reading \"%s\".\n", path); + + rewind(fp); + + if (fread(buffer, *size, 1, fp) != 1) + FATAL_ERROR("Failed to read \"%s\".\n", path); + + fclose(fp); + + return buffer; +} + +int ExtractData(unsigned char *buffer, int offset, int size) +{ + switch (size) + { + case 1: + return buffer[offset]; + case 2: + return (buffer[offset + 1] << 8) + | buffer[offset]; + case 4: + return (buffer[offset + 3] << 24) + | (buffer[offset + 2] << 16) + | (buffer[offset + 1] << 8) + | buffer[offset]; + default: + FATAL_ERROR("Invalid size passed to ExtractData.\n"); + } +} + +int main(int argc, char **argv) +{ + if (argc < 3) + FATAL_ERROR("Usage: bin2c INPUT_FILE VAR_NAME [OPTIONS...]\n"); + + int fileSize; + unsigned char *buffer = ReadWholeFile(argv[1], &fileSize); + char *var_name = argv[2]; + int col = 1; + int pad = 0; + int size = 1; + bool isSigned = false; + bool isStatic = false; + bool isDecimal = false; + + for (int i = 3; i < argc; i++) + { + if (!strcmp(argv[i], "-col")) + { + i++; + + if (i >= argc) + FATAL_ERROR("Missing argument after '-col'.\n"); + + col = atoi(argv[i]); + } + else if (!strcmp(argv[i], "-pad")) + { + i++; + + if (i >= argc) + FATAL_ERROR("Missing argument after '-pad'.\n"); + + pad = atoi(argv[i]); + } + else if (!strcmp(argv[i], "-size")) + { + i++; + + if (i >= argc) + FATAL_ERROR("Missing argument after '-size'.\n"); + + size = atoi(argv[i]); + + if (size != 1 && size != 2 && size != 4) + FATAL_ERROR("Size must be 1, 2, or 4.\n"); + } + else if (!strcmp(argv[i], "-signed")) + { + isSigned = true; + isDecimal = true; + } + else if (!strcmp(argv[i], "-static")) + { + isStatic = true; + } + else if (!strcmp(argv[i], "-decimal")) + { + isDecimal = true; + } + else + { + FATAL_ERROR("Unrecognized option '%s'.\n", argv[i]); + } + } + + if ((fileSize & (size - 1)) != 0) + FATAL_ERROR("Size %d doesn't evenly divide file size %d.\n", size, fileSize); + + printf("// Generated file. Do not edit.\n\n"); + + if (isStatic) + printf("static "); + + printf("const "); + + if (isSigned) + printf("s%d ", 8 * size); + else + printf("u%d ", 8 * size); + + printf("%s[] =\n{", var_name); + + int count = fileSize / size; + int offset = 0; + + for (int i = 0; i < count; i++) + { + if (i % col == 0) + printf("\n "); + + int data = ExtractData(buffer, offset, size); + offset += size; + + if (isDecimal) + { + if (isSigned) + printf("%*d, ", pad, data); + else + printf("%*uu, ", pad, data); + } + else + { + printf("%#*xu, ", pad, data); + } + } + + printf("\n};\n"); + + return 0; +} diff --git a/tools/gbafix/.gitignore b/tools/gbafix/.gitignore new file mode 100644 index 0000000..3cebf8a --- /dev/null +++ b/tools/gbafix/.gitignore @@ -0,0 +1,2 @@ +gbafix +README diff --git a/tools/gbafix/COPYING b/tools/gbafix/COPYING new file mode 100644 index 0000000..94a9ed0 --- /dev/null +++ b/tools/gbafix/COPYING @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Use with the GNU Affero General Public License. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . + +Also add information on how to contact you by electronic and paper mail. + + If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + Copyright (C) + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, your program's commands +might be different; for a GUI interface, you would use an "about box". + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +. + + The GNU General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, you +may consider it more useful to permit linking proprietary applications with +the library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. But first, please read +. diff --git a/tools/gbafix/Makefile b/tools/gbafix/Makefile new file mode 100644 index 0000000..f12c8cc --- /dev/null +++ b/tools/gbafix/Makefile @@ -0,0 +1,10 @@ +CC = gcc +.PHONY: clean + +SRCS = gbafix.c + +gbafix: $(SRCS) + $(CC) $(SRCS) -o $@ $(LDFLAGS) + +clean: + $(RM) gbafix gbafix.exe diff --git a/tools/gbafix/gbafix.c b/tools/gbafix/gbafix.c new file mode 100644 index 0000000..fc1621a --- /dev/null +++ b/tools/gbafix/gbafix.c @@ -0,0 +1,325 @@ +/* + "$Id: gbafix.c,v 1.2 2008-07-30 17:12:51 wntrmute Exp $" + + DevkitPro GBA ROM fix utility + + This library is free software; you can redistribute it and/or + modify it under the terms of the GNU Library General Public + License as published by the Free Software Foundation; either + version 2 of the License, or (at your option) any later version. + + This library is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + Library General Public License for more details. + + You should have received a copy of the GNU Library General Public + License along with this library; if not, write to the Free Software + Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 + USA. + + Please report all bugs and problems through the bug tracker at + "http://sourceforge.net/tracker/?group_id=114505&atid=668551". + + "$Header: /lvm/shared/ds/ds/cvs/devkitpro-cvsbackup/tools/gba/gbatools/gbafix.c,v 1.2 2008-07-30 17:12:51 wntrmute Exp $" + +*/ +//--------------------------------------------------------------------------------- +// gbafix.c +//--------------------------------------------------------------------------------- +/* + Gameboy Advance ROM fixer (by Dark Fader / BlackThunder / WinterMute / Diegoisawesome) + Validates header of GBA roms. + + History + ------- + v1.07 - added support for ELF input, (PikalaxALT) + v1.06 - added output silencing, (Diegoisawesome) + v1.05 - added debug offset argument, (Diegoisawesome) + v1.04 - converted to plain C, (WinterMute) + v1.03 - header.fixed, header.device_type + v1.02 - redefined the options (rgbfix style), checksum=0 + v1.01 - fix in parameters + v1.00 - logo, complement +*/ + +#pragma pack(1) + +#include +#include +#include +#include +#include "elf.h" + +#define VER "1.07" +#define ARGV argv[arg] +#define VALUE (ARGV+2) +#define NUMBER strtoul(VALUE, NULL, 0) + +typedef struct +{ + uint32_t start_code; // B instruction + uint8_t logo[0xA0-0x04]; // logo data + uint8_t title[0xC]; // game title name + uint32_t game_code; // + uint16_t maker_code; // b0 + uint8_t fixed; // 0x96 b2 + uint8_t unit_code; // 0x00 b3 + uint8_t device_type; // 0x00 b4 + uint8_t unused[7]; // + uint8_t game_version; // 0x00 bc + uint8_t complement; // 800000A0..800000BC bd + uint16_t checksum; // 0x0000 be +} Header; + + +Header header; + +unsigned short checksum_without_header = 0; + +const Header good_header = +{ + // start_code + 0xEA00002E, + // logo + { 0x24,0xFF,0xAE,0x51,0x69,0x9A,0xA2,0x21,0x3D,0x84,0x82,0x0A,0x84,0xE4,0x09,0xAD, + 0x11,0x24,0x8B,0x98,0xC0,0x81,0x7F,0x21,0xA3,0x52,0xBE,0x19,0x93,0x09,0xCE,0x20, + 0x10,0x46,0x4A,0x4A,0xF8,0x27,0x31,0xEC,0x58,0xC7,0xE8,0x33,0x82,0xE3,0xCE,0xBF, + 0x85,0xF4,0xDF,0x94,0xCE,0x4B,0x09,0xC1,0x94,0x56,0x8A,0xC0,0x13,0x72,0xA7,0xFC, + 0x9F,0x84,0x4D,0x73,0xA3,0xCA,0x9A,0x61,0x58,0x97,0xA3,0x27,0xFC,0x03,0x98,0x76, + 0x23,0x1D,0xC7,0x61,0x03,0x04,0xAE,0x56,0xBF,0x38,0x84,0x00,0x40,0xA7,0x0E,0xFD, + 0xFF,0x52,0xFE,0x03,0x6F,0x95,0x30,0xF1,0x97,0xFB,0xC0,0x85,0x60,0xD6,0x80,0x25, + 0xA9,0x63,0xBE,0x03,0x01,0x4E,0x38,0xE2,0xF9,0xA2,0x34,0xFF,0xBB,0x3E,0x03,0x44, + 0x78,0x00,0x90,0xCB,0x88,0x11,0x3A,0x94,0x65,0xC0,0x7C,0x63,0x87,0xF0,0x3C,0xAF, + 0xD6,0x25,0xE4,0x8B,0x38,0x0A,0xAC,0x72,0x21,0xD4,0xF8,0x07 } , + // title + { 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00 }, + // game code + 0x00000000, + // maker code + 0x3130, + // fixed + 0x96, + // unit_code + 0x00, + // device type + 0x00, + // unused + { 0x00,0x00,0x00,0x00,0x00,0x00,0x00 }, + // game version + 0x00, + // complement + 0x00, + // checksum + 0x0000 +}; + +//--------------------------------------------------------------------------------- +char HeaderComplement() +/*--------------------------------------------------------------------------------- + Calculate Header complement check +---------------------------------------------------------------------------------*/ +{ + int n; + char c = 0; + char *p = (char *)&header + 0xA0; + for (n=0; n<0xBD-0xA0; n++) + { + c += *p++; + } + return -(0x19+c); +} + + +//--------------------------------------------------------------------------------- +int main(int argc, char *argv[]) +//--------------------------------------------------------------------------------- +{ + int arg; + char *argfile = 0; + FILE *infile; + int silent = 0; + int schedule_pad = 0; + + int size,bit; + int noLogo = 0; + + // show syntax + if (argc <= 1) + { + printf("GBA ROM fixer v"VER" by Dark Fader / BlackThunder / WinterMute / Diegoisawesome \n"); + printf("Syntax: gbafix [-p] [-t[title]] [-c] [-m] [-r] [-d] [--silent]\n"); + printf("\n"); + printf("parameters:\n"); + printf(" -p Pad to next exact power of 2. No minimum size!\n"); + printf(" -t[] Patch title. Stripped filename if none given.\n"); + printf(" -c<game_code> Patch game code (four characters)\n"); + printf(" -m<maker_code> Patch maker code (two characters)\n"); + printf(" -r<version> Patch game version (number)\n"); + printf(" -d<debug> Enable debugging handler and set debug entry point (0 or 1)\n"); + printf(" -L Don't fix logo\n"); + printf(" --silent Silence non-error output\n"); + return -1; + } + + // get filename + for (arg=1; arg<argc; arg++) + { + if (ARGV[0] != '-') { argfile=ARGV; } + if (strncmp("--silent", &ARGV[0], 7) == 0) { silent = 1; } + } + + // check filename + if (!argfile) + { + fprintf(stderr, "Filename needed!\n"); + return -1; + } + + uint32_t sh_offset = 0; + + // read file + infile = fopen(argfile, "r+b"); + if (!infile) { fprintf(stderr, "Error opening input file!\n"); return -1; } + fseek(infile, sh_offset, SEEK_SET); + fread(&header, sizeof(header), 1, infile); + + // elf check + Elf32_Shdr secHeader; + if (memcmp(&header, ELFMAG, 4) == 0) { + Elf32_Ehdr *elfHeader = (Elf32_Ehdr *)&header; + fseek(infile, elfHeader->e_shoff, SEEK_SET); + int i; + for (i = 0; i < elfHeader->e_shnum; i++) { + fread(&secHeader, sizeof(Elf32_Shdr), 1, infile); + if (secHeader.sh_type == SHT_PROGBITS && secHeader.sh_addr == elfHeader->e_entry) break; + } + if (i == elfHeader->e_shnum) { fprintf(stderr, "Error finding entry point!\n"); return 1; } + fseek(infile, secHeader.sh_offset, SEEK_SET); + sh_offset = secHeader.sh_offset; + fread(&header, sizeof(header), 1, infile); + } + + // fix some data + memcpy(&header.fixed, &good_header.fixed, sizeof(header.fixed)); + memcpy(&header.device_type, &good_header.device_type, sizeof(header.device_type)); + + // parse command line + for (arg=1; arg<argc; arg++) + { + if ((ARGV[0] == '-')) + { + switch (ARGV[1]) + { + case 'L': + noLogo = 1; + break; + case 'p': // pad + { + schedule_pad = 1; + break; + } + + case 't': // title + { + char title[256]; + memset(title, 0, sizeof(title)); + if (VALUE[0]) + { + strncpy(title, VALUE, sizeof(header.title)); + } + else + { + // use filename + char s[256], *begin=s, *t; strcpy(s, argfile); + t = strrchr(s, '\\'); if (t) begin = t+1; + t = strrchr(s, '/'); if (t) begin = t+1; + t = strrchr(s, '.'); if (t) *t = 0; + strncpy(title, begin, sizeof(header.title)); + if (!silent) printf("%s\n",begin); + } + memcpy(header.title, title, sizeof(header.title)); // copy + break; + } + + case 'c': // game code + { + //if (!VALUE[0]) { fprintf(stderr, "Need value for %s\n", ARGV); break; } + //header.game_code = NUMBER; + header.game_code = VALUE[0] | VALUE[1]<<8 | VALUE[2]<<16 | VALUE[3]<<24; + break; + } + + case 'm': // maker code + { + //if (!VALUE[0]) { fprintf(stderr, "Need value for %s\n", ARGV); break; } + //header.maker_code = (unsigned short)NUMBER; + header.maker_code = VALUE[0] | VALUE[1]<<8; + break; + } + + case 'v': // ignored, compatability with other gbafix + { + break; + } + + case 'r': // version + { + if (!VALUE[0]) { fprintf(stderr, "Need value for %s\n", ARGV); break; } + header.game_version = (unsigned char)NUMBER; + break; + } + + case 'd': // debug + { + if (!VALUE[0]) { fprintf(stderr, "Need value for %s\n", ARGV); break; } + header.logo[0x9C-0x04] = 0xA5; // debug enable + header.device_type = (unsigned char)((NUMBER & 1) << 7); // debug handler entry point + break; + } + case '-': // long arguments + { + if (strncmp("silent", &ARGV[2], 6) == 0) { continue; } + break; + } + default: + { + printf("Invalid option: %s\n", ARGV); + } + } + } + } + + // fix some data + if (!noLogo) + memcpy(header.logo, good_header.logo, sizeof(header.logo)); + + // update complement check & total checksum + header.complement = 0; + header.checksum = 0; // must be 0 + header.complement = HeaderComplement(); + //header.checksum = checksum_without_header + HeaderChecksum(); + + if (schedule_pad) { + if (sh_offset != 0) { + fprintf(stderr, "Warning: Cannot safely pad an ELF\n"); + } else { + fseek(infile, 0, SEEK_END); + size = ftell(infile); + for (bit=31; bit>=0; bit--) if (size & (1<<bit)) break; + if (size != (1<<bit)) + { + int todo = (1<<(bit+1)) - size; + while (todo--) fputc(0xFF, infile); + } + } + } + + fseek(infile, sh_offset, SEEK_SET); + fwrite(&header, sizeof(header), 1, infile); + fclose(infile); + + if (!silent) printf("ROM fixed!\n"); + + return 0; +} diff --git a/tools/gbagfx/.gitignore b/tools/gbagfx/.gitignore new file mode 100644 index 0000000..dbbb3f0 --- /dev/null +++ b/tools/gbagfx/.gitignore @@ -0,0 +1 @@ +gbagfx diff --git a/tools/gbagfx/LICENSE b/tools/gbagfx/LICENSE new file mode 100644 index 0000000..b66bf81 --- /dev/null +++ b/tools/gbagfx/LICENSE @@ -0,0 +1,19 @@ +Copyright (c) 2015 YamaArashi + +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. diff --git a/tools/gbagfx/Makefile b/tools/gbagfx/Makefile new file mode 100644 index 0000000..f063841 --- /dev/null +++ b/tools/gbagfx/Makefile @@ -0,0 +1,21 @@ +CC = gcc + +CFLAGS = -Wall -Wextra -Werror -Wno-sign-compare -std=c11 -O2 -DPNG_SKIP_SETJMP_CHECK + +LIBS = -lpng -lz + +SRCS = main.c convert_png.c gfx.c jasc_pal.c lz.c rl.c util.c font.c huff.c + +.PHONY: all clean + +all: gbagfx + @: + +gbagfx-debug: $(SRCS) convert_png.h gfx.h global.h jasc_pal.h lz.h rl.h util.h font.h + $(CC) $(CFLAGS) -DDEBUG $(SRCS) -o $@ $(LDFLAGS) $(LIBS) + +gbagfx: $(SRCS) convert_png.h gfx.h global.h jasc_pal.h lz.h rl.h util.h font.h + $(CC) $(CFLAGS) $(SRCS) -o $@ $(LDFLAGS) $(LIBS) + +clean: + $(RM) gbagfx gbagfx.exe diff --git a/tools/gbagfx/convert_png.c b/tools/gbagfx/convert_png.c new file mode 100644 index 0000000..cdfa39a --- /dev/null +++ b/tools/gbagfx/convert_png.c @@ -0,0 +1,254 @@ +// Copyright (c) 2015 YamaArashi + +#include <stdio.h> +#include <setjmp.h> +#include <png.h> +#include "global.h" +#include "convert_png.h" +#include "gfx.h" + +static FILE *PngReadOpen(char *path, png_structp *pngStruct, png_infop *pngInfo) +{ + FILE *fp = fopen(path, "rb"); + + if (fp == NULL) + FATAL_ERROR("Failed to open \"%s\" for reading.\n", path); + + unsigned char sig[8]; + + if (fread(sig, 8, 1, fp) != 1) + FATAL_ERROR("Failed to read PNG signature from \"%s\".\n", path); + + if (png_sig_cmp(sig, 0, 8)) + FATAL_ERROR("\"%s\" does not have a valid PNG signature.\n", path); + + png_structp png_ptr = png_create_read_struct(PNG_LIBPNG_VER_STRING, NULL, NULL, NULL); + + if (!png_ptr) + FATAL_ERROR("Failed to create PNG read struct.\n"); + + png_infop info_ptr = png_create_info_struct(png_ptr); + + if (!info_ptr) + FATAL_ERROR("Failed to create PNG info struct.\n"); + + if (setjmp(png_jmpbuf(png_ptr))) + FATAL_ERROR("Failed to init I/O for reading \"%s\".\n", path); + + png_init_io(png_ptr, fp); + png_set_sig_bytes(png_ptr, 8); + png_read_info(png_ptr, info_ptr); + + *pngStruct = png_ptr; + *pngInfo = info_ptr; + + return fp; +} + +static unsigned char *ConvertBitDepth(unsigned char *src, int srcBitDepth, int destBitDepth, int numPixels) +{ + // Round the number of bits up to the next 8 and divide by 8 to get the number of bytes. + int srcSize = ((numPixels * srcBitDepth + 7) & ~7) / 8; + int destSize = ((numPixels * destBitDepth + 7) & ~7) / 8; + unsigned char *output = calloc(destSize, 1); + unsigned char *dest = output; + int i; + int j; + int destBit = 8 - destBitDepth; + + for (i = 0; i < srcSize; i++) + { + unsigned char srcByte = src[i]; + + for (j = 8 - srcBitDepth; j >= 0; j -= srcBitDepth) + { + unsigned char pixel = (srcByte >> j) % (1 << srcBitDepth); + + if (pixel >= (1 << destBitDepth)) + FATAL_ERROR("Image exceeds the maximum color value for a %ibpp image.\n", destBitDepth); + *dest |= pixel << destBit; + destBit -= destBitDepth; + if (destBit < 0) + { + dest++; + destBit = 8 - destBitDepth; + } + } + } + + return output; +} + +void ReadPng(char *path, struct Image *image) +{ + png_structp png_ptr; + png_infop info_ptr; + + FILE *fp = PngReadOpen(path, &png_ptr, &info_ptr); + + int bit_depth = png_get_bit_depth(png_ptr, info_ptr); + + int color_type = png_get_color_type(png_ptr, info_ptr); + + if (color_type != PNG_COLOR_TYPE_GRAY && color_type != PNG_COLOR_TYPE_PALETTE) + FATAL_ERROR("\"%s\" has an unsupported color type.\n", path); + + // Check if the image has a palette so that we can tell if the colors need to be inverted later. + // Don't read the palette because it's not needed for now. + image->hasPalette = (color_type == PNG_COLOR_TYPE_PALETTE); + + image->width = png_get_image_width(png_ptr, info_ptr); + image->height = png_get_image_height(png_ptr, info_ptr); + + int rowbytes = png_get_rowbytes(png_ptr, info_ptr); + + image->pixels = malloc(image->height * rowbytes); + + if (image->pixels == NULL) + FATAL_ERROR("Failed to allocate pixel buffer.\n"); + + png_bytepp row_pointers = malloc(image->height * sizeof(png_bytep)); + + if (row_pointers == NULL) + FATAL_ERROR("Failed to allocate row pointers.\n"); + + for (int i = 0; i < image->height; i++) + row_pointers[i] = (png_bytep)(image->pixels + (i * rowbytes)); + + if (setjmp(png_jmpbuf(png_ptr))) + FATAL_ERROR("Error reading from \"%s\".\n", path); + + png_read_image(png_ptr, row_pointers); + + png_destroy_read_struct(&png_ptr, &info_ptr, NULL); + + free(row_pointers); + fclose(fp); + + if (bit_depth != image->bitDepth) + { + unsigned char *src = image->pixels; + + if (bit_depth != 1 && bit_depth != 2 && bit_depth != 4 && bit_depth != 8) + FATAL_ERROR("Bit depth of image must be 1, 2, 4, or 8.\n"); + image->pixels = ConvertBitDepth(image->pixels, bit_depth, image->bitDepth, image->width * image->height); + free(src); + image->bitDepth = bit_depth; + } +} + +void ReadPngPalette(char *path, struct Palette *palette) +{ + png_structp png_ptr; + png_infop info_ptr; + png_colorp colors; + int numColors; + + FILE *fp = PngReadOpen(path, &png_ptr, &info_ptr); + + if (png_get_color_type(png_ptr, info_ptr) != PNG_COLOR_TYPE_PALETTE) + FATAL_ERROR("The image \"%s\" does not contain a palette.\n", path); + + if (png_get_PLTE(png_ptr, info_ptr, &colors, &numColors) != PNG_INFO_PLTE) + FATAL_ERROR("Failed to retrieve palette from \"%s\".\n", path); + + if (numColors > 256) + FATAL_ERROR("Images with more than 256 colors are not supported.\n"); + + palette->numColors = numColors; + for (int i = 0; i < numColors; i++) { + palette->colors[i].red = colors[i].red; + palette->colors[i].green = colors[i].green; + palette->colors[i].blue = colors[i].blue; + } + + png_destroy_read_struct(&png_ptr, &info_ptr, NULL); + + fclose(fp); +} + +void SetPngPalette(png_structp png_ptr, png_infop info_ptr, struct Palette *palette) +{ + png_colorp colors = malloc(palette->numColors * sizeof(png_color)); + + if (colors == NULL) + FATAL_ERROR("Failed to allocate PNG palette.\n"); + + for (int i = 0; i < palette->numColors; i++) { + colors[i].red = palette->colors[i].red; + colors[i].green = palette->colors[i].green; + colors[i].blue = palette->colors[i].blue; + } + + png_set_PLTE(png_ptr, info_ptr, colors, palette->numColors); + + free(colors); +} + +void WritePng(char *path, struct Image *image) +{ + FILE *fp = fopen(path, "wb"); + + if (fp == NULL) + FATAL_ERROR("Failed to open \"%s\" for writing.\n", path); + + png_structp png_ptr = png_create_write_struct(PNG_LIBPNG_VER_STRING, NULL, NULL, NULL); + + if (!png_ptr) + FATAL_ERROR("Failed to create PNG write struct.\n"); + + png_infop info_ptr = png_create_info_struct(png_ptr); + + if (!info_ptr) + FATAL_ERROR("Failed to create PNG info struct.\n"); + + if (setjmp(png_jmpbuf(png_ptr))) + FATAL_ERROR("Failed to init I/O for writing \"%s\".\n", path); + + png_init_io(png_ptr, fp); + + if (setjmp(png_jmpbuf(png_ptr))) + FATAL_ERROR("Error writing header for \"%s\".\n", path); + + int color_type = image->hasPalette ? PNG_COLOR_TYPE_PALETTE : PNG_COLOR_TYPE_GRAY; + + png_set_IHDR(png_ptr, info_ptr, image->width, image->height, + image->bitDepth, color_type, PNG_INTERLACE_NONE, + PNG_COMPRESSION_TYPE_BASE, PNG_FILTER_TYPE_BASE); + + if (image->hasPalette) { + SetPngPalette(png_ptr, info_ptr, &image->palette); + + if (image->hasTransparency) { + png_byte trans = 0; + png_set_tRNS(png_ptr, info_ptr, &trans, 1, 0); + } + } + + png_write_info(png_ptr, info_ptr); + + png_bytepp row_pointers = malloc(image->height * sizeof(png_bytep)); + + if (row_pointers == NULL) + FATAL_ERROR("Failed to allocate row pointers.\n"); + + int rowbytes = png_get_rowbytes(png_ptr, info_ptr); + + for (int i = 0; i < image->height; i++) + row_pointers[i] = (png_bytep)(image->pixels + (i * rowbytes)); + + if (setjmp(png_jmpbuf(png_ptr))) + FATAL_ERROR("Error writing \"%s\".\n", path); + + png_write_image(png_ptr, row_pointers); + + if (setjmp(png_jmpbuf(png_ptr))) + FATAL_ERROR("Error ending write of \"%s\".\n", path); + + png_write_end(png_ptr, NULL); + + fclose(fp); + + png_destroy_write_struct(&png_ptr, &info_ptr); + free(row_pointers); +} diff --git a/tools/gbagfx/convert_png.h b/tools/gbagfx/convert_png.h new file mode 100644 index 0000000..caf081b --- /dev/null +++ b/tools/gbagfx/convert_png.h @@ -0,0 +1,12 @@ +// Copyright (c) 2015 YamaArashi + +#ifndef CONVERT_PNG_H +#define CONVERT_PNG_H + +#include "gfx.h" + +void ReadPng(char *path, struct Image *image); +void WritePng(char *path, struct Image *image); +void ReadPngPalette(char *path, struct Palette *palette); + +#endif // CONVERT_PNG_H diff --git a/tools/gbagfx/font.c b/tools/gbagfx/font.c new file mode 100644 index 0000000..0dd6fbc --- /dev/null +++ b/tools/gbagfx/font.c @@ -0,0 +1,326 @@ +// Copyright (c) 2015 YamaArashi + +#include <stdio.h> +#include <stdlib.h> +#include <stdint.h> +#include <stdbool.h> +#include "global.h" +#include "font.h" +#include "gfx.h" +#include "util.h" + +unsigned char gFontPalette[][3] = { + {0x90, 0xC8, 0xFF}, // bg (saturated blue that contrasts well with the shadow color) + {0x38, 0x38, 0x38}, // fg (dark grey) + {0xD8, 0xD8, 0xD8}, // shadow (light grey) + {0xFF, 0xFF, 0xFF} // box (white) +}; + +static void ConvertFromLatinFont(unsigned char *src, unsigned char *dest, unsigned int numRows) +{ + unsigned int srcPixelsOffset = 0; + + for (unsigned int row = 0; row < numRows; row++) { + for (unsigned int column = 0; column < 16; column++) { + for (unsigned int glyphTile = 0; glyphTile < 4; glyphTile++) { + unsigned int pixelsX = (column * 16) + ((glyphTile & 1) * 8); + + for (unsigned int i = 0; i < 8; i++) { + unsigned int pixelsY = (row * 16) + ((glyphTile >> 1) * 8) + i; + unsigned int destPixelsOffset = (pixelsY * 64) + (pixelsX / 4); + + dest[destPixelsOffset] = src[srcPixelsOffset + 1]; + dest[destPixelsOffset + 1] = src[srcPixelsOffset]; + + srcPixelsOffset += 2; + } + } + } + } +} + +static void ConvertToLatinFont(unsigned char *src, unsigned char *dest, unsigned int numRows) +{ + unsigned int destPixelsOffset = 0; + + for (unsigned int row = 0; row < numRows; row++) { + for (unsigned int column = 0; column < 16; column++) { + for (unsigned int glyphTile = 0; glyphTile < 4; glyphTile++) { + unsigned int pixelsX = (column * 16) + ((glyphTile & 1) * 8); + + for (unsigned int i = 0; i < 8; i++) { + unsigned int pixelsY = (row * 16) + ((glyphTile >> 1) * 8) + i; + unsigned int srcPixelsOffset = (pixelsY * 64) + (pixelsX / 4); + + dest[destPixelsOffset] = src[srcPixelsOffset + 1]; + dest[destPixelsOffset + 1] = src[srcPixelsOffset]; + + destPixelsOffset += 2; + } + } + } + } +} + +static void ConvertFromHalfwidthJapaneseFont(unsigned char *src, unsigned char *dest, unsigned int numRows) +{ + for (unsigned int row = 0; row < numRows; row++) { + for (unsigned int column = 0; column < 16; column++) { + unsigned int glyphIndex = (row * 16) + column; + + for (unsigned int glyphTile = 0; glyphTile < 2; glyphTile++) { + unsigned int pixelsX = column * 8; + unsigned int srcPixelsOffset = 512 * (glyphIndex >> 4) + 16 * (glyphIndex & 0xF) + 256 * glyphTile; + + for (unsigned int i = 0; i < 8; i++) { + unsigned int pixelsY = (row * 16) + (glyphTile * 8) + i; + unsigned int destPixelsOffset = (pixelsY * 32) + (pixelsX / 4); + + dest[destPixelsOffset] = src[srcPixelsOffset + 1]; + dest[destPixelsOffset + 1] = src[srcPixelsOffset]; + + srcPixelsOffset += 2; + } + } + } + } +} + +static void ConvertToHalfwidthJapaneseFont(unsigned char *src, unsigned char *dest, unsigned int numRows) +{ + for (unsigned int row = 0; row < numRows; row++) { + for (unsigned int column = 0; column < 16; column++) { + unsigned int glyphIndex = (row * 16) + column; + + for (unsigned int glyphTile = 0; glyphTile < 2; glyphTile++) { + unsigned int pixelsX = column * 8; + unsigned int destPixelsOffset = 512 * (glyphIndex >> 4) + 16 * (glyphIndex & 0xF) + 256 * glyphTile; + + for (unsigned int i = 0; i < 8; i++) { + unsigned int pixelsY = (row * 16) + (glyphTile * 8) + i; + unsigned int srcPixelsOffset = (pixelsY * 32) + (pixelsX / 4); + + dest[destPixelsOffset] = src[srcPixelsOffset + 1]; + dest[destPixelsOffset + 1] = src[srcPixelsOffset]; + + destPixelsOffset += 2; + } + } + } + } +} + +static void ConvertFromFullwidthJapaneseFont(unsigned char *src, unsigned char *dest, unsigned int numRows) +{ + for (unsigned int row = 0; row < numRows; row++) { + for (unsigned int column = 0; column < 16; column++) { + unsigned int glyphIndex = (row * 16) + column; + + for (unsigned int glyphTile = 0; glyphTile < 4; glyphTile++) { + unsigned int pixelsX = (column * 16) + ((glyphTile & 1) * 8); + unsigned int srcPixelsOffset = 512 * (glyphIndex >> 3) + 32 * (glyphIndex & 7) + 256 * (glyphTile >> 1) + 16 * (glyphTile & 1); + + for (unsigned int i = 0; i < 8; i++) { + unsigned int pixelsY = (row * 16) + ((glyphTile >> 1) * 8) + i; + unsigned int destPixelsOffset = (pixelsY * 64) + (pixelsX / 4); + + dest[destPixelsOffset] = src[srcPixelsOffset + 1]; + dest[destPixelsOffset + 1] = src[srcPixelsOffset]; + + srcPixelsOffset += 2; + } + } + } + } +} + +static void ConvertToFullwidthJapaneseFont(unsigned char *src, unsigned char *dest, unsigned int numRows) +{ + for (unsigned int row = 0; row < numRows; row++) { + for (unsigned int column = 0; column < 16; column++) { + unsigned int glyphIndex = (row * 16) + column; + + for (unsigned int glyphTile = 0; glyphTile < 4; glyphTile++) { + unsigned int pixelsX = (column * 16) + ((glyphTile & 1) * 8); + unsigned int destPixelsOffset = 512 * (glyphIndex >> 3) + 32 * (glyphIndex & 7) + 256 * (glyphTile >> 1) + 16 * (glyphTile & 1); + + for (unsigned int i = 0; i < 8; i++) { + unsigned int pixelsY = (row * 16) + ((glyphTile >> 1) * 8) + i; + unsigned int srcPixelsOffset = (pixelsY * 64) + (pixelsX / 4); + + dest[destPixelsOffset] = src[srcPixelsOffset + 1]; + dest[destPixelsOffset + 1] = src[srcPixelsOffset]; + + destPixelsOffset += 2; + } + } + } + } +} + +static void SetFontPalette(struct Image *image) +{ + image->hasPalette = true; + + image->palette.numColors = 4; + + for (int i = 0; i < image->palette.numColors; i++) { + image->palette.colors[i].red = gFontPalette[i][0]; + image->palette.colors[i].green = gFontPalette[i][1]; + image->palette.colors[i].blue = gFontPalette[i][2]; + } + + image->hasTransparency = false; +} + +void ReadLatinFont(char *path, struct Image *image) +{ + int fileSize; + unsigned char *buffer = ReadWholeFile(path, &fileSize); + + int numGlyphs = fileSize / 64; + + if (numGlyphs % 16 != 0) + FATAL_ERROR("The number of glyphs (%d) is not a multiple of 16.\n", numGlyphs); + + int numRows = numGlyphs / 16; + + image->width = 256; + image->height = numRows * 16; + image->bitDepth = 2; + image->pixels = malloc(fileSize); + + if (image->pixels == NULL) + FATAL_ERROR("Failed to allocate memory for font.\n"); + + ConvertFromLatinFont(buffer, image->pixels, numRows); + + free(buffer); + + SetFontPalette(image); +} + +void WriteLatinFont(char *path, struct Image *image) +{ + if (image->width != 256) + FATAL_ERROR("The width of the font image (%d) is not 256.\n", image->width); + + if (image->height % 16 != 0) + FATAL_ERROR("The height of the font image (%d) is not a multiple of 16.\n", image->height); + + int numRows = image->height / 16; + int bufferSize = numRows * 16 * 64; + unsigned char *buffer = malloc(bufferSize); + + if (buffer == NULL) + FATAL_ERROR("Failed to allocate memory for font.\n"); + + ConvertToLatinFont(image->pixels, buffer, numRows); + + WriteWholeFile(path, buffer, bufferSize); + + free(buffer); +} + +void ReadHalfwidthJapaneseFont(char *path, struct Image *image) +{ + int fileSize; + unsigned char *buffer = ReadWholeFile(path, &fileSize); + + int glyphSize = 32; + + if (fileSize % glyphSize != 0) + FATAL_ERROR("The file size (%d) is not a multiple of %d.\n", fileSize, glyphSize); + + int numGlyphs = fileSize / glyphSize; + + if (numGlyphs % 16 != 0) + FATAL_ERROR("The number of glyphs (%d) is not a multiple of 16.\n", numGlyphs); + + int numRows = numGlyphs / 16; + + image->width = 128; + image->height = numRows * 16; + image->bitDepth = 2; + image->pixels = malloc(fileSize); + + if (image->pixels == NULL) + FATAL_ERROR("Failed to allocate memory for font.\n"); + + ConvertFromHalfwidthJapaneseFont(buffer, image->pixels, numRows); + + free(buffer); + + SetFontPalette(image); +} + +void WriteHalfwidthJapaneseFont(char *path, struct Image *image) +{ + if (image->width != 128) + FATAL_ERROR("The width of the font image (%d) is not 128.\n", image->width); + + if (image->height % 16 != 0) + FATAL_ERROR("The height of the font image (%d) is not a multiple of 16.\n", image->height); + + int numRows = image->height / 16; + int bufferSize = numRows * 16 * 32; + unsigned char *buffer = malloc(bufferSize); + + if (buffer == NULL) + FATAL_ERROR("Failed to allocate memory for font.\n"); + + ConvertToHalfwidthJapaneseFont(image->pixels, buffer, numRows); + + WriteWholeFile(path, buffer, bufferSize); + + free(buffer); +} + +void ReadFullwidthJapaneseFont(char *path, struct Image *image) +{ + int fileSize; + unsigned char *buffer = ReadWholeFile(path, &fileSize); + + int numGlyphs = fileSize / 64; + + if (numGlyphs % 16 != 0) + FATAL_ERROR("The number of glyphs (%d) is not a multiple of 16.\n", numGlyphs); + + int numRows = numGlyphs / 16; + + image->width = 256; + image->height = numRows * 16; + image->bitDepth = 2; + image->pixels = malloc(fileSize); + + if (image->pixels == NULL) + FATAL_ERROR("Failed to allocate memory for font.\n"); + + ConvertFromFullwidthJapaneseFont(buffer, image->pixels, numRows); + + free(buffer); + + SetFontPalette(image); +} + +void WriteFullwidthJapaneseFont(char *path, struct Image *image) +{ + if (image->width != 256) + FATAL_ERROR("The width of the font image (%d) is not 256.\n", image->width); + + if (image->height % 16 != 0) + FATAL_ERROR("The height of the font image (%d) is not a multiple of 16.\n", image->height); + + int numRows = image->height / 16; + int bufferSize = numRows * 16 * 64; + unsigned char *buffer = malloc(bufferSize); + + if (buffer == NULL) + FATAL_ERROR("Failed to allocate memory for font.\n"); + + ConvertToFullwidthJapaneseFont(image->pixels, buffer, numRows); + + WriteWholeFile(path, buffer, bufferSize); + + free(buffer); +} diff --git a/tools/gbagfx/font.h b/tools/gbagfx/font.h new file mode 100644 index 0000000..45086d0 --- /dev/null +++ b/tools/gbagfx/font.h @@ -0,0 +1,16 @@ +// Copyright (c) 2015 YamaArashi + +#ifndef FONT_H +#define FONT_H + +#include <stdbool.h> +#include "gfx.h" + +void ReadLatinFont(char *path, struct Image *image); +void WriteLatinFont(char *path, struct Image *image); +void ReadHalfwidthJapaneseFont(char *path, struct Image *image); +void WriteHalfwidthJapaneseFont(char *path, struct Image *image); +void ReadFullwidthJapaneseFont(char *path, struct Image *image); +void WriteFullwidthJapaneseFont(char *path, struct Image *image); + +#endif // FONT_H diff --git a/tools/gbagfx/gfx.c b/tools/gbagfx/gfx.c new file mode 100644 index 0000000..f927dee --- /dev/null +++ b/tools/gbagfx/gfx.c @@ -0,0 +1,344 @@ +// Copyright (c) 2015 YamaArashi + +#include <stdio.h> +#include <stdlib.h> +#include <stdint.h> +#include <stdbool.h> +#include "global.h" +#include "gfx.h" +#include "util.h" + +#define GET_GBA_PAL_RED(x) (((x) >> 0) & 0x1F) +#define GET_GBA_PAL_GREEN(x) (((x) >> 5) & 0x1F) +#define GET_GBA_PAL_BLUE(x) (((x) >> 10) & 0x1F) + +#define SET_GBA_PAL(r, g, b) (((b) << 10) | ((g) << 5) | (r)) + +#define UPCONVERT_BIT_DEPTH(x) (((x) * 255) / 31) + +#define DOWNCONVERT_BIT_DEPTH(x) ((x) / 8) + +static void AdvanceMetatilePosition(int *subTileX, int *subTileY, int *metatileX, int *metatileY, int metatilesWide, int metatileWidth, int metatileHeight) +{ + (*subTileX)++; + if (*subTileX == metatileWidth) { + *subTileX = 0; + (*subTileY)++; + if (*subTileY == metatileHeight) { + *subTileY = 0; + (*metatileX)++; + if (*metatileX == metatilesWide) { + *metatileX = 0; + (*metatileY)++; + } + } + } +} + +static void ConvertFromTiles1Bpp(unsigned char *src, unsigned char *dest, int numTiles, int metatilesWide, int metatileWidth, int metatileHeight, bool invertColors) +{ + int subTileX = 0; + int subTileY = 0; + int metatileX = 0; + int metatileY = 0; + int pitch = metatilesWide * metatileWidth; + + for (int i = 0; i < numTiles; i++) { + for (int j = 0; j < 8; j++) { + int destY = (metatileY * metatileHeight + subTileY) * 8 + j; + int destX = metatileX * metatileWidth + subTileX; + unsigned char srcPixelOctet = *src++; + unsigned char *destPixelOctet = &dest[destY * pitch + destX]; + + for (int k = 0; k < 8; k++) { + *destPixelOctet <<= 1; + *destPixelOctet |= (srcPixelOctet & 1) ^ invertColors; + srcPixelOctet >>= 1; + } + } + + AdvanceMetatilePosition(&subTileX, &subTileY, &metatileX, &metatileY, metatilesWide, metatileWidth, metatileHeight); + } +} + +static void ConvertFromTiles4Bpp(unsigned char *src, unsigned char *dest, int numTiles, int metatilesWide, int metatileWidth, int metatileHeight, bool invertColors) +{ + int subTileX = 0; + int subTileY = 0; + int metatileX = 0; + int metatileY = 0; + int pitch = (metatilesWide * metatileWidth) * 4; + + for (int i = 0; i < numTiles; i++) { + for (int j = 0; j < 8; j++) { + int destY = (metatileY * metatileHeight + subTileY) * 8 + j; + + for (int k = 0; k < 4; k++) { + int destX = (metatileX * metatileWidth + subTileX) * 4 + k; + unsigned char srcPixelPair = *src++; + unsigned char leftPixel = srcPixelPair & 0xF; + unsigned char rightPixel = srcPixelPair >> 4; + + if (invertColors) { + leftPixel = 15 - leftPixel; + rightPixel = 15 - rightPixel; + } + + dest[destY * pitch + destX] = (leftPixel << 4) | rightPixel; + } + } + + AdvanceMetatilePosition(&subTileX, &subTileY, &metatileX, &metatileY, metatilesWide, metatileWidth, metatileHeight); + } +} + +static void ConvertFromTiles8Bpp(unsigned char *src, unsigned char *dest, int numTiles, int metatilesWide, int metatileWidth, int metatileHeight, bool invertColors) +{ + int subTileX = 0; + int subTileY = 0; + int metatileX = 0; + int metatileY = 0; + int pitch = (metatilesWide * metatileWidth) * 8; + + for (int i = 0; i < numTiles; i++) { + for (int j = 0; j < 8; j++) { + int destY = (metatileY * metatileHeight + subTileY) * 8 + j; + + for (int k = 0; k < 8; k++) { + int destX = (metatileX * metatileWidth + subTileX) * 8 + k; + unsigned char srcPixel = *src++; + + if (invertColors) + srcPixel = 255 - srcPixel; + + dest[destY * pitch + destX] = srcPixel; + } + } + + AdvanceMetatilePosition(&subTileX, &subTileY, &metatileX, &metatileY, metatilesWide, metatileWidth, metatileHeight); + } +} + +static void ConvertToTiles1Bpp(unsigned char *src, unsigned char *dest, int numTiles, int metatilesWide, int metatileWidth, int metatileHeight, bool invertColors) +{ + int subTileX = 0; + int subTileY = 0; + int metatileX = 0; + int metatileY = 0; + int pitch = metatilesWide * metatileWidth; + + for (int i = 0; i < numTiles; i++) { + for (int j = 0; j < 8; j++) { + int srcY = (metatileY * metatileHeight + subTileY) * 8 + j; + int srcX = metatileX * metatileWidth + subTileX; + unsigned char srcPixelOctet = src[srcY * pitch + srcX]; + unsigned char *destPixelOctet = dest++; + + for (int k = 0; k < 8; k++) { + *destPixelOctet <<= 1; + *destPixelOctet |= (srcPixelOctet & 1) ^ invertColors; + srcPixelOctet >>= 1; + } + } + + AdvanceMetatilePosition(&subTileX, &subTileY, &metatileX, &metatileY, metatilesWide, metatileWidth, metatileHeight); + } +} + +static void ConvertToTiles4Bpp(unsigned char *src, unsigned char *dest, int numTiles, int metatilesWide, int metatileWidth, int metatileHeight, bool invertColors) +{ + int subTileX = 0; + int subTileY = 0; + int metatileX = 0; + int metatileY = 0; + int pitch = (metatilesWide * metatileWidth) * 4; + + for (int i = 0; i < numTiles; i++) { + for (int j = 0; j < 8; j++) { + int srcY = (metatileY * metatileHeight + subTileY) * 8 + j; + + for (int k = 0; k < 4; k++) { + int srcX = (metatileX * metatileWidth + subTileX) * 4 + k; + unsigned char srcPixelPair = src[srcY * pitch + srcX]; + unsigned char leftPixel = srcPixelPair >> 4; + unsigned char rightPixel = srcPixelPair & 0xF; + + if (invertColors) { + leftPixel = 15 - leftPixel; + rightPixel = 15 - rightPixel; + } + + *dest++ = (rightPixel << 4) | leftPixel; + } + } + + AdvanceMetatilePosition(&subTileX, &subTileY, &metatileX, &metatileY, metatilesWide, metatileWidth, metatileHeight); + } +} + +static void ConvertToTiles8Bpp(unsigned char *src, unsigned char *dest, int numTiles, int metatilesWide, int metatileWidth, int metatileHeight, bool invertColors) +{ + int subTileX = 0; + int subTileY = 0; + int metatileX = 0; + int metatileY = 0; + int pitch = (metatilesWide * metatileWidth) * 8; + + for (int i = 0; i < numTiles; i++) { + for (int j = 0; j < 8; j++) { + int srcY = (metatileY * metatileHeight + subTileY) * 8 + j; + + for (int k = 0; k < 8; k++) { + int srcX = (metatileX * metatileWidth + subTileX) * 8 + k; + unsigned char srcPixel = src[srcY * pitch + srcX]; + + if (invertColors) + srcPixel = 255 - srcPixel; + + *dest++ = srcPixel; + } + } + + AdvanceMetatilePosition(&subTileX, &subTileY, &metatileX, &metatileY, metatilesWide, metatileWidth, metatileHeight); + } +} + +void ReadImage(char *path, int tilesWidth, int bitDepth, int metatileWidth, int metatileHeight, struct Image *image, bool invertColors) +{ + int tileSize = bitDepth * 8; + + int fileSize; + unsigned char *buffer = ReadWholeFile(path, &fileSize); + + int numTiles = fileSize / tileSize; + + int tilesHeight = (numTiles + tilesWidth - 1) / tilesWidth; + + if (tilesWidth % metatileWidth != 0) + FATAL_ERROR("The width in tiles (%d) isn't a multiple of the specified metatile width (%d)", tilesWidth, metatileWidth); + + if (tilesHeight % metatileHeight != 0) + FATAL_ERROR("The height in tiles (%d) isn't a multiple of the specified metatile height (%d)", tilesHeight, metatileHeight); + + image->width = tilesWidth * 8; + image->height = tilesHeight * 8; + image->bitDepth = bitDepth; + image->pixels = calloc(tilesWidth * tilesHeight, tileSize); + + if (image->pixels == NULL) + FATAL_ERROR("Failed to allocate memory for pixels.\n"); + + int metatilesWide = tilesWidth / metatileWidth; + + switch (bitDepth) { + case 1: + ConvertFromTiles1Bpp(buffer, image->pixels, numTiles, metatilesWide, metatileWidth, metatileHeight, invertColors); + break; + case 4: + ConvertFromTiles4Bpp(buffer, image->pixels, numTiles, metatilesWide, metatileWidth, metatileHeight, invertColors); + break; + case 8: + ConvertFromTiles8Bpp(buffer, image->pixels, numTiles, metatilesWide, metatileWidth, metatileHeight, invertColors); + break; + } + + free(buffer); +} + +void WriteImage(char *path, int numTiles, int bitDepth, int metatileWidth, int metatileHeight, struct Image *image, bool invertColors) +{ + int tileSize = bitDepth * 8; + + if (image->width % 8 != 0) + FATAL_ERROR("The width in pixels (%d) isn't a multiple of 8.\n", image->width); + + if (image->height % 8 != 0) + FATAL_ERROR("The height in pixels (%d) isn't a multiple of 8.\n", image->height); + + int tilesWidth = image->width / 8; + int tilesHeight = image->height / 8; + + if (tilesWidth % metatileWidth != 0) + FATAL_ERROR("The width in tiles (%d) isn't a multiple of the specified metatile width (%d)", tilesWidth, metatileWidth); + + if (tilesHeight % metatileHeight != 0) + FATAL_ERROR("The height in tiles (%d) isn't a multiple of the specified metatile height (%d)", tilesHeight, metatileHeight); + + int maxNumTiles = tilesWidth * tilesHeight; + + if (numTiles == 0) + numTiles = maxNumTiles; + else if (numTiles > maxNumTiles) + FATAL_ERROR("The specified number of tiles (%d) is greater than the maximum possible value (%d).\n", numTiles, maxNumTiles); + + int bufferSize = numTiles * tileSize; + unsigned char *buffer = malloc(bufferSize); + + if (buffer == NULL) + FATAL_ERROR("Failed to allocate memory for pixels.\n"); + + int metatilesWide = tilesWidth / metatileWidth; + + switch (bitDepth) { + case 1: + ConvertToTiles1Bpp(image->pixels, buffer, numTiles, metatilesWide, metatileWidth, metatileHeight, invertColors); + break; + case 4: + ConvertToTiles4Bpp(image->pixels, buffer, numTiles, metatilesWide, metatileWidth, metatileHeight, invertColors); + break; + case 8: + ConvertToTiles8Bpp(image->pixels, buffer, numTiles, metatilesWide, metatileWidth, metatileHeight, invertColors); + break; + } + + WriteWholeFile(path, buffer, bufferSize); + + free(buffer); +} + +void FreeImage(struct Image *image) +{ + free(image->pixels); + image->pixels = NULL; +} + +void ReadGbaPalette(char *path, struct Palette *palette) +{ + int fileSize; + unsigned char *data = ReadWholeFile(path, &fileSize); + + if (fileSize % 2 != 0) + FATAL_ERROR("The file size (%d) is not a multiple of 2.\n", fileSize); + + palette->numColors = fileSize / 2; + + for (int i = 0; i < palette->numColors; i++) { + uint16_t paletteEntry = (data[i * 2 + 1] << 8) | data[i * 2]; + palette->colors[i].red = UPCONVERT_BIT_DEPTH(GET_GBA_PAL_RED(paletteEntry)); + palette->colors[i].green = UPCONVERT_BIT_DEPTH(GET_GBA_PAL_GREEN(paletteEntry)); + palette->colors[i].blue = UPCONVERT_BIT_DEPTH(GET_GBA_PAL_BLUE(paletteEntry)); + } + + free(data); +} + +void WriteGbaPalette(char *path, struct Palette *palette) +{ + FILE *fp = fopen(path, "wb"); + + if (fp == NULL) + FATAL_ERROR("Failed to open \"%s\" for writing.\n", path); + + for (int i = 0; i < palette->numColors; i++) { + unsigned char red = DOWNCONVERT_BIT_DEPTH(palette->colors[i].red); + unsigned char green = DOWNCONVERT_BIT_DEPTH(palette->colors[i].green); + unsigned char blue = DOWNCONVERT_BIT_DEPTH(palette->colors[i].blue); + + uint16_t paletteEntry = SET_GBA_PAL(red, green, blue); + + fputc(paletteEntry & 0xFF, fp); + fputc(paletteEntry >> 8, fp); + } + + fclose(fp); +} diff --git a/tools/gbagfx/gfx.h b/tools/gbagfx/gfx.h new file mode 100644 index 0000000..5355ced --- /dev/null +++ b/tools/gbagfx/gfx.h @@ -0,0 +1,36 @@ +// Copyright (c) 2015 YamaArashi + +#ifndef GFX_H +#define GFX_H + +#include <stdint.h> +#include <stdbool.h> + +struct Color { + unsigned char red; + unsigned char green; + unsigned char blue; +}; + +struct Palette { + struct Color colors[256]; + int numColors; +}; + +struct Image { + int width; + int height; + int bitDepth; + unsigned char *pixels; + bool hasPalette; + struct Palette palette; + bool hasTransparency; +}; + +void ReadImage(char *path, int tilesWidth, int bitDepth, int metatileWidth, int metatileHeight, struct Image *image, bool invertColors); +void WriteImage(char *path, int numTiles, int bitDepth, int metatileWidth, int metatileHeight, struct Image *image, bool invertColors); +void FreeImage(struct Image *image); +void ReadGbaPalette(char *path, struct Palette *palette); +void WriteGbaPalette(char *path, struct Palette *palette); + +#endif // GFX_H diff --git a/tools/gbagfx/global.h b/tools/gbagfx/global.h new file mode 100644 index 0000000..65dd351 --- /dev/null +++ b/tools/gbagfx/global.h @@ -0,0 +1,31 @@ +// Copyright (c) 2015 YamaArashi + +#ifndef GLOBAL_H +#define GLOBAL_H + +#include <stdio.h> +#include <stdlib.h> + +#ifdef _MSC_VER + +#define FATAL_ERROR(format, ...) \ +do { \ + fprintf(stderr, format, __VA_ARGS__); \ + exit(1); \ +} while (0) + +#define UNUSED + +#else + +#define FATAL_ERROR(format, ...) \ +do { \ + fprintf(stderr, format, ##__VA_ARGS__); \ + exit(1); \ +} while (0) + +#define UNUSED __attribute__((__unused__)) + +#endif // _MSC_VER + +#endif // GLOBAL_H diff --git a/tools/gbagfx/huff.c b/tools/gbagfx/huff.c new file mode 100644 index 0000000..143ed79 --- /dev/null +++ b/tools/gbagfx/huff.c @@ -0,0 +1,398 @@ +#include <stdbool.h> +#include <string.h> +#include <assert.h> +#include <stdio.h> +#include <stdint.h> +#include "global.h" +#include "huff.h" + +static int cmp_tree(const void * a0, const void * b0) { + return ((struct HuffData *)a0)->value - ((struct HuffData *)b0)->value; +} + +typedef int (*cmpfun)(const void *, const void *); + +int msort_r(void * data, size_t count, size_t size, cmpfun cmp, void * buffer) { + /* + * Out-of-place mergesort (stable sort) + * Returns 1 on success, 0 on failure + */ + void * leftPtr; + void * rightPtr; + void * leftEnd; + void * rightEnd; + int i; + + switch (count) { + case 0: + // Should never be here + return 0; + + case 1: + // Nothing to do here + break; + + case 2: + // Swap the two entries if the right one compares higher. + if (cmp(data, data + size) > 0) { + memcpy(buffer, data, size); + memcpy(data, data + size, size); + memcpy(data + size, buffer, size); + } + break; + default: + // Merge sort out-of-place. + leftPtr = data; + leftEnd = rightPtr = data + count / 2 * size; + rightEnd = data + count * size; + + // Sort the left half + if (!msort_r(leftPtr, count / 2, size, cmp, buffer)) + return 0; + + // Sort the right half + if (!msort_r(rightPtr, count / 2 + (count & 1), size, cmp, buffer)) + return 0; + + // Merge the sorted halves out of place + i = 0; + do { + if (cmp(leftPtr, rightPtr) <= 0) { + memcpy(buffer + i * size, leftPtr, size); + leftPtr += size; + } else { + memcpy(buffer + i * size, rightPtr, size); + rightPtr += size; + } + + } while (++i < count && leftPtr < leftEnd && rightPtr < rightEnd); + + // Copy the remainder + if (i < count) { + if (leftPtr < leftEnd) { + memcpy(buffer + i * size, leftPtr, leftEnd - leftPtr); + } + else { + memcpy(buffer + i * size, rightPtr, rightEnd - rightPtr); + } + } + + // Copy the merged data back + memcpy(data, buffer, count * size); + break; + } + + return 1; +} + +int msort(void * data, size_t count, size_t size, cmpfun cmp) { + void * buffer = malloc(count * size); + if (buffer == NULL) return 0; + int result = msort_r(data, count, size, cmp, buffer); + free(buffer); + return result; +} + +static void write_tree(unsigned char * dest, HuffNode_t * tree, int nitems, struct BitEncoding * encoding) { + /* + * The example used to guide this function encodes the tree in a + * breadth-first manner. We attempt to emulate that here. + */ + + int i, j, k; + + // There are (2 * nitems - 1) nodes in the binary tree. Allocate that. + HuffNode_t * traversal = calloc(2 * nitems - 1, sizeof(HuffNode_t)); + if (traversal == NULL) + FATAL_ERROR("Fatal error while compressing Huff file.\n"); + + // The first node is the root of the tree. + traversal[0] = *tree; + i = 1; + + // Copy the tree into a breadth-first ordering using brute force. + for (int depth = 1; i < 2 * nitems - 1; depth++) { + // Consider every possible path up to the current depth. + for (j = 0; i < 2 * nitems - 1 && j < 1 << depth; j++) { + // The index of the path is used to encode the path itself. + // Start from the most significant relevant bit and work our way down. + // Keep track of the current and previous nodes. + HuffNode_t * currNode = traversal; + HuffNode_t * parent = NULL; + for (k = 0; k < depth; k++) { + if (currNode->header.isLeaf) + break; + parent = currNode; + if ((j >> (depth - k - 1)) & 1) + currNode = currNode->branch.right; + else + currNode = currNode->branch.left; + } + // Check that the length of the current path equals the current depth. + if (k == depth) { + // Make sure we can encode the current branch. + // Bail here if we cannot. + // This is only applicable for 8-bit encodings. + if (traversal + i - parent > 128) + FATAL_ERROR("Fatal error while compressing Huff file: unable to encode binary tree.\n"); + // Copy the current node, and update its parent. + traversal[i] = *currNode; + if (parent != NULL) { + if ((j & 1) == 1) + parent->branch.right = traversal + i; + else + parent->branch.left = traversal + i; + } + // Encode the path through the tree in the lookup table + if (traversal[i].header.isLeaf) { + encoding[traversal[i].leaf.key].nbits = depth; + encoding[traversal[i].leaf.key].bitstring = j; + } + i++; + } + } + } + + // Encode the size of the tree. + // This is used by the decompressor to skip the tree. + dest[4] = nitems - 1; + + // Encode each node in the tree. + for (i = 0; i < 2 * nitems - 1; i++) { + HuffNode_t * currNode = traversal + i; + if (currNode->header.isLeaf) { + dest[5 + i] = traversal[i].leaf.key; + } else { + dest[5 + i] = (((currNode->branch.right - traversal - i) / 2) - 1); + if (currNode->branch.left->header.isLeaf) + dest[5 + i] |= 0x80; + if (currNode->branch.right->header.isLeaf) + dest[5 + i] |= 0x40; + } + } + + free(traversal); +} + +static inline void write_32_le(unsigned char * dest, int * destPos, uint32_t * buff, int * buffPos) { + dest[*destPos] = *buff; + dest[*destPos + 1] = *buff >> 8; + dest[*destPos + 2] = *buff >> 16; + dest[*destPos + 3] = *buff >> 24; + *destPos += 4; + *buff = 0; + *buffPos = 0; +} + +static inline void read_32_le(unsigned char * src, int * srcPos, uint32_t * buff) { + uint32_t tmp = src[*srcPos]; + tmp |= src[*srcPos + 1] << 8; + tmp |= src[*srcPos + 2] << 16; + tmp |= src[*srcPos + 3] << 24; + *srcPos += 4; + *buff = tmp; +} + +static void write_bits(unsigned char * dest, int * destPos, struct BitEncoding * encoding, int value, uint32_t * buff, int * buffBits) { + int nbits = encoding[value].nbits; + uint32_t bitstring = encoding[value].bitstring; + + if (*buffBits + nbits >= 32) { + int diff = *buffBits + nbits - 32; + *buff <<= nbits - diff; + *buff |= bitstring >> diff; + bitstring &= ~(1 << diff); + nbits = diff; + write_32_le(dest, destPos, buff, buffBits); + } + if (nbits != 0) { + *buff <<= nbits; + *buff |= bitstring; + *buffBits += nbits; + } +} + +/* +======================================= +MAIN COMPRESSION/DECOMPRESSION ROUTINES +======================================= + */ + +unsigned char * HuffCompress(unsigned char * src, int srcSize, int * compressedSize_p, int bitDepth) { + if (srcSize <= 0) + goto fail; + + int worstCaseDestSize = 4 + (2 << bitDepth) + srcSize * 3; + + unsigned char *dest = malloc(worstCaseDestSize); + if (dest == NULL) + goto fail; + + int nitems = 1 << bitDepth; + + HuffNode_t * freqs = calloc(nitems, sizeof(HuffNode_t)); + if (freqs == NULL) + goto fail; + + struct BitEncoding * encoding = calloc(nitems, sizeof(struct BitEncoding)); + if (encoding == NULL) + goto fail; + + // Set up the frequencies table. This will inform the tree. + for (int i = 0; i < nitems; i++) { + freqs[i].header.isLeaf = 1; + freqs[i].header.value = 0; + freqs[i].leaf.key = i; + } + + // Count each nybble or byte. + for (int i = 0; i < srcSize; i++) { + if (bitDepth == 8) { + freqs[src[i]].header.value++; + } else { + freqs[src[i] >> 4].header.value++; + freqs[src[i] & 0xF].header.value++; + } + } + +#ifdef DEBUG + for (int i = 0; i < nitems; i++) { + fprintf(stderr, "%d: %d\n", i, freqs[i].header.value); + } +#endif // DEBUG + + // Sort the frequency table. + if (!msort(freqs, nitems, sizeof(HuffNode_t), cmp_tree)) + goto fail; + + // Prune zero-frequency values. + for (int i = 0; i < nitems; i++) { + if (freqs[i].header.value != 0) { + if (i > 0) { + for (int j = i; j < nitems; j++) { + freqs[j - i] = freqs[j]; + } + nitems -= i; + } + break; + } + // This should never happen: + if (i == nitems - 1) + goto fail; + } + + HuffNode_t * tree = calloc(nitems * 2 - 1, sizeof(HuffNode_t)); + if (tree == NULL) + goto fail; + + // Iteratively collapse the two least frequent nodes. + HuffNode_t * endptr = freqs + nitems - 2; + + for (int i = 0; i < nitems - 1; i++) { + HuffNode_t * left = freqs; + HuffNode_t * right = freqs + 1; + tree[i * 2] = *right; + tree[i * 2 + 1] = *left; + for (int j = 0; j < nitems - i - 2; j++) + freqs[j] = freqs[j + 2]; + endptr->header.isLeaf = 0; + endptr->header.value = tree[i * 2].header.value + tree[i * 2 + 1].header.value; + endptr->branch.left = tree + i * 2; + endptr->branch.right = tree + i * 2 + 1; + endptr--; + if (i < nitems - 2 && !msort(freqs, nitems - i - 1, sizeof(HuffNode_t), cmp_tree)) + goto fail; + } + + // Write the tree breadth-first, and create the path lookup table. + write_tree(dest, freqs, nitems, encoding); + + free(tree); + free(freqs); + + // Encode the data itself. + int destPos = 4 + nitems * 2; + uint32_t destBuf = 0; + uint32_t srcBuf = 0; + int destBitPos = 0; + + for (int srcPos = 0; srcPos < srcSize;) { + read_32_le(src, &srcPos, &srcBuf); + for (int i = 0; i < 32 / bitDepth; i++) { + write_bits(dest, &destPos, encoding, srcBuf & (0xFF >> (8 - bitDepth)), &destBuf, &destBitPos); + srcBuf >>= bitDepth; + } + } + + if (destBitPos != 0) { + write_32_le(dest, &destPos, &destBuf, &destBitPos); + } + + free(encoding); + + // Write the header. + dest[0] = bitDepth | 0x20; + dest[1] = srcSize; + dest[2] = srcSize >> 8; + dest[3] = srcSize >> 16; + *compressedSize_p = (destPos + 3) & ~3; + return dest; + +fail: + FATAL_ERROR("Fatal error while compressing Huff file.\n"); +} + +unsigned char * HuffDecompress(unsigned char * src, int srcSize, int * uncompressedSize_p) { + if (srcSize < 4) + goto fail; + + int bitDepth = *src & 15; + if (bitDepth != 4 && bitDepth != 8) + goto fail; + + int destSize = (src[3] << 16) | (src[2] << 8) | src[1]; + + unsigned char *dest = malloc(destSize); + + if (dest == NULL) + goto fail; + + int treePos = 5; + int treeSize = (src[4] + 1) * 2; + int srcPos = 4 + treeSize; + int destPos = 0; + int curValPos = 0; + uint32_t destTmp = 0; + uint32_t window; + + for (;;) + { + if (srcPos >= srcSize) + goto fail; + read_32_le(src, &srcPos, &window); + for (int i = 0; i < 32; i++) { + int curBit = (window >> 31) & 1; + unsigned char treeView = src[treePos]; + bool isLeaf = ((treeView << curBit) & 0x80) != 0; + treePos &= ~1; // align + treePos += ((treeView & 0x3F) + 1) * 2 + curBit; + if (isLeaf) { + destTmp >>= bitDepth; + destTmp |= (src[treePos] << (32 - bitDepth)); + curValPos++; + if (curValPos == 32 / bitDepth) { + write_32_le(dest, &destPos, &destTmp, &curValPos); + if (destPos == destSize) { + *uncompressedSize_p = destSize; + return dest; + } + } + treePos = 5; + } + window <<= 1; + } + } + +fail: + FATAL_ERROR("Fatal error while decompressing Huff file.\n"); +} diff --git a/tools/gbagfx/huff.h b/tools/gbagfx/huff.h new file mode 100644 index 0000000..6002fe9 --- /dev/null +++ b/tools/gbagfx/huff.h @@ -0,0 +1,38 @@ +#ifndef HUFF_H +#define HUFF_H + +union HuffNode; + +struct HuffData { + unsigned value:31; + unsigned isLeaf:1; +}; + +struct HuffLeaf { + struct HuffData header; + unsigned char key; +}; + +struct HuffBranch { + struct HuffData header; + union HuffNode * left; + union HuffNode * right; +}; + +union HuffNode { + struct HuffData header; + struct HuffLeaf leaf; + struct HuffBranch branch; +}; + +typedef union HuffNode HuffNode_t; + +struct BitEncoding { + unsigned long long nbits:6; + unsigned long long bitstring:58; +}; + +unsigned char * HuffCompress(unsigned char * buffer, int srcSize, int * compressedSize_p, int bitDepth); +unsigned char * HuffDecompress(unsigned char * buffer, int srcSize, int * uncompressedSize_p); + +#endif //HUFF_H diff --git a/tools/gbagfx/jasc_pal.c b/tools/gbagfx/jasc_pal.c new file mode 100644 index 0000000..e5ba9c3 --- /dev/null +++ b/tools/gbagfx/jasc_pal.c @@ -0,0 +1,172 @@ +// Copyright (c) 2015 YamaArashi + +#include <stdio.h> +#include <string.h> +#include "global.h" +#include "gfx.h" +#include "util.h" + +// Read/write Paint Shop Pro palette files. + +// Format of a Paint Shop Pro palette file, line by line: +// "JASC-PAL\r\n" (signature) +// "0100\r\n" (version; seems to always be "0100") +// "<NUMBER_OF_COLORS>\r\n" (number of colors in decimal) +// +// <NUMBER_OF_COLORS> times: +// "<RED> <GREEN> <BLUE>\r\n" (color entry) +// +// Each color component is a decimal number from 0 to 255. +// Examples: +// Black - "0 0 0\r\n" +// Blue - "0 0 255\r\n" +// Brown - "150 75 0\r\n" + +#define MAX_LINE_LENGTH 11 + +void ReadJascPaletteLine(FILE *fp, char *line) +{ + int c; + int length = 0; + + for (;;) + { + c = fgetc(fp); + + if (c == '\r') + { + c = fgetc(fp); + + if (c != '\n') + FATAL_ERROR("CR line endings aren't supported.\n"); + + line[length] = 0; + + return; + } + + if (c == '\n') + FATAL_ERROR("LF line endings aren't supported.\n"); + + if (c == EOF) + FATAL_ERROR("Unexpected EOF. No CRLF at end of file.\n"); + + if (c == 0) + FATAL_ERROR("NUL character in file.\n"); + + if (length == MAX_LINE_LENGTH) + { + line[length] = 0; + FATAL_ERROR("The line \"%s\" is too long.\n", line); + } + + line[length++] = c; + } +} + +void ReadJascPalette(char *path, struct Palette *palette) +{ + char line[MAX_LINE_LENGTH + 1]; + + FILE *fp = fopen(path, "rb"); + + if (fp == NULL) + FATAL_ERROR("Failed to open JASC-PAL file \"%s\" for reading.\n", path); + + ReadJascPaletteLine(fp, line); + + if (strcmp(line, "JASC-PAL") != 0) + FATAL_ERROR("Invalid JASC-PAL signature.\n"); + + ReadJascPaletteLine(fp, line); + + if (strcmp(line, "0100") != 0) + FATAL_ERROR("Unsuported JASC-PAL version.\n"); + + ReadJascPaletteLine(fp, line); + + if (!ParseNumber(line, NULL, 10, &palette->numColors)) + FATAL_ERROR("Failed to parse number of colors.\n"); + + if (palette->numColors < 1 || palette->numColors > 256) + FATAL_ERROR("%d is an invalid number of colors. The number of colors must be in the range [1, 256].\n", palette->numColors); + + for (int i = 0; i < palette->numColors; i++) + { + ReadJascPaletteLine(fp, line); + + char *s = line; + char *end; + + int red; + int green; + int blue; + + if (!ParseNumber(s, &end, 10, &red)) + FATAL_ERROR("Failed to parse red color component.\n"); + + s = end; + + if (*s != ' ') + FATAL_ERROR("Expected a space after red color component.\n"); + + s++; + + if (*s < '0' || *s > '9') + FATAL_ERROR("Expected only a space between red and green color components.\n"); + + if (!ParseNumber(s, &end, 10, &green)) + FATAL_ERROR("Failed to parse green color component.\n"); + + s = end; + + if (*s != ' ') + FATAL_ERROR("Expected a space after green color component.\n"); + + s++; + + if (*s < '0' || *s > '9') + FATAL_ERROR("Expected only a space between green and blue color components.\n"); + + if (!ParseNumber(s, &end, 10, &blue)) + FATAL_ERROR("Failed to parse blue color component.\n"); + + if (*end != 0) + FATAL_ERROR("Garbage after blue color component.\n"); + + if (red < 0 || red > 255) + FATAL_ERROR("Red color component (%d) is outside the range [0, 255].\n", red); + + if (green < 0 || green > 255) + FATAL_ERROR("Green color component (%d) is outside the range [0, 255].\n", green); + + if (blue < 0 || blue > 255) + FATAL_ERROR("Blue color component (%d) is outside the range [0, 255].\n", blue); + + palette->colors[i].red = red; + palette->colors[i].green = green; + palette->colors[i].blue = blue; + } + + if (fgetc(fp) != EOF) + FATAL_ERROR("Garbage after color data.\n"); + + fclose(fp); +} + +void WriteJascPalette(char *path, struct Palette *palette) +{ + FILE *fp = fopen(path, "wb"); + + fputs("JASC-PAL\r\n", fp); + fputs("0100\r\n", fp); + fprintf(fp, "%d\r\n", palette->numColors); + + for (int i = 0; i < palette->numColors; i++) + { + struct Color *color = &palette->colors[i]; + fprintf(fp, "%d %d %d\r\n", color->red, color->green, color->blue); + } + + fclose(fp); +} diff --git a/tools/gbagfx/jasc_pal.h b/tools/gbagfx/jasc_pal.h new file mode 100644 index 0000000..b60b31f --- /dev/null +++ b/tools/gbagfx/jasc_pal.h @@ -0,0 +1,9 @@ +// Copyright (c) 2015 YamaArashi + +#ifndef JASC_PAL_H +#define JASC_PAL_H + +void ReadJascPalette(char *path, struct Palette *palette); +void WriteJascPalette(char *path, struct Palette *palette); + +#endif // JASC_PAL_H diff --git a/tools/gbagfx/lz.c b/tools/gbagfx/lz.c new file mode 100644 index 0000000..97434ce --- /dev/null +++ b/tools/gbagfx/lz.c @@ -0,0 +1,153 @@ +// Copyright (c) 2015 YamaArashi + +#include <stdlib.h> +#include <stdbool.h> +#include "global.h" +#include "lz.h" + +unsigned char *LZDecompress(unsigned char *src, int srcSize, int *uncompressedSize) +{ + if (srcSize < 4) + goto fail; + + int destSize = (src[3] << 16) | (src[2] << 8) | src[1]; + + unsigned char *dest = malloc(destSize); + + if (dest == NULL) + goto fail; + + int srcPos = 4; + int destPos = 0; + + for (;;) { + if (srcPos >= srcSize) + goto fail; + + unsigned char flags = src[srcPos++]; + + for (int i = 0; i < 8; i++) { + if (flags & 0x80) { + if (srcPos + 1 >= srcSize) + goto fail; + + int blockSize = (src[srcPos] >> 4) + 3; + int blockDistance = (((src[srcPos] & 0xF) << 8) | src[srcPos + 1]) + 1; + + srcPos += 2; + + int blockPos = destPos - blockDistance; + + // Some Ruby/Sapphire tilesets overflow. + if (destPos + blockSize > destSize) { + blockSize = destSize - destPos; + fprintf(stderr, "Destination buffer overflow.\n"); + } + + if (blockPos < 0) + goto fail; + + for (int j = 0; j < blockSize; j++) + dest[destPos++] = dest[blockPos + j]; + } else { + if (srcPos >= srcSize || destPos >= destSize) + goto fail; + + dest[destPos++] = src[srcPos++]; + } + + if (destPos == destSize) { + *uncompressedSize = destSize; + return dest; + } + + flags <<= 1; + } + } + +fail: + FATAL_ERROR("Fatal error while decompressing LZ file.\n"); +} + +unsigned char *LZCompress(unsigned char *src, int srcSize, int *compressedSize, const int minDistance) +{ + if (srcSize <= 0) + goto fail; + + int worstCaseDestSize = 4 + srcSize + ((srcSize + 7) / 8); + + // Round up to the next multiple of four. + worstCaseDestSize = (worstCaseDestSize + 3) & ~3; + + unsigned char *dest = malloc(worstCaseDestSize); + + if (dest == NULL) + goto fail; + + // header + dest[0] = 0x10; // LZ compression type + dest[1] = (unsigned char)srcSize; + dest[2] = (unsigned char)(srcSize >> 8); + dest[3] = (unsigned char)(srcSize >> 16); + + int srcPos = 0; + int destPos = 4; + + for (;;) { + unsigned char *flags = &dest[destPos++]; + *flags = 0; + + for (int i = 0; i < 8; i++) { + int bestBlockDistance = 0; + int bestBlockSize = 0; + int blockDistance = minDistance; + + while (blockDistance <= srcPos && blockDistance <= 0x1000) { + int blockStart = srcPos - blockDistance; + int blockSize = 0; + + while (blockSize < 18 + && srcPos + blockSize < srcSize + && src[blockStart + blockSize] == src[srcPos + blockSize]) + blockSize++; + + if (blockSize > bestBlockSize) { + bestBlockDistance = blockDistance; + bestBlockSize = blockSize; + + if (blockSize == 18) + break; + } + + blockDistance++; + } + + if (bestBlockSize >= 3) { + *flags |= (0x80 >> i); + srcPos += bestBlockSize; + bestBlockSize -= 3; + bestBlockDistance--; + dest[destPos++] = (bestBlockSize << 4) | ((unsigned int)bestBlockDistance >> 8); + dest[destPos++] = (unsigned char)bestBlockDistance; + } else { + dest[destPos++] = src[srcPos++]; + } + + if (srcPos == srcSize) { + // Pad to multiple of 4 bytes. + int remainder = destPos % 4; + + if (remainder != 0) { + for (int i = 0; i < 4 - remainder; i++) + dest[destPos++] = 0; + } + + *compressedSize = destPos; + return dest; + } + } + } + +fail: + FATAL_ERROR("Fatal error while compressing LZ file.\n"); +} diff --git a/tools/gbagfx/lz.h b/tools/gbagfx/lz.h new file mode 100644 index 0000000..90f56b6 --- /dev/null +++ b/tools/gbagfx/lz.h @@ -0,0 +1,9 @@ +// Copyright (c) 2015 YamaArashi + +#ifndef LZ_H +#define LZ_H + +unsigned char *LZDecompress(unsigned char *src, int srcSize, int *uncompressedSize); +unsigned char *LZCompress(unsigned char *src, int srcSize, int *compressedSize, const int minDistance); + +#endif // LZ_H diff --git a/tools/gbagfx/main.c b/tools/gbagfx/main.c new file mode 100644 index 0000000..aa0681f --- /dev/null +++ b/tools/gbagfx/main.c @@ -0,0 +1,537 @@ +// Copyright (c) 2015 YamaArashi + +#include <stdio.h> +#include <string.h> +#include <stdbool.h> +#include "global.h" +#include "util.h" +#include "options.h" +#include "gfx.h" +#include "convert_png.h" +#include "jasc_pal.h" +#include "lz.h" +#include "rl.h" +#include "font.h" +#include "huff.h" + +struct CommandHandler +{ + const char *inputFileExtension; + const char *outputFileExtension; + void(*function)(char *inputPath, char *outputPath, int argc, char **argv); +}; + +void ConvertGbaToPng(char *inputPath, char *outputPath, struct GbaToPngOptions *options) +{ + struct Image image; + + if (options->paletteFilePath != NULL) + { + ReadGbaPalette(options->paletteFilePath, &image.palette); + image.hasPalette = true; + } + else + { + image.hasPalette = false; + } + + ReadImage(inputPath, options->width, options->bitDepth, options->metatileWidth, options->metatileHeight, &image, !image.hasPalette); + + image.hasTransparency = options->hasTransparency; + + WritePng(outputPath, &image); + + FreeImage(&image); +} + +void ConvertPngToGba(char *inputPath, char *outputPath, struct PngToGbaOptions *options) +{ + struct Image image; + + image.bitDepth = options->bitDepth; + + ReadPng(inputPath, &image); + + WriteImage(outputPath, options->numTiles, options->bitDepth, options->metatileWidth, options->metatileHeight, &image, !image.hasPalette); + + FreeImage(&image); +} + +void HandleGbaToPngCommand(char *inputPath, char *outputPath, int argc, char **argv) +{ + char *inputFileExtension = GetFileExtension(inputPath); + struct GbaToPngOptions options; + options.paletteFilePath = NULL; + options.bitDepth = inputFileExtension[0] - '0'; + options.hasTransparency = false; + options.width = 1; + options.metatileWidth = 1; + options.metatileHeight = 1; + + for (int i = 3; i < argc; i++) + { + char *option = argv[i]; + + if (strcmp(option, "-palette") == 0) + { + if (i + 1 >= argc) + FATAL_ERROR("No palette file path following \"-palette\".\n"); + + i++; + + options.paletteFilePath = argv[i]; + } + else if (strcmp(option, "-object") == 0) + { + options.hasTransparency = true; + } + else if (strcmp(option, "-width") == 0) + { + if (i + 1 >= argc) + FATAL_ERROR("No width following \"-width\".\n"); + + i++; + + if (!ParseNumber(argv[i], NULL, 10, &options.width)) + FATAL_ERROR("Failed to parse width.\n"); + + if (options.width < 1) + FATAL_ERROR("Width must be positive.\n"); + } + else if (strcmp(option, "-mwidth") == 0) + { + if (i + 1 >= argc) + FATAL_ERROR("No metatile width value following \"-mwidth\".\n"); + + i++; + + if (!ParseNumber(argv[i], NULL, 10, &options.metatileWidth)) + FATAL_ERROR("Failed to parse metatile width.\n"); + + if (options.metatileWidth < 1) + FATAL_ERROR("metatile width must be positive.\n"); + } + else if (strcmp(option, "-mheight") == 0) + { + if (i + 1 >= argc) + FATAL_ERROR("No metatile height value following \"-mheight\".\n"); + + i++; + + if (!ParseNumber(argv[i], NULL, 10, &options.metatileHeight)) + FATAL_ERROR("Failed to parse metatile height.\n"); + + if (options.metatileHeight < 1) + FATAL_ERROR("metatile height must be positive.\n"); + } + else + { + FATAL_ERROR("Unrecognized option \"%s\".\n", option); + } + } + + if (options.metatileWidth > options.width) + options.width = options.metatileWidth; + + ConvertGbaToPng(inputPath, outputPath, &options); +} + +void HandlePngToGbaCommand(char *inputPath, char *outputPath, int argc, char **argv) +{ + char *outputFileExtension = GetFileExtension(outputPath); + int bitDepth = outputFileExtension[0] - '0'; + struct PngToGbaOptions options; + options.numTiles = 0; + options.bitDepth = bitDepth; + options.metatileWidth = 1; + options.metatileHeight = 1; + + for (int i = 3; i < argc; i++) + { + char *option = argv[i]; + + if (strcmp(option, "-num_tiles") == 0) + { + if (i + 1 >= argc) + FATAL_ERROR("No number of tiles following \"-num_tiles\".\n"); + + i++; + + if (!ParseNumber(argv[i], NULL, 10, &options.numTiles)) + FATAL_ERROR("Failed to parse number of tiles.\n"); + + if (options.numTiles < 1) + FATAL_ERROR("Number of tiles must be positive.\n"); + } + else if (strcmp(option, "-mwidth") == 0) + { + if (i + 1 >= argc) + FATAL_ERROR("No metatile width value following \"-mwidth\".\n"); + + i++; + + if (!ParseNumber(argv[i], NULL, 10, &options.metatileWidth)) + FATAL_ERROR("Failed to parse metatile width.\n"); + + if (options.metatileWidth < 1) + FATAL_ERROR("metatile width must be positive.\n"); + } + else if (strcmp(option, "-mheight") == 0) + { + if (i + 1 >= argc) + FATAL_ERROR("No metatile height value following \"-mheight\".\n"); + + i++; + + if (!ParseNumber(argv[i], NULL, 10, &options.metatileHeight)) + FATAL_ERROR("Failed to parse metatile height.\n"); + + if (options.metatileHeight < 1) + FATAL_ERROR("metatile height must be positive.\n"); + } + else + { + FATAL_ERROR("Unrecognized option \"%s\".\n", option); + } + } + + ConvertPngToGba(inputPath, outputPath, &options); +} + +void HandlePngToGbaPaletteCommand(char *inputPath, char *outputPath, int argc UNUSED, char **argv UNUSED) +{ + struct Palette palette; + + ReadPngPalette(inputPath, &palette); + WriteGbaPalette(outputPath, &palette); +} + +void HandleGbaToJascPaletteCommand(char *inputPath, char *outputPath, int argc UNUSED, char **argv UNUSED) +{ + struct Palette palette; + + ReadGbaPalette(inputPath, &palette); + WriteJascPalette(outputPath, &palette); +} + +void HandleJascToGbaPaletteCommand(char *inputPath, char *outputPath, int argc, char **argv) +{ + int numColors = 0; + + for (int i = 3; i < argc; i++) + { + char *option = argv[i]; + + if (strcmp(option, "-num_colors") == 0) + { + if (i + 1 >= argc) + FATAL_ERROR("No number of colors following \"-num_colors\".\n"); + + i++; + + if (!ParseNumber(argv[i], NULL, 10, &numColors)) + FATAL_ERROR("Failed to parse number of colors.\n"); + + if (numColors < 1) + FATAL_ERROR("Number of colors must be positive.\n"); + } + else + { + FATAL_ERROR("Unrecognized option \"%s\".\n", option); + } + } + + struct Palette palette; + + ReadJascPalette(inputPath, &palette); + + if (numColors != 0) + palette.numColors = numColors; + + WriteGbaPalette(outputPath, &palette); +} + +void HandleLatinFontToPngCommand(char *inputPath, char *outputPath, int argc UNUSED, char **argv UNUSED) +{ + struct Image image; + + ReadLatinFont(inputPath, &image); + WritePng(outputPath, &image); + + FreeImage(&image); +} + +void HandlePngToLatinFontCommand(char *inputPath, char *outputPath, int argc UNUSED, char **argv UNUSED) +{ + struct Image image; + + image.bitDepth = 2; + + ReadPng(inputPath, &image); + WriteLatinFont(outputPath, &image); + + FreeImage(&image); +} + +void HandleHalfwidthJapaneseFontToPngCommand(char *inputPath, char *outputPath, int argc UNUSED, char **argv UNUSED) +{ + struct Image image; + + ReadHalfwidthJapaneseFont(inputPath, &image); + WritePng(outputPath, &image); + + FreeImage(&image); +} + +void HandlePngToHalfwidthJapaneseFontCommand(char *inputPath, char *outputPath, int argc UNUSED, char **argv UNUSED) +{ + struct Image image; + + image.bitDepth = 2; + + ReadPng(inputPath, &image); + WriteHalfwidthJapaneseFont(outputPath, &image); + + FreeImage(&image); +} + +void HandleFullwidthJapaneseFontToPngCommand(char *inputPath, char *outputPath, int argc UNUSED, char **argv UNUSED) +{ + struct Image image; + + ReadFullwidthJapaneseFont(inputPath, &image); + WritePng(outputPath, &image); + + FreeImage(&image); +} + +void HandlePngToFullwidthJapaneseFontCommand(char *inputPath, char *outputPath, int argc UNUSED, char **argv UNUSED) +{ + struct Image image; + + image.bitDepth = 2; + + ReadPng(inputPath, &image); + WriteFullwidthJapaneseFont(outputPath, &image); + + FreeImage(&image); +} + +void HandleLZCompressCommand(char *inputPath, char *outputPath, int argc, char **argv) +{ + int overflowSize = 0; + int minDistance = 2; // default, for compatibility with LZ77UnCompVram() + + for (int i = 3; i < argc; i++) + { + char *option = argv[i]; + + if (strcmp(option, "-overflow") == 0) + { + if (i + 1 >= argc) + FATAL_ERROR("No size following \"-overflow\".\n"); + + i++; + + if (!ParseNumber(argv[i], NULL, 10, &overflowSize)) + FATAL_ERROR("Failed to parse overflow size.\n"); + + if (overflowSize < 1) + FATAL_ERROR("Overflow size must be positive.\n"); + } + else if (strcmp(option, "-search") == 0) + { + if (i + 1 >= argc) + FATAL_ERROR("No size following \"-overflow\".\n"); + + i++; + + if (!ParseNumber(argv[i], NULL, 10, &minDistance)) + FATAL_ERROR("Failed to parse LZ min search distance.\n"); + + if (minDistance < 1) + FATAL_ERROR("LZ min search distance must be positive.\n"); + } + else + { + FATAL_ERROR("Unrecognized option \"%s\".\n", option); + } + } + + // The overflow option allows a quirk in some of Ruby/Sapphire's tilesets + // to be reproduced. It works by appending a number of zeros to the data + // before compressing it and then amending the LZ header's size field to + // reflect the expected size. This will cause an overflow when decompressing + // the data. + + int fileSize; + unsigned char *buffer = ReadWholeFileZeroPadded(inputPath, &fileSize, overflowSize); + + int compressedSize; + unsigned char *compressedData = LZCompress(buffer, fileSize + overflowSize, &compressedSize, minDistance); + + compressedData[1] = (unsigned char)fileSize; + compressedData[2] = (unsigned char)(fileSize >> 8); + compressedData[3] = (unsigned char)(fileSize >> 16); + + free(buffer); + + WriteWholeFile(outputPath, compressedData, compressedSize); + + free(compressedData); +} + +void HandleLZDecompressCommand(char *inputPath, char *outputPath, int argc UNUSED, char **argv UNUSED) +{ + int fileSize; + unsigned char *buffer = ReadWholeFile(inputPath, &fileSize); + + int uncompressedSize; + unsigned char *uncompressedData = LZDecompress(buffer, fileSize, &uncompressedSize); + + free(buffer); + + WriteWholeFile(outputPath, uncompressedData, uncompressedSize); + + free(uncompressedData); +} + +void HandleRLCompressCommand(char *inputPath, char *outputPath, int argc UNUSED, char **argv UNUSED) +{ + int fileSize; + unsigned char *buffer = ReadWholeFile(inputPath, &fileSize); + + int compressedSize; + unsigned char *compressedData = RLCompress(buffer, fileSize, &compressedSize); + + free(buffer); + + WriteWholeFile(outputPath, compressedData, compressedSize); + + free(compressedData); +} + +void HandleRLDecompressCommand(char *inputPath, char *outputPath, int argc UNUSED, char **argv UNUSED) +{ + int fileSize; + unsigned char *buffer = ReadWholeFile(inputPath, &fileSize); + + int uncompressedSize; + unsigned char *uncompressedData = RLDecompress(buffer, fileSize, &uncompressedSize); + + free(buffer); + + WriteWholeFile(outputPath, uncompressedData, uncompressedSize); + + free(uncompressedData); +} + +void HandleHuffCompressCommand(char *inputPath, char *outputPath, int argc, char **argv) +{ + int fileSize; + int bitDepth = 4; + + for (int i = 3; i < argc; i++) + { + char *option = argv[i]; + + if (strcmp(option, "-depth") == 0) + { + if (i + 1 >= argc) + FATAL_ERROR("No size following \"-depth\".\n"); + + i++; + + if (!ParseNumber(argv[i], NULL, 10, &bitDepth)) + FATAL_ERROR("Failed to parse bit depth.\n"); + + if (bitDepth != 4 && bitDepth != 8) + FATAL_ERROR("GBA only supports bit depth of 4 or 8.\n"); + } + else + { + FATAL_ERROR("Unrecognized option \"%s\".\n", option); + } + } + + unsigned char *buffer = ReadWholeFile(inputPath, &fileSize); + + int compressedSize; + unsigned char *compressedData = HuffCompress(buffer, fileSize, &compressedSize, bitDepth); + + free(buffer); + + WriteWholeFile(outputPath, compressedData, compressedSize); + + free(compressedData); +} + +void HandleHuffDecompressCommand(char *inputPath, char *outputPath, int argc UNUSED, char **argv UNUSED) +{ + int fileSize; + unsigned char *buffer = ReadWholeFile(inputPath, &fileSize); + + int uncompressedSize; + unsigned char *uncompressedData = HuffDecompress(buffer, fileSize, &uncompressedSize); + + free(buffer); + + WriteWholeFile(outputPath, uncompressedData, uncompressedSize); + + free(uncompressedData); +} + +int main(int argc, char **argv) +{ + if (argc < 3) + FATAL_ERROR("Usage: gbagfx INPUT_PATH OUTPUT_PATH [options...]\n"); + + struct CommandHandler handlers[] = + { + { "1bpp", "png", HandleGbaToPngCommand }, + { "4bpp", "png", HandleGbaToPngCommand }, + { "8bpp", "png", HandleGbaToPngCommand }, + { "png", "1bpp", HandlePngToGbaCommand }, + { "png", "4bpp", HandlePngToGbaCommand }, + { "png", "8bpp", HandlePngToGbaCommand }, + { "png", "gbapal", HandlePngToGbaPaletteCommand }, + { "gbapal", "pal", HandleGbaToJascPaletteCommand }, + { "pal", "gbapal", HandleJascToGbaPaletteCommand }, + { "latfont", "png", HandleLatinFontToPngCommand }, + { "png", "latfont", HandlePngToLatinFontCommand }, + { "hwjpnfont", "png", HandleHalfwidthJapaneseFontToPngCommand }, + { "png", "hwjpnfont", HandlePngToHalfwidthJapaneseFontCommand }, + { "fwjpnfont", "png", HandleFullwidthJapaneseFontToPngCommand }, + { "png", "fwjpnfont", HandlePngToFullwidthJapaneseFontCommand }, + { NULL, "huff", HandleHuffCompressCommand }, + { NULL, "lz", HandleLZCompressCommand }, + { "huff", NULL, HandleHuffDecompressCommand }, + { "lz", NULL, HandleLZDecompressCommand }, + { NULL, "rl", HandleRLCompressCommand }, + { "rl", NULL, HandleRLDecompressCommand }, + { NULL, NULL, NULL } + }; + + char *inputPath = argv[1]; + char *outputPath = argv[2]; + char *inputFileExtension = GetFileExtension(inputPath); + char *outputFileExtension = GetFileExtension(outputPath); + + if (inputFileExtension == NULL) + FATAL_ERROR("Input file \"%s\" has no extension.\n", inputPath); + + if (outputFileExtension == NULL) + FATAL_ERROR("Output file \"%s\" has no extension.\n", outputPath); + + for (int i = 0; handlers[i].function != NULL; i++) + { + if ((handlers[i].inputFileExtension == NULL || strcmp(handlers[i].inputFileExtension, inputFileExtension) == 0) + && (handlers[i].outputFileExtension == NULL || strcmp(handlers[i].outputFileExtension, outputFileExtension) == 0)) + { + handlers[i].function(inputPath, outputPath, argc, argv); + return 0; + } + } + + FATAL_ERROR("Don't know how to convert \"%s\" to \"%s\".\n", inputPath, outputPath); +} diff --git a/tools/gbagfx/options.h b/tools/gbagfx/options.h new file mode 100644 index 0000000..2ff3967 --- /dev/null +++ b/tools/gbagfx/options.h @@ -0,0 +1,24 @@ +// Copyright (c) 2018 huderlem + +#ifndef OPTIONS_H +#define OPTIONS_H + +#include <stdbool.h> + +struct GbaToPngOptions { + char *paletteFilePath; + int bitDepth; + bool hasTransparency; + int width; + int metatileWidth; + int metatileHeight; +}; + +struct PngToGbaOptions { + int numTiles; + int bitDepth; + int metatileWidth; + int metatileHeight; +}; + +#endif // OPTIONS_H diff --git a/tools/gbagfx/rl.c b/tools/gbagfx/rl.c new file mode 100644 index 0000000..968c934 --- /dev/null +++ b/tools/gbagfx/rl.c @@ -0,0 +1,149 @@ +// Copyright (c) 2016 YamaArashi + +#include <stdlib.h> +#include <stdbool.h> +#include "global.h" +#include "rl.h" + +unsigned char *RLDecompress(unsigned char *src, int srcSize, int *uncompressedSize) +{ + if (srcSize < 4) + goto fail; + + int destSize = (src[3] << 16) | (src[2] << 8) | src[1]; + + unsigned char *dest = malloc(destSize); + + if (dest == NULL) + goto fail; + + int srcPos = 4; + int destPos = 0; + + for (;;) + { + if (srcPos >= srcSize) + goto fail; + + unsigned char flags = src[srcPos++]; + bool compressed = ((flags & 0x80) != 0); + + if (compressed) + { + int length = (flags & 0x7F) + 3; + unsigned char data = src[srcPos++]; + + if (destPos + length > destSize) + goto fail; + + for (int i = 0; i < length; i++) + dest[destPos++] = data; + } + else + { + int length = (flags & 0x7F) + 1; + + if (destPos + length > destSize) + goto fail; + + for (int i = 0; i < length; i++) + dest[destPos++] = src[srcPos++]; + } + + if (destPos == destSize) + { + *uncompressedSize = destSize; + return dest; + } + } + +fail: + FATAL_ERROR("Fatal error while decompressing RL file.\n"); +} + +unsigned char *RLCompress(unsigned char *src, int srcSize, int *compressedSize) +{ + if (srcSize <= 0) + goto fail; + + int worstCaseDestSize = 4 + srcSize * 2; + + // Round up to the next multiple of four. + worstCaseDestSize = (worstCaseDestSize + 3) & ~3; + + unsigned char *dest = malloc(worstCaseDestSize); + + if (dest == NULL) + goto fail; + + // header + dest[0] = 0x30; // RL compression type + dest[1] = (unsigned char)srcSize; + dest[2] = (unsigned char)(srcSize >> 8); + dest[3] = (unsigned char)(srcSize >> 16); + + int srcPos = 0; + int destPos = 4; + + for (;;) + { + bool compress = false; + int uncompressedStart = srcPos; + int uncompressedLength = 0; + + while (srcPos < srcSize && uncompressedLength < (0x7F + 1)) + { + compress = (srcPos + 2 < srcSize && src[srcPos] == src[srcPos + 1] && src[srcPos] == src[srcPos + 2]); + + if (compress) + break; + + srcPos++; + uncompressedLength++; + } + + if (uncompressedLength > 0) + { + dest[destPos++] = uncompressedLength - 1; + + for (int i = 0; i < uncompressedLength; i++) + dest[destPos++] = src[uncompressedStart + i]; + } + + if (compress) + { + unsigned char data = src[srcPos]; + int compressedLength = 0; + + while (compressedLength < (0x7F + 3) + && srcPos + compressedLength < srcSize + && src[srcPos + compressedLength] == data) + { + compressedLength++; + } + + dest[destPos++] = 0x80 | (compressedLength - 3); + dest[destPos++] = data; + + srcPos += compressedLength; + } + + if (srcPos == srcSize) + { + // Pad to multiple of 4 bytes. + int remainder = destPos % 4; + + if (remainder != 0) + { + for (int i = 0; i < 4 - remainder; i++) + dest[destPos++] = 0; + } + + *compressedSize = destPos; + return dest; + } + } + +fail: + FATAL_ERROR("Fatal error while compressing RL file.\n"); +} diff --git a/tools/gbagfx/rl.h b/tools/gbagfx/rl.h new file mode 100644 index 0000000..02ad8d6 --- /dev/null +++ b/tools/gbagfx/rl.h @@ -0,0 +1,9 @@ +// Copyright (c) 2016 YamaArashi + +#ifndef RL_H +#define RL_H + +unsigned char *RLDecompress(unsigned char *src, int srcSize, int *uncompressedSize); +unsigned char *RLCompress(unsigned char *src, int srcSize, int *compressedSize); + +#endif // RL_H diff --git a/tools/gbagfx/util.c b/tools/gbagfx/util.c new file mode 100644 index 0000000..87abeb3 --- /dev/null +++ b/tools/gbagfx/util.c @@ -0,0 +1,124 @@ +// Copyright (c) 2015 YamaArashi + +#include <stdio.h> +#include <stdlib.h> +#include <string.h> +#include <stdbool.h> +#include <errno.h> +#include <limits.h> +#include "global.h" +#include "util.h" + +bool ParseNumber(char *s, char **end, int radix, int *intValue) +{ + char *localEnd; + + if (end == NULL) + end = &localEnd; + + errno = 0; + + const long longValue = strtol(s, end, radix); + + if (*end == s) + return false; // not a number + + if ((longValue == LONG_MIN || longValue == LONG_MAX) && errno == ERANGE) + return false; + + if (longValue > INT_MAX) + return false; + + if (longValue < INT_MIN) + return false; + + *intValue = (int)longValue; + + return true; +} + +char *GetFileExtension(char *path) +{ + char *extension = path; + + while (*extension != 0) + extension++; + + while (extension > path && *extension != '.') + extension--; + + if (extension == path) + return NULL; + + extension++; + + if (*extension == 0) + return NULL; + + return extension; +} + +unsigned char *ReadWholeFile(char *path, int *size) +{ + FILE *fp = fopen(path, "rb"); + + if (fp == NULL) + FATAL_ERROR("Failed to open \"%s\" for reading.\n", path); + + fseek(fp, 0, SEEK_END); + + *size = ftell(fp); + + unsigned char *buffer = malloc(*size); + + if (buffer == NULL) + FATAL_ERROR("Failed to allocate memory for reading \"%s\".\n", path); + + rewind(fp); + + if (fread(buffer, *size, 1, fp) != 1) + FATAL_ERROR("Failed to read \"%s\".\n", path); + + fclose(fp); + + return buffer; +} + +unsigned char *ReadWholeFileZeroPadded(char *path, int *size, int padAmount) +{ + FILE *fp = fopen(path, "rb"); + + if (fp == NULL) + FATAL_ERROR("Failed to open \"%s\" for reading.\n", path); + + fseek(fp, 0, SEEK_END); + + *size = ftell(fp); + + unsigned char *buffer = calloc(*size + padAmount, 1); + + if (buffer == NULL) + FATAL_ERROR("Failed to allocate memory for reading \"%s\".\n", path); + + rewind(fp); + + if (fread(buffer, *size, 1, fp) != 1) + FATAL_ERROR("Failed to read \"%s\".\n", path); + + fclose(fp); + + return buffer; +} + +void WriteWholeFile(char *path, void *buffer, int bufferSize) +{ + FILE *fp = fopen(path, "wb"); + + if (fp == NULL) + FATAL_ERROR("Failed to open \"%s\" for writing.\n", path); + + if (fwrite(buffer, bufferSize, 1, fp) != 1) + FATAL_ERROR("Failed to write to \"%s\".\n", path); + + fclose(fp); +} diff --git a/tools/gbagfx/util.h b/tools/gbagfx/util.h new file mode 100644 index 0000000..6d7a9c2 --- /dev/null +++ b/tools/gbagfx/util.h @@ -0,0 +1,14 @@ +// Copyright (c) 2015 YamaArashi + +#ifndef UTIL_H +#define UTIL_H + +#include <stdbool.h> + +bool ParseNumber(char *s, char **end, int radix, int *intValue); +char *GetFileExtension(char *path); +unsigned char *ReadWholeFile(char *path, int *size); +unsigned char *ReadWholeFileZeroPadded(char *path, int *size, int padAmount); +void WriteWholeFile(char *path, void *buffer, int bufferSize); + +#endif // UTIL_H diff --git a/tools/jsonproc/.gitignore b/tools/jsonproc/.gitignore new file mode 100644 index 0000000..a613cf2 --- /dev/null +++ b/tools/jsonproc/.gitignore @@ -0,0 +1 @@ +jsonproc diff --git a/tools/jsonproc/Makefile b/tools/jsonproc/Makefile new file mode 100644 index 0000000..b415e7b --- /dev/null +++ b/tools/jsonproc/Makefile @@ -0,0 +1,20 @@ +CXX := g++ + +CXXFLAGS := -Wall -std=c++11 -O2 + +INCLUDES := -I . + +SRCS := jsonproc.cpp + +HEADERS := jsonproc.h inja.hpp nlohmann/json.hpp + +.PHONY: clean + +all: jsonproc + @: + +jsonproc: $(SRCS) $(HEADERS) + $(CXX) $(CXXFLAGS) $(INCLUDES) $(SRCS) -o $@ $(LDFLAGS) + +clean: + $(RM) jsonproc jsonproc.exe diff --git a/tools/jsonproc/inja.hpp b/tools/jsonproc/inja.hpp new file mode 100644 index 0000000..3b72635 --- /dev/null +++ b/tools/jsonproc/inja.hpp @@ -0,0 +1,3396 @@ +// MIT License + +// Copyright (c) 2018 lbersch + +// 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. + + +// --- + + +// Copyright (c) 2009-2018 FIRST +// All rights reserved. + +// Redistribution and use in source and binary forms, with or without +// modification, are permitted provided that the following conditions are met: +// * Redistributions of source code must retain the above copyright +// notice, this list of conditions and the following disclaimer. +// * Redistributions in binary form must reproduce the above copyright +// notice, this list of conditions and the following disclaimer in the +// documentation and/or other materials provided with the distribution. +// * Neither the name of the FIRST nor the +// names of its contributors may be used to endorse or promote products +// derived from this software without specific prior written permission. + +// THIS SOFTWARE IS PROVIDED BY FIRST AND CONTRIBUTORS``AS IS'' AND ANY +// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED +// WARRANTIES OF MERCHANTABILITY NONINFRINGEMENT AND FITNESS FOR A PARTICULAR +// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL FIRST OR CONTRIBUTORS BE LIABLE FOR +// ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES +// (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; +// LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND +// ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT +// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS +// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. + +#ifndef PANTOR_INJA_HPP +#define PANTOR_INJA_HPP + +#include <functional> +#include <iostream> +#include <map> +#include <memory> +#include <sstream> +#include <string> +#include <vector> + +#include <nlohmann/json.hpp> + +// #include "environment.hpp" +#ifndef PANTOR_INJA_ENVIRONMENT_HPP +#define PANTOR_INJA_ENVIRONMENT_HPP + +#include <memory> +#include <fstream> +#include <sstream> +#include <string> + +#include <nlohmann/json.hpp> + +// #include "config.hpp" +#ifndef PANTOR_INJA_CONFIG_HPP +#define PANTOR_INJA_CONFIG_HPP + +#include <functional> +#include <string> + +// #include "string_view.hpp" +// Copyright 2017-2019 by Martin Moene +// +// string-view lite, a C++17-like string_view for C++98 and later. +// For more information see https://github.com/martinmoene/string-view-lite +// +// Distributed under the Boost Software License, Version 1.0. +// (See accompanying file LICENSE.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + + + +#ifndef NONSTD_SV_LITE_H_INCLUDED +#define NONSTD_SV_LITE_H_INCLUDED + +#define string_view_lite_MAJOR 1 +#define string_view_lite_MINOR 1 +#define string_view_lite_PATCH 0 + +#define string_view_lite_VERSION nssv_STRINGIFY(string_view_lite_MAJOR) "." nssv_STRINGIFY(string_view_lite_MINOR) "." nssv_STRINGIFY(string_view_lite_PATCH) + +#define nssv_STRINGIFY( x ) nssv_STRINGIFY_( x ) +#define nssv_STRINGIFY_( x ) #x + +// string-view lite configuration: + +#define nssv_STRING_VIEW_DEFAULT 0 +#define nssv_STRING_VIEW_NONSTD 1 +#define nssv_STRING_VIEW_STD 2 + +#if !defined( nssv_CONFIG_SELECT_STRING_VIEW ) +# define nssv_CONFIG_SELECT_STRING_VIEW ( nssv_HAVE_STD_STRING_VIEW ? nssv_STRING_VIEW_STD : nssv_STRING_VIEW_NONSTD ) +#endif + +#if defined( nssv_CONFIG_SELECT_STD_STRING_VIEW ) || defined( nssv_CONFIG_SELECT_NONSTD_STRING_VIEW ) +# error nssv_CONFIG_SELECT_STD_STRING_VIEW and nssv_CONFIG_SELECT_NONSTD_STRING_VIEW are deprecated and removed, please use nssv_CONFIG_SELECT_STRING_VIEW=nssv_STRING_VIEW_... +#endif + +#ifndef nssv_CONFIG_STD_SV_OPERATOR +# define nssv_CONFIG_STD_SV_OPERATOR 0 +#endif + +#ifndef nssv_CONFIG_USR_SV_OPERATOR +# define nssv_CONFIG_USR_SV_OPERATOR 1 +#endif + +#ifdef nssv_CONFIG_CONVERSION_STD_STRING +# define nssv_CONFIG_CONVERSION_STD_STRING_CLASS_METHODS nssv_CONFIG_CONVERSION_STD_STRING +# define nssv_CONFIG_CONVERSION_STD_STRING_FREE_FUNCTIONS nssv_CONFIG_CONVERSION_STD_STRING +#endif + +#ifndef nssv_CONFIG_CONVERSION_STD_STRING_CLASS_METHODS +# define nssv_CONFIG_CONVERSION_STD_STRING_CLASS_METHODS 1 +#endif + +#ifndef nssv_CONFIG_CONVERSION_STD_STRING_FREE_FUNCTIONS +# define nssv_CONFIG_CONVERSION_STD_STRING_FREE_FUNCTIONS 1 +#endif + +// Control presence of exception handling (try and auto discover): + +#ifndef nssv_CONFIG_NO_EXCEPTIONS +# if defined(__cpp_exceptions) || defined(__EXCEPTIONS) || defined(_CPPUNWIND) +# define nssv_CONFIG_NO_EXCEPTIONS 0 +# else +# define nssv_CONFIG_NO_EXCEPTIONS 1 +# endif +#endif + +// C++ language version detection (C++20 is speculative): +// Note: VC14.0/1900 (VS2015) lacks too much from C++14. + +#ifndef nssv_CPLUSPLUS +# if defined(_MSVC_LANG ) && !defined(__clang__) +# define nssv_CPLUSPLUS (_MSC_VER == 1900 ? 201103L : _MSVC_LANG ) +# else +# define nssv_CPLUSPLUS __cplusplus +# endif +#endif + +#define nssv_CPP98_OR_GREATER ( nssv_CPLUSPLUS >= 199711L ) +#define nssv_CPP11_OR_GREATER ( nssv_CPLUSPLUS >= 201103L ) +#define nssv_CPP11_OR_GREATER_ ( nssv_CPLUSPLUS >= 201103L ) +#define nssv_CPP14_OR_GREATER ( nssv_CPLUSPLUS >= 201402L ) +#define nssv_CPP17_OR_GREATER ( nssv_CPLUSPLUS >= 201703L ) +#define nssv_CPP20_OR_GREATER ( nssv_CPLUSPLUS >= 202000L ) + +// use C++17 std::string_view if available and requested: + +#if nssv_CPP17_OR_GREATER && defined(__has_include ) +# if __has_include( <string_view> ) +# define nssv_HAVE_STD_STRING_VIEW 1 +# else +# define nssv_HAVE_STD_STRING_VIEW 0 +# endif +#else +# define nssv_HAVE_STD_STRING_VIEW 0 +#endif + +#define nssv_USES_STD_STRING_VIEW ( (nssv_CONFIG_SELECT_STRING_VIEW == nssv_STRING_VIEW_STD) || ((nssv_CONFIG_SELECT_STRING_VIEW == nssv_STRING_VIEW_DEFAULT) && nssv_HAVE_STD_STRING_VIEW) ) + +#define nssv_HAVE_STARTS_WITH ( nssv_CPP20_OR_GREATER || !nssv_USES_STD_STRING_VIEW ) +#define nssv_HAVE_ENDS_WITH nssv_HAVE_STARTS_WITH + +// +// Use C++17 std::string_view: +// + +#if nssv_USES_STD_STRING_VIEW + +#include <string_view> + +// Extensions for std::string: + +#if nssv_CONFIG_CONVERSION_STD_STRING_FREE_FUNCTIONS + +namespace nonstd { + +template< class CharT, class Traits, class Allocator = std::allocator<CharT> > +std::basic_string<CharT, Traits, Allocator> +to_string( std::basic_string_view<CharT, Traits> v, Allocator const & a = Allocator() ) +{ + return std::basic_string<CharT,Traits, Allocator>( v.begin(), v.end(), a ); +} + +template< class CharT, class Traits, class Allocator > +std::basic_string_view<CharT, Traits> +to_string_view( std::basic_string<CharT, Traits, Allocator> const & s ) +{ + return std::basic_string_view<CharT, Traits>( s.data(), s.size() ); +} + +// Literal operators sv and _sv: + +#if nssv_CONFIG_STD_SV_OPERATOR + +using namespace std::literals::string_view_literals; + +#endif + +#if nssv_CONFIG_USR_SV_OPERATOR + +inline namespace literals { +inline namespace string_view_literals { + + +constexpr std::string_view operator "" _sv( const char* str, size_t len ) noexcept // (1) +{ + return std::string_view{ str, len }; +} + +constexpr std::u16string_view operator "" _sv( const char16_t* str, size_t len ) noexcept // (2) +{ + return std::u16string_view{ str, len }; +} + +constexpr std::u32string_view operator "" _sv( const char32_t* str, size_t len ) noexcept // (3) +{ + return std::u32string_view{ str, len }; +} + +constexpr std::wstring_view operator "" _sv( const wchar_t* str, size_t len ) noexcept // (4) +{ + return std::wstring_view{ str, len }; +} + +}} // namespace literals::string_view_literals + +#endif // nssv_CONFIG_USR_SV_OPERATOR + +} // namespace nonstd + +#endif // nssv_CONFIG_CONVERSION_STD_STRING_FREE_FUNCTIONS + +namespace nonstd { + +using std::string_view; +using std::wstring_view; +using std::u16string_view; +using std::u32string_view; +using std::basic_string_view; + +// literal "sv" and "_sv", see above + +using std::operator==; +using std::operator!=; +using std::operator<; +using std::operator<=; +using std::operator>; +using std::operator>=; + +using std::operator<<; + +} // namespace nonstd + +#else // nssv_HAVE_STD_STRING_VIEW + +// +// Before C++17: use string_view lite: +// + +// Compiler versions: +// +// MSVC++ 6.0 _MSC_VER == 1200 (Visual Studio 6.0) +// MSVC++ 7.0 _MSC_VER == 1300 (Visual Studio .NET 2002) +// MSVC++ 7.1 _MSC_VER == 1310 (Visual Studio .NET 2003) +// MSVC++ 8.0 _MSC_VER == 1400 (Visual Studio 2005) +// MSVC++ 9.0 _MSC_VER == 1500 (Visual Studio 2008) +// MSVC++ 10.0 _MSC_VER == 1600 (Visual Studio 2010) +// MSVC++ 11.0 _MSC_VER == 1700 (Visual Studio 2012) +// MSVC++ 12.0 _MSC_VER == 1800 (Visual Studio 2013) +// MSVC++ 14.0 _MSC_VER == 1900 (Visual Studio 2015) +// MSVC++ 14.1 _MSC_VER >= 1910 (Visual Studio 2017) + +#if defined(_MSC_VER ) && !defined(__clang__) +# define nssv_COMPILER_MSVC_VER (_MSC_VER ) +# define nssv_COMPILER_MSVC_VERSION (_MSC_VER / 10 - 10 * ( 5 + (_MSC_VER < 1900 ) ) ) +#else +# define nssv_COMPILER_MSVC_VER 0 +# define nssv_COMPILER_MSVC_VERSION 0 +#endif + +#define nssv_COMPILER_VERSION( major, minor, patch ) (10 * ( 10 * major + minor) + patch) + +#if defined(__clang__) +# define nssv_COMPILER_CLANG_VERSION nssv_COMPILER_VERSION(__clang_major__, __clang_minor__, __clang_patchlevel__) +#else +# define nssv_COMPILER_CLANG_VERSION 0 +#endif + +#if defined(__GNUC__) && !defined(__clang__) +# define nssv_COMPILER_GNUC_VERSION nssv_COMPILER_VERSION(__GNUC__, __GNUC_MINOR__, __GNUC_PATCHLEVEL__) +#else +# define nssv_COMPILER_GNUC_VERSION 0 +#endif + +// half-open range [lo..hi): +#define nssv_BETWEEN( v, lo, hi ) ( (lo) <= (v) && (v) < (hi) ) + +// Presence of language and library features: + +#ifdef _HAS_CPP0X +# define nssv_HAS_CPP0X _HAS_CPP0X +#else +# define nssv_HAS_CPP0X 0 +#endif + +// Unless defined otherwise below, consider VC14 as C++11 for variant-lite: + +#if nssv_COMPILER_MSVC_VER >= 1900 +# undef nssv_CPP11_OR_GREATER +# define nssv_CPP11_OR_GREATER 1 +#endif + +#define nssv_CPP11_90 (nssv_CPP11_OR_GREATER_ || nssv_COMPILER_MSVC_VER >= 1500) +#define nssv_CPP11_100 (nssv_CPP11_OR_GREATER_ || nssv_COMPILER_MSVC_VER >= 1600) +#define nssv_CPP11_110 (nssv_CPP11_OR_GREATER_ || nssv_COMPILER_MSVC_VER >= 1700) +#define nssv_CPP11_120 (nssv_CPP11_OR_GREATER_ || nssv_COMPILER_MSVC_VER >= 1800) +#define nssv_CPP11_140 (nssv_CPP11_OR_GREATER_ || nssv_COMPILER_MSVC_VER >= 1900) +#define nssv_CPP11_141 (nssv_CPP11_OR_GREATER_ || nssv_COMPILER_MSVC_VER >= 1910) + +#define nssv_CPP14_000 (nssv_CPP14_OR_GREATER) +#define nssv_CPP17_000 (nssv_CPP17_OR_GREATER) + +// Presence of C++11 language features: + +#define nssv_HAVE_CONSTEXPR_11 nssv_CPP11_140 +#define nssv_HAVE_EXPLICIT_CONVERSION nssv_CPP11_140 +#define nssv_HAVE_INLINE_NAMESPACE nssv_CPP11_140 +#define nssv_HAVE_NOEXCEPT nssv_CPP11_140 +#define nssv_HAVE_NULLPTR nssv_CPP11_100 +#define nssv_HAVE_REF_QUALIFIER nssv_CPP11_140 +#define nssv_HAVE_UNICODE_LITERALS nssv_CPP11_140 +#define nssv_HAVE_USER_DEFINED_LITERALS nssv_CPP11_140 +#define nssv_HAVE_WCHAR16_T nssv_CPP11_100 +#define nssv_HAVE_WCHAR32_T nssv_CPP11_100 + +#if ! ( ( nssv_CPP11 && nssv_COMPILER_CLANG_VERSION ) || nssv_BETWEEN( nssv_COMPILER_CLANG_VERSION, 300, 400 ) ) +# define nssv_HAVE_STD_DEFINED_LITERALS nssv_CPP11_140 +#endif + +// Presence of C++14 language features: + +#define nssv_HAVE_CONSTEXPR_14 nssv_CPP14_000 + +// Presence of C++17 language features: + +#define nssv_HAVE_NODISCARD nssv_CPP17_000 + +// Presence of C++ library features: + +#define nssv_HAVE_STD_HASH nssv_CPP11_120 + +// C++ feature usage: + +#if nssv_HAVE_CONSTEXPR_11 +# define nssv_constexpr constexpr +#else +# define nssv_constexpr /*constexpr*/ +#endif + +#if nssv_HAVE_CONSTEXPR_14 +# define nssv_constexpr14 constexpr +#else +# define nssv_constexpr14 /*constexpr*/ +#endif + +#if nssv_HAVE_EXPLICIT_CONVERSION +# define nssv_explicit explicit +#else +# define nssv_explicit /*explicit*/ +#endif + +#if nssv_HAVE_INLINE_NAMESPACE +# define nssv_inline_ns inline +#else +# define nssv_inline_ns /*inline*/ +#endif + +#if nssv_HAVE_NOEXCEPT +# define nssv_noexcept noexcept +#else +# define nssv_noexcept /*noexcept*/ +#endif + +//#if nssv_HAVE_REF_QUALIFIER +//# define nssv_ref_qual & +//# define nssv_refref_qual && +//#else +//# define nssv_ref_qual /*&*/ +//# define nssv_refref_qual /*&&*/ +//#endif + +#if nssv_HAVE_NULLPTR +# define nssv_nullptr nullptr +#else +# define nssv_nullptr NULL +#endif + +#if nssv_HAVE_NODISCARD +# define nssv_nodiscard [[nodiscard]] +#else +# define nssv_nodiscard /*[[nodiscard]]*/ +#endif + +// Additional includes: + +#include <algorithm> +#include <cassert> +#include <iterator> +#include <limits> +#include <ostream> +#include <string> // std::char_traits<> + +#if ! nssv_CONFIG_NO_EXCEPTIONS +# include <stdexcept> +#endif + +#if nssv_CPP11_OR_GREATER +# include <type_traits> +#endif + +// Clang, GNUC, MSVC warning suppression macros: + +#if defined(__clang__) +# pragma clang diagnostic ignored "-Wreserved-user-defined-literal" +# pragma clang diagnostic push +# pragma clang diagnostic ignored "-Wuser-defined-literals" +#elif defined(__GNUC__) +# pragma GCC diagnostic push +# pragma GCC diagnostic ignored "-Wliteral-suffix" +#endif // __clang__ + +#if nssv_COMPILER_MSVC_VERSION >= 140 +# define nssv_SUPPRESS_MSGSL_WARNING(expr) [[gsl::suppress(expr)]] +# define nssv_SUPPRESS_MSVC_WARNING(code, descr) __pragma(warning(suppress: code) ) +# define nssv_DISABLE_MSVC_WARNINGS(codes) __pragma(warning(push)) __pragma(warning(disable: codes)) +#else +# define nssv_SUPPRESS_MSGSL_WARNING(expr) +# define nssv_SUPPRESS_MSVC_WARNING(code, descr) +# define nssv_DISABLE_MSVC_WARNINGS(codes) +#endif + +#if defined(__clang__) +# define nssv_RESTORE_WARNINGS() _Pragma("clang diagnostic pop") +#elif defined(__GNUC__) +# define nssv_RESTORE_WARNINGS() _Pragma("GCC diagnostic pop") +#elif nssv_COMPILER_MSVC_VERSION >= 140 +# define nssv_RESTORE_WARNINGS() __pragma(warning(pop )) +#else +# define nssv_RESTORE_WARNINGS() +#endif + +// Suppress the following MSVC (GSL) warnings: +// - C4455, non-gsl : 'operator ""sv': literal suffix identifiers that do not +// start with an underscore are reserved +// - C26472, gsl::t.1 : don't use a static_cast for arithmetic conversions; +// use brace initialization, gsl::narrow_cast or gsl::narow +// - C26481: gsl::b.1 : don't use pointer arithmetic. Use span instead + +nssv_DISABLE_MSVC_WARNINGS( 4455 26481 26472 ) +//nssv_DISABLE_CLANG_WARNINGS( "-Wuser-defined-literals" ) +//nssv_DISABLE_GNUC_WARNINGS( -Wliteral-suffix ) + +namespace nonstd { namespace sv_lite { + +template +< + class CharT, + class Traits = std::char_traits<CharT> +> +class basic_string_view; + +// +// basic_string_view: +// + +template +< + class CharT, + class Traits /* = std::char_traits<CharT> */ +> +class basic_string_view +{ +public: + // Member types: + + typedef Traits traits_type; + typedef CharT value_type; + + typedef CharT * pointer; + typedef CharT const * const_pointer; + typedef CharT & reference; + typedef CharT const & const_reference; + + typedef const_pointer iterator; + typedef const_pointer const_iterator; + typedef std::reverse_iterator< const_iterator > reverse_iterator; + typedef std::reverse_iterator< const_iterator > const_reverse_iterator; + + typedef std::size_t size_type; + typedef std::ptrdiff_t difference_type; + + // 24.4.2.1 Construction and assignment: + + nssv_constexpr basic_string_view() nssv_noexcept + : data_( nssv_nullptr ) + , size_( 0 ) + {} + +#if nssv_CPP11_OR_GREATER + nssv_constexpr basic_string_view( basic_string_view const & other ) nssv_noexcept = default; +#else + nssv_constexpr basic_string_view( basic_string_view const & other ) nssv_noexcept + : data_( other.data_) + , size_( other.size_) + {} +#endif + + nssv_constexpr basic_string_view( CharT const * s, size_type count ) + : data_( s ) + , size_( count ) + {} + + nssv_constexpr basic_string_view( CharT const * s) + : data_( s ) + , size_( Traits::length(s) ) + {} + + // Assignment: + +#if nssv_CPP11_OR_GREATER + nssv_constexpr14 basic_string_view & operator=( basic_string_view const & other ) nssv_noexcept = default; +#else + nssv_constexpr14 basic_string_view & operator=( basic_string_view const & other ) nssv_noexcept + { + data_ = other.data_; + size_ = other.size_; + return *this; + } +#endif + + // 24.4.2.2 Iterator support: + + nssv_constexpr const_iterator begin() const nssv_noexcept { return data_; } + nssv_constexpr const_iterator end() const nssv_noexcept { return data_ + size_; } + + nssv_constexpr const_iterator cbegin() const nssv_noexcept { return begin(); } + nssv_constexpr const_iterator cend() const nssv_noexcept { return end(); } + + nssv_constexpr const_reverse_iterator rbegin() const nssv_noexcept { return const_reverse_iterator( end() ); } + nssv_constexpr const_reverse_iterator rend() const nssv_noexcept { return const_reverse_iterator( begin() ); } + + nssv_constexpr const_reverse_iterator crbegin() const nssv_noexcept { return rbegin(); } + nssv_constexpr const_reverse_iterator crend() const nssv_noexcept { return rend(); } + + // 24.4.2.3 Capacity: + + nssv_constexpr size_type size() const nssv_noexcept { return size_; } + nssv_constexpr size_type length() const nssv_noexcept { return size_; } + nssv_constexpr size_type max_size() const nssv_noexcept { return (std::numeric_limits< size_type >::max)(); } + + // since C++20 + nssv_nodiscard nssv_constexpr bool empty() const nssv_noexcept + { + return 0 == size_; + } + + // 24.4.2.4 Element access: + + nssv_constexpr const_reference operator[]( size_type pos ) const + { + return data_at( pos ); + } + + nssv_constexpr14 const_reference at( size_type pos ) const + { +#if nssv_CONFIG_NO_EXCEPTIONS + assert( pos < size() ); +#else + if ( pos >= size() ) + { + throw std::out_of_range("nonst::string_view::at()"); + } +#endif + return data_at( pos ); + } + + nssv_constexpr const_reference front() const { return data_at( 0 ); } + nssv_constexpr const_reference back() const { return data_at( size() - 1 ); } + + nssv_constexpr const_pointer data() const nssv_noexcept { return data_; } + + // 24.4.2.5 Modifiers: + + nssv_constexpr14 void remove_prefix( size_type n ) + { + assert( n <= size() ); + data_ += n; + size_ -= n; + } + + nssv_constexpr14 void remove_suffix( size_type n ) + { + assert( n <= size() ); + size_ -= n; + } + + nssv_constexpr14 void swap( basic_string_view & other ) nssv_noexcept + { + using std::swap; + swap( data_, other.data_ ); + swap( size_, other.size_ ); + } + + // 24.4.2.6 String operations: + + size_type copy( CharT * dest, size_type n, size_type pos = 0 ) const + { +#if nssv_CONFIG_NO_EXCEPTIONS + assert( pos <= size() ); +#else + if ( pos > size() ) + { + throw std::out_of_range("nonst::string_view::copy()"); + } +#endif + const size_type rlen = (std::min)( n, size() - pos ); + + (void) Traits::copy( dest, data() + pos, rlen ); + + return rlen; + } + + nssv_constexpr14 basic_string_view substr( size_type pos = 0, size_type n = npos ) const + { +#if nssv_CONFIG_NO_EXCEPTIONS + assert( pos <= size() ); +#else + if ( pos > size() ) + { + throw std::out_of_range("nonst::string_view::substr()"); + } +#endif + return basic_string_view( data() + pos, (std::min)( n, size() - pos ) ); + } + + // compare(), 6x: + + nssv_constexpr14 int compare( basic_string_view other ) const nssv_noexcept // (1) + { + if ( const int result = Traits::compare( data(), other.data(), (std::min)( size(), other.size() ) ) ) + return result; + + return size() == other.size() ? 0 : size() < other.size() ? -1 : 1; + } + + nssv_constexpr int compare( size_type pos1, size_type n1, basic_string_view other ) const // (2) + { + return substr( pos1, n1 ).compare( other ); + } + + nssv_constexpr int compare( size_type pos1, size_type n1, basic_string_view other, size_type pos2, size_type n2 ) const // (3) + { + return substr( pos1, n1 ).compare( other.substr( pos2, n2 ) ); + } + + nssv_constexpr int compare( CharT const * s ) const // (4) + { + return compare( basic_string_view( s ) ); + } + + nssv_constexpr int compare( size_type pos1, size_type n1, CharT const * s ) const // (5) + { + return substr( pos1, n1 ).compare( basic_string_view( s ) ); + } + + nssv_constexpr int compare( size_type pos1, size_type n1, CharT const * s, size_type n2 ) const // (6) + { + return substr( pos1, n1 ).compare( basic_string_view( s, n2 ) ); + } + + // 24.4.2.7 Searching: + + // starts_with(), 3x, since C++20: + + nssv_constexpr bool starts_with( basic_string_view v ) const nssv_noexcept // (1) + { + return size() >= v.size() && compare( 0, v.size(), v ) == 0; + } + + nssv_constexpr bool starts_with( CharT c ) const nssv_noexcept // (2) + { + return starts_with( basic_string_view( &c, 1 ) ); + } + + nssv_constexpr bool starts_with( CharT const * s ) const // (3) + { + return starts_with( basic_string_view( s ) ); + } + + // ends_with(), 3x, since C++20: + + nssv_constexpr bool ends_with( basic_string_view v ) const nssv_noexcept // (1) + { + return size() >= v.size() && compare( size() - v.size(), npos, v ) == 0; + } + + nssv_constexpr bool ends_with( CharT c ) const nssv_noexcept // (2) + { + return ends_with( basic_string_view( &c, 1 ) ); + } + + nssv_constexpr bool ends_with( CharT const * s ) const // (3) + { + return ends_with( basic_string_view( s ) ); + } + + // find(), 4x: + + nssv_constexpr14 size_type find( basic_string_view v, size_type pos = 0 ) const nssv_noexcept // (1) + { + return assert( v.size() == 0 || v.data() != nssv_nullptr ) + , pos >= size() + ? npos + : to_pos( std::search( cbegin() + pos, cend(), v.cbegin(), v.cend(), Traits::eq ) ); + } + + nssv_constexpr14 size_type find( CharT c, size_type pos = 0 ) const nssv_noexcept // (2) + { + return find( basic_string_view( &c, 1 ), pos ); + } + + nssv_constexpr14 size_type find( CharT const * s, size_type pos, size_type n ) const // (3) + { + return find( basic_string_view( s, n ), pos ); + } + + nssv_constexpr14 size_type find( CharT const * s, size_type pos = 0 ) const // (4) + { + return find( basic_string_view( s ), pos ); + } + + // rfind(), 4x: + + nssv_constexpr14 size_type rfind( basic_string_view v, size_type pos = npos ) const nssv_noexcept // (1) + { + if ( size() < v.size() ) + return npos; + + if ( v.empty() ) + return (std::min)( size(), pos ); + + const_iterator last = cbegin() + (std::min)( size() - v.size(), pos ) + v.size(); + const_iterator result = std::find_end( cbegin(), last, v.cbegin(), v.cend(), Traits::eq ); + + return result != last ? size_type( result - cbegin() ) : npos; + } + + nssv_constexpr14 size_type rfind( CharT c, size_type pos = npos ) const nssv_noexcept // (2) + { + return rfind( basic_string_view( &c, 1 ), pos ); + } + + nssv_constexpr14 size_type rfind( CharT const * s, size_type pos, size_type n ) const // (3) + { + return rfind( basic_string_view( s, n ), pos ); + } + + nssv_constexpr14 size_type rfind( CharT const * s, size_type pos = npos ) const // (4) + { + return rfind( basic_string_view( s ), pos ); + } + + // find_first_of(), 4x: + + nssv_constexpr size_type find_first_of( basic_string_view v, size_type pos = 0 ) const nssv_noexcept // (1) + { + return pos >= size() + ? npos + : to_pos( std::find_first_of( cbegin() + pos, cend(), v.cbegin(), v.cend(), Traits::eq ) ); + } + + nssv_constexpr size_type find_first_of( CharT c, size_type pos = 0 ) const nssv_noexcept // (2) + { + return find_first_of( basic_string_view( &c, 1 ), pos ); + } + + nssv_constexpr size_type find_first_of( CharT const * s, size_type pos, size_type n ) const // (3) + { + return find_first_of( basic_string_view( s, n ), pos ); + } + + nssv_constexpr size_type find_first_of( CharT const * s, size_type pos = 0 ) const // (4) + { + return find_first_of( basic_string_view( s ), pos ); + } + + // find_last_of(), 4x: + + nssv_constexpr size_type find_last_of( basic_string_view v, size_type pos = npos ) const nssv_noexcept // (1) + { + return empty() + ? npos + : pos >= size() + ? find_last_of( v, size() - 1 ) + : to_pos( std::find_first_of( const_reverse_iterator( cbegin() + pos + 1 ), crend(), v.cbegin(), v.cend(), Traits::eq ) ); + } + + nssv_constexpr size_type find_last_of( CharT c, size_type pos = npos ) const nssv_noexcept // (2) + { + return find_last_of( basic_string_view( &c, 1 ), pos ); + } + + nssv_constexpr size_type find_last_of( CharT const * s, size_type pos, size_type count ) const // (3) + { + return find_last_of( basic_string_view( s, count ), pos ); + } + + nssv_constexpr size_type find_last_of( CharT const * s, size_type pos = npos ) const // (4) + { + return find_last_of( basic_string_view( s ), pos ); + } + + // find_first_not_of(), 4x: + + nssv_constexpr size_type find_first_not_of( basic_string_view v, size_type pos = 0 ) const nssv_noexcept // (1) + { + return pos >= size() + ? npos + : to_pos( std::find_if( cbegin() + pos, cend(), not_in_view( v ) ) ); + } + + nssv_constexpr size_type find_first_not_of( CharT c, size_type pos = 0 ) const nssv_noexcept // (2) + { + return find_first_not_of( basic_string_view( &c, 1 ), pos ); + } + + nssv_constexpr size_type find_first_not_of( CharT const * s, size_type pos, size_type count ) const // (3) + { + return find_first_not_of( basic_string_view( s, count ), pos ); + } + + nssv_constexpr size_type find_first_not_of( CharT const * s, size_type pos = 0 ) const // (4) + { + return find_first_not_of( basic_string_view( s ), pos ); + } + + // find_last_not_of(), 4x: + + nssv_constexpr size_type find_last_not_of( basic_string_view v, size_type pos = npos ) const nssv_noexcept // (1) + { + return empty() + ? npos + : pos >= size() + ? find_last_not_of( v, size() - 1 ) + : to_pos( std::find_if( const_reverse_iterator( cbegin() + pos + 1 ), crend(), not_in_view( v ) ) ); + } + + nssv_constexpr size_type find_last_not_of( CharT c, size_type pos = npos ) const nssv_noexcept // (2) + { + return find_last_not_of( basic_string_view( &c, 1 ), pos ); + } + + nssv_constexpr size_type find_last_not_of( CharT const * s, size_type pos, size_type count ) const // (3) + { + return find_last_not_of( basic_string_view( s, count ), pos ); + } + + nssv_constexpr size_type find_last_not_of( CharT const * s, size_type pos = npos ) const // (4) + { + return find_last_not_of( basic_string_view( s ), pos ); + } + + // Constants: + +#if nssv_CPP17_OR_GREATER + static nssv_constexpr size_type npos = size_type(-1); +#elif nssv_CPP11_OR_GREATER + enum : size_type { npos = size_type(-1) }; +#else + enum { npos = size_type(-1) }; +#endif + +private: + struct not_in_view + { + const basic_string_view v; + + nssv_constexpr not_in_view( basic_string_view v ) : v( v ) {} + + nssv_constexpr bool operator()( CharT c ) const + { + return npos == v.find_first_of( c ); + } + }; + + nssv_constexpr size_type to_pos( const_iterator it ) const + { + return it == cend() ? npos : size_type( it - cbegin() ); + } + + nssv_constexpr size_type to_pos( const_reverse_iterator it ) const + { + return it == crend() ? npos : size_type( crend() - it - 1 ); + } + + nssv_constexpr const_reference data_at( size_type pos ) const + { +#if nssv_BETWEEN( nssv_COMPILER_GNUC_VERSION, 1, 500 ) + return data_[pos]; +#else + return assert( pos < size() ), data_[pos]; +#endif + } + +private: + const_pointer data_; + size_type size_; + +public: +#if nssv_CONFIG_CONVERSION_STD_STRING_CLASS_METHODS + + template< class Allocator > + basic_string_view( std::basic_string<CharT, Traits, Allocator> const & s ) nssv_noexcept + : data_( s.data() ) + , size_( s.size() ) + {} + +#if nssv_HAVE_EXPLICIT_CONVERSION + + template< class Allocator > + explicit operator std::basic_string<CharT, Traits, Allocator>() const + { + return to_string( Allocator() ); + } + +#endif // nssv_HAVE_EXPLICIT_CONVERSION + +#if nssv_CPP11_OR_GREATER + + template< class Allocator = std::allocator<CharT> > + std::basic_string<CharT, Traits, Allocator> + to_string( Allocator const & a = Allocator() ) const + { + return std::basic_string<CharT, Traits, Allocator>( begin(), end(), a ); + } + +#else + + std::basic_string<CharT, Traits> + to_string() const + { + return std::basic_string<CharT, Traits>( begin(), end() ); + } + + template< class Allocator > + std::basic_string<CharT, Traits, Allocator> + to_string( Allocator const & a ) const + { + return std::basic_string<CharT, Traits, Allocator>( begin(), end(), a ); + } + +#endif // nssv_CPP11_OR_GREATER + +#endif // nssv_CONFIG_CONVERSION_STD_STRING_CLASS_METHODS +}; + +// +// Non-member functions: +// + +// 24.4.3 Non-member comparison functions: +// lexicographically compare two string views (function template): + +template< class CharT, class Traits > +nssv_constexpr bool operator== ( + basic_string_view <CharT, Traits> lhs, + basic_string_view <CharT, Traits> rhs ) nssv_noexcept +{ return lhs.compare( rhs ) == 0 ; } + +template< class CharT, class Traits > +nssv_constexpr bool operator!= ( + basic_string_view <CharT, Traits> lhs, + basic_string_view <CharT, Traits> rhs ) nssv_noexcept +{ return lhs.compare( rhs ) != 0 ; } + +template< class CharT, class Traits > +nssv_constexpr bool operator< ( + basic_string_view <CharT, Traits> lhs, + basic_string_view <CharT, Traits> rhs ) nssv_noexcept +{ return lhs.compare( rhs ) < 0 ; } + +template< class CharT, class Traits > +nssv_constexpr bool operator<= ( + basic_string_view <CharT, Traits> lhs, + basic_string_view <CharT, Traits> rhs ) nssv_noexcept +{ return lhs.compare( rhs ) <= 0 ; } + +template< class CharT, class Traits > +nssv_constexpr bool operator> ( + basic_string_view <CharT, Traits> lhs, + basic_string_view <CharT, Traits> rhs ) nssv_noexcept +{ return lhs.compare( rhs ) > 0 ; } + +template< class CharT, class Traits > +nssv_constexpr bool operator>= ( + basic_string_view <CharT, Traits> lhs, + basic_string_view <CharT, Traits> rhs ) nssv_noexcept +{ return lhs.compare( rhs ) >= 0 ; } + +// Let S be basic_string_view<CharT, Traits>, and sv be an instance of S. +// Implementations shall provide sufficient additional overloads marked +// constexpr and noexcept so that an object t with an implicit conversion +// to S can be compared according to Table 67. + +#if nssv_CPP11_OR_GREATER && ! nssv_BETWEEN( nssv_COMPILER_MSVC_VERSION, 100, 141 ) + +#define nssv_BASIC_STRING_VIEW_I(T,U) typename std::decay< basic_string_view<T,U> >::type + +#if nssv_BETWEEN( nssv_COMPILER_MSVC_VERSION, 140, 150 ) +# define nssv_MSVC_ORDER(x) , int=x +#else +# define nssv_MSVC_ORDER(x) /*, int=x*/ +#endif + +// == + +template< class CharT, class Traits nssv_MSVC_ORDER(1) > +nssv_constexpr bool operator==( + basic_string_view <CharT, Traits> lhs, + nssv_BASIC_STRING_VIEW_I(CharT, Traits) rhs ) nssv_noexcept +{ return lhs.compare( rhs ) == 0; } + +template< class CharT, class Traits nssv_MSVC_ORDER(2) > +nssv_constexpr bool operator==( + nssv_BASIC_STRING_VIEW_I(CharT, Traits) lhs, + basic_string_view <CharT, Traits> rhs ) nssv_noexcept +{ return lhs.size() == rhs.size() && lhs.compare( rhs ) == 0; } + +// != + +template< class CharT, class Traits nssv_MSVC_ORDER(1) > +nssv_constexpr bool operator!= ( + basic_string_view < CharT, Traits > lhs, + nssv_BASIC_STRING_VIEW_I( CharT, Traits ) rhs ) nssv_noexcept +{ return lhs.size() != rhs.size() || lhs.compare( rhs ) != 0 ; } + +template< class CharT, class Traits nssv_MSVC_ORDER(2) > +nssv_constexpr bool operator!= ( + nssv_BASIC_STRING_VIEW_I( CharT, Traits ) lhs, + basic_string_view < CharT, Traits > rhs ) nssv_noexcept +{ return lhs.compare( rhs ) != 0 ; } + +// < + +template< class CharT, class Traits nssv_MSVC_ORDER(1) > +nssv_constexpr bool operator< ( + basic_string_view < CharT, Traits > lhs, + nssv_BASIC_STRING_VIEW_I( CharT, Traits ) rhs ) nssv_noexcept +{ return lhs.compare( rhs ) < 0 ; } + +template< class CharT, class Traits nssv_MSVC_ORDER(2) > +nssv_constexpr bool operator< ( + nssv_BASIC_STRING_VIEW_I( CharT, Traits ) lhs, + basic_string_view < CharT, Traits > rhs ) nssv_noexcept +{ return lhs.compare( rhs ) < 0 ; } + +// <= + +template< class CharT, class Traits nssv_MSVC_ORDER(1) > +nssv_constexpr bool operator<= ( + basic_string_view < CharT, Traits > lhs, + nssv_BASIC_STRING_VIEW_I( CharT, Traits ) rhs ) nssv_noexcept +{ return lhs.compare( rhs ) <= 0 ; } + +template< class CharT, class Traits nssv_MSVC_ORDER(2) > +nssv_constexpr bool operator<= ( + nssv_BASIC_STRING_VIEW_I( CharT, Traits ) lhs, + basic_string_view < CharT, Traits > rhs ) nssv_noexcept +{ return lhs.compare( rhs ) <= 0 ; } + +// > + +template< class CharT, class Traits nssv_MSVC_ORDER(1) > +nssv_constexpr bool operator> ( + basic_string_view < CharT, Traits > lhs, + nssv_BASIC_STRING_VIEW_I( CharT, Traits ) rhs ) nssv_noexcept +{ return lhs.compare( rhs ) > 0 ; } + +template< class CharT, class Traits nssv_MSVC_ORDER(2) > +nssv_constexpr bool operator> ( + nssv_BASIC_STRING_VIEW_I( CharT, Traits ) lhs, + basic_string_view < CharT, Traits > rhs ) nssv_noexcept +{ return lhs.compare( rhs ) > 0 ; } + +// >= + +template< class CharT, class Traits nssv_MSVC_ORDER(1) > +nssv_constexpr bool operator>= ( + basic_string_view < CharT, Traits > lhs, + nssv_BASIC_STRING_VIEW_I( CharT, Traits ) rhs ) nssv_noexcept +{ return lhs.compare( rhs ) >= 0 ; } + +template< class CharT, class Traits nssv_MSVC_ORDER(2) > +nssv_constexpr bool operator>= ( + nssv_BASIC_STRING_VIEW_I( CharT, Traits ) lhs, + basic_string_view < CharT, Traits > rhs ) nssv_noexcept +{ return lhs.compare( rhs ) >= 0 ; } + +#undef nssv_MSVC_ORDER +#undef nssv_BASIC_STRING_VIEW_I + +#endif // nssv_CPP11_OR_GREATER + +// 24.4.4 Inserters and extractors: + +namespace detail { + +template< class Stream > +void write_padding( Stream & os, std::streamsize n ) +{ + for ( std::streamsize i = 0; i < n; ++i ) + os.rdbuf()->sputc( os.fill() ); +} + +template< class Stream, class View > +Stream & write_to_stream( Stream & os, View const & sv ) +{ + typename Stream::sentry sentry( os ); + + if ( !os ) + return os; + + const std::streamsize length = static_cast<std::streamsize>( sv.length() ); + + // Whether, and how, to pad: + const bool pad = ( length < os.width() ); + const bool left_pad = pad && ( os.flags() & std::ios_base::adjustfield ) == std::ios_base::right; + + if ( left_pad ) + write_padding( os, os.width() - length ); + + // Write span characters: + os.rdbuf()->sputn( sv.begin(), length ); + + if ( pad && !left_pad ) + write_padding( os, os.width() - length ); + + // Reset output stream width: + os.width( 0 ); + + return os; +} + +} // namespace detail + +template< class CharT, class Traits > +std::basic_ostream<CharT, Traits> & +operator<<( + std::basic_ostream<CharT, Traits>& os, + basic_string_view <CharT, Traits> sv ) +{ + return detail::write_to_stream( os, sv ); +} + +// Several typedefs for common character types are provided: + +typedef basic_string_view<char> string_view; +typedef basic_string_view<wchar_t> wstring_view; +#if nssv_HAVE_WCHAR16_T +typedef basic_string_view<char16_t> u16string_view; +typedef basic_string_view<char32_t> u32string_view; +#endif + +}} // namespace nonstd::sv_lite + +// +// 24.4.6 Suffix for basic_string_view literals: +// + +#if nssv_HAVE_USER_DEFINED_LITERALS + +namespace nonstd { +nssv_inline_ns namespace literals { +nssv_inline_ns namespace string_view_literals { + +#if nssv_CONFIG_STD_SV_OPERATOR && nssv_HAVE_STD_DEFINED_LITERALS + +nssv_constexpr nonstd::sv_lite::string_view operator "" sv( const char* str, size_t len ) nssv_noexcept // (1) +{ + return nonstd::sv_lite::string_view{ str, len }; +} + +nssv_constexpr nonstd::sv_lite::u16string_view operator "" sv( const char16_t* str, size_t len ) nssv_noexcept // (2) +{ + return nonstd::sv_lite::u16string_view{ str, len }; +} + +nssv_constexpr nonstd::sv_lite::u32string_view operator "" sv( const char32_t* str, size_t len ) nssv_noexcept // (3) +{ + return nonstd::sv_lite::u32string_view{ str, len }; +} + +nssv_constexpr nonstd::sv_lite::wstring_view operator "" sv( const wchar_t* str, size_t len ) nssv_noexcept // (4) +{ + return nonstd::sv_lite::wstring_view{ str, len }; +} + +#endif // nssv_CONFIG_STD_SV_OPERATOR && nssv_HAVE_STD_DEFINED_LITERALS + +#if nssv_CONFIG_USR_SV_OPERATOR + +nssv_constexpr nonstd::sv_lite::string_view operator "" _sv( const char* str, size_t len ) nssv_noexcept // (1) +{ + return nonstd::sv_lite::string_view{ str, len }; +} + +nssv_constexpr nonstd::sv_lite::u16string_view operator "" _sv( const char16_t* str, size_t len ) nssv_noexcept // (2) +{ + return nonstd::sv_lite::u16string_view{ str, len }; +} + +nssv_constexpr nonstd::sv_lite::u32string_view operator "" _sv( const char32_t* str, size_t len ) nssv_noexcept // (3) +{ + return nonstd::sv_lite::u32string_view{ str, len }; +} + +nssv_constexpr nonstd::sv_lite::wstring_view operator "" _sv( const wchar_t* str, size_t len ) nssv_noexcept // (4) +{ + return nonstd::sv_lite::wstring_view{ str, len }; +} + +#endif // nssv_CONFIG_USR_SV_OPERATOR + +}}} // namespace nonstd::literals::string_view_literals + +#endif + +// +// Extensions for std::string: +// + +#if nssv_CONFIG_CONVERSION_STD_STRING_FREE_FUNCTIONS + +namespace nonstd { +namespace sv_lite { + +// Exclude MSVC 14 (19.00): it yields ambiguous to_string(): + +#if nssv_CPP11_OR_GREATER && nssv_COMPILER_MSVC_VERSION != 140 + +template< class CharT, class Traits, class Allocator = std::allocator<CharT> > +std::basic_string<CharT, Traits, Allocator> +to_string( basic_string_view<CharT, Traits> v, Allocator const & a = Allocator() ) +{ + return std::basic_string<CharT,Traits, Allocator>( v.begin(), v.end(), a ); +} + +#else + +template< class CharT, class Traits > +std::basic_string<CharT, Traits> +to_string( basic_string_view<CharT, Traits> v ) +{ + return std::basic_string<CharT, Traits>( v.begin(), v.end() ); +} + +template< class CharT, class Traits, class Allocator > +std::basic_string<CharT, Traits, Allocator> +to_string( basic_string_view<CharT, Traits> v, Allocator const & a ) +{ + return std::basic_string<CharT, Traits, Allocator>( v.begin(), v.end(), a ); +} + +#endif // nssv_CPP11_OR_GREATER + +template< class CharT, class Traits, class Allocator > +basic_string_view<CharT, Traits> +to_string_view( std::basic_string<CharT, Traits, Allocator> const & s ) +{ + return basic_string_view<CharT, Traits>( s.data(), s.size() ); +} + +}} // namespace nonstd::sv_lite + +#endif // nssv_CONFIG_CONVERSION_STD_STRING_FREE_FUNCTIONS + +// +// make types and algorithms available in namespace nonstd: +// + +namespace nonstd { + +using sv_lite::basic_string_view; +using sv_lite::string_view; +using sv_lite::wstring_view; + +#if nssv_HAVE_WCHAR16_T +using sv_lite::u16string_view; +#endif +#if nssv_HAVE_WCHAR32_T +using sv_lite::u32string_view; +#endif + +// literal "sv" + +using sv_lite::operator==; +using sv_lite::operator!=; +using sv_lite::operator<; +using sv_lite::operator<=; +using sv_lite::operator>; +using sv_lite::operator>=; + +using sv_lite::operator<<; + +#if nssv_CONFIG_CONVERSION_STD_STRING_FREE_FUNCTIONS +using sv_lite::to_string; +using sv_lite::to_string_view; +#endif + +} // namespace nonstd + +// 24.4.5 Hash support (C++11): + +// Note: The hash value of a string view object is equal to the hash value of +// the corresponding string object. + +#if nssv_HAVE_STD_HASH + +#include <functional> + +namespace std { + +template<> +struct hash< nonstd::string_view > +{ +public: + std::size_t operator()( nonstd::string_view v ) const nssv_noexcept + { + return std::hash<std::string>()( std::string( v.data(), v.size() ) ); + } +}; + +template<> +struct hash< nonstd::wstring_view > +{ +public: + std::size_t operator()( nonstd::wstring_view v ) const nssv_noexcept + { + return std::hash<std::wstring>()( std::wstring( v.data(), v.size() ) ); + } +}; + +template<> +struct hash< nonstd::u16string_view > +{ +public: + std::size_t operator()( nonstd::u16string_view v ) const nssv_noexcept + { + return std::hash<std::u16string>()( std::u16string( v.data(), v.size() ) ); + } +}; + +template<> +struct hash< nonstd::u32string_view > +{ +public: + std::size_t operator()( nonstd::u32string_view v ) const nssv_noexcept + { + return std::hash<std::u32string>()( std::u32string( v.data(), v.size() ) ); + } +}; + +} // namespace std + +#endif // nssv_HAVE_STD_HASH + +nssv_RESTORE_WARNINGS() + +#endif // nssv_HAVE_STD_STRING_VIEW +#endif // NONSTD_SV_LITE_H_INCLUDED + + + +namespace inja { + +enum class ElementNotation { + Dot, + Pointer +}; + +struct LexerConfig { + std::string statement_open {"{%"}; + std::string statement_close {"%}"}; + std::string line_statement {"##"}; + std::string expression_open {"{{"}; + std::string expression_close {"}}"}; + std::string comment_open {"{#"}; + std::string comment_close {"#}"}; + std::string open_chars {"#{"}; + + void update_open_chars() { + open_chars = ""; + if (open_chars.find(line_statement[0]) == std::string::npos) { + open_chars += line_statement[0]; + } + if (open_chars.find(statement_open[0]) == std::string::npos) { + open_chars += statement_open[0]; + } + if (open_chars.find(expression_open[0]) == std::string::npos) { + open_chars += expression_open[0]; + } + if (open_chars.find(comment_open[0]) == std::string::npos) { + open_chars += comment_open[0]; + } + } +}; + +struct ParserConfig { + ElementNotation notation {ElementNotation::Dot}; +}; + +} + +#endif // PANTOR_INJA_CONFIG_HPP + +// #include "function_storage.hpp" +#ifndef PANTOR_INJA_FUNCTION_STORAGE_HPP +#define PANTOR_INJA_FUNCTION_STORAGE_HPP + +// #include "bytecode.hpp" +#ifndef PANTOR_INJA_BYTECODE_HPP +#define PANTOR_INJA_BYTECODE_HPP + +#include <utility> + +#include <nlohmann/json.hpp> + +// #include "string_view.hpp" + + + +namespace inja { + +using namespace nlohmann; + + +struct Bytecode { + enum class Op : uint8_t { + Nop, + // print StringRef (always immediate) + PrintText, + // print value + PrintValue, + // push value onto stack (always immediate) + Push, + + // builtin functions + // result is pushed to stack + // args specify number of arguments + // all functions can take their "last" argument either immediate + // or popped off stack (e.g. if immediate, it's like the immediate was + // just pushed to the stack) + Not, + And, + Or, + In, + Equal, + Greater, + GreaterEqual, + Less, + LessEqual, + Different, + DivisibleBy, + Even, + First, + Float, + Int, + Last, + Length, + Lower, + Max, + Min, + Odd, + Range, + Result, + Round, + Sort, + Upper, + Exists, + ExistsInObject, + IsBoolean, + IsNumber, + IsInteger, + IsFloat, + IsObject, + IsArray, + IsString, + Default, + + // include another template + // value is the template name + Include, + + // callback function + // str is the function name (this means it cannot be a lookup) + // args specify number of arguments + // as with builtin functions, "last" argument can be immediate + Callback, + + // unconditional jump + // args is the index of the bytecode to jump to. + Jump, + + // conditional jump + // value popped off stack is checked for truthyness + // if false, args is the index of the bytecode to jump to. + // if true, no action is taken (falls through) + ConditionalJump, + + // start loop + // value popped off stack is what is iterated over + // args is index of bytecode after end loop (jumped to if iterable is + // empty) + // immediate value is key name (for maps) + // str is value name + StartLoop, + + // end a loop + // args is index of the first bytecode in the loop body + EndLoop, + }; + + enum Flag { + // location of value for value-taking ops (mask) + ValueMask = 0x03, + // pop value off stack + ValuePop = 0x00, + // value is immediate rather than on stack + ValueImmediate = 0x01, + // lookup immediate str (dot notation) + ValueLookupDot = 0x02, + // lookup immediate str (json pointer notation) + ValueLookupPointer = 0x03, + }; + + Op op {Op::Nop}; + uint32_t args: 30; + uint32_t flags: 2; + + json value; + std::string str; + + Bytecode(): args(0), flags(0) {} + explicit Bytecode(Op op, unsigned int args = 0): op(op), args(args), flags(0) {} + explicit Bytecode(Op op, nonstd::string_view str, unsigned int flags): op(op), args(0), flags(flags), str(str) {} + explicit Bytecode(Op op, json&& value, unsigned int flags): op(op), args(0), flags(flags), value(std::move(value)) {} +}; + +} // namespace inja + +#endif // PANTOR_INJA_BYTECODE_HPP + +// #include "string_view.hpp" + + + +namespace inja { + +using namespace nlohmann; + +using Arguments = std::vector<const json*>; +using CallbackFunction = std::function<json(Arguments& args)>; + +class FunctionStorage { + public: + void add_builtin(nonstd::string_view name, unsigned int num_args, Bytecode::Op op) { + auto& data = get_or_new(name, num_args); + data.op = op; + } + + void add_callback(nonstd::string_view name, unsigned int num_args, const CallbackFunction& function) { + auto& data = get_or_new(name, num_args); + data.function = function; + } + + Bytecode::Op find_builtin(nonstd::string_view name, unsigned int num_args) const { + if (auto ptr = get(name, num_args)) { + return ptr->op; + } + return Bytecode::Op::Nop; + } + + CallbackFunction find_callback(nonstd::string_view name, unsigned int num_args) const { + if (auto ptr = get(name, num_args)) { + return ptr->function; + } + return nullptr; + } + + private: + struct FunctionData { + unsigned int num_args {0}; + Bytecode::Op op {Bytecode::Op::Nop}; // for builtins + CallbackFunction function; // for callbacks + }; + + FunctionData& get_or_new(nonstd::string_view name, unsigned int num_args) { + auto &vec = m_map[static_cast<std::string>(name)]; + for (auto &i: vec) { + if (i.num_args == num_args) return i; + } + vec.emplace_back(); + vec.back().num_args = num_args; + return vec.back(); + } + + const FunctionData* get(nonstd::string_view name, unsigned int num_args) const { + auto it = m_map.find(static_cast<std::string>(name)); + if (it == m_map.end()) return nullptr; + for (auto &&i: it->second) { + if (i.num_args == num_args) return &i; + } + return nullptr; + } + + std::map<std::string, std::vector<FunctionData>> m_map; +}; + +} + +#endif // PANTOR_INJA_FUNCTION_STORAGE_HPP + +// #include "parser.hpp" +#ifndef PANTOR_INJA_PARSER_HPP +#define PANTOR_INJA_PARSER_HPP + +#include <limits> + +// #include "bytecode.hpp" + +// #include "config.hpp" + +// #include "function_storage.hpp" + +// #include "lexer.hpp" +#ifndef PANTOR_INJA_LEXER_HPP +#define PANTOR_INJA_LEXER_HPP + +#include <cctype> +#include <locale> + +// #include "config.hpp" + +// #include "token.hpp" +#ifndef PANTOR_INJA_TOKEN_HPP +#define PANTOR_INJA_TOKEN_HPP + +// #include "string_view.hpp" + + + +namespace inja { + +struct Token { + enum class Kind { + Text, + ExpressionOpen, // {{ + ExpressionClose, // }} + LineStatementOpen, // ## + LineStatementClose, // \n + StatementOpen, // {% + StatementClose, // %} + CommentOpen, // {# + CommentClose, // #} + Id, // this, this.foo + Number, // 1, 2, -1, 5.2, -5.3 + String, // "this" + Comma, // , + Colon, // : + LeftParen, // ( + RightParen, // ) + LeftBracket, // [ + RightBracket, // ] + LeftBrace, // { + RightBrace, // } + Equal, // == + GreaterThan, // > + GreaterEqual, // >= + LessThan, // < + LessEqual, // <= + NotEqual, // != + Unknown, + Eof + } kind {Kind::Unknown}; + + nonstd::string_view text; + + constexpr Token() = default; + constexpr Token(Kind kind, nonstd::string_view text): kind(kind), text(text) {} + + std::string describe() const { + switch (kind) { + case Kind::Text: + return "<text>"; + case Kind::LineStatementClose: + return "<eol>"; + case Kind::Eof: + return "<eof>"; + default: + return static_cast<std::string>(text); + } + } +}; + +} + +#endif // PANTOR_INJA_TOKEN_HPP + +// #include "utils.hpp" +#ifndef PANTOR_INJA_UTILS_HPP +#define PANTOR_INJA_UTILS_HPP + +#include <stdexcept> + +// #include "string_view.hpp" + + + +namespace inja { + +inline void inja_throw(const std::string& type, const std::string& message) { + throw std::runtime_error("[inja.exception." + type + "] " + message); +} + +namespace string_view { + inline nonstd::string_view slice(nonstd::string_view view, size_t start, size_t end) { + start = std::min(start, view.size()); + end = std::min(std::max(start, end), view.size()); + return view.substr(start, end - start); // StringRef(Data + Start, End - Start); + } + + inline std::pair<nonstd::string_view, nonstd::string_view> split(nonstd::string_view view, char Separator) { + size_t idx = view.find(Separator); + if (idx == nonstd::string_view::npos) { + return std::make_pair(view, nonstd::string_view()); + } + return std::make_pair(slice(view, 0, idx), slice(view, idx + 1, nonstd::string_view::npos)); + } + + inline bool starts_with(nonstd::string_view view, nonstd::string_view prefix) { + return (view.size() >= prefix.size() && view.compare(0, prefix.size(), prefix) == 0); + } +} // namespace string + +} // namespace inja + +#endif // PANTOR_INJA_UTILS_HPP + + + +namespace inja { + +class Lexer { + enum class State { + Text, + ExpressionStart, + ExpressionBody, + LineStart, + LineBody, + StatementStart, + StatementBody, + CommentStart, + CommentBody + } m_state; + + const LexerConfig& m_config; + nonstd::string_view m_in; + size_t m_tok_start; + size_t m_pos; + + public: + explicit Lexer(const LexerConfig& config) : m_config(config) {} + + void start(nonstd::string_view in) { + m_in = in; + m_tok_start = 0; + m_pos = 0; + m_state = State::Text; + } + + Token scan() { + m_tok_start = m_pos; + + again: + if (m_tok_start >= m_in.size()) return make_token(Token::Kind::Eof); + + switch (m_state) { + default: + case State::Text: { + // fast-scan to first open character + size_t open_start = m_in.substr(m_pos).find_first_of(m_config.open_chars); + if (open_start == nonstd::string_view::npos) { + // didn't find open, return remaining text as text token + m_pos = m_in.size(); + return make_token(Token::Kind::Text); + } + m_pos += open_start; + + // try to match one of the opening sequences, and get the close + nonstd::string_view open_str = m_in.substr(m_pos); + if (inja::string_view::starts_with(open_str, m_config.expression_open)) { + m_state = State::ExpressionStart; + } else if (inja::string_view::starts_with(open_str, m_config.statement_open)) { + m_state = State::StatementStart; + } else if (inja::string_view::starts_with(open_str, m_config.comment_open)) { + m_state = State::CommentStart; + } else if ((m_pos == 0 || m_in[m_pos - 1] == '\n') && + inja::string_view::starts_with(open_str, m_config.line_statement)) { + m_state = State::LineStart; + } else { + m_pos += 1; // wasn't actually an opening sequence + goto again; + } + if (m_pos == m_tok_start) goto again; // don't generate empty token + return make_token(Token::Kind::Text); + } + case State::ExpressionStart: { + m_state = State::ExpressionBody; + m_pos += m_config.expression_open.size(); + return make_token(Token::Kind::ExpressionOpen); + } + case State::LineStart: { + m_state = State::LineBody; + m_pos += m_config.line_statement.size(); + return make_token(Token::Kind::LineStatementOpen); + } + case State::StatementStart: { + m_state = State::StatementBody; + m_pos += m_config.statement_open.size(); + return make_token(Token::Kind::StatementOpen); + } + case State::CommentStart: { + m_state = State::CommentBody; + m_pos += m_config.comment_open.size(); + return make_token(Token::Kind::CommentOpen); + } + case State::ExpressionBody: + return scan_body(m_config.expression_close, Token::Kind::ExpressionClose); + case State::LineBody: + return scan_body("\n", Token::Kind::LineStatementClose); + case State::StatementBody: + return scan_body(m_config.statement_close, Token::Kind::StatementClose); + case State::CommentBody: { + // fast-scan to comment close + size_t end = m_in.substr(m_pos).find(m_config.comment_close); + if (end == nonstd::string_view::npos) { + m_pos = m_in.size(); + return make_token(Token::Kind::Eof); + } + // return the entire comment in the close token + m_state = State::Text; + m_pos += end + m_config.comment_close.size(); + return make_token(Token::Kind::CommentClose); + } + } + } + + const LexerConfig& get_config() const { return m_config; } + + private: + Token scan_body(nonstd::string_view close, Token::Kind closeKind) { + again: + // skip whitespace (except for \n as it might be a close) + if (m_tok_start >= m_in.size()) return make_token(Token::Kind::Eof); + char ch = m_in[m_tok_start]; + if (ch == ' ' || ch == '\t' || ch == '\r') { + m_tok_start += 1; + goto again; + } + + // check for close + if (inja::string_view::starts_with(m_in.substr(m_tok_start), close)) { + m_state = State::Text; + m_pos = m_tok_start + close.size(); + return make_token(closeKind); + } + + // skip \n + if (ch == '\n') { + m_tok_start += 1; + goto again; + } + + m_pos = m_tok_start + 1; + if (std::isalpha(ch)) return scan_id(); + switch (ch) { + case ',': + return make_token(Token::Kind::Comma); + case ':': + return make_token(Token::Kind::Colon); + case '(': + return make_token(Token::Kind::LeftParen); + case ')': + return make_token(Token::Kind::RightParen); + case '[': + return make_token(Token::Kind::LeftBracket); + case ']': + return make_token(Token::Kind::RightBracket); + case '{': + return make_token(Token::Kind::LeftBrace); + case '}': + return make_token(Token::Kind::RightBrace); + case '>': + if (m_pos < m_in.size() && m_in[m_pos] == '=') { + m_pos += 1; + return make_token(Token::Kind::GreaterEqual); + } + return make_token(Token::Kind::GreaterThan); + case '<': + if (m_pos < m_in.size() && m_in[m_pos] == '=') { + m_pos += 1; + return make_token(Token::Kind::LessEqual); + } + return make_token(Token::Kind::LessThan); + case '=': + if (m_pos < m_in.size() && m_in[m_pos] == '=') { + m_pos += 1; + return make_token(Token::Kind::Equal); + } + return make_token(Token::Kind::Unknown); + case '!': + if (m_pos < m_in.size() && m_in[m_pos] == '=') { + m_pos += 1; + return make_token(Token::Kind::NotEqual); + } + return make_token(Token::Kind::Unknown); + case '\"': + return scan_string(); + case '0': + case '1': + case '2': + case '3': + case '4': + case '5': + case '6': + case '7': + case '8': + case '9': + case '-': + return scan_number(); + case '_': + return scan_id(); + default: + return make_token(Token::Kind::Unknown); + } + } + + Token scan_id() { + for (;;) { + if (m_pos >= m_in.size()) { + break; + } + char ch = m_in[m_pos]; + if (!std::isalnum(ch) && ch != '.' && ch != '/' && ch != '_' && ch != '-') { + break; + } + m_pos += 1; + } + return make_token(Token::Kind::Id); + } + + Token scan_number() { + for (;;) { + if (m_pos >= m_in.size()) { + break; + } + char ch = m_in[m_pos]; + // be very permissive in lexer (we'll catch errors when conversion happens) + if (!std::isdigit(ch) && ch != '.' && ch != 'e' && ch != 'E' && ch != '+' && ch != '-') { + break; + } + m_pos += 1; + } + return make_token(Token::Kind::Number); + } + + Token scan_string() { + bool escape {false}; + for (;;) { + if (m_pos >= m_in.size()) break; + char ch = m_in[m_pos++]; + if (ch == '\\') { + escape = true; + } else if (!escape && ch == m_in[m_tok_start]) { + break; + } else { + escape = false; + } + } + return make_token(Token::Kind::String); + } + + Token make_token(Token::Kind kind) const { + return Token(kind, string_view::slice(m_in, m_tok_start, m_pos)); + } +}; + +} + +#endif // PANTOR_INJA_LEXER_HPP + +// #include "template.hpp" +#ifndef PANTOR_INJA_TEMPLATE_HPP +#define PANTOR_INJA_TEMPLATE_HPP + +#include <string> +#include <vector> + +// #include "bytecode.hpp" + + + +namespace inja { + +struct Template { + std::vector<Bytecode> bytecodes; + std::string content; +}; + +using TemplateStorage = std::map<std::string, Template>; + +} + +#endif // PANTOR_INJA_TEMPLATE_HPP + +// #include "token.hpp" + +// #include "utils.hpp" + + +#include <nlohmann/json.hpp> + + +namespace inja { + +class ParserStatic { + ParserStatic() { + functions.add_builtin("default", 2, Bytecode::Op::Default); + functions.add_builtin("divisibleBy", 2, Bytecode::Op::DivisibleBy); + functions.add_builtin("even", 1, Bytecode::Op::Even); + functions.add_builtin("first", 1, Bytecode::Op::First); + functions.add_builtin("float", 1, Bytecode::Op::Float); + functions.add_builtin("int", 1, Bytecode::Op::Int); + functions.add_builtin("last", 1, Bytecode::Op::Last); + functions.add_builtin("length", 1, Bytecode::Op::Length); + functions.add_builtin("lower", 1, Bytecode::Op::Lower); + functions.add_builtin("max", 1, Bytecode::Op::Max); + functions.add_builtin("min", 1, Bytecode::Op::Min); + functions.add_builtin("odd", 1, Bytecode::Op::Odd); + functions.add_builtin("range", 1, Bytecode::Op::Range); + functions.add_builtin("round", 2, Bytecode::Op::Round); + functions.add_builtin("sort", 1, Bytecode::Op::Sort); + functions.add_builtin("upper", 1, Bytecode::Op::Upper); + functions.add_builtin("exists", 1, Bytecode::Op::Exists); + functions.add_builtin("existsIn", 2, Bytecode::Op::ExistsInObject); + functions.add_builtin("isBoolean", 1, Bytecode::Op::IsBoolean); + functions.add_builtin("isNumber", 1, Bytecode::Op::IsNumber); + functions.add_builtin("isInteger", 1, Bytecode::Op::IsInteger); + functions.add_builtin("isFloat", 1, Bytecode::Op::IsFloat); + functions.add_builtin("isObject", 1, Bytecode::Op::IsObject); + functions.add_builtin("isArray", 1, Bytecode::Op::IsArray); + functions.add_builtin("isString", 1, Bytecode::Op::IsString); + } + + public: + ParserStatic(const ParserStatic&) = delete; + ParserStatic& operator=(const ParserStatic&) = delete; + + static const ParserStatic& get_instance() { + static ParserStatic inst; + return inst; + } + + FunctionStorage functions; +}; + +class Parser { + public: + explicit Parser(const ParserConfig& parser_config, const LexerConfig& lexer_config, TemplateStorage& included_templates): m_config(parser_config), m_lexer(lexer_config), m_included_templates(included_templates), m_static(ParserStatic::get_instance()) { } + + bool parse_expression(Template& tmpl) { + if (!parse_expression_and(tmpl)) return false; + if (m_tok.kind != Token::Kind::Id || m_tok.text != "or") return true; + get_next_token(); + if (!parse_expression_and(tmpl)) return false; + append_function(tmpl, Bytecode::Op::Or, 2); + return true; + } + + bool parse_expression_and(Template& tmpl) { + if (!parse_expression_not(tmpl)) return false; + if (m_tok.kind != Token::Kind::Id || m_tok.text != "and") return true; + get_next_token(); + if (!parse_expression_not(tmpl)) return false; + append_function(tmpl, Bytecode::Op::And, 2); + return true; + } + + bool parse_expression_not(Template& tmpl) { + if (m_tok.kind == Token::Kind::Id && m_tok.text == "not") { + get_next_token(); + if (!parse_expression_not(tmpl)) return false; + append_function(tmpl, Bytecode::Op::Not, 1); + return true; + } else { + return parse_expression_comparison(tmpl); + } + } + + bool parse_expression_comparison(Template& tmpl) { + if (!parse_expression_datum(tmpl)) return false; + Bytecode::Op op; + switch (m_tok.kind) { + case Token::Kind::Id: + if (m_tok.text == "in") + op = Bytecode::Op::In; + else + return true; + break; + case Token::Kind::Equal: + op = Bytecode::Op::Equal; + break; + case Token::Kind::GreaterThan: + op = Bytecode::Op::Greater; + break; + case Token::Kind::LessThan: + op = Bytecode::Op::Less; + break; + case Token::Kind::LessEqual: + op = Bytecode::Op::LessEqual; + break; + case Token::Kind::GreaterEqual: + op = Bytecode::Op::GreaterEqual; + break; + case Token::Kind::NotEqual: + op = Bytecode::Op::Different; + break; + default: + return true; + } + get_next_token(); + if (!parse_expression_datum(tmpl)) return false; + append_function(tmpl, op, 2); + return true; + } + + bool parse_expression_datum(Template& tmpl) { + nonstd::string_view json_first; + size_t bracket_level = 0; + size_t brace_level = 0; + + for (;;) { + switch (m_tok.kind) { + case Token::Kind::LeftParen: { + get_next_token(); + if (!parse_expression(tmpl)) return false; + if (m_tok.kind != Token::Kind::RightParen) { + inja_throw("parser_error", "unmatched '('"); + } + get_next_token(); + return true; + } + case Token::Kind::Id: + get_peek_token(); + if (m_peek_tok.kind == Token::Kind::LeftParen) { + // function call, parse arguments + Token func_token = m_tok; + get_next_token(); // id + get_next_token(); // leftParen + unsigned int num_args = 0; + if (m_tok.kind == Token::Kind::RightParen) { + // no args + get_next_token(); + } else { + for (;;) { + if (!parse_expression(tmpl)) { + inja_throw("parser_error", "expected expression, got '" + m_tok.describe() + "'"); + } + num_args += 1; + if (m_tok.kind == Token::Kind::RightParen) { + get_next_token(); + break; + } + if (m_tok.kind != Token::Kind::Comma) { + inja_throw("parser_error", "expected ')' or ',', got '" + m_tok.describe() + "'"); + } + get_next_token(); + } + } + + auto op = m_static.functions.find_builtin(func_token.text, num_args); + + if (op != Bytecode::Op::Nop) { + // swap arguments for default(); see comment in RenderTo() + if (op == Bytecode::Op::Default) + std::swap(tmpl.bytecodes.back(), *(tmpl.bytecodes.rbegin() + 1)); + append_function(tmpl, op, num_args); + return true; + } else { + append_callback(tmpl, func_token.text, num_args); + return true; + } + } else if (m_tok.text == "true" || m_tok.text == "false" || m_tok.text == "null") { + // true, false, null are json literals + if (brace_level == 0 && bracket_level == 0) { + json_first = m_tok.text; + goto returnJson; + } + break; + } else { + // normal literal (json read) + tmpl.bytecodes.emplace_back( + Bytecode::Op::Push, m_tok.text, + m_config.notation == ElementNotation::Pointer ? Bytecode::Flag::ValueLookupPointer : Bytecode::Flag::ValueLookupDot); + get_next_token(); + return true; + } + // json passthrough + case Token::Kind::Number: + case Token::Kind::String: + if (brace_level == 0 && bracket_level == 0) { + json_first = m_tok.text; + goto returnJson; + } + break; + case Token::Kind::Comma: + case Token::Kind::Colon: + if (brace_level == 0 && bracket_level == 0) { + inja_throw("parser_error", "unexpected token '" + m_tok.describe() + "'"); + } + break; + case Token::Kind::LeftBracket: + if (brace_level == 0 && bracket_level == 0) { + json_first = m_tok.text; + } + bracket_level += 1; + break; + case Token::Kind::LeftBrace: + if (brace_level == 0 && bracket_level == 0) { + json_first = m_tok.text; + } + brace_level += 1; + break; + case Token::Kind::RightBracket: + if (bracket_level == 0) { + inja_throw("parser_error", "unexpected ']'"); + } + --bracket_level; + if (brace_level == 0 && bracket_level == 0) goto returnJson; + break; + case Token::Kind::RightBrace: + if (brace_level == 0) { + inja_throw("parser_error", "unexpected '}'"); + } + --brace_level; + if (brace_level == 0 && bracket_level == 0) goto returnJson; + break; + default: + if (brace_level != 0) { + inja_throw("parser_error", "unmatched '{'"); + } + if (bracket_level != 0) { + inja_throw("parser_error", "unmatched '['"); + } + return false; + } + + get_next_token(); + } + + returnJson: + // bridge across all intermediate tokens + nonstd::string_view json_text(json_first.data(), m_tok.text.data() - json_first.data() + m_tok.text.size()); + tmpl.bytecodes.emplace_back(Bytecode::Op::Push, json::parse(json_text), Bytecode::Flag::ValueImmediate); + get_next_token(); + return true; + } + + bool parse_statement(Template& tmpl, nonstd::string_view path) { + if (m_tok.kind != Token::Kind::Id) return false; + + if (m_tok.text == "if") { + get_next_token(); + + // evaluate expression + if (!parse_expression(tmpl)) return false; + + // start a new if block on if stack + m_if_stack.emplace_back(tmpl.bytecodes.size()); + + // conditional jump; destination will be filled in by else or endif + tmpl.bytecodes.emplace_back(Bytecode::Op::ConditionalJump); + } else if (m_tok.text == "endif") { + if (m_if_stack.empty()) { + inja_throw("parser_error", "endif without matching if"); + } + auto& if_data = m_if_stack.back(); + get_next_token(); + + // previous conditional jump jumps here + if (if_data.prev_cond_jump != std::numeric_limits<unsigned int>::max()) { + tmpl.bytecodes[if_data.prev_cond_jump].args = tmpl.bytecodes.size(); + } + + // update all previous unconditional jumps to here + for (unsigned int i: if_data.uncond_jumps) { + tmpl.bytecodes[i].args = tmpl.bytecodes.size(); + } + + // pop if stack + m_if_stack.pop_back(); + } else if (m_tok.text == "else") { + if (m_if_stack.empty()) + inja_throw("parser_error", "else without matching if"); + auto& if_data = m_if_stack.back(); + get_next_token(); + + // end previous block with unconditional jump to endif; destination will be + // filled in by endif + if_data.uncond_jumps.push_back(tmpl.bytecodes.size()); + tmpl.bytecodes.emplace_back(Bytecode::Op::Jump); + + // previous conditional jump jumps here + tmpl.bytecodes[if_data.prev_cond_jump].args = tmpl.bytecodes.size(); + if_data.prev_cond_jump = std::numeric_limits<unsigned int>::max(); + + // chained else if + if (m_tok.kind == Token::Kind::Id && m_tok.text == "if") { + get_next_token(); + + // evaluate expression + if (!parse_expression(tmpl)) return false; + + // update "previous jump" + if_data.prev_cond_jump = tmpl.bytecodes.size(); + + // conditional jump; destination will be filled in by else or endif + tmpl.bytecodes.emplace_back(Bytecode::Op::ConditionalJump); + } + } else if (m_tok.text == "for") { + get_next_token(); + + // options: for a in arr; for a, b in obj + if (m_tok.kind != Token::Kind::Id) + inja_throw("parser_error", "expected id, got '" + m_tok.describe() + "'"); + Token value_token = m_tok; + get_next_token(); + + Token key_token; + if (m_tok.kind == Token::Kind::Comma) { + get_next_token(); + if (m_tok.kind != Token::Kind::Id) + inja_throw("parser_error", "expected id, got '" + m_tok.describe() + "'"); + key_token = std::move(value_token); + value_token = m_tok; + get_next_token(); + } + + if (m_tok.kind != Token::Kind::Id || m_tok.text != "in") + inja_throw("parser_error", + "expected 'in', got '" + m_tok.describe() + "'"); + get_next_token(); + + if (!parse_expression(tmpl)) return false; + + m_loop_stack.push_back(tmpl.bytecodes.size()); + + tmpl.bytecodes.emplace_back(Bytecode::Op::StartLoop); + if (!key_token.text.empty()) { + tmpl.bytecodes.back().value = key_token.text; + } + tmpl.bytecodes.back().str = static_cast<std::string>(value_token.text); + } else if (m_tok.text == "endfor") { + get_next_token(); + if (m_loop_stack.empty()) { + inja_throw("parser_error", "endfor without matching for"); + } + + // update loop with EndLoop index (for empty case) + tmpl.bytecodes[m_loop_stack.back()].args = tmpl.bytecodes.size(); + + tmpl.bytecodes.emplace_back(Bytecode::Op::EndLoop); + tmpl.bytecodes.back().args = m_loop_stack.back() + 1; // loop body + m_loop_stack.pop_back(); + } else if (m_tok.text == "include") { + get_next_token(); + + if (m_tok.kind != Token::Kind::String) { + inja_throw("parser_error", "expected string, got '" + m_tok.describe() + "'"); + } + + // build the relative path + json json_name = json::parse(m_tok.text); + std::string pathname = static_cast<std::string>(path); + pathname += json_name.get_ref<const std::string&>(); + if (pathname.compare(0, 2, "./") == 0) { + pathname.erase(0, 2); + } + // sys::path::remove_dots(pathname, true, sys::path::Style::posix); + + Template include_template = parse_template(pathname); + m_included_templates.emplace(pathname, include_template); + + // generate a reference bytecode + tmpl.bytecodes.emplace_back(Bytecode::Op::Include, json(pathname), Bytecode::Flag::ValueImmediate); + + get_next_token(); + } else { + return false; + } + return true; + } + + void append_function(Template& tmpl, Bytecode::Op op, unsigned int num_args) { + // we can merge with back-to-back push + if (!tmpl.bytecodes.empty()) { + Bytecode& last = tmpl.bytecodes.back(); + if (last.op == Bytecode::Op::Push) { + last.op = op; + last.args = num_args; + return; + } + } + + // otherwise just add it to the end + tmpl.bytecodes.emplace_back(op, num_args); + } + + void append_callback(Template& tmpl, nonstd::string_view name, unsigned int num_args) { + // we can merge with back-to-back push value (not lookup) + if (!tmpl.bytecodes.empty()) { + Bytecode& last = tmpl.bytecodes.back(); + if (last.op == Bytecode::Op::Push && + (last.flags & Bytecode::Flag::ValueMask) == Bytecode::Flag::ValueImmediate) { + last.op = Bytecode::Op::Callback; + last.args = num_args; + last.str = static_cast<std::string>(name); + return; + } + } + + // otherwise just add it to the end + tmpl.bytecodes.emplace_back(Bytecode::Op::Callback, num_args); + tmpl.bytecodes.back().str = static_cast<std::string>(name); + } + + void parse_into(Template& tmpl, nonstd::string_view path) { + m_lexer.start(tmpl.content); + + for (;;) { + get_next_token(); + switch (m_tok.kind) { + case Token::Kind::Eof: + if (!m_if_stack.empty()) inja_throw("parser_error", "unmatched if"); + if (!m_loop_stack.empty()) inja_throw("parser_error", "unmatched for"); + return; + case Token::Kind::Text: + tmpl.bytecodes.emplace_back(Bytecode::Op::PrintText, m_tok.text, 0u); + break; + case Token::Kind::StatementOpen: + get_next_token(); + if (!parse_statement(tmpl, path)) { + inja_throw("parser_error", "expected statement, got '" + m_tok.describe() + "'"); + } + if (m_tok.kind != Token::Kind::StatementClose) { + inja_throw("parser_error", "expected statement close, got '" + m_tok.describe() + "'"); + } + break; + case Token::Kind::LineStatementOpen: + get_next_token(); + parse_statement(tmpl, path); + if (m_tok.kind != Token::Kind::LineStatementClose && + m_tok.kind != Token::Kind::Eof) { + inja_throw("parser_error", "expected line statement close, got '" + m_tok.describe() + "'"); + } + break; + case Token::Kind::ExpressionOpen: + get_next_token(); + if (!parse_expression(tmpl)) { + inja_throw("parser_error", "expected expression, got '" + m_tok.describe() + "'"); + } + append_function(tmpl, Bytecode::Op::PrintValue, 1); + if (m_tok.kind != Token::Kind::ExpressionClose) { + inja_throw("parser_error", "expected expression close, got '" + m_tok.describe() + "'"); + } + break; + case Token::Kind::CommentOpen: + get_next_token(); + if (m_tok.kind != Token::Kind::CommentClose) { + inja_throw("parser_error", "expected comment close, got '" + m_tok.describe() + "'"); + } + break; + default: + inja_throw("parser_error", "unexpected token '" + m_tok.describe() + "'"); + break; + } + } + } + + Template parse(nonstd::string_view input, nonstd::string_view path) { + Template result; + result.content = static_cast<std::string>(input); + parse_into(result, path); + return result; + } + + Template parse(nonstd::string_view input) { + return parse(input, "./"); + } + + Template parse_template(nonstd::string_view filename) { + Template result; + result.content = load_file(filename); + + nonstd::string_view path = filename.substr(0, filename.find_last_of("/\\") + 1); + // StringRef path = sys::path::parent_path(filename); + Parser(m_config, m_lexer.get_config(), m_included_templates).parse_into(result, path); + return result; + } + + std::string load_file(nonstd::string_view filename) { + std::ifstream file(static_cast<std::string>(filename)); + std::string text((std::istreambuf_iterator<char>(file)), std::istreambuf_iterator<char>()); + return text; + } + + private: + const ParserConfig& m_config; + Lexer m_lexer; + Token m_tok; + Token m_peek_tok; + bool m_have_peek_tok {false}; + TemplateStorage& m_included_templates; + const ParserStatic& m_static; + + struct IfData { + unsigned int prev_cond_jump; + std::vector<unsigned int> uncond_jumps; + + explicit IfData(unsigned int condJump): prev_cond_jump(condJump) {} + }; + + std::vector<IfData> m_if_stack; + std::vector<unsigned int> m_loop_stack; + + void get_next_token() { + if (m_have_peek_tok) { + m_tok = m_peek_tok; + m_have_peek_tok = false; + } else { + m_tok = m_lexer.scan(); + } + } + + void get_peek_token() { + if (!m_have_peek_tok) { + m_peek_tok = m_lexer.scan(); + m_have_peek_tok = true; + } + } +}; + +} // namespace inja + +#endif // PANTOR_INJA_PARSER_HPP + +// #include "polyfill.hpp" +#ifndef PANTOR_INJA_POLYFILL_HPP +#define PANTOR_INJA_POLYFILL_HPP + + +#if __cplusplus < 201402L + +#include <cstddef> +#include <type_traits> +#include <utility> + + +namespace stdinja { + template<class T> struct _Unique_if { + typedef std::unique_ptr<T> _Single_object; + }; + + template<class T> struct _Unique_if<T[]> { + typedef std::unique_ptr<T[]> _Unknown_bound; + }; + + template<class T, size_t N> struct _Unique_if<T[N]> { + typedef void _Known_bound; + }; + + template<class T, class... Args> + typename _Unique_if<T>::_Single_object + make_unique(Args&&... args) { + return std::unique_ptr<T>(new T(std::forward<Args>(args)...)); + } + + template<class T> + typename _Unique_if<T>::_Unknown_bound + make_unique(size_t n) { + typedef typename std::remove_extent<T>::type U; + return std::unique_ptr<T>(new U[n]()); + } + + template<class T, class... Args> + typename _Unique_if<T>::_Known_bound + make_unique(Args&&...) = delete; +} + +#else + +namespace stdinja = std; + +#endif // memory */ + + +#endif // PANTOR_INJA_POLYFILL_HPP + +// #include "renderer.hpp" +#ifndef PANTOR_INJA_RENDERER_HPP +#define PANTOR_INJA_RENDERER_HPP + +#include <algorithm> +#include <numeric> + +#include <nlohmann/json.hpp> + +// #include "bytecode.hpp" + +// #include "template.hpp" + +// #include "utils.hpp" + + + +namespace inja { + +inline nonstd::string_view convert_dot_to_json_pointer(nonstd::string_view dot, std::string& out) { + out.clear(); + do { + nonstd::string_view part; + std::tie(part, dot) = string_view::split(dot, '.'); + out.push_back('/'); + out.append(part.begin(), part.end()); + } while (!dot.empty()); + return nonstd::string_view(out.data(), out.size()); +} + +class Renderer { + std::vector<const json*>& get_args(const Bytecode& bc) { + m_tmp_args.clear(); + + bool has_imm = ((bc.flags & Bytecode::Flag::ValueMask) != Bytecode::Flag::ValuePop); + + // get args from stack + unsigned int pop_args = bc.args; + if (has_imm) { + pop_args -= 1; + } + + for (auto i = std::prev(m_stack.end(), pop_args); i != m_stack.end(); i++) { + m_tmp_args.push_back(&(*i)); + } + + // get immediate arg + if (has_imm) { + m_tmp_args.push_back(get_imm(bc)); + } + + return m_tmp_args; + } + + void pop_args(const Bytecode& bc) { + unsigned int popArgs = bc.args; + if ((bc.flags & Bytecode::Flag::ValueMask) != Bytecode::Flag::ValuePop) { + popArgs -= 1; + } + for (unsigned int i = 0; i < popArgs; ++i) { + m_stack.pop_back(); + } + } + + const json* get_imm(const Bytecode& bc) { + std::string ptr_buffer; + nonstd::string_view ptr; + switch (bc.flags & Bytecode::Flag::ValueMask) { + case Bytecode::Flag::ValuePop: + return nullptr; + case Bytecode::Flag::ValueImmediate: + return &bc.value; + case Bytecode::Flag::ValueLookupDot: + ptr = convert_dot_to_json_pointer(bc.str, ptr_buffer); + break; + case Bytecode::Flag::ValueLookupPointer: + ptr_buffer += '/'; + ptr_buffer += bc.str; + ptr = ptr_buffer; + break; + } + try { + return &m_data->at(json::json_pointer(ptr.data())); + } catch (std::exception&) { + // try to evaluate as a no-argument callback + if (auto callback = m_callbacks.find_callback(bc.str, 0)) { + std::vector<const json*> arguments {}; + m_tmp_val = callback(arguments); + return &m_tmp_val; + } + inja_throw("render_error", "variable '" + static_cast<std::string>(bc.str) + "' not found"); + return nullptr; + } + } + + bool truthy(const json& var) const { + if (var.empty()) { + return false; + } else if (var.is_number()) { + return (var != 0); + } else if (var.is_string()) { + return !var.empty(); + } + + try { + return var.get<bool>(); + } catch (json::type_error& e) { + inja_throw("json_error", e.what()); + throw; + } + } + + void update_loop_data() { + LoopLevel& level = m_loop_stack.back(); + + if (level.loop_type == LoopLevel::Type::Array) { + level.data[static_cast<std::string>(level.value_name)] = level.values.at(level.index); // *level.it; + auto& loopData = level.data["loop"]; + loopData["index"] = level.index; + loopData["index1"] = level.index + 1; + loopData["is_first"] = (level.index == 0); + loopData["is_last"] = (level.index == level.size - 1); + } else { + level.data[static_cast<std::string>(level.key_name)] = level.map_it->first; + level.data[static_cast<std::string>(level.value_name)] = *level.map_it->second; + } + } + + const TemplateStorage& m_included_templates; + const FunctionStorage& m_callbacks; + + std::vector<json> m_stack; + + + struct LoopLevel { + enum class Type { Map, Array }; + + Type loop_type; + nonstd::string_view key_name; // variable name for keys + nonstd::string_view value_name; // variable name for values + json data; // data with loop info added + + json values; // values to iterate over + + // loop over list + size_t index; // current list index + size_t size; // length of list + + // loop over map + using KeyValue = std::pair<nonstd::string_view, json*>; + using MapValues = std::vector<KeyValue>; + MapValues map_values; // values to iterate over + MapValues::iterator map_it; // iterator over values + + }; + + std::vector<LoopLevel> m_loop_stack; + const json* m_data; + + std::vector<const json*> m_tmp_args; + json m_tmp_val; + + + public: + Renderer(const TemplateStorage& included_templates, const FunctionStorage& callbacks): m_included_templates(included_templates), m_callbacks(callbacks) { + m_stack.reserve(16); + m_tmp_args.reserve(4); + m_loop_stack.reserve(16); + } + + void render_to(std::ostream& os, const Template& tmpl, const json& data) { + m_data = &data; + + for (size_t i = 0; i < tmpl.bytecodes.size(); ++i) { + const auto& bc = tmpl.bytecodes[i]; + + switch (bc.op) { + case Bytecode::Op::Nop: { + break; + } + case Bytecode::Op::PrintText: { + os << bc.str; + break; + } + case Bytecode::Op::PrintValue: { + const json& val = *get_args(bc)[0]; + if (val.is_string()) + os << val.get_ref<const std::string&>(); + else + os << val.dump(); + // val.dump(os); + pop_args(bc); + break; + } + case Bytecode::Op::Push: { + m_stack.emplace_back(*get_imm(bc)); + break; + } + case Bytecode::Op::Upper: { + auto result = get_args(bc)[0]->get<std::string>(); + std::transform(result.begin(), result.end(), result.begin(), ::toupper); + pop_args(bc); + m_stack.emplace_back(std::move(result)); + break; + } + case Bytecode::Op::Lower: { + auto result = get_args(bc)[0]->get<std::string>(); + std::transform(result.begin(), result.end(), result.begin(), ::tolower); + pop_args(bc); + m_stack.emplace_back(std::move(result)); + break; + } + case Bytecode::Op::Range: { + int number = get_args(bc)[0]->get<int>(); + std::vector<int> result(number); + std::iota(std::begin(result), std::end(result), 0); + pop_args(bc); + m_stack.emplace_back(std::move(result)); + break; + } + case Bytecode::Op::Length: { + auto result = get_args(bc)[0]->size(); + pop_args(bc); + m_stack.emplace_back(result); + break; + } + case Bytecode::Op::Sort: { + auto result = get_args(bc)[0]->get<std::vector<json>>(); + std::sort(result.begin(), result.end()); + pop_args(bc); + m_stack.emplace_back(std::move(result)); + break; + } + case Bytecode::Op::First: { + auto result = get_args(bc)[0]->front(); + pop_args(bc); + m_stack.emplace_back(result); + break; + } + case Bytecode::Op::Last: { + auto result = get_args(bc)[0]->back(); + pop_args(bc); + m_stack.emplace_back(result); + break; + } + case Bytecode::Op::Round: { + auto args = get_args(bc); + double number = args[0]->get<double>(); + int precision = args[1]->get<int>(); + pop_args(bc); + m_stack.emplace_back(std::round(number * std::pow(10.0, precision)) / std::pow(10.0, precision)); + break; + } + case Bytecode::Op::DivisibleBy: { + auto args = get_args(bc); + int number = args[0]->get<int>(); + int divisor = args[1]->get<int>(); + pop_args(bc); + m_stack.emplace_back((divisor != 0) && (number % divisor == 0)); + break; + } + case Bytecode::Op::Odd: { + int number = get_args(bc)[0]->get<int>(); + pop_args(bc); + m_stack.emplace_back(number % 2 != 0); + break; + } + case Bytecode::Op::Even: { + int number = get_args(bc)[0]->get<int>(); + pop_args(bc); + m_stack.emplace_back(number % 2 == 0); + break; + } + case Bytecode::Op::Max: { + auto args = get_args(bc); + auto result = *std::max_element(args[0]->begin(), args[0]->end()); + pop_args(bc); + m_stack.emplace_back(std::move(result)); + break; + } + case Bytecode::Op::Min: { + auto args = get_args(bc); + auto result = *std::min_element(args[0]->begin(), args[0]->end()); + pop_args(bc); + m_stack.emplace_back(std::move(result)); + break; + } + case Bytecode::Op::Not: { + bool result = !truthy(*get_args(bc)[0]); + pop_args(bc); + m_stack.emplace_back(result); + break; + } + case Bytecode::Op::And: { + auto args = get_args(bc); + bool result = truthy(*args[0]) && truthy(*args[1]); + pop_args(bc); + m_stack.emplace_back(result); + break; + } + case Bytecode::Op::Or: { + auto args = get_args(bc); + bool result = truthy(*args[0]) || truthy(*args[1]); + pop_args(bc); + m_stack.emplace_back(result); + break; + } + case Bytecode::Op::In: { + auto args = get_args(bc); + bool result = std::find(args[1]->begin(), args[1]->end(), *args[0]) != + args[1]->end(); + pop_args(bc); + m_stack.emplace_back(result); + break; + } + case Bytecode::Op::Equal: { + auto args = get_args(bc); + bool result = (*args[0] == *args[1]); + pop_args(bc); + m_stack.emplace_back(result); + break; + } + case Bytecode::Op::Greater: { + auto args = get_args(bc); + bool result = (*args[0] > *args[1]); + pop_args(bc); + m_stack.emplace_back(result); + break; + } + case Bytecode::Op::Less: { + auto args = get_args(bc); + bool result = (*args[0] < *args[1]); + pop_args(bc); + m_stack.emplace_back(result); + break; + } + case Bytecode::Op::GreaterEqual: { + auto args = get_args(bc); + bool result = (*args[0] >= *args[1]); + pop_args(bc); + m_stack.emplace_back(result); + break; + } + case Bytecode::Op::LessEqual: { + auto args = get_args(bc); + bool result = (*args[0] <= *args[1]); + pop_args(bc); + m_stack.emplace_back(result); + break; + } + case Bytecode::Op::Different: { + auto args = get_args(bc); + bool result = (*args[0] != *args[1]); + pop_args(bc); + m_stack.emplace_back(result); + break; + } + case Bytecode::Op::Float: { + double result = + std::stod(get_args(bc)[0]->get_ref<const std::string&>()); + pop_args(bc); + m_stack.emplace_back(result); + break; + } + case Bytecode::Op::Int: { + int result = std::stoi(get_args(bc)[0]->get_ref<const std::string&>()); + pop_args(bc); + m_stack.emplace_back(result); + break; + } + case Bytecode::Op::Exists: { + auto&& name = get_args(bc)[0]->get_ref<const std::string&>(); + bool result = (data.find(name) != data.end()); + pop_args(bc); + m_stack.emplace_back(result); + break; + } + case Bytecode::Op::ExistsInObject: { + auto args = get_args(bc); + auto&& name = args[1]->get_ref<const std::string&>(); + bool result = (args[0]->find(name) != args[0]->end()); + pop_args(bc); + m_stack.emplace_back(result); + break; + } + case Bytecode::Op::IsBoolean: { + bool result = get_args(bc)[0]->is_boolean(); + pop_args(bc); + m_stack.emplace_back(result); + break; + } + case Bytecode::Op::IsNumber: { + bool result = get_args(bc)[0]->is_number(); + pop_args(bc); + m_stack.emplace_back(result); + break; + } + case Bytecode::Op::IsInteger: { + bool result = get_args(bc)[0]->is_number_integer(); + pop_args(bc); + m_stack.emplace_back(result); + break; + } + case Bytecode::Op::IsFloat: { + bool result = get_args(bc)[0]->is_number_float(); + pop_args(bc); + m_stack.emplace_back(result); + break; + } + case Bytecode::Op::IsObject: { + bool result = get_args(bc)[0]->is_object(); + pop_args(bc); + m_stack.emplace_back(result); + break; + } + case Bytecode::Op::IsArray: { + bool result = get_args(bc)[0]->is_array(); + pop_args(bc); + m_stack.emplace_back(result); + break; + } + case Bytecode::Op::IsString: { + bool result = get_args(bc)[0]->is_string(); + pop_args(bc); + m_stack.emplace_back(result); + break; + } + case Bytecode::Op::Default: { + // default needs to be a bit "magic"; we can't evaluate the first + // argument during the push operation, so we swap the arguments during + // the parse phase so the second argument is pushed on the stack and + // the first argument is in the immediate + try { + const json* imm = get_imm(bc); + // if no exception was raised, replace the stack value with it + m_stack.back() = *imm; + } catch (std::exception&) { + // couldn't read immediate, just leave the stack as is + } + break; + } + case Bytecode::Op::Include: + Renderer(m_included_templates, m_callbacks).render_to(os, m_included_templates.find(get_imm(bc)->get_ref<const std::string&>())->second, data); + break; + case Bytecode::Op::Callback: { + auto callback = m_callbacks.find_callback(bc.str, bc.args); + if (!callback) { + inja_throw("render_error", "function '" + static_cast<std::string>(bc.str) + "' (" + std::to_string(static_cast<unsigned int>(bc.args)) + ") not found"); + } + json result = callback(get_args(bc)); + pop_args(bc); + m_stack.emplace_back(std::move(result)); + break; + } + case Bytecode::Op::Jump: { + i = bc.args - 1; // -1 due to ++i in loop + break; + } + case Bytecode::Op::ConditionalJump: { + if (!truthy(m_stack.back())) { + i = bc.args - 1; // -1 due to ++i in loop + } + m_stack.pop_back(); + break; + } + case Bytecode::Op::StartLoop: { + // jump past loop body if empty + if (m_stack.back().empty()) { + m_stack.pop_back(); + i = bc.args; // ++i in loop will take it past EndLoop + break; + } + + m_loop_stack.emplace_back(); + LoopLevel& level = m_loop_stack.back(); + level.value_name = bc.str; + level.values = std::move(m_stack.back()); + level.data = (*m_data); + m_stack.pop_back(); + + if (bc.value.is_string()) { + // map iterator + if (!level.values.is_object()) { + m_loop_stack.pop_back(); + inja_throw("render_error", "for key, value requires object"); + } + level.loop_type = LoopLevel::Type::Map; + level.key_name = bc.value.get_ref<const std::string&>(); + + // sort by key + for (auto it = level.values.begin(), end = level.values.end(); it != end; ++it) { + level.map_values.emplace_back(it.key(), &it.value()); + } + std::sort(level.map_values.begin(), level.map_values.end(), [](const LoopLevel::KeyValue& a, const LoopLevel::KeyValue& b) { return a.first < b.first; }); + level.map_it = level.map_values.begin(); + } else { + if (!level.values.is_array()) { + m_loop_stack.pop_back(); + inja_throw("render_error", "type must be array"); + } + + // list iterator + level.loop_type = LoopLevel::Type::Array; + level.index = 0; + level.size = level.values.size(); + } + + // provide parent access in nested loop + auto parent_loop_it = level.data.find("loop"); + if (parent_loop_it != level.data.end()) { + json loop_copy = *parent_loop_it; + (*parent_loop_it)["parent"] = std::move(loop_copy); + } + + // set "current" data to loop data + m_data = &level.data; + update_loop_data(); + break; + } + case Bytecode::Op::EndLoop: { + if (m_loop_stack.empty()) { + inja_throw("render_error", "unexpected state in renderer"); + } + LoopLevel& level = m_loop_stack.back(); + + bool done; + if (level.loop_type == LoopLevel::Type::Array) { + level.index += 1; + done = (level.index == level.values.size()); + } else { + level.map_it += 1; + done = (level.map_it == level.map_values.end()); + } + + if (done) { + m_loop_stack.pop_back(); + // set "current" data to outer loop data or main data as appropriate + if (!m_loop_stack.empty()) { + m_data = &m_loop_stack.back().data; + } else { + m_data = &data; + } + break; + } + + update_loop_data(); + + // jump back to start of loop + i = bc.args - 1; // -1 due to ++i in loop + break; + } + default: { + inja_throw("render_error", "unknown op in renderer: " + std::to_string(static_cast<unsigned int>(bc.op))); + } + } + } + } +}; + +} // namespace inja + +#endif // PANTOR_INJA_RENDERER_HPP + +// #include "string_view.hpp" + +// #include "template.hpp" + + + +namespace inja { + +using namespace nlohmann; + +class Environment { + class Impl { + public: + std::string input_path; + std::string output_path; + + LexerConfig lexer_config; + ParserConfig parser_config; + + FunctionStorage callbacks; + TemplateStorage included_templates; + }; + + std::unique_ptr<Impl> m_impl; + + public: + Environment(): Environment("./") { } + + explicit Environment(const std::string& global_path): m_impl(stdinja::make_unique<Impl>()) { + m_impl->input_path = global_path; + m_impl->output_path = global_path; + } + + explicit Environment(const std::string& input_path, const std::string& output_path): m_impl(stdinja::make_unique<Impl>()) { + m_impl->input_path = input_path; + m_impl->output_path = output_path; + } + + /// Sets the opener and closer for template statements + void set_statement(const std::string& open, const std::string& close) { + m_impl->lexer_config.statement_open = open; + m_impl->lexer_config.statement_close = close; + m_impl->lexer_config.update_open_chars(); + } + + /// Sets the opener for template line statements + void set_line_statement(const std::string& open) { + m_impl->lexer_config.line_statement = open; + m_impl->lexer_config.update_open_chars(); + } + + /// Sets the opener and closer for template expressions + void set_expression(const std::string& open, const std::string& close) { + m_impl->lexer_config.expression_open = open; + m_impl->lexer_config.expression_close = close; + m_impl->lexer_config.update_open_chars(); + } + + /// Sets the opener and closer for template comments + void set_comment(const std::string& open, const std::string& close) { + m_impl->lexer_config.comment_open = open; + m_impl->lexer_config.comment_close = close; + m_impl->lexer_config.update_open_chars(); + } + + /// Sets the element notation syntax + void set_element_notation(ElementNotation notation) { + m_impl->parser_config.notation = notation; + } + + + Template parse(nonstd::string_view input) { + Parser parser(m_impl->parser_config, m_impl->lexer_config, m_impl->included_templates); + return parser.parse(input); + } + + Template parse_template(const std::string& filename) { + Parser parser(m_impl->parser_config, m_impl->lexer_config, m_impl->included_templates); + return parser.parse_template(m_impl->input_path + static_cast<std::string>(filename)); + } + + std::string render(nonstd::string_view input, const json& data) { + return render(parse(input), data); + } + + std::string render(const Template& tmpl, const json& data) { + std::stringstream os; + render_to(os, tmpl, data); + return os.str(); + } + + std::string render_file(const std::string& filename, const json& data) { + return render(parse_template(filename), data); + } + + std::string render_file_with_json_file(const std::string& filename, const std::string& filename_data) { + const json data = load_json(filename_data); + return render_file(filename, data); + } + + void write(const std::string& filename, const json& data, const std::string& filename_out) { + std::ofstream file(m_impl->output_path + filename_out); + file << render_file(filename, data); + file.close(); + } + + void write(const Template& temp, const json& data, const std::string& filename_out) { + std::ofstream file(m_impl->output_path + filename_out); + file << render(temp, data); + file.close(); + } + + void write_with_json_file(const std::string& filename, const std::string& filename_data, const std::string& filename_out) { + const json data = load_json(filename_data); + write(filename, data, filename_out); + } + + void write_with_json_file(const Template& temp, const std::string& filename_data, const std::string& filename_out) { + const json data = load_json(filename_data); + write(temp, data, filename_out); + } + + std::ostream& render_to(std::ostream& os, const Template& tmpl, const json& data) { + Renderer(m_impl->included_templates, m_impl->callbacks).render_to(os, tmpl, data); + return os; + } + + std::string load_file(const std::string& filename) { + Parser parser(m_impl->parser_config, m_impl->lexer_config, m_impl->included_templates); + return parser.load_file(m_impl->input_path + filename); + } + + json load_json(const std::string& filename) { + std::ifstream file(m_impl->input_path + filename); + json j; + file >> j; + return j; + } + + void add_callback(const std::string& name, unsigned int numArgs, const CallbackFunction& callback) { + m_impl->callbacks.add_callback(name, numArgs, callback); + } + + /** Includes a template with a given name into the environment. + * Then, a template can be rendered in another template using the + * include "<name>" syntax. + */ + void include_template(const std::string& name, const Template& tmpl) { + m_impl->included_templates[name] = tmpl; + } +}; + +/*! +@brief render with default settings to a string +*/ +inline std::string render(nonstd::string_view input, const json& data) { + return Environment().render(input, data); +} + +/*! +@brief render with default settings to the given output stream +*/ +inline void render_to(std::ostream& os, nonstd::string_view input, const json& data) { + Environment env; + env.render_to(os, env.parse(input), data); +} + +} + +#endif // PANTOR_INJA_ENVIRONMENT_HPP + +// #include "string_view.hpp" + +// #include "template.hpp" + +// #include "parser.hpp" + +// #include "renderer.hpp" + + + +#endif // PANTOR_INJA_HPP diff --git a/tools/jsonproc/jsonproc.cpp b/tools/jsonproc/jsonproc.cpp new file mode 100644 index 0000000..efe48f3 --- /dev/null +++ b/tools/jsonproc/jsonproc.cpp @@ -0,0 +1,91 @@ +// jsonproc.cpp + +#include "jsonproc.h" + +#include <map> + +#include <string> +using std::string; + +#include <inja.hpp> +using namespace inja; +using json = nlohmann::json; + +std::map<string, string> customVars; + +void set_custom_var(string key, string value) +{ + customVars[key] = value; +} + +string get_custom_var(string key) +{ + return customVars[key]; +} + +int main(int argc, char *argv[]) +{ + if (argc != 4) + FATAL_ERROR("USAGE: jsonproc <json-filepath> <template-filepath> <output-filepath>\n"); + + string jsonfilepath = argv[1]; + string templateFilepath = argv[2]; + string outputFilepath = argv[3]; + + Environment env; + + // Add custom command callbacks. + env.add_callback("doNotModifyHeader", 0, [jsonfilepath, templateFilepath](Arguments& args) { + return "//\n// DO NOT MODIFY THIS FILE! IT IS AUTO-GENERATED FROM " + jsonfilepath +" and Inja template " + templateFilepath + "\n//\n"; + }); + + env.add_callback("setVar", 2, [=](Arguments& args) { + string key = args.at(0)->get<string>(); + string value = args.at(1)->get<string>(); + set_custom_var(key, value); + return ""; + }); + + env.add_callback("getVar", 1, [=](Arguments& args) { + string key = args.at(0)->get<string>(); + return get_custom_var(key); + }); + + env.add_callback("concat", 2, [](Arguments& args) { + string first = args.at(0)->get<string>(); + string second = args.at(1)->get<string>(); + return first + second; + }); + + env.add_callback("removePrefix", 2, [](Arguments& args) { + string rawValue = args.at(0)->get<string>(); + string prefix = args.at(1)->get<string>(); + string::size_type i = rawValue.find(prefix); + if (i != 0) + return rawValue; + + return rawValue.erase(0, prefix.length()); + }); + + // Add custom command callbacks. + env.add_callback("removeSuffix", 2, [](Arguments& args) { + string rawValue = args.at(0)->get<string>(); + string suffix = args.at(1)->get<string>(); + string::size_type i = rawValue.rfind(suffix); + if (i == string::npos) + return rawValue; + + return rawValue.substr(0, i); + }); + + try + { + env.write_with_json_file(templateFilepath, jsonfilepath, outputFilepath); + } + catch (const std::exception& e) + { + FATAL_ERROR("JSONPROC_ERROR: %s\n", e.what()); + } + + return 0; +} diff --git a/tools/jsonproc/jsonproc.h b/tools/jsonproc/jsonproc.h new file mode 100644 index 0000000..575fb37 --- /dev/null +++ b/tools/jsonproc/jsonproc.h @@ -0,0 +1,32 @@ +// jsonproc.h + +#ifndef JSONPROC_H +#define JSONPROC_H + +#include <cstdlib> +#include <cstdio> +using std::fprintf; using std::exit; + +#include <cstdlib> + +#ifdef _MSC_VER + +#define FATAL_ERROR(format, ...) \ +do \ +{ \ + fprintf(stderr, format, __VA_ARGS__); \ + exit(1); \ +} while (0) + +#else + +#define FATAL_ERROR(format, ...) \ +do \ +{ \ + fprintf(stderr, format, ##__VA_ARGS__); \ + exit(1); \ +} while (0) + +#endif // _MSC_VER + +#endif // JSONPROC_H diff --git a/tools/jsonproc/nlohmann/json.hpp b/tools/jsonproc/nlohmann/json.hpp new file mode 100644 index 0000000..5003a4f --- /dev/null +++ b/tools/jsonproc/nlohmann/json.hpp @@ -0,0 +1,20842 @@ +/* + __ _____ _____ _____ + __| | __| | | | JSON for Modern C++ +| | |__ | | | | | | version 3.6.1 +|_____|_____|_____|_|___| https://github.com/nlohmann/json + +Licensed under the MIT License <http://opensource.org/licenses/MIT>. +SPDX-License-Identifier: MIT +Copyright (c) 2013-2019 Niels Lohmann <http://nlohmann.me>. + +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. +*/ + +#ifndef INCLUDE_NLOHMANN_JSON_HPP_ +#define INCLUDE_NLOHMANN_JSON_HPP_ + +#define NLOHMANN_JSON_VERSION_MAJOR 3 +#define NLOHMANN_JSON_VERSION_MINOR 6 +#define NLOHMANN_JSON_VERSION_PATCH 1 + +#include <algorithm> // all_of, find, for_each +#include <cassert> // assert +#include <ciso646> // and, not, or +#include <cstddef> // nullptr_t, ptrdiff_t, size_t +#include <functional> // hash, less +#include <initializer_list> // initializer_list +#include <iosfwd> // istream, ostream +#include <iterator> // random_access_iterator_tag +#include <memory> // unique_ptr +#include <numeric> // accumulate +#include <string> // string, stoi, to_string +#include <utility> // declval, forward, move, pair, swap +#include <vector> // vector + +// #include <nlohmann/adl_serializer.hpp> + + +#include <utility> + +// #include <nlohmann/detail/conversions/from_json.hpp> + + +#include <algorithm> // transform +#include <array> // array +#include <ciso646> // and, not +#include <forward_list> // forward_list +#include <iterator> // inserter, front_inserter, end +#include <map> // map +#include <string> // string +#include <tuple> // tuple, make_tuple +#include <type_traits> // is_arithmetic, is_same, is_enum, underlying_type, is_convertible +#include <unordered_map> // unordered_map +#include <utility> // pair, declval +#include <valarray> // valarray + +// #include <nlohmann/detail/exceptions.hpp> + + +#include <exception> // exception +#include <stdexcept> // runtime_error +#include <string> // to_string + +// #include <nlohmann/detail/input/position_t.hpp> + + +#include <cstddef> // size_t + +namespace nlohmann +{ +namespace detail +{ +/// struct to capture the start position of the current token +struct position_t +{ + /// the total number of characters read + std::size_t chars_read_total = 0; + /// the number of characters read in the current line + std::size_t chars_read_current_line = 0; + /// the number of lines read + std::size_t lines_read = 0; + + /// conversion to size_t to preserve SAX interface + constexpr operator size_t() const + { + return chars_read_total; + } +}; + +} // namespace detail +} // namespace nlohmann + + +namespace nlohmann +{ +namespace detail +{ +//////////////// +// exceptions // +//////////////// + +/*! +@brief general exception of the @ref basic_json class + +This class is an extension of `std::exception` objects with a member @a id for +exception ids. It is used as the base class for all exceptions thrown by the +@ref basic_json class. This class can hence be used as "wildcard" to catch +exceptions. + +Subclasses: +- @ref parse_error for exceptions indicating a parse error +- @ref invalid_iterator for exceptions indicating errors with iterators +- @ref type_error for exceptions indicating executing a member function with + a wrong type +- @ref out_of_range for exceptions indicating access out of the defined range +- @ref other_error for exceptions indicating other library errors + +@internal +@note To have nothrow-copy-constructible exceptions, we internally use + `std::runtime_error` which can cope with arbitrary-length error messages. + Intermediate strings are built with static functions and then passed to + the actual constructor. +@endinternal + +@liveexample{The following code shows how arbitrary library exceptions can be +caught.,exception} + +@since version 3.0.0 +*/ +class exception : public std::exception +{ + public: + /// returns the explanatory string + const char* what() const noexcept override + { + return m.what(); + } + + /// the id of the exception + const int id; + + protected: + exception(int id_, const char* what_arg) : id(id_), m(what_arg) {} + + static std::string name(const std::string& ename, int id_) + { + return "[json.exception." + ename + "." + std::to_string(id_) + "] "; + } + + private: + /// an exception object as storage for error messages + std::runtime_error m; +}; + +/*! +@brief exception indicating a parse error + +This exception is thrown by the library when a parse error occurs. Parse errors +can occur during the deserialization of JSON text, CBOR, MessagePack, as well +as when using JSON Patch. + +Member @a byte holds the byte index of the last read character in the input +file. + +Exceptions have ids 1xx. + +name / id | example message | description +------------------------------ | --------------- | ------------------------- +json.exception.parse_error.101 | parse error at 2: unexpected end of input; expected string literal | This error indicates a syntax error while deserializing a JSON text. The error message describes that an unexpected token (character) was encountered, and the member @a byte indicates the error position. +json.exception.parse_error.102 | parse error at 14: missing or wrong low surrogate | JSON uses the `\uxxxx` format to describe Unicode characters. Code points above above 0xFFFF are split into two `\uxxxx` entries ("surrogate pairs"). This error indicates that the surrogate pair is incomplete or contains an invalid code point. +json.exception.parse_error.103 | parse error: code points above 0x10FFFF are invalid | Unicode supports code points up to 0x10FFFF. Code points above 0x10FFFF are invalid. +json.exception.parse_error.104 | parse error: JSON patch must be an array of objects | [RFC 6902](https://tools.ietf.org/html/rfc6902) requires a JSON Patch document to be a JSON document that represents an array of objects. +json.exception.parse_error.105 | parse error: operation must have string member 'op' | An operation of a JSON Patch document must contain exactly one "op" member, whose value indicates the operation to perform. Its value must be one of "add", "remove", "replace", "move", "copy", or "test"; other values are errors. +json.exception.parse_error.106 | parse error: array index '01' must not begin with '0' | An array index in a JSON Pointer ([RFC 6901](https://tools.ietf.org/html/rfc6901)) may be `0` or any number without a leading `0`. +json.exception.parse_error.107 | parse error: JSON pointer must be empty or begin with '/' - was: 'foo' | A JSON Pointer must be a Unicode string containing a sequence of zero or more reference tokens, each prefixed by a `/` character. +json.exception.parse_error.108 | parse error: escape character '~' must be followed with '0' or '1' | In a JSON Pointer, only `~0` and `~1` are valid escape sequences. +json.exception.parse_error.109 | parse error: array index 'one' is not a number | A JSON Pointer array index must be a number. +json.exception.parse_error.110 | parse error at 1: cannot read 2 bytes from vector | When parsing CBOR or MessagePack, the byte vector ends before the complete value has been read. +json.exception.parse_error.112 | parse error at 1: error reading CBOR; last byte: 0xF8 | Not all types of CBOR or MessagePack are supported. This exception occurs if an unsupported byte was read. +json.exception.parse_error.113 | parse error at 2: expected a CBOR string; last byte: 0x98 | While parsing a map key, a value that is not a string has been read. +json.exception.parse_error.114 | parse error: Unsupported BSON record type 0x0F | The parsing of the corresponding BSON record type is not implemented (yet). + +@note For an input with n bytes, 1 is the index of the first character and n+1 + is the index of the terminating null byte or the end of file. This also + holds true when reading a byte vector (CBOR or MessagePack). + +@liveexample{The following code shows how a `parse_error` exception can be +caught.,parse_error} + +@sa - @ref exception for the base class of the library exceptions +@sa - @ref invalid_iterator for exceptions indicating errors with iterators +@sa - @ref type_error for exceptions indicating executing a member function with + a wrong type +@sa - @ref out_of_range for exceptions indicating access out of the defined range +@sa - @ref other_error for exceptions indicating other library errors + +@since version 3.0.0 +*/ +class parse_error : public exception +{ + public: + /*! + @brief create a parse error exception + @param[in] id_ the id of the exception + @param[in] pos the position where the error occurred (or with + chars_read_total=0 if the position cannot be + determined) + @param[in] what_arg the explanatory string + @return parse_error object + */ + static parse_error create(int id_, const position_t& pos, const std::string& what_arg) + { + std::string w = exception::name("parse_error", id_) + "parse error" + + position_string(pos) + ": " + what_arg; + return parse_error(id_, pos.chars_read_total, w.c_str()); + } + + static parse_error create(int id_, std::size_t byte_, const std::string& what_arg) + { + std::string w = exception::name("parse_error", id_) + "parse error" + + (byte_ != 0 ? (" at byte " + std::to_string(byte_)) : "") + + ": " + what_arg; + return parse_error(id_, byte_, w.c_str()); + } + + /*! + @brief byte index of the parse error + + The byte index of the last read character in the input file. + + @note For an input with n bytes, 1 is the index of the first character and + n+1 is the index of the terminating null byte or the end of file. + This also holds true when reading a byte vector (CBOR or MessagePack). + */ + const std::size_t byte; + + private: + parse_error(int id_, std::size_t byte_, const char* what_arg) + : exception(id_, what_arg), byte(byte_) {} + + static std::string position_string(const position_t& pos) + { + return " at line " + std::to_string(pos.lines_read + 1) + + ", column " + std::to_string(pos.chars_read_current_line); + } +}; + +/*! +@brief exception indicating errors with iterators + +This exception is thrown if iterators passed to a library function do not match +the expected semantics. + +Exceptions have ids 2xx. + +name / id | example message | description +----------------------------------- | --------------- | ------------------------- +json.exception.invalid_iterator.201 | iterators are not compatible | The iterators passed to constructor @ref basic_json(InputIT first, InputIT last) are not compatible, meaning they do not belong to the same container. Therefore, the range (@a first, @a last) is invalid. +json.exception.invalid_iterator.202 | iterator does not fit current value | In an erase or insert function, the passed iterator @a pos does not belong to the JSON value for which the function was called. It hence does not define a valid position for the deletion/insertion. +json.exception.invalid_iterator.203 | iterators do not fit current value | Either iterator passed to function @ref erase(IteratorType first, IteratorType last) does not belong to the JSON value from which values shall be erased. It hence does not define a valid range to delete values from. +json.exception.invalid_iterator.204 | iterators out of range | When an iterator range for a primitive type (number, boolean, or string) is passed to a constructor or an erase function, this range has to be exactly (@ref begin(), @ref end()), because this is the only way the single stored value is expressed. All other ranges are invalid. +json.exception.invalid_iterator.205 | iterator out of range | When an iterator for a primitive type (number, boolean, or string) is passed to an erase function, the iterator has to be the @ref begin() iterator, because it is the only way to address the stored value. All other iterators are invalid. +json.exception.invalid_iterator.206 | cannot construct with iterators from null | The iterators passed to constructor @ref basic_json(InputIT first, InputIT last) belong to a JSON null value and hence to not define a valid range. +json.exception.invalid_iterator.207 | cannot use key() for non-object iterators | The key() member function can only be used on iterators belonging to a JSON object, because other types do not have a concept of a key. +json.exception.invalid_iterator.208 | cannot use operator[] for object iterators | The operator[] to specify a concrete offset cannot be used on iterators belonging to a JSON object, because JSON objects are unordered. +json.exception.invalid_iterator.209 | cannot use offsets with object iterators | The offset operators (+, -, +=, -=) cannot be used on iterators belonging to a JSON object, because JSON objects are unordered. +json.exception.invalid_iterator.210 | iterators do not fit | The iterator range passed to the insert function are not compatible, meaning they do not belong to the same container. Therefore, the range (@a first, @a last) is invalid. +json.exception.invalid_iterator.211 | passed iterators may not belong to container | The iterator range passed to the insert function must not be a subrange of the container to insert to. +json.exception.invalid_iterator.212 | cannot compare iterators of different containers | When two iterators are compared, they must belong to the same container. +json.exception.invalid_iterator.213 | cannot compare order of object iterators | The order of object iterators cannot be compared, because JSON objects are unordered. +json.exception.invalid_iterator.214 | cannot get value | Cannot get value for iterator: Either the iterator belongs to a null value or it is an iterator to a primitive type (number, boolean, or string), but the iterator is different to @ref begin(). + +@liveexample{The following code shows how an `invalid_iterator` exception can be +caught.,invalid_iterator} + +@sa - @ref exception for the base class of the library exceptions +@sa - @ref parse_error for exceptions indicating a parse error +@sa - @ref type_error for exceptions indicating executing a member function with + a wrong type +@sa - @ref out_of_range for exceptions indicating access out of the defined range +@sa - @ref other_error for exceptions indicating other library errors + +@since version 3.0.0 +*/ +class invalid_iterator : public exception +{ + public: + static invalid_iterator create(int id_, const std::string& what_arg) + { + std::string w = exception::name("invalid_iterator", id_) + what_arg; + return invalid_iterator(id_, w.c_str()); + } + + private: + invalid_iterator(int id_, const char* what_arg) + : exception(id_, what_arg) {} +}; + +/*! +@brief exception indicating executing a member function with a wrong type + +This exception is thrown in case of a type error; that is, a library function is +executed on a JSON value whose type does not match the expected semantics. + +Exceptions have ids 3xx. + +name / id | example message | description +----------------------------- | --------------- | ------------------------- +json.exception.type_error.301 | cannot create object from initializer list | To create an object from an initializer list, the initializer list must consist only of a list of pairs whose first element is a string. When this constraint is violated, an array is created instead. +json.exception.type_error.302 | type must be object, but is array | During implicit or explicit value conversion, the JSON type must be compatible to the target type. For instance, a JSON string can only be converted into string types, but not into numbers or boolean types. +json.exception.type_error.303 | incompatible ReferenceType for get_ref, actual type is object | To retrieve a reference to a value stored in a @ref basic_json object with @ref get_ref, the type of the reference must match the value type. For instance, for a JSON array, the @a ReferenceType must be @ref array_t &. +json.exception.type_error.304 | cannot use at() with string | The @ref at() member functions can only be executed for certain JSON types. +json.exception.type_error.305 | cannot use operator[] with string | The @ref operator[] member functions can only be executed for certain JSON types. +json.exception.type_error.306 | cannot use value() with string | The @ref value() member functions can only be executed for certain JSON types. +json.exception.type_error.307 | cannot use erase() with string | The @ref erase() member functions can only be executed for certain JSON types. +json.exception.type_error.308 | cannot use push_back() with string | The @ref push_back() and @ref operator+= member functions can only be executed for certain JSON types. +json.exception.type_error.309 | cannot use insert() with | The @ref insert() member functions can only be executed for certain JSON types. +json.exception.type_error.310 | cannot use swap() with number | The @ref swap() member functions can only be executed for certain JSON types. +json.exception.type_error.311 | cannot use emplace_back() with string | The @ref emplace_back() member function can only be executed for certain JSON types. +json.exception.type_error.312 | cannot use update() with string | The @ref update() member functions can only be executed for certain JSON types. +json.exception.type_error.313 | invalid value to unflatten | The @ref unflatten function converts an object whose keys are JSON Pointers back into an arbitrary nested JSON value. The JSON Pointers must not overlap, because then the resulting value would not be well defined. +json.exception.type_error.314 | only objects can be unflattened | The @ref unflatten function only works for an object whose keys are JSON Pointers. +json.exception.type_error.315 | values in object must be primitive | The @ref unflatten function only works for an object whose keys are JSON Pointers and whose values are primitive. +json.exception.type_error.316 | invalid UTF-8 byte at index 10: 0x7E | The @ref dump function only works with UTF-8 encoded strings; that is, if you assign a `std::string` to a JSON value, make sure it is UTF-8 encoded. | +json.exception.type_error.317 | JSON value cannot be serialized to requested format | The dynamic type of the object cannot be represented in the requested serialization format (e.g. a raw `true` or `null` JSON object cannot be serialized to BSON) | + +@liveexample{The following code shows how a `type_error` exception can be +caught.,type_error} + +@sa - @ref exception for the base class of the library exceptions +@sa - @ref parse_error for exceptions indicating a parse error +@sa - @ref invalid_iterator for exceptions indicating errors with iterators +@sa - @ref out_of_range for exceptions indicating access out of the defined range +@sa - @ref other_error for exceptions indicating other library errors + +@since version 3.0.0 +*/ +class type_error : public exception +{ + public: + static type_error create(int id_, const std::string& what_arg) + { + std::string w = exception::name("type_error", id_) + what_arg; + return type_error(id_, w.c_str()); + } + + private: + type_error(int id_, const char* what_arg) : exception(id_, what_arg) {} +}; + +/*! +@brief exception indicating access out of the defined range + +This exception is thrown in case a library function is called on an input +parameter that exceeds the expected range, for instance in case of array +indices or nonexisting object keys. + +Exceptions have ids 4xx. + +name / id | example message | description +------------------------------- | --------------- | ------------------------- +json.exception.out_of_range.401 | array index 3 is out of range | The provided array index @a i is larger than @a size-1. +json.exception.out_of_range.402 | array index '-' (3) is out of range | The special array index `-` in a JSON Pointer never describes a valid element of the array, but the index past the end. That is, it can only be used to add elements at this position, but not to read it. +json.exception.out_of_range.403 | key 'foo' not found | The provided key was not found in the JSON object. +json.exception.out_of_range.404 | unresolved reference token 'foo' | A reference token in a JSON Pointer could not be resolved. +json.exception.out_of_range.405 | JSON pointer has no parent | The JSON Patch operations 'remove' and 'add' can not be applied to the root element of the JSON value. +json.exception.out_of_range.406 | number overflow parsing '10E1000' | A parsed number could not be stored as without changing it to NaN or INF. +json.exception.out_of_range.407 | number overflow serializing '9223372036854775808' | UBJSON and BSON only support integer numbers up to 9223372036854775807. | +json.exception.out_of_range.408 | excessive array size: 8658170730974374167 | The size (following `#`) of an UBJSON array or object exceeds the maximal capacity. | +json.exception.out_of_range.409 | BSON key cannot contain code point U+0000 (at byte 2) | Key identifiers to be serialized to BSON cannot contain code point U+0000, since the key is stored as zero-terminated c-string | + +@liveexample{The following code shows how an `out_of_range` exception can be +caught.,out_of_range} + +@sa - @ref exception for the base class of the library exceptions +@sa - @ref parse_error for exceptions indicating a parse error +@sa - @ref invalid_iterator for exceptions indicating errors with iterators +@sa - @ref type_error for exceptions indicating executing a member function with + a wrong type +@sa - @ref other_error for exceptions indicating other library errors + +@since version 3.0.0 +*/ +class out_of_range : public exception +{ + public: + static out_of_range create(int id_, const std::string& what_arg) + { + std::string w = exception::name("out_of_range", id_) + what_arg; + return out_of_range(id_, w.c_str()); + } + + private: + out_of_range(int id_, const char* what_arg) : exception(id_, what_arg) {} +}; + +/*! +@brief exception indicating other library errors + +This exception is thrown in case of errors that cannot be classified with the +other exception types. + +Exceptions have ids 5xx. + +name / id | example message | description +------------------------------ | --------------- | ------------------------- +json.exception.other_error.501 | unsuccessful: {"op":"test","path":"/baz", "value":"bar"} | A JSON Patch operation 'test' failed. The unsuccessful operation is also printed. + +@sa - @ref exception for the base class of the library exceptions +@sa - @ref parse_error for exceptions indicating a parse error +@sa - @ref invalid_iterator for exceptions indicating errors with iterators +@sa - @ref type_error for exceptions indicating executing a member function with + a wrong type +@sa - @ref out_of_range for exceptions indicating access out of the defined range + +@liveexample{The following code shows how an `other_error` exception can be +caught.,other_error} + +@since version 3.0.0 +*/ +class other_error : public exception +{ + public: + static other_error create(int id_, const std::string& what_arg) + { + std::string w = exception::name("other_error", id_) + what_arg; + return other_error(id_, w.c_str()); + } + + private: + other_error(int id_, const char* what_arg) : exception(id_, what_arg) {} +}; +} // namespace detail +} // namespace nlohmann + +// #include <nlohmann/detail/macro_scope.hpp> + + +#include <utility> // pair + +// This file contains all internal macro definitions +// You MUST include macro_unscope.hpp at the end of json.hpp to undef all of them + +// exclude unsupported compilers +#if !defined(JSON_SKIP_UNSUPPORTED_COMPILER_CHECK) + #if defined(__clang__) + #if (__clang_major__ * 10000 + __clang_minor__ * 100 + __clang_patchlevel__) < 30400 + #error "unsupported Clang version - see https://github.com/nlohmann/json#supported-compilers" + #endif + #elif defined(__GNUC__) && !(defined(__ICC) || defined(__INTEL_COMPILER)) + #if (__GNUC__ * 10000 + __GNUC_MINOR__ * 100 + __GNUC_PATCHLEVEL__) < 40800 + #error "unsupported GCC version - see https://github.com/nlohmann/json#supported-compilers" + #endif + #endif +#endif + +// disable float-equal warnings on GCC/clang +#if defined(__clang__) || defined(__GNUC__) || defined(__GNUG__) + #pragma GCC diagnostic push + #pragma GCC diagnostic ignored "-Wfloat-equal" +#endif + +// disable documentation warnings on clang +#if defined(__clang__) + #pragma GCC diagnostic push + #pragma GCC diagnostic ignored "-Wdocumentation" +#endif + +// allow for portable deprecation warnings +#if defined(__clang__) || defined(__GNUC__) || defined(__GNUG__) + #define JSON_DEPRECATED __attribute__((deprecated)) +#elif defined(_MSC_VER) + #define JSON_DEPRECATED __declspec(deprecated) +#else + #define JSON_DEPRECATED +#endif + +// allow for portable nodiscard warnings +#if defined(__has_cpp_attribute) + #if __has_cpp_attribute(nodiscard) + #define JSON_NODISCARD [[nodiscard]] + #elif __has_cpp_attribute(gnu::warn_unused_result) + #define JSON_NODISCARD [[gnu::warn_unused_result]] + #else + #define JSON_NODISCARD + #endif +#else + #define JSON_NODISCARD +#endif + +// allow to disable exceptions +#if (defined(__cpp_exceptions) || defined(__EXCEPTIONS) || defined(_CPPUNWIND)) && !defined(JSON_NOEXCEPTION) + #define JSON_THROW(exception) throw exception + #define JSON_TRY try + #define JSON_CATCH(exception) catch(exception) + #define JSON_INTERNAL_CATCH(exception) catch(exception) +#else + #include <cstdlib> + #define JSON_THROW(exception) std::abort() + #define JSON_TRY if(true) + #define JSON_CATCH(exception) if(false) + #define JSON_INTERNAL_CATCH(exception) if(false) +#endif + +// override exception macros +#if defined(JSON_THROW_USER) + #undef JSON_THROW + #define JSON_THROW JSON_THROW_USER +#endif +#if defined(JSON_TRY_USER) + #undef JSON_TRY + #define JSON_TRY JSON_TRY_USER +#endif +#if defined(JSON_CATCH_USER) + #undef JSON_CATCH + #define JSON_CATCH JSON_CATCH_USER + #undef JSON_INTERNAL_CATCH + #define JSON_INTERNAL_CATCH JSON_CATCH_USER +#endif +#if defined(JSON_INTERNAL_CATCH_USER) + #undef JSON_INTERNAL_CATCH + #define JSON_INTERNAL_CATCH JSON_INTERNAL_CATCH_USER +#endif + +// manual branch prediction +#if defined(__clang__) || defined(__GNUC__) || defined(__GNUG__) + #define JSON_LIKELY(x) __builtin_expect(x, 1) + #define JSON_UNLIKELY(x) __builtin_expect(x, 0) +#else + #define JSON_LIKELY(x) x + #define JSON_UNLIKELY(x) x +#endif + +// C++ language standard detection +#if (defined(__cplusplus) && __cplusplus >= 201703L) || (defined(_HAS_CXX17) && _HAS_CXX17 == 1) // fix for issue #464 + #define JSON_HAS_CPP_17 + #define JSON_HAS_CPP_14 +#elif (defined(__cplusplus) && __cplusplus >= 201402L) || (defined(_HAS_CXX14) && _HAS_CXX14 == 1) + #define JSON_HAS_CPP_14 +#endif + +/*! +@brief macro to briefly define a mapping between an enum and JSON +@def NLOHMANN_JSON_SERIALIZE_ENUM +@since version 3.4.0 +*/ +#define NLOHMANN_JSON_SERIALIZE_ENUM(ENUM_TYPE, ...) \ + template<typename BasicJsonType> \ + inline void to_json(BasicJsonType& j, const ENUM_TYPE& e) \ + { \ + static_assert(std::is_enum<ENUM_TYPE>::value, #ENUM_TYPE " must be an enum!"); \ + static const std::pair<ENUM_TYPE, BasicJsonType> m[] = __VA_ARGS__; \ + auto it = std::find_if(std::begin(m), std::end(m), \ + [e](const std::pair<ENUM_TYPE, BasicJsonType>& ej_pair) -> bool \ + { \ + return ej_pair.first == e; \ + }); \ + j = ((it != std::end(m)) ? it : std::begin(m))->second; \ + } \ + template<typename BasicJsonType> \ + inline void from_json(const BasicJsonType& j, ENUM_TYPE& e) \ + { \ + static_assert(std::is_enum<ENUM_TYPE>::value, #ENUM_TYPE " must be an enum!"); \ + static const std::pair<ENUM_TYPE, BasicJsonType> m[] = __VA_ARGS__; \ + auto it = std::find_if(std::begin(m), std::end(m), \ + [j](const std::pair<ENUM_TYPE, BasicJsonType>& ej_pair) -> bool \ + { \ + return ej_pair.second == j; \ + }); \ + e = ((it != std::end(m)) ? it : std::begin(m))->first; \ + } + +// Ugly macros to avoid uglier copy-paste when specializing basic_json. They +// may be removed in the future once the class is split. + +#define NLOHMANN_BASIC_JSON_TPL_DECLARATION \ + template<template<typename, typename, typename...> class ObjectType, \ + template<typename, typename...> class ArrayType, \ + class StringType, class BooleanType, class NumberIntegerType, \ + class NumberUnsignedType, class NumberFloatType, \ + template<typename> class AllocatorType, \ + template<typename, typename = void> class JSONSerializer> + +#define NLOHMANN_BASIC_JSON_TPL \ + basic_json<ObjectType, ArrayType, StringType, BooleanType, \ + NumberIntegerType, NumberUnsignedType, NumberFloatType, \ + AllocatorType, JSONSerializer> + +// #include <nlohmann/detail/meta/cpp_future.hpp> + + +#include <ciso646> // not +#include <cstddef> // size_t +#include <type_traits> // conditional, enable_if, false_type, integral_constant, is_constructible, is_integral, is_same, remove_cv, remove_reference, true_type + +namespace nlohmann +{ +namespace detail +{ +// alias templates to reduce boilerplate +template<bool B, typename T = void> +using enable_if_t = typename std::enable_if<B, T>::type; + +template<typename T> +using uncvref_t = typename std::remove_cv<typename std::remove_reference<T>::type>::type; + +// implementation of C++14 index_sequence and affiliates +// source: https://stackoverflow.com/a/32223343 +template<std::size_t... Ints> +struct index_sequence +{ + using type = index_sequence; + using value_type = std::size_t; + static constexpr std::size_t size() noexcept + { + return sizeof...(Ints); + } +}; + +template<class Sequence1, class Sequence2> +struct merge_and_renumber; + +template<std::size_t... I1, std::size_t... I2> +struct merge_and_renumber<index_sequence<I1...>, index_sequence<I2...>> + : index_sequence < I1..., (sizeof...(I1) + I2)... > {}; + +template<std::size_t N> +struct make_index_sequence + : merge_and_renumber < typename make_index_sequence < N / 2 >::type, + typename make_index_sequence < N - N / 2 >::type > {}; + +template<> struct make_index_sequence<0> : index_sequence<> {}; +template<> struct make_index_sequence<1> : index_sequence<0> {}; + +template<typename... Ts> +using index_sequence_for = make_index_sequence<sizeof...(Ts)>; + +// dispatch utility (taken from ranges-v3) +template<unsigned N> struct priority_tag : priority_tag < N - 1 > {}; +template<> struct priority_tag<0> {}; + +// taken from ranges-v3 +template<typename T> +struct static_const +{ + static constexpr T value{}; +}; + +template<typename T> +constexpr T static_const<T>::value; +} // namespace detail +} // namespace nlohmann + +// #include <nlohmann/detail/meta/type_traits.hpp> + + +#include <ciso646> // not +#include <limits> // numeric_limits +#include <type_traits> // false_type, is_constructible, is_integral, is_same, true_type +#include <utility> // declval + +// #include <nlohmann/detail/iterators/iterator_traits.hpp> + + +#include <iterator> // random_access_iterator_tag + +// #include <nlohmann/detail/meta/void_t.hpp> + + +namespace nlohmann +{ +namespace detail +{ +template <typename ...Ts> struct make_void +{ + using type = void; +}; +template <typename ...Ts> using void_t = typename make_void<Ts...>::type; +} // namespace detail +} // namespace nlohmann + +// #include <nlohmann/detail/meta/cpp_future.hpp> + + +namespace nlohmann +{ +namespace detail +{ +template <typename It, typename = void> +struct iterator_types {}; + +template <typename It> +struct iterator_types < + It, + void_t<typename It::difference_type, typename It::value_type, typename It::pointer, + typename It::reference, typename It::iterator_category >> +{ + using difference_type = typename It::difference_type; + using value_type = typename It::value_type; + using pointer = typename It::pointer; + using reference = typename It::reference; + using iterator_category = typename It::iterator_category; +}; + +// This is required as some compilers implement std::iterator_traits in a way that +// doesn't work with SFINAE. See https://github.com/nlohmann/json/issues/1341. +template <typename T, typename = void> +struct iterator_traits +{ +}; + +template <typename T> +struct iterator_traits < T, enable_if_t < !std::is_pointer<T>::value >> + : iterator_types<T> +{ +}; + +template <typename T> +struct iterator_traits<T*, enable_if_t<std::is_object<T>::value>> +{ + using iterator_category = std::random_access_iterator_tag; + using value_type = T; + using difference_type = ptrdiff_t; + using pointer = T*; + using reference = T&; +}; +} // namespace detail +} // namespace nlohmann + +// #include <nlohmann/detail/macro_scope.hpp> + +// #include <nlohmann/detail/meta/cpp_future.hpp> + +// #include <nlohmann/detail/meta/detected.hpp> + + +#include <type_traits> + +// #include <nlohmann/detail/meta/void_t.hpp> + + +// http://en.cppreference.com/w/cpp/experimental/is_detected +namespace nlohmann +{ +namespace detail +{ +struct nonesuch +{ + nonesuch() = delete; + ~nonesuch() = delete; + nonesuch(nonesuch const&) = delete; + nonesuch(nonesuch const&&) = delete; + void operator=(nonesuch const&) = delete; + void operator=(nonesuch&&) = delete; +}; + +template <class Default, + class AlwaysVoid, + template <class...> class Op, + class... Args> +struct detector +{ + using value_t = std::false_type; + using type = Default; +}; + +template <class Default, template <class...> class Op, class... Args> +struct detector<Default, void_t<Op<Args...>>, Op, Args...> +{ + using value_t = std::true_type; + using type = Op<Args...>; +}; + +template <template <class...> class Op, class... Args> +using is_detected = typename detector<nonesuch, void, Op, Args...>::value_t; + +template <template <class...> class Op, class... Args> +using detected_t = typename detector<nonesuch, void, Op, Args...>::type; + +template <class Default, template <class...> class Op, class... Args> +using detected_or = detector<Default, void, Op, Args...>; + +template <class Default, template <class...> class Op, class... Args> +using detected_or_t = typename detected_or<Default, Op, Args...>::type; + +template <class Expected, template <class...> class Op, class... Args> +using is_detected_exact = std::is_same<Expected, detected_t<Op, Args...>>; + +template <class To, template <class...> class Op, class... Args> +using is_detected_convertible = + std::is_convertible<detected_t<Op, Args...>, To>; +} // namespace detail +} // namespace nlohmann + +// #include <nlohmann/json_fwd.hpp> +#ifndef INCLUDE_NLOHMANN_JSON_FWD_HPP_ +#define INCLUDE_NLOHMANN_JSON_FWD_HPP_ + +#include <cstdint> // int64_t, uint64_t +#include <map> // map +#include <memory> // allocator +#include <string> // string +#include <vector> // vector + +/*! +@brief namespace for Niels Lohmann +@see https://github.com/nlohmann +@since version 1.0.0 +*/ +namespace nlohmann +{ +/*! +@brief default JSONSerializer template argument + +This serializer ignores the template arguments and uses ADL +([argument-dependent lookup](https://en.cppreference.com/w/cpp/language/adl)) +for serialization. +*/ +template<typename T = void, typename SFINAE = void> +struct adl_serializer; + +template<template<typename U, typename V, typename... Args> class ObjectType = + std::map, + template<typename U, typename... Args> class ArrayType = std::vector, + class StringType = std::string, class BooleanType = bool, + class NumberIntegerType = std::int64_t, + class NumberUnsignedType = std::uint64_t, + class NumberFloatType = double, + template<typename U> class AllocatorType = std::allocator, + template<typename T, typename SFINAE = void> class JSONSerializer = + adl_serializer> +class basic_json; + +/*! +@brief JSON Pointer + +A JSON pointer defines a string syntax for identifying a specific value +within a JSON document. It can be used with functions `at` and +`operator[]`. Furthermore, JSON pointers are the base for JSON patches. + +@sa [RFC 6901](https://tools.ietf.org/html/rfc6901) + +@since version 2.0.0 +*/ +template<typename BasicJsonType> +class json_pointer; + +/*! +@brief default JSON class + +This type is the default specialization of the @ref basic_json class which +uses the standard template types. + +@since version 1.0.0 +*/ +using json = basic_json<>; +} // namespace nlohmann + +#endif // INCLUDE_NLOHMANN_JSON_FWD_HPP_ + + +namespace nlohmann +{ +/*! +@brief detail namespace with internal helper functions + +This namespace collects functions that should not be exposed, +implementations of some @ref basic_json methods, and meta-programming helpers. + +@since version 2.1.0 +*/ +namespace detail +{ +///////////// +// helpers // +///////////// + +// Note to maintainers: +// +// Every trait in this file expects a non CV-qualified type. +// The only exceptions are in the 'aliases for detected' section +// (i.e. those of the form: decltype(T::member_function(std::declval<T>()))) +// +// In this case, T has to be properly CV-qualified to constraint the function arguments +// (e.g. to_json(BasicJsonType&, const T&)) + +template<typename> struct is_basic_json : std::false_type {}; + +NLOHMANN_BASIC_JSON_TPL_DECLARATION +struct is_basic_json<NLOHMANN_BASIC_JSON_TPL> : std::true_type {}; + +////////////////////////// +// aliases for detected // +////////////////////////// + +template <typename T> +using mapped_type_t = typename T::mapped_type; + +template <typename T> +using key_type_t = typename T::key_type; + +template <typename T> +using value_type_t = typename T::value_type; + +template <typename T> +using difference_type_t = typename T::difference_type; + +template <typename T> +using pointer_t = typename T::pointer; + +template <typename T> +using reference_t = typename T::reference; + +template <typename T> +using iterator_category_t = typename T::iterator_category; + +template <typename T> +using iterator_t = typename T::iterator; + +template <typename T, typename... Args> +using to_json_function = decltype(T::to_json(std::declval<Args>()...)); + +template <typename T, typename... Args> +using from_json_function = decltype(T::from_json(std::declval<Args>()...)); + +template <typename T, typename U> +using get_template_function = decltype(std::declval<T>().template get<U>()); + +// trait checking if JSONSerializer<T>::from_json(json const&, udt&) exists +template <typename BasicJsonType, typename T, typename = void> +struct has_from_json : std::false_type {}; + +template <typename BasicJsonType, typename T> +struct has_from_json<BasicJsonType, T, + enable_if_t<not is_basic_json<T>::value>> +{ + using serializer = typename BasicJsonType::template json_serializer<T, void>; + + static constexpr bool value = + is_detected_exact<void, from_json_function, serializer, + const BasicJsonType&, T&>::value; +}; + +// This trait checks if JSONSerializer<T>::from_json(json const&) exists +// this overload is used for non-default-constructible user-defined-types +template <typename BasicJsonType, typename T, typename = void> +struct has_non_default_from_json : std::false_type {}; + +template<typename BasicJsonType, typename T> +struct has_non_default_from_json<BasicJsonType, T, enable_if_t<not is_basic_json<T>::value>> +{ + using serializer = typename BasicJsonType::template json_serializer<T, void>; + + static constexpr bool value = + is_detected_exact<T, from_json_function, serializer, + const BasicJsonType&>::value; +}; + +// This trait checks if BasicJsonType::json_serializer<T>::to_json exists +// Do not evaluate the trait when T is a basic_json type, to avoid template instantiation infinite recursion. +template <typename BasicJsonType, typename T, typename = void> +struct has_to_json : std::false_type {}; + +template <typename BasicJsonType, typename T> +struct has_to_json<BasicJsonType, T, enable_if_t<not is_basic_json<T>::value>> +{ + using serializer = typename BasicJsonType::template json_serializer<T, void>; + + static constexpr bool value = + is_detected_exact<void, to_json_function, serializer, BasicJsonType&, + T>::value; +}; + + +/////////////////// +// is_ functions // +/////////////////// + +template <typename T, typename = void> +struct is_iterator_traits : std::false_type {}; + +template <typename T> +struct is_iterator_traits<iterator_traits<T>> +{ + private: + using traits = iterator_traits<T>; + + public: + static constexpr auto value = + is_detected<value_type_t, traits>::value && + is_detected<difference_type_t, traits>::value && + is_detected<pointer_t, traits>::value && + is_detected<iterator_category_t, traits>::value && + is_detected<reference_t, traits>::value; +}; + +// source: https://stackoverflow.com/a/37193089/4116453 + +template <typename T, typename = void> +struct is_complete_type : std::false_type {}; + +template <typename T> +struct is_complete_type<T, decltype(void(sizeof(T)))> : std::true_type {}; + +template <typename BasicJsonType, typename CompatibleObjectType, + typename = void> +struct is_compatible_object_type_impl : std::false_type {}; + +template <typename BasicJsonType, typename CompatibleObjectType> +struct is_compatible_object_type_impl < + BasicJsonType, CompatibleObjectType, + enable_if_t<is_detected<mapped_type_t, CompatibleObjectType>::value and + is_detected<key_type_t, CompatibleObjectType>::value >> +{ + + using object_t = typename BasicJsonType::object_t; + + // macOS's is_constructible does not play well with nonesuch... + static constexpr bool value = + std::is_constructible<typename object_t::key_type, + typename CompatibleObjectType::key_type>::value and + std::is_constructible<typename object_t::mapped_type, + typename CompatibleObjectType::mapped_type>::value; +}; + +template <typename BasicJsonType, typename CompatibleObjectType> +struct is_compatible_object_type + : is_compatible_object_type_impl<BasicJsonType, CompatibleObjectType> {}; + +template <typename BasicJsonType, typename ConstructibleObjectType, + typename = void> +struct is_constructible_object_type_impl : std::false_type {}; + +template <typename BasicJsonType, typename ConstructibleObjectType> +struct is_constructible_object_type_impl < + BasicJsonType, ConstructibleObjectType, + enable_if_t<is_detected<mapped_type_t, ConstructibleObjectType>::value and + is_detected<key_type_t, ConstructibleObjectType>::value >> +{ + using object_t = typename BasicJsonType::object_t; + + static constexpr bool value = + (std::is_constructible<typename ConstructibleObjectType::key_type, typename object_t::key_type>::value and + std::is_same<typename object_t::mapped_type, typename ConstructibleObjectType::mapped_type>::value) or + (has_from_json<BasicJsonType, typename ConstructibleObjectType::mapped_type>::value or + has_non_default_from_json<BasicJsonType, typename ConstructibleObjectType::mapped_type >::value); +}; + +template <typename BasicJsonType, typename ConstructibleObjectType> +struct is_constructible_object_type + : is_constructible_object_type_impl<BasicJsonType, + ConstructibleObjectType> {}; + +template <typename BasicJsonType, typename CompatibleStringType, + typename = void> +struct is_compatible_string_type_impl : std::false_type {}; + +template <typename BasicJsonType, typename CompatibleStringType> +struct is_compatible_string_type_impl < + BasicJsonType, CompatibleStringType, + enable_if_t<is_detected_exact<typename BasicJsonType::string_t::value_type, + value_type_t, CompatibleStringType>::value >> +{ + static constexpr auto value = + std::is_constructible<typename BasicJsonType::string_t, CompatibleStringType>::value; +}; + +template <typename BasicJsonType, typename ConstructibleStringType> +struct is_compatible_string_type + : is_compatible_string_type_impl<BasicJsonType, ConstructibleStringType> {}; + +template <typename BasicJsonType, typename ConstructibleStringType, + typename = void> +struct is_constructible_string_type_impl : std::false_type {}; + +template <typename BasicJsonType, typename ConstructibleStringType> +struct is_constructible_string_type_impl < + BasicJsonType, ConstructibleStringType, + enable_if_t<is_detected_exact<typename BasicJsonType::string_t::value_type, + value_type_t, ConstructibleStringType>::value >> +{ + static constexpr auto value = + std::is_constructible<ConstructibleStringType, + typename BasicJsonType::string_t>::value; +}; + +template <typename BasicJsonType, typename ConstructibleStringType> +struct is_constructible_string_type + : is_constructible_string_type_impl<BasicJsonType, ConstructibleStringType> {}; + +template <typename BasicJsonType, typename CompatibleArrayType, typename = void> +struct is_compatible_array_type_impl : std::false_type {}; + +template <typename BasicJsonType, typename CompatibleArrayType> +struct is_compatible_array_type_impl < + BasicJsonType, CompatibleArrayType, + enable_if_t<is_detected<value_type_t, CompatibleArrayType>::value and + is_detected<iterator_t, CompatibleArrayType>::value and +// This is needed because json_reverse_iterator has a ::iterator type... +// Therefore it is detected as a CompatibleArrayType. +// The real fix would be to have an Iterable concept. + not is_iterator_traits< + iterator_traits<CompatibleArrayType>>::value >> +{ + static constexpr bool value = + std::is_constructible<BasicJsonType, + typename CompatibleArrayType::value_type>::value; +}; + +template <typename BasicJsonType, typename CompatibleArrayType> +struct is_compatible_array_type + : is_compatible_array_type_impl<BasicJsonType, CompatibleArrayType> {}; + +template <typename BasicJsonType, typename ConstructibleArrayType, typename = void> +struct is_constructible_array_type_impl : std::false_type {}; + +template <typename BasicJsonType, typename ConstructibleArrayType> +struct is_constructible_array_type_impl < + BasicJsonType, ConstructibleArrayType, + enable_if_t<std::is_same<ConstructibleArrayType, + typename BasicJsonType::value_type>::value >> + : std::true_type {}; + +template <typename BasicJsonType, typename ConstructibleArrayType> +struct is_constructible_array_type_impl < + BasicJsonType, ConstructibleArrayType, + enable_if_t<not std::is_same<ConstructibleArrayType, + typename BasicJsonType::value_type>::value and + is_detected<value_type_t, ConstructibleArrayType>::value and + is_detected<iterator_t, ConstructibleArrayType>::value and + is_complete_type< + detected_t<value_type_t, ConstructibleArrayType>>::value >> +{ + static constexpr bool value = + // This is needed because json_reverse_iterator has a ::iterator type, + // furthermore, std::back_insert_iterator (and other iterators) have a base class `iterator`... + // Therefore it is detected as a ConstructibleArrayType. + // The real fix would be to have an Iterable concept. + not is_iterator_traits < + iterator_traits<ConstructibleArrayType >>::value and + + (std::is_same<typename ConstructibleArrayType::value_type, typename BasicJsonType::array_t::value_type>::value or + has_from_json<BasicJsonType, + typename ConstructibleArrayType::value_type>::value or + has_non_default_from_json < + BasicJsonType, typename ConstructibleArrayType::value_type >::value); +}; + +template <typename BasicJsonType, typename ConstructibleArrayType> +struct is_constructible_array_type + : is_constructible_array_type_impl<BasicJsonType, ConstructibleArrayType> {}; + +template <typename RealIntegerType, typename CompatibleNumberIntegerType, + typename = void> +struct is_compatible_integer_type_impl : std::false_type {}; + +template <typename RealIntegerType, typename CompatibleNumberIntegerType> +struct is_compatible_integer_type_impl < + RealIntegerType, CompatibleNumberIntegerType, + enable_if_t<std::is_integral<RealIntegerType>::value and + std::is_integral<CompatibleNumberIntegerType>::value and + not std::is_same<bool, CompatibleNumberIntegerType>::value >> +{ + // is there an assert somewhere on overflows? + using RealLimits = std::numeric_limits<RealIntegerType>; + using CompatibleLimits = std::numeric_limits<CompatibleNumberIntegerType>; + + static constexpr auto value = + std::is_constructible<RealIntegerType, + CompatibleNumberIntegerType>::value and + CompatibleLimits::is_integer and + RealLimits::is_signed == CompatibleLimits::is_signed; +}; + +template <typename RealIntegerType, typename CompatibleNumberIntegerType> +struct is_compatible_integer_type + : is_compatible_integer_type_impl<RealIntegerType, + CompatibleNumberIntegerType> {}; + +template <typename BasicJsonType, typename CompatibleType, typename = void> +struct is_compatible_type_impl: std::false_type {}; + +template <typename BasicJsonType, typename CompatibleType> +struct is_compatible_type_impl < + BasicJsonType, CompatibleType, + enable_if_t<is_complete_type<CompatibleType>::value >> +{ + static constexpr bool value = + has_to_json<BasicJsonType, CompatibleType>::value; +}; + +template <typename BasicJsonType, typename CompatibleType> +struct is_compatible_type + : is_compatible_type_impl<BasicJsonType, CompatibleType> {}; +} // namespace detail +} // namespace nlohmann + +// #include <nlohmann/detail/value_t.hpp> + + +#include <array> // array +#include <ciso646> // and +#include <cstddef> // size_t +#include <cstdint> // uint8_t +#include <string> // string + +namespace nlohmann +{ +namespace detail +{ +/////////////////////////// +// JSON type enumeration // +/////////////////////////// + +/*! +@brief the JSON type enumeration + +This enumeration collects the different JSON types. It is internally used to +distinguish the stored values, and the functions @ref basic_json::is_null(), +@ref basic_json::is_object(), @ref basic_json::is_array(), +@ref basic_json::is_string(), @ref basic_json::is_boolean(), +@ref basic_json::is_number() (with @ref basic_json::is_number_integer(), +@ref basic_json::is_number_unsigned(), and @ref basic_json::is_number_float()), +@ref basic_json::is_discarded(), @ref basic_json::is_primitive(), and +@ref basic_json::is_structured() rely on it. + +@note There are three enumeration entries (number_integer, number_unsigned, and +number_float), because the library distinguishes these three types for numbers: +@ref basic_json::number_unsigned_t is used for unsigned integers, +@ref basic_json::number_integer_t is used for signed integers, and +@ref basic_json::number_float_t is used for floating-point numbers or to +approximate integers which do not fit in the limits of their respective type. + +@sa @ref basic_json::basic_json(const value_t value_type) -- create a JSON +value with the default value for a given type + +@since version 1.0.0 +*/ +enum class value_t : std::uint8_t +{ + null, ///< null value + object, ///< object (unordered set of name/value pairs) + array, ///< array (ordered collection of values) + string, ///< string value + boolean, ///< boolean value + number_integer, ///< number value (signed integer) + number_unsigned, ///< number value (unsigned integer) + number_float, ///< number value (floating-point) + discarded ///< discarded by the the parser callback function +}; + +/*! +@brief comparison operator for JSON types + +Returns an ordering that is similar to Python: +- order: null < boolean < number < object < array < string +- furthermore, each type is not smaller than itself +- discarded values are not comparable + +@since version 1.0.0 +*/ +inline bool operator<(const value_t lhs, const value_t rhs) noexcept +{ + static constexpr std::array<std::uint8_t, 8> order = {{ + 0 /* null */, 3 /* object */, 4 /* array */, 5 /* string */, + 1 /* boolean */, 2 /* integer */, 2 /* unsigned */, 2 /* float */ + } + }; + + const auto l_index = static_cast<std::size_t>(lhs); + const auto r_index = static_cast<std::size_t>(rhs); + return l_index < order.size() and r_index < order.size() and order[l_index] < order[r_index]; +} +} // namespace detail +} // namespace nlohmann + + +namespace nlohmann +{ +namespace detail +{ +template<typename BasicJsonType> +void from_json(const BasicJsonType& j, typename std::nullptr_t& n) +{ + if (JSON_UNLIKELY(not j.is_null())) + { + JSON_THROW(type_error::create(302, "type must be null, but is " + std::string(j.type_name()))); + } + n = nullptr; +} + +// overloads for basic_json template parameters +template<typename BasicJsonType, typename ArithmeticType, + enable_if_t<std::is_arithmetic<ArithmeticType>::value and + not std::is_same<ArithmeticType, typename BasicJsonType::boolean_t>::value, + int> = 0> +void get_arithmetic_value(const BasicJsonType& j, ArithmeticType& val) +{ + switch (static_cast<value_t>(j)) + { + case value_t::number_unsigned: + { + val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::number_unsigned_t*>()); + break; + } + case value_t::number_integer: + { + val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::number_integer_t*>()); + break; + } + case value_t::number_float: + { + val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::number_float_t*>()); + break; + } + + default: + JSON_THROW(type_error::create(302, "type must be number, but is " + std::string(j.type_name()))); + } +} + +template<typename BasicJsonType> +void from_json(const BasicJsonType& j, typename BasicJsonType::boolean_t& b) +{ + if (JSON_UNLIKELY(not j.is_boolean())) + { + JSON_THROW(type_error::create(302, "type must be boolean, but is " + std::string(j.type_name()))); + } + b = *j.template get_ptr<const typename BasicJsonType::boolean_t*>(); +} + +template<typename BasicJsonType> +void from_json(const BasicJsonType& j, typename BasicJsonType::string_t& s) +{ + if (JSON_UNLIKELY(not j.is_string())) + { + JSON_THROW(type_error::create(302, "type must be string, but is " + std::string(j.type_name()))); + } + s = *j.template get_ptr<const typename BasicJsonType::string_t*>(); +} + +template < + typename BasicJsonType, typename ConstructibleStringType, + enable_if_t < + is_constructible_string_type<BasicJsonType, ConstructibleStringType>::value and + not std::is_same<typename BasicJsonType::string_t, + ConstructibleStringType>::value, + int > = 0 > +void from_json(const BasicJsonType& j, ConstructibleStringType& s) +{ + if (JSON_UNLIKELY(not j.is_string())) + { + JSON_THROW(type_error::create(302, "type must be string, but is " + std::string(j.type_name()))); + } + + s = *j.template get_ptr<const typename BasicJsonType::string_t*>(); +} + +template<typename BasicJsonType> +void from_json(const BasicJsonType& j, typename BasicJsonType::number_float_t& val) +{ + get_arithmetic_value(j, val); +} + +template<typename BasicJsonType> +void from_json(const BasicJsonType& j, typename BasicJsonType::number_unsigned_t& val) +{ + get_arithmetic_value(j, val); +} + +template<typename BasicJsonType> +void from_json(const BasicJsonType& j, typename BasicJsonType::number_integer_t& val) +{ + get_arithmetic_value(j, val); +} + +template<typename BasicJsonType, typename EnumType, + enable_if_t<std::is_enum<EnumType>::value, int> = 0> +void from_json(const BasicJsonType& j, EnumType& e) +{ + typename std::underlying_type<EnumType>::type val; + get_arithmetic_value(j, val); + e = static_cast<EnumType>(val); +} + +// forward_list doesn't have an insert method +template<typename BasicJsonType, typename T, typename Allocator, + enable_if_t<std::is_convertible<BasicJsonType, T>::value, int> = 0> +void from_json(const BasicJsonType& j, std::forward_list<T, Allocator>& l) +{ + if (JSON_UNLIKELY(not j.is_array())) + { + JSON_THROW(type_error::create(302, "type must be array, but is " + std::string(j.type_name()))); + } + std::transform(j.rbegin(), j.rend(), + std::front_inserter(l), [](const BasicJsonType & i) + { + return i.template get<T>(); + }); +} + +// valarray doesn't have an insert method +template<typename BasicJsonType, typename T, + enable_if_t<std::is_convertible<BasicJsonType, T>::value, int> = 0> +void from_json(const BasicJsonType& j, std::valarray<T>& l) +{ + if (JSON_UNLIKELY(not j.is_array())) + { + JSON_THROW(type_error::create(302, "type must be array, but is " + std::string(j.type_name()))); + } + l.resize(j.size()); + std::copy(j.m_value.array->begin(), j.m_value.array->end(), std::begin(l)); +} + +template<typename BasicJsonType> +void from_json_array_impl(const BasicJsonType& j, typename BasicJsonType::array_t& arr, priority_tag<3> /*unused*/) +{ + arr = *j.template get_ptr<const typename BasicJsonType::array_t*>(); +} + +template <typename BasicJsonType, typename T, std::size_t N> +auto from_json_array_impl(const BasicJsonType& j, std::array<T, N>& arr, + priority_tag<2> /*unused*/) +-> decltype(j.template get<T>(), void()) +{ + for (std::size_t i = 0; i < N; ++i) + { + arr[i] = j.at(i).template get<T>(); + } +} + +template<typename BasicJsonType, typename ConstructibleArrayType> +auto from_json_array_impl(const BasicJsonType& j, ConstructibleArrayType& arr, priority_tag<1> /*unused*/) +-> decltype( + arr.reserve(std::declval<typename ConstructibleArrayType::size_type>()), + j.template get<typename ConstructibleArrayType::value_type>(), + void()) +{ + using std::end; + + arr.reserve(j.size()); + std::transform(j.begin(), j.end(), + std::inserter(arr, end(arr)), [](const BasicJsonType & i) + { + // get<BasicJsonType>() returns *this, this won't call a from_json + // method when value_type is BasicJsonType + return i.template get<typename ConstructibleArrayType::value_type>(); + }); +} + +template <typename BasicJsonType, typename ConstructibleArrayType> +void from_json_array_impl(const BasicJsonType& j, ConstructibleArrayType& arr, + priority_tag<0> /*unused*/) +{ + using std::end; + + std::transform( + j.begin(), j.end(), std::inserter(arr, end(arr)), + [](const BasicJsonType & i) + { + // get<BasicJsonType>() returns *this, this won't call a from_json + // method when value_type is BasicJsonType + return i.template get<typename ConstructibleArrayType::value_type>(); + }); +} + +template <typename BasicJsonType, typename ConstructibleArrayType, + enable_if_t < + is_constructible_array_type<BasicJsonType, ConstructibleArrayType>::value and + not is_constructible_object_type<BasicJsonType, ConstructibleArrayType>::value and + not is_constructible_string_type<BasicJsonType, ConstructibleArrayType>::value and + not is_basic_json<ConstructibleArrayType>::value, + int > = 0 > + +auto from_json(const BasicJsonType& j, ConstructibleArrayType& arr) +-> decltype(from_json_array_impl(j, arr, priority_tag<3> {}), +j.template get<typename ConstructibleArrayType::value_type>(), +void()) +{ + if (JSON_UNLIKELY(not j.is_array())) + { + JSON_THROW(type_error::create(302, "type must be array, but is " + + std::string(j.type_name()))); + } + + from_json_array_impl(j, arr, priority_tag<3> {}); +} + +template<typename BasicJsonType, typename ConstructibleObjectType, + enable_if_t<is_constructible_object_type<BasicJsonType, ConstructibleObjectType>::value, int> = 0> +void from_json(const BasicJsonType& j, ConstructibleObjectType& obj) +{ + if (JSON_UNLIKELY(not j.is_object())) + { + JSON_THROW(type_error::create(302, "type must be object, but is " + std::string(j.type_name()))); + } + + auto inner_object = j.template get_ptr<const typename BasicJsonType::object_t*>(); + using value_type = typename ConstructibleObjectType::value_type; + std::transform( + inner_object->begin(), inner_object->end(), + std::inserter(obj, obj.begin()), + [](typename BasicJsonType::object_t::value_type const & p) + { + return value_type(p.first, p.second.template get<typename ConstructibleObjectType::mapped_type>()); + }); +} + +// overload for arithmetic types, not chosen for basic_json template arguments +// (BooleanType, etc..); note: Is it really necessary to provide explicit +// overloads for boolean_t etc. in case of a custom BooleanType which is not +// an arithmetic type? +template<typename BasicJsonType, typename ArithmeticType, + enable_if_t < + std::is_arithmetic<ArithmeticType>::value and + not std::is_same<ArithmeticType, typename BasicJsonType::number_unsigned_t>::value and + not std::is_same<ArithmeticType, typename BasicJsonType::number_integer_t>::value and + not std::is_same<ArithmeticType, typename BasicJsonType::number_float_t>::value and + not std::is_same<ArithmeticType, typename BasicJsonType::boolean_t>::value, + int> = 0> +void from_json(const BasicJsonType& j, ArithmeticType& val) +{ + switch (static_cast<value_t>(j)) + { + case value_t::number_unsigned: + { + val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::number_unsigned_t*>()); + break; + } + case value_t::number_integer: + { + val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::number_integer_t*>()); + break; + } + case value_t::number_float: + { + val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::number_float_t*>()); + break; + } + case value_t::boolean: + { + val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::boolean_t*>()); + break; + } + + default: + JSON_THROW(type_error::create(302, "type must be number, but is " + std::string(j.type_name()))); + } +} + +template<typename BasicJsonType, typename A1, typename A2> +void from_json(const BasicJsonType& j, std::pair<A1, A2>& p) +{ + p = {j.at(0).template get<A1>(), j.at(1).template get<A2>()}; +} + +template<typename BasicJsonType, typename Tuple, std::size_t... Idx> +void from_json_tuple_impl(const BasicJsonType& j, Tuple& t, index_sequence<Idx...> /*unused*/) +{ + t = std::make_tuple(j.at(Idx).template get<typename std::tuple_element<Idx, Tuple>::type>()...); +} + +template<typename BasicJsonType, typename... Args> +void from_json(const BasicJsonType& j, std::tuple<Args...>& t) +{ + from_json_tuple_impl(j, t, index_sequence_for<Args...> {}); +} + +template <typename BasicJsonType, typename Key, typename Value, typename Compare, typename Allocator, + typename = enable_if_t<not std::is_constructible< + typename BasicJsonType::string_t, Key>::value>> +void from_json(const BasicJsonType& j, std::map<Key, Value, Compare, Allocator>& m) +{ + if (JSON_UNLIKELY(not j.is_array())) + { + JSON_THROW(type_error::create(302, "type must be array, but is " + std::string(j.type_name()))); + } + for (const auto& p : j) + { + if (JSON_UNLIKELY(not p.is_array())) + { + JSON_THROW(type_error::create(302, "type must be array, but is " + std::string(p.type_name()))); + } + m.emplace(p.at(0).template get<Key>(), p.at(1).template get<Value>()); + } +} + +template <typename BasicJsonType, typename Key, typename Value, typename Hash, typename KeyEqual, typename Allocator, + typename = enable_if_t<not std::is_constructible< + typename BasicJsonType::string_t, Key>::value>> +void from_json(const BasicJsonType& j, std::unordered_map<Key, Value, Hash, KeyEqual, Allocator>& m) +{ + if (JSON_UNLIKELY(not j.is_array())) + { + JSON_THROW(type_error::create(302, "type must be array, but is " + std::string(j.type_name()))); + } + for (const auto& p : j) + { + if (JSON_UNLIKELY(not p.is_array())) + { + JSON_THROW(type_error::create(302, "type must be array, but is " + std::string(p.type_name()))); + } + m.emplace(p.at(0).template get<Key>(), p.at(1).template get<Value>()); + } +} + +struct from_json_fn +{ + template<typename BasicJsonType, typename T> + auto operator()(const BasicJsonType& j, T& val) const + noexcept(noexcept(from_json(j, val))) + -> decltype(from_json(j, val), void()) + { + return from_json(j, val); + } +}; +} // namespace detail + +/// namespace to hold default `from_json` function +/// to see why this is required: +/// http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2015/n4381.html +namespace +{ +constexpr const auto& from_json = detail::static_const<detail::from_json_fn>::value; +} // namespace +} // namespace nlohmann + +// #include <nlohmann/detail/conversions/to_json.hpp> + + +#include <algorithm> // copy +#include <ciso646> // or, and, not +#include <iterator> // begin, end +#include <string> // string +#include <tuple> // tuple, get +#include <type_traits> // is_same, is_constructible, is_floating_point, is_enum, underlying_type +#include <utility> // move, forward, declval, pair +#include <valarray> // valarray +#include <vector> // vector + +// #include <nlohmann/detail/iterators/iteration_proxy.hpp> + + +#include <cstddef> // size_t +#include <iterator> // input_iterator_tag +#include <string> // string, to_string +#include <tuple> // tuple_size, get, tuple_element + +// #include <nlohmann/detail/meta/type_traits.hpp> + +// #include <nlohmann/detail/value_t.hpp> + + +namespace nlohmann +{ +namespace detail +{ +template <typename IteratorType> class iteration_proxy_value +{ + public: + using difference_type = std::ptrdiff_t; + using value_type = iteration_proxy_value; + using pointer = value_type * ; + using reference = value_type & ; + using iterator_category = std::input_iterator_tag; + + private: + /// the iterator + IteratorType anchor; + /// an index for arrays (used to create key names) + std::size_t array_index = 0; + /// last stringified array index + mutable std::size_t array_index_last = 0; + /// a string representation of the array index + mutable std::string array_index_str = "0"; + /// an empty string (to return a reference for primitive values) + const std::string empty_str = ""; + + public: + explicit iteration_proxy_value(IteratorType it) noexcept : anchor(it) {} + + /// dereference operator (needed for range-based for) + iteration_proxy_value& operator*() + { + return *this; + } + + /// increment operator (needed for range-based for) + iteration_proxy_value& operator++() + { + ++anchor; + ++array_index; + + return *this; + } + + /// equality operator (needed for InputIterator) + bool operator==(const iteration_proxy_value& o) const + { + return anchor == o.anchor; + } + + /// inequality operator (needed for range-based for) + bool operator!=(const iteration_proxy_value& o) const + { + return anchor != o.anchor; + } + + /// return key of the iterator + const std::string& key() const + { + assert(anchor.m_object != nullptr); + + switch (anchor.m_object->type()) + { + // use integer array index as key + case value_t::array: + { + if (array_index != array_index_last) + { + array_index_str = std::to_string(array_index); + array_index_last = array_index; + } + return array_index_str; + } + + // use key from the object + case value_t::object: + return anchor.key(); + + // use an empty key for all primitive types + default: + return empty_str; + } + } + + /// return value of the iterator + typename IteratorType::reference value() const + { + return anchor.value(); + } +}; + +/// proxy class for the items() function +template<typename IteratorType> class iteration_proxy +{ + private: + /// the container to iterate + typename IteratorType::reference container; + + public: + /// construct iteration proxy from a container + explicit iteration_proxy(typename IteratorType::reference cont) noexcept + : container(cont) {} + + /// return iterator begin (needed for range-based for) + iteration_proxy_value<IteratorType> begin() noexcept + { + return iteration_proxy_value<IteratorType>(container.begin()); + } + + /// return iterator end (needed for range-based for) + iteration_proxy_value<IteratorType> end() noexcept + { + return iteration_proxy_value<IteratorType>(container.end()); + } +}; +// Structured Bindings Support +// For further reference see https://blog.tartanllama.xyz/structured-bindings/ +// And see https://github.com/nlohmann/json/pull/1391 +template <std::size_t N, typename IteratorType, enable_if_t<N == 0, int> = 0> +auto get(const nlohmann::detail::iteration_proxy_value<IteratorType>& i) -> decltype(i.key()) +{ + return i.key(); +} +// Structured Bindings Support +// For further reference see https://blog.tartanllama.xyz/structured-bindings/ +// And see https://github.com/nlohmann/json/pull/1391 +template <std::size_t N, typename IteratorType, enable_if_t<N == 1, int> = 0> +auto get(const nlohmann::detail::iteration_proxy_value<IteratorType>& i) -> decltype(i.value()) +{ + return i.value(); +} +} // namespace detail +} // namespace nlohmann + +// The Addition to the STD Namespace is required to add +// Structured Bindings Support to the iteration_proxy_value class +// For further reference see https://blog.tartanllama.xyz/structured-bindings/ +// And see https://github.com/nlohmann/json/pull/1391 +namespace std +{ +#if defined(__clang__) + // Fix: https://github.com/nlohmann/json/issues/1401 + #pragma clang diagnostic push + #pragma clang diagnostic ignored "-Wmismatched-tags" +#endif +template <typename IteratorType> +class tuple_size<::nlohmann::detail::iteration_proxy_value<IteratorType>> + : public std::integral_constant<std::size_t, 2> {}; + +template <std::size_t N, typename IteratorType> +class tuple_element<N, ::nlohmann::detail::iteration_proxy_value<IteratorType >> +{ + public: + using type = decltype( + get<N>(std::declval < + ::nlohmann::detail::iteration_proxy_value<IteratorType >> ())); +}; +#if defined(__clang__) + #pragma clang diagnostic pop +#endif +} // namespace std + +// #include <nlohmann/detail/meta/cpp_future.hpp> + +// #include <nlohmann/detail/meta/type_traits.hpp> + +// #include <nlohmann/detail/value_t.hpp> + + +namespace nlohmann +{ +namespace detail +{ +////////////////// +// constructors // +////////////////// + +template<value_t> struct external_constructor; + +template<> +struct external_constructor<value_t::boolean> +{ + template<typename BasicJsonType> + static void construct(BasicJsonType& j, typename BasicJsonType::boolean_t b) noexcept + { + j.m_type = value_t::boolean; + j.m_value = b; + j.assert_invariant(); + } +}; + +template<> +struct external_constructor<value_t::string> +{ + template<typename BasicJsonType> + static void construct(BasicJsonType& j, const typename BasicJsonType::string_t& s) + { + j.m_type = value_t::string; + j.m_value = s; + j.assert_invariant(); + } + + template<typename BasicJsonType> + static void construct(BasicJsonType& j, typename BasicJsonType::string_t&& s) + { + j.m_type = value_t::string; + j.m_value = std::move(s); + j.assert_invariant(); + } + + template<typename BasicJsonType, typename CompatibleStringType, + enable_if_t<not std::is_same<CompatibleStringType, typename BasicJsonType::string_t>::value, + int> = 0> + static void construct(BasicJsonType& j, const CompatibleStringType& str) + { + j.m_type = value_t::string; + j.m_value.string = j.template create<typename BasicJsonType::string_t>(str); + j.assert_invariant(); + } +}; + +template<> +struct external_constructor<value_t::number_float> +{ + template<typename BasicJsonType> + static void construct(BasicJsonType& j, typename BasicJsonType::number_float_t val) noexcept + { + j.m_type = value_t::number_float; + j.m_value = val; + j.assert_invariant(); + } +}; + +template<> +struct external_constructor<value_t::number_unsigned> +{ + template<typename BasicJsonType> + static void construct(BasicJsonType& j, typename BasicJsonType::number_unsigned_t val) noexcept + { + j.m_type = value_t::number_unsigned; + j.m_value = val; + j.assert_invariant(); + } +}; + +template<> +struct external_constructor<value_t::number_integer> +{ + template<typename BasicJsonType> + static void construct(BasicJsonType& j, typename BasicJsonType::number_integer_t val) noexcept + { + j.m_type = value_t::number_integer; + j.m_value = val; + j.assert_invariant(); + } +}; + +template<> +struct external_constructor<value_t::array> +{ + template<typename BasicJsonType> + static void construct(BasicJsonType& j, const typename BasicJsonType::array_t& arr) + { + j.m_type = value_t::array; + j.m_value = arr; + j.assert_invariant(); + } + + template<typename BasicJsonType> + static void construct(BasicJsonType& j, typename BasicJsonType::array_t&& arr) + { + j.m_type = value_t::array; + j.m_value = std::move(arr); + j.assert_invariant(); + } + + template<typename BasicJsonType, typename CompatibleArrayType, + enable_if_t<not std::is_same<CompatibleArrayType, typename BasicJsonType::array_t>::value, + int> = 0> + static void construct(BasicJsonType& j, const CompatibleArrayType& arr) + { + using std::begin; + using std::end; + j.m_type = value_t::array; + j.m_value.array = j.template create<typename BasicJsonType::array_t>(begin(arr), end(arr)); + j.assert_invariant(); + } + + template<typename BasicJsonType> + static void construct(BasicJsonType& j, const std::vector<bool>& arr) + { + j.m_type = value_t::array; + j.m_value = value_t::array; + j.m_value.array->reserve(arr.size()); + for (const bool x : arr) + { + j.m_value.array->push_back(x); + } + j.assert_invariant(); + } + + template<typename BasicJsonType, typename T, + enable_if_t<std::is_convertible<T, BasicJsonType>::value, int> = 0> + static void construct(BasicJsonType& j, const std::valarray<T>& arr) + { + j.m_type = value_t::array; + j.m_value = value_t::array; + j.m_value.array->resize(arr.size()); + std::copy(std::begin(arr), std::end(arr), j.m_value.array->begin()); + j.assert_invariant(); + } +}; + +template<> +struct external_constructor<value_t::object> +{ + template<typename BasicJsonType> + static void construct(BasicJsonType& j, const typename BasicJsonType::object_t& obj) + { + j.m_type = value_t::object; + j.m_value = obj; + j.assert_invariant(); + } + + template<typename BasicJsonType> + static void construct(BasicJsonType& j, typename BasicJsonType::object_t&& obj) + { + j.m_type = value_t::object; + j.m_value = std::move(obj); + j.assert_invariant(); + } + + template<typename BasicJsonType, typename CompatibleObjectType, + enable_if_t<not std::is_same<CompatibleObjectType, typename BasicJsonType::object_t>::value, int> = 0> + static void construct(BasicJsonType& j, const CompatibleObjectType& obj) + { + using std::begin; + using std::end; + + j.m_type = value_t::object; + j.m_value.object = j.template create<typename BasicJsonType::object_t>(begin(obj), end(obj)); + j.assert_invariant(); + } +}; + +///////////// +// to_json // +///////////// + +template<typename BasicJsonType, typename T, + enable_if_t<std::is_same<T, typename BasicJsonType::boolean_t>::value, int> = 0> +void to_json(BasicJsonType& j, T b) noexcept +{ + external_constructor<value_t::boolean>::construct(j, b); +} + +template<typename BasicJsonType, typename CompatibleString, + enable_if_t<std::is_constructible<typename BasicJsonType::string_t, CompatibleString>::value, int> = 0> +void to_json(BasicJsonType& j, const CompatibleString& s) +{ + external_constructor<value_t::string>::construct(j, s); +} + +template<typename BasicJsonType> +void to_json(BasicJsonType& j, typename BasicJsonType::string_t&& s) +{ + external_constructor<value_t::string>::construct(j, std::move(s)); +} + +template<typename BasicJsonType, typename FloatType, + enable_if_t<std::is_floating_point<FloatType>::value, int> = 0> +void to_json(BasicJsonType& j, FloatType val) noexcept +{ + external_constructor<value_t::number_float>::construct(j, static_cast<typename BasicJsonType::number_float_t>(val)); +} + +template<typename BasicJsonType, typename CompatibleNumberUnsignedType, + enable_if_t<is_compatible_integer_type<typename BasicJsonType::number_unsigned_t, CompatibleNumberUnsignedType>::value, int> = 0> +void to_json(BasicJsonType& j, CompatibleNumberUnsignedType val) noexcept +{ + external_constructor<value_t::number_unsigned>::construct(j, static_cast<typename BasicJsonType::number_unsigned_t>(val)); +} + +template<typename BasicJsonType, typename CompatibleNumberIntegerType, + enable_if_t<is_compatible_integer_type<typename BasicJsonType::number_integer_t, CompatibleNumberIntegerType>::value, int> = 0> +void to_json(BasicJsonType& j, CompatibleNumberIntegerType val) noexcept +{ + external_constructor<value_t::number_integer>::construct(j, static_cast<typename BasicJsonType::number_integer_t>(val)); +} + +template<typename BasicJsonType, typename EnumType, + enable_if_t<std::is_enum<EnumType>::value, int> = 0> +void to_json(BasicJsonType& j, EnumType e) noexcept +{ + using underlying_type = typename std::underlying_type<EnumType>::type; + external_constructor<value_t::number_integer>::construct(j, static_cast<underlying_type>(e)); +} + +template<typename BasicJsonType> +void to_json(BasicJsonType& j, const std::vector<bool>& e) +{ + external_constructor<value_t::array>::construct(j, e); +} + +template <typename BasicJsonType, typename CompatibleArrayType, + enable_if_t<is_compatible_array_type<BasicJsonType, + CompatibleArrayType>::value and + not is_compatible_object_type< + BasicJsonType, CompatibleArrayType>::value and + not is_compatible_string_type<BasicJsonType, CompatibleArrayType>::value and + not is_basic_json<CompatibleArrayType>::value, + int> = 0> +void to_json(BasicJsonType& j, const CompatibleArrayType& arr) +{ + external_constructor<value_t::array>::construct(j, arr); +} + +template<typename BasicJsonType, typename T, + enable_if_t<std::is_convertible<T, BasicJsonType>::value, int> = 0> +void to_json(BasicJsonType& j, const std::valarray<T>& arr) +{ + external_constructor<value_t::array>::construct(j, std::move(arr)); +} + +template<typename BasicJsonType> +void to_json(BasicJsonType& j, typename BasicJsonType::array_t&& arr) +{ + external_constructor<value_t::array>::construct(j, std::move(arr)); +} + +template<typename BasicJsonType, typename CompatibleObjectType, + enable_if_t<is_compatible_object_type<BasicJsonType, CompatibleObjectType>::value and not is_basic_json<CompatibleObjectType>::value, int> = 0> +void to_json(BasicJsonType& j, const CompatibleObjectType& obj) +{ + external_constructor<value_t::object>::construct(j, obj); +} + +template<typename BasicJsonType> +void to_json(BasicJsonType& j, typename BasicJsonType::object_t&& obj) +{ + external_constructor<value_t::object>::construct(j, std::move(obj)); +} + +template < + typename BasicJsonType, typename T, std::size_t N, + enable_if_t<not std::is_constructible<typename BasicJsonType::string_t, + const T(&)[N]>::value, + int> = 0 > +void to_json(BasicJsonType& j, const T(&arr)[N]) +{ + external_constructor<value_t::array>::construct(j, arr); +} + +template<typename BasicJsonType, typename... Args> +void to_json(BasicJsonType& j, const std::pair<Args...>& p) +{ + j = { p.first, p.second }; +} + +// for https://github.com/nlohmann/json/pull/1134 +template < typename BasicJsonType, typename T, + enable_if_t<std::is_same<T, iteration_proxy_value<typename BasicJsonType::iterator>>::value, int> = 0> +void to_json(BasicJsonType& j, const T& b) +{ + j = { {b.key(), b.value()} }; +} + +template<typename BasicJsonType, typename Tuple, std::size_t... Idx> +void to_json_tuple_impl(BasicJsonType& j, const Tuple& t, index_sequence<Idx...> /*unused*/) +{ + j = { std::get<Idx>(t)... }; +} + +template<typename BasicJsonType, typename... Args> +void to_json(BasicJsonType& j, const std::tuple<Args...>& t) +{ + to_json_tuple_impl(j, t, index_sequence_for<Args...> {}); +} + +struct to_json_fn +{ + template<typename BasicJsonType, typename T> + auto operator()(BasicJsonType& j, T&& val) const noexcept(noexcept(to_json(j, std::forward<T>(val)))) + -> decltype(to_json(j, std::forward<T>(val)), void()) + { + return to_json(j, std::forward<T>(val)); + } +}; +} // namespace detail + +/// namespace to hold default `to_json` function +namespace +{ +constexpr const auto& to_json = detail::static_const<detail::to_json_fn>::value; +} // namespace +} // namespace nlohmann + + +namespace nlohmann +{ + +template<typename, typename> +struct adl_serializer +{ + /*! + @brief convert a JSON value to any value type + + This function is usually called by the `get()` function of the + @ref basic_json class (either explicit or via conversion operators). + + @param[in] j JSON value to read from + @param[in,out] val value to write to + */ + template<typename BasicJsonType, typename ValueType> + static auto from_json(BasicJsonType&& j, ValueType& val) noexcept( + noexcept(::nlohmann::from_json(std::forward<BasicJsonType>(j), val))) + -> decltype(::nlohmann::from_json(std::forward<BasicJsonType>(j), val), void()) + { + ::nlohmann::from_json(std::forward<BasicJsonType>(j), val); + } + + /*! + @brief convert any value type to a JSON value + + This function is usually called by the constructors of the @ref basic_json + class. + + @param[in,out] j JSON value to write to + @param[in] val value to read from + */ + template <typename BasicJsonType, typename ValueType> + static auto to_json(BasicJsonType& j, ValueType&& val) noexcept( + noexcept(::nlohmann::to_json(j, std::forward<ValueType>(val)))) + -> decltype(::nlohmann::to_json(j, std::forward<ValueType>(val)), void()) + { + ::nlohmann::to_json(j, std::forward<ValueType>(val)); + } +}; + +} // namespace nlohmann + +// #include <nlohmann/detail/conversions/from_json.hpp> + +// #include <nlohmann/detail/conversions/to_json.hpp> + +// #include <nlohmann/detail/exceptions.hpp> + +// #include <nlohmann/detail/input/binary_reader.hpp> + + +#include <algorithm> // generate_n +#include <array> // array +#include <cassert> // assert +#include <cmath> // ldexp +#include <cstddef> // size_t +#include <cstdint> // uint8_t, uint16_t, uint32_t, uint64_t +#include <cstdio> // snprintf +#include <cstring> // memcpy +#include <iterator> // back_inserter +#include <limits> // numeric_limits +#include <string> // char_traits, string +#include <utility> // make_pair, move + +// #include <nlohmann/detail/exceptions.hpp> + +// #include <nlohmann/detail/input/input_adapters.hpp> + + +#include <array> // array +#include <cassert> // assert +#include <cstddef> // size_t +#include <cstdio> //FILE * +#include <cstring> // strlen +#include <istream> // istream +#include <iterator> // begin, end, iterator_traits, random_access_iterator_tag, distance, next +#include <memory> // shared_ptr, make_shared, addressof +#include <numeric> // accumulate +#include <string> // string, char_traits +#include <type_traits> // enable_if, is_base_of, is_pointer, is_integral, remove_pointer +#include <utility> // pair, declval + +// #include <nlohmann/detail/iterators/iterator_traits.hpp> + +// #include <nlohmann/detail/macro_scope.hpp> + + +namespace nlohmann +{ +namespace detail +{ +/// the supported input formats +enum class input_format_t { json, cbor, msgpack, ubjson, bson }; + +//////////////////// +// input adapters // +//////////////////// + +/*! +@brief abstract input adapter interface + +Produces a stream of std::char_traits<char>::int_type characters from a +std::istream, a buffer, or some other input type. Accepts the return of +exactly one non-EOF character for future input. The int_type characters +returned consist of all valid char values as positive values (typically +unsigned char), plus an EOF value outside that range, specified by the value +of the function std::char_traits<char>::eof(). This value is typically -1, but +could be any arbitrary value which is not a valid char value. +*/ +struct input_adapter_protocol +{ + /// get a character [0,255] or std::char_traits<char>::eof(). + virtual std::char_traits<char>::int_type get_character() = 0; + virtual ~input_adapter_protocol() = default; +}; + +/// a type to simplify interfaces +using input_adapter_t = std::shared_ptr<input_adapter_protocol>; + +/*! +Input adapter for stdio file access. This adapter read only 1 byte and do not use any + buffer. This adapter is a very low level adapter. +*/ +class file_input_adapter : public input_adapter_protocol +{ + public: + explicit file_input_adapter(std::FILE* f) noexcept + : m_file(f) + {} + + // make class move-only + file_input_adapter(const file_input_adapter&) = delete; + file_input_adapter(file_input_adapter&&) = default; + file_input_adapter& operator=(const file_input_adapter&) = delete; + file_input_adapter& operator=(file_input_adapter&&) = default; + ~file_input_adapter() override = default; + + std::char_traits<char>::int_type get_character() noexcept override + { + return std::fgetc(m_file); + } + + private: + /// the file pointer to read from + std::FILE* m_file; +}; + + +/*! +Input adapter for a (caching) istream. Ignores a UFT Byte Order Mark at +beginning of input. Does not support changing the underlying std::streambuf +in mid-input. Maintains underlying std::istream and std::streambuf to support +subsequent use of standard std::istream operations to process any input +characters following those used in parsing the JSON input. Clears the +std::istream flags; any input errors (e.g., EOF) will be detected by the first +subsequent call for input from the std::istream. +*/ +class input_stream_adapter : public input_adapter_protocol +{ + public: + ~input_stream_adapter() override + { + // clear stream flags; we use underlying streambuf I/O, do not + // maintain ifstream flags, except eof + is.clear(is.rdstate() & std::ios::eofbit); + } + + explicit input_stream_adapter(std::istream& i) + : is(i), sb(*i.rdbuf()) + {} + + // delete because of pointer members + input_stream_adapter(const input_stream_adapter&) = delete; + input_stream_adapter& operator=(input_stream_adapter&) = delete; + input_stream_adapter(input_stream_adapter&&) = delete; + input_stream_adapter& operator=(input_stream_adapter&&) = delete; + + // std::istream/std::streambuf use std::char_traits<char>::to_int_type, to + // ensure that std::char_traits<char>::eof() and the character 0xFF do not + // end up as the same value, eg. 0xFFFFFFFF. + std::char_traits<char>::int_type get_character() override + { + auto res = sb.sbumpc(); + // set eof manually, as we don't use the istream interface. + if (res == EOF) + { + is.clear(is.rdstate() | std::ios::eofbit); + } + return res; + } + + private: + /// the associated input stream + std::istream& is; + std::streambuf& sb; +}; + +/// input adapter for buffer input +class input_buffer_adapter : public input_adapter_protocol +{ + public: + input_buffer_adapter(const char* b, const std::size_t l) noexcept + : cursor(b), limit(b + l) + {} + + // delete because of pointer members + input_buffer_adapter(const input_buffer_adapter&) = delete; + input_buffer_adapter& operator=(input_buffer_adapter&) = delete; + input_buffer_adapter(input_buffer_adapter&&) = delete; + input_buffer_adapter& operator=(input_buffer_adapter&&) = delete; + ~input_buffer_adapter() override = default; + + std::char_traits<char>::int_type get_character() noexcept override + { + if (JSON_LIKELY(cursor < limit)) + { + return std::char_traits<char>::to_int_type(*(cursor++)); + } + + return std::char_traits<char>::eof(); + } + + private: + /// pointer to the current character + const char* cursor; + /// pointer past the last character + const char* const limit; +}; + +template<typename WideStringType, size_t T> +struct wide_string_input_helper +{ + // UTF-32 + static void fill_buffer(const WideStringType& str, + size_t& current_wchar, + std::array<std::char_traits<char>::int_type, 4>& utf8_bytes, + size_t& utf8_bytes_index, + size_t& utf8_bytes_filled) + { + utf8_bytes_index = 0; + + if (current_wchar == str.size()) + { + utf8_bytes[0] = std::char_traits<char>::eof(); + utf8_bytes_filled = 1; + } + else + { + // get the current character + const auto wc = static_cast<unsigned int>(str[current_wchar++]); + + // UTF-32 to UTF-8 encoding + if (wc < 0x80) + { + utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(wc); + utf8_bytes_filled = 1; + } + else if (wc <= 0x7FF) + { + utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(0xC0u | ((wc >> 6u) & 0x1Fu)); + utf8_bytes[1] = static_cast<std::char_traits<char>::int_type>(0x80u | (wc & 0x3Fu)); + utf8_bytes_filled = 2; + } + else if (wc <= 0xFFFF) + { + utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(0xE0u | ((wc >> 12u) & 0x0Fu)); + utf8_bytes[1] = static_cast<std::char_traits<char>::int_type>(0x80u | ((wc >> 6u) & 0x3Fu)); + utf8_bytes[2] = static_cast<std::char_traits<char>::int_type>(0x80u | (wc & 0x3Fu)); + utf8_bytes_filled = 3; + } + else if (wc <= 0x10FFFF) + { + utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(0xF0u | ((wc >> 18u) & 0x07u)); + utf8_bytes[1] = static_cast<std::char_traits<char>::int_type>(0x80u | ((wc >> 12u) & 0x3Fu)); + utf8_bytes[2] = static_cast<std::char_traits<char>::int_type>(0x80u | ((wc >> 6u) & 0x3Fu)); + utf8_bytes[3] = static_cast<std::char_traits<char>::int_type>(0x80u | (wc & 0x3Fu)); + utf8_bytes_filled = 4; + } + else + { + // unknown character + utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(wc); + utf8_bytes_filled = 1; + } + } + } +}; + +template<typename WideStringType> +struct wide_string_input_helper<WideStringType, 2> +{ + // UTF-16 + static void fill_buffer(const WideStringType& str, + size_t& current_wchar, + std::array<std::char_traits<char>::int_type, 4>& utf8_bytes, + size_t& utf8_bytes_index, + size_t& utf8_bytes_filled) + { + utf8_bytes_index = 0; + + if (current_wchar == str.size()) + { + utf8_bytes[0] = std::char_traits<char>::eof(); + utf8_bytes_filled = 1; + } + else + { + // get the current character + const auto wc = static_cast<unsigned int>(str[current_wchar++]); + + // UTF-16 to UTF-8 encoding + if (wc < 0x80) + { + utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(wc); + utf8_bytes_filled = 1; + } + else if (wc <= 0x7FF) + { + utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(0xC0u | ((wc >> 6u))); + utf8_bytes[1] = static_cast<std::char_traits<char>::int_type>(0x80u | (wc & 0x3Fu)); + utf8_bytes_filled = 2; + } + else if (0xD800 > wc or wc >= 0xE000) + { + utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(0xE0u | ((wc >> 12u))); + utf8_bytes[1] = static_cast<std::char_traits<char>::int_type>(0x80u | ((wc >> 6u) & 0x3Fu)); + utf8_bytes[2] = static_cast<std::char_traits<char>::int_type>(0x80u | (wc & 0x3Fu)); + utf8_bytes_filled = 3; + } + else + { + if (current_wchar < str.size()) + { + const auto wc2 = static_cast<unsigned int>(str[current_wchar++]); + const auto charcode = 0x10000u + (((wc & 0x3FFu) << 10u) | (wc2 & 0x3FFu)); + utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(0xF0u | (charcode >> 18u)); + utf8_bytes[1] = static_cast<std::char_traits<char>::int_type>(0x80u | ((charcode >> 12u) & 0x3Fu)); + utf8_bytes[2] = static_cast<std::char_traits<char>::int_type>(0x80u | ((charcode >> 6u) & 0x3Fu)); + utf8_bytes[3] = static_cast<std::char_traits<char>::int_type>(0x80u | (charcode & 0x3Fu)); + utf8_bytes_filled = 4; + } + else + { + // unknown character + ++current_wchar; + utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(wc); + utf8_bytes_filled = 1; + } + } + } + } +}; + +template<typename WideStringType> +class wide_string_input_adapter : public input_adapter_protocol +{ + public: + explicit wide_string_input_adapter(const WideStringType& w) noexcept + : str(w) + {} + + std::char_traits<char>::int_type get_character() noexcept override + { + // check if buffer needs to be filled + if (utf8_bytes_index == utf8_bytes_filled) + { + fill_buffer<sizeof(typename WideStringType::value_type)>(); + + assert(utf8_bytes_filled > 0); + assert(utf8_bytes_index == 0); + } + + // use buffer + assert(utf8_bytes_filled > 0); + assert(utf8_bytes_index < utf8_bytes_filled); + return utf8_bytes[utf8_bytes_index++]; + } + + private: + template<size_t T> + void fill_buffer() + { + wide_string_input_helper<WideStringType, T>::fill_buffer(str, current_wchar, utf8_bytes, utf8_bytes_index, utf8_bytes_filled); + } + + /// the wstring to process + const WideStringType& str; + + /// index of the current wchar in str + std::size_t current_wchar = 0; + + /// a buffer for UTF-8 bytes + std::array<std::char_traits<char>::int_type, 4> utf8_bytes = {{0, 0, 0, 0}}; + + /// index to the utf8_codes array for the next valid byte + std::size_t utf8_bytes_index = 0; + /// number of valid bytes in the utf8_codes array + std::size_t utf8_bytes_filled = 0; +}; + +class input_adapter +{ + public: + // native support + input_adapter(std::FILE* file) + : ia(std::make_shared<file_input_adapter>(file)) {} + /// input adapter for input stream + input_adapter(std::istream& i) + : ia(std::make_shared<input_stream_adapter>(i)) {} + + /// input adapter for input stream + input_adapter(std::istream&& i) + : ia(std::make_shared<input_stream_adapter>(i)) {} + + input_adapter(const std::wstring& ws) + : ia(std::make_shared<wide_string_input_adapter<std::wstring>>(ws)) {} + + input_adapter(const std::u16string& ws) + : ia(std::make_shared<wide_string_input_adapter<std::u16string>>(ws)) {} + + input_adapter(const std::u32string& ws) + : ia(std::make_shared<wide_string_input_adapter<std::u32string>>(ws)) {} + + /// input adapter for buffer + template<typename CharT, + typename std::enable_if< + std::is_pointer<CharT>::value and + std::is_integral<typename std::remove_pointer<CharT>::type>::value and + sizeof(typename std::remove_pointer<CharT>::type) == 1, + int>::type = 0> + input_adapter(CharT b, std::size_t l) + : ia(std::make_shared<input_buffer_adapter>(reinterpret_cast<const char*>(b), l)) {} + + // derived support + + /// input adapter for string literal + template<typename CharT, + typename std::enable_if< + std::is_pointer<CharT>::value and + std::is_integral<typename std::remove_pointer<CharT>::type>::value and + sizeof(typename std::remove_pointer<CharT>::type) == 1, + int>::type = 0> + input_adapter(CharT b) + : input_adapter(reinterpret_cast<const char*>(b), + std::strlen(reinterpret_cast<const char*>(b))) {} + + /// input adapter for iterator range with contiguous storage + template<class IteratorType, + typename std::enable_if< + std::is_same<typename iterator_traits<IteratorType>::iterator_category, std::random_access_iterator_tag>::value, + int>::type = 0> + input_adapter(IteratorType first, IteratorType last) + { +#ifndef NDEBUG + // assertion to check that the iterator range is indeed contiguous, + // see http://stackoverflow.com/a/35008842/266378 for more discussion + const auto is_contiguous = std::accumulate( + first, last, std::pair<bool, int>(true, 0), + [&first](std::pair<bool, int> res, decltype(*first) val) + { + res.first &= (val == *(std::next(std::addressof(*first), res.second++))); + return res; + }).first; + assert(is_contiguous); +#endif + + // assertion to check that each element is 1 byte long + static_assert( + sizeof(typename iterator_traits<IteratorType>::value_type) == 1, + "each element in the iterator range must have the size of 1 byte"); + + const auto len = static_cast<size_t>(std::distance(first, last)); + if (JSON_LIKELY(len > 0)) + { + // there is at least one element: use the address of first + ia = std::make_shared<input_buffer_adapter>(reinterpret_cast<const char*>(&(*first)), len); + } + else + { + // the address of first cannot be used: use nullptr + ia = std::make_shared<input_buffer_adapter>(nullptr, len); + } + } + + /// input adapter for array + template<class T, std::size_t N> + input_adapter(T (&array)[N]) + : input_adapter(std::begin(array), std::end(array)) {} + + /// input adapter for contiguous container + template<class ContiguousContainer, typename + std::enable_if<not std::is_pointer<ContiguousContainer>::value and + std::is_base_of<std::random_access_iterator_tag, typename iterator_traits<decltype(std::begin(std::declval<ContiguousContainer const>()))>::iterator_category>::value, + int>::type = 0> + input_adapter(const ContiguousContainer& c) + : input_adapter(std::begin(c), std::end(c)) {} + + operator input_adapter_t() + { + return ia; + } + + private: + /// the actual adapter + input_adapter_t ia = nullptr; +}; +} // namespace detail +} // namespace nlohmann + +// #include <nlohmann/detail/input/json_sax.hpp> + + +#include <cassert> // assert +#include <cstddef> +#include <string> // string +#include <utility> // move +#include <vector> // vector + +// #include <nlohmann/detail/exceptions.hpp> + +// #include <nlohmann/detail/macro_scope.hpp> + + +namespace nlohmann +{ + +/*! +@brief SAX interface + +This class describes the SAX interface used by @ref nlohmann::json::sax_parse. +Each function is called in different situations while the input is parsed. The +boolean return value informs the parser whether to continue processing the +input. +*/ +template<typename BasicJsonType> +struct json_sax +{ + /// type for (signed) integers + using number_integer_t = typename BasicJsonType::number_integer_t; + /// type for unsigned integers + using number_unsigned_t = typename BasicJsonType::number_unsigned_t; + /// type for floating-point numbers + using number_float_t = typename BasicJsonType::number_float_t; + /// type for strings + using string_t = typename BasicJsonType::string_t; + + /*! + @brief a null value was read + @return whether parsing should proceed + */ + virtual bool null() = 0; + + /*! + @brief a boolean value was read + @param[in] val boolean value + @return whether parsing should proceed + */ + virtual bool boolean(bool val) = 0; + + /*! + @brief an integer number was read + @param[in] val integer value + @return whether parsing should proceed + */ + virtual bool number_integer(number_integer_t val) = 0; + + /*! + @brief an unsigned integer number was read + @param[in] val unsigned integer value + @return whether parsing should proceed + */ + virtual bool number_unsigned(number_unsigned_t val) = 0; + + /*! + @brief an floating-point number was read + @param[in] val floating-point value + @param[in] s raw token value + @return whether parsing should proceed + */ + virtual bool number_float(number_float_t val, const string_t& s) = 0; + + /*! + @brief a string was read + @param[in] val string value + @return whether parsing should proceed + @note It is safe to move the passed string. + */ + virtual bool string(string_t& val) = 0; + + /*! + @brief the beginning of an object was read + @param[in] elements number of object elements or -1 if unknown + @return whether parsing should proceed + @note binary formats may report the number of elements + */ + virtual bool start_object(std::size_t elements) = 0; + + /*! + @brief an object key was read + @param[in] val object key + @return whether parsing should proceed + @note It is safe to move the passed string. + */ + virtual bool key(string_t& val) = 0; + + /*! + @brief the end of an object was read + @return whether parsing should proceed + */ + virtual bool end_object() = 0; + + /*! + @brief the beginning of an array was read + @param[in] elements number of array elements or -1 if unknown + @return whether parsing should proceed + @note binary formats may report the number of elements + */ + virtual bool start_array(std::size_t elements) = 0; + + /*! + @brief the end of an array was read + @return whether parsing should proceed + */ + virtual bool end_array() = 0; + + /*! + @brief a parse error occurred + @param[in] position the position in the input where the error occurs + @param[in] last_token the last read token + @param[in] ex an exception object describing the error + @return whether parsing should proceed (must return false) + */ + virtual bool parse_error(std::size_t position, + const std::string& last_token, + const detail::exception& ex) = 0; + + virtual ~json_sax() = default; +}; + + +namespace detail +{ +/*! +@brief SAX implementation to create a JSON value from SAX events + +This class implements the @ref json_sax interface and processes the SAX events +to create a JSON value which makes it basically a DOM parser. The structure or +hierarchy of the JSON value is managed by the stack `ref_stack` which contains +a pointer to the respective array or object for each recursion depth. + +After successful parsing, the value that is passed by reference to the +constructor contains the parsed value. + +@tparam BasicJsonType the JSON type +*/ +template<typename BasicJsonType> +class json_sax_dom_parser +{ + public: + using number_integer_t = typename BasicJsonType::number_integer_t; + using number_unsigned_t = typename BasicJsonType::number_unsigned_t; + using number_float_t = typename BasicJsonType::number_float_t; + using string_t = typename BasicJsonType::string_t; + + /*! + @param[in, out] r reference to a JSON value that is manipulated while + parsing + @param[in] allow_exceptions_ whether parse errors yield exceptions + */ + explicit json_sax_dom_parser(BasicJsonType& r, const bool allow_exceptions_ = true) + : root(r), allow_exceptions(allow_exceptions_) + {} + + // make class move-only + json_sax_dom_parser(const json_sax_dom_parser&) = delete; + json_sax_dom_parser(json_sax_dom_parser&&) = default; + json_sax_dom_parser& operator=(const json_sax_dom_parser&) = delete; + json_sax_dom_parser& operator=(json_sax_dom_parser&&) = default; + ~json_sax_dom_parser() = default; + + bool null() + { + handle_value(nullptr); + return true; + } + + bool boolean(bool val) + { + handle_value(val); + return true; + } + + bool number_integer(number_integer_t val) + { + handle_value(val); + return true; + } + + bool number_unsigned(number_unsigned_t val) + { + handle_value(val); + return true; + } + + bool number_float(number_float_t val, const string_t& /*unused*/) + { + handle_value(val); + return true; + } + + bool string(string_t& val) + { + handle_value(val); + return true; + } + + bool start_object(std::size_t len) + { + ref_stack.push_back(handle_value(BasicJsonType::value_t::object)); + + if (JSON_UNLIKELY(len != std::size_t(-1) and len > ref_stack.back()->max_size())) + { + JSON_THROW(out_of_range::create(408, + "excessive object size: " + std::to_string(len))); + } + + return true; + } + + bool key(string_t& val) + { + // add null at given key and store the reference for later + object_element = &(ref_stack.back()->m_value.object->operator[](val)); + return true; + } + + bool end_object() + { + ref_stack.pop_back(); + return true; + } + + bool start_array(std::size_t len) + { + ref_stack.push_back(handle_value(BasicJsonType::value_t::array)); + + if (JSON_UNLIKELY(len != std::size_t(-1) and len > ref_stack.back()->max_size())) + { + JSON_THROW(out_of_range::create(408, + "excessive array size: " + std::to_string(len))); + } + + return true; + } + + bool end_array() + { + ref_stack.pop_back(); + return true; + } + + bool parse_error(std::size_t /*unused*/, const std::string& /*unused*/, + const detail::exception& ex) + { + errored = true; + if (allow_exceptions) + { + // determine the proper exception type from the id + switch ((ex.id / 100) % 100) + { + case 1: + JSON_THROW(*static_cast<const detail::parse_error*>(&ex)); + case 4: + JSON_THROW(*static_cast<const detail::out_of_range*>(&ex)); + // LCOV_EXCL_START + case 2: + JSON_THROW(*static_cast<const detail::invalid_iterator*>(&ex)); + case 3: + JSON_THROW(*static_cast<const detail::type_error*>(&ex)); + case 5: + JSON_THROW(*static_cast<const detail::other_error*>(&ex)); + default: + assert(false); + // LCOV_EXCL_STOP + } + } + return false; + } + + constexpr bool is_errored() const + { + return errored; + } + + private: + /*! + @invariant If the ref stack is empty, then the passed value will be the new + root. + @invariant If the ref stack contains a value, then it is an array or an + object to which we can add elements + */ + template<typename Value> + BasicJsonType* handle_value(Value&& v) + { + if (ref_stack.empty()) + { + root = BasicJsonType(std::forward<Value>(v)); + return &root; + } + + assert(ref_stack.back()->is_array() or ref_stack.back()->is_object()); + + if (ref_stack.back()->is_array()) + { + ref_stack.back()->m_value.array->emplace_back(std::forward<Value>(v)); + return &(ref_stack.back()->m_value.array->back()); + } + + assert(ref_stack.back()->is_object()); + assert(object_element); + *object_element = BasicJsonType(std::forward<Value>(v)); + return object_element; + } + + /// the parsed JSON value + BasicJsonType& root; + /// stack to model hierarchy of values + std::vector<BasicJsonType*> ref_stack {}; + /// helper to hold the reference for the next object element + BasicJsonType* object_element = nullptr; + /// whether a syntax error occurred + bool errored = false; + /// whether to throw exceptions in case of errors + const bool allow_exceptions = true; +}; + +template<typename BasicJsonType> +class json_sax_dom_callback_parser +{ + public: + using number_integer_t = typename BasicJsonType::number_integer_t; + using number_unsigned_t = typename BasicJsonType::number_unsigned_t; + using number_float_t = typename BasicJsonType::number_float_t; + using string_t = typename BasicJsonType::string_t; + using parser_callback_t = typename BasicJsonType::parser_callback_t; + using parse_event_t = typename BasicJsonType::parse_event_t; + + json_sax_dom_callback_parser(BasicJsonType& r, + const parser_callback_t cb, + const bool allow_exceptions_ = true) + : root(r), callback(cb), allow_exceptions(allow_exceptions_) + { + keep_stack.push_back(true); + } + + // make class move-only + json_sax_dom_callback_parser(const json_sax_dom_callback_parser&) = delete; + json_sax_dom_callback_parser(json_sax_dom_callback_parser&&) = default; + json_sax_dom_callback_parser& operator=(const json_sax_dom_callback_parser&) = delete; + json_sax_dom_callback_parser& operator=(json_sax_dom_callback_parser&&) = default; + ~json_sax_dom_callback_parser() = default; + + bool null() + { + handle_value(nullptr); + return true; + } + + bool boolean(bool val) + { + handle_value(val); + return true; + } + + bool number_integer(number_integer_t val) + { + handle_value(val); + return true; + } + + bool number_unsigned(number_unsigned_t val) + { + handle_value(val); + return true; + } + + bool number_float(number_float_t val, const string_t& /*unused*/) + { + handle_value(val); + return true; + } + + bool string(string_t& val) + { + handle_value(val); + return true; + } + + bool start_object(std::size_t len) + { + // check callback for object start + const bool keep = callback(static_cast<int>(ref_stack.size()), parse_event_t::object_start, discarded); + keep_stack.push_back(keep); + + auto val = handle_value(BasicJsonType::value_t::object, true); + ref_stack.push_back(val.second); + + // check object limit + if (ref_stack.back() and JSON_UNLIKELY(len != std::size_t(-1) and len > ref_stack.back()->max_size())) + { + JSON_THROW(out_of_range::create(408, "excessive object size: " + std::to_string(len))); + } + + return true; + } + + bool key(string_t& val) + { + BasicJsonType k = BasicJsonType(val); + + // check callback for key + const bool keep = callback(static_cast<int>(ref_stack.size()), parse_event_t::key, k); + key_keep_stack.push_back(keep); + + // add discarded value at given key and store the reference for later + if (keep and ref_stack.back()) + { + object_element = &(ref_stack.back()->m_value.object->operator[](val) = discarded); + } + + return true; + } + + bool end_object() + { + if (ref_stack.back() and not callback(static_cast<int>(ref_stack.size()) - 1, parse_event_t::object_end, *ref_stack.back())) + { + // discard object + *ref_stack.back() = discarded; + } + + assert(not ref_stack.empty()); + assert(not keep_stack.empty()); + ref_stack.pop_back(); + keep_stack.pop_back(); + + if (not ref_stack.empty() and ref_stack.back() and ref_stack.back()->is_object()) + { + // remove discarded value + for (auto it = ref_stack.back()->begin(); it != ref_stack.back()->end(); ++it) + { + if (it->is_discarded()) + { + ref_stack.back()->erase(it); + break; + } + } + } + + return true; + } + + bool start_array(std::size_t len) + { + const bool keep = callback(static_cast<int>(ref_stack.size()), parse_event_t::array_start, discarded); + keep_stack.push_back(keep); + + auto val = handle_value(BasicJsonType::value_t::array, true); + ref_stack.push_back(val.second); + + // check array limit + if (ref_stack.back() and JSON_UNLIKELY(len != std::size_t(-1) and len > ref_stack.back()->max_size())) + { + JSON_THROW(out_of_range::create(408, "excessive array size: " + std::to_string(len))); + } + + return true; + } + + bool end_array() + { + bool keep = true; + + if (ref_stack.back()) + { + keep = callback(static_cast<int>(ref_stack.size()) - 1, parse_event_t::array_end, *ref_stack.back()); + if (not keep) + { + // discard array + *ref_stack.back() = discarded; + } + } + + assert(not ref_stack.empty()); + assert(not keep_stack.empty()); + ref_stack.pop_back(); + keep_stack.pop_back(); + + // remove discarded value + if (not keep and not ref_stack.empty() and ref_stack.back()->is_array()) + { + ref_stack.back()->m_value.array->pop_back(); + } + + return true; + } + + bool parse_error(std::size_t /*unused*/, const std::string& /*unused*/, + const detail::exception& ex) + { + errored = true; + if (allow_exceptions) + { + // determine the proper exception type from the id + switch ((ex.id / 100) % 100) + { + case 1: + JSON_THROW(*static_cast<const detail::parse_error*>(&ex)); + case 4: + JSON_THROW(*static_cast<const detail::out_of_range*>(&ex)); + // LCOV_EXCL_START + case 2: + JSON_THROW(*static_cast<const detail::invalid_iterator*>(&ex)); + case 3: + JSON_THROW(*static_cast<const detail::type_error*>(&ex)); + case 5: + JSON_THROW(*static_cast<const detail::other_error*>(&ex)); + default: + assert(false); + // LCOV_EXCL_STOP + } + } + return false; + } + + constexpr bool is_errored() const + { + return errored; + } + + private: + /*! + @param[in] v value to add to the JSON value we build during parsing + @param[in] skip_callback whether we should skip calling the callback + function; this is required after start_array() and + start_object() SAX events, because otherwise we would call the + callback function with an empty array or object, respectively. + + @invariant If the ref stack is empty, then the passed value will be the new + root. + @invariant If the ref stack contains a value, then it is an array or an + object to which we can add elements + + @return pair of boolean (whether value should be kept) and pointer (to the + passed value in the ref_stack hierarchy; nullptr if not kept) + */ + template<typename Value> + std::pair<bool, BasicJsonType*> handle_value(Value&& v, const bool skip_callback = false) + { + assert(not keep_stack.empty()); + + // do not handle this value if we know it would be added to a discarded + // container + if (not keep_stack.back()) + { + return {false, nullptr}; + } + + // create value + auto value = BasicJsonType(std::forward<Value>(v)); + + // check callback + const bool keep = skip_callback or callback(static_cast<int>(ref_stack.size()), parse_event_t::value, value); + + // do not handle this value if we just learnt it shall be discarded + if (not keep) + { + return {false, nullptr}; + } + + if (ref_stack.empty()) + { + root = std::move(value); + return {true, &root}; + } + + // skip this value if we already decided to skip the parent + // (https://github.com/nlohmann/json/issues/971#issuecomment-413678360) + if (not ref_stack.back()) + { + return {false, nullptr}; + } + + // we now only expect arrays and objects + assert(ref_stack.back()->is_array() or ref_stack.back()->is_object()); + + // array + if (ref_stack.back()->is_array()) + { + ref_stack.back()->m_value.array->push_back(std::move(value)); + return {true, &(ref_stack.back()->m_value.array->back())}; + } + + // object + assert(ref_stack.back()->is_object()); + // check if we should store an element for the current key + assert(not key_keep_stack.empty()); + const bool store_element = key_keep_stack.back(); + key_keep_stack.pop_back(); + + if (not store_element) + { + return {false, nullptr}; + } + + assert(object_element); + *object_element = std::move(value); + return {true, object_element}; + } + + /// the parsed JSON value + BasicJsonType& root; + /// stack to model hierarchy of values + std::vector<BasicJsonType*> ref_stack {}; + /// stack to manage which values to keep + std::vector<bool> keep_stack {}; + /// stack to manage which object keys to keep + std::vector<bool> key_keep_stack {}; + /// helper to hold the reference for the next object element + BasicJsonType* object_element = nullptr; + /// whether a syntax error occurred + bool errored = false; + /// callback function + const parser_callback_t callback = nullptr; + /// whether to throw exceptions in case of errors + const bool allow_exceptions = true; + /// a discarded value for the callback + BasicJsonType discarded = BasicJsonType::value_t::discarded; +}; + +template<typename BasicJsonType> +class json_sax_acceptor +{ + public: + using number_integer_t = typename BasicJsonType::number_integer_t; + using number_unsigned_t = typename BasicJsonType::number_unsigned_t; + using number_float_t = typename BasicJsonType::number_float_t; + using string_t = typename BasicJsonType::string_t; + + bool null() + { + return true; + } + + bool boolean(bool /*unused*/) + { + return true; + } + + bool number_integer(number_integer_t /*unused*/) + { + return true; + } + + bool number_unsigned(number_unsigned_t /*unused*/) + { + return true; + } + + bool number_float(number_float_t /*unused*/, const string_t& /*unused*/) + { + return true; + } + + bool string(string_t& /*unused*/) + { + return true; + } + + bool start_object(std::size_t /*unused*/ = std::size_t(-1)) + { + return true; + } + + bool key(string_t& /*unused*/) + { + return true; + } + + bool end_object() + { + return true; + } + + bool start_array(std::size_t /*unused*/ = std::size_t(-1)) + { + return true; + } + + bool end_array() + { + return true; + } + + bool parse_error(std::size_t /*unused*/, const std::string& /*unused*/, const detail::exception& /*unused*/) + { + return false; + } +}; +} // namespace detail + +} // namespace nlohmann + +// #include <nlohmann/detail/macro_scope.hpp> + +// #include <nlohmann/detail/meta/is_sax.hpp> + + +#include <cstdint> // size_t +#include <utility> // declval +#include <string> // string + +// #include <nlohmann/detail/meta/detected.hpp> + +// #include <nlohmann/detail/meta/type_traits.hpp> + + +namespace nlohmann +{ +namespace detail +{ +template <typename T> +using null_function_t = decltype(std::declval<T&>().null()); + +template <typename T> +using boolean_function_t = + decltype(std::declval<T&>().boolean(std::declval<bool>())); + +template <typename T, typename Integer> +using number_integer_function_t = + decltype(std::declval<T&>().number_integer(std::declval<Integer>())); + +template <typename T, typename Unsigned> +using number_unsigned_function_t = + decltype(std::declval<T&>().number_unsigned(std::declval<Unsigned>())); + +template <typename T, typename Float, typename String> +using number_float_function_t = decltype(std::declval<T&>().number_float( + std::declval<Float>(), std::declval<const String&>())); + +template <typename T, typename String> +using string_function_t = + decltype(std::declval<T&>().string(std::declval<String&>())); + +template <typename T> +using start_object_function_t = + decltype(std::declval<T&>().start_object(std::declval<std::size_t>())); + +template <typename T, typename String> +using key_function_t = + decltype(std::declval<T&>().key(std::declval<String&>())); + +template <typename T> +using end_object_function_t = decltype(std::declval<T&>().end_object()); + +template <typename T> +using start_array_function_t = + decltype(std::declval<T&>().start_array(std::declval<std::size_t>())); + +template <typename T> +using end_array_function_t = decltype(std::declval<T&>().end_array()); + +template <typename T, typename Exception> +using parse_error_function_t = decltype(std::declval<T&>().parse_error( + std::declval<std::size_t>(), std::declval<const std::string&>(), + std::declval<const Exception&>())); + +template <typename SAX, typename BasicJsonType> +struct is_sax +{ + private: + static_assert(is_basic_json<BasicJsonType>::value, + "BasicJsonType must be of type basic_json<...>"); + + using number_integer_t = typename BasicJsonType::number_integer_t; + using number_unsigned_t = typename BasicJsonType::number_unsigned_t; + using number_float_t = typename BasicJsonType::number_float_t; + using string_t = typename BasicJsonType::string_t; + using exception_t = typename BasicJsonType::exception; + + public: + static constexpr bool value = + is_detected_exact<bool, null_function_t, SAX>::value && + is_detected_exact<bool, boolean_function_t, SAX>::value && + is_detected_exact<bool, number_integer_function_t, SAX, + number_integer_t>::value && + is_detected_exact<bool, number_unsigned_function_t, SAX, + number_unsigned_t>::value && + is_detected_exact<bool, number_float_function_t, SAX, number_float_t, + string_t>::value && + is_detected_exact<bool, string_function_t, SAX, string_t>::value && + is_detected_exact<bool, start_object_function_t, SAX>::value && + is_detected_exact<bool, key_function_t, SAX, string_t>::value && + is_detected_exact<bool, end_object_function_t, SAX>::value && + is_detected_exact<bool, start_array_function_t, SAX>::value && + is_detected_exact<bool, end_array_function_t, SAX>::value && + is_detected_exact<bool, parse_error_function_t, SAX, exception_t>::value; +}; + +template <typename SAX, typename BasicJsonType> +struct is_sax_static_asserts +{ + private: + static_assert(is_basic_json<BasicJsonType>::value, + "BasicJsonType must be of type basic_json<...>"); + + using number_integer_t = typename BasicJsonType::number_integer_t; + using number_unsigned_t = typename BasicJsonType::number_unsigned_t; + using number_float_t = typename BasicJsonType::number_float_t; + using string_t = typename BasicJsonType::string_t; + using exception_t = typename BasicJsonType::exception; + + public: + static_assert(is_detected_exact<bool, null_function_t, SAX>::value, + "Missing/invalid function: bool null()"); + static_assert(is_detected_exact<bool, boolean_function_t, SAX>::value, + "Missing/invalid function: bool boolean(bool)"); + static_assert(is_detected_exact<bool, boolean_function_t, SAX>::value, + "Missing/invalid function: bool boolean(bool)"); + static_assert( + is_detected_exact<bool, number_integer_function_t, SAX, + number_integer_t>::value, + "Missing/invalid function: bool number_integer(number_integer_t)"); + static_assert( + is_detected_exact<bool, number_unsigned_function_t, SAX, + number_unsigned_t>::value, + "Missing/invalid function: bool number_unsigned(number_unsigned_t)"); + static_assert(is_detected_exact<bool, number_float_function_t, SAX, + number_float_t, string_t>::value, + "Missing/invalid function: bool number_float(number_float_t, const string_t&)"); + static_assert( + is_detected_exact<bool, string_function_t, SAX, string_t>::value, + "Missing/invalid function: bool string(string_t&)"); + static_assert(is_detected_exact<bool, start_object_function_t, SAX>::value, + "Missing/invalid function: bool start_object(std::size_t)"); + static_assert(is_detected_exact<bool, key_function_t, SAX, string_t>::value, + "Missing/invalid function: bool key(string_t&)"); + static_assert(is_detected_exact<bool, end_object_function_t, SAX>::value, + "Missing/invalid function: bool end_object()"); + static_assert(is_detected_exact<bool, start_array_function_t, SAX>::value, + "Missing/invalid function: bool start_array(std::size_t)"); + static_assert(is_detected_exact<bool, end_array_function_t, SAX>::value, + "Missing/invalid function: bool end_array()"); + static_assert( + is_detected_exact<bool, parse_error_function_t, SAX, exception_t>::value, + "Missing/invalid function: bool parse_error(std::size_t, const " + "std::string&, const exception&)"); +}; +} // namespace detail +} // namespace nlohmann + +// #include <nlohmann/detail/value_t.hpp> + + +namespace nlohmann +{ +namespace detail +{ +/////////////////// +// binary reader // +/////////////////// + +/*! +@brief deserialization of CBOR, MessagePack, and UBJSON values +*/ +template<typename BasicJsonType, typename SAX = json_sax_dom_parser<BasicJsonType>> +class binary_reader +{ + using number_integer_t = typename BasicJsonType::number_integer_t; + using number_unsigned_t = typename BasicJsonType::number_unsigned_t; + using number_float_t = typename BasicJsonType::number_float_t; + using string_t = typename BasicJsonType::string_t; + using json_sax_t = SAX; + + public: + /*! + @brief create a binary reader + + @param[in] adapter input adapter to read from + */ + explicit binary_reader(input_adapter_t adapter) : ia(std::move(adapter)) + { + (void)detail::is_sax_static_asserts<SAX, BasicJsonType> {}; + assert(ia); + } + + // make class move-only + binary_reader(const binary_reader&) = delete; + binary_reader(binary_reader&&) = default; + binary_reader& operator=(const binary_reader&) = delete; + binary_reader& operator=(binary_reader&&) = default; + ~binary_reader() = default; + + /*! + @param[in] format the binary format to parse + @param[in] sax_ a SAX event processor + @param[in] strict whether to expect the input to be consumed completed + + @return + */ + bool sax_parse(const input_format_t format, + json_sax_t* sax_, + const bool strict = true) + { + sax = sax_; + bool result = false; + + switch (format) + { + case input_format_t::bson: + result = parse_bson_internal(); + break; + + case input_format_t::cbor: + result = parse_cbor_internal(); + break; + + case input_format_t::msgpack: + result = parse_msgpack_internal(); + break; + + case input_format_t::ubjson: + result = parse_ubjson_internal(); + break; + + default: // LCOV_EXCL_LINE + assert(false); // LCOV_EXCL_LINE + } + + // strict mode: next byte must be EOF + if (result and strict) + { + if (format == input_format_t::ubjson) + { + get_ignore_noop(); + } + else + { + get(); + } + + if (JSON_UNLIKELY(current != std::char_traits<char>::eof())) + { + return sax->parse_error(chars_read, get_token_string(), + parse_error::create(110, chars_read, exception_message(format, "expected end of input; last byte: 0x" + get_token_string(), "value"))); + } + } + + return result; + } + + /*! + @brief determine system byte order + + @return true if and only if system's byte order is little endian + + @note from http://stackoverflow.com/a/1001328/266378 + */ + static constexpr bool little_endianess(int num = 1) noexcept + { + return *reinterpret_cast<char*>(&num) == 1; + } + + private: + ////////// + // BSON // + ////////// + + /*! + @brief Reads in a BSON-object and passes it to the SAX-parser. + @return whether a valid BSON-value was passed to the SAX parser + */ + bool parse_bson_internal() + { + std::int32_t document_size; + get_number<std::int32_t, true>(input_format_t::bson, document_size); + + if (JSON_UNLIKELY(not sax->start_object(std::size_t(-1)))) + { + return false; + } + + if (JSON_UNLIKELY(not parse_bson_element_list(/*is_array*/false))) + { + return false; + } + + return sax->end_object(); + } + + /*! + @brief Parses a C-style string from the BSON input. + @param[in, out] result A reference to the string variable where the read + string is to be stored. + @return `true` if the \x00-byte indicating the end of the string was + encountered before the EOF; false` indicates an unexpected EOF. + */ + bool get_bson_cstr(string_t& result) + { + auto out = std::back_inserter(result); + while (true) + { + get(); + if (JSON_UNLIKELY(not unexpect_eof(input_format_t::bson, "cstring"))) + { + return false; + } + if (current == 0x00) + { + return true; + } + *out++ = static_cast<char>(current); + } + + return true; + } + + /*! + @brief Parses a zero-terminated string of length @a len from the BSON + input. + @param[in] len The length (including the zero-byte at the end) of the + string to be read. + @param[in, out] result A reference to the string variable where the read + string is to be stored. + @tparam NumberType The type of the length @a len + @pre len >= 1 + @return `true` if the string was successfully parsed + */ + template<typename NumberType> + bool get_bson_string(const NumberType len, string_t& result) + { + if (JSON_UNLIKELY(len < 1)) + { + auto last_token = get_token_string(); + return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read, exception_message(input_format_t::bson, "string length must be at least 1, is " + std::to_string(len), "string"))); + } + + return get_string(input_format_t::bson, len - static_cast<NumberType>(1), result) and get() != std::char_traits<char>::eof(); + } + + /*! + @brief Read a BSON document element of the given @a element_type. + @param[in] element_type The BSON element type, c.f. http://bsonspec.org/spec.html + @param[in] element_type_parse_position The position in the input stream, + where the `element_type` was read. + @warning Not all BSON element types are supported yet. An unsupported + @a element_type will give rise to a parse_error.114: + Unsupported BSON record type 0x... + @return whether a valid BSON-object/array was passed to the SAX parser + */ + bool parse_bson_element_internal(const int element_type, + const std::size_t element_type_parse_position) + { + switch (element_type) + { + case 0x01: // double + { + double number; + return get_number<double, true>(input_format_t::bson, number) and sax->number_float(static_cast<number_float_t>(number), ""); + } + + case 0x02: // string + { + std::int32_t len; + string_t value; + return get_number<std::int32_t, true>(input_format_t::bson, len) and get_bson_string(len, value) and sax->string(value); + } + + case 0x03: // object + { + return parse_bson_internal(); + } + + case 0x04: // array + { + return parse_bson_array(); + } + + case 0x08: // boolean + { + return sax->boolean(get() != 0); + } + + case 0x0A: // null + { + return sax->null(); + } + + case 0x10: // int32 + { + std::int32_t value; + return get_number<std::int32_t, true>(input_format_t::bson, value) and sax->number_integer(value); + } + + case 0x12: // int64 + { + std::int64_t value; + return get_number<std::int64_t, true>(input_format_t::bson, value) and sax->number_integer(value); + } + + default: // anything else not supported (yet) + { + std::array<char, 3> cr{{}}; + (std::snprintf)(cr.data(), cr.size(), "%.2hhX", static_cast<unsigned char>(element_type)); + return sax->parse_error(element_type_parse_position, std::string(cr.data()), parse_error::create(114, element_type_parse_position, "Unsupported BSON record type 0x" + std::string(cr.data()))); + } + } + } + + /*! + @brief Read a BSON element list (as specified in the BSON-spec) + + The same binary layout is used for objects and arrays, hence it must be + indicated with the argument @a is_array which one is expected + (true --> array, false --> object). + + @param[in] is_array Determines if the element list being read is to be + treated as an object (@a is_array == false), or as an + array (@a is_array == true). + @return whether a valid BSON-object/array was passed to the SAX parser + */ + bool parse_bson_element_list(const bool is_array) + { + string_t key; + while (int element_type = get()) + { + if (JSON_UNLIKELY(not unexpect_eof(input_format_t::bson, "element list"))) + { + return false; + } + + const std::size_t element_type_parse_position = chars_read; + if (JSON_UNLIKELY(not get_bson_cstr(key))) + { + return false; + } + + if (not is_array and not sax->key(key)) + { + return false; + } + + if (JSON_UNLIKELY(not parse_bson_element_internal(element_type, element_type_parse_position))) + { + return false; + } + + // get_bson_cstr only appends + key.clear(); + } + + return true; + } + + /*! + @brief Reads an array from the BSON input and passes it to the SAX-parser. + @return whether a valid BSON-array was passed to the SAX parser + */ + bool parse_bson_array() + { + std::int32_t document_size; + get_number<std::int32_t, true>(input_format_t::bson, document_size); + + if (JSON_UNLIKELY(not sax->start_array(std::size_t(-1)))) + { + return false; + } + + if (JSON_UNLIKELY(not parse_bson_element_list(/*is_array*/true))) + { + return false; + } + + return sax->end_array(); + } + + ////////// + // CBOR // + ////////// + + /*! + @param[in] get_char whether a new character should be retrieved from the + input (true, default) or whether the last read + character should be considered instead + + @return whether a valid CBOR value was passed to the SAX parser + */ + bool parse_cbor_internal(const bool get_char = true) + { + switch (get_char ? get() : current) + { + // EOF + case std::char_traits<char>::eof(): + return unexpect_eof(input_format_t::cbor, "value"); + + // Integer 0x00..0x17 (0..23) + case 0x00: + case 0x01: + case 0x02: + case 0x03: + case 0x04: + case 0x05: + case 0x06: + case 0x07: + case 0x08: + case 0x09: + case 0x0A: + case 0x0B: + case 0x0C: + case 0x0D: + case 0x0E: + case 0x0F: + case 0x10: + case 0x11: + case 0x12: + case 0x13: + case 0x14: + case 0x15: + case 0x16: + case 0x17: + return sax->number_unsigned(static_cast<number_unsigned_t>(current)); + + case 0x18: // Unsigned integer (one-byte uint8_t follows) + { + std::uint8_t number; + return get_number(input_format_t::cbor, number) and sax->number_unsigned(number); + } + + case 0x19: // Unsigned integer (two-byte uint16_t follows) + { + std::uint16_t number; + return get_number(input_format_t::cbor, number) and sax->number_unsigned(number); + } + + case 0x1A: // Unsigned integer (four-byte uint32_t follows) + { + std::uint32_t number; + return get_number(input_format_t::cbor, number) and sax->number_unsigned(number); + } + + case 0x1B: // Unsigned integer (eight-byte uint64_t follows) + { + std::uint64_t number; + return get_number(input_format_t::cbor, number) and sax->number_unsigned(number); + } + + // Negative integer -1-0x00..-1-0x17 (-1..-24) + case 0x20: + case 0x21: + case 0x22: + case 0x23: + case 0x24: + case 0x25: + case 0x26: + case 0x27: + case 0x28: + case 0x29: + case 0x2A: + case 0x2B: + case 0x2C: + case 0x2D: + case 0x2E: + case 0x2F: + case 0x30: + case 0x31: + case 0x32: + case 0x33: + case 0x34: + case 0x35: + case 0x36: + case 0x37: + return sax->number_integer(static_cast<std::int8_t>(0x20 - 1 - current)); + + case 0x38: // Negative integer (one-byte uint8_t follows) + { + std::uint8_t number; + return get_number(input_format_t::cbor, number) and sax->number_integer(static_cast<number_integer_t>(-1) - number); + } + + case 0x39: // Negative integer -1-n (two-byte uint16_t follows) + { + std::uint16_t number; + return get_number(input_format_t::cbor, number) and sax->number_integer(static_cast<number_integer_t>(-1) - number); + } + + case 0x3A: // Negative integer -1-n (four-byte uint32_t follows) + { + std::uint32_t number; + return get_number(input_format_t::cbor, number) and sax->number_integer(static_cast<number_integer_t>(-1) - number); + } + + case 0x3B: // Negative integer -1-n (eight-byte uint64_t follows) + { + std::uint64_t number; + return get_number(input_format_t::cbor, number) and sax->number_integer(static_cast<number_integer_t>(-1) + - static_cast<number_integer_t>(number)); + } + + // UTF-8 string (0x00..0x17 bytes follow) + case 0x60: + case 0x61: + case 0x62: + case 0x63: + case 0x64: + case 0x65: + case 0x66: + case 0x67: + case 0x68: + case 0x69: + case 0x6A: + case 0x6B: + case 0x6C: + case 0x6D: + case 0x6E: + case 0x6F: + case 0x70: + case 0x71: + case 0x72: + case 0x73: + case 0x74: + case 0x75: + case 0x76: + case 0x77: + case 0x78: // UTF-8 string (one-byte uint8_t for n follows) + case 0x79: // UTF-8 string (two-byte uint16_t for n follow) + case 0x7A: // UTF-8 string (four-byte uint32_t for n follow) + case 0x7B: // UTF-8 string (eight-byte uint64_t for n follow) + case 0x7F: // UTF-8 string (indefinite length) + { + string_t s; + return get_cbor_string(s) and sax->string(s); + } + + // array (0x00..0x17 data items follow) + case 0x80: + case 0x81: + case 0x82: + case 0x83: + case 0x84: + case 0x85: + case 0x86: + case 0x87: + case 0x88: + case 0x89: + case 0x8A: + case 0x8B: + case 0x8C: + case 0x8D: + case 0x8E: + case 0x8F: + case 0x90: + case 0x91: + case 0x92: + case 0x93: + case 0x94: + case 0x95: + case 0x96: + case 0x97: + return get_cbor_array(static_cast<std::size_t>(static_cast<unsigned int>(current) & 0x1Fu)); + + case 0x98: // array (one-byte uint8_t for n follows) + { + std::uint8_t len; + return get_number(input_format_t::cbor, len) and get_cbor_array(static_cast<std::size_t>(len)); + } + + case 0x99: // array (two-byte uint16_t for n follow) + { + std::uint16_t len; + return get_number(input_format_t::cbor, len) and get_cbor_array(static_cast<std::size_t>(len)); + } + + case 0x9A: // array (four-byte uint32_t for n follow) + { + std::uint32_t len; + return get_number(input_format_t::cbor, len) and get_cbor_array(static_cast<std::size_t>(len)); + } + + case 0x9B: // array (eight-byte uint64_t for n follow) + { + std::uint64_t len; + return get_number(input_format_t::cbor, len) and get_cbor_array(static_cast<std::size_t>(len)); + } + + case 0x9F: // array (indefinite length) + return get_cbor_array(std::size_t(-1)); + + // map (0x00..0x17 pairs of data items follow) + case 0xA0: + case 0xA1: + case 0xA2: + case 0xA3: + case 0xA4: + case 0xA5: + case 0xA6: + case 0xA7: + case 0xA8: + case 0xA9: + case 0xAA: + case 0xAB: + case 0xAC: + case 0xAD: + case 0xAE: + case 0xAF: + case 0xB0: + case 0xB1: + case 0xB2: + case 0xB3: + case 0xB4: + case 0xB5: + case 0xB6: + case 0xB7: + return get_cbor_object(static_cast<std::size_t>(static_cast<unsigned int>(current) & 0x1Fu)); + + case 0xB8: // map (one-byte uint8_t for n follows) + { + std::uint8_t len; + return get_number(input_format_t::cbor, len) and get_cbor_object(static_cast<std::size_t>(len)); + } + + case 0xB9: // map (two-byte uint16_t for n follow) + { + std::uint16_t len; + return get_number(input_format_t::cbor, len) and get_cbor_object(static_cast<std::size_t>(len)); + } + + case 0xBA: // map (four-byte uint32_t for n follow) + { + std::uint32_t len; + return get_number(input_format_t::cbor, len) and get_cbor_object(static_cast<std::size_t>(len)); + } + + case 0xBB: // map (eight-byte uint64_t for n follow) + { + std::uint64_t len; + return get_number(input_format_t::cbor, len) and get_cbor_object(static_cast<std::size_t>(len)); + } + + case 0xBF: // map (indefinite length) + return get_cbor_object(std::size_t(-1)); + + case 0xF4: // false + return sax->boolean(false); + + case 0xF5: // true + return sax->boolean(true); + + case 0xF6: // null + return sax->null(); + + case 0xF9: // Half-Precision Float (two-byte IEEE 754) + { + const int byte1_raw = get(); + if (JSON_UNLIKELY(not unexpect_eof(input_format_t::cbor, "number"))) + { + return false; + } + const int byte2_raw = get(); + if (JSON_UNLIKELY(not unexpect_eof(input_format_t::cbor, "number"))) + { + return false; + } + + const auto byte1 = static_cast<unsigned char>(byte1_raw); + const auto byte2 = static_cast<unsigned char>(byte2_raw); + + // code from RFC 7049, Appendix D, Figure 3: + // As half-precision floating-point numbers were only added + // to IEEE 754 in 2008, today's programming platforms often + // still only have limited support for them. It is very + // easy to include at least decoding support for them even + // without such support. An example of a small decoder for + // half-precision floating-point numbers in the C language + // is shown in Fig. 3. + const auto half = static_cast<unsigned int>((byte1 << 8u) + byte2); + const double val = [&half] + { + const int exp = (half >> 10u) & 0x1Fu; + const unsigned int mant = half & 0x3FFu; + assert(0 <= exp and exp <= 32); + assert(0 <= mant and mant <= 1024); + switch (exp) + { + case 0: + return std::ldexp(mant, -24); + case 31: + return (mant == 0) + ? std::numeric_limits<double>::infinity() + : std::numeric_limits<double>::quiet_NaN(); + default: + return std::ldexp(mant + 1024, exp - 25); + } + }(); + return sax->number_float((half & 0x8000u) != 0 + ? static_cast<number_float_t>(-val) + : static_cast<number_float_t>(val), ""); + } + + case 0xFA: // Single-Precision Float (four-byte IEEE 754) + { + float number; + return get_number(input_format_t::cbor, number) and sax->number_float(static_cast<number_float_t>(number), ""); + } + + case 0xFB: // Double-Precision Float (eight-byte IEEE 754) + { + double number; + return get_number(input_format_t::cbor, number) and sax->number_float(static_cast<number_float_t>(number), ""); + } + + default: // anything else (0xFF is handled inside the other types) + { + auto last_token = get_token_string(); + return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read, exception_message(input_format_t::cbor, "invalid byte: 0x" + last_token, "value"))); + } + } + } + + /*! + @brief reads a CBOR string + + This function first reads starting bytes to determine the expected + string length and then copies this number of bytes into a string. + Additionally, CBOR's strings with indefinite lengths are supported. + + @param[out] result created string + + @return whether string creation completed + */ + bool get_cbor_string(string_t& result) + { + if (JSON_UNLIKELY(not unexpect_eof(input_format_t::cbor, "string"))) + { + return false; + } + + switch (current) + { + // UTF-8 string (0x00..0x17 bytes follow) + case 0x60: + case 0x61: + case 0x62: + case 0x63: + case 0x64: + case 0x65: + case 0x66: + case 0x67: + case 0x68: + case 0x69: + case 0x6A: + case 0x6B: + case 0x6C: + case 0x6D: + case 0x6E: + case 0x6F: + case 0x70: + case 0x71: + case 0x72: + case 0x73: + case 0x74: + case 0x75: + case 0x76: + case 0x77: + { + return get_string(input_format_t::cbor, static_cast<unsigned int>(current) & 0x1Fu, result); + } + + case 0x78: // UTF-8 string (one-byte uint8_t for n follows) + { + std::uint8_t len; + return get_number(input_format_t::cbor, len) and get_string(input_format_t::cbor, len, result); + } + + case 0x79: // UTF-8 string (two-byte uint16_t for n follow) + { + std::uint16_t len; + return get_number(input_format_t::cbor, len) and get_string(input_format_t::cbor, len, result); + } + + case 0x7A: // UTF-8 string (four-byte uint32_t for n follow) + { + std::uint32_t len; + return get_number(input_format_t::cbor, len) and get_string(input_format_t::cbor, len, result); + } + + case 0x7B: // UTF-8 string (eight-byte uint64_t for n follow) + { + std::uint64_t len; + return get_number(input_format_t::cbor, len) and get_string(input_format_t::cbor, len, result); + } + + case 0x7F: // UTF-8 string (indefinite length) + { + while (get() != 0xFF) + { + string_t chunk; + if (not get_cbor_string(chunk)) + { + return false; + } + result.append(chunk); + } + return true; + } + + default: + { + auto last_token = get_token_string(); + return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read, exception_message(input_format_t::cbor, "expected length specification (0x60-0x7B) or indefinite string type (0x7F); last byte: 0x" + last_token, "string"))); + } + } + } + + /*! + @param[in] len the length of the array or std::size_t(-1) for an + array of indefinite size + @return whether array creation completed + */ + bool get_cbor_array(const std::size_t len) + { + if (JSON_UNLIKELY(not sax->start_array(len))) + { + return false; + } + + if (len != std::size_t(-1)) + { + for (std::size_t i = 0; i < len; ++i) + { + if (JSON_UNLIKELY(not parse_cbor_internal())) + { + return false; + } + } + } + else + { + while (get() != 0xFF) + { + if (JSON_UNLIKELY(not parse_cbor_internal(false))) + { + return false; + } + } + } + + return sax->end_array(); + } + + /*! + @param[in] len the length of the object or std::size_t(-1) for an + object of indefinite size + @return whether object creation completed + */ + bool get_cbor_object(const std::size_t len) + { + if (JSON_UNLIKELY(not sax->start_object(len))) + { + return false; + } + + string_t key; + if (len != std::size_t(-1)) + { + for (std::size_t i = 0; i < len; ++i) + { + get(); + if (JSON_UNLIKELY(not get_cbor_string(key) or not sax->key(key))) + { + return false; + } + + if (JSON_UNLIKELY(not parse_cbor_internal())) + { + return false; + } + key.clear(); + } + } + else + { + while (get() != 0xFF) + { + if (JSON_UNLIKELY(not get_cbor_string(key) or not sax->key(key))) + { + return false; + } + + if (JSON_UNLIKELY(not parse_cbor_internal())) + { + return false; + } + key.clear(); + } + } + + return sax->end_object(); + } + + ///////////// + // MsgPack // + ///////////// + + /*! + @return whether a valid MessagePack value was passed to the SAX parser + */ + bool parse_msgpack_internal() + { + switch (get()) + { + // EOF + case std::char_traits<char>::eof(): + return unexpect_eof(input_format_t::msgpack, "value"); + + // positive fixint + case 0x00: + case 0x01: + case 0x02: + case 0x03: + case 0x04: + case 0x05: + case 0x06: + case 0x07: + case 0x08: + case 0x09: + case 0x0A: + case 0x0B: + case 0x0C: + case 0x0D: + case 0x0E: + case 0x0F: + case 0x10: + case 0x11: + case 0x12: + case 0x13: + case 0x14: + case 0x15: + case 0x16: + case 0x17: + case 0x18: + case 0x19: + case 0x1A: + case 0x1B: + case 0x1C: + case 0x1D: + case 0x1E: + case 0x1F: + case 0x20: + case 0x21: + case 0x22: + case 0x23: + case 0x24: + case 0x25: + case 0x26: + case 0x27: + case 0x28: + case 0x29: + case 0x2A: + case 0x2B: + case 0x2C: + case 0x2D: + case 0x2E: + case 0x2F: + case 0x30: + case 0x31: + case 0x32: + case 0x33: + case 0x34: + case 0x35: + case 0x36: + case 0x37: + case 0x38: + case 0x39: + case 0x3A: + case 0x3B: + case 0x3C: + case 0x3D: + case 0x3E: + case 0x3F: + case 0x40: + case 0x41: + case 0x42: + case 0x43: + case 0x44: + case 0x45: + case 0x46: + case 0x47: + case 0x48: + case 0x49: + case 0x4A: + case 0x4B: + case 0x4C: + case 0x4D: + case 0x4E: + case 0x4F: + case 0x50: + case 0x51: + case 0x52: + case 0x53: + case 0x54: + case 0x55: + case 0x56: + case 0x57: + case 0x58: + case 0x59: + case 0x5A: + case 0x5B: + case 0x5C: + case 0x5D: + case 0x5E: + case 0x5F: + case 0x60: + case 0x61: + case 0x62: + case 0x63: + case 0x64: + case 0x65: + case 0x66: + case 0x67: + case 0x68: + case 0x69: + case 0x6A: + case 0x6B: + case 0x6C: + case 0x6D: + case 0x6E: + case 0x6F: + case 0x70: + case 0x71: + case 0x72: + case 0x73: + case 0x74: + case 0x75: + case 0x76: + case 0x77: + case 0x78: + case 0x79: + case 0x7A: + case 0x7B: + case 0x7C: + case 0x7D: + case 0x7E: + case 0x7F: + return sax->number_unsigned(static_cast<number_unsigned_t>(current)); + + // fixmap + case 0x80: + case 0x81: + case 0x82: + case 0x83: + case 0x84: + case 0x85: + case 0x86: + case 0x87: + case 0x88: + case 0x89: + case 0x8A: + case 0x8B: + case 0x8C: + case 0x8D: + case 0x8E: + case 0x8F: + return get_msgpack_object(static_cast<std::size_t>(static_cast<unsigned int>(current) & 0x0Fu)); + + // fixarray + case 0x90: + case 0x91: + case 0x92: + case 0x93: + case 0x94: + case 0x95: + case 0x96: + case 0x97: + case 0x98: + case 0x99: + case 0x9A: + case 0x9B: + case 0x9C: + case 0x9D: + case 0x9E: + case 0x9F: + return get_msgpack_array(static_cast<std::size_t>(static_cast<unsigned int>(current) & 0x0Fu)); + + // fixstr + case 0xA0: + case 0xA1: + case 0xA2: + case 0xA3: + case 0xA4: + case 0xA5: + case 0xA6: + case 0xA7: + case 0xA8: + case 0xA9: + case 0xAA: + case 0xAB: + case 0xAC: + case 0xAD: + case 0xAE: + case 0xAF: + case 0xB0: + case 0xB1: + case 0xB2: + case 0xB3: + case 0xB4: + case 0xB5: + case 0xB6: + case 0xB7: + case 0xB8: + case 0xB9: + case 0xBA: + case 0xBB: + case 0xBC: + case 0xBD: + case 0xBE: + case 0xBF: + { + string_t s; + return get_msgpack_string(s) and sax->string(s); + } + + case 0xC0: // nil + return sax->null(); + + case 0xC2: // false + return sax->boolean(false); + + case 0xC3: // true + return sax->boolean(true); + + case 0xCA: // float 32 + { + float number; + return get_number(input_format_t::msgpack, number) and sax->number_float(static_cast<number_float_t>(number), ""); + } + + case 0xCB: // float 64 + { + double number; + return get_number(input_format_t::msgpack, number) and sax->number_float(static_cast<number_float_t>(number), ""); + } + + case 0xCC: // uint 8 + { + std::uint8_t number; + return get_number(input_format_t::msgpack, number) and sax->number_unsigned(number); + } + + case 0xCD: // uint 16 + { + std::uint16_t number; + return get_number(input_format_t::msgpack, number) and sax->number_unsigned(number); + } + + case 0xCE: // uint 32 + { + std::uint32_t number; + return get_number(input_format_t::msgpack, number) and sax->number_unsigned(number); + } + + case 0xCF: // uint 64 + { + std::uint64_t number; + return get_number(input_format_t::msgpack, number) and sax->number_unsigned(number); + } + + case 0xD0: // int 8 + { + std::int8_t number; + return get_number(input_format_t::msgpack, number) and sax->number_integer(number); + } + + case 0xD1: // int 16 + { + std::int16_t number; + return get_number(input_format_t::msgpack, number) and sax->number_integer(number); + } + + case 0xD2: // int 32 + { + std::int32_t number; + return get_number(input_format_t::msgpack, number) and sax->number_integer(number); + } + + case 0xD3: // int 64 + { + std::int64_t number; + return get_number(input_format_t::msgpack, number) and sax->number_integer(number); + } + + case 0xD9: // str 8 + case 0xDA: // str 16 + case 0xDB: // str 32 + { + string_t s; + return get_msgpack_string(s) and sax->string(s); + } + + case 0xDC: // array 16 + { + std::uint16_t len; + return get_number(input_format_t::msgpack, len) and get_msgpack_array(static_cast<std::size_t>(len)); + } + + case 0xDD: // array 32 + { + std::uint32_t len; + return get_number(input_format_t::msgpack, len) and get_msgpack_array(static_cast<std::size_t>(len)); + } + + case 0xDE: // map 16 + { + std::uint16_t len; + return get_number(input_format_t::msgpack, len) and get_msgpack_object(static_cast<std::size_t>(len)); + } + + case 0xDF: // map 32 + { + std::uint32_t len; + return get_number(input_format_t::msgpack, len) and get_msgpack_object(static_cast<std::size_t>(len)); + } + + // negative fixint + case 0xE0: + case 0xE1: + case 0xE2: + case 0xE3: + case 0xE4: + case 0xE5: + case 0xE6: + case 0xE7: + case 0xE8: + case 0xE9: + case 0xEA: + case 0xEB: + case 0xEC: + case 0xED: + case 0xEE: + case 0xEF: + case 0xF0: + case 0xF1: + case 0xF2: + case 0xF3: + case 0xF4: + case 0xF5: + case 0xF6: + case 0xF7: + case 0xF8: + case 0xF9: + case 0xFA: + case 0xFB: + case 0xFC: + case 0xFD: + case 0xFE: + case 0xFF: + return sax->number_integer(static_cast<std::int8_t>(current)); + + default: // anything else + { + auto last_token = get_token_string(); + return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read, exception_message(input_format_t::msgpack, "invalid byte: 0x" + last_token, "value"))); + } + } + } + + /*! + @brief reads a MessagePack string + + This function first reads starting bytes to determine the expected + string length and then copies this number of bytes into a string. + + @param[out] result created string + + @return whether string creation completed + */ + bool get_msgpack_string(string_t& result) + { + if (JSON_UNLIKELY(not unexpect_eof(input_format_t::msgpack, "string"))) + { + return false; + } + + switch (current) + { + // fixstr + case 0xA0: + case 0xA1: + case 0xA2: + case 0xA3: + case 0xA4: + case 0xA5: + case 0xA6: + case 0xA7: + case 0xA8: + case 0xA9: + case 0xAA: + case 0xAB: + case 0xAC: + case 0xAD: + case 0xAE: + case 0xAF: + case 0xB0: + case 0xB1: + case 0xB2: + case 0xB3: + case 0xB4: + case 0xB5: + case 0xB6: + case 0xB7: + case 0xB8: + case 0xB9: + case 0xBA: + case 0xBB: + case 0xBC: + case 0xBD: + case 0xBE: + case 0xBF: + { + return get_string(input_format_t::msgpack, static_cast<unsigned int>(current) & 0x1Fu, result); + } + + case 0xD9: // str 8 + { + std::uint8_t len; + return get_number(input_format_t::msgpack, len) and get_string(input_format_t::msgpack, len, result); + } + + case 0xDA: // str 16 + { + std::uint16_t len; + return get_number(input_format_t::msgpack, len) and get_string(input_format_t::msgpack, len, result); + } + + case 0xDB: // str 32 + { + std::uint32_t len; + return get_number(input_format_t::msgpack, len) and get_string(input_format_t::msgpack, len, result); + } + + default: + { + auto last_token = get_token_string(); + return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read, exception_message(input_format_t::msgpack, "expected length specification (0xA0-0xBF, 0xD9-0xDB); last byte: 0x" + last_token, "string"))); + } + } + } + + /*! + @param[in] len the length of the array + @return whether array creation completed + */ + bool get_msgpack_array(const std::size_t len) + { + if (JSON_UNLIKELY(not sax->start_array(len))) + { + return false; + } + + for (std::size_t i = 0; i < len; ++i) + { + if (JSON_UNLIKELY(not parse_msgpack_internal())) + { + return false; + } + } + + return sax->end_array(); + } + + /*! + @param[in] len the length of the object + @return whether object creation completed + */ + bool get_msgpack_object(const std::size_t len) + { + if (JSON_UNLIKELY(not sax->start_object(len))) + { + return false; + } + + string_t key; + for (std::size_t i = 0; i < len; ++i) + { + get(); + if (JSON_UNLIKELY(not get_msgpack_string(key) or not sax->key(key))) + { + return false; + } + + if (JSON_UNLIKELY(not parse_msgpack_internal())) + { + return false; + } + key.clear(); + } + + return sax->end_object(); + } + + //////////// + // UBJSON // + //////////// + + /*! + @param[in] get_char whether a new character should be retrieved from the + input (true, default) or whether the last read + character should be considered instead + + @return whether a valid UBJSON value was passed to the SAX parser + */ + bool parse_ubjson_internal(const bool get_char = true) + { + return get_ubjson_value(get_char ? get_ignore_noop() : current); + } + + /*! + @brief reads a UBJSON string + + This function is either called after reading the 'S' byte explicitly + indicating a string, or in case of an object key where the 'S' byte can be + left out. + + @param[out] result created string + @param[in] get_char whether a new character should be retrieved from the + input (true, default) or whether the last read + character should be considered instead + + @return whether string creation completed + */ + bool get_ubjson_string(string_t& result, const bool get_char = true) + { + if (get_char) + { + get(); // TODO(niels): may we ignore N here? + } + + if (JSON_UNLIKELY(not unexpect_eof(input_format_t::ubjson, "value"))) + { + return false; + } + + switch (current) + { + case 'U': + { + std::uint8_t len; + return get_number(input_format_t::ubjson, len) and get_string(input_format_t::ubjson, len, result); + } + + case 'i': + { + std::int8_t len; + return get_number(input_format_t::ubjson, len) and get_string(input_format_t::ubjson, len, result); + } + + case 'I': + { + std::int16_t len; + return get_number(input_format_t::ubjson, len) and get_string(input_format_t::ubjson, len, result); + } + + case 'l': + { + std::int32_t len; + return get_number(input_format_t::ubjson, len) and get_string(input_format_t::ubjson, len, result); + } + + case 'L': + { + std::int64_t len; + return get_number(input_format_t::ubjson, len) and get_string(input_format_t::ubjson, len, result); + } + + default: + auto last_token = get_token_string(); + return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read, exception_message(input_format_t::ubjson, "expected length type specification (U, i, I, l, L); last byte: 0x" + last_token, "string"))); + } + } + + /*! + @param[out] result determined size + @return whether size determination completed + */ + bool get_ubjson_size_value(std::size_t& result) + { + switch (get_ignore_noop()) + { + case 'U': + { + std::uint8_t number; + if (JSON_UNLIKELY(not get_number(input_format_t::ubjson, number))) + { + return false; + } + result = static_cast<std::size_t>(number); + return true; + } + + case 'i': + { + std::int8_t number; + if (JSON_UNLIKELY(not get_number(input_format_t::ubjson, number))) + { + return false; + } + result = static_cast<std::size_t>(number); + return true; + } + + case 'I': + { + std::int16_t number; + if (JSON_UNLIKELY(not get_number(input_format_t::ubjson, number))) + { + return false; + } + result = static_cast<std::size_t>(number); + return true; + } + + case 'l': + { + std::int32_t number; + if (JSON_UNLIKELY(not get_number(input_format_t::ubjson, number))) + { + return false; + } + result = static_cast<std::size_t>(number); + return true; + } + + case 'L': + { + std::int64_t number; + if (JSON_UNLIKELY(not get_number(input_format_t::ubjson, number))) + { + return false; + } + result = static_cast<std::size_t>(number); + return true; + } + + default: + { + auto last_token = get_token_string(); + return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read, exception_message(input_format_t::ubjson, "expected length type specification (U, i, I, l, L) after '#'; last byte: 0x" + last_token, "size"))); + } + } + } + + /*! + @brief determine the type and size for a container + + In the optimized UBJSON format, a type and a size can be provided to allow + for a more compact representation. + + @param[out] result pair of the size and the type + + @return whether pair creation completed + */ + bool get_ubjson_size_type(std::pair<std::size_t, int>& result) + { + result.first = string_t::npos; // size + result.second = 0; // type + + get_ignore_noop(); + + if (current == '$') + { + result.second = get(); // must not ignore 'N', because 'N' maybe the type + if (JSON_UNLIKELY(not unexpect_eof(input_format_t::ubjson, "type"))) + { + return false; + } + + get_ignore_noop(); + if (JSON_UNLIKELY(current != '#')) + { + if (JSON_UNLIKELY(not unexpect_eof(input_format_t::ubjson, "value"))) + { + return false; + } + auto last_token = get_token_string(); + return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read, exception_message(input_format_t::ubjson, "expected '#' after type information; last byte: 0x" + last_token, "size"))); + } + + return get_ubjson_size_value(result.first); + } + + if (current == '#') + { + return get_ubjson_size_value(result.first); + } + + return true; + } + + /*! + @param prefix the previously read or set type prefix + @return whether value creation completed + */ + bool get_ubjson_value(const int prefix) + { + switch (prefix) + { + case std::char_traits<char>::eof(): // EOF + return unexpect_eof(input_format_t::ubjson, "value"); + + case 'T': // true + return sax->boolean(true); + case 'F': // false + return sax->boolean(false); + + case 'Z': // null + return sax->null(); + + case 'U': + { + std::uint8_t number; + return get_number(input_format_t::ubjson, number) and sax->number_unsigned(number); + } + + case 'i': + { + std::int8_t number; + return get_number(input_format_t::ubjson, number) and sax->number_integer(number); + } + + case 'I': + { + std::int16_t number; + return get_number(input_format_t::ubjson, number) and sax->number_integer(number); + } + + case 'l': + { + std::int32_t number; + return get_number(input_format_t::ubjson, number) and sax->number_integer(number); + } + + case 'L': + { + std::int64_t number; + return get_number(input_format_t::ubjson, number) and sax->number_integer(number); + } + + case 'd': + { + float number; + return get_number(input_format_t::ubjson, number) and sax->number_float(static_cast<number_float_t>(number), ""); + } + + case 'D': + { + double number; + return get_number(input_format_t::ubjson, number) and sax->number_float(static_cast<number_float_t>(number), ""); + } + + case 'C': // char + { + get(); + if (JSON_UNLIKELY(not unexpect_eof(input_format_t::ubjson, "char"))) + { + return false; + } + if (JSON_UNLIKELY(current > 127)) + { + auto last_token = get_token_string(); + return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read, exception_message(input_format_t::ubjson, "byte after 'C' must be in range 0x00..0x7F; last byte: 0x" + last_token, "char"))); + } + string_t s(1, static_cast<char>(current)); + return sax->string(s); + } + + case 'S': // string + { + string_t s; + return get_ubjson_string(s) and sax->string(s); + } + + case '[': // array + return get_ubjson_array(); + + case '{': // object + return get_ubjson_object(); + + default: // anything else + { + auto last_token = get_token_string(); + return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read, exception_message(input_format_t::ubjson, "invalid byte: 0x" + last_token, "value"))); + } + } + } + + /*! + @return whether array creation completed + */ + bool get_ubjson_array() + { + std::pair<std::size_t, int> size_and_type; + if (JSON_UNLIKELY(not get_ubjson_size_type(size_and_type))) + { + return false; + } + + if (size_and_type.first != string_t::npos) + { + if (JSON_UNLIKELY(not sax->start_array(size_and_type.first))) + { + return false; + } + + if (size_and_type.second != 0) + { + if (size_and_type.second != 'N') + { + for (std::size_t i = 0; i < size_and_type.first; ++i) + { + if (JSON_UNLIKELY(not get_ubjson_value(size_and_type.second))) + { + return false; + } + } + } + } + else + { + for (std::size_t i = 0; i < size_and_type.first; ++i) + { + if (JSON_UNLIKELY(not parse_ubjson_internal())) + { + return false; + } + } + } + } + else + { + if (JSON_UNLIKELY(not sax->start_array(std::size_t(-1)))) + { + return false; + } + + while (current != ']') + { + if (JSON_UNLIKELY(not parse_ubjson_internal(false))) + { + return false; + } + get_ignore_noop(); + } + } + + return sax->end_array(); + } + + /*! + @return whether object creation completed + */ + bool get_ubjson_object() + { + std::pair<std::size_t, int> size_and_type; + if (JSON_UNLIKELY(not get_ubjson_size_type(size_and_type))) + { + return false; + } + + string_t key; + if (size_and_type.first != string_t::npos) + { + if (JSON_UNLIKELY(not sax->start_object(size_and_type.first))) + { + return false; + } + + if (size_and_type.second != 0) + { + for (std::size_t i = 0; i < size_and_type.first; ++i) + { + if (JSON_UNLIKELY(not get_ubjson_string(key) or not sax->key(key))) + { + return false; + } + if (JSON_UNLIKELY(not get_ubjson_value(size_and_type.second))) + { + return false; + } + key.clear(); + } + } + else + { + for (std::size_t i = 0; i < size_and_type.first; ++i) + { + if (JSON_UNLIKELY(not get_ubjson_string(key) or not sax->key(key))) + { + return false; + } + if (JSON_UNLIKELY(not parse_ubjson_internal())) + { + return false; + } + key.clear(); + } + } + } + else + { + if (JSON_UNLIKELY(not sax->start_object(std::size_t(-1)))) + { + return false; + } + + while (current != '}') + { + if (JSON_UNLIKELY(not get_ubjson_string(key, false) or not sax->key(key))) + { + return false; + } + if (JSON_UNLIKELY(not parse_ubjson_internal())) + { + return false; + } + get_ignore_noop(); + key.clear(); + } + } + + return sax->end_object(); + } + + /////////////////////// + // Utility functions // + /////////////////////// + + /*! + @brief get next character from the input + + This function provides the interface to the used input adapter. It does + not throw in case the input reached EOF, but returns a -'ve valued + `std::char_traits<char>::eof()` in that case. + + @return character read from the input + */ + int get() + { + ++chars_read; + return current = ia->get_character(); + } + + /*! + @return character read from the input after ignoring all 'N' entries + */ + int get_ignore_noop() + { + do + { + get(); + } + while (current == 'N'); + + return current; + } + + /* + @brief read a number from the input + + @tparam NumberType the type of the number + @param[in] format the current format (for diagnostics) + @param[out] result number of type @a NumberType + + @return whether conversion completed + + @note This function needs to respect the system's endianess, because + bytes in CBOR, MessagePack, and UBJSON are stored in network order + (big endian) and therefore need reordering on little endian systems. + */ + template<typename NumberType, bool InputIsLittleEndian = false> + bool get_number(const input_format_t format, NumberType& result) + { + // step 1: read input into array with system's byte order + std::array<std::uint8_t, sizeof(NumberType)> vec; + for (std::size_t i = 0; i < sizeof(NumberType); ++i) + { + get(); + if (JSON_UNLIKELY(not unexpect_eof(format, "number"))) + { + return false; + } + + // reverse byte order prior to conversion if necessary + if (is_little_endian != InputIsLittleEndian) + { + vec[sizeof(NumberType) - i - 1] = static_cast<std::uint8_t>(current); + } + else + { + vec[i] = static_cast<std::uint8_t>(current); // LCOV_EXCL_LINE + } + } + + // step 2: convert array into number of type T and return + std::memcpy(&result, vec.data(), sizeof(NumberType)); + return true; + } + + /*! + @brief create a string by reading characters from the input + + @tparam NumberType the type of the number + @param[in] format the current format (for diagnostics) + @param[in] len number of characters to read + @param[out] result string created by reading @a len bytes + + @return whether string creation completed + + @note We can not reserve @a len bytes for the result, because @a len + may be too large. Usually, @ref unexpect_eof() detects the end of + the input before we run out of string memory. + */ + template<typename NumberType> + bool get_string(const input_format_t format, + const NumberType len, + string_t& result) + { + bool success = true; + std::generate_n(std::back_inserter(result), len, [this, &success, &format]() + { + get(); + if (JSON_UNLIKELY(not unexpect_eof(format, "string"))) + { + success = false; + } + return static_cast<char>(current); + }); + return success; + } + + /*! + @param[in] format the current format (for diagnostics) + @param[in] context further context information (for diagnostics) + @return whether the last read character is not EOF + */ + bool unexpect_eof(const input_format_t format, const char* context) const + { + if (JSON_UNLIKELY(current == std::char_traits<char>::eof())) + { + return sax->parse_error(chars_read, "<end of file>", + parse_error::create(110, chars_read, exception_message(format, "unexpected end of input", context))); + } + return true; + } + + /*! + @return a string representation of the last read byte + */ + std::string get_token_string() const + { + std::array<char, 3> cr{{}}; + (std::snprintf)(cr.data(), cr.size(), "%.2hhX", static_cast<unsigned char>(current)); + return std::string{cr.data()}; + } + + /*! + @param[in] format the current format + @param[in] detail a detailed error message + @param[in] context further contect information + @return a message string to use in the parse_error exceptions + */ + std::string exception_message(const input_format_t format, + const std::string& detail, + const std::string& context) const + { + std::string error_msg = "syntax error while parsing "; + + switch (format) + { + case input_format_t::cbor: + error_msg += "CBOR"; + break; + + case input_format_t::msgpack: + error_msg += "MessagePack"; + break; + + case input_format_t::ubjson: + error_msg += "UBJSON"; + break; + + case input_format_t::bson: + error_msg += "BSON"; + break; + + default: // LCOV_EXCL_LINE + assert(false); // LCOV_EXCL_LINE + } + + return error_msg + " " + context + ": " + detail; + } + + private: + /// input adapter + input_adapter_t ia = nullptr; + + /// the current character + int current = std::char_traits<char>::eof(); + + /// the number of characters read + std::size_t chars_read = 0; + + /// whether we can assume little endianess + const bool is_little_endian = little_endianess(); + + /// the SAX parser + json_sax_t* sax = nullptr; +}; +} // namespace detail +} // namespace nlohmann + +// #include <nlohmann/detail/input/input_adapters.hpp> + +// #include <nlohmann/detail/input/lexer.hpp> + + +#include <array> // array +#include <clocale> // localeconv +#include <cstddef> // size_t +#include <cstdio> // snprintf +#include <cstdlib> // strtof, strtod, strtold, strtoll, strtoull +#include <initializer_list> // initializer_list +#include <string> // char_traits, string +#include <utility> // move +#include <vector> // vector + +// #include <nlohmann/detail/input/input_adapters.hpp> + +// #include <nlohmann/detail/input/position_t.hpp> + +// #include <nlohmann/detail/macro_scope.hpp> + + +namespace nlohmann +{ +namespace detail +{ +/////////// +// lexer // +/////////// + +/*! +@brief lexical analysis + +This class organizes the lexical analysis during JSON deserialization. +*/ +template<typename BasicJsonType> +class lexer +{ + using number_integer_t = typename BasicJsonType::number_integer_t; + using number_unsigned_t = typename BasicJsonType::number_unsigned_t; + using number_float_t = typename BasicJsonType::number_float_t; + using string_t = typename BasicJsonType::string_t; + + public: + /// token types for the parser + enum class token_type + { + uninitialized, ///< indicating the scanner is uninitialized + literal_true, ///< the `true` literal + literal_false, ///< the `false` literal + literal_null, ///< the `null` literal + value_string, ///< a string -- use get_string() for actual value + value_unsigned, ///< an unsigned integer -- use get_number_unsigned() for actual value + value_integer, ///< a signed integer -- use get_number_integer() for actual value + value_float, ///< an floating point number -- use get_number_float() for actual value + begin_array, ///< the character for array begin `[` + begin_object, ///< the character for object begin `{` + end_array, ///< the character for array end `]` + end_object, ///< the character for object end `}` + name_separator, ///< the name separator `:` + value_separator, ///< the value separator `,` + parse_error, ///< indicating a parse error + end_of_input, ///< indicating the end of the input buffer + literal_or_value ///< a literal or the begin of a value (only for diagnostics) + }; + + /// return name of values of type token_type (only used for errors) + static const char* token_type_name(const token_type t) noexcept + { + switch (t) + { + case token_type::uninitialized: + return "<uninitialized>"; + case token_type::literal_true: + return "true literal"; + case token_type::literal_false: + return "false literal"; + case token_type::literal_null: + return "null literal"; + case token_type::value_string: + return "string literal"; + case lexer::token_type::value_unsigned: + case lexer::token_type::value_integer: + case lexer::token_type::value_float: + return "number literal"; + case token_type::begin_array: + return "'['"; + case token_type::begin_object: + return "'{'"; + case token_type::end_array: + return "']'"; + case token_type::end_object: + return "'}'"; + case token_type::name_separator: + return "':'"; + case token_type::value_separator: + return "','"; + case token_type::parse_error: + return "<parse error>"; + case token_type::end_of_input: + return "end of input"; + case token_type::literal_or_value: + return "'[', '{', or a literal"; + // LCOV_EXCL_START + default: // catch non-enum values + return "unknown token"; + // LCOV_EXCL_STOP + } + } + + explicit lexer(detail::input_adapter_t&& adapter) + : ia(std::move(adapter)), decimal_point_char(get_decimal_point()) {} + + // delete because of pointer members + lexer(const lexer&) = delete; + lexer(lexer&&) = delete; + lexer& operator=(lexer&) = delete; + lexer& operator=(lexer&&) = delete; + ~lexer() = default; + + private: + ///////////////////// + // locales + ///////////////////// + + /// return the locale-dependent decimal point + static char get_decimal_point() noexcept + { + const auto loc = localeconv(); + assert(loc != nullptr); + return (loc->decimal_point == nullptr) ? '.' : *(loc->decimal_point); + } + + ///////////////////// + // scan functions + ///////////////////// + + /*! + @brief get codepoint from 4 hex characters following `\u` + + For input "\u c1 c2 c3 c4" the codepoint is: + (c1 * 0x1000) + (c2 * 0x0100) + (c3 * 0x0010) + c4 + = (c1 << 12) + (c2 << 8) + (c3 << 4) + (c4 << 0) + + Furthermore, the possible characters '0'..'9', 'A'..'F', and 'a'..'f' + must be converted to the integers 0x0..0x9, 0xA..0xF, 0xA..0xF, resp. The + conversion is done by subtracting the offset (0x30, 0x37, and 0x57) + between the ASCII value of the character and the desired integer value. + + @return codepoint (0x0000..0xFFFF) or -1 in case of an error (e.g. EOF or + non-hex character) + */ + int get_codepoint() + { + // this function only makes sense after reading `\u` + assert(current == 'u'); + int codepoint = 0; + + const auto factors = { 12u, 8u, 4u, 0u }; + for (const auto factor : factors) + { + get(); + + if (current >= '0' and current <= '9') + { + codepoint += static_cast<int>((static_cast<unsigned int>(current) - 0x30u) << factor); + } + else if (current >= 'A' and current <= 'F') + { + codepoint += static_cast<int>((static_cast<unsigned int>(current) - 0x37u) << factor); + } + else if (current >= 'a' and current <= 'f') + { + codepoint += static_cast<int>((static_cast<unsigned int>(current) - 0x57u) << factor); + } + else + { + return -1; + } + } + + assert(0x0000 <= codepoint and codepoint <= 0xFFFF); + return codepoint; + } + + /*! + @brief check if the next byte(s) are inside a given range + + Adds the current byte and, for each passed range, reads a new byte and + checks if it is inside the range. If a violation was detected, set up an + error message and return false. Otherwise, return true. + + @param[in] ranges list of integers; interpreted as list of pairs of + inclusive lower and upper bound, respectively + + @pre The passed list @a ranges must have 2, 4, or 6 elements; that is, + 1, 2, or 3 pairs. This precondition is enforced by an assertion. + + @return true if and only if no range violation was detected + */ + bool next_byte_in_range(std::initializer_list<int> ranges) + { + assert(ranges.size() == 2 or ranges.size() == 4 or ranges.size() == 6); + add(current); + + for (auto range = ranges.begin(); range != ranges.end(); ++range) + { + get(); + if (JSON_LIKELY(*range <= current and current <= *(++range))) + { + add(current); + } + else + { + error_message = "invalid string: ill-formed UTF-8 byte"; + return false; + } + } + + return true; + } + + /*! + @brief scan a string literal + + This function scans a string according to Sect. 7 of RFC 7159. While + scanning, bytes are escaped and copied into buffer token_buffer. Then the + function returns successfully, token_buffer is *not* null-terminated (as it + may contain \0 bytes), and token_buffer.size() is the number of bytes in the + string. + + @return token_type::value_string if string could be successfully scanned, + token_type::parse_error otherwise + + @note In case of errors, variable error_message contains a textual + description. + */ + token_type scan_string() + { + // reset token_buffer (ignore opening quote) + reset(); + + // we entered the function by reading an open quote + assert(current == '\"'); + + while (true) + { + // get next character + switch (get()) + { + // end of file while parsing string + case std::char_traits<char>::eof(): + { + error_message = "invalid string: missing closing quote"; + return token_type::parse_error; + } + + // closing quote + case '\"': + { + return token_type::value_string; + } + + // escapes + case '\\': + { + switch (get()) + { + // quotation mark + case '\"': + add('\"'); + break; + // reverse solidus + case '\\': + add('\\'); + break; + // solidus + case '/': + add('/'); + break; + // backspace + case 'b': + add('\b'); + break; + // form feed + case 'f': + add('\f'); + break; + // line feed + case 'n': + add('\n'); + break; + // carriage return + case 'r': + add('\r'); + break; + // tab + case 't': + add('\t'); + break; + + // unicode escapes + case 'u': + { + const int codepoint1 = get_codepoint(); + int codepoint = codepoint1; // start with codepoint1 + + if (JSON_UNLIKELY(codepoint1 == -1)) + { + error_message = "invalid string: '\\u' must be followed by 4 hex digits"; + return token_type::parse_error; + } + + // check if code point is a high surrogate + if (0xD800 <= codepoint1 and codepoint1 <= 0xDBFF) + { + // expect next \uxxxx entry + if (JSON_LIKELY(get() == '\\' and get() == 'u')) + { + const int codepoint2 = get_codepoint(); + + if (JSON_UNLIKELY(codepoint2 == -1)) + { + error_message = "invalid string: '\\u' must be followed by 4 hex digits"; + return token_type::parse_error; + } + + // check if codepoint2 is a low surrogate + if (JSON_LIKELY(0xDC00 <= codepoint2 and codepoint2 <= 0xDFFF)) + { + // overwrite codepoint + codepoint = static_cast<int>( + // high surrogate occupies the most significant 22 bits + (static_cast<unsigned int>(codepoint1) << 10u) + // low surrogate occupies the least significant 15 bits + + static_cast<unsigned int>(codepoint2) + // there is still the 0xD800, 0xDC00 and 0x10000 noise + // in the result so we have to subtract with: + // (0xD800 << 10) + DC00 - 0x10000 = 0x35FDC00 + - 0x35FDC00u); + } + else + { + error_message = "invalid string: surrogate U+DC00..U+DFFF must be followed by U+DC00..U+DFFF"; + return token_type::parse_error; + } + } + else + { + error_message = "invalid string: surrogate U+DC00..U+DFFF must be followed by U+DC00..U+DFFF"; + return token_type::parse_error; + } + } + else + { + if (JSON_UNLIKELY(0xDC00 <= codepoint1 and codepoint1 <= 0xDFFF)) + { + error_message = "invalid string: surrogate U+DC00..U+DFFF must follow U+D800..U+DBFF"; + return token_type::parse_error; + } + } + + // result of the above calculation yields a proper codepoint + assert(0x00 <= codepoint and codepoint <= 0x10FFFF); + + // translate codepoint into bytes + if (codepoint < 0x80) + { + // 1-byte characters: 0xxxxxxx (ASCII) + add(codepoint); + } + else if (codepoint <= 0x7FF) + { + // 2-byte characters: 110xxxxx 10xxxxxx + add(static_cast<int>(0xC0u | (static_cast<unsigned int>(codepoint) >> 6u))); + add(static_cast<int>(0x80u | (static_cast<unsigned int>(codepoint) & 0x3Fu))); + } + else if (codepoint <= 0xFFFF) + { + // 3-byte characters: 1110xxxx 10xxxxxx 10xxxxxx + add(static_cast<int>(0xE0u | (static_cast<unsigned int>(codepoint) >> 12u))); + add(static_cast<int>(0x80u | ((static_cast<unsigned int>(codepoint) >> 6u) & 0x3Fu))); + add(static_cast<int>(0x80u | (static_cast<unsigned int>(codepoint) & 0x3Fu))); + } + else + { + // 4-byte characters: 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx + add(static_cast<int>(0xF0u | (static_cast<unsigned int>(codepoint) >> 18u))); + add(static_cast<int>(0x80u | ((static_cast<unsigned int>(codepoint) >> 12u) & 0x3Fu))); + add(static_cast<int>(0x80u | ((static_cast<unsigned int>(codepoint) >> 6u) & 0x3Fu))); + add(static_cast<int>(0x80u | (static_cast<unsigned int>(codepoint) & 0x3Fu))); + } + + break; + } + + // other characters after escape + default: + error_message = "invalid string: forbidden character after backslash"; + return token_type::parse_error; + } + + break; + } + + // invalid control characters + case 0x00: + { + error_message = "invalid string: control character U+0000 (NUL) must be escaped to \\u0000"; + return token_type::parse_error; + } + + case 0x01: + { + error_message = "invalid string: control character U+0001 (SOH) must be escaped to \\u0001"; + return token_type::parse_error; + } + + case 0x02: + { + error_message = "invalid string: control character U+0002 (STX) must be escaped to \\u0002"; + return token_type::parse_error; + } + + case 0x03: + { + error_message = "invalid string: control character U+0003 (ETX) must be escaped to \\u0003"; + return token_type::parse_error; + } + + case 0x04: + { + error_message = "invalid string: control character U+0004 (EOT) must be escaped to \\u0004"; + return token_type::parse_error; + } + + case 0x05: + { + error_message = "invalid string: control character U+0005 (ENQ) must be escaped to \\u0005"; + return token_type::parse_error; + } + + case 0x06: + { + error_message = "invalid string: control character U+0006 (ACK) must be escaped to \\u0006"; + return token_type::parse_error; + } + + case 0x07: + { + error_message = "invalid string: control character U+0007 (BEL) must be escaped to \\u0007"; + return token_type::parse_error; + } + + case 0x08: + { + error_message = "invalid string: control character U+0008 (BS) must be escaped to \\u0008 or \\b"; + return token_type::parse_error; + } + + case 0x09: + { + error_message = "invalid string: control character U+0009 (HT) must be escaped to \\u0009 or \\t"; + return token_type::parse_error; + } + + case 0x0A: + { + error_message = "invalid string: control character U+000A (LF) must be escaped to \\u000A or \\n"; + return token_type::parse_error; + } + + case 0x0B: + { + error_message = "invalid string: control character U+000B (VT) must be escaped to \\u000B"; + return token_type::parse_error; + } + + case 0x0C: + { + error_message = "invalid string: control character U+000C (FF) must be escaped to \\u000C or \\f"; + return token_type::parse_error; + } + + case 0x0D: + { + error_message = "invalid string: control character U+000D (CR) must be escaped to \\u000D or \\r"; + return token_type::parse_error; + } + + case 0x0E: + { + error_message = "invalid string: control character U+000E (SO) must be escaped to \\u000E"; + return token_type::parse_error; + } + + case 0x0F: + { + error_message = "invalid string: control character U+000F (SI) must be escaped to \\u000F"; + return token_type::parse_error; + } + + case 0x10: + { + error_message = "invalid string: control character U+0010 (DLE) must be escaped to \\u0010"; + return token_type::parse_error; + } + + case 0x11: + { + error_message = "invalid string: control character U+0011 (DC1) must be escaped to \\u0011"; + return token_type::parse_error; + } + + case 0x12: + { + error_message = "invalid string: control character U+0012 (DC2) must be escaped to \\u0012"; + return token_type::parse_error; + } + + case 0x13: + { + error_message = "invalid string: control character U+0013 (DC3) must be escaped to \\u0013"; + return token_type::parse_error; + } + + case 0x14: + { + error_message = "invalid string: control character U+0014 (DC4) must be escaped to \\u0014"; + return token_type::parse_error; + } + + case 0x15: + { + error_message = "invalid string: control character U+0015 (NAK) must be escaped to \\u0015"; + return token_type::parse_error; + } + + case 0x16: + { + error_message = "invalid string: control character U+0016 (SYN) must be escaped to \\u0016"; + return token_type::parse_error; + } + + case 0x17: + { + error_message = "invalid string: control character U+0017 (ETB) must be escaped to \\u0017"; + return token_type::parse_error; + } + + case 0x18: + { + error_message = "invalid string: control character U+0018 (CAN) must be escaped to \\u0018"; + return token_type::parse_error; + } + + case 0x19: + { + error_message = "invalid string: control character U+0019 (EM) must be escaped to \\u0019"; + return token_type::parse_error; + } + + case 0x1A: + { + error_message = "invalid string: control character U+001A (SUB) must be escaped to \\u001A"; + return token_type::parse_error; + } + + case 0x1B: + { + error_message = "invalid string: control character U+001B (ESC) must be escaped to \\u001B"; + return token_type::parse_error; + } + + case 0x1C: + { + error_message = "invalid string: control character U+001C (FS) must be escaped to \\u001C"; + return token_type::parse_error; + } + + case 0x1D: + { + error_message = "invalid string: control character U+001D (GS) must be escaped to \\u001D"; + return token_type::parse_error; + } + + case 0x1E: + { + error_message = "invalid string: control character U+001E (RS) must be escaped to \\u001E"; + return token_type::parse_error; + } + + case 0x1F: + { + error_message = "invalid string: control character U+001F (US) must be escaped to \\u001F"; + return token_type::parse_error; + } + + // U+0020..U+007F (except U+0022 (quote) and U+005C (backspace)) + case 0x20: + case 0x21: + case 0x23: + case 0x24: + case 0x25: + case 0x26: + case 0x27: + case 0x28: + case 0x29: + case 0x2A: + case 0x2B: + case 0x2C: + case 0x2D: + case 0x2E: + case 0x2F: + case 0x30: + case 0x31: + case 0x32: + case 0x33: + case 0x34: + case 0x35: + case 0x36: + case 0x37: + case 0x38: + case 0x39: + case 0x3A: + case 0x3B: + case 0x3C: + case 0x3D: + case 0x3E: + case 0x3F: + case 0x40: + case 0x41: + case 0x42: + case 0x43: + case 0x44: + case 0x45: + case 0x46: + case 0x47: + case 0x48: + case 0x49: + case 0x4A: + case 0x4B: + case 0x4C: + case 0x4D: + case 0x4E: + case 0x4F: + case 0x50: + case 0x51: + case 0x52: + case 0x53: + case 0x54: + case 0x55: + case 0x56: + case 0x57: + case 0x58: + case 0x59: + case 0x5A: + case 0x5B: + case 0x5D: + case 0x5E: + case 0x5F: + case 0x60: + case 0x61: + case 0x62: + case 0x63: + case 0x64: + case 0x65: + case 0x66: + case 0x67: + case 0x68: + case 0x69: + case 0x6A: + case 0x6B: + case 0x6C: + case 0x6D: + case 0x6E: + case 0x6F: + case 0x70: + case 0x71: + case 0x72: + case 0x73: + case 0x74: + case 0x75: + case 0x76: + case 0x77: + case 0x78: + case 0x79: + case 0x7A: + case 0x7B: + case 0x7C: + case 0x7D: + case 0x7E: + case 0x7F: + { + add(current); + break; + } + + // U+0080..U+07FF: bytes C2..DF 80..BF + case 0xC2: + case 0xC3: + case 0xC4: + case 0xC5: + case 0xC6: + case 0xC7: + case 0xC8: + case 0xC9: + case 0xCA: + case 0xCB: + case 0xCC: + case 0xCD: + case 0xCE: + case 0xCF: + case 0xD0: + case 0xD1: + case 0xD2: + case 0xD3: + case 0xD4: + case 0xD5: + case 0xD6: + case 0xD7: + case 0xD8: + case 0xD9: + case 0xDA: + case 0xDB: + case 0xDC: + case 0xDD: + case 0xDE: + case 0xDF: + { + if (JSON_UNLIKELY(not next_byte_in_range({0x80, 0xBF}))) + { + return token_type::parse_error; + } + break; + } + + // U+0800..U+0FFF: bytes E0 A0..BF 80..BF + case 0xE0: + { + if (JSON_UNLIKELY(not (next_byte_in_range({0xA0, 0xBF, 0x80, 0xBF})))) + { + return token_type::parse_error; + } + break; + } + + // U+1000..U+CFFF: bytes E1..EC 80..BF 80..BF + // U+E000..U+FFFF: bytes EE..EF 80..BF 80..BF + case 0xE1: + case 0xE2: + case 0xE3: + case 0xE4: + case 0xE5: + case 0xE6: + case 0xE7: + case 0xE8: + case 0xE9: + case 0xEA: + case 0xEB: + case 0xEC: + case 0xEE: + case 0xEF: + { + if (JSON_UNLIKELY(not (next_byte_in_range({0x80, 0xBF, 0x80, 0xBF})))) + { + return token_type::parse_error; + } + break; + } + + // U+D000..U+D7FF: bytes ED 80..9F 80..BF + case 0xED: + { + if (JSON_UNLIKELY(not (next_byte_in_range({0x80, 0x9F, 0x80, 0xBF})))) + { + return token_type::parse_error; + } + break; + } + + // U+10000..U+3FFFF F0 90..BF 80..BF 80..BF + case 0xF0: + { + if (JSON_UNLIKELY(not (next_byte_in_range({0x90, 0xBF, 0x80, 0xBF, 0x80, 0xBF})))) + { + return token_type::parse_error; + } + break; + } + + // U+40000..U+FFFFF F1..F3 80..BF 80..BF 80..BF + case 0xF1: + case 0xF2: + case 0xF3: + { + if (JSON_UNLIKELY(not (next_byte_in_range({0x80, 0xBF, 0x80, 0xBF, 0x80, 0xBF})))) + { + return token_type::parse_error; + } + break; + } + + // U+100000..U+10FFFF F4 80..8F 80..BF 80..BF + case 0xF4: + { + if (JSON_UNLIKELY(not (next_byte_in_range({0x80, 0x8F, 0x80, 0xBF, 0x80, 0xBF})))) + { + return token_type::parse_error; + } + break; + } + + // remaining bytes (80..C1 and F5..FF) are ill-formed + default: + { + error_message = "invalid string: ill-formed UTF-8 byte"; + return token_type::parse_error; + } + } + } + } + + static void strtof(float& f, const char* str, char** endptr) noexcept + { + f = std::strtof(str, endptr); + } + + static void strtof(double& f, const char* str, char** endptr) noexcept + { + f = std::strtod(str, endptr); + } + + static void strtof(long double& f, const char* str, char** endptr) noexcept + { + f = std::strtold(str, endptr); + } + + /*! + @brief scan a number literal + + This function scans a string according to Sect. 6 of RFC 7159. + + The function is realized with a deterministic finite state machine derived + from the grammar described in RFC 7159. Starting in state "init", the + input is read and used to determined the next state. Only state "done" + accepts the number. State "error" is a trap state to model errors. In the + table below, "anything" means any character but the ones listed before. + + state | 0 | 1-9 | e E | + | - | . | anything + ---------|----------|----------|----------|---------|---------|----------|----------- + init | zero | any1 | [error] | [error] | minus | [error] | [error] + minus | zero | any1 | [error] | [error] | [error] | [error] | [error] + zero | done | done | exponent | done | done | decimal1 | done + any1 | any1 | any1 | exponent | done | done | decimal1 | done + decimal1 | decimal2 | [error] | [error] | [error] | [error] | [error] | [error] + decimal2 | decimal2 | decimal2 | exponent | done | done | done | done + exponent | any2 | any2 | [error] | sign | sign | [error] | [error] + sign | any2 | any2 | [error] | [error] | [error] | [error] | [error] + any2 | any2 | any2 | done | done | done | done | done + + The state machine is realized with one label per state (prefixed with + "scan_number_") and `goto` statements between them. The state machine + contains cycles, but any cycle can be left when EOF is read. Therefore, + the function is guaranteed to terminate. + + During scanning, the read bytes are stored in token_buffer. This string is + then converted to a signed integer, an unsigned integer, or a + floating-point number. + + @return token_type::value_unsigned, token_type::value_integer, or + token_type::value_float if number could be successfully scanned, + token_type::parse_error otherwise + + @note The scanner is independent of the current locale. Internally, the + locale's decimal point is used instead of `.` to work with the + locale-dependent converters. + */ + token_type scan_number() // lgtm [cpp/use-of-goto] + { + // reset token_buffer to store the number's bytes + reset(); + + // the type of the parsed number; initially set to unsigned; will be + // changed if minus sign, decimal point or exponent is read + token_type number_type = token_type::value_unsigned; + + // state (init): we just found out we need to scan a number + switch (current) + { + case '-': + { + add(current); + goto scan_number_minus; + } + + case '0': + { + add(current); + goto scan_number_zero; + } + + case '1': + case '2': + case '3': + case '4': + case '5': + case '6': + case '7': + case '8': + case '9': + { + add(current); + goto scan_number_any1; + } + + // all other characters are rejected outside scan_number() + default: // LCOV_EXCL_LINE + assert(false); // LCOV_EXCL_LINE + } + +scan_number_minus: + // state: we just parsed a leading minus sign + number_type = token_type::value_integer; + switch (get()) + { + case '0': + { + add(current); + goto scan_number_zero; + } + + case '1': + case '2': + case '3': + case '4': + case '5': + case '6': + case '7': + case '8': + case '9': + { + add(current); + goto scan_number_any1; + } + + default: + { + error_message = "invalid number; expected digit after '-'"; + return token_type::parse_error; + } + } + +scan_number_zero: + // state: we just parse a zero (maybe with a leading minus sign) + switch (get()) + { + case '.': + { + add(decimal_point_char); + goto scan_number_decimal1; + } + + case 'e': + case 'E': + { + add(current); + goto scan_number_exponent; + } + + default: + goto scan_number_done; + } + +scan_number_any1: + // state: we just parsed a number 0-9 (maybe with a leading minus sign) + switch (get()) + { + case '0': + case '1': + case '2': + case '3': + case '4': + case '5': + case '6': + case '7': + case '8': + case '9': + { + add(current); + goto scan_number_any1; + } + + case '.': + { + add(decimal_point_char); + goto scan_number_decimal1; + } + + case 'e': + case 'E': + { + add(current); + goto scan_number_exponent; + } + + default: + goto scan_number_done; + } + +scan_number_decimal1: + // state: we just parsed a decimal point + number_type = token_type::value_float; + switch (get()) + { + case '0': + case '1': + case '2': + case '3': + case '4': + case '5': + case '6': + case '7': + case '8': + case '9': + { + add(current); + goto scan_number_decimal2; + } + + default: + { + error_message = "invalid number; expected digit after '.'"; + return token_type::parse_error; + } + } + +scan_number_decimal2: + // we just parsed at least one number after a decimal point + switch (get()) + { + case '0': + case '1': + case '2': + case '3': + case '4': + case '5': + case '6': + case '7': + case '8': + case '9': + { + add(current); + goto scan_number_decimal2; + } + + case 'e': + case 'E': + { + add(current); + goto scan_number_exponent; + } + + default: + goto scan_number_done; + } + +scan_number_exponent: + // we just parsed an exponent + number_type = token_type::value_float; + switch (get()) + { + case '+': + case '-': + { + add(current); + goto scan_number_sign; + } + + case '0': + case '1': + case '2': + case '3': + case '4': + case '5': + case '6': + case '7': + case '8': + case '9': + { + add(current); + goto scan_number_any2; + } + + default: + { + error_message = + "invalid number; expected '+', '-', or digit after exponent"; + return token_type::parse_error; + } + } + +scan_number_sign: + // we just parsed an exponent sign + switch (get()) + { + case '0': + case '1': + case '2': + case '3': + case '4': + case '5': + case '6': + case '7': + case '8': + case '9': + { + add(current); + goto scan_number_any2; + } + + default: + { + error_message = "invalid number; expected digit after exponent sign"; + return token_type::parse_error; + } + } + +scan_number_any2: + // we just parsed a number after the exponent or exponent sign + switch (get()) + { + case '0': + case '1': + case '2': + case '3': + case '4': + case '5': + case '6': + case '7': + case '8': + case '9': + { + add(current); + goto scan_number_any2; + } + + default: + goto scan_number_done; + } + +scan_number_done: + // unget the character after the number (we only read it to know that + // we are done scanning a number) + unget(); + + char* endptr = nullptr; + errno = 0; + + // try to parse integers first and fall back to floats + if (number_type == token_type::value_unsigned) + { + const auto x = std::strtoull(token_buffer.data(), &endptr, 10); + + // we checked the number format before + assert(endptr == token_buffer.data() + token_buffer.size()); + + if (errno == 0) + { + value_unsigned = static_cast<number_unsigned_t>(x); + if (value_unsigned == x) + { + return token_type::value_unsigned; + } + } + } + else if (number_type == token_type::value_integer) + { + const auto x = std::strtoll(token_buffer.data(), &endptr, 10); + + // we checked the number format before + assert(endptr == token_buffer.data() + token_buffer.size()); + + if (errno == 0) + { + value_integer = static_cast<number_integer_t>(x); + if (value_integer == x) + { + return token_type::value_integer; + } + } + } + + // this code is reached if we parse a floating-point number or if an + // integer conversion above failed + strtof(value_float, token_buffer.data(), &endptr); + + // we checked the number format before + assert(endptr == token_buffer.data() + token_buffer.size()); + + return token_type::value_float; + } + + /*! + @param[in] literal_text the literal text to expect + @param[in] length the length of the passed literal text + @param[in] return_type the token type to return on success + */ + token_type scan_literal(const char* literal_text, const std::size_t length, + token_type return_type) + { + assert(current == literal_text[0]); + for (std::size_t i = 1; i < length; ++i) + { + if (JSON_UNLIKELY(get() != literal_text[i])) + { + error_message = "invalid literal"; + return token_type::parse_error; + } + } + return return_type; + } + + ///////////////////// + // input management + ///////////////////// + + /// reset token_buffer; current character is beginning of token + void reset() noexcept + { + token_buffer.clear(); + token_string.clear(); + token_string.push_back(std::char_traits<char>::to_char_type(current)); + } + + /* + @brief get next character from the input + + This function provides the interface to the used input adapter. It does + not throw in case the input reached EOF, but returns a + `std::char_traits<char>::eof()` in that case. Stores the scanned characters + for use in error messages. + + @return character read from the input + */ + std::char_traits<char>::int_type get() + { + ++position.chars_read_total; + ++position.chars_read_current_line; + + if (next_unget) + { + // just reset the next_unget variable and work with current + next_unget = false; + } + else + { + current = ia->get_character(); + } + + if (JSON_LIKELY(current != std::char_traits<char>::eof())) + { + token_string.push_back(std::char_traits<char>::to_char_type(current)); + } + + if (current == '\n') + { + ++position.lines_read; + position.chars_read_current_line = 0; + } + + return current; + } + + /*! + @brief unget current character (read it again on next get) + + We implement unget by setting variable next_unget to true. The input is not + changed - we just simulate ungetting by modifying chars_read_total, + chars_read_current_line, and token_string. The next call to get() will + behave as if the unget character is read again. + */ + void unget() + { + next_unget = true; + + --position.chars_read_total; + + // in case we "unget" a newline, we have to also decrement the lines_read + if (position.chars_read_current_line == 0) + { + if (position.lines_read > 0) + { + --position.lines_read; + } + } + else + { + --position.chars_read_current_line; + } + + if (JSON_LIKELY(current != std::char_traits<char>::eof())) + { + assert(not token_string.empty()); + token_string.pop_back(); + } + } + + /// add a character to token_buffer + void add(int c) + { + token_buffer.push_back(std::char_traits<char>::to_char_type(c)); + } + + public: + ///////////////////// + // value getters + ///////////////////// + + /// return integer value + constexpr number_integer_t get_number_integer() const noexcept + { + return value_integer; + } + + /// return unsigned integer value + constexpr number_unsigned_t get_number_unsigned() const noexcept + { + return value_unsigned; + } + + /// return floating-point value + constexpr number_float_t get_number_float() const noexcept + { + return value_float; + } + + /// return current string value (implicitly resets the token; useful only once) + string_t& get_string() + { + return token_buffer; + } + + ///////////////////// + // diagnostics + ///////////////////// + + /// return position of last read token + constexpr position_t get_position() const noexcept + { + return position; + } + + /// return the last read token (for errors only). Will never contain EOF + /// (an arbitrary value that is not a valid char value, often -1), because + /// 255 may legitimately occur. May contain NUL, which should be escaped. + std::string get_token_string() const + { + // escape control characters + std::string result; + for (const auto c : token_string) + { + if ('\x00' <= c and c <= '\x1F') + { + // escape control characters + std::array<char, 9> cs{{}}; + (std::snprintf)(cs.data(), cs.size(), "<U+%.4X>", static_cast<unsigned char>(c)); + result += cs.data(); + } + else + { + // add character as is + result.push_back(c); + } + } + + return result; + } + + /// return syntax error message + constexpr const char* get_error_message() const noexcept + { + return error_message; + } + + ///////////////////// + // actual scanner + ///////////////////// + + /*! + @brief skip the UTF-8 byte order mark + @return true iff there is no BOM or the correct BOM has been skipped + */ + bool skip_bom() + { + if (get() == 0xEF) + { + // check if we completely parse the BOM + return get() == 0xBB and get() == 0xBF; + } + + // the first character is not the beginning of the BOM; unget it to + // process is later + unget(); + return true; + } + + token_type scan() + { + // initially, skip the BOM + if (position.chars_read_total == 0 and not skip_bom()) + { + error_message = "invalid BOM; must be 0xEF 0xBB 0xBF if given"; + return token_type::parse_error; + } + + // read next character and ignore whitespace + do + { + get(); + } + while (current == ' ' or current == '\t' or current == '\n' or current == '\r'); + + switch (current) + { + // structural characters + case '[': + return token_type::begin_array; + case ']': + return token_type::end_array; + case '{': + return token_type::begin_object; + case '}': + return token_type::end_object; + case ':': + return token_type::name_separator; + case ',': + return token_type::value_separator; + + // literals + case 't': + return scan_literal("true", 4, token_type::literal_true); + case 'f': + return scan_literal("false", 5, token_type::literal_false); + case 'n': + return scan_literal("null", 4, token_type::literal_null); + + // string + case '\"': + return scan_string(); + + // number + case '-': + case '0': + case '1': + case '2': + case '3': + case '4': + case '5': + case '6': + case '7': + case '8': + case '9': + return scan_number(); + + // end of input (the null byte is needed when parsing from + // string literals) + case '\0': + case std::char_traits<char>::eof(): + return token_type::end_of_input; + + // error + default: + error_message = "invalid literal"; + return token_type::parse_error; + } + } + + private: + /// input adapter + detail::input_adapter_t ia = nullptr; + + /// the current character + std::char_traits<char>::int_type current = std::char_traits<char>::eof(); + + /// whether the next get() call should just return current + bool next_unget = false; + + /// the start position of the current token + position_t position {}; + + /// raw input token string (for error messages) + std::vector<char> token_string {}; + + /// buffer for variable-length tokens (numbers, strings) + string_t token_buffer {}; + + /// a description of occurred lexer errors + const char* error_message = ""; + + // number values + number_integer_t value_integer = 0; + number_unsigned_t value_unsigned = 0; + number_float_t value_float = 0; + + /// the decimal point + const char decimal_point_char = '.'; +}; +} // namespace detail +} // namespace nlohmann + +// #include <nlohmann/detail/input/parser.hpp> + + +#include <cassert> // assert +#include <cmath> // isfinite +#include <cstdint> // uint8_t +#include <functional> // function +#include <string> // string +#include <utility> // move +#include <vector> // vector + +// #include <nlohmann/detail/exceptions.hpp> + +// #include <nlohmann/detail/input/input_adapters.hpp> + +// #include <nlohmann/detail/input/json_sax.hpp> + +// #include <nlohmann/detail/input/lexer.hpp> + +// #include <nlohmann/detail/macro_scope.hpp> + +// #include <nlohmann/detail/meta/is_sax.hpp> + +// #include <nlohmann/detail/value_t.hpp> + + +namespace nlohmann +{ +namespace detail +{ +//////////// +// parser // +//////////// + +/*! +@brief syntax analysis + +This class implements a recursive decent parser. +*/ +template<typename BasicJsonType> +class parser +{ + using number_integer_t = typename BasicJsonType::number_integer_t; + using number_unsigned_t = typename BasicJsonType::number_unsigned_t; + using number_float_t = typename BasicJsonType::number_float_t; + using string_t = typename BasicJsonType::string_t; + using lexer_t = lexer<BasicJsonType>; + using token_type = typename lexer_t::token_type; + + public: + enum class parse_event_t : uint8_t + { + /// the parser read `{` and started to process a JSON object + object_start, + /// the parser read `}` and finished processing a JSON object + object_end, + /// the parser read `[` and started to process a JSON array + array_start, + /// the parser read `]` and finished processing a JSON array + array_end, + /// the parser read a key of a value in an object + key, + /// the parser finished reading a JSON value + value + }; + + using parser_callback_t = + std::function<bool(int depth, parse_event_t event, BasicJsonType& parsed)>; + + /// a parser reading from an input adapter + explicit parser(detail::input_adapter_t&& adapter, + const parser_callback_t cb = nullptr, + const bool allow_exceptions_ = true) + : callback(cb), m_lexer(std::move(adapter)), allow_exceptions(allow_exceptions_) + { + // read first token + get_token(); + } + + /*! + @brief public parser interface + + @param[in] strict whether to expect the last token to be EOF + @param[in,out] result parsed JSON value + + @throw parse_error.101 in case of an unexpected token + @throw parse_error.102 if to_unicode fails or surrogate error + @throw parse_error.103 if to_unicode fails + */ + void parse(const bool strict, BasicJsonType& result) + { + if (callback) + { + json_sax_dom_callback_parser<BasicJsonType> sdp(result, callback, allow_exceptions); + sax_parse_internal(&sdp); + result.assert_invariant(); + + // in strict mode, input must be completely read + if (strict and (get_token() != token_type::end_of_input)) + { + sdp.parse_error(m_lexer.get_position(), + m_lexer.get_token_string(), + parse_error::create(101, m_lexer.get_position(), + exception_message(token_type::end_of_input, "value"))); + } + + // in case of an error, return discarded value + if (sdp.is_errored()) + { + result = value_t::discarded; + return; + } + + // set top-level value to null if it was discarded by the callback + // function + if (result.is_discarded()) + { + result = nullptr; + } + } + else + { + json_sax_dom_parser<BasicJsonType> sdp(result, allow_exceptions); + sax_parse_internal(&sdp); + result.assert_invariant(); + + // in strict mode, input must be completely read + if (strict and (get_token() != token_type::end_of_input)) + { + sdp.parse_error(m_lexer.get_position(), + m_lexer.get_token_string(), + parse_error::create(101, m_lexer.get_position(), + exception_message(token_type::end_of_input, "value"))); + } + + // in case of an error, return discarded value + if (sdp.is_errored()) + { + result = value_t::discarded; + return; + } + } + } + + /*! + @brief public accept interface + + @param[in] strict whether to expect the last token to be EOF + @return whether the input is a proper JSON text + */ + bool accept(const bool strict = true) + { + json_sax_acceptor<BasicJsonType> sax_acceptor; + return sax_parse(&sax_acceptor, strict); + } + + template <typename SAX> + bool sax_parse(SAX* sax, const bool strict = true) + { + (void)detail::is_sax_static_asserts<SAX, BasicJsonType> {}; + const bool result = sax_parse_internal(sax); + + // strict mode: next byte must be EOF + if (result and strict and (get_token() != token_type::end_of_input)) + { + return sax->parse_error(m_lexer.get_position(), + m_lexer.get_token_string(), + parse_error::create(101, m_lexer.get_position(), + exception_message(token_type::end_of_input, "value"))); + } + + return result; + } + + private: + template <typename SAX> + bool sax_parse_internal(SAX* sax) + { + // stack to remember the hierarchy of structured values we are parsing + // true = array; false = object + std::vector<bool> states; + // value to avoid a goto (see comment where set to true) + bool skip_to_state_evaluation = false; + + while (true) + { + if (not skip_to_state_evaluation) + { + // invariant: get_token() was called before each iteration + switch (last_token) + { + case token_type::begin_object: + { + if (JSON_UNLIKELY(not sax->start_object(std::size_t(-1)))) + { + return false; + } + + // closing } -> we are done + if (get_token() == token_type::end_object) + { + if (JSON_UNLIKELY(not sax->end_object())) + { + return false; + } + break; + } + + // parse key + if (JSON_UNLIKELY(last_token != token_type::value_string)) + { + return sax->parse_error(m_lexer.get_position(), + m_lexer.get_token_string(), + parse_error::create(101, m_lexer.get_position(), + exception_message(token_type::value_string, "object key"))); + } + if (JSON_UNLIKELY(not sax->key(m_lexer.get_string()))) + { + return false; + } + + // parse separator (:) + if (JSON_UNLIKELY(get_token() != token_type::name_separator)) + { + return sax->parse_error(m_lexer.get_position(), + m_lexer.get_token_string(), + parse_error::create(101, m_lexer.get_position(), + exception_message(token_type::name_separator, "object separator"))); + } + + // remember we are now inside an object + states.push_back(false); + + // parse values + get_token(); + continue; + } + + case token_type::begin_array: + { + if (JSON_UNLIKELY(not sax->start_array(std::size_t(-1)))) + { + return false; + } + + // closing ] -> we are done + if (get_token() == token_type::end_array) + { + if (JSON_UNLIKELY(not sax->end_array())) + { + return false; + } + break; + } + + // remember we are now inside an array + states.push_back(true); + + // parse values (no need to call get_token) + continue; + } + + case token_type::value_float: + { + const auto res = m_lexer.get_number_float(); + + if (JSON_UNLIKELY(not std::isfinite(res))) + { + return sax->parse_error(m_lexer.get_position(), + m_lexer.get_token_string(), + out_of_range::create(406, "number overflow parsing '" + m_lexer.get_token_string() + "'")); + } + + if (JSON_UNLIKELY(not sax->number_float(res, m_lexer.get_string()))) + { + return false; + } + + break; + } + + case token_type::literal_false: + { + if (JSON_UNLIKELY(not sax->boolean(false))) + { + return false; + } + break; + } + + case token_type::literal_null: + { + if (JSON_UNLIKELY(not sax->null())) + { + return false; + } + break; + } + + case token_type::literal_true: + { + if (JSON_UNLIKELY(not sax->boolean(true))) + { + return false; + } + break; + } + + case token_type::value_integer: + { + if (JSON_UNLIKELY(not sax->number_integer(m_lexer.get_number_integer()))) + { + return false; + } + break; + } + + case token_type::value_string: + { + if (JSON_UNLIKELY(not sax->string(m_lexer.get_string()))) + { + return false; + } + break; + } + + case token_type::value_unsigned: + { + if (JSON_UNLIKELY(not sax->number_unsigned(m_lexer.get_number_unsigned()))) + { + return false; + } + break; + } + + case token_type::parse_error: + { + // using "uninitialized" to avoid "expected" message + return sax->parse_error(m_lexer.get_position(), + m_lexer.get_token_string(), + parse_error::create(101, m_lexer.get_position(), + exception_message(token_type::uninitialized, "value"))); + } + + default: // the last token was unexpected + { + return sax->parse_error(m_lexer.get_position(), + m_lexer.get_token_string(), + parse_error::create(101, m_lexer.get_position(), + exception_message(token_type::literal_or_value, "value"))); + } + } + } + else + { + skip_to_state_evaluation = false; + } + + // we reached this line after we successfully parsed a value + if (states.empty()) + { + // empty stack: we reached the end of the hierarchy: done + return true; + } + + if (states.back()) // array + { + // comma -> next value + if (get_token() == token_type::value_separator) + { + // parse a new value + get_token(); + continue; + } + + // closing ] + if (JSON_LIKELY(last_token == token_type::end_array)) + { + if (JSON_UNLIKELY(not sax->end_array())) + { + return false; + } + + // We are done with this array. Before we can parse a + // new value, we need to evaluate the new state first. + // By setting skip_to_state_evaluation to false, we + // are effectively jumping to the beginning of this if. + assert(not states.empty()); + states.pop_back(); + skip_to_state_evaluation = true; + continue; + } + + return sax->parse_error(m_lexer.get_position(), + m_lexer.get_token_string(), + parse_error::create(101, m_lexer.get_position(), + exception_message(token_type::end_array, "array"))); + } + else // object + { + // comma -> next value + if (get_token() == token_type::value_separator) + { + // parse key + if (JSON_UNLIKELY(get_token() != token_type::value_string)) + { + return sax->parse_error(m_lexer.get_position(), + m_lexer.get_token_string(), + parse_error::create(101, m_lexer.get_position(), + exception_message(token_type::value_string, "object key"))); + } + + if (JSON_UNLIKELY(not sax->key(m_lexer.get_string()))) + { + return false; + } + + // parse separator (:) + if (JSON_UNLIKELY(get_token() != token_type::name_separator)) + { + return sax->parse_error(m_lexer.get_position(), + m_lexer.get_token_string(), + parse_error::create(101, m_lexer.get_position(), + exception_message(token_type::name_separator, "object separator"))); + } + + // parse values + get_token(); + continue; + } + + // closing } + if (JSON_LIKELY(last_token == token_type::end_object)) + { + if (JSON_UNLIKELY(not sax->end_object())) + { + return false; + } + + // We are done with this object. Before we can parse a + // new value, we need to evaluate the new state first. + // By setting skip_to_state_evaluation to false, we + // are effectively jumping to the beginning of this if. + assert(not states.empty()); + states.pop_back(); + skip_to_state_evaluation = true; + continue; + } + + return sax->parse_error(m_lexer.get_position(), + m_lexer.get_token_string(), + parse_error::create(101, m_lexer.get_position(), + exception_message(token_type::end_object, "object"))); + } + } + } + + /// get next token from lexer + token_type get_token() + { + return last_token = m_lexer.scan(); + } + + std::string exception_message(const token_type expected, const std::string& context) + { + std::string error_msg = "syntax error "; + + if (not context.empty()) + { + error_msg += "while parsing " + context + " "; + } + + error_msg += "- "; + + if (last_token == token_type::parse_error) + { + error_msg += std::string(m_lexer.get_error_message()) + "; last read: '" + + m_lexer.get_token_string() + "'"; + } + else + { + error_msg += "unexpected " + std::string(lexer_t::token_type_name(last_token)); + } + + if (expected != token_type::uninitialized) + { + error_msg += "; expected " + std::string(lexer_t::token_type_name(expected)); + } + + return error_msg; + } + + private: + /// callback function + const parser_callback_t callback = nullptr; + /// the type of the last read token + token_type last_token = token_type::uninitialized; + /// the lexer + lexer_t m_lexer; + /// whether to throw exceptions in case of errors + const bool allow_exceptions = true; +}; +} // namespace detail +} // namespace nlohmann + +// #include <nlohmann/detail/iterators/internal_iterator.hpp> + + +// #include <nlohmann/detail/iterators/primitive_iterator.hpp> + + +#include <cstddef> // ptrdiff_t +#include <limits> // numeric_limits + +namespace nlohmann +{ +namespace detail +{ +/* +@brief an iterator for primitive JSON types + +This class models an iterator for primitive JSON types (boolean, number, +string). It's only purpose is to allow the iterator/const_iterator classes +to "iterate" over primitive values. Internally, the iterator is modeled by +a `difference_type` variable. Value begin_value (`0`) models the begin, +end_value (`1`) models past the end. +*/ +class primitive_iterator_t +{ + private: + using difference_type = std::ptrdiff_t; + static constexpr difference_type begin_value = 0; + static constexpr difference_type end_value = begin_value + 1; + + /// iterator as signed integer type + difference_type m_it = (std::numeric_limits<std::ptrdiff_t>::min)(); + + public: + constexpr difference_type get_value() const noexcept + { + return m_it; + } + + /// set iterator to a defined beginning + void set_begin() noexcept + { + m_it = begin_value; + } + + /// set iterator to a defined past the end + void set_end() noexcept + { + m_it = end_value; + } + + /// return whether the iterator can be dereferenced + constexpr bool is_begin() const noexcept + { + return m_it == begin_value; + } + + /// return whether the iterator is at end + constexpr bool is_end() const noexcept + { + return m_it == end_value; + } + + friend constexpr bool operator==(primitive_iterator_t lhs, primitive_iterator_t rhs) noexcept + { + return lhs.m_it == rhs.m_it; + } + + friend constexpr bool operator<(primitive_iterator_t lhs, primitive_iterator_t rhs) noexcept + { + return lhs.m_it < rhs.m_it; + } + + primitive_iterator_t operator+(difference_type n) noexcept + { + auto result = *this; + result += n; + return result; + } + + friend constexpr difference_type operator-(primitive_iterator_t lhs, primitive_iterator_t rhs) noexcept + { + return lhs.m_it - rhs.m_it; + } + + primitive_iterator_t& operator++() noexcept + { + ++m_it; + return *this; + } + + primitive_iterator_t const operator++(int) noexcept + { + auto result = *this; + ++m_it; + return result; + } + + primitive_iterator_t& operator--() noexcept + { + --m_it; + return *this; + } + + primitive_iterator_t const operator--(int) noexcept + { + auto result = *this; + --m_it; + return result; + } + + primitive_iterator_t& operator+=(difference_type n) noexcept + { + m_it += n; + return *this; + } + + primitive_iterator_t& operator-=(difference_type n) noexcept + { + m_it -= n; + return *this; + } +}; +} // namespace detail +} // namespace nlohmann + + +namespace nlohmann +{ +namespace detail +{ +/*! +@brief an iterator value + +@note This structure could easily be a union, but MSVC currently does not allow +unions members with complex constructors, see https://github.com/nlohmann/json/pull/105. +*/ +template<typename BasicJsonType> struct internal_iterator +{ + /// iterator for JSON objects + typename BasicJsonType::object_t::iterator object_iterator {}; + /// iterator for JSON arrays + typename BasicJsonType::array_t::iterator array_iterator {}; + /// generic iterator for all other types + primitive_iterator_t primitive_iterator {}; +}; +} // namespace detail +} // namespace nlohmann + +// #include <nlohmann/detail/iterators/iter_impl.hpp> + + +#include <ciso646> // not +#include <iterator> // iterator, random_access_iterator_tag, bidirectional_iterator_tag, advance, next +#include <type_traits> // conditional, is_const, remove_const + +// #include <nlohmann/detail/exceptions.hpp> + +// #include <nlohmann/detail/iterators/internal_iterator.hpp> + +// #include <nlohmann/detail/iterators/primitive_iterator.hpp> + +// #include <nlohmann/detail/macro_scope.hpp> + +// #include <nlohmann/detail/meta/cpp_future.hpp> + +// #include <nlohmann/detail/meta/type_traits.hpp> + +// #include <nlohmann/detail/value_t.hpp> + + +namespace nlohmann +{ +namespace detail +{ +// forward declare, to be able to friend it later on +template<typename IteratorType> class iteration_proxy; +template<typename IteratorType> class iteration_proxy_value; + +/*! +@brief a template for a bidirectional iterator for the @ref basic_json class +This class implements a both iterators (iterator and const_iterator) for the +@ref basic_json class. +@note An iterator is called *initialized* when a pointer to a JSON value has + been set (e.g., by a constructor or a copy assignment). If the iterator is + default-constructed, it is *uninitialized* and most methods are undefined. + **The library uses assertions to detect calls on uninitialized iterators.** +@requirement The class satisfies the following concept requirements: +- +[BidirectionalIterator](https://en.cppreference.com/w/cpp/named_req/BidirectionalIterator): + The iterator that can be moved can be moved in both directions (i.e. + incremented and decremented). +@since version 1.0.0, simplified in version 2.0.9, change to bidirectional + iterators in version 3.0.0 (see https://github.com/nlohmann/json/issues/593) +*/ +template<typename BasicJsonType> +class iter_impl +{ + /// allow basic_json to access private members + friend iter_impl<typename std::conditional<std::is_const<BasicJsonType>::value, typename std::remove_const<BasicJsonType>::type, const BasicJsonType>::type>; + friend BasicJsonType; + friend iteration_proxy<iter_impl>; + friend iteration_proxy_value<iter_impl>; + + using object_t = typename BasicJsonType::object_t; + using array_t = typename BasicJsonType::array_t; + // make sure BasicJsonType is basic_json or const basic_json + static_assert(is_basic_json<typename std::remove_const<BasicJsonType>::type>::value, + "iter_impl only accepts (const) basic_json"); + + public: + + /// The std::iterator class template (used as a base class to provide typedefs) is deprecated in C++17. + /// The C++ Standard has never required user-defined iterators to derive from std::iterator. + /// A user-defined iterator should provide publicly accessible typedefs named + /// iterator_category, value_type, difference_type, pointer, and reference. + /// Note that value_type is required to be non-const, even for constant iterators. + using iterator_category = std::bidirectional_iterator_tag; + + /// the type of the values when the iterator is dereferenced + using value_type = typename BasicJsonType::value_type; + /// a type to represent differences between iterators + using difference_type = typename BasicJsonType::difference_type; + /// defines a pointer to the type iterated over (value_type) + using pointer = typename std::conditional<std::is_const<BasicJsonType>::value, + typename BasicJsonType::const_pointer, + typename BasicJsonType::pointer>::type; + /// defines a reference to the type iterated over (value_type) + using reference = + typename std::conditional<std::is_const<BasicJsonType>::value, + typename BasicJsonType::const_reference, + typename BasicJsonType::reference>::type; + + /// default constructor + iter_impl() = default; + + /*! + @brief constructor for a given JSON instance + @param[in] object pointer to a JSON object for this iterator + @pre object != nullptr + @post The iterator is initialized; i.e. `m_object != nullptr`. + */ + explicit iter_impl(pointer object) noexcept : m_object(object) + { + assert(m_object != nullptr); + + switch (m_object->m_type) + { + case value_t::object: + { + m_it.object_iterator = typename object_t::iterator(); + break; + } + + case value_t::array: + { + m_it.array_iterator = typename array_t::iterator(); + break; + } + + default: + { + m_it.primitive_iterator = primitive_iterator_t(); + break; + } + } + } + + /*! + @note The conventional copy constructor and copy assignment are implicitly + defined. Combined with the following converting constructor and + assignment, they support: (1) copy from iterator to iterator, (2) + copy from const iterator to const iterator, and (3) conversion from + iterator to const iterator. However conversion from const iterator + to iterator is not defined. + */ + + /*! + @brief converting constructor + @param[in] other non-const iterator to copy from + @note It is not checked whether @a other is initialized. + */ + iter_impl(const iter_impl<typename std::remove_const<BasicJsonType>::type>& other) noexcept + : m_object(other.m_object), m_it(other.m_it) {} + + /*! + @brief converting assignment + @param[in,out] other non-const iterator to copy from + @return const/non-const iterator + @note It is not checked whether @a other is initialized. + */ + iter_impl& operator=(const iter_impl<typename std::remove_const<BasicJsonType>::type>& other) noexcept + { + m_object = other.m_object; + m_it = other.m_it; + return *this; + } + + private: + /*! + @brief set the iterator to the first value + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + void set_begin() noexcept + { + assert(m_object != nullptr); + + switch (m_object->m_type) + { + case value_t::object: + { + m_it.object_iterator = m_object->m_value.object->begin(); + break; + } + + case value_t::array: + { + m_it.array_iterator = m_object->m_value.array->begin(); + break; + } + + case value_t::null: + { + // set to end so begin()==end() is true: null is empty + m_it.primitive_iterator.set_end(); + break; + } + + default: + { + m_it.primitive_iterator.set_begin(); + break; + } + } + } + + /*! + @brief set the iterator past the last value + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + void set_end() noexcept + { + assert(m_object != nullptr); + + switch (m_object->m_type) + { + case value_t::object: + { + m_it.object_iterator = m_object->m_value.object->end(); + break; + } + + case value_t::array: + { + m_it.array_iterator = m_object->m_value.array->end(); + break; + } + + default: + { + m_it.primitive_iterator.set_end(); + break; + } + } + } + + public: + /*! + @brief return a reference to the value pointed to by the iterator + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + reference operator*() const + { + assert(m_object != nullptr); + + switch (m_object->m_type) + { + case value_t::object: + { + assert(m_it.object_iterator != m_object->m_value.object->end()); + return m_it.object_iterator->second; + } + + case value_t::array: + { + assert(m_it.array_iterator != m_object->m_value.array->end()); + return *m_it.array_iterator; + } + + case value_t::null: + JSON_THROW(invalid_iterator::create(214, "cannot get value")); + + default: + { + if (JSON_LIKELY(m_it.primitive_iterator.is_begin())) + { + return *m_object; + } + + JSON_THROW(invalid_iterator::create(214, "cannot get value")); + } + } + } + + /*! + @brief dereference the iterator + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + pointer operator->() const + { + assert(m_object != nullptr); + + switch (m_object->m_type) + { + case value_t::object: + { + assert(m_it.object_iterator != m_object->m_value.object->end()); + return &(m_it.object_iterator->second); + } + + case value_t::array: + { + assert(m_it.array_iterator != m_object->m_value.array->end()); + return &*m_it.array_iterator; + } + + default: + { + if (JSON_LIKELY(m_it.primitive_iterator.is_begin())) + { + return m_object; + } + + JSON_THROW(invalid_iterator::create(214, "cannot get value")); + } + } + } + + /*! + @brief post-increment (it++) + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + iter_impl const operator++(int) + { + auto result = *this; + ++(*this); + return result; + } + + /*! + @brief pre-increment (++it) + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + iter_impl& operator++() + { + assert(m_object != nullptr); + + switch (m_object->m_type) + { + case value_t::object: + { + std::advance(m_it.object_iterator, 1); + break; + } + + case value_t::array: + { + std::advance(m_it.array_iterator, 1); + break; + } + + default: + { + ++m_it.primitive_iterator; + break; + } + } + + return *this; + } + + /*! + @brief post-decrement (it--) + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + iter_impl const operator--(int) + { + auto result = *this; + --(*this); + return result; + } + + /*! + @brief pre-decrement (--it) + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + iter_impl& operator--() + { + assert(m_object != nullptr); + + switch (m_object->m_type) + { + case value_t::object: + { + std::advance(m_it.object_iterator, -1); + break; + } + + case value_t::array: + { + std::advance(m_it.array_iterator, -1); + break; + } + + default: + { + --m_it.primitive_iterator; + break; + } + } + + return *this; + } + + /*! + @brief comparison: equal + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + bool operator==(const iter_impl& other) const + { + // if objects are not the same, the comparison is undefined + if (JSON_UNLIKELY(m_object != other.m_object)) + { + JSON_THROW(invalid_iterator::create(212, "cannot compare iterators of different containers")); + } + + assert(m_object != nullptr); + + switch (m_object->m_type) + { + case value_t::object: + return (m_it.object_iterator == other.m_it.object_iterator); + + case value_t::array: + return (m_it.array_iterator == other.m_it.array_iterator); + + default: + return (m_it.primitive_iterator == other.m_it.primitive_iterator); + } + } + + /*! + @brief comparison: not equal + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + bool operator!=(const iter_impl& other) const + { + return not operator==(other); + } + + /*! + @brief comparison: smaller + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + bool operator<(const iter_impl& other) const + { + // if objects are not the same, the comparison is undefined + if (JSON_UNLIKELY(m_object != other.m_object)) + { + JSON_THROW(invalid_iterator::create(212, "cannot compare iterators of different containers")); + } + + assert(m_object != nullptr); + + switch (m_object->m_type) + { + case value_t::object: + JSON_THROW(invalid_iterator::create(213, "cannot compare order of object iterators")); + + case value_t::array: + return (m_it.array_iterator < other.m_it.array_iterator); + + default: + return (m_it.primitive_iterator < other.m_it.primitive_iterator); + } + } + + /*! + @brief comparison: less than or equal + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + bool operator<=(const iter_impl& other) const + { + return not other.operator < (*this); + } + + /*! + @brief comparison: greater than + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + bool operator>(const iter_impl& other) const + { + return not operator<=(other); + } + + /*! + @brief comparison: greater than or equal + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + bool operator>=(const iter_impl& other) const + { + return not operator<(other); + } + + /*! + @brief add to iterator + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + iter_impl& operator+=(difference_type i) + { + assert(m_object != nullptr); + + switch (m_object->m_type) + { + case value_t::object: + JSON_THROW(invalid_iterator::create(209, "cannot use offsets with object iterators")); + + case value_t::array: + { + std::advance(m_it.array_iterator, i); + break; + } + + default: + { + m_it.primitive_iterator += i; + break; + } + } + + return *this; + } + + /*! + @brief subtract from iterator + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + iter_impl& operator-=(difference_type i) + { + return operator+=(-i); + } + + /*! + @brief add to iterator + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + iter_impl operator+(difference_type i) const + { + auto result = *this; + result += i; + return result; + } + + /*! + @brief addition of distance and iterator + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + friend iter_impl operator+(difference_type i, const iter_impl& it) + { + auto result = it; + result += i; + return result; + } + + /*! + @brief subtract from iterator + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + iter_impl operator-(difference_type i) const + { + auto result = *this; + result -= i; + return result; + } + + /*! + @brief return difference + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + difference_type operator-(const iter_impl& other) const + { + assert(m_object != nullptr); + + switch (m_object->m_type) + { + case value_t::object: + JSON_THROW(invalid_iterator::create(209, "cannot use offsets with object iterators")); + + case value_t::array: + return m_it.array_iterator - other.m_it.array_iterator; + + default: + return m_it.primitive_iterator - other.m_it.primitive_iterator; + } + } + + /*! + @brief access to successor + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + reference operator[](difference_type n) const + { + assert(m_object != nullptr); + + switch (m_object->m_type) + { + case value_t::object: + JSON_THROW(invalid_iterator::create(208, "cannot use operator[] for object iterators")); + + case value_t::array: + return *std::next(m_it.array_iterator, n); + + case value_t::null: + JSON_THROW(invalid_iterator::create(214, "cannot get value")); + + default: + { + if (JSON_LIKELY(m_it.primitive_iterator.get_value() == -n)) + { + return *m_object; + } + + JSON_THROW(invalid_iterator::create(214, "cannot get value")); + } + } + } + + /*! + @brief return the key of an object iterator + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + const typename object_t::key_type& key() const + { + assert(m_object != nullptr); + + if (JSON_LIKELY(m_object->is_object())) + { + return m_it.object_iterator->first; + } + + JSON_THROW(invalid_iterator::create(207, "cannot use key() for non-object iterators")); + } + + /*! + @brief return the value of an iterator + @pre The iterator is initialized; i.e. `m_object != nullptr`. + */ + reference value() const + { + return operator*(); + } + + private: + /// associated JSON instance + pointer m_object = nullptr; + /// the actual iterator of the associated instance + internal_iterator<typename std::remove_const<BasicJsonType>::type> m_it {}; +}; +} // namespace detail +} // namespace nlohmann + +// #include <nlohmann/detail/iterators/iteration_proxy.hpp> + +// #include <nlohmann/detail/iterators/json_reverse_iterator.hpp> + + +#include <cstddef> // ptrdiff_t +#include <iterator> // reverse_iterator +#include <utility> // declval + +namespace nlohmann +{ +namespace detail +{ +////////////////////// +// reverse_iterator // +////////////////////// + +/*! +@brief a template for a reverse iterator class + +@tparam Base the base iterator type to reverse. Valid types are @ref +iterator (to create @ref reverse_iterator) and @ref const_iterator (to +create @ref const_reverse_iterator). + +@requirement The class satisfies the following concept requirements: +- +[BidirectionalIterator](https://en.cppreference.com/w/cpp/named_req/BidirectionalIterator): + The iterator that can be moved can be moved in both directions (i.e. + incremented and decremented). +- [OutputIterator](https://en.cppreference.com/w/cpp/named_req/OutputIterator): + It is possible to write to the pointed-to element (only if @a Base is + @ref iterator). + +@since version 1.0.0 +*/ +template<typename Base> +class json_reverse_iterator : public std::reverse_iterator<Base> +{ + public: + using difference_type = std::ptrdiff_t; + /// shortcut to the reverse iterator adapter + using base_iterator = std::reverse_iterator<Base>; + /// the reference type for the pointed-to element + using reference = typename Base::reference; + + /// create reverse iterator from iterator + explicit json_reverse_iterator(const typename base_iterator::iterator_type& it) noexcept + : base_iterator(it) {} + + /// create reverse iterator from base class + explicit json_reverse_iterator(const base_iterator& it) noexcept : base_iterator(it) {} + + /// post-increment (it++) + json_reverse_iterator const operator++(int) + { + return static_cast<json_reverse_iterator>(base_iterator::operator++(1)); + } + + /// pre-increment (++it) + json_reverse_iterator& operator++() + { + return static_cast<json_reverse_iterator&>(base_iterator::operator++()); + } + + /// post-decrement (it--) + json_reverse_iterator const operator--(int) + { + return static_cast<json_reverse_iterator>(base_iterator::operator--(1)); + } + + /// pre-decrement (--it) + json_reverse_iterator& operator--() + { + return static_cast<json_reverse_iterator&>(base_iterator::operator--()); + } + + /// add to iterator + json_reverse_iterator& operator+=(difference_type i) + { + return static_cast<json_reverse_iterator&>(base_iterator::operator+=(i)); + } + + /// add to iterator + json_reverse_iterator operator+(difference_type i) const + { + return static_cast<json_reverse_iterator>(base_iterator::operator+(i)); + } + + /// subtract from iterator + json_reverse_iterator operator-(difference_type i) const + { + return static_cast<json_reverse_iterator>(base_iterator::operator-(i)); + } + + /// return difference + difference_type operator-(const json_reverse_iterator& other) const + { + return base_iterator(*this) - base_iterator(other); + } + + /// access to successor + reference operator[](difference_type n) const + { + return *(this->operator+(n)); + } + + /// return the key of an object iterator + auto key() const -> decltype(std::declval<Base>().key()) + { + auto it = --this->base(); + return it.key(); + } + + /// return the value of an iterator + reference value() const + { + auto it = --this->base(); + return it.operator * (); + } +}; +} // namespace detail +} // namespace nlohmann + +// #include <nlohmann/detail/iterators/primitive_iterator.hpp> + +// #include <nlohmann/detail/json_pointer.hpp> + + +#include <algorithm> // all_of +#include <cassert> // assert +#include <numeric> // accumulate +#include <string> // string +#include <utility> // move +#include <vector> // vector + +// #include <nlohmann/detail/exceptions.hpp> + +// #include <nlohmann/detail/macro_scope.hpp> + +// #include <nlohmann/detail/value_t.hpp> + + +namespace nlohmann +{ +template<typename BasicJsonType> +class json_pointer +{ + // allow basic_json to access private members + NLOHMANN_BASIC_JSON_TPL_DECLARATION + friend class basic_json; + + public: + /*! + @brief create JSON pointer + + Create a JSON pointer according to the syntax described in + [Section 3 of RFC6901](https://tools.ietf.org/html/rfc6901#section-3). + + @param[in] s string representing the JSON pointer; if omitted, the empty + string is assumed which references the whole JSON value + + @throw parse_error.107 if the given JSON pointer @a s is nonempty and does + not begin with a slash (`/`); see example below + + @throw parse_error.108 if a tilde (`~`) in the given JSON pointer @a s is + not followed by `0` (representing `~`) or `1` (representing `/`); see + example below + + @liveexample{The example shows the construction several valid JSON pointers + as well as the exceptional behavior.,json_pointer} + + @since version 2.0.0 + */ + explicit json_pointer(const std::string& s = "") + : reference_tokens(split(s)) + {} + + /*! + @brief return a string representation of the JSON pointer + + @invariant For each JSON pointer `ptr`, it holds: + @code {.cpp} + ptr == json_pointer(ptr.to_string()); + @endcode + + @return a string representation of the JSON pointer + + @liveexample{The example shows the result of `to_string`.,json_pointer__to_string} + + @since version 2.0.0 + */ + std::string to_string() const + { + return std::accumulate(reference_tokens.begin(), reference_tokens.end(), + std::string{}, + [](const std::string & a, const std::string & b) + { + return a + "/" + escape(b); + }); + } + + /// @copydoc to_string() + operator std::string() const + { + return to_string(); + } + + /*! + @brief append another JSON pointer at the end of this JSON pointer + + @param[in] ptr JSON pointer to append + @return JSON pointer with @a ptr appended + + @liveexample{The example shows the usage of `operator/=`.,json_pointer__operator_add} + + @complexity Linear in the length of @a ptr. + + @sa @ref operator/=(std::string) to append a reference token + @sa @ref operator/=(std::size_t) to append an array index + @sa @ref operator/(const json_pointer&, const json_pointer&) for a binary operator + + @since version 3.6.0 + */ + json_pointer& operator/=(const json_pointer& ptr) + { + reference_tokens.insert(reference_tokens.end(), + ptr.reference_tokens.begin(), + ptr.reference_tokens.end()); + return *this; + } + + /*! + @brief append an unescaped reference token at the end of this JSON pointer + + @param[in] token reference token to append + @return JSON pointer with @a token appended without escaping @a token + + @liveexample{The example shows the usage of `operator/=`.,json_pointer__operator_add} + + @complexity Amortized constant. + + @sa @ref operator/=(const json_pointer&) to append a JSON pointer + @sa @ref operator/=(std::size_t) to append an array index + @sa @ref operator/(const json_pointer&, std::size_t) for a binary operator + + @since version 3.6.0 + */ + json_pointer& operator/=(std::string token) + { + push_back(std::move(token)); + return *this; + } + + /*! + @brief append an array index at the end of this JSON pointer + + @param[in] array_index array index ot append + @return JSON pointer with @a array_index appended + + @liveexample{The example shows the usage of `operator/=`.,json_pointer__operator_add} + + @complexity Amortized constant. + + @sa @ref operator/=(const json_pointer&) to append a JSON pointer + @sa @ref operator/=(std::string) to append a reference token + @sa @ref operator/(const json_pointer&, std::string) for a binary operator + + @since version 3.6.0 + */ + json_pointer& operator/=(std::size_t array_index) + { + return *this /= std::to_string(array_index); + } + + /*! + @brief create a new JSON pointer by appending the right JSON pointer at the end of the left JSON pointer + + @param[in] lhs JSON pointer + @param[in] rhs JSON pointer + @return a new JSON pointer with @a rhs appended to @a lhs + + @liveexample{The example shows the usage of `operator/`.,json_pointer__operator_add_binary} + + @complexity Linear in the length of @a lhs and @a rhs. + + @sa @ref operator/=(const json_pointer&) to append a JSON pointer + + @since version 3.6.0 + */ + friend json_pointer operator/(const json_pointer& lhs, + const json_pointer& rhs) + { + return json_pointer(lhs) /= rhs; + } + + /*! + @brief create a new JSON pointer by appending the unescaped token at the end of the JSON pointer + + @param[in] ptr JSON pointer + @param[in] token reference token + @return a new JSON pointer with unescaped @a token appended to @a ptr + + @liveexample{The example shows the usage of `operator/`.,json_pointer__operator_add_binary} + + @complexity Linear in the length of @a ptr. + + @sa @ref operator/=(std::string) to append a reference token + + @since version 3.6.0 + */ + friend json_pointer operator/(const json_pointer& ptr, std::string token) + { + return json_pointer(ptr) /= std::move(token); + } + + /*! + @brief create a new JSON pointer by appending the array-index-token at the end of the JSON pointer + + @param[in] ptr JSON pointer + @param[in] array_index array index + @return a new JSON pointer with @a array_index appended to @a ptr + + @liveexample{The example shows the usage of `operator/`.,json_pointer__operator_add_binary} + + @complexity Linear in the length of @a ptr. + + @sa @ref operator/=(std::size_t) to append an array index + + @since version 3.6.0 + */ + friend json_pointer operator/(const json_pointer& ptr, std::size_t array_index) + { + return json_pointer(ptr) /= array_index; + } + + /*! + @brief returns the parent of this JSON pointer + + @return parent of this JSON pointer; in case this JSON pointer is the root, + the root itself is returned + + @complexity Linear in the length of the JSON pointer. + + @liveexample{The example shows the result of `parent_pointer` for different + JSON Pointers.,json_pointer__parent_pointer} + + @since version 3.6.0 + */ + json_pointer parent_pointer() const + { + if (empty()) + { + return *this; + } + + json_pointer res = *this; + res.pop_back(); + return res; + } + + /*! + @brief remove last reference token + + @pre not `empty()` + + @liveexample{The example shows the usage of `pop_back`.,json_pointer__pop_back} + + @complexity Constant. + + @throw out_of_range.405 if JSON pointer has no parent + + @since version 3.6.0 + */ + void pop_back() + { + if (JSON_UNLIKELY(empty())) + { + JSON_THROW(detail::out_of_range::create(405, "JSON pointer has no parent")); + } + + reference_tokens.pop_back(); + } + + /*! + @brief return last reference token + + @pre not `empty()` + @return last reference token + + @liveexample{The example shows the usage of `back`.,json_pointer__back} + + @complexity Constant. + + @throw out_of_range.405 if JSON pointer has no parent + + @since version 3.6.0 + */ + const std::string& back() + { + if (JSON_UNLIKELY(empty())) + { + JSON_THROW(detail::out_of_range::create(405, "JSON pointer has no parent")); + } + + return reference_tokens.back(); + } + + /*! + @brief append an unescaped token at the end of the reference pointer + + @param[in] token token to add + + @complexity Amortized constant. + + @liveexample{The example shows the result of `push_back` for different + JSON Pointers.,json_pointer__push_back} + + @since version 3.6.0 + */ + void push_back(const std::string& token) + { + reference_tokens.push_back(token); + } + + /// @copydoc push_back(const std::string&) + void push_back(std::string&& token) + { + reference_tokens.push_back(std::move(token)); + } + + /*! + @brief return whether pointer points to the root document + + @return true iff the JSON pointer points to the root document + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + + @liveexample{The example shows the result of `empty` for different JSON + Pointers.,json_pointer__empty} + + @since version 3.6.0 + */ + bool empty() const noexcept + { + return reference_tokens.empty(); + } + + private: + /*! + @param[in] s reference token to be converted into an array index + + @return integer representation of @a s + + @throw out_of_range.404 if string @a s could not be converted to an integer + */ + static int array_index(const std::string& s) + { + std::size_t processed_chars = 0; + const int res = std::stoi(s, &processed_chars); + + // check if the string was completely read + if (JSON_UNLIKELY(processed_chars != s.size())) + { + JSON_THROW(detail::out_of_range::create(404, "unresolved reference token '" + s + "'")); + } + + return res; + } + + json_pointer top() const + { + if (JSON_UNLIKELY(empty())) + { + JSON_THROW(detail::out_of_range::create(405, "JSON pointer has no parent")); + } + + json_pointer result = *this; + result.reference_tokens = {reference_tokens[0]}; + return result; + } + + /*! + @brief create and return a reference to the pointed to value + + @complexity Linear in the number of reference tokens. + + @throw parse_error.109 if array index is not a number + @throw type_error.313 if value cannot be unflattened + */ + BasicJsonType& get_and_create(BasicJsonType& j) const + { + using size_type = typename BasicJsonType::size_type; + auto result = &j; + + // in case no reference tokens exist, return a reference to the JSON value + // j which will be overwritten by a primitive value + for (const auto& reference_token : reference_tokens) + { + switch (result->m_type) + { + case detail::value_t::null: + { + if (reference_token == "0") + { + // start a new array if reference token is 0 + result = &result->operator[](0); + } + else + { + // start a new object otherwise + result = &result->operator[](reference_token); + } + break; + } + + case detail::value_t::object: + { + // create an entry in the object + result = &result->operator[](reference_token); + break; + } + + case detail::value_t::array: + { + // create an entry in the array + JSON_TRY + { + result = &result->operator[](static_cast<size_type>(array_index(reference_token))); + } + JSON_CATCH(std::invalid_argument&) + { + JSON_THROW(detail::parse_error::create(109, 0, "array index '" + reference_token + "' is not a number")); + } + break; + } + + /* + The following code is only reached if there exists a reference + token _and_ the current value is primitive. In this case, we have + an error situation, because primitive values may only occur as + single value; that is, with an empty list of reference tokens. + */ + default: + JSON_THROW(detail::type_error::create(313, "invalid value to unflatten")); + } + } + + return *result; + } + + /*! + @brief return a reference to the pointed to value + + @note This version does not throw if a value is not present, but tries to + create nested values instead. For instance, calling this function + with pointer `"/this/that"` on a null value is equivalent to calling + `operator[]("this").operator[]("that")` on that value, effectively + changing the null value to an object. + + @param[in] ptr a JSON value + + @return reference to the JSON value pointed to by the JSON pointer + + @complexity Linear in the length of the JSON pointer. + + @throw parse_error.106 if an array index begins with '0' + @throw parse_error.109 if an array index was not a number + @throw out_of_range.404 if the JSON pointer can not be resolved + */ + BasicJsonType& get_unchecked(BasicJsonType* ptr) const + { + using size_type = typename BasicJsonType::size_type; + for (const auto& reference_token : reference_tokens) + { + // convert null values to arrays or objects before continuing + if (ptr->m_type == detail::value_t::null) + { + // check if reference token is a number + const bool nums = + std::all_of(reference_token.begin(), reference_token.end(), + [](const char x) + { + return x >= '0' and x <= '9'; + }); + + // change value to array for numbers or "-" or to object otherwise + *ptr = (nums or reference_token == "-") + ? detail::value_t::array + : detail::value_t::object; + } + + switch (ptr->m_type) + { + case detail::value_t::object: + { + // use unchecked object access + ptr = &ptr->operator[](reference_token); + break; + } + + case detail::value_t::array: + { + // error condition (cf. RFC 6901, Sect. 4) + if (JSON_UNLIKELY(reference_token.size() > 1 and reference_token[0] == '0')) + { + JSON_THROW(detail::parse_error::create(106, 0, + "array index '" + reference_token + + "' must not begin with '0'")); + } + + if (reference_token == "-") + { + // explicitly treat "-" as index beyond the end + ptr = &ptr->operator[](ptr->m_value.array->size()); + } + else + { + // convert array index to number; unchecked access + JSON_TRY + { + ptr = &ptr->operator[]( + static_cast<size_type>(array_index(reference_token))); + } + JSON_CATCH(std::invalid_argument&) + { + JSON_THROW(detail::parse_error::create(109, 0, "array index '" + reference_token + "' is not a number")); + } + } + break; + } + + default: + JSON_THROW(detail::out_of_range::create(404, "unresolved reference token '" + reference_token + "'")); + } + } + + return *ptr; + } + + /*! + @throw parse_error.106 if an array index begins with '0' + @throw parse_error.109 if an array index was not a number + @throw out_of_range.402 if the array index '-' is used + @throw out_of_range.404 if the JSON pointer can not be resolved + */ + BasicJsonType& get_checked(BasicJsonType* ptr) const + { + using size_type = typename BasicJsonType::size_type; + for (const auto& reference_token : reference_tokens) + { + switch (ptr->m_type) + { + case detail::value_t::object: + { + // note: at performs range check + ptr = &ptr->at(reference_token); + break; + } + + case detail::value_t::array: + { + if (JSON_UNLIKELY(reference_token == "-")) + { + // "-" always fails the range check + JSON_THROW(detail::out_of_range::create(402, + "array index '-' (" + std::to_string(ptr->m_value.array->size()) + + ") is out of range")); + } + + // error condition (cf. RFC 6901, Sect. 4) + if (JSON_UNLIKELY(reference_token.size() > 1 and reference_token[0] == '0')) + { + JSON_THROW(detail::parse_error::create(106, 0, + "array index '" + reference_token + + "' must not begin with '0'")); + } + + // note: at performs range check + JSON_TRY + { + ptr = &ptr->at(static_cast<size_type>(array_index(reference_token))); + } + JSON_CATCH(std::invalid_argument&) + { + JSON_THROW(detail::parse_error::create(109, 0, "array index '" + reference_token + "' is not a number")); + } + break; + } + + default: + JSON_THROW(detail::out_of_range::create(404, "unresolved reference token '" + reference_token + "'")); + } + } + + return *ptr; + } + + /*! + @brief return a const reference to the pointed to value + + @param[in] ptr a JSON value + + @return const reference to the JSON value pointed to by the JSON + pointer + + @throw parse_error.106 if an array index begins with '0' + @throw parse_error.109 if an array index was not a number + @throw out_of_range.402 if the array index '-' is used + @throw out_of_range.404 if the JSON pointer can not be resolved + */ + const BasicJsonType& get_unchecked(const BasicJsonType* ptr) const + { + using size_type = typename BasicJsonType::size_type; + for (const auto& reference_token : reference_tokens) + { + switch (ptr->m_type) + { + case detail::value_t::object: + { + // use unchecked object access + ptr = &ptr->operator[](reference_token); + break; + } + + case detail::value_t::array: + { + if (JSON_UNLIKELY(reference_token == "-")) + { + // "-" cannot be used for const access + JSON_THROW(detail::out_of_range::create(402, + "array index '-' (" + std::to_string(ptr->m_value.array->size()) + + ") is out of range")); + } + + // error condition (cf. RFC 6901, Sect. 4) + if (JSON_UNLIKELY(reference_token.size() > 1 and reference_token[0] == '0')) + { + JSON_THROW(detail::parse_error::create(106, 0, + "array index '" + reference_token + + "' must not begin with '0'")); + } + + // use unchecked array access + JSON_TRY + { + ptr = &ptr->operator[]( + static_cast<size_type>(array_index(reference_token))); + } + JSON_CATCH(std::invalid_argument&) + { + JSON_THROW(detail::parse_error::create(109, 0, "array index '" + reference_token + "' is not a number")); + } + break; + } + + default: + JSON_THROW(detail::out_of_range::create(404, "unresolved reference token '" + reference_token + "'")); + } + } + + return *ptr; + } + + /*! + @throw parse_error.106 if an array index begins with '0' + @throw parse_error.109 if an array index was not a number + @throw out_of_range.402 if the array index '-' is used + @throw out_of_range.404 if the JSON pointer can not be resolved + */ + const BasicJsonType& get_checked(const BasicJsonType* ptr) const + { + using size_type = typename BasicJsonType::size_type; + for (const auto& reference_token : reference_tokens) + { + switch (ptr->m_type) + { + case detail::value_t::object: + { + // note: at performs range check + ptr = &ptr->at(reference_token); + break; + } + + case detail::value_t::array: + { + if (JSON_UNLIKELY(reference_token == "-")) + { + // "-" always fails the range check + JSON_THROW(detail::out_of_range::create(402, + "array index '-' (" + std::to_string(ptr->m_value.array->size()) + + ") is out of range")); + } + + // error condition (cf. RFC 6901, Sect. 4) + if (JSON_UNLIKELY(reference_token.size() > 1 and reference_token[0] == '0')) + { + JSON_THROW(detail::parse_error::create(106, 0, + "array index '" + reference_token + + "' must not begin with '0'")); + } + + // note: at performs range check + JSON_TRY + { + ptr = &ptr->at(static_cast<size_type>(array_index(reference_token))); + } + JSON_CATCH(std::invalid_argument&) + { + JSON_THROW(detail::parse_error::create(109, 0, "array index '" + reference_token + "' is not a number")); + } + break; + } + + default: + JSON_THROW(detail::out_of_range::create(404, "unresolved reference token '" + reference_token + "'")); + } + } + + return *ptr; + } + + /*! + @brief split the string input to reference tokens + + @note This function is only called by the json_pointer constructor. + All exceptions below are documented there. + + @throw parse_error.107 if the pointer is not empty or begins with '/' + @throw parse_error.108 if character '~' is not followed by '0' or '1' + */ + static std::vector<std::string> split(const std::string& reference_string) + { + std::vector<std::string> result; + + // special case: empty reference string -> no reference tokens + if (reference_string.empty()) + { + return result; + } + + // check if nonempty reference string begins with slash + if (JSON_UNLIKELY(reference_string[0] != '/')) + { + JSON_THROW(detail::parse_error::create(107, 1, + "JSON pointer must be empty or begin with '/' - was: '" + + reference_string + "'")); + } + + // extract the reference tokens: + // - slash: position of the last read slash (or end of string) + // - start: position after the previous slash + for ( + // search for the first slash after the first character + std::size_t slash = reference_string.find_first_of('/', 1), + // set the beginning of the first reference token + start = 1; + // we can stop if start == 0 (if slash == std::string::npos) + start != 0; + // set the beginning of the next reference token + // (will eventually be 0 if slash == std::string::npos) + start = (slash == std::string::npos) ? 0 : slash + 1, + // find next slash + slash = reference_string.find_first_of('/', start)) + { + // use the text between the beginning of the reference token + // (start) and the last slash (slash). + auto reference_token = reference_string.substr(start, slash - start); + + // check reference tokens are properly escaped + for (std::size_t pos = reference_token.find_first_of('~'); + pos != std::string::npos; + pos = reference_token.find_first_of('~', pos + 1)) + { + assert(reference_token[pos] == '~'); + + // ~ must be followed by 0 or 1 + if (JSON_UNLIKELY(pos == reference_token.size() - 1 or + (reference_token[pos + 1] != '0' and + reference_token[pos + 1] != '1'))) + { + JSON_THROW(detail::parse_error::create(108, 0, "escape character '~' must be followed with '0' or '1'")); + } + } + + // finally, store the reference token + unescape(reference_token); + result.push_back(reference_token); + } + + return result; + } + + /*! + @brief replace all occurrences of a substring by another string + + @param[in,out] s the string to manipulate; changed so that all + occurrences of @a f are replaced with @a t + @param[in] f the substring to replace with @a t + @param[in] t the string to replace @a f + + @pre The search string @a f must not be empty. **This precondition is + enforced with an assertion.** + + @since version 2.0.0 + */ + static void replace_substring(std::string& s, const std::string& f, + const std::string& t) + { + assert(not f.empty()); + for (auto pos = s.find(f); // find first occurrence of f + pos != std::string::npos; // make sure f was found + s.replace(pos, f.size(), t), // replace with t, and + pos = s.find(f, pos + t.size())) // find next occurrence of f + {} + } + + /// escape "~" to "~0" and "/" to "~1" + static std::string escape(std::string s) + { + replace_substring(s, "~", "~0"); + replace_substring(s, "/", "~1"); + return s; + } + + /// unescape "~1" to tilde and "~0" to slash (order is important!) + static void unescape(std::string& s) + { + replace_substring(s, "~1", "/"); + replace_substring(s, "~0", "~"); + } + + /*! + @param[in] reference_string the reference string to the current value + @param[in] value the value to consider + @param[in,out] result the result object to insert values to + + @note Empty objects or arrays are flattened to `null`. + */ + static void flatten(const std::string& reference_string, + const BasicJsonType& value, + BasicJsonType& result) + { + switch (value.m_type) + { + case detail::value_t::array: + { + if (value.m_value.array->empty()) + { + // flatten empty array as null + result[reference_string] = nullptr; + } + else + { + // iterate array and use index as reference string + for (std::size_t i = 0; i < value.m_value.array->size(); ++i) + { + flatten(reference_string + "/" + std::to_string(i), + value.m_value.array->operator[](i), result); + } + } + break; + } + + case detail::value_t::object: + { + if (value.m_value.object->empty()) + { + // flatten empty object as null + result[reference_string] = nullptr; + } + else + { + // iterate object and use keys as reference string + for (const auto& element : *value.m_value.object) + { + flatten(reference_string + "/" + escape(element.first), element.second, result); + } + } + break; + } + + default: + { + // add primitive value with its reference string + result[reference_string] = value; + break; + } + } + } + + /*! + @param[in] value flattened JSON + + @return unflattened JSON + + @throw parse_error.109 if array index is not a number + @throw type_error.314 if value is not an object + @throw type_error.315 if object values are not primitive + @throw type_error.313 if value cannot be unflattened + */ + static BasicJsonType + unflatten(const BasicJsonType& value) + { + if (JSON_UNLIKELY(not value.is_object())) + { + JSON_THROW(detail::type_error::create(314, "only objects can be unflattened")); + } + + BasicJsonType result; + + // iterate the JSON object values + for (const auto& element : *value.m_value.object) + { + if (JSON_UNLIKELY(not element.second.is_primitive())) + { + JSON_THROW(detail::type_error::create(315, "values in object must be primitive")); + } + + // assign value to reference pointed to by JSON pointer; Note that if + // the JSON pointer is "" (i.e., points to the whole value), function + // get_and_create returns a reference to result itself. An assignment + // will then create a primitive value. + json_pointer(element.first).get_and_create(result) = element.second; + } + + return result; + } + + /*! + @brief compares two JSON pointers for equality + + @param[in] lhs JSON pointer to compare + @param[in] rhs JSON pointer to compare + @return whether @a lhs is equal to @a rhs + + @complexity Linear in the length of the JSON pointer + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + */ + friend bool operator==(json_pointer const& lhs, + json_pointer const& rhs) noexcept + { + return lhs.reference_tokens == rhs.reference_tokens; + } + + /*! + @brief compares two JSON pointers for inequality + + @param[in] lhs JSON pointer to compare + @param[in] rhs JSON pointer to compare + @return whether @a lhs is not equal @a rhs + + @complexity Linear in the length of the JSON pointer + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + */ + friend bool operator!=(json_pointer const& lhs, + json_pointer const& rhs) noexcept + { + return not (lhs == rhs); + } + + /// the reference tokens + std::vector<std::string> reference_tokens; +}; +} // namespace nlohmann + +// #include <nlohmann/detail/json_ref.hpp> + + +#include <initializer_list> +#include <utility> + +// #include <nlohmann/detail/meta/type_traits.hpp> + + +namespace nlohmann +{ +namespace detail +{ +template<typename BasicJsonType> +class json_ref +{ + public: + using value_type = BasicJsonType; + + json_ref(value_type&& value) + : owned_value(std::move(value)), value_ref(&owned_value), is_rvalue(true) + {} + + json_ref(const value_type& value) + : value_ref(const_cast<value_type*>(&value)), is_rvalue(false) + {} + + json_ref(std::initializer_list<json_ref> init) + : owned_value(init), value_ref(&owned_value), is_rvalue(true) + {} + + template < + class... Args, + enable_if_t<std::is_constructible<value_type, Args...>::value, int> = 0 > + json_ref(Args && ... args) + : owned_value(std::forward<Args>(args)...), value_ref(&owned_value), + is_rvalue(true) {} + + // class should be movable only + json_ref(json_ref&&) = default; + json_ref(const json_ref&) = delete; + json_ref& operator=(const json_ref&) = delete; + json_ref& operator=(json_ref&&) = delete; + ~json_ref() = default; + + value_type moved_or_copied() const + { + if (is_rvalue) + { + return std::move(*value_ref); + } + return *value_ref; + } + + value_type const& operator*() const + { + return *static_cast<value_type const*>(value_ref); + } + + value_type const* operator->() const + { + return static_cast<value_type const*>(value_ref); + } + + private: + mutable value_type owned_value = nullptr; + value_type* value_ref = nullptr; + const bool is_rvalue; +}; +} // namespace detail +} // namespace nlohmann + +// #include <nlohmann/detail/macro_scope.hpp> + +// #include <nlohmann/detail/meta/cpp_future.hpp> + +// #include <nlohmann/detail/meta/type_traits.hpp> + +// #include <nlohmann/detail/output/binary_writer.hpp> + + +#include <algorithm> // reverse +#include <array> // array +#include <cstdint> // uint8_t, uint16_t, uint32_t, uint64_t +#include <cstring> // memcpy +#include <limits> // numeric_limits +#include <string> // string + +// #include <nlohmann/detail/input/binary_reader.hpp> + +// #include <nlohmann/detail/output/output_adapters.hpp> + + +#include <algorithm> // copy +#include <cstddef> // size_t +#include <ios> // streamsize +#include <iterator> // back_inserter +#include <memory> // shared_ptr, make_shared +#include <ostream> // basic_ostream +#include <string> // basic_string +#include <vector> // vector + +namespace nlohmann +{ +namespace detail +{ +/// abstract output adapter interface +template<typename CharType> struct output_adapter_protocol +{ + virtual void write_character(CharType c) = 0; + virtual void write_characters(const CharType* s, std::size_t length) = 0; + virtual ~output_adapter_protocol() = default; +}; + +/// a type to simplify interfaces +template<typename CharType> +using output_adapter_t = std::shared_ptr<output_adapter_protocol<CharType>>; + +/// output adapter for byte vectors +template<typename CharType> +class output_vector_adapter : public output_adapter_protocol<CharType> +{ + public: + explicit output_vector_adapter(std::vector<CharType>& vec) noexcept + : v(vec) + {} + + void write_character(CharType c) override + { + v.push_back(c); + } + + void write_characters(const CharType* s, std::size_t length) override + { + std::copy(s, s + length, std::back_inserter(v)); + } + + private: + std::vector<CharType>& v; +}; + +/// output adapter for output streams +template<typename CharType> +class output_stream_adapter : public output_adapter_protocol<CharType> +{ + public: + explicit output_stream_adapter(std::basic_ostream<CharType>& s) noexcept + : stream(s) + {} + + void write_character(CharType c) override + { + stream.put(c); + } + + void write_characters(const CharType* s, std::size_t length) override + { + stream.write(s, static_cast<std::streamsize>(length)); + } + + private: + std::basic_ostream<CharType>& stream; +}; + +/// output adapter for basic_string +template<typename CharType, typename StringType = std::basic_string<CharType>> +class output_string_adapter : public output_adapter_protocol<CharType> +{ + public: + explicit output_string_adapter(StringType& s) noexcept + : str(s) + {} + + void write_character(CharType c) override + { + str.push_back(c); + } + + void write_characters(const CharType* s, std::size_t length) override + { + str.append(s, length); + } + + private: + StringType& str; +}; + +template<typename CharType, typename StringType = std::basic_string<CharType>> +class output_adapter +{ + public: + output_adapter(std::vector<CharType>& vec) + : oa(std::make_shared<output_vector_adapter<CharType>>(vec)) {} + + output_adapter(std::basic_ostream<CharType>& s) + : oa(std::make_shared<output_stream_adapter<CharType>>(s)) {} + + output_adapter(StringType& s) + : oa(std::make_shared<output_string_adapter<CharType, StringType>>(s)) {} + + operator output_adapter_t<CharType>() + { + return oa; + } + + private: + output_adapter_t<CharType> oa = nullptr; +}; +} // namespace detail +} // namespace nlohmann + + +namespace nlohmann +{ +namespace detail +{ +/////////////////// +// binary writer // +/////////////////// + +/*! +@brief serialization to CBOR and MessagePack values +*/ +template<typename BasicJsonType, typename CharType> +class binary_writer +{ + using string_t = typename BasicJsonType::string_t; + + public: + /*! + @brief create a binary writer + + @param[in] adapter output adapter to write to + */ + explicit binary_writer(output_adapter_t<CharType> adapter) : oa(adapter) + { + assert(oa); + } + + /*! + @param[in] j JSON value to serialize + @pre j.type() == value_t::object + */ + void write_bson(const BasicJsonType& j) + { + switch (j.type()) + { + case value_t::object: + { + write_bson_object(*j.m_value.object); + break; + } + + default: + { + JSON_THROW(type_error::create(317, "to serialize to BSON, top-level type must be object, but is " + std::string(j.type_name()))); + } + } + } + + /*! + @param[in] j JSON value to serialize + */ + void write_cbor(const BasicJsonType& j) + { + switch (j.type()) + { + case value_t::null: + { + oa->write_character(to_char_type(0xF6)); + break; + } + + case value_t::boolean: + { + oa->write_character(j.m_value.boolean + ? to_char_type(0xF5) + : to_char_type(0xF4)); + break; + } + + case value_t::number_integer: + { + if (j.m_value.number_integer >= 0) + { + // CBOR does not differentiate between positive signed + // integers and unsigned integers. Therefore, we used the + // code from the value_t::number_unsigned case here. + if (j.m_value.number_integer <= 0x17) + { + write_number(static_cast<std::uint8_t>(j.m_value.number_integer)); + } + else if (j.m_value.number_integer <= (std::numeric_limits<std::uint8_t>::max)()) + { + oa->write_character(to_char_type(0x18)); + write_number(static_cast<std::uint8_t>(j.m_value.number_integer)); + } + else if (j.m_value.number_integer <= (std::numeric_limits<std::uint16_t>::max)()) + { + oa->write_character(to_char_type(0x19)); + write_number(static_cast<std::uint16_t>(j.m_value.number_integer)); + } + else if (j.m_value.number_integer <= (std::numeric_limits<std::uint32_t>::max)()) + { + oa->write_character(to_char_type(0x1A)); + write_number(static_cast<std::uint32_t>(j.m_value.number_integer)); + } + else + { + oa->write_character(to_char_type(0x1B)); + write_number(static_cast<std::uint64_t>(j.m_value.number_integer)); + } + } + else + { + // The conversions below encode the sign in the first + // byte, and the value is converted to a positive number. + const auto positive_number = -1 - j.m_value.number_integer; + if (j.m_value.number_integer >= -24) + { + write_number(static_cast<std::uint8_t>(0x20 + positive_number)); + } + else if (positive_number <= (std::numeric_limits<std::uint8_t>::max)()) + { + oa->write_character(to_char_type(0x38)); + write_number(static_cast<std::uint8_t>(positive_number)); + } + else if (positive_number <= (std::numeric_limits<std::uint16_t>::max)()) + { + oa->write_character(to_char_type(0x39)); + write_number(static_cast<std::uint16_t>(positive_number)); + } + else if (positive_number <= (std::numeric_limits<std::uint32_t>::max)()) + { + oa->write_character(to_char_type(0x3A)); + write_number(static_cast<std::uint32_t>(positive_number)); + } + else + { + oa->write_character(to_char_type(0x3B)); + write_number(static_cast<std::uint64_t>(positive_number)); + } + } + break; + } + + case value_t::number_unsigned: + { + if (j.m_value.number_unsigned <= 0x17) + { + write_number(static_cast<std::uint8_t>(j.m_value.number_unsigned)); + } + else if (j.m_value.number_unsigned <= (std::numeric_limits<std::uint8_t>::max)()) + { + oa->write_character(to_char_type(0x18)); + write_number(static_cast<std::uint8_t>(j.m_value.number_unsigned)); + } + else if (j.m_value.number_unsigned <= (std::numeric_limits<std::uint16_t>::max)()) + { + oa->write_character(to_char_type(0x19)); + write_number(static_cast<std::uint16_t>(j.m_value.number_unsigned)); + } + else if (j.m_value.number_unsigned <= (std::numeric_limits<std::uint32_t>::max)()) + { + oa->write_character(to_char_type(0x1A)); + write_number(static_cast<std::uint32_t>(j.m_value.number_unsigned)); + } + else + { + oa->write_character(to_char_type(0x1B)); + write_number(static_cast<std::uint64_t>(j.m_value.number_unsigned)); + } + break; + } + + case value_t::number_float: + { + oa->write_character(get_cbor_float_prefix(j.m_value.number_float)); + write_number(j.m_value.number_float); + break; + } + + case value_t::string: + { + // step 1: write control byte and the string length + const auto N = j.m_value.string->size(); + if (N <= 0x17) + { + write_number(static_cast<std::uint8_t>(0x60 + N)); + } + else if (N <= (std::numeric_limits<std::uint8_t>::max)()) + { + oa->write_character(to_char_type(0x78)); + write_number(static_cast<std::uint8_t>(N)); + } + else if (N <= (std::numeric_limits<std::uint16_t>::max)()) + { + oa->write_character(to_char_type(0x79)); + write_number(static_cast<std::uint16_t>(N)); + } + else if (N <= (std::numeric_limits<std::uint32_t>::max)()) + { + oa->write_character(to_char_type(0x7A)); + write_number(static_cast<std::uint32_t>(N)); + } + // LCOV_EXCL_START + else if (N <= (std::numeric_limits<std::uint64_t>::max)()) + { + oa->write_character(to_char_type(0x7B)); + write_number(static_cast<std::uint64_t>(N)); + } + // LCOV_EXCL_STOP + + // step 2: write the string + oa->write_characters( + reinterpret_cast<const CharType*>(j.m_value.string->c_str()), + j.m_value.string->size()); + break; + } + + case value_t::array: + { + // step 1: write control byte and the array size + const auto N = j.m_value.array->size(); + if (N <= 0x17) + { + write_number(static_cast<std::uint8_t>(0x80 + N)); + } + else if (N <= (std::numeric_limits<std::uint8_t>::max)()) + { + oa->write_character(to_char_type(0x98)); + write_number(static_cast<std::uint8_t>(N)); + } + else if (N <= (std::numeric_limits<std::uint16_t>::max)()) + { + oa->write_character(to_char_type(0x99)); + write_number(static_cast<std::uint16_t>(N)); + } + else if (N <= (std::numeric_limits<std::uint32_t>::max)()) + { + oa->write_character(to_char_type(0x9A)); + write_number(static_cast<std::uint32_t>(N)); + } + // LCOV_EXCL_START + else if (N <= (std::numeric_limits<std::uint64_t>::max)()) + { + oa->write_character(to_char_type(0x9B)); + write_number(static_cast<std::uint64_t>(N)); + } + // LCOV_EXCL_STOP + + // step 2: write each element + for (const auto& el : *j.m_value.array) + { + write_cbor(el); + } + break; + } + + case value_t::object: + { + // step 1: write control byte and the object size + const auto N = j.m_value.object->size(); + if (N <= 0x17) + { + write_number(static_cast<std::uint8_t>(0xA0 + N)); + } + else if (N <= (std::numeric_limits<std::uint8_t>::max)()) + { + oa->write_character(to_char_type(0xB8)); + write_number(static_cast<std::uint8_t>(N)); + } + else if (N <= (std::numeric_limits<std::uint16_t>::max)()) + { + oa->write_character(to_char_type(0xB9)); + write_number(static_cast<std::uint16_t>(N)); + } + else if (N <= (std::numeric_limits<std::uint32_t>::max)()) + { + oa->write_character(to_char_type(0xBA)); + write_number(static_cast<std::uint32_t>(N)); + } + // LCOV_EXCL_START + else if (N <= (std::numeric_limits<std::uint64_t>::max)()) + { + oa->write_character(to_char_type(0xBB)); + write_number(static_cast<std::uint64_t>(N)); + } + // LCOV_EXCL_STOP + + // step 2: write each element + for (const auto& el : *j.m_value.object) + { + write_cbor(el.first); + write_cbor(el.second); + } + break; + } + + default: + break; + } + } + + /*! + @param[in] j JSON value to serialize + */ + void write_msgpack(const BasicJsonType& j) + { + switch (j.type()) + { + case value_t::null: // nil + { + oa->write_character(to_char_type(0xC0)); + break; + } + + case value_t::boolean: // true and false + { + oa->write_character(j.m_value.boolean + ? to_char_type(0xC3) + : to_char_type(0xC2)); + break; + } + + case value_t::number_integer: + { + if (j.m_value.number_integer >= 0) + { + // MessagePack does not differentiate between positive + // signed integers and unsigned integers. Therefore, we used + // the code from the value_t::number_unsigned case here. + if (j.m_value.number_unsigned < 128) + { + // positive fixnum + write_number(static_cast<std::uint8_t>(j.m_value.number_integer)); + } + else if (j.m_value.number_unsigned <= (std::numeric_limits<std::uint8_t>::max)()) + { + // uint 8 + oa->write_character(to_char_type(0xCC)); + write_number(static_cast<std::uint8_t>(j.m_value.number_integer)); + } + else if (j.m_value.number_unsigned <= (std::numeric_limits<std::uint16_t>::max)()) + { + // uint 16 + oa->write_character(to_char_type(0xCD)); + write_number(static_cast<std::uint16_t>(j.m_value.number_integer)); + } + else if (j.m_value.number_unsigned <= (std::numeric_limits<std::uint32_t>::max)()) + { + // uint 32 + oa->write_character(to_char_type(0xCE)); + write_number(static_cast<std::uint32_t>(j.m_value.number_integer)); + } + else if (j.m_value.number_unsigned <= (std::numeric_limits<std::uint64_t>::max)()) + { + // uint 64 + oa->write_character(to_char_type(0xCF)); + write_number(static_cast<std::uint64_t>(j.m_value.number_integer)); + } + } + else + { + if (j.m_value.number_integer >= -32) + { + // negative fixnum + write_number(static_cast<std::int8_t>(j.m_value.number_integer)); + } + else if (j.m_value.number_integer >= (std::numeric_limits<std::int8_t>::min)() and + j.m_value.number_integer <= (std::numeric_limits<std::int8_t>::max)()) + { + // int 8 + oa->write_character(to_char_type(0xD0)); + write_number(static_cast<std::int8_t>(j.m_value.number_integer)); + } + else if (j.m_value.number_integer >= (std::numeric_limits<std::int16_t>::min)() and + j.m_value.number_integer <= (std::numeric_limits<std::int16_t>::max)()) + { + // int 16 + oa->write_character(to_char_type(0xD1)); + write_number(static_cast<std::int16_t>(j.m_value.number_integer)); + } + else if (j.m_value.number_integer >= (std::numeric_limits<std::int32_t>::min)() and + j.m_value.number_integer <= (std::numeric_limits<std::int32_t>::max)()) + { + // int 32 + oa->write_character(to_char_type(0xD2)); + write_number(static_cast<std::int32_t>(j.m_value.number_integer)); + } + else if (j.m_value.number_integer >= (std::numeric_limits<std::int64_t>::min)() and + j.m_value.number_integer <= (std::numeric_limits<std::int64_t>::max)()) + { + // int 64 + oa->write_character(to_char_type(0xD3)); + write_number(static_cast<std::int64_t>(j.m_value.number_integer)); + } + } + break; + } + + case value_t::number_unsigned: + { + if (j.m_value.number_unsigned < 128) + { + // positive fixnum + write_number(static_cast<std::uint8_t>(j.m_value.number_integer)); + } + else if (j.m_value.number_unsigned <= (std::numeric_limits<std::uint8_t>::max)()) + { + // uint 8 + oa->write_character(to_char_type(0xCC)); + write_number(static_cast<std::uint8_t>(j.m_value.number_integer)); + } + else if (j.m_value.number_unsigned <= (std::numeric_limits<std::uint16_t>::max)()) + { + // uint 16 + oa->write_character(to_char_type(0xCD)); + write_number(static_cast<std::uint16_t>(j.m_value.number_integer)); + } + else if (j.m_value.number_unsigned <= (std::numeric_limits<std::uint32_t>::max)()) + { + // uint 32 + oa->write_character(to_char_type(0xCE)); + write_number(static_cast<std::uint32_t>(j.m_value.number_integer)); + } + else if (j.m_value.number_unsigned <= (std::numeric_limits<std::uint64_t>::max)()) + { + // uint 64 + oa->write_character(to_char_type(0xCF)); + write_number(static_cast<std::uint64_t>(j.m_value.number_integer)); + } + break; + } + + case value_t::number_float: + { + oa->write_character(get_msgpack_float_prefix(j.m_value.number_float)); + write_number(j.m_value.number_float); + break; + } + + case value_t::string: + { + // step 1: write control byte and the string length + const auto N = j.m_value.string->size(); + if (N <= 31) + { + // fixstr + write_number(static_cast<std::uint8_t>(0xA0 | N)); + } + else if (N <= (std::numeric_limits<std::uint8_t>::max)()) + { + // str 8 + oa->write_character(to_char_type(0xD9)); + write_number(static_cast<std::uint8_t>(N)); + } + else if (N <= (std::numeric_limits<std::uint16_t>::max)()) + { + // str 16 + oa->write_character(to_char_type(0xDA)); + write_number(static_cast<std::uint16_t>(N)); + } + else if (N <= (std::numeric_limits<std::uint32_t>::max)()) + { + // str 32 + oa->write_character(to_char_type(0xDB)); + write_number(static_cast<std::uint32_t>(N)); + } + + // step 2: write the string + oa->write_characters( + reinterpret_cast<const CharType*>(j.m_value.string->c_str()), + j.m_value.string->size()); + break; + } + + case value_t::array: + { + // step 1: write control byte and the array size + const auto N = j.m_value.array->size(); + if (N <= 15) + { + // fixarray + write_number(static_cast<std::uint8_t>(0x90 | N)); + } + else if (N <= (std::numeric_limits<std::uint16_t>::max)()) + { + // array 16 + oa->write_character(to_char_type(0xDC)); + write_number(static_cast<std::uint16_t>(N)); + } + else if (N <= (std::numeric_limits<std::uint32_t>::max)()) + { + // array 32 + oa->write_character(to_char_type(0xDD)); + write_number(static_cast<std::uint32_t>(N)); + } + + // step 2: write each element + for (const auto& el : *j.m_value.array) + { + write_msgpack(el); + } + break; + } + + case value_t::object: + { + // step 1: write control byte and the object size + const auto N = j.m_value.object->size(); + if (N <= 15) + { + // fixmap + write_number(static_cast<std::uint8_t>(0x80 | (N & 0xF))); + } + else if (N <= (std::numeric_limits<std::uint16_t>::max)()) + { + // map 16 + oa->write_character(to_char_type(0xDE)); + write_number(static_cast<std::uint16_t>(N)); + } + else if (N <= (std::numeric_limits<std::uint32_t>::max)()) + { + // map 32 + oa->write_character(to_char_type(0xDF)); + write_number(static_cast<std::uint32_t>(N)); + } + + // step 2: write each element + for (const auto& el : *j.m_value.object) + { + write_msgpack(el.first); + write_msgpack(el.second); + } + break; + } + + default: + break; + } + } + + /*! + @param[in] j JSON value to serialize + @param[in] use_count whether to use '#' prefixes (optimized format) + @param[in] use_type whether to use '$' prefixes (optimized format) + @param[in] add_prefix whether prefixes need to be used for this value + */ + void write_ubjson(const BasicJsonType& j, const bool use_count, + const bool use_type, const bool add_prefix = true) + { + switch (j.type()) + { + case value_t::null: + { + if (add_prefix) + { + oa->write_character(to_char_type('Z')); + } + break; + } + + case value_t::boolean: + { + if (add_prefix) + { + oa->write_character(j.m_value.boolean + ? to_char_type('T') + : to_char_type('F')); + } + break; + } + + case value_t::number_integer: + { + write_number_with_ubjson_prefix(j.m_value.number_integer, add_prefix); + break; + } + + case value_t::number_unsigned: + { + write_number_with_ubjson_prefix(j.m_value.number_unsigned, add_prefix); + break; + } + + case value_t::number_float: + { + write_number_with_ubjson_prefix(j.m_value.number_float, add_prefix); + break; + } + + case value_t::string: + { + if (add_prefix) + { + oa->write_character(to_char_type('S')); + } + write_number_with_ubjson_prefix(j.m_value.string->size(), true); + oa->write_characters( + reinterpret_cast<const CharType*>(j.m_value.string->c_str()), + j.m_value.string->size()); + break; + } + + case value_t::array: + { + if (add_prefix) + { + oa->write_character(to_char_type('[')); + } + + bool prefix_required = true; + if (use_type and not j.m_value.array->empty()) + { + assert(use_count); + const CharType first_prefix = ubjson_prefix(j.front()); + const bool same_prefix = std::all_of(j.begin() + 1, j.end(), + [this, first_prefix](const BasicJsonType & v) + { + return ubjson_prefix(v) == first_prefix; + }); + + if (same_prefix) + { + prefix_required = false; + oa->write_character(to_char_type('$')); + oa->write_character(first_prefix); + } + } + + if (use_count) + { + oa->write_character(to_char_type('#')); + write_number_with_ubjson_prefix(j.m_value.array->size(), true); + } + + for (const auto& el : *j.m_value.array) + { + write_ubjson(el, use_count, use_type, prefix_required); + } + + if (not use_count) + { + oa->write_character(to_char_type(']')); + } + + break; + } + + case value_t::object: + { + if (add_prefix) + { + oa->write_character(to_char_type('{')); + } + + bool prefix_required = true; + if (use_type and not j.m_value.object->empty()) + { + assert(use_count); + const CharType first_prefix = ubjson_prefix(j.front()); + const bool same_prefix = std::all_of(j.begin(), j.end(), + [this, first_prefix](const BasicJsonType & v) + { + return ubjson_prefix(v) == first_prefix; + }); + + if (same_prefix) + { + prefix_required = false; + oa->write_character(to_char_type('$')); + oa->write_character(first_prefix); + } + } + + if (use_count) + { + oa->write_character(to_char_type('#')); + write_number_with_ubjson_prefix(j.m_value.object->size(), true); + } + + for (const auto& el : *j.m_value.object) + { + write_number_with_ubjson_prefix(el.first.size(), true); + oa->write_characters( + reinterpret_cast<const CharType*>(el.first.c_str()), + el.first.size()); + write_ubjson(el.second, use_count, use_type, prefix_required); + } + + if (not use_count) + { + oa->write_character(to_char_type('}')); + } + + break; + } + + default: + break; + } + } + + private: + ////////// + // BSON // + ////////// + + /*! + @return The size of a BSON document entry header, including the id marker + and the entry name size (and its null-terminator). + */ + static std::size_t calc_bson_entry_header_size(const string_t& name) + { + const auto it = name.find(static_cast<typename string_t::value_type>(0)); + if (JSON_UNLIKELY(it != BasicJsonType::string_t::npos)) + { + JSON_THROW(out_of_range::create(409, + "BSON key cannot contain code point U+0000 (at byte " + std::to_string(it) + ")")); + } + + return /*id*/ 1ul + name.size() + /*zero-terminator*/1u; + } + + /*! + @brief Writes the given @a element_type and @a name to the output adapter + */ + void write_bson_entry_header(const string_t& name, + const std::uint8_t element_type) + { + oa->write_character(to_char_type(element_type)); // boolean + oa->write_characters( + reinterpret_cast<const CharType*>(name.c_str()), + name.size() + 1u); + } + + /*! + @brief Writes a BSON element with key @a name and boolean value @a value + */ + void write_bson_boolean(const string_t& name, + const bool value) + { + write_bson_entry_header(name, 0x08); + oa->write_character(value ? to_char_type(0x01) : to_char_type(0x00)); + } + + /*! + @brief Writes a BSON element with key @a name and double value @a value + */ + void write_bson_double(const string_t& name, + const double value) + { + write_bson_entry_header(name, 0x01); + write_number<double, true>(value); + } + + /*! + @return The size of the BSON-encoded string in @a value + */ + static std::size_t calc_bson_string_size(const string_t& value) + { + return sizeof(std::int32_t) + value.size() + 1ul; + } + + /*! + @brief Writes a BSON element with key @a name and string value @a value + */ + void write_bson_string(const string_t& name, + const string_t& value) + { + write_bson_entry_header(name, 0x02); + + write_number<std::int32_t, true>(static_cast<std::int32_t>(value.size() + 1ul)); + oa->write_characters( + reinterpret_cast<const CharType*>(value.c_str()), + value.size() + 1); + } + + /*! + @brief Writes a BSON element with key @a name and null value + */ + void write_bson_null(const string_t& name) + { + write_bson_entry_header(name, 0x0A); + } + + /*! + @return The size of the BSON-encoded integer @a value + */ + static std::size_t calc_bson_integer_size(const std::int64_t value) + { + return (std::numeric_limits<std::int32_t>::min)() <= value and value <= (std::numeric_limits<std::int32_t>::max)() + ? sizeof(std::int32_t) + : sizeof(std::int64_t); + } + + /*! + @brief Writes a BSON element with key @a name and integer @a value + */ + void write_bson_integer(const string_t& name, + const std::int64_t value) + { + if ((std::numeric_limits<std::int32_t>::min)() <= value and value <= (std::numeric_limits<std::int32_t>::max)()) + { + write_bson_entry_header(name, 0x10); // int32 + write_number<std::int32_t, true>(static_cast<std::int32_t>(value)); + } + else + { + write_bson_entry_header(name, 0x12); // int64 + write_number<std::int64_t, true>(static_cast<std::int64_t>(value)); + } + } + + /*! + @return The size of the BSON-encoded unsigned integer in @a j + */ + static constexpr std::size_t calc_bson_unsigned_size(const std::uint64_t value) noexcept + { + return (value <= static_cast<std::uint64_t>((std::numeric_limits<std::int32_t>::max)())) + ? sizeof(std::int32_t) + : sizeof(std::int64_t); + } + + /*! + @brief Writes a BSON element with key @a name and unsigned @a value + */ + void write_bson_unsigned(const string_t& name, + const std::uint64_t value) + { + if (value <= static_cast<std::uint64_t>((std::numeric_limits<std::int32_t>::max)())) + { + write_bson_entry_header(name, 0x10 /* int32 */); + write_number<std::int32_t, true>(static_cast<std::int32_t>(value)); + } + else if (value <= static_cast<std::uint64_t>((std::numeric_limits<std::int64_t>::max)())) + { + write_bson_entry_header(name, 0x12 /* int64 */); + write_number<std::int64_t, true>(static_cast<std::int64_t>(value)); + } + else + { + JSON_THROW(out_of_range::create(407, "integer number " + std::to_string(value) + " cannot be represented by BSON as it does not fit int64")); + } + } + + /*! + @brief Writes a BSON element with key @a name and object @a value + */ + void write_bson_object_entry(const string_t& name, + const typename BasicJsonType::object_t& value) + { + write_bson_entry_header(name, 0x03); // object + write_bson_object(value); + } + + /*! + @return The size of the BSON-encoded array @a value + */ + static std::size_t calc_bson_array_size(const typename BasicJsonType::array_t& value) + { + std::size_t embedded_document_size = 0ul; + std::size_t array_index = 0ul; + + for (const auto& el : value) + { + embedded_document_size += calc_bson_element_size(std::to_string(array_index++), el); + } + + return sizeof(std::int32_t) + embedded_document_size + 1ul; + } + + /*! + @brief Writes a BSON element with key @a name and array @a value + */ + void write_bson_array(const string_t& name, + const typename BasicJsonType::array_t& value) + { + write_bson_entry_header(name, 0x04); // array + write_number<std::int32_t, true>(static_cast<std::int32_t>(calc_bson_array_size(value))); + + std::size_t array_index = 0ul; + + for (const auto& el : value) + { + write_bson_element(std::to_string(array_index++), el); + } + + oa->write_character(to_char_type(0x00)); + } + + /*! + @brief Calculates the size necessary to serialize the JSON value @a j with its @a name + @return The calculated size for the BSON document entry for @a j with the given @a name. + */ + static std::size_t calc_bson_element_size(const string_t& name, + const BasicJsonType& j) + { + const auto header_size = calc_bson_entry_header_size(name); + switch (j.type()) + { + case value_t::object: + return header_size + calc_bson_object_size(*j.m_value.object); + + case value_t::array: + return header_size + calc_bson_array_size(*j.m_value.array); + + case value_t::boolean: + return header_size + 1ul; + + case value_t::number_float: + return header_size + 8ul; + + case value_t::number_integer: + return header_size + calc_bson_integer_size(j.m_value.number_integer); + + case value_t::number_unsigned: + return header_size + calc_bson_unsigned_size(j.m_value.number_unsigned); + + case value_t::string: + return header_size + calc_bson_string_size(*j.m_value.string); + + case value_t::null: + return header_size + 0ul; + + // LCOV_EXCL_START + default: + assert(false); + return 0ul; + // LCOV_EXCL_STOP + } + } + + /*! + @brief Serializes the JSON value @a j to BSON and associates it with the + key @a name. + @param name The name to associate with the JSON entity @a j within the + current BSON document + @return The size of the BSON entry + */ + void write_bson_element(const string_t& name, + const BasicJsonType& j) + { + switch (j.type()) + { + case value_t::object: + return write_bson_object_entry(name, *j.m_value.object); + + case value_t::array: + return write_bson_array(name, *j.m_value.array); + + case value_t::boolean: + return write_bson_boolean(name, j.m_value.boolean); + + case value_t::number_float: + return write_bson_double(name, j.m_value.number_float); + + case value_t::number_integer: + return write_bson_integer(name, j.m_value.number_integer); + + case value_t::number_unsigned: + return write_bson_unsigned(name, j.m_value.number_unsigned); + + case value_t::string: + return write_bson_string(name, *j.m_value.string); + + case value_t::null: + return write_bson_null(name); + + // LCOV_EXCL_START + default: + assert(false); + return; + // LCOV_EXCL_STOP + } + } + + /*! + @brief Calculates the size of the BSON serialization of the given + JSON-object @a j. + @param[in] j JSON value to serialize + @pre j.type() == value_t::object + */ + static std::size_t calc_bson_object_size(const typename BasicJsonType::object_t& value) + { + std::size_t document_size = std::accumulate(value.begin(), value.end(), 0ul, + [](size_t result, const typename BasicJsonType::object_t::value_type & el) + { + return result += calc_bson_element_size(el.first, el.second); + }); + + return sizeof(std::int32_t) + document_size + 1ul; + } + + /*! + @param[in] j JSON value to serialize + @pre j.type() == value_t::object + */ + void write_bson_object(const typename BasicJsonType::object_t& value) + { + write_number<std::int32_t, true>(static_cast<std::int32_t>(calc_bson_object_size(value))); + + for (const auto& el : value) + { + write_bson_element(el.first, el.second); + } + + oa->write_character(to_char_type(0x00)); + } + + ////////// + // CBOR // + ////////// + + static constexpr CharType get_cbor_float_prefix(float /*unused*/) + { + return to_char_type(0xFA); // Single-Precision Float + } + + static constexpr CharType get_cbor_float_prefix(double /*unused*/) + { + return to_char_type(0xFB); // Double-Precision Float + } + + ///////////// + // MsgPack // + ///////////// + + static constexpr CharType get_msgpack_float_prefix(float /*unused*/) + { + return to_char_type(0xCA); // float 32 + } + + static constexpr CharType get_msgpack_float_prefix(double /*unused*/) + { + return to_char_type(0xCB); // float 64 + } + + //////////// + // UBJSON // + //////////// + + // UBJSON: write number (floating point) + template<typename NumberType, typename std::enable_if< + std::is_floating_point<NumberType>::value, int>::type = 0> + void write_number_with_ubjson_prefix(const NumberType n, + const bool add_prefix) + { + if (add_prefix) + { + oa->write_character(get_ubjson_float_prefix(n)); + } + write_number(n); + } + + // UBJSON: write number (unsigned integer) + template<typename NumberType, typename std::enable_if< + std::is_unsigned<NumberType>::value, int>::type = 0> + void write_number_with_ubjson_prefix(const NumberType n, + const bool add_prefix) + { + if (n <= static_cast<std::uint64_t>((std::numeric_limits<std::int8_t>::max)())) + { + if (add_prefix) + { + oa->write_character(to_char_type('i')); // int8 + } + write_number(static_cast<std::uint8_t>(n)); + } + else if (n <= (std::numeric_limits<std::uint8_t>::max)()) + { + if (add_prefix) + { + oa->write_character(to_char_type('U')); // uint8 + } + write_number(static_cast<std::uint8_t>(n)); + } + else if (n <= static_cast<std::uint64_t>((std::numeric_limits<std::int16_t>::max)())) + { + if (add_prefix) + { + oa->write_character(to_char_type('I')); // int16 + } + write_number(static_cast<std::int16_t>(n)); + } + else if (n <= static_cast<std::uint64_t>((std::numeric_limits<std::int32_t>::max)())) + { + if (add_prefix) + { + oa->write_character(to_char_type('l')); // int32 + } + write_number(static_cast<std::int32_t>(n)); + } + else if (n <= static_cast<std::uint64_t>((std::numeric_limits<std::int64_t>::max)())) + { + if (add_prefix) + { + oa->write_character(to_char_type('L')); // int64 + } + write_number(static_cast<std::int64_t>(n)); + } + else + { + JSON_THROW(out_of_range::create(407, "integer number " + std::to_string(n) + " cannot be represented by UBJSON as it does not fit int64")); + } + } + + // UBJSON: write number (signed integer) + template<typename NumberType, typename std::enable_if< + std::is_signed<NumberType>::value and + not std::is_floating_point<NumberType>::value, int>::type = 0> + void write_number_with_ubjson_prefix(const NumberType n, + const bool add_prefix) + { + if ((std::numeric_limits<std::int8_t>::min)() <= n and n <= (std::numeric_limits<std::int8_t>::max)()) + { + if (add_prefix) + { + oa->write_character(to_char_type('i')); // int8 + } + write_number(static_cast<std::int8_t>(n)); + } + else if (static_cast<std::int64_t>((std::numeric_limits<std::uint8_t>::min)()) <= n and n <= static_cast<std::int64_t>((std::numeric_limits<std::uint8_t>::max)())) + { + if (add_prefix) + { + oa->write_character(to_char_type('U')); // uint8 + } + write_number(static_cast<std::uint8_t>(n)); + } + else if ((std::numeric_limits<std::int16_t>::min)() <= n and n <= (std::numeric_limits<std::int16_t>::max)()) + { + if (add_prefix) + { + oa->write_character(to_char_type('I')); // int16 + } + write_number(static_cast<std::int16_t>(n)); + } + else if ((std::numeric_limits<std::int32_t>::min)() <= n and n <= (std::numeric_limits<std::int32_t>::max)()) + { + if (add_prefix) + { + oa->write_character(to_char_type('l')); // int32 + } + write_number(static_cast<std::int32_t>(n)); + } + else if ((std::numeric_limits<std::int64_t>::min)() <= n and n <= (std::numeric_limits<std::int64_t>::max)()) + { + if (add_prefix) + { + oa->write_character(to_char_type('L')); // int64 + } + write_number(static_cast<std::int64_t>(n)); + } + // LCOV_EXCL_START + else + { + JSON_THROW(out_of_range::create(407, "integer number " + std::to_string(n) + " cannot be represented by UBJSON as it does not fit int64")); + } + // LCOV_EXCL_STOP + } + + /*! + @brief determine the type prefix of container values + + @note This function does not need to be 100% accurate when it comes to + integer limits. In case a number exceeds the limits of int64_t, + this will be detected by a later call to function + write_number_with_ubjson_prefix. Therefore, we return 'L' for any + value that does not fit the previous limits. + */ + CharType ubjson_prefix(const BasicJsonType& j) const noexcept + { + switch (j.type()) + { + case value_t::null: + return 'Z'; + + case value_t::boolean: + return j.m_value.boolean ? 'T' : 'F'; + + case value_t::number_integer: + { + if ((std::numeric_limits<std::int8_t>::min)() <= j.m_value.number_integer and j.m_value.number_integer <= (std::numeric_limits<std::int8_t>::max)()) + { + return 'i'; + } + if ((std::numeric_limits<std::uint8_t>::min)() <= j.m_value.number_integer and j.m_value.number_integer <= (std::numeric_limits<std::uint8_t>::max)()) + { + return 'U'; + } + if ((std::numeric_limits<std::int16_t>::min)() <= j.m_value.number_integer and j.m_value.number_integer <= (std::numeric_limits<std::int16_t>::max)()) + { + return 'I'; + } + if ((std::numeric_limits<std::int32_t>::min)() <= j.m_value.number_integer and j.m_value.number_integer <= (std::numeric_limits<std::int32_t>::max)()) + { + return 'l'; + } + // no check and assume int64_t (see note above) + return 'L'; + } + + case value_t::number_unsigned: + { + if (j.m_value.number_unsigned <= (std::numeric_limits<std::int8_t>::max)()) + { + return 'i'; + } + if (j.m_value.number_unsigned <= (std::numeric_limits<std::uint8_t>::max)()) + { + return 'U'; + } + if (j.m_value.number_unsigned <= (std::numeric_limits<std::int16_t>::max)()) + { + return 'I'; + } + if (j.m_value.number_unsigned <= (std::numeric_limits<std::int32_t>::max)()) + { + return 'l'; + } + // no check and assume int64_t (see note above) + return 'L'; + } + + case value_t::number_float: + return get_ubjson_float_prefix(j.m_value.number_float); + + case value_t::string: + return 'S'; + + case value_t::array: + return '['; + + case value_t::object: + return '{'; + + default: // discarded values + return 'N'; + } + } + + static constexpr CharType get_ubjson_float_prefix(float /*unused*/) + { + return 'd'; // float 32 + } + + static constexpr CharType get_ubjson_float_prefix(double /*unused*/) + { + return 'D'; // float 64 + } + + /////////////////////// + // Utility functions // + /////////////////////// + + /* + @brief write a number to output input + @param[in] n number of type @a NumberType + @tparam NumberType the type of the number + @tparam OutputIsLittleEndian Set to true if output data is + required to be little endian + + @note This function needs to respect the system's endianess, because bytes + in CBOR, MessagePack, and UBJSON are stored in network order (big + endian) and therefore need reordering on little endian systems. + */ + template<typename NumberType, bool OutputIsLittleEndian = false> + void write_number(const NumberType n) + { + // step 1: write number to array of length NumberType + std::array<CharType, sizeof(NumberType)> vec; + std::memcpy(vec.data(), &n, sizeof(NumberType)); + + // step 2: write array to output (with possible reordering) + if (is_little_endian != OutputIsLittleEndian) + { + // reverse byte order prior to conversion if necessary + std::reverse(vec.begin(), vec.end()); + } + + oa->write_characters(vec.data(), sizeof(NumberType)); + } + + public: + // The following to_char_type functions are implement the conversion + // between uint8_t and CharType. In case CharType is not unsigned, + // such a conversion is required to allow values greater than 128. + // See <https://github.com/nlohmann/json/issues/1286> for a discussion. + template < typename C = CharType, + enable_if_t < std::is_signed<C>::value and std::is_signed<char>::value > * = nullptr > + static constexpr CharType to_char_type(std::uint8_t x) noexcept + { + return *reinterpret_cast<char*>(&x); + } + + template < typename C = CharType, + enable_if_t < std::is_signed<C>::value and std::is_unsigned<char>::value > * = nullptr > + static CharType to_char_type(std::uint8_t x) noexcept + { + static_assert(sizeof(std::uint8_t) == sizeof(CharType), "size of CharType must be equal to std::uint8_t"); + static_assert(std::is_pod<CharType>::value, "CharType must be POD"); + CharType result; + std::memcpy(&result, &x, sizeof(x)); + return result; + } + + template<typename C = CharType, + enable_if_t<std::is_unsigned<C>::value>* = nullptr> + static constexpr CharType to_char_type(std::uint8_t x) noexcept + { + return x; + } + + template < typename InputCharType, typename C = CharType, + enable_if_t < + std::is_signed<C>::value and + std::is_signed<char>::value and + std::is_same<char, typename std::remove_cv<InputCharType>::type>::value + > * = nullptr > + static constexpr CharType to_char_type(InputCharType x) noexcept + { + return x; + } + + private: + /// whether we can assume little endianess + const bool is_little_endian = binary_reader<BasicJsonType>::little_endianess(); + + /// the output + output_adapter_t<CharType> oa = nullptr; +}; +} // namespace detail +} // namespace nlohmann + +// #include <nlohmann/detail/output/output_adapters.hpp> + +// #include <nlohmann/detail/output/serializer.hpp> + + +#include <algorithm> // reverse, remove, fill, find, none_of +#include <array> // array +#include <cassert> // assert +#include <ciso646> // and, or +#include <clocale> // localeconv, lconv +#include <cmath> // labs, isfinite, isnan, signbit +#include <cstddef> // size_t, ptrdiff_t +#include <cstdint> // uint8_t +#include <cstdio> // snprintf +#include <limits> // numeric_limits +#include <string> // string +#include <type_traits> // is_same +#include <utility> // move + +// #include <nlohmann/detail/conversions/to_chars.hpp> + + +#include <array> // array +#include <cassert> // assert +#include <ciso646> // or, and, not +#include <cmath> // signbit, isfinite +#include <cstdint> // intN_t, uintN_t +#include <cstring> // memcpy, memmove +#include <limits> // numeric_limits +#include <type_traits> // conditional + +namespace nlohmann +{ +namespace detail +{ + +/*! +@brief implements the Grisu2 algorithm for binary to decimal floating-point +conversion. + +This implementation is a slightly modified version of the reference +implementation which may be obtained from +http://florian.loitsch.com/publications (bench.tar.gz). + +The code is distributed under the MIT license, Copyright (c) 2009 Florian Loitsch. + +For a detailed description of the algorithm see: + +[1] Loitsch, "Printing Floating-Point Numbers Quickly and Accurately with + Integers", Proceedings of the ACM SIGPLAN 2010 Conference on Programming + Language Design and Implementation, PLDI 2010 +[2] Burger, Dybvig, "Printing Floating-Point Numbers Quickly and Accurately", + Proceedings of the ACM SIGPLAN 1996 Conference on Programming Language + Design and Implementation, PLDI 1996 +*/ +namespace dtoa_impl +{ + +template <typename Target, typename Source> +Target reinterpret_bits(const Source source) +{ + static_assert(sizeof(Target) == sizeof(Source), "size mismatch"); + + Target target; + std::memcpy(&target, &source, sizeof(Source)); + return target; +} + +struct diyfp // f * 2^e +{ + static constexpr int kPrecision = 64; // = q + + std::uint64_t f = 0; + int e = 0; + + constexpr diyfp(std::uint64_t f_, int e_) noexcept : f(f_), e(e_) {} + + /*! + @brief returns x - y + @pre x.e == y.e and x.f >= y.f + */ + static diyfp sub(const diyfp& x, const diyfp& y) noexcept + { + assert(x.e == y.e); + assert(x.f >= y.f); + + return {x.f - y.f, x.e}; + } + + /*! + @brief returns x * y + @note The result is rounded. (Only the upper q bits are returned.) + */ + static diyfp mul(const diyfp& x, const diyfp& y) noexcept + { + static_assert(kPrecision == 64, "internal error"); + + // Computes: + // f = round((x.f * y.f) / 2^q) + // e = x.e + y.e + q + + // Emulate the 64-bit * 64-bit multiplication: + // + // p = u * v + // = (u_lo + 2^32 u_hi) (v_lo + 2^32 v_hi) + // = (u_lo v_lo ) + 2^32 ((u_lo v_hi ) + (u_hi v_lo )) + 2^64 (u_hi v_hi ) + // = (p0 ) + 2^32 ((p1 ) + (p2 )) + 2^64 (p3 ) + // = (p0_lo + 2^32 p0_hi) + 2^32 ((p1_lo + 2^32 p1_hi) + (p2_lo + 2^32 p2_hi)) + 2^64 (p3 ) + // = (p0_lo ) + 2^32 (p0_hi + p1_lo + p2_lo ) + 2^64 (p1_hi + p2_hi + p3) + // = (p0_lo ) + 2^32 (Q ) + 2^64 (H ) + // = (p0_lo ) + 2^32 (Q_lo + 2^32 Q_hi ) + 2^64 (H ) + // + // (Since Q might be larger than 2^32 - 1) + // + // = (p0_lo + 2^32 Q_lo) + 2^64 (Q_hi + H) + // + // (Q_hi + H does not overflow a 64-bit int) + // + // = p_lo + 2^64 p_hi + + const std::uint64_t u_lo = x.f & 0xFFFFFFFFu; + const std::uint64_t u_hi = x.f >> 32u; + const std::uint64_t v_lo = y.f & 0xFFFFFFFFu; + const std::uint64_t v_hi = y.f >> 32u; + + const std::uint64_t p0 = u_lo * v_lo; + const std::uint64_t p1 = u_lo * v_hi; + const std::uint64_t p2 = u_hi * v_lo; + const std::uint64_t p3 = u_hi * v_hi; + + const std::uint64_t p0_hi = p0 >> 32u; + const std::uint64_t p1_lo = p1 & 0xFFFFFFFFu; + const std::uint64_t p1_hi = p1 >> 32u; + const std::uint64_t p2_lo = p2 & 0xFFFFFFFFu; + const std::uint64_t p2_hi = p2 >> 32u; + + std::uint64_t Q = p0_hi + p1_lo + p2_lo; + + // The full product might now be computed as + // + // p_hi = p3 + p2_hi + p1_hi + (Q >> 32) + // p_lo = p0_lo + (Q << 32) + // + // But in this particular case here, the full p_lo is not required. + // Effectively we only need to add the highest bit in p_lo to p_hi (and + // Q_hi + 1 does not overflow). + + Q += std::uint64_t{1} << (64u - 32u - 1u); // round, ties up + + const std::uint64_t h = p3 + p2_hi + p1_hi + (Q >> 32u); + + return {h, x.e + y.e + 64}; + } + + /*! + @brief normalize x such that the significand is >= 2^(q-1) + @pre x.f != 0 + */ + static diyfp normalize(diyfp x) noexcept + { + assert(x.f != 0); + + while ((x.f >> 63u) == 0) + { + x.f <<= 1u; + x.e--; + } + + return x; + } + + /*! + @brief normalize x such that the result has the exponent E + @pre e >= x.e and the upper e - x.e bits of x.f must be zero. + */ + static diyfp normalize_to(const diyfp& x, const int target_exponent) noexcept + { + const int delta = x.e - target_exponent; + + assert(delta >= 0); + assert(((x.f << delta) >> delta) == x.f); + + return {x.f << delta, target_exponent}; + } +}; + +struct boundaries +{ + diyfp w; + diyfp minus; + diyfp plus; +}; + +/*! +Compute the (normalized) diyfp representing the input number 'value' and its +boundaries. + +@pre value must be finite and positive +*/ +template <typename FloatType> +boundaries compute_boundaries(FloatType value) +{ + assert(std::isfinite(value)); + assert(value > 0); + + // Convert the IEEE representation into a diyfp. + // + // If v is denormal: + // value = 0.F * 2^(1 - bias) = ( F) * 2^(1 - bias - (p-1)) + // If v is normalized: + // value = 1.F * 2^(E - bias) = (2^(p-1) + F) * 2^(E - bias - (p-1)) + + static_assert(std::numeric_limits<FloatType>::is_iec559, + "internal error: dtoa_short requires an IEEE-754 floating-point implementation"); + + constexpr int kPrecision = std::numeric_limits<FloatType>::digits; // = p (includes the hidden bit) + constexpr int kBias = std::numeric_limits<FloatType>::max_exponent - 1 + (kPrecision - 1); + constexpr int kMinExp = 1 - kBias; + constexpr std::uint64_t kHiddenBit = std::uint64_t{1} << (kPrecision - 1); // = 2^(p-1) + + using bits_type = typename std::conditional<kPrecision == 24, std::uint32_t, std::uint64_t >::type; + + const std::uint64_t bits = reinterpret_bits<bits_type>(value); + const std::uint64_t E = bits >> (kPrecision - 1); + const std::uint64_t F = bits & (kHiddenBit - 1); + + const bool is_denormal = E == 0; + const diyfp v = is_denormal + ? diyfp(F, kMinExp) + : diyfp(F + kHiddenBit, static_cast<int>(E) - kBias); + + // Compute the boundaries m- and m+ of the floating-point value + // v = f * 2^e. + // + // Determine v- and v+, the floating-point predecessor and successor if v, + // respectively. + // + // v- = v - 2^e if f != 2^(p-1) or e == e_min (A) + // = v - 2^(e-1) if f == 2^(p-1) and e > e_min (B) + // + // v+ = v + 2^e + // + // Let m- = (v- + v) / 2 and m+ = (v + v+) / 2. All real numbers _strictly_ + // between m- and m+ round to v, regardless of how the input rounding + // algorithm breaks ties. + // + // ---+-------------+-------------+-------------+-------------+--- (A) + // v- m- v m+ v+ + // + // -----------------+------+------+-------------+-------------+--- (B) + // v- m- v m+ v+ + + const bool lower_boundary_is_closer = F == 0 and E > 1; + const diyfp m_plus = diyfp(2 * v.f + 1, v.e - 1); + const diyfp m_minus = lower_boundary_is_closer + ? diyfp(4 * v.f - 1, v.e - 2) // (B) + : diyfp(2 * v.f - 1, v.e - 1); // (A) + + // Determine the normalized w+ = m+. + const diyfp w_plus = diyfp::normalize(m_plus); + + // Determine w- = m- such that e_(w-) = e_(w+). + const diyfp w_minus = diyfp::normalize_to(m_minus, w_plus.e); + + return {diyfp::normalize(v), w_minus, w_plus}; +} + +// Given normalized diyfp w, Grisu needs to find a (normalized) cached +// power-of-ten c, such that the exponent of the product c * w = f * 2^e lies +// within a certain range [alpha, gamma] (Definition 3.2 from [1]) +// +// alpha <= e = e_c + e_w + q <= gamma +// +// or +// +// f_c * f_w * 2^alpha <= f_c 2^(e_c) * f_w 2^(e_w) * 2^q +// <= f_c * f_w * 2^gamma +// +// Since c and w are normalized, i.e. 2^(q-1) <= f < 2^q, this implies +// +// 2^(q-1) * 2^(q-1) * 2^alpha <= c * w * 2^q < 2^q * 2^q * 2^gamma +// +// or +// +// 2^(q - 2 + alpha) <= c * w < 2^(q + gamma) +// +// The choice of (alpha,gamma) determines the size of the table and the form of +// the digit generation procedure. Using (alpha,gamma)=(-60,-32) works out well +// in practice: +// +// The idea is to cut the number c * w = f * 2^e into two parts, which can be +// processed independently: An integral part p1, and a fractional part p2: +// +// f * 2^e = ( (f div 2^-e) * 2^-e + (f mod 2^-e) ) * 2^e +// = (f div 2^-e) + (f mod 2^-e) * 2^e +// = p1 + p2 * 2^e +// +// The conversion of p1 into decimal form requires a series of divisions and +// modulos by (a power of) 10. These operations are faster for 32-bit than for +// 64-bit integers, so p1 should ideally fit into a 32-bit integer. This can be +// achieved by choosing +// +// -e >= 32 or e <= -32 := gamma +// +// In order to convert the fractional part +// +// p2 * 2^e = p2 / 2^-e = d[-1] / 10^1 + d[-2] / 10^2 + ... +// +// into decimal form, the fraction is repeatedly multiplied by 10 and the digits +// d[-i] are extracted in order: +// +// (10 * p2) div 2^-e = d[-1] +// (10 * p2) mod 2^-e = d[-2] / 10^1 + ... +// +// The multiplication by 10 must not overflow. It is sufficient to choose +// +// 10 * p2 < 16 * p2 = 2^4 * p2 <= 2^64. +// +// Since p2 = f mod 2^-e < 2^-e, +// +// -e <= 60 or e >= -60 := alpha + +constexpr int kAlpha = -60; +constexpr int kGamma = -32; + +struct cached_power // c = f * 2^e ~= 10^k +{ + std::uint64_t f; + int e; + int k; +}; + +/*! +For a normalized diyfp w = f * 2^e, this function returns a (normalized) cached +power-of-ten c = f_c * 2^e_c, such that the exponent of the product w * c +satisfies (Definition 3.2 from [1]) + + alpha <= e_c + e + q <= gamma. +*/ +inline cached_power get_cached_power_for_binary_exponent(int e) +{ + // Now + // + // alpha <= e_c + e + q <= gamma (1) + // ==> f_c * 2^alpha <= c * 2^e * 2^q + // + // and since the c's are normalized, 2^(q-1) <= f_c, + // + // ==> 2^(q - 1 + alpha) <= c * 2^(e + q) + // ==> 2^(alpha - e - 1) <= c + // + // If c were an exakt power of ten, i.e. c = 10^k, one may determine k as + // + // k = ceil( log_10( 2^(alpha - e - 1) ) ) + // = ceil( (alpha - e - 1) * log_10(2) ) + // + // From the paper: + // "In theory the result of the procedure could be wrong since c is rounded, + // and the computation itself is approximated [...]. In practice, however, + // this simple function is sufficient." + // + // For IEEE double precision floating-point numbers converted into + // normalized diyfp's w = f * 2^e, with q = 64, + // + // e >= -1022 (min IEEE exponent) + // -52 (p - 1) + // -52 (p - 1, possibly normalize denormal IEEE numbers) + // -11 (normalize the diyfp) + // = -1137 + // + // and + // + // e <= +1023 (max IEEE exponent) + // -52 (p - 1) + // -11 (normalize the diyfp) + // = 960 + // + // This binary exponent range [-1137,960] results in a decimal exponent + // range [-307,324]. One does not need to store a cached power for each + // k in this range. For each such k it suffices to find a cached power + // such that the exponent of the product lies in [alpha,gamma]. + // This implies that the difference of the decimal exponents of adjacent + // table entries must be less than or equal to + // + // floor( (gamma - alpha) * log_10(2) ) = 8. + // + // (A smaller distance gamma-alpha would require a larger table.) + + // NB: + // Actually this function returns c, such that -60 <= e_c + e + 64 <= -34. + + constexpr int kCachedPowersMinDecExp = -300; + constexpr int kCachedPowersDecStep = 8; + + static constexpr std::array<cached_power, 79> kCachedPowers = + { + { + { 0xAB70FE17C79AC6CA, -1060, -300 }, + { 0xFF77B1FCBEBCDC4F, -1034, -292 }, + { 0xBE5691EF416BD60C, -1007, -284 }, + { 0x8DD01FAD907FFC3C, -980, -276 }, + { 0xD3515C2831559A83, -954, -268 }, + { 0x9D71AC8FADA6C9B5, -927, -260 }, + { 0xEA9C227723EE8BCB, -901, -252 }, + { 0xAECC49914078536D, -874, -244 }, + { 0x823C12795DB6CE57, -847, -236 }, + { 0xC21094364DFB5637, -821, -228 }, + { 0x9096EA6F3848984F, -794, -220 }, + { 0xD77485CB25823AC7, -768, -212 }, + { 0xA086CFCD97BF97F4, -741, -204 }, + { 0xEF340A98172AACE5, -715, -196 }, + { 0xB23867FB2A35B28E, -688, -188 }, + { 0x84C8D4DFD2C63F3B, -661, -180 }, + { 0xC5DD44271AD3CDBA, -635, -172 }, + { 0x936B9FCEBB25C996, -608, -164 }, + { 0xDBAC6C247D62A584, -582, -156 }, + { 0xA3AB66580D5FDAF6, -555, -148 }, + { 0xF3E2F893DEC3F126, -529, -140 }, + { 0xB5B5ADA8AAFF80B8, -502, -132 }, + { 0x87625F056C7C4A8B, -475, -124 }, + { 0xC9BCFF6034C13053, -449, -116 }, + { 0x964E858C91BA2655, -422, -108 }, + { 0xDFF9772470297EBD, -396, -100 }, + { 0xA6DFBD9FB8E5B88F, -369, -92 }, + { 0xF8A95FCF88747D94, -343, -84 }, + { 0xB94470938FA89BCF, -316, -76 }, + { 0x8A08F0F8BF0F156B, -289, -68 }, + { 0xCDB02555653131B6, -263, -60 }, + { 0x993FE2C6D07B7FAC, -236, -52 }, + { 0xE45C10C42A2B3B06, -210, -44 }, + { 0xAA242499697392D3, -183, -36 }, + { 0xFD87B5F28300CA0E, -157, -28 }, + { 0xBCE5086492111AEB, -130, -20 }, + { 0x8CBCCC096F5088CC, -103, -12 }, + { 0xD1B71758E219652C, -77, -4 }, + { 0x9C40000000000000, -50, 4 }, + { 0xE8D4A51000000000, -24, 12 }, + { 0xAD78EBC5AC620000, 3, 20 }, + { 0x813F3978F8940984, 30, 28 }, + { 0xC097CE7BC90715B3, 56, 36 }, + { 0x8F7E32CE7BEA5C70, 83, 44 }, + { 0xD5D238A4ABE98068, 109, 52 }, + { 0x9F4F2726179A2245, 136, 60 }, + { 0xED63A231D4C4FB27, 162, 68 }, + { 0xB0DE65388CC8ADA8, 189, 76 }, + { 0x83C7088E1AAB65DB, 216, 84 }, + { 0xC45D1DF942711D9A, 242, 92 }, + { 0x924D692CA61BE758, 269, 100 }, + { 0xDA01EE641A708DEA, 295, 108 }, + { 0xA26DA3999AEF774A, 322, 116 }, + { 0xF209787BB47D6B85, 348, 124 }, + { 0xB454E4A179DD1877, 375, 132 }, + { 0x865B86925B9BC5C2, 402, 140 }, + { 0xC83553C5C8965D3D, 428, 148 }, + { 0x952AB45CFA97A0B3, 455, 156 }, + { 0xDE469FBD99A05FE3, 481, 164 }, + { 0xA59BC234DB398C25, 508, 172 }, + { 0xF6C69A72A3989F5C, 534, 180 }, + { 0xB7DCBF5354E9BECE, 561, 188 }, + { 0x88FCF317F22241E2, 588, 196 }, + { 0xCC20CE9BD35C78A5, 614, 204 }, + { 0x98165AF37B2153DF, 641, 212 }, + { 0xE2A0B5DC971F303A, 667, 220 }, + { 0xA8D9D1535CE3B396, 694, 228 }, + { 0xFB9B7CD9A4A7443C, 720, 236 }, + { 0xBB764C4CA7A44410, 747, 244 }, + { 0x8BAB8EEFB6409C1A, 774, 252 }, + { 0xD01FEF10A657842C, 800, 260 }, + { 0x9B10A4E5E9913129, 827, 268 }, + { 0xE7109BFBA19C0C9D, 853, 276 }, + { 0xAC2820D9623BF429, 880, 284 }, + { 0x80444B5E7AA7CF85, 907, 292 }, + { 0xBF21E44003ACDD2D, 933, 300 }, + { 0x8E679C2F5E44FF8F, 960, 308 }, + { 0xD433179D9C8CB841, 986, 316 }, + { 0x9E19DB92B4E31BA9, 1013, 324 }, + } + }; + + // This computation gives exactly the same results for k as + // k = ceil((kAlpha - e - 1) * 0.30102999566398114) + // for |e| <= 1500, but doesn't require floating-point operations. + // NB: log_10(2) ~= 78913 / 2^18 + assert(e >= -1500); + assert(e <= 1500); + const int f = kAlpha - e - 1; + const int k = (f * 78913) / (1 << 18) + static_cast<int>(f > 0); + + const int index = (-kCachedPowersMinDecExp + k + (kCachedPowersDecStep - 1)) / kCachedPowersDecStep; + assert(index >= 0); + assert(static_cast<std::size_t>(index) < kCachedPowers.size()); + + const cached_power cached = kCachedPowers[static_cast<std::size_t>(index)]; + assert(kAlpha <= cached.e + e + 64); + assert(kGamma >= cached.e + e + 64); + + return cached; +} + +/*! +For n != 0, returns k, such that pow10 := 10^(k-1) <= n < 10^k. +For n == 0, returns 1 and sets pow10 := 1. +*/ +inline int find_largest_pow10(const std::uint32_t n, std::uint32_t& pow10) +{ + // LCOV_EXCL_START + if (n >= 1000000000) + { + pow10 = 1000000000; + return 10; + } + // LCOV_EXCL_STOP + else if (n >= 100000000) + { + pow10 = 100000000; + return 9; + } + else if (n >= 10000000) + { + pow10 = 10000000; + return 8; + } + else if (n >= 1000000) + { + pow10 = 1000000; + return 7; + } + else if (n >= 100000) + { + pow10 = 100000; + return 6; + } + else if (n >= 10000) + { + pow10 = 10000; + return 5; + } + else if (n >= 1000) + { + pow10 = 1000; + return 4; + } + else if (n >= 100) + { + pow10 = 100; + return 3; + } + else if (n >= 10) + { + pow10 = 10; + return 2; + } + else + { + pow10 = 1; + return 1; + } +} + +inline void grisu2_round(char* buf, int len, std::uint64_t dist, std::uint64_t delta, + std::uint64_t rest, std::uint64_t ten_k) +{ + assert(len >= 1); + assert(dist <= delta); + assert(rest <= delta); + assert(ten_k > 0); + + // <--------------------------- delta ----> + // <---- dist ---------> + // --------------[------------------+-------------------]-------------- + // M- w M+ + // + // ten_k + // <------> + // <---- rest ----> + // --------------[------------------+----+--------------]-------------- + // w V + // = buf * 10^k + // + // ten_k represents a unit-in-the-last-place in the decimal representation + // stored in buf. + // Decrement buf by ten_k while this takes buf closer to w. + + // The tests are written in this order to avoid overflow in unsigned + // integer arithmetic. + + while (rest < dist + and delta - rest >= ten_k + and (rest + ten_k < dist or dist - rest > rest + ten_k - dist)) + { + assert(buf[len - 1] != '0'); + buf[len - 1]--; + rest += ten_k; + } +} + +/*! +Generates V = buffer * 10^decimal_exponent, such that M- <= V <= M+. +M- and M+ must be normalized and share the same exponent -60 <= e <= -32. +*/ +inline void grisu2_digit_gen(char* buffer, int& length, int& decimal_exponent, + diyfp M_minus, diyfp w, diyfp M_plus) +{ + static_assert(kAlpha >= -60, "internal error"); + static_assert(kGamma <= -32, "internal error"); + + // Generates the digits (and the exponent) of a decimal floating-point + // number V = buffer * 10^decimal_exponent in the range [M-, M+]. The diyfp's + // w, M- and M+ share the same exponent e, which satisfies alpha <= e <= gamma. + // + // <--------------------------- delta ----> + // <---- dist ---------> + // --------------[------------------+-------------------]-------------- + // M- w M+ + // + // Grisu2 generates the digits of M+ from left to right and stops as soon as + // V is in [M-,M+]. + + assert(M_plus.e >= kAlpha); + assert(M_plus.e <= kGamma); + + std::uint64_t delta = diyfp::sub(M_plus, M_minus).f; // (significand of (M+ - M-), implicit exponent is e) + std::uint64_t dist = diyfp::sub(M_plus, w ).f; // (significand of (M+ - w ), implicit exponent is e) + + // Split M+ = f * 2^e into two parts p1 and p2 (note: e < 0): + // + // M+ = f * 2^e + // = ((f div 2^-e) * 2^-e + (f mod 2^-e)) * 2^e + // = ((p1 ) * 2^-e + (p2 )) * 2^e + // = p1 + p2 * 2^e + + const diyfp one(std::uint64_t{1} << -M_plus.e, M_plus.e); + + auto p1 = static_cast<std::uint32_t>(M_plus.f >> -one.e); // p1 = f div 2^-e (Since -e >= 32, p1 fits into a 32-bit int.) + std::uint64_t p2 = M_plus.f & (one.f - 1); // p2 = f mod 2^-e + + // 1) + // + // Generate the digits of the integral part p1 = d[n-1]...d[1]d[0] + + assert(p1 > 0); + + std::uint32_t pow10; + const int k = find_largest_pow10(p1, pow10); + + // 10^(k-1) <= p1 < 10^k, pow10 = 10^(k-1) + // + // p1 = (p1 div 10^(k-1)) * 10^(k-1) + (p1 mod 10^(k-1)) + // = (d[k-1] ) * 10^(k-1) + (p1 mod 10^(k-1)) + // + // M+ = p1 + p2 * 2^e + // = d[k-1] * 10^(k-1) + (p1 mod 10^(k-1)) + p2 * 2^e + // = d[k-1] * 10^(k-1) + ((p1 mod 10^(k-1)) * 2^-e + p2) * 2^e + // = d[k-1] * 10^(k-1) + ( rest) * 2^e + // + // Now generate the digits d[n] of p1 from left to right (n = k-1,...,0) + // + // p1 = d[k-1]...d[n] * 10^n + d[n-1]...d[0] + // + // but stop as soon as + // + // rest * 2^e = (d[n-1]...d[0] * 2^-e + p2) * 2^e <= delta * 2^e + + int n = k; + while (n > 0) + { + // Invariants: + // M+ = buffer * 10^n + (p1 + p2 * 2^e) (buffer = 0 for n = k) + // pow10 = 10^(n-1) <= p1 < 10^n + // + const std::uint32_t d = p1 / pow10; // d = p1 div 10^(n-1) + const std::uint32_t r = p1 % pow10; // r = p1 mod 10^(n-1) + // + // M+ = buffer * 10^n + (d * 10^(n-1) + r) + p2 * 2^e + // = (buffer * 10 + d) * 10^(n-1) + (r + p2 * 2^e) + // + assert(d <= 9); + buffer[length++] = static_cast<char>('0' + d); // buffer := buffer * 10 + d + // + // M+ = buffer * 10^(n-1) + (r + p2 * 2^e) + // + p1 = r; + n--; + // + // M+ = buffer * 10^n + (p1 + p2 * 2^e) + // pow10 = 10^n + // + + // Now check if enough digits have been generated. + // Compute + // + // p1 + p2 * 2^e = (p1 * 2^-e + p2) * 2^e = rest * 2^e + // + // Note: + // Since rest and delta share the same exponent e, it suffices to + // compare the significands. + const std::uint64_t rest = (std::uint64_t{p1} << -one.e) + p2; + if (rest <= delta) + { + // V = buffer * 10^n, with M- <= V <= M+. + + decimal_exponent += n; + + // We may now just stop. But instead look if the buffer could be + // decremented to bring V closer to w. + // + // pow10 = 10^n is now 1 ulp in the decimal representation V. + // The rounding procedure works with diyfp's with an implicit + // exponent of e. + // + // 10^n = (10^n * 2^-e) * 2^e = ulp * 2^e + // + const std::uint64_t ten_n = std::uint64_t{pow10} << -one.e; + grisu2_round(buffer, length, dist, delta, rest, ten_n); + + return; + } + + pow10 /= 10; + // + // pow10 = 10^(n-1) <= p1 < 10^n + // Invariants restored. + } + + // 2) + // + // The digits of the integral part have been generated: + // + // M+ = d[k-1]...d[1]d[0] + p2 * 2^e + // = buffer + p2 * 2^e + // + // Now generate the digits of the fractional part p2 * 2^e. + // + // Note: + // No decimal point is generated: the exponent is adjusted instead. + // + // p2 actually represents the fraction + // + // p2 * 2^e + // = p2 / 2^-e + // = d[-1] / 10^1 + d[-2] / 10^2 + ... + // + // Now generate the digits d[-m] of p1 from left to right (m = 1,2,...) + // + // p2 * 2^e = d[-1]d[-2]...d[-m] * 10^-m + // + 10^-m * (d[-m-1] / 10^1 + d[-m-2] / 10^2 + ...) + // + // using + // + // 10^m * p2 = ((10^m * p2) div 2^-e) * 2^-e + ((10^m * p2) mod 2^-e) + // = ( d) * 2^-e + ( r) + // + // or + // 10^m * p2 * 2^e = d + r * 2^e + // + // i.e. + // + // M+ = buffer + p2 * 2^e + // = buffer + 10^-m * (d + r * 2^e) + // = (buffer * 10^m + d) * 10^-m + 10^-m * r * 2^e + // + // and stop as soon as 10^-m * r * 2^e <= delta * 2^e + + assert(p2 > delta); + + int m = 0; + for (;;) + { + // Invariant: + // M+ = buffer * 10^-m + 10^-m * (d[-m-1] / 10 + d[-m-2] / 10^2 + ...) * 2^e + // = buffer * 10^-m + 10^-m * (p2 ) * 2^e + // = buffer * 10^-m + 10^-m * (1/10 * (10 * p2) ) * 2^e + // = buffer * 10^-m + 10^-m * (1/10 * ((10*p2 div 2^-e) * 2^-e + (10*p2 mod 2^-e)) * 2^e + // + assert(p2 <= (std::numeric_limits<std::uint64_t>::max)() / 10); + p2 *= 10; + const std::uint64_t d = p2 >> -one.e; // d = (10 * p2) div 2^-e + const std::uint64_t r = p2 & (one.f - 1); // r = (10 * p2) mod 2^-e + // + // M+ = buffer * 10^-m + 10^-m * (1/10 * (d * 2^-e + r) * 2^e + // = buffer * 10^-m + 10^-m * (1/10 * (d + r * 2^e)) + // = (buffer * 10 + d) * 10^(-m-1) + 10^(-m-1) * r * 2^e + // + assert(d <= 9); + buffer[length++] = static_cast<char>('0' + d); // buffer := buffer * 10 + d + // + // M+ = buffer * 10^(-m-1) + 10^(-m-1) * r * 2^e + // + p2 = r; + m++; + // + // M+ = buffer * 10^-m + 10^-m * p2 * 2^e + // Invariant restored. + + // Check if enough digits have been generated. + // + // 10^-m * p2 * 2^e <= delta * 2^e + // p2 * 2^e <= 10^m * delta * 2^e + // p2 <= 10^m * delta + delta *= 10; + dist *= 10; + if (p2 <= delta) + { + break; + } + } + + // V = buffer * 10^-m, with M- <= V <= M+. + + decimal_exponent -= m; + + // 1 ulp in the decimal representation is now 10^-m. + // Since delta and dist are now scaled by 10^m, we need to do the + // same with ulp in order to keep the units in sync. + // + // 10^m * 10^-m = 1 = 2^-e * 2^e = ten_m * 2^e + // + const std::uint64_t ten_m = one.f; + grisu2_round(buffer, length, dist, delta, p2, ten_m); + + // By construction this algorithm generates the shortest possible decimal + // number (Loitsch, Theorem 6.2) which rounds back to w. + // For an input number of precision p, at least + // + // N = 1 + ceil(p * log_10(2)) + // + // decimal digits are sufficient to identify all binary floating-point + // numbers (Matula, "In-and-Out conversions"). + // This implies that the algorithm does not produce more than N decimal + // digits. + // + // N = 17 for p = 53 (IEEE double precision) + // N = 9 for p = 24 (IEEE single precision) +} + +/*! +v = buf * 10^decimal_exponent +len is the length of the buffer (number of decimal digits) +The buffer must be large enough, i.e. >= max_digits10. +*/ +inline void grisu2(char* buf, int& len, int& decimal_exponent, + diyfp m_minus, diyfp v, diyfp m_plus) +{ + assert(m_plus.e == m_minus.e); + assert(m_plus.e == v.e); + + // --------(-----------------------+-----------------------)-------- (A) + // m- v m+ + // + // --------------------(-----------+-----------------------)-------- (B) + // m- v m+ + // + // First scale v (and m- and m+) such that the exponent is in the range + // [alpha, gamma]. + + const cached_power cached = get_cached_power_for_binary_exponent(m_plus.e); + + const diyfp c_minus_k(cached.f, cached.e); // = c ~= 10^-k + + // The exponent of the products is = v.e + c_minus_k.e + q and is in the range [alpha,gamma] + const diyfp w = diyfp::mul(v, c_minus_k); + const diyfp w_minus = diyfp::mul(m_minus, c_minus_k); + const diyfp w_plus = diyfp::mul(m_plus, c_minus_k); + + // ----(---+---)---------------(---+---)---------------(---+---)---- + // w- w w+ + // = c*m- = c*v = c*m+ + // + // diyfp::mul rounds its result and c_minus_k is approximated too. w, w- and + // w+ are now off by a small amount. + // In fact: + // + // w - v * 10^k < 1 ulp + // + // To account for this inaccuracy, add resp. subtract 1 ulp. + // + // --------+---[---------------(---+---)---------------]---+-------- + // w- M- w M+ w+ + // + // Now any number in [M-, M+] (bounds included) will round to w when input, + // regardless of how the input rounding algorithm breaks ties. + // + // And digit_gen generates the shortest possible such number in [M-, M+]. + // Note that this does not mean that Grisu2 always generates the shortest + // possible number in the interval (m-, m+). + const diyfp M_minus(w_minus.f + 1, w_minus.e); + const diyfp M_plus (w_plus.f - 1, w_plus.e ); + + decimal_exponent = -cached.k; // = -(-k) = k + + grisu2_digit_gen(buf, len, decimal_exponent, M_minus, w, M_plus); +} + +/*! +v = buf * 10^decimal_exponent +len is the length of the buffer (number of decimal digits) +The buffer must be large enough, i.e. >= max_digits10. +*/ +template <typename FloatType> +void grisu2(char* buf, int& len, int& decimal_exponent, FloatType value) +{ + static_assert(diyfp::kPrecision >= std::numeric_limits<FloatType>::digits + 3, + "internal error: not enough precision"); + + assert(std::isfinite(value)); + assert(value > 0); + + // If the neighbors (and boundaries) of 'value' are always computed for double-precision + // numbers, all float's can be recovered using strtod (and strtof). However, the resulting + // decimal representations are not exactly "short". + // + // The documentation for 'std::to_chars' (https://en.cppreference.com/w/cpp/utility/to_chars) + // says "value is converted to a string as if by std::sprintf in the default ("C") locale" + // and since sprintf promotes float's to double's, I think this is exactly what 'std::to_chars' + // does. + // On the other hand, the documentation for 'std::to_chars' requires that "parsing the + // representation using the corresponding std::from_chars function recovers value exactly". That + // indicates that single precision floating-point numbers should be recovered using + // 'std::strtof'. + // + // NB: If the neighbors are computed for single-precision numbers, there is a single float + // (7.0385307e-26f) which can't be recovered using strtod. The resulting double precision + // value is off by 1 ulp. +#if 0 + const boundaries w = compute_boundaries(static_cast<double>(value)); +#else + const boundaries w = compute_boundaries(value); +#endif + + grisu2(buf, len, decimal_exponent, w.minus, w.w, w.plus); +} + +/*! +@brief appends a decimal representation of e to buf +@return a pointer to the element following the exponent. +@pre -1000 < e < 1000 +*/ +inline char* append_exponent(char* buf, int e) +{ + assert(e > -1000); + assert(e < 1000); + + if (e < 0) + { + e = -e; + *buf++ = '-'; + } + else + { + *buf++ = '+'; + } + + auto k = static_cast<std::uint32_t>(e); + if (k < 10) + { + // Always print at least two digits in the exponent. + // This is for compatibility with printf("%g"). + *buf++ = '0'; + *buf++ = static_cast<char>('0' + k); + } + else if (k < 100) + { + *buf++ = static_cast<char>('0' + k / 10); + k %= 10; + *buf++ = static_cast<char>('0' + k); + } + else + { + *buf++ = static_cast<char>('0' + k / 100); + k %= 100; + *buf++ = static_cast<char>('0' + k / 10); + k %= 10; + *buf++ = static_cast<char>('0' + k); + } + + return buf; +} + +/*! +@brief prettify v = buf * 10^decimal_exponent + +If v is in the range [10^min_exp, 10^max_exp) it will be printed in fixed-point +notation. Otherwise it will be printed in exponential notation. + +@pre min_exp < 0 +@pre max_exp > 0 +*/ +inline char* format_buffer(char* buf, int len, int decimal_exponent, + int min_exp, int max_exp) +{ + assert(min_exp < 0); + assert(max_exp > 0); + + const int k = len; + const int n = len + decimal_exponent; + + // v = buf * 10^(n-k) + // k is the length of the buffer (number of decimal digits) + // n is the position of the decimal point relative to the start of the buffer. + + if (k <= n and n <= max_exp) + { + // digits[000] + // len <= max_exp + 2 + + std::memset(buf + k, '0', static_cast<size_t>(n - k)); + // Make it look like a floating-point number (#362, #378) + buf[n + 0] = '.'; + buf[n + 1] = '0'; + return buf + (n + 2); + } + + if (0 < n and n <= max_exp) + { + // dig.its + // len <= max_digits10 + 1 + + assert(k > n); + + std::memmove(buf + (n + 1), buf + n, static_cast<size_t>(k - n)); + buf[n] = '.'; + return buf + (k + 1); + } + + if (min_exp < n and n <= 0) + { + // 0.[000]digits + // len <= 2 + (-min_exp - 1) + max_digits10 + + std::memmove(buf + (2 + -n), buf, static_cast<size_t>(k)); + buf[0] = '0'; + buf[1] = '.'; + std::memset(buf + 2, '0', static_cast<size_t>(-n)); + return buf + (2 + (-n) + k); + } + + if (k == 1) + { + // dE+123 + // len <= 1 + 5 + + buf += 1; + } + else + { + // d.igitsE+123 + // len <= max_digits10 + 1 + 5 + + std::memmove(buf + 2, buf + 1, static_cast<size_t>(k - 1)); + buf[1] = '.'; + buf += 1 + k; + } + + *buf++ = 'e'; + return append_exponent(buf, n - 1); +} + +} // namespace dtoa_impl + +/*! +@brief generates a decimal representation of the floating-point number value in [first, last). + +The format of the resulting decimal representation is similar to printf's %g +format. Returns an iterator pointing past-the-end of the decimal representation. + +@note The input number must be finite, i.e. NaN's and Inf's are not supported. +@note The buffer must be large enough. +@note The result is NOT null-terminated. +*/ +template <typename FloatType> +char* to_chars(char* first, const char* last, FloatType value) +{ + static_cast<void>(last); // maybe unused - fix warning + assert(std::isfinite(value)); + + // Use signbit(value) instead of (value < 0) since signbit works for -0. + if (std::signbit(value)) + { + value = -value; + *first++ = '-'; + } + + if (value == 0) // +-0 + { + *first++ = '0'; + // Make it look like a floating-point number (#362, #378) + *first++ = '.'; + *first++ = '0'; + return first; + } + + assert(last - first >= std::numeric_limits<FloatType>::max_digits10); + + // Compute v = buffer * 10^decimal_exponent. + // The decimal digits are stored in the buffer, which needs to be interpreted + // as an unsigned decimal integer. + // len is the length of the buffer, i.e. the number of decimal digits. + int len = 0; + int decimal_exponent = 0; + dtoa_impl::grisu2(first, len, decimal_exponent, value); + + assert(len <= std::numeric_limits<FloatType>::max_digits10); + + // Format the buffer like printf("%.*g", prec, value) + constexpr int kMinExp = -4; + // Use digits10 here to increase compatibility with version 2. + constexpr int kMaxExp = std::numeric_limits<FloatType>::digits10; + + assert(last - first >= kMaxExp + 2); + assert(last - first >= 2 + (-kMinExp - 1) + std::numeric_limits<FloatType>::max_digits10); + assert(last - first >= std::numeric_limits<FloatType>::max_digits10 + 6); + + return dtoa_impl::format_buffer(first, len, decimal_exponent, kMinExp, kMaxExp); +} + +} // namespace detail +} // namespace nlohmann + +// #include <nlohmann/detail/exceptions.hpp> + +// #include <nlohmann/detail/macro_scope.hpp> + +// #include <nlohmann/detail/meta/cpp_future.hpp> + +// #include <nlohmann/detail/output/binary_writer.hpp> + +// #include <nlohmann/detail/output/output_adapters.hpp> + +// #include <nlohmann/detail/value_t.hpp> + + +namespace nlohmann +{ +namespace detail +{ +/////////////////// +// serialization // +/////////////////// + +/// how to treat decoding errors +enum class error_handler_t +{ + strict, ///< throw a type_error exception in case of invalid UTF-8 + replace, ///< replace invalid UTF-8 sequences with U+FFFD + ignore ///< ignore invalid UTF-8 sequences +}; + +template<typename BasicJsonType> +class serializer +{ + using string_t = typename BasicJsonType::string_t; + using number_float_t = typename BasicJsonType::number_float_t; + using number_integer_t = typename BasicJsonType::number_integer_t; + using number_unsigned_t = typename BasicJsonType::number_unsigned_t; + static constexpr std::uint8_t UTF8_ACCEPT = 0; + static constexpr std::uint8_t UTF8_REJECT = 1; + + public: + /*! + @param[in] s output stream to serialize to + @param[in] ichar indentation character to use + @param[in] error_handler_ how to react on decoding errors + */ + serializer(output_adapter_t<char> s, const char ichar, + error_handler_t error_handler_ = error_handler_t::strict) + : o(std::move(s)) + , loc(std::localeconv()) + , thousands_sep(loc->thousands_sep == nullptr ? '\0' : * (loc->thousands_sep)) + , decimal_point(loc->decimal_point == nullptr ? '\0' : * (loc->decimal_point)) + , indent_char(ichar) + , indent_string(512, indent_char) + , error_handler(error_handler_) + {} + + // delete because of pointer members + serializer(const serializer&) = delete; + serializer& operator=(const serializer&) = delete; + serializer(serializer&&) = delete; + serializer& operator=(serializer&&) = delete; + ~serializer() = default; + + /*! + @brief internal implementation of the serialization function + + This function is called by the public member function dump and organizes + the serialization internally. The indentation level is propagated as + additional parameter. In case of arrays and objects, the function is + called recursively. + + - strings and object keys are escaped using `escape_string()` + - integer numbers are converted implicitly via `operator<<` + - floating-point numbers are converted to a string using `"%g"` format + + @param[in] val value to serialize + @param[in] pretty_print whether the output shall be pretty-printed + @param[in] indent_step the indent level + @param[in] current_indent the current indent level (only used internally) + */ + void dump(const BasicJsonType& val, const bool pretty_print, + const bool ensure_ascii, + const unsigned int indent_step, + const unsigned int current_indent = 0) + { + switch (val.m_type) + { + case value_t::object: + { + if (val.m_value.object->empty()) + { + o->write_characters("{}", 2); + return; + } + + if (pretty_print) + { + o->write_characters("{\n", 2); + + // variable to hold indentation for recursive calls + const auto new_indent = current_indent + indent_step; + if (JSON_UNLIKELY(indent_string.size() < new_indent)) + { + indent_string.resize(indent_string.size() * 2, ' '); + } + + // first n-1 elements + auto i = val.m_value.object->cbegin(); + for (std::size_t cnt = 0; cnt < val.m_value.object->size() - 1; ++cnt, ++i) + { + o->write_characters(indent_string.c_str(), new_indent); + o->write_character('\"'); + dump_escaped(i->first, ensure_ascii); + o->write_characters("\": ", 3); + dump(i->second, true, ensure_ascii, indent_step, new_indent); + o->write_characters(",\n", 2); + } + + // last element + assert(i != val.m_value.object->cend()); + assert(std::next(i) == val.m_value.object->cend()); + o->write_characters(indent_string.c_str(), new_indent); + o->write_character('\"'); + dump_escaped(i->first, ensure_ascii); + o->write_characters("\": ", 3); + dump(i->second, true, ensure_ascii, indent_step, new_indent); + + o->write_character('\n'); + o->write_characters(indent_string.c_str(), current_indent); + o->write_character('}'); + } + else + { + o->write_character('{'); + + // first n-1 elements + auto i = val.m_value.object->cbegin(); + for (std::size_t cnt = 0; cnt < val.m_value.object->size() - 1; ++cnt, ++i) + { + o->write_character('\"'); + dump_escaped(i->first, ensure_ascii); + o->write_characters("\":", 2); + dump(i->second, false, ensure_ascii, indent_step, current_indent); + o->write_character(','); + } + + // last element + assert(i != val.m_value.object->cend()); + assert(std::next(i) == val.m_value.object->cend()); + o->write_character('\"'); + dump_escaped(i->first, ensure_ascii); + o->write_characters("\":", 2); + dump(i->second, false, ensure_ascii, indent_step, current_indent); + + o->write_character('}'); + } + + return; + } + + case value_t::array: + { + if (val.m_value.array->empty()) + { + o->write_characters("[]", 2); + return; + } + + if (pretty_print) + { + o->write_characters("[\n", 2); + + // variable to hold indentation for recursive calls + const auto new_indent = current_indent + indent_step; + if (JSON_UNLIKELY(indent_string.size() < new_indent)) + { + indent_string.resize(indent_string.size() * 2, ' '); + } + + // first n-1 elements + for (auto i = val.m_value.array->cbegin(); + i != val.m_value.array->cend() - 1; ++i) + { + o->write_characters(indent_string.c_str(), new_indent); + dump(*i, true, ensure_ascii, indent_step, new_indent); + o->write_characters(",\n", 2); + } + + // last element + assert(not val.m_value.array->empty()); + o->write_characters(indent_string.c_str(), new_indent); + dump(val.m_value.array->back(), true, ensure_ascii, indent_step, new_indent); + + o->write_character('\n'); + o->write_characters(indent_string.c_str(), current_indent); + o->write_character(']'); + } + else + { + o->write_character('['); + + // first n-1 elements + for (auto i = val.m_value.array->cbegin(); + i != val.m_value.array->cend() - 1; ++i) + { + dump(*i, false, ensure_ascii, indent_step, current_indent); + o->write_character(','); + } + + // last element + assert(not val.m_value.array->empty()); + dump(val.m_value.array->back(), false, ensure_ascii, indent_step, current_indent); + + o->write_character(']'); + } + + return; + } + + case value_t::string: + { + o->write_character('\"'); + dump_escaped(*val.m_value.string, ensure_ascii); + o->write_character('\"'); + return; + } + + case value_t::boolean: + { + if (val.m_value.boolean) + { + o->write_characters("true", 4); + } + else + { + o->write_characters("false", 5); + } + return; + } + + case value_t::number_integer: + { + dump_integer(val.m_value.number_integer); + return; + } + + case value_t::number_unsigned: + { + dump_integer(val.m_value.number_unsigned); + return; + } + + case value_t::number_float: + { + dump_float(val.m_value.number_float); + return; + } + + case value_t::discarded: + { + o->write_characters("<discarded>", 11); + return; + } + + case value_t::null: + { + o->write_characters("null", 4); + return; + } + + default: // LCOV_EXCL_LINE + assert(false); // LCOV_EXCL_LINE + } + } + + private: + /*! + @brief dump escaped string + + Escape a string by replacing certain special characters by a sequence of an + escape character (backslash) and another character and other control + characters by a sequence of "\u" followed by a four-digit hex + representation. The escaped string is written to output stream @a o. + + @param[in] s the string to escape + @param[in] ensure_ascii whether to escape non-ASCII characters with + \uXXXX sequences + + @complexity Linear in the length of string @a s. + */ + void dump_escaped(const string_t& s, const bool ensure_ascii) + { + std::uint32_t codepoint; + std::uint8_t state = UTF8_ACCEPT; + std::size_t bytes = 0; // number of bytes written to string_buffer + + // number of bytes written at the point of the last valid byte + std::size_t bytes_after_last_accept = 0; + std::size_t undumped_chars = 0; + + for (std::size_t i = 0; i < s.size(); ++i) + { + const auto byte = static_cast<uint8_t>(s[i]); + + switch (decode(state, codepoint, byte)) + { + case UTF8_ACCEPT: // decode found a new code point + { + switch (codepoint) + { + case 0x08: // backspace + { + string_buffer[bytes++] = '\\'; + string_buffer[bytes++] = 'b'; + break; + } + + case 0x09: // horizontal tab + { + string_buffer[bytes++] = '\\'; + string_buffer[bytes++] = 't'; + break; + } + + case 0x0A: // newline + { + string_buffer[bytes++] = '\\'; + string_buffer[bytes++] = 'n'; + break; + } + + case 0x0C: // formfeed + { + string_buffer[bytes++] = '\\'; + string_buffer[bytes++] = 'f'; + break; + } + + case 0x0D: // carriage return + { + string_buffer[bytes++] = '\\'; + string_buffer[bytes++] = 'r'; + break; + } + + case 0x22: // quotation mark + { + string_buffer[bytes++] = '\\'; + string_buffer[bytes++] = '\"'; + break; + } + + case 0x5C: // reverse solidus + { + string_buffer[bytes++] = '\\'; + string_buffer[bytes++] = '\\'; + break; + } + + default: + { + // escape control characters (0x00..0x1F) or, if + // ensure_ascii parameter is used, non-ASCII characters + if ((codepoint <= 0x1F) or (ensure_ascii and (codepoint >= 0x7F))) + { + if (codepoint <= 0xFFFF) + { + (std::snprintf)(string_buffer.data() + bytes, 7, "\\u%04x", + static_cast<std::uint16_t>(codepoint)); + bytes += 6; + } + else + { + (std::snprintf)(string_buffer.data() + bytes, 13, "\\u%04x\\u%04x", + static_cast<std::uint16_t>(0xD7C0u + (codepoint >> 10u)), + static_cast<std::uint16_t>(0xDC00u + (codepoint & 0x3FFu))); + bytes += 12; + } + } + else + { + // copy byte to buffer (all previous bytes + // been copied have in default case above) + string_buffer[bytes++] = s[i]; + } + break; + } + } + + // write buffer and reset index; there must be 13 bytes + // left, as this is the maximal number of bytes to be + // written ("\uxxxx\uxxxx\0") for one code point + if (string_buffer.size() - bytes < 13) + { + o->write_characters(string_buffer.data(), bytes); + bytes = 0; + } + + // remember the byte position of this accept + bytes_after_last_accept = bytes; + undumped_chars = 0; + break; + } + + case UTF8_REJECT: // decode found invalid UTF-8 byte + { + switch (error_handler) + { + case error_handler_t::strict: + { + std::string sn(3, '\0'); + (std::snprintf)(&sn[0], sn.size(), "%.2X", byte); + JSON_THROW(type_error::create(316, "invalid UTF-8 byte at index " + std::to_string(i) + ": 0x" + sn)); + } + + case error_handler_t::ignore: + case error_handler_t::replace: + { + // in case we saw this character the first time, we + // would like to read it again, because the byte + // may be OK for itself, but just not OK for the + // previous sequence + if (undumped_chars > 0) + { + --i; + } + + // reset length buffer to the last accepted index; + // thus removing/ignoring the invalid characters + bytes = bytes_after_last_accept; + + if (error_handler == error_handler_t::replace) + { + // add a replacement character + if (ensure_ascii) + { + string_buffer[bytes++] = '\\'; + string_buffer[bytes++] = 'u'; + string_buffer[bytes++] = 'f'; + string_buffer[bytes++] = 'f'; + string_buffer[bytes++] = 'f'; + string_buffer[bytes++] = 'd'; + } + else + { + string_buffer[bytes++] = detail::binary_writer<BasicJsonType, char>::to_char_type('\xEF'); + string_buffer[bytes++] = detail::binary_writer<BasicJsonType, char>::to_char_type('\xBF'); + string_buffer[bytes++] = detail::binary_writer<BasicJsonType, char>::to_char_type('\xBD'); + } + + // write buffer and reset index; there must be 13 bytes + // left, as this is the maximal number of bytes to be + // written ("\uxxxx\uxxxx\0") for one code point + if (string_buffer.size() - bytes < 13) + { + o->write_characters(string_buffer.data(), bytes); + bytes = 0; + } + + bytes_after_last_accept = bytes; + } + + undumped_chars = 0; + + // continue processing the string + state = UTF8_ACCEPT; + break; + } + + default: // LCOV_EXCL_LINE + assert(false); // LCOV_EXCL_LINE + } + break; + } + + default: // decode found yet incomplete multi-byte code point + { + if (not ensure_ascii) + { + // code point will not be escaped - copy byte to buffer + string_buffer[bytes++] = s[i]; + } + ++undumped_chars; + break; + } + } + } + + // we finished processing the string + if (JSON_LIKELY(state == UTF8_ACCEPT)) + { + // write buffer + if (bytes > 0) + { + o->write_characters(string_buffer.data(), bytes); + } + } + else + { + // we finish reading, but do not accept: string was incomplete + switch (error_handler) + { + case error_handler_t::strict: + { + std::string sn(3, '\0'); + (std::snprintf)(&sn[0], sn.size(), "%.2X", static_cast<std::uint8_t>(s.back())); + JSON_THROW(type_error::create(316, "incomplete UTF-8 string; last byte: 0x" + sn)); + } + + case error_handler_t::ignore: + { + // write all accepted bytes + o->write_characters(string_buffer.data(), bytes_after_last_accept); + break; + } + + case error_handler_t::replace: + { + // write all accepted bytes + o->write_characters(string_buffer.data(), bytes_after_last_accept); + // add a replacement character + if (ensure_ascii) + { + o->write_characters("\\ufffd", 6); + } + else + { + o->write_characters("\xEF\xBF\xBD", 3); + } + break; + } + + default: // LCOV_EXCL_LINE + assert(false); // LCOV_EXCL_LINE + } + } + } + + /*! + @brief count digits + + Count the number of decimal (base 10) digits for an input unsigned integer. + + @param[in] x unsigned integer number to count its digits + @return number of decimal digits + */ + inline unsigned int count_digits(number_unsigned_t x) noexcept + { + unsigned int n_digits = 1; + for (;;) + { + if (x < 10) + { + return n_digits; + } + if (x < 100) + { + return n_digits + 1; + } + if (x < 1000) + { + return n_digits + 2; + } + if (x < 10000) + { + return n_digits + 3; + } + x = x / 10000u; + n_digits += 4; + } + } + + /*! + @brief dump an integer + + Dump a given integer to output stream @a o. Works internally with + @a number_buffer. + + @param[in] x integer number (signed or unsigned) to dump + @tparam NumberType either @a number_integer_t or @a number_unsigned_t + */ + template<typename NumberType, detail::enable_if_t< + std::is_same<NumberType, number_unsigned_t>::value or + std::is_same<NumberType, number_integer_t>::value, + int> = 0> + void dump_integer(NumberType x) + { + static constexpr std::array<std::array<char, 2>, 100> digits_to_99 + { + { + {{'0', '0'}}, {{'0', '1'}}, {{'0', '2'}}, {{'0', '3'}}, {{'0', '4'}}, {{'0', '5'}}, {{'0', '6'}}, {{'0', '7'}}, {{'0', '8'}}, {{'0', '9'}}, + {{'1', '0'}}, {{'1', '1'}}, {{'1', '2'}}, {{'1', '3'}}, {{'1', '4'}}, {{'1', '5'}}, {{'1', '6'}}, {{'1', '7'}}, {{'1', '8'}}, {{'1', '9'}}, + {{'2', '0'}}, {{'2', '1'}}, {{'2', '2'}}, {{'2', '3'}}, {{'2', '4'}}, {{'2', '5'}}, {{'2', '6'}}, {{'2', '7'}}, {{'2', '8'}}, {{'2', '9'}}, + {{'3', '0'}}, {{'3', '1'}}, {{'3', '2'}}, {{'3', '3'}}, {{'3', '4'}}, {{'3', '5'}}, {{'3', '6'}}, {{'3', '7'}}, {{'3', '8'}}, {{'3', '9'}}, + {{'4', '0'}}, {{'4', '1'}}, {{'4', '2'}}, {{'4', '3'}}, {{'4', '4'}}, {{'4', '5'}}, {{'4', '6'}}, {{'4', '7'}}, {{'4', '8'}}, {{'4', '9'}}, + {{'5', '0'}}, {{'5', '1'}}, {{'5', '2'}}, {{'5', '3'}}, {{'5', '4'}}, {{'5', '5'}}, {{'5', '6'}}, {{'5', '7'}}, {{'5', '8'}}, {{'5', '9'}}, + {{'6', '0'}}, {{'6', '1'}}, {{'6', '2'}}, {{'6', '3'}}, {{'6', '4'}}, {{'6', '5'}}, {{'6', '6'}}, {{'6', '7'}}, {{'6', '8'}}, {{'6', '9'}}, + {{'7', '0'}}, {{'7', '1'}}, {{'7', '2'}}, {{'7', '3'}}, {{'7', '4'}}, {{'7', '5'}}, {{'7', '6'}}, {{'7', '7'}}, {{'7', '8'}}, {{'7', '9'}}, + {{'8', '0'}}, {{'8', '1'}}, {{'8', '2'}}, {{'8', '3'}}, {{'8', '4'}}, {{'8', '5'}}, {{'8', '6'}}, {{'8', '7'}}, {{'8', '8'}}, {{'8', '9'}}, + {{'9', '0'}}, {{'9', '1'}}, {{'9', '2'}}, {{'9', '3'}}, {{'9', '4'}}, {{'9', '5'}}, {{'9', '6'}}, {{'9', '7'}}, {{'9', '8'}}, {{'9', '9'}}, + } + }; + + // special case for "0" + if (x == 0) + { + o->write_character('0'); + return; + } + + // use a pointer to fill the buffer + auto buffer_ptr = number_buffer.begin(); + + const bool is_negative = std::is_same<NumberType, number_integer_t>::value and not(x >= 0); // see issue #755 + number_unsigned_t abs_value; + + unsigned int n_chars; + + if (is_negative) + { + *buffer_ptr = '-'; + abs_value = static_cast<number_unsigned_t>(std::abs(static_cast<std::intmax_t>(x))); + + // account one more byte for the minus sign + n_chars = 1 + count_digits(abs_value); + } + else + { + abs_value = static_cast<number_unsigned_t>(x); + n_chars = count_digits(abs_value); + } + + // spare 1 byte for '\0' + assert(n_chars < number_buffer.size() - 1); + + // jump to the end to generate the string from backward + // so we later avoid reversing the result + buffer_ptr += n_chars; + + // Fast int2ascii implementation inspired by "Fastware" talk by Andrei Alexandrescu + // See: https://www.youtube.com/watch?v=o4-CwDo2zpg + while (abs_value >= 100) + { + const auto digits_index = static_cast<unsigned>((abs_value % 100)); + abs_value /= 100; + *(--buffer_ptr) = digits_to_99[digits_index][1]; + *(--buffer_ptr) = digits_to_99[digits_index][0]; + } + + if (abs_value >= 10) + { + const auto digits_index = static_cast<unsigned>(abs_value); + *(--buffer_ptr) = digits_to_99[digits_index][1]; + *(--buffer_ptr) = digits_to_99[digits_index][0]; + } + else + { + *(--buffer_ptr) = static_cast<char>('0' + abs_value); + } + + o->write_characters(number_buffer.data(), n_chars); + } + + /*! + @brief dump a floating-point number + + Dump a given floating-point number to output stream @a o. Works internally + with @a number_buffer. + + @param[in] x floating-point number to dump + */ + void dump_float(number_float_t x) + { + // NaN / inf + if (not std::isfinite(x)) + { + o->write_characters("null", 4); + return; + } + + // If number_float_t is an IEEE-754 single or double precision number, + // use the Grisu2 algorithm to produce short numbers which are + // guaranteed to round-trip, using strtof and strtod, resp. + // + // NB: The test below works if <long double> == <double>. + static constexpr bool is_ieee_single_or_double + = (std::numeric_limits<number_float_t>::is_iec559 and std::numeric_limits<number_float_t>::digits == 24 and std::numeric_limits<number_float_t>::max_exponent == 128) or + (std::numeric_limits<number_float_t>::is_iec559 and std::numeric_limits<number_float_t>::digits == 53 and std::numeric_limits<number_float_t>::max_exponent == 1024); + + dump_float(x, std::integral_constant<bool, is_ieee_single_or_double>()); + } + + void dump_float(number_float_t x, std::true_type /*is_ieee_single_or_double*/) + { + char* begin = number_buffer.data(); + char* end = ::nlohmann::detail::to_chars(begin, begin + number_buffer.size(), x); + + o->write_characters(begin, static_cast<size_t>(end - begin)); + } + + void dump_float(number_float_t x, std::false_type /*is_ieee_single_or_double*/) + { + // get number of digits for a float -> text -> float round-trip + static constexpr auto d = std::numeric_limits<number_float_t>::max_digits10; + + // the actual conversion + std::ptrdiff_t len = (std::snprintf)(number_buffer.data(), number_buffer.size(), "%.*g", d, x); + + // negative value indicates an error + assert(len > 0); + // check if buffer was large enough + assert(static_cast<std::size_t>(len) < number_buffer.size()); + + // erase thousands separator + if (thousands_sep != '\0') + { + const auto end = std::remove(number_buffer.begin(), + number_buffer.begin() + len, thousands_sep); + std::fill(end, number_buffer.end(), '\0'); + assert((end - number_buffer.begin()) <= len); + len = (end - number_buffer.begin()); + } + + // convert decimal point to '.' + if (decimal_point != '\0' and decimal_point != '.') + { + const auto dec_pos = std::find(number_buffer.begin(), number_buffer.end(), decimal_point); + if (dec_pos != number_buffer.end()) + { + *dec_pos = '.'; + } + } + + o->write_characters(number_buffer.data(), static_cast<std::size_t>(len)); + + // determine if need to append ".0" + const bool value_is_int_like = + std::none_of(number_buffer.begin(), number_buffer.begin() + len + 1, + [](char c) + { + return c == '.' or c == 'e'; + }); + + if (value_is_int_like) + { + o->write_characters(".0", 2); + } + } + + /*! + @brief check whether a string is UTF-8 encoded + + The function checks each byte of a string whether it is UTF-8 encoded. The + result of the check is stored in the @a state parameter. The function must + be called initially with state 0 (accept). State 1 means the string must + be rejected, because the current byte is not allowed. If the string is + completely processed, but the state is non-zero, the string ended + prematurely; that is, the last byte indicated more bytes should have + followed. + + @param[in,out] state the state of the decoding + @param[in,out] codep codepoint (valid only if resulting state is UTF8_ACCEPT) + @param[in] byte next byte to decode + @return new state + + @note The function has been edited: a std::array is used. + + @copyright Copyright (c) 2008-2009 Bjoern Hoehrmann <bjoern@hoehrmann.de> + @sa http://bjoern.hoehrmann.de/utf-8/decoder/dfa/ + */ + static std::uint8_t decode(std::uint8_t& state, std::uint32_t& codep, const std::uint8_t byte) noexcept + { + static const std::array<std::uint8_t, 400> utf8d = + { + { + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 00..1F + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 20..3F + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 40..5F + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 60..7F + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, // 80..9F + 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, // A0..BF + 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, // C0..DF + 0xA, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x4, 0x3, 0x3, // E0..EF + 0xB, 0x6, 0x6, 0x6, 0x5, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, // F0..FF + 0x0, 0x1, 0x2, 0x3, 0x5, 0x8, 0x7, 0x1, 0x1, 0x1, 0x4, 0x6, 0x1, 0x1, 0x1, 0x1, // s0..s0 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, // s1..s2 + 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, // s3..s4 + 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 1, 1, 1, // s5..s6 + 1, 3, 1, 1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 // s7..s8 + } + }; + + const std::uint8_t type = utf8d[byte]; + + codep = (state != UTF8_ACCEPT) + ? (byte & 0x3fu) | (codep << 6u) + : (0xFFu >> type) & (byte); + + state = utf8d[256u + state * 16u + type]; + return state; + } + + private: + /// the output of the serializer + output_adapter_t<char> o = nullptr; + + /// a (hopefully) large enough character buffer + std::array<char, 64> number_buffer{{}}; + + /// the locale + const std::lconv* loc = nullptr; + /// the locale's thousand separator character + const char thousands_sep = '\0'; + /// the locale's decimal point character + const char decimal_point = '\0'; + + /// string buffer + std::array<char, 512> string_buffer{{}}; + + /// the indentation character + const char indent_char; + /// the indentation string + string_t indent_string; + + /// error_handler how to react on decoding errors + const error_handler_t error_handler; +}; +} // namespace detail +} // namespace nlohmann + +// #include <nlohmann/detail/value_t.hpp> + +// #include <nlohmann/json_fwd.hpp> + + +/*! +@brief namespace for Niels Lohmann +@see https://github.com/nlohmann +@since version 1.0.0 +*/ +namespace nlohmann +{ + +/*! +@brief a class to store JSON values + +@tparam ObjectType type for JSON objects (`std::map` by default; will be used +in @ref object_t) +@tparam ArrayType type for JSON arrays (`std::vector` by default; will be used +in @ref array_t) +@tparam StringType type for JSON strings and object keys (`std::string` by +default; will be used in @ref string_t) +@tparam BooleanType type for JSON booleans (`bool` by default; will be used +in @ref boolean_t) +@tparam NumberIntegerType type for JSON integer numbers (`int64_t` by +default; will be used in @ref number_integer_t) +@tparam NumberUnsignedType type for JSON unsigned integer numbers (@c +`uint64_t` by default; will be used in @ref number_unsigned_t) +@tparam NumberFloatType type for JSON floating-point numbers (`double` by +default; will be used in @ref number_float_t) +@tparam AllocatorType type of the allocator to use (`std::allocator` by +default) +@tparam JSONSerializer the serializer to resolve internal calls to `to_json()` +and `from_json()` (@ref adl_serializer by default) + +@requirement The class satisfies the following concept requirements: +- Basic + - [DefaultConstructible](https://en.cppreference.com/w/cpp/named_req/DefaultConstructible): + JSON values can be default constructed. The result will be a JSON null + value. + - [MoveConstructible](https://en.cppreference.com/w/cpp/named_req/MoveConstructible): + A JSON value can be constructed from an rvalue argument. + - [CopyConstructible](https://en.cppreference.com/w/cpp/named_req/CopyConstructible): + A JSON value can be copy-constructed from an lvalue expression. + - [MoveAssignable](https://en.cppreference.com/w/cpp/named_req/MoveAssignable): + A JSON value van be assigned from an rvalue argument. + - [CopyAssignable](https://en.cppreference.com/w/cpp/named_req/CopyAssignable): + A JSON value can be copy-assigned from an lvalue expression. + - [Destructible](https://en.cppreference.com/w/cpp/named_req/Destructible): + JSON values can be destructed. +- Layout + - [StandardLayoutType](https://en.cppreference.com/w/cpp/named_req/StandardLayoutType): + JSON values have + [standard layout](https://en.cppreference.com/w/cpp/language/data_members#Standard_layout): + All non-static data members are private and standard layout types, the + class has no virtual functions or (virtual) base classes. +- Library-wide + - [EqualityComparable](https://en.cppreference.com/w/cpp/named_req/EqualityComparable): + JSON values can be compared with `==`, see @ref + operator==(const_reference,const_reference). + - [LessThanComparable](https://en.cppreference.com/w/cpp/named_req/LessThanComparable): + JSON values can be compared with `<`, see @ref + operator<(const_reference,const_reference). + - [Swappable](https://en.cppreference.com/w/cpp/named_req/Swappable): + Any JSON lvalue or rvalue of can be swapped with any lvalue or rvalue of + other compatible types, using unqualified function call @ref swap(). + - [NullablePointer](https://en.cppreference.com/w/cpp/named_req/NullablePointer): + JSON values can be compared against `std::nullptr_t` objects which are used + to model the `null` value. +- Container + - [Container](https://en.cppreference.com/w/cpp/named_req/Container): + JSON values can be used like STL containers and provide iterator access. + - [ReversibleContainer](https://en.cppreference.com/w/cpp/named_req/ReversibleContainer); + JSON values can be used like STL containers and provide reverse iterator + access. + +@invariant The member variables @a m_value and @a m_type have the following +relationship: +- If `m_type == value_t::object`, then `m_value.object != nullptr`. +- If `m_type == value_t::array`, then `m_value.array != nullptr`. +- If `m_type == value_t::string`, then `m_value.string != nullptr`. +The invariants are checked by member function assert_invariant(). + +@internal +@note ObjectType trick from http://stackoverflow.com/a/9860911 +@endinternal + +@see [RFC 7159: The JavaScript Object Notation (JSON) Data Interchange +Format](http://rfc7159.net/rfc7159) + +@since version 1.0.0 + +@nosubgrouping +*/ +NLOHMANN_BASIC_JSON_TPL_DECLARATION +class basic_json +{ + private: + template<detail::value_t> friend struct detail::external_constructor; + friend ::nlohmann::json_pointer<basic_json>; + friend ::nlohmann::detail::parser<basic_json>; + friend ::nlohmann::detail::serializer<basic_json>; + template<typename BasicJsonType> + friend class ::nlohmann::detail::iter_impl; + template<typename BasicJsonType, typename CharType> + friend class ::nlohmann::detail::binary_writer; + template<typename BasicJsonType, typename SAX> + friend class ::nlohmann::detail::binary_reader; + template<typename BasicJsonType> + friend class ::nlohmann::detail::json_sax_dom_parser; + template<typename BasicJsonType> + friend class ::nlohmann::detail::json_sax_dom_callback_parser; + + /// workaround type for MSVC + using basic_json_t = NLOHMANN_BASIC_JSON_TPL; + + // convenience aliases for types residing in namespace detail; + using lexer = ::nlohmann::detail::lexer<basic_json>; + using parser = ::nlohmann::detail::parser<basic_json>; + + using primitive_iterator_t = ::nlohmann::detail::primitive_iterator_t; + template<typename BasicJsonType> + using internal_iterator = ::nlohmann::detail::internal_iterator<BasicJsonType>; + template<typename BasicJsonType> + using iter_impl = ::nlohmann::detail::iter_impl<BasicJsonType>; + template<typename Iterator> + using iteration_proxy = ::nlohmann::detail::iteration_proxy<Iterator>; + template<typename Base> using json_reverse_iterator = ::nlohmann::detail::json_reverse_iterator<Base>; + + template<typename CharType> + using output_adapter_t = ::nlohmann::detail::output_adapter_t<CharType>; + + using binary_reader = ::nlohmann::detail::binary_reader<basic_json>; + template<typename CharType> using binary_writer = ::nlohmann::detail::binary_writer<basic_json, CharType>; + + using serializer = ::nlohmann::detail::serializer<basic_json>; + + public: + using value_t = detail::value_t; + /// JSON Pointer, see @ref nlohmann::json_pointer + using json_pointer = ::nlohmann::json_pointer<basic_json>; + template<typename T, typename SFINAE> + using json_serializer = JSONSerializer<T, SFINAE>; + /// how to treat decoding errors + using error_handler_t = detail::error_handler_t; + /// helper type for initializer lists of basic_json values + using initializer_list_t = std::initializer_list<detail::json_ref<basic_json>>; + + using input_format_t = detail::input_format_t; + /// SAX interface type, see @ref nlohmann::json_sax + using json_sax_t = json_sax<basic_json>; + + //////////////// + // exceptions // + //////////////// + + /// @name exceptions + /// Classes to implement user-defined exceptions. + /// @{ + + /// @copydoc detail::exception + using exception = detail::exception; + /// @copydoc detail::parse_error + using parse_error = detail::parse_error; + /// @copydoc detail::invalid_iterator + using invalid_iterator = detail::invalid_iterator; + /// @copydoc detail::type_error + using type_error = detail::type_error; + /// @copydoc detail::out_of_range + using out_of_range = detail::out_of_range; + /// @copydoc detail::other_error + using other_error = detail::other_error; + + /// @} + + + ///////////////////// + // container types // + ///////////////////// + + /// @name container types + /// The canonic container types to use @ref basic_json like any other STL + /// container. + /// @{ + + /// the type of elements in a basic_json container + using value_type = basic_json; + + /// the type of an element reference + using reference = value_type&; + /// the type of an element const reference + using const_reference = const value_type&; + + /// a type to represent differences between iterators + using difference_type = std::ptrdiff_t; + /// a type to represent container sizes + using size_type = std::size_t; + + /// the allocator type + using allocator_type = AllocatorType<basic_json>; + + /// the type of an element pointer + using pointer = typename std::allocator_traits<allocator_type>::pointer; + /// the type of an element const pointer + using const_pointer = typename std::allocator_traits<allocator_type>::const_pointer; + + /// an iterator for a basic_json container + using iterator = iter_impl<basic_json>; + /// a const iterator for a basic_json container + using const_iterator = iter_impl<const basic_json>; + /// a reverse iterator for a basic_json container + using reverse_iterator = json_reverse_iterator<typename basic_json::iterator>; + /// a const reverse iterator for a basic_json container + using const_reverse_iterator = json_reverse_iterator<typename basic_json::const_iterator>; + + /// @} + + + /*! + @brief returns the allocator associated with the container + */ + static allocator_type get_allocator() + { + return allocator_type(); + } + + /*! + @brief returns version information on the library + + This function returns a JSON object with information about the library, + including the version number and information on the platform and compiler. + + @return JSON object holding version information + key | description + ----------- | --------------- + `compiler` | Information on the used compiler. It is an object with the following keys: `c++` (the used C++ standard), `family` (the compiler family; possible values are `clang`, `icc`, `gcc`, `ilecpp`, `msvc`, `pgcpp`, `sunpro`, and `unknown`), and `version` (the compiler version). + `copyright` | The copyright line for the library as string. + `name` | The name of the library as string. + `platform` | The used platform as string. Possible values are `win32`, `linux`, `apple`, `unix`, and `unknown`. + `url` | The URL of the project as string. + `version` | The version of the library. It is an object with the following keys: `major`, `minor`, and `patch` as defined by [Semantic Versioning](http://semver.org), and `string` (the version string). + + @liveexample{The following code shows an example output of the `meta()` + function.,meta} + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes to any JSON value. + + @complexity Constant. + + @since 2.1.0 + */ + JSON_NODISCARD + static basic_json meta() + { + basic_json result; + + result["copyright"] = "(C) 2013-2017 Niels Lohmann"; + result["name"] = "JSON for Modern C++"; + result["url"] = "https://github.com/nlohmann/json"; + result["version"]["string"] = + std::to_string(NLOHMANN_JSON_VERSION_MAJOR) + "." + + std::to_string(NLOHMANN_JSON_VERSION_MINOR) + "." + + std::to_string(NLOHMANN_JSON_VERSION_PATCH); + result["version"]["major"] = NLOHMANN_JSON_VERSION_MAJOR; + result["version"]["minor"] = NLOHMANN_JSON_VERSION_MINOR; + result["version"]["patch"] = NLOHMANN_JSON_VERSION_PATCH; + +#ifdef _WIN32 + result["platform"] = "win32"; +#elif defined __linux__ + result["platform"] = "linux"; +#elif defined __APPLE__ + result["platform"] = "apple"; +#elif defined __unix__ + result["platform"] = "unix"; +#else + result["platform"] = "unknown"; +#endif + +#if defined(__ICC) || defined(__INTEL_COMPILER) + result["compiler"] = {{"family", "icc"}, {"version", __INTEL_COMPILER}}; +#elif defined(__clang__) + result["compiler"] = {{"family", "clang"}, {"version", __clang_version__}}; +#elif defined(__GNUC__) || defined(__GNUG__) + result["compiler"] = {{"family", "gcc"}, {"version", std::to_string(__GNUC__) + "." + std::to_string(__GNUC_MINOR__) + "." + std::to_string(__GNUC_PATCHLEVEL__)}}; +#elif defined(__HP_cc) || defined(__HP_aCC) + result["compiler"] = "hp" +#elif defined(__IBMCPP__) + result["compiler"] = {{"family", "ilecpp"}, {"version", __IBMCPP__}}; +#elif defined(_MSC_VER) + result["compiler"] = {{"family", "msvc"}, {"version", _MSC_VER}}; +#elif defined(__PGI) + result["compiler"] = {{"family", "pgcpp"}, {"version", __PGI}}; +#elif defined(__SUNPRO_CC) + result["compiler"] = {{"family", "sunpro"}, {"version", __SUNPRO_CC}}; +#else + result["compiler"] = {{"family", "unknown"}, {"version", "unknown"}}; +#endif + +#ifdef __cplusplus + result["compiler"]["c++"] = std::to_string(__cplusplus); +#else + result["compiler"]["c++"] = "unknown"; +#endif + return result; + } + + + /////////////////////////// + // JSON value data types // + /////////////////////////// + + /// @name JSON value data types + /// The data types to store a JSON value. These types are derived from + /// the template arguments passed to class @ref basic_json. + /// @{ + +#if defined(JSON_HAS_CPP_14) + // Use transparent comparator if possible, combined with perfect forwarding + // on find() and count() calls prevents unnecessary string construction. + using object_comparator_t = std::less<>; +#else + using object_comparator_t = std::less<StringType>; +#endif + + /*! + @brief a type for an object + + [RFC 7159](http://rfc7159.net/rfc7159) describes JSON objects as follows: + > An object is an unordered collection of zero or more name/value pairs, + > where a name is a string and a value is a string, number, boolean, null, + > object, or array. + + To store objects in C++, a type is defined by the template parameters + described below. + + @tparam ObjectType the container to store objects (e.g., `std::map` or + `std::unordered_map`) + @tparam StringType the type of the keys or names (e.g., `std::string`). + The comparison function `std::less<StringType>` is used to order elements + inside the container. + @tparam AllocatorType the allocator to use for objects (e.g., + `std::allocator`) + + #### Default type + + With the default values for @a ObjectType (`std::map`), @a StringType + (`std::string`), and @a AllocatorType (`std::allocator`), the default + value for @a object_t is: + + @code {.cpp} + std::map< + std::string, // key_type + basic_json, // value_type + std::less<std::string>, // key_compare + std::allocator<std::pair<const std::string, basic_json>> // allocator_type + > + @endcode + + #### Behavior + + The choice of @a object_t influences the behavior of the JSON class. With + the default type, objects have the following behavior: + + - When all names are unique, objects will be interoperable in the sense + that all software implementations receiving that object will agree on + the name-value mappings. + - When the names within an object are not unique, it is unspecified which + one of the values for a given key will be chosen. For instance, + `{"key": 2, "key": 1}` could be equal to either `{"key": 1}` or + `{"key": 2}`. + - Internally, name/value pairs are stored in lexicographical order of the + names. Objects will also be serialized (see @ref dump) in this order. + For instance, `{"b": 1, "a": 2}` and `{"a": 2, "b": 1}` will be stored + and serialized as `{"a": 2, "b": 1}`. + - When comparing objects, the order of the name/value pairs is irrelevant. + This makes objects interoperable in the sense that they will not be + affected by these differences. For instance, `{"b": 1, "a": 2}` and + `{"a": 2, "b": 1}` will be treated as equal. + + #### Limits + + [RFC 7159](http://rfc7159.net/rfc7159) specifies: + > An implementation may set limits on the maximum depth of nesting. + + In this class, the object's limit of nesting is not explicitly constrained. + However, a maximum depth of nesting may be introduced by the compiler or + runtime environment. A theoretical limit can be queried by calling the + @ref max_size function of a JSON object. + + #### Storage + + Objects are stored as pointers in a @ref basic_json type. That is, for any + access to object values, a pointer of type `object_t*` must be + dereferenced. + + @sa @ref array_t -- type for an array value + + @since version 1.0.0 + + @note The order name/value pairs are added to the object is *not* + preserved by the library. Therefore, iterating an object may return + name/value pairs in a different order than they were originally stored. In + fact, keys will be traversed in alphabetical order as `std::map` with + `std::less` is used by default. Please note this behavior conforms to [RFC + 7159](http://rfc7159.net/rfc7159), because any order implements the + specified "unordered" nature of JSON objects. + */ + using object_t = ObjectType<StringType, + basic_json, + object_comparator_t, + AllocatorType<std::pair<const StringType, + basic_json>>>; + + /*! + @brief a type for an array + + [RFC 7159](http://rfc7159.net/rfc7159) describes JSON arrays as follows: + > An array is an ordered sequence of zero or more values. + + To store objects in C++, a type is defined by the template parameters + explained below. + + @tparam ArrayType container type to store arrays (e.g., `std::vector` or + `std::list`) + @tparam AllocatorType allocator to use for arrays (e.g., `std::allocator`) + + #### Default type + + With the default values for @a ArrayType (`std::vector`) and @a + AllocatorType (`std::allocator`), the default value for @a array_t is: + + @code {.cpp} + std::vector< + basic_json, // value_type + std::allocator<basic_json> // allocator_type + > + @endcode + + #### Limits + + [RFC 7159](http://rfc7159.net/rfc7159) specifies: + > An implementation may set limits on the maximum depth of nesting. + + In this class, the array's limit of nesting is not explicitly constrained. + However, a maximum depth of nesting may be introduced by the compiler or + runtime environment. A theoretical limit can be queried by calling the + @ref max_size function of a JSON array. + + #### Storage + + Arrays are stored as pointers in a @ref basic_json type. That is, for any + access to array values, a pointer of type `array_t*` must be dereferenced. + + @sa @ref object_t -- type for an object value + + @since version 1.0.0 + */ + using array_t = ArrayType<basic_json, AllocatorType<basic_json>>; + + /*! + @brief a type for a string + + [RFC 7159](http://rfc7159.net/rfc7159) describes JSON strings as follows: + > A string is a sequence of zero or more Unicode characters. + + To store objects in C++, a type is defined by the template parameter + described below. Unicode values are split by the JSON class into + byte-sized characters during deserialization. + + @tparam StringType the container to store strings (e.g., `std::string`). + Note this container is used for keys/names in objects, see @ref object_t. + + #### Default type + + With the default values for @a StringType (`std::string`), the default + value for @a string_t is: + + @code {.cpp} + std::string + @endcode + + #### Encoding + + Strings are stored in UTF-8 encoding. Therefore, functions like + `std::string::size()` or `std::string::length()` return the number of + bytes in the string rather than the number of characters or glyphs. + + #### String comparison + + [RFC 7159](http://rfc7159.net/rfc7159) states: + > Software implementations are typically required to test names of object + > members for equality. Implementations that transform the textual + > representation into sequences of Unicode code units and then perform the + > comparison numerically, code unit by code unit, are interoperable in the + > sense that implementations will agree in all cases on equality or + > inequality of two strings. For example, implementations that compare + > strings with escaped characters unconverted may incorrectly find that + > `"a\\b"` and `"a\u005Cb"` are not equal. + + This implementation is interoperable as it does compare strings code unit + by code unit. + + #### Storage + + String values are stored as pointers in a @ref basic_json type. That is, + for any access to string values, a pointer of type `string_t*` must be + dereferenced. + + @since version 1.0.0 + */ + using string_t = StringType; + + /*! + @brief a type for a boolean + + [RFC 7159](http://rfc7159.net/rfc7159) implicitly describes a boolean as a + type which differentiates the two literals `true` and `false`. + + To store objects in C++, a type is defined by the template parameter @a + BooleanType which chooses the type to use. + + #### Default type + + With the default values for @a BooleanType (`bool`), the default value for + @a boolean_t is: + + @code {.cpp} + bool + @endcode + + #### Storage + + Boolean values are stored directly inside a @ref basic_json type. + + @since version 1.0.0 + */ + using boolean_t = BooleanType; + + /*! + @brief a type for a number (integer) + + [RFC 7159](http://rfc7159.net/rfc7159) describes numbers as follows: + > The representation of numbers is similar to that used in most + > programming languages. A number is represented in base 10 using decimal + > digits. It contains an integer component that may be prefixed with an + > optional minus sign, which may be followed by a fraction part and/or an + > exponent part. Leading zeros are not allowed. (...) Numeric values that + > cannot be represented in the grammar below (such as Infinity and NaN) + > are not permitted. + + This description includes both integer and floating-point numbers. + However, C++ allows more precise storage if it is known whether the number + is a signed integer, an unsigned integer or a floating-point number. + Therefore, three different types, @ref number_integer_t, @ref + number_unsigned_t and @ref number_float_t are used. + + To store integer numbers in C++, a type is defined by the template + parameter @a NumberIntegerType which chooses the type to use. + + #### Default type + + With the default values for @a NumberIntegerType (`int64_t`), the default + value for @a number_integer_t is: + + @code {.cpp} + int64_t + @endcode + + #### Default behavior + + - The restrictions about leading zeros is not enforced in C++. Instead, + leading zeros in integer literals lead to an interpretation as octal + number. Internally, the value will be stored as decimal number. For + instance, the C++ integer literal `010` will be serialized to `8`. + During deserialization, leading zeros yield an error. + - Not-a-number (NaN) values will be serialized to `null`. + + #### Limits + + [RFC 7159](http://rfc7159.net/rfc7159) specifies: + > An implementation may set limits on the range and precision of numbers. + + When the default type is used, the maximal integer number that can be + stored is `9223372036854775807` (INT64_MAX) and the minimal integer number + that can be stored is `-9223372036854775808` (INT64_MIN). Integer numbers + that are out of range will yield over/underflow when used in a + constructor. During deserialization, too large or small integer numbers + will be automatically be stored as @ref number_unsigned_t or @ref + number_float_t. + + [RFC 7159](http://rfc7159.net/rfc7159) further states: + > Note that when such software is used, numbers that are integers and are + > in the range \f$[-2^{53}+1, 2^{53}-1]\f$ are interoperable in the sense + > that implementations will agree exactly on their numeric values. + + As this range is a subrange of the exactly supported range [INT64_MIN, + INT64_MAX], this class's integer type is interoperable. + + #### Storage + + Integer number values are stored directly inside a @ref basic_json type. + + @sa @ref number_float_t -- type for number values (floating-point) + + @sa @ref number_unsigned_t -- type for number values (unsigned integer) + + @since version 1.0.0 + */ + using number_integer_t = NumberIntegerType; + + /*! + @brief a type for a number (unsigned) + + [RFC 7159](http://rfc7159.net/rfc7159) describes numbers as follows: + > The representation of numbers is similar to that used in most + > programming languages. A number is represented in base 10 using decimal + > digits. It contains an integer component that may be prefixed with an + > optional minus sign, which may be followed by a fraction part and/or an + > exponent part. Leading zeros are not allowed. (...) Numeric values that + > cannot be represented in the grammar below (such as Infinity and NaN) + > are not permitted. + + This description includes both integer and floating-point numbers. + However, C++ allows more precise storage if it is known whether the number + is a signed integer, an unsigned integer or a floating-point number. + Therefore, three different types, @ref number_integer_t, @ref + number_unsigned_t and @ref number_float_t are used. + + To store unsigned integer numbers in C++, a type is defined by the + template parameter @a NumberUnsignedType which chooses the type to use. + + #### Default type + + With the default values for @a NumberUnsignedType (`uint64_t`), the + default value for @a number_unsigned_t is: + + @code {.cpp} + uint64_t + @endcode + + #### Default behavior + + - The restrictions about leading zeros is not enforced in C++. Instead, + leading zeros in integer literals lead to an interpretation as octal + number. Internally, the value will be stored as decimal number. For + instance, the C++ integer literal `010` will be serialized to `8`. + During deserialization, leading zeros yield an error. + - Not-a-number (NaN) values will be serialized to `null`. + + #### Limits + + [RFC 7159](http://rfc7159.net/rfc7159) specifies: + > An implementation may set limits on the range and precision of numbers. + + When the default type is used, the maximal integer number that can be + stored is `18446744073709551615` (UINT64_MAX) and the minimal integer + number that can be stored is `0`. Integer numbers that are out of range + will yield over/underflow when used in a constructor. During + deserialization, too large or small integer numbers will be automatically + be stored as @ref number_integer_t or @ref number_float_t. + + [RFC 7159](http://rfc7159.net/rfc7159) further states: + > Note that when such software is used, numbers that are integers and are + > in the range \f$[-2^{53}+1, 2^{53}-1]\f$ are interoperable in the sense + > that implementations will agree exactly on their numeric values. + + As this range is a subrange (when considered in conjunction with the + number_integer_t type) of the exactly supported range [0, UINT64_MAX], + this class's integer type is interoperable. + + #### Storage + + Integer number values are stored directly inside a @ref basic_json type. + + @sa @ref number_float_t -- type for number values (floating-point) + @sa @ref number_integer_t -- type for number values (integer) + + @since version 2.0.0 + */ + using number_unsigned_t = NumberUnsignedType; + + /*! + @brief a type for a number (floating-point) + + [RFC 7159](http://rfc7159.net/rfc7159) describes numbers as follows: + > The representation of numbers is similar to that used in most + > programming languages. A number is represented in base 10 using decimal + > digits. It contains an integer component that may be prefixed with an + > optional minus sign, which may be followed by a fraction part and/or an + > exponent part. Leading zeros are not allowed. (...) Numeric values that + > cannot be represented in the grammar below (such as Infinity and NaN) + > are not permitted. + + This description includes both integer and floating-point numbers. + However, C++ allows more precise storage if it is known whether the number + is a signed integer, an unsigned integer or a floating-point number. + Therefore, three different types, @ref number_integer_t, @ref + number_unsigned_t and @ref number_float_t are used. + + To store floating-point numbers in C++, a type is defined by the template + parameter @a NumberFloatType which chooses the type to use. + + #### Default type + + With the default values for @a NumberFloatType (`double`), the default + value for @a number_float_t is: + + @code {.cpp} + double + @endcode + + #### Default behavior + + - The restrictions about leading zeros is not enforced in C++. Instead, + leading zeros in floating-point literals will be ignored. Internally, + the value will be stored as decimal number. For instance, the C++ + floating-point literal `01.2` will be serialized to `1.2`. During + deserialization, leading zeros yield an error. + - Not-a-number (NaN) values will be serialized to `null`. + + #### Limits + + [RFC 7159](http://rfc7159.net/rfc7159) states: + > This specification allows implementations to set limits on the range and + > precision of numbers accepted. Since software that implements IEEE + > 754-2008 binary64 (double precision) numbers is generally available and + > widely used, good interoperability can be achieved by implementations + > that expect no more precision or range than these provide, in the sense + > that implementations will approximate JSON numbers within the expected + > precision. + + This implementation does exactly follow this approach, as it uses double + precision floating-point numbers. Note values smaller than + `-1.79769313486232e+308` and values greater than `1.79769313486232e+308` + will be stored as NaN internally and be serialized to `null`. + + #### Storage + + Floating-point number values are stored directly inside a @ref basic_json + type. + + @sa @ref number_integer_t -- type for number values (integer) + + @sa @ref number_unsigned_t -- type for number values (unsigned integer) + + @since version 1.0.0 + */ + using number_float_t = NumberFloatType; + + /// @} + + private: + + /// helper for exception-safe object creation + template<typename T, typename... Args> + static T* create(Args&& ... args) + { + AllocatorType<T> alloc; + using AllocatorTraits = std::allocator_traits<AllocatorType<T>>; + + auto deleter = [&](T * object) + { + AllocatorTraits::deallocate(alloc, object, 1); + }; + std::unique_ptr<T, decltype(deleter)> object(AllocatorTraits::allocate(alloc, 1), deleter); + AllocatorTraits::construct(alloc, object.get(), std::forward<Args>(args)...); + assert(object != nullptr); + return object.release(); + } + + //////////////////////// + // JSON value storage // + //////////////////////// + + /*! + @brief a JSON value + + The actual storage for a JSON value of the @ref basic_json class. This + union combines the different storage types for the JSON value types + defined in @ref value_t. + + JSON type | value_t type | used type + --------- | --------------- | ------------------------ + object | object | pointer to @ref object_t + array | array | pointer to @ref array_t + string | string | pointer to @ref string_t + boolean | boolean | @ref boolean_t + number | number_integer | @ref number_integer_t + number | number_unsigned | @ref number_unsigned_t + number | number_float | @ref number_float_t + null | null | *no value is stored* + + @note Variable-length types (objects, arrays, and strings) are stored as + pointers. The size of the union should not exceed 64 bits if the default + value types are used. + + @since version 1.0.0 + */ + union json_value + { + /// object (stored with pointer to save storage) + object_t* object; + /// array (stored with pointer to save storage) + array_t* array; + /// string (stored with pointer to save storage) + string_t* string; + /// boolean + boolean_t boolean; + /// number (integer) + number_integer_t number_integer; + /// number (unsigned integer) + number_unsigned_t number_unsigned; + /// number (floating-point) + number_float_t number_float; + + /// default constructor (for null values) + json_value() = default; + /// constructor for booleans + json_value(boolean_t v) noexcept : boolean(v) {} + /// constructor for numbers (integer) + json_value(number_integer_t v) noexcept : number_integer(v) {} + /// constructor for numbers (unsigned) + json_value(number_unsigned_t v) noexcept : number_unsigned(v) {} + /// constructor for numbers (floating-point) + json_value(number_float_t v) noexcept : number_float(v) {} + /// constructor for empty values of a given type + json_value(value_t t) + { + switch (t) + { + case value_t::object: + { + object = create<object_t>(); + break; + } + + case value_t::array: + { + array = create<array_t>(); + break; + } + + case value_t::string: + { + string = create<string_t>(""); + break; + } + + case value_t::boolean: + { + boolean = boolean_t(false); + break; + } + + case value_t::number_integer: + { + number_integer = number_integer_t(0); + break; + } + + case value_t::number_unsigned: + { + number_unsigned = number_unsigned_t(0); + break; + } + + case value_t::number_float: + { + number_float = number_float_t(0.0); + break; + } + + case value_t::null: + { + object = nullptr; // silence warning, see #821 + break; + } + + default: + { + object = nullptr; // silence warning, see #821 + if (JSON_UNLIKELY(t == value_t::null)) + { + JSON_THROW(other_error::create(500, "961c151d2e87f2686a955a9be24d316f1362bf21 3.6.1")); // LCOV_EXCL_LINE + } + break; + } + } + } + + /// constructor for strings + json_value(const string_t& value) + { + string = create<string_t>(value); + } + + /// constructor for rvalue strings + json_value(string_t&& value) + { + string = create<string_t>(std::move(value)); + } + + /// constructor for objects + json_value(const object_t& value) + { + object = create<object_t>(value); + } + + /// constructor for rvalue objects + json_value(object_t&& value) + { + object = create<object_t>(std::move(value)); + } + + /// constructor for arrays + json_value(const array_t& value) + { + array = create<array_t>(value); + } + + /// constructor for rvalue arrays + json_value(array_t&& value) + { + array = create<array_t>(std::move(value)); + } + + void destroy(value_t t) noexcept + { + switch (t) + { + case value_t::object: + { + AllocatorType<object_t> alloc; + std::allocator_traits<decltype(alloc)>::destroy(alloc, object); + std::allocator_traits<decltype(alloc)>::deallocate(alloc, object, 1); + break; + } + + case value_t::array: + { + AllocatorType<array_t> alloc; + std::allocator_traits<decltype(alloc)>::destroy(alloc, array); + std::allocator_traits<decltype(alloc)>::deallocate(alloc, array, 1); + break; + } + + case value_t::string: + { + AllocatorType<string_t> alloc; + std::allocator_traits<decltype(alloc)>::destroy(alloc, string); + std::allocator_traits<decltype(alloc)>::deallocate(alloc, string, 1); + break; + } + + default: + { + break; + } + } + } + }; + + /*! + @brief checks the class invariants + + This function asserts the class invariants. It needs to be called at the + end of every constructor to make sure that created objects respect the + invariant. Furthermore, it has to be called each time the type of a JSON + value is changed, because the invariant expresses a relationship between + @a m_type and @a m_value. + */ + void assert_invariant() const noexcept + { + assert(m_type != value_t::object or m_value.object != nullptr); + assert(m_type != value_t::array or m_value.array != nullptr); + assert(m_type != value_t::string or m_value.string != nullptr); + } + + public: + ////////////////////////// + // JSON parser callback // + ////////////////////////// + + /*! + @brief parser event types + + The parser callback distinguishes the following events: + - `object_start`: the parser read `{` and started to process a JSON object + - `key`: the parser read a key of a value in an object + - `object_end`: the parser read `}` and finished processing a JSON object + - `array_start`: the parser read `[` and started to process a JSON array + - `array_end`: the parser read `]` and finished processing a JSON array + - `value`: the parser finished reading a JSON value + + @image html callback_events.png "Example when certain parse events are triggered" + + @sa @ref parser_callback_t for more information and examples + */ + using parse_event_t = typename parser::parse_event_t; + + /*! + @brief per-element parser callback type + + With a parser callback function, the result of parsing a JSON text can be + influenced. When passed to @ref parse, it is called on certain events + (passed as @ref parse_event_t via parameter @a event) with a set recursion + depth @a depth and context JSON value @a parsed. The return value of the + callback function is a boolean indicating whether the element that emitted + the callback shall be kept or not. + + We distinguish six scenarios (determined by the event type) in which the + callback function can be called. The following table describes the values + of the parameters @a depth, @a event, and @a parsed. + + parameter @a event | description | parameter @a depth | parameter @a parsed + ------------------ | ----------- | ------------------ | ------------------- + parse_event_t::object_start | the parser read `{` and started to process a JSON object | depth of the parent of the JSON object | a JSON value with type discarded + parse_event_t::key | the parser read a key of a value in an object | depth of the currently parsed JSON object | a JSON string containing the key + parse_event_t::object_end | the parser read `}` and finished processing a JSON object | depth of the parent of the JSON object | the parsed JSON object + parse_event_t::array_start | the parser read `[` and started to process a JSON array | depth of the parent of the JSON array | a JSON value with type discarded + parse_event_t::array_end | the parser read `]` and finished processing a JSON array | depth of the parent of the JSON array | the parsed JSON array + parse_event_t::value | the parser finished reading a JSON value | depth of the value | the parsed JSON value + + @image html callback_events.png "Example when certain parse events are triggered" + + Discarding a value (i.e., returning `false`) has different effects + depending on the context in which function was called: + + - Discarded values in structured types are skipped. That is, the parser + will behave as if the discarded value was never read. + - In case a value outside a structured type is skipped, it is replaced + with `null`. This case happens if the top-level element is skipped. + + @param[in] depth the depth of the recursion during parsing + + @param[in] event an event of type parse_event_t indicating the context in + the callback function has been called + + @param[in,out] parsed the current intermediate parse result; note that + writing to this value has no effect for parse_event_t::key events + + @return Whether the JSON value which called the function during parsing + should be kept (`true`) or not (`false`). In the latter case, it is either + skipped completely or replaced by an empty discarded object. + + @sa @ref parse for examples + + @since version 1.0.0 + */ + using parser_callback_t = typename parser::parser_callback_t; + + ////////////////// + // constructors // + ////////////////// + + /// @name constructors and destructors + /// Constructors of class @ref basic_json, copy/move constructor, copy + /// assignment, static functions creating objects, and the destructor. + /// @{ + + /*! + @brief create an empty value with a given type + + Create an empty JSON value with a given type. The value will be default + initialized with an empty value which depends on the type: + + Value type | initial value + ----------- | ------------- + null | `null` + boolean | `false` + string | `""` + number | `0` + object | `{}` + array | `[]` + + @param[in] v the type of the value to create + + @complexity Constant. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes to any JSON value. + + @liveexample{The following code shows the constructor for different @ref + value_t values,basic_json__value_t} + + @sa @ref clear() -- restores the postcondition of this constructor + + @since version 1.0.0 + */ + basic_json(const value_t v) + : m_type(v), m_value(v) + { + assert_invariant(); + } + + /*! + @brief create a null object + + Create a `null` JSON value. It either takes a null pointer as parameter + (explicitly creating `null`) or no parameter (implicitly creating `null`). + The passed null pointer itself is not read -- it is only used to choose + the right constructor. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this constructor never throws + exceptions. + + @liveexample{The following code shows the constructor with and without a + null pointer parameter.,basic_json__nullptr_t} + + @since version 1.0.0 + */ + basic_json(std::nullptr_t = nullptr) noexcept + : basic_json(value_t::null) + { + assert_invariant(); + } + + /*! + @brief create a JSON value + + This is a "catch all" constructor for all compatible JSON types; that is, + types for which a `to_json()` method exists. The constructor forwards the + parameter @a val to that method (to `json_serializer<U>::to_json` method + with `U = uncvref_t<CompatibleType>`, to be exact). + + Template type @a CompatibleType includes, but is not limited to, the + following types: + - **arrays**: @ref array_t and all kinds of compatible containers such as + `std::vector`, `std::deque`, `std::list`, `std::forward_list`, + `std::array`, `std::valarray`, `std::set`, `std::unordered_set`, + `std::multiset`, and `std::unordered_multiset` with a `value_type` from + which a @ref basic_json value can be constructed. + - **objects**: @ref object_t and all kinds of compatible associative + containers such as `std::map`, `std::unordered_map`, `std::multimap`, + and `std::unordered_multimap` with a `key_type` compatible to + @ref string_t and a `value_type` from which a @ref basic_json value can + be constructed. + - **strings**: @ref string_t, string literals, and all compatible string + containers can be used. + - **numbers**: @ref number_integer_t, @ref number_unsigned_t, + @ref number_float_t, and all convertible number types such as `int`, + `size_t`, `int64_t`, `float` or `double` can be used. + - **boolean**: @ref boolean_t / `bool` can be used. + + See the examples below. + + @tparam CompatibleType a type such that: + - @a CompatibleType is not derived from `std::istream`, + - @a CompatibleType is not @ref basic_json (to avoid hijacking copy/move + constructors), + - @a CompatibleType is not a different @ref basic_json type (i.e. with different template arguments) + - @a CompatibleType is not a @ref basic_json nested type (e.g., + @ref json_pointer, @ref iterator, etc ...) + - @ref @ref json_serializer<U> has a + `to_json(basic_json_t&, CompatibleType&&)` method + + @tparam U = `uncvref_t<CompatibleType>` + + @param[in] val the value to be forwarded to the respective constructor + + @complexity Usually linear in the size of the passed @a val, also + depending on the implementation of the called `to_json()` + method. + + @exceptionsafety Depends on the called constructor. For types directly + supported by the library (i.e., all types for which no `to_json()` function + was provided), strong guarantee holds: if an exception is thrown, there are + no changes to any JSON value. + + @liveexample{The following code shows the constructor with several + compatible types.,basic_json__CompatibleType} + + @since version 2.1.0 + */ + template <typename CompatibleType, + typename U = detail::uncvref_t<CompatibleType>, + detail::enable_if_t< + not detail::is_basic_json<U>::value and detail::is_compatible_type<basic_json_t, U>::value, int> = 0> + basic_json(CompatibleType && val) noexcept(noexcept( + JSONSerializer<U>::to_json(std::declval<basic_json_t&>(), + std::forward<CompatibleType>(val)))) + { + JSONSerializer<U>::to_json(*this, std::forward<CompatibleType>(val)); + assert_invariant(); + } + + /*! + @brief create a JSON value from an existing one + + This is a constructor for existing @ref basic_json types. + It does not hijack copy/move constructors, since the parameter has different + template arguments than the current ones. + + The constructor tries to convert the internal @ref m_value of the parameter. + + @tparam BasicJsonType a type such that: + - @a BasicJsonType is a @ref basic_json type. + - @a BasicJsonType has different template arguments than @ref basic_json_t. + + @param[in] val the @ref basic_json value to be converted. + + @complexity Usually linear in the size of the passed @a val, also + depending on the implementation of the called `to_json()` + method. + + @exceptionsafety Depends on the called constructor. For types directly + supported by the library (i.e., all types for which no `to_json()` function + was provided), strong guarantee holds: if an exception is thrown, there are + no changes to any JSON value. + + @since version 3.2.0 + */ + template <typename BasicJsonType, + detail::enable_if_t< + detail::is_basic_json<BasicJsonType>::value and not std::is_same<basic_json, BasicJsonType>::value, int> = 0> + basic_json(const BasicJsonType& val) + { + using other_boolean_t = typename BasicJsonType::boolean_t; + using other_number_float_t = typename BasicJsonType::number_float_t; + using other_number_integer_t = typename BasicJsonType::number_integer_t; + using other_number_unsigned_t = typename BasicJsonType::number_unsigned_t; + using other_string_t = typename BasicJsonType::string_t; + using other_object_t = typename BasicJsonType::object_t; + using other_array_t = typename BasicJsonType::array_t; + + switch (val.type()) + { + case value_t::boolean: + JSONSerializer<other_boolean_t>::to_json(*this, val.template get<other_boolean_t>()); + break; + case value_t::number_float: + JSONSerializer<other_number_float_t>::to_json(*this, val.template get<other_number_float_t>()); + break; + case value_t::number_integer: + JSONSerializer<other_number_integer_t>::to_json(*this, val.template get<other_number_integer_t>()); + break; + case value_t::number_unsigned: + JSONSerializer<other_number_unsigned_t>::to_json(*this, val.template get<other_number_unsigned_t>()); + break; + case value_t::string: + JSONSerializer<other_string_t>::to_json(*this, val.template get_ref<const other_string_t&>()); + break; + case value_t::object: + JSONSerializer<other_object_t>::to_json(*this, val.template get_ref<const other_object_t&>()); + break; + case value_t::array: + JSONSerializer<other_array_t>::to_json(*this, val.template get_ref<const other_array_t&>()); + break; + case value_t::null: + *this = nullptr; + break; + case value_t::discarded: + m_type = value_t::discarded; + break; + default: // LCOV_EXCL_LINE + assert(false); // LCOV_EXCL_LINE + } + assert_invariant(); + } + + /*! + @brief create a container (array or object) from an initializer list + + Creates a JSON value of type array or object from the passed initializer + list @a init. In case @a type_deduction is `true` (default), the type of + the JSON value to be created is deducted from the initializer list @a init + according to the following rules: + + 1. If the list is empty, an empty JSON object value `{}` is created. + 2. If the list consists of pairs whose first element is a string, a JSON + object value is created where the first elements of the pairs are + treated as keys and the second elements are as values. + 3. In all other cases, an array is created. + + The rules aim to create the best fit between a C++ initializer list and + JSON values. The rationale is as follows: + + 1. The empty initializer list is written as `{}` which is exactly an empty + JSON object. + 2. C++ has no way of describing mapped types other than to list a list of + pairs. As JSON requires that keys must be of type string, rule 2 is the + weakest constraint one can pose on initializer lists to interpret them + as an object. + 3. In all other cases, the initializer list could not be interpreted as + JSON object type, so interpreting it as JSON array type is safe. + + With the rules described above, the following JSON values cannot be + expressed by an initializer list: + + - the empty array (`[]`): use @ref array(initializer_list_t) + with an empty initializer list in this case + - arrays whose elements satisfy rule 2: use @ref + array(initializer_list_t) with the same initializer list + in this case + + @note When used without parentheses around an empty initializer list, @ref + basic_json() is called instead of this function, yielding the JSON null + value. + + @param[in] init initializer list with JSON values + + @param[in] type_deduction internal parameter; when set to `true`, the type + of the JSON value is deducted from the initializer list @a init; when set + to `false`, the type provided via @a manual_type is forced. This mode is + used by the functions @ref array(initializer_list_t) and + @ref object(initializer_list_t). + + @param[in] manual_type internal parameter; when @a type_deduction is set + to `false`, the created JSON value will use the provided type (only @ref + value_t::array and @ref value_t::object are valid); when @a type_deduction + is set to `true`, this parameter has no effect + + @throw type_error.301 if @a type_deduction is `false`, @a manual_type is + `value_t::object`, but @a init contains an element which is not a pair + whose first element is a string. In this case, the constructor could not + create an object. If @a type_deduction would have be `true`, an array + would have been created. See @ref object(initializer_list_t) + for an example. + + @complexity Linear in the size of the initializer list @a init. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes to any JSON value. + + @liveexample{The example below shows how JSON values are created from + initializer lists.,basic_json__list_init_t} + + @sa @ref array(initializer_list_t) -- create a JSON array + value from an initializer list + @sa @ref object(initializer_list_t) -- create a JSON object + value from an initializer list + + @since version 1.0.0 + */ + basic_json(initializer_list_t init, + bool type_deduction = true, + value_t manual_type = value_t::array) + { + // check if each element is an array with two elements whose first + // element is a string + bool is_an_object = std::all_of(init.begin(), init.end(), + [](const detail::json_ref<basic_json>& element_ref) + { + return element_ref->is_array() and element_ref->size() == 2 and (*element_ref)[0].is_string(); + }); + + // adjust type if type deduction is not wanted + if (not type_deduction) + { + // if array is wanted, do not create an object though possible + if (manual_type == value_t::array) + { + is_an_object = false; + } + + // if object is wanted but impossible, throw an exception + if (JSON_UNLIKELY(manual_type == value_t::object and not is_an_object)) + { + JSON_THROW(type_error::create(301, "cannot create object from initializer list")); + } + } + + if (is_an_object) + { + // the initializer list is a list of pairs -> create object + m_type = value_t::object; + m_value = value_t::object; + + std::for_each(init.begin(), init.end(), [this](const detail::json_ref<basic_json>& element_ref) + { + auto element = element_ref.moved_or_copied(); + m_value.object->emplace( + std::move(*((*element.m_value.array)[0].m_value.string)), + std::move((*element.m_value.array)[1])); + }); + } + else + { + // the initializer list describes an array -> create array + m_type = value_t::array; + m_value.array = create<array_t>(init.begin(), init.end()); + } + + assert_invariant(); + } + + /*! + @brief explicitly create an array from an initializer list + + Creates a JSON array value from a given initializer list. That is, given a + list of values `a, b, c`, creates the JSON value `[a, b, c]`. If the + initializer list is empty, the empty array `[]` is created. + + @note This function is only needed to express two edge cases that cannot + be realized with the initializer list constructor (@ref + basic_json(initializer_list_t, bool, value_t)). These cases + are: + 1. creating an array whose elements are all pairs whose first element is a + string -- in this case, the initializer list constructor would create an + object, taking the first elements as keys + 2. creating an empty array -- passing the empty initializer list to the + initializer list constructor yields an empty object + + @param[in] init initializer list with JSON values to create an array from + (optional) + + @return JSON array value + + @complexity Linear in the size of @a init. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes to any JSON value. + + @liveexample{The following code shows an example for the `array` + function.,array} + + @sa @ref basic_json(initializer_list_t, bool, value_t) -- + create a JSON value from an initializer list + @sa @ref object(initializer_list_t) -- create a JSON object + value from an initializer list + + @since version 1.0.0 + */ + JSON_NODISCARD + static basic_json array(initializer_list_t init = {}) + { + return basic_json(init, false, value_t::array); + } + + /*! + @brief explicitly create an object from an initializer list + + Creates a JSON object value from a given initializer list. The initializer + lists elements must be pairs, and their first elements must be strings. If + the initializer list is empty, the empty object `{}` is created. + + @note This function is only added for symmetry reasons. In contrast to the + related function @ref array(initializer_list_t), there are + no cases which can only be expressed by this function. That is, any + initializer list @a init can also be passed to the initializer list + constructor @ref basic_json(initializer_list_t, bool, value_t). + + @param[in] init initializer list to create an object from (optional) + + @return JSON object value + + @throw type_error.301 if @a init is not a list of pairs whose first + elements are strings. In this case, no object can be created. When such a + value is passed to @ref basic_json(initializer_list_t, bool, value_t), + an array would have been created from the passed initializer list @a init. + See example below. + + @complexity Linear in the size of @a init. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes to any JSON value. + + @liveexample{The following code shows an example for the `object` + function.,object} + + @sa @ref basic_json(initializer_list_t, bool, value_t) -- + create a JSON value from an initializer list + @sa @ref array(initializer_list_t) -- create a JSON array + value from an initializer list + + @since version 1.0.0 + */ + JSON_NODISCARD + static basic_json object(initializer_list_t init = {}) + { + return basic_json(init, false, value_t::object); + } + + /*! + @brief construct an array with count copies of given value + + Constructs a JSON array value by creating @a cnt copies of a passed value. + In case @a cnt is `0`, an empty array is created. + + @param[in] cnt the number of JSON copies of @a val to create + @param[in] val the JSON value to copy + + @post `std::distance(begin(),end()) == cnt` holds. + + @complexity Linear in @a cnt. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes to any JSON value. + + @liveexample{The following code shows examples for the @ref + basic_json(size_type\, const basic_json&) + constructor.,basic_json__size_type_basic_json} + + @since version 1.0.0 + */ + basic_json(size_type cnt, const basic_json& val) + : m_type(value_t::array) + { + m_value.array = create<array_t>(cnt, val); + assert_invariant(); + } + + /*! + @brief construct a JSON container given an iterator range + + Constructs the JSON value with the contents of the range `[first, last)`. + The semantics depends on the different types a JSON value can have: + - In case of a null type, invalid_iterator.206 is thrown. + - In case of other primitive types (number, boolean, or string), @a first + must be `begin()` and @a last must be `end()`. In this case, the value is + copied. Otherwise, invalid_iterator.204 is thrown. + - In case of structured types (array, object), the constructor behaves as + similar versions for `std::vector` or `std::map`; that is, a JSON array + or object is constructed from the values in the range. + + @tparam InputIT an input iterator type (@ref iterator or @ref + const_iterator) + + @param[in] first begin of the range to copy from (included) + @param[in] last end of the range to copy from (excluded) + + @pre Iterators @a first and @a last must be initialized. **This + precondition is enforced with an assertion (see warning).** If + assertions are switched off, a violation of this precondition yields + undefined behavior. + + @pre Range `[first, last)` is valid. Usually, this precondition cannot be + checked efficiently. Only certain edge cases are detected; see the + description of the exceptions below. A violation of this precondition + yields undefined behavior. + + @warning A precondition is enforced with a runtime assertion that will + result in calling `std::abort` if this precondition is not met. + Assertions can be disabled by defining `NDEBUG` at compile time. + See https://en.cppreference.com/w/cpp/error/assert for more + information. + + @throw invalid_iterator.201 if iterators @a first and @a last are not + compatible (i.e., do not belong to the same JSON value). In this case, + the range `[first, last)` is undefined. + @throw invalid_iterator.204 if iterators @a first and @a last belong to a + primitive type (number, boolean, or string), but @a first does not point + to the first element any more. In this case, the range `[first, last)` is + undefined. See example code below. + @throw invalid_iterator.206 if iterators @a first and @a last belong to a + null value. In this case, the range `[first, last)` is undefined. + + @complexity Linear in distance between @a first and @a last. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes to any JSON value. + + @liveexample{The example below shows several ways to create JSON values by + specifying a subrange with iterators.,basic_json__InputIt_InputIt} + + @since version 1.0.0 + */ + template<class InputIT, typename std::enable_if< + std::is_same<InputIT, typename basic_json_t::iterator>::value or + std::is_same<InputIT, typename basic_json_t::const_iterator>::value, int>::type = 0> + basic_json(InputIT first, InputIT last) + { + assert(first.m_object != nullptr); + assert(last.m_object != nullptr); + + // make sure iterator fits the current value + if (JSON_UNLIKELY(first.m_object != last.m_object)) + { + JSON_THROW(invalid_iterator::create(201, "iterators are not compatible")); + } + + // copy type from first iterator + m_type = first.m_object->m_type; + + // check if iterator range is complete for primitive values + switch (m_type) + { + case value_t::boolean: + case value_t::number_float: + case value_t::number_integer: + case value_t::number_unsigned: + case value_t::string: + { + if (JSON_UNLIKELY(not first.m_it.primitive_iterator.is_begin() + or not last.m_it.primitive_iterator.is_end())) + { + JSON_THROW(invalid_iterator::create(204, "iterators out of range")); + } + break; + } + + default: + break; + } + + switch (m_type) + { + case value_t::number_integer: + { + m_value.number_integer = first.m_object->m_value.number_integer; + break; + } + + case value_t::number_unsigned: + { + m_value.number_unsigned = first.m_object->m_value.number_unsigned; + break; + } + + case value_t::number_float: + { + m_value.number_float = first.m_object->m_value.number_float; + break; + } + + case value_t::boolean: + { + m_value.boolean = first.m_object->m_value.boolean; + break; + } + + case value_t::string: + { + m_value = *first.m_object->m_value.string; + break; + } + + case value_t::object: + { + m_value.object = create<object_t>(first.m_it.object_iterator, + last.m_it.object_iterator); + break; + } + + case value_t::array: + { + m_value.array = create<array_t>(first.m_it.array_iterator, + last.m_it.array_iterator); + break; + } + + default: + JSON_THROW(invalid_iterator::create(206, "cannot construct with iterators from " + + std::string(first.m_object->type_name()))); + } + + assert_invariant(); + } + + + /////////////////////////////////////// + // other constructors and destructor // + /////////////////////////////////////// + + /// @private + basic_json(const detail::json_ref<basic_json>& ref) + : basic_json(ref.moved_or_copied()) + {} + + /*! + @brief copy constructor + + Creates a copy of a given JSON value. + + @param[in] other the JSON value to copy + + @post `*this == other` + + @complexity Linear in the size of @a other. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes to any JSON value. + + @requirement This function helps `basic_json` satisfying the + [Container](https://en.cppreference.com/w/cpp/named_req/Container) + requirements: + - The complexity is linear. + - As postcondition, it holds: `other == basic_json(other)`. + + @liveexample{The following code shows an example for the copy + constructor.,basic_json__basic_json} + + @since version 1.0.0 + */ + basic_json(const basic_json& other) + : m_type(other.m_type) + { + // check of passed value is valid + other.assert_invariant(); + + switch (m_type) + { + case value_t::object: + { + m_value = *other.m_value.object; + break; + } + + case value_t::array: + { + m_value = *other.m_value.array; + break; + } + + case value_t::string: + { + m_value = *other.m_value.string; + break; + } + + case value_t::boolean: + { + m_value = other.m_value.boolean; + break; + } + + case value_t::number_integer: + { + m_value = other.m_value.number_integer; + break; + } + + case value_t::number_unsigned: + { + m_value = other.m_value.number_unsigned; + break; + } + + case value_t::number_float: + { + m_value = other.m_value.number_float; + break; + } + + default: + break; + } + + assert_invariant(); + } + + /*! + @brief move constructor + + Move constructor. Constructs a JSON value with the contents of the given + value @a other using move semantics. It "steals" the resources from @a + other and leaves it as JSON null value. + + @param[in,out] other value to move to this object + + @post `*this` has the same value as @a other before the call. + @post @a other is a JSON null value. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this constructor never throws + exceptions. + + @requirement This function helps `basic_json` satisfying the + [MoveConstructible](https://en.cppreference.com/w/cpp/named_req/MoveConstructible) + requirements. + + @liveexample{The code below shows the move constructor explicitly called + via std::move.,basic_json__moveconstructor} + + @since version 1.0.0 + */ + basic_json(basic_json&& other) noexcept + : m_type(std::move(other.m_type)), + m_value(std::move(other.m_value)) + { + // check that passed value is valid + other.assert_invariant(); + + // invalidate payload + other.m_type = value_t::null; + other.m_value = {}; + + assert_invariant(); + } + + /*! + @brief copy assignment + + Copy assignment operator. Copies a JSON value via the "copy and swap" + strategy: It is expressed in terms of the copy constructor, destructor, + and the `swap()` member function. + + @param[in] other value to copy from + + @complexity Linear. + + @requirement This function helps `basic_json` satisfying the + [Container](https://en.cppreference.com/w/cpp/named_req/Container) + requirements: + - The complexity is linear. + + @liveexample{The code below shows and example for the copy assignment. It + creates a copy of value `a` which is then swapped with `b`. Finally\, the + copy of `a` (which is the null value after the swap) is + destroyed.,basic_json__copyassignment} + + @since version 1.0.0 + */ + basic_json& operator=(basic_json other) noexcept ( + std::is_nothrow_move_constructible<value_t>::value and + std::is_nothrow_move_assignable<value_t>::value and + std::is_nothrow_move_constructible<json_value>::value and + std::is_nothrow_move_assignable<json_value>::value + ) + { + // check that passed value is valid + other.assert_invariant(); + + using std::swap; + swap(m_type, other.m_type); + swap(m_value, other.m_value); + + assert_invariant(); + return *this; + } + + /*! + @brief destructor + + Destroys the JSON value and frees all allocated memory. + + @complexity Linear. + + @requirement This function helps `basic_json` satisfying the + [Container](https://en.cppreference.com/w/cpp/named_req/Container) + requirements: + - The complexity is linear. + - All stored elements are destroyed and all memory is freed. + + @since version 1.0.0 + */ + ~basic_json() noexcept + { + assert_invariant(); + m_value.destroy(m_type); + } + + /// @} + + public: + /////////////////////// + // object inspection // + /////////////////////// + + /// @name object inspection + /// Functions to inspect the type of a JSON value. + /// @{ + + /*! + @brief serialization + + Serialization function for JSON values. The function tries to mimic + Python's `json.dumps()` function, and currently supports its @a indent + and @a ensure_ascii parameters. + + @param[in] indent If indent is nonnegative, then array elements and object + members will be pretty-printed with that indent level. An indent level of + `0` will only insert newlines. `-1` (the default) selects the most compact + representation. + @param[in] indent_char The character to use for indentation if @a indent is + greater than `0`. The default is ` ` (space). + @param[in] ensure_ascii If @a ensure_ascii is true, all non-ASCII characters + in the output are escaped with `\uXXXX` sequences, and the result consists + of ASCII characters only. + @param[in] error_handler how to react on decoding errors; there are three + possible values: `strict` (throws and exception in case a decoding error + occurs; default), `replace` (replace invalid UTF-8 sequences with U+FFFD), + and `ignore` (ignore invalid UTF-8 sequences during serialization). + + @return string containing the serialization of the JSON value + + @throw type_error.316 if a string stored inside the JSON value is not + UTF-8 encoded + + @complexity Linear. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes in the JSON value. + + @liveexample{The following example shows the effect of different @a indent\, + @a indent_char\, and @a ensure_ascii parameters to the result of the + serialization.,dump} + + @see https://docs.python.org/2/library/json.html#json.dump + + @since version 1.0.0; indentation character @a indent_char, option + @a ensure_ascii and exceptions added in version 3.0.0; error + handlers added in version 3.4.0. + */ + string_t dump(const int indent = -1, + const char indent_char = ' ', + const bool ensure_ascii = false, + const error_handler_t error_handler = error_handler_t::strict) const + { + string_t result; + serializer s(detail::output_adapter<char, string_t>(result), indent_char, error_handler); + + if (indent >= 0) + { + s.dump(*this, true, ensure_ascii, static_cast<unsigned int>(indent)); + } + else + { + s.dump(*this, false, ensure_ascii, 0); + } + + return result; + } + + /*! + @brief return the type of the JSON value (explicit) + + Return the type of the JSON value as a value from the @ref value_t + enumeration. + + @return the type of the JSON value + Value type | return value + ------------------------- | ------------------------- + null | value_t::null + boolean | value_t::boolean + string | value_t::string + number (integer) | value_t::number_integer + number (unsigned integer) | value_t::number_unsigned + number (floating-point) | value_t::number_float + object | value_t::object + array | value_t::array + discarded | value_t::discarded + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `type()` for all JSON + types.,type} + + @sa @ref operator value_t() -- return the type of the JSON value (implicit) + @sa @ref type_name() -- return the type as string + + @since version 1.0.0 + */ + constexpr value_t type() const noexcept + { + return m_type; + } + + /*! + @brief return whether type is primitive + + This function returns true if and only if the JSON type is primitive + (string, number, boolean, or null). + + @return `true` if type is primitive (string, number, boolean, or null), + `false` otherwise. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `is_primitive()` for all JSON + types.,is_primitive} + + @sa @ref is_structured() -- returns whether JSON value is structured + @sa @ref is_null() -- returns whether JSON value is `null` + @sa @ref is_string() -- returns whether JSON value is a string + @sa @ref is_boolean() -- returns whether JSON value is a boolean + @sa @ref is_number() -- returns whether JSON value is a number + + @since version 1.0.0 + */ + constexpr bool is_primitive() const noexcept + { + return is_null() or is_string() or is_boolean() or is_number(); + } + + /*! + @brief return whether type is structured + + This function returns true if and only if the JSON type is structured + (array or object). + + @return `true` if type is structured (array or object), `false` otherwise. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `is_structured()` for all JSON + types.,is_structured} + + @sa @ref is_primitive() -- returns whether value is primitive + @sa @ref is_array() -- returns whether value is an array + @sa @ref is_object() -- returns whether value is an object + + @since version 1.0.0 + */ + constexpr bool is_structured() const noexcept + { + return is_array() or is_object(); + } + + /*! + @brief return whether value is null + + This function returns true if and only if the JSON value is null. + + @return `true` if type is null, `false` otherwise. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `is_null()` for all JSON + types.,is_null} + + @since version 1.0.0 + */ + constexpr bool is_null() const noexcept + { + return m_type == value_t::null; + } + + /*! + @brief return whether value is a boolean + + This function returns true if and only if the JSON value is a boolean. + + @return `true` if type is boolean, `false` otherwise. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `is_boolean()` for all JSON + types.,is_boolean} + + @since version 1.0.0 + */ + constexpr bool is_boolean() const noexcept + { + return m_type == value_t::boolean; + } + + /*! + @brief return whether value is a number + + This function returns true if and only if the JSON value is a number. This + includes both integer (signed and unsigned) and floating-point values. + + @return `true` if type is number (regardless whether integer, unsigned + integer or floating-type), `false` otherwise. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `is_number()` for all JSON + types.,is_number} + + @sa @ref is_number_integer() -- check if value is an integer or unsigned + integer number + @sa @ref is_number_unsigned() -- check if value is an unsigned integer + number + @sa @ref is_number_float() -- check if value is a floating-point number + + @since version 1.0.0 + */ + constexpr bool is_number() const noexcept + { + return is_number_integer() or is_number_float(); + } + + /*! + @brief return whether value is an integer number + + This function returns true if and only if the JSON value is a signed or + unsigned integer number. This excludes floating-point values. + + @return `true` if type is an integer or unsigned integer number, `false` + otherwise. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `is_number_integer()` for all + JSON types.,is_number_integer} + + @sa @ref is_number() -- check if value is a number + @sa @ref is_number_unsigned() -- check if value is an unsigned integer + number + @sa @ref is_number_float() -- check if value is a floating-point number + + @since version 1.0.0 + */ + constexpr bool is_number_integer() const noexcept + { + return m_type == value_t::number_integer or m_type == value_t::number_unsigned; + } + + /*! + @brief return whether value is an unsigned integer number + + This function returns true if and only if the JSON value is an unsigned + integer number. This excludes floating-point and signed integer values. + + @return `true` if type is an unsigned integer number, `false` otherwise. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `is_number_unsigned()` for all + JSON types.,is_number_unsigned} + + @sa @ref is_number() -- check if value is a number + @sa @ref is_number_integer() -- check if value is an integer or unsigned + integer number + @sa @ref is_number_float() -- check if value is a floating-point number + + @since version 2.0.0 + */ + constexpr bool is_number_unsigned() const noexcept + { + return m_type == value_t::number_unsigned; + } + + /*! + @brief return whether value is a floating-point number + + This function returns true if and only if the JSON value is a + floating-point number. This excludes signed and unsigned integer values. + + @return `true` if type is a floating-point number, `false` otherwise. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `is_number_float()` for all + JSON types.,is_number_float} + + @sa @ref is_number() -- check if value is number + @sa @ref is_number_integer() -- check if value is an integer number + @sa @ref is_number_unsigned() -- check if value is an unsigned integer + number + + @since version 1.0.0 + */ + constexpr bool is_number_float() const noexcept + { + return m_type == value_t::number_float; + } + + /*! + @brief return whether value is an object + + This function returns true if and only if the JSON value is an object. + + @return `true` if type is object, `false` otherwise. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `is_object()` for all JSON + types.,is_object} + + @since version 1.0.0 + */ + constexpr bool is_object() const noexcept + { + return m_type == value_t::object; + } + + /*! + @brief return whether value is an array + + This function returns true if and only if the JSON value is an array. + + @return `true` if type is array, `false` otherwise. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `is_array()` for all JSON + types.,is_array} + + @since version 1.0.0 + */ + constexpr bool is_array() const noexcept + { + return m_type == value_t::array; + } + + /*! + @brief return whether value is a string + + This function returns true if and only if the JSON value is a string. + + @return `true` if type is string, `false` otherwise. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `is_string()` for all JSON + types.,is_string} + + @since version 1.0.0 + */ + constexpr bool is_string() const noexcept + { + return m_type == value_t::string; + } + + /*! + @brief return whether value is discarded + + This function returns true if and only if the JSON value was discarded + during parsing with a callback function (see @ref parser_callback_t). + + @note This function will always be `false` for JSON values after parsing. + That is, discarded values can only occur during parsing, but will be + removed when inside a structured value or replaced by null in other cases. + + @return `true` if type is discarded, `false` otherwise. + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies `is_discarded()` for all JSON + types.,is_discarded} + + @since version 1.0.0 + */ + constexpr bool is_discarded() const noexcept + { + return m_type == value_t::discarded; + } + + /*! + @brief return the type of the JSON value (implicit) + + Implicitly return the type of the JSON value as a value from the @ref + value_t enumeration. + + @return the type of the JSON value + + @complexity Constant. + + @exceptionsafety No-throw guarantee: this member function never throws + exceptions. + + @liveexample{The following code exemplifies the @ref value_t operator for + all JSON types.,operator__value_t} + + @sa @ref type() -- return the type of the JSON value (explicit) + @sa @ref type_name() -- return the type as string + + @since version 1.0.0 + */ + constexpr operator value_t() const noexcept + { + return m_type; + } + + /// @} + + private: + ////////////////// + // value access // + ////////////////// + + /// get a boolean (explicit) + boolean_t get_impl(boolean_t* /*unused*/) const + { + if (JSON_LIKELY(is_boolean())) + { + return m_value.boolean; + } + + JSON_THROW(type_error::create(302, "type must be boolean, but is " + std::string(type_name()))); + } + + /// get a pointer to the value (object) + object_t* get_impl_ptr(object_t* /*unused*/) noexcept + { + return is_object() ? m_value.object : nullptr; + } + + /// get a pointer to the value (object) + constexpr const object_t* get_impl_ptr(const object_t* /*unused*/) const noexcept + { + return is_object() ? m_value.object : nullptr; + } + + /// get a pointer to the value (array) + array_t* get_impl_ptr(array_t* /*unused*/) noexcept + { + return is_array() ? m_value.array : nullptr; + } + + /// get a pointer to the value (array) + constexpr const array_t* get_impl_ptr(const array_t* /*unused*/) const noexcept + { + return is_array() ? m_value.array : nullptr; + } + + /// get a pointer to the value (string) + string_t* get_impl_ptr(string_t* /*unused*/) noexcept + { + return is_string() ? m_value.string : nullptr; + } + + /// get a pointer to the value (string) + constexpr const string_t* get_impl_ptr(const string_t* /*unused*/) const noexcept + { + return is_string() ? m_value.string : nullptr; + } + + /// get a pointer to the value (boolean) + boolean_t* get_impl_ptr(boolean_t* /*unused*/) noexcept + { + return is_boolean() ? &m_value.boolean : nullptr; + } + + /// get a pointer to the value (boolean) + constexpr const boolean_t* get_impl_ptr(const boolean_t* /*unused*/) const noexcept + { + return is_boolean() ? &m_value.boolean : nullptr; + } + + /// get a pointer to the value (integer number) + number_integer_t* get_impl_ptr(number_integer_t* /*unused*/) noexcept + { + return is_number_integer() ? &m_value.number_integer : nullptr; + } + + /// get a pointer to the value (integer number) + constexpr const number_integer_t* get_impl_ptr(const number_integer_t* /*unused*/) const noexcept + { + return is_number_integer() ? &m_value.number_integer : nullptr; + } + + /// get a pointer to the value (unsigned number) + number_unsigned_t* get_impl_ptr(number_unsigned_t* /*unused*/) noexcept + { + return is_number_unsigned() ? &m_value.number_unsigned : nullptr; + } + + /// get a pointer to the value (unsigned number) + constexpr const number_unsigned_t* get_impl_ptr(const number_unsigned_t* /*unused*/) const noexcept + { + return is_number_unsigned() ? &m_value.number_unsigned : nullptr; + } + + /// get a pointer to the value (floating-point number) + number_float_t* get_impl_ptr(number_float_t* /*unused*/) noexcept + { + return is_number_float() ? &m_value.number_float : nullptr; + } + + /// get a pointer to the value (floating-point number) + constexpr const number_float_t* get_impl_ptr(const number_float_t* /*unused*/) const noexcept + { + return is_number_float() ? &m_value.number_float : nullptr; + } + + /*! + @brief helper function to implement get_ref() + + This function helps to implement get_ref() without code duplication for + const and non-const overloads + + @tparam ThisType will be deduced as `basic_json` or `const basic_json` + + @throw type_error.303 if ReferenceType does not match underlying value + type of the current JSON + */ + template<typename ReferenceType, typename ThisType> + static ReferenceType get_ref_impl(ThisType& obj) + { + // delegate the call to get_ptr<>() + auto ptr = obj.template get_ptr<typename std::add_pointer<ReferenceType>::type>(); + + if (JSON_LIKELY(ptr != nullptr)) + { + return *ptr; + } + + JSON_THROW(type_error::create(303, "incompatible ReferenceType for get_ref, actual type is " + std::string(obj.type_name()))); + } + + public: + /// @name value access + /// Direct access to the stored value of a JSON value. + /// @{ + + /*! + @brief get special-case overload + + This overloads avoids a lot of template boilerplate, it can be seen as the + identity method + + @tparam BasicJsonType == @ref basic_json + + @return a copy of *this + + @complexity Constant. + + @since version 2.1.0 + */ + template<typename BasicJsonType, detail::enable_if_t< + std::is_same<typename std::remove_const<BasicJsonType>::type, basic_json_t>::value, + int> = 0> + basic_json get() const + { + return *this; + } + + /*! + @brief get special-case overload + + This overloads converts the current @ref basic_json in a different + @ref basic_json type + + @tparam BasicJsonType == @ref basic_json + + @return a copy of *this, converted into @tparam BasicJsonType + + @complexity Depending on the implementation of the called `from_json()` + method. + + @since version 3.2.0 + */ + template<typename BasicJsonType, detail::enable_if_t< + not std::is_same<BasicJsonType, basic_json>::value and + detail::is_basic_json<BasicJsonType>::value, int> = 0> + BasicJsonType get() const + { + return *this; + } + + /*! + @brief get a value (explicit) + + Explicit type conversion between the JSON value and a compatible value + which is [CopyConstructible](https://en.cppreference.com/w/cpp/named_req/CopyConstructible) + and [DefaultConstructible](https://en.cppreference.com/w/cpp/named_req/DefaultConstructible). + The value is converted by calling the @ref json_serializer<ValueType> + `from_json()` method. + + The function is equivalent to executing + @code {.cpp} + ValueType ret; + JSONSerializer<ValueType>::from_json(*this, ret); + return ret; + @endcode + + This overloads is chosen if: + - @a ValueType is not @ref basic_json, + - @ref json_serializer<ValueType> has a `from_json()` method of the form + `void from_json(const basic_json&, ValueType&)`, and + - @ref json_serializer<ValueType> does not have a `from_json()` method of + the form `ValueType from_json(const basic_json&)` + + @tparam ValueTypeCV the provided value type + @tparam ValueType the returned value type + + @return copy of the JSON value, converted to @a ValueType + + @throw what @ref json_serializer<ValueType> `from_json()` method throws + + @liveexample{The example below shows several conversions from JSON values + to other types. There a few things to note: (1) Floating-point numbers can + be converted to integers\, (2) A JSON array can be converted to a standard + `std::vector<short>`\, (3) A JSON object can be converted to C++ + associative containers such as `std::unordered_map<std::string\, + json>`.,get__ValueType_const} + + @since version 2.1.0 + */ + template<typename ValueTypeCV, typename ValueType = detail::uncvref_t<ValueTypeCV>, + detail::enable_if_t < + not detail::is_basic_json<ValueType>::value and + detail::has_from_json<basic_json_t, ValueType>::value and + not detail::has_non_default_from_json<basic_json_t, ValueType>::value, + int> = 0> + ValueType get() const noexcept(noexcept( + JSONSerializer<ValueType>::from_json(std::declval<const basic_json_t&>(), std::declval<ValueType&>()))) + { + // we cannot static_assert on ValueTypeCV being non-const, because + // there is support for get<const basic_json_t>(), which is why we + // still need the uncvref + static_assert(not std::is_reference<ValueTypeCV>::value, + "get() cannot be used with reference types, you might want to use get_ref()"); + static_assert(std::is_default_constructible<ValueType>::value, + "types must be DefaultConstructible when used with get()"); + + ValueType ret; + JSONSerializer<ValueType>::from_json(*this, ret); + return ret; + } + + /*! + @brief get a value (explicit); special case + + Explicit type conversion between the JSON value and a compatible value + which is **not** [CopyConstructible](https://en.cppreference.com/w/cpp/named_req/CopyConstructible) + and **not** [DefaultConstructible](https://en.cppreference.com/w/cpp/named_req/DefaultConstructible). + The value is converted by calling the @ref json_serializer<ValueType> + `from_json()` method. + + The function is equivalent to executing + @code {.cpp} + return JSONSerializer<ValueTypeCV>::from_json(*this); + @endcode + + This overloads is chosen if: + - @a ValueType is not @ref basic_json and + - @ref json_serializer<ValueType> has a `from_json()` method of the form + `ValueType from_json(const basic_json&)` + + @note If @ref json_serializer<ValueType> has both overloads of + `from_json()`, this one is chosen. + + @tparam ValueTypeCV the provided value type + @tparam ValueType the returned value type + + @return copy of the JSON value, converted to @a ValueType + + @throw what @ref json_serializer<ValueType> `from_json()` method throws + + @since version 2.1.0 + */ + template<typename ValueTypeCV, typename ValueType = detail::uncvref_t<ValueTypeCV>, + detail::enable_if_t<not std::is_same<basic_json_t, ValueType>::value and + detail::has_non_default_from_json<basic_json_t, ValueType>::value, + int> = 0> + ValueType get() const noexcept(noexcept( + JSONSerializer<ValueTypeCV>::from_json(std::declval<const basic_json_t&>()))) + { + static_assert(not std::is_reference<ValueTypeCV>::value, + "get() cannot be used with reference types, you might want to use get_ref()"); + return JSONSerializer<ValueTypeCV>::from_json(*this); + } + + /*! + @brief get a value (explicit) + + Explicit type conversion between the JSON value and a compatible value. + The value is filled into the input parameter by calling the @ref json_serializer<ValueType> + `from_json()` method. + + The function is equivalent to executing + @code {.cpp} + ValueType v; + JSONSerializer<ValueType>::from_json(*this, v); + @endcode + + This overloads is chosen if: + - @a ValueType is not @ref basic_json, + - @ref json_serializer<ValueType> has a `from_json()` method of the form + `void from_json(const basic_json&, ValueType&)`, and + + @tparam ValueType the input parameter type. + + @return the input parameter, allowing chaining calls. + + @throw what @ref json_serializer<ValueType> `from_json()` method throws + + @liveexample{The example below shows several conversions from JSON values + to other types. There a few things to note: (1) Floating-point numbers can + be converted to integers\, (2) A JSON array can be converted to a standard + `std::vector<short>`\, (3) A JSON object can be converted to C++ + associative containers such as `std::unordered_map<std::string\, + json>`.,get_to} + + @since version 3.3.0 + */ + template<typename ValueType, + detail::enable_if_t < + not detail::is_basic_json<ValueType>::value and + detail::has_from_json<basic_json_t, ValueType>::value, + int> = 0> + ValueType & get_to(ValueType& v) const noexcept(noexcept( + JSONSerializer<ValueType>::from_json(std::declval<const basic_json_t&>(), v))) + { + JSONSerializer<ValueType>::from_json(*this, v); + return v; + } + + + /*! + @brief get a pointer value (implicit) + + Implicit pointer access to the internally stored JSON value. No copies are + made. + + @warning Writing data to the pointee of the result yields an undefined + state. + + @tparam PointerType pointer type; must be a pointer to @ref array_t, @ref + object_t, @ref string_t, @ref boolean_t, @ref number_integer_t, + @ref number_unsigned_t, or @ref number_float_t. Enforced by a static + assertion. + + @return pointer to the internally stored JSON value if the requested + pointer type @a PointerType fits to the JSON value; `nullptr` otherwise + + @complexity Constant. + + @liveexample{The example below shows how pointers to internal values of a + JSON value can be requested. Note that no type conversions are made and a + `nullptr` is returned if the value and the requested pointer type does not + match.,get_ptr} + + @since version 1.0.0 + */ + template<typename PointerType, typename std::enable_if< + std::is_pointer<PointerType>::value, int>::type = 0> + auto get_ptr() noexcept -> decltype(std::declval<basic_json_t&>().get_impl_ptr(std::declval<PointerType>())) + { + // delegate the call to get_impl_ptr<>() + return get_impl_ptr(static_cast<PointerType>(nullptr)); + } + + /*! + @brief get a pointer value (implicit) + @copydoc get_ptr() + */ + template<typename PointerType, typename std::enable_if< + std::is_pointer<PointerType>::value and + std::is_const<typename std::remove_pointer<PointerType>::type>::value, int>::type = 0> + constexpr auto get_ptr() const noexcept -> decltype(std::declval<const basic_json_t&>().get_impl_ptr(std::declval<PointerType>())) + { + // delegate the call to get_impl_ptr<>() const + return get_impl_ptr(static_cast<PointerType>(nullptr)); + } + + /*! + @brief get a pointer value (explicit) + + Explicit pointer access to the internally stored JSON value. No copies are + made. + + @warning The pointer becomes invalid if the underlying JSON object + changes. + + @tparam PointerType pointer type; must be a pointer to @ref array_t, @ref + object_t, @ref string_t, @ref boolean_t, @ref number_integer_t, + @ref number_unsigned_t, or @ref number_float_t. + + @return pointer to the internally stored JSON value if the requested + pointer type @a PointerType fits to the JSON value; `nullptr` otherwise + + @complexity Constant. + + @liveexample{The example below shows how pointers to internal values of a + JSON value can be requested. Note that no type conversions are made and a + `nullptr` is returned if the value and the requested pointer type does not + match.,get__PointerType} + + @sa @ref get_ptr() for explicit pointer-member access + + @since version 1.0.0 + */ + template<typename PointerType, typename std::enable_if< + std::is_pointer<PointerType>::value, int>::type = 0> + auto get() noexcept -> decltype(std::declval<basic_json_t&>().template get_ptr<PointerType>()) + { + // delegate the call to get_ptr + return get_ptr<PointerType>(); + } + + /*! + @brief get a pointer value (explicit) + @copydoc get() + */ + template<typename PointerType, typename std::enable_if< + std::is_pointer<PointerType>::value, int>::type = 0> + constexpr auto get() const noexcept -> decltype(std::declval<const basic_json_t&>().template get_ptr<PointerType>()) + { + // delegate the call to get_ptr + return get_ptr<PointerType>(); + } + + /*! + @brief get a reference value (implicit) + + Implicit reference access to the internally stored JSON value. No copies + are made. + + @warning Writing data to the referee of the result yields an undefined + state. + + @tparam ReferenceType reference type; must be a reference to @ref array_t, + @ref object_t, @ref string_t, @ref boolean_t, @ref number_integer_t, or + @ref number_float_t. Enforced by static assertion. + + @return reference to the internally stored JSON value if the requested + reference type @a ReferenceType fits to the JSON value; throws + type_error.303 otherwise + + @throw type_error.303 in case passed type @a ReferenceType is incompatible + with the stored JSON value; see example below + + @complexity Constant. + + @liveexample{The example shows several calls to `get_ref()`.,get_ref} + + @since version 1.1.0 + */ + template<typename ReferenceType, typename std::enable_if< + std::is_reference<ReferenceType>::value, int>::type = 0> + ReferenceType get_ref() + { + // delegate call to get_ref_impl + return get_ref_impl<ReferenceType>(*this); + } + + /*! + @brief get a reference value (implicit) + @copydoc get_ref() + */ + template<typename ReferenceType, typename std::enable_if< + std::is_reference<ReferenceType>::value and + std::is_const<typename std::remove_reference<ReferenceType>::type>::value, int>::type = 0> + ReferenceType get_ref() const + { + // delegate call to get_ref_impl + return get_ref_impl<ReferenceType>(*this); + } + + /*! + @brief get a value (implicit) + + Implicit type conversion between the JSON value and a compatible value. + The call is realized by calling @ref get() const. + + @tparam ValueType non-pointer type compatible to the JSON value, for + instance `int` for JSON integer numbers, `bool` for JSON booleans, or + `std::vector` types for JSON arrays. The character type of @ref string_t + as well as an initializer list of this type is excluded to avoid + ambiguities as these types implicitly convert to `std::string`. + + @return copy of the JSON value, converted to type @a ValueType + + @throw type_error.302 in case passed type @a ValueType is incompatible + to the JSON value type (e.g., the JSON value is of type boolean, but a + string is requested); see example below + + @complexity Linear in the size of the JSON value. + + @liveexample{The example below shows several conversions from JSON values + to other types. There a few things to note: (1) Floating-point numbers can + be converted to integers\, (2) A JSON array can be converted to a standard + `std::vector<short>`\, (3) A JSON object can be converted to C++ + associative containers such as `std::unordered_map<std::string\, + json>`.,operator__ValueType} + + @since version 1.0.0 + */ + template < typename ValueType, typename std::enable_if < + not std::is_pointer<ValueType>::value and + not std::is_same<ValueType, detail::json_ref<basic_json>>::value and + not std::is_same<ValueType, typename string_t::value_type>::value and + not detail::is_basic_json<ValueType>::value + +#ifndef _MSC_VER // fix for issue #167 operator<< ambiguity under VS2015 + and not std::is_same<ValueType, std::initializer_list<typename string_t::value_type>>::value +#if defined(JSON_HAS_CPP_17) && (defined(__GNUC__) || (defined(_MSC_VER) and _MSC_VER <= 1914)) + and not std::is_same<ValueType, typename std::string_view>::value +#endif +#endif + and detail::is_detected<detail::get_template_function, const basic_json_t&, ValueType>::value + , int >::type = 0 > + operator ValueType() const + { + // delegate the call to get<>() const + return get<ValueType>(); + } + + /// @} + + + //////////////////// + // element access // + //////////////////// + + /// @name element access + /// Access to the JSON value. + /// @{ + + /*! + @brief access specified array element with bounds checking + + Returns a reference to the element at specified location @a idx, with + bounds checking. + + @param[in] idx index of the element to access + + @return reference to the element at index @a idx + + @throw type_error.304 if the JSON value is not an array; in this case, + calling `at` with an index makes no sense. See example below. + @throw out_of_range.401 if the index @a idx is out of range of the array; + that is, `idx >= size()`. See example below. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes in the JSON value. + + @complexity Constant. + + @since version 1.0.0 + + @liveexample{The example below shows how array elements can be read and + written using `at()`. It also demonstrates the different exceptions that + can be thrown.,at__size_type} + */ + reference at(size_type idx) + { + // at only works for arrays + if (JSON_LIKELY(is_array())) + { + JSON_TRY + { + return m_value.array->at(idx); + } + JSON_CATCH (std::out_of_range&) + { + // create better exception explanation + JSON_THROW(out_of_range::create(401, "array index " + std::to_string(idx) + " is out of range")); + } + } + else + { + JSON_THROW(type_error::create(304, "cannot use at() with " + std::string(type_name()))); + } + } + + /*! + @brief access specified array element with bounds checking + + Returns a const reference to the element at specified location @a idx, + with bounds checking. + + @param[in] idx index of the element to access + + @return const reference to the element at index @a idx + + @throw type_error.304 if the JSON value is not an array; in this case, + calling `at` with an index makes no sense. See example below. + @throw out_of_range.401 if the index @a idx is out of range of the array; + that is, `idx >= size()`. See example below. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes in the JSON value. + + @complexity Constant. + + @since version 1.0.0 + + @liveexample{The example below shows how array elements can be read using + `at()`. It also demonstrates the different exceptions that can be thrown., + at__size_type_const} + */ + const_reference at(size_type idx) const + { + // at only works for arrays + if (JSON_LIKELY(is_array())) + { + JSON_TRY + { + return m_value.array->at(idx); + } + JSON_CATCH (std::out_of_range&) + { + // create better exception explanation + JSON_THROW(out_of_range::create(401, "array index " + std::to_string(idx) + " is out of range")); + } + } + else + { + JSON_THROW(type_error::create(304, "cannot use at() with " + std::string(type_name()))); + } + } + + /*! + @brief access specified object element with bounds checking + + Returns a reference to the element at with specified key @a key, with + bounds checking. + + @param[in] key key of the element to access + + @return reference to the element at key @a key + + @throw type_error.304 if the JSON value is not an object; in this case, + calling `at` with a key makes no sense. See example below. + @throw out_of_range.403 if the key @a key is is not stored in the object; + that is, `find(key) == end()`. See example below. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes in the JSON value. + + @complexity Logarithmic in the size of the container. + + @sa @ref operator[](const typename object_t::key_type&) for unchecked + access by reference + @sa @ref value() for access by value with a default value + + @since version 1.0.0 + + @liveexample{The example below shows how object elements can be read and + written using `at()`. It also demonstrates the different exceptions that + can be thrown.,at__object_t_key_type} + */ + reference at(const typename object_t::key_type& key) + { + // at only works for objects + if (JSON_LIKELY(is_object())) + { + JSON_TRY + { + return m_value.object->at(key); + } + JSON_CATCH (std::out_of_range&) + { + // create better exception explanation + JSON_THROW(out_of_range::create(403, "key '" + key + "' not found")); + } + } + else + { + JSON_THROW(type_error::create(304, "cannot use at() with " + std::string(type_name()))); + } + } + + /*! + @brief access specified object element with bounds checking + + Returns a const reference to the element at with specified key @a key, + with bounds checking. + + @param[in] key key of the element to access + + @return const reference to the element at key @a key + + @throw type_error.304 if the JSON value is not an object; in this case, + calling `at` with a key makes no sense. See example below. + @throw out_of_range.403 if the key @a key is is not stored in the object; + that is, `find(key) == end()`. See example below. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes in the JSON value. + + @complexity Logarithmic in the size of the container. + + @sa @ref operator[](const typename object_t::key_type&) for unchecked + access by reference + @sa @ref value() for access by value with a default value + + @since version 1.0.0 + + @liveexample{The example below shows how object elements can be read using + `at()`. It also demonstrates the different exceptions that can be thrown., + at__object_t_key_type_const} + */ + const_reference at(const typename object_t::key_type& key) const + { + // at only works for objects + if (JSON_LIKELY(is_object())) + { + JSON_TRY + { + return m_value.object->at(key); + } + JSON_CATCH (std::out_of_range&) + { + // create better exception explanation + JSON_THROW(out_of_range::create(403, "key '" + key + "' not found")); + } + } + else + { + JSON_THROW(type_error::create(304, "cannot use at() with " + std::string(type_name()))); + } + } + + /*! + @brief access specified array element + + Returns a reference to the element at specified location @a idx. + + @note If @a idx is beyond the range of the array (i.e., `idx >= size()`), + then the array is silently filled up with `null` values to make `idx` a + valid reference to the last stored element. + + @param[in] idx index of the element to access + + @return reference to the element at index @a idx + + @throw type_error.305 if the JSON value is not an array or null; in that + cases, using the [] operator with an index makes no sense. + + @complexity Constant if @a idx is in the range of the array. Otherwise + linear in `idx - size()`. + + @liveexample{The example below shows how array elements can be read and + written using `[]` operator. Note the addition of `null` + values.,operatorarray__size_type} + + @since version 1.0.0 + */ + reference operator[](size_type idx) + { + // implicitly convert null value to an empty array + if (is_null()) + { + m_type = value_t::array; + m_value.array = create<array_t>(); + assert_invariant(); + } + + // operator[] only works for arrays + if (JSON_LIKELY(is_array())) + { + // fill up array with null values if given idx is outside range + if (idx >= m_value.array->size()) + { + m_value.array->insert(m_value.array->end(), + idx - m_value.array->size() + 1, + basic_json()); + } + + return m_value.array->operator[](idx); + } + + JSON_THROW(type_error::create(305, "cannot use operator[] with a numeric argument with " + std::string(type_name()))); + } + + /*! + @brief access specified array element + + Returns a const reference to the element at specified location @a idx. + + @param[in] idx index of the element to access + + @return const reference to the element at index @a idx + + @throw type_error.305 if the JSON value is not an array; in that case, + using the [] operator with an index makes no sense. + + @complexity Constant. + + @liveexample{The example below shows how array elements can be read using + the `[]` operator.,operatorarray__size_type_const} + + @since version 1.0.0 + */ + const_reference operator[](size_type idx) const + { + // const operator[] only works for arrays + if (JSON_LIKELY(is_array())) + { + return m_value.array->operator[](idx); + } + + JSON_THROW(type_error::create(305, "cannot use operator[] with a numeric argument with " + std::string(type_name()))); + } + + /*! + @brief access specified object element + + Returns a reference to the element at with specified key @a key. + + @note If @a key is not found in the object, then it is silently added to + the object and filled with a `null` value to make `key` a valid reference. + In case the value was `null` before, it is converted to an object. + + @param[in] key key of the element to access + + @return reference to the element at key @a key + + @throw type_error.305 if the JSON value is not an object or null; in that + cases, using the [] operator with a key makes no sense. + + @complexity Logarithmic in the size of the container. + + @liveexample{The example below shows how object elements can be read and + written using the `[]` operator.,operatorarray__key_type} + + @sa @ref at(const typename object_t::key_type&) for access by reference + with range checking + @sa @ref value() for access by value with a default value + + @since version 1.0.0 + */ + reference operator[](const typename object_t::key_type& key) + { + // implicitly convert null value to an empty object + if (is_null()) + { + m_type = value_t::object; + m_value.object = create<object_t>(); + assert_invariant(); + } + + // operator[] only works for objects + if (JSON_LIKELY(is_object())) + { + return m_value.object->operator[](key); + } + + JSON_THROW(type_error::create(305, "cannot use operator[] with a string argument with " + std::string(type_name()))); + } + + /*! + @brief read-only access specified object element + + Returns a const reference to the element at with specified key @a key. No + bounds checking is performed. + + @warning If the element with key @a key does not exist, the behavior is + undefined. + + @param[in] key key of the element to access + + @return const reference to the element at key @a key + + @pre The element with key @a key must exist. **This precondition is + enforced with an assertion.** + + @throw type_error.305 if the JSON value is not an object; in that case, + using the [] operator with a key makes no sense. + + @complexity Logarithmic in the size of the container. + + @liveexample{The example below shows how object elements can be read using + the `[]` operator.,operatorarray__key_type_const} + + @sa @ref at(const typename object_t::key_type&) for access by reference + with range checking + @sa @ref value() for access by value with a default value + + @since version 1.0.0 + */ + const_reference operator[](const typename object_t::key_type& key) const + { + // const operator[] only works for objects + if (JSON_LIKELY(is_object())) + { + assert(m_value.object->find(key) != m_value.object->end()); + return m_value.object->find(key)->second; + } + + JSON_THROW(type_error::create(305, "cannot use operator[] with a string argument with " + std::string(type_name()))); + } + + /*! + @brief access specified object element + + Returns a reference to the element at with specified key @a key. + + @note If @a key is not found in the object, then it is silently added to + the object and filled with a `null` value to make `key` a valid reference. + In case the value was `null` before, it is converted to an object. + + @param[in] key key of the element to access + + @return reference to the element at key @a key + + @throw type_error.305 if the JSON value is not an object or null; in that + cases, using the [] operator with a key makes no sense. + + @complexity Logarithmic in the size of the container. + + @liveexample{The example below shows how object elements can be read and + written using the `[]` operator.,operatorarray__key_type} + + @sa @ref at(const typename object_t::key_type&) for access by reference + with range checking + @sa @ref value() for access by value with a default value + + @since version 1.1.0 + */ + template<typename T> + reference operator[](T* key) + { + // implicitly convert null to object + if (is_null()) + { + m_type = value_t::object; + m_value = value_t::object; + assert_invariant(); + } + + // at only works for objects + if (JSON_LIKELY(is_object())) + { + return m_value.object->operator[](key); + } + + JSON_THROW(type_error::create(305, "cannot use operator[] with a string argument with " + std::string(type_name()))); + } + + /*! + @brief read-only access specified object element + + Returns a const reference to the element at with specified key @a key. No + bounds checking is performed. + + @warning If the element with key @a key does not exist, the behavior is + undefined. + + @param[in] key key of the element to access + + @return const reference to the element at key @a key + + @pre The element with key @a key must exist. **This precondition is + enforced with an assertion.** + + @throw type_error.305 if the JSON value is not an object; in that case, + using the [] operator with a key makes no sense. + + @complexity Logarithmic in the size of the container. + + @liveexample{The example below shows how object elements can be read using + the `[]` operator.,operatorarray__key_type_const} + + @sa @ref at(const typename object_t::key_type&) for access by reference + with range checking + @sa @ref value() for access by value with a default value + + @since version 1.1.0 + */ + template<typename T> + const_reference operator[](T* key) const + { + // at only works for objects + if (JSON_LIKELY(is_object())) + { + assert(m_value.object->find(key) != m_value.object->end()); + return m_value.object->find(key)->second; + } + + JSON_THROW(type_error::create(305, "cannot use operator[] with a string argument with " + std::string(type_name()))); + } + + /*! + @brief access specified object element with default value + + Returns either a copy of an object's element at the specified key @a key + or a given default value if no element with key @a key exists. + + The function is basically equivalent to executing + @code {.cpp} + try { + return at(key); + } catch(out_of_range) { + return default_value; + } + @endcode + + @note Unlike @ref at(const typename object_t::key_type&), this function + does not throw if the given key @a key was not found. + + @note Unlike @ref operator[](const typename object_t::key_type& key), this + function does not implicitly add an element to the position defined by @a + key. This function is furthermore also applicable to const objects. + + @param[in] key key of the element to access + @param[in] default_value the value to return if @a key is not found + + @tparam ValueType type compatible to JSON values, for instance `int` for + JSON integer numbers, `bool` for JSON booleans, or `std::vector` types for + JSON arrays. Note the type of the expected value at @a key and the default + value @a default_value must be compatible. + + @return copy of the element at key @a key or @a default_value if @a key + is not found + + @throw type_error.306 if the JSON value is not an object; in that case, + using `value()` with a key makes no sense. + + @complexity Logarithmic in the size of the container. + + @liveexample{The example below shows how object elements can be queried + with a default value.,basic_json__value} + + @sa @ref at(const typename object_t::key_type&) for access by reference + with range checking + @sa @ref operator[](const typename object_t::key_type&) for unchecked + access by reference + + @since version 1.0.0 + */ + template<class ValueType, typename std::enable_if< + std::is_convertible<basic_json_t, ValueType>::value, int>::type = 0> + ValueType value(const typename object_t::key_type& key, const ValueType& default_value) const + { + // at only works for objects + if (JSON_LIKELY(is_object())) + { + // if key is found, return value and given default value otherwise + const auto it = find(key); + if (it != end()) + { + return *it; + } + + return default_value; + } + + JSON_THROW(type_error::create(306, "cannot use value() with " + std::string(type_name()))); + } + + /*! + @brief overload for a default value of type const char* + @copydoc basic_json::value(const typename object_t::key_type&, const ValueType&) const + */ + string_t value(const typename object_t::key_type& key, const char* default_value) const + { + return value(key, string_t(default_value)); + } + + /*! + @brief access specified object element via JSON Pointer with default value + + Returns either a copy of an object's element at the specified key @a key + or a given default value if no element with key @a key exists. + + The function is basically equivalent to executing + @code {.cpp} + try { + return at(ptr); + } catch(out_of_range) { + return default_value; + } + @endcode + + @note Unlike @ref at(const json_pointer&), this function does not throw + if the given key @a key was not found. + + @param[in] ptr a JSON pointer to the element to access + @param[in] default_value the value to return if @a ptr found no value + + @tparam ValueType type compatible to JSON values, for instance `int` for + JSON integer numbers, `bool` for JSON booleans, or `std::vector` types for + JSON arrays. Note the type of the expected value at @a key and the default + value @a default_value must be compatible. + + @return copy of the element at key @a key or @a default_value if @a key + is not found + + @throw type_error.306 if the JSON value is not an object; in that case, + using `value()` with a key makes no sense. + + @complexity Logarithmic in the size of the container. + + @liveexample{The example below shows how object elements can be queried + with a default value.,basic_json__value_ptr} + + @sa @ref operator[](const json_pointer&) for unchecked access by reference + + @since version 2.0.2 + */ + template<class ValueType, typename std::enable_if< + std::is_convertible<basic_json_t, ValueType>::value, int>::type = 0> + ValueType value(const json_pointer& ptr, const ValueType& default_value) const + { + // at only works for objects + if (JSON_LIKELY(is_object())) + { + // if pointer resolves a value, return it or use default value + JSON_TRY + { + return ptr.get_checked(this); + } + JSON_INTERNAL_CATCH (out_of_range&) + { + return default_value; + } + } + + JSON_THROW(type_error::create(306, "cannot use value() with " + std::string(type_name()))); + } + + /*! + @brief overload for a default value of type const char* + @copydoc basic_json::value(const json_pointer&, ValueType) const + */ + string_t value(const json_pointer& ptr, const char* default_value) const + { + return value(ptr, string_t(default_value)); + } + + /*! + @brief access the first element + + Returns a reference to the first element in the container. For a JSON + container `c`, the expression `c.front()` is equivalent to `*c.begin()`. + + @return In case of a structured type (array or object), a reference to the + first element is returned. In case of number, string, or boolean values, a + reference to the value is returned. + + @complexity Constant. + + @pre The JSON value must not be `null` (would throw `std::out_of_range`) + or an empty array or object (undefined behavior, **guarded by + assertions**). + @post The JSON value remains unchanged. + + @throw invalid_iterator.214 when called on `null` value + + @liveexample{The following code shows an example for `front()`.,front} + + @sa @ref back() -- access the last element + + @since version 1.0.0 + */ + reference front() + { + return *begin(); + } + + /*! + @copydoc basic_json::front() + */ + const_reference front() const + { + return *cbegin(); + } + + /*! + @brief access the last element + + Returns a reference to the last element in the container. For a JSON + container `c`, the expression `c.back()` is equivalent to + @code {.cpp} + auto tmp = c.end(); + --tmp; + return *tmp; + @endcode + + @return In case of a structured type (array or object), a reference to the + last element is returned. In case of number, string, or boolean values, a + reference to the value is returned. + + @complexity Constant. + + @pre The JSON value must not be `null` (would throw `std::out_of_range`) + or an empty array or object (undefined behavior, **guarded by + assertions**). + @post The JSON value remains unchanged. + + @throw invalid_iterator.214 when called on a `null` value. See example + below. + + @liveexample{The following code shows an example for `back()`.,back} + + @sa @ref front() -- access the first element + + @since version 1.0.0 + */ + reference back() + { + auto tmp = end(); + --tmp; + return *tmp; + } + + /*! + @copydoc basic_json::back() + */ + const_reference back() const + { + auto tmp = cend(); + --tmp; + return *tmp; + } + + /*! + @brief remove element given an iterator + + Removes the element specified by iterator @a pos. The iterator @a pos must + be valid and dereferenceable. Thus the `end()` iterator (which is valid, + but is not dereferenceable) cannot be used as a value for @a pos. + + If called on a primitive type other than `null`, the resulting JSON value + will be `null`. + + @param[in] pos iterator to the element to remove + @return Iterator following the last removed element. If the iterator @a + pos refers to the last element, the `end()` iterator is returned. + + @tparam IteratorType an @ref iterator or @ref const_iterator + + @post Invalidates iterators and references at or after the point of the + erase, including the `end()` iterator. + + @throw type_error.307 if called on a `null` value; example: `"cannot use + erase() with null"` + @throw invalid_iterator.202 if called on an iterator which does not belong + to the current JSON value; example: `"iterator does not fit current + value"` + @throw invalid_iterator.205 if called on a primitive type with invalid + iterator (i.e., any iterator which is not `begin()`); example: `"iterator + out of range"` + + @complexity The complexity depends on the type: + - objects: amortized constant + - arrays: linear in distance between @a pos and the end of the container + - strings: linear in the length of the string + - other types: constant + + @liveexample{The example shows the result of `erase()` for different JSON + types.,erase__IteratorType} + + @sa @ref erase(IteratorType, IteratorType) -- removes the elements in + the given range + @sa @ref erase(const typename object_t::key_type&) -- removes the element + from an object at the given key + @sa @ref erase(const size_type) -- removes the element from an array at + the given index + + @since version 1.0.0 + */ + template<class IteratorType, typename std::enable_if< + std::is_same<IteratorType, typename basic_json_t::iterator>::value or + std::is_same<IteratorType, typename basic_json_t::const_iterator>::value, int>::type + = 0> + IteratorType erase(IteratorType pos) + { + // make sure iterator fits the current value + if (JSON_UNLIKELY(this != pos.m_object)) + { + JSON_THROW(invalid_iterator::create(202, "iterator does not fit current value")); + } + + IteratorType result = end(); + + switch (m_type) + { + case value_t::boolean: + case value_t::number_float: + case value_t::number_integer: + case value_t::number_unsigned: + case value_t::string: + { + if (JSON_UNLIKELY(not pos.m_it.primitive_iterator.is_begin())) + { + JSON_THROW(invalid_iterator::create(205, "iterator out of range")); + } + + if (is_string()) + { + AllocatorType<string_t> alloc; + std::allocator_traits<decltype(alloc)>::destroy(alloc, m_value.string); + std::allocator_traits<decltype(alloc)>::deallocate(alloc, m_value.string, 1); + m_value.string = nullptr; + } + + m_type = value_t::null; + assert_invariant(); + break; + } + + case value_t::object: + { + result.m_it.object_iterator = m_value.object->erase(pos.m_it.object_iterator); + break; + } + + case value_t::array: + { + result.m_it.array_iterator = m_value.array->erase(pos.m_it.array_iterator); + break; + } + + default: + JSON_THROW(type_error::create(307, "cannot use erase() with " + std::string(type_name()))); + } + + return result; + } + + /*! + @brief remove elements given an iterator range + + Removes the element specified by the range `[first; last)`. The iterator + @a first does not need to be dereferenceable if `first == last`: erasing + an empty range is a no-op. + + If called on a primitive type other than `null`, the resulting JSON value + will be `null`. + + @param[in] first iterator to the beginning of the range to remove + @param[in] last iterator past the end of the range to remove + @return Iterator following the last removed element. If the iterator @a + second refers to the last element, the `end()` iterator is returned. + + @tparam IteratorType an @ref iterator or @ref const_iterator + + @post Invalidates iterators and references at or after the point of the + erase, including the `end()` iterator. + + @throw type_error.307 if called on a `null` value; example: `"cannot use + erase() with null"` + @throw invalid_iterator.203 if called on iterators which does not belong + to the current JSON value; example: `"iterators do not fit current value"` + @throw invalid_iterator.204 if called on a primitive type with invalid + iterators (i.e., if `first != begin()` and `last != end()`); example: + `"iterators out of range"` + + @complexity The complexity depends on the type: + - objects: `log(size()) + std::distance(first, last)` + - arrays: linear in the distance between @a first and @a last, plus linear + in the distance between @a last and end of the container + - strings: linear in the length of the string + - other types: constant + + @liveexample{The example shows the result of `erase()` for different JSON + types.,erase__IteratorType_IteratorType} + + @sa @ref erase(IteratorType) -- removes the element at a given position + @sa @ref erase(const typename object_t::key_type&) -- removes the element + from an object at the given key + @sa @ref erase(const size_type) -- removes the element from an array at + the given index + + @since version 1.0.0 + */ + template<class IteratorType, typename std::enable_if< + std::is_same<IteratorType, typename basic_json_t::iterator>::value or + std::is_same<IteratorType, typename basic_json_t::const_iterator>::value, int>::type + = 0> + IteratorType erase(IteratorType first, IteratorType last) + { + // make sure iterator fits the current value + if (JSON_UNLIKELY(this != first.m_object or this != last.m_object)) + { + JSON_THROW(invalid_iterator::create(203, "iterators do not fit current value")); + } + + IteratorType result = end(); + + switch (m_type) + { + case value_t::boolean: + case value_t::number_float: + case value_t::number_integer: + case value_t::number_unsigned: + case value_t::string: + { + if (JSON_LIKELY(not first.m_it.primitive_iterator.is_begin() + or not last.m_it.primitive_iterator.is_end())) + { + JSON_THROW(invalid_iterator::create(204, "iterators out of range")); + } + + if (is_string()) + { + AllocatorType<string_t> alloc; + std::allocator_traits<decltype(alloc)>::destroy(alloc, m_value.string); + std::allocator_traits<decltype(alloc)>::deallocate(alloc, m_value.string, 1); + m_value.string = nullptr; + } + + m_type = value_t::null; + assert_invariant(); + break; + } + + case value_t::object: + { + result.m_it.object_iterator = m_value.object->erase(first.m_it.object_iterator, + last.m_it.object_iterator); + break; + } + + case value_t::array: + { + result.m_it.array_iterator = m_value.array->erase(first.m_it.array_iterator, + last.m_it.array_iterator); + break; + } + + default: + JSON_THROW(type_error::create(307, "cannot use erase() with " + std::string(type_name()))); + } + + return result; + } + + /*! + @brief remove element from a JSON object given a key + + Removes elements from a JSON object with the key value @a key. + + @param[in] key value of the elements to remove + + @return Number of elements removed. If @a ObjectType is the default + `std::map` type, the return value will always be `0` (@a key was not + found) or `1` (@a key was found). + + @post References and iterators to the erased elements are invalidated. + Other references and iterators are not affected. + + @throw type_error.307 when called on a type other than JSON object; + example: `"cannot use erase() with null"` + + @complexity `log(size()) + count(key)` + + @liveexample{The example shows the effect of `erase()`.,erase__key_type} + + @sa @ref erase(IteratorType) -- removes the element at a given position + @sa @ref erase(IteratorType, IteratorType) -- removes the elements in + the given range + @sa @ref erase(const size_type) -- removes the element from an array at + the given index + + @since version 1.0.0 + */ + size_type erase(const typename object_t::key_type& key) + { + // this erase only works for objects + if (JSON_LIKELY(is_object())) + { + return m_value.object->erase(key); + } + + JSON_THROW(type_error::create(307, "cannot use erase() with " + std::string(type_name()))); + } + + /*! + @brief remove element from a JSON array given an index + + Removes element from a JSON array at the index @a idx. + + @param[in] idx index of the element to remove + + @throw type_error.307 when called on a type other than JSON object; + example: `"cannot use erase() with null"` + @throw out_of_range.401 when `idx >= size()`; example: `"array index 17 + is out of range"` + + @complexity Linear in distance between @a idx and the end of the container. + + @liveexample{The example shows the effect of `erase()`.,erase__size_type} + + @sa @ref erase(IteratorType) -- removes the element at a given position + @sa @ref erase(IteratorType, IteratorType) -- removes the elements in + the given range + @sa @ref erase(const typename object_t::key_type&) -- removes the element + from an object at the given key + + @since version 1.0.0 + */ + void erase(const size_type idx) + { + // this erase only works for arrays + if (JSON_LIKELY(is_array())) + { + if (JSON_UNLIKELY(idx >= size())) + { + JSON_THROW(out_of_range::create(401, "array index " + std::to_string(idx) + " is out of range")); + } + + m_value.array->erase(m_value.array->begin() + static_cast<difference_type>(idx)); + } + else + { + JSON_THROW(type_error::create(307, "cannot use erase() with " + std::string(type_name()))); + } + } + + /// @} + + + //////////// + // lookup // + //////////// + + /// @name lookup + /// @{ + + /*! + @brief find an element in a JSON object + + Finds an element in a JSON object with key equivalent to @a key. If the + element is not found or the JSON value is not an object, end() is + returned. + + @note This method always returns @ref end() when executed on a JSON type + that is not an object. + + @param[in] key key value of the element to search for. + + @return Iterator to an element with key equivalent to @a key. If no such + element is found or the JSON value is not an object, past-the-end (see + @ref end()) iterator is returned. + + @complexity Logarithmic in the size of the JSON object. + + @liveexample{The example shows how `find()` is used.,find__key_type} + + @sa @ref contains(KeyT&&) const -- checks whether a key exists + + @since version 1.0.0 + */ + template<typename KeyT> + iterator find(KeyT&& key) + { + auto result = end(); + + if (is_object()) + { + result.m_it.object_iterator = m_value.object->find(std::forward<KeyT>(key)); + } + + return result; + } + + /*! + @brief find an element in a JSON object + @copydoc find(KeyT&&) + */ + template<typename KeyT> + const_iterator find(KeyT&& key) const + { + auto result = cend(); + + if (is_object()) + { + result.m_it.object_iterator = m_value.object->find(std::forward<KeyT>(key)); + } + + return result; + } + + /*! + @brief returns the number of occurrences of a key in a JSON object + + Returns the number of elements with key @a key. If ObjectType is the + default `std::map` type, the return value will always be `0` (@a key was + not found) or `1` (@a key was found). + + @note This method always returns `0` when executed on a JSON type that is + not an object. + + @param[in] key key value of the element to count + + @return Number of elements with key @a key. If the JSON value is not an + object, the return value will be `0`. + + @complexity Logarithmic in the size of the JSON object. + + @liveexample{The example shows how `count()` is used.,count} + + @since version 1.0.0 + */ + template<typename KeyT> + size_type count(KeyT&& key) const + { + // return 0 for all nonobject types + return is_object() ? m_value.object->count(std::forward<KeyT>(key)) : 0; + } + + /*! + @brief check the existence of an element in a JSON object + + Check whether an element exists in a JSON object with key equivalent to + @a key. If the element is not found or the JSON value is not an object, + false is returned. + + @note This method always returns false when executed on a JSON type + that is not an object. + + @param[in] key key value to check its existence. + + @return true if an element with specified @a key exists. If no such + element with such key is found or the JSON value is not an object, + false is returned. + + @complexity Logarithmic in the size of the JSON object. + + @liveexample{The following code shows an example for `contains()`.,contains} + + @sa @ref find(KeyT&&) -- returns an iterator to an object element + + @since version 3.6.0 + */ + template<typename KeyT> + bool contains(KeyT&& key) const + { + return is_object() and m_value.object->find(std::forward<KeyT>(key)) != m_value.object->end(); + } + + /// @} + + + /////////////// + // iterators // + /////////////// + + /// @name iterators + /// @{ + + /*! + @brief returns an iterator to the first element + + Returns an iterator to the first element. + + @image html range-begin-end.svg "Illustration from cppreference.com" + + @return iterator to the first element + + @complexity Constant. + + @requirement This function helps `basic_json` satisfying the + [Container](https://en.cppreference.com/w/cpp/named_req/Container) + requirements: + - The complexity is constant. + + @liveexample{The following code shows an example for `begin()`.,begin} + + @sa @ref cbegin() -- returns a const iterator to the beginning + @sa @ref end() -- returns an iterator to the end + @sa @ref cend() -- returns a const iterator to the end + + @since version 1.0.0 + */ + iterator begin() noexcept + { + iterator result(this); + result.set_begin(); + return result; + } + + /*! + @copydoc basic_json::cbegin() + */ + const_iterator begin() const noexcept + { + return cbegin(); + } + + /*! + @brief returns a const iterator to the first element + + Returns a const iterator to the first element. + + @image html range-begin-end.svg "Illustration from cppreference.com" + + @return const iterator to the first element + + @complexity Constant. + + @requirement This function helps `basic_json` satisfying the + [Container](https://en.cppreference.com/w/cpp/named_req/Container) + requirements: + - The complexity is constant. + - Has the semantics of `const_cast<const basic_json&>(*this).begin()`. + + @liveexample{The following code shows an example for `cbegin()`.,cbegin} + + @sa @ref begin() -- returns an iterator to the beginning + @sa @ref end() -- returns an iterator to the end + @sa @ref cend() -- returns a const iterator to the end + + @since version 1.0.0 + */ + const_iterator cbegin() const noexcept + { + const_iterator result(this); + result.set_begin(); + return result; + } + + /*! + @brief returns an iterator to one past the last element + + Returns an iterator to one past the last element. + + @image html range-begin-end.svg "Illustration from cppreference.com" + + @return iterator one past the last element + + @complexity Constant. + + @requirement This function helps `basic_json` satisfying the + [Container](https://en.cppreference.com/w/cpp/named_req/Container) + requirements: + - The complexity is constant. + + @liveexample{The following code shows an example for `end()`.,end} + + @sa @ref cend() -- returns a const iterator to the end + @sa @ref begin() -- returns an iterator to the beginning + @sa @ref cbegin() -- returns a const iterator to the beginning + + @since version 1.0.0 + */ + iterator end() noexcept + { + iterator result(this); + result.set_end(); + return result; + } + + /*! + @copydoc basic_json::cend() + */ + const_iterator end() const noexcept + { + return cend(); + } + + /*! + @brief returns a const iterator to one past the last element + + Returns a const iterator to one past the last element. + + @image html range-begin-end.svg "Illustration from cppreference.com" + + @return const iterator one past the last element + + @complexity Constant. + + @requirement This function helps `basic_json` satisfying the + [Container](https://en.cppreference.com/w/cpp/named_req/Container) + requirements: + - The complexity is constant. + - Has the semantics of `const_cast<const basic_json&>(*this).end()`. + + @liveexample{The following code shows an example for `cend()`.,cend} + + @sa @ref end() -- returns an iterator to the end + @sa @ref begin() -- returns an iterator to the beginning + @sa @ref cbegin() -- returns a const iterator to the beginning + + @since version 1.0.0 + */ + const_iterator cend() const noexcept + { + const_iterator result(this); + result.set_end(); + return result; + } + + /*! + @brief returns an iterator to the reverse-beginning + + Returns an iterator to the reverse-beginning; that is, the last element. + + @image html range-rbegin-rend.svg "Illustration from cppreference.com" + + @complexity Constant. + + @requirement This function helps `basic_json` satisfying the + [ReversibleContainer](https://en.cppreference.com/w/cpp/named_req/ReversibleContainer) + requirements: + - The complexity is constant. + - Has the semantics of `reverse_iterator(end())`. + + @liveexample{The following code shows an example for `rbegin()`.,rbegin} + + @sa @ref crbegin() -- returns a const reverse iterator to the beginning + @sa @ref rend() -- returns a reverse iterator to the end + @sa @ref crend() -- returns a const reverse iterator to the end + + @since version 1.0.0 + */ + reverse_iterator rbegin() noexcept + { + return reverse_iterator(end()); + } + + /*! + @copydoc basic_json::crbegin() + */ + const_reverse_iterator rbegin() const noexcept + { + return crbegin(); + } + + /*! + @brief returns an iterator to the reverse-end + + Returns an iterator to the reverse-end; that is, one before the first + element. + + @image html range-rbegin-rend.svg "Illustration from cppreference.com" + + @complexity Constant. + + @requirement This function helps `basic_json` satisfying the + [ReversibleContainer](https://en.cppreference.com/w/cpp/named_req/ReversibleContainer) + requirements: + - The complexity is constant. + - Has the semantics of `reverse_iterator(begin())`. + + @liveexample{The following code shows an example for `rend()`.,rend} + + @sa @ref crend() -- returns a const reverse iterator to the end + @sa @ref rbegin() -- returns a reverse iterator to the beginning + @sa @ref crbegin() -- returns a const reverse iterator to the beginning + + @since version 1.0.0 + */ + reverse_iterator rend() noexcept + { + return reverse_iterator(begin()); + } + + /*! + @copydoc basic_json::crend() + */ + const_reverse_iterator rend() const noexcept + { + return crend(); + } + + /*! + @brief returns a const reverse iterator to the last element + + Returns a const iterator to the reverse-beginning; that is, the last + element. + + @image html range-rbegin-rend.svg "Illustration from cppreference.com" + + @complexity Constant. + + @requirement This function helps `basic_json` satisfying the + [ReversibleContainer](https://en.cppreference.com/w/cpp/named_req/ReversibleContainer) + requirements: + - The complexity is constant. + - Has the semantics of `const_cast<const basic_json&>(*this).rbegin()`. + + @liveexample{The following code shows an example for `crbegin()`.,crbegin} + + @sa @ref rbegin() -- returns a reverse iterator to the beginning + @sa @ref rend() -- returns a reverse iterator to the end + @sa @ref crend() -- returns a const reverse iterator to the end + + @since version 1.0.0 + */ + const_reverse_iterator crbegin() const noexcept + { + return const_reverse_iterator(cend()); + } + + /*! + @brief returns a const reverse iterator to one before the first + + Returns a const reverse iterator to the reverse-end; that is, one before + the first element. + + @image html range-rbegin-rend.svg "Illustration from cppreference.com" + + @complexity Constant. + + @requirement This function helps `basic_json` satisfying the + [ReversibleContainer](https://en.cppreference.com/w/cpp/named_req/ReversibleContainer) + requirements: + - The complexity is constant. + - Has the semantics of `const_cast<const basic_json&>(*this).rend()`. + + @liveexample{The following code shows an example for `crend()`.,crend} + + @sa @ref rend() -- returns a reverse iterator to the end + @sa @ref rbegin() -- returns a reverse iterator to the beginning + @sa @ref crbegin() -- returns a const reverse iterator to the beginning + + @since version 1.0.0 + */ + const_reverse_iterator crend() const noexcept + { + return const_reverse_iterator(cbegin()); + } + + public: + /*! + @brief wrapper to access iterator member functions in range-based for + + This function allows to access @ref iterator::key() and @ref + iterator::value() during range-based for loops. In these loops, a + reference to the JSON values is returned, so there is no access to the + underlying iterator. + + For loop without iterator_wrapper: + + @code{cpp} + for (auto it = j_object.begin(); it != j_object.end(); ++it) + { + std::cout << "key: " << it.key() << ", value:" << it.value() << '\n'; + } + @endcode + + Range-based for loop without iterator proxy: + + @code{cpp} + for (auto it : j_object) + { + // "it" is of type json::reference and has no key() member + std::cout << "value: " << it << '\n'; + } + @endcode + + Range-based for loop with iterator proxy: + + @code{cpp} + for (auto it : json::iterator_wrapper(j_object)) + { + std::cout << "key: " << it.key() << ", value:" << it.value() << '\n'; + } + @endcode + + @note When iterating over an array, `key()` will return the index of the + element as string (see example). + + @param[in] ref reference to a JSON value + @return iteration proxy object wrapping @a ref with an interface to use in + range-based for loops + + @liveexample{The following code shows how the wrapper is used,iterator_wrapper} + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes in the JSON value. + + @complexity Constant. + + @note The name of this function is not yet final and may change in the + future. + + @deprecated This stream operator is deprecated and will be removed in + future 4.0.0 of the library. Please use @ref items() instead; + that is, replace `json::iterator_wrapper(j)` with `j.items()`. + */ + JSON_DEPRECATED + static iteration_proxy<iterator> iterator_wrapper(reference ref) noexcept + { + return ref.items(); + } + + /*! + @copydoc iterator_wrapper(reference) + */ + JSON_DEPRECATED + static iteration_proxy<const_iterator> iterator_wrapper(const_reference ref) noexcept + { + return ref.items(); + } + + /*! + @brief helper to access iterator member functions in range-based for + + This function allows to access @ref iterator::key() and @ref + iterator::value() during range-based for loops. In these loops, a + reference to the JSON values is returned, so there is no access to the + underlying iterator. + + For loop without `items()` function: + + @code{cpp} + for (auto it = j_object.begin(); it != j_object.end(); ++it) + { + std::cout << "key: " << it.key() << ", value:" << it.value() << '\n'; + } + @endcode + + Range-based for loop without `items()` function: + + @code{cpp} + for (auto it : j_object) + { + // "it" is of type json::reference and has no key() member + std::cout << "value: " << it << '\n'; + } + @endcode + + Range-based for loop with `items()` function: + + @code{cpp} + for (auto& el : j_object.items()) + { + std::cout << "key: " << el.key() << ", value:" << el.value() << '\n'; + } + @endcode + + The `items()` function also allows to use + [structured bindings](https://en.cppreference.com/w/cpp/language/structured_binding) + (C++17): + + @code{cpp} + for (auto& [key, val] : j_object.items()) + { + std::cout << "key: " << key << ", value:" << val << '\n'; + } + @endcode + + @note When iterating over an array, `key()` will return the index of the + element as string (see example). For primitive types (e.g., numbers), + `key()` returns an empty string. + + @return iteration proxy object wrapping @a ref with an interface to use in + range-based for loops + + @liveexample{The following code shows how the function is used.,items} + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes in the JSON value. + + @complexity Constant. + + @since version 3.1.0, structured bindings support since 3.5.0. + */ + iteration_proxy<iterator> items() noexcept + { + return iteration_proxy<iterator>(*this); + } + + /*! + @copydoc items() + */ + iteration_proxy<const_iterator> items() const noexcept + { + return iteration_proxy<const_iterator>(*this); + } + + /// @} + + + ////////////// + // capacity // + ////////////// + + /// @name capacity + /// @{ + + /*! + @brief checks whether the container is empty. + + Checks if a JSON value has no elements (i.e. whether its @ref size is `0`). + + @return The return value depends on the different types and is + defined as follows: + Value type | return value + ----------- | ------------- + null | `true` + boolean | `false` + string | `false` + number | `false` + object | result of function `object_t::empty()` + array | result of function `array_t::empty()` + + @liveexample{The following code uses `empty()` to check if a JSON + object contains any elements.,empty} + + @complexity Constant, as long as @ref array_t and @ref object_t satisfy + the Container concept; that is, their `empty()` functions have constant + complexity. + + @iterators No changes. + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + + @note This function does not return whether a string stored as JSON value + is empty - it returns whether the JSON container itself is empty which is + false in the case of a string. + + @requirement This function helps `basic_json` satisfying the + [Container](https://en.cppreference.com/w/cpp/named_req/Container) + requirements: + - The complexity is constant. + - Has the semantics of `begin() == end()`. + + @sa @ref size() -- returns the number of elements + + @since version 1.0.0 + */ + bool empty() const noexcept + { + switch (m_type) + { + case value_t::null: + { + // null values are empty + return true; + } + + case value_t::array: + { + // delegate call to array_t::empty() + return m_value.array->empty(); + } + + case value_t::object: + { + // delegate call to object_t::empty() + return m_value.object->empty(); + } + + default: + { + // all other types are nonempty + return false; + } + } + } + + /*! + @brief returns the number of elements + + Returns the number of elements in a JSON value. + + @return The return value depends on the different types and is + defined as follows: + Value type | return value + ----------- | ------------- + null | `0` + boolean | `1` + string | `1` + number | `1` + object | result of function object_t::size() + array | result of function array_t::size() + + @liveexample{The following code calls `size()` on the different value + types.,size} + + @complexity Constant, as long as @ref array_t and @ref object_t satisfy + the Container concept; that is, their size() functions have constant + complexity. + + @iterators No changes. + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + + @note This function does not return the length of a string stored as JSON + value - it returns the number of elements in the JSON value which is 1 in + the case of a string. + + @requirement This function helps `basic_json` satisfying the + [Container](https://en.cppreference.com/w/cpp/named_req/Container) + requirements: + - The complexity is constant. + - Has the semantics of `std::distance(begin(), end())`. + + @sa @ref empty() -- checks whether the container is empty + @sa @ref max_size() -- returns the maximal number of elements + + @since version 1.0.0 + */ + size_type size() const noexcept + { + switch (m_type) + { + case value_t::null: + { + // null values are empty + return 0; + } + + case value_t::array: + { + // delegate call to array_t::size() + return m_value.array->size(); + } + + case value_t::object: + { + // delegate call to object_t::size() + return m_value.object->size(); + } + + default: + { + // all other types have size 1 + return 1; + } + } + } + + /*! + @brief returns the maximum possible number of elements + + Returns the maximum number of elements a JSON value is able to hold due to + system or library implementation limitations, i.e. `std::distance(begin(), + end())` for the JSON value. + + @return The return value depends on the different types and is + defined as follows: + Value type | return value + ----------- | ------------- + null | `0` (same as `size()`) + boolean | `1` (same as `size()`) + string | `1` (same as `size()`) + number | `1` (same as `size()`) + object | result of function `object_t::max_size()` + array | result of function `array_t::max_size()` + + @liveexample{The following code calls `max_size()` on the different value + types. Note the output is implementation specific.,max_size} + + @complexity Constant, as long as @ref array_t and @ref object_t satisfy + the Container concept; that is, their `max_size()` functions have constant + complexity. + + @iterators No changes. + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + + @requirement This function helps `basic_json` satisfying the + [Container](https://en.cppreference.com/w/cpp/named_req/Container) + requirements: + - The complexity is constant. + - Has the semantics of returning `b.size()` where `b` is the largest + possible JSON value. + + @sa @ref size() -- returns the number of elements + + @since version 1.0.0 + */ + size_type max_size() const noexcept + { + switch (m_type) + { + case value_t::array: + { + // delegate call to array_t::max_size() + return m_value.array->max_size(); + } + + case value_t::object: + { + // delegate call to object_t::max_size() + return m_value.object->max_size(); + } + + default: + { + // all other types have max_size() == size() + return size(); + } + } + } + + /// @} + + + /////////////// + // modifiers // + /////////////// + + /// @name modifiers + /// @{ + + /*! + @brief clears the contents + + Clears the content of a JSON value and resets it to the default value as + if @ref basic_json(value_t) would have been called with the current value + type from @ref type(): + + Value type | initial value + ----------- | ------------- + null | `null` + boolean | `false` + string | `""` + number | `0` + object | `{}` + array | `[]` + + @post Has the same effect as calling + @code {.cpp} + *this = basic_json(type()); + @endcode + + @liveexample{The example below shows the effect of `clear()` to different + JSON types.,clear} + + @complexity Linear in the size of the JSON value. + + @iterators All iterators, pointers and references related to this container + are invalidated. + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + + @sa @ref basic_json(value_t) -- constructor that creates an object with the + same value than calling `clear()` + + @since version 1.0.0 + */ + void clear() noexcept + { + switch (m_type) + { + case value_t::number_integer: + { + m_value.number_integer = 0; + break; + } + + case value_t::number_unsigned: + { + m_value.number_unsigned = 0; + break; + } + + case value_t::number_float: + { + m_value.number_float = 0.0; + break; + } + + case value_t::boolean: + { + m_value.boolean = false; + break; + } + + case value_t::string: + { + m_value.string->clear(); + break; + } + + case value_t::array: + { + m_value.array->clear(); + break; + } + + case value_t::object: + { + m_value.object->clear(); + break; + } + + default: + break; + } + } + + /*! + @brief add an object to an array + + Appends the given element @a val to the end of the JSON value. If the + function is called on a JSON null value, an empty array is created before + appending @a val. + + @param[in] val the value to add to the JSON array + + @throw type_error.308 when called on a type other than JSON array or + null; example: `"cannot use push_back() with number"` + + @complexity Amortized constant. + + @liveexample{The example shows how `push_back()` and `+=` can be used to + add elements to a JSON array. Note how the `null` value was silently + converted to a JSON array.,push_back} + + @since version 1.0.0 + */ + void push_back(basic_json&& val) + { + // push_back only works for null objects or arrays + if (JSON_UNLIKELY(not(is_null() or is_array()))) + { + JSON_THROW(type_error::create(308, "cannot use push_back() with " + std::string(type_name()))); + } + + // transform null object into an array + if (is_null()) + { + m_type = value_t::array; + m_value = value_t::array; + assert_invariant(); + } + + // add element to array (move semantics) + m_value.array->push_back(std::move(val)); + // invalidate object: mark it null so we do not call the destructor + // cppcheck-suppress accessMoved + val.m_type = value_t::null; + } + + /*! + @brief add an object to an array + @copydoc push_back(basic_json&&) + */ + reference operator+=(basic_json&& val) + { + push_back(std::move(val)); + return *this; + } + + /*! + @brief add an object to an array + @copydoc push_back(basic_json&&) + */ + void push_back(const basic_json& val) + { + // push_back only works for null objects or arrays + if (JSON_UNLIKELY(not(is_null() or is_array()))) + { + JSON_THROW(type_error::create(308, "cannot use push_back() with " + std::string(type_name()))); + } + + // transform null object into an array + if (is_null()) + { + m_type = value_t::array; + m_value = value_t::array; + assert_invariant(); + } + + // add element to array + m_value.array->push_back(val); + } + + /*! + @brief add an object to an array + @copydoc push_back(basic_json&&) + */ + reference operator+=(const basic_json& val) + { + push_back(val); + return *this; + } + + /*! + @brief add an object to an object + + Inserts the given element @a val to the JSON object. If the function is + called on a JSON null value, an empty object is created before inserting + @a val. + + @param[in] val the value to add to the JSON object + + @throw type_error.308 when called on a type other than JSON object or + null; example: `"cannot use push_back() with number"` + + @complexity Logarithmic in the size of the container, O(log(`size()`)). + + @liveexample{The example shows how `push_back()` and `+=` can be used to + add elements to a JSON object. Note how the `null` value was silently + converted to a JSON object.,push_back__object_t__value} + + @since version 1.0.0 + */ + void push_back(const typename object_t::value_type& val) + { + // push_back only works for null objects or objects + if (JSON_UNLIKELY(not(is_null() or is_object()))) + { + JSON_THROW(type_error::create(308, "cannot use push_back() with " + std::string(type_name()))); + } + + // transform null object into an object + if (is_null()) + { + m_type = value_t::object; + m_value = value_t::object; + assert_invariant(); + } + + // add element to array + m_value.object->insert(val); + } + + /*! + @brief add an object to an object + @copydoc push_back(const typename object_t::value_type&) + */ + reference operator+=(const typename object_t::value_type& val) + { + push_back(val); + return *this; + } + + /*! + @brief add an object to an object + + This function allows to use `push_back` with an initializer list. In case + + 1. the current value is an object, + 2. the initializer list @a init contains only two elements, and + 3. the first element of @a init is a string, + + @a init is converted into an object element and added using + @ref push_back(const typename object_t::value_type&). Otherwise, @a init + is converted to a JSON value and added using @ref push_back(basic_json&&). + + @param[in] init an initializer list + + @complexity Linear in the size of the initializer list @a init. + + @note This function is required to resolve an ambiguous overload error, + because pairs like `{"key", "value"}` can be both interpreted as + `object_t::value_type` or `std::initializer_list<basic_json>`, see + https://github.com/nlohmann/json/issues/235 for more information. + + @liveexample{The example shows how initializer lists are treated as + objects when possible.,push_back__initializer_list} + */ + void push_back(initializer_list_t init) + { + if (is_object() and init.size() == 2 and (*init.begin())->is_string()) + { + basic_json&& key = init.begin()->moved_or_copied(); + push_back(typename object_t::value_type( + std::move(key.get_ref<string_t&>()), (init.begin() + 1)->moved_or_copied())); + } + else + { + push_back(basic_json(init)); + } + } + + /*! + @brief add an object to an object + @copydoc push_back(initializer_list_t) + */ + reference operator+=(initializer_list_t init) + { + push_back(init); + return *this; + } + + /*! + @brief add an object to an array + + Creates a JSON value from the passed parameters @a args to the end of the + JSON value. If the function is called on a JSON null value, an empty array + is created before appending the value created from @a args. + + @param[in] args arguments to forward to a constructor of @ref basic_json + @tparam Args compatible types to create a @ref basic_json object + + @throw type_error.311 when called on a type other than JSON array or + null; example: `"cannot use emplace_back() with number"` + + @complexity Amortized constant. + + @liveexample{The example shows how `push_back()` can be used to add + elements to a JSON array. Note how the `null` value was silently converted + to a JSON array.,emplace_back} + + @since version 2.0.8 + */ + template<class... Args> + void emplace_back(Args&& ... args) + { + // emplace_back only works for null objects or arrays + if (JSON_UNLIKELY(not(is_null() or is_array()))) + { + JSON_THROW(type_error::create(311, "cannot use emplace_back() with " + std::string(type_name()))); + } + + // transform null object into an array + if (is_null()) + { + m_type = value_t::array; + m_value = value_t::array; + assert_invariant(); + } + + // add element to array (perfect forwarding) + m_value.array->emplace_back(std::forward<Args>(args)...); + } + + /*! + @brief add an object to an object if key does not exist + + Inserts a new element into a JSON object constructed in-place with the + given @a args if there is no element with the key in the container. If the + function is called on a JSON null value, an empty object is created before + appending the value created from @a args. + + @param[in] args arguments to forward to a constructor of @ref basic_json + @tparam Args compatible types to create a @ref basic_json object + + @return a pair consisting of an iterator to the inserted element, or the + already-existing element if no insertion happened, and a bool + denoting whether the insertion took place. + + @throw type_error.311 when called on a type other than JSON object or + null; example: `"cannot use emplace() with number"` + + @complexity Logarithmic in the size of the container, O(log(`size()`)). + + @liveexample{The example shows how `emplace()` can be used to add elements + to a JSON object. Note how the `null` value was silently converted to a + JSON object. Further note how no value is added if there was already one + value stored with the same key.,emplace} + + @since version 2.0.8 + */ + template<class... Args> + std::pair<iterator, bool> emplace(Args&& ... args) + { + // emplace only works for null objects or arrays + if (JSON_UNLIKELY(not(is_null() or is_object()))) + { + JSON_THROW(type_error::create(311, "cannot use emplace() with " + std::string(type_name()))); + } + + // transform null object into an object + if (is_null()) + { + m_type = value_t::object; + m_value = value_t::object; + assert_invariant(); + } + + // add element to array (perfect forwarding) + auto res = m_value.object->emplace(std::forward<Args>(args)...); + // create result iterator and set iterator to the result of emplace + auto it = begin(); + it.m_it.object_iterator = res.first; + + // return pair of iterator and boolean + return {it, res.second}; + } + + /// Helper for insertion of an iterator + /// @note: This uses std::distance to support GCC 4.8, + /// see https://github.com/nlohmann/json/pull/1257 + template<typename... Args> + iterator insert_iterator(const_iterator pos, Args&& ... args) + { + iterator result(this); + assert(m_value.array != nullptr); + + auto insert_pos = std::distance(m_value.array->begin(), pos.m_it.array_iterator); + m_value.array->insert(pos.m_it.array_iterator, std::forward<Args>(args)...); + result.m_it.array_iterator = m_value.array->begin() + insert_pos; + + // This could have been written as: + // result.m_it.array_iterator = m_value.array->insert(pos.m_it.array_iterator, cnt, val); + // but the return value of insert is missing in GCC 4.8, so it is written this way instead. + + return result; + } + + /*! + @brief inserts element + + Inserts element @a val before iterator @a pos. + + @param[in] pos iterator before which the content will be inserted; may be + the end() iterator + @param[in] val element to insert + @return iterator pointing to the inserted @a val. + + @throw type_error.309 if called on JSON values other than arrays; + example: `"cannot use insert() with string"` + @throw invalid_iterator.202 if @a pos is not an iterator of *this; + example: `"iterator does not fit current value"` + + @complexity Constant plus linear in the distance between @a pos and end of + the container. + + @liveexample{The example shows how `insert()` is used.,insert} + + @since version 1.0.0 + */ + iterator insert(const_iterator pos, const basic_json& val) + { + // insert only works for arrays + if (JSON_LIKELY(is_array())) + { + // check if iterator pos fits to this JSON value + if (JSON_UNLIKELY(pos.m_object != this)) + { + JSON_THROW(invalid_iterator::create(202, "iterator does not fit current value")); + } + + // insert to array and return iterator + return insert_iterator(pos, val); + } + + JSON_THROW(type_error::create(309, "cannot use insert() with " + std::string(type_name()))); + } + + /*! + @brief inserts element + @copydoc insert(const_iterator, const basic_json&) + */ + iterator insert(const_iterator pos, basic_json&& val) + { + return insert(pos, val); + } + + /*! + @brief inserts elements + + Inserts @a cnt copies of @a val before iterator @a pos. + + @param[in] pos iterator before which the content will be inserted; may be + the end() iterator + @param[in] cnt number of copies of @a val to insert + @param[in] val element to insert + @return iterator pointing to the first element inserted, or @a pos if + `cnt==0` + + @throw type_error.309 if called on JSON values other than arrays; example: + `"cannot use insert() with string"` + @throw invalid_iterator.202 if @a pos is not an iterator of *this; + example: `"iterator does not fit current value"` + + @complexity Linear in @a cnt plus linear in the distance between @a pos + and end of the container. + + @liveexample{The example shows how `insert()` is used.,insert__count} + + @since version 1.0.0 + */ + iterator insert(const_iterator pos, size_type cnt, const basic_json& val) + { + // insert only works for arrays + if (JSON_LIKELY(is_array())) + { + // check if iterator pos fits to this JSON value + if (JSON_UNLIKELY(pos.m_object != this)) + { + JSON_THROW(invalid_iterator::create(202, "iterator does not fit current value")); + } + + // insert to array and return iterator + return insert_iterator(pos, cnt, val); + } + + JSON_THROW(type_error::create(309, "cannot use insert() with " + std::string(type_name()))); + } + + /*! + @brief inserts elements + + Inserts elements from range `[first, last)` before iterator @a pos. + + @param[in] pos iterator before which the content will be inserted; may be + the end() iterator + @param[in] first begin of the range of elements to insert + @param[in] last end of the range of elements to insert + + @throw type_error.309 if called on JSON values other than arrays; example: + `"cannot use insert() with string"` + @throw invalid_iterator.202 if @a pos is not an iterator of *this; + example: `"iterator does not fit current value"` + @throw invalid_iterator.210 if @a first and @a last do not belong to the + same JSON value; example: `"iterators do not fit"` + @throw invalid_iterator.211 if @a first or @a last are iterators into + container for which insert is called; example: `"passed iterators may not + belong to container"` + + @return iterator pointing to the first element inserted, or @a pos if + `first==last` + + @complexity Linear in `std::distance(first, last)` plus linear in the + distance between @a pos and end of the container. + + @liveexample{The example shows how `insert()` is used.,insert__range} + + @since version 1.0.0 + */ + iterator insert(const_iterator pos, const_iterator first, const_iterator last) + { + // insert only works for arrays + if (JSON_UNLIKELY(not is_array())) + { + JSON_THROW(type_error::create(309, "cannot use insert() with " + std::string(type_name()))); + } + + // check if iterator pos fits to this JSON value + if (JSON_UNLIKELY(pos.m_object != this)) + { + JSON_THROW(invalid_iterator::create(202, "iterator does not fit current value")); + } + + // check if range iterators belong to the same JSON object + if (JSON_UNLIKELY(first.m_object != last.m_object)) + { + JSON_THROW(invalid_iterator::create(210, "iterators do not fit")); + } + + if (JSON_UNLIKELY(first.m_object == this)) + { + JSON_THROW(invalid_iterator::create(211, "passed iterators may not belong to container")); + } + + // insert to array and return iterator + return insert_iterator(pos, first.m_it.array_iterator, last.m_it.array_iterator); + } + + /*! + @brief inserts elements + + Inserts elements from initializer list @a ilist before iterator @a pos. + + @param[in] pos iterator before which the content will be inserted; may be + the end() iterator + @param[in] ilist initializer list to insert the values from + + @throw type_error.309 if called on JSON values other than arrays; example: + `"cannot use insert() with string"` + @throw invalid_iterator.202 if @a pos is not an iterator of *this; + example: `"iterator does not fit current value"` + + @return iterator pointing to the first element inserted, or @a pos if + `ilist` is empty + + @complexity Linear in `ilist.size()` plus linear in the distance between + @a pos and end of the container. + + @liveexample{The example shows how `insert()` is used.,insert__ilist} + + @since version 1.0.0 + */ + iterator insert(const_iterator pos, initializer_list_t ilist) + { + // insert only works for arrays + if (JSON_UNLIKELY(not is_array())) + { + JSON_THROW(type_error::create(309, "cannot use insert() with " + std::string(type_name()))); + } + + // check if iterator pos fits to this JSON value + if (JSON_UNLIKELY(pos.m_object != this)) + { + JSON_THROW(invalid_iterator::create(202, "iterator does not fit current value")); + } + + // insert to array and return iterator + return insert_iterator(pos, ilist.begin(), ilist.end()); + } + + /*! + @brief inserts elements + + Inserts elements from range `[first, last)`. + + @param[in] first begin of the range of elements to insert + @param[in] last end of the range of elements to insert + + @throw type_error.309 if called on JSON values other than objects; example: + `"cannot use insert() with string"` + @throw invalid_iterator.202 if iterator @a first or @a last does does not + point to an object; example: `"iterators first and last must point to + objects"` + @throw invalid_iterator.210 if @a first and @a last do not belong to the + same JSON value; example: `"iterators do not fit"` + + @complexity Logarithmic: `O(N*log(size() + N))`, where `N` is the number + of elements to insert. + + @liveexample{The example shows how `insert()` is used.,insert__range_object} + + @since version 3.0.0 + */ + void insert(const_iterator first, const_iterator last) + { + // insert only works for objects + if (JSON_UNLIKELY(not is_object())) + { + JSON_THROW(type_error::create(309, "cannot use insert() with " + std::string(type_name()))); + } + + // check if range iterators belong to the same JSON object + if (JSON_UNLIKELY(first.m_object != last.m_object)) + { + JSON_THROW(invalid_iterator::create(210, "iterators do not fit")); + } + + // passed iterators must belong to objects + if (JSON_UNLIKELY(not first.m_object->is_object())) + { + JSON_THROW(invalid_iterator::create(202, "iterators first and last must point to objects")); + } + + m_value.object->insert(first.m_it.object_iterator, last.m_it.object_iterator); + } + + /*! + @brief updates a JSON object from another object, overwriting existing keys + + Inserts all values from JSON object @a j and overwrites existing keys. + + @param[in] j JSON object to read values from + + @throw type_error.312 if called on JSON values other than objects; example: + `"cannot use update() with string"` + + @complexity O(N*log(size() + N)), where N is the number of elements to + insert. + + @liveexample{The example shows how `update()` is used.,update} + + @sa https://docs.python.org/3.6/library/stdtypes.html#dict.update + + @since version 3.0.0 + */ + void update(const_reference j) + { + // implicitly convert null value to an empty object + if (is_null()) + { + m_type = value_t::object; + m_value.object = create<object_t>(); + assert_invariant(); + } + + if (JSON_UNLIKELY(not is_object())) + { + JSON_THROW(type_error::create(312, "cannot use update() with " + std::string(type_name()))); + } + if (JSON_UNLIKELY(not j.is_object())) + { + JSON_THROW(type_error::create(312, "cannot use update() with " + std::string(j.type_name()))); + } + + for (auto it = j.cbegin(); it != j.cend(); ++it) + { + m_value.object->operator[](it.key()) = it.value(); + } + } + + /*! + @brief updates a JSON object from another object, overwriting existing keys + + Inserts all values from from range `[first, last)` and overwrites existing + keys. + + @param[in] first begin of the range of elements to insert + @param[in] last end of the range of elements to insert + + @throw type_error.312 if called on JSON values other than objects; example: + `"cannot use update() with string"` + @throw invalid_iterator.202 if iterator @a first or @a last does does not + point to an object; example: `"iterators first and last must point to + objects"` + @throw invalid_iterator.210 if @a first and @a last do not belong to the + same JSON value; example: `"iterators do not fit"` + + @complexity O(N*log(size() + N)), where N is the number of elements to + insert. + + @liveexample{The example shows how `update()` is used__range.,update} + + @sa https://docs.python.org/3.6/library/stdtypes.html#dict.update + + @since version 3.0.0 + */ + void update(const_iterator first, const_iterator last) + { + // implicitly convert null value to an empty object + if (is_null()) + { + m_type = value_t::object; + m_value.object = create<object_t>(); + assert_invariant(); + } + + if (JSON_UNLIKELY(not is_object())) + { + JSON_THROW(type_error::create(312, "cannot use update() with " + std::string(type_name()))); + } + + // check if range iterators belong to the same JSON object + if (JSON_UNLIKELY(first.m_object != last.m_object)) + { + JSON_THROW(invalid_iterator::create(210, "iterators do not fit")); + } + + // passed iterators must belong to objects + if (JSON_UNLIKELY(not first.m_object->is_object() + or not last.m_object->is_object())) + { + JSON_THROW(invalid_iterator::create(202, "iterators first and last must point to objects")); + } + + for (auto it = first; it != last; ++it) + { + m_value.object->operator[](it.key()) = it.value(); + } + } + + /*! + @brief exchanges the values + + Exchanges the contents of the JSON value with those of @a other. Does not + invoke any move, copy, or swap operations on individual elements. All + iterators and references remain valid. The past-the-end iterator is + invalidated. + + @param[in,out] other JSON value to exchange the contents with + + @complexity Constant. + + @liveexample{The example below shows how JSON values can be swapped with + `swap()`.,swap__reference} + + @since version 1.0.0 + */ + void swap(reference other) noexcept ( + std::is_nothrow_move_constructible<value_t>::value and + std::is_nothrow_move_assignable<value_t>::value and + std::is_nothrow_move_constructible<json_value>::value and + std::is_nothrow_move_assignable<json_value>::value + ) + { + std::swap(m_type, other.m_type); + std::swap(m_value, other.m_value); + assert_invariant(); + } + + /*! + @brief exchanges the values + + Exchanges the contents of a JSON array with those of @a other. Does not + invoke any move, copy, or swap operations on individual elements. All + iterators and references remain valid. The past-the-end iterator is + invalidated. + + @param[in,out] other array to exchange the contents with + + @throw type_error.310 when JSON value is not an array; example: `"cannot + use swap() with string"` + + @complexity Constant. + + @liveexample{The example below shows how arrays can be swapped with + `swap()`.,swap__array_t} + + @since version 1.0.0 + */ + void swap(array_t& other) + { + // swap only works for arrays + if (JSON_LIKELY(is_array())) + { + std::swap(*(m_value.array), other); + } + else + { + JSON_THROW(type_error::create(310, "cannot use swap() with " + std::string(type_name()))); + } + } + + /*! + @brief exchanges the values + + Exchanges the contents of a JSON object with those of @a other. Does not + invoke any move, copy, or swap operations on individual elements. All + iterators and references remain valid. The past-the-end iterator is + invalidated. + + @param[in,out] other object to exchange the contents with + + @throw type_error.310 when JSON value is not an object; example: + `"cannot use swap() with string"` + + @complexity Constant. + + @liveexample{The example below shows how objects can be swapped with + `swap()`.,swap__object_t} + + @since version 1.0.0 + */ + void swap(object_t& other) + { + // swap only works for objects + if (JSON_LIKELY(is_object())) + { + std::swap(*(m_value.object), other); + } + else + { + JSON_THROW(type_error::create(310, "cannot use swap() with " + std::string(type_name()))); + } + } + + /*! + @brief exchanges the values + + Exchanges the contents of a JSON string with those of @a other. Does not + invoke any move, copy, or swap operations on individual elements. All + iterators and references remain valid. The past-the-end iterator is + invalidated. + + @param[in,out] other string to exchange the contents with + + @throw type_error.310 when JSON value is not a string; example: `"cannot + use swap() with boolean"` + + @complexity Constant. + + @liveexample{The example below shows how strings can be swapped with + `swap()`.,swap__string_t} + + @since version 1.0.0 + */ + void swap(string_t& other) + { + // swap only works for strings + if (JSON_LIKELY(is_string())) + { + std::swap(*(m_value.string), other); + } + else + { + JSON_THROW(type_error::create(310, "cannot use swap() with " + std::string(type_name()))); + } + } + + /// @} + + public: + ////////////////////////////////////////// + // lexicographical comparison operators // + ////////////////////////////////////////// + + /// @name lexicographical comparison operators + /// @{ + + /*! + @brief comparison: equal + + Compares two JSON values for equality according to the following rules: + - Two JSON values are equal if (1) they are from the same type and (2) + their stored values are the same according to their respective + `operator==`. + - Integer and floating-point numbers are automatically converted before + comparison. Note than two NaN values are always treated as unequal. + - Two JSON null values are equal. + + @note Floating-point inside JSON values numbers are compared with + `json::number_float_t::operator==` which is `double::operator==` by + default. To compare floating-point while respecting an epsilon, an alternative + [comparison function](https://github.com/mariokonrad/marnav/blob/master/src/marnav/math/floatingpoint.hpp#L34-#L39) + could be used, for instance + @code {.cpp} + template<typename T, typename = typename std::enable_if<std::is_floating_point<T>::value, T>::type> + inline bool is_same(T a, T b, T epsilon = std::numeric_limits<T>::epsilon()) noexcept + { + return std::abs(a - b) <= epsilon; + } + @endcode + + @note NaN values never compare equal to themselves or to other NaN values. + + @param[in] lhs first JSON value to consider + @param[in] rhs second JSON value to consider + @return whether the values @a lhs and @a rhs are equal + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + + @complexity Linear. + + @liveexample{The example demonstrates comparing several JSON + types.,operator__equal} + + @since version 1.0.0 + */ + friend bool operator==(const_reference lhs, const_reference rhs) noexcept + { + const auto lhs_type = lhs.type(); + const auto rhs_type = rhs.type(); + + if (lhs_type == rhs_type) + { + switch (lhs_type) + { + case value_t::array: + return *lhs.m_value.array == *rhs.m_value.array; + + case value_t::object: + return *lhs.m_value.object == *rhs.m_value.object; + + case value_t::null: + return true; + + case value_t::string: + return *lhs.m_value.string == *rhs.m_value.string; + + case value_t::boolean: + return lhs.m_value.boolean == rhs.m_value.boolean; + + case value_t::number_integer: + return lhs.m_value.number_integer == rhs.m_value.number_integer; + + case value_t::number_unsigned: + return lhs.m_value.number_unsigned == rhs.m_value.number_unsigned; + + case value_t::number_float: + return lhs.m_value.number_float == rhs.m_value.number_float; + + default: + return false; + } + } + else if (lhs_type == value_t::number_integer and rhs_type == value_t::number_float) + { + return static_cast<number_float_t>(lhs.m_value.number_integer) == rhs.m_value.number_float; + } + else if (lhs_type == value_t::number_float and rhs_type == value_t::number_integer) + { + return lhs.m_value.number_float == static_cast<number_float_t>(rhs.m_value.number_integer); + } + else if (lhs_type == value_t::number_unsigned and rhs_type == value_t::number_float) + { + return static_cast<number_float_t>(lhs.m_value.number_unsigned) == rhs.m_value.number_float; + } + else if (lhs_type == value_t::number_float and rhs_type == value_t::number_unsigned) + { + return lhs.m_value.number_float == static_cast<number_float_t>(rhs.m_value.number_unsigned); + } + else if (lhs_type == value_t::number_unsigned and rhs_type == value_t::number_integer) + { + return static_cast<number_integer_t>(lhs.m_value.number_unsigned) == rhs.m_value.number_integer; + } + else if (lhs_type == value_t::number_integer and rhs_type == value_t::number_unsigned) + { + return lhs.m_value.number_integer == static_cast<number_integer_t>(rhs.m_value.number_unsigned); + } + + return false; + } + + /*! + @brief comparison: equal + @copydoc operator==(const_reference, const_reference) + */ + template<typename ScalarType, typename std::enable_if< + std::is_scalar<ScalarType>::value, int>::type = 0> + friend bool operator==(const_reference lhs, const ScalarType rhs) noexcept + { + return lhs == basic_json(rhs); + } + + /*! + @brief comparison: equal + @copydoc operator==(const_reference, const_reference) + */ + template<typename ScalarType, typename std::enable_if< + std::is_scalar<ScalarType>::value, int>::type = 0> + friend bool operator==(const ScalarType lhs, const_reference rhs) noexcept + { + return basic_json(lhs) == rhs; + } + + /*! + @brief comparison: not equal + + Compares two JSON values for inequality by calculating `not (lhs == rhs)`. + + @param[in] lhs first JSON value to consider + @param[in] rhs second JSON value to consider + @return whether the values @a lhs and @a rhs are not equal + + @complexity Linear. + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + + @liveexample{The example demonstrates comparing several JSON + types.,operator__notequal} + + @since version 1.0.0 + */ + friend bool operator!=(const_reference lhs, const_reference rhs) noexcept + { + return not (lhs == rhs); + } + + /*! + @brief comparison: not equal + @copydoc operator!=(const_reference, const_reference) + */ + template<typename ScalarType, typename std::enable_if< + std::is_scalar<ScalarType>::value, int>::type = 0> + friend bool operator!=(const_reference lhs, const ScalarType rhs) noexcept + { + return lhs != basic_json(rhs); + } + + /*! + @brief comparison: not equal + @copydoc operator!=(const_reference, const_reference) + */ + template<typename ScalarType, typename std::enable_if< + std::is_scalar<ScalarType>::value, int>::type = 0> + friend bool operator!=(const ScalarType lhs, const_reference rhs) noexcept + { + return basic_json(lhs) != rhs; + } + + /*! + @brief comparison: less than + + Compares whether one JSON value @a lhs is less than another JSON value @a + rhs according to the following rules: + - If @a lhs and @a rhs have the same type, the values are compared using + the default `<` operator. + - Integer and floating-point numbers are automatically converted before + comparison + - In case @a lhs and @a rhs have different types, the values are ignored + and the order of the types is considered, see + @ref operator<(const value_t, const value_t). + + @param[in] lhs first JSON value to consider + @param[in] rhs second JSON value to consider + @return whether @a lhs is less than @a rhs + + @complexity Linear. + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + + @liveexample{The example demonstrates comparing several JSON + types.,operator__less} + + @since version 1.0.0 + */ + friend bool operator<(const_reference lhs, const_reference rhs) noexcept + { + const auto lhs_type = lhs.type(); + const auto rhs_type = rhs.type(); + + if (lhs_type == rhs_type) + { + switch (lhs_type) + { + case value_t::array: + // note parentheses are necessary, see + // https://github.com/nlohmann/json/issues/1530 + return (*lhs.m_value.array) < (*rhs.m_value.array); + + case value_t::object: + return *lhs.m_value.object < *rhs.m_value.object; + + case value_t::null: + return false; + + case value_t::string: + return *lhs.m_value.string < *rhs.m_value.string; + + case value_t::boolean: + return lhs.m_value.boolean < rhs.m_value.boolean; + + case value_t::number_integer: + return lhs.m_value.number_integer < rhs.m_value.number_integer; + + case value_t::number_unsigned: + return lhs.m_value.number_unsigned < rhs.m_value.number_unsigned; + + case value_t::number_float: + return lhs.m_value.number_float < rhs.m_value.number_float; + + default: + return false; + } + } + else if (lhs_type == value_t::number_integer and rhs_type == value_t::number_float) + { + return static_cast<number_float_t>(lhs.m_value.number_integer) < rhs.m_value.number_float; + } + else if (lhs_type == value_t::number_float and rhs_type == value_t::number_integer) + { + return lhs.m_value.number_float < static_cast<number_float_t>(rhs.m_value.number_integer); + } + else if (lhs_type == value_t::number_unsigned and rhs_type == value_t::number_float) + { + return static_cast<number_float_t>(lhs.m_value.number_unsigned) < rhs.m_value.number_float; + } + else if (lhs_type == value_t::number_float and rhs_type == value_t::number_unsigned) + { + return lhs.m_value.number_float < static_cast<number_float_t>(rhs.m_value.number_unsigned); + } + else if (lhs_type == value_t::number_integer and rhs_type == value_t::number_unsigned) + { + return lhs.m_value.number_integer < static_cast<number_integer_t>(rhs.m_value.number_unsigned); + } + else if (lhs_type == value_t::number_unsigned and rhs_type == value_t::number_integer) + { + return static_cast<number_integer_t>(lhs.m_value.number_unsigned) < rhs.m_value.number_integer; + } + + // We only reach this line if we cannot compare values. In that case, + // we compare types. Note we have to call the operator explicitly, + // because MSVC has problems otherwise. + return operator<(lhs_type, rhs_type); + } + + /*! + @brief comparison: less than + @copydoc operator<(const_reference, const_reference) + */ + template<typename ScalarType, typename std::enable_if< + std::is_scalar<ScalarType>::value, int>::type = 0> + friend bool operator<(const_reference lhs, const ScalarType rhs) noexcept + { + return lhs < basic_json(rhs); + } + + /*! + @brief comparison: less than + @copydoc operator<(const_reference, const_reference) + */ + template<typename ScalarType, typename std::enable_if< + std::is_scalar<ScalarType>::value, int>::type = 0> + friend bool operator<(const ScalarType lhs, const_reference rhs) noexcept + { + return basic_json(lhs) < rhs; + } + + /*! + @brief comparison: less than or equal + + Compares whether one JSON value @a lhs is less than or equal to another + JSON value by calculating `not (rhs < lhs)`. + + @param[in] lhs first JSON value to consider + @param[in] rhs second JSON value to consider + @return whether @a lhs is less than or equal to @a rhs + + @complexity Linear. + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + + @liveexample{The example demonstrates comparing several JSON + types.,operator__greater} + + @since version 1.0.0 + */ + friend bool operator<=(const_reference lhs, const_reference rhs) noexcept + { + return not (rhs < lhs); + } + + /*! + @brief comparison: less than or equal + @copydoc operator<=(const_reference, const_reference) + */ + template<typename ScalarType, typename std::enable_if< + std::is_scalar<ScalarType>::value, int>::type = 0> + friend bool operator<=(const_reference lhs, const ScalarType rhs) noexcept + { + return lhs <= basic_json(rhs); + } + + /*! + @brief comparison: less than or equal + @copydoc operator<=(const_reference, const_reference) + */ + template<typename ScalarType, typename std::enable_if< + std::is_scalar<ScalarType>::value, int>::type = 0> + friend bool operator<=(const ScalarType lhs, const_reference rhs) noexcept + { + return basic_json(lhs) <= rhs; + } + + /*! + @brief comparison: greater than + + Compares whether one JSON value @a lhs is greater than another + JSON value by calculating `not (lhs <= rhs)`. + + @param[in] lhs first JSON value to consider + @param[in] rhs second JSON value to consider + @return whether @a lhs is greater than to @a rhs + + @complexity Linear. + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + + @liveexample{The example demonstrates comparing several JSON + types.,operator__lessequal} + + @since version 1.0.0 + */ + friend bool operator>(const_reference lhs, const_reference rhs) noexcept + { + return not (lhs <= rhs); + } + + /*! + @brief comparison: greater than + @copydoc operator>(const_reference, const_reference) + */ + template<typename ScalarType, typename std::enable_if< + std::is_scalar<ScalarType>::value, int>::type = 0> + friend bool operator>(const_reference lhs, const ScalarType rhs) noexcept + { + return lhs > basic_json(rhs); + } + + /*! + @brief comparison: greater than + @copydoc operator>(const_reference, const_reference) + */ + template<typename ScalarType, typename std::enable_if< + std::is_scalar<ScalarType>::value, int>::type = 0> + friend bool operator>(const ScalarType lhs, const_reference rhs) noexcept + { + return basic_json(lhs) > rhs; + } + + /*! + @brief comparison: greater than or equal + + Compares whether one JSON value @a lhs is greater than or equal to another + JSON value by calculating `not (lhs < rhs)`. + + @param[in] lhs first JSON value to consider + @param[in] rhs second JSON value to consider + @return whether @a lhs is greater than or equal to @a rhs + + @complexity Linear. + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + + @liveexample{The example demonstrates comparing several JSON + types.,operator__greaterequal} + + @since version 1.0.0 + */ + friend bool operator>=(const_reference lhs, const_reference rhs) noexcept + { + return not (lhs < rhs); + } + + /*! + @brief comparison: greater than or equal + @copydoc operator>=(const_reference, const_reference) + */ + template<typename ScalarType, typename std::enable_if< + std::is_scalar<ScalarType>::value, int>::type = 0> + friend bool operator>=(const_reference lhs, const ScalarType rhs) noexcept + { + return lhs >= basic_json(rhs); + } + + /*! + @brief comparison: greater than or equal + @copydoc operator>=(const_reference, const_reference) + */ + template<typename ScalarType, typename std::enable_if< + std::is_scalar<ScalarType>::value, int>::type = 0> + friend bool operator>=(const ScalarType lhs, const_reference rhs) noexcept + { + return basic_json(lhs) >= rhs; + } + + /// @} + + /////////////////// + // serialization // + /////////////////// + + /// @name serialization + /// @{ + + /*! + @brief serialize to stream + + Serialize the given JSON value @a j to the output stream @a o. The JSON + value will be serialized using the @ref dump member function. + + - The indentation of the output can be controlled with the member variable + `width` of the output stream @a o. For instance, using the manipulator + `std::setw(4)` on @a o sets the indentation level to `4` and the + serialization result is the same as calling `dump(4)`. + + - The indentation character can be controlled with the member variable + `fill` of the output stream @a o. For instance, the manipulator + `std::setfill('\\t')` sets indentation to use a tab character rather than + the default space character. + + @param[in,out] o stream to serialize to + @param[in] j JSON value to serialize + + @return the stream @a o + + @throw type_error.316 if a string stored inside the JSON value is not + UTF-8 encoded + + @complexity Linear. + + @liveexample{The example below shows the serialization with different + parameters to `width` to adjust the indentation level.,operator_serialize} + + @since version 1.0.0; indentation character added in version 3.0.0 + */ + friend std::ostream& operator<<(std::ostream& o, const basic_json& j) + { + // read width member and use it as indentation parameter if nonzero + const bool pretty_print = o.width() > 0; + const auto indentation = pretty_print ? o.width() : 0; + + // reset width to 0 for subsequent calls to this stream + o.width(0); + + // do the actual serialization + serializer s(detail::output_adapter<char>(o), o.fill()); + s.dump(j, pretty_print, false, static_cast<unsigned int>(indentation)); + return o; + } + + /*! + @brief serialize to stream + @deprecated This stream operator is deprecated and will be removed in + future 4.0.0 of the library. Please use + @ref operator<<(std::ostream&, const basic_json&) + instead; that is, replace calls like `j >> o;` with `o << j;`. + @since version 1.0.0; deprecated since version 3.0.0 + */ + JSON_DEPRECATED + friend std::ostream& operator>>(const basic_json& j, std::ostream& o) + { + return o << j; + } + + /// @} + + + ///////////////////// + // deserialization // + ///////////////////// + + /// @name deserialization + /// @{ + + /*! + @brief deserialize from a compatible input + + This function reads from a compatible input. Examples are: + - an array of 1-byte values + - strings with character/literal type with size of 1 byte + - input streams + - container with contiguous storage of 1-byte values. Compatible container + types include `std::vector`, `std::string`, `std::array`, + `std::valarray`, and `std::initializer_list`. Furthermore, C-style + arrays can be used with `std::begin()`/`std::end()`. User-defined + containers can be used as long as they implement random-access iterators + and a contiguous storage. + + @pre Each element of the container has a size of 1 byte. Violating this + precondition yields undefined behavior. **This precondition is enforced + with a static assertion.** + + @pre The container storage is contiguous. Violating this precondition + yields undefined behavior. **This precondition is enforced with an + assertion.** + + @warning There is no way to enforce all preconditions at compile-time. If + the function is called with a noncompliant container and with + assertions switched off, the behavior is undefined and will most + likely yield segmentation violation. + + @param[in] i input to read from + @param[in] cb a parser callback function of type @ref parser_callback_t + which is used to control the deserialization by filtering unwanted values + (optional) + @param[in] allow_exceptions whether to throw exceptions in case of a + parse error (optional, true by default) + + @return deserialized JSON value; in case of a parse error and + @a allow_exceptions set to `false`, the return value will be + value_t::discarded. + + @throw parse_error.101 if a parse error occurs; example: `""unexpected end + of input; expected string literal""` + @throw parse_error.102 if to_unicode fails or surrogate error + @throw parse_error.103 if to_unicode fails + + @complexity Linear in the length of the input. The parser is a predictive + LL(1) parser. The complexity can be higher if the parser callback function + @a cb has a super-linear complexity. + + @note A UTF-8 byte order mark is silently ignored. + + @liveexample{The example below demonstrates the `parse()` function reading + from an array.,parse__array__parser_callback_t} + + @liveexample{The example below demonstrates the `parse()` function with + and without callback function.,parse__string__parser_callback_t} + + @liveexample{The example below demonstrates the `parse()` function with + and without callback function.,parse__istream__parser_callback_t} + + @liveexample{The example below demonstrates the `parse()` function reading + from a contiguous container.,parse__contiguouscontainer__parser_callback_t} + + @since version 2.0.3 (contiguous containers) + */ + JSON_NODISCARD + static basic_json parse(detail::input_adapter&& i, + const parser_callback_t cb = nullptr, + const bool allow_exceptions = true) + { + basic_json result; + parser(i, cb, allow_exceptions).parse(true, result); + return result; + } + + static bool accept(detail::input_adapter&& i) + { + return parser(i).accept(true); + } + + /*! + @brief generate SAX events + + The SAX event lister must follow the interface of @ref json_sax. + + This function reads from a compatible input. Examples are: + - an array of 1-byte values + - strings with character/literal type with size of 1 byte + - input streams + - container with contiguous storage of 1-byte values. Compatible container + types include `std::vector`, `std::string`, `std::array`, + `std::valarray`, and `std::initializer_list`. Furthermore, C-style + arrays can be used with `std::begin()`/`std::end()`. User-defined + containers can be used as long as they implement random-access iterators + and a contiguous storage. + + @pre Each element of the container has a size of 1 byte. Violating this + precondition yields undefined behavior. **This precondition is enforced + with a static assertion.** + + @pre The container storage is contiguous. Violating this precondition + yields undefined behavior. **This precondition is enforced with an + assertion.** + + @warning There is no way to enforce all preconditions at compile-time. If + the function is called with a noncompliant container and with + assertions switched off, the behavior is undefined and will most + likely yield segmentation violation. + + @param[in] i input to read from + @param[in,out] sax SAX event listener + @param[in] format the format to parse (JSON, CBOR, MessagePack, or UBJSON) + @param[in] strict whether the input has to be consumed completely + + @return return value of the last processed SAX event + + @throw parse_error.101 if a parse error occurs; example: `""unexpected end + of input; expected string literal""` + @throw parse_error.102 if to_unicode fails or surrogate error + @throw parse_error.103 if to_unicode fails + + @complexity Linear in the length of the input. The parser is a predictive + LL(1) parser. The complexity can be higher if the SAX consumer @a sax has + a super-linear complexity. + + @note A UTF-8 byte order mark is silently ignored. + + @liveexample{The example below demonstrates the `sax_parse()` function + reading from string and processing the events with a user-defined SAX + event consumer.,sax_parse} + + @since version 3.2.0 + */ + template <typename SAX> + static bool sax_parse(detail::input_adapter&& i, SAX* sax, + input_format_t format = input_format_t::json, + const bool strict = true) + { + assert(sax); + return format == input_format_t::json + ? parser(std::move(i)).sax_parse(sax, strict) + : detail::binary_reader<basic_json, SAX>(std::move(i)).sax_parse(format, sax, strict); + } + + /*! + @brief deserialize from an iterator range with contiguous storage + + This function reads from an iterator range of a container with contiguous + storage of 1-byte values. Compatible container types include + `std::vector`, `std::string`, `std::array`, `std::valarray`, and + `std::initializer_list`. Furthermore, C-style arrays can be used with + `std::begin()`/`std::end()`. User-defined containers can be used as long + as they implement random-access iterators and a contiguous storage. + + @pre The iterator range is contiguous. Violating this precondition yields + undefined behavior. **This precondition is enforced with an assertion.** + @pre Each element in the range has a size of 1 byte. Violating this + precondition yields undefined behavior. **This precondition is enforced + with a static assertion.** + + @warning There is no way to enforce all preconditions at compile-time. If + the function is called with noncompliant iterators and with + assertions switched off, the behavior is undefined and will most + likely yield segmentation violation. + + @tparam IteratorType iterator of container with contiguous storage + @param[in] first begin of the range to parse (included) + @param[in] last end of the range to parse (excluded) + @param[in] cb a parser callback function of type @ref parser_callback_t + which is used to control the deserialization by filtering unwanted values + (optional) + @param[in] allow_exceptions whether to throw exceptions in case of a + parse error (optional, true by default) + + @return deserialized JSON value; in case of a parse error and + @a allow_exceptions set to `false`, the return value will be + value_t::discarded. + + @throw parse_error.101 in case of an unexpected token + @throw parse_error.102 if to_unicode fails or surrogate error + @throw parse_error.103 if to_unicode fails + + @complexity Linear in the length of the input. The parser is a predictive + LL(1) parser. The complexity can be higher if the parser callback function + @a cb has a super-linear complexity. + + @note A UTF-8 byte order mark is silently ignored. + + @liveexample{The example below demonstrates the `parse()` function reading + from an iterator range.,parse__iteratortype__parser_callback_t} + + @since version 2.0.3 + */ + template<class IteratorType, typename std::enable_if< + std::is_base_of< + std::random_access_iterator_tag, + typename std::iterator_traits<IteratorType>::iterator_category>::value, int>::type = 0> + static basic_json parse(IteratorType first, IteratorType last, + const parser_callback_t cb = nullptr, + const bool allow_exceptions = true) + { + basic_json result; + parser(detail::input_adapter(first, last), cb, allow_exceptions).parse(true, result); + return result; + } + + template<class IteratorType, typename std::enable_if< + std::is_base_of< + std::random_access_iterator_tag, + typename std::iterator_traits<IteratorType>::iterator_category>::value, int>::type = 0> + static bool accept(IteratorType first, IteratorType last) + { + return parser(detail::input_adapter(first, last)).accept(true); + } + + template<class IteratorType, class SAX, typename std::enable_if< + std::is_base_of< + std::random_access_iterator_tag, + typename std::iterator_traits<IteratorType>::iterator_category>::value, int>::type = 0> + static bool sax_parse(IteratorType first, IteratorType last, SAX* sax) + { + return parser(detail::input_adapter(first, last)).sax_parse(sax); + } + + /*! + @brief deserialize from stream + @deprecated This stream operator is deprecated and will be removed in + version 4.0.0 of the library. Please use + @ref operator>>(std::istream&, basic_json&) + instead; that is, replace calls like `j << i;` with `i >> j;`. + @since version 1.0.0; deprecated since version 3.0.0 + */ + JSON_DEPRECATED + friend std::istream& operator<<(basic_json& j, std::istream& i) + { + return operator>>(i, j); + } + + /*! + @brief deserialize from stream + + Deserializes an input stream to a JSON value. + + @param[in,out] i input stream to read a serialized JSON value from + @param[in,out] j JSON value to write the deserialized input to + + @throw parse_error.101 in case of an unexpected token + @throw parse_error.102 if to_unicode fails or surrogate error + @throw parse_error.103 if to_unicode fails + + @complexity Linear in the length of the input. The parser is a predictive + LL(1) parser. + + @note A UTF-8 byte order mark is silently ignored. + + @liveexample{The example below shows how a JSON value is constructed by + reading a serialization from a stream.,operator_deserialize} + + @sa parse(std::istream&, const parser_callback_t) for a variant with a + parser callback function to filter values while parsing + + @since version 1.0.0 + */ + friend std::istream& operator>>(std::istream& i, basic_json& j) + { + parser(detail::input_adapter(i)).parse(false, j); + return i; + } + + /// @} + + /////////////////////////// + // convenience functions // + /////////////////////////// + + /*! + @brief return the type as string + + Returns the type name as string to be used in error messages - usually to + indicate that a function was called on a wrong JSON type. + + @return a string representation of a the @a m_type member: + Value type | return value + ----------- | ------------- + null | `"null"` + boolean | `"boolean"` + string | `"string"` + number | `"number"` (for all number types) + object | `"object"` + array | `"array"` + discarded | `"discarded"` + + @exceptionsafety No-throw guarantee: this function never throws exceptions. + + @complexity Constant. + + @liveexample{The following code exemplifies `type_name()` for all JSON + types.,type_name} + + @sa @ref type() -- return the type of the JSON value + @sa @ref operator value_t() -- return the type of the JSON value (implicit) + + @since version 1.0.0, public since 2.1.0, `const char*` and `noexcept` + since 3.0.0 + */ + const char* type_name() const noexcept + { + { + switch (m_type) + { + case value_t::null: + return "null"; + case value_t::object: + return "object"; + case value_t::array: + return "array"; + case value_t::string: + return "string"; + case value_t::boolean: + return "boolean"; + case value_t::discarded: + return "discarded"; + default: + return "number"; + } + } + } + + + private: + ////////////////////// + // member variables // + ////////////////////// + + /// the type of the current element + value_t m_type = value_t::null; + + /// the value of the current element + json_value m_value = {}; + + ////////////////////////////////////////// + // binary serialization/deserialization // + ////////////////////////////////////////// + + /// @name binary serialization/deserialization support + /// @{ + + public: + /*! + @brief create a CBOR serialization of a given JSON value + + Serializes a given JSON value @a j to a byte vector using the CBOR (Concise + Binary Object Representation) serialization format. CBOR is a binary + serialization format which aims to be more compact than JSON itself, yet + more efficient to parse. + + The library uses the following mapping from JSON values types to + CBOR types according to the CBOR specification (RFC 7049): + + JSON value type | value/range | CBOR type | first byte + --------------- | ------------------------------------------ | ---------------------------------- | --------------- + null | `null` | Null | 0xF6 + boolean | `true` | True | 0xF5 + boolean | `false` | False | 0xF4 + number_integer | -9223372036854775808..-2147483649 | Negative integer (8 bytes follow) | 0x3B + number_integer | -2147483648..-32769 | Negative integer (4 bytes follow) | 0x3A + number_integer | -32768..-129 | Negative integer (2 bytes follow) | 0x39 + number_integer | -128..-25 | Negative integer (1 byte follow) | 0x38 + number_integer | -24..-1 | Negative integer | 0x20..0x37 + number_integer | 0..23 | Integer | 0x00..0x17 + number_integer | 24..255 | Unsigned integer (1 byte follow) | 0x18 + number_integer | 256..65535 | Unsigned integer (2 bytes follow) | 0x19 + number_integer | 65536..4294967295 | Unsigned integer (4 bytes follow) | 0x1A + number_integer | 4294967296..18446744073709551615 | Unsigned integer (8 bytes follow) | 0x1B + number_unsigned | 0..23 | Integer | 0x00..0x17 + number_unsigned | 24..255 | Unsigned integer (1 byte follow) | 0x18 + number_unsigned | 256..65535 | Unsigned integer (2 bytes follow) | 0x19 + number_unsigned | 65536..4294967295 | Unsigned integer (4 bytes follow) | 0x1A + number_unsigned | 4294967296..18446744073709551615 | Unsigned integer (8 bytes follow) | 0x1B + number_float | *any value* | Double-Precision Float | 0xFB + string | *length*: 0..23 | UTF-8 string | 0x60..0x77 + string | *length*: 23..255 | UTF-8 string (1 byte follow) | 0x78 + string | *length*: 256..65535 | UTF-8 string (2 bytes follow) | 0x79 + string | *length*: 65536..4294967295 | UTF-8 string (4 bytes follow) | 0x7A + string | *length*: 4294967296..18446744073709551615 | UTF-8 string (8 bytes follow) | 0x7B + array | *size*: 0..23 | array | 0x80..0x97 + array | *size*: 23..255 | array (1 byte follow) | 0x98 + array | *size*: 256..65535 | array (2 bytes follow) | 0x99 + array | *size*: 65536..4294967295 | array (4 bytes follow) | 0x9A + array | *size*: 4294967296..18446744073709551615 | array (8 bytes follow) | 0x9B + object | *size*: 0..23 | map | 0xA0..0xB7 + object | *size*: 23..255 | map (1 byte follow) | 0xB8 + object | *size*: 256..65535 | map (2 bytes follow) | 0xB9 + object | *size*: 65536..4294967295 | map (4 bytes follow) | 0xBA + object | *size*: 4294967296..18446744073709551615 | map (8 bytes follow) | 0xBB + + @note The mapping is **complete** in the sense that any JSON value type + can be converted to a CBOR value. + + @note If NaN or Infinity are stored inside a JSON number, they are + serialized properly. This behavior differs from the @ref dump() + function which serializes NaN or Infinity to `null`. + + @note The following CBOR types are not used in the conversion: + - byte strings (0x40..0x5F) + - UTF-8 strings terminated by "break" (0x7F) + - arrays terminated by "break" (0x9F) + - maps terminated by "break" (0xBF) + - date/time (0xC0..0xC1) + - bignum (0xC2..0xC3) + - decimal fraction (0xC4) + - bigfloat (0xC5) + - tagged items (0xC6..0xD4, 0xD8..0xDB) + - expected conversions (0xD5..0xD7) + - simple values (0xE0..0xF3, 0xF8) + - undefined (0xF7) + - half and single-precision floats (0xF9-0xFA) + - break (0xFF) + + @param[in] j JSON value to serialize + @return MessagePack serialization as byte vector + + @complexity Linear in the size of the JSON value @a j. + + @liveexample{The example shows the serialization of a JSON value to a byte + vector in CBOR format.,to_cbor} + + @sa http://cbor.io + @sa @ref from_cbor(detail::input_adapter&&, const bool, const bool) for the + analogous deserialization + @sa @ref to_msgpack(const basic_json&) for the related MessagePack format + @sa @ref to_ubjson(const basic_json&, const bool, const bool) for the + related UBJSON format + + @since version 2.0.9 + */ + static std::vector<uint8_t> to_cbor(const basic_json& j) + { + std::vector<uint8_t> result; + to_cbor(j, result); + return result; + } + + static void to_cbor(const basic_json& j, detail::output_adapter<uint8_t> o) + { + binary_writer<uint8_t>(o).write_cbor(j); + } + + static void to_cbor(const basic_json& j, detail::output_adapter<char> o) + { + binary_writer<char>(o).write_cbor(j); + } + + /*! + @brief create a MessagePack serialization of a given JSON value + + Serializes a given JSON value @a j to a byte vector using the MessagePack + serialization format. MessagePack is a binary serialization format which + aims to be more compact than JSON itself, yet more efficient to parse. + + The library uses the following mapping from JSON values types to + MessagePack types according to the MessagePack specification: + + JSON value type | value/range | MessagePack type | first byte + --------------- | --------------------------------- | ---------------- | ---------- + null | `null` | nil | 0xC0 + boolean | `true` | true | 0xC3 + boolean | `false` | false | 0xC2 + number_integer | -9223372036854775808..-2147483649 | int64 | 0xD3 + number_integer | -2147483648..-32769 | int32 | 0xD2 + number_integer | -32768..-129 | int16 | 0xD1 + number_integer | -128..-33 | int8 | 0xD0 + number_integer | -32..-1 | negative fixint | 0xE0..0xFF + number_integer | 0..127 | positive fixint | 0x00..0x7F + number_integer | 128..255 | uint 8 | 0xCC + number_integer | 256..65535 | uint 16 | 0xCD + number_integer | 65536..4294967295 | uint 32 | 0xCE + number_integer | 4294967296..18446744073709551615 | uint 64 | 0xCF + number_unsigned | 0..127 | positive fixint | 0x00..0x7F + number_unsigned | 128..255 | uint 8 | 0xCC + number_unsigned | 256..65535 | uint 16 | 0xCD + number_unsigned | 65536..4294967295 | uint 32 | 0xCE + number_unsigned | 4294967296..18446744073709551615 | uint 64 | 0xCF + number_float | *any value* | float 64 | 0xCB + string | *length*: 0..31 | fixstr | 0xA0..0xBF + string | *length*: 32..255 | str 8 | 0xD9 + string | *length*: 256..65535 | str 16 | 0xDA + string | *length*: 65536..4294967295 | str 32 | 0xDB + array | *size*: 0..15 | fixarray | 0x90..0x9F + array | *size*: 16..65535 | array 16 | 0xDC + array | *size*: 65536..4294967295 | array 32 | 0xDD + object | *size*: 0..15 | fix map | 0x80..0x8F + object | *size*: 16..65535 | map 16 | 0xDE + object | *size*: 65536..4294967295 | map 32 | 0xDF + + @note The mapping is **complete** in the sense that any JSON value type + can be converted to a MessagePack value. + + @note The following values can **not** be converted to a MessagePack value: + - strings with more than 4294967295 bytes + - arrays with more than 4294967295 elements + - objects with more than 4294967295 elements + + @note The following MessagePack types are not used in the conversion: + - bin 8 - bin 32 (0xC4..0xC6) + - ext 8 - ext 32 (0xC7..0xC9) + - float 32 (0xCA) + - fixext 1 - fixext 16 (0xD4..0xD8) + + @note Any MessagePack output created @ref to_msgpack can be successfully + parsed by @ref from_msgpack. + + @note If NaN or Infinity are stored inside a JSON number, they are + serialized properly. This behavior differs from the @ref dump() + function which serializes NaN or Infinity to `null`. + + @param[in] j JSON value to serialize + @return MessagePack serialization as byte vector + + @complexity Linear in the size of the JSON value @a j. + + @liveexample{The example shows the serialization of a JSON value to a byte + vector in MessagePack format.,to_msgpack} + + @sa http://msgpack.org + @sa @ref from_msgpack for the analogous deserialization + @sa @ref to_cbor(const basic_json& for the related CBOR format + @sa @ref to_ubjson(const basic_json&, const bool, const bool) for the + related UBJSON format + + @since version 2.0.9 + */ + static std::vector<uint8_t> to_msgpack(const basic_json& j) + { + std::vector<uint8_t> result; + to_msgpack(j, result); + return result; + } + + static void to_msgpack(const basic_json& j, detail::output_adapter<uint8_t> o) + { + binary_writer<uint8_t>(o).write_msgpack(j); + } + + static void to_msgpack(const basic_json& j, detail::output_adapter<char> o) + { + binary_writer<char>(o).write_msgpack(j); + } + + /*! + @brief create a UBJSON serialization of a given JSON value + + Serializes a given JSON value @a j to a byte vector using the UBJSON + (Universal Binary JSON) serialization format. UBJSON aims to be more compact + than JSON itself, yet more efficient to parse. + + The library uses the following mapping from JSON values types to + UBJSON types according to the UBJSON specification: + + JSON value type | value/range | UBJSON type | marker + --------------- | --------------------------------- | ----------- | ------ + null | `null` | null | `Z` + boolean | `true` | true | `T` + boolean | `false` | false | `F` + number_integer | -9223372036854775808..-2147483649 | int64 | `L` + number_integer | -2147483648..-32769 | int32 | `l` + number_integer | -32768..-129 | int16 | `I` + number_integer | -128..127 | int8 | `i` + number_integer | 128..255 | uint8 | `U` + number_integer | 256..32767 | int16 | `I` + number_integer | 32768..2147483647 | int32 | `l` + number_integer | 2147483648..9223372036854775807 | int64 | `L` + number_unsigned | 0..127 | int8 | `i` + number_unsigned | 128..255 | uint8 | `U` + number_unsigned | 256..32767 | int16 | `I` + number_unsigned | 32768..2147483647 | int32 | `l` + number_unsigned | 2147483648..9223372036854775807 | int64 | `L` + number_float | *any value* | float64 | `D` + string | *with shortest length indicator* | string | `S` + array | *see notes on optimized format* | array | `[` + object | *see notes on optimized format* | map | `{` + + @note The mapping is **complete** in the sense that any JSON value type + can be converted to a UBJSON value. + + @note The following values can **not** be converted to a UBJSON value: + - strings with more than 9223372036854775807 bytes (theoretical) + - unsigned integer numbers above 9223372036854775807 + + @note The following markers are not used in the conversion: + - `Z`: no-op values are not created. + - `C`: single-byte strings are serialized with `S` markers. + + @note Any UBJSON output created @ref to_ubjson can be successfully parsed + by @ref from_ubjson. + + @note If NaN or Infinity are stored inside a JSON number, they are + serialized properly. This behavior differs from the @ref dump() + function which serializes NaN or Infinity to `null`. + + @note The optimized formats for containers are supported: Parameter + @a use_size adds size information to the beginning of a container and + removes the closing marker. Parameter @a use_type further checks + whether all elements of a container have the same type and adds the + type marker to the beginning of the container. The @a use_type + parameter must only be used together with @a use_size = true. Note + that @a use_size = true alone may result in larger representations - + the benefit of this parameter is that the receiving side is + immediately informed on the number of elements of the container. + + @param[in] j JSON value to serialize + @param[in] use_size whether to add size annotations to container types + @param[in] use_type whether to add type annotations to container types + (must be combined with @a use_size = true) + @return UBJSON serialization as byte vector + + @complexity Linear in the size of the JSON value @a j. + + @liveexample{The example shows the serialization of a JSON value to a byte + vector in UBJSON format.,to_ubjson} + + @sa http://ubjson.org + @sa @ref from_ubjson(detail::input_adapter&&, const bool, const bool) for the + analogous deserialization + @sa @ref to_cbor(const basic_json& for the related CBOR format + @sa @ref to_msgpack(const basic_json&) for the related MessagePack format + + @since version 3.1.0 + */ + static std::vector<uint8_t> to_ubjson(const basic_json& j, + const bool use_size = false, + const bool use_type = false) + { + std::vector<uint8_t> result; + to_ubjson(j, result, use_size, use_type); + return result; + } + + static void to_ubjson(const basic_json& j, detail::output_adapter<uint8_t> o, + const bool use_size = false, const bool use_type = false) + { + binary_writer<uint8_t>(o).write_ubjson(j, use_size, use_type); + } + + static void to_ubjson(const basic_json& j, detail::output_adapter<char> o, + const bool use_size = false, const bool use_type = false) + { + binary_writer<char>(o).write_ubjson(j, use_size, use_type); + } + + + /*! + @brief Serializes the given JSON object `j` to BSON and returns a vector + containing the corresponding BSON-representation. + + BSON (Binary JSON) is a binary format in which zero or more ordered key/value pairs are + stored as a single entity (a so-called document). + + The library uses the following mapping from JSON values types to BSON types: + + JSON value type | value/range | BSON type | marker + --------------- | --------------------------------- | ----------- | ------ + null | `null` | null | 0x0A + boolean | `true`, `false` | boolean | 0x08 + number_integer | -9223372036854775808..-2147483649 | int64 | 0x12 + number_integer | -2147483648..2147483647 | int32 | 0x10 + number_integer | 2147483648..9223372036854775807 | int64 | 0x12 + number_unsigned | 0..2147483647 | int32 | 0x10 + number_unsigned | 2147483648..9223372036854775807 | int64 | 0x12 + number_unsigned | 9223372036854775808..18446744073709551615| -- | -- + number_float | *any value* | double | 0x01 + string | *any value* | string | 0x02 + array | *any value* | document | 0x04 + object | *any value* | document | 0x03 + + @warning The mapping is **incomplete**, since only JSON-objects (and things + contained therein) can be serialized to BSON. + Also, integers larger than 9223372036854775807 cannot be serialized to BSON, + and the keys may not contain U+0000, since they are serialized a + zero-terminated c-strings. + + @throw out_of_range.407 if `j.is_number_unsigned() && j.get<std::uint64_t>() > 9223372036854775807` + @throw out_of_range.409 if a key in `j` contains a NULL (U+0000) + @throw type_error.317 if `!j.is_object()` + + @pre The input `j` is required to be an object: `j.is_object() == true`. + + @note Any BSON output created via @ref to_bson can be successfully parsed + by @ref from_bson. + + @param[in] j JSON value to serialize + @return BSON serialization as byte vector + + @complexity Linear in the size of the JSON value @a j. + + @liveexample{The example shows the serialization of a JSON value to a byte + vector in BSON format.,to_bson} + + @sa http://bsonspec.org/spec.html + @sa @ref from_bson(detail::input_adapter&&, const bool strict) for the + analogous deserialization + @sa @ref to_ubjson(const basic_json&, const bool, const bool) for the + related UBJSON format + @sa @ref to_cbor(const basic_json&) for the related CBOR format + @sa @ref to_msgpack(const basic_json&) for the related MessagePack format + */ + static std::vector<uint8_t> to_bson(const basic_json& j) + { + std::vector<uint8_t> result; + to_bson(j, result); + return result; + } + + /*! + @brief Serializes the given JSON object `j` to BSON and forwards the + corresponding BSON-representation to the given output_adapter `o`. + @param j The JSON object to convert to BSON. + @param o The output adapter that receives the binary BSON representation. + @pre The input `j` shall be an object: `j.is_object() == true` + @sa @ref to_bson(const basic_json&) + */ + static void to_bson(const basic_json& j, detail::output_adapter<uint8_t> o) + { + binary_writer<uint8_t>(o).write_bson(j); + } + + /*! + @copydoc to_bson(const basic_json&, detail::output_adapter<uint8_t>) + */ + static void to_bson(const basic_json& j, detail::output_adapter<char> o) + { + binary_writer<char>(o).write_bson(j); + } + + + /*! + @brief create a JSON value from an input in CBOR format + + Deserializes a given input @a i to a JSON value using the CBOR (Concise + Binary Object Representation) serialization format. + + The library maps CBOR types to JSON value types as follows: + + CBOR type | JSON value type | first byte + ---------------------- | --------------- | ---------- + Integer | number_unsigned | 0x00..0x17 + Unsigned integer | number_unsigned | 0x18 + Unsigned integer | number_unsigned | 0x19 + Unsigned integer | number_unsigned | 0x1A + Unsigned integer | number_unsigned | 0x1B + Negative integer | number_integer | 0x20..0x37 + Negative integer | number_integer | 0x38 + Negative integer | number_integer | 0x39 + Negative integer | number_integer | 0x3A + Negative integer | number_integer | 0x3B + Negative integer | number_integer | 0x40..0x57 + UTF-8 string | string | 0x60..0x77 + UTF-8 string | string | 0x78 + UTF-8 string | string | 0x79 + UTF-8 string | string | 0x7A + UTF-8 string | string | 0x7B + UTF-8 string | string | 0x7F + array | array | 0x80..0x97 + array | array | 0x98 + array | array | 0x99 + array | array | 0x9A + array | array | 0x9B + array | array | 0x9F + map | object | 0xA0..0xB7 + map | object | 0xB8 + map | object | 0xB9 + map | object | 0xBA + map | object | 0xBB + map | object | 0xBF + False | `false` | 0xF4 + True | `true` | 0xF5 + Null | `null` | 0xF6 + Half-Precision Float | number_float | 0xF9 + Single-Precision Float | number_float | 0xFA + Double-Precision Float | number_float | 0xFB + + @warning The mapping is **incomplete** in the sense that not all CBOR + types can be converted to a JSON value. The following CBOR types + are not supported and will yield parse errors (parse_error.112): + - byte strings (0x40..0x5F) + - date/time (0xC0..0xC1) + - bignum (0xC2..0xC3) + - decimal fraction (0xC4) + - bigfloat (0xC5) + - tagged items (0xC6..0xD4, 0xD8..0xDB) + - expected conversions (0xD5..0xD7) + - simple values (0xE0..0xF3, 0xF8) + - undefined (0xF7) + + @warning CBOR allows map keys of any type, whereas JSON only allows + strings as keys in object values. Therefore, CBOR maps with keys + other than UTF-8 strings are rejected (parse_error.113). + + @note Any CBOR output created @ref to_cbor can be successfully parsed by + @ref from_cbor. + + @param[in] i an input in CBOR format convertible to an input adapter + @param[in] strict whether to expect the input to be consumed until EOF + (true by default) + @param[in] allow_exceptions whether to throw exceptions in case of a + parse error (optional, true by default) + + @return deserialized JSON value; in case of a parse error and + @a allow_exceptions set to `false`, the return value will be + value_t::discarded. + + @throw parse_error.110 if the given input ends prematurely or the end of + file was not reached when @a strict was set to true + @throw parse_error.112 if unsupported features from CBOR were + used in the given input @a v or if the input is not valid CBOR + @throw parse_error.113 if a string was expected as map key, but not found + + @complexity Linear in the size of the input @a i. + + @liveexample{The example shows the deserialization of a byte vector in CBOR + format to a JSON value.,from_cbor} + + @sa http://cbor.io + @sa @ref to_cbor(const basic_json&) for the analogous serialization + @sa @ref from_msgpack(detail::input_adapter&&, const bool, const bool) for the + related MessagePack format + @sa @ref from_ubjson(detail::input_adapter&&, const bool, const bool) for the + related UBJSON format + + @since version 2.0.9; parameter @a start_index since 2.1.1; changed to + consume input adapters, removed start_index parameter, and added + @a strict parameter since 3.0.0; added @a allow_exceptions parameter + since 3.2.0 + */ + JSON_NODISCARD + static basic_json from_cbor(detail::input_adapter&& i, + const bool strict = true, + const bool allow_exceptions = true) + { + basic_json result; + detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions); + const bool res = binary_reader(detail::input_adapter(i)).sax_parse(input_format_t::cbor, &sdp, strict); + return res ? result : basic_json(value_t::discarded); + } + + /*! + @copydoc from_cbor(detail::input_adapter&&, const bool, const bool) + */ + template<typename A1, typename A2, + detail::enable_if_t<std::is_constructible<detail::input_adapter, A1, A2>::value, int> = 0> + JSON_NODISCARD + static basic_json from_cbor(A1 && a1, A2 && a2, + const bool strict = true, + const bool allow_exceptions = true) + { + basic_json result; + detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions); + const bool res = binary_reader(detail::input_adapter(std::forward<A1>(a1), std::forward<A2>(a2))).sax_parse(input_format_t::cbor, &sdp, strict); + return res ? result : basic_json(value_t::discarded); + } + + /*! + @brief create a JSON value from an input in MessagePack format + + Deserializes a given input @a i to a JSON value using the MessagePack + serialization format. + + The library maps MessagePack types to JSON value types as follows: + + MessagePack type | JSON value type | first byte + ---------------- | --------------- | ---------- + positive fixint | number_unsigned | 0x00..0x7F + fixmap | object | 0x80..0x8F + fixarray | array | 0x90..0x9F + fixstr | string | 0xA0..0xBF + nil | `null` | 0xC0 + false | `false` | 0xC2 + true | `true` | 0xC3 + float 32 | number_float | 0xCA + float 64 | number_float | 0xCB + uint 8 | number_unsigned | 0xCC + uint 16 | number_unsigned | 0xCD + uint 32 | number_unsigned | 0xCE + uint 64 | number_unsigned | 0xCF + int 8 | number_integer | 0xD0 + int 16 | number_integer | 0xD1 + int 32 | number_integer | 0xD2 + int 64 | number_integer | 0xD3 + str 8 | string | 0xD9 + str 16 | string | 0xDA + str 32 | string | 0xDB + array 16 | array | 0xDC + array 32 | array | 0xDD + map 16 | object | 0xDE + map 32 | object | 0xDF + negative fixint | number_integer | 0xE0-0xFF + + @warning The mapping is **incomplete** in the sense that not all + MessagePack types can be converted to a JSON value. The following + MessagePack types are not supported and will yield parse errors: + - bin 8 - bin 32 (0xC4..0xC6) + - ext 8 - ext 32 (0xC7..0xC9) + - fixext 1 - fixext 16 (0xD4..0xD8) + + @note Any MessagePack output created @ref to_msgpack can be successfully + parsed by @ref from_msgpack. + + @param[in] i an input in MessagePack format convertible to an input + adapter + @param[in] strict whether to expect the input to be consumed until EOF + (true by default) + @param[in] allow_exceptions whether to throw exceptions in case of a + parse error (optional, true by default) + + @return deserialized JSON value; in case of a parse error and + @a allow_exceptions set to `false`, the return value will be + value_t::discarded. + + @throw parse_error.110 if the given input ends prematurely or the end of + file was not reached when @a strict was set to true + @throw parse_error.112 if unsupported features from MessagePack were + used in the given input @a i or if the input is not valid MessagePack + @throw parse_error.113 if a string was expected as map key, but not found + + @complexity Linear in the size of the input @a i. + + @liveexample{The example shows the deserialization of a byte vector in + MessagePack format to a JSON value.,from_msgpack} + + @sa http://msgpack.org + @sa @ref to_msgpack(const basic_json&) for the analogous serialization + @sa @ref from_cbor(detail::input_adapter&&, const bool, const bool) for the + related CBOR format + @sa @ref from_ubjson(detail::input_adapter&&, const bool, const bool) for + the related UBJSON format + @sa @ref from_bson(detail::input_adapter&&, const bool, const bool) for + the related BSON format + + @since version 2.0.9; parameter @a start_index since 2.1.1; changed to + consume input adapters, removed start_index parameter, and added + @a strict parameter since 3.0.0; added @a allow_exceptions parameter + since 3.2.0 + */ + JSON_NODISCARD + static basic_json from_msgpack(detail::input_adapter&& i, + const bool strict = true, + const bool allow_exceptions = true) + { + basic_json result; + detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions); + const bool res = binary_reader(detail::input_adapter(i)).sax_parse(input_format_t::msgpack, &sdp, strict); + return res ? result : basic_json(value_t::discarded); + } + + /*! + @copydoc from_msgpack(detail::input_adapter&&, const bool, const bool) + */ + template<typename A1, typename A2, + detail::enable_if_t<std::is_constructible<detail::input_adapter, A1, A2>::value, int> = 0> + JSON_NODISCARD + static basic_json from_msgpack(A1 && a1, A2 && a2, + const bool strict = true, + const bool allow_exceptions = true) + { + basic_json result; + detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions); + const bool res = binary_reader(detail::input_adapter(std::forward<A1>(a1), std::forward<A2>(a2))).sax_parse(input_format_t::msgpack, &sdp, strict); + return res ? result : basic_json(value_t::discarded); + } + + /*! + @brief create a JSON value from an input in UBJSON format + + Deserializes a given input @a i to a JSON value using the UBJSON (Universal + Binary JSON) serialization format. + + The library maps UBJSON types to JSON value types as follows: + + UBJSON type | JSON value type | marker + ----------- | --------------------------------------- | ------ + no-op | *no value, next value is read* | `N` + null | `null` | `Z` + false | `false` | `F` + true | `true` | `T` + float32 | number_float | `d` + float64 | number_float | `D` + uint8 | number_unsigned | `U` + int8 | number_integer | `i` + int16 | number_integer | `I` + int32 | number_integer | `l` + int64 | number_integer | `L` + string | string | `S` + char | string | `C` + array | array (optimized values are supported) | `[` + object | object (optimized values are supported) | `{` + + @note The mapping is **complete** in the sense that any UBJSON value can + be converted to a JSON value. + + @param[in] i an input in UBJSON format convertible to an input adapter + @param[in] strict whether to expect the input to be consumed until EOF + (true by default) + @param[in] allow_exceptions whether to throw exceptions in case of a + parse error (optional, true by default) + + @return deserialized JSON value; in case of a parse error and + @a allow_exceptions set to `false`, the return value will be + value_t::discarded. + + @throw parse_error.110 if the given input ends prematurely or the end of + file was not reached when @a strict was set to true + @throw parse_error.112 if a parse error occurs + @throw parse_error.113 if a string could not be parsed successfully + + @complexity Linear in the size of the input @a i. + + @liveexample{The example shows the deserialization of a byte vector in + UBJSON format to a JSON value.,from_ubjson} + + @sa http://ubjson.org + @sa @ref to_ubjson(const basic_json&, const bool, const bool) for the + analogous serialization + @sa @ref from_cbor(detail::input_adapter&&, const bool, const bool) for the + related CBOR format + @sa @ref from_msgpack(detail::input_adapter&&, const bool, const bool) for + the related MessagePack format + @sa @ref from_bson(detail::input_adapter&&, const bool, const bool) for + the related BSON format + + @since version 3.1.0; added @a allow_exceptions parameter since 3.2.0 + */ + JSON_NODISCARD + static basic_json from_ubjson(detail::input_adapter&& i, + const bool strict = true, + const bool allow_exceptions = true) + { + basic_json result; + detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions); + const bool res = binary_reader(detail::input_adapter(i)).sax_parse(input_format_t::ubjson, &sdp, strict); + return res ? result : basic_json(value_t::discarded); + } + + /*! + @copydoc from_ubjson(detail::input_adapter&&, const bool, const bool) + */ + template<typename A1, typename A2, + detail::enable_if_t<std::is_constructible<detail::input_adapter, A1, A2>::value, int> = 0> + JSON_NODISCARD + static basic_json from_ubjson(A1 && a1, A2 && a2, + const bool strict = true, + const bool allow_exceptions = true) + { + basic_json result; + detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions); + const bool res = binary_reader(detail::input_adapter(std::forward<A1>(a1), std::forward<A2>(a2))).sax_parse(input_format_t::ubjson, &sdp, strict); + return res ? result : basic_json(value_t::discarded); + } + + /*! + @brief Create a JSON value from an input in BSON format + + Deserializes a given input @a i to a JSON value using the BSON (Binary JSON) + serialization format. + + The library maps BSON record types to JSON value types as follows: + + BSON type | BSON marker byte | JSON value type + --------------- | ---------------- | --------------------------- + double | 0x01 | number_float + string | 0x02 | string + document | 0x03 | object + array | 0x04 | array + binary | 0x05 | still unsupported + undefined | 0x06 | still unsupported + ObjectId | 0x07 | still unsupported + boolean | 0x08 | boolean + UTC Date-Time | 0x09 | still unsupported + null | 0x0A | null + Regular Expr. | 0x0B | still unsupported + DB Pointer | 0x0C | still unsupported + JavaScript Code | 0x0D | still unsupported + Symbol | 0x0E | still unsupported + JavaScript Code | 0x0F | still unsupported + int32 | 0x10 | number_integer + Timestamp | 0x11 | still unsupported + 128-bit decimal float | 0x13 | still unsupported + Max Key | 0x7F | still unsupported + Min Key | 0xFF | still unsupported + + @warning The mapping is **incomplete**. The unsupported mappings + are indicated in the table above. + + @param[in] i an input in BSON format convertible to an input adapter + @param[in] strict whether to expect the input to be consumed until EOF + (true by default) + @param[in] allow_exceptions whether to throw exceptions in case of a + parse error (optional, true by default) + + @return deserialized JSON value; in case of a parse error and + @a allow_exceptions set to `false`, the return value will be + value_t::discarded. + + @throw parse_error.114 if an unsupported BSON record type is encountered + + @complexity Linear in the size of the input @a i. + + @liveexample{The example shows the deserialization of a byte vector in + BSON format to a JSON value.,from_bson} + + @sa http://bsonspec.org/spec.html + @sa @ref to_bson(const basic_json&) for the analogous serialization + @sa @ref from_cbor(detail::input_adapter&&, const bool, const bool) for the + related CBOR format + @sa @ref from_msgpack(detail::input_adapter&&, const bool, const bool) for + the related MessagePack format + @sa @ref from_ubjson(detail::input_adapter&&, const bool, const bool) for the + related UBJSON format + */ + JSON_NODISCARD + static basic_json from_bson(detail::input_adapter&& i, + const bool strict = true, + const bool allow_exceptions = true) + { + basic_json result; + detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions); + const bool res = binary_reader(detail::input_adapter(i)).sax_parse(input_format_t::bson, &sdp, strict); + return res ? result : basic_json(value_t::discarded); + } + + /*! + @copydoc from_bson(detail::input_adapter&&, const bool, const bool) + */ + template<typename A1, typename A2, + detail::enable_if_t<std::is_constructible<detail::input_adapter, A1, A2>::value, int> = 0> + JSON_NODISCARD + static basic_json from_bson(A1 && a1, A2 && a2, + const bool strict = true, + const bool allow_exceptions = true) + { + basic_json result; + detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions); + const bool res = binary_reader(detail::input_adapter(std::forward<A1>(a1), std::forward<A2>(a2))).sax_parse(input_format_t::bson, &sdp, strict); + return res ? result : basic_json(value_t::discarded); + } + + + + /// @} + + ////////////////////////// + // JSON Pointer support // + ////////////////////////// + + /// @name JSON Pointer functions + /// @{ + + /*! + @brief access specified element via JSON Pointer + + Uses a JSON pointer to retrieve a reference to the respective JSON value. + No bound checking is performed. Similar to @ref operator[](const typename + object_t::key_type&), `null` values are created in arrays and objects if + necessary. + + In particular: + - If the JSON pointer points to an object key that does not exist, it + is created an filled with a `null` value before a reference to it + is returned. + - If the JSON pointer points to an array index that does not exist, it + is created an filled with a `null` value before a reference to it + is returned. All indices between the current maximum and the given + index are also filled with `null`. + - The special value `-` is treated as a synonym for the index past the + end. + + @param[in] ptr a JSON pointer + + @return reference to the element pointed to by @a ptr + + @complexity Constant. + + @throw parse_error.106 if an array index begins with '0' + @throw parse_error.109 if an array index was not a number + @throw out_of_range.404 if the JSON pointer can not be resolved + + @liveexample{The behavior is shown in the example.,operatorjson_pointer} + + @since version 2.0.0 + */ + reference operator[](const json_pointer& ptr) + { + return ptr.get_unchecked(this); + } + + /*! + @brief access specified element via JSON Pointer + + Uses a JSON pointer to retrieve a reference to the respective JSON value. + No bound checking is performed. The function does not change the JSON + value; no `null` values are created. In particular, the the special value + `-` yields an exception. + + @param[in] ptr JSON pointer to the desired element + + @return const reference to the element pointed to by @a ptr + + @complexity Constant. + + @throw parse_error.106 if an array index begins with '0' + @throw parse_error.109 if an array index was not a number + @throw out_of_range.402 if the array index '-' is used + @throw out_of_range.404 if the JSON pointer can not be resolved + + @liveexample{The behavior is shown in the example.,operatorjson_pointer_const} + + @since version 2.0.0 + */ + const_reference operator[](const json_pointer& ptr) const + { + return ptr.get_unchecked(this); + } + + /*! + @brief access specified element via JSON Pointer + + Returns a reference to the element at with specified JSON pointer @a ptr, + with bounds checking. + + @param[in] ptr JSON pointer to the desired element + + @return reference to the element pointed to by @a ptr + + @throw parse_error.106 if an array index in the passed JSON pointer @a ptr + begins with '0'. See example below. + + @throw parse_error.109 if an array index in the passed JSON pointer @a ptr + is not a number. See example below. + + @throw out_of_range.401 if an array index in the passed JSON pointer @a ptr + is out of range. See example below. + + @throw out_of_range.402 if the array index '-' is used in the passed JSON + pointer @a ptr. As `at` provides checked access (and no elements are + implicitly inserted), the index '-' is always invalid. See example below. + + @throw out_of_range.403 if the JSON pointer describes a key of an object + which cannot be found. See example below. + + @throw out_of_range.404 if the JSON pointer @a ptr can not be resolved. + See example below. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes in the JSON value. + + @complexity Constant. + + @since version 2.0.0 + + @liveexample{The behavior is shown in the example.,at_json_pointer} + */ + reference at(const json_pointer& ptr) + { + return ptr.get_checked(this); + } + + /*! + @brief access specified element via JSON Pointer + + Returns a const reference to the element at with specified JSON pointer @a + ptr, with bounds checking. + + @param[in] ptr JSON pointer to the desired element + + @return reference to the element pointed to by @a ptr + + @throw parse_error.106 if an array index in the passed JSON pointer @a ptr + begins with '0'. See example below. + + @throw parse_error.109 if an array index in the passed JSON pointer @a ptr + is not a number. See example below. + + @throw out_of_range.401 if an array index in the passed JSON pointer @a ptr + is out of range. See example below. + + @throw out_of_range.402 if the array index '-' is used in the passed JSON + pointer @a ptr. As `at` provides checked access (and no elements are + implicitly inserted), the index '-' is always invalid. See example below. + + @throw out_of_range.403 if the JSON pointer describes a key of an object + which cannot be found. See example below. + + @throw out_of_range.404 if the JSON pointer @a ptr can not be resolved. + See example below. + + @exceptionsafety Strong guarantee: if an exception is thrown, there are no + changes in the JSON value. + + @complexity Constant. + + @since version 2.0.0 + + @liveexample{The behavior is shown in the example.,at_json_pointer_const} + */ + const_reference at(const json_pointer& ptr) const + { + return ptr.get_checked(this); + } + + /*! + @brief return flattened JSON value + + The function creates a JSON object whose keys are JSON pointers (see [RFC + 6901](https://tools.ietf.org/html/rfc6901)) and whose values are all + primitive. The original JSON value can be restored using the @ref + unflatten() function. + + @return an object that maps JSON pointers to primitive values + + @note Empty objects and arrays are flattened to `null` and will not be + reconstructed correctly by the @ref unflatten() function. + + @complexity Linear in the size the JSON value. + + @liveexample{The following code shows how a JSON object is flattened to an + object whose keys consist of JSON pointers.,flatten} + + @sa @ref unflatten() for the reverse function + + @since version 2.0.0 + */ + basic_json flatten() const + { + basic_json result(value_t::object); + json_pointer::flatten("", *this, result); + return result; + } + + /*! + @brief unflatten a previously flattened JSON value + + The function restores the arbitrary nesting of a JSON value that has been + flattened before using the @ref flatten() function. The JSON value must + meet certain constraints: + 1. The value must be an object. + 2. The keys must be JSON pointers (see + [RFC 6901](https://tools.ietf.org/html/rfc6901)) + 3. The mapped values must be primitive JSON types. + + @return the original JSON from a flattened version + + @note Empty objects and arrays are flattened by @ref flatten() to `null` + values and can not unflattened to their original type. Apart from + this example, for a JSON value `j`, the following is always true: + `j == j.flatten().unflatten()`. + + @complexity Linear in the size the JSON value. + + @throw type_error.314 if value is not an object + @throw type_error.315 if object values are not primitive + + @liveexample{The following code shows how a flattened JSON object is + unflattened into the original nested JSON object.,unflatten} + + @sa @ref flatten() for the reverse function + + @since version 2.0.0 + */ + basic_json unflatten() const + { + return json_pointer::unflatten(*this); + } + + /// @} + + ////////////////////////// + // JSON Patch functions // + ////////////////////////// + + /// @name JSON Patch functions + /// @{ + + /*! + @brief applies a JSON patch + + [JSON Patch](http://jsonpatch.com) defines a JSON document structure for + expressing a sequence of operations to apply to a JSON) document. With + this function, a JSON Patch is applied to the current JSON value by + executing all operations from the patch. + + @param[in] json_patch JSON patch document + @return patched document + + @note The application of a patch is atomic: Either all operations succeed + and the patched document is returned or an exception is thrown. In + any case, the original value is not changed: the patch is applied + to a copy of the value. + + @throw parse_error.104 if the JSON patch does not consist of an array of + objects + + @throw parse_error.105 if the JSON patch is malformed (e.g., mandatory + attributes are missing); example: `"operation add must have member path"` + + @throw out_of_range.401 if an array index is out of range. + + @throw out_of_range.403 if a JSON pointer inside the patch could not be + resolved successfully in the current JSON value; example: `"key baz not + found"` + + @throw out_of_range.405 if JSON pointer has no parent ("add", "remove", + "move") + + @throw other_error.501 if "test" operation was unsuccessful + + @complexity Linear in the size of the JSON value and the length of the + JSON patch. As usually only a fraction of the JSON value is affected by + the patch, the complexity can usually be neglected. + + @liveexample{The following code shows how a JSON patch is applied to a + value.,patch} + + @sa @ref diff -- create a JSON patch by comparing two JSON values + + @sa [RFC 6902 (JSON Patch)](https://tools.ietf.org/html/rfc6902) + @sa [RFC 6901 (JSON Pointer)](https://tools.ietf.org/html/rfc6901) + + @since version 2.0.0 + */ + basic_json patch(const basic_json& json_patch) const + { + // make a working copy to apply the patch to + basic_json result = *this; + + // the valid JSON Patch operations + enum class patch_operations {add, remove, replace, move, copy, test, invalid}; + + const auto get_op = [](const std::string & op) + { + if (op == "add") + { + return patch_operations::add; + } + if (op == "remove") + { + return patch_operations::remove; + } + if (op == "replace") + { + return patch_operations::replace; + } + if (op == "move") + { + return patch_operations::move; + } + if (op == "copy") + { + return patch_operations::copy; + } + if (op == "test") + { + return patch_operations::test; + } + + return patch_operations::invalid; + }; + + // wrapper for "add" operation; add value at ptr + const auto operation_add = [&result](json_pointer & ptr, basic_json val) + { + // adding to the root of the target document means replacing it + if (ptr.empty()) + { + result = val; + return; + } + + // make sure the top element of the pointer exists + json_pointer top_pointer = ptr.top(); + if (top_pointer != ptr) + { + result.at(top_pointer); + } + + // get reference to parent of JSON pointer ptr + const auto last_path = ptr.back(); + ptr.pop_back(); + basic_json& parent = result[ptr]; + + switch (parent.m_type) + { + case value_t::null: + case value_t::object: + { + // use operator[] to add value + parent[last_path] = val; + break; + } + + case value_t::array: + { + if (last_path == "-") + { + // special case: append to back + parent.push_back(val); + } + else + { + const auto idx = json_pointer::array_index(last_path); + if (JSON_UNLIKELY(static_cast<size_type>(idx) > parent.size())) + { + // avoid undefined behavior + JSON_THROW(out_of_range::create(401, "array index " + std::to_string(idx) + " is out of range")); + } + + // default case: insert add offset + parent.insert(parent.begin() + static_cast<difference_type>(idx), val); + } + break; + } + + // if there exists a parent it cannot be primitive + default: // LCOV_EXCL_LINE + assert(false); // LCOV_EXCL_LINE + } + }; + + // wrapper for "remove" operation; remove value at ptr + const auto operation_remove = [&result](json_pointer & ptr) + { + // get reference to parent of JSON pointer ptr + const auto last_path = ptr.back(); + ptr.pop_back(); + basic_json& parent = result.at(ptr); + + // remove child + if (parent.is_object()) + { + // perform range check + auto it = parent.find(last_path); + if (JSON_LIKELY(it != parent.end())) + { + parent.erase(it); + } + else + { + JSON_THROW(out_of_range::create(403, "key '" + last_path + "' not found")); + } + } + else if (parent.is_array()) + { + // note erase performs range check + parent.erase(static_cast<size_type>(json_pointer::array_index(last_path))); + } + }; + + // type check: top level value must be an array + if (JSON_UNLIKELY(not json_patch.is_array())) + { + JSON_THROW(parse_error::create(104, 0, "JSON patch must be an array of objects")); + } + + // iterate and apply the operations + for (const auto& val : json_patch) + { + // wrapper to get a value for an operation + const auto get_value = [&val](const std::string & op, + const std::string & member, + bool string_type) -> basic_json & + { + // find value + auto it = val.m_value.object->find(member); + + // context-sensitive error message + const auto error_msg = (op == "op") ? "operation" : "operation '" + op + "'"; + + // check if desired value is present + if (JSON_UNLIKELY(it == val.m_value.object->end())) + { + JSON_THROW(parse_error::create(105, 0, error_msg + " must have member '" + member + "'")); + } + + // check if result is of type string + if (JSON_UNLIKELY(string_type and not it->second.is_string())) + { + JSON_THROW(parse_error::create(105, 0, error_msg + " must have string member '" + member + "'")); + } + + // no error: return value + return it->second; + }; + + // type check: every element of the array must be an object + if (JSON_UNLIKELY(not val.is_object())) + { + JSON_THROW(parse_error::create(104, 0, "JSON patch must be an array of objects")); + } + + // collect mandatory members + const std::string op = get_value("op", "op", true); + const std::string path = get_value(op, "path", true); + json_pointer ptr(path); + + switch (get_op(op)) + { + case patch_operations::add: + { + operation_add(ptr, get_value("add", "value", false)); + break; + } + + case patch_operations::remove: + { + operation_remove(ptr); + break; + } + + case patch_operations::replace: + { + // the "path" location must exist - use at() + result.at(ptr) = get_value("replace", "value", false); + break; + } + + case patch_operations::move: + { + const std::string from_path = get_value("move", "from", true); + json_pointer from_ptr(from_path); + + // the "from" location must exist - use at() + basic_json v = result.at(from_ptr); + + // The move operation is functionally identical to a + // "remove" operation on the "from" location, followed + // immediately by an "add" operation at the target + // location with the value that was just removed. + operation_remove(from_ptr); + operation_add(ptr, v); + break; + } + + case patch_operations::copy: + { + const std::string from_path = get_value("copy", "from", true); + const json_pointer from_ptr(from_path); + + // the "from" location must exist - use at() + basic_json v = result.at(from_ptr); + + // The copy is functionally identical to an "add" + // operation at the target location using the value + // specified in the "from" member. + operation_add(ptr, v); + break; + } + + case patch_operations::test: + { + bool success = false; + JSON_TRY + { + // check if "value" matches the one at "path" + // the "path" location must exist - use at() + success = (result.at(ptr) == get_value("test", "value", false)); + } + JSON_INTERNAL_CATCH (out_of_range&) + { + // ignore out of range errors: success remains false + } + + // throw an exception if test fails + if (JSON_UNLIKELY(not success)) + { + JSON_THROW(other_error::create(501, "unsuccessful: " + val.dump())); + } + + break; + } + + default: + { + // op must be "add", "remove", "replace", "move", "copy", or + // "test" + JSON_THROW(parse_error::create(105, 0, "operation value '" + op + "' is invalid")); + } + } + } + + return result; + } + + /*! + @brief creates a diff as a JSON patch + + Creates a [JSON Patch](http://jsonpatch.com) so that value @a source can + be changed into the value @a target by calling @ref patch function. + + @invariant For two JSON values @a source and @a target, the following code + yields always `true`: + @code {.cpp} + source.patch(diff(source, target)) == target; + @endcode + + @note Currently, only `remove`, `add`, and `replace` operations are + generated. + + @param[in] source JSON value to compare from + @param[in] target JSON value to compare against + @param[in] path helper value to create JSON pointers + + @return a JSON patch to convert the @a source to @a target + + @complexity Linear in the lengths of @a source and @a target. + + @liveexample{The following code shows how a JSON patch is created as a + diff for two JSON values.,diff} + + @sa @ref patch -- apply a JSON patch + @sa @ref merge_patch -- apply a JSON Merge Patch + + @sa [RFC 6902 (JSON Patch)](https://tools.ietf.org/html/rfc6902) + + @since version 2.0.0 + */ + JSON_NODISCARD + static basic_json diff(const basic_json& source, const basic_json& target, + const std::string& path = "") + { + // the patch + basic_json result(value_t::array); + + // if the values are the same, return empty patch + if (source == target) + { + return result; + } + + if (source.type() != target.type()) + { + // different types: replace value + result.push_back( + { + {"op", "replace"}, {"path", path}, {"value", target} + }); + return result; + } + + switch (source.type()) + { + case value_t::array: + { + // first pass: traverse common elements + std::size_t i = 0; + while (i < source.size() and i < target.size()) + { + // recursive call to compare array values at index i + auto temp_diff = diff(source[i], target[i], path + "/" + std::to_string(i)); + result.insert(result.end(), temp_diff.begin(), temp_diff.end()); + ++i; + } + + // i now reached the end of at least one array + // in a second pass, traverse the remaining elements + + // remove my remaining elements + const auto end_index = static_cast<difference_type>(result.size()); + while (i < source.size()) + { + // add operations in reverse order to avoid invalid + // indices + result.insert(result.begin() + end_index, object( + { + {"op", "remove"}, + {"path", path + "/" + std::to_string(i)} + })); + ++i; + } + + // add other remaining elements + while (i < target.size()) + { + result.push_back( + { + {"op", "add"}, + {"path", path + "/" + std::to_string(i)}, + {"value", target[i]} + }); + ++i; + } + + break; + } + + case value_t::object: + { + // first pass: traverse this object's elements + for (auto it = source.cbegin(); it != source.cend(); ++it) + { + // escape the key name to be used in a JSON patch + const auto key = json_pointer::escape(it.key()); + + if (target.find(it.key()) != target.end()) + { + // recursive call to compare object values at key it + auto temp_diff = diff(it.value(), target[it.key()], path + "/" + key); + result.insert(result.end(), temp_diff.begin(), temp_diff.end()); + } + else + { + // found a key that is not in o -> remove it + result.push_back(object( + { + {"op", "remove"}, {"path", path + "/" + key} + })); + } + } + + // second pass: traverse other object's elements + for (auto it = target.cbegin(); it != target.cend(); ++it) + { + if (source.find(it.key()) == source.end()) + { + // found a key that is not in this -> add it + const auto key = json_pointer::escape(it.key()); + result.push_back( + { + {"op", "add"}, {"path", path + "/" + key}, + {"value", it.value()} + }); + } + } + + break; + } + + default: + { + // both primitive type: replace value + result.push_back( + { + {"op", "replace"}, {"path", path}, {"value", target} + }); + break; + } + } + + return result; + } + + /// @} + + //////////////////////////////// + // JSON Merge Patch functions // + //////////////////////////////// + + /// @name JSON Merge Patch functions + /// @{ + + /*! + @brief applies a JSON Merge Patch + + The merge patch format is primarily intended for use with the HTTP PATCH + method as a means of describing a set of modifications to a target + resource's content. This function applies a merge patch to the current + JSON value. + + The function implements the following algorithm from Section 2 of + [RFC 7396 (JSON Merge Patch)](https://tools.ietf.org/html/rfc7396): + + ``` + define MergePatch(Target, Patch): + if Patch is an Object: + if Target is not an Object: + Target = {} // Ignore the contents and set it to an empty Object + for each Name/Value pair in Patch: + if Value is null: + if Name exists in Target: + remove the Name/Value pair from Target + else: + Target[Name] = MergePatch(Target[Name], Value) + return Target + else: + return Patch + ``` + + Thereby, `Target` is the current object; that is, the patch is applied to + the current value. + + @param[in] apply_patch the patch to apply + + @complexity Linear in the lengths of @a patch. + + @liveexample{The following code shows how a JSON Merge Patch is applied to + a JSON document.,merge_patch} + + @sa @ref patch -- apply a JSON patch + @sa [RFC 7396 (JSON Merge Patch)](https://tools.ietf.org/html/rfc7396) + + @since version 3.0.0 + */ + void merge_patch(const basic_json& apply_patch) + { + if (apply_patch.is_object()) + { + if (not is_object()) + { + *this = object(); + } + for (auto it = apply_patch.begin(); it != apply_patch.end(); ++it) + { + if (it.value().is_null()) + { + erase(it.key()); + } + else + { + operator[](it.key()).merge_patch(it.value()); + } + } + } + else + { + *this = apply_patch; + } + } + + /// @} +}; +} // namespace nlohmann + +/////////////////////// +// nonmember support // +/////////////////////// + +// specialization of std::swap, and std::hash +namespace std +{ + +/// hash value for JSON objects +template<> +struct hash<nlohmann::json> +{ + /*! + @brief return a hash value for a JSON object + + @since version 1.0.0 + */ + std::size_t operator()(const nlohmann::json& j) const + { + // a naive hashing via the string representation + const auto& h = hash<nlohmann::json::string_t>(); + return h(j.dump()); + } +}; + +/// specialization for std::less<value_t> +/// @note: do not remove the space after '<', +/// see https://github.com/nlohmann/json/pull/679 +template<> +struct less< ::nlohmann::detail::value_t> +{ + /*! + @brief compare two value_t enum values + @since version 3.0.0 + */ + bool operator()(nlohmann::detail::value_t lhs, + nlohmann::detail::value_t rhs) const noexcept + { + return nlohmann::detail::operator<(lhs, rhs); + } +}; + +/*! +@brief exchanges the values of two JSON objects + +@since version 1.0.0 +*/ +template<> +inline void swap<nlohmann::json>(nlohmann::json& j1, nlohmann::json& j2) noexcept( + is_nothrow_move_constructible<nlohmann::json>::value and + is_nothrow_move_assignable<nlohmann::json>::value +) +{ + j1.swap(j2); +} + +} // namespace std + +/*! +@brief user-defined string literal for JSON values + +This operator implements a user-defined string literal for JSON objects. It +can be used by adding `"_json"` to a string literal and returns a JSON object +if no parse error occurred. + +@param[in] s a string representation of a JSON object +@param[in] n the length of string @a s +@return a JSON object + +@since version 1.0.0 +*/ +inline nlohmann::json operator "" _json(const char* s, std::size_t n) +{ + return nlohmann::json::parse(s, s + n); +} + +/*! +@brief user-defined string literal for JSON pointer + +This operator implements a user-defined string literal for JSON Pointers. It +can be used by adding `"_json_pointer"` to a string literal and returns a JSON pointer +object if no parse error occurred. + +@param[in] s a string representation of a JSON Pointer +@param[in] n the length of string @a s +@return a JSON pointer object + +@since version 2.0.0 +*/ +inline nlohmann::json::json_pointer operator "" _json_pointer(const char* s, std::size_t n) +{ + return nlohmann::json::json_pointer(std::string(s, n)); +} + +// #include <nlohmann/detail/macro_unscope.hpp> + + +// restore GCC/clang diagnostic settings +#if defined(__clang__) || defined(__GNUC__) || defined(__GNUG__) + #pragma GCC diagnostic pop +#endif +#if defined(__clang__) + #pragma GCC diagnostic pop +#endif + +// clean up +#undef JSON_INTERNAL_CATCH +#undef JSON_CATCH +#undef JSON_THROW +#undef JSON_TRY +#undef JSON_LIKELY +#undef JSON_UNLIKELY +#undef JSON_DEPRECATED +#undef JSON_NODISCARD +#undef JSON_HAS_CPP_14 +#undef JSON_HAS_CPP_17 +#undef NLOHMANN_BASIC_JSON_TPL_DECLARATION +#undef NLOHMANN_BASIC_JSON_TPL + + +#endif // INCLUDE_NLOHMANN_JSON_HPP_ diff --git a/tools/mapjson/.gitignore b/tools/mapjson/.gitignore new file mode 100644 index 0000000..a5d5684 --- /dev/null +++ b/tools/mapjson/.gitignore @@ -0,0 +1 @@ +mapjson diff --git a/tools/mapjson/Makefile b/tools/mapjson/Makefile new file mode 100644 index 0000000..d09acad --- /dev/null +++ b/tools/mapjson/Makefile @@ -0,0 +1,15 @@ +CXX := g++ + +CXXFLAGS := -Wall -std=c++11 -O2 + +SRCS := json11.cpp mapjson.cpp + +HEADERS := mapjson.h + +.PHONY: clean + +mapjson: $(SRCS) $(HEADERS) + $(CXX) $(CXXFLAGS) $(SRCS) -o $@ $(LDFLAGS) + +clean: + $(RM) mapjson mapjson.exe diff --git a/tools/mapjson/json11.cpp b/tools/mapjson/json11.cpp new file mode 100644 index 0000000..1da5302 --- /dev/null +++ b/tools/mapjson/json11.cpp @@ -0,0 +1,786 @@ +/* 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. + */ + +#include "json11.h" +#include <cassert> +#include <cmath> +#include <cstdlib> +#include <cstdio> +#include <limits> + +namespace json11 { + +static const int max_depth = 200; + +using std::string; +using std::vector; +using std::map; +using std::make_shared; +using std::initializer_list; +using std::move; + +/* Helper for representing null - just a do-nothing struct, plus comparison + * operators so the helpers in JsonValue work. We can't use nullptr_t because + * it may not be orderable. + */ +struct NullStruct { + bool operator==(NullStruct) const { return true; } + bool operator<(NullStruct) const { return false; } +}; + +/* * * * * * * * * * * * * * * * * * * * + * Serialization + */ + +static void dump(NullStruct, string &out) { + out += "null"; +} + +static void dump(double value, string &out) { + if (std::isfinite(value)) { + char buf[32]; + snprintf(buf, sizeof buf, "%.17g", value); + out += buf; + } else { + out += "null"; + } +} + +static void dump(int value, string &out) { + char buf[32]; + snprintf(buf, sizeof buf, "%d", value); + out += buf; +} + +static void dump(bool value, string &out) { + out += value ? "true" : "false"; +} + +static void dump(const string &value, string &out) { + out += '"'; + for (size_t i = 0; i < value.length(); i++) { + const char ch = value[i]; + if (ch == '\\') { + out += "\\\\"; + } else if (ch == '"') { + out += "\\\""; + } else if (ch == '\b') { + out += "\\b"; + } else if (ch == '\f') { + out += "\\f"; + } else if (ch == '\n') { + out += "\\n"; + } else if (ch == '\r') { + out += "\\r"; + } else if (ch == '\t') { + out += "\\t"; + } else if (static_cast<uint8_t>(ch) <= 0x1f) { + char buf[8]; + snprintf(buf, sizeof buf, "\\u%04x", ch); + out += buf; + } else if (static_cast<uint8_t>(ch) == 0xe2 && static_cast<uint8_t>(value[i+1]) == 0x80 + && static_cast<uint8_t>(value[i+2]) == 0xa8) { + out += "\\u2028"; + i += 2; + } else if (static_cast<uint8_t>(ch) == 0xe2 && static_cast<uint8_t>(value[i+1]) == 0x80 + && static_cast<uint8_t>(value[i+2]) == 0xa9) { + out += "\\u2029"; + i += 2; + } else { + out += ch; + } + } + out += '"'; +} + +static void dump(const Json::array &values, string &out) { + bool first = true; + out += "["; + for (const auto &value : values) { + if (!first) + out += ", "; + value.dump(out); + first = false; + } + out += "]"; +} + +static void dump(const Json::object &values, string &out) { + bool first = true; + out += "{"; + for (const auto &kv : values) { + if (!first) + out += ", "; + dump(kv.first, out); + out += ": "; + kv.second.dump(out); + first = false; + } + out += "}"; +} + +void Json::dump(string &out) const { + m_ptr->dump(out); +} + +/* * * * * * * * * * * * * * * * * * * * + * Value wrappers + */ + +template <Json::Type tag, typename T> +class Value : public JsonValue { +protected: + + // Constructors + explicit Value(const T &value) : m_value(value) {} + explicit Value(T &&value) : m_value(move(value)) {} + + // Get type tag + Json::Type type() const override { + return tag; + } + + // Comparisons + bool equals(const JsonValue * other) const override { + return m_value == static_cast<const Value<tag, T> *>(other)->m_value; + } + bool less(const JsonValue * other) const override { + return m_value < static_cast<const Value<tag, T> *>(other)->m_value; + } + + const T m_value; + void dump(string &out) const override { json11::dump(m_value, out); } +}; + +class JsonDouble final : public Value<Json::NUMBER, double> { + double number_value() const override { return m_value; } + int int_value() const override { return static_cast<int>(m_value); } + bool equals(const JsonValue * other) const override { return m_value == other->number_value(); } + bool less(const JsonValue * other) const override { return m_value < other->number_value(); } +public: + explicit JsonDouble(double value) : Value(value) {} +}; + +class JsonInt final : public Value<Json::NUMBER, int> { + double number_value() const override { return m_value; } + int int_value() const override { return m_value; } + bool equals(const JsonValue * other) const override { return m_value == other->number_value(); } + bool less(const JsonValue * other) const override { return m_value < other->number_value(); } +public: + explicit JsonInt(int value) : Value(value) {} +}; + +class JsonBoolean final : public Value<Json::BOOL, bool> { + bool bool_value() const override { return m_value; } +public: + explicit JsonBoolean(bool value) : Value(value) {} +}; + +class JsonString final : public Value<Json::STRING, string> { + const string &string_value() const override { return m_value; } +public: + explicit JsonString(const string &value) : Value(value) {} + explicit JsonString(string &&value) : Value(move(value)) {} +}; + +class JsonArray final : public Value<Json::ARRAY, Json::array> { + const Json::array &array_items() const override { return m_value; } + const Json & operator[](size_t i) const override; +public: + explicit JsonArray(const Json::array &value) : Value(value) {} + explicit JsonArray(Json::array &&value) : Value(move(value)) {} +}; + +class JsonObject final : public Value<Json::OBJECT, Json::object> { + const Json::object &object_items() const override { return m_value; } + const Json & operator[](const string &key) const override; +public: + explicit JsonObject(const Json::object &value) : Value(value) {} + explicit JsonObject(Json::object &&value) : Value(move(value)) {} +}; + +class JsonNull final : public Value<Json::NUL, NullStruct> { +public: + JsonNull() : Value({}) {} +}; + +/* * * * * * * * * * * * * * * * * * * * + * Static globals - static-init-safe + */ +struct Statics { + const std::shared_ptr<JsonValue> null = make_shared<JsonNull>(); + const std::shared_ptr<JsonValue> t = make_shared<JsonBoolean>(true); + const std::shared_ptr<JsonValue> f = make_shared<JsonBoolean>(false); + const string empty_string; + const vector<Json> empty_vector; + const map<string, Json> empty_map; + Statics() {} +}; + +static const Statics & statics() { + static const Statics s {}; + return s; +} + +static const Json & static_null() { + // This has to be separate, not in Statics, because Json() accesses statics().null. + static const Json json_null; + return json_null; +} + +/* * * * * * * * * * * * * * * * * * * * + * Constructors + */ + +Json::Json() noexcept : m_ptr(statics().null) {} +Json::Json(std::nullptr_t) noexcept : m_ptr(statics().null) {} +Json::Json(double value) : m_ptr(make_shared<JsonDouble>(value)) {} +Json::Json(int value) : m_ptr(make_shared<JsonInt>(value)) {} +Json::Json(bool value) : m_ptr(value ? statics().t : statics().f) {} +Json::Json(const string &value) : m_ptr(make_shared<JsonString>(value)) {} +Json::Json(string &&value) : m_ptr(make_shared<JsonString>(move(value))) {} +Json::Json(const char * value) : m_ptr(make_shared<JsonString>(value)) {} +Json::Json(const Json::array &values) : m_ptr(make_shared<JsonArray>(values)) {} +Json::Json(Json::array &&values) : m_ptr(make_shared<JsonArray>(move(values))) {} +Json::Json(const Json::object &values) : m_ptr(make_shared<JsonObject>(values)) {} +Json::Json(Json::object &&values) : m_ptr(make_shared<JsonObject>(move(values))) {} + +/* * * * * * * * * * * * * * * * * * * * + * Accessors + */ + +Json::Type Json::type() const { return m_ptr->type(); } +double Json::number_value() const { return m_ptr->number_value(); } +int Json::int_value() const { return m_ptr->int_value(); } +bool Json::bool_value() const { return m_ptr->bool_value(); } +const string & Json::string_value() const { return m_ptr->string_value(); } +const vector<Json> & Json::array_items() const { return m_ptr->array_items(); } +const map<string, Json> & Json::object_items() const { return m_ptr->object_items(); } +const Json & Json::operator[] (size_t i) const { return (*m_ptr)[i]; } +const Json & Json::operator[] (const string &key) const { return (*m_ptr)[key]; } + +double JsonValue::number_value() const { return 0; } +int JsonValue::int_value() const { return 0; } +bool JsonValue::bool_value() const { return false; } +const string & JsonValue::string_value() const { return statics().empty_string; } +const vector<Json> & JsonValue::array_items() const { return statics().empty_vector; } +const map<string, Json> & JsonValue::object_items() const { return statics().empty_map; } +const Json & JsonValue::operator[] (size_t) const { return static_null(); } +const Json & JsonValue::operator[] (const string &) const { return static_null(); } + +const Json & JsonObject::operator[] (const string &key) const { + auto iter = m_value.find(key); + return (iter == m_value.end()) ? static_null() : iter->second; +} +const Json & JsonArray::operator[] (size_t i) const { + if (i >= m_value.size()) return static_null(); + else return m_value[i]; +} + +/* * * * * * * * * * * * * * * * * * * * + * Comparison + */ + +bool Json::operator== (const Json &other) const { + if (m_ptr == other.m_ptr) + return true; + if (m_ptr->type() != other.m_ptr->type()) + return false; + + return m_ptr->equals(other.m_ptr.get()); +} + +bool Json::operator< (const Json &other) const { + if (m_ptr == other.m_ptr) + return false; + if (m_ptr->type() != other.m_ptr->type()) + return m_ptr->type() < other.m_ptr->type(); + + return m_ptr->less(other.m_ptr.get()); +} + +/* * * * * * * * * * * * * * * * * * * * + * Parsing + */ + +/* esc(c) + * + * Format char c suitable for printing in an error message. + */ +static inline string esc(char c) { + char buf[12]; + if (static_cast<uint8_t>(c) >= 0x20 && static_cast<uint8_t>(c) <= 0x7f) { + snprintf(buf, sizeof buf, "'%c' (%d)", c, c); + } else { + snprintf(buf, sizeof buf, "(%d)", c); + } + return string(buf); +} + +static inline bool in_range(long x, long lower, long upper) { + return (x >= lower && x <= upper); +} + +namespace { +/* JsonParser + * + * Object that tracks all state of an in-progress parse. + */ +struct JsonParser final { + + /* State + */ + const string &str; + size_t i; + string &err; + bool failed; + const JsonParse strategy; + + /* fail(msg, err_ret = Json()) + * + * Mark this parse as failed. + */ + Json fail(string &&msg) { + return fail(move(msg), Json()); + } + + template <typename T> + T fail(string &&msg, const T err_ret) { + if (!failed) + err = std::move(msg); + failed = true; + return err_ret; + } + + /* consume_whitespace() + * + * Advance until the current character is non-whitespace. + */ + void consume_whitespace() { + while (str[i] == ' ' || str[i] == '\r' || str[i] == '\n' || str[i] == '\t') + i++; + } + + /* consume_comment() + * + * Advance comments (c-style inline and multiline). + */ + bool consume_comment() { + bool comment_found = false; + if (str[i] == '/') { + i++; + if (i == str.size()) + return fail("unexpected end of input after start of comment", false); + if (str[i] == '/') { // inline comment + i++; + // advance until next line, or end of input + while (i < str.size() && str[i] != '\n') { + i++; + } + comment_found = true; + } + else if (str[i] == '*') { // multiline comment + i++; + if (i > str.size()-2) + return fail("unexpected end of input inside multi-line comment", false); + // advance until closing tokens + while (!(str[i] == '*' && str[i+1] == '/')) { + i++; + if (i > str.size()-2) + return fail( + "unexpected end of input inside multi-line comment", false); + } + i += 2; + comment_found = true; + } + else + return fail("malformed comment", false); + } + return comment_found; + } + + /* consume_garbage() + * + * Advance until the current character is non-whitespace and non-comment. + */ + void consume_garbage() { + consume_whitespace(); + if(strategy == JsonParse::COMMENTS) { + bool comment_found = false; + do { + comment_found = consume_comment(); + if (failed) return; + consume_whitespace(); + } + while(comment_found); + } + } + + /* get_next_token() + * + * Return the next non-whitespace character. If the end of the input is reached, + * flag an error and return 0. + */ + char get_next_token() { + consume_garbage(); + if (failed) return static_cast<char>(0); + if (i == str.size()) + return fail("unexpected end of input", static_cast<char>(0)); + + return str[i++]; + } + + /* encode_utf8(pt, out) + * + * Encode pt as UTF-8 and add it to out. + */ + void encode_utf8(long pt, string & out) { + if (pt < 0) + return; + + if (pt < 0x80) { + out += static_cast<char>(pt); + } else if (pt < 0x800) { + out += static_cast<char>((pt >> 6) | 0xC0); + out += static_cast<char>((pt & 0x3F) | 0x80); + } else if (pt < 0x10000) { + out += static_cast<char>((pt >> 12) | 0xE0); + out += static_cast<char>(((pt >> 6) & 0x3F) | 0x80); + out += static_cast<char>((pt & 0x3F) | 0x80); + } else { + out += static_cast<char>((pt >> 18) | 0xF0); + out += static_cast<char>(((pt >> 12) & 0x3F) | 0x80); + out += static_cast<char>(((pt >> 6) & 0x3F) | 0x80); + out += static_cast<char>((pt & 0x3F) | 0x80); + } + } + + /* parse_string() + * + * Parse a string, starting at the current position. + */ + string parse_string() { + string out; + long last_escaped_codepoint = -1; + while (true) { + if (i == str.size()) + return fail("unexpected end of input in string", ""); + + char ch = str[i++]; + + if (ch == '"') { + encode_utf8(last_escaped_codepoint, out); + return out; + } + + if (in_range(ch, 0, 0x1f)) + return fail("unescaped " + esc(ch) + " in string", ""); + + // The usual case: non-escaped characters + if (ch != '\\') { + encode_utf8(last_escaped_codepoint, out); + last_escaped_codepoint = -1; + out += ch; + continue; + } + + // Handle escapes + if (i == str.size()) + return fail("unexpected end of input in string", ""); + + ch = str[i++]; + + if (ch == 'u') { + // Extract 4-byte escape sequence + string esc = str.substr(i, 4); + // Explicitly check length of the substring. The following loop + // relies on std::string returning the terminating NUL when + // accessing str[length]. Checking here reduces brittleness. + if (esc.length() < 4) { + return fail("bad \\u escape: " + esc, ""); + } + for (size_t j = 0; j < 4; j++) { + if (!in_range(esc[j], 'a', 'f') && !in_range(esc[j], 'A', 'F') + && !in_range(esc[j], '0', '9')) + return fail("bad \\u escape: " + esc, ""); + } + + long codepoint = strtol(esc.data(), nullptr, 16); + + // JSON specifies that characters outside the BMP shall be encoded as a pair + // of 4-hex-digit \u escapes encoding their surrogate pair components. Check + // whether we're in the middle of such a beast: the previous codepoint was an + // escaped lead (high) surrogate, and this is a trail (low) surrogate. + if (in_range(last_escaped_codepoint, 0xD800, 0xDBFF) + && in_range(codepoint, 0xDC00, 0xDFFF)) { + // Reassemble the two surrogate pairs into one astral-plane character, per + // the UTF-16 algorithm. + encode_utf8((((last_escaped_codepoint - 0xD800) << 10) + | (codepoint - 0xDC00)) + 0x10000, out); + last_escaped_codepoint = -1; + } else { + encode_utf8(last_escaped_codepoint, out); + last_escaped_codepoint = codepoint; + } + + i += 4; + continue; + } + + encode_utf8(last_escaped_codepoint, out); + last_escaped_codepoint = -1; + + if (ch == 'b') { + out += '\b'; + } else if (ch == 'f') { + out += '\f'; + } else if (ch == 'n') { + out += '\n'; + } else if (ch == 'r') { + out += '\r'; + } else if (ch == 't') { + out += '\t'; + } else if (ch == '"' || ch == '\\' || ch == '/') { + out += ch; + } else { + return fail("invalid escape character " + esc(ch), ""); + } + } + } + + /* parse_number() + * + * Parse a double. + */ + Json parse_number() { + size_t start_pos = i; + + if (str[i] == '-') + i++; + + // Integer part + if (str[i] == '0') { + i++; + if (in_range(str[i], '0', '9')) + return fail("leading 0s not permitted in numbers"); + } else if (in_range(str[i], '1', '9')) { + i++; + while (in_range(str[i], '0', '9')) + i++; + } else { + return fail("invalid " + esc(str[i]) + " in number"); + } + + if (str[i] != '.' && str[i] != 'e' && str[i] != 'E' + && (i - start_pos) <= static_cast<size_t>(std::numeric_limits<int>::digits10)) { + return std::atoi(str.c_str() + start_pos); + } + + // Decimal part + if (str[i] == '.') { + i++; + if (!in_range(str[i], '0', '9')) + return fail("at least one digit required in fractional part"); + + while (in_range(str[i], '0', '9')) + i++; + } + + // Exponent part + if (str[i] == 'e' || str[i] == 'E') { + i++; + + if (str[i] == '+' || str[i] == '-') + i++; + + if (!in_range(str[i], '0', '9')) + return fail("at least one digit required in exponent"); + + while (in_range(str[i], '0', '9')) + i++; + } + + return std::strtod(str.c_str() + start_pos, nullptr); + } + + /* expect(str, res) + * + * Expect that 'str' starts at the character that was just read. If it does, advance + * the input and return res. If not, flag an error. + */ + Json expect(const string &expected, Json res) { + assert(i != 0); + i--; + if (str.compare(i, expected.length(), expected) == 0) { + i += expected.length(); + return res; + } else { + return fail("parse error: expected " + expected + ", got " + str.substr(i, expected.length())); + } + } + + /* parse_json() + * + * Parse a JSON object. + */ + Json parse_json(int depth) { + if (depth > max_depth) { + return fail("exceeded maximum nesting depth"); + } + + char ch = get_next_token(); + if (failed) + return Json(); + + if (ch == '-' || (ch >= '0' && ch <= '9')) { + i--; + return parse_number(); + } + + if (ch == 't') + return expect("true", true); + + if (ch == 'f') + return expect("false", false); + + if (ch == 'n') + return expect("null", Json()); + + if (ch == '"') + return parse_string(); + + if (ch == '{') { + map<string, Json> data; + ch = get_next_token(); + if (ch == '}') + return data; + + while (1) { + if (ch != '"') + return fail("expected '\"' in object, got " + esc(ch)); + + string key = parse_string(); + if (failed) + return Json(); + + ch = get_next_token(); + if (ch != ':') + return fail("expected ':' in object, got " + esc(ch)); + + data[std::move(key)] = parse_json(depth + 1); + if (failed) + return Json(); + + ch = get_next_token(); + if (ch == '}') + break; + if (ch != ',') + return fail("expected ',' in object, got " + esc(ch)); + + ch = get_next_token(); + } + return data; + } + + if (ch == '[') { + vector<Json> data; + ch = get_next_token(); + if (ch == ']') + return data; + + while (1) { + i--; + data.push_back(parse_json(depth + 1)); + if (failed) + return Json(); + + ch = get_next_token(); + if (ch == ']') + break; + if (ch != ',') + return fail("expected ',' in list, got " + esc(ch)); + + ch = get_next_token(); + (void)ch; + } + return data; + } + + return fail("expected value, got " + esc(ch)); + } +}; +}//namespace { + +Json Json::parse(const string &in, string &err, JsonParse strategy) { + JsonParser parser { in, 0, err, false, strategy }; + Json result = parser.parse_json(0); + + // Check for any trailing garbage + parser.consume_garbage(); + if (parser.failed) + return Json(); + if (parser.i != in.size()) + return parser.fail("unexpected trailing " + esc(in[parser.i])); + + return result; +} + +// Documented in json11.hpp +vector<Json> Json::parse_multi(const string &in, + std::string::size_type &parser_stop_pos, + string &err, + JsonParse strategy) { + JsonParser parser { in, 0, err, false, strategy }; + parser_stop_pos = 0; + vector<Json> json_vec; + while (parser.i != in.size() && !parser.failed) { + json_vec.push_back(parser.parse_json(0)); + if (parser.failed) + break; + + // Check for another object + parser.consume_garbage(); + if (parser.failed) + break; + parser_stop_pos = parser.i; + } + return json_vec; +} + +/* * * * * * * * * * * * * * * * * * * * + * Shape-checking + */ + +bool Json::has_shape(const shape & types, string & err) const { + if (!is_object()) { + err = "expected JSON object, got " + dump(); + return false; + } + + for (auto & item : types) { + if ((*this)[item.first].type() != item.second) { + err = "bad type for " + item.first + " in " + dump(); + return false; + } + } + + return true; +} + +} // namespace json11 diff --git a/tools/mapjson/json11.h b/tools/mapjson/json11.h new file mode 100644 index 0000000..c04c436 --- /dev/null +++ b/tools/mapjson/json11.h @@ -0,0 +1,230 @@ +/* json11 + * + * json11 is a tiny JSON library for C++11, providing JSON parsing and serialization. + * + * The core object provided by the library is json11::Json. A Json object represents any JSON + * value: null, bool, number (int or double), string (std::string), array (std::vector), or + * object (std::map). + * + * Json objects act like values: they can be assigned, copied, moved, compared for equality or + * order, etc. There are also helper methods Json::dump, to serialize a Json to a string, and + * Json::parse (static) to parse a std::string as a Json object. + * + * Internally, the various types of Json object are represented by the JsonValue class + * hierarchy. + * + * A note on numbers - JSON specifies the syntax of number formatting but not its semantics, + * so some JSON implementations distinguish between integers and floating-point numbers, while + * some don't. In json11, we choose the latter. Because some JSON implementations (namely + * Javascript itself) treat all numbers as the same type, distinguishing the two leads + * to JSON that will be *silently* changed by a round-trip through those implementations. + * Dangerous! To avoid that risk, json11 stores all numbers as double internally, but also + * provides integer helpers. + * + * Fortunately, double-precision IEEE754 ('double') can precisely store any integer in the + * range +/-2^53, which includes every 'int' on most systems. (Timestamps often use int64 + * or long long to avoid the Y2038K problem; a double storing microseconds since some epoch + * will be exact for +/- 275 years.) + */ + +/* 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. + */ + +#pragma once + +#include <string> +#include <vector> +#include <map> +#include <memory> +#include <initializer_list> + +#ifdef _MSC_VER + #if _MSC_VER <= 1800 // VS 2013 + #ifndef noexcept + #define noexcept throw() + #endif + + #ifndef snprintf + #define snprintf _snprintf_s + #endif + #endif +#endif + +namespace json11 { + +enum JsonParse { + STANDARD, COMMENTS +}; + +class JsonValue; + +class Json final { +public: + // Types + enum Type { + NUL, NUMBER, BOOL, STRING, ARRAY, OBJECT + }; + + // Array and object typedefs + typedef std::vector<Json> array; + typedef std::map<std::string, Json> object; + + // Constructors for the various types of JSON value. + Json() noexcept; // NUL + Json(std::nullptr_t) noexcept; // NUL + Json(double value); // NUMBER + Json(int value); // NUMBER + Json(bool value); // BOOL + Json(const std::string &value); // STRING + Json(std::string &&value); // STRING + Json(const char * value); // STRING + Json(const array &values); // ARRAY + Json(array &&values); // ARRAY + Json(const object &values); // OBJECT + Json(object &&values); // OBJECT + + // Implicit constructor: anything with a to_json() function. + template <class T, class = decltype(&T::to_json)> + Json(const T & t) : Json(t.to_json()) {} + + // Implicit constructor: map-like objects (std::map, std::unordered_map, etc) + template <class M, typename std::enable_if< + std::is_constructible<std::string, decltype(std::declval<M>().begin()->first)>::value + && std::is_constructible<Json, decltype(std::declval<M>().begin()->second)>::value, + int>::type = 0> + Json(const M & m) : Json(object(m.begin(), m.end())) {} + + // Implicit constructor: vector-like objects (std::list, std::vector, std::set, etc) + template <class V, typename std::enable_if< + std::is_constructible<Json, decltype(*std::declval<V>().begin())>::value, + int>::type = 0> + Json(const V & v) : Json(array(v.begin(), v.end())) {} + + // This prevents Json(some_pointer) from accidentally producing a bool. Use + // Json(bool(some_pointer)) if that behavior is desired. + Json(void *) = delete; + + // Accessors + Type type() const; + + bool is_null() const { return type() == NUL; } + bool is_number() const { return type() == NUMBER; } + bool is_bool() const { return type() == BOOL; } + bool is_string() const { return type() == STRING; } + bool is_array() const { return type() == ARRAY; } + bool is_object() const { return type() == OBJECT; } + + // Return the enclosed value if this is a number, 0 otherwise. Note that json11 does not + // distinguish between integer and non-integer numbers - number_value() and int_value() + // can both be applied to a NUMBER-typed object. + double number_value() const; + int int_value() const; + + // Return the enclosed value if this is a boolean, false otherwise. + bool bool_value() const; + // Return the enclosed string if this is a string, "" otherwise. + const std::string &string_value() const; + // Return the enclosed std::vector if this is an array, or an empty vector otherwise. + const array &array_items() const; + // Return the enclosed std::map if this is an object, or an empty map otherwise. + const object &object_items() const; + + // Return a reference to arr[i] if this is an array, Json() otherwise. + const Json & operator[](size_t i) const; + // Return a reference to obj[key] if this is an object, Json() otherwise. + const Json & operator[](const std::string &key) const; + + // Serialize. + void dump(std::string &out) const; + std::string dump() const { + std::string out; + dump(out); + return out; + } + + // Parse. If parse fails, return Json() and assign an error message to err. + static Json parse(const std::string & in, + std::string & err, + JsonParse strategy = JsonParse::STANDARD); + static Json parse(const char * in, + std::string & err, + JsonParse strategy = JsonParse::STANDARD) { + if (in) { + return parse(std::string(in), err, strategy); + } else { + err = "null input"; + return nullptr; + } + } + // Parse multiple objects, concatenated or separated by whitespace + static std::vector<Json> parse_multi( + const std::string & in, + std::string::size_type & parser_stop_pos, + std::string & err, + JsonParse strategy = JsonParse::STANDARD); + + static inline std::vector<Json> parse_multi( + const std::string & in, + std::string & err, + JsonParse strategy = JsonParse::STANDARD) { + std::string::size_type parser_stop_pos; + return parse_multi(in, parser_stop_pos, err, strategy); + } + + bool operator== (const Json &rhs) const; + bool operator< (const Json &rhs) const; + bool operator!= (const Json &rhs) const { return !(*this == rhs); } + bool operator<= (const Json &rhs) const { return !(rhs < *this); } + bool operator> (const Json &rhs) const { return (rhs < *this); } + bool operator>= (const Json &rhs) const { return !(*this < rhs); } + + /* has_shape(types, err) + * + * Return true if this is a JSON object and, for each item in types, has a field of + * the given type. If not, return false and set err to a descriptive message. + */ + typedef std::initializer_list<std::pair<std::string, Type>> shape; + bool has_shape(const shape & types, std::string & err) const; + +private: + std::shared_ptr<JsonValue> m_ptr; +}; + +// Internal class hierarchy - JsonValue objects are not exposed to users of this API. +class JsonValue { +protected: + friend class Json; + friend class JsonInt; + friend class JsonDouble; + virtual Json::Type type() const = 0; + virtual bool equals(const JsonValue * other) const = 0; + virtual bool less(const JsonValue * other) const = 0; + virtual void dump(std::string &out) const = 0; + virtual double number_value() const; + virtual int int_value() const; + virtual bool bool_value() const; + virtual const std::string &string_value() const; + virtual const Json::array &array_items() const; + virtual const Json &operator[](size_t i) const; + virtual const Json::object &object_items() const; + virtual const Json &operator[](const std::string &key) const; + virtual ~JsonValue() {} +}; + +} // namespace json11 diff --git a/tools/mapjson/mapjson.cpp b/tools/mapjson/mapjson.cpp new file mode 100644 index 0000000..607d2bf --- /dev/null +++ b/tools/mapjson/mapjson.cpp @@ -0,0 +1,674 @@ +// mapjson.cpp + +#include <iostream> +using std::cout; using std::endl; + +#include <string> +using std::string; + +#include <vector> +using std::vector; + +#include <algorithm> +using std::sort; using std::find; + +#include <map> +using std::map; + +#include <fstream> +using std::ofstream; using std::ifstream; + +#include <sstream> +using std::ostringstream; + +#include <limits> +using std::numeric_limits; + +#include "json11.h" +using json11::Json; + +#include "mapjson.h" + +string version; + +string read_text_file(string filepath) { + ifstream in_file(filepath); + + if (!in_file.is_open()) + FATAL_ERROR("Cannot open file %s for reading.\n", filepath.c_str()); + + string text; + + in_file.seekg(0, std::ios::end); + text.resize(in_file.tellg()); + + in_file.seekg(0, std::ios::beg); + in_file.read(&text[0], text.size()); + + in_file.close(); + + return text; +} + +void write_text_file(string filepath, string text) { + ofstream out_file(filepath, std::ofstream::binary); + + if (!out_file.is_open()) + FATAL_ERROR("Cannot open file %s for writing.\n", filepath.c_str()); + + out_file << text; + + out_file.close(); +} + +string generate_map_header_text(Json map_data, Json layouts_data) { + string map_layout_id = map_data["layout"].string_value(); + + vector<Json> matched; + + for (auto &field : layouts_data["layouts"].array_items()) { + if (map_layout_id == field["id"].string_value()) + matched.push_back(field); + } + + if (matched.size() != 1) + FATAL_ERROR("Failed to find matching layout for %s.\n", map_layout_id.c_str()); + + Json layout = matched[0]; + + ostringstream text; + + text << map_data["name"].string_value() << "::\n" + << "\t.4byte " << layout["name"].string_value() << "\n"; + + if (map_data.object_items().find("shared_events_map") != map_data.object_items().end()) + text << "\t.4byte " << map_data["shared_events_map"].string_value() << "_MapEvents\n"; + else + text << "\t.4byte " << map_data["name"].string_value() << "_MapEvents\n"; + + if (map_data.object_items().find("shared_scripts_map") != map_data.object_items().end()) + text << "\t.4byte " << map_data["shared_scripts_map"].string_value() << "_MapScripts\n"; + else + text << "\t.4byte " << map_data["name"].string_value() << "_MapScripts\n"; + + if (map_data.object_items().find("connections") != map_data.object_items().end() + && map_data["connections"].array_items().size() > 0 && map_data["connections_no_include"] == Json()) + text << "\t.4byte " << map_data["name"].string_value() << "_MapConnections\n"; + else + text << "\t.4byte 0x0\n"; + + text << "\t.2byte " << map_data["music"].string_value() << "\n" + << "\t.2byte " << layout["id"].string_value() << "\n" + << "\t.byte " << map_data["region_map_section"].string_value() << "\n" + << "\t.byte " << map_data["requires_flash"].bool_value() << "\n" + << "\t.byte " << map_data["weather"].string_value() << "\n" + << "\t.byte " << map_data["map_type"].string_value() << "\n"; + + if (version == "firered") + text << "\t.byte " << map_data["unknown_18"].int_value() << "\n" + << "\t.byte " << map_data["unknown_19"].int_value() << "\n"; + else + text << "\t.2byte 0\n"; + + if (version == "ruby") { + text << "\t.byte " << map_data["show_map_name"].bool_value() << "\n"; + } + else if (version == "emerald") { + text << "\tmap_header_flags " + << "allow_bike=" << map_data["allow_bike"].bool_value() << ", " + << "allow_escape_rope=" << map_data["allow_escape_rope"].bool_value() << ", " + << "allow_run=" << map_data["allow_running"].bool_value() << ", " + << "show_map_name=" << map_data["show_map_name"].bool_value() << "\n"; + } + else if (version == "firered") { + text << "\t.byte " << map_data["elevator_flag"].int_value() << "\n"; + } + + text << "\t.byte " << map_data["battle_scene"].string_value() << "\n\n"; + + return text.str(); +} + +string generate_map_connections_text(Json map_data) { + if (map_data["connections"] == Json()) + return string("\n"); + + ostringstream text; + + text << map_data["name"].string_value() << "_MapConnectionsList::\n"; + + for (auto &connection : map_data["connections"].array_items()) { + text << "\tconnection " + << connection["direction"].string_value() << ", " + << connection["offset"].int_value() << ", " + << connection["map"].string_value() << "\n"; + } + + text << "\n" << map_data["name"].string_value() << "_MapConnections::\n" + << "\t.4byte " << map_data["connections"].array_items().size() << "\n" + << "\t.4byte " << map_data["name"].string_value() << "_MapConnectionsList\n\n"; + + return text.str(); +} + +string generate_map_events_text(Json map_data) { + if (map_data.object_items().find("shared_events_map") != map_data.object_items().end()) + return string("\n"); + + ostringstream text; + + string objects_label, warps_label, coords_label, bgs_label; + + if (map_data["object_events"].array_items().size() > 0) { + objects_label = map_data["name"].string_value() + "_EventObjects"; + text << objects_label << ":\n"; + for (unsigned int i = 0; i < map_data["object_events"].array_items().size(); i++) { + auto obj_event = map_data["object_events"].array_items()[i]; + text << "\tobject_event " << i + 1 << ", " + << obj_event["graphics_id"].string_value() << ", 0, " + << obj_event["x"].int_value() << ", " + << obj_event["y"].int_value() << ", " + << obj_event["elevation"].int_value() << ", " + << obj_event["movement_type"].string_value() << ", " + << obj_event["movement_range_x"].int_value() << ", " + << obj_event["movement_range_y"].int_value() << ", " + << obj_event["trainer_type"].string_value() << ", " + << obj_event["trainer_sight_or_berry_tree_id"].string_value() << ", " + << obj_event["script"].string_value() << ", " + << obj_event["flag"].string_value() << "\n"; + } + text << "\n"; + } else { + objects_label = "0x0"; + } + + if (map_data["warp_events"].array_items().size() > 0) { + warps_label = map_data["name"].string_value() + "_MapWarps"; + text << warps_label << ":\n"; + for (auto &warp_event : map_data["warp_events"].array_items()) { + text << "\twarp_def " + << warp_event["x"].int_value() << ", " + << warp_event["y"].int_value() << ", " + << warp_event["elevation"].int_value() << ", " + << warp_event["dest_warp_id"].int_value() << ", " + << warp_event["dest_map"].string_value() << "\n"; + } + text << "\n"; + } else { + warps_label = "0x0"; + } + + if (map_data["coord_events"].array_items().size() > 0) { + coords_label = map_data["name"].string_value() + "_MapCoordEvents"; + text << coords_label << ":\n"; + for (auto &coord_event : map_data["coord_events"].array_items()) { + if (coord_event["type"].string_value() == "trigger") { + text << "\tcoord_event " + << coord_event["x"].int_value() << ", " + << coord_event["y"].int_value() << ", " + << coord_event["elevation"].int_value() << ", " + << coord_event["var"].string_value() << ", " + << coord_event["var_value"].string_value() << ", " + << coord_event["script"].string_value() << "\n"; + } + else if (coord_event["type"] == "weather") { + text << "\tcoord_weather_event " + << coord_event["x"].int_value() << ", " + << coord_event["y"].int_value() << ", " + << coord_event["elevation"].int_value() << ", " + << coord_event["weather"].string_value() << "\n"; + } + } + text << "\n"; + } else { + coords_label = "0x0"; + } + + if (map_data["bg_events"].array_items().size() > 0) { + bgs_label = map_data["name"].string_value() + "_MapBGEvents"; + text << bgs_label << ":\n"; + for (auto &bg_event : map_data["bg_events"].array_items()) { + if (bg_event["type"] == "sign") { + text << "\tbg_event " + << bg_event["x"].int_value() << ", " + << bg_event["y"].int_value() << ", " + << bg_event["elevation"].int_value() << ", " + << bg_event["player_facing_dir"].string_value() << ", " + << bg_event["script"].string_value() << "\n"; + } + else if (bg_event["type"] == "hidden_item") { + text << "\tbg_hidden_item_event " + << bg_event["x"].int_value() << ", " + << bg_event["y"].int_value() << ", " + << bg_event["elevation"].int_value() << ", " + << bg_event["item"].string_value() << ", " + << bg_event["flag"].string_value() << "\n"; + } + else if (bg_event["type"] == "secret_base") { + text << "\tbg_secret_base_event " + << bg_event["x"].int_value() << ", " + << bg_event["y"].int_value() << ", " + << bg_event["elevation"].int_value() << ", " + << bg_event["secret_base_id"].string_value() << "\n"; + } + } + text << "\n"; + } else { + bgs_label = "0x0"; + } + + text << map_data["name"].string_value() << "_MapEvents::\n" + << "\tmap_events " << objects_label << ", " << warps_label << ", " + << coords_label << ", " << bgs_label << "\n\n"; + + return text.str(); +} + +string generate_firered_map_events_text(Json map_data) { + ostringstream text; + + string objects_label, warps_label, coords_label, bgs_label; + + if (map_data["object_events"].array_items().size() > 0) { + objects_label = map_data["name"].string_value() + "_EventObjects"; + text << objects_label << "::\n"; + for (unsigned int i = 0; i < map_data["object_events"].array_items().size(); i++) { + auto obj_event = map_data["object_events"].array_items()[i]; + text << "\tobject_event " << i + 1 << ", " + << obj_event["graphics_id"].string_value() << ", " + << obj_event["x"].int_value() << ", " + << obj_event["y"].int_value() << ", " + << obj_event["elevation"].int_value() << ", " + << obj_event["movement_type"].string_value() << ", " + << obj_event["movement_range_x"].int_value() << ", " + << obj_event["movement_range_y"].int_value() << ", " + << obj_event["trainer_type"].int_value() << ", " + << obj_event["trainer_sight_or_berry_tree_id"].int_value() << ", " + << obj_event["script"].string_value() << ", " + << obj_event["flag"].string_value() << "\n"; + } + text << "\n"; + } else { + objects_label = "0x0"; + } + + if (map_data["warp_events"].array_items().size() > 0) { + warps_label = map_data["name"].string_value() + "_MapWarps"; + text << warps_label << "::\n"; + for (auto &warp_event : map_data["warp_events"].array_items()) { + text << "\twarp_def " + << warp_event["x"].int_value() << ", " + << warp_event["y"].int_value() << ", " + << warp_event["elevation"].int_value() << ", " + << warp_event["dest_warp_id"].int_value() << ", " + << warp_event["dest_map"].string_value() << "\n"; + } + text << "\n"; + } else { + warps_label = "0x0"; + } + + if (map_data["coord_events"].array_items().size() > 0) { + coords_label = map_data["name"].string_value() + "_MapCoordEvents"; + text << coords_label << "::\n"; + for (auto &coord_event : map_data["coord_events"].array_items()) { + if (coord_event["type"].string_value() == "trigger") { + text << "\tcoord_event " + << coord_event["x"].int_value() << ", " + << coord_event["y"].int_value() << ", " + << coord_event["elevation"].int_value() << ", 0, " + << coord_event["var"].string_value() << ", " + << coord_event["var_value"].int_value() << ", 0, " + << coord_event["script"].string_value() << "\n"; + } + else if (coord_event["type"] == "weather") { + text << "\tcoord_weather_event " + << coord_event["x"].int_value() << ", " + << coord_event["y"].int_value() << ", " + << coord_event["elevation"].int_value() << ", " + << coord_event["weather"].string_value() << "\n"; + } + } + text << "\n"; + } else { + coords_label = "0x0"; + } + + if (map_data["bg_events"].array_items().size() > 0) { + bgs_label = map_data["name"].string_value() + "_MapBGEvents"; + text << bgs_label << "::\n"; + for (auto &bg_event : map_data["bg_events"].array_items()) { + if (bg_event["type"] == "hidden_item") { + text << "\tbg_hidden_item_event " + << bg_event["x"].int_value() << ", " + << bg_event["y"].int_value() << ", " + << bg_event["elevation"].int_value() << ", " + << bg_event["item"].string_value() << ", " + << bg_event["flag"].string_value() << ", " + << bg_event["unknown"].int_value() << "\n"; + } + else { + string type_string = bg_event["type"].string_value(); + type_string.erase(0, 14); + int type = std::stoi(type_string); + text << "\tbg_event " + << bg_event["x"].int_value() << ", " + << bg_event["y"].int_value() << ", " + << bg_event["elevation"].int_value() << ", " + << type << ", 0, " + << bg_event["script"].string_value() << "\n"; + } + } + text << "\n"; + } else { + bgs_label = "0x0"; + } + + text << map_data["name"].string_value() << "_MapEvents::\n" + << "\tmap_events " << objects_label << ", " << warps_label << ", " + << coords_label << ", " << bgs_label << "\n\n"; + + return text.str(); +} + +string get_directory_name(string filename) { + size_t dir_pos = filename.find_last_of("/\\"); + + return filename.substr(0, dir_pos + 1); +} + +void process_map(string map_filepath, string layouts_filepath) { + string mapdata_err, layouts_err; + + string mapdata_json_text = read_text_file(map_filepath); + string layouts_json_text = read_text_file(layouts_filepath); + + Json map_data = Json::parse(mapdata_json_text, mapdata_err); + if (map_data == Json()) + FATAL_ERROR("%s\n", mapdata_err.c_str()); + + Json layouts_data = Json::parse(layouts_json_text, layouts_err); + if (layouts_data == Json()) + FATAL_ERROR("%s\n", layouts_err.c_str()); + + string header_text = generate_map_header_text(map_data, layouts_data); + string events_text = version == "firered" ? generate_firered_map_events_text(map_data) + : generate_map_events_text(map_data); + string connections_text = generate_map_connections_text(map_data); + + string files_dir = get_directory_name(map_filepath); + write_text_file(files_dir + "header.inc", header_text); + write_text_file(files_dir + "events.inc", events_text); + write_text_file(files_dir + "connections.inc", connections_text); +} + +string generate_groups_text(Json groups_data) { + ostringstream text; + + for (auto &key : groups_data["group_order"].array_items()) { + string group = key.string_value(); + text << group << "::\n"; + auto maps = groups_data[group].array_items(); + for (Json &map_name : maps) + text << "\t.4byte " << map_name.string_value() << "\n"; + text << "\n"; + } + + if (version != "firered") + text << "\t.align 2\n"; + + text << "gMapGroups::\n"; + for (auto &group : groups_data["group_order"].array_items()) + text << "\t.4byte " << group.string_value() << "\n"; + text << "\n"; + + return text.str(); +} + +string generate_connections_text(Json groups_data) { + vector<Json> map_names; + + for (auto &group : groups_data["group_order"].array_items()) + for (auto map_name : groups_data[group.string_value()].array_items()) + map_names.push_back(map_name); + + vector<Json> connections_include_order = groups_data["connections_include_order"].array_items(); + + if (connections_include_order.size() > 0) + sort(map_names.begin(), map_names.end(), [connections_include_order](const Json &a, const Json &b) { + auto iter_a = find(connections_include_order.begin(), connections_include_order.end(), a); + if (iter_a == connections_include_order.end()) + iter_a = connections_include_order.begin() + numeric_limits<int>::max(); + auto iter_b = find(connections_include_order.begin(), connections_include_order.end(), b); + if (iter_b == connections_include_order.end()) + iter_b = connections_include_order.begin() + numeric_limits<int>::max(); + return iter_a < iter_b; + }); + + ostringstream text; + + for (Json map_name : map_names) + text << "\t.include \"data/maps/" << map_name.string_value() << "/connections.inc\"\n"; + + return text.str(); +} + +string generate_headers_text(Json groups_data) { + vector<string> map_names; + + for (auto &group : groups_data["group_order"].array_items()) + for (auto map_name : groups_data[group.string_value()].array_items()) + map_names.push_back(map_name.string_value()); + + ostringstream text; + + for (string map_name : map_names) + text << "\t.include \"data/maps/" << map_name << "/header.inc\"\n"; + + return text.str(); +} + +string generate_events_text(Json groups_data) { + vector<string> map_names; + + for (auto &group : groups_data["group_order"].array_items()) + for (auto map_name : groups_data[group.string_value()].array_items()) + map_names.push_back(map_name.string_value()); + + ostringstream text; + + for (string map_name : map_names) + text << "\t.include \"data/maps/" << map_name << "/events.inc\"\n"; + + return text.str(); +} + +string generate_map_constants_text(string groups_filepath, Json groups_data) { + string file_dir = get_directory_name(groups_filepath); + char dir_separator = file_dir.back(); + + ostringstream text; + + text << "#ifndef GUARD_CONSTANTS_MAP_GROUPS_H\n" + << "#define GUARD_CONSTANTS_MAP_GROUPS_H\n\n"; + + int group_num = 0; + + for (auto &group : groups_data["group_order"].array_items()) { + text << "// Map Group " << group_num << "\n"; + vector<Json> map_ids; + size_t max_length = 0; + + for (auto &map_name : groups_data[group.string_value()].array_items()) { + string header_filepath = file_dir + map_name.string_value() + dir_separator + "map.json"; + string err_str; + Json map_data = Json::parse(read_text_file(header_filepath), err_str); + map_ids.push_back(map_data["id"]); + if (map_data["id"].string_value().length() > max_length) + max_length = map_data["id"].string_value().length(); + } + + int map_id_num = 0; + for (Json map_id : map_ids) { + text << "#define " << map_id.string_value() << string((max_length - map_id.string_value().length() + 1), ' ') + << "(" << map_id_num++ << " | (" << group_num << " << 8))\n"; + } + text << "\n"; + + group_num++; + } + + text << "#define MAP_GROUPS_COUNT " << group_num << "\n\n"; + text << "#endif // GUARD_CONSTANTS_MAP_GROUPS_H\n"; + + return text.str(); +} + +void process_groups(string groups_filepath) { + string err; + Json groups_data = Json::parse(read_text_file(groups_filepath), err); + + if (groups_data == Json()) + FATAL_ERROR("%s\n", err.c_str()); + + string groups_text = generate_groups_text(groups_data); + string connections_text = generate_connections_text(groups_data); + string headers_text = generate_headers_text(groups_data); + string events_text = generate_events_text(groups_data); + string map_header_text = generate_map_constants_text(groups_filepath, groups_data); + + string file_dir = get_directory_name(groups_filepath); + char s = file_dir.back(); + + write_text_file(file_dir + "groups.inc", groups_text); + write_text_file(file_dir + "connections.inc", connections_text); + write_text_file(file_dir + "headers.inc", headers_text); + write_text_file(file_dir + "events.inc", events_text); + write_text_file(file_dir + ".." + s + ".." + s + "include" + s + "constants" + s + "map_groups.h", map_header_text); +} + +string generate_layout_headers_text(Json layouts_data) { + ostringstream text; + + for (auto &layout : layouts_data["layouts"].array_items()) { + if (layout == Json::object()) continue; + string border_label = layout["name"].string_value() + "_Border"; + string blockdata_label = layout["name"].string_value() + "_Blockdata"; + text << border_label << "::\n" + << "\t.incbin \"" << layout["border_filepath"].string_value() << "\"\n\n" + << blockdata_label << "::\n" + << "\t.incbin \"" << layout["blockdata_filepath"].string_value() << "\"\n\n" + << "\t.align 2\n" + << layout["name"].string_value() << "::\n" + << "\t.4byte " << layout["width"].int_value() << "\n" + << "\t.4byte " << layout["height"].int_value() << "\n" + << "\t.4byte " << border_label << "\n" + << "\t.4byte " << blockdata_label << "\n" + << "\t.4byte " << layout["primary_tileset"].string_value() << "\n" + << "\t.4byte " << layout["secondary_tileset"].string_value() << "\n"; + + if (version == "firered") { + text << "\t.byte " << layout["border_width"].int_value() << "\n" + << "\t.byte " << layout["border_height"].int_value() << "\n" + << "\t.2byte 0\n"; + } + + text << "\n"; + } + + return text.str(); +} + +string generate_layouts_table_text(Json layouts_data) { + ostringstream text; + + text << "\t.align 2\n" + << layouts_data["layouts_table_label"].string_value() << "::\n"; + + for (auto &layout : layouts_data["layouts"].array_items()) { + string layout_name = layout["name"].string_value(); + if (layout_name.empty()) layout_name = "NULL"; + text << "\t.4byte " << layout_name << "\n"; + } + + return text.str(); +} + +string generate_layouts_constants_text(Json layouts_data) { + ostringstream text; + + text << "#ifndef GUARD_CONSTANTS_LAYOUTS_H\n" + << "#define GUARD_CONSTANTS_LAYOUTS_H\n\n"; + + int i = 1; + for (auto &layout : layouts_data["layouts"].array_items()) { + if (layout != Json::object()) + text << "#define " << layout["id"].string_value() << " " << i << "\n"; + i++; + } + + text << "\n#endif // GUARD_CONSTANTS_LAYOUTS_H\n"; + + return text.str(); +} + +void process_layouts(string layouts_filepath) { + string err; + Json layouts_data = Json::parse(read_text_file(layouts_filepath), err); + + if (layouts_data == Json()) + FATAL_ERROR("%s\n", err.c_str()); + + string layout_headers_text = generate_layout_headers_text(layouts_data); + string layouts_table_text = generate_layouts_table_text(layouts_data); + string layouts_constants_text = generate_layouts_constants_text(layouts_data); + + string file_dir = get_directory_name(layouts_filepath); + char s = file_dir.back(); + + write_text_file(file_dir + "layouts.inc", layout_headers_text); + write_text_file(file_dir + "layouts_table.inc", layouts_table_text); + write_text_file(file_dir + ".." + s + ".." + s + "include" + s + "constants" + s + "layouts.h", layouts_constants_text); +} + +int main(int argc, char *argv[]) { + if (argc < 3) + FATAL_ERROR("USAGE: mapjson <mode> <game-version> [options]\n"); + + version = argv[2]; + if (version != "emerald" && version != "ruby" && version != "firered") + FATAL_ERROR("ERROR: <game-version> must be 'emerald', 'firered', or 'ruby'.\n"); + + char *mode_arg = argv[1]; + string mode(mode_arg); + if (mode != "layouts" && mode != "map" && mode != "groups") + FATAL_ERROR("ERROR: <mode> must be 'layouts', 'map', or 'groups'.\n"); + + if (mode == "map") { + if (argc != 5) + FATAL_ERROR("USAGE: mapjson map <game-version> <map_file> <layouts_file>\n"); + + string filepath(argv[3]); + string layouts_filepath(argv[4]); + + process_map(filepath, layouts_filepath); + } + else if (mode == "groups") { + if (argc != 4) + FATAL_ERROR("USAGE: mapjson groups <game-version> <groups_file>\n"); + + string filepath(argv[3]); + + process_groups(filepath); + } + else if (mode == "layouts") { + if (argc != 4) + FATAL_ERROR("USAGE: mapjson layouts <game-version> <layouts_file>\n"); + + string filepath(argv[3]); + + process_layouts(filepath); + } + + return 0; +} diff --git a/tools/mapjson/mapjson.h b/tools/mapjson/mapjson.h new file mode 100644 index 0000000..6e961a2 --- /dev/null +++ b/tools/mapjson/mapjson.h @@ -0,0 +1,31 @@ +// mapjson.h + +#ifndef MAPJSON_H +#define MAPJSON_H + +#include <cstdio> +using std::fprintf; using std::exit; + +#include <cstdlib> + +#ifdef _MSC_VER + +#define FATAL_ERROR(format, ...) \ +do \ +{ \ + fprintf(stderr, format, __VA_ARGS__); \ + exit(1); \ +} while (0) + +#else + +#define FATAL_ERROR(format, ...) \ +do \ +{ \ + fprintf(stderr, format, ##__VA_ARGS__); \ + exit(1); \ +} while (0) + +#endif // _MSC_VER + +#endif // MAPJSON_H diff --git a/tools/mid2agb/.gitignore b/tools/mid2agb/.gitignore new file mode 100644 index 0000000..0e7264c --- /dev/null +++ b/tools/mid2agb/.gitignore @@ -0,0 +1 @@ +mid2agb diff --git a/tools/mid2agb/LICENSE b/tools/mid2agb/LICENSE new file mode 100644 index 0000000..534d153 --- /dev/null +++ b/tools/mid2agb/LICENSE @@ -0,0 +1,19 @@ +Copyright (c) 2016 YamaArashi + +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. diff --git a/tools/mid2agb/Makefile b/tools/mid2agb/Makefile new file mode 100644 index 0000000..77f96db --- /dev/null +++ b/tools/mid2agb/Makefile @@ -0,0 +1,18 @@ +CXX := g++ + +CXXFLAGS := -std=c++11 -O2 -Wall -Wno-switch -Werror + +SRCS := agb.cpp error.cpp main.cpp midi.cpp tables.cpp + +HEADERS := agb.h error.h main.h midi.h tables.h + +.PHONY: all clean + +all: mid2agb + @: + +mid2agb: $(SRCS) $(HEADERS) + $(CXX) $(CXXFLAGS) $(SRCS) -o $@ $(LDFLAGS) + +clean: + $(RM) mid2agb mid2agb.exe diff --git a/tools/mid2agb/agb.cpp b/tools/mid2agb/agb.cpp new file mode 100644 index 0000000..d4d79f1 --- /dev/null +++ b/tools/mid2agb/agb.cpp @@ -0,0 +1,547 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#include <cstdio> +#include <cstdarg> +#include <cstring> +#include <vector> +#include "agb.h" +#include "main.h" +#include "midi.h" +#include "tables.h" + +int g_agbTrack; + +static std::string s_lastOpName; +static int s_blockNum; +static bool s_keepLastOpName; +static int s_lastNote; +static int s_lastVelocity; +static bool s_noteChanged; +static bool s_velocityChanged; +static bool s_inPattern; +static int s_extendedCommand; +static int s_memaccOp; +static int s_memaccParam1; +static int s_memaccParam2; + +void PrintAgbHeader() +{ + std::fprintf(g_outputFile, "\t.include \"MPlayDef.s\"\n\n"); + std::fprintf(g_outputFile, "\t.equ\t%s_grp, voicegroup%03u\n", g_asmLabel.c_str(), g_voiceGroup); + std::fprintf(g_outputFile, "\t.equ\t%s_pri, %u\n", g_asmLabel.c_str(), g_priority); + + if (g_reverb >= 0) + std::fprintf(g_outputFile, "\t.equ\t%s_rev, reverb_set+%u\n", g_asmLabel.c_str(), g_reverb); + else + std::fprintf(g_outputFile, "\t.equ\t%s_rev, 0\n", g_asmLabel.c_str()); + + std::fprintf(g_outputFile, "\t.equ\t%s_mvl, %u\n", g_asmLabel.c_str(), g_masterVolume); + std::fprintf(g_outputFile, "\t.equ\t%s_key, %u\n", g_asmLabel.c_str(), 0); + std::fprintf(g_outputFile, "\t.equ\t%s_tbs, %u\n", g_asmLabel.c_str(), g_clocksPerBeat); + std::fprintf(g_outputFile, "\t.equ\t%s_exg, %u\n", g_asmLabel.c_str(), g_exactGateTime); + std::fprintf(g_outputFile, "\t.equ\t%s_cmp, %u\n", g_asmLabel.c_str(), g_compressionEnabled); + + std::fprintf(g_outputFile, "\n\t.section .rodata\n"); + std::fprintf(g_outputFile, "\t.global\t%s\n", g_asmLabel.c_str()); + + std::fprintf(g_outputFile, "\t.align\t2\n"); +} + +void ResetTrackVars() +{ + s_lastVelocity = -1; + s_lastNote = -1; + s_velocityChanged = false; + s_noteChanged = false; + s_keepLastOpName = false; + s_lastOpName = ""; + s_inPattern = false; +} + +void PrintWait(int wait) +{ + if (wait > 0) + { + std::fprintf(g_outputFile, "\t.byte\tW%02d\n", wait); + s_velocityChanged = true; + s_noteChanged = true; + s_keepLastOpName = true; + } +} + +void PrintOp(int wait, std::string name, const char *format, ...) +{ + std::va_list args; + va_start(args, format); + std::fprintf(g_outputFile, "\t.byte\t\t"); + + if (format != nullptr) + { + if (!g_compressionEnabled || s_lastOpName != name) + { + std::fprintf(g_outputFile, "%s, ", name.c_str()); + s_lastOpName = name; + } + else + { + std::fprintf(g_outputFile, " "); + } + std::vfprintf(g_outputFile, format, args); + } + else + { + std::fputs(name.c_str(), g_outputFile); + s_lastOpName = name; + } + + std::fprintf(g_outputFile, "\n"); + + va_end(args); + + PrintWait(wait); +} + +void PrintByte(const char *format, ...) +{ + std::va_list args; + va_start(args, format); + std::fprintf(g_outputFile, "\t.byte\t"); + std::vfprintf(g_outputFile, format, args); + std::fprintf(g_outputFile, "\n"); + s_velocityChanged = true; + s_noteChanged = true; + s_keepLastOpName = true; + va_end(args); +} + +void PrintWord(const char *format, ...) +{ + std::va_list args; + va_start(args, format); + std::fprintf(g_outputFile, "\t .word\t"); + std::vfprintf(g_outputFile, format, args); + std::fprintf(g_outputFile, "\n"); + va_end(args); +} + +void PrintNote(const Event& event) +{ + int note = event.note; + int velocity = g_noteVelocityLUT[event.param1]; + int duration = -1; + + if (event.param2 != -1) + duration = g_noteDurationLUT[event.param2]; + + int gateTimeParam = 0; + + if (g_exactGateTime && duration != -1) + gateTimeParam = event.param2 - duration; + + char gtpBuf[16]; + + if (gateTimeParam > 0) + std::snprintf(gtpBuf, sizeof(gtpBuf), ", gtp%u", gateTimeParam); + else + gtpBuf[0] = 0; + + char opName[16]; + + if (duration == -1) + std::strcpy(opName, "TIE "); + else + std::snprintf(opName, sizeof(opName), "N%02u ", duration); + + bool noteChanged = true; + bool velocityChanged = true; + + if (g_compressionEnabled) + { + noteChanged = (note != s_lastNote); + velocityChanged = (velocity != s_lastVelocity); + } + + if (s_keepLastOpName) + s_keepLastOpName = false; + else + s_lastOpName = ""; + + if (noteChanged || velocityChanged || (gateTimeParam > 0)) + { + s_lastNote = note; + + char noteBuf[16]; + + if (note >= 24) + std::snprintf(noteBuf, sizeof(noteBuf), g_noteTable[note % 12], note / 12 - 2); + else + std::snprintf(noteBuf, sizeof(noteBuf), g_minusNoteTable[note % 12], note / -12 + 2); + + char velocityBuf[16]; + + if (velocityChanged || (gateTimeParam > 0)) + { + s_lastVelocity = velocity; + std::snprintf(velocityBuf, sizeof(velocityBuf), ", v%03u", velocity); + } + else + { + velocityBuf[0] = 0; + } + + PrintOp(event.time, opName, "%s%s%s", noteBuf, velocityBuf, gtpBuf); + } + else + { + PrintOp(event.time, opName, 0); + } + + s_noteChanged = noteChanged; + s_velocityChanged = velocityChanged; +} + +void PrintEndOfTieOp(const Event& event) +{ + int note = event.note; + bool noteChanged = (note != s_lastNote); + + if (!noteChanged || !s_noteChanged) + s_lastOpName = ""; + + if (!noteChanged && g_compressionEnabled) + { + PrintOp(event.time, "EOT ", nullptr); + } + else + { + s_lastNote = note; + if (note >= 24) + PrintOp(event.time, "EOT ", g_noteTable[note % 12], note / 12 - 2); + else + PrintOp(event.time, "EOT ", g_minusNoteTable[note % 12], note / -12 + 2); + } + + s_noteChanged = noteChanged; +} + +void PrintSeqLoopLabel(const Event& event) +{ + s_blockNum = event.param1 + 1; + std::fprintf(g_outputFile, "%s_%u_B%u:\n", g_asmLabel.c_str(), g_agbTrack, s_blockNum); + PrintWait(event.time); + ResetTrackVars(); +} + +void PrintMemAcc(const Event& event) +{ + switch (s_memaccOp) + { + case 0x00: + PrintByte("MEMACC, mem_set, 0x%02X, %u", s_memaccParam1, event.param2); + break; + case 0x01: + PrintByte("MEMACC, mem_add, 0x%02X, %u", s_memaccParam1, event.param2); + break; + case 0x02: + PrintByte("MEMACC, mem_sub, 0x%02X, %u", s_memaccParam1, event.param2); + break; + case 0x03: + PrintByte("MEMACC, mem_mem_set, 0x%02X, 0x%02X", s_memaccParam1, event.param2); + break; + case 0x04: + PrintByte("MEMACC, mem_mem_add, 0x%02X, 0x%02X", s_memaccParam1, event.param2); + break; + case 0x05: + PrintByte("MEMACC, mem_mem_sub, 0x%02X, 0x%02X", s_memaccParam1, event.param2); + break; + // TODO: everything else + case 0x06: + break; + case 0x07: + break; + case 0x08: + break; + case 0x09: + break; + case 0x0A: + break; + case 0x0B: + break; + case 0x0C: + break; + case 0x0D: + break; + case 0x0E: + break; + case 0x0F: + break; + case 0x10: + break; + case 0x11: + break; + case 0x46: + break; + case 0x47: + break; + case 0x48: + break; + case 0x49: + break; + case 0x4A: + break; + case 0x4B: + break; + case 0x4C: + break; + case 0x4D: + break; + case 0x4E: + break; + case 0x4F: + break; + case 0x50: + break; + case 0x51: + break; + default: + break; + } + + PrintWait(event.time); +} + +void PrintExtendedOp(const Event& event) +{ + // TODO: support for other extended commands + + switch (s_extendedCommand) + { + case 0x08: + PrintOp(event.time, "XCMD ", "xIECV , %u", event.param2); + break; + case 0x09: + PrintOp(event.time, "XCMD ", "xIECL , %u", event.param2); + break; + default: + PrintWait(event.time); + break; + } +} + +void PrintControllerOp(const Event& event) +{ + switch (event.param1) + { + case 0x01: + PrintOp(event.time, "MOD ", "%u", event.param2); + break; + case 0x07: + PrintOp(event.time, "VOL ", "%u*%s_mvl/mxv", event.param2, g_asmLabel.c_str()); + break; + case 0x0A: + PrintOp(event.time, "PAN ", "c_v%+d", event.param2 - 64); + break; + case 0x0C: + case 0x10: + PrintMemAcc(event); + break; + case 0x0D: + s_memaccOp = event.param2; + PrintWait(event.time); + break; + case 0x0E: + s_memaccParam1 = event.param2; + PrintWait(event.time); + break; + case 0x0F: + s_memaccParam2 = event.param2; + PrintWait(event.time); + break; + case 0x11: + std::fprintf(g_outputFile, "%s_%u_L%u:\n", g_asmLabel.c_str(), g_agbTrack, event.param2); + PrintWait(event.time); + ResetTrackVars(); + break; + case 0x14: + PrintOp(event.time, "BENDR ", "%u", event.param2); + break; + case 0x15: + PrintOp(event.time, "LFOS ", "%u", event.param2); + break; + case 0x16: + PrintOp(event.time, "MODT ", "%u", event.param2); + break; + case 0x18: + PrintOp(event.time, "TUNE ", "c_v%+d", event.param2 - 64); + break; + case 0x1A: + PrintOp(event.time, "LFODL ", "%u", event.param2); + break; + case 0x1D: + case 0x1F: + PrintExtendedOp(event); + break; + case 0x1E: + s_extendedCommand = event.param2; + // TODO: loop op + break; + case 0x21: + case 0x27: + PrintByte("PRIO , %u", event.param2); + PrintWait(event.time); + break; + default: + PrintWait(event.time); + break; + } +} + +void PrintAgbTrack(std::vector<Event>& events) +{ + std::fprintf(g_outputFile, "\n@**************** Track %u (Midi-Chn.%u) ****************@\n\n", g_agbTrack, g_midiChan + 1); + std::fprintf(g_outputFile, "%s_%u:\n", g_asmLabel.c_str(), g_agbTrack); + + int wholeNoteCount = 0; + int loopEndBlockNum = 0; + + ResetTrackVars(); + + bool foundVolBeforeNote = false; + + for (const Event& event : events) + { + if (event.type == EventType::Note) + break; + + if (event.type == EventType::Controller && event.param1 == 0x07) + { + foundVolBeforeNote = true; + break; + } + } + + if (!foundVolBeforeNote) + PrintByte("\tVOL , 127*%s_mvl/mxv", g_asmLabel.c_str()); + + PrintWait(g_initialWait); + PrintByte("KEYSH , %s_key%+d", g_asmLabel.c_str(), 0); + + for (unsigned i = 0; events[i].type != EventType::EndOfTrack; i++) + { + const Event& event = events[i]; + + if (IsPatternBoundary(event.type)) + { + if (s_inPattern) + PrintByte("PEND"); + s_inPattern = false; + } + + if (event.type == EventType::WholeNoteMark || event.type == EventType::Pattern) + std::fprintf(g_outputFile, "@ %03d ----------------------------------------\n", wholeNoteCount++); + + switch (event.type) + { + case EventType::Note: + PrintNote(event); + break; + case EventType::EndOfTie: + PrintEndOfTieOp(event); + break; + case EventType::Label: + PrintSeqLoopLabel(event); + break; + case EventType::LoopEnd: + PrintByte("GOTO"); + PrintWord("%s_%u_B%u", g_asmLabel.c_str(), g_agbTrack, loopEndBlockNum); + PrintSeqLoopLabel(event); + break; + case EventType::LoopEndBegin: + PrintByte("GOTO"); + PrintWord("%s_%u_B%u", g_asmLabel.c_str(), g_agbTrack, loopEndBlockNum); + PrintSeqLoopLabel(event); + loopEndBlockNum = s_blockNum; + break; + case EventType::LoopBegin: + PrintSeqLoopLabel(event); + loopEndBlockNum = s_blockNum; + break; + case EventType::WholeNoteMark: + if (event.param2 & 0x80000000) + { + std::fprintf(g_outputFile, "%s_%u_%03lu:\n", g_asmLabel.c_str(), g_agbTrack, (unsigned long)(event.param2 & 0x7FFFFFFF)); + ResetTrackVars(); + s_inPattern = true; + } + PrintWait(event.time); + break; + case EventType::Pattern: + PrintByte("PATT"); + PrintWord("%s_%u_%03lu", g_asmLabel.c_str(), g_agbTrack, event.param2); + + while (!IsPatternBoundary(events[i + 1].type)) + i++; + + ResetTrackVars(); + break; + case EventType::Tempo: + PrintByte("TEMPO , %u*%s_tbs/2", 60000000 / event.param2, g_asmLabel.c_str()); + PrintWait(event.time); + break; + case EventType::InstrumentChange: + PrintOp(event.time, "VOICE ", "%u", event.param1); + break; + case EventType::PitchBend: + PrintOp(event.time, "BEND ", "c_v%+d", event.param2 - 64); + break; + case EventType::Controller: + PrintControllerOp(event); + break; + default: + PrintWait(event.time); + break; + } + } + + PrintByte("FINE"); +} + +void PrintAgbFooter() +{ + int trackCount = g_agbTrack - 1; + + std::fprintf(g_outputFile, "\n@******************************************************@\n"); + std::fprintf(g_outputFile, "\t.align\t2\n"); + std::fprintf(g_outputFile, "\n%s:\n", g_asmLabel.c_str()); + std::fprintf(g_outputFile, "\t.byte\t%u\t@ NumTrks\n", trackCount); + std::fprintf(g_outputFile, "\t.byte\t%u\t@ NumBlks\n", 0); + std::fprintf(g_outputFile, "\t.byte\t%s_pri\t@ Priority\n", g_asmLabel.c_str()); + std::fprintf(g_outputFile, "\t.byte\t%s_rev\t@ Reverb.\n", g_asmLabel.c_str()); + std::fprintf(g_outputFile, "\n"); + std::fprintf(g_outputFile, "\t.word\t%s_grp\n", g_asmLabel.c_str()); + std::fprintf(g_outputFile, "\n"); + + // track pointers + for (int i = 1; i <= trackCount; i++) + std::fprintf(g_outputFile, "\t.word\t%s_%u\n", g_asmLabel.c_str(), i); + + std::fprintf(g_outputFile, "\n\t.end\n"); +} diff --git a/tools/mid2agb/agb.h b/tools/mid2agb/agb.h new file mode 100644 index 0000000..7eab3c1 --- /dev/null +++ b/tools/mid2agb/agb.h @@ -0,0 +1,33 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#ifndef AGB_H +#define AGB_H + +#include <vector> +#include "midi.h" + +void PrintAgbHeader(); +void PrintAgbTrack(std::vector<Event>& events); +void PrintAgbFooter(); + +extern int g_agbTrack; + +#endif // AGB_H diff --git a/tools/mid2agb/error.cpp b/tools/mid2agb/error.cpp new file mode 100644 index 0000000..13e38ff --- /dev/null +++ b/tools/mid2agb/error.cpp @@ -0,0 +1,36 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#include <cstdio> +#include <cstdlib> +#include <cstdarg> + +// Reports an error diagnostic and terminates the program. +[[noreturn]] void RaiseError(const char* format, ...) +{ + const int bufferSize = 1024; + char buffer[bufferSize]; + std::va_list args; + va_start(args, format); + std::vsnprintf(buffer, bufferSize, format, args); + std::fprintf(stderr, "error: %s\n", buffer); + va_end(args); + std::exit(1); +} diff --git a/tools/mid2agb/error.h b/tools/mid2agb/error.h new file mode 100644 index 0000000..da4f011 --- /dev/null +++ b/tools/mid2agb/error.h @@ -0,0 +1,26 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#ifndef ERROR_H +#define ERROR_H + +[[noreturn]] void RaiseError(const char* format, ...); + +#endif // ERROR_H diff --git a/tools/mid2agb/main.cpp b/tools/mid2agb/main.cpp new file mode 100644 index 0000000..ea2b294 --- /dev/null +++ b/tools/mid2agb/main.cpp @@ -0,0 +1,233 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#include <cstdio> +#include <cstdlib> +#include <cstring> +#include <cctype> +#include <cassert> +#include <string> +#include <set> +#include "main.h" +#include "error.h" +#include "midi.h" +#include "agb.h" + +FILE* g_inputFile = nullptr; +FILE* g_outputFile = nullptr; + +std::string g_asmLabel; +int g_masterVolume = 127; +int g_voiceGroup = 0; +int g_priority = 0; +int g_reverb = -1; +int g_clocksPerBeat = 1; +bool g_exactGateTime = false; +bool g_compressionEnabled = true; + +[[noreturn]] static void PrintUsage() +{ + std::printf( + "Usage: MID2AGB name [options]\n" + "\n" + " input_file filename(.mid) of MIDI file\n" + " output_file filename(.s) for AGB file (default:input_file)\n" + "\n" + "options -L??? label for assembler (default:output_file)\n" + " -V??? master volume (default:127)\n" + " -G??? voice group number (default:0)\n" + " -P??? priority (default:0)\n" + " -R??? reverb (default:off)\n" + " -X 48 clocks/beat (default:24 clocks/beat)\n" + " -E exact gate-time\n" + " -N no compression\n" + ); + std::exit(1); +} + +static std::string StripExtension(std::string s) +{ + std::size_t pos = s.find_last_of('.'); + + if (pos > 0 && pos != std::string::npos) + { + s = s.substr(0, pos); + } + + return s; +} + +static std::string GetExtension(std::string s) +{ + std::size_t pos = s.find_last_of('.'); + + if (pos > 0 && pos != std::string::npos) + { + return s.substr(pos + 1); + } + + return ""; +} + +static std::string BaseName(std::string s) +{ + std::size_t posAfterSlash = s.find_last_of("/\\"); + + if (posAfterSlash == std::string::npos) + posAfterSlash = 0; + else + posAfterSlash++; + + std::size_t dotPos = s.find_first_of('.', posAfterSlash); + if (dotPos > posAfterSlash && dotPos != std::string::npos) + s = s.substr(posAfterSlash, dotPos - posAfterSlash); + + return s; +} + +static const char *GetArgument(int argc, char **argv, int& index) +{ + assert(index >= 0 && index < argc); + + const char *option = argv[index]; + + assert(option != nullptr); + assert(option[0] == '-'); + + // If there is text following the letter, return that. + if (std::strlen(option) >= 3) + return option + 2; + + // Otherwise, try to get the next arg. + if (index + 1 < argc) + { + index++; + return argv[index]; + } + else + { + return nullptr; + } +} + +int main(int argc, char** argv) +{ + std::string inputFilename; + std::string outputFilename; + + for (int i = 1; i < argc; i++) + { + const char *option = argv[i]; + + if (option[0] == '-' && option[1] != '\0') + { + const char *arg; + + switch (std::toupper(option[1])) + { + case 'E': + g_exactGateTime = true; + break; + case 'G': + arg = GetArgument(argc, argv, i); + if (arg == nullptr) + PrintUsage(); + g_voiceGroup = std::stoi(arg); + break; + case 'L': + arg = GetArgument(argc, argv, i); + if (arg == nullptr) + PrintUsage(); + g_asmLabel = arg; + break; + case 'N': + g_compressionEnabled = false; + break; + case 'P': + arg = GetArgument(argc, argv, i); + if (arg == nullptr) + PrintUsage(); + g_priority = std::stoi(arg); + break; + case 'R': + arg = GetArgument(argc, argv, i); + if (arg == nullptr) + PrintUsage(); + g_reverb = std::stoi(arg); + break; + case 'V': + arg = GetArgument(argc, argv, i); + if (arg == nullptr) + PrintUsage(); + g_masterVolume = std::stoi(arg); + break; + case 'X': + g_clocksPerBeat = 2; + break; + default: + PrintUsage(); + } + } + else + { + if (inputFilename.empty()) + inputFilename = argv[i]; + else if (outputFilename.empty()) + outputFilename = argv[i]; + else + PrintUsage(); + } + } + + if (inputFilename.empty()) + PrintUsage(); + + if (GetExtension(inputFilename) != "mid") + RaiseError("input filename extension is not \"mid\""); + + if (outputFilename.empty()) + outputFilename = StripExtension(inputFilename) + ".s"; + + if (GetExtension(outputFilename) != "s") + RaiseError("output filename extension is not \"s\""); + + if (g_asmLabel.empty()) + g_asmLabel = BaseName(outputFilename); + + g_inputFile = std::fopen(inputFilename.c_str(), "rb"); + + if (g_inputFile == nullptr) + RaiseError("failed to open \"%s\" for reading", inputFilename.c_str()); + + g_outputFile = std::fopen(outputFilename.c_str(), "w"); + + if (g_outputFile == nullptr) + RaiseError("failed to open \"%s\" for writing", outputFilename.c_str()); + + ReadMidiFileHeader(); + PrintAgbHeader(); + ReadMidiTracks(); + PrintAgbFooter(); + + std::fclose(g_inputFile); + std::fclose(g_outputFile); + + return 0; +} diff --git a/tools/mid2agb/main.h b/tools/mid2agb/main.h new file mode 100644 index 0000000..6e71e73 --- /dev/null +++ b/tools/mid2agb/main.h @@ -0,0 +1,39 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#ifndef MAIN_H +#define MAIN_H + +#include <cstdio> +#include <string> + +extern FILE* g_inputFile; +extern FILE* g_outputFile; + +extern std::string g_asmLabel; +extern int g_masterVolume; +extern int g_voiceGroup; +extern int g_priority; +extern int g_reverb; +extern int g_clocksPerBeat; +extern bool g_exactGateTime; +extern bool g_compressionEnabled; + +#endif // MAIN_H diff --git a/tools/mid2agb/midi.cpp b/tools/mid2agb/midi.cpp new file mode 100644 index 0000000..fa7d9ce --- /dev/null +++ b/tools/mid2agb/midi.cpp @@ -0,0 +1,964 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#include <cstdio> +#include <cassert> +#include <string> +#include <vector> +#include <algorithm> +#include <memory> +#include "midi.h" +#include "main.h" +#include "error.h" +#include "agb.h" +#include "tables.h" + +enum class MidiEventCategory +{ + Control, + SysEx, + Meta, + Invalid, +}; + +MidiFormat g_midiFormat; +std::int_fast32_t g_midiTrackCount; +std::int16_t g_midiTimeDiv; + +int g_midiChan; +std::int32_t g_initialWait; + +static long s_trackDataStart; +static std::vector<Event> s_seqEvents; +static std::vector<Event> s_trackEvents; +static std::int32_t s_absoluteTime; +static int s_blockCount = 0; +static int s_minNote; +static int s_maxNote; +static int s_runningStatus; + +void Seek(long offset) +{ + if (std::fseek(g_inputFile, offset, SEEK_SET) != 0) + RaiseError("failed to seek to %l", offset); +} + +void Skip(long offset) +{ + if (std::fseek(g_inputFile, offset, SEEK_CUR) != 0) + RaiseError("failed to skip %l bytes", offset); +} + +std::string ReadSignature() +{ + char signature[4]; + + if (std::fread(signature, 4, 1, g_inputFile) != 1) + RaiseError("failed to read signature"); + + return std::string(signature, 4); +} + +std::uint32_t ReadInt8() +{ + int c = std::fgetc(g_inputFile); + + if (c < 0) + RaiseError("unexpected EOF"); + + return c; +} + +std::uint32_t ReadInt16() +{ + std::uint32_t val = 0; + val |= ReadInt8() << 8; + val |= ReadInt8(); + return val; +} + +std::uint32_t ReadInt24() +{ + std::uint32_t val = 0; + val |= ReadInt8() << 16; + val |= ReadInt8() << 8; + val |= ReadInt8(); + return val; +} + +std::uint32_t ReadInt32() +{ + std::uint32_t val = 0; + val |= ReadInt8() << 24; + val |= ReadInt8() << 16; + val |= ReadInt8() << 8; + val |= ReadInt8(); + return val; +} + +std::uint32_t ReadVLQ() +{ + std::uint32_t val = 0; + std::uint32_t c; + + do + { + c = ReadInt8(); + val <<= 7; + val |= (c & 0x7F); + } while (c & 0x80); + + return val; +} + +void ReadMidiFileHeader() +{ + Seek(0); + + if (ReadSignature() != "MThd") + RaiseError("MIDI file header signature didn't match \"MThd\""); + + std::uint32_t headerLength = ReadInt32(); + + if (headerLength != 6) + RaiseError("MIDI file header length isn't 6"); + + std::uint16_t midiFormat = ReadInt16(); + + if (midiFormat >= 2) + RaiseError("unsupported MIDI format (%u)", midiFormat); + + g_midiFormat = (MidiFormat)midiFormat; + g_midiTrackCount = ReadInt16(); + g_midiTimeDiv = ReadInt16(); + + if (g_midiTimeDiv < 0) + RaiseError("unsupported MIDI time division (%d)", g_midiTimeDiv); +} + +long ReadMidiTrackHeader(long offset) +{ + Seek(offset); + + if (ReadSignature() != "MTrk") + RaiseError("MIDI track header signature didn't match \"MTrk\""); + + long size = ReadInt32(); + + s_trackDataStart = std::ftell(g_inputFile); + + return size + 8; +} + +void StartTrack() +{ + Seek(s_trackDataStart); + s_absoluteTime = 0; + s_runningStatus = 0; +} + +void SkipEventData() +{ + Skip(ReadVLQ()); +} + +void DetermineEventCategory(MidiEventCategory& category, int& typeChan, int& size) +{ + typeChan = ReadInt8(); + + if (typeChan < 0x80) + { + // If data byte was found, use the running status. + ungetc(typeChan, g_inputFile); + typeChan = s_runningStatus; + } + + if (typeChan == 0xFF) + { + category = MidiEventCategory::Meta; + size = 0; + s_runningStatus = 0; + } + else if (typeChan >= 0xF0) + { + category = MidiEventCategory::SysEx; + size = 0; + s_runningStatus = 0; + } + else if (typeChan >= 0x80) + { + category = MidiEventCategory::Control; + + switch (typeChan >> 4) + { + case 0xC: + case 0xD: + size = 1; + break; + default: + size = 2; + break; + } + s_runningStatus = typeChan; + } + else + { + category = MidiEventCategory::Invalid; + } +} + +void MakeBlockEvent(Event& event, EventType type) +{ + event.type = type; + event.param1 = s_blockCount++; + event.param2 = 0; +} + +std::string ReadEventText() +{ + char buffer[2]; + std::uint32_t length = ReadVLQ(); + + if (length <= 2) + { + if (fread(buffer, length, 1, g_inputFile) != 1) + RaiseError("failed to read event text"); + } + else + { + Skip(length); + length = 0; + } + + return std::string(buffer, length); +} + +bool ReadSeqEvent(Event& event) +{ + s_absoluteTime += ReadVLQ(); + event.time = s_absoluteTime; + + MidiEventCategory category; + int typeChan; + int size; + + DetermineEventCategory(category, typeChan, size); + + if (category == MidiEventCategory::Control) + { + Skip(size); + return false; + } + + if (category == MidiEventCategory::SysEx) + { + SkipEventData(); + return false; + } + + if (category == MidiEventCategory::Invalid) + RaiseError("invalid event"); + + // meta event + int metaEventType = ReadInt8(); + + if (metaEventType >= 1 && metaEventType <= 7) + { + // text event + std::string text = ReadEventText(); + + if (text == "[") + MakeBlockEvent(event, EventType::LoopBegin); + else if (text == "][") + MakeBlockEvent(event, EventType::LoopEndBegin); + else if (text == "]") + MakeBlockEvent(event, EventType::LoopEnd); + else if (text == ":") + MakeBlockEvent(event, EventType::Label); + else + return false; + } + else + { + switch (metaEventType) + { + case 0x2F: // end of track + SkipEventData(); + event.type = EventType::EndOfTrack; + event.param1 = 0; + event.param2 = 0; + break; + case 0x51: // tempo + if (ReadVLQ() != 3) + RaiseError("invalid tempo size"); + + event.type = EventType::Tempo; + event.param1 = 0; + event.param2 = ReadInt24(); + break; + case 0x58: // time signature + { + if (ReadVLQ() != 4) + RaiseError("invalid time signature size"); + + int numerator = ReadInt8(); + int denominatorExponent = ReadInt8(); + + if (denominatorExponent >= 16) + RaiseError("invalid time signature denominator"); + + Skip(2); // ignore other values + + int clockTicks = 96 * numerator * g_clocksPerBeat; + int denominator = 1 << denominatorExponent; + int timeSig = clockTicks / denominator; + + if (timeSig <= 0 || timeSig >= 0x10000) + RaiseError("invalid time signature"); + + event.type = EventType::TimeSignature; + event.param1 = 0; + event.param2 = timeSig; + break; + } + default: + SkipEventData(); + return false; + } + } + + return true; +} + +void ReadSeqEvents() +{ + StartTrack(); + + for (;;) + { + Event event = {}; + + if (ReadSeqEvent(event)) + { + s_seqEvents.push_back(event); + + if (event.type == EventType::EndOfTrack) + return; + } + } +} + +bool CheckNoteEnd(Event& event) +{ + event.param2 += ReadVLQ(); + + MidiEventCategory category; + int typeChan; + int size; + + DetermineEventCategory(category, typeChan, size); + + if (category == MidiEventCategory::Control) + { + int chan = typeChan & 0xF; + + if (chan != g_midiChan) + { + Skip(size); + return false; + } + + switch (typeChan & 0xF0) + { + case 0x80: // note off + { + int note = ReadInt8(); + ReadInt8(); // ignore velocity + if (note == event.note) + return true; + break; + } + case 0x90: // note on + { + int note = ReadInt8(); + int velocity = ReadInt8(); + if (velocity == 0 && note == event.note) + return true; + break; + } + default: + Skip(size); + break; + } + + return false; + } + + if (category == MidiEventCategory::SysEx) + { + SkipEventData(); + return false; + } + + if (category == MidiEventCategory::Meta) + { + int metaEventType = ReadInt8(); + SkipEventData(); + + if (metaEventType == 0x2F) + RaiseError("note doesn't end"); + + return false; + } + + RaiseError("invalid event"); +} + +void FindNoteEnd(Event& event) +{ + // Save the current file position and running status + // which get modified by CheckNoteEnd. + long startPos = ftell(g_inputFile); + int savedRunningStatus = s_runningStatus; + + event.param2 = 0; + + while (!CheckNoteEnd(event)) + ; + + Seek(startPos); + s_runningStatus = savedRunningStatus; +} + +bool ReadTrackEvent(Event& event) +{ + s_absoluteTime += ReadVLQ(); + event.time = s_absoluteTime; + + MidiEventCategory category; + int typeChan; + int size; + + DetermineEventCategory(category, typeChan, size); + + if (category == MidiEventCategory::Control) + { + int chan = typeChan & 0xF; + + if (chan != g_midiChan) + { + Skip(size); + return false; + } + + switch (typeChan & 0xF0) + { + case 0x90: // note on + { + int note = ReadInt8(); + int velocity = ReadInt8(); + + if (velocity != 0) + { + event.type = EventType::Note; + event.note = note; + event.param1 = velocity; + FindNoteEnd(event); + if (event.param2 > 0) + { + if (note < s_minNote) + s_minNote = note; + if (note > s_maxNote) + s_maxNote = note; + } + } + break; + } + case 0xB0: // controller event + event.type = EventType::Controller; + event.param1 = ReadInt8(); // controller index + event.param2 = ReadInt8(); // value + break; + case 0xC0: // instrument change + event.type = EventType::InstrumentChange; + event.param1 = ReadInt8(); // instrument + event.param2 = 0; + break; + case 0xE0: // pitch bend + event.type = EventType::PitchBend; + event.param1 = ReadInt8(); + event.param2 = ReadInt8(); + break; + default: + Skip(size); + return false; + } + + return true; + } + + if (category == MidiEventCategory::SysEx) + { + SkipEventData(); + return false; + } + + if (category == MidiEventCategory::Meta) + { + int metaEventType = ReadInt8(); + SkipEventData(); + + if (metaEventType == 0x2F) + { + event.type = EventType::EndOfTrack; + event.param1 = 0; + event.param2 = 0; + return true; + } + + return false; + } + + RaiseError("invalid event"); +} + +void ReadTrackEvents() +{ + StartTrack(); + + s_trackEvents.clear(); + + s_minNote = 0xFF; + s_maxNote = 0; + + for (;;) + { + Event event = {}; + + if (ReadTrackEvent(event)) + { + s_trackEvents.push_back(event); + + if (event.type == EventType::EndOfTrack) + return; + } + } +} + +bool EventCompare(const Event& event1, const Event& event2) +{ + if (event1.time < event2.time) + return true; + + if (event1.time > event2.time) + return false; + + unsigned event1Type = (unsigned)event1.type; + unsigned event2Type = (unsigned)event2.type; + + if (event1.type == EventType::Note) + event1Type += event1.note; + + if (event2.type == EventType::Note) + event2Type += event2.note; + + if (event1Type < event2Type) + return true; + + if (event1Type > event2Type) + return false; + + if (event1.type == EventType::EndOfTie) + { + if (event1.note < event2.note) + return true; + + if (event1.note > event2.note) + return false; + } + + return false; +} + +std::unique_ptr<std::vector<Event>> MergeEvents() +{ + std::unique_ptr<std::vector<Event>> events(new std::vector<Event>()); + + unsigned trackEventPos = 0; + unsigned seqEventPos = 0; + + while (s_trackEvents[trackEventPos].type != EventType::EndOfTrack + && s_seqEvents[seqEventPos].type != EventType::EndOfTrack) + { + if (EventCompare(s_trackEvents[trackEventPos], s_seqEvents[seqEventPos])) + events->push_back(s_trackEvents[trackEventPos++]); + else + events->push_back(s_seqEvents[seqEventPos++]); + } + + while (s_trackEvents[trackEventPos].type != EventType::EndOfTrack) + events->push_back(s_trackEvents[trackEventPos++]); + + while (s_seqEvents[seqEventPos].type != EventType::EndOfTrack) + events->push_back(s_seqEvents[seqEventPos++]); + + // Push the EndOfTrack event with the larger time. + if (EventCompare(s_trackEvents[trackEventPos], s_seqEvents[seqEventPos])) + events->push_back(s_seqEvents[seqEventPos]); + else + events->push_back(s_trackEvents[trackEventPos]); + + return events; +} + +void ConvertTimes(std::vector<Event>& events) +{ + for (Event& event : events) + { + event.time = (24 * g_clocksPerBeat * event.time) / g_midiTimeDiv; + + if (event.type == EventType::Note) + { + event.param1 = g_noteVelocityLUT[event.param1]; + + std::uint32_t duration = (24 * g_clocksPerBeat * event.param2) / g_midiTimeDiv; + + if (duration == 0) + duration = 1; + + if (!g_exactGateTime && duration < 96) + duration = g_noteDurationLUT[duration]; + + event.param2 = duration; + } + } +} + +std::unique_ptr<std::vector<Event>> InsertTimingEvents(std::vector<Event>& inEvents) +{ + std::unique_ptr<std::vector<Event>> outEvents(new std::vector<Event>()); + + Event timingEvent = {}; + timingEvent.time = 0; + timingEvent.type = EventType::TimeSignature; + timingEvent.param2 = 96 * g_clocksPerBeat; + + for (const Event& event : inEvents) + { + while (EventCompare(timingEvent, event)) + { + outEvents->push_back(timingEvent); + timingEvent.time += timingEvent.param2; + } + + if (event.type == EventType::TimeSignature) + { + if (g_agbTrack == 1 && event.param2 != timingEvent.param2) + { + Event originalTimingEvent = event; + originalTimingEvent.type = EventType::OriginalTimeSignature; + outEvents->push_back(originalTimingEvent); + } + timingEvent.param2 = event.param2; + timingEvent.time = event.time + timingEvent.param2; + } + + outEvents->push_back(event); + } + + return outEvents; +} + +std::unique_ptr<std::vector<Event>> SplitTime(std::vector<Event>& inEvents) +{ + std::unique_ptr<std::vector<Event>> outEvents(new std::vector<Event>()); + + std::int32_t time = 0; + + for (const Event& event : inEvents) + { + std::int32_t diff = event.time - time; + + if (diff > 96) + { + int wholeNoteCount = (diff - 1) / 96; + diff -= 96 * wholeNoteCount; + + for (int i = 0; i < wholeNoteCount; i++) + { + time += 96; + Event timeSplitEvent = {}; + timeSplitEvent.time = time; + timeSplitEvent.type = EventType::TimeSplit; + outEvents->push_back(timeSplitEvent); + } + } + + std::int32_t lutValue = g_noteDurationLUT[diff]; + + if (lutValue != diff) + { + Event timeSplitEvent = {}; + timeSplitEvent.time = time + lutValue; + timeSplitEvent.type = EventType::TimeSplit; + outEvents->push_back(timeSplitEvent); + } + + time = event.time; + + outEvents->push_back(event); + } + + return outEvents; +} + +std::unique_ptr<std::vector<Event>> CreateTies(std::vector<Event>& inEvents) +{ + std::unique_ptr<std::vector<Event>> outEvents(new std::vector<Event>()); + + for (const Event& event : inEvents) + { + if (event.type == EventType::Note && event.param2 > 96) + { + Event tieEvent = event; + tieEvent.param2 = -1; + outEvents->push_back(tieEvent); + + Event eotEvent = {}; + eotEvent.time = event.time + event.param2; + eotEvent.type = EventType::EndOfTie; + eotEvent.note = event.note; + outEvents->push_back(eotEvent); + } + else + { + outEvents->push_back(event); + } + } + + return outEvents; +} + +void CalculateWaits(std::vector<Event>& events) +{ + g_initialWait = events[0].time; + int wholeNoteCount = 0; + + for (unsigned i = 0; i < events.size() && events[i].type != EventType::EndOfTrack; i++) + { + events[i].time = events[i + 1].time - events[i].time; + + if (events[i].type == EventType::TimeSignature) + { + events[i].type = EventType::WholeNoteMark; + events[i].param2 = wholeNoteCount++; + } + } +} + +int CalculateCompressionScore(std::vector<Event>& events, int index) +{ + int score = 0; + std::uint8_t lastParam1 = events[index].param1; + std::uint8_t lastVelocity = 0x80u; + EventType lastType = events[index].type; + std::int32_t lastDuration = 0x80000000; + std::uint8_t lastNote = 0x40u; + + if (events[index].time > 0) + score++; + + for (int i = index + 1; !IsPatternBoundary(events[i].type); i++) + { + if (events[i].type == EventType::Note) + { + int val = 0; + + if (events[i].note != lastNote) + { + val++; + lastNote = events[i].note; + } + + if (events[i].param1 != lastVelocity) + { + val++; + lastVelocity = events[i].param1; + } + + std::int32_t duration = events[i].param2; + + if (g_noteDurationLUT[duration] != lastDuration) + { + val++; + lastDuration = g_noteDurationLUT[duration]; + } + + if (duration != lastDuration) + val++; + + if (val == 0) + val = 1; + + score += val; + } + else + { + lastDuration = 0x80000000; + + if (events[i].type == lastType) + { + if ((lastType != EventType::Controller && (int)lastType != 0x25 && lastType != EventType::EndOfTie) || events[i].param1 == lastParam1) + { + score++; + } + else + { + score += 2; + } + } + else + { + score += 2; + } + } + + lastParam1 = events[i].param1; + lastType = events[i].type; + + if (events[i].time) + score++; + } + + return score; +} + +bool IsCompressionMatch(std::vector<Event>& events, int index1, int index2) +{ + if (events[index1].type != events[index2].type || + events[index1].note != events[index2].note || + events[index1].param1 != events[index2].param1 || + events[index1].time != events[index2].time) + return false; + + index1++; + index2++; + + do + { + if (events[index1] != events[index2]) + return false; + + index1++; + index2++; + } while (!IsPatternBoundary(events[index1].type)); + + return IsPatternBoundary(events[index2].type); +} + +void CompressWholeNote(std::vector<Event>& events, int index) +{ + for (int j = index + 1; events[j].type != EventType::EndOfTrack; j++) + { + while (events[j].type != EventType::WholeNoteMark) + { + j++; + + if (events[j].type == EventType::EndOfTrack) + return; + } + + if (IsCompressionMatch(events, index, j)) + { + events[j].type = EventType::Pattern; + events[j].param2 = events[index].param2 & 0x7FFFFFFF; + events[index].param2 |= 0x80000000; + } + } +} + +void Compress(std::vector<Event>& events) +{ + for (int i = 0; events[i].type != EventType::EndOfTrack; i++) + { + while (events[i].type != EventType::WholeNoteMark) + { + i++; + + if (events[i].type == EventType::EndOfTrack) + return; + } + + if (CalculateCompressionScore(events, i) >= 6) + { + CompressWholeNote(events, i); + } + } +} + +void ReadMidiTracks() +{ + long trackHeaderStart = 14; + + ReadMidiTrackHeader(trackHeaderStart); + ReadSeqEvents(); + + g_agbTrack = 1; + + for (int midiTrack = 0; midiTrack < g_midiTrackCount; midiTrack++) + { + trackHeaderStart += ReadMidiTrackHeader(trackHeaderStart); + + for (g_midiChan = 0; g_midiChan < 16; g_midiChan++) + { + ReadTrackEvents(); + + if (s_minNote != 0xFF) + { +#ifdef DEBUG + printf("Track%d = Midi-Ch.%d\n", g_agbTrack, g_midiChan + 1); +#endif + + std::unique_ptr<std::vector<Event>> events(MergeEvents()); + + // We don't need TEMPO in anything but track 1. + if (g_agbTrack == 1) + { + auto it = std::remove_if(s_seqEvents.begin(), s_seqEvents.end(), [](const Event& event) { return event.type == EventType::Tempo; }); + s_seqEvents.erase(it, s_seqEvents.end()); + } + + ConvertTimes(*events); + events = InsertTimingEvents(*events); + events = CreateTies(*events); + std::stable_sort(events->begin(), events->end(), EventCompare); + events = SplitTime(*events); + CalculateWaits(*events); + + if (g_compressionEnabled) + Compress(*events); + + PrintAgbTrack(*events); + + g_agbTrack++; + } + } + } +} diff --git a/tools/mid2agb/midi.h b/tools/mid2agb/midi.h new file mode 100644 index 0000000..434c8e8 --- /dev/null +++ b/tools/mid2agb/midi.h @@ -0,0 +1,87 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#ifndef MIDI_H +#define MIDI_H + +#include <cstdint> + +enum class MidiFormat +{ + SingleTrack, + MultiTrack +}; + +enum class EventType +{ + EndOfTie = 0x01, + Label = 0x11, + LoopEnd = 0x12, + LoopEndBegin = 0x13, + LoopBegin = 0x14, + OriginalTimeSignature = 0x15, + WholeNoteMark = 0x16, + Pattern = 0x17, + TimeSignature = 0x18, + Tempo = 0x19, + InstrumentChange = 0x21, + Controller = 0x22, + PitchBend = 0x23, + KeyShift = 0x31, + Note = 0x40, + TimeSplit = 0xFE, + EndOfTrack = 0xFF, +}; + +struct Event +{ + std::int32_t time; + EventType type; + std::uint8_t note; + std::uint8_t param1; + std::int32_t param2; + + bool operator==(const Event& other) + { + return (time == other.time + && type == other.type + && note == other.note + && param1 == other.param1 + && param2 == other.param2); + } + + bool operator!=(const Event& other) + { + return !(*this == other); + } +}; + +void ReadMidiFileHeader(); +void ReadMidiTracks(); + +extern int g_midiChan; +extern std::int32_t g_initialWait; + +inline bool IsPatternBoundary(EventType type) +{ + return type == EventType::EndOfTrack || (int)type <= 0x17; +} + +#endif // MIDI_H diff --git a/tools/mid2agb/tables.cpp b/tools/mid2agb/tables.cpp new file mode 100644 index 0000000..f254664 --- /dev/null +++ b/tools/mid2agb/tables.cpp @@ -0,0 +1,286 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#include "tables.h" + +const int g_noteDurationLUT[] = +{ + 0, // 0 + 1, // 1 + 2, // 2 + 3, // 3 + 4, // 4 + 5, // 5 + 6, // 6 + 7, // 7 + 8, // 8 + 9, // 9 + 10, // 10 + 11, // 11 + 12, // 12 + 13, // 13 + 14, // 14 + 15, // 15 + 16, // 16 + 17, // 17 + 18, // 18 + 19, // 19 + 20, // 20 + 21, // 21 + 22, // 22 + 23, // 23 + 24, // 24 + 24, // 25 + 24, // 26 + 24, // 27 + 28, // 28 + 28, // 29 + 30, // 30 + 30, // 31 + 32, // 32 + 32, // 33 + 32, // 34 + 32, // 35 + 36, // 36 + 36, // 37 + 36, // 38 + 36, // 39 + 40, // 40 + 40, // 41 + 42, // 42 + 42, // 43 + 44, // 44 + 44, // 45 + 44, // 46 + 44, // 47 + 48, // 48 + 48, // 49 + 48, // 50 + 48, // 51 + 52, // 52 + 52, // 53 + 54, // 54 + 54, // 55 + 56, // 56 + 56, // 57 + 56, // 58 + 56, // 59 + 60, // 60 + 60, // 61 + 60, // 62 + 60, // 63 + 64, // 64 + 64, // 65 + 66, // 66 + 66, // 67 + 68, // 68 + 68, // 69 + 68, // 70 + 68, // 71 + 72, // 72 + 72, // 73 + 72, // 74 + 72, // 75 + 76, // 76 + 76, // 77 + 78, // 78 + 78, // 79 + 80, // 80 + 80, // 81 + 80, // 82 + 80, // 83 + 84, // 84 + 84, // 85 + 84, // 86 + 84, // 87 + 88, // 88 + 88, // 89 + 90, // 90 + 90, // 91 + 92, // 92 + 92, // 93 + 92, // 94 + 92, // 95 + 96, // 96 +}; + +const int g_noteVelocityLUT[] = +{ + 0, // 0 + 4, // 1 + 4, // 2 + 4, // 3 + 4, // 4 + 8, // 5 + 8, // 6 + 8, // 7 + 8, // 8 + 12, // 9 + 12, // 10 + 12, // 11 + 12, // 12 + 16, // 13 + 16, // 14 + 16, // 15 + 16, // 16 + 20, // 17 + 20, // 18 + 20, // 19 + 20, // 20 + 24, // 21 + 24, // 22 + 24, // 23 + 24, // 24 + 28, // 25 + 28, // 26 + 28, // 27 + 28, // 28 + 32, // 29 + 32, // 30 + 32, // 31 + 32, // 32 + 36, // 33 + 36, // 34 + 36, // 35 + 36, // 36 + 40, // 37 + 40, // 38 + 40, // 39 + 40, // 40 + 44, // 41 + 44, // 42 + 44, // 43 + 44, // 44 + 48, // 45 + 48, // 46 + 48, // 47 + 48, // 48 + 52, // 49 + 52, // 50 + 52, // 51 + 52, // 52 + 56, // 53 + 56, // 54 + 56, // 55 + 56, // 56 + 60, // 57 + 60, // 58 + 60, // 59 + 60, // 60 + 64, // 61 + 64, // 62 + 64, // 63 + 64, // 64 + 68, // 65 + 68, // 66 + 68, // 67 + 68, // 68 + 72, // 69 + 72, // 70 + 72, // 71 + 72, // 72 + 76, // 73 + 76, // 74 + 76, // 75 + 76, // 76 + 80, // 77 + 80, // 78 + 80, // 79 + 80, // 80 + 84, // 81 + 84, // 82 + 84, // 83 + 84, // 84 + 88, // 85 + 88, // 86 + 88, // 87 + 88, // 88 + 92, // 89 + 92, // 90 + 92, // 91 + 92, // 92 + 96, // 93 + 96, // 94 + 96, // 95 + 96, // 96 + 100, // 97 + 100, // 98 + 100, // 99 + 100, // 100 + 104, // 101 + 104, // 102 + 104, // 103 + 104, // 104 + 108, // 105 + 108, // 106 + 108, // 107 + 108, // 108 + 112, // 109 + 112, // 110 + 112, // 111 + 112, // 112 + 116, // 113 + 116, // 114 + 116, // 115 + 116, // 116 + 120, // 117 + 120, // 118 + 120, // 119 + 120, // 120 + 124, // 121 + 124, // 122 + 124, // 123 + 124, // 124 + 127, // 125 + 127, // 126 + 127, // 127 +}; + +const char* g_noteTable[] = +{ + "Cn%01u ", + "Cs%01u ", + "Dn%01u ", + "Ds%01u ", + "En%01u ", + "Fn%01u ", + "Fs%01u ", + "Gn%01u ", + "Gs%01u ", + "An%01u ", + "As%01u ", + "Bn%01u ", +}; + +const char* g_minusNoteTable[] = +{ + "CnM%01u", + "CsM%01u", + "DnM%01u", + "DsM%01u", + "EnM%01u", + "FnM%01u", + "FsM%01u", + "GnM%01u", + "GsM%01u", + "AnM%01u", + "AsM%01u", + "BnM%01u", +}; diff --git a/tools/mid2agb/tables.h b/tools/mid2agb/tables.h new file mode 100644 index 0000000..da3c907 --- /dev/null +++ b/tools/mid2agb/tables.h @@ -0,0 +1,29 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#ifndef TABLES_H +#define TABLES_H + +extern const int g_noteDurationLUT[]; +extern const int g_noteVelocityLUT[]; +extern const char* g_noteTable[]; +extern const char* g_minusNoteTable[]; + +#endif // TABLES_H diff --git a/tools/preproc/.gitignore b/tools/preproc/.gitignore new file mode 100644 index 0000000..eb34708 --- /dev/null +++ b/tools/preproc/.gitignore @@ -0,0 +1 @@ +preproc diff --git a/tools/preproc/LICENSE b/tools/preproc/LICENSE new file mode 100644 index 0000000..534d153 --- /dev/null +++ b/tools/preproc/LICENSE @@ -0,0 +1,19 @@ +Copyright (c) 2016 YamaArashi + +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. diff --git a/tools/preproc/Makefile b/tools/preproc/Makefile new file mode 100644 index 0000000..3d32758 --- /dev/null +++ b/tools/preproc/Makefile @@ -0,0 +1,17 @@ +CXX := g++ + +CXXFLAGS := -std=c++11 -O2 -Wall -Wno-switch -Werror + +SRCS := asm_file.cpp c_file.cpp charmap.cpp preproc.cpp string_parser.cpp \ + utf8.cpp + +HEADERS := asm_file.h c_file.h char_util.h charmap.h preproc.h string_parser.h \ + utf8.h + +.PHONY: clean + +preproc: $(SRCS) $(HEADERS) + $(CXX) $(CXXFLAGS) $(SRCS) -o $@ $(LDFLAGS) + +clean: + $(RM) preproc preproc.exe diff --git a/tools/preproc/asm_file.cpp b/tools/preproc/asm_file.cpp new file mode 100644 index 0000000..383010a --- /dev/null +++ b/tools/preproc/asm_file.cpp @@ -0,0 +1,529 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#include <cstdio> +#include <cstdarg> +#include "preproc.h" +#include "asm_file.h" +#include "char_util.h" +#include "utf8.h" +#include "string_parser.h" + +AsmFile::AsmFile(std::string filename) : m_filename(filename) +{ + FILE *fp = std::fopen(filename.c_str(), "rb"); + + if (fp == NULL) + FATAL_ERROR("Failed to open \"%s\" for reading.\n", filename.c_str()); + + std::fseek(fp, 0, SEEK_END); + + m_size = std::ftell(fp); + + if (m_size < 0) + FATAL_ERROR("File size of \"%s\" is less than zero.\n", filename.c_str()); + + m_buffer = new char[m_size + 1]; + + std::rewind(fp); + + if (std::fread(m_buffer, m_size, 1, fp) != 1) + FATAL_ERROR("Failed to read \"%s\".\n", filename.c_str()); + + m_buffer[m_size] = 0; + + std::fclose(fp); + + m_pos = 0; + m_lineNum = 1; + m_lineStart = 0; + + RemoveComments(); +} + +AsmFile::AsmFile(AsmFile&& other) : m_filename(std::move(other.m_filename)) +{ + m_buffer = other.m_buffer; + m_pos = other.m_pos; + m_size = other.m_size; + m_lineNum = other.m_lineNum; + m_lineStart = other.m_lineStart; + + other.m_buffer = nullptr; +} + +AsmFile::~AsmFile() +{ + delete[] m_buffer; +} + +// Removes comments to simplify further processing. +// It stops upon encountering a null character, +// which may or may not be the end of file marker. +// If it's not, the error will be caught later. +void AsmFile::RemoveComments() +{ + long pos = 0; + char stringChar = 0; + + for (;;) + { + if (m_buffer[pos] == 0) + return; + + if (stringChar != 0) + { + if (m_buffer[pos] == '\\' && m_buffer[pos + 1] == stringChar) + { + pos += 2; + } + else + { + if (m_buffer[pos] == stringChar) + stringChar = 0; + pos++; + } + } + else if (m_buffer[pos] == '@' && (pos == 0 || m_buffer[pos - 1] != '\\')) + { + while (m_buffer[pos] != '\n' && m_buffer[pos] != 0) + m_buffer[pos++] = ' '; + } + else if (m_buffer[pos] == '/' && m_buffer[pos + 1] == '*') + { + m_buffer[pos++] = ' '; + m_buffer[pos++] = ' '; + + for (;;) + { + if (m_buffer[pos] == 0) + return; + + if (m_buffer[pos] == '*' && m_buffer[pos + 1] == '/') + { + m_buffer[pos++] = ' '; + m_buffer[pos++] = ' '; + break; + } + else + { + if (m_buffer[pos] != '\n') + m_buffer[pos] = ' '; + pos++; + } + } + } + else + { + if (m_buffer[pos] == '"' || m_buffer[pos] == '\'') + stringChar = m_buffer[pos]; + pos++; + } + } +} + +// Checks if we're at a particular directive and if so, consumes it. +// Returns whether the directive was found. +bool AsmFile::CheckForDirective(std::string name) +{ + long i; + long length = static_cast<long>(name.length()); + + for (i = 0; i < length && m_pos + i < m_size; i++) + if (name[i] != m_buffer[m_pos + i]) + return false; + + if (i < length) + return false; + + m_pos += length; + + return true; +} + +// Checks if we're at a known directive and if so, consumes it. +// Returns which directive was found. +Directive AsmFile::GetDirective() +{ + SkipWhitespace(); + + if (CheckForDirective(".include")) + return Directive::Include; + else if (CheckForDirective(".string")) + return Directive::String; + else if (CheckForDirective(".braille")) + return Directive::Braille; + else + return Directive::Unknown; +} + +// Checks if we're at label that ends with '::'. +// Returns the name if so and an empty string if not. +std::string AsmFile::GetGlobalLabel() +{ + long start = m_pos; + long pos = m_pos; + + if (IsIdentifierStartingChar(m_buffer[pos])) + { + pos++; + + while (IsIdentifierChar(m_buffer[pos])) + pos++; + } + + if (m_buffer[pos] == ':' && m_buffer[pos + 1] == ':') + { + m_pos = pos + 2; + ExpectEmptyRestOfLine(); + return std::string(&m_buffer[start], pos - start); + } + + return std::string(); +} + +// Skips tabs and spaces. +void AsmFile::SkipWhitespace() +{ + while (m_buffer[m_pos] == '\t' || m_buffer[m_pos] == ' ') + m_pos++; +} + +// Reads include path. +std::string AsmFile::ReadPath() +{ + SkipWhitespace(); + + if (m_buffer[m_pos] != '"') + RaiseError("expected file path"); + + m_pos++; + + int length = 0; + long startPos = m_pos; + + while (m_buffer[m_pos] != '"') + { + unsigned char c = m_buffer[m_pos++]; + + if (c == 0) + { + if (m_pos >= m_size) + RaiseError("unexpected EOF in include string"); + else + RaiseError("unexpected null character in include string"); + } + + if (!IsAsciiPrintable(c)) + RaiseError("unexpected character '\\x%02X' in include string", c); + + // Don't bother allowing any escape sequences. + if (c == '\\') + { + c = m_buffer[m_pos]; + RaiseError("unexpected escape '\\%c' in include string", c); + } + + length++; + + if (length > kMaxPath) + RaiseError("path is too long"); + } + + m_pos++; // Go past the right quote. + + ExpectEmptyRestOfLine(); + + return std::string(&m_buffer[startPos], length); +} + +// Reads a charmap string. +int AsmFile::ReadString(unsigned char* s) +{ + SkipWhitespace(); + + int length; + StringParser stringParser(m_buffer, m_size); + + try + { + m_pos += stringParser.ParseString(m_pos, s, length); + } + catch (std::runtime_error& e) + { + RaiseError(e.what()); + } + + SkipWhitespace(); + + if (ConsumeComma()) + { + SkipWhitespace(); + int padLength = ReadPadLength(); + + while (length < padLength) + { + s[length++] = 0; + } + } + + ExpectEmptyRestOfLine(); + + return length; +} + +int AsmFile::ReadBraille(unsigned char* s) +{ + static std::map<char, unsigned char> encoding = + { + { 'A', 0x01 }, + { 'B', 0x05 }, + { 'C', 0x03 }, + { 'D', 0x0B }, + { 'E', 0x09 }, + { 'F', 0x07 }, + { 'G', 0x0F }, + { 'H', 0x0D }, + { 'I', 0x06 }, + { 'J', 0x0E }, + { 'K', 0x11 }, + { 'L', 0x15 }, + { 'M', 0x13 }, + { 'N', 0x1B }, + { 'O', 0x19 }, + { 'P', 0x17 }, + { 'Q', 0x1F }, + { 'R', 0x1D }, + { 'S', 0x16 }, + { 'T', 0x1E }, + { 'U', 0x31 }, + { 'V', 0x35 }, + { 'W', 0x2E }, + { 'X', 0x33 }, + { 'Y', 0x3B }, + { 'Z', 0x39 }, + { ' ', 0x00 }, + { ',', 0x04 }, + { '.', 0x2C }, + { '$', 0xFF }, + }; + + SkipWhitespace(); + + int length = 0; + + if (m_buffer[m_pos] != '"') + RaiseError("expected braille string literal"); + + m_pos++; + + while (m_buffer[m_pos] != '"') + { + if (length == kMaxStringLength) + RaiseError("mapped string longer than %d bytes", kMaxStringLength); + + if (m_buffer[m_pos] == '\\' && m_buffer[m_pos + 1] == 'n') + { + s[length++] = 0xFE; + m_pos += 2; + } + else + { + char c = m_buffer[m_pos]; + + if (encoding.count(c) == 0) + { + if (IsAsciiPrintable(c)) + RaiseError("character '%c' not valid in braille string", m_buffer[m_pos]); + else + RaiseError("character '\\x%02X' not valid in braille string", m_buffer[m_pos]); + } + + s[length++] = encoding[c]; + m_pos++; + } + } + + m_pos++; // Go past the right quote. + + ExpectEmptyRestOfLine(); + + return length; +} + +// If we're at a comma, consumes it. +// Returns whether a comma was found. +bool AsmFile::ConsumeComma() +{ + if (m_buffer[m_pos] == ',') + { + m_pos++; + return true; + } + + return false; +} + +// Converts digit character to numerical value. +static int ConvertDigit(char c, int radix) +{ + int digit; + + if (c >= '0' && c <= '9') + digit = c - '0'; + else if (c >= 'A' && c <= 'F') + digit = 10 + c - 'A'; + else if (c >= 'a' && c <= 'f') + digit = 10 + c - 'a'; + else + return -1; + + return (digit < radix) ? digit : -1; +} + +// Reads an integer. If the integer is greater than maxValue, it returns -1. +int AsmFile::ReadPadLength() +{ + if (!IsAsciiDigit(m_buffer[m_pos])) + RaiseError("expected integer"); + + int radix = 10; + + if (m_buffer[m_pos] == '0' && m_buffer[m_pos + 1] == 'x') + { + radix = 16; + m_pos += 2; + } + + unsigned n = 0; + int digit; + + while ((digit = ConvertDigit(m_buffer[m_pos], radix)) != -1) + { + n = n * radix + digit; + + if (n > kMaxStringLength) + RaiseError("pad length greater than maximum length (%d)", kMaxStringLength); + + m_pos++; + } + + return n; +} + +// Outputs the current line and moves to the next one. +void AsmFile::OutputLine() +{ + while (m_buffer[m_pos] != '\n' && m_buffer[m_pos] != 0) + m_pos++; + + if (m_buffer[m_pos] == 0) + { + if (m_pos >= m_size) + { + RaiseWarning("file doesn't end with newline"); + puts(&m_buffer[m_lineStart]); + } + else + { + RaiseError("unexpected null character"); + } + } + else + { + m_buffer[m_pos] = 0; + puts(&m_buffer[m_lineStart]); + m_buffer[m_pos] = '\n'; + m_pos++; + m_lineStart = m_pos; + m_lineNum++; + } +} + +// Asserts that the rest of the line is empty and moves to the next one. +void AsmFile::ExpectEmptyRestOfLine() +{ + SkipWhitespace(); + + if (m_buffer[m_pos] == 0) + { + if (m_pos >= m_size) + RaiseWarning("file doesn't end with newline"); + else + RaiseError("unexpected null character"); + } + else if (m_buffer[m_pos] == '\n') + { + m_pos++; + m_lineStart = m_pos; + m_lineNum++; + } + else if (m_buffer[m_pos] == '\r') + { + RaiseError("only Unix-style LF newlines are supported"); + } + else + { + RaiseError("junk at end of line"); + } +} + +// Checks if we're at the end of the file. +bool AsmFile::IsAtEnd() +{ + return (m_pos >= m_size); +} + +// Output the current location to set gas's logical file and line numbers. +void AsmFile::OutputLocation() +{ + std::printf("# %ld \"%s\"\n", m_lineNum, m_filename.c_str()); +} + +// Reports a diagnostic message. +void AsmFile::ReportDiagnostic(const char* type, const char* format, std::va_list args) +{ + const int bufferSize = 1024; + char buffer[bufferSize]; + std::vsnprintf(buffer, bufferSize, format, args); + std::fprintf(stderr, "%s:%ld: %s: %s\n", m_filename.c_str(), m_lineNum, type, buffer); +} + +#define DO_REPORT(type) \ +do \ +{ \ + std::va_list args; \ + va_start(args, format); \ + ReportDiagnostic(type, format, args); \ + va_end(args); \ +} while (0) + +// Reports an error diagnostic and terminates the program. +void AsmFile::RaiseError(const char* format, ...) +{ + DO_REPORT("error"); + std::exit(1); +} + +// Reports a warning diagnostic. +void AsmFile::RaiseWarning(const char* format, ...) +{ + DO_REPORT("warning"); +} diff --git a/tools/preproc/asm_file.h b/tools/preproc/asm_file.h new file mode 100644 index 0000000..d73b36e --- /dev/null +++ b/tools/preproc/asm_file.h @@ -0,0 +1,72 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#ifndef ASM_FILE_H +#define ASM_FILE_H + +#include <cstdarg> +#include <cstdint> +#include <string> +#include "preproc.h" + +enum class Directive +{ + Include, + String, + Braille, + Unknown +}; + +class AsmFile +{ +public: + AsmFile(std::string filename); + AsmFile(AsmFile&& other); + AsmFile(const AsmFile&) = delete; + ~AsmFile(); + Directive GetDirective(); + std::string GetGlobalLabel(); + std::string ReadPath(); + int ReadString(unsigned char* s); + int ReadBraille(unsigned char* s); + bool IsAtEnd(); + void OutputLine(); + void OutputLocation(); + +private: + char* m_buffer; + long m_pos; + long m_size; + long m_lineNum; + long m_lineStart; + std::string m_filename; + + bool ConsumeComma(); + int ReadPadLength(); + void RemoveComments(); + bool CheckForDirective(std::string name); + void SkipWhitespace(); + void ExpectEmptyRestOfLine(); + void ReportDiagnostic(const char* type, const char* format, std::va_list args); + void RaiseError(const char* format, ...); + void RaiseWarning(const char* format, ...); +}; + +#endif // ASM_FILE_H diff --git a/tools/preproc/c_file.cpp b/tools/preproc/c_file.cpp new file mode 100644 index 0000000..229f568 --- /dev/null +++ b/tools/preproc/c_file.cpp @@ -0,0 +1,429 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#include <cstdio> +#include <cstdarg> +#include <string> +#include <memory> +#include "preproc.h" +#include "c_file.h" +#include "char_util.h" +#include "utf8.h" +#include "string_parser.h" + +CFile::CFile(std::string filename) : m_filename(filename) +{ + FILE *fp = std::fopen(filename.c_str(), "rb"); + + if (fp == NULL) + FATAL_ERROR("Failed to open \"%s\" for reading.\n", filename.c_str()); + + std::fseek(fp, 0, SEEK_END); + + m_size = std::ftell(fp); + + if (m_size < 0) + FATAL_ERROR("File size of \"%s\" is less than zero.\n", filename.c_str()); + + m_buffer = new char[m_size + 1]; + + std::rewind(fp); + + if (std::fread(m_buffer, m_size, 1, fp) != 1) + FATAL_ERROR("Failed to read \"%s\".\n", filename.c_str()); + + m_buffer[m_size] = 0; + + std::fclose(fp); + + m_pos = 0; + m_lineNum = 1; +} + +CFile::CFile(CFile&& other) : m_filename(std::move(other.m_filename)) +{ + m_buffer = other.m_buffer; + m_pos = other.m_pos; + m_size = other.m_size; + m_lineNum = other.m_lineNum; + + other.m_buffer = nullptr; +} + +CFile::~CFile() +{ + delete[] m_buffer; +} + +void CFile::Preproc() +{ + char stringChar = 0; + + while (m_pos < m_size) + { + if (stringChar) + { + if (m_buffer[m_pos] == stringChar) + { + std::putchar(stringChar); + m_pos++; + stringChar = 0; + } + else if (m_buffer[m_pos] == '\\' && m_buffer[m_pos + 1] == stringChar) + { + std::putchar('\\'); + std::putchar(stringChar); + m_pos += 2; + } + else + { + if (m_buffer[m_pos] == '\n') + m_lineNum++; + std::putchar(m_buffer[m_pos]); + m_pos++; + } + } + else + { + TryConvertString(); + TryConvertIncbin(); + + if (m_pos >= m_size) + break; + + char c = m_buffer[m_pos++]; + + std::putchar(c); + + if (c == '\n') + m_lineNum++; + else if (c == '"') + stringChar = '"'; + else if (c == '\'') + stringChar = '\''; + } + } +} + +bool CFile::ConsumeHorizontalWhitespace() +{ + if (m_buffer[m_pos] == '\t' || m_buffer[m_pos] == ' ') + { + m_pos++; + return true; + } + + return false; +} + +bool CFile::ConsumeNewline() +{ + if (m_buffer[m_pos] == '\r' && m_buffer[m_pos + 1] == '\n') + { + m_pos += 2; + m_lineNum++; + std::putchar('\n'); + return true; + } + + if (m_buffer[m_pos] == '\n') + { + m_pos++; + m_lineNum++; + std::putchar('\n'); + return true; + } + + return false; +} + +void CFile::SkipWhitespace() +{ + while (ConsumeHorizontalWhitespace() || ConsumeNewline()) + ; +} + +void CFile::TryConvertString() +{ + long oldPos = m_pos; + long oldLineNum = m_lineNum; + bool noTerminator = false; + + if (m_buffer[m_pos] != '_' || (m_pos > 0 && IsIdentifierChar(m_buffer[m_pos - 1]))) + return; + + m_pos++; + + if (m_buffer[m_pos] == '_') + { + noTerminator = true; + m_pos++; + } + + SkipWhitespace(); + + if (m_buffer[m_pos] != '(') + { + m_pos = oldPos; + m_lineNum = oldLineNum; + return; + } + + m_pos++; + + SkipWhitespace(); + + std::printf("{ "); + + while (1) + { + SkipWhitespace(); + + if (m_buffer[m_pos] == '"') + { + unsigned char s[kMaxStringLength]; + int length; + StringParser stringParser(m_buffer, m_size); + + try + { + m_pos += stringParser.ParseString(m_pos, s, length); + } + catch (std::runtime_error& e) + { + RaiseError(e.what()); + } + + for (int i = 0; i < length; i++) + printf("0x%02X, ", s[i]); + } + else if (m_buffer[m_pos] == ')') + { + m_pos++; + break; + } + else + { + if (m_pos >= m_size) + RaiseError("unexpected EOF"); + if (IsAsciiPrintable(m_buffer[m_pos])) + RaiseError("unexpected character '%c'", m_buffer[m_pos]); + else + RaiseError("unexpected character '\\x%02X'", m_buffer[m_pos]); + } + } + + if (noTerminator) + std::printf(" }"); + else + std::printf("0xFF }"); +} + +bool CFile::CheckIdentifier(const std::string& ident) +{ + unsigned int i; + + for (i = 0; i < ident.length() && m_pos + i < (unsigned)m_size; i++) + if (ident[i] != m_buffer[m_pos + i]) + return false; + + return (i == ident.length()); +} + +std::unique_ptr<unsigned char[]> CFile::ReadWholeFile(const std::string& path, int& size) +{ + FILE* fp = std::fopen(path.c_str(), "rb"); + + if (fp == nullptr) + RaiseError("Failed to open \"%s\" for reading.\n", path.c_str()); + + std::fseek(fp, 0, SEEK_END); + + size = std::ftell(fp); + + std::unique_ptr<unsigned char[]> buffer = std::unique_ptr<unsigned char[]>(new unsigned char[size]); + + std::rewind(fp); + + if (std::fread(buffer.get(), size, 1, fp) != 1) + RaiseError("Failed to read \"%s\".\n", path.c_str()); + + std::fclose(fp); + + return buffer; +} + +int ExtractData(const std::unique_ptr<unsigned char[]>& buffer, int offset, int size) +{ + switch (size) + { + case 1: + return buffer[offset]; + case 2: + return (buffer[offset + 1] << 8) + | buffer[offset]; + case 4: + return (buffer[offset + 3] << 24) + | (buffer[offset + 2] << 16) + | (buffer[offset + 1] << 8) + | buffer[offset]; + default: + FATAL_ERROR("Invalid size passed to ExtractData.\n"); + } +} + +void CFile::TryConvertIncbin() +{ + std::string idents[6] = { "INCBIN_S8", "INCBIN_U8", "INCBIN_S16", "INCBIN_U16", "INCBIN_S32", "INCBIN_U32" }; + int incbinType = -1; + + for (int i = 0; i < 6; i++) + { + if (CheckIdentifier(idents[i])) + { + incbinType = i; + break; + } + } + + if (incbinType == -1) + return; + + int size = 1 << (incbinType / 2); + bool isSigned = ((incbinType % 2) == 0); + + long oldPos = m_pos; + long oldLineNum = m_lineNum; + + m_pos += idents[incbinType].length(); + + SkipWhitespace(); + + if (m_buffer[m_pos] != '(') + { + m_pos = oldPos; + m_lineNum = oldLineNum; + return; + } + + m_pos++; + + std::printf("{"); + + while (true) + { + SkipWhitespace(); + + if (m_buffer[m_pos] != '"') + RaiseError("expected double quote"); + + m_pos++; + + int startPos = m_pos; + + while (m_buffer[m_pos] != '"') + { + if (m_buffer[m_pos] == 0) + { + if (m_pos >= m_size) + RaiseError("unexpected EOF in path string"); + else + RaiseError("unexpected null character in path string"); + } + + if (m_buffer[m_pos] == '\r' || m_buffer[m_pos] == '\n') + RaiseError("unexpected end of line character in path string"); + + if (m_buffer[m_pos] == '\\') + RaiseError("unexpected escape in path string"); + + m_pos++; + } + + std::string path(&m_buffer[startPos], m_pos - startPos); + + m_pos++; + + int fileSize; + std::unique_ptr<unsigned char[]> buffer = ReadWholeFile(path, fileSize); + + if ((fileSize % size) != 0) + RaiseError("Size %d doesn't evenly divide file size %d.\n", size, fileSize); + + int count = fileSize / size; + int offset = 0; + + for (int i = 0; i < count; i++) + { + int data = ExtractData(buffer, offset, size); + offset += size; + + if (isSigned) + std::printf("%d,", data); + else + std::printf("%uu,", data); + } + + SkipWhitespace(); + + if (m_buffer[m_pos] != ',') + break; + + m_pos++; + } + + if (m_buffer[m_pos] != ')') + RaiseError("expected ')'"); + + m_pos++; + + std::printf("}"); +} + +// Reports a diagnostic message. +void CFile::ReportDiagnostic(const char* type, const char* format, std::va_list args) +{ + const int bufferSize = 1024; + char buffer[bufferSize]; + std::vsnprintf(buffer, bufferSize, format, args); + std::fprintf(stderr, "%s:%ld: %s: %s\n", m_filename.c_str(), m_lineNum, type, buffer); +} + +#define DO_REPORT(type) \ +do \ +{ \ + std::va_list args; \ + va_start(args, format); \ + ReportDiagnostic(type, format, args); \ + va_end(args); \ +} while (0) + +// Reports an error diagnostic and terminates the program. +void CFile::RaiseError(const char* format, ...) +{ + DO_REPORT("error"); + std::exit(1); +} + +// Reports a warning diagnostic. +void CFile::RaiseWarning(const char* format, ...) +{ + DO_REPORT("warning"); +} diff --git a/tools/preproc/c_file.h b/tools/preproc/c_file.h new file mode 100644 index 0000000..7369aba --- /dev/null +++ b/tools/preproc/c_file.h @@ -0,0 +1,58 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#ifndef C_FILE_H +#define C_FILE_H + +#include <cstdarg> +#include <cstdint> +#include <string> +#include <memory> +#include "preproc.h" + +class CFile +{ +public: + CFile(std::string filename); + CFile(CFile&& other); + CFile(const CFile&) = delete; + ~CFile(); + void Preproc(); + +private: + char* m_buffer; + long m_pos; + long m_size; + long m_lineNum; + std::string m_filename; + + bool ConsumeHorizontalWhitespace(); + bool ConsumeNewline(); + void SkipWhitespace(); + void TryConvertString(); + std::unique_ptr<unsigned char[]> ReadWholeFile(const std::string& path, int& size); + bool CheckIdentifier(const std::string& ident); + void TryConvertIncbin(); + void ReportDiagnostic(const char* type, const char* format, std::va_list args); + void RaiseError(const char* format, ...); + void RaiseWarning(const char* format, ...); +}; + +#endif // C_FILE_H diff --git a/tools/preproc/char_util.h b/tools/preproc/char_util.h new file mode 100644 index 0000000..02a6e1c --- /dev/null +++ b/tools/preproc/char_util.h @@ -0,0 +1,71 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#ifndef CHAR_UTIL_H +#define CHAR_UTIL_H + +#include <cstdint> +#include <cassert> + +inline bool IsAscii(unsigned char c) +{ + return (c < 128); +} + +inline bool IsAsciiAlpha(unsigned char c) +{ + return ((c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z')); +} + +inline bool IsAsciiDigit(unsigned char c) +{ + return (c >= '0' && c <= '9'); +} + +inline bool IsAsciiHexDigit(unsigned char c) +{ + return ((c >= '0' && c <= '9') + || (c >= 'a' && c <= 'f') + || (c >= 'A' && c <= 'F')); +} + +inline bool IsAsciiAlphanum(unsigned char c) +{ + return (IsAsciiAlpha(c) || IsAsciiDigit(c)); +} + +inline bool IsAsciiPrintable(unsigned char c) +{ + return (c >= ' ' && c <= '~'); +} + +// Returns whether the character can start a C identifier or the identifier of a "{FOO}" constant in strings. +inline bool IsIdentifierStartingChar(unsigned char c) +{ + return IsAsciiAlpha(c) || c == '_'; +} + +// Returns whether the character can be used in a C identifier or the identifier of a "{FOO}" constant in strings. +inline bool IsIdentifierChar(unsigned char c) +{ + return IsAsciiAlphanum(c) || c == '_'; +} + +#endif // CHAR_UTIL_H diff --git a/tools/preproc/charmap.cpp b/tools/preproc/charmap.cpp new file mode 100644 index 0000000..a7bedfe --- /dev/null +++ b/tools/preproc/charmap.cpp @@ -0,0 +1,408 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#include <cstdio> +#include <cstdint> +#include <cstdarg> +#include "preproc.h" +#include "charmap.h" +#include "char_util.h" +#include "utf8.h" + +enum LhsType +{ + Char, + Escape, + Constant, + None +}; + +struct Lhs +{ + LhsType type; + std::string name; + std::int32_t code; +}; + +class CharmapReader +{ +public: + CharmapReader(std::string filename); + CharmapReader(const CharmapReader&) = delete; + ~CharmapReader(); + Lhs ReadLhs(); + void ExpectEqualsSign(); + std::string ReadSequence(); + void ExpectEmptyRestOfLine(); + void RaiseError(const char* format, ...); + +private: + char* m_buffer; + long m_pos; + long m_size; + long m_lineNum; + std::string m_filename; + + void RemoveComments(); + std::string ReadConstant(); + void SkipWhitespace(); +}; + +CharmapReader::CharmapReader(std::string filename) : m_filename(filename) +{ + FILE *fp = std::fopen(filename.c_str(), "rb"); + + if (fp == NULL) + FATAL_ERROR("Failed to open \"%s\" for reading.\n", filename.c_str()); + + std::fseek(fp, 0, SEEK_END); + + m_size = std::ftell(fp); + + if (m_size < 0) + FATAL_ERROR("File size of \"%s\" is less than zero.\n", filename.c_str()); + + m_buffer = new char[m_size + 1]; + + std::rewind(fp); + + if (std::fread(m_buffer, m_size, 1, fp) != 1) + FATAL_ERROR("Failed to read \"%s\".\n", filename.c_str()); + + m_buffer[m_size] = 0; + + std::fclose(fp); + + m_pos = 0; + m_lineNum = 1; + + RemoveComments(); +} + +CharmapReader::~CharmapReader() +{ + delete[] m_buffer; +} + +Lhs CharmapReader::ReadLhs() +{ + Lhs lhs; + + for (;;) + { + SkipWhitespace(); + + if (m_buffer[m_pos] == '\n') + { + m_pos++; + m_lineNum++; + } + else + { + break; + } + } + + if (m_buffer[m_pos] == '\'') + { + m_pos++; + + bool isEscape = (m_buffer[m_pos] == '\\'); + + if (isEscape) + { + m_pos++; + } + + unsigned char c = m_buffer[m_pos]; + + if (c == 0) + { + if (m_pos >= m_size) + RaiseError("unexpected EOF in UTF-8 character literal"); + else + RaiseError("unexpected null character in UTF-8 character literal"); + } + + if (IsAscii(c) && !IsAsciiPrintable(c)) + RaiseError("unexpected character U+%X in UTF-8 character literal", c); + + UnicodeChar unicodeChar = DecodeUtf8(&m_buffer[m_pos]); + std::int32_t code = unicodeChar.code; + + if (code == -1) + RaiseError("invalid encoding in UTF-8 character literal"); + + m_pos += unicodeChar.encodingLength; + + if (m_buffer[m_pos] != '\'') + RaiseError("unterminated character literal"); + + m_pos++; + + lhs.code = code; + + if (isEscape) + { + if (code >= 128) + RaiseError("escapes using non-ASCII characters are invalid"); + + switch (code) + { + case '\'': + lhs.type = LhsType::Char; + break; + case '\\': + lhs.type = LhsType::Char; + case '"': + RaiseError("cannot escape double quote"); + break; + default: + lhs.type = LhsType::Escape; + } + } + else + { + if (code == '\'') + RaiseError("empty character literal"); + + lhs.type = LhsType::Char; + } + } + else if (IsIdentifierStartingChar(m_buffer[m_pos])) + { + lhs.type = LhsType::Constant; + lhs.name = ReadConstant(); + } + else if (m_buffer[m_pos] == '\r') + { + RaiseError("only Unix-style LF newlines are supported"); + } + else if (m_buffer[m_pos] == 0) + { + if (m_pos < m_size) + RaiseError("unexpected null character"); + lhs.type = LhsType::None; + } + else + { + RaiseError("junk at start of line"); + } + + return lhs; +} + +void CharmapReader::ExpectEqualsSign() +{ + SkipWhitespace(); + + if (m_buffer[m_pos] != '=') + RaiseError("expected equals sign"); + + m_pos++; +} + +static unsigned int ConvertHexDigit(char c) +{ + unsigned int digit = 0; + + if (c >= '0' && c <= '9') + digit = c - '0'; + else if (c >= 'A' && c <= 'F') + digit = 10 + c - 'A'; + else if (c >= 'a' && c <= 'f') + digit = 10 + c - 'a'; + + return digit; +} + +std::string CharmapReader::ReadSequence() +{ + SkipWhitespace(); + + long startPos = m_pos; + + unsigned int length = 0; + + while (IsAsciiHexDigit(m_buffer[m_pos]) && IsAsciiHexDigit(m_buffer[m_pos + 1])) + { + m_pos += 2; + length++; + + if (length > kMaxCharmapSequenceLength) + RaiseError("byte sequence too long (max is %lu bytes)", kMaxCharmapSequenceLength); + + SkipWhitespace(); + } + + if (IsAsciiHexDigit(m_buffer[m_pos])) + RaiseError("each byte must have 2 hex digits"); + + if (length == 0) + RaiseError("expected byte sequence"); + + std::string sequence; + sequence.reserve(length); + + m_pos = startPos; + + for (unsigned int i = 0; i < length; i++) + { + unsigned int digit1 = ConvertHexDigit(m_buffer[m_pos]); + unsigned int digit2 = ConvertHexDigit(m_buffer[m_pos + 1]); + unsigned char byte = digit1 * 16 + digit2; + sequence += byte; + + m_pos += 2; + SkipWhitespace(); + } + + return sequence; +} + +void CharmapReader::ExpectEmptyRestOfLine() +{ + SkipWhitespace(); + + if (m_buffer[m_pos] == 0) + { + if (m_pos < m_size) + RaiseError("unexpected null character"); + } + else if (m_buffer[m_pos] == '\n') + { + m_pos++; + m_lineNum++; + } + else if (m_buffer[m_pos] == '\r') + { + RaiseError("only Unix-style LF newlines are supported"); + } + else + { + RaiseError("junk at end of line"); + } +} + +void CharmapReader::RaiseError(const char* format, ...) +{ + const int bufferSize = 1024; + char buffer[bufferSize]; + + std::va_list args; + va_start(args, format); + std::vsnprintf(buffer, bufferSize, format, args); + va_end(args); + + std::fprintf(stderr, "%s:%ld: error: %s\n", m_filename.c_str(), m_lineNum, buffer); + + std::exit(1); +} + +void CharmapReader::RemoveComments() +{ + long pos = 0; + bool inString = false; + + for (;;) + { + if (m_buffer[pos] == 0) + return; + + if (inString) + { + if (m_buffer[pos] == '\\' && m_buffer[pos + 1] == '\'') + { + pos += 2; + } + else + { + if (m_buffer[pos] == '\'') + inString = false; + pos++; + } + } + else if (m_buffer[pos] == '@') + { + while (m_buffer[pos] != '\n' && m_buffer[pos] != 0) + m_buffer[pos++] = ' '; + } + else + { + if (m_buffer[pos] == '\'') + inString = true; + pos++; + } + } +} + +std::string CharmapReader::ReadConstant() +{ + long startPos = m_pos; + + while (IsIdentifierChar(m_buffer[m_pos])) + m_pos++; + + return std::string(&m_buffer[startPos], m_pos - startPos); +} + +void CharmapReader::SkipWhitespace() +{ + while (m_buffer[m_pos] == '\t' || m_buffer[m_pos] == ' ') + m_pos++; +} + +Charmap::Charmap(std::string filename) +{ + CharmapReader reader(filename); + + for (;;) + { + Lhs lhs = reader.ReadLhs(); + + if (lhs.type == LhsType::None) + return; + + reader.ExpectEqualsSign(); + + std::string sequence = reader.ReadSequence(); + + switch (lhs.type) + { + case LhsType::Char: + if (m_chars.find(lhs.code) != m_chars.end()) + reader.RaiseError("redefining char"); + m_chars[lhs.code] = sequence; + break; + case LhsType::Escape: + if (m_escapes[lhs.code].length() != 0) + reader.RaiseError("redefining escape"); + m_escapes[lhs.code] = sequence; + break; + case LhsType::Constant: + if (m_constants.find(lhs.name) != m_constants.end()) + reader.RaiseError("redefining constant"); + m_constants[lhs.name] = sequence; + break; + } + + reader.ExpectEmptyRestOfLine(); + } +} diff --git a/tools/preproc/charmap.h b/tools/preproc/charmap.h new file mode 100644 index 0000000..0d752ac --- /dev/null +++ b/tools/preproc/charmap.h @@ -0,0 +1,64 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#ifndef CHARMAP_H +#define CHARMAP_H + +#include <cstdint> +#include <string> +#include <map> +#include <vector> + +class Charmap +{ +public: + Charmap(std::string filename); + + std::string Char(std::int32_t code) + { + auto it = m_chars.find(code); + + if (it == m_chars.end()) + return std::string(); + + return it->second; + } + + std::string Escape(unsigned char code) + { + return m_escapes[code]; + } + + std::string Constant(std::string identifier) + { + auto it = m_constants.find(identifier); + + if (it == m_constants.end()) + return std::string(); + + return it->second; + } +private: + std::map<std::int32_t, std::string> m_chars; + std::string m_escapes[128]; + std::map<std::string, std::string> m_constants; +}; + +#endif // CHARMAP_H diff --git a/tools/preproc/preproc.cpp b/tools/preproc/preproc.cpp new file mode 100644 index 0000000..c9c6042 --- /dev/null +++ b/tools/preproc/preproc.cpp @@ -0,0 +1,156 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#include <string> +#include <stack> +#include "preproc.h" +#include "asm_file.h" +#include "c_file.h" +#include "charmap.h" + +Charmap* g_charmap; + +void PrintAsmBytes(unsigned char *s, int length) +{ + if (length > 0) + { + std::printf("\t.byte "); + for (int i = 0; i < length; i++) + { + std::printf("0x%02X", s[i]); + + if (i < length - 1) + std::printf(", "); + } + std::putchar('\n'); + } +} + +void PreprocAsmFile(std::string filename) +{ + std::stack<AsmFile> stack; + + stack.push(AsmFile(filename)); + + for (;;) + { + while (stack.top().IsAtEnd()) + { + stack.pop(); + + if (stack.empty()) + return; + else + stack.top().OutputLocation(); + } + + Directive directive = stack.top().GetDirective(); + + switch (directive) + { + case Directive::Include: + stack.push(AsmFile(stack.top().ReadPath())); + stack.top().OutputLocation(); + break; + case Directive::String: + { + unsigned char s[kMaxStringLength]; + int length = stack.top().ReadString(s); + PrintAsmBytes(s, length); + break; + } + case Directive::Braille: + { + unsigned char s[kMaxStringLength]; + int length = stack.top().ReadBraille(s); + PrintAsmBytes(s, length); + break; + } + case Directive::Unknown: + { + std::string globalLabel = stack.top().GetGlobalLabel(); + + if (globalLabel.length() != 0) + { + const char *s = globalLabel.c_str(); + std::printf("%s: ; .global %s\n", s, s); + } + else + { + stack.top().OutputLine(); + } + + break; + } + } + } +} + +void PreprocCFile(std::string filename) +{ + CFile cFile(filename); + cFile.Preproc(); +} + +char* GetFileExtension(char* filename) +{ + char* extension = filename; + + while (*extension != 0) + extension++; + + while (extension > filename && *extension != '.') + extension--; + + if (extension == filename) + return nullptr; + + extension++; + + if (*extension == 0) + return nullptr; + + return extension; +} + +int main(int argc, char **argv) +{ + if (argc != 3) + { + std::fprintf(stderr, "Usage: %s SRC_FILE CHARMAP_FILE", argv[0]); + return 1; + } + + g_charmap = new Charmap(argv[2]); + + char* extension = GetFileExtension(argv[1]); + + if (!extension) + FATAL_ERROR("\"%s\" has no file extension.\n", argv[1]); + + if ((extension[0] == 's') && extension[1] == 0) + PreprocAsmFile(argv[1]); + else if ((extension[0] == 'c' || extension[0] == 'i') && extension[1] == 0) + PreprocCFile(argv[1]); + else + FATAL_ERROR("\"%s\" has an unknown file extension of \"%s\".\n", argv[1], extension); + + return 0; +} diff --git a/tools/preproc/preproc.h b/tools/preproc/preproc.h new file mode 100644 index 0000000..515f64e --- /dev/null +++ b/tools/preproc/preproc.h @@ -0,0 +1,54 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#ifndef PREPROC_H +#define PREPROC_H + +#include <cstdio> +#include <cstdlib> +#include "charmap.h" + +#ifdef _MSC_VER + +#define FATAL_ERROR(format, ...) \ +do \ +{ \ + std::fprintf(stderr, format, __VA_ARGS__); \ + std::exit(1); \ +} while (0) + +#else + +#define FATAL_ERROR(format, ...) \ +do \ +{ \ + std::fprintf(stderr, format, ##__VA_ARGS__); \ + std::exit(1); \ +} while (0) + +#endif // _MSC_VER + +const int kMaxPath = 256; +const int kMaxStringLength = 1024; +const unsigned long kMaxCharmapSequenceLength = 16; + +extern Charmap* g_charmap; + +#endif // PREPROC_H diff --git a/tools/preproc/string_parser.cpp b/tools/preproc/string_parser.cpp new file mode 100644 index 0000000..dd5196a --- /dev/null +++ b/tools/preproc/string_parser.cpp @@ -0,0 +1,355 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#include <cstdio> +#include <cstdarg> +#include <stdexcept> +#include "preproc.h" +#include "string_parser.h" +#include "char_util.h" +#include "utf8.h" + +// Reads a charmap char or escape sequence. +std::string StringParser::ReadCharOrEscape() +{ + std::string sequence; + + bool isEscape = (m_buffer[m_pos] == '\\'); + + if (isEscape) + { + m_pos++; + + if (m_buffer[m_pos] == '"') + { + sequence = g_charmap->Char('"'); + + if (sequence.length() == 0) + RaiseError("no mapping exists for double quote"); + + return sequence; + } + else if (m_buffer[m_pos] == '\\') + { + sequence = g_charmap->Char('\\'); + + if (sequence.length() == 0) + RaiseError("no mapping exists for backslash"); + + return sequence; + } + } + + unsigned char c = m_buffer[m_pos]; + + if (c == 0) + { + if (m_pos >= m_size) + RaiseError("unexpected EOF in UTF-8 string"); + else + RaiseError("unexpected null character in UTF-8 string"); + } + + if (IsAscii(c) && !IsAsciiPrintable(c)) + RaiseError("unexpected character U+%X in UTF-8 string", c); + + UnicodeChar unicodeChar = DecodeUtf8(&m_buffer[m_pos]); + m_pos += unicodeChar.encodingLength; + std::int32_t code = unicodeChar.code; + + if (code == -1) + RaiseError("invalid encoding in UTF-8 string"); + + if (isEscape && code >= 128) + RaiseError("escapes using non-ASCII characters are invalid"); + + sequence = isEscape ? g_charmap->Escape(code) : g_charmap->Char(code); + + if (sequence.length() == 0) + { + if (isEscape) + RaiseError("unknown escape '\\%c'", code); + else + RaiseError("unknown character U+%X", code); + } + + return sequence; +} + +// Reads a charmap constant, i.e. "{FOO}". +std::string StringParser::ReadBracketedConstants() +{ + std::string totalSequence; + + m_pos++; // Assume we're on the left curly bracket. + + while (m_buffer[m_pos] != '}') + { + SkipWhitespace(); + + if (IsIdentifierStartingChar(m_buffer[m_pos])) + { + long startPos = m_pos; + + m_pos++; + + while (IsIdentifierChar(m_buffer[m_pos])) + m_pos++; + + std::string sequence = g_charmap->Constant(std::string(&m_buffer[startPos], m_pos - startPos)); + + if (sequence.length() == 0) + { + m_buffer[m_pos] = 0; + RaiseError("unknown constant '%s'", &m_buffer[startPos]); + } + + totalSequence += sequence; + } + else if (IsAsciiDigit(m_buffer[m_pos])) + { + Integer integer = ReadInteger(); + + switch (integer.size) + { + case 1: + totalSequence += (unsigned char)integer.value; + break; + case 2: + totalSequence += (unsigned char)integer.value; + totalSequence += (unsigned char)(integer.value >> 8); + break; + case 4: + totalSequence += (unsigned char)integer.value; + totalSequence += (unsigned char)(integer.value >> 8); + totalSequence += (unsigned char)(integer.value >> 16); + totalSequence += (unsigned char)(integer.value >> 24); + break; + } + } + else if (m_buffer[m_pos] == 0) + { + if (m_pos >= m_size) + RaiseError("unexpected EOF after left curly bracket"); + else + RaiseError("unexpected null character within curly brackets"); + } + else + { + if (IsAsciiPrintable(m_buffer[m_pos])) + RaiseError("unexpected character '%c' within curly brackets", m_buffer[m_pos]); + else + RaiseError("unexpected character '\\x%02X' within curly brackets", m_buffer[m_pos]); + } + } + + m_pos++; // Go past the right curly bracket. + + return totalSequence; +} + +// Reads a charmap string. +int StringParser::ParseString(long srcPos, unsigned char* dest, int& destLength) +{ + m_pos = srcPos; + + if (m_buffer[m_pos] != '"') + RaiseError("expected UTF-8 string literal"); + + long start = m_pos; + + m_pos++; + + destLength = 0; + + while (m_buffer[m_pos] != '"') + { + std::string sequence = (m_buffer[m_pos] == '{') ? ReadBracketedConstants() : ReadCharOrEscape(); + + for (const char& c : sequence) + { + if (destLength == kMaxStringLength) + RaiseError("mapped string longer than %d bytes", kMaxStringLength); + + dest[destLength++] = c; + } + } + + m_pos++; // Go past the right quote. + + return m_pos - start; +} + +void StringParser::RaiseError(const char* format, ...) +{ + const int bufferSize = 1024; + char buffer[bufferSize]; + + std::va_list args; + va_start(args, format); + std::vsnprintf(buffer, bufferSize, format, args); + va_end(args); + + throw std::runtime_error(buffer); +} + +// Converts digit character to numerical value. +static int ConvertDigit(char c, int radix) +{ + int digit; + + if (c >= '0' && c <= '9') + digit = c - '0'; + else if (c >= 'A' && c <= 'F') + digit = 10 + c - 'A'; + else if (c >= 'a' && c <= 'f') + digit = 10 + c - 'a'; + else + return -1; + + return (digit < radix) ? digit : -1; +} + +void StringParser::SkipRestOfInteger(int radix) +{ + while (ConvertDigit(m_buffer[m_pos], radix) != -1) + m_pos++; +} + +StringParser::Integer StringParser::ReadDecimal() +{ + const int radix = 10; + std::uint64_t n = 0; + int digit; + std::uint64_t max = UINT32_MAX; + long startPos = m_pos; + + while ((digit = ConvertDigit(m_buffer[m_pos], radix)) != -1) + { + n = n * radix + digit; + + if (n >= max) + { + SkipRestOfInteger(radix); + + std::string intLiteral(m_buffer + startPos, m_pos - startPos); + RaiseError("integer literal \"%s\" is too large", intLiteral.c_str()); + } + + m_pos++; + } + + int size; + + if (m_buffer[m_pos] == 'H') + { + if (n >= 0x10000) + { + RaiseError("%lu is too large to be a halfword", (unsigned long)n); + } + + size = 2; + m_pos++; + } + else if (m_buffer[m_pos] == 'W') + { + size = 4; + m_pos++; + } + else + { + if (n >= 0x10000) + size = 4; + else if (n >= 0x100) + size = 2; + else + size = 1; + } + + return{ static_cast<std::uint32_t>(n), size }; +} + +StringParser::Integer StringParser::ReadHex() +{ + const int radix = 16; + std::uint64_t n = 0; + int digit; + std::uint64_t max = UINT32_MAX; + long startPos = m_pos; + + while ((digit = ConvertDigit(m_buffer[m_pos], radix)) != -1) + { + n = n * radix + digit; + + if (n >= max) + { + SkipRestOfInteger(radix); + + std::string intLiteral(m_buffer + startPos, m_pos - startPos); + RaiseError("integer literal \"%s\" is too large", intLiteral.c_str()); + } + + m_pos++; + } + + int length = m_pos - startPos; + int size = 0; + + switch (length) + { + case 2: + size = 1; + break; + case 4: + size = 2; + break; + case 8: + size = 4; + break; + default: + { + std::string intLiteral(m_buffer + startPos, m_pos - startPos); + RaiseError("hex integer literal \"0x%s\" doesn't have length of 2, 4, or 8 digits", intLiteral.c_str()); + } + } + + return{ static_cast<std::uint32_t>(n), size }; +} + +StringParser::Integer StringParser::ReadInteger() +{ + if (!IsAsciiDigit(m_buffer[m_pos])) + RaiseError("expected integer"); + + if (m_buffer[m_pos] == '0' && m_buffer[m_pos + 1] == 'x') + { + m_pos += 2; + return ReadHex(); + } + + return ReadDecimal(); +} + +// Skips tabs and spaces. +void StringParser::SkipWhitespace() +{ + while (m_buffer[m_pos] == '\t' || m_buffer[m_pos] == ' ') + m_pos++; +} diff --git a/tools/preproc/string_parser.h b/tools/preproc/string_parser.h new file mode 100644 index 0000000..abd2bfe --- /dev/null +++ b/tools/preproc/string_parser.h @@ -0,0 +1,55 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#ifndef STRING_PARSER_H +#define STRING_PARSER_H + +#include <cstdint> +#include <string> +#include "preproc.h" + +class StringParser +{ +public: + StringParser(char* buffer, long size) : m_buffer(buffer), m_size(size), m_pos(0) {} + int ParseString(long srcPos, unsigned char* dest, int &destLength); + +private: + struct Integer + { + std::uint32_t value; + int size; + }; + + char* m_buffer; + long m_size; + long m_pos; + + Integer ReadInteger(); + Integer ReadDecimal(); + Integer ReadHex(); + std::string ReadCharOrEscape(); + std::string ReadBracketedConstants(); + void SkipWhitespace(); + void SkipRestOfInteger(int radix); + void RaiseError(const char* format, ...); +}; + +#endif // STRING_PARSER_H diff --git a/tools/preproc/utf8.cpp b/tools/preproc/utf8.cpp new file mode 100644 index 0000000..7facfd4 --- /dev/null +++ b/tools/preproc/utf8.cpp @@ -0,0 +1,92 @@ +// Copyright (c) 2008-2009 Bjoern Hoehrmann <bjoern@hoehrmann.de> +// See http://bjoern.hoehrmann.de/utf-8/decoder/dfa/ for details. +// +// Copyright(c) 2016 YamaArashi +// +// 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. + +#include <cstdint> +#include "utf8.h" + +static const unsigned char s_byteTypeTable[] = +{ + 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, // 00..1f + 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, // 20..3f + 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, // 40..5f + 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, // 60..7f + 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9, // 80..9f + 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, // a0..bf + 8,8,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, // c0..df + 0xa,0x3,0x3,0x3,0x3,0x3,0x3,0x3,0x3,0x3,0x3,0x3,0x3,0x4,0x3,0x3, // e0..ef + 0xb,0x6,0x6,0x6,0x5,0x8,0x8,0x8,0x8,0x8,0x8,0x8,0x8,0x8,0x8,0x8, // f0..ff +}; + +const unsigned char s0 = 0 * 12; +const unsigned char s1 = 1 * 12; +const unsigned char s2 = 2 * 12; +const unsigned char s3 = 3 * 12; +const unsigned char s4 = 4 * 12; +const unsigned char s5 = 5 * 12; +const unsigned char s6 = 6 * 12; +const unsigned char s7 = 7 * 12; +const unsigned char s8 = 8 * 12; + +static const unsigned char s_transitionTable[] = +{ + s0,s1,s2,s3,s5,s8,s7,s1,s1,s1,s4,s6, // s0 + s1,s1,s1,s1,s1,s1,s1,s1,s1,s1,s1,s1, // s1 + s1,s0,s1,s1,s1,s1,s1,s0,s1,s0,s1,s1, // s2 + s1,s2,s1,s1,s1,s1,s1,s2,s1,s2,s1,s1, // s3 + s1,s1,s1,s1,s1,s1,s1,s2,s1,s1,s1,s1, // s4 + s1,s2,s1,s1,s1,s1,s1,s1,s1,s2,s1,s1, // s5 + s1,s1,s1,s1,s1,s1,s1,s3,s1,s3,s1,s1, // s6 + s1,s3,s1,s1,s1,s1,s1,s3,s1,s3,s1,s1, // s7 + s1,s3,s1,s1,s1,s1,s1,s1,s1,s1,s1,s1, // s8 +}; + +// Decodes UTF-8 encoded Unicode code point at "s". +UnicodeChar DecodeUtf8(const char* s) +{ + UnicodeChar unicodeChar; + int state = s0; + auto start = s; + + do + { + unsigned char byte = *s++; + int type = s_byteTypeTable[byte]; + + if (state == s0) + unicodeChar.code = (0xFF >> type) & byte; + else + unicodeChar.code = (unicodeChar.code << 6) | (byte & 0x3F); + + state = s_transitionTable[state + type]; + + if (state == s1) + { + unicodeChar.code = -1; + return unicodeChar; + } + } while (state != s0); + + unicodeChar.encodingLength = s - start; + + return unicodeChar; +} diff --git a/tools/preproc/utf8.h b/tools/preproc/utf8.h new file mode 100644 index 0000000..259de67 --- /dev/null +++ b/tools/preproc/utf8.h @@ -0,0 +1,34 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#ifndef UTF8_H +#define UTF8_H + +#include <cstdint> + +struct UnicodeChar +{ + std::int32_t code; + int encodingLength; +}; + +UnicodeChar DecodeUtf8(const char* s); + +#endif // UTF8_H diff --git a/tools/ramscrgen/.gitignore b/tools/ramscrgen/.gitignore new file mode 100644 index 0000000..4d0ae82 --- /dev/null +++ b/tools/ramscrgen/.gitignore @@ -0,0 +1 @@ +ramscrgen diff --git a/tools/ramscrgen/LICENSE b/tools/ramscrgen/LICENSE new file mode 100644 index 0000000..534d153 --- /dev/null +++ b/tools/ramscrgen/LICENSE @@ -0,0 +1,19 @@ +Copyright (c) 2016 YamaArashi + +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. diff --git a/tools/ramscrgen/Makefile b/tools/ramscrgen/Makefile new file mode 100644 index 0000000..9aa309a --- /dev/null +++ b/tools/ramscrgen/Makefile @@ -0,0 +1,15 @@ +CXX := g++ + +CXXFLAGS := -std=c++11 -O2 -Wall -Wno-switch -Werror + +SRCS := main.cpp sym_file.cpp elf.cpp + +HEADERS := ramscrgen.h sym_file.h elf.h char_util.h + +.PHONY: clean + +ramscrgen: $(SRCS) $(HEADERS) + $(CXX) $(CXXFLAGS) $(SRCS) -o $@ $(LDFLAGS) + +clean: + $(RM) ramscrgen ramscrgen.exe diff --git a/tools/ramscrgen/char_util.h b/tools/ramscrgen/char_util.h new file mode 100644 index 0000000..ab20dbc --- /dev/null +++ b/tools/ramscrgen/char_util.h @@ -0,0 +1,71 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#ifndef CHAR_UTIL_H +#define CHAR_UTIL_H + +#include <cstdint> +#include <cassert> + +inline bool IsAscii(unsigned char c) +{ + return (c < 128); +} + +inline bool IsAsciiAlpha(unsigned char c) +{ + return ((c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z')); +} + +inline bool IsAsciiDigit(unsigned char c) +{ + return (c >= '0' && c <= '9'); +} + +inline bool IsAsciiHexDigit(unsigned char c) +{ + return ((c >= '0' && c <= '9') + || (c >= 'a' && c <= 'f') + || (c >= 'A' && c <= 'F')); +} + +inline bool IsAsciiAlphanum(unsigned char c) +{ + return (IsAsciiAlpha(c) || IsAsciiDigit(c)); +} + +inline bool IsAsciiPrintable(unsigned char c) +{ + return (c >= ' ' && c <= '~'); +} + +// Returns whether the character can start the identifier of a "{FOO}" constant in strings. +inline bool IsIdentifierStartingChar(unsigned char c) +{ + return IsAsciiAlpha(c) || c == '_'; +} + +// Returns whether the character can be used in the identifier of a "{FOO}" constant in strings. +inline bool IsIdentifierChar(unsigned char c) +{ + return IsAsciiAlphanum(c) || c == '_'; +} + +#endif // CHAR_UTIL_H diff --git a/tools/ramscrgen/elf.cpp b/tools/ramscrgen/elf.cpp new file mode 100644 index 0000000..7e78704 --- /dev/null +++ b/tools/ramscrgen/elf.cpp @@ -0,0 +1,272 @@ +#include <cstdio> +#include <cstring> +#include <cstdint> +#include <map> +#include <vector> +#include <string> +#include "ramscrgen.h" +#include "elf.h" + +#define SHN_COMMON 0xFFF2 + +static std::string s_elfPath; +static std::string s_archiveFilePath; +static std::string s_archiveObjectPath; + +static FILE *s_file; + +static std::uint32_t s_sectionHeaderOffset; +static int s_sectionHeaderEntrySize; +static int s_sectionCount; +static int s_shstrtabIndex; + +static std::uint32_t s_symtabOffset; +static std::uint32_t s_strtabOffset; + +static std::uint32_t s_symbolCount; +static std::uint32_t s_elfFileOffset; + +struct Symbol +{ + std::uint32_t nameOffset; + std::uint32_t size; +}; + +static void Seek(long offset) +{ + if (std::fseek(s_file, s_elfFileOffset + offset, SEEK_SET) != 0) + FATAL_ERROR("error: failed to seek to %ld in \"%s\"", offset, s_elfPath.c_str()); +} + +static void Skip(long offset) +{ + if (std::fseek(s_file, offset, SEEK_CUR) != 0) + FATAL_ERROR("error: failed to skip %ld bytes in \"%s\"", offset, s_elfPath.c_str()); +} + +static std::uint32_t ReadInt8() +{ + int c = std::fgetc(s_file); + + if (c < 0) + FATAL_ERROR("error: unexpected EOF when reading ELF file \"%s\"\n", s_elfPath.c_str()); + + return c; +} + +static std::uint32_t ReadInt16() +{ + std::uint32_t val = 0; + val |= ReadInt8(); + val |= ReadInt8() << 8; + return val; +} + +static std::uint32_t ReadInt32() +{ + std::uint32_t val = 0; + val |= ReadInt8(); + val |= ReadInt8() << 8; + val |= ReadInt8() << 16; + val |= ReadInt8() << 24; + return val; +} + +static std::string ReadString() +{ + std::string s; + char c; + + while ((c = ReadInt8()) != 0) + s += c; + + return s; +} + +static void VerifyElfIdent() +{ + char expectedMagic[4] = { 0x7F, 'E', 'L', 'F' }; + char magic[4]; + + if (std::fread(magic, 4, 1, s_file) != 1) + FATAL_ERROR("error: failed to read ELF magic from \"%s\"\n", s_elfPath.c_str()); + + if (std::memcmp(magic, expectedMagic, 4) != 0) + FATAL_ERROR("error: ELF magic did not match in \"%s\"\n", s_elfPath.c_str()); + + if (std::fgetc(s_file) != 1) + FATAL_ERROR("error: \"%s\" not 32-bit ELF\n", s_elfPath.c_str()); + + if (std::fgetc(s_file) != 1) + FATAL_ERROR("error: \"%s\" not little-endian ELF\n", s_elfPath.c_str()); +} + +static void VerifyAr() +{ + char expectedMagic[8] = {'!', '<', 'a', 'r', 'c', 'h', '>', '\n'}; + char magic[8]; + + if (std::fread(magic, 8, 1, s_file) != 1) + FATAL_ERROR("error: failed to read AR magic from \"%s\"\n", s_archiveFilePath.c_str()); + + if (std::memcmp(magic, expectedMagic, 8) != 0) + FATAL_ERROR("error: AR magic did not match in \"%s\"\n", s_archiveFilePath.c_str()); +} + +static void ReadElfHeader() +{ + Seek(0x20); + s_sectionHeaderOffset = ReadInt32(); + Seek(0x2E); + s_sectionHeaderEntrySize = ReadInt16(); + s_sectionCount = ReadInt16(); + s_shstrtabIndex = ReadInt16(); +} + +static void FindArObj() +{ + char file_ident[17] = {0}; + char filesize_s[11] = {0}; + char expectedEndMagic[2] = { 0x60, 0x0a }; + char end_magic[2]; + std::size_t filesize; + + Seek(8); + while (!std::feof(s_file)) { + if (std::fread(file_ident, 16, 1, s_file) != 1) + FATAL_ERROR("error: failed to read file ident in \"%s\"\n", s_archiveFilePath.c_str()); + Skip(32); + if (std::fread(filesize_s, 10, 1, s_file) != 1) + FATAL_ERROR("error: failed to read filesize in \"%s\"\n", s_archiveFilePath.c_str()); + if (std::fread(end_magic, 2, 1, s_file) != 1) + FATAL_ERROR("error: failed to read end sentinel in \"%s\"\n", s_archiveFilePath.c_str()); + if (std::memcmp(end_magic, expectedEndMagic, 2) != 0) + FATAL_ERROR("error: corrupted archive header in \"%s\" at \"%s\"\n", s_archiveFilePath.c_str(), file_ident); + + char * ptr = std::strchr(file_ident, '/'); + if (ptr != nullptr) + *ptr = 0; + filesize = std::strtoul(filesize_s, nullptr, 10); + if (std::strncmp(s_archiveObjectPath.c_str(), file_ident, 16) == 0) { + s_elfFileOffset = std::ftell(s_file); + return; + } + Skip(filesize); + } + + FATAL_ERROR("error: could not find object \"%s\" in archive \"%s\"\n", s_archiveObjectPath.c_str(), s_archiveFilePath.c_str()); +} + +static std::string GetSectionName(std::uint32_t shstrtabOffset, int index) +{ + Seek(s_sectionHeaderOffset + s_sectionHeaderEntrySize * index); + std::uint32_t nameOffset = ReadInt32(); + Seek(shstrtabOffset + nameOffset); + return ReadString(); +} + +static void FindTableOffsets() +{ + s_symtabOffset = 0; + s_strtabOffset = 0; + + Seek(s_sectionHeaderOffset + s_sectionHeaderEntrySize * s_shstrtabIndex + 0x10); + std::uint32_t shstrtabOffset = ReadInt32(); + + for (int i = 0; i < s_sectionCount; i++) + { + std::string name = GetSectionName(shstrtabOffset, i); + + if (name == ".symtab") + { + if (s_symtabOffset) + FATAL_ERROR("error: mutiple .symtab sections found in \"%s\"\n", s_elfPath.c_str()); + Seek(s_sectionHeaderOffset + s_sectionHeaderEntrySize * i + 0x10); + s_symtabOffset = ReadInt32(); + std::uint32_t size = ReadInt32(); + s_symbolCount = size / 16; + } + else if (name == ".strtab") + { + if (s_strtabOffset) + FATAL_ERROR("error: mutiple .strtab sections found in \"%s\"\n", s_elfPath.c_str()); + Seek(s_sectionHeaderOffset + s_sectionHeaderEntrySize * i + 0x10); + s_strtabOffset = ReadInt32(); + } + } + + if (!s_symtabOffset) + FATAL_ERROR("error: couldn't find .symtab section in \"%s\"\n", s_elfPath.c_str()); + + if (!s_strtabOffset) + FATAL_ERROR("error: couldn't find .strtab section in \"%s\"\n", s_elfPath.c_str()); +} + +static std::map<std::string, std::uint32_t> GetCommonSymbols_Shared() +{ + VerifyElfIdent(); + ReadElfHeader(); + FindTableOffsets(); + + std::map<std::string, std::uint32_t> commonSymbols; + + std::vector<Symbol> commonSymbolVec; + + Seek(s_symtabOffset); + + for (std::uint32_t i = 0; i < s_symbolCount; i++) + { + Symbol sym; + sym.nameOffset = ReadInt32(); + Skip(4); + sym.size = ReadInt32(); + Skip(2); + std::uint16_t sectionIndex = ReadInt16(); + if (sectionIndex == SHN_COMMON) + commonSymbolVec.push_back(sym); + } + + for (const Symbol& sym : commonSymbolVec) + { + Seek(s_strtabOffset + sym.nameOffset); + std::string name = ReadString(); + commonSymbols[name] = sym.size; + } + + return commonSymbols; +} + +std::map<std::string, std::uint32_t> GetCommonSymbolsFromLib(std::string sourcePath, std::string libpath) +{ + std::size_t colonPos = libpath.find(':'); + if (colonPos == std::string::npos) + FATAL_ERROR("error: missing colon separator in libfile \"%s\"\n", s_elfPath.c_str()); + + s_archiveObjectPath = libpath.substr(colonPos + 1); + s_archiveFilePath = sourcePath + "/" + libpath.substr(1, colonPos - 1); + s_elfPath = sourcePath + "/" + libpath.substr(1); + + s_file = std::fopen(s_archiveFilePath.c_str(), "rb"); + + if (s_file == NULL) + FATAL_ERROR("error: failed to open \"%s\" for reading\n", s_archiveFilePath.c_str()); + + VerifyAr(); + FindArObj(); + return GetCommonSymbols_Shared(); +} + +std::map<std::string, std::uint32_t> GetCommonSymbols(std::string sourcePath, std::string path) +{ + s_elfFileOffset = 0; + if (path[0] == '*') + return GetCommonSymbolsFromLib(sourcePath, path); + + s_elfPath = sourcePath + "/" + path; + s_file = std::fopen(s_elfPath.c_str(), "rb"); + + if (s_file == NULL) + FATAL_ERROR("error: failed to open \"%s\" for reading\n", path.c_str()); + + return GetCommonSymbols_Shared(); +} diff --git a/tools/ramscrgen/elf.h b/tools/ramscrgen/elf.h new file mode 100644 index 0000000..3704860 --- /dev/null +++ b/tools/ramscrgen/elf.h @@ -0,0 +1,30 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#ifndef ELF_H +#define ELF_H + +#include <cstdint> +#include <map> +#include <string> + +std::map<std::string, std::uint32_t> GetCommonSymbols(std::string sourcePath, std::string path); + +#endif // ELF_H diff --git a/tools/ramscrgen/main.cpp b/tools/ramscrgen/main.cpp new file mode 100644 index 0000000..5e5894f --- /dev/null +++ b/tools/ramscrgen/main.cpp @@ -0,0 +1,187 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#include <cstdio> +#include <cstring> +#include <string> +#include "ramscrgen.h" +#include "sym_file.h" +#include "elf.h" + +void HandleCommonInclude(std::string filename, std::string sourcePath, std::string symOrderPath, std::string lang) +{ + auto commonSymbols = GetCommonSymbols(sourcePath, filename); + std::size_t dotIndex; + + if (filename[0] == '*') { + dotIndex = filename.find_last_of(':'); + filename = filename.substr(dotIndex + 1); + } + + dotIndex = filename.find_last_of('.'); + + if (dotIndex == std::string::npos) + FATAL_ERROR("error: \"%s\" doesn't have a file extension\n", filename.c_str()); + + std::string symOrderFilename = filename.substr(0, dotIndex + 1) + "txt"; + + SymFile symFile(symOrderPath + "/" + symOrderFilename); + + while (!symFile.IsAtEnd()) + { + symFile.HandleLangConditional(lang); + + std::string label = symFile.GetLabel(false); + + if (label.length() == 0) + { + unsigned long length; + if (symFile.ReadInteger(length)) + { + if (length & 3) + symFile.RaiseWarning("gap length %d is not multiple of 4", length); + printf(". += 0x%lX;\n", length); + } + } + else + { + if (commonSymbols.count(label) == 0) + symFile.RaiseError("no common symbol named \"%s\"", label.c_str()); + unsigned long size = commonSymbols[label]; + int alignment = 4; + if (size > 4) + alignment = 8; + if (size > 8) + alignment = 16; + printf(". = ALIGN(%d);\n", alignment); + printf("%s = .;\n", label.c_str()); + printf(". += 0x%lX;\n", size); + } + + symFile.ExpectEmptyRestOfLine(); + } +} + +void ConvertSymFile(std::string filename, std::string sectionName, std::string lang, bool common, std::string sourcePath, std::string commonSymPath, std::string libSourcePath) +{ + SymFile symFile(filename); + + while (!symFile.IsAtEnd()) + { + symFile.HandleLangConditional(lang); + + Directive directive = symFile.GetDirective(); + + switch (directive) + { + case Directive::Include: + { + std::string incFilename = symFile.ReadPath(); + symFile.ExpectEmptyRestOfLine(); + printf(". = ALIGN(4);\n"); + if (common) + HandleCommonInclude(incFilename, incFilename[0] == '*' ? libSourcePath : sourcePath, commonSymPath, lang); + else + printf("%s(%s);\n", incFilename.c_str(), sectionName.c_str()); + break; + } + case Directive::Space: + { + unsigned long length; + if (!symFile.ReadInteger(length)) + symFile.RaiseError("expected integer after .space directive"); + symFile.ExpectEmptyRestOfLine(); + printf(". += 0x%lX;\n", length); + break; + } + case Directive::Align: + { + unsigned long amount; + if (!symFile.ReadInteger(amount)) + symFile.RaiseError("expected integer after .align directive"); + if (amount > 4) + symFile.RaiseError("max alignment amount is 4"); + amount = 1UL << amount; + symFile.ExpectEmptyRestOfLine(); + printf(". = ALIGN(%lu);\n", amount); + break; + } + case Directive::Unknown: + { + std::string label = symFile.GetLabel(); + + if (label.length() != 0) + { + printf("%s = .;\n", label.c_str()); + } + + symFile.ExpectEmptyRestOfLine(); + + break; + } + } + } +} + +int main(int argc, char **argv) +{ + if (argc < 4) + { + fprintf(stderr, "Usage: %s SECTION_NAME SYM_FILE LANG [-c SRC_PATH,COMMON_SYM_PATH]", argv[0]); + return 1; + } + + bool common = false; + std::string sectionName = std::string(argv[1]); + std::string symFileName = std::string(argv[2]); + std::string lang = std::string(argv[3]); + std::string sourcePath; + std::string commonSymPath; + std::string libSourcePath; + + if (argc > 4) + { + if (std::strcmp(argv[4], "-c") != 0) + FATAL_ERROR("error: unrecognized argument \"%s\"\n", argv[4]); + + if (argc < 6) + FATAL_ERROR("error: missing SRC_PATH,COMMON_SYM_PATH after \"-c\"\n"); + + common = true; + std::string paths = std::string(argv[5]); + std::size_t commaPos = paths.find(','); + + if (commaPos == std::string::npos) + FATAL_ERROR("error: missing comma in argument after \"-c\"\n"); + + sourcePath = paths.substr(0, commaPos); + commonSymPath = paths.substr(commaPos + 1); + commaPos = commonSymPath.find(','); + if (commaPos == std::string::npos) { + libSourcePath = "tools/agbcc/lib"; + } else { + libSourcePath = commonSymPath.substr(commaPos + 1); + commonSymPath = commonSymPath.substr(0, commaPos); + } + } + + ConvertSymFile(symFileName, sectionName, lang, common, sourcePath, commonSymPath, libSourcePath); + return 0; +} diff --git a/tools/ramscrgen/ramscrgen.h b/tools/ramscrgen/ramscrgen.h new file mode 100644 index 0000000..1aed1c0 --- /dev/null +++ b/tools/ramscrgen/ramscrgen.h @@ -0,0 +1,49 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#ifndef RAMSCRGEN_H +#define RAMSCRGEN_H + +#include <cstdio> +#include <cstdlib> + +#ifdef _MSC_VER + +#define FATAL_ERROR(format, ...) \ +do \ +{ \ + std::fprintf(stderr, format, __VA_ARGS__); \ + std::exit(1); \ +} while (0) + +#else + +#define FATAL_ERROR(format, ...) \ +do \ +{ \ + std::fprintf(stderr, format, ##__VA_ARGS__); \ + std::exit(1); \ +} while (0) + +#endif // _MSC_VER + +const int kMaxPath = 256; + +#endif // RAMSCRGEN_H diff --git a/tools/ramscrgen/sym_file.cpp b/tools/ramscrgen/sym_file.cpp new file mode 100644 index 0000000..5379bd9 --- /dev/null +++ b/tools/ramscrgen/sym_file.cpp @@ -0,0 +1,492 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#include <cstdio> +#include <cstdarg> +#include <climits> +#include "ramscrgen.h" +#include "sym_file.h" +#include "char_util.h" + +SymFile::SymFile(std::string filename) : m_filename(filename) +{ + FILE *fp = std::fopen(filename.c_str(), "rb"); + + if (fp == NULL) + FATAL_ERROR("Failed to open \"%s\" for reading.\n", filename.c_str()); + + std::fseek(fp, 0, SEEK_END); + + m_size = std::ftell(fp); + + if (m_size < 0) + FATAL_ERROR("File size of \"%s\" is less than zero.\n", filename.c_str()); + + m_buffer = new char[m_size + 1]; + + std::rewind(fp); + + if (std::fread(m_buffer, m_size, 1, fp) != 1) + FATAL_ERROR("Failed to read \"%s\".\n", filename.c_str()); + + m_buffer[m_size] = 0; + + std::fclose(fp); + + m_pos = 0; + m_lineNum = 1; + m_lineStart = 0; + m_inLangConditional = false; + + RemoveComments(); +} + +SymFile::SymFile(SymFile&& other) : m_filename(std::move(other.m_filename)) +{ + m_buffer = other.m_buffer; + m_pos = other.m_pos; + m_size = other.m_size; + m_lineNum = other.m_lineNum; + m_lineStart = other.m_lineStart; + + other.m_buffer = nullptr; +} + +SymFile::~SymFile() +{ + delete[] m_buffer; +} + +// Removes comments to simplify further processing. +// It stops upon encountering a null character, +// which may or may not be the end of file marker. +// If it's not, the error will be caught later. +void SymFile::RemoveComments() +{ + long pos = 0; + char stringChar = 0; + + for (;;) + { + if (m_buffer[pos] == 0) + return; + + if (stringChar != 0) + { + if (m_buffer[pos] == '\\' && m_buffer[pos + 1] == stringChar) + { + pos += 2; + } + else + { + if (m_buffer[pos] == stringChar) + stringChar = 0; + pos++; + } + } + else if (m_buffer[pos] == '@' && (pos == 0 || m_buffer[pos - 1] != '\\')) + { + while (m_buffer[pos] != '\n' && m_buffer[pos] != 0) + m_buffer[pos++] = ' '; + } + else if (m_buffer[pos] == '/' && m_buffer[pos + 1] == '*') + { + m_buffer[pos++] = ' '; + m_buffer[pos++] = ' '; + + char commentStringChar = 0; + + for (;;) + { + if (m_buffer[pos] == 0) + return; + + if (commentStringChar != 0) + { + if (m_buffer[pos] == '\\' && m_buffer[pos + 1] == commentStringChar) + { + m_buffer[pos++] = ' '; + m_buffer[pos++] = ' '; + } + else + { + if (m_buffer[pos] == commentStringChar) + commentStringChar = 0; + if (m_buffer[pos] != '\n') + m_buffer[pos] = ' '; + pos++; + } + } + else + { + if (m_buffer[pos] == '*' && m_buffer[pos + 1] == '/') + { + m_buffer[pos++] = ' '; + m_buffer[pos++] = ' '; + break; + } + else + { + if (m_buffer[pos] == '"' || m_buffer[pos] == '\'') + commentStringChar = m_buffer[pos]; + if (m_buffer[pos] != '\n') + m_buffer[pos] = ' '; + pos++; + } + } + } + } + else + { + if (m_buffer[pos] == '"' || m_buffer[pos] == '\'') + stringChar = m_buffer[pos]; + pos++; + } + } +} + +// Checks if we're at a particular directive and if so, consumes it. +// Returns whether the directive was found. +bool SymFile::CheckForDirective(std::string name) +{ + long i; + long length = static_cast<long>(name.length()); + + for (i = 0; i < length && m_pos + i < m_size; i++) + if (name[i] != m_buffer[m_pos + i]) + return false; + + if (i < length) + return false; + + m_pos += length; + + return true; +} + +// Checks if we're at a known directive and if so, consumes it. +// Returns which directive was found. +Directive SymFile::GetDirective() +{ + SkipWhitespace(); + + if (CheckForDirective(".include")) + return Directive::Include; + else if (CheckForDirective(".space")) + return Directive::Space; + else if (CheckForDirective(".align")) + return Directive::Align; + else + return Directive::Unknown; +} + +// Checks if we're at label. +// Returns the name if so and an empty string if not. +std::string SymFile::GetLabel(bool requireColon) +{ + long start = m_pos; + long pos = m_pos; + + if (IsIdentifierStartingChar(m_buffer[pos])) + { + pos++; + + while (IsIdentifierChar(m_buffer[pos])) + pos++; + } + + if (requireColon) + { + if (m_buffer[pos] == ':') + { + if (pos != start) + m_pos = pos + 1; + } + else + { + pos = start; + } + } + else + { + m_pos = pos; + } + + return std::string(&m_buffer[start], pos - start); +} + +// Skips tabs and spaces. +void SymFile::SkipWhitespace() +{ + while (m_buffer[m_pos] == '\t' || m_buffer[m_pos] == ' ') + m_pos++; +} + +// Reads include path. +std::string SymFile::ReadPath() +{ + SkipWhitespace(); + + if (m_buffer[m_pos] != '"') + RaiseError("expected file path"); + + m_pos++; + + int length = 0; + long startPos = m_pos; + + while (m_buffer[m_pos] != '"') + { + unsigned char c = m_buffer[m_pos++]; + + if (c == 0) + { + if (m_pos >= m_size) + RaiseError("unexpected EOF in include string"); + else + RaiseError("unexpected null character in include string"); + } + + if (!IsAsciiPrintable(c)) + RaiseError("unexpected character '\\x%02X' in include string", c); + + // Don't bother allowing any escape sequences. + if (c == '\\') + { + c = m_buffer[m_pos]; + RaiseError("unexpected escape '\\%c' in include string", c); + } + + length++; + + if (length > kMaxPath) + RaiseError("path is too long"); + } + + m_pos++; // Go past the right quote. + + return std::string(&m_buffer[startPos], length); +} + +// If we're at a comma, consumes it. +// Returns whether a comma was found. +bool SymFile::ConsumeComma() +{ + if (m_buffer[m_pos] == ',') + { + m_pos++; + return true; + } + + return false; +} + +// Converts digit character to numerical value. +static int ConvertDigit(char c, int radix) +{ + int digit; + + if (c >= '0' && c <= '9') + digit = c - '0'; + else if (c >= 'A' && c <= 'F') + digit = 10 + c - 'A'; + else if (c >= 'a' && c <= 'f') + digit = 10 + c - 'a'; + else + return -1; + + return (digit < radix) ? digit : -1; +} + +// Reads an integer. +bool SymFile::ReadInteger(unsigned long& n) +{ + SkipWhitespace(); + + if (!IsAsciiDigit(m_buffer[m_pos])) + return false; + + int startPos = m_pos; + int radix = 10; + + if (m_buffer[m_pos] == '0' && m_buffer[m_pos + 1] == 'x') + { + radix = 16; + m_pos += 2; + } + + unsigned long cutoff = ULONG_MAX / radix; + unsigned long cutoffRemainder = ULONG_MAX % radix; + int digit; + + n = 0; + + while ((digit = ConvertDigit(m_buffer[m_pos], radix)) != -1) + { + if (n < cutoff || (n == cutoff && (unsigned long)digit <= cutoffRemainder)) + { + n = n * radix + digit; + } + else + { + m_pos++; + + while (ConvertDigit(m_buffer[m_pos], radix) != -1) + m_pos++; + + RaiseError("integer is too large (%s)", std::string(&m_buffer[startPos], m_pos - startPos).c_str()); + } + + m_pos++; + } + + return true; +} + +// Asserts that the rest of the line is empty and moves to the next one. +void SymFile::ExpectEmptyRestOfLine() +{ + SkipWhitespace(); + + if (m_buffer[m_pos] == 0) + { + if (m_pos >= m_size) + RaiseWarning("file doesn't end with newline"); + else + RaiseError("unexpected null character"); + } + else if (m_buffer[m_pos] == '\n') + { + m_pos++; + m_lineStart = m_pos; + m_lineNum++; + } + else if (m_buffer[m_pos] == '\r') + { + RaiseError("only Unix-style LF newlines are supported"); + } + else + { + RaiseError("junk at end of line"); + } +} + + +void SymFile::SkipLine() +{ + while (m_buffer[m_pos] != 0 && m_buffer[m_pos] != '\n') + m_pos++; + + if (m_buffer[m_pos] == '\n') + m_pos++; +} + +// Checks if we're at the end of the file. +bool SymFile::IsAtEnd() +{ + return (m_pos >= m_size); +} + +void SymFile::HandleLangConditional(std::string lang) +{ + if (m_buffer[m_pos] != '#') + return; + + m_pos++; + + if (CheckForDirective("begin")) + { + if (m_inLangConditional) + RaiseError("already inside language conditional"); + + SkipWhitespace(); + + std::string label = GetLabel(false); + + if (label.length() == 0) + RaiseError("no language name after #begin"); + + ExpectEmptyRestOfLine(); + + if (lang == label) + { + m_inLangConditional = true; + } + else + { + while (!IsAtEnd() && m_buffer[m_pos] != '#') + SkipLine(); + + if (m_buffer[m_pos] != '#') + RaiseError("unterminated language conditional"); + + m_pos++; + + if (!CheckForDirective("end")) + RaiseError("expected #end"); + + ExpectEmptyRestOfLine(); + } + } + else if (CheckForDirective("end")) + { + if (!m_inLangConditional) + RaiseError("not inside language conditional"); + + m_inLangConditional = false; + + ExpectEmptyRestOfLine(); + } + else + { + RaiseError("unknown # directive"); + } +} + +// Reports a diagnostic message. +void SymFile::ReportDiagnostic(const char* type, const char* format, std::va_list args) +{ + const int bufferSize = 1024; + char buffer[bufferSize]; + std::vsnprintf(buffer, bufferSize, format, args); + std::fprintf(stderr, "%s:%ld: %s: %s\n", m_filename.c_str(), m_lineNum, type, buffer); +} + +#define DO_REPORT(type) \ +do \ +{ \ + std::va_list args; \ + va_start(args, format); \ + ReportDiagnostic(type, format, args); \ + va_end(args); \ +} while (0) + +// Reports an error diagnostic and terminates the program. +void SymFile::RaiseError(const char* format, ...) +{ + DO_REPORT("error"); + std::exit(1); +} + +// Reports a warning diagnostic. +void SymFile::RaiseWarning(const char* format, ...) +{ + DO_REPORT("warning"); +} diff --git a/tools/ramscrgen/sym_file.h b/tools/ramscrgen/sym_file.h new file mode 100644 index 0000000..bb0c803 --- /dev/null +++ b/tools/ramscrgen/sym_file.h @@ -0,0 +1,71 @@ +// Copyright(c) 2016 YamaArashi +// +// 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. + +#ifndef SYM_FILE_H +#define SYM_FILE_H + +#include <cstdarg> +#include <cstdint> +#include <string> +#include "ramscrgen.h" + +enum class Directive +{ + Include, + Space, + Align, + Unknown +}; + +class SymFile +{ +public: + SymFile(std::string filename); + SymFile(SymFile&& other); + SymFile(const SymFile&) = delete; + ~SymFile(); + Directive GetDirective(); + std::string GetLabel(bool requireColon = true); + std::string ReadPath(); + bool ReadInteger(unsigned long& value); + void ExpectEmptyRestOfLine(); + void SkipLine(); + bool IsAtEnd(); + void HandleLangConditional(std::string lang); + void RaiseError(const char* format, ...); + void RaiseWarning(const char* format, ...); + +private: + char* m_buffer; + long m_pos; + long m_size; + long m_lineNum; + long m_lineStart; + std::string m_filename; + bool m_inLangConditional; + + bool ConsumeComma(); + void RemoveComments(); + bool CheckForDirective(std::string name); + void SkipWhitespace(); + void ReportDiagnostic(const char* type, const char* format, std::va_list args); +}; + +#endif // SYM_FILE_H diff --git a/tools/rsfont/.gitignore b/tools/rsfont/.gitignore new file mode 100644 index 0000000..3140ece --- /dev/null +++ b/tools/rsfont/.gitignore @@ -0,0 +1 @@ +rsfont diff --git a/tools/rsfont/LICENSE b/tools/rsfont/LICENSE new file mode 100644 index 0000000..b497950 --- /dev/null +++ b/tools/rsfont/LICENSE @@ -0,0 +1,19 @@ +Copyright (c) 2015-2016 YamaArashi + +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. diff --git a/tools/rsfont/Makefile b/tools/rsfont/Makefile new file mode 100644 index 0000000..582be7b --- /dev/null +++ b/tools/rsfont/Makefile @@ -0,0 +1,15 @@ +CC = gcc + +CFLAGS = -Wall -Wextra -Werror -std=c11 -O2 -DPNG_SKIP_SETJMP_CHECK + +LIBS = -lpng -lz + +SRCS = main.c convert_png.c util.c font.c + +.PHONY: clean + +rsfont: $(SRCS) convert_png.h gfx.h global.h util.h font.h + $(CC) $(CFLAGS) $(SRCS) -o $@ $(LDFLAGS) $(LIBS) + +clean: + $(RM) rsfont rsfont.exe diff --git a/tools/rsfont/convert_png.c b/tools/rsfont/convert_png.c new file mode 100644 index 0000000..f6a3080 --- /dev/null +++ b/tools/rsfont/convert_png.c @@ -0,0 +1,169 @@ +// Copyright (c) 2015 YamaArashi + +#include <stdio.h> +#include <setjmp.h> +#include <png.h> +#include "global.h" +#include "convert_png.h" +#include "gfx.h" + +void ReadPng(char *path, struct Image *image) +{ + FILE *fp = fopen(path, "rb"); + + if (fp == NULL) + FATAL_ERROR("Failed to open \"%s\" for reading.\n", path); + + unsigned char sig[8]; + + if (fread(sig, 8, 1, fp) != 1) + FATAL_ERROR("Failed to read PNG signature from \"%s\".\n", path); + + if (png_sig_cmp(sig, 0, 8)) + FATAL_ERROR("\"%s\" does not have a valid PNG signature.\n", path); + + png_structp png_ptr = png_create_read_struct(PNG_LIBPNG_VER_STRING, NULL, NULL, NULL); + + if (!png_ptr) + FATAL_ERROR("Failed to create PNG read struct.\n"); + + png_infop info_ptr = png_create_info_struct(png_ptr); + + if (!info_ptr) + FATAL_ERROR("Failed to create PNG info struct.\n"); + + if (setjmp(png_jmpbuf(png_ptr))) + FATAL_ERROR("Failed to init I/O for reading \"%s\".\n", path); + + png_init_io(png_ptr, fp); + png_set_sig_bytes(png_ptr, 8); + png_read_info(png_ptr, info_ptr); + + int bit_depth = png_get_bit_depth(png_ptr, info_ptr); + + if (bit_depth != image->bitDepth) + FATAL_ERROR("\"%s\" has a bit depth of %d, but the expected bit depth is %d.\n", path, bit_depth, image->bitDepth); + + int color_type = png_get_color_type(png_ptr, info_ptr); + + if (color_type != PNG_COLOR_TYPE_GRAY && color_type != PNG_COLOR_TYPE_PALETTE) + FATAL_ERROR("\"%s\" has an unsupported color type.\n", path); + + // Check if the image has a palette so that we can tell if the colors need to be inverted later. + // Don't read the palette because it's not needed for now. + image->hasPalette = (color_type == PNG_COLOR_TYPE_PALETTE); + + image->width = png_get_image_width(png_ptr, info_ptr); + image->height = png_get_image_height(png_ptr, info_ptr); + + int rowbytes = png_get_rowbytes(png_ptr, info_ptr); + + image->pixels = malloc(image->height * rowbytes); + + if (image->pixels == NULL) + FATAL_ERROR("Failed to allocate pixel buffer.\n"); + + png_bytepp row_pointers = malloc(image->height * sizeof(png_bytep)); + + if (row_pointers == NULL) + FATAL_ERROR("Failed to allocate row pointers.\n"); + + for (int i = 0; i < image->height; i++) + row_pointers[i] = (png_bytep)(image->pixels + (i * rowbytes)); + + if (setjmp(png_jmpbuf(png_ptr))) + FATAL_ERROR("Error reading from \"%s\".\n", path); + + png_read_image(png_ptr, row_pointers); + + png_destroy_read_struct(&png_ptr, &info_ptr, NULL); + + free(row_pointers); + fclose(fp); +} + +void SetPngPalette(png_structp png_ptr, png_infop info_ptr, struct Palette *palette) +{ + png_colorp colors = malloc(palette->numColors * sizeof(png_color)); + + if (colors == NULL) + FATAL_ERROR("Failed to allocate PNG palette.\n"); + + for (int i = 0; i < palette->numColors; i++) { + colors[i].red = palette->colors[i].red; + colors[i].green = palette->colors[i].green; + colors[i].blue = palette->colors[i].blue; + } + + png_set_PLTE(png_ptr, info_ptr, colors, palette->numColors); + + free(colors); +} + +void WritePng(char *path, struct Image *image) +{ + FILE *fp = fopen(path, "wb"); + + if (fp == NULL) + FATAL_ERROR("Failed to open \"%s\" for writing.\n", path); + + png_structp png_ptr = png_create_write_struct(PNG_LIBPNG_VER_STRING, NULL, NULL, NULL); + + if (!png_ptr) + FATAL_ERROR("Failed to create PNG write struct.\n"); + + png_infop info_ptr = png_create_info_struct(png_ptr); + + if (!info_ptr) + FATAL_ERROR("Failed to create PNG info struct.\n"); + + if (setjmp(png_jmpbuf(png_ptr))) + FATAL_ERROR("Failed to init I/O for writing \"%s\".\n", path); + + png_init_io(png_ptr, fp); + + if (setjmp(png_jmpbuf(png_ptr))) + FATAL_ERROR("Error writing header for \"%s\".\n", path); + + int color_type = image->hasPalette ? PNG_COLOR_TYPE_PALETTE : PNG_COLOR_TYPE_GRAY; + + png_set_IHDR(png_ptr, info_ptr, image->width, image->height, + image->bitDepth, color_type, PNG_INTERLACE_NONE, + PNG_COMPRESSION_TYPE_BASE, PNG_FILTER_TYPE_BASE); + + if (image->hasPalette) { + SetPngPalette(png_ptr, info_ptr, &image->palette); + + if (image->hasTransparency) { + png_byte trans = 0; + png_set_tRNS(png_ptr, info_ptr, &trans, 1, 0); + } + } + + png_write_info(png_ptr, info_ptr); + + png_bytepp row_pointers = malloc(image->height * sizeof(png_bytep)); + + if (row_pointers == NULL) + FATAL_ERROR("Failed to allocate row pointers.\n"); + + int rowbytes = png_get_rowbytes(png_ptr, info_ptr); + + for (int i = 0; i < image->height; i++) + row_pointers[i] = (png_bytep)(image->pixels + (i * rowbytes)); + + if (setjmp(png_jmpbuf(png_ptr))) + FATAL_ERROR("Error writing \"%s\".\n", path); + + png_write_image(png_ptr, row_pointers); + + if (setjmp(png_jmpbuf(png_ptr))) + FATAL_ERROR("Error ending write of \"%s\".\n", path); + + png_write_end(png_ptr, NULL); + + fclose(fp); + + png_destroy_write_struct(&png_ptr, &info_ptr); + free(row_pointers); +} diff --git a/tools/rsfont/convert_png.h b/tools/rsfont/convert_png.h new file mode 100644 index 0000000..55d3d69 --- /dev/null +++ b/tools/rsfont/convert_png.h @@ -0,0 +1,11 @@ +// Copyright (c) 2015 YamaArashi + +#ifndef CONVERT_PNG_H +#define CONVERT_PNG_H + +#include "gfx.h" + +void ReadPng(char *path, struct Image *image); +void WritePng(char *path, struct Image *image); + +#endif // CONVERT_PNG_H diff --git a/tools/rsfont/font.c b/tools/rsfont/font.c new file mode 100644 index 0000000..ed48b31 --- /dev/null +++ b/tools/rsfont/font.c @@ -0,0 +1,455 @@ +// Copyright(c) 2015-2016 YamaArashi +// +// 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. + +#include <stdio.h> +#include <stdlib.h> +#include <stdint.h> +#include <stdbool.h> +#include "global.h" +#include "font.h" +#include "gfx.h" +#include "util.h" + +unsigned char gFontPalette[][3] = +{ + {0xFF, 0xFF, 0xFF}, // bg (white) + {0x38, 0x38, 0x38}, // fg (dark grey) + {0xD8, 0xD8, 0xD8}, // shadow (light grey) +}; + +void ConvertFromTiles1Bpp(unsigned char *src, unsigned char *dest, int numGlyphs, int layout) +{ + for (int glyph = 0; glyph < numGlyphs; glyph++) + { + if (layout == 0) + { + for (int i = 0; i < 8; i++) + { + uint8_t srcRow = src[(glyph * 8) + i]; + + for (int j = 0; j < 8; j++) + { + int x = ((glyph % 16) * 8) + j; + int y = ((glyph / 16) * 8) + i; + dest[(y * 128) + x] = (srcRow >> (7 - j)) & 1; + } + } + } + else + { + // layout type 1 + + int tile1Offset = glyph * 16; + int tile2Offset = tile1Offset + 8; + + for (int i = 0; i < 8; i++) + { + uint8_t srcRow = src[tile1Offset + i]; + + for (int j = 0; j < 8; j++) + { + int x = ((glyph % 16) * 8) + j; + int y = ((glyph / 16) * 16) + i; + dest[(y * 128) + x] = (srcRow >> (7 - j)) & 1; + } + } + + for (int i = 0; i < 8; i++) + { + uint8_t srcRow = src[tile2Offset + i]; + + for (int j = 0; j < 8; j++) + { + int x = ((glyph % 16) * 8) + j; + int y = ((glyph / 16) * 16) + 8 + i; + dest[(y * 128) + x] = (srcRow >> (7 - j)) & 1; + } + } + } + } +} + +void ConvertToTiles1Bpp(unsigned char *src, unsigned char *dest, int numGlyphs, int layout) +{ + for (int glyph = 0; glyph < numGlyphs; glyph++) + { + if (layout == 0) + { + for (int i = 0; i < 8; i++) + { + uint8_t destRow = 0; + + for (int j = 0; j < 8; j++) + { + int x = ((glyph % 16) * 8) + j; + int y = ((glyph / 16) * 8) + i; + unsigned char color = src[(y * 128) + x]; + + if (color > 1) + FATAL_ERROR("More than 2 colors in 1 BPP font.\n"); + + destRow <<= 1; + destRow |= color; + } + + dest[(glyph * 8) + i] = destRow; + } + } + else + { + // layout type 1 + + int tile1Offset = glyph * 16; + int tile2Offset = tile1Offset + 8; + + for (int i = 0; i < 8; i++) + { + uint8_t destRow = 0; + + for (int j = 0; j < 8; j++) + { + int x = ((glyph % 16) * 8) + j; + int y = ((glyph / 16) * 16) + i; + unsigned char color = src[(y * 128) + x]; + + if (color > 1) + FATAL_ERROR("More than 2 colors in 1 BPP font.\n"); + + destRow <<= 1; + destRow |= color; + } + + dest[tile1Offset + i] = destRow; + } + + for (int i = 0; i < 8; i++) + { + uint8_t destRow = 0; + + for (int j = 0; j < 8; j++) + { + int x = ((glyph % 16) * 8) + j; + int y = ((glyph / 16) * 16) + 8 + i; + unsigned char color = src[(y * 128) + x]; + + if (color > 1) + FATAL_ERROR("More than 2 colors in 1 BPP font.\n"); + + destRow <<= 1; + destRow |= color; + } + + dest[tile2Offset + i] = destRow; + } + } + } +} + +void ConvertFromTiles4Bpp(unsigned char *src, unsigned char *dest, int numGlyphs, int layout) +{ + static unsigned char table[16] = + { + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 1, + }; + + for (int glyph = 0; glyph < numGlyphs; glyph++) + { + if (layout == 0) + { + int offset = glyph * 32; + + for (int i = 0; i < 8; i++) + { + uint32_t srcRow = (src[offset + 3] << 24) + | (src[offset + 2] << 16) + | (src[offset + 1] << 8) + | src[offset]; + + for (int j = 0; j < 8; j++) + { + int x = ((glyph % 16) * 8) + j; + int y = ((glyph / 16) * 8) + i; + dest[(y * 128) + x] = table[srcRow & 0xF]; + srcRow >>= 4; + } + + offset += 4; + } + } + else + { + int tile1Offset; + int tile2Offset; + + if (layout == 1) + { + tile1Offset = glyph * 64; + tile2Offset = tile1Offset + 32; + } + else + { + tile1Offset = ((glyph / 16) * 1024) + ((glyph % 16) * 32); + tile2Offset = tile1Offset + 512; + } + + for (int i = 0; i < 8; i++) + { + uint32_t srcRow = (src[tile1Offset + 3] << 24) + | (src[tile1Offset + 2] << 16) + | (src[tile1Offset + 1] << 8) + | src[tile1Offset]; + + for (int j = 0; j < 8; j++) + { + int x = ((glyph % 16) * 8) + j; + int y = ((glyph / 16) * 16) + i; + dest[(y * 128) + x] = table[srcRow & 0xF]; + srcRow >>= 4; + } + + tile1Offset += 4; + } + + for (int i = 0; i < 8; i++) + { + uint32_t srcRow = (src[tile2Offset + 3] << 24) + | (src[tile2Offset + 2] << 16) + | (src[tile2Offset + 1] << 8) + | src[tile2Offset]; + + for (int j = 0; j < 8; j++) + { + int x = ((glyph % 16) * 8) + j; + int y = ((glyph / 16) * 16) + 8 + i; + dest[(y * 128) + x] = table[srcRow & 0xF]; + srcRow >>= 4; + } + + tile2Offset += 4; + } + } + } +} + +void ConvertToTiles4Bpp(unsigned char *src, unsigned char *dest, int numGlyphs, int layout) +{ + static unsigned char table[3] = + { + 0, 15, 14, + }; + + for (int glyph = 0; glyph < numGlyphs; glyph++) + { + if (layout == 0) + { + int offset = glyph * 32; + + for (int i = 0; i < 8; i++) + { + uint32_t destRow = 0; + + for (int j = 0; j < 8; j++) + { + int x = ((glyph % 16) * 8) + j; + int y = ((glyph / 16) * 8) + i; + unsigned char color = src[(y * 128) + x]; + + if (color > 2) + FATAL_ERROR("More than 3 colors in 4 BPP font.\n"); + + destRow >>= 4; + destRow |= (table[color] << 28); + } + + dest[offset] = destRow & 0xFF; + dest[offset + 1] = (destRow >> 8) & 0xFF; + dest[offset + 2] = (destRow >> 16) & 0xFF; + dest[offset + 3] = (destRow >> 24) & 0xFF; + + offset += 4; + } + } + else + { + int tile1Offset; + int tile2Offset; + + if (layout == 1) + { + tile1Offset = glyph * 64; + tile2Offset = tile1Offset + 32; + } + else + { + tile1Offset = ((glyph / 16) * 1024) + ((glyph % 16) * 32); + tile2Offset = tile1Offset + 512; + } + + for (int i = 0; i < 8; i++) + { + uint32_t destRow = 0; + + for (int j = 0; j < 8; j++) + { + int x = ((glyph % 16) * 8) + j; + int y = ((glyph / 16) * 16) + i; + unsigned char color = src[(y * 128) + x]; + + if (color > 2) + FATAL_ERROR("More than 3 colors in 4 BPP font.\n"); + + destRow >>= 4; + destRow |= (table[color] << 28); + } + + dest[tile1Offset] = destRow & 0xFF; + dest[tile1Offset + 1] = (destRow >> 8) & 0xFF; + dest[tile1Offset + 2] = (destRow >> 16) & 0xFF; + dest[tile1Offset + 3] = (destRow >> 24) & 0xFF; + + tile1Offset += 4; + } + + for (int i = 0; i < 8; i++) + { + uint32_t destRow = 0; + + for (int j = 0; j < 8; j++) + { + int x = ((glyph % 16) * 8) + j; + int y = ((glyph / 16) * 16) + 8 + i; + unsigned char color = src[(y * 128) + x]; + + if (color > 2) + FATAL_ERROR("More than 3 colors in 4 BPP font.\n"); + + destRow >>= 4; + destRow |= (table[color] << 28); + } + + dest[tile2Offset] = destRow & 0xFF; + dest[tile2Offset + 1] = (destRow >> 8) & 0xFF; + dest[tile2Offset + 2] = (destRow >> 16) & 0xFF; + dest[tile2Offset + 3] = (destRow >> 24) & 0xFF; + + tile2Offset += 4; + } + } + } +} + +static void SetFontPalette(struct Image *image) +{ + image->hasPalette = true; + + image->palette.numColors = 3; + + for (int i = 0; i < image->palette.numColors; i++) + { + image->palette.colors[i].red = gFontPalette[i][0]; + image->palette.colors[i].green = gFontPalette[i][1]; + image->palette.colors[i].blue = gFontPalette[i][2]; + } + + image->hasTransparency = false; +} + +int CalcFileSize(int numGlyphs, int bpp, int layout) +{ + if (layout == 2) + { + // assume 4 BPP + int numFullRows = numGlyphs / 16; + int remainder = numGlyphs % 16; + int fullRowsSize = numFullRows * 1024; + int remainderSize = 0; + + if (remainder != 0) + remainderSize = 1024 - (16 - remainder) * 32; + + return fullRowsSize + remainderSize; + } + else + { + int tilesPerGlyph = layout > 0 ? 2 : 1; + int bytesPerTile = 8 * bpp; + return numGlyphs * tilesPerGlyph * bytesPerTile; + } +} + +void ReadFont(char *path, struct Image *image, int numGlyphs, int bpp, int layout) +{ + int fileSize; + unsigned char *buffer = ReadWholeFile(path, &fileSize); + + int expectedFileSize = CalcFileSize(numGlyphs, bpp, layout); + + if (fileSize != expectedFileSize) + FATAL_ERROR("The file size is %d but should be %d.\n", fileSize, expectedFileSize); + + int numRows = (numGlyphs + 15) / 16; + int rowHeight = layout > 0 ? 16 : 8; + + image->width = 128; + image->height = numRows * rowHeight; + image->bitDepth = 8; + image->pixels = calloc(image->width * image->height, 1); + + if (image->pixels == NULL) + FATAL_ERROR("Failed to allocate memory for font.\n"); + + if (bpp == 1) + ConvertFromTiles1Bpp(buffer, image->pixels, numGlyphs, layout); + else + ConvertFromTiles4Bpp(buffer, image->pixels, numGlyphs, layout); + + free(buffer); + + SetFontPalette(image); +} + +void WriteFont(char *path, struct Image *image, int numGlyphs, int bpp, int layout) +{ + if (image->width != 128) + FATAL_ERROR("The width of the font image (%d) is not 128.\n", image->width); + + int numRows = (numGlyphs + 15) / 16; + int rowHeight = layout > 0 ? 16 : 8; + int expectedHeight = numRows * rowHeight; + + if (image->height < expectedHeight) + FATAL_ERROR("The height of the font image (%d) is less than %d.\n", image->height, expectedHeight); + + int fileSize = CalcFileSize(numGlyphs, bpp, layout); + + unsigned char *buffer = calloc(fileSize, 1); + + if (buffer == NULL) + FATAL_ERROR("Failed to allocate memory for font.\n"); + + if (bpp == 1) + ConvertToTiles1Bpp(image->pixels, buffer, numGlyphs, layout); + else + ConvertToTiles4Bpp(image->pixels, buffer, numGlyphs, layout); + + WriteWholeFile(path, buffer, fileSize); + + free(buffer); +} diff --git a/tools/rsfont/font.h b/tools/rsfont/font.h new file mode 100644 index 0000000..1cd4875 --- /dev/null +++ b/tools/rsfont/font.h @@ -0,0 +1,30 @@ +// Copyright(c) 2015-2016 YamaArashi +// +// 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. + +#ifndef FONT_H +#define FONT_H + +#include <stdbool.h> +#include "gfx.h" + +void ReadFont(char *path, struct Image *image, int numGlyphs, int bpp, int layout); +void WriteFont(char *path, struct Image *image, int numGlyphs, int bpp, int layout); + +#endif // FONT_H diff --git a/tools/rsfont/gfx.h b/tools/rsfont/gfx.h new file mode 100644 index 0000000..04a3d80 --- /dev/null +++ b/tools/rsfont/gfx.h @@ -0,0 +1,50 @@ +// Copyright(c) 2015-2016 YamaArashi +// +// 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. + +#ifndef GFX_H +#define GFX_H + +#include <stdint.h> +#include <stdbool.h> + +struct Color +{ + unsigned char red; + unsigned char green; + unsigned char blue; +}; + +struct Palette +{ + struct Color colors[256]; + int numColors; +}; + +struct Image { + int width; + int height; + int bitDepth; + unsigned char *pixels; + bool hasPalette; + struct Palette palette; + bool hasTransparency; +}; + +#endif // GFX_H diff --git a/tools/rsfont/global.h b/tools/rsfont/global.h new file mode 100644 index 0000000..65dd351 --- /dev/null +++ b/tools/rsfont/global.h @@ -0,0 +1,31 @@ +// Copyright (c) 2015 YamaArashi + +#ifndef GLOBAL_H +#define GLOBAL_H + +#include <stdio.h> +#include <stdlib.h> + +#ifdef _MSC_VER + +#define FATAL_ERROR(format, ...) \ +do { \ + fprintf(stderr, format, __VA_ARGS__); \ + exit(1); \ +} while (0) + +#define UNUSED + +#else + +#define FATAL_ERROR(format, ...) \ +do { \ + fprintf(stderr, format, ##__VA_ARGS__); \ + exit(1); \ +} while (0) + +#define UNUSED __attribute__((__unused__)) + +#endif // _MSC_VER + +#endif // GLOBAL_H diff --git a/tools/rsfont/main.c b/tools/rsfont/main.c new file mode 100644 index 0000000..2f5d9d9 --- /dev/null +++ b/tools/rsfont/main.c @@ -0,0 +1,93 @@ +// Copyright(c) 2015-2016 YamaArashi +// +// 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. + +#include <stdio.h> +#include <string.h> +#include <stdbool.h> +#include "global.h" +#include "util.h" +#include "gfx.h" +#include "convert_png.h" +#include "font.h" + +int ExtensionToBpp(const char *extension) +{ + if (!strcmp(extension, "1bpp")) + return 1; + else if (!strcmp(extension, "4bpp")) + return 4; + return 0; +} + +int main(int argc, char **argv) +{ + if (argc < 5) + FATAL_ERROR("Usage: rsfont INPUT_FILE OUTPUT_FILE NUM_GLYPHS LAYOUT_TYPE\n"); + + char *inputPath = argv[1]; + char *outputPath = argv[2]; + char *inputFileExtension = GetFileExtension(inputPath); + char *outputFileExtension = GetFileExtension(outputPath); + + if (inputFileExtension == NULL) + FATAL_ERROR("Input file \"%s\" has no extension.\n", inputPath); + + if (outputFileExtension == NULL) + FATAL_ERROR("Output file \"%s\" has no extension.\n", outputPath); + + int numGlyphs; + int bpp; + int layout; + + if (!ParseNumber(argv[3], NULL, 10, &numGlyphs)) + FATAL_ERROR("Failed to parse number of glyphs.\n"); + + if (!ParseNumber(argv[4], NULL, 10, &layout)) + FATAL_ERROR("Failed to parse layout type.\n"); + + if (layout < 0 || layout > 2) + FATAL_ERROR("Layout type %d is invalid. Layout type must be 0, 1, or 2.\n", layout); + + bool toPng; + + if (!strcmp(inputFileExtension, "png") && (bpp = ExtensionToBpp(outputFileExtension)) != 0) + toPng = false; + else if ((bpp = ExtensionToBpp(inputFileExtension)) != 0 && !strcmp(outputFileExtension, "png")) + toPng = true; + else + FATAL_ERROR("Don't know how to convert \"%s\" to \"%s\".\n", inputPath, outputPath); + + if (bpp == 1 && layout == 2) + FATAL_ERROR("Layout type 2 is not supported with 1 BPP fonts.\n"); + + struct Image image; + + if (toPng) + { + ReadFont(inputPath, &image, numGlyphs, bpp, layout); + WritePng(outputPath, &image); + } + else + { + image.bitDepth = 8; + ReadPng(inputPath, &image); + WriteFont(outputPath, &image, numGlyphs, bpp, layout); + } +} diff --git a/tools/rsfont/util.c b/tools/rsfont/util.c new file mode 100644 index 0000000..87abeb3 --- /dev/null +++ b/tools/rsfont/util.c @@ -0,0 +1,124 @@ +// Copyright (c) 2015 YamaArashi + +#include <stdio.h> +#include <stdlib.h> +#include <string.h> +#include <stdbool.h> +#include <errno.h> +#include <limits.h> +#include "global.h" +#include "util.h" + +bool ParseNumber(char *s, char **end, int radix, int *intValue) +{ + char *localEnd; + + if (end == NULL) + end = &localEnd; + + errno = 0; + + const long longValue = strtol(s, end, radix); + + if (*end == s) + return false; // not a number + + if ((longValue == LONG_MIN || longValue == LONG_MAX) && errno == ERANGE) + return false; + + if (longValue > INT_MAX) + return false; + + if (longValue < INT_MIN) + return false; + + *intValue = (int)longValue; + + return true; +} + +char *GetFileExtension(char *path) +{ + char *extension = path; + + while (*extension != 0) + extension++; + + while (extension > path && *extension != '.') + extension--; + + if (extension == path) + return NULL; + + extension++; + + if (*extension == 0) + return NULL; + + return extension; +} + +unsigned char *ReadWholeFile(char *path, int *size) +{ + FILE *fp = fopen(path, "rb"); + + if (fp == NULL) + FATAL_ERROR("Failed to open \"%s\" for reading.\n", path); + + fseek(fp, 0, SEEK_END); + + *size = ftell(fp); + + unsigned char *buffer = malloc(*size); + + if (buffer == NULL) + FATAL_ERROR("Failed to allocate memory for reading \"%s\".\n", path); + + rewind(fp); + + if (fread(buffer, *size, 1, fp) != 1) + FATAL_ERROR("Failed to read \"%s\".\n", path); + + fclose(fp); + + return buffer; +} + +unsigned char *ReadWholeFileZeroPadded(char *path, int *size, int padAmount) +{ + FILE *fp = fopen(path, "rb"); + + if (fp == NULL) + FATAL_ERROR("Failed to open \"%s\" for reading.\n", path); + + fseek(fp, 0, SEEK_END); + + *size = ftell(fp); + + unsigned char *buffer = calloc(*size + padAmount, 1); + + if (buffer == NULL) + FATAL_ERROR("Failed to allocate memory for reading \"%s\".\n", path); + + rewind(fp); + + if (fread(buffer, *size, 1, fp) != 1) + FATAL_ERROR("Failed to read \"%s\".\n", path); + + fclose(fp); + + return buffer; +} + +void WriteWholeFile(char *path, void *buffer, int bufferSize) +{ + FILE *fp = fopen(path, "wb"); + + if (fp == NULL) + FATAL_ERROR("Failed to open \"%s\" for writing.\n", path); + + if (fwrite(buffer, bufferSize, 1, fp) != 1) + FATAL_ERROR("Failed to write to \"%s\".\n", path); + + fclose(fp); +} diff --git a/tools/rsfont/util.h b/tools/rsfont/util.h new file mode 100644 index 0000000..6d7a9c2 --- /dev/null +++ b/tools/rsfont/util.h @@ -0,0 +1,14 @@ +// Copyright (c) 2015 YamaArashi + +#ifndef UTIL_H +#define UTIL_H + +#include <stdbool.h> + +bool ParseNumber(char *s, char **end, int radix, int *intValue); +char *GetFileExtension(char *path); +unsigned char *ReadWholeFile(char *path, int *size); +unsigned char *ReadWholeFileZeroPadded(char *path, int *size, int padAmount); +void WriteWholeFile(char *path, void *buffer, int bufferSize); + +#endif // UTIL_H diff --git a/tools/scaninc/.gitignore b/tools/scaninc/.gitignore new file mode 100644 index 0000000..94bfbf9 --- /dev/null +++ b/tools/scaninc/.gitignore @@ -0,0 +1 @@ +scaninc diff --git a/tools/scaninc/LICENSE b/tools/scaninc/LICENSE new file mode 100644 index 0000000..b66bf81 --- /dev/null +++ b/tools/scaninc/LICENSE @@ -0,0 +1,19 @@ +Copyright (c) 2015 YamaArashi + +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. diff --git a/tools/scaninc/Makefile b/tools/scaninc/Makefile new file mode 100644 index 0000000..53c9d00 --- /dev/null +++ b/tools/scaninc/Makefile @@ -0,0 +1,15 @@ +CXX = g++ + +CXXFLAGS = -Wall -Werror -std=c++11 -O2 + +SRCS = scaninc.cpp c_file.cpp asm_file.cpp source_file.cpp + +HEADERS := scaninc.h asm_file.h c_file.h source_file.h + +.PHONY: clean + +scaninc: $(SRCS) $(HEADERS) + $(CXX) $(CXXFLAGS) $(SRCS) -o $@ $(LDFLAGS) + +clean: + $(RM) scaninc scaninc.exe diff --git a/tools/scaninc/asm_file.cpp b/tools/scaninc/asm_file.cpp new file mode 100644 index 0000000..109e604 --- /dev/null +++ b/tools/scaninc/asm_file.cpp @@ -0,0 +1,192 @@ +// Copyright(c) 2015-2017 YamaArashi +// +// 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. + +#include <cstdio> +#include <string> +#include "scaninc.h" +#include "asm_file.h" + +AsmFile::AsmFile(std::string path) +{ + m_path = path; + + FILE *fp = std::fopen(path.c_str(), "rb"); + + if (fp == NULL) + FATAL_ERROR("Failed to open \"%s\" for reading.\n", path.c_str()); + + std::fseek(fp, 0, SEEK_END); + + m_size = std::ftell(fp); + + m_buffer = new char[m_size]; + + std::rewind(fp); + + if (std::fread(m_buffer, m_size, 1, fp) != 1) + FATAL_ERROR("Failed to read \"%s\".\n", path.c_str()); + + std::fclose(fp); + + m_pos = 0; + m_lineNum = 1; +} + +AsmFile::~AsmFile() +{ + delete[] m_buffer; +} + +IncDirectiveType AsmFile::ReadUntilIncDirective(std::string &path) +{ + // At the beginning of each loop iteration, the current file position + // should be at the start of a line or at the end of the file. + for (;;) + { + SkipTabsAndSpaces(); + + IncDirectiveType incDirectiveType = IncDirectiveType::None; + + char c = PeekChar(); + if (c == '.' || c == '#') + { + m_pos++; + + if (MatchIncDirective("incbin", path)) + incDirectiveType = IncDirectiveType::Incbin; + else if (MatchIncDirective("include", path)) + incDirectiveType = IncDirectiveType::Include; + } + + for (;;) + { + int c = GetChar(); + + if (c == -1) + return incDirectiveType; + + if (c == ';') + { + SkipEndOfLineComment(); + break; + } + else if (c == '/' && PeekChar() == '*') + { + m_pos++; + SkipMultiLineComment(); + } + else if (c == '"') + { + SkipString(); + } + else if (c == '\n') + { + break; + } + } + + if (incDirectiveType != IncDirectiveType::None) + return incDirectiveType; + } +} + +std::string AsmFile::ReadPath() +{ + int length = 0; + int startPos = m_pos; + + for (;;) + { + int c = GetChar(); + + if (c == '"') + break; + + if (c == -1) + FATAL_INPUT_ERROR("unexpected EOF in include string\n"); + + if (c == 0) + FATAL_INPUT_ERROR("unexpected NUL character in include string\n"); + + if (c == '\n') + FATAL_INPUT_ERROR("unexpected end of line character in include string\n"); + + // Don't bother allowing any escape sequences. + if (c == '\\') + FATAL_INPUT_ERROR("unexpected escape in include string\n"); + + length++; + + if (length > SCANINC_MAX_PATH) + FATAL_INPUT_ERROR("path is too long"); + } + + return std::string(m_buffer + startPos, length); +} + +void AsmFile::SkipEndOfLineComment() +{ + int c; + + do + { + c = GetChar(); + } while (c != -1 && c != '\n'); +} + +void AsmFile::SkipMultiLineComment() +{ + for (;;) + { + int c = GetChar(); + + if (c == '*') + { + if (PeekChar() == '/') + { + m_pos++; + return; + } + } + else if (c == -1) + { + return; + } + } +} + +void AsmFile::SkipString() +{ + for (;;) + { + int c = GetChar(); + + if (c == '"') + break; + + if (c == -1) + FATAL_INPUT_ERROR("unexpected EOF in string\n"); + + if (c == '\\') + { + c = GetChar(); + } + } +} diff --git a/tools/scaninc/asm_file.h b/tools/scaninc/asm_file.h new file mode 100644 index 0000000..ad99b75 --- /dev/null +++ b/tools/scaninc/asm_file.h @@ -0,0 +1,119 @@ +// Copyright(c) 2015-2017 YamaArashi +// +// 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. + +#ifndef ASM_FILE_H +#define ASM_FILE_H + +#include <string> +#include "scaninc.h" + +enum class IncDirectiveType +{ + None, + Include, + Incbin +}; + +class AsmFile +{ +public: + AsmFile(std::string path); + ~AsmFile(); + IncDirectiveType ReadUntilIncDirective(std::string& path); + +private: + char *m_buffer; + int m_pos; + int m_size; + int m_lineNum; + std::string m_path; + + int GetChar() + { + if (m_pos >= m_size) + return -1; + + int c = m_buffer[m_pos++]; + + if (c == '\r') + { + if (m_pos < m_size && m_buffer[m_pos++] == '\n') + { + m_lineNum++; + return '\n'; + } + else + { + FATAL_INPUT_ERROR("CR line endings are not supported\n"); + } + } + + if (c == '\n') + m_lineNum++; + + return c; + } + + // No newline translation because it's not needed for any use of this function. + int PeekChar() + { + if (m_pos >= m_size) + return -1; + + return m_buffer[m_pos]; + } + + void SkipTabsAndSpaces() + { + while (m_pos < m_size && (m_buffer[m_pos] == '\t' || m_buffer[m_pos] == ' ')) + m_pos++; + } + + bool MatchIncDirective(std::string directiveName, std::string& path) + { + int length = directiveName.length(); + int i; + + for (i = 0; i < length && m_pos + i < m_size; i++) + if (directiveName[i] != m_buffer[m_pos + i]) + return false; + + if (i < length) + return false; + + m_pos += length; + + SkipTabsAndSpaces(); + + if (GetChar() != '"') + FATAL_INPUT_ERROR("no path after \".%s\" directive\n", directiveName.c_str()); + + path = ReadPath(); + + return true; + } + + std::string ReadPath(); + void SkipEndOfLineComment(); + void SkipMultiLineComment(); + void SkipString(); +}; + +#endif // ASM_FILE_H diff --git a/tools/scaninc/c_file.cpp b/tools/scaninc/c_file.cpp new file mode 100644 index 0000000..595f366 --- /dev/null +++ b/tools/scaninc/c_file.cpp @@ -0,0 +1,307 @@ +// Copyright(c) 2017 YamaArashi +// +// 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. + +#include "c_file.h" + +CFile::CFile(std::string path) +{ + m_path = path; + + FILE *fp = std::fopen(path.c_str(), "rb"); + + if (fp == NULL) + FATAL_ERROR("Failed to open \"%s\" for reading.\n", path.c_str()); + + std::fseek(fp, 0, SEEK_END); + + m_size = std::ftell(fp); + + m_buffer = new char[m_size + 1]; + m_buffer[m_size] = 0; + + std::rewind(fp); + + if (std::fread(m_buffer, m_size, 1, fp) != 1) + FATAL_ERROR("Failed to read \"%s\".\n", path.c_str()); + + std::fclose(fp); + + m_pos = 0; + m_lineNum = 1; +} + +CFile::~CFile() +{ + delete[] m_buffer; +} + +void CFile::FindIncbins() +{ + char stringChar = 0; + + while (m_pos < m_size) + { + if (stringChar) + { + if (m_buffer[m_pos] == stringChar) + { + m_pos++; + stringChar = 0; + } + else if (m_buffer[m_pos] == '\\' && m_buffer[m_pos + 1] == stringChar) + { + m_pos += 2; + } + else + { + if (m_buffer[m_pos] == '\n') + m_lineNum++; + m_pos++; + } + } + else + { + SkipWhitespace(); + CheckInclude(); + CheckIncbin(); + + if (m_pos >= m_size) + break; + + char c = m_buffer[m_pos++]; + + if (c == '\n') + m_lineNum++; + else if (c == '"') + stringChar = '"'; + else if (c == '\'') + stringChar = '\''; + else if (c == 0) + FATAL_INPUT_ERROR("unexpected null character"); + } + } +} + +bool CFile::ConsumeHorizontalWhitespace() +{ + if (m_buffer[m_pos] == '\t' || m_buffer[m_pos] == ' ') + { + m_pos++; + return true; + } + + return false; +} + +bool CFile::ConsumeNewline() +{ + if (m_buffer[m_pos] == '\n') + { + m_pos++; + m_lineNum++; + return true; + } + + if (m_buffer[m_pos] == '\r' && m_buffer[m_pos + 1] == '\n') + { + m_pos += 2; + m_lineNum++; + return true; + } + + return false; +} + +bool CFile::ConsumeComment() +{ + if (m_buffer[m_pos] == '/' && m_buffer[m_pos + 1] == '*') + { + m_pos += 2; + while (m_buffer[m_pos] != '*' || m_buffer[m_pos + 1] != '/') + { + if (m_buffer[m_pos] == 0) + return false; + if (!ConsumeNewline()) + m_pos++; + } + m_pos += 2; + return true; + } + else if (m_buffer[m_pos] == '/' && m_buffer[m_pos + 1] == '/') + { + m_pos += 2; + while (!ConsumeNewline()) + { + if (m_buffer[m_pos] == 0) + return false; + m_pos++; + } + return true; + } + + return false; +} + +void CFile::SkipWhitespace() +{ + while (ConsumeHorizontalWhitespace() || ConsumeNewline() || ConsumeComment()) + ; +} + +bool CFile::CheckIdentifier(const std::string& ident) +{ + unsigned int i; + + for (i = 0; i < ident.length() && m_pos + i < (unsigned)m_size; i++) + if (ident[i] != m_buffer[m_pos + i]) + return false; + + return (i == ident.length()); +} + +void CFile::CheckInclude() +{ + if (m_buffer[m_pos] != '#') + return; + + std::string ident = "#include"; + + if (!CheckIdentifier(ident)) + { + return; + } + + m_pos += ident.length(); + + ConsumeHorizontalWhitespace(); + + std::string path = ReadPath(); + + if (!path.empty()) { + m_includes.emplace(path); + } +} + +void CFile::CheckIncbin() +{ + // Optimization: assume most lines are not incbins + if (!(m_buffer[m_pos+0] == 'I' + && m_buffer[m_pos+1] == 'N' + && m_buffer[m_pos+2] == 'C' + && m_buffer[m_pos+3] == 'B' + && m_buffer[m_pos+4] == 'I' + && m_buffer[m_pos+5] == 'N' + && m_buffer[m_pos+6] == '_')) + { + return; + } + + std::string idents[6] = { "INCBIN_S8", "INCBIN_U8", "INCBIN_S16", "INCBIN_U16", "INCBIN_S32", "INCBIN_U32" }; + int incbinType = -1; + + for (int i = 0; i < 6; i++) + { + if (CheckIdentifier(idents[i])) + { + incbinType = i; + break; + } + } + + if (incbinType == -1) + return; + + long oldPos = m_pos; + long oldLineNum = m_lineNum; + + m_pos += idents[incbinType].length(); + + SkipWhitespace(); + + if (m_buffer[m_pos] != '(') + { + m_pos = oldPos; + m_lineNum = oldLineNum; + return; + } + + m_pos++; + + while (true) + { + SkipWhitespace(); + + std::string path = ReadPath(); + + SkipWhitespace(); + + m_incbins.emplace(path); + + if (m_buffer[m_pos] != ',') + break; + + m_pos++; + } + + if (m_buffer[m_pos] != ')') + FATAL_INPUT_ERROR("expected ')'"); + + m_pos++; + +} + +std::string CFile::ReadPath() +{ + if (m_buffer[m_pos] != '"') + { + if (m_buffer[m_pos] == '<') + { + return std::string(); + } + FATAL_INPUT_ERROR("expected '\"' or '<'"); + } + + m_pos++; + + int startPos = m_pos; + + while (m_buffer[m_pos] != '"') + { + if (m_buffer[m_pos] == 0) + { + if (m_pos >= m_size) + FATAL_INPUT_ERROR("unexpected EOF in path string"); + else + FATAL_INPUT_ERROR("unexpected null character in path string"); + } + + if (m_buffer[m_pos] == '\r' || m_buffer[m_pos] == '\n') + FATAL_INPUT_ERROR("unexpected end of line character in path string"); + + if (m_buffer[m_pos] == '\\') + FATAL_INPUT_ERROR("unexpected escape in path string"); + + m_pos++; + } + + m_pos++; + + return std::string(m_buffer + startPos, m_pos - 1 - startPos); +} diff --git a/tools/scaninc/c_file.h b/tools/scaninc/c_file.h new file mode 100644 index 0000000..618901b --- /dev/null +++ b/tools/scaninc/c_file.h @@ -0,0 +1,57 @@ +// Copyright(c) 2017 YamaArashi +// +// 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. + +#ifndef C_FILE_H +#define C_FILE_H + +#include <string> +#include <set> +#include <memory> +#include "scaninc.h" + +class CFile +{ +public: + CFile(std::string path); + ~CFile(); + void FindIncbins(); + const std::set<std::string>& GetIncbins() { return m_incbins; } + const std::set<std::string>& GetIncludes() { return m_includes; } + +private: + char *m_buffer; + int m_pos; + int m_size; + int m_lineNum; + std::string m_path; + std::set<std::string> m_incbins; + std::set<std::string> m_includes; + + bool ConsumeHorizontalWhitespace(); + bool ConsumeNewline(); + bool ConsumeComment(); + void SkipWhitespace(); + bool CheckIdentifier(const std::string& ident); + void CheckInclude(); + void CheckIncbin(); + std::string ReadPath(); +}; + +#endif // C_FILE_H diff --git a/tools/scaninc/scaninc.cpp b/tools/scaninc/scaninc.cpp new file mode 100644 index 0000000..b95cbd0 --- /dev/null +++ b/tools/scaninc/scaninc.cpp @@ -0,0 +1,121 @@ +// Copyright(c) 2015-2017 YamaArashi +// +// 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. + +#include <cstdio> +#include <cstdlib> +#include <list> +#include <queue> +#include <set> +#include <string> +#include "scaninc.h" +#include "source_file.h" + +bool CanOpenFile(std::string path) +{ + FILE *fp = std::fopen(path.c_str(), "rb"); + + if (fp == NULL) + return false; + + std::fclose(fp); + return true; +} + +const char *const USAGE = "Usage: scaninc [-I INCLUDE_PATH] FILE_PATH\n"; + +int main(int argc, char **argv) +{ + std::queue<std::string> filesToProcess; + std::set<std::string> dependencies; + + std::vector<std::string> includeDirs; + + argc--; + argv++; + + while (argc > 1) + { + std::string arg(argv[0]); + if (arg.substr(0, 2) == "-I") + { + std::string includeDir = arg.substr(2); + if (includeDir.empty()) + { + argc--; + argv++; + includeDir = std::string(argv[0]); + } + if (!includeDir.empty() && includeDir.back() != '/') + { + includeDir += '/'; + } + includeDirs.push_back(includeDir); + } + else + { + FATAL_ERROR(USAGE); + } + argc--; + argv++; + } + + if (argc != 1) { + FATAL_ERROR(USAGE); + } + + std::string initialPath(argv[0]); + + filesToProcess.push(initialPath); + + while (!filesToProcess.empty()) + { + std::string filePath = filesToProcess.front(); + SourceFile file(filePath); + filesToProcess.pop(); + + includeDirs.push_back(file.GetSrcDir()); + for (auto incbin : file.GetIncbins()) + { + dependencies.insert(incbin); + } + for (auto include : file.GetIncludes()) + { + for (auto includeDir : includeDirs) + { + std::string path(includeDir + include); + if (CanOpenFile(path)) + { + bool inserted = dependencies.insert(path).second; + if (inserted) + { + filesToProcess.push(path); + } + break; + } + } + } + includeDirs.pop_back(); + } + + for (const std::string &path : dependencies) + { + std::printf("%s\n", path.c_str()); + } +} diff --git a/tools/scaninc/scaninc.h b/tools/scaninc/scaninc.h new file mode 100644 index 0000000..30cc961 --- /dev/null +++ b/tools/scaninc/scaninc.h @@ -0,0 +1,59 @@ +// Copyright(c) 2015-2017 YamaArashi +// +// 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. + +#ifndef SCANINC_H +#define SCANINC_H + +#include <cstdio> +#include <cstdlib> + +#ifdef _MSC_VER + +#define FATAL_INPUT_ERROR(format, ...) \ +do { \ + fprintf(stderr, "%s:%d " format, m_path.c_str(), m_lineNum, __VA_ARGS__); \ + exit(1); \ +} while (0) + +#define FATAL_ERROR(format, ...) \ +do { \ + fprintf(stderr, format, __VA_ARGS__); \ + exit(1); \ +} while (0) + +#else + +#define FATAL_INPUT_ERROR(format, ...) \ +do { \ + fprintf(stderr, "%s:%d " format, m_path.c_str(), m_lineNum, ##__VA_ARGS__); \ + exit(1); \ +} while (0) + +#define FATAL_ERROR(format, ...) \ +do { \ + fprintf(stderr, format, ##__VA_ARGS__); \ + exit(1); \ +} while (0) + +#endif // _MSC_VER + +#define SCANINC_MAX_PATH 255 + +#endif // SCANINC_H diff --git a/tools/scaninc/source_file.cpp b/tools/scaninc/source_file.cpp new file mode 100644 index 0000000..f23ff6d --- /dev/null +++ b/tools/scaninc/source_file.cpp @@ -0,0 +1,125 @@ +// Copyright(c) 2019 Phlosioneer +// +// 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. + +#include <new> +#include "source_file.h" + + +SourceFileType GetFileType(std::string& path) +{ + std::size_t pos = path.find_last_of('.'); + + if (pos == std::string::npos) + FATAL_ERROR("no file extension in path \"%s\"\n", path.c_str()); + + std::string extension = path.substr(pos + 1); + + if (extension == "c") + return SourceFileType::Cpp; + else if (extension == "s") + return SourceFileType::Asm; + else if (extension == "h") + return SourceFileType::Header; + else if (extension == "inc") + return SourceFileType::Inc; + else + FATAL_ERROR("Unrecognized extension \"%s\"\n", extension.c_str()); + + // Unreachable + return SourceFileType::Cpp; +} + +std::string GetDir(std::string& path) +{ + std::size_t slash = path.rfind('/'); + + if (slash != std::string::npos) + return path.substr(0, slash + 1); + else + return std::string(""); +} + +SourceFile::SourceFile(std::string path) +{ + m_file_type = GetFileType(path); + + m_src_dir = GetDir(path); + + if (m_file_type == SourceFileType::Cpp + || m_file_type == SourceFileType::Header) + { + new (&m_source_file.c_file) CFile(path); + m_source_file.c_file.FindIncbins(); + } + else + { + AsmFile file(path); + std::set<std::string> incbins; + std::set<std::string> includes; + + IncDirectiveType incDirectiveType; + std::string outputPath; + + while ((incDirectiveType = file.ReadUntilIncDirective(outputPath)) != IncDirectiveType::None) + { + if (incDirectiveType == IncDirectiveType::Include) + includes.insert(outputPath); + else + incbins.insert(outputPath); + } + + new (&m_source_file.asm_wrapper) SourceFile::InnerUnion::AsmWrapper{incbins, includes}; + } +} + +SourceFile::~SourceFile() +{ + if (m_file_type == SourceFileType::Cpp || m_file_type == SourceFileType::Header) + { + m_source_file.c_file.~CFile(); + } + else + { + m_source_file.asm_wrapper.asm_incbins.~set(); + m_source_file.asm_wrapper.asm_includes.~set(); + } +} + +const std::set<std::string>& SourceFile::GetIncbins() +{ + if (m_file_type == SourceFileType::Cpp || m_file_type == SourceFileType::Header) + return m_source_file.c_file.GetIncbins(); + else + return m_source_file.asm_wrapper.asm_incbins; +} + +const std::set<std::string>& SourceFile::GetIncludes() +{ + if (m_file_type == SourceFileType::Cpp || m_file_type == SourceFileType::Header) + return m_source_file.c_file.GetIncludes(); + else + return m_source_file.asm_wrapper.asm_includes; +} + +std::string& SourceFile::GetSrcDir() +{ + return m_src_dir; +} + diff --git a/tools/scaninc/source_file.h b/tools/scaninc/source_file.h new file mode 100644 index 0000000..f7b6412 --- /dev/null +++ b/tools/scaninc/source_file.h @@ -0,0 +1,71 @@ +// Copyright(c) 2019 Phlosioneer +// +// 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. + +#ifndef SOURCE_FILE_H +#define SOURCE_FILE_H + +#include <string> +#include "scaninc.h" +#include "asm_file.h" +#include "c_file.h" + +enum class SourceFileType +{ + Cpp, + Header, + Asm, + Inc +}; + +SourceFileType GetFileType(std::string& path); + +class SourceFile +{ +public: + + SourceFile(std::string path); + ~SourceFile(); + SourceFile(SourceFile const&) = delete; + SourceFile(SourceFile&&) = delete; + SourceFile& operator =(SourceFile const&) = delete; + SourceFile& operator =(SourceFile&&) = delete; + bool HasIncbins(); + const std::set<std::string>& GetIncbins(); + const std::set<std::string>& GetIncludes(); + std::string& GetSrcDir(); + +private: + union InnerUnion { + CFile c_file; + struct AsmWrapper { + std::set<std::string> asm_incbins; + std::set<std::string> asm_includes; + } asm_wrapper; + + // Construction and destruction handled by SourceFile. + InnerUnion() {}; + ~InnerUnion() {}; + } m_source_file; + SourceFileType m_file_type; + std::string m_src_dir; +}; + +#endif // SOURCE_FILE_H +