[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 | // TODO test_and_set not defined on all arches
|
---|
| 59 | // if (!test_and_set(&haltstate))
|
---|
| 60 | if (!atomic_get(&haltstate)) {
|
---|
| 61 | atomic_set(&haltstate, 1);
|
---|
| 62 | rundebugger = true;
|
---|
| 63 | }
|
---|
| 64 | #else
|
---|
[53f9821] | 65 | atomic_set(&haltstate, 1);
|
---|
[36e7ee98] | 66 | #endif
|
---|
| 67 |
|
---|
[22f7769] | 68 | interrupts_disable();
|
---|
[93b84b3] | 69 | #ifdef CONFIG_DEBUG
|
---|
[36e7ee98] | 70 | if (rundebugger) {
|
---|
| 71 | printf("\n");
|
---|
| 72 | kconsole("panic"); /* Run kconsole as a last resort to user */
|
---|
| 73 | }
|
---|
[93b84b3] | 74 | #endif
|
---|
[623ba26c] | 75 | if (CPU)
|
---|
| 76 | printf("cpu%d: halted\n", CPU->id);
|
---|
| 77 | else
|
---|
| 78 | printf("cpu: halted\n");
|
---|
[f761f1eb] | 79 | cpu_halt();
|
---|
| 80 | }
|
---|
| 81 |
|
---|
[ff3b3197] | 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 | }
|
---|
[f761f1eb] | 97 |
|
---|
[28ecadb] | 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 |
|
---|
[d34657e] | 126 | /** Compare two NULL terminated strings
|
---|
| 127 | *
|
---|
[ff3b3197] | 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.
|
---|
[d34657e] | 132 | *
|
---|
| 133 | * @param src First string to compare.
|
---|
| 134 | * @param dst Second string to compare.
|
---|
[ff3b3197] | 135 | * @param len Maximal length for comparison.
|
---|
[d34657e] | 136 | *
|
---|
[0c8e692] | 137 | * @return 0 if the strings are equal, -1 if first is smaller, 1 if second smaller.
|
---|
[d34657e] | 138 | *
|
---|
[f761f1eb] | 139 | */
|
---|
[f4338d2] | 140 | int strncmp(const char *src, const char *dst, size_t len)
|
---|
[f761f1eb] | 141 | {
|
---|
| 142 | int i;
|
---|
| 143 |
|
---|
[28ecadb] | 144 | for (i = 0; *src && *dst && i < len; src++, dst++, i++) {
|
---|
[0c8e692] | 145 | if (*src < *dst)
|
---|
| 146 | return -1;
|
---|
| 147 | if (*src > *dst)
|
---|
| 148 | return 1;
|
---|
[f761f1eb] | 149 | }
|
---|
[0c8e692] | 150 | if (i == len || *src == *dst)
|
---|
| 151 | return 0;
|
---|
[07bd114e] | 152 | if (!*src)
|
---|
[0c8e692] | 153 | return -1;
|
---|
[f761f1eb] | 154 | return 1;
|
---|
| 155 | }
|
---|
[8491c48] | 156 |
|
---|
[28ecadb] | 157 |
|
---|
| 158 |
|
---|
[f4338d2] | 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.
|
---|
[abbc16e] | 166 | * @param dest Destination buffer.
|
---|
[f4338d2] | 167 | * @param len Size of destination buffer.
|
---|
| 168 | */
|
---|
| 169 | void strncpy(char *dest, const char *src, size_t len)
|
---|
| 170 | {
|
---|
| 171 | int i;
|
---|
| 172 | for (i = 0; i < len; i++) {
|
---|
| 173 | if (!(dest[i] = src[i]))
|
---|
| 174 | return;
|
---|
| 175 | }
|
---|
[91c78c9] | 176 | dest[i-1] = '\0';
|
---|
[f4338d2] | 177 | }
|
---|
[6e716a59] | 178 |
|
---|
[7f1c620] | 179 | /** Convert ascii representation to unative_t
|
---|
[6e716a59] | 180 | *
|
---|
| 181 | * Supports 0x for hexa & 0 for octal notation.
|
---|
| 182 | * Does not check for overflows, does not support negative numbers
|
---|
| 183 | *
|
---|
| 184 | * @param text Textual representation of number
|
---|
| 185 | * @return Converted number or 0 if no valid number ofund
|
---|
| 186 | */
|
---|
[7f1c620] | 187 | unative_t atoi(const char *text)
|
---|
[6e716a59] | 188 | {
|
---|
| 189 | int base = 10;
|
---|
[7f1c620] | 190 | unative_t result = 0;
|
---|
[6e716a59] | 191 |
|
---|
| 192 | if (text[0] == '0' && text[1] == 'x') {
|
---|
| 193 | base = 16;
|
---|
| 194 | text += 2;
|
---|
| 195 | } else if (text[0] == '0')
|
---|
| 196 | base = 8;
|
---|
| 197 |
|
---|
| 198 | while (*text) {
|
---|
[ba276f7] | 199 | if (base != 16 && \
|
---|
| 200 | ((*text >= 'A' && *text <= 'F' )
|
---|
| 201 | || (*text >='a' && *text <='f')))
|
---|
[6e716a59] | 202 | break;
|
---|
| 203 | if (base == 8 && *text >='8')
|
---|
| 204 | break;
|
---|
| 205 |
|
---|
[2312685] | 206 | if (*text >= '0' && *text <= '9') {
|
---|
| 207 | result *= base;
|
---|
[6e716a59] | 208 | result += *text - '0';
|
---|
[2312685] | 209 | } else if (*text >= 'A' && *text <= 'F') {
|
---|
| 210 | result *= base;
|
---|
[6e716a59] | 211 | result += *text - 'A' + 10;
|
---|
[ba276f7] | 212 | } else if (*text >= 'a' && *text <= 'f') {
|
---|
| 213 | result *= base;
|
---|
| 214 | result += *text - 'a' + 10;
|
---|
[2312685] | 215 | } else
|
---|
[6e716a59] | 216 | break;
|
---|
| 217 | text++;
|
---|
| 218 | }
|
---|
| 219 |
|
---|
| 220 | return result;
|
---|
| 221 | }
|
---|
[b45c443] | 222 |
|
---|
[95155b0c] | 223 |
|
---|
| 224 | void order(const uint64_t val, uint64_t *rv, char *suffix)
|
---|
| 225 | {
|
---|
| 226 | if (val > 1000000000000000000LL) {
|
---|
| 227 | *rv = val / 1000000000000000000LL;
|
---|
| 228 | *suffix = 'E';
|
---|
| 229 | } else if (val > 1000000000000LL) {
|
---|
| 230 | *rv = val / 1000000000000LL;
|
---|
| 231 | *suffix = 'T';
|
---|
| 232 | } else if (val > 1000000LL) {
|
---|
| 233 | *rv = val / 1000000LL;
|
---|
| 234 | *suffix = 'M';
|
---|
| 235 | } else {
|
---|
| 236 | *rv = val;
|
---|
| 237 | *suffix = ' ';
|
---|
| 238 | }
|
---|
| 239 | }
|
---|
| 240 |
|
---|
[cc73a8a1] | 241 | /** @}
|
---|
[b45c443] | 242 | */
|
---|