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