From 022e2f5ef4513750a5b2960ba0e8e825d8f640bb Mon Sep 17 00:00:00 2001
From: Gael Guennebaud <g.gael@free.fr>
Date: Tue, 23 Feb 2010 18:24:15 +0100
Subject: [PATCH] fix typo

---
 Eigen/src/Core/products/GeneralBlockPanelKernel.h | 6 +++---
 Eigen/src/Core/products/GeneralMatrixMatrix.h     | 2 +-
 Eigen/src/Core/util/Memory.h                      | 2 +-
 3 files changed, 5 insertions(+), 5 deletions(-)

diff --git a/Eigen/src/Core/products/GeneralBlockPanelKernel.h b/Eigen/src/Core/products/GeneralBlockPanelKernel.h
index dfc92c346..c29e4efc2 100644
--- a/Eigen/src/Core/products/GeneralBlockPanelKernel.h
+++ b/Eigen/src/Core/products/GeneralBlockPanelKernel.h
@@ -50,7 +50,7 @@ struct ei_gebp_kernel
     const int peeled_kc = (depth/4)*4;
 
     Scalar* unpackedB = const_cast<Scalar*>(blockB - strideB * nr * PacketSize);
-    
+
     // loops on each micro vertical panel of rhs (depth x nr)
     for(int j2=0; j2<packet_cols; j2+=nr)
     {
@@ -193,7 +193,7 @@ struct ei_gebp_kernel
           {
             PacketType B0, B1, B2, B3, A0, A1;
             PacketType T0;
-            
+
             A0 = ei_pload(&blA[0*PacketSize]);
             A1 = ei_pload(&blA[1*PacketSize]);
             B0 = ei_pload(&blB[0*PacketSize]);
@@ -516,7 +516,7 @@ struct ei_gebp_kernel
         for(int k=0; k<depth; k++)
           ei_pstore(&unpackedB[k*PacketSize], ei_pset1(blB[k]));
       }
-      
+
       for(int i=0; i<peeled_mc; i+=mr)
       {
         const Scalar* blA = &blockA[i*strideA+offsetA*mr];
diff --git a/Eigen/src/Core/products/GeneralMatrixMatrix.h b/Eigen/src/Core/products/GeneralMatrixMatrix.h
index 25c8d4c96..d4f1f1913 100644
--- a/Eigen/src/Core/products/GeneralMatrixMatrix.h
+++ b/Eigen/src/Core/products/GeneralMatrixMatrix.h
@@ -78,7 +78,7 @@ static void run(int rows, int cols, int depth,
   int kc = std::min<int>(Blocking::Max_kc,depth);  // cache block size along the K direction
   int mc = std::min<int>(Blocking::Max_mc,rows);   // cache block size along the M direction
 
-  Scalar* blockA = ei_aligned_stack_new(Scalar, kc*mc*8);
+  Scalar* blockA = ei_aligned_stack_new(Scalar, kc*mc);
   std::size_t sizeB = kc*Blocking::PacketSize*Blocking::nr + kc*cols;
   Scalar* allocatedBlockB = ei_aligned_stack_new(Scalar, sizeB);
   Scalar* blockB = allocatedBlockB + kc*Blocking::PacketSize*Blocking::nr;
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index d4920d213..c7b95d334 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -232,7 +232,7 @@ inline static Integer ei_first_aligned(const Scalar* array, Integer size)
   enum { PacketSize = ei_packet_traits<Scalar>::size,
          PacketAlignedMask = PacketSize-1
   };
-  
+
   if(PacketSize==1)
   {
     // Either there is no vectorization, or a packet consists of exactly 1 scalar so that all elements