Files
rust/src/rt/test/rust_test_runtime.cpp
Eric Holk 62bc6b5113 Per-thread scheduling. Closes #682.
Tasks are spawned on a random thread. Currently they stay there, but
we should add task migration and load balancing in the future. This
should drammatically improve our task performance benchmarks.
2011-07-28 10:47:28 -07:00

67 lines
1.5 KiB
C++

#include "rust_test_runtime.h"
rust_test_runtime::rust_test_runtime() {
}
rust_test_runtime::~rust_test_runtime() {
}
#define DOMAINS 32
#define TASKS 32
void
rust_domain_test::worker::run() {
for (int i = 0; i < TASKS; i++) {
kernel->create_task(NULL, "child");
}
//sync::sleep(rand(&handle->rctx) % 1000);
}
bool
rust_domain_test::run() {
rust_srv srv;
rust_kernel kernel(&srv, 1);
array_list<worker *> workers;
for (int i = 0; i < DOMAINS; i++) {
worker *worker = new rust_domain_test::worker (&kernel);
workers.append(worker);
worker->start();
}
// We don't join the worker threads here in order to simulate ad-hoc
// termination of domains. If we join_all_domains before all domains
// are actually spawned, this could crash, thus the reason for the
// sleep below.
sync::sleep(100);
return true;
}
void task_entry() {
printf("task entry\n");
}
void
rust_task_test::worker::run() {
rust_task *root_task = kernel->create_task(NULL, "main");
root_task->start((uintptr_t)&task_entry, (uintptr_t)NULL);
root_task->sched->start_main_loop();
}
bool
rust_task_test::run() {
rust_srv srv;
rust_kernel kernel(&srv, 1);
array_list<worker *> workers;
for (int i = 0; i < DOMAINS; i++) {
worker *worker = new rust_task_test::worker (&kernel, this);
workers.append(worker);
worker->start();
}
//sync::sleep(rand(&kernel.sched->rctx) % 1000);
return true;
}