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