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