GetNode for non-contiguous edges.

Author: jblueh

Common/include/geometry/dual_grid/CEdge.hpp

@@ -70,11 +70,15 @@ class CEdge {
   inline unsigned long GetNode(unsigned long iEdge, unsigned long iNode) const { return Nodes(iEdge,iNode); }
 
   /*!
-   * \brief SIMD version of GetNode, iNode returned for multiple contiguous iEdges
+   * \brief SIMD version of GetNode, iNode returned for multiple iEdges.
    */
   template<class T, size_t N>
   FORCEINLINE simd::Array<T,N> GetNode(simd::Array<T,N> iEdge, unsigned long iNode) const {
-    return simd::Array<T,N>(&Nodes(iEdge[0],iNode));
+    simd::Array<T,N> result;
+    for (size_t j = 0; j < N; ++j) {
+      result[j] = Nodes(iEdge[j], iNode);
+    }
+    return result;
   }
 
   /*!

Common/include/parallelization/vectorization.hpp

@@ -57,17 +57,8 @@ constexpr size_t PREFERRED_SIZE = 8;
 template<class T>
 constexpr size_t preferredLen() { return PREFERRED_SIZE / sizeof(T); }
 
-#if !defined(CODI_REVERSE_TYPE) && !defined(CODI_FORWARD_TYPE)
 template<>
 constexpr size_t preferredLen<su2double>() { return PREFERRED_SIZE / sizeof(passivedouble); }
-#else
-/* enforce one element per SIMD array since (1) arrays of AD types cannot be auto vectorized and (2) they might violate
- * exclusive read declarations if masking is not applied throughout */
-template<>
-constexpr size_t preferredLen<su2double>() { return 1; }
-#endif
-
-
 
 /*!
  * \class Array