Rev 1264 | Rev 1708 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 1264 | Rev 1702 | ||
---|---|---|---|
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 |
|
- | 30 | * @{ |
|
- | 31 | */ |
|
- | 32 | ||
29 | /** |
33 | /** |
30 | * @file func.c |
34 | * @file |
31 | * @brief Miscellaneous functions. |
35 | * @brief Miscellaneous functions. |
32 | */ |
36 | */ |
33 | 37 | ||
34 | #include <func.h> |
38 | #include <func.h> |
35 | #include <print.h> |
39 | #include <print.h> |
36 | #include <cpu.h> |
40 | #include <cpu.h> |
37 | #include <arch/asm.h> |
41 | #include <arch/asm.h> |
38 | #include <arch.h> |
42 | #include <arch.h> |
39 | #include <typedefs.h> |
43 | #include <typedefs.h> |
40 | #include <console/kconsole.h> |
44 | #include <console/kconsole.h> |
41 | 45 | ||
42 | atomic_t haltstate = {0}; /**< Halt flag */ |
46 | atomic_t haltstate = {0}; /**< Halt flag */ |
43 | 47 | ||
44 | 48 | ||
45 | /** Halt wrapper |
49 | /** Halt wrapper |
46 | * |
50 | * |
47 | * Set halt flag and halt the cpu. |
51 | * Set halt flag and halt the cpu. |
48 | * |
52 | * |
49 | */ |
53 | */ |
50 | void halt() |
54 | void halt() |
51 | { |
55 | { |
52 | #ifdef CONFIG_DEBUG |
56 | #ifdef CONFIG_DEBUG |
53 | bool rundebugger = false; |
57 | bool rundebugger = false; |
54 | 58 | ||
55 | // TODO test_and_set not defined on all arches |
59 | // TODO test_and_set not defined on all arches |
56 | // if (!test_and_set(&haltstate)) |
60 | // if (!test_and_set(&haltstate)) |
57 | if (!atomic_get(&haltstate)) { |
61 | if (!atomic_get(&haltstate)) { |
58 | atomic_set(&haltstate, 1); |
62 | atomic_set(&haltstate, 1); |
59 | rundebugger = true; |
63 | rundebugger = true; |
60 | } |
64 | } |
61 | #else |
65 | #else |
62 | atomic_set(&haltstate, 1); |
66 | atomic_set(&haltstate, 1); |
63 | #endif |
67 | #endif |
64 | 68 | ||
65 | interrupts_disable(); |
69 | interrupts_disable(); |
66 | #ifdef CONFIG_DEBUG |
70 | #ifdef CONFIG_DEBUG |
67 | if (rundebugger) { |
71 | if (rundebugger) { |
68 | printf("\n"); |
72 | printf("\n"); |
69 | kconsole("panic"); /* Run kconsole as a last resort to user */ |
73 | kconsole("panic"); /* Run kconsole as a last resort to user */ |
70 | } |
74 | } |
71 | #endif |
75 | #endif |
72 | if (CPU) |
76 | if (CPU) |
73 | printf("cpu%d: halted\n", CPU->id); |
77 | printf("cpu%d: halted\n", CPU->id); |
74 | else |
78 | else |
75 | printf("cpu: halted\n"); |
79 | printf("cpu: halted\n"); |
76 | cpu_halt(); |
80 | cpu_halt(); |
77 | } |
81 | } |
78 | 82 | ||
79 | /** Return number of characters in a string. |
83 | /** Return number of characters in a string. |
80 | * |
84 | * |
81 | * @param str NULL terminated string. |
85 | * @param str NULL terminated string. |
82 | * |
86 | * |
83 | * @return Number of characters in str. |
87 | * @return Number of characters in str. |
84 | */ |
88 | */ |
85 | size_t strlen(const char *str) |
89 | size_t strlen(const char *str) |
86 | { |
90 | { |
87 | int i; |
91 | int i; |
88 | 92 | ||
89 | for (i = 0; str[i]; i++) |
93 | for (i = 0; str[i]; i++) |
90 | ; |
94 | ; |
91 | 95 | ||
92 | return i; |
96 | return i; |
93 | } |
97 | } |
94 | 98 | ||
95 | /** Compare two NULL terminated strings |
99 | /** Compare two NULL terminated strings |
96 | * |
100 | * |
97 | * Do a char-by-char comparison of two NULL terminated strings. |
101 | * Do a char-by-char comparison of two NULL terminated strings. |
98 | * The strings are considered equal iff they consist of the same |
102 | * The strings are considered equal iff they consist of the same |
99 | * characters on the minimum of their lengths and specified maximal |
103 | * characters on the minimum of their lengths and specified maximal |
100 | * length. |
104 | * length. |
101 | * |
105 | * |
102 | * @param src First string to compare. |
106 | * @param src First string to compare. |
103 | * @param dst Second string to compare. |
107 | * @param dst Second string to compare. |
104 | * @param len Maximal length for comparison. |
108 | * @param len Maximal length for comparison. |
105 | * |
109 | * |
106 | * @return 0 if the strings are equal, -1 if first is smaller, 1 if second smaller. |
110 | * @return 0 if the strings are equal, -1 if first is smaller, 1 if second smaller. |
107 | * |
111 | * |
108 | */ |
112 | */ |
109 | int strncmp(const char *src, const char *dst, size_t len) |
113 | int strncmp(const char *src, const char *dst, size_t len) |
110 | { |
114 | { |
111 | int i; |
115 | int i; |
112 | 116 | ||
113 | i = 0; |
117 | i = 0; |
114 | for (;*src && *dst && i < len;src++,dst++,i++) { |
118 | for (;*src && *dst && i < len;src++,dst++,i++) { |
115 | if (*src < *dst) |
119 | if (*src < *dst) |
116 | return -1; |
120 | return -1; |
117 | if (*src > *dst) |
121 | if (*src > *dst) |
118 | return 1; |
122 | return 1; |
119 | } |
123 | } |
120 | if (i == len || *src == *dst) |
124 | if (i == len || *src == *dst) |
121 | return 0; |
125 | return 0; |
122 | if (!*src) |
126 | if (!*src) |
123 | return -1; |
127 | return -1; |
124 | return 1; |
128 | return 1; |
125 | } |
129 | } |
126 | 130 | ||
127 | /** Copy NULL terminated string. |
131 | /** Copy NULL terminated string. |
128 | * |
132 | * |
129 | * Copy at most 'len' characters from string 'src' to 'dest'. |
133 | * Copy at most 'len' characters from string 'src' to 'dest'. |
130 | * If 'src' is shorter than 'len', '\0' is inserted behind the |
134 | * If 'src' is shorter than 'len', '\0' is inserted behind the |
131 | * last copied character. |
135 | * last copied character. |
132 | * |
136 | * |
133 | * @param src Source string. |
137 | * @param src Source string. |
134 | * @param dst Destination buffer. |
138 | * @param dst Destination buffer. |
135 | * @param len Size of destination buffer. |
139 | * @param len Size of destination buffer. |
136 | */ |
140 | */ |
137 | void strncpy(char *dest, const char *src, size_t len) |
141 | void strncpy(char *dest, const char *src, size_t len) |
138 | { |
142 | { |
139 | int i; |
143 | int i; |
140 | for (i = 0; i < len; i++) { |
144 | for (i = 0; i < len; i++) { |
141 | if (!(dest[i] = src[i])) |
145 | if (!(dest[i] = src[i])) |
142 | return; |
146 | return; |
143 | } |
147 | } |
144 | dest[i-1] = '\0'; |
148 | dest[i-1] = '\0'; |
145 | } |
149 | } |
146 | 150 | ||
147 | /** Convert ascii representation to __native |
151 | /** Convert ascii representation to __native |
148 | * |
152 | * |
149 | * Supports 0x for hexa & 0 for octal notation. |
153 | * Supports 0x for hexa & 0 for octal notation. |
150 | * Does not check for overflows, does not support negative numbers |
154 | * Does not check for overflows, does not support negative numbers |
151 | * |
155 | * |
152 | * @param text Textual representation of number |
156 | * @param text Textual representation of number |
153 | * @return Converted number or 0 if no valid number ofund |
157 | * @return Converted number or 0 if no valid number ofund |
154 | */ |
158 | */ |
155 | __native atoi(const char *text) |
159 | __native atoi(const char *text) |
156 | { |
160 | { |
157 | int base = 10; |
161 | int base = 10; |
158 | __native result = 0; |
162 | __native result = 0; |
159 | 163 | ||
160 | if (text[0] == '0' && text[1] == 'x') { |
164 | if (text[0] == '0' && text[1] == 'x') { |
161 | base = 16; |
165 | base = 16; |
162 | text += 2; |
166 | text += 2; |
163 | } else if (text[0] == '0') |
167 | } else if (text[0] == '0') |
164 | base = 8; |
168 | base = 8; |
165 | 169 | ||
166 | while (*text) { |
170 | while (*text) { |
167 | if (base != 16 && \ |
171 | if (base != 16 && \ |
168 | ((*text >= 'A' && *text <= 'F' ) |
172 | ((*text >= 'A' && *text <= 'F' ) |
169 | || (*text >='a' && *text <='f'))) |
173 | || (*text >='a' && *text <='f'))) |
170 | break; |
174 | break; |
171 | if (base == 8 && *text >='8') |
175 | if (base == 8 && *text >='8') |
172 | break; |
176 | break; |
173 | 177 | ||
174 | if (*text >= '0' && *text <= '9') { |
178 | if (*text >= '0' && *text <= '9') { |
175 | result *= base; |
179 | result *= base; |
176 | result += *text - '0'; |
180 | result += *text - '0'; |
177 | } else if (*text >= 'A' && *text <= 'F') { |
181 | } else if (*text >= 'A' && *text <= 'F') { |
178 | result *= base; |
182 | result *= base; |
179 | result += *text - 'A' + 10; |
183 | result += *text - 'A' + 10; |
180 | } else if (*text >= 'a' && *text <= 'f') { |
184 | } else if (*text >= 'a' && *text <= 'f') { |
181 | result *= base; |
185 | result *= base; |
182 | result += *text - 'a' + 10; |
186 | result += *text - 'a' + 10; |
183 | } else |
187 | } else |
184 | break; |
188 | break; |
185 | text++; |
189 | text++; |
186 | } |
190 | } |
187 | 191 | ||
188 | return result; |
192 | return result; |
189 | } |
193 | } |
- | 194 | ||
- | 195 | /** @} |
|
- | 196 | */ |
|
- | 197 | ||
190 | 198 |