Subversion Repositories HelenOS

Rev

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