Subversion Repositories HelenOS-historic

Rev

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