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