[fsp] Add throttling for number of opened files.

chrome/browser/chromeos/file_system_provider/queue.h

Index: chrome/browser/chromeos/file_system_provider/queue.h
diff --git a/chrome/browser/chromeos/file_system_provider/queue.h b/chrome/browser/chromeos/file_system_provider/queue.h
new file mode 100644
index 0000000000000000000000000000000000000000..b12fe5e19a9c7c29a9b87835fe524604a297cb7b
--- /dev/null
+++ b/chrome/browser/chromeos/file_system_provider/queue.h
@@ -0,0 +1,99 @@
+// Copyright 2015 The Chromium Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef CHROME_BROWSER_CHROMEOS_FILE_SYSTEM_PROVIDER_QUEUE_H_
+#define CHROME_BROWSER_CHROMEOS_FILE_SYSTEM_PROVIDER_QUEUE_H_
+
+#include <deque>
+#include <map>
+
+#include "base/callback.h"
+#include "base/memory/ref_counted.h"
+#include "base/memory/weak_ptr.h"
+#include "chrome/browser/chromeos/file_system_provider/abort_callback.h"
+#include "storage/browser/fileapi/async_file_util.h"
+
+namespace chromeos {
+namespace file_system_provider {
+
+// Queues arbitrary tasks. At most |max_in_parallel_| tasks will be running at
+// once.
+//
+// The common use case is:
+// 1. Call NewToken() to obtain the token used bo all other methods.
+// 2. Call Enqueue() to enqueue the task.
+// 3. Call Complete() when the task is completed.
+// 4. Call Remove() to remove a completed task from the queue and run other
+//    enqueued tasks.
+//
+// Enqueued tasks can be aborted with the callback returned by Enqueue() any
+// time until they are marked as completed. Aborted tasks are automatically
+// removed from the queue if they were not executed yet, or executed but not
+// completed.
+//
+// In most cases you'll want to call Remove() and Complete() one after the
+// other. However, in some cases you may want to separate it. Eg. for limiting
+// number of opened files, you may want to call Complete() after opening is
+// completed, but Remove() after the file is closed. Note, that they can be
+// called at most once, and they must not be called for aborted tasks.
+class Queue {
+ public:
+  typedef base::Callback<AbortCallback(void)> AbortableCallback;
+
+  // Creates a queue with a maximum number of tasks running in parallel.
+  explicit Queue(size_t max_in_parallel);
+
+  virtual ~Queue();
+
+  // Creates a token for enqueuing (and later aborting) tasks.
+  size_t NewToken();
+
+  // Enqueues a task using a token generated with NewToken(). The task will be
+  // executed if there is space in the internal queue, otherwise it will wait
+  // until another task is finished. Once the task is finished, Complete() and
+  // Remove() must be called.
+  //
+  // The returned callback can be called to abort the task at any time. Once
+  // aborted, the task is automatically removed from the queue if the task
+  // was not executed, or executed but not completed, despite the result of
+  // |callback|'s aborting closure.
+  AbortCallback Enqueue(size_t token, const AbortableCallback& callback);
+
+  // Marks the previously enqueued task as complete. Must be called for each
+  // enqueued task (unless aborted). Note, that Remove() must be called in order
+  // to remove the task from the queue if it hasn't been aborted earlier.
+  // It must not be called more than one, nor for aborted tasks.
+  void Complete(size_t token);
+
+  // Removes the previously enqueued and completed task from the queue. Must not
+  // be called for aborted, or not completed tasks. Must not be called more than
+  // once.
+  void Remove(size_t token);
+
+ private:
+  struct Task;
+
+  // Runs the next task from the pending queue if there is less than
+  // |max_in_parallel_| tasks running at once.
+  void MaybeRun();
+
+  // Aborts a previously enqueued task. Returns the result asynchronously via
+  // |callback|. May be called at any time, but if already completed then
+  // FILE_ERROR_INVALID_OPERATION error code will be returned.
+  void Abort(size_t token,
+             const storage::AsyncFileUtil::StatusCallback& callback);
+
+  const size_t max_in_parallel_;
+  size_t next_token_;
+  std::deque<Task> pending_;
+  std::map<int, Task> executed_;
+
+  base::WeakPtrFactory<Queue> weak_ptr_factory_;
+  DISALLOW_COPY_AND_ASSIGN(Queue);
+};
+
+}  // namespace file_system_provider
+}  // namespace chromeos
+
+#endif  // CHROME_BROWSER_CHROMEOS_FILE_SYSTEM_PROVIDER_QUEUE_H_