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