Formatting

src/auto_contiguous.cpp

@@ -12,7 +12,7 @@ void auto_contiguous::apply(module& p) const
 {
     for(auto ins : iterator_for(p))
     {
-        if (ins->name() == "layout")
+        if(ins->name() == "layout")
             continue;
         shape s = ins->get_shape();
         if(not s.standard() and s.elements() != 0)

src/eliminate_contiguous.cpp

@@ -73,12 +73,12 @@ void eliminate_contiguous::apply(module& p) const
         if(ins->name() == "@return")
             continue;
 
-        if (std::none_of(ins->inputs().begin(), ins->inputs().end(), [&](auto arg) {
-            return arg->name() == op_name;
-        }))
+        if(std::none_of(ins->inputs().begin(), ins->inputs().end(), [&](auto arg) {
+               return arg->name() == op_name;
+           }))
             continue;
         // Make a copy so we can modify it while we iterate
-        auto args = ins->inputs();
+        auto args     = ins->inputs();
         auto new_args = args;
         std::transform(new_args.begin(), new_args.end(), new_args.begin(), [&](auto arg) {
             if(arg->name() == op_name)
@@ -90,9 +90,9 @@ void eliminate_contiguous::apply(module& p) const
 
         if(try_compute_shape(ins, new_args))
         {
-            for(auto i:range(args.size()))
+            for(auto i : range(args.size()))
             {
-                if (args[i] == new_args[i])
+                if(args[i] == new_args[i])
                     continue;
                 instruction::replace_argument(ins, args[i], new_args[i]);
             }
@@ -103,8 +103,8 @@ void eliminate_contiguous::apply(module& p) const
             {
                 if(arg->name() == op_name)
                 {
-                    new_args = args;
-                    auto prev     = arg->inputs().front();
+                    new_args  = args;
+                    auto prev = arg->inputs().front();
                     replace(new_args, arg, prev);
                     if(try_compute_shape(ins, new_args))
                     {
@@ -121,8 +121,6 @@ void eliminate_contiguous::apply(module& p) const
                 }
             }
         }
-
-
     }
 }
 

src/targets/cpu/include/migraphx/cpu/dnnl.hpp

@@ -165,7 +165,10 @@ struct dnnl_op : auto_register_op<Derived>
             i++;
         }
     }
-    shape adjust_shape(const shape& s, int, const shape& output) const { return base_adjust_shape(s, output); }
+    shape adjust_shape(const shape& s, int, const shape& output) const
+    {
+        return base_adjust_shape(s, output);
+    }
     std::vector<int> create_arg_map(std::size_t input_size) const
     {
         const auto& self     = static_cast<const Derived&>(*this);
@@ -184,8 +187,9 @@ struct dnnl_op : auto_register_op<Derived>
     {
         const auto& self = static_cast<const Derived&>(*this);
         std::unordered_map<int, dnnl::memory::desc> result;
-        result[DNNL_ARG_DST] = to_dnnl_memory_desc(self.adjust_shape(output_shape, inputs.size(), output_shape));
-        auto m               = create_arg_map(inputs.size());
+        result[DNNL_ARG_DST] =
+            to_dnnl_memory_desc(self.adjust_shape(output_shape, inputs.size(), output_shape));
+        auto m = create_arg_map(inputs.size());
         assert(m.size() >= inputs.size());
         for(int i = 0; i < inputs.size(); i++)
         {