]> git.saurik.com Git - apple/libc.git/blob - locale.subproj/frune.c
Libc-166.tar.gz
[apple/libc.git] / locale.subproj / frune.c
1 /*
2 * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
3 *
4 * @APPLE_LICENSE_HEADER_START@
5 *
6 * The contents of this file constitute Original Code as defined in and
7 * are subject to the Apple Public Source License Version 1.1 (the
8 * "License"). You may not use this file except in compliance with the
9 * License. Please obtain a copy of the License at
10 * http://www.apple.com/publicsource and read it before using this file.
11 *
12 * This Original Code and all software distributed under the License are
13 * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
14 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
15 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
16 * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
17 * License for the specific language governing rights and limitations
18 * under the License.
19 *
20 * @APPLE_LICENSE_HEADER_END@
21 */
22 /*
23 * Copyright (c) 1993
24 * The Regents of the University of California. All rights reserved.
25 *
26 * This code is derived from software contributed to Berkeley by
27 * Paul Borman at Krystal Technologies.
28 *
29 * Redistribution and use in source and binary forms, with or without
30 * modification, are permitted provided that the following conditions
31 * are met:
32 * 1. Redistributions of source code must retain the above copyright
33 * notice, this list of conditions and the following disclaimer.
34 * 2. Redistributions in binary form must reproduce the above copyright
35 * notice, this list of conditions and the following disclaimer in the
36 * documentation and/or other materials provided with the distribution.
37 * 3. All advertising materials mentioning features or use of this software
38 * must display the following acknowledgement:
39 * This product includes software developed by the University of
40 * California, Berkeley and its contributors.
41 * 4. Neither the name of the University nor the names of its contributors
42 * may be used to endorse or promote products derived from this software
43 * without specific prior written permission.
44 *
45 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
46 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
47 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
48 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
49 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
50 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
51 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
52 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
53 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
54 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
55 * SUCH DAMAGE.
56 */
57
58
59 #include <limits.h>
60 #include <rune.h>
61 #include <stddef.h>
62 #include <stdio.h>
63
64 long
65 fgetrune(fp)
66 FILE *fp;
67 {
68 rune_t r;
69 int c, len;
70 char buf[MB_LEN_MAX];
71 char const *result;
72
73 len = 0;
74 do {
75 if ((c = getc(fp)) == EOF) {
76 if (len)
77 break;
78 return (EOF);
79 }
80 buf[len++] = c;
81
82 if ((r = sgetrune(buf, len, &result)) != _INVALID_RUNE)
83 return (r);
84 } while (result == buf && len < MB_LEN_MAX);
85
86 while (--len > 0)
87 ungetc(buf[len], fp);
88 return (_INVALID_RUNE);
89 }
90
91 int
92 fungetrune(r, fp)
93 rune_t r;
94 FILE* fp;
95 {
96 int len;
97 char buf[MB_LEN_MAX];
98
99 len = sputrune(r, buf, MB_LEN_MAX, 0);
100 while (len-- > 0)
101 if (ungetc(buf[len], fp) == EOF)
102 return (EOF);
103 return (0);
104 }
105
106 int
107 fputrune(r, fp)
108 rune_t r;
109 FILE *fp;
110 {
111 int i, len;
112 char buf[MB_LEN_MAX];
113
114 len = sputrune(r, buf, MB_LEN_MAX, 0);
115
116 for (i = 0; i < len; ++i)
117 if (putc(buf[i], fp) == EOF)
118 return (EOF);
119
120 return (0);
121 }