StdLib/AppPkg: Add the NOOPT build target and fix a type conversion problem with...

[mirror_edk2.git] / StdLib / LibC / Locale / __wctoint.h

/* $NetBSD: __wctoint.h,v 1.1 2001/09/28 11:25:37 yamt Exp $ */\r
\r
/*-\r
 * Copyright (c)2001 Citrus Project,\r
 * All rights reserved.\r
 *\r
 * Redistribution and use in source and binary forms, with or without\r
 * modification, are permitted provided that the following conditions\r
 * are met:\r
 * 1. Redistributions of source code must retain the above copyright\r
 *    notice, this list of conditions and the following disclaimer.\r
 * 2. Redistributions in binary form must reproduce the above copyright\r
 *    notice, this list of conditions and the following disclaimer in the\r
 *    documentation and/or other materials provided with the distribution.\r
 *\r
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND\r
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE\r
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\r
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\r
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\r
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\r
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\r
 * SUCH DAMAGE.\r
 *\r
 *	$Citrus: xpg4dl/FreeBSD/lib/libc/locale/__wctoint.h,v 1.1 2001/09/21 13:52:32 yamt Exp $\r
 */\r
\r
\r
__inline static int\r
__wctoint(wchar_t wc)\r
{\r
	int n;\r
\r
	/* XXX I expect compiler to optimize this. :D */\r
	switch (wc) {\r
	case L'0': n = 0; break;\r
	case L'1': n = 1; break;\r
	case L'2': n = 2; break;\r
	case L'3': n = 3; break;\r
	case L'4': n = 4; break;\r
	case L'5': n = 5; break;\r
	case L'6': n = 6; break;\r
	case L'7': n = 7; break;\r
	case L'8': n = 8; break;\r
	case L'9': n = 9; break;\r
	case L'A': case L'a': n = 10; break;\r
	case L'B': case L'b': n = 11; break;\r
	case L'C': case L'c': n = 12; break;\r
	case L'D': case L'd': n = 13; break;\r
	case L'E': case L'e': n = 14; break;\r
	case L'F': case L'f': n = 15; break;\r
	case L'G': case L'g': n = 16; break;\r
	case L'H': case L'h': n = 17; break;\r
	case L'I': case L'i': n = 18; break;\r
	case L'J': case L'j': n = 19; break;\r
	case L'K': case L'k': n = 20; break;\r
	case L'L': case L'l': n = 21; break;\r
	case L'M': case L'm': n = 22; break;\r
	case L'N': case L'n': n = 23; break;\r
	case L'O': case L'o': n = 24; break;\r
	case L'P': case L'p': n = 25; break;\r
	case L'Q': case L'q': n = 26; break;\r
	case L'R': case L'r': n = 27; break;\r
	case L'S': case L's': n = 28; break;\r
	case L'T': case L't': n = 29; break;\r
	case L'U': case L'u': n = 30; break;\r
	case L'V': case L'v': n = 31; break;\r
	case L'W': case L'w': n = 32; break;\r
	case L'X': case L'x': n = 33; break;\r
	case L'Y': case L'y': n = 34; break;\r
	case L'Z': case L'z': n = 35; break;\r
	default: n = -1; break; /* error */\r
	}\r
\r
	return n;\r
}\r