kernel.h 2.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120
  1. #ifndef KERNEL_H
  2. #define KERNEL_H
  3. #include <stdbool.h>
  4. #include <stdlib.h>
  5. #include <stddef.h>
  6. #include <stdio.h>
  7. #include <string.h>
  8. #include <assert.h>
  9. #include <stdarg.h>
  10. #include <linux/compiler.h>
  11. #include <linux/types.h>
  12. #include <linux/printk.h>
  13. #include <linux/bug.h>
  14. #include <errno.h>
  15. #include <unistd.h>
  16. #include <asm/barrier.h>
  17. #define CONFIG_SMP
  18. #define PAGE_SIZE getpagesize()
  19. #define PAGE_MASK (~(PAGE_SIZE-1))
  20. typedef unsigned long long dma_addr_t;
  21. typedef size_t __kernel_size_t;
  22. typedef unsigned int __wsum;
  23. struct page {
  24. unsigned long long dummy;
  25. };
  26. /* Physical == Virtual */
  27. #define virt_to_phys(p) ((unsigned long)p)
  28. #define phys_to_virt(a) ((void *)(unsigned long)(a))
  29. /* Page address: Virtual / 4K */
  30. #define page_to_phys(p) ((dma_addr_t)(unsigned long)(p))
  31. #define virt_to_page(p) ((struct page *)((unsigned long)p & PAGE_MASK))
  32. #define offset_in_page(p) (((unsigned long)p) % PAGE_SIZE)
  33. #define __printf(a,b) __attribute__((format(printf,a,b)))
  34. #define ARRAY_SIZE(x) (sizeof(x)/sizeof(x[0]))
  35. extern void *__kmalloc_fake, *__kfree_ignore_start, *__kfree_ignore_end;
  36. static inline void *kmalloc(size_t s, gfp_t gfp)
  37. {
  38. if (__kmalloc_fake)
  39. return __kmalloc_fake;
  40. return malloc(s);
  41. }
  42. static inline void *kzalloc(size_t s, gfp_t gfp)
  43. {
  44. void *p = kmalloc(s, gfp);
  45. memset(p, 0, s);
  46. return p;
  47. }
  48. static inline void kfree(void *p)
  49. {
  50. if (p >= __kfree_ignore_start && p < __kfree_ignore_end)
  51. return;
  52. free(p);
  53. }
  54. static inline void *krealloc(void *p, size_t s, gfp_t gfp)
  55. {
  56. return realloc(p, s);
  57. }
  58. static inline unsigned long __get_free_page(gfp_t gfp)
  59. {
  60. void *p;
  61. posix_memalign(&p, PAGE_SIZE, PAGE_SIZE);
  62. return (unsigned long)p;
  63. }
  64. static inline void free_page(unsigned long addr)
  65. {
  66. free((void *)addr);
  67. }
  68. #define container_of(ptr, type, member) ({ \
  69. const typeof( ((type *)0)->member ) *__mptr = (ptr); \
  70. (type *)( (char *)__mptr - offsetof(type,member) );})
  71. #define uninitialized_var(x) x = x
  72. # ifndef likely
  73. # define likely(x) (__builtin_expect(!!(x), 1))
  74. # endif
  75. # ifndef unlikely
  76. # define unlikely(x) (__builtin_expect(!!(x), 0))
  77. # endif
  78. #define pr_err(format, ...) fprintf (stderr, format, ## __VA_ARGS__)
  79. #ifdef DEBUG
  80. #define pr_debug(format, ...) fprintf (stderr, format, ## __VA_ARGS__)
  81. #else
  82. #define pr_debug(format, ...) do {} while (0)
  83. #endif
  84. #define dev_err(dev, format, ...) fprintf (stderr, format, ## __VA_ARGS__)
  85. #define dev_warn(dev, format, ...) fprintf (stderr, format, ## __VA_ARGS__)
  86. #define min(x, y) ({ \
  87. typeof(x) _min1 = (x); \
  88. typeof(y) _min2 = (y); \
  89. (void) (&_min1 == &_min2); \
  90. _min1 < _min2 ? _min1 : _min2; })
  91. /* TODO: empty stubs for now. Broken but enough for virtio_ring.c */
  92. #define list_add_tail(a, b) do {} while (0)
  93. #define list_del(a) do {} while (0)
  94. #define list_for_each_entry(a, b, c) while (0)
  95. /* end of stubs */
  96. #endif /* KERNEL_H */