Adding upstream version 14.2.21.upstream/14.2.21upstream

Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>

1 files changed, 111 insertions, 0 deletions

diff --git a/src/osd/mClockClientQueue.h b/src/osd/mClockClientQueue.h
new file mode 100644
index 00000000..84454ff6
--- /dev/null
+++ b/src/osd/mClockClientQueue.h
@@ -0,0 +1,111 @@
+// -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
+// vim: ts=8 sw=2 smarttab
+/*
+ * Ceph - scalable distributed file system
+ *
+ * Copyright (C) 2016 Red Hat Inc.
+ *
+ * This is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License version 2.1, as published by the Free Software
+ * Foundation.  See file COPYING.
+ *
+ */
+
+
+#pragma once
+
+#include <ostream>
+
+#include "boost/variant.hpp"
+
+#include "common/config.h"
+#include "common/ceph_context.h"
+#include "common/mClockPriorityQueue.h"
+#include "osd/OpQueueItem.h"
+#include "osd/mClockOpClassSupport.h"
+
+
+namespace ceph {
+
+  using Request = OpQueueItem;
+  using Client = uint64_t;
+
+  // This class exists to bridge the ceph code, which treats the class
+  // as the client, and the queue, where the class is
+  // osd_op_type_t. So this adapter class will transform calls
+  // appropriately.
+  class mClockClientQueue : public OpQueue<Request, Client> {
+
+    using osd_op_type_t = ceph::mclock::osd_op_type_t;
+
+    using InnerClient = std::pair<uint64_t,osd_op_type_t>;
+
+    using queue_t = mClockQueue<Request, InnerClient>;
+
+    queue_t queue;
+
+    ceph::mclock::OpClassClientInfoMgr client_info_mgr;
+
+  public:
+
+    mClockClientQueue(CephContext *cct);
+
+    const crimson::dmclock::ClientInfo* op_class_client_info_f(const InnerClient& client);
+
+    inline unsigned get_size_slow() const {
+      return queue.get_size_slow();
+    }
+
+    // Ops of this priority should be deleted immediately
+    inline void remove_by_class(Client cl,
+				std::list<Request> *out) override final {
+      queue.remove_by_filter(
+	[&cl, out] (Request&& r) -> bool {
+	  if (cl == r.get_owner()) {
+	    out->push_front(std::move(r));
+	    return true;
+	  } else {
+	    return false;
+	  }
+	});
+    }
+
+    void enqueue_strict(Client cl,
+			unsigned priority,
+			Request&& item) override final;
+
+    // Enqueue op in the front of the strict queue
+    void enqueue_strict_front(Client cl,
+			      unsigned priority,
+			      Request&& item) override final;
+
+    // Enqueue op in the back of the regular queue
+    void enqueue(Client cl,
+		 unsigned priority,
+		 unsigned cost,
+		 Request&& item) override final;
+
+    // Enqueue the op in the front of the regular queue
+    void enqueue_front(Client cl,
+		       unsigned priority,
+		       unsigned cost,
+		       Request&& item) override final;
+
+    // Return an op to be dispatch
+    Request dequeue() override final;
+
+    // Returns if the queue is empty
+    inline bool empty() const override final {
+      return queue.empty();
+    }
+
+    // Formatted output of the queue
+    void dump(ceph::Formatter *f) const override final;
+
+  protected:
+
+    InnerClient get_inner_client(const Client& cl, const Request& request);
+  }; // class mClockClientAdapter
+
+} // namespace ceph