/* lib_replace.c (description) Copyright (C) 1996-1997 Id Software, Inc. Copyright (C) 1999,2000 contributors of the QuakeForge project Please see the file "AUTHORS" for a list of contributors 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 2 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, write to: Free Software Foundation, Inc. 59 Temple Place - Suite 330 Boston, MA 02111-1307, USA $Id$ */ #include #include #include /* ============================================================================ LIBRARY REPLACEMENT FUNCTIONS ============================================================================ */ int Q_atoi ( char *str ) { int val; int sign; int c; if (*str == '-') { sign = -1; str++; } else sign = 1; val = 0; // // check for hex // if (str[0] == '0' && (str[1] == 'x' || str[1] == 'X') ) { str += 2; while (1) { c = *str++; if (c >= '0' && c <= '9') val = (val<<4) + c - '0'; else if (c >= 'a' && c <= 'f') val = (val<<4) + c - 'a' + 10; else if (c >= 'A' && c <= 'F') val = (val<<4) + c - 'A' + 10; else return val*sign; } } // // check for character // if (str[0] == '\'') { return sign * str[1]; } // // assume decimal // while (1) { c = *str++; if (c <'0' || c > '9') return val*sign; val = val*10 + c - '0'; } return 0; } float Q_atof ( char *str ) { double val; int sign; int c; int decimal, total; // 1999-12-27 ATOF problems with leading spaces fix by Maddes start while ((*str) && (*str<=' ')) { str++; } // 1999-12-27 ATOF problems with leading spaces fix by Maddes end if (*str == '-') { sign = -1; str++; } else sign = 1; val = 0; // // check for hex // if (str[0] == '0' && (str[1] == 'x' || str[1] == 'X') ) { str += 2; while (1) { c = *str++; if (c >= '0' && c <= '9') val = (val*16) + c - '0'; else if (c >= 'a' && c <= 'f') val = (val*16) + c - 'a' + 10; else if (c >= 'A' && c <= 'F') val = (val*16) + c - 'A' + 10; else return val*sign; } } // // check for character // if (str[0] == '\'') { return sign * str[1]; } // // assume decimal // decimal = -1; total = 0; while (1) { c = *str++; if (c == '.') { decimal = total; continue; } if (c <'0' || c > '9') break; val = val*10 + c - '0'; total++; } if (decimal == -1) return val*sign; while (total > decimal) { val /= 10; total--; } return val*sign; } // Note, this is /NOT/ a work-alike strcmp, this groups numbers sanely. //int Q_qstrcmp(const char *val, const char *ref) int Q_qstrcmp ( char **os1, char **os2 ) { int in1, in2, n1, n2; char *s1, *s2; s1 = *os1; s2 = *os2; while (1) { in1 = in2 = n1 = n2 = 0; if ((in1 = isdigit((int) *s1))) n1 = strtol(s1, &s1, 10); if ((in2 = isdigit((int) *s2))) n2 = strtol(s2, &s2, 10); if (in1 && in2) { if (n1 != n2) return n1-n2; } else { if (*s1 != *s2) return *s1 - *s2; else if (*s1 == '\0') return *s1 - *s2; s1++; s2++; } } }