#include #include #include int threads = 0; void thread_cascade(void* d) { int n = (int)d; threads ++; if (d == 0) { //printk("{#} 0 cascade element started => end\n"); printk("*"); } else { if (n < 0) { //printk("{#} - cascade element started\n"); printk("-"); n = 0 - n; } else { //printk("{#} + cascade element started\n"); printk("+"); } //printk("{#} FORK + ...\n"); printk(">"); thread_new(thread_cascade, (void*)(n - 1)); //printk("{#} FORK - ...\n"); printk("<"); thread_new(thread_cascade, (void*)(1 - n)); //printk("{#} Thread cascade element finished.\n"); printk("."); } threads--; } void list_dir(FILE f, int lv) { char buf[256]; int i = 0, k; int r; file_info info; while ((r = read(f, i, 256, buf)) > 0) { for (k = 0; k < lv; k++) printk(" "); printk(buf); printk("\t\t"); stat_relative(f, buf, &info); printk_hex(info.type); if (info.type & FT_DIR) { printk("\t"); if (strcmp(buf, ".") != 0 && strcmp(buf, "..") != 0) { FILE ff = open_relative(f, buf, 0); if (ff <= 0) { printk("error: "); printk_int(ff); printk("\n"); } else { printk("fd: "); printk_int(ff); printk("\n"); list_dir(ff, lv+1); close(ff); } } else { printk("\n"); } } else { printk("\n"); } i++; } } int main() { printk("(test app) malloc(42) = "); printk_hex((uint32_t)malloc(42)); printk("\n"); printk(" -> Creating thread cascade (total 2**4 = 16 threads)\n"); thread_new(thread_cascade, (void*)4); printk(" -> Main thread now sleeping...\n"); while (1) { thread_sleep(100); if (threads == 0) break; } printk("\n -> Ok, let's try something else.\n"); FILE f = open("/", 0); if (f <= 0) { printk(" -> Could not open '/', error #"); printk_int(f); printk("...\n"); } else { printk("Now enumerating '/' (fd "); printk_int(f); printk(") :\n"); list_dir(f, 1); close(f); } printk(" -> Now sleeping, forever and ever...\n"); while(1) { thread_sleep(1000); } return 0; }