ccls/task.cc

225 lines
5.9 KiB
C++
Raw Normal View History

2017-03-02 18:25:40 +00:00
#include <cassert>
2017-02-23 09:23:23 +00:00
#include <condition_variable>
#include <iostream>
#include <thread>
#include <vector>
2017-03-01 08:36:11 +00:00
#include "compilation_database_loader.h"
2017-02-23 09:23:23 +00:00
#include "indexer.h"
#include "query.h"
2017-02-28 08:37:20 +00:00
#include "optional.h"
2017-03-01 08:36:11 +00:00
#include "utils.h"
2017-03-02 18:25:40 +00:00
//#include "third_party/tiny-process-library/process.hpp"
2017-02-23 09:23:23 +00:00
2017-03-01 08:36:11 +00:00
#include <algorithm>
2017-02-24 08:39:25 +00:00
#include <queue>
#include <mutex>
#include <condition_variable>
2017-02-23 09:23:23 +00:00
2017-02-28 08:37:20 +00:00
using std::experimental::optional;
using std::experimental::nullopt;
2017-02-24 08:39:25 +00:00
// A threadsafe-queue. http://stackoverflow.com/a/16075550
template <class T>
class SafeQueue {
public:
// Add an element to the queue.
void enqueue(T t) {
std::lock_guard<std::mutex> lock(mutex_);
queue_.push(t);
cv_.notify_one();
2017-02-23 09:23:23 +00:00
}
2017-02-24 08:39:25 +00:00
// Get the "front"-element.
// If the queue is empty, wait till a element is avaiable.
T dequeue() {
std::unique_lock<std::mutex> lock(mutex_);
while (queue_.empty()) {
// release lock as long as the wait and reaquire it afterwards.
cv_.wait(lock);
}
T val = queue_.front();
queue_.pop();
return val;
2017-02-23 09:23:23 +00:00
}
2017-02-28 08:37:20 +00:00
// Get the "front"-element.
// Returns empty if the queue is empty.
optional<T> try_dequeue() {
std::unique_lock<std::mutex> lock(mutex_);
if (queue_.empty())
return nullopt;
T val = queue_.front();
queue_.pop();
return val;
}
2017-02-24 08:39:25 +00:00
private:
std::queue<T> queue_;
mutable std::mutex mutex_;
std::condition_variable cv_;
2017-02-23 09:23:23 +00:00
};
2017-02-24 08:39:25 +00:00
struct Task {
int priority = 0;
bool writes_to_index = false;
2017-03-02 18:25:40 +00:00
2017-03-01 08:36:11 +00:00
enum class Kind {
CreateIndex,
IndexImport,
Exit
};
Kind kind;
struct CreateIndexState {
CompilationEntry data;
};
struct IndexImportState {
std::string path;
};
struct ExitState {};
// TODO: Move into a union?
CreateIndexState create_index;
IndexImportState index_import;
ExitState exit;
2017-02-24 08:39:25 +00:00
static Task MakeExit() {
Task task;
2017-03-01 08:36:11 +00:00
task.kind = Kind::Exit;
return task;
}
static Task MakeCreateIndexTask(CompilationEntry compilation_entry) {
Task task;
task.kind = Kind::CreateIndex;
task.create_index.data = compilation_entry;
return task;
}
static Task MakeIndexImportTask(std::string filename) {
Task task;
task.kind = Kind::IndexImport;
task.index_import.path = filename;
2017-02-24 08:39:25 +00:00
return task;
2017-02-23 09:23:23 +00:00
}
2017-02-24 08:39:25 +00:00
// TODO: Create index task.
// Task running in a separate process, parsing a file into something we can
// import.
// TODO: Index import task.
// Completed parse task that wants to import content into the global database.
// Runs in main process, primary thread. Stops all other threads.
// TODO: Index fresh task.
// Completed parse task that wants to update content previously imported into
// the global database. Runs in main process, primary thread. Stops all other
// threads.
//
// Note that this task just contains a set of operations to apply to the global
// database. The operations come from a diff based on the previously indexed
// state in comparison to the newly indexed state.
//
// TODO: We may be able to run multiple freshen and import tasks in parallel if
// we restrict what ranges of the db they may change.
// TODO: QueryTask
// Task running a query against the global database. Run in main process,
// separate thread.
2017-03-01 08:36:11 +00:00
//Command query;
//Location location;
//std::string argument;
};
struct Config {
// Cache directory. Always ends with /
std::string cache_directory;
2017-02-23 09:23:23 +00:00
};
// NOTE: When something enters a value into master db, it will have to have a
// ref count, since multiple parsings could enter it (unless we require
// that it be defined in that declaration unit!)
struct TaskManager {
2017-02-24 08:39:25 +00:00
SafeQueue<Task> queued_tasks;
2017-02-23 09:23:23 +00:00
// Available threads.
std::vector<std::thread> threads;
2017-03-01 08:36:11 +00:00
TaskManager(int num_threads, Config* config);
2017-02-23 09:23:23 +00:00
};
2017-03-01 08:36:11 +00:00
void PostTaskToIndexer(TaskManager* tm, Task task) {
tm->queued_tasks.enqueue(task);
}
void RunIndexTask(Config* config, TaskManager* tm, CompilationEntry entry) {
IndexedFile file = Parse(entry.filename, entry.args);
std::string cleaned_file_path = entry.directory + "/" + entry.filename;
std::replace(cleaned_file_path.begin(), cleaned_file_path.end(), '/', '_');
std::replace(cleaned_file_path.begin(), cleaned_file_path.end(), '\\', '_');
std::string filename = config->cache_directory + cleaned_file_path;
WriteToFile(filename, file.ToString());
PostTaskToIndexer(tm, Task::MakeIndexImportTask(filename));
}
void LoadProject(Config* config, TaskManager* tm, std::vector<CompilationEntry> entries) {
for (CompilationEntry entry : entries) {
tm->queued_tasks.enqueue(Task::MakeCreateIndexTask(entry));
}
}
static void ThreadMain(int id, Config* config, TaskManager* tm) {
2017-02-24 08:39:25 +00:00
while (true) {
Task task = tm->queued_tasks.dequeue();
2017-03-01 08:36:11 +00:00
switch (task.kind) {
case Task::Kind::CreateIndex:
RunIndexTask(config, tm, task.create_index.data);
break;
case Task::Kind::IndexImport:
assert(false);
break;
case Task::Kind::Exit:
2017-03-05 19:48:05 +00:00
std::cerr << id << ": Exiting" << std::endl;
2017-02-24 08:39:25 +00:00
return;
}
2017-03-05 19:48:05 +00:00
std::cerr << id << ": waking" << std::endl;
2017-02-24 08:39:25 +00:00
}
2017-02-23 09:23:23 +00:00
}
2017-03-01 08:36:11 +00:00
TaskManager::TaskManager(int num_threads, Config* config) {
2017-02-23 09:23:23 +00:00
for (int i = 0; i < num_threads; ++i) {
2017-03-01 08:36:11 +00:00
threads.push_back(std::thread(&ThreadMain, i, config, this));
2017-02-23 09:23:23 +00:00
}
}
void Pump(TaskManager* tm) {
//tm->threads[0].
}
2017-03-01 08:36:11 +00:00
int main252525225(int argc, char** argv) {
Config config;
TaskManager tm(5, &config);
LoadProject(&config, &tm, LoadCompilationEntriesFromDirectory("full_tests/simple_cross_reference"));
2017-02-23 09:23:23 +00:00
// TODO: looks like we will have to write shared memory support.
// TODO: We signal thread to pick data, thread signals data pick is done.
// Repeat until we encounter a writer, wait for all threads to signal
// they are done.
// TODO: Let's use a thread safe queue/vector/etc instead.
2017-03-01 08:36:11 +00:00
//for (int i = 0; i < 10; ++i)
// tm.queued_tasks.enqueue(Task::MakeExit());
2017-02-23 09:23:23 +00:00
for (std::thread& thread : tm.threads)
thread.join();
std::cin.get();
return 0;
2017-03-02 18:25:40 +00:00
}