Subversion Repositories HelenOS-historic

Rev

Rev 601 | Rev 607 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 601 Rev 603
1
/*
1
/*
2
 * Copyright (C) 2001-2004 Jakub Jermar
2
 * Copyright (C) 2001-2004 Jakub Jermar
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
#include <func.h>
29
#include <func.h>
30
#include <print.h>
30
#include <print.h>
31
#include <cpu.h>
31
#include <cpu.h>
32
#include <arch/asm.h>
32
#include <arch/asm.h>
33
#include <arch.h>
33
#include <arch.h>
34
#include <typedefs.h>
34
#include <typedefs.h>
35
 
35
 
36
__u32   haltstate = 0; /**< Halt flag */
36
__u32   haltstate = 0; /**< Halt flag */
37
 
37
 
38
 
38
 
39
/** Halt wrapper
39
/** Halt wrapper
40
 *
40
 *
41
 * Set halt flag and halt the cpu.
41
 * Set halt flag and halt the cpu.
42
 *
42
 *
43
 */
43
 */
44
void halt(void)
44
void halt(void)
45
{
45
{
46
    haltstate = 1;
46
    haltstate = 1;
47
    interrupts_disable();
47
    interrupts_disable();
48
    if (CPU)
48
    if (CPU)
49
        printf("cpu%d: halted\n", CPU->id);
49
        printf("cpu%d: halted\n", CPU->id);
50
    else
50
    else
51
        printf("cpu: halted\n");
51
        printf("cpu: halted\n");
52
    cpu_halt();
52
    cpu_halt();
53
}
53
}
54
 
54
 
55
/** Return number of characters in a string.
55
/** Return number of characters in a string.
56
 *
56
 *
57
 * @param str NULL terminated string.
57
 * @param str NULL terminated string.
58
 *
58
 *
59
 * @return Number of characters in str.
59
 * @return Number of characters in str.
60
 */
60
 */
61
size_t strlen(const char *str)
61
size_t strlen(const char *str)
62
{
62
{
63
    int i;
63
    int i;
64
   
64
   
65
    for (i = 0; str[i]; i++)
65
    for (i = 0; str[i]; i++)
66
        ;
66
        ;
67
   
67
   
68
    return i;
68
    return i;
69
}
69
}
70
 
70
 
71
/** Compare two NULL terminated strings
71
/** Compare two NULL terminated strings
72
 *
72
 *
73
 * Do a char-by-char comparison of two NULL terminated strings.
73
 * Do a char-by-char comparison of two NULL terminated strings.
74
 * The strings are considered equal iff they consist of the same
74
 * The strings are considered equal iff they consist of the same
75
 * characters on the minimum of their lengths and specified maximal
75
 * characters on the minimum of their lengths and specified maximal
76
 * length.
76
 * length.
77
 *
77
 *
78
 * @param src First string to compare.
78
 * @param src First string to compare.
79
 * @param dst Second string to compare.
79
 * @param dst Second string to compare.
80
 * @param len Maximal length for comparison.
80
 * @param len Maximal length for comparison.
81
 *
81
 *
82
 * @return 0 if the strings are equal, -1 if first is smaller, 1 if second smaller.
82
 * @return 0 if the strings are equal, -1 if first is smaller, 1 if second smaller.
83
 *
83
 *
84
 */
84
 */
85
int strncmp(const char *src, const char *dst, size_t len)
85
int strncmp(const char *src, const char *dst, size_t len)
86
{
86
{
87
    int i;
87
    int i;
88
   
88
   
89
    i = 0;
89
    i = 0;
90
    for (;*src && *dst && i < len;src++,dst++,i++) {
90
    for (;*src && *dst && i < len;src++,dst++,i++) {
91
        if (*src < *dst)
91
        if (*src < *dst)
92
            return -1;
92
            return -1;
93
        if (*src > *dst)
93
        if (*src > *dst)
94
            return 1;
94
            return 1;
95
    }
95
    }
96
    if (i == len || *src == *dst)
96
    if (i == len || *src == *dst)
97
        return 0;
97
        return 0;
98
    if (*src < *dst)
98
    if (*src < *dst)
99
        return -1;
99
        return -1;
100
    return 1;
100
    return 1;
101
}
101
}
102
 
