| /* | |
| * The authors of this software are Rob Pike and Ken Thompson. | |
| * Copyright (c) 2002 by Lucent Technologies. | |
| * Permission to use, copy, modify, and distribute this software for any | |
| * purpose without fee is hereby granted, provided that this entire notice | |
| * is included in all copies of any software which is or includes a copy | |
| * or modification of this software and in all copies of the supporting | |
| * documentation for such software. | |
| * THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED | |
| * WARRANTY. IN PARTICULAR, NEITHER THE AUTHORS NOR LUCENT TECHNOLOGIES MAKE ANY | |
| * REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY | |
| * OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE. | |
| */ | |
| /* | |
| * This code is copied, with slight editing due to type differences, | |
| * from a subset of ../lib9/utf/rune.c | |
| */ | |
| #include "runtime.h" | |
| enum | |
| { | |
| Bit1 = 7, | |
| Bitx = 6, | |
| Bit2 = 5, | |
| Bit3 = 4, | |
| Bit4 = 3, | |
| Bit5 = 2, | |
| T1 = ((1<<(Bit1+1))-1) ^ 0xFF, /* 0000 0000 */ | |
| Tx = ((1<<(Bitx+1))-1) ^ 0xFF, /* 1000 0000 */ | |
| T2 = ((1<<(Bit2+1))-1) ^ 0xFF, /* 1100 0000 */ | |
| T3 = ((1<<(Bit3+1))-1) ^ 0xFF, /* 1110 0000 */ | |
| T4 = ((1<<(Bit4+1))-1) ^ 0xFF, /* 1111 0000 */ | |
| T5 = ((1<<(Bit5+1))-1) ^ 0xFF, /* 1111 1000 */ | |
| Rune1 = (1<<(Bit1+0*Bitx))-1, /* 0000 0000 0111 1111 */ | |
| Rune2 = (1<<(Bit2+1*Bitx))-1, /* 0000 0111 1111 1111 */ | |
| Rune3 = (1<<(Bit3+2*Bitx))-1, /* 1111 1111 1111 1111 */ | |
| Rune4 = (1<<(Bit4+3*Bitx))-1, | |
| /* 0001 1111 1111 1111 1111 1111 */ | |
| Maskx = (1<<Bitx)-1, /* 0011 1111 */ | |
| Testx = Maskx ^ 0xFF, /* 1100 0000 */ | |
| Runeerror = 0xFFFD, | |
| Runeself = 0x80, | |
| Bad = Runeerror, | |
| Runemax = 0x10FFFF, /* maximum rune value */ | |
| }; | |
| int32 | |
| runetochar(byte *str, int32 rune) /* note: in original, arg2 was pointer */ | |
| { | |
| /* Runes are signed, so convert to unsigned for range check. */ | |
| uint32 c; | |
| /* | |
| * one character sequence | |
| * 00000-0007F => 00-7F | |
| */ | |
| c = rune; | |
| if(c <= Rune1) { | |
| str[0] = c; | |
| return 1; | |
| } | |
| /* | |
| * two character sequence | |
| * 0080-07FF => T2 Tx | |
| */ | |
| if(c <= Rune2) { | |
| str[0] = T2 | (c >> 1*Bitx); | |
| str[1] = Tx | (c & Maskx); | |
| return 2; | |
| } | |
| /* | |
| * If the Rune is out of range, convert it to the error rune. | |
| * Do this test here because the error rune encodes to three bytes. | |
| * Doing it earlier would duplicate work, since an out of range | |
| * Rune wouldn't have fit in one or two bytes. | |
| */ | |
| if (c > Runemax) | |
| c = Runeerror; | |
| /* | |
| * three character sequence | |
| * 0800-FFFF => T3 Tx Tx | |
| */ | |
| if (c <= Rune3) { | |
| str[0] = T3 | (c >> 2*Bitx); | |
| str[1] = Tx | ((c >> 1*Bitx) & Maskx); | |
| str[2] = Tx | (c & Maskx); | |
| return 3; | |
| } | |
| /* | |
| * four character sequence (21-bit value) | |
| * 10000-1FFFFF => T4 Tx Tx Tx | |
| */ | |
| str[0] = T4 | (c >> 3*Bitx); | |
| str[1] = Tx | ((c >> 2*Bitx) & Maskx); | |
| str[2] = Tx | ((c >> 1*Bitx) & Maskx); | |
| str[3] = Tx | (c & Maskx); | |
| return 4; | |
| } |