Subversion Repositories HelenOS

Rev

Rev 4205 | Rev 4208 | 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
4014 decky 35
 * @brief Miscellaneous functions.
4011 svoboda 36
 */
37
 
38
#include <string.h>
39
#include <print.h>
40
#include <cpu.h>
41
#include <arch/asm.h>
42
#include <arch.h>
43
#include <console/kconsole.h>
44
 
4179 decky 45
char invalch = '?';
46
 
4198 svoboda 47
/** Byte mask consisting of lowest @n bits (out of eight). */
4196 svoboda 48
#define LO_MASK_8(n) ((uint8_t)((1 << (n)) - 1))
49
 
4198 svoboda 50
/** Byte mask consisting of lowest @n bits (out of 32). */
51
#define LO_MASK_32(n) ((uint32_t)((1 << (n)) - 1))
52
 
53
/** Byte mask consisting of highest @n bits (out of eight). */
54
#define HI_MASK_8(n) (~LO_MASK_8(8 - (n)))
55
 
4196 svoboda 56
/** Number of data bits in a UTF-8 continuation byte. */
57
#define CONT_BITS 6
58
 
4200 svoboda 59
/** Decode a single character from a substring.
4175 decky 60
 *
4200 svoboda 61
 * Decode a single character from a substring of size @a sz. Decoding starts
62
 * at @a offset and this offset is moved to the beginning of the next
63
 * character. In case of decoding error, offset generally advances at least
64
 * by one. However, offset is never moved beyond (str + sz).
4175 decky 65
 *
4200 svoboda 66
 * @param str   String (not necessarily NULL-terminated).
4175 decky 67
 * @param index Index (counted in plain characters) where to start
68
 *              the decoding.
4200 svoboda 69
 * @param limit Size of the substring.
4175 decky 70
 *
4200 svoboda 71
 * @return  Value of decoded character or '?' on decoding error.
4175 decky 72
 */
4200 svoboda 73
wchar_t chr_decode(const char *str, size_t *offset, size_t sz)
4175 decky 74
{
4196 svoboda 75
    uint8_t b0, b;          /* Bytes read from str. */
76
    wchar_t ch;
77
 
78
    int b0_bits;        /* Data bits in first byte. */
79
    int cbytes;     /* Number of continuation bytes. */
80
 
4200 svoboda 81
    if (*offset + 1 > sz)
4179 decky 82
        return invalch;
4196 svoboda 83
 
4200 svoboda 84
    b0 = (uint8_t) str[(*offset)++];
4196 svoboda 85
 
86
    /* Determine code length. */
87
 
88
    if ((b0 & 0x80) == 0) {
89
        /* 0xxxxxxx (Plain ASCII) */
90
        b0_bits = 7;
91
        cbytes = 0;
92
    } else if ((b0 & 0xe0) == 0xc0) {
93
        /* 110xxxxx 10xxxxxx */
94
        b0_bits = 5;
95
        cbytes = 1;
96
    } else if ((b0 & 0xf0) == 0xe0) {
97
        /* 1110xxxx 10xxxxxx 10xxxxxx */
98
        b0_bits = 4;
99
        cbytes = 2;
100
    } else if ((b0 & 0xf8) == 0xf0) {
101
        /* 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx */
102
        b0_bits = 3;
103
        cbytes = 3;
104
    } else {
105
        /* 10xxxxxx -- unexpected continuation byte. */
106
        return invalch;
4179 decky 107
    }
4196 svoboda 108
 
4200 svoboda 109
    if (*offset + cbytes > sz) {
4196 svoboda 110
        return invalch;
4179 decky 111
    }
4196 svoboda 112
 
113
    ch = b0 & LO_MASK_8(b0_bits);
114
 
115
    /* Decode continuation bytes. */
116
    while (cbytes > 0) {
4200 svoboda 117
        b = (uint8_t) str[(*offset)++];
4196 svoboda 118
 
119
        /* Must be 10xxxxxx. */
120
        if ((b & 0xc0) != 0x80) {
4179 decky 121
            return invalch;
4196 svoboda 122
        }
123
 
124
        /* Shift data bits to ch. */
125
        ch = (ch << CONT_BITS) | (wchar_t) (b & LO_MASK_8(CONT_BITS));
126
        --cbytes;
4179 decky 127
    }
4196 svoboda 128
 
129
    return ch;
4175 decky 130
}
131
 
4200 svoboda 132
/** Encode a single character to string representation.
4011 svoboda 133
 *
4200 svoboda 134
 * Encode a single character to string representation (i.e. UTF-8) and store
135
 * it into a buffer at @a offset. Encoding starts at @a offset and this offset
136
 * is moved to the position where the next character can be written to.
4011 svoboda 137
 *
4200 svoboda 138
 * @param ch        Input character.
139
 * @param str       Output buffer.
140
 * @param offset    Offset (in bytes) where to start writing.
141
 * @param sz        Size of the output buffer.
4179 decky 142
 *
4200 svoboda 143
 * @return True if the character was encoded successfully or false if there
144
 *     was not enough space in the output buffer or the character code
145
 *     was invalid.
4179 decky 146
 */
