removed gunk from manager_waterman()
[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         proc_decref((p));
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         proc_decref((p));
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         /* I usually want this */
117         schedule();
118         process_routine_kmsg(0);        /* maybe do this before schedule() */
119
120         enable_irq();
121         /* this ghetto hack really wants to wait for an interrupt, but time out */
122         udelay(60000);  /* wait for IO when there really is nothing to do */
123         process_routine_kmsg(0);
124         printd("No work to do (schedule returned)\n");
125         monitor(0);
126
127         // for testing taking cores, check in case 1 for usage
128         uint32_t corelist[MAX_NUM_CPUS];
129         uint32_t num = 3;
130
131         switch (progress++) {
132                 case 0:
133                         printk("Top of the manager to ya!\n");
134                         /* 124 is half of the available boxboro colors (with the kernel
135                          * getting 8) */
136                         //quick_proc_color_run("msr_dumb_while", p, 124, temp_f);
137                         quick_proc_run("/bin/hello", p, temp_f);
138                         #if 0
139                         // this is how you can transition to a parallel process manually
140                         // make sure you don't proc run first
141                         __proc_set_state(p, PROC_RUNNING_S);
142                         __proc_set_state(p, PROC_RUNNABLE_M);
143                         p->resources[RES_CORES].amt_wanted = 5;
144                         spin_unlock(&p->proc_lock);
145                         core_request(p);
146                         panic("This is okay");
147                         #endif
148                         break;
149                 case 1:
150                         #if 0
151                         udelay(10000000);
152                         // this is a ghetto way to test restarting an _M
153                                 printk("\nattempting to ghetto preempt...\n");
154                                 spin_lock(&p->proc_lock);
155                                 proc_take_allcores(p, __death);
156                                 __proc_set_state(p, PROC_RUNNABLE_M);
157                                 spin_unlock(&p->proc_lock);
158                                 udelay(5000000);
159                                 printk("\nattempting to restart...\n");
160                                 core_request(p); // proc still wants the cores
161                         panic("This is okay");
162                         // this tests taking some cores, and later killing an _M
163                                 printk("taking 3 cores from p\n");
164                                 for (int i = 0; i < num; i++)
165                                         corelist[i] = 7-i; // 7, 6, and 5
166                                 spin_lock(&p->proc_lock);
167                                 proc_take_cores(p, corelist, &num, __death);
168                                 spin_unlock(&p->proc_lock);
169                                 udelay(5000000);
170                                 printk("Killing p\n");
171                                 proc_destroy(p);
172                                 printk("Killed p\n");
173                         panic("This is okay");
174
175                         envs[0] = kfs_proc_create(kfs_lookup_path("roslib_hello"));
176                         __proc_set_state(envs[0], PROC_RUNNABLE_S);
177                         proc_run(envs[0]);
178                         break;
179                         #endif
180                 case 2:
181                         /*
182                         test_smp_call_functions();
183                         test_checklists();
184                         test_barrier();
185                         test_print_info();
186                         test_lapic_status_bit();
187                         test_ipi_sending();
188                         test_pit();
189                         */
190                 default:
191                         printd("Manager Progress: %d\n", progress);
192                         // delay if you want to test rescheduling an MCP that yielded
193                         //udelay(15000000);
194                         schedule();
195         }
196         panic("If you see me, then you probably screwed up");
197         monitor(0);
198
199         /*
200         printk("Servicing syscalls from Core 0:\n\n");
201         while (1) {
202                 process_generic_syscalls(&envs[0], 1);
203                 cpu_relax();
204         }
205         */
206         return;
207 }
208
209 void manager_klueska()
210 {
211         static struct proc *envs[256];
212         static volatile uint8_t progress = 0;
213
214         if (progress == 0) {
215                 progress++;
216                 panic("what do you want to do?");
217                 //envs[0] = kfs_proc_create(kfs_lookup_path("fillmeup"));
218                 __proc_set_state(envs[0], PROC_RUNNABLE_S);
219                 proc_run(envs[0]);
220         }
221         schedule();
222
223         panic("DON'T PANIC");
224 }
225
226 void manager_waterman()
227 {
228         schedule();
229         monitor(0);
230         assert(0);
231 }
232
233 void manager_pearce()
234 {
235         static struct proc *envs[256];
236         static volatile uint8_t progress = 0;
237
238         if (progress == 0) {
239                 progress++;
240                 panic("what do you want to do?");
241                 //envs[0] = kfs_proc_create(kfs_lookup_path("parlib_httpserver_integrated"));
242                 //envs[0] = kfs_proc_create(kfs_lookup_path("parlib_lock_test"));
243                 __proc_set_state(envs[0], PROC_RUNNABLE_S);
244                 proc_run(envs[0]);
245         }
246         schedule();
247
248         panic("DON'T PANIC");
249
250 }
251
252 void manager_yuzhu()
253 {
254         
255         static uint8_t RACY progress = 0;
256         static struct proc *p;
257
258         // for testing taking cores, check in case 1 for usage
259         uint32_t corelist[MAX_NUM_CPUS];
260         uint32_t num = 3;
261
262         //create_server(init_num_cores, loop);
263
264         monitor(0);
265
266         // quick_proc_run("hello", p);
267
268 }
269
270 #ifdef __sparc_v8__
271
272 static char*
273 itoa(int num, char* buf0, size_t base)
274 {
275         if(base > 16)
276                 return NULL;
277
278         char* buf = buf0;
279         int len = 0, i;
280
281         if(num < 0)
282         {
283                 *buf++ = '-';
284                 num = -num;
285         }
286
287         do {
288                 buf[len++] = "0123456789abcdef"[num%base];
289                 num /= base;
290         } while(num);
291
292         for(i = 0; i < len/2; i++)
293         {
294                 char temp = buf[i];
295                 buf[i] = buf[len-i-1];
296                 buf[len-i-1] = temp;
297         }
298         buf[len] = 0;
299
300         return buf0;
301 }
302
303 void gsf_set_frame_cycles(int cycles)
304 {
305         store_alternate(26*4,2,cycles);
306 }
307
308 void gsf_set_partition_credits(int partition, int credits)
309 {
310         store_alternate((32+partition)*4,2,credits);
311 }
312
313 void gsf_set_core_partition(int core, int partition)
314 {
315         store_alternate((64+core)*4,2,partition);
316 }
317
318 #endif
319