aboutsummaryrefslogtreecommitdiffstats
path: root/contrib/libs/libiconv/ces_gbk.h
blob: de390ec119270cbe7ca781440dee7f39bfaf1ff3 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
/* 
 * Copyright (C) 1999-2001, 2005 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 Library General Public 
 * License as published by the Free Software Foundation; either version 2 
 * 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 
 * Library General Public License for more details. 
 * 
 * You should have received a copy of the GNU Library General Public 
 * License along with the GNU LIBICONV Library; see the file COPYING.LIB. 
 * If not, write to the Free Software Foundation, Inc., 51 Franklin Street, 
 * Fifth Floor, Boston, MA 02110-1301, USA. 
 */ 
 
/* 
 * GBK 
 */ 
 
static int 
ces_gbk_mbtowc (conv_t conv, ucs4_t *pwc, const unsigned char *s, int n) 
{ 
  unsigned char c = *s; 
 
  /* Code set 0 (ASCII or GB 1988-89) */ 
  if (c < 0x80) 
    return ascii_mbtowc(conv,pwc,s,n); 
  /* Code set 1 (GBK) */ 
  if (c >= 0x81 && c < 0xff) { 
    if (n < 2) 
      return RET_TOOFEW(0); 
    return gbk_mbtowc(conv,pwc,s,2); 
  } 
  return RET_ILSEQ; 
} 
 
static int 
ces_gbk_wctomb (conv_t conv, unsigned char *r, ucs4_t wc, int n) 
{ 
  unsigned char buf[2]; 
  int ret; 
 
  /* Code set 0 (ASCII or GB 1988-89) */ 
  ret = ascii_wctomb(conv,r,wc,n); 
  if (ret != RET_ILUNI) 
    return ret; 
 
  /* Code set 1 (GBK) */ 
  ret = gbk_wctomb(conv,buf,wc,2); 
  if (ret != RET_ILUNI) { 
    if (ret != 2) abort(); 
    if (n < 2) 
      return RET_TOOSMALL; 
    r[0] = buf[0]; 
    r[1] = buf[1]; 
    return 2; 
  } 
 
  return RET_ILUNI; 
}