4200 svoboda 147
bool chr_encode(const wchar_t ch, char *str, size_t *offset, size_t sz)
4179 decky 148
{
4198 svoboda 149
    uint32_t cc;        /* Unsigned version of ch. */
150
 
151
    int cbytes;     /* Number of continuation bytes. */
152
    int b0_bits;        /* Number of data bits in first byte. */
153
    int i;
154
 
4200 svoboda 155
    if (*offset >= sz)
4179 decky 156
        return false;
4198 svoboda 157
 
158
    if (ch < 0)
159
        return false;
160
 
161
    /* Bit operations should only be done on unsigned numbers. */
162
    cc = (uint32_t) ch;
163
 
164
    /* Determine how many continuation bytes are needed. */
165
    if ((cc & ~LO_MASK_32(7)) == 0) {
166
        b0_bits = 7;
167
        cbytes = 0;
168
    } else if ((cc & ~LO_MASK_32(11)) == 0) {
169
        b0_bits = 5;
170
        cbytes = 1;
171
    } else if ((cc & ~LO_MASK_32(16)) == 0) {
172
        b0_bits = 4;
173
        cbytes = 2;
174
    } else if ((cc & ~LO_MASK_32(21)) == 0) {
175
        b0_bits = 3;
176
        cbytes = 3;
177
    } else {
178
        /* Codes longer than 21 bits are not supported. */
179
        return false;
4179 decky 180
    }
4198 svoboda 181
 
182
    /* Check for available space in buffer. */
4200 svoboda 183
    if (*offset + cbytes >= sz)
4198 svoboda 184
        return false;
185
 
186
    /* Encode continuation bytes. */
187
    for (i = cbytes; i > 0; --i) {
4200 svoboda 188
        str[*offset + i] = 0x80 | (cc & LO_MASK_32(CONT_BITS));
4198 svoboda 189
        cc = cc >> CONT_BITS;
4179 decky 190
    }
4198 svoboda 191
 
192
    /* Encode first byte. */
4200 svoboda 193
    str[*offset] = (cc & LO_MASK_32(b0_bits)) | HI_MASK_8(8 - b0_bits - 1);
4198 svoboda 194
 
4200 svoboda 195
    /* Advance offset. */
196
    *offset += (1 + cbytes);
4179 decky 197
 
4198 svoboda 198
    return true;
4179 decky 199
}
200
 
4205 svoboda 201
/** Get size of string, with length limit.
4179 decky 202
 *
4205 svoboda 203
 * Get the number of bytes which are used by up to @a max_len first
204
 * characters in the string @a str. If @a max_len is greater than
205
 * the length of @a str, the entire string is measured.
4179 decky 206
 *
4205 svoboda 207
 * @param str   String to consider.
208
 * @param count Maximum number of characters to measure.
4179 decky 209
 *
210
 * @return Number of bytes used by the characters.
211
 */
4205 svoboda 212
size_t str_lsize(const char *str, count_t max_len)
4179 decky 213
{
4205 svoboda 214
    count_t len = 0;
215
    size_t cur = 0;
216
    size_t prev;
4199 svoboda 217
    wchar_t ch;
4205 svoboda 218
 
4199 svoboda 219
    while (true) {
4205 svoboda 220
        prev = cur;
221
        if (len >= max_len)
4199 svoboda 222
            break;
4205 svoboda 223
        ch = chr_decode(str, &cur, UTF8_NO_LIMIT);
4199 svoboda 224
        if (ch == '\0') break;
225
 
4205 svoboda 226
        len++;
4179 decky 227
    }
4205 svoboda 228
 
229
    return prev;
4179 decky 230
}
231
 
232
/** Check whether character is plain ASCII.
233
 *
234
 * @return True if character is plain ASCII.
235
 *
236
 */
237
bool ascii_check(const wchar_t ch)
238
{
239
    if ((ch >= 0) && (ch <= 127))
240
        return true;
241
 
242
    return false;
243
}
244
 
245
/** Check whether character is Unicode.
246
 *
247
 * @return True if character is valid Unicode code point.
248
 */
249
bool unicode_check(const wchar_t ch)
250
{
251
    if ((ch >= 0) && (ch <= 1114111))
252
        return true;
253
 
254
    return false;
255
}
256
 
4207 svoboda 257
/** Return number of bytes the string occupies.
4179 decky 258
 *
4207 svoboda 259
 * @param str A string.
260
 * @return Number of bytes in @a str excluding the null terminator.
4011 svoboda 261
 */
