auto_contiguous always add contiguous after reshapes

These will get cleaned up later but result in us adding contiguous after
every reshape prior to us performing a find_reshape_alias matcher

src/auto_contiguous.cpp

@@ -25,12 +25,31 @@
 #include <migraphx/program.hpp>
 #include <migraphx/instruction.hpp>
 #include <migraphx/make_op.hpp>
-
 #include <migraphx/iterator_for.hpp>
+#include <migraphx/ranges.hpp>
 
 namespace migraphx {
 inline namespace MIGRAPHX_INLINE_NS {
 
+const auto& reshaper_op_names()
+{
+    // clang-format off
+    static const std::unordered_set<std::string> names = {
+        "flatten",
+        "reshape",
+        "contiguous",
+        "squeeze",
+        "unsqueeze"
+        "transpose",
+        "multibroadcast",
+        "broadcast"
+    };
+    // clang-format on
+    return names;
+}
+
+bool is_reshaper_op(instruction_ref ins) { return contains(reshaper_op_names(), ins->name()); }
+
 void auto_contiguous::apply(module& m) const
 {
     std::string key = "require_std_shape";
@@ -64,6 +83,14 @@ void auto_contiguous::apply(module& m) const
         // for last instruction that is NOT a return
         if(ins->outputs().empty() and ins != last)
             continue;
+
+        // perform a pass to insert contiguous for every reshape (without reshaper) before
+        // determining if aliasing can be performed
+        if(ins->name() == "reshape" and not is_reshaper_op(std::next(ins)))
+        {
+            m.insert_instruction(std::next(ins), make_op("contiguous"), ins);
+        }
+
         shape s = ins->get_shape();
         if(not s.dynamic() and not s.standard() and s.elements() != 0)
         {