Fix GC/Wii linker error

Add example program (Currently only targets wii)

src/gekko_support.c

@@ -288,15 +288,8 @@ int vsnprintf(char *s, size_t n, const char *format, va_list ap) {
 #endif
 
 #include <sys/types.h>
-
 #include <stdio.h>
-
-#ifdef __STDC__
 #include <stdarg.h>
-#else
-#include <varargs.h>
-#endif
-
 /*
  * PUBLIC: #ifndef HAVE_SNPRINTF
  * PUBLIC: int snprintf __P((char *, size_t, const char *, ...));
@@ -326,198 +319,3 @@ long long strtoq(const char *nptr, char **endptr, int base) {
 unsigned long long strtouq(const char *nptr, char **endptr, int base) {
     return strtoull(nptr, endptr, base);
 }
-
-#ifndef TRUE
-#define TRUE 1
-#define FALSE 0
-#endif
-#ifndef NULL
-#define NULL 0
-#endif
-
-const float _strtof_powersOf10_[] =
-{            // Table giving binary powers of 10.  Entry
-             10.0f,   // is 10^2^i.  Used to convert decimal
-             100.0f,  // exponents into floating-point numbers.
-             1.0e4f, 1.0e8f, 1.0e16f, 1.0e32f};
-
-/*
- *----------------------------------------------------------------------
- *
- * strtof --
- *
- *	This procedure converts a floating-point number from an ASCII
- *	decimal representation to internal double-precision format.
- *
- * Results:
- *	The return value is the double-precision floating-point
- *	representation of the characters in string.  If endPtr isn't
- *	NULL, then *endPtr is filled in with the address of the
- *	next character after the last one that was part of the
- *	floating-point number.
- *
- * Side effects:
- *	None.
- *
- *----------------------------------------------------------------------
- */
-
-float strtof(const char *string, char **endPtr) {
-    int sign, expSign = FALSE;
-    float fraction, dblExp;
-    const float *d;
-    const char *p;
-    int c;
-    int exp = 0;
-    int fracExp = 0;
-    int mantSize;
-    int decPt;
-    const char *pExp;
-    p = string;
-    while (isspace(*p)) {
-        p += 1;
-    }
-    if (*p == '-') {
-        sign = TRUE;
-        p += 1;
-    } else {
-        if (*p == '+') {
-            p += 1;
-        }
-        sign = FALSE;
-    }
-
-    decPt = -1;
-    for (mantSize = 0;; mantSize += 1) {
-        c = *p;
-        if (!isdigit(c)) {
-            if ((c != '.') || (decPt >= 0)) {
-                break;
-            }
-            decPt = mantSize;
-        }
-        p += 1;
-    }
-
-    /*
-       * Now suck up the digits in the mantissa.  Use two integers to
-       * collect 9 digits each (this is faster than using floating-point).
-       * If the mantissa has more than 18 digits, ignore the extras, since
-       * they can't affect tahe value anyway.
-       */
-
-    pExp = p;
-    p -= mantSize;
-    if (decPt < 0) {
-        decPt = mantSize;
-    } else {
-        mantSize -= 1; /* One of the digits was the point. */
-    }
-    if (mantSize > 18) {
-        fracExp = decPt - 18;
-        mantSize = 18;
-    } else {
-        fracExp = decPt - mantSize;
-    }
-    if (mantSize == 0) {
-        fraction = 0.0;
-        p = string;
-        goto done;
-    } else {
-        int frac1, frac2;
-        frac1 = 0;
-        for (; mantSize > 9; mantSize -= 1) {
-            c = *p;
-            p += 1;
-            if (c == '.') {
-                c = *p;
-                p += 1;
-            }
-            frac1 = 10 * frac1 + (c - '0');
-        }
-        frac2 = 0;
-        for (; mantSize > 0; mantSize -= 1) {
-            c = *p;
-            p += 1;
-            if (c == '.') {
-                c = *p;
-                p += 1;
-            }
-            frac2 = 10 * frac2 + (c - '0');
-        }
-        fraction = (1.0e9f * frac1) + frac2;
-    }
-
-    /*
-     * Skim off the exponent.
-     */
-
-    p = pExp;
-    if ((*p == 'E') || (*p == 'e')) {
-        p += 1;
-        if (*p == '-') {
-            expSign = TRUE;
-            p += 1;
-        } else {
-            if (*p == '+') {
-                p += 1;
-            }
-            expSign = FALSE;
-        }
-        while (isdigit(*p)) {
-            exp = exp * 10 + (*p - '0');
-            p += 1;
-        }
-    }
-    if (expSign) {
-        exp = fracExp - exp;
-    } else {
-        exp = fracExp + exp;
-    }
-
-    /*
-    * Generate a floating-point number that represents the exponent.
-    * Do this by processing the exponent one bit at a time to combine
-    * many powers of 2 of 10. Then combine the exponent with the
-    * fraction.
-    */
-
-    if (exp < 0) {
-        expSign = TRUE;
-        exp = -exp;
-    } else {
-        expSign = FALSE;
-    }
-    const int maxExponent = 38; /* Largest possible base 10 exponent.  Any
-                               * exponent larger than this will already
-                               * produce underflow or overflow, so there's
-                               * no need to worry about additional digits.
-                               */
-
-    if (exp > maxExponent) {
-        exp = maxExponent;
-    }
-    dblExp = 1.0f;
-
-    for (d = _strtof_powersOf10_; exp != 0; exp >>= 1, d += 1) {
-        if (exp & 01) {
-            dblExp *= *d;
-        }
-    }
-
-    if (expSign) {
-        fraction /= dblExp;
-    } else {
-        fraction *= dblExp;
-    }
-
-done:
-    if (endPtr != NULL) {
-        *endPtr = (char *)p;
-    }
-
-    if (sign) {
-        return -fraction;
-    }
-    return fraction;
-}