4207 svoboda 262
size_t str_size(const char *str)
4011 svoboda 263
{
4179 decky 264
    size_t size;
4207 svoboda 265
 
266
    size = 0;
267
    while (*str++ != '\0')
268
        ++size;
269
 
4179 decky 270
    return size;
271
}
272
 
4205 svoboda 273
/** Return number of characters in a string.
4179 decky 274
 *
4205 svoboda 275
 * @param str NULL-terminated string.
276
 * @return Number of characters in string.
4179 decky 277
 */
4205 svoboda 278
count_t str_length(const char *str)
4179 decky 279
{
4205 svoboda 280
    count_t len = 0;
281
    size_t offset = 0;
282
 
283
    while (chr_decode(str, &offset, UTF8_NO_LIMIT) != 0) {
284
        len++;
4179 decky 285
    }
4205 svoboda 286
 
287
    return len;
4011 svoboda 288
}
289
 
4205 svoboda 290
/** Return number of characters in a wide string.
4179 decky 291
 *
4205 svoboda 292
 * @param str NULL-terminated wide string.
293
 * @return Number of characters in @a str.
4179 decky 294
 */
4205 svoboda 295
count_t wstr_length(const wchar_t *wstr)
4179 decky 296
{
4205 svoboda 297
    count_t len;
298
 
299
    len = 0;
300
    while (*wstr++ != '\0')
301
        ++len;
302
 
303
    return len;
4179 decky 304
}
305
 
4011 svoboda 306
/** Compare two NULL terminated strings
307
 *
308
 * Do a char-by-char comparison of two NULL terminated strings.
309
 * The strings are considered equal iff they consist of the same
310
 * characters on the minimum of their lengths.
311
 *
312
 * @param src First string to compare.
313
 * @param dst Second string to compare.
314
 *
315
 * @return 0 if the strings are equal, -1 if first is smaller, 1 if second smaller.
316
 *
317
 */
318
int strcmp(const char *src, const char *dst)
319
{
320
    for (; *src && *dst; src++, dst++) {
321
        if (*src < *dst)
322
            return -1;
323
        if (*src > *dst)
324
            return 1;
325
    }
326
    if (*src == *dst)
327
        return 0;
4014 decky 328
 
4011 svoboda 329
    if (!*src)
330
        return -1;
4014 decky 331
 
4011 svoboda 332
    return 1;
333
}
334
 
335
 
336
/** Compare two NULL terminated strings
337
 *
338
 * Do a char-by-char comparison of two NULL terminated strings.
339
 * The strings are considered equal iff they consist of the same
340
 * characters on the minimum of their lengths and specified maximal
341
 * length.
342
 *
343
 * @param src First string to compare.
344
 * @param dst Second string to compare.
345
 * @param len Maximal length for comparison.
346
 *
347
 * @return 0 if the strings are equal, -1 if first is smaller, 1 if second smaller.
348
 */
349
int strncmp(const char *src, const char *dst, size_t len)
350
{
351
    unsigned int i;
352
 
353
    for (i = 0; (*src) && (*dst) && (i < len); src++, dst++, i++) {
354
        if (*src < *dst)
355
            return -1;
4014 decky 356
 
4011 svoboda 357
        if (*src > *dst)
358
            return 1;
359
    }
4014 decky 360
 
4011 svoboda 361
    if (i == len || *src == *dst)
362
        return 0;
4014 decky 363
 
4011 svoboda 364
    if (!*src)
365
        return -1;
4014 decky 366
 
4011 svoboda 367
    return 1;
368
}
369
 
370
 
371
 
372
/** Copy NULL terminated string.
373
 *
374
 * Copy at most 'len' characters from string 'src' to 'dest'.
375
 * If 'src' is shorter than 'len', '\0' is inserted behind the
376
 * last copied character.
377
 *
4014 decky 378
 * @param src  Source string.
4011 svoboda 379
 * @param dest Destination buffer.
4014 decky 380
 * @param len  Size of destination buffer.
4011 svoboda 381
 */
382
void strncpy(char *dest, const char *src, size_t len)
383
{
384
    unsigned int i;
4014 decky 385
 
4011 svoboda 386
    for (i = 0; i < len; i++) {
387
        if (!(dest[i] = src[i]))
388
            return;
389
    }
4014 decky 390
 
4011 svoboda 391
    dest[i - 1] = '\0';
392
}
393
 
4012 svoboda 394
/** Find first occurence of character in string.
395
 *
4014 decky 396
 * @param s String to search.
397
 * @param i Character to look for.
4012 svoboda 398
 *
4014 decky 399
 * @return Pointer to character in @a s or NULL if not found.
4012 svoboda 400
 */
401
extern char *strchr(const char *s, int i)
402
{
403
    while (*s != '\0') {
4014 decky 404
        if (*s == i)
405
            return (char *) s;
4012 svoboda 406
        ++s;
407
    }
4014 decky 408
 
4012 svoboda 409
    return NULL;
410
}
411
 
4011 svoboda 412
/** @}
413
 */