Subversion Repositories HelenOS

Rev

Rev 2927 | Rev 4337 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
1 jermar 1
/*
2071 jermar 2
 * Copyright (c) 2001-2004 Jakub Jermar
1 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
 
1757 jermar 29
/** @addtogroup generic
1702 cejka 30
 * @{
31
 */
32
 
1264 jermar 33
/**
1702 cejka 34
 * @file
1264 jermar 35
 * @brief   Miscellaneous functions.
36
 */
37
 
1 jermar 38
#include <func.h>
39
#include <print.h>
40
#include <cpu.h>
41
#include <arch/asm.h>
42
#include <arch.h>
607 palkovsky 43
#include <console/kconsole.h>
1 jermar 44
 
631 palkovsky 45
atomic_t haltstate = {0}; /**< Halt flag */
1 jermar 46
 
62 decky 47
 
48
/** Halt wrapper
49
 *
50
 * Set halt flag and halt the cpu.
51
 *
52
 */
631 palkovsky 53
void halt()
1 jermar 54
{
631 palkovsky 55
#ifdef CONFIG_DEBUG
659 jermar 56
    bool rundebugger = false;
631 palkovsky 57
 
58
//      TODO test_and_set not defined on all arches
59
//  if (!test_and_set(&haltstate))
60
    if (!atomic_get(&haltstate)) {
61
        atomic_set(&haltstate, 1);
62
        rundebugger = true;
63
    }
64
#else
1100 palkovsky 65
    atomic_set(&haltstate, 1);
631 palkovsky 66
#endif
67
 
413 jermar 68
    interrupts_disable();
607 palkovsky 69
#ifdef CONFIG_DEBUG
631 palkovsky 70
    if (rundebugger) {
71
        printf("\n");
72
        kconsole("panic"); /* Run kconsole as a last resort to user */
73
    }
607 palkovsky 74
#endif      
227 jermar 75
    if (CPU)
3149 svoboda 76
        printf("cpu%u: halted\n", CPU->id);
227 jermar 77
    else
78
        printf("cpu: halted\n");
1 jermar 79
    cpu_halt();
80
}
81
 
517 jermar 82
/** Return number of characters in a string.
83
 *
84
 * @param str NULL terminated string.
85
 *
86
 * @return Number of characters in str.
87
 */
88
size_t strlen(const char *str)
89
{
90
    int i;
91
 
92
    for (i = 0; str[i]; i++)
93
        ;
94
 
95
    return i;
96
}
1 jermar 97
 
62 decky 98
/** Compare two NULL terminated strings
99
 *
517 jermar 100
 * Do a char-by-char comparison of two NULL terminated strings.
101
 * The strings are considered equal iff they consist of the same
1896 jermar 102
 * characters on the minimum of their lengths.
103
 *
104
 * @param src First string to compare.
105
 * @param dst Second string to compare.
106
 *
107
 * @return 0 if the strings are equal, -1 if first is smaller, 1 if second smaller.
108
 *
109
 */
110
int strcmp(const char *src, const char *dst)
111
{
112
    for (; *src && *dst; src++, dst++) {
113
        if (*src < *dst)
114
            return -1;
115
        if (*src > *dst)
116
            return 1;
117
    }
118
    if (*src == *dst)
119
        return 0;
120
    if (!*src)
121
        return -1;
122
    return 1;
123
}
124
 
125
 
126
/** Compare two NULL terminated strings
127
 *
128
 * Do a char-by-char comparison of two NULL terminated strings.
129
 * The strings are considered equal iff they consist of the same
517 jermar 130
 * characters on the minimum of their lengths and specified maximal
131
 * length.
62 decky 132
 *
133
 * @param src First string to compare.
134
 * @param dst Second string to compare.
517 jermar 135
 * @param len Maximal length for comparison.
62 decky 136
 *
601 palkovsky 137
 * @return 0 if the strings are equal, -1 if first is smaller, 1 if second smaller.
62 decky 138
 *
1 jermar 139
 */
