<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.5"/>
<title>Eigen: SparseLU_gemm_kernel.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
$(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
$(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="eigendoxy.css" rel="stylesheet" type="text/css">
<!-- -->
<script type="text/javascript" src="eigen_navtree_hacks.js"></script>
<!-- <script type="text/javascript"> -->
<!-- </script> -->
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<!-- <a name="top"></a> -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectlogo"><img alt="Logo" src="Eigen_Silly_Professor_64x64.png"/></td>
<td style="padding-left: 0.5em;">
<div id="projectname"><a href="http://eigen.tuxfamily.org">Eigen</a>
 <span id="projectnumber">3.2.0</span>
</div>
</td>
<td> <div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<img id="MSearchSelect" src="search/mag_sel.png"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
alt=""/>
<input type="text" id="MSearchField" value="Search" accesskey="S"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"
onkeyup="searchBox.OnSearchFieldChange(event)"/>
</span><span class="right">
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.5 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('SparseLU__gemm__kernel_8h_source.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark"> </span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark"> </span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark"> </span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark"> </span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark"> </span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark"> </span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark"> </span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark"> </span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark"> </span>Friends</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(9)"><span class="SelectionMark"> </span>Groups</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(10)"><span class="SelectionMark"> </span>Pages</a></div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="headertitle">
<div class="title">SparseLU_gemm_kernel.h</div> </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// This file is part of Eigen, a lightweight C++ template library</span></div>
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// for linear algebra.</span></div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">//</span></div>
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// Copyright (C) 2012 Gael Guennebaud <gael.guennebaud@inria.fr></span></div>
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// This Source Code Form is subject to the terms of the Mozilla</span></div>
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// Public License v. 2.0. If a copy of the MPL was not distributed</span></div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.</span></div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> </div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="preprocessor">#ifndef EIGEN_SPARSELU_GEMM_KERNEL_H</span></div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="preprocessor"></span><span class="preprocessor">#define EIGEN_SPARSELU_GEMM_KERNEL_H</span></div>
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="keyword">namespace </span>Eigen {</div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> </div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="keyword">namespace </span>internal {</div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> </div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> </div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="keyword">template</span><<span class="keyword">typename</span> Scalar,<span class="keyword">typename</span> Index></div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> EIGEN_DONT_INLINE</div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="keywordtype">void</span> sparselu_gemm(Index m, Index n, Index d, <span class="keyword">const</span> Scalar* A, Index lda, <span class="keyword">const</span> Scalar* B, Index ldb, Scalar* C, Index ldc)</div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> {</div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  <span class="keyword">using namespace </span>Eigen::internal;</div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  </div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> packet_traits<Scalar>::type Packet;</div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  <span class="keyword">enum</span> {</div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  NumberOfRegisters = EIGEN_ARCH_DEFAULT_NUMBER_OF_REGISTERS,</div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  PacketSize = packet_traits<Scalar>::size,</div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  PM = 8, <span class="comment">// peeling in M</span></div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  RN = 2, <span class="comment">// register blocking</span></div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  RK = NumberOfRegisters>=16 ? 4 : 2, <span class="comment">// register blocking</span></div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  BM = 4096/<span class="keyword">sizeof</span>(Scalar), <span class="comment">// number of rows of A-C per chunk</span></div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  SM = PM*PacketSize <span class="comment">// step along M</span></div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  };</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  Index d_end = (d/RK)*RK; <span class="comment">// number of columns of A (rows of B) suitable for full register blocking</span></div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  Index n_end = (n/RN)*RN; <span class="comment">// number of columns of B-C suitable for processing RN columns at once</span></div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  Index i0 = internal::first_aligned(A,m);</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  </div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  eigen_internal_assert(((lda%PacketSize)==0) && ((ldc%PacketSize)==0) && (i0==internal::first_aligned(C,m)));</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  </div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="comment">// handle the non aligned rows of A and C without any optimization:</span></div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keywordflow">for</span>(Index i=0; i<i0; ++i)</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  {</div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordflow">for</span>(Index j=0; j<n; ++j)</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  {</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  Scalar c = C[i+j*ldc];</div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keywordflow">for</span>(Index k=0; k<d; ++k)</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  c += B[k+j*ldb] * A[i+k*lda];</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  C[i+j*ldc] = c;</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  }</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  }</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="comment">// process the remaining rows per chunk of BM rows</span></div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordflow">for</span>(Index ib=i0; ib<m; ib+=BM)</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  {</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  Index actual_b = std::min<Index>(BM, m-ib); <span class="comment">// actual number of rows</span></div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  Index actual_b_end1 = (actual_b/SM)*SM; <span class="comment">// actual number of rows suitable for peeling</span></div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  Index actual_b_end2 = (actual_b/PacketSize)*PacketSize; <span class="comment">// actual number of rows suitable for vectorization</span></div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  </div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="comment">// Let's process two columns of B-C at once</span></div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordflow">for</span>(Index j=0; j<n_end; j+=RN)</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  {</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keyword">const</span> Scalar* Bc0 = B+(j+0)*ldb;</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keyword">const</span> Scalar* Bc1 = B+(j+1)*ldb;</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  </div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordflow">for</span>(Index k=0; k<d_end; k+=RK)</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  {</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  </div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="comment">// load and expand a RN x RK block of B</span></div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  Packet b00, b10, b20, b30, b01, b11, b21, b31;</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  b00 = pset1<Packet>(Bc0[0]);</div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  b10 = pset1<Packet>(Bc0[1]);</div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">if</span>(RK==4) b20 = pset1<Packet>(Bc0[2]);</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">if</span>(RK==4) b30 = pset1<Packet>(Bc0[3]);</div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  b01 = pset1<Packet>(Bc1[0]);</div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  b11 = pset1<Packet>(Bc1[1]);</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">if</span>(RK==4) b21 = pset1<Packet>(Bc1[2]);</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordflow">if</span>(RK==4) b31 = pset1<Packet>(Bc1[3]);</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  </div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  Packet a0, a1, a2, a3, c0, c1, t0, t1;</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  </div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keyword">const</span> Scalar* A0 = A+ib+(k+0)*lda;</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keyword">const</span> Scalar* A1 = A+ib+(k+1)*lda;</div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keyword">const</span> Scalar* A2 = A+ib+(k+2)*lda;</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keyword">const</span> Scalar* A3 = A+ib+(k+3)*lda;</div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  </div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  Scalar* C0 = C+ib+(j+0)*ldc;</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  Scalar* C1 = C+ib+(j+1)*ldc;</div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  </div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  a0 = pload<Packet>(A0);</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  a1 = pload<Packet>(A1);</div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordflow">if</span>(RK==4)</div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  {</div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  a2 = pload<Packet>(A2);</div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  a3 = pload<Packet>(A3);</div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  }</div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  {</div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="comment">// workaround "may be used uninitialized in this function" warning</span></div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  a2 = a3 = a0;</div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  }</div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  </div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="preprocessor">#define KMADD(c, a, b, tmp) {tmp = b; tmp = pmul(a,tmp); c = padd(c,tmp);}</span></div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="preprocessor"></span><span class="preprocessor">#define WORK(I) \</span></div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="preprocessor"> c0 = pload<Packet>(C0+i+(I)*PacketSize); \</span></div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="preprocessor"> c1 = pload<Packet>(C1+i+(I)*PacketSize); \</span></div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="preprocessor"> KMADD(c0, a0, b00, t0) \</span></div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="preprocessor"> KMADD(c1, a0, b01, t1) \</span></div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="preprocessor"> a0 = pload<Packet>(A0+i+(I+1)*PacketSize); \</span></div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="preprocessor"> KMADD(c0, a1, b10, t0) \</span></div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="preprocessor"> KMADD(c1, a1, b11, t1) \</span></div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="preprocessor"> a1 = pload<Packet>(A1+i+(I+1)*PacketSize); \</span></div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="preprocessor"> if(RK==4) KMADD(c0, a2, b20, t0) \</span></div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="preprocessor"> if(RK==4) KMADD(c1, a2, b21, t1) \</span></div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="preprocessor"> if(RK==4) a2 = pload<Packet>(A2+i+(I+1)*PacketSize); \</span></div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="preprocessor"> if(RK==4) KMADD(c0, a3, b30, t0) \</span></div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="preprocessor"> if(RK==4) KMADD(c1, a3, b31, t1) \</span></div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="preprocessor"> if(RK==4) a3 = pload<Packet>(A3+i+(I+1)*PacketSize); \</span></div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="preprocessor"> pstore(C0+i+(I)*PacketSize, c0); \</span></div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="preprocessor"> pstore(C1+i+(I)*PacketSize, c1)</span></div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="preprocessor"></span> </div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="comment">// process rows of A' - C' with aggressive vectorization and peeling </span></div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">for</span>(Index i=0; i<actual_b_end1; i+=PacketSize*8)</div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  {</div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  EIGEN_ASM_COMMENT(<span class="stringliteral">"SPARSELU_GEMML_KERNEL1"</span>);</div>
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  prefetch((A0+i+(5)*PacketSize));</div>
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  prefetch((A1+i+(5)*PacketSize));</div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">if</span>(RK==4) prefetch((A2+i+(5)*PacketSize));</div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordflow">if</span>(RK==4) prefetch((A3+i+(5)*PacketSize));</div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  WORK(0);</div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  WORK(1);</div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  WORK(2);</div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  WORK(3);</div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  WORK(4);</div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  WORK(5);</div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  WORK(6);</div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  WORK(7);</div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  }</div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="comment">// process the remaining rows with vectorization only</span></div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordflow">for</span>(Index i=actual_b_end1; i<actual_b_end2; i+=PacketSize)</div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  {</div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  WORK(0);</div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  }</div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="preprocessor">#undef WORK</span></div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="preprocessor"></span> <span class="comment">// process the remaining rows without vectorization</span></div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordflow">for</span>(Index i=actual_b_end2; i<actual_b; ++i)</div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  {</div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keywordflow">if</span>(RK==4)</div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  {</div>
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  C0[i] += A0[i]*Bc0[0]+A1[i]*Bc0[1]+A2[i]*Bc0[2]+A3[i]*Bc0[3];</div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  C1[i] += A0[i]*Bc1[0]+A1[i]*Bc1[1]+A2[i]*Bc1[2]+A3[i]*Bc1[3];</div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  }</div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  {</div>
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  C0[i] += A0[i]*Bc0[0]+A1[i]*Bc0[1];</div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  C1[i] += A0[i]*Bc1[0]+A1[i]*Bc1[1];</div>
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  }</div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  }</div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  </div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  Bc0 += RK;</div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  Bc1 += RK;</div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  } <span class="comment">// peeled loop on k</span></div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  } <span class="comment">// peeled loop on the columns j</span></div>
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="comment">// process the last column (we now perform a matrux-vector product)</span></div>
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keywordflow">if</span>((n-n_end)>0)</div>
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  {</div>
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keyword">const</span> Scalar* Bc0 = B+(n-1)*ldb;</div>
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  </div>
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keywordflow">for</span>(Index k=0; k<d_end; k+=RK)</div>
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  {</div>
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  </div>
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="comment">// load and expand a 1 x RK block of B</span></div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  Packet b00, b10, b20, b30;</div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  b00 = pset1<Packet>(Bc0[0]);</div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  b10 = pset1<Packet>(Bc0[1]);</div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordflow">if</span>(RK==4) b20 = pset1<Packet>(Bc0[2]);</div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keywordflow">if</span>(RK==4) b30 = pset1<Packet>(Bc0[3]);</div>
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  </div>
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  Packet a0, a1, a2, a3, c0, t0<span class="comment">/*, t1*/</span>;</div>
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  </div>
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keyword">const</span> Scalar* A0 = A+ib+(k+0)*lda;</div>
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keyword">const</span> Scalar* A1 = A+ib+(k+1)*lda;</div>
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keyword">const</span> Scalar* A2 = A+ib+(k+2)*lda;</div>
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keyword">const</span> Scalar* A3 = A+ib+(k+3)*lda;</div>
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  </div>
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  Scalar* C0 = C+ib+(n_end)*ldc;</div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  </div>
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  a0 = pload<Packet>(A0);</div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  a1 = pload<Packet>(A1);</div>
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordflow">if</span>(RK==4)</div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  {</div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  a2 = pload<Packet>(A2);</div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  a3 = pload<Packet>(A3);</div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  }</div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  {</div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="comment">// workaround "may be used uninitialized in this function" warning</span></div>
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  a2 = a3 = a0;</div>
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  }</div>
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  </div>
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span> <span class="preprocessor">#define WORK(I) \</span></div>
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span> <span class="preprocessor"> c0 = pload<Packet>(C0+i+(I)*PacketSize); \</span></div>
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span> <span class="preprocessor"> KMADD(c0, a0, b00, t0) \</span></div>
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span> <span class="preprocessor"> a0 = pload<Packet>(A0+i+(I+1)*PacketSize); \</span></div>
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span> <span class="preprocessor"> KMADD(c0, a1, b10, t0) \</span></div>
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span> <span class="preprocessor"> a1 = pload<Packet>(A1+i+(I+1)*PacketSize); \</span></div>
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span> <span class="preprocessor"> if(RK==4) KMADD(c0, a2, b20, t0) \</span></div>
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span> <span class="preprocessor"> if(RK==4) a2 = pload<Packet>(A2+i+(I+1)*PacketSize); \</span></div>
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span> <span class="preprocessor"> if(RK==4) KMADD(c0, a3, b30, t0) \</span></div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span> <span class="preprocessor"> if(RK==4) a3 = pload<Packet>(A3+i+(I+1)*PacketSize); \</span></div>
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span> <span class="preprocessor"> pstore(C0+i+(I)*PacketSize, c0);</span></div>
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span> <span class="preprocessor"></span> </div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="comment">// agressive vectorization and peeling</span></div>
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keywordflow">for</span>(Index i=0; i<actual_b_end1; i+=PacketSize*8)</div>
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  {</div>
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  EIGEN_ASM_COMMENT(<span class="stringliteral">"SPARSELU_GEMML_KERNEL2"</span>);</div>
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  WORK(0);</div>
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  WORK(1);</div>
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  WORK(2);</div>
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  WORK(3);</div>
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  WORK(4);</div>
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  WORK(5);</div>
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  WORK(6);</div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  WORK(7);</div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  }</div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="comment">// vectorization only</span></div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keywordflow">for</span>(Index i=actual_b_end1; i<actual_b_end2; i+=PacketSize)</div>
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  {</div>
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  WORK(0);</div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  }</div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="comment">// remaining scalars</span></div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordflow">for</span>(Index i=actual_b_end2; i<actual_b; ++i)</div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  {</div>
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keywordflow">if</span>(RK==4) </div>
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  C0[i] += A0[i]*Bc0[0]+A1[i]*Bc0[1]+A2[i]*Bc0[2]+A3[i]*Bc0[3];</div>
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  C0[i] += A0[i]*Bc0[0]+A1[i]*Bc0[1];</div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  }</div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  </div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  Bc0 += RK;</div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span> <span class="preprocessor">#undef WORK</span></div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span> <span class="preprocessor"></span> }</div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  }</div>
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  </div>
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="comment">// process the last columns of A, corresponding to the last rows of B</span></div>
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  Index rd = d-d_end;</div>
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keywordflow">if</span>(rd>0)</div>
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  {</div>
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keywordflow">for</span>(Index j=0; j<n; ++j)</div>
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  {</div>
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keyword">enum</span> {</div>
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  Alignment = PacketSize>1 ? <a class="code" href="group__enums.html#gga456ac33d49271d3e2c371351cd1d6371ad5380ca00f3d74b38593adf8a0d06d3e">Aligned</a> : 0</div>
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  };</div>
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keyword">typedef</span> Map<Matrix<Scalar,Dynamic,1>, Alignment > MapVector;</div>
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keyword">typedef</span> Map<const Matrix<Scalar,Dynamic,1>, Alignment > ConstMapVector;</div>
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keywordflow">if</span>(rd==1) MapVector(C+j*ldc+ib,actual_b) += B[0+d_end+j*ldb] * ConstMapVector(A+(d_end+0)*lda+ib, actual_b);</div>
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  </div>
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span>(rd==2) MapVector(C+j*ldc+ib,actual_b) += B[0+d_end+j*ldb] * ConstMapVector(A+(d_end+0)*lda+ib, actual_b)</div>
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  + B[1+d_end+j*ldb] * ConstMapVector(A+(d_end+1)*lda+ib, actual_b);</div>
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  </div>
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordflow">else</span> MapVector(C+j*ldc+ib,actual_b) += B[0+d_end+j*ldb] * ConstMapVector(A+(d_end+0)*lda+ib, actual_b)</div>
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  + B[1+d_end+j*ldb] * ConstMapVector(A+(d_end+1)*lda+ib, actual_b)</div>
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  + B[2+d_end+j*ldb] * ConstMapVector(A+(d_end+2)*lda+ib, actual_b);</div>
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  }</div>
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  }</div>
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  </div>
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  } <span class="comment">// blocking on the rows of A and C</span></div>
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span> }</div>
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span> <span class="preprocessor">#undef KMADD</span></div>
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span> } <span class="comment">// namespace internal</span></div>
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span> </div>
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span> } <span class="comment">// namespace Eigen</span></div>
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span> </div>
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span> <span class="preprocessor">#endif // EIGEN_SPARSELU_GEMM_KERNEL_H</span></div>
<div class="ttc" id="group__enums_html_gga456ac33d49271d3e2c371351cd1d6371ad5380ca00f3d74b38593adf8a0d06d3e"><div class="ttname"><a href="group__enums.html#gga456ac33d49271d3e2c371351cd1d6371ad5380ca00f3d74b38593adf8a0d06d3e">Eigen::Aligned</a></div><div class="ttdef"><b>Definition:</b> Constants.h:194</div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_e49d68e3078f12dfcf157021597ad168.html">Eigen</a></li><li class="navelem"><a class="el" href="dir_64b228556dc7f9fe757d43bb57fbfc24.html">src</a></li><li class="navelem"><a class="el" href="dir_43b7fa11304fca39592f14c296504e53.html">SparseLU</a></li><li class="navelem"><b>SparseLU_gemm_kernel.h</b></li>
<li class="footer">Generated on Mon Oct 28 2013 11:04:25 for Eigen by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.5 </li>
</ul>
</div>
<!-- Piwik -->
<!--
<script type="text/javascript">
var pkBaseURL = (("https:" == document.location.protocol) ? "https://stats.sylphide-consulting.com/piwik/" : "http://stats.sylphide-consulting.com/piwik/");
document.write(unescape("%3Cscript src='" + pkBaseURL + "piwik.js' type='text/javascript'%3E%3C/script%3E"));
</script><script type="text/javascript">
try {
var piwikTracker = Piwik.getTracker(pkBaseURL + "piwik.php", 20);
piwikTracker.trackPageView();
piwikTracker.enableLinkTracking();
} catch( err ) {}
</script><noscript><p><img src="http://stats.sylphide-consulting.com/piwik/piwik.php?idsite=20" style="border:0" alt="" /></p></noscript>
-->
<!-- End Piwik Tracking Code -->
</body>
</html>
