Rev 4212 | Rev 4224 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
4011 | svoboda | 1 | /* |
2 | * Copyright (c) 2001-2004 Jakub Jermar |
||
3 | * All rights reserved. |
||
4 | * |
||
5 | * Redistribution and use in source and binary forms, with or without |
||
6 | * modification, are permitted provided that the following conditions |
||
7 | * are met: |
||
8 | * |
||
9 | * - Redistributions of source code must retain the above copyright |
||
10 | * notice, this list of conditions and the following disclaimer. |
||
11 | * - Redistributions in binary form must reproduce the above copyright |
||
12 | * notice, this list of conditions and the following disclaimer in the |
||
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 |
||
15 | * derived from this software without specific prior written permission. |
||
16 | * |
||
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 |
||
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
||
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
||
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
||
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 |
||
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 |
||
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
27 | */ |
||
28 | |||
4014 | decky | 29 | /** @addtogroup generic |
4011 | svoboda | 30 | * @{ |
31 | */ |
||
32 | |||
33 | /** |
||
34 | * @file |
||
4209 | svoboda | 35 | * @brief String functions. |
36 | * |
||
37 | * Strings and characters use the Universal Character Set (UCS). The standard |
||
38 | * strings, called just strings are encoded in UTF-8. Wide strings (encoded |
||
39 | * in UTF-32) are supported to a limited degree. A single character is |
||
4212 | decky | 40 | * represented as wchar_t.@n |
4209 | svoboda | 41 | * |
4212 | decky | 42 | * Overview of the terminology:@n |
4209 | svoboda | 43 | * |
4212 | decky | 44 | * Term Meaning |
45 | * -------------------- ---------------------------------------------------- |
||
46 | * byte 8 bits stored in uint8_t (unsigned 8 bit integer) |
||
4209 | svoboda | 47 | * |
4212 | decky | 48 | * character UTF-32 encoded Unicode character, stored in wchar_t |
49 | * (signed 32 bit integer), code points 0 .. 1114111 |
||
50 | * are valid |
||
4209 | svoboda | 51 | * |
4212 | decky | 52 | * ASCII character 7 bit encoded ASCII character, stored in char |
53 | * (usually signed 8 bit integer), code points 0 .. 127 |
||
54 | * are valid |
||
4209 | svoboda | 55 | * |
4212 | decky | 56 | * string UTF-8 encoded NULL-terminated Unicode string, char * |
57 | * |
||
58 | * wide string UTF-32 encoded NULL-terminated Unicode string, |
||
59 | * wchar_t * |
||
60 | * |
||
61 | * [wide] string size number of BYTES in a [wide] string (excluding |
||
62 | * the NULL-terminator), size_t |
||
63 | * |
||
64 | * [wide] string length number of CHARACTERS in a [wide] string (excluding |
||
65 | * the NULL-terminator), count_t |
||
66 | * |
||
67 | * [wide] string width number of display cells on a monospace display taken |
||
68 | * by a [wide] string, count_t |
||
69 | * |
||
70 | * |
||
71 | * Overview of string metrics:@n |
||
72 | * |
||
73 | * Metric Abbrev. Type Meaning |
||
74 | * ------ ------ ------ ------------------------------------------------- |
||
75 | * size n size_t number of BYTES in a string (excluding the |
||
76 | * NULL-terminator) |
||
77 | * |
||
78 | * length l count_t number of CHARACTERS in a string (excluding the |
||
79 | * null terminator) |
||
80 | * |
||
81 | * width w count_t number of display cells on a monospace display |
||
82 | * taken by a string |
||
83 | * |
||
84 | * |
||
85 | * Function naming prefixes:@n |
||
86 | * |
||
87 | * chr_ operate on characters |
||
88 | * ascii_ operate on ASCII characters |
||
89 | * str_ operate on strings |
||
90 | * wstr_ operate on wide strings |
||
91 | * |
||
92 | * [w]str_[n|l|w] operate on a prefix limited by size, length |
||
93 | * or width |
||
94 | * |
||
95 | * |
||
96 | * A specific character inside a [wide] string can be referred to by:@n |
||
97 | * |
||
98 | * pointer (char *, wchar_t *) |
||
99 | * byte offset (size_t) |
||
100 | * character index (count_t) |
||
101 | * |
||
4011 | svoboda | 102 | */ |
103 | |||
104 | #include <string.h> |
||
105 | #include <print.h> |
||
106 | #include <cpu.h> |
||
107 | #include <arch/asm.h> |
||
108 | #include <arch.h> |
||
4208 | svoboda | 109 | #include <errno.h> |
4212 | decky | 110 | #include <align.h> |
4011 | svoboda | 111 | |
4212 | decky | 112 | /** Byte mask consisting of lowest @n bits (out of 8) */ |
113 | #define LO_MASK_8(n) ((uint8_t) ((1 << (n)) - 1)) |
||
4196 | svoboda | 114 | |
4212 | decky | 115 | /** Byte mask consisting of lowest @n bits (out of 32) */ |
116 | #define LO_MASK_32(n) ((uint32_t) ((1 << (n)) - 1)) |
||
4198 | svoboda | 117 | |
4212 | decky | 118 | /** Byte mask consisting of highest @n bits (out of 8) */ |
119 | #define HI_MASK_8(n) (~LO_MASK_8(8 - (n))) |
||
4198 | svoboda | 120 | |
4212 | decky | 121 | /** Number of data bits in a UTF-8 continuation byte */ |
122 | #define CONT_BITS 6 |
||
4196 | svoboda | 123 | |
4212 | decky | 124 | /** Decode a single character from a string. |
4175 | decky | 125 | * |
4212 | decky | 126 | * Decode a single character from a string of size @a size. Decoding starts |
4200 | svoboda | 127 | * at @a offset and this offset is moved to the beginning of the next |
128 | * character. In case of decoding error, offset generally advances at least |
||
4212 | decky | 129 | * by one. However, offset is never moved beyond size. |
4175 | decky | 130 | * |
4212 | decky | 131 | * @param str String (not necessarily NULL-terminated). |
132 | * @param offset Byte offset in string where to start decoding. |
||
133 | * @param size Size of the string (in bytes). |
||
4175 | decky | 134 | * |
4223 | decky | 135 | * @return Value of decoded character, U_SPECIAL on decoding error or |
4212 | decky | 136 | * NULL if attempt to decode beyond @a size. |
137 | * |
||
4175 | decky | 138 | */ |
4212 | decky | 139 | wchar_t str_decode(const char *str, size_t *offset, size_t size) |
4175 | decky | 140 | { |
4212 | decky | 141 | if (*offset + 1 > size) |
142 | return 0; |
||
143 | |||
144 | /* First byte read from string */ |
||
145 | uint8_t b0 = (uint8_t) str[(*offset)++]; |
||
146 | |||
147 | /* Determine code length */ |
||
148 | |||
149 | unsigned int b0_bits; /* Data bits in first byte */ |
||
150 | unsigned int cbytes; /* Number of continuation bytes */ |
||
151 | |||
4196 | svoboda | 152 | if ((b0 & 0x80) == 0) { |
153 | /* 0xxxxxxx (Plain ASCII) */ |
||
154 | b0_bits = 7; |
||
155 | cbytes = 0; |
||
156 | } else if ((b0 & 0xe0) == 0xc0) { |
||
157 | /* 110xxxxx 10xxxxxx */ |
||
158 | b0_bits = 5; |
||
159 | cbytes = 1; |
||
160 | } else if ((b0 & 0xf0) == 0xe0) { |
||
161 | /* 1110xxxx 10xxxxxx 10xxxxxx */ |
||
162 | b0_bits = 4; |
||
163 | cbytes = 2; |
||
164 | } else if ((b0 & 0xf8) == 0xf0) { |
||
165 | /* 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx */ |
||
166 | b0_bits = 3; |
||
167 | cbytes = 3; |
||
168 | } else { |
||
4212 | decky | 169 | /* 10xxxxxx -- unexpected continuation byte */ |
4223 | decky | 170 | return U_SPECIAL; |
4179 | decky | 171 | } |
4212 | decky | 172 | |
173 | if (*offset + cbytes > size) |
||
4223 | decky | 174 | return U_SPECIAL; |
4212 | decky | 175 | |
176 | wchar_t ch = b0 & LO_MASK_8(b0_bits); |
||
177 | |||
178 | /* Decode continuation bytes */ |
||
4196 | svoboda | 179 | while (cbytes > 0) { |
4212 | decky | 180 | uint8_t b = (uint8_t) str[(*offset)++]; |
181 | |||
182 | /* Must be 10xxxxxx */ |
||
183 | if ((b & 0xc0) != 0x80) |
||
4223 | decky | 184 | return U_SPECIAL; |
4212 | decky | 185 | |
186 | /* Shift data bits to ch */ |
||
4196 | svoboda | 187 | ch = (ch << CONT_BITS) | (wchar_t) (b & LO_MASK_8(CONT_BITS)); |
4212 | decky | 188 | cbytes--; |
4179 | decky | 189 | } |
4212 | decky | 190 | |
4196 | svoboda | 191 | return ch; |
4175 | decky | 192 | } |
193 | |||
4200 | svoboda | 194 | /** Encode a single character to string representation. |
4011 | svoboda | 195 | * |
4200 | svoboda | 196 | * Encode a single character to string representation (i.e. UTF-8) and store |
197 | * it into a buffer at @a offset. Encoding starts at @a offset and this offset |
||
198 | * is moved to the position where the next character can be written to. |
||
4011 | svoboda | 199 | * |
4212 | decky | 200 | * @param ch Input character. |
201 | * @param str Output buffer. |
||
202 | * @param offset Byte offset where to start writing. |
||
203 | * @param size Size of the output buffer (in bytes). |
||
4179 | decky | 204 | * |
4208 | svoboda | 205 | * @return EOK if the character was encoded successfully, EOVERFLOW if there |
206 | * was not enough space in the output buffer or EINVAL if the character |
||
207 | * code was invalid. |
||
4179 | decky | 208 | */ |
4212 | decky | 209 | int chr_encode(const wchar_t ch, char *str, size_t *offset, size_t size) |
4179 | decky | 210 | { |
4212 | decky | 211 | if (*offset >= size) |
4208 | svoboda | 212 | return EOVERFLOW; |
4212 | decky | 213 | |
214 | if (!chr_check(ch)) |
||
4208 | svoboda | 215 | return EINVAL; |
4212 | decky | 216 | |
217 | /* Unsigned version of ch (bit operations should only be done |
||
218 | on unsigned types). */ |
||
219 | uint32_t cc = (uint32_t) ch; |
||
220 | |||
221 | /* Determine how many continuation bytes are needed */ |
||
222 | |||
223 | unsigned int b0_bits; /* Data bits in first byte */ |
||
224 | unsigned int cbytes; /* Number of continuation bytes */ |
||
225 | |||
4198 | svoboda | 226 | if ((cc & ~LO_MASK_32(7)) == 0) { |
227 | b0_bits = 7; |
||
228 | cbytes = 0; |
||
229 | } else if ((cc & ~LO_MASK_32(11)) == 0) { |
||
230 | b0_bits = 5; |
||
231 | cbytes = 1; |
||
232 | } else if ((cc & ~LO_MASK_32(16)) == 0) { |
||
233 | b0_bits = 4; |
||
234 | cbytes = 2; |
||
235 | } else if ((cc & ~LO_MASK_32(21)) == 0) { |
||
236 | b0_bits = 3; |
||
237 | cbytes = 3; |
||
238 | } else { |
||
4212 | decky | 239 | /* Codes longer than 21 bits are not supported */ |
4208 | svoboda | 240 | return EINVAL; |
4179 | decky | 241 | } |
4212 | decky | 242 | |
243 | /* Check for available space in buffer */ |
||
244 | if (*offset + cbytes >= size) |
||
4208 | svoboda | 245 | return EOVERFLOW; |
4212 | decky | 246 | |
247 | /* Encode continuation bytes */ |
||
248 | unsigned int i; |
||
249 | for (i = cbytes; i > 0; i--) { |
||
4200 | svoboda | 250 | str[*offset + i] = 0x80 | (cc & LO_MASK_32(CONT_BITS)); |
4198 | svoboda | 251 | cc = cc >> CONT_BITS; |
4179 | decky | 252 | } |
4212 | decky | 253 | |
254 | /* Encode first byte */ |
||
4200 | svoboda | 255 | str[*offset] = (cc & LO_MASK_32(b0_bits)) | HI_MASK_8(8 - b0_bits - 1); |
4179 | decky | 256 | |
4212 | decky | 257 | /* Advance offset */ |
258 | *offset += cbytes + 1; |
||
259 | |||
4208 | svoboda | 260 | return EOK; |
4179 | decky | 261 | } |
262 | |||
4212 | decky | 263 | /** Get size of string. |
4209 | svoboda | 264 | * |
4212 | decky | 265 | * Get the number of bytes which are used by the string @a str (excluding the |
266 | * NULL-terminator). |
||
267 | * |
||
268 | * @param str String to consider. |
||
269 | * |
||
270 | * @return Number of bytes used by the string |
||
271 | * |
||
4209 | svoboda | 272 | */ |
4212 | decky | 273 | size_t str_size(const char *str) |
4209 | svoboda | 274 | { |
4212 | decky | 275 | size_t size = 0; |
276 | |||
277 | while (*str++ != 0) |
||
278 | size++; |
||
279 | |||
280 | return size; |
||
4209 | svoboda | 281 | } |
282 | |||
4212 | decky | 283 | /** Get size of wide string. |
4179 | decky | 284 | * |
4212 | decky | 285 | * Get the number of bytes which are used by the wide string @a str (excluding the |
286 | * NULL-terminator). |
||
287 | * |
||
288 | * @param str Wide string to consider. |
||
289 | * |
||
290 | * @return Number of bytes used by the wide string |
||
291 | * |
||
292 | */ |
||
293 | size_t wstr_size(const wchar_t *str) |
||
294 | { |
||
295 | return (wstr_length(str) * sizeof(wchar_t)); |
||
296 | } |
||
297 | |||
298 | /** Get size of string with length limit. |
||
299 | * |
||
4205 | svoboda | 300 | * Get the number of bytes which are used by up to @a max_len first |
301 | * characters in the string @a str. If @a max_len is greater than |
||
4212 | decky | 302 | * the length of @a str, the entire string is measured (excluding the |
303 | * NULL-terminator). |
||
4179 | decky | 304 | * |
4212 | decky | 305 | * @param str String to consider. |
306 | * @param max_len Maximum number of characters to measure. |
||
4179 | decky | 307 | * |
4212 | decky | 308 | * @return Number of bytes used by the characters. |
309 | * |
||
4179 | decky | 310 | */ |
4205 | svoboda | 311 | size_t str_lsize(const char *str, count_t max_len) |
4179 | decky | 312 | { |
4205 | svoboda | 313 | count_t len = 0; |
4212 | decky | 314 | size_t offset = 0; |
315 | |||
316 | while (len < max_len) { |
||
317 | if (str_decode(str, &offset, STR_NO_LIMIT) == 0) |
||
4199 | svoboda | 318 | break; |
4212 | decky | 319 | |
4205 | svoboda | 320 | len++; |
4179 | decky | 321 | } |
4212 | decky | 322 | |
323 | return offset; |
||
4179 | decky | 324 | } |
325 | |||
4212 | decky | 326 | /** Get size of wide string with length limit. |
4209 | svoboda | 327 | * |
4212 | decky | 328 | * Get the number of bytes which are used by up to @a max_len first |
329 | * wide characters in the wide string @a str. If @a max_len is greater than |
||
330 | * the length of @a str, the entire wide string is measured (excluding the |
||
331 | * NULL-terminator). |
||
4209 | svoboda | 332 | * |
4212 | decky | 333 | * @param str Wide string to consider. |
334 | * @param max_len Maximum number of wide characters to measure. |
||
4209 | svoboda | 335 | * |
4212 | decky | 336 | * @return Number of bytes used by the wide characters. |
337 | * |
||
4209 | svoboda | 338 | */ |
4212 | decky | 339 | size_t wstr_lsize(const wchar_t *str, count_t max_len) |
4209 | svoboda | 340 | { |
4212 | decky | 341 | return (wstr_nlength(str, max_len * sizeof(wchar_t)) * sizeof(wchar_t)); |
4209 | svoboda | 342 | } |
343 | |||
4212 | decky | 344 | /** Get number of characters in a string. |
4209 | svoboda | 345 | * |
4212 | decky | 346 | * @param str NULL-terminated string. |
4209 | svoboda | 347 | * |
4212 | decky | 348 | * @return Number of characters in string. |
4209 | svoboda | 349 | * |
350 | */ |
||
4212 | decky | 351 | count_t str_length(const char *str) |
4209 | svoboda | 352 | { |
4212 | decky | 353 | count_t len = 0; |
354 | size_t offset = 0; |
||
355 | |||
356 | while (str_decode(str, &offset, STR_NO_LIMIT) != 0) |
||
357 | len++; |
||
358 | |||
359 | return len; |
||
4209 | svoboda | 360 | } |
361 | |||
4212 | decky | 362 | /** Get number of characters in a wide string. |
4179 | decky | 363 | * |
4212 | decky | 364 | * @param str NULL-terminated wide string. |
4179 | decky | 365 | * |
4212 | decky | 366 | * @return Number of characters in @a str. |
367 | * |
||
4179 | decky | 368 | */ |
4212 | decky | 369 | count_t wstr_length(const wchar_t *wstr) |
4179 | decky | 370 | { |
4212 | decky | 371 | count_t len = 0; |
4179 | decky | 372 | |
4212 | decky | 373 | while (*wstr++ != 0) |
374 | len++; |
||
375 | |||
376 | return len; |
||
4179 | decky | 377 | } |
378 | |||
4212 | decky | 379 | /** Get number of characters in a string with size limit. |
4179 | decky | 380 | * |
4212 | decky | 381 | * @param str NULL-terminated string. |
382 | * @param size Maximum number of bytes to consider. |
||
383 | * |
||
384 | * @return Number of characters in string. |
||
385 | * |
||
4179 | decky | 386 | */ |
4212 | decky | 387 | count_t str_nlength(const char *str, size_t size) |
4179 | decky | 388 | { |
4212 | decky | 389 | count_t len = 0; |
390 | size_t offset = 0; |
||
4179 | decky | 391 | |
4212 | decky | 392 | while (str_decode(str, &offset, size) != 0) |
393 | len++; |
||
394 | |||
395 | return len; |
||
4179 | decky | 396 | } |
397 | |||
4212 | decky | 398 | /** Get number of characters in a string with size limit. |
4179 | decky | 399 | * |
4212 | decky | 400 | * @param str NULL-terminated string. |
401 | * @param size Maximum number of bytes to consider. |
||
4179 | decky | 402 | * |
4205 | svoboda | 403 | * @return Number of characters in string. |
4212 | decky | 404 | * |
4179 | decky | 405 | */ |
4212 | decky | 406 | count_t wstr_nlength(const wchar_t *str, size_t size) |
4179 | decky | 407 | { |
4205 | svoboda | 408 | count_t len = 0; |
4212 | decky | 409 | count_t limit = ALIGN_DOWN(size, sizeof(wchar_t)); |
410 | count_t offset = 0; |
||
411 | |||
412 | while ((offset < limit) && (*str++ != 0)) { |
||
4205 | svoboda | 413 | len++; |
4212 | decky | 414 | offset += sizeof(wchar_t); |
4179 | decky | 415 | } |
4212 | decky | 416 | |
4205 | svoboda | 417 | return len; |
4011 | svoboda | 418 | } |
419 | |||
4212 | decky | 420 | /** Check whether character is plain ASCII. |
4179 | decky | 421 | * |
4212 | decky | 422 | * @return True if character is plain ASCII. |
423 | * |
||
4179 | decky | 424 | */ |
4212 | decky | 425 | bool ascii_check(const wchar_t ch) |
4179 | decky | 426 | { |
4212 | decky | 427 | if ((ch >= 0) && (ch <= 127)) |
428 | return true; |
||
429 | |||
430 | return false; |
||
431 | } |
||
4205 | svoboda | 432 | |
4212 | decky | 433 | /** Check whether character is valid |
434 | * |
||
435 | * @return True if character is a valid Unicode code point. |
||
436 | * |
||
437 | */ |
||
438 | bool chr_check(const wchar_t ch) |
||
439 | { |
||
440 | if ((ch >= 0) && (ch <= 1114111)) |
||
441 | return true; |
||
442 | |||
443 | return false; |
||
4179 | decky | 444 | } |
445 | |||
4212 | decky | 446 | /** Compare two NULL terminated strings. |
4011 | svoboda | 447 | * |
4212 | decky | 448 | * Do a char-by-char comparison of two NULL-terminated strings. |
4011 | svoboda | 449 | * The strings are considered equal iff they consist of the same |
450 | * characters on the minimum of their lengths. |
||
451 | * |
||
4212 | decky | 452 | * @param s1 First string to compare. |
453 | * @param s2 Second string to compare. |
||
4011 | svoboda | 454 | * |
4212 | decky | 455 | * @return 0 if the strings are equal, -1 if first is smaller, |
456 | * 1 if second smaller. |
||
4011 | svoboda | 457 | * |
458 | */ |
||
4212 | decky | 459 | int str_cmp(const char *s1, const char *s2) |
4011 | svoboda | 460 | { |
4212 | decky | 461 | wchar_t c1; |
462 | wchar_t c2; |
||
463 | |||
464 | size_t off1 = 0; |
||
465 | size_t off2 = 0; |
||
466 | |||
467 | while ((c1 = str_decode(s1, &off1, STR_NO_LIMIT) != 0) |
||
468 | && (c2 = str_decode(s2, &off2, STR_NO_LIMIT) != 0)) { |
||
469 | |||
470 | if (off1 != off2) |
||
471 | break; |
||
472 | |||
473 | if (c1 < c2) |
||
4011 | svoboda | 474 | return -1; |
4212 | decky | 475 | |
476 | if (c1 > c2) |
||
4011 | svoboda | 477 | return 1; |
478 | } |
||
4212 | decky | 479 | |
480 | if ((off1 == off2) && (c1 == c2)) |
||
4011 | svoboda | 481 | return 0; |
4014 | decky | 482 | |
4212 | decky | 483 | if ((c1 == 0) || (off1 < off2)) |
4011 | svoboda | 484 | return -1; |
4014 | decky | 485 | |
4011 | svoboda | 486 | return 1; |
487 | } |
||
488 | |||
4212 | decky | 489 | /** Compare two NULL terminated strings with length limit. |
4011 | svoboda | 490 | * |
4212 | decky | 491 | * Do a char-by-char comparison of two NULL-terminated strings. |
4011 | svoboda | 492 | * The strings are considered equal iff they consist of the same |
4212 | decky | 493 | * characters on the minimum of their lengths and the length limit. |
4011 | svoboda | 494 | * |
4212 | decky | 495 | * @param s1 First string to compare. |
496 | * @param s2 Second string to compare. |
||
497 | * @param max_len Maximum number of characters to consider. |
||
4011 | svoboda | 498 | * |
4212 | decky | 499 | * @return 0 if the strings are equal, -1 if first is smaller, |
500 | * 1 if second smaller. |
||
501 | * |
||
4011 | svoboda | 502 | */ |
4212 | decky | 503 | int str_lcmp(const char *s1, const char *s2, count_t max_len) |
4011 | svoboda | 504 | { |
4212 | decky | 505 | wchar_t c1 = 0; |
506 | wchar_t c2 = 0; |
||
4011 | svoboda | 507 | |
4212 | decky | 508 | size_t off1 = 0; |
509 | size_t off2 = 0; |
||
510 | |||
511 | count_t len = 0; |
||
512 | |||
513 | while ((len < max_len) |
||
514 | && ((c1 = str_decode(s1, &off1, STR_NO_LIMIT)) != 0) |
||
515 | && ((c2 = str_decode(s2, &off2, STR_NO_LIMIT)) != 0)) { |
||
516 | |||
517 | if (off1 != off2) |
||
518 | break; |
||
519 | |||
520 | if (c1 < c2) |
||
4011 | svoboda | 521 | return -1; |
4014 | decky | 522 | |
4212 | decky | 523 | if (c1 > c2) |
4011 | svoboda | 524 | return 1; |
4212 | decky | 525 | |
526 | len++; |
||
4011 | svoboda | 527 | } |
4014 | decky | 528 | |
4212 | decky | 529 | if ((off1 == off2) && (len == max_len) && (c1 == c2)) |
4011 | svoboda | 530 | return 0; |
4014 | decky | 531 | |
4212 | decky | 532 | if ((c1 == 0) || (off1 < off2)) |
4011 | svoboda | 533 | return -1; |
4014 | decky | 534 | |
4011 | svoboda | 535 | return 1; |
536 | } |
||
537 | |||
4212 | decky | 538 | /** Copy NULL-terminated string. |
539 | * |
||
540 | * Copy source string @a src to destination buffer @a dst. |
||
541 | * No more than @a size bytes are written. NULL-terminator is always |
||
542 | * written after the last succesfully copied character (i.e. if the |
||
543 | * destination buffer is has at least 1 byte, it will be always |
||
544 | * NULL-terminated). |
||
545 | * |
||
546 | * @param src Source string. |
||
547 | * @param dst Destination buffer. |
||
548 | * @param count Size of the destination buffer. |
||
549 | * |
||
550 | */ |
||
551 | void str_ncpy(char *dst, const char *src, size_t size) |
||
552 | { |
||
553 | /* No space for the NULL-terminator in the buffer */ |
||
554 | if (size == 0) |
||
555 | return; |
||
556 | |||
557 | wchar_t ch; |
||
558 | size_t str_off = 0; |
||
559 | size_t dst_off = 0; |
||
560 | |||
561 | while ((ch = str_decode(src, &str_off, STR_NO_LIMIT) != 0)) { |
||
562 | if (chr_encode(ch, dst, &dst_off, size) != EOK) |
||
563 | break; |
||
564 | } |
||
565 | |||
566 | if (dst_off >= size) |
||
567 | dst[size - 1] = 0; |
||
568 | else |
||
569 | dst[dst_off] = 0; |
||
570 | } |
||
4011 | svoboda | 571 | |
4212 | decky | 572 | /** Copy NULL-terminated wide string to string |
4011 | svoboda | 573 | * |
4212 | decky | 574 | * Copy source wide string @a src to destination buffer @a dst. |
575 | * No more than @a size bytes are written. NULL-terminator is always |
||
576 | * written after the last succesfully copied character (i.e. if the |
||
577 | * destination buffer is has at least 1 byte, it will be always |
||
578 | * NULL-terminated). |
||
4011 | svoboda | 579 | * |
4212 | decky | 580 | * @param src Source wide string. |
581 | * @param dst Destination buffer. |
||
582 | * @param count Size of the destination buffer. |
||
583 | * |
||
4011 | svoboda | 584 | */ |
4212 | decky | 585 | void wstr_nstr(char *dst, const wchar_t *src, size_t size) |
4011 | svoboda | 586 | { |
4212 | decky | 587 | /* No space for the NULL-terminator in the buffer */ |
588 | if (size == 0) |
||
589 | return; |
||
4014 | decky | 590 | |
4212 | decky | 591 | wchar_t ch; |
592 | count_t src_idx = 0; |
||
593 | size_t dst_off = 0; |
||
594 | |||
595 | while ((ch = src[src_idx++]) != 0) { |
||
596 | if (chr_encode(ch, dst, &dst_off, size) != EOK) |
||
597 | break; |
||
4011 | svoboda | 598 | } |
4014 | decky | 599 | |
4212 | decky | 600 | if (dst_off >= size) |
601 | dst[size - 1] = 0; |
||
602 | else |
||
603 | dst[dst_off] = 0; |
||
4011 | svoboda | 604 | } |
605 | |||
4012 | svoboda | 606 | /** Find first occurence of character in string. |
607 | * |
||
4212 | decky | 608 | * @param str String to search. |
609 | * @param ch Character to look for. |
||
4012 | svoboda | 610 | * |
4212 | decky | 611 | * @return Pointer to character in @a str or NULL if not found. |
612 | * |
||
4012 | svoboda | 613 | */ |
4212 | decky | 614 | const char *str_chr(const char *str, wchar_t ch) |
4012 | svoboda | 615 | { |
4212 | decky | 616 | wchar_t acc; |
617 | size_t off = 0; |
||
618 | |||
619 | while ((acc = str_decode(str, &off, STR_NO_LIMIT) != 0)) { |
||
620 | if (acc == ch) |
||
621 | return (str + off); |
||
4012 | svoboda | 622 | } |
4014 | decky | 623 | |
4012 | svoboda | 624 | return NULL; |
625 | } |
||
626 | |||
4212 | decky | 627 | /** Insert a wide character into a wide string. |
628 | * |
||
629 | * Insert a wide character into a wide string at position |
||
630 | * @a pos. The characters after the position are shifted. |
||
631 | * |
||
632 | * @param str String to insert to. |
||
633 | * @param ch Character to insert to. |
||
634 | * @param pos Character index where to insert. |
||
635 | @ @param max_pos Characters in the buffer. |
||
636 | * |
||
637 | * @return True if the insertion was sucessful, false if the position |
||
638 | * is out of bounds. |
||
639 | * |
||
640 | */ |
||
641 | bool wstr_linsert(wchar_t *str, wchar_t ch, count_t pos, count_t max_pos) |
||
642 | { |
||
643 | count_t len = wstr_length(str); |
||
644 | |||
645 | if ((pos > len) || (pos + 1 > max_pos)) |
||
646 | return false; |
||
647 | |||
648 | count_t i; |
||
649 | for (i = len; i + 1 > pos; i--) |
||
650 | str[i + 1] = str[i]; |
||
651 | |||
652 | str[pos] = ch; |
||
653 | |||
654 | return true; |
||
655 | } |
||
656 | |||
657 | /** Remove a wide character from a wide string. |
||
658 | * |
||
659 | * Remove a wide character from a wide string at position |
||
660 | * @a pos. The characters after the position are shifted. |
||
661 | * |
||
662 | * @param str String to remove from. |
||
663 | * @param pos Character index to remove. |
||
664 | * |
||
665 | * @return True if the removal was sucessful, false if the position |
||
666 | * is out of bounds. |
||
667 | * |
||
668 | */ |
||
669 | bool wstr_remove(wchar_t *str, count_t pos) |
||
670 | { |
||
671 | count_t len = wstr_length(str); |
||
672 | |||
673 | if (pos >= len) |
||
674 | return false; |
||
675 | |||
676 | count_t i; |
||
677 | for (i = pos + 1; i <= len; i++) |
||
678 | str[i - 1] = str[i]; |
||
679 | |||
680 | return true; |
||
681 | } |
||
682 | |||
4011 | svoboda | 683 | /** @} |
684 | */ |