1 /* SPDX-License-Identifier: GPL-2.0 */
2 #ifndef KERNEL_H
3 #define KERNEL_H
4 #include <stdbool.h>
5 #include <stdlib.h>
6 #include <stddef.h>
7 #include <stdio.h>
8 #include <string.h>
9 #include <assert.h>
10 #include <stdarg.h>
11
12 #include <linux/compiler.h>
13 #include <linux/types.h>
14 #include <linux/printk.h>
15 #include <linux/bug.h>
16 #include <errno.h>
17 #include <unistd.h>
18 #include <asm/barrier.h>
19
20 #define CONFIG_SMP
21
22 #define PAGE_SIZE getpagesize()
23 #define PAGE_MASK (~(PAGE_SIZE-1))
24 #define PAGE_ALIGN(x) ((x + PAGE_SIZE - 1) & PAGE_MASK)
25
26 typedef unsigned long long phys_addr_t;
27 typedef unsigned long long dma_addr_t;
28 typedef size_t __kernel_size_t;
29 typedef unsigned int __wsum;
30
31 struct page {
32 unsigned long long dummy;
33 };
34
35 /* Physical == Virtual */
36 #define virt_to_phys(p) ((unsigned long)p)
37 #define phys_to_virt(a) ((void *)(unsigned long)(a))
38 /* Page address: Virtual / 4K */
39 #define page_to_phys(p) ((dma_addr_t)(unsigned long)(p))
40 #define virt_to_page(p) ((struct page *)((unsigned long)p & PAGE_MASK))
41
42 #define offset_in_page(p) (((unsigned long)p) % PAGE_SIZE)
43
44 #define __printf(a,b) __attribute__((format(printf,a,b)))
45
46 #define ARRAY_SIZE(x) (sizeof(x)/sizeof(x[0]))
47
48 extern void *__kmalloc_fake, *__kfree_ignore_start, *__kfree_ignore_end;
kmalloc(size_t s,gfp_t gfp)49 static inline void *kmalloc(size_t s, gfp_t gfp)
50 {
51 if (__kmalloc_fake)
52 return __kmalloc_fake;
53 return malloc(s);
54 }
kmalloc_array(unsigned n,size_t s,gfp_t gfp)55 static inline void *kmalloc_array(unsigned n, size_t s, gfp_t gfp)
56 {
57 return kmalloc(n * s, gfp);
58 }
59
kzalloc(size_t s,gfp_t gfp)60 static inline void *kzalloc(size_t s, gfp_t gfp)
61 {
62 void *p = kmalloc(s, gfp);
63
64 memset(p, 0, s);
65 return p;
66 }
67
alloc_pages_exact(size_t s,gfp_t gfp)68 static inline void *alloc_pages_exact(size_t s, gfp_t gfp)
69 {
70 return kmalloc(s, gfp);
71 }
72
kfree(void * p)73 static inline void kfree(void *p)
74 {
75 if (p >= __kfree_ignore_start && p < __kfree_ignore_end)
76 return;
77 free(p);
78 }
79
free_pages_exact(void * p,size_t s)80 static inline void free_pages_exact(void *p, size_t s)
81 {
82 kfree(p);
83 }
84
krealloc(void * p,size_t s,gfp_t gfp)85 static inline void *krealloc(void *p, size_t s, gfp_t gfp)
86 {
87 return realloc(p, s);
88 }
89
90
__get_free_page(gfp_t gfp)91 static inline unsigned long __get_free_page(gfp_t gfp)
92 {
93 void *p;
94
95 posix_memalign(&p, PAGE_SIZE, PAGE_SIZE);
96 return (unsigned long)p;
97 }
98
free_page(unsigned long addr)99 static inline void free_page(unsigned long addr)
100 {
101 free((void *)addr);
102 }
103
104 #define container_of(ptr, type, member) ({ \
105 const typeof( ((type *)0)->member ) *__mptr = (ptr); \
106 (type *)( (char *)__mptr - offsetof(type,member) );})
107
108 #define uninitialized_var(x) x = x
109
110 # ifndef likely
111 # define likely(x) (__builtin_expect(!!(x), 1))
112 # endif
113 # ifndef unlikely
114 # define unlikely(x) (__builtin_expect(!!(x), 0))
115 # endif
116
117 #define pr_err(format, ...) fprintf (stderr, format, ## __VA_ARGS__)
118 #ifdef DEBUG
119 #define pr_debug(format, ...) fprintf (stderr, format, ## __VA_ARGS__)
120 #else
121 #define pr_debug(format, ...) do {} while (0)
122 #endif
123 #define dev_err(dev, format, ...) fprintf (stderr, format, ## __VA_ARGS__)
124 #define dev_warn(dev, format, ...) fprintf (stderr, format, ## __VA_ARGS__)
125
126 #define WARN_ON_ONCE(cond) ((cond) ? fprintf (stderr, "WARNING\n") : 0)
127
128 #define min(x, y) ({ \
129 typeof(x) _min1 = (x); \
130 typeof(y) _min2 = (y); \
131 (void) (&_min1 == &_min2); \
132 _min1 < _min2 ? _min1 : _min2; })
133
134 /* TODO: empty stubs for now. Broken but enough for virtio_ring.c */
135 #define list_add_tail(a, b) do {} while (0)
136 #define list_del(a) do {} while (0)
137 #define list_for_each_entry(a, b, c) while (0)
138 /* end of stubs */
139
140 #endif /* KERNEL_H */
141