Rev 3403 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 3403 | Rev 4348 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (c) 2006 Josef Cejka |
2 | * Copyright (c) 2006 Josef Cejka |
3 | * All rights reserved. |
3 | * All rights reserved. |
4 | * |
4 | * |
5 | * Redistribution and use in source and binary forms, with or without |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
6 | * modification, are permitted provided that the following conditions |
7 | * are met: |
7 | * are met: |
8 | * |
8 | * |
9 | * - Redistributions of source code must retain the above copyright |
9 | * - Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * - Redistributions in binary form must reproduce the above copyright |
11 | * - Redistributions in binary form must reproduce the above copyright |
12 | * notice, this list of conditions and the following disclaimer in the |
12 | * notice, this list of conditions and the following disclaimer in the |
13 | * documentation and/or other materials provided with the distribution. |
13 | * documentation and/or other materials provided with the distribution. |
14 | * - The name of the author may not be used to endorse or promote products |
14 | * - The name of the author may not be used to endorse or promote products |
15 | * derived from this software without specific prior written permission. |
15 | * derived from this software without specific prior written permission. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
27 | */ |
28 | 28 | ||
29 | /** @addtogroup libc |
29 | /** @addtogroup libc |
30 | * @{ |
30 | * @{ |
31 | */ |
31 | */ |
32 | /** @file |
32 | /** @file |
33 | */ |
33 | */ |
34 | 34 | ||
35 | #include <stdarg.h> |
35 | #include <stdarg.h> |
36 | #include <stdio.h> |
36 | #include <stdio.h> |
37 | #include <string.h> |
37 | #include <string.h> |
38 | #include <io/printf_core.h> |
38 | #include <io/printf_core.h> |
- | 39 | #include <errno.h> |
|
39 | 40 | ||
40 | struct vsnprintf_data { |
41 | typedef struct { |
41 | size_t size; /* total space for string */ |
42 | size_t size; /* Total size of the buffer (in bytes) */ |
42 | size_t len; /* count of currently used characters */ |
43 | size_t len; /* Number of already used bytes */ |
43 | char *string; /* destination string */ |
44 | char *dst; /* Destination */ |
44 | }; |
45 | } vsnprintf_data_t; |
45 | 46 | ||
46 | /** Write string to given buffer. |
47 | /** Write string to given buffer. |
- | 48 | * |
|
47 | * Write at most data->size characters including trailing zero. According to C99 |
49 | * Write at most data->size plain characters including trailing zero. |
48 | * has snprintf to return number of characters that would have been written if |
50 | * According to C99, snprintf() has to return number of characters that |
49 | * enough space had been available. Hence the return value is not number of |
51 | * would have been written if enough space had been available. Hence |
50 | * really printed characters but size of input string. Number of really used |
52 | * the return value is not the number of actually printed characters |
51 | * characters is stored in data->len. |
53 | * but size of the input string. |
52 | * |
54 | * |
53 | * @param str Source string to print. |
55 | * @param str Source string to print. |
54 | * @param count Size of the source string. |
56 | * @param size Number of plain characters in str. |
55 | * @param data Structure with destination string, counter of used space |
57 | * @param data Structure describing destination string, counter |
56 | * and total string size. |
58 | * of used space and total string size. |
- | 59 | * |
|
57 | * @return Number of characters to print (not characters really |
60 | * @return Number of characters to print (not characters actually |
58 | * printed!) |
61 | * printed). |
- | 62 | * |
|
59 | */ |
63 | */ |
60 | static int |
- | |
61 | vsnprintf_write(const char *str, size_t count, struct vsnprintf_data *data) |
64 | static int vsnprintf_str_write(const char *str, size_t size, vsnprintf_data_t *data) |
62 | { |
65 | { |
63 | size_t i; |
- | |
64 | i = data->size - data->len; |
66 | size_t left = data->size - data->len; |
65 | 67 | ||
66 | if (i == 0) { |
68 | if (left == 0) |
67 | return count; |
69 | return ((int) size); |
68 | } |
- | |
69 | 70 | ||
70 | if (i == 1) { |
71 | if (left == 1) { |
71 | /* |
- | |
72 | * We have only one free byte left in buffer => write there |
72 | /* We have only one free byte left in buffer |
73 | * trailing zero. |
73 | * -> store trailing zero |
74 | */ |
74 | */ |
75 | data->string[data->size - 1] = 0; |
75 | data->dst[data->size - 1] = 0; |
76 | data->len = data->size; |
76 | data->len = data->size; |
77 | return count; |
77 | return ((int) size); |
78 | } |
78 | } |
79 | 79 | ||
80 | if (i <= count) { |
80 | if (left <= size) { |
81 | /* |
- | |
82 | * We have not enought space for whole string with the trailing |
81 | /* We do not have enough space for the whole string |
83 | * zero => print only a part of string. |
82 | * with the trailing zero => print only a part |
- | 83 | * of string |
|
84 | */ |
84 | */ |
- | 85 | index_t index = 0; |
|
- | 86 | ||
- | 87 | while (index < size) { |
|
- | 88 | wchar_t uc = str_decode(str, &index, size); |
|
- | 89 | ||
85 | memcpy((void *)(data->string + data->len), (void *)str, i - 1); |
90 | if (chr_encode(uc, data->dst, &data->len, data->size - 1) != EOK) |
- | 91 | break; |
|
- | 92 | } |
|
- | 93 | ||
- | 94 | /* Put trailing zero at end, but not count it |
|
- | 95 | * into data->len so it could be rewritten next time |
|
- | 96 | */ |
|
86 | data->string[data->size - 1] = 0; |
97 | data->dst[data->len] = 0; |
- | 98 | ||
- | 99 | return ((int) size); |
|
- | 100 | } |
|
- | 101 | ||
- | 102 | /* Buffer is big enought to print the whole string */ |
|
- | 103 | memcpy((void *)(data->dst + data->len), (void *) str, size); |
|
87 | data->len = data->size; |
104 | data->len += size; |
- | 105 | ||
- | 106 | /* Put trailing zero at end, but not count it |
|
- | 107 | * into data->len so it could be rewritten next time |
|
- | 108 | */ |
|
- | 109 | data->dst[data->len] = 0; |
|
- | 110 | ||
88 | return count; |
111 | return ((int) size); |
89 | } |
112 | } |
90 | 113 | ||
91 | /* Buffer is big enought to print whole string */ |
114 | /** Write wide string to given buffer. |
- | 115 | * |
|
92 | memcpy((void *)(data->string + data->len), (void *)str, count); |
116 | * Write at most data->size plain characters including trailing zero. |
- | 117 | * According to C99, snprintf() has to return number of characters that |
|
- | 118 | * would have been written if enough space had been available. Hence |
|
- | 119 | * the return value is not the number of actually printed characters |
|
93 | data->len += count; |
120 | * but size of the input string. |
- | 121 | * |
|
- | 122 | * @param str Source wide string to print. |
|
- | 123 | * @param size Number of bytes in str. |
|
- | 124 | * @param data Structure describing destination string, counter |
|
- | 125 | * of used space and total string size. |
|
94 | /* |
126 | * |
95 | * Put trailing zero at end, but not count it into data->len so it could |
127 | * @return Number of wide characters to print (not characters actually |
96 | * be rewritten next time. |
128 | * printed). |
- | 129 | * |
|
97 | */ |
130 | */ |
- | 131 | static int vsnprintf_wstr_write(const wchar_t *str, size_t size, vsnprintf_data_t *data) |
|
- | 132 | { |
|
98 | data->string[data->len] = 0; |
133 | index_t index = 0; |
99 | 134 | ||
- | 135 | while (index < (size / sizeof(wchar_t))) { |
|
- | 136 | size_t left = data->size - data->len; |
|
- | 137 | ||
- | 138 | if (left == 0) |
|
100 | return count; |
139 | return ((int) size); |
- | 140 | ||
- | 141 | if (left == 1) { |
|
- | 142 | /* We have only one free byte left in buffer |
|
- | 143 | * -> store trailing zero |
|
- | 144 | */ |
|
- | 145 | data->dst[data->size - 1] = 0; |
|
- | 146 | data->len = data->size; |
|
- | 147 | return ((int) size); |
|
101 | } |
148 | } |
102 | 149 | ||
103 | /** Print formatted to the given buffer with limited size. |
150 | if (chr_encode(str[index], data->dst, &data->len, data->size - 1) != EOK) |
104 | * @param str Buffer. |
151 | break; |
- | 152 | ||
105 | * @param size Bffer size. |
153 | index++; |
- | 154 | } |
|
- | 155 | ||
106 | * @param fmt Format string. |
156 | /* Put trailing zero at end, but not count it |
107 | * \see For more details about format string see printf_core. |
157 | * into data->len so it could be rewritten next time |
108 | */ |
158 | */ |
- | 159 | data->dst[data->len] = 0; |
|
- | 160 | ||
- | 161 | return ((int) size); |
|
- | 162 | } |
|
- | 163 | ||
109 | int vsnprintf(char *str, size_t size, const char *fmt, va_list ap) |
164 | int vsnprintf(char *str, size_t size, const char *fmt, va_list ap) |
110 | { |
165 | { |
111 | struct vsnprintf_data data = {size, 0, str}; |
166 | vsnprintf_data_t data = { |
- | 167 | size, |
|
- | 168 | 0, |
|
- | 169 | str |
|
- | 170 | }; |
|
112 | struct printf_spec ps = { |
171 | printf_spec_t ps = { |
113 | (int(*)(void *, size_t, void *)) vsnprintf_write, |
172 | (int(*) (const char *, size_t, void *)) vsnprintf_str_write, |
- | 173 | (int(*) (const wchar_t *, size_t, void *)) vsnprintf_wstr_write, |
|
114 | &data |
174 | &data |
115 | }; |
175 | }; |
116 | 176 | ||
117 | /* |
- | |
118 | * Print 0 at end of string - fix the case that nothing will be printed. |
177 | /* Print 0 at end of string - fix the case that nothing will be printed */ |
119 | */ |
- | |
120 | if (size > 0) |
178 | if (size > 0) |
121 | str[0] = 0; |
179 | str[0] = 0; |
122 | 180 | ||
123 | /* vsnprintf_write ensures that str will be terminated by zero. */ |
181 | /* vsnprintf_write ensures that str will be terminated by zero. */ |
124 | return printf_core(fmt, &ps, ap); |
182 | return printf_core(fmt, &ps, ap); |
125 | } |
183 | } |
126 | 184 | ||
127 | /** @} |
185 | /** @} |
128 | */ |
186 | */ |
129 | 187 |