Motown: wholesale clang-format

services/media/framework/engine.h

 // Copyright 2016 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 SERVICES_MEDIA_FRAMEWORK_ENGINE_H_
 #define SERVICES_MEDIA_FRAMEWORK_ENGINE_H_
 
 #include <list>
 #include <queue>
 #include <stack>
@@ skipping 89 matching lines @@
   // Queues the stage for update and winds down the backlog.
   void RequestUpdate(Stage* stage);
 
   // Pushes the stage to the supply backlog if it isn't already there.
   void PushToSupplyBacklog(Stage* stage);
 
   // Pushes the stage to the demand backlog if it isn't already there.
   void PushToDemandBacklog(Stage* stage);
 
  private:
-  using UpstreamVisitor = std::function<void(
-      const InputRef& input,
-      const OutputRef& output,
-      const Stage::UpstreamCallback& callback)>;
-  using DownstreamVisitor = std::function<void(
-      const OutputRef& output,
-      const InputRef& input,
-      const Stage::DownstreamCallback& callback)>;
+  using UpstreamVisitor =
+      std::function<void(const InputRef& input,
+                         const OutputRef& output,
+                         const Stage::UpstreamCallback& callback)>;
+  using DownstreamVisitor =
+      std::function<void(const OutputRef& output,
+                         const InputRef& input,
+                         const Stage::DownstreamCallback& callback)>;
 
-  void VisitUpstream(
-      const InputRef& input,
-      const UpstreamVisitor& vistor);
+  void VisitUpstream(const InputRef& input, const UpstreamVisitor& vistor);
 
-  void VisitDownstream(
-      const OutputRef& output,
-      const DownstreamVisitor& vistor);
+  void VisitDownstream(const OutputRef& output,
+                       const DownstreamVisitor& vistor);
 
   // Processes the entire backlog.
   void Update();
 
   // Performs processing for a single stage, updating the backlog accordingly.
-  void Update(Stage *stage);
+  void Update(Stage* stage);
 
   // Pops a stage from the supply backlog and returns it or returns nullptr if
   // the supply backlog is empty.
   Stage* PopFromSupplyBacklog();
 
   // Pops a stage from the demand backlog and returns it or returns nullptr if
   // the demand backlog is empty.
   Stage* PopFromDemandBacklog();
 
   mutable base::Lock lock_;
   // supply_backlog_ contains pointers to all the stages that have been supplied
   // (packets or frames) but have not been updated since. demand_backlog_ does
   // the same for demand. The use of queue vs stack here is a guess as to what
   // will yield the best results. It's possible that only a single backlog is
   // required.
   // TODO(dalesat): Determine the best ordering and implement it.
   std::queue<Stage*> supply_backlog_;
   std::stack<Stage*> demand_backlog_;
   bool packets_produced_;
 };
 
 }  // namespace media
 }  // namespace mojo
 
 #endif  // SERVICES_MEDIA_FRAMEWORK_ENGINE_H_