kc3-lang/libiconv/lib/euc_jp.h

Branch - branch -master

• Show log

  Commit

• Hash : 91f96be0
  Author :
  Date : 2021-06-06T11:51:12
  

  Change the license of the library from LGPL 2.0 to LGPL 2.1.
  

Download

• lib/euc_jp.h

• /*
   * Copyright (C) 1999-2001, 2005, 2016 Free Software Foundation, Inc.
   * This file is part of the GNU LIBICONV Library.
   *
   * The GNU LIBICONV Library is free software; you can redistribute it
   * and/or modify it under the terms of the GNU Lesser General Public
   * License as published by the Free Software Foundation; either version 2.1
   * of the License, or (at your option) any later version.
   *
   * The GNU LIBICONV Library 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
   * Lesser General Public License for more details.
   *
   * You should have received a copy of the GNU Lesser General Public
   * License along with the GNU LIBICONV Library; see the file COPYING.LIB.
   * If not, see <https://www.gnu.org/licenses/>.
   */
  
  /*
   * EUC-JP
   */
  
  static int
  euc_jp_mbtowc (conv_t conv, ucs4_t *pwc, const unsigned char *s, size_t n)
  {
    unsigned char c = *s;
    /* Code set 0 (ASCII or JIS X 0201-1976 Roman) */
    if (c < 0x80)
      return ascii_mbtowc(conv,pwc,s,n);
    /* Code set 1 (JIS X 0208) */
    if (c >= 0xa1 && c < 0xff) {
      if (n < 2)
        return RET_TOOFEW(0);
      if (c < 0xf5) {
        unsigned char c2 = s[1];
        if (c2 >= 0xa1 && c2 < 0xff) {
          unsigned char buf[2];
          buf[0] = c-0x80; buf[1] = c2-0x80;
          return jisx0208_mbtowc(conv,pwc,buf,2);
        } else
          return RET_ILSEQ;
      } else {
        /* User-defined range. See
         * Ken Lunde's "CJKV Information Processing", table 4-66, p. 206. */
        unsigned char c2 = s[1];
        if (c2 >= 0xa1 && c2 < 0xff) {
          *pwc = 0xe000 + 94*(c-0xf5) + (c2-0xa1);
          return 2;
        } else
          return RET_ILSEQ;
      }
    }
    /* Code set 2 (half-width katakana) */
    if (c == 0x8e) {
      if (n < 2)
        return RET_TOOFEW(0);
      {
        unsigned char c2 = s[1];
        if (c2 >= 0xa1 && c2 < 0xe0) {
          int ret = jisx0201_mbtowc(conv,pwc,s+1,n-1);
          if (ret == RET_ILSEQ)
            return RET_ILSEQ;
          if (ret != 1) abort();
          return 2;
        } else
          return RET_ILSEQ;
      }
    }
    /* Code set 3 (JIS X 0212-1990) */
    if (c == 0x8f) {
      if (n < 2)
        return RET_TOOFEW(0);
      {
        unsigned char c2 = s[1];
        if (c2 >= 0xa1 && c2 < 0xff) {
          if (n < 3)
            return RET_TOOFEW(0);
          if (c2 < 0xf5) {
            unsigned char c3 = s[2];
            if (c3 >= 0xa1 && c3 < 0xff) {
              unsigned char buf[2];
              int ret;
              buf[0] = c2-0x80; buf[1] = c3-0x80;
              ret = jisx0212_mbtowc(conv,pwc,buf,2);
              if (ret == RET_ILSEQ)
                return RET_ILSEQ;
              if (ret != 2) abort();
              return 3;
            } else
              return RET_ILSEQ;
          } else {
            /* User-defined range. See
             * Ken Lunde's "CJKV Information Processing", table 4-66, p. 206. */
            unsigned char c3 = s[2];
            if (c3 >= 0xa1 && c3 < 0xff) {
              *pwc = 0xe3ac + 94*(c2-0xf5) + (c3-0xa1);
              return 3;
            } else
              return RET_ILSEQ;
          }
        } else
          return RET_ILSEQ;
      }
    }
    return RET_ILSEQ;
  }
  
  static int
  euc_jp_wctomb (conv_t conv, unsigned char *r, ucs4_t wc, size_t n)
  {
    unsigned char buf[2];
    int ret;
  
    /* Code set 0 (ASCII or JIS X 0201-1976 Roman) */
    ret = ascii_wctomb(conv,r,wc,n);
    if (ret != RET_ILUNI)
      return ret;
  
    /* Code set 1 (JIS X 0208) */
    ret = jisx0208_wctomb(conv,buf,wc,2);
    if (ret != RET_ILUNI) {
      if (ret != 2) abort();
      if (n < 2)
        return RET_TOOSMALL;
      r[0] = buf[0]+0x80;
      r[1] = buf[1]+0x80;
      return 2;
    }
  
    /* Code set 2 (half-width katakana) */
    ret = jisx0201_wctomb(conv,buf,wc,1);
    if (ret != RET_ILUNI && buf[0] >= 0x80) {
      if (ret != 1) abort();
      if (n < 2)
        return RET_TOOSMALL;
      r[0] = 0x8e;
      r[1] = buf[0];
      return 2;
    }
  
    /* Code set 3 (JIS X 0212-1990) */
    ret = jisx0212_wctomb(conv,buf,wc,2);
    if (ret != RET_ILUNI) {
      if (ret != 2) abort();
      if (n < 3)
        return RET_TOOSMALL;
      r[0] = 0x8f;
      r[1] = buf[0]+0x80;
      r[2] = buf[1]+0x80;
      return 3;
    }
  
    /* Extra compatibility with Shift_JIS.  */
    if (wc == 0x00a5) {
      r[0] = 0x5c;
      return 1;
    }
    if (wc == 0x203e) {
      r[0] = 0x7e;
      return 1;
    }
  
    /* User-defined range. See
     * Ken Lunde's "CJKV Information Processing", table 4-66, p. 206. */
    if (wc >= 0xe000 && wc < 0xe758) {
      if (wc < 0xe3ac) {
        unsigned char c1, c2;
        if (n < 2)
          return RET_TOOSMALL;
        c1 = (unsigned int) (wc - 0xe000) / 94;
        c2 = (unsigned int) (wc - 0xe000) % 94;
        r[0] = c1+0xf5;
        r[1] = c2+0xa1;
        return 2;
      } else {
        unsigned char c1, c2;
        if (n < 3)
          return RET_TOOSMALL;
        c1 = (unsigned int) (wc - 0xe3ac) / 94;
        c2 = (unsigned int) (wc - 0xe3ac) % 94;
        r[0] = 0x8f;
        r[1] = c1+0xf5;
        r[2] = c2+0xa1;
        return 3;
      }
    }
  
    return RET_ILUNI;
  }
  

Download