Subversion Repositories HelenOS

Rev

Rev 4055 | 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) && (kconsole_check_poll()))
  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.    
  78.     cpu_halt();
  79. }
  80.  
  81. /** Convert ascii representation to unative_t
  82.  *
  83.  * Supports 0x for hexa & 0 for octal notation.
  84.  * Does not check for overflows, does not support negative numbers
  85.  *
  86.  * @param text Textual representation of number
  87.  * @return Converted number or 0 if no valid number ofund
  88.  */
  89. unative_t atoi(const char *text)
  90. {
  91.     int base = 10;
  92.     unative_t result = 0;
  93.  
  94.     if (text[0] == '0' && text[1] == 'x') {
  95.         base = 16;
  96.         text += 2;
  97.     } else if (text[0] == '0')
  98.         base = 8;
  99.  
  100.     while (*text) {
  101.         if (base != 16 && \
  102.             ((*text >= 'A' && *text <= 'F' )
  103.              || (*text >='a' && *text <='f')))
  104.             break;
  105.         if (base == 8 && *text >='8')
  106.             break;
  107.  
  108.         if (*text >= '0' && *text <= '9') {
  109.             result *= base;
  110.             result += *text - '0';
  111.         } else if (*text >= 'A' && *text <= 'F') {
  112.             result *= base;
  113.             result += *text - 'A' + 10;
  114.         } else if (*text >= 'a' && *text <= 'f') {
  115.             result *= base;
  116.             result += *text - 'a' + 10;
  117.         } else
  118.             break;
  119.         text++;
  120.     }
  121.  
  122.     return result;
  123. }
  124.  
  125.  
  126. void order(const uint64_t val, uint64_t *rv, char *suffix)
  127. {
  128.     if (val > 10000000000000000000ULL) {
  129.         *rv = val / 1000000000000000000ULL;
  130.         *suffix = 'Z';
  131.     } else if (val > 1000000000000000000ULL) {
  132.         *rv = val / 1000000000000000ULL;
  133.         *suffix = 'E';
  134.     } else if (val > 1000000000000000ULL) {
  135.         *rv = val / 1000000000000ULL;
  136.         *suffix = 'T';
  137.     } else if (val > 1000000000000ULL) {
  138.         *rv = val / 1000000000ULL;
  139.         *suffix = 'G';
  140.     } else if (val > 1000000000ULL) {
  141.         *rv = val / 1000000ULL;
  142.         *suffix = 'M';
  143.     } else if (val > 1000000ULL) {
  144.         *rv = val / 1000ULL;
  145.         *suffix = 'k';
  146.     } else {
  147.         *rv = val;
  148.         *suffix = ' ';
  149.     }
  150. }
  151.  
  152. /** @}
  153.  */
  154.