mirror of https://github.com/pret/pokeemerald.git
Implement agbcc's libc and allow a custom cxx compiler to be passed to build_tools.sh
This commit is contained in:
parent
3b097262f5
commit
09d3da101b
3
Makefile
3
Makefile
|
@ -31,6 +31,7 @@ LDFLAGS = -Map ../../$(MAP)
|
||||||
OBJCOPY := $(DEVKITARM)/bin/arm-none-eabi-objcopy
|
OBJCOPY := $(DEVKITARM)/bin/arm-none-eabi-objcopy
|
||||||
|
|
||||||
LIBGCC := tools/agbcc/lib/libgcc.a
|
LIBGCC := tools/agbcc/lib/libgcc.a
|
||||||
|
LIBC := tools/agbcc/lib/libc.a
|
||||||
|
|
||||||
SHA1 := sha1sum -c
|
SHA1 := sha1sum -c
|
||||||
|
|
||||||
|
@ -154,7 +155,7 @@ $(OBJ_DIR)/ld_script.ld: ld_script.txt $(OBJ_DIR)/sym_bss.ld $(OBJ_DIR)/sym_comm
|
||||||
cd $(OBJ_DIR) && sed -f ../../ld_script.sed ../../$< | sed "s#tools/#../../tools/#g" > ld_script.ld
|
cd $(OBJ_DIR) && sed -f ../../ld_script.sed ../../$< | sed "s#tools/#../../tools/#g" > ld_script.ld
|
||||||
|
|
||||||
$(ELF): $(OBJ_DIR)/ld_script.ld $(OBJS)
|
$(ELF): $(OBJ_DIR)/ld_script.ld $(OBJS)
|
||||||
cd $(OBJ_DIR) && $(LD) $(LDFLAGS) -T ld_script.ld -o ../../$@ $(OBJS_REL) ../../$(LIBGCC)
|
cd $(OBJ_DIR) && $(LD) $(LDFLAGS) -T ld_script.ld -o ../../$@ $(OBJS_REL) ../../$(LIBGCC) ../../$(LIBC)
|
||||||
|
|
||||||
$(ROM): $(ELF)
|
$(ROM): $(ELF)
|
||||||
$(OBJCOPY) -O binary --gap-fill 0xFF --pad-to 0x9000000 $< $@
|
$(OBJCOPY) -O binary --gap-fill 0xFF --pad-to 0x9000000 $< $@
|
||||||
|
|
|
@ -1,8 +1,8 @@
|
||||||
#!/bin/sh
|
#!/bin/sh
|
||||||
make -C tools/gbagfx
|
make -C tools/gbagfx CXX=${1:=g++}
|
||||||
make -C tools/scaninc
|
make -C tools/scaninc CXX=${1:=g++}
|
||||||
make -C tools/preproc
|
make -C tools/preproc CXX=${1:=g++}
|
||||||
make -C tools/bin2c
|
make -C tools/bin2c CXX=${1:=g++}
|
||||||
make -C tools/rsfont
|
make -C tools/rsfont CXX=${1:=g++}
|
||||||
make -C tools/aif2pcm
|
make -C tools/aif2pcm CXX=${1:=g++}
|
||||||
make -C tools/ramscrgen
|
make -C tools/ramscrgen CXX=${1:=g++}
|
||||||
|
|
|
@ -325,7 +325,10 @@ SECTIONS {
|
||||||
tools/agbcc/lib/libgcc.a:fp-bit.o(.text);
|
tools/agbcc/lib/libgcc.a:fp-bit.o(.text);
|
||||||
tools/agbcc/lib/libgcc.a:_lshrdi3.o(.text);
|
tools/agbcc/lib/libgcc.a:_lshrdi3.o(.text);
|
||||||
tools/agbcc/lib/libgcc.a:_negdi2.o(.text);
|
tools/agbcc/lib/libgcc.a:_negdi2.o(.text);
|
||||||
src/libc.o(.text);
|
tools/agbcc/lib/libc.a:memcpy.o(.text);
|
||||||
|
tools/agbcc/lib/libc.a:memset.o(.text);
|
||||||
|
tools/agbcc/lib/libc.a:strcmp.o(.text);
|
||||||
|
tools/agbcc/lib/libc.a:strcpy.o(.text);
|
||||||
} =0
|
} =0
|
||||||
|
|
||||||
.rodata :
|
.rodata :
|
||||||
|
|
173
src/libc.c
173
src/libc.c
|
@ -1,173 +0,0 @@
|
||||||
#include "global.h"
|
|
||||||
#include <stddef.h>
|
|
||||||
|
|
||||||
#define LBLOCKSIZE (sizeof(long))
|
|
||||||
|
|
||||||
// Nonzero if (long)X contains a NULL byte.
|
|
||||||
#define CONTAINSNULL(X) (((X) - 0x01010101) & ~(X) & 0x80808080)
|
|
||||||
|
|
||||||
// Nonzero if X is not aligned on a "long" boundary.
|
|
||||||
#define UNALIGNED(X) ((long)X & (LBLOCKSIZE - 1))
|
|
||||||
|
|
||||||
void *memcpy(void *dst0, const void *src0, size_t len0)
|
|
||||||
{
|
|
||||||
char *dst = dst0;
|
|
||||||
const char *src = src0;
|
|
||||||
long *aligned_dst;
|
|
||||||
const long *aligned_src;
|
|
||||||
unsigned int len = len0;
|
|
||||||
|
|
||||||
// If the size is small, or either src or dst is unaligned,
|
|
||||||
// then go to the byte copy loop. This should be rare.
|
|
||||||
if(len >= 16 && !(UNALIGNED(src) | UNALIGNED(dst)))
|
|
||||||
{
|
|
||||||
aligned_dst = (long *)dst;
|
|
||||||
aligned_src = (long *)src;
|
|
||||||
|
|
||||||
// Copy 4X long words at a time if possible.
|
|
||||||
while(len >= 16)
|
|
||||||
{
|
|
||||||
*aligned_dst++ = *aligned_src++;
|
|
||||||
*aligned_dst++ = *aligned_src++;
|
|
||||||
*aligned_dst++ = *aligned_src++;
|
|
||||||
*aligned_dst++ = *aligned_src++;
|
|
||||||
len -= 16;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Copy one long word at a time if possible
|
|
||||||
while(len >= 4)
|
|
||||||
{
|
|
||||||
*aligned_dst++ = *aligned_src++;
|
|
||||||
len -= 4;
|
|
||||||
}
|
|
||||||
|
|
||||||
dst = (char *)aligned_dst;
|
|
||||||
src = (char *)aligned_src;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Pick up any remaining bytes with a byte copier.
|
|
||||||
while(len--)
|
|
||||||
*dst++ = *src++;
|
|
||||||
|
|
||||||
return dst0;
|
|
||||||
}
|
|
||||||
|
|
||||||
void *memset(void *m, int c, size_t n)
|
|
||||||
{
|
|
||||||
char *s = (char *)m;
|
|
||||||
int count, i;
|
|
||||||
unsigned long buffer;
|
|
||||||
unsigned long *aligned_addr;
|
|
||||||
unsigned char *unaligned_addr;
|
|
||||||
|
|
||||||
// If the size is small or m is unaligned,
|
|
||||||
// then go to the byte copy loop. This should be rare.
|
|
||||||
if(n >= LBLOCKSIZE && !UNALIGNED(m))
|
|
||||||
{
|
|
||||||
// We know that n is large and m is word-aligned.
|
|
||||||
aligned_addr = (unsigned long *)m;
|
|
||||||
|
|
||||||
// Store C into each char sized location in buffer so that
|
|
||||||
// we can set large blocks quickly.
|
|
||||||
c &= 0xFF;
|
|
||||||
if(LBLOCKSIZE == 4)
|
|
||||||
{
|
|
||||||
buffer = (c << 8) | c;
|
|
||||||
buffer |= (buffer << 16);
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
buffer = 0;
|
|
||||||
for(i = 0; i < LBLOCKSIZE; i++)
|
|
||||||
buffer = (buffer << 8) | c;
|
|
||||||
}
|
|
||||||
|
|
||||||
while(n >= LBLOCKSIZE * 4)
|
|
||||||
{
|
|
||||||
*aligned_addr++ = buffer;
|
|
||||||
*aligned_addr++ = buffer;
|
|
||||||
*aligned_addr++ = buffer;
|
|
||||||
*aligned_addr++ = buffer;
|
|
||||||
n -= LBLOCKSIZE * 4;
|
|
||||||
}
|
|
||||||
while(n >= LBLOCKSIZE)
|
|
||||||
{
|
|
||||||
*aligned_addr++ = buffer;
|
|
||||||
n -= LBLOCKSIZE;
|
|
||||||
}
|
|
||||||
|
|
||||||
s = (char *)aligned_addr;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Pick up the remainder with a bytewise loop.
|
|
||||||
while(n--)
|
|
||||||
*s++ = (char)c;
|
|
||||||
|
|
||||||
return m;
|
|
||||||
}
|
|
||||||
|
|
||||||
int strcmp(const char *s1, const char *s2)
|
|
||||||
{
|
|
||||||
unsigned long *a1;
|
|
||||||
unsigned long *a2;
|
|
||||||
|
|
||||||
// If s1 or s2 are unaligned, then skip this and compare bytes.
|
|
||||||
if(!(UNALIGNED(s1) | UNALIGNED(s2)))
|
|
||||||
{
|
|
||||||
// Compare them a word at a time.
|
|
||||||
a1 = (unsigned long *)s1;
|
|
||||||
a2 = (unsigned long *)s2;
|
|
||||||
while(*a1 == *a2)
|
|
||||||
{
|
|
||||||
// If *a1 == *a2, and we find a null in *a1,
|
|
||||||
// then the strings must be equal, so return zero.
|
|
||||||
if(CONTAINSNULL(*a1))
|
|
||||||
return 0;
|
|
||||||
|
|
||||||
a1++;
|
|
||||||
a2++;
|
|
||||||
}
|
|
||||||
|
|
||||||
s1 = (char *)a1;
|
|
||||||
s2 = (char *)a2;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Check the remaining few bytes.
|
|
||||||
while(*s1 != '\0' && *s1 == *s2)
|
|
||||||
{
|
|
||||||
s1++;
|
|
||||||
s2++;
|
|
||||||
}
|
|
||||||
|
|
||||||
return (*(unsigned char *) s1) - (*(unsigned char *) s2);
|
|
||||||
}
|
|
||||||
|
|
||||||
char* strcpy(char *dst0, const char *src0)
|
|
||||||
{
|
|
||||||
char *dst = dst0;
|
|
||||||
const char *src = src0;
|
|
||||||
unsigned long *a1;
|
|
||||||
const unsigned long *a2;
|
|
||||||
|
|
||||||
// If SRC or DEST is unaligned, then copy bytes.
|
|
||||||
if(!(UNALIGNED(src) | UNALIGNED(dst)))
|
|
||||||
{
|
|
||||||
// SRC and DEST are both "long int" aligned, try to do "long int"
|
|
||||||
// sized copies.
|
|
||||||
a1 = (unsigned long *)dst;
|
|
||||||
a2 = (unsigned long *)src;
|
|
||||||
while(!CONTAINSNULL(*a2))
|
|
||||||
{
|
|
||||||
*a1++ = *a2++;
|
|
||||||
}
|
|
||||||
|
|
||||||
dst = (char *)a1;
|
|
||||||
src = (char *)a2;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Copy the remaining few bytes.
|
|
||||||
while(*dst++ = *src++);
|
|
||||||
|
|
||||||
return dst0;
|
|
||||||
}
|
|
||||||
|
|
Loading…
Reference in New Issue