Bring back the ARSC functionality that was removed earlier.
[akaros.git] / kern / src / manager.c
1 /*
2  * Copyright (c) 2009 The Regents of the University of California
3  * Barret Rhoden <brho@cs.berkeley.edu>
4  * See LICENSE for details.
5  */
6
7
8 #ifdef __SHARC__
9 #pragma nosharc
10 #endif
11
12 #include <ros/common.h>
13 #include <smp.h>
14 #include <arch/init.h>
15 #include <mm.h>
16 #include <elf.h>
17 #include <frontend.h>
18
19 #include <kmalloc.h>
20 #include <assert.h>
21 #include <manager.h>
22 #include <process.h>
23 #include <schedule.h>
24 #include <syscall.h>
25 #include <testing.h>
26 #include <kfs.h>
27 #include <stdio.h>
28 #include <timing.h>
29 #include <resource.h>
30 #include <monitor.h>
31 #include <colored_caches.h>
32 #include <string.h>
33 #include <pmap.h>
34 #include <ros/timer.h>
35 #include <ros/arch/membar.h>
36
37 /*
38  * Currently, if you leave this function by way of proc_run (process_workqueue
39  * that proc_runs), you will never come back to where you left off, and the
40  * function will start from the top.  Hence the hack 'progress'.
41  */
42 void manager(void)
43 {
44         #ifndef DEVELOPER_NAME
45                 #define DEVELOPER_NAME brho
46         #endif
47
48         // LoL
49         #define PASTE(s1,s2) s1 ## s2
50         #define MANAGER_FUNC(dev) PASTE(manager_,dev)
51
52         void MANAGER_FUNC(DEVELOPER_NAME)(void);
53         MANAGER_FUNC(DEVELOPER_NAME)();
54 }
55
56 char *p_argv[] = {0, 0, 0};
57 char *p_envp[] = {"LD_LIBRARY_PATH=/lib", 0};
58 /* Helper macro for quickly running a process.  Pass it a string, *file, and a
59  * *proc. */
60 #define quick_proc_run(x, p, f)                                                  \
61         (f) = do_file_open((x), 0, 0);                                               \
62         assert((f));                                                                 \
63         p_argv[0] = file_name((f));                                                  \
64         (p) = proc_create((f), p_argv, p_envp);                                      \
65         kref_put(&(f)->f_kref);                                                      \
66         spin_lock(&(p)->proc_lock);                                                  \
67         __proc_set_state((p), PROC_RUNNABLE_S);                                      \
68         spin_unlock(&(p)->proc_lock);                                                \
69         proc_run((p));                                                               \
70         kref_put(&(p)->kref);
71
72 #define quick_proc_create(x, p, f)                                               \
73         (f) = do_file_open((x), 0, 0);                                               \
74         assert((f));                                                                 \
75         p_argv[0] = file_name((f));                                                  \
76         (p) = proc_create((f), p_argv, p_envp);                                      \
77         kref_put(&(f)->f_kref);                                                      \
78         spin_lock(&(p)->proc_lock);                                                  \
79         __proc_set_state((p), PROC_RUNNABLE_S);                                      \
80         spin_unlock(&(p)->proc_lock);
81
82 #define quick_proc_color_run(x, p, c, f)                                         \
83         (f) = do_file_open((x), 0, 0);                                               \
84         assert((f));                                                                 \
85         p_argv[0] = file_name((f));                                                  \
86         (p) = proc_create((f), p_argv, p_envp);                                      \
87         kref_put(&(f)->f_kref);                                                      \
88         spin_lock(&(p)->proc_lock);                                                  \
89         __proc_set_state((p), PROC_RUNNABLE_S);                                      \
90         spin_unlock(&(p)->proc_lock);                                                \
91         p->cache_colors_map = cache_colors_map_alloc();                              \
92         for (int i = 0; i < (c); i++)                                                \
93                 cache_color_alloc(llc_cache, p->cache_colors_map);                       \
94         proc_run((p));                                                               \
95         kref_put(&(p)->kref);
96
97 #define quick_proc_color_create(x, p, c, f)                                      \
98         (f) = do_file_open((x), 0, 0);                                               \
99         assert((f));                                                                 \
100         p_argv[0] = file_name((f));                                                  \
101         (p) = proc_create((f), p_argv, p_envp);                                      \
102         kref_put(&(f)->f_kref);                                                      \
103         spin_lock(&(p)->proc_lock);                                                  \
104         __proc_set_state((p), PROC_RUNNABLE_S);                                      \
105         spin_unlock(&(p)->proc_lock);                                                \
106         p->cache_colors_map = cache_colors_map_alloc();                              \
107         for (int i = 0; i < (c); i++)                                                \
108                 cache_color_alloc(llc_cache, p->cache_colors_map);
109
110 void manager_brho(void)
111 {
112         static uint8_t RACY progress = 0;       /* this will wrap around. */
113         static struct proc *p;
114         struct file *temp_f;
115
116         // for testing taking cores, check in case 1 for usage
117         uint32_t corelist[MAX_NUM_CPUS];
118         uint32_t num = 3;
119
120         switch (progress++) {
121                 case 0:
122                         printk("Top of the manager to ya!\n");
123                         /* 124 is half of the available boxboro colors (with the kernel
124                          * getting 8) */
125                         //quick_proc_color_run("msr_dumb_while", p, 124, temp_f);
126                         quick_proc_run("/bin/hello", p, temp_f);
127                         #if 0
128                         // this is how you can transition to a parallel process manually
129                         // make sure you don't proc run first
130                         __proc_set_state(p, PROC_RUNNING_S);
131                         __proc_set_state(p, PROC_RUNNABLE_M);
132                         p->resources[RES_CORES].amt_wanted = 5;
133                         spin_unlock(&p->proc_lock);
134                         core_request(p);
135                         panic("This is okay");
136                         #endif
137                         break;
138                 case 1:
139                         #if 0
140                         udelay(10000000);
141                         // this is a ghetto way to test restarting an _M
142                                 printk("\nattempting to ghetto preempt...\n");
143                                 spin_lock(&p->proc_lock);
144                                 proc_take_allcores(p, __death);
145                                 __proc_set_state(p, PROC_RUNNABLE_M);
146                                 spin_unlock(&p->proc_lock);
147                                 udelay(5000000);
148                                 printk("\nattempting to restart...\n");
149                                 core_request(p); // proc still wants the cores
150                         panic("This is okay");
151                         // this tests taking some cores, and later killing an _M
152                                 printk("taking 3 cores from p\n");
153                                 for (int i = 0; i < num; i++)
154                                         corelist[i] = 7-i; // 7, 6, and 5
155                                 spin_lock(&p->proc_lock);
156                                 proc_take_cores(p, corelist, &num, __death);
157                                 spin_unlock(&p->proc_lock);
158                                 udelay(5000000);
159                                 printk("Killing p\n");
160                                 proc_destroy(p);
161                                 printk("Killed p\n");
162                         panic("This is okay");
163
164                         envs[0] = kfs_proc_create(kfs_lookup_path("roslib_hello"));
165                         __proc_set_state(envs[0], PROC_RUNNABLE_S);
166                         proc_run(envs[0]);
167                         break;
168                         #endif
169                 case 2:
170                         /*
171                         test_smp_call_functions();
172                         test_checklists();
173                         test_barrier();
174                         test_print_info();
175                         test_lapic_status_bit();
176                         test_ipi_sending();
177                         test_pit();
178                         */
179                 default:
180                         printd("Manager Progress: %d\n", progress);
181                         // delay if you want to test rescheduling an MCP that yielded
182                         //udelay(15000000);
183                         schedule();
184         }
185         panic("If you see me, then you probably screwed up");
186         monitor(0);
187
188         /*
189         printk("Servicing syscalls from Core 0:\n\n");
190         while (1) {
191                 process_generic_syscalls(&envs[0], 1);
192                 cpu_relax();
193         }
194         */
195         return;
196 }
197
198 void manager_klueska()
199 {
200         static struct proc *envs[256];
201         static volatile uint8_t progress = 0;
202
203         if (progress == 0) {
204                 progress++;
205                 panic("what do you want to do?");
206                 //envs[0] = kfs_proc_create(kfs_lookup_path("fillmeup"));
207                 __proc_set_state(envs[0], PROC_RUNNABLE_S);
208                 proc_run(envs[0]);
209         }
210         schedule();
211
212         panic("DON'T PANIC");
213 }
214
215 struct elf_info
216 {
217         long entry;
218         long phdr;
219         int phnum;
220         int dynamic;
221         char interp[256];
222 };
223
224 void manager_waterman()
225 {
226         static int init = 0;
227         if(!init)
228         {
229                 warn("Old file creation might not work");
230                 init = 1;
231                 struct proc *p;
232                 proc_alloc(&p, 0);
233
234                 char* argv[] = {"/bin/sh","-l",0};
235                 char* envp[] = {"LD_LIBRARY_PATH=/lib",0};
236                 procinfo_pack_args(p->procinfo,argv,envp);
237
238                 struct file* f = file_open("/bin/busybox",0,0);
239                 assert(f != NULL);
240                 assert(load_elf(p,f) == 0);
241                 file_decref(f);
242
243                 __proc_set_state(p, PROC_RUNNABLE_S);
244                 proc_run(p);
245         }
246         schedule();
247 }
248
249 void manager_pearce()
250 {
251         static struct proc *envs[256];
252         static volatile uint8_t progress = 0;
253
254         if (progress == 0) {
255                 progress++;
256                 panic("what do you want to do?");
257                 //envs[0] = kfs_proc_create(kfs_lookup_path("parlib_httpserver_integrated"));
258                 //envs[0] = kfs_proc_create(kfs_lookup_path("parlib_lock_test"));
259                 __proc_set_state(envs[0], PROC_RUNNABLE_S);
260                 proc_run(envs[0]);
261         }
262         schedule();
263
264         panic("DON'T PANIC");
265
266 }
267
268 void manager_yuzhu()
269 {
270         
271         static uint8_t RACY progress = 0;
272         static struct proc *p;
273
274         // for testing taking cores, check in case 1 for usage
275         uint32_t corelist[MAX_NUM_CPUS];
276         uint32_t num = 3;
277
278         //create_server(init_num_cores, loop);
279
280         monitor(0);
281
282         // quick_proc_run("hello", p);
283
284 }
285
286 #ifdef __sparc_v8__
287
288 static char*
289 itoa(int num, char* buf0, size_t base)
290 {
291         if(base > 16)
292                 return NULL;
293
294         char* buf = buf0;
295         int len = 0, i;
296
297         if(num < 0)
298         {
299                 *buf++ = '-';
300                 num = -num;
301         }
302
303         do {
304                 buf[len++] = "0123456789abcdef"[num%base];
305                 num /= base;
306         } while(num);
307
308         for(i = 0; i < len/2; i++)
309         {
310                 char temp = buf[i];
311                 buf[i] = buf[len-i-1];
312                 buf[len-i-1] = temp;
313         }
314         buf[len] = 0;
315
316         return buf0;
317 }
318
319 void gsf_set_frame_cycles(int cycles)
320 {
321         store_alternate(26*4,2,cycles);
322 }
323
324 void gsf_set_partition_credits(int partition, int credits)
325 {
326         store_alternate((32+partition)*4,2,credits);
327 }
328
329 void gsf_set_core_partition(int core, int partition)
330 {
331         store_alternate((64+core)*4,2,partition);
332 }
333
334 #endif
335