/*
|
/*
|
* Copyright (c) 2001 Alexey Zelkin <phantom@FreeBSD.org>
|
* Copyright (c) 2001 Alexey Zelkin <phantom@FreeBSD.org>
|
* All rights reserved.
|
* All rights reserved.
|
*
|
*
|
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
* modification, are permitted provided that the following conditions
|
* modification, are permitted provided that the following conditions
|
* are met:
|
* are met:
|
* 1. Redistributions of source code must retain the above copyright
|
* 1. Redistributions of source code must retain the above copyright
|
* notice, this list of conditions and the following disclaimer.
|
* notice, this list of conditions and the following disclaimer.
|
* 2. Redistributions in binary form must reproduce the above copyright
|
* 2. Redistributions in binary form must reproduce the above copyright
|
* notice, this list of conditions and the following disclaimer in the
|
* notice, this list of conditions and the following disclaimer in the
|
* documentation and/or other materials provided with the distribution.
|
* documentation and/or other materials provided with the distribution.
|
*
|
*
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
* 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
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
* SUCH DAMAGE.
|
* SUCH DAMAGE.
|
*/
|
*/
|
|
|
#include <sys/cdefs.h>
|
#include <sys/cdefs.h>
|
|
|
#include <ctype.h>
|
#include <ctype.h>
|
#include <limits.h>
|
#include <limits.h>
|
#include <stddef.h>
|
#include <stddef.h>
|
|
|
static const char nogrouping[] = { CHAR_MAX, '\0' };
|
static const char nogrouping[] = { CHAR_MAX, '\0' };
|
|
|
/*
|
/*
|
* "3;3;-1" -> "\003\003\177"
|
* "3;3;-1" -> "\003\003\177"
|
*/
|
*/
|
|
|
const char *
|
const char *
|
__fix_locale_grouping_str(const char *str) {
|
__fix_locale_grouping_str(const char *str) {
|
|
|
char *src, *dst;
|
char *src, *dst;
|
char n;
|
char n;
|
|
|
if (str == NULL || *str == '\0') {
|
if (str == NULL || *str == '\0') {
|
return nogrouping;
|
return nogrouping;
|
}
|
}
|
|
|
for (src = (char*)str, dst = (char*)str; *src != '\0'; src++) {
|
for (src = (char*)str, dst = (char*)str; *src != '\0'; src++) {
|
|
|
/* input string examples: "3;3", "3;2;-1" */
|
/* input string examples: "3;3", "3;2;-1" */
|
if (*src == ';')
|
if (*src == ';')
|
continue;
|
continue;
|
|
|
if (*src == '-' && *(src+1) == '1') {
|
if (*src == '-' && *(src+1) == '1') {
|
*dst++ = CHAR_MAX;
|
*dst++ = CHAR_MAX;
|
src++;
|
src++;
|
continue;
|
continue;
|
}
|
}
|
|
|
if (!isdigit((unsigned char)*src)) {
|
if (!isdigit((unsigned char)*src)) {
|
/* broken grouping string */
|
/* broken grouping string */
|
return nogrouping;
|
return nogrouping;
|
}
|
}
|
|
|
/* assume all numbers <= 99 */
|
/* assume all numbers <= 99 */
|
n = *src - '0';
|
n = *src - '0';
|
if (isdigit((unsigned char)*(src+1))) {
|
if (isdigit((unsigned char)*(src+1))) {
|
src++;
|
src++;
|
n *= 10;
|
n *= 10;
|
n += *src - '0';
|
n += *src - '0';
|
}
|
}
|
|
|
*dst = n;
|
*dst = n;
|
/* NOTE: assume all input started with "0" as 'no grouping' */
|
/* NOTE: assume all input started with "0" as 'no grouping' */
|
if (*dst == '\0')
|
if (*dst == '\0')
|
return (dst == (char*)str) ? nogrouping : str;
|
return (dst == (char*)str) ? nogrouping : str;
|
dst++;
|
dst++;
|
}
|
}
|
*dst = '\0';
|
*dst = '\0';
|
return str;
|
return str;
|
}
|
}
|
|
|