102
 
103
/** Copy NULL terminated string.
103
/** Copy NULL terminated string.
104
 *
104
 *
105
 * Copy at most 'len' characters from string 'src' to 'dest'.
105
 * Copy at most 'len' characters from string 'src' to 'dest'.
106
 * If 'src' is shorter than 'len', '\0' is inserted behind the
106
 * If 'src' is shorter than 'len', '\0' is inserted behind the
107
 * last copied character.
107
 * last copied character.
108
 *
108
 *
109
 * @param src Source string.
109
 * @param src Source string.
110
 * @param dst Destination buffer.
110
 * @param dst Destination buffer.
111
 * @param len Size of destination buffer.
111
 * @param len Size of destination buffer.
112
 */
112
 */
113
void strncpy(char *dest, const char *src, size_t len)
113
void strncpy(char *dest, const char *src, size_t len)
114
{
114
{
115
    int i;
115
    int i;
116
    for (i = 0; i < len; i++) {
116
    for (i = 0; i < len; i++) {
117
        if (!(dest[i] = src[i]))
117
        if (!(dest[i] = src[i]))
118
            return;
118
            return;
119
    }
119
    }
120
    dest[i-1] = '\0';
120
    dest[i-1] = '\0';
121
}
121
}
122
 
122
 
123
/** Convert ascii representation to __native
123
/** Convert ascii representation to __native
124
 *
124
 *
125
 * Supports 0x for hexa & 0 for octal notation.
125
 * Supports 0x for hexa & 0 for octal notation.
126
 * Does not check for overflows, does not support negative numbers
126
 * Does not check for overflows, does not support negative numbers
127
 *
127
 *
128
 * @param text Textual representation of number
128
 * @param text Textual representation of number
129
 * @return Converted number or 0 if no valid number ofund
129
 * @return Converted number or 0 if no valid number ofund
130
 */
130
 */
131
__native atoi(const char *text)
131
__native atoi(const char *text)
132
{
132
{
133
    int base = 10;
133
    int base = 10;
134
    __native result = 0;
134
    __native result = 0;
135
 
135
 
136
    if (text[0] == '0' && text[1] == 'x') {
136
    if (text[0] == '0' && text[1] == 'x') {
137
        base = 16;
137
        base = 16;
138
        text += 2;
138
        text += 2;
139
    } else if (text[0] == '0')
139
    } else if (text[0] == '0')
140
        base = 8;
140
        base = 8;
141
 
141
 
142
    while (*text) {
142
    while (*text) {
-
 
143
        if (base != 16 && \
143
        if (base != 16 && *text >= 'A' && *text <= 'F')
144
            ((*text >= 'A' && *text <= 'F' )
-
 
145
             || (*text >='a' && *text <='f')))
144
            break;
146
            break;
145
        if (base == 8 && *text >='8')
147
        if (base == 8 && *text >='8')
146
            break;
148
            break;
147
 
149
 
148
        if (*text >= '0' && *text <= '9') {
150
        if (*text >= '0' && *text <= '9') {
149
            result *= base;
151
            result *= base;
150
            result += *text - '0';
152
            result += *text - '0';
151
        } else if (*text >= 'A' && *text <= 'F') {
153
        } else if (*text >= 'A' && *text <= 'F') {
152
            result *= base;
154
            result *= base;
153
            result += *text - 'A' + 10;
155
            result += *text - 'A' + 10;
-
 
156
        } else if (*text >= 'a' && *text <= 'f') {
-
 
157
            result *= base;
-
 
158
            result += *text - 'a' + 10;
154
        } else
159
        } else
155
            break;
160
            break;
156
        text++;
161
        text++;
157
    }
162
    }
158
 
163
 
159
    return result;
164
    return result;
160
}
165
}
161
 
166