Subversion Repositories HelenOS

Rev

Rev 2050 | Rev 2089 | Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed

  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. /** @addtogroup generic
  30.  * @{
  31.  */
  32.  
  33. /**
  34.  * @file
  35.  * @brief   Miscellaneous functions.
  36.  */
  37.  
  38. #include <func.h>
  39. #include <print.h>
  40. #include <cpu.h>
  41. #include <arch/asm.h>
  42. #include <arch.h>
  43. #include <typedefs.h>
  44. #include <console/kconsole.h>
  45.  
  46. atomic_t haltstate = {0}; /**< Halt flag */
  47.  
  48.  
  49. /** Halt wrapper
  50.  *
  51.  * Set halt flag and halt the cpu.
  52.  *
  53.  */
  54. void halt()
  55. {
  56. #ifdef CONFIG_DEBUG
  57.     bool rundebugger = false;
  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
  66.     atomic_set(&haltstate, 1);
  67. #endif
  68.  
  69.     interrupts_disable();
  70. #ifdef CONFIG_DEBUG
  71.     if (rundebugger) {
  72.         printf("\n");
  73.         kconsole("panic"); /* Run kconsole as a last resort to user */
  74.     }
  75. #endif      
  76.     if (CPU)
  77.         printf("cpu%d: halted\n", CPU->id);
  78.     else
  79.         printf("cpu: halted\n");
  80.     cpu_halt();
  81. }
  82.  
  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. }
  98.  
  99. /** Compare two NULL terminated strings
  100.  *
  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.
  104.  *
  105.  * @param src First string to compare.
  106.  * @param dst Second string to compare.
  107.  *
  108.  * @return 0 if the strings are equal, -1 if first is smaller, 1 if second smaller.
  109.  *
  110.  */
  111. int strcmp(const char *src, const char *dst)
  112. {
  113.     for (; *src && *dst; src++, dst++) {
  114.         if (*src < *dst)
  115.             return -1;
  116.         if (*src > *dst)
  117.             return 1;
  118.     }
  119.     if (*src == *dst)
  120.         return 0;
  121.     if (!*src)
  122.         return -1;
  123.     return 1;
  124. }
  125.  
  126.  
  127. /** Compare two NULL terminated strings
  128.  *
  129.  * Do a char-by-char comparison of two NULL terminated strings.
  130.  * The strings are considered equal iff they consist of the same
  131.  * characters on the minimum of their lengths and specified maximal
  132.  * length.
  133.  *
  134.  * @param src First string to compare.
  135.  * @param dst Second string to compare.
  136.  * @param len Maximal length for comparison.
  137.  *
  138.  * @return 0 if the strings are equal, -1 if first is smaller, 1 if second smaller.
  139.  *
  140.  */
  141. int strncmp(const char *src, const char *dst, size_t len)
  142. {
  143.     int i;
  144.    
  145.     for (i = 0; *src && *dst && i < len; src++, dst++, i++) {
  146.         if (*src < *dst)
  147.             return -1;
  148.         if (*src > *dst)
  149.             return 1;
  150.     }
  151.     if (i == len || *src == *dst)
  152.         return 0;
  153.     if (!*src)
  154.         return -1;
  155.     return 1;
  156. }
  157.  
  158.  
  159.  
  160. /** Copy NULL terminated string.
  161.  *
  162.  * Copy at most 'len' characters from string 'src' to 'dest'.
  163.  * If 'src' is shorter than 'len', '\0' is inserted behind the
  164.  * last copied character.
  165.  *
  166.  * @param src Source string.
  167.  * @param dest Destination buffer.
  168.  * @param len Size of destination buffer.
  169.  */
  170. void strncpy(char *dest, const char *src, size_t len)
  171. {
  172.     int i;
  173.     for (i = 0; i < len; i++) {
  174.         if (!(dest[i] = src[i]))
  175.             return;
  176.     }
  177.     dest[i-1] = '\0';
  178. }
  179.  
  180. /** Convert ascii representation to unative_t
  181.  *
  182.  * Supports 0x for hexa & 0 for octal notation.
  183.  * Does not check for overflows, does not support negative numbers
  184.  *
  185.  * @param text Textual representation of number
  186.  * @return Converted number or 0 if no valid number ofund
  187.  */
  188. unative_t atoi(const char *text)
  189. {
  190.     int base = 10;
  191.     unative_t result = 0;
  192.  
  193.     if (text[0] == '0' && text[1] == 'x') {
  194.         base = 16;
  195.         text += 2;
  196.     } else if (text[0] == '0')
  197.         base = 8;
  198.  
  199.     while (*text) {
  200.         if (base != 16 && \
  201.             ((*text >= 'A' && *text <= 'F' )
  202.              || (*text >='a' && *text <='f')))
  203.             break;
  204.         if (base == 8 && *text >='8')
  205.             break;
  206.  
  207.         if (*text >= '0' && *text <= '9') {
  208.             result *= base;
  209.             result += *text - '0';
  210.         } else if (*text >= 'A' && *text <= 'F') {
  211.             result *= base;
  212.             result += *text - 'A' + 10;
  213.         } else if (*text >= 'a' && *text <= 'f') {
  214.             result *= base;
  215.             result += *text - 'a' + 10;
  216.         } else
  217.             break;
  218.         text++;
  219.     }
  220.  
  221.     return result;
  222. }
  223.  
  224.  
  225. void order(const uint64_t val, uint64_t *rv, char *suffix)
  226. {
  227.     if (val > 1000000000000000000LL) {
  228.         *rv = val / 1000000000000000000LL;
  229.         *suffix = 'E';
  230.     } else if (val > 1000000000000LL) {
  231.         *rv = val / 1000000000000LL;
  232.         *suffix = 'T';
  233.     } else if (val > 1000000LL) {
  234.         *rv = val / 1000000LL;
  235.         *suffix = 'M';
  236.     } else {
  237.         *rv = val;
  238.         *suffix = ' ';
  239.     }
  240. }
  241.  
  242. /** @}
  243.  */
  244.