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