518 jermar 140
int strncmp(const char *src, const char *dst, size_t len)
1 jermar 141
{
2745 decky 142
    unsigned int i;
1 jermar 143
 
2745 decky 144
    for (i = 0; (*src) && (*dst) && (i < len); src++, dst++, i++) {
601 palkovsky 145
        if (*src < *dst)
146
            return -1;
147
        if (*src > *dst)
148
            return 1;
1 jermar 149
    }
601 palkovsky 150
    if (i == len || *src == *dst)
151
        return 0;
635 palkovsky 152
    if (!*src)
601 palkovsky 153
        return -1;
1 jermar 154
    return 1;
155
}
331 bondari 156
 
1896 jermar 157
 
158
 
518 jermar 159
/** Copy NULL terminated string.
160
 *
161
 * Copy at most 'len' characters from string 'src' to 'dest'.
162
 * If 'src' is shorter than 'len', '\0' is inserted behind the
163
 * last copied character.
164
 *
165
 * @param src Source string.
1708 jermar 166
 * @param dest Destination buffer.
518 jermar 167
 * @param len Size of destination buffer.
168
 */
169
void strncpy(char *dest, const char *src, size_t len)
170
{
2745 decky 171
    unsigned int i;
518 jermar 172
    for (i = 0; i < len; i++) {
173
        if (!(dest[i] = src[i]))
174
            return;
175
    }
585 palkovsky 176
    dest[i-1] = '\0';
518 jermar 177
}
582 palkovsky 178
 
1780 jermar 179
/** Convert ascii representation to unative_t
582 palkovsky 180
 *
181
 * Supports 0x for hexa & 0 for octal notation.
182
 * Does not check for overflows, does not support negative numbers
183
 *
184
 * @param text Textual representation of number
185
 * @return Converted number or 0 if no valid number ofund
186
 */
1780 jermar 187
unative_t atoi(const char *text)
582 palkovsky 188
{
189
    int base = 10;
1780 jermar 190
    unative_t result = 0;
582 palkovsky 191
 
192
    if (text[0] == '0' && text[1] == 'x') {
193
        base = 16;
194
        text += 2;
195
    } else if (text[0] == '0')
196
        base = 8;
197
 
198
    while (*text) {
603 palkovsky 199
        if (base != 16 && \
200
            ((*text >= 'A' && *text <= 'F' )
201
             || (*text >='a' && *text <='f')))
582 palkovsky 202
            break;
203
        if (base == 8 && *text >='8')
204
            break;
205
 
591 palkovsky 206
        if (*text >= '0' && *text <= '9') {
207
            result *= base;
582 palkovsky 208
            result += *text - '0';
591 palkovsky 209
        } else if (*text >= 'A' && *text <= 'F') {
210
            result *= base;
582 palkovsky 211
            result += *text - 'A' + 10;
603 palkovsky 212
        } else if (*text >= 'a' && *text <= 'f') {
213
            result *= base;
214
            result += *text - 'a' + 10;
591 palkovsky 215
        } else
582 palkovsky 216
            break;
217
        text++;
218
    }
219
 
220
    return result;
221
}
1702 cejka 222
 
2050 decky 223
 
224
void order(const uint64_t val, uint64_t *rv, char *suffix)
225
{
2184 decky 226
    if (val > 10000000000000000000ULL) {
227
        *rv = val / 1000000000000000000ULL;
228
        *suffix = 'Z';
229
    } else if (val > 1000000000000000000ULL) {
230
        *rv = val / 1000000000000000ULL;
2050 decky 231
        *suffix = 'E';
2184 decky 232
    } else if (val > 1000000000000000ULL) {
233
        *rv = val / 1000000000000ULL;
2050 decky 234
        *suffix = 'T';
2184 decky 235
    } else if (val > 1000000000000ULL) {
236
        *rv = val / 1000000000ULL;
2104 decky 237
        *suffix = 'G';
2184 decky 238
    } else if (val > 1000000000ULL) {
239
        *rv = val / 1000000ULL;
2050 decky 240
        *suffix = 'M';
2184 decky 241
    } else if (val > 1000000ULL) {
242
        *rv = val / 1000ULL;
2104 decky 243
        *suffix = 'k';
2050 decky 244
    } else {
245
        *rv = val;
246
        *suffix = ' ';
247
    }
248
}
249
 
1757 jermar 250
/** @}
1702 cejka 251
 */