utf32.h 2.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293
  1. /*
  2. * Copyright (C) 1999-2001, 2008 Free Software Foundation, Inc.
  3. * This file is part of the GNU LIBICONV Library.
  4. *
  5. * The GNU LIBICONV Library is free software; you can redistribute it
  6. * and/or modify it under the terms of the GNU Library General Public
  7. * License as published by the Free Software Foundation; either version 2
  8. * of the License, or (at your option) any later version.
  9. *
  10. * The GNU LIBICONV Library is distributed in the hope that it will be
  11. * useful, but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  13. * Library General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU Library General Public
  16. * License along with the GNU LIBICONV Library; see the file COPYING.LIB.
  17. * If not, write to the Free Software Foundation, Inc., 51 Franklin Street,
  18. * Fifth Floor, Boston, MA 02110-1301, USA.
  19. */
  20. /*
  21. * UTF-32
  22. */
  23. /* Specification: Unicode 3.1 Standard Annex #19 */
  24. /* Here we accept FFFE0000/0000FEFF marks as endianness indicators
  25. everywhere in the stream, not just at the beginning. (This is contrary
  26. to what #19 D36c specifies, but it allows concatenation of byte
  27. sequences to work flawlessly, while disagreeing with #19 behaviour
  28. only for strings containing U+FEFF characters, which is quite rare.)
  29. The default is big-endian. */
  30. /* The state is 0 if big-endian, 1 if little-endian. */
  31. static int
  32. utf32_mbtowc (conv_t conv, ucs4_t *pwc, const unsigned char *s, int n)
  33. {
  34. state_t state = conv->istate;
  35. int count = 0;
  36. for (; n >= 4;) {
  37. ucs4_t wc = (state
  38. ? s[0] + (s[1] << 8) + (s[2] << 16) + (s[3] << 24)
  39. : (s[0] << 24) + (s[1] << 16) + (s[2] << 8) + s[3]);
  40. count += 4;
  41. if (wc == 0x0000feff) {
  42. } else if (wc == 0xfffe0000u) {
  43. state ^= 1;
  44. } else {
  45. if (wc < 0x110000 && !(wc >= 0xd800 && wc < 0xe000)) {
  46. *pwc = wc;
  47. conv->istate = state;
  48. return count;
  49. } else {
  50. conv->istate = state;
  51. return RET_SHIFT_ILSEQ(count);
  52. }
  53. }
  54. s += 4; n -= 4;
  55. }
  56. conv->istate = state;
  57. return RET_TOOFEW(count);
  58. }
  59. /* We output UTF-32 in big-endian order, with byte-order mark. */
  60. /* The state is 0 at the beginning, 1 after the BOM has been written. */
  61. static int
  62. utf32_wctomb (conv_t conv, unsigned char *r, ucs4_t wc, int n)
  63. {
  64. if (wc < 0x110000 && !(wc >= 0xd800 && wc < 0xe000)) {
  65. int count = 0;
  66. if (!conv->ostate) {
  67. if (n >= 4) {
  68. r[0] = 0x00;
  69. r[1] = 0x00;
  70. r[2] = 0xFE;
  71. r[3] = 0xFF;
  72. r += 4; n -= 4; count += 4;
  73. } else
  74. return RET_TOOSMALL;
  75. }
  76. if (wc < 0x110000) {
  77. if (n >= 4) {
  78. r[0] = 0;
  79. r[1] = (unsigned char) (wc >> 16);
  80. r[2] = (unsigned char) (wc >> 8);
  81. r[3] = (unsigned char) wc;
  82. conv->ostate = 1;
  83. return count+4;
  84. } else
  85. return RET_TOOSMALL;
  86. }
  87. }
  88. return RET_ILUNI;
  89. }