zhangyiss/mlx
1
0
Fork 0
mirror of https://github.com/ml-explore/mlx.git synced 2025-11-04 18:48:15 +08:00
Code Issues Actions 1 Packages Projects Releases Wiki Activity
Files
5a14f96fb92403f986ae661514421299f09fef06
mlx/docs/build/html/sort_8h_source.html
CircleCI Docs 3bac79c1d6 rebase
2025-10-17 19:15:00 +00:00

880 lines
121 KiB
HTML
Raw Blame History

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.13.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>MLX: mlx/backend/metal/kernels/sort.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>
<script type="text/javascript" src="clipboard.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="cookie.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { init_search(); });
/* @license-end */
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectalign">
<div id="projectname">MLX
</div>
</td>
<td> <div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<span id="MSearchSelect" onmouseover="return searchBox.OnSearchSelectShow()" onmouseout="return searchBox.OnSearchSelectHide()">&#160;</span>
<input type="text" id="MSearchField" value="" placeholder="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.svg" alt=""/></a>
</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.13.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(0); });
/* @license-end */
</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">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){initNavTree('sort_8h_source.html',''); initResizable(true); });
/* @license-end */
</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)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="headertitle"><div class="title">sort.h</div></div>
</div><!--header-->
<div class="contents">
<a href="sort_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">// Copyright © 2023-2024 Apple Inc.</span></div>
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span> </div>
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"><a class="line" href="sort_8h.html#a0386011c52d03e60885a31e6fbd903dd"> 3</a></span><span class="preprocessor">#define MLX_MTL_CONST static constant constexpr const</span></div>
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"><a class="line" href="sort_8h.html#ad34b622323cebef136669fedd7229515"> 4</a></span><span class="preprocessor">#define MLX_MTL_LOOP_UNROLL _Pragma(&quot;clang loop unroll(full)&quot;)</span></div>
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span> </div>
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="keyword">using namespace </span><a class="code hl_namespace" href="namespacemetal.html">metal</a>;</div>
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span> </div>
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="comment">// Based on GPU merge sort algorithm at</span></div>
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment">// https://github.com/NVIDIA/cccl/tree/main/cub/cub</span></div>
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span></div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// Thread-level sort</span></div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span> </div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00016" data-start="{" data-end="}">
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"><a class="line" href="sort_8h.html#a6e8c2da4975a8001fd5ddf211a3058b7"> 16</a></span>METAL_FUNC <span class="keywordtype">void</span> <a class="code hl_function" href="sort_8h.html#a6e8c2da4975a8001fd5ddf211a3058b7">thread_swap</a>(thread T&amp; a, thread T&amp; b) {</div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span> T w = a;</div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span> a = b;</div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span> b = w;</div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span>}</div>
</div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span> </div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00023" data-start="{" data-end="};">
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"><a class="line" href="struct_less_than.html"> 23</a></span><span class="keyword">struct </span><a class="code hl_struct" href="struct_less_than.html">LessThan</a> {</div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"><a class="line" href="struct_less_than.html#abf97a6b0163048e4ba96460939dbd3a3"> 24</a></span> <span class="keyword">static</span> <span class="keyword">constexpr</span> constant T <a class="code hl_variable" href="struct_less_than.html#abf97a6b0163048e4ba96460939dbd3a3">init</a> = <a class="code hl_variable" href="struct_limits.html#a2f0673b6f9da89ce1d64f9f3d74f50a8">Limits&lt;T&gt;::max</a>;</div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span> </div>
<div class="foldopen" id="foldopen00026" data-start="{" data-end="}">
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"><a class="line" href="struct_less_than.html#a2798eb377b411c93a4ed30cf35caade2"> 26</a></span> METAL_FUNC <span class="keywordtype">bool</span> <a class="code hl_function" href="struct_less_than.html#a2798eb377b411c93a4ed30cf35caade2">operator()</a>(T a, T b) {</div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span> <span class="keywordflow">return</span> a &lt; b;</div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span> }</div>
</div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span>};</div>
</div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span> </div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="keyword">template</span> &lt;</div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> <span class="keyword">typename</span> ValT,</div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> <span class="keyword">typename</span> IdxT,</div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> <span class="keywordtype">bool</span> ARG_SORT,</div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> <span class="keywordtype">short</span> N_PER_THREAD,</div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> <span class="keyword">typename</span> CompareOp&gt;</div>
<div class="foldopen" id="foldopen00037" data-start="{" data-end="};">
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="struct_thread_sort.html"> 37</a></span><span class="keyword">struct </span><a class="code hl_struct" href="struct_thread_sort.html">ThreadSort</a> {</div>
<div class="foldopen" id="foldopen00038" data-start="{" data-end="}">
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"><a class="line" href="struct_thread_sort.html#a7c7cf65ffe4362596009fc1c05633e7a"> 38</a></span> <span class="keyword">static</span> METAL_FUNC <span class="keywordtype">void</span> <a class="code hl_function" href="struct_thread_sort.html#a7c7cf65ffe4362596009fc1c05633e7a">sort</a>(</div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> thread ValT (&amp;vals)[N_PER_THREAD],</div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> thread IdxT (&amp;idxs)[N_PER_THREAD]) {</div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> CompareOp op;</div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <a class="code hl_define" href="sort_8h.html#ad34b622323cebef136669fedd7229515">MLX_MTL_LOOP_UNROLL</a></div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <span class="keywordflow">for</span> (<span class="keywordtype">short</span> i = 0; i &lt; N_PER_THREAD; ++i) {</div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <a class="code hl_define" href="sort_8h.html#ad34b622323cebef136669fedd7229515">MLX_MTL_LOOP_UNROLL</a></div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="keywordflow">for</span> (<span class="keywordtype">short</span> j = i &amp; 1; j &lt; N_PER_THREAD - 1; j += 2) {</div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="keywordflow">if</span> (op(vals[j + 1], vals[j])) {</div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <a class="code hl_function" href="sort_8h.html#a6e8c2da4975a8001fd5ddf211a3058b7">thread_swap</a>(vals[j + 1], vals[j]);</div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <a class="code hl_function" href="sort_8h.html#a6e8c2da4975a8001fd5ddf211a3058b7">thread_swap</a>(idxs[j + 1], idxs[j]);</div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> }</div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> }</div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> }</div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> }</div>
</div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span>};</div>
</div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span></div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span><span class="comment">// Threadgroup-level sort</span></div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> </div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span><span class="keyword">template</span> &lt;</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="keyword">typename</span> ValT,</div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="keyword">typename</span> IdxT,</div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keywordtype">bool</span> ARG_SORT,</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordtype">short</span> BLOCK_THREADS,</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keywordtype">short</span> N_PER_THREAD,</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="keyword">typename</span> CompareOp&gt;</div>
<div class="foldopen" id="foldopen00066" data-start="{" data-end="};">
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"><a class="line" href="struct_block_merge_sort.html"> 66</a></span><span class="keyword">struct </span><a class="code hl_struct" href="struct_block_merge_sort.html">BlockMergeSort</a> {</div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="struct_block_merge_sort.html#afdec1074b7de04cbe083e3270b4ece88"> 67</a></span> <span class="keyword">using </span><a class="code hl_typedef" href="struct_block_merge_sort.html#afdec1074b7de04cbe083e3270b4ece88">thread_sort_t</a> =</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <a class="code hl_struct" href="struct_thread_sort.html">ThreadSort&lt;ValT, IdxT, ARG_SORT, N_PER_THREAD, CompareOp&gt;</a>;</div>
<div class="foldopen" id="foldopen00069" data-start="{" data-end="}">
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"><a class="line" href="struct_block_merge_sort.html#ad5bd0d853e9b4352ecfd902a706d7178"> 69</a></span> <span class="keyword">static</span> METAL_FUNC <span class="keywordtype">int</span> <a class="code hl_function" href="struct_block_merge_sort.html#ad5bd0d853e9b4352ecfd902a706d7178">merge_partition</a>(</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="keyword">const</span> threadgroup ValT* As,</div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="keyword">const</span> threadgroup ValT* Bs,</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="keywordtype">short</span> A_sz,</div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="keywordtype">short</span> B_sz,</div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="keywordtype">short</span> sort_md) {</div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> CompareOp op;</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> </div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="keywordtype">short</span> A_st = <a class="code hl_function" href="namespacemetal.html#a853c80479ab2264d9c4587c7bcac767b">max</a>(0, sort_md - B_sz);</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="keywordtype">short</span> A_ed = <a class="code hl_function" href="namespacemetal.html#a6653b28c9473087141eddce39878d4d3">min</a>(sort_md, A_sz);</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> </div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <span class="keywordflow">while</span> (A_st &lt; A_ed) {</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="keywordtype">short</span> md = A_st + (A_ed - A_st) / 2;</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="keyword">auto</span> a = As[md];</div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <span class="keyword">auto</span> b = Bs[sort_md - 1 - md];</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> </div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="keywordflow">if</span> (op(b, a)) {</div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> A_ed = md;</div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> A_st = md + 1;</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> }</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> }</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> </div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="keywordflow">return</span> A_ed;</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> }</div>
</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> </div>
<div class="foldopen" id="foldopen00095" data-start="{" data-end="}">
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"><a class="line" href="struct_block_merge_sort.html#a0386ce33d7bcfd12dbb17558d26da1bb"> 95</a></span> <span class="keyword">static</span> METAL_FUNC <span class="keywordtype">void</span> <a class="code hl_function" href="struct_block_merge_sort.html#a0386ce33d7bcfd12dbb17558d26da1bb">merge_step</a>(</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="keyword">const</span> threadgroup ValT* As,</div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="keyword">const</span> threadgroup ValT* Bs,</div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <span class="keyword">const</span> threadgroup IdxT* As_idx,</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="keyword">const</span> threadgroup IdxT* Bs_idx,</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="keywordtype">short</span> A_sz,</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="keywordtype">short</span> B_sz,</div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> thread ValT (&amp;vals)[N_PER_THREAD],</div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> thread IdxT (&amp;idxs)[N_PER_THREAD]) {</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> CompareOp op;</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="keywordtype">short</span> a_idx = 0;</div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <span class="keywordtype">short</span> b_idx = 0;</div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> </div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; N_PER_THREAD; ++i) {</div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="keyword">auto</span> a = As[a_idx];</div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="keyword">auto</span> b = Bs[b_idx];</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <span class="keywordtype">bool</span> pred = (b_idx &lt; B_sz) &amp;&amp; (a_idx &gt;= A_sz || op(b, a));</div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> </div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> vals[i] = pred ? b : a;</div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> idxs[i] = pred ? Bs_idx[b_idx] : As_idx[a_idx];</div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> </div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> b_idx += short(pred);</div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> a_idx += short(!pred);</div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> }</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> }</div>
</div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> </div>
<div class="foldopen" id="foldopen00121" data-start="{" data-end="}">
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"><a class="line" href="struct_block_merge_sort.html#ad25513c2d02802ac35edb086aceb4ce8"> 121</a></span> <span class="keyword">static</span> METAL_FUNC <span class="keywordtype">void</span> <a class="code hl_function" href="struct_block_merge_sort.html#ad25513c2d02802ac35edb086aceb4ce8">sort</a>(</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> threadgroup ValT* tgp_vals [[threadgroup(0)]],</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> threadgroup IdxT* tgp_idxs [[threadgroup(1)]],</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="keywordtype">int</span> size_sorted_axis,</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> uint3 lid [[thread_position_in_threadgroup]]) {</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="comment">// Get thread location</span></div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <span class="keywordtype">int</span> idx = lid.x * N_PER_THREAD;</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> </div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <span class="comment">// Load from shared memory</span></div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> thread ValT thread_vals[N_PER_THREAD];</div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> thread IdxT thread_idxs[N_PER_THREAD];</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; N_PER_THREAD; ++i) {</div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> thread_vals[i] = tgp_vals[idx + i];</div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> <span class="keywordflow">if</span> (ARG_SORT) {</div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> thread_idxs[i] = tgp_idxs[idx + i];</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> }</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> }</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> </div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <span class="comment">// Per thread sort</span></div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="keywordflow">if</span> (idx &lt; size_sorted_axis) {</div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> <a class="code hl_function" href="struct_thread_sort.html#a7c7cf65ffe4362596009fc1c05633e7a">thread_sort_t::sort</a>(thread_vals, thread_idxs);</div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> }</div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> </div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <span class="comment">// Do merges using threadgroup memory</span></div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> merge_threads = 2; merge_threads &lt;= BLOCK_THREADS;</div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> merge_threads *= 2) {</div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <span class="comment">// Update threadgroup memory</span></div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> threadgroup_barrier(mem_flags::mem_threadgroup);</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; N_PER_THREAD; ++i) {</div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> tgp_vals[idx + i] = thread_vals[i];</div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> <span class="keywordflow">if</span> (ARG_SORT) {</div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> tgp_idxs[idx + i] = thread_idxs[i];</div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> }</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> }</div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> threadgroup_barrier(mem_flags::mem_threadgroup);</div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> </div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <span class="comment">// Find location in merge step</span></div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <span class="keywordtype">int</span> merge_group = lid.x / merge_threads;</div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> <span class="keywordtype">int</span> merge_lane = lid.x % merge_threads;</div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> </div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <span class="keywordtype">int</span> sort_sz = N_PER_THREAD * merge_threads;</div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> <span class="keywordtype">int</span> sort_st = N_PER_THREAD * merge_threads * merge_group;</div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> </div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <span class="comment">// As = tgp_vals[A_st:A_ed] is sorted</span></div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> <span class="comment">// Bs = tgp_vals[B_st:B_ed] is sorted</span></div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> <span class="keywordtype">int</span> A_st = sort_st;</div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> <span class="keywordtype">int</span> A_ed = sort_st + sort_sz / 2;</div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> <span class="keywordtype">int</span> B_st = sort_st + sort_sz / 2;</div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <span class="keywordtype">int</span> B_ed = sort_st + sort_sz;</div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> </div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> <span class="keyword">const</span> threadgroup ValT* As = tgp_vals + A_st;</div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <span class="keyword">const</span> threadgroup ValT* Bs = tgp_vals + B_st;</div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <span class="keywordtype">int</span> A_sz = A_ed - A_st;</div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="keywordtype">int</span> B_sz = B_ed - B_st;</div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> </div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <span class="comment">// Find a partition of merge elements</span></div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <span class="comment">// Ci = merge(As[partition:], Bs[sort_md - partition:])</span></div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> <span class="comment">// of size N_PER_THREAD for each merge lane i</span></div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="comment">// C = [Ci] is sorted</span></div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> <span class="keywordtype">int</span> sort_md = N_PER_THREAD * merge_lane;</div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> <span class="keywordtype">int</span> partition = <a class="code hl_function" href="struct_block_merge_sort.html#ad5bd0d853e9b4352ecfd902a706d7178">merge_partition</a>(As, Bs, A_sz, B_sz, sort_md);</div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> </div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> As += partition;</div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> Bs += sort_md - partition;</div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> </div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> A_sz -= partition;</div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> B_sz -= sort_md - partition;</div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> </div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> <span class="keyword">const</span> threadgroup IdxT* As_idx =</div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> ARG_SORT ? tgp_idxs + A_st + partition : <span class="keyword">nullptr</span>;</div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> <span class="keyword">const</span> threadgroup IdxT* Bs_idx =</div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> ARG_SORT ? tgp_idxs + B_st + sort_md - partition : <span class="keyword">nullptr</span>;</div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> </div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> <span class="comment">// Merge starting at the partition and store results in thread registers</span></div>
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> <a class="code hl_function" href="struct_block_merge_sort.html#a0386ce33d7bcfd12dbb17558d26da1bb">merge_step</a>(As, Bs, As_idx, Bs_idx, A_sz, B_sz, thread_vals, thread_idxs);</div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> }</div>
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> </div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> <span class="comment">// Write out to shared memory</span></div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> threadgroup_barrier(mem_flags::mem_threadgroup);</div>
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; N_PER_THREAD; ++i) {</div>
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> tgp_vals[idx + i] = thread_vals[i];</div>
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <span class="keywordflow">if</span> (ARG_SORT) {</div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> tgp_idxs[idx + i] = thread_idxs[i];</div>
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> }</div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> }</div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> }</div>
</div>
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span>};</div>
</div>
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span></div>
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span><span class="comment">// Kernel sort</span></div>
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> </div>
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span><span class="keyword">template</span> &lt;</div>
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <span class="keyword">typename</span> T,</div>
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <span class="keyword">typename</span> U,</div>
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> <span class="keywordtype">bool</span> ARG_SORT,</div>
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> <span class="keywordtype">short</span> BLOCK_THREADS,</div>
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> <span class="keywordtype">short</span> N_PER_THREAD,</div>
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> <span class="keyword">typename</span> CompareOp = <a class="code hl_struct" href="struct_less_than.html">LessThan&lt;T&gt;</a>&gt;</div>
<div class="foldopen" id="foldopen00220" data-start="{" data-end="};">
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"><a class="line" href="struct_kernel_merge_sort.html"> 220</a></span><span class="keyword">struct </span><a class="code hl_struct" href="struct_kernel_merge_sort.html">KernelMergeSort</a> {</div>
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"><a class="line" href="struct_kernel_merge_sort.html#a92910d137ea47703820cde5666d80574"> 221</a></span> <span class="keyword">using </span><a class="code hl_typedef" href="struct_kernel_merge_sort.html#a92910d137ea47703820cde5666d80574">ValT</a> = T;</div>
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"><a class="line" href="struct_kernel_merge_sort.html#a587b32e6748cffd2ace5a70b8c59dee4"> 222</a></span> <span class="keyword">using </span><a class="code hl_typedef" href="struct_kernel_merge_sort.html#a587b32e6748cffd2ace5a70b8c59dee4">IdxT</a> = uint;</div>
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"><a class="line" href="struct_kernel_merge_sort.html#a37b94702630a4f97254d1da847d420c0"> 223</a></span> <span class="keyword">using </span><a class="code hl_typedef" href="struct_kernel_merge_sort.html#a37b94702630a4f97254d1da847d420c0">block_merge_sort_t</a> = <a class="code hl_struct" href="struct_block_merge_sort.html">BlockMergeSort</a>&lt;</div>
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> <a class="code hl_typedef" href="struct_kernel_merge_sort.html#a92910d137ea47703820cde5666d80574">ValT</a>,</div>
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> <a class="code hl_typedef" href="struct_kernel_merge_sort.html#a587b32e6748cffd2ace5a70b8c59dee4">IdxT</a>,</div>
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> ARG_SORT,</div>
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> BLOCK_THREADS,</div>
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> N_PER_THREAD,</div>
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> CompareOp&gt;;</div>
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> </div>
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"><a class="line" href="struct_kernel_merge_sort.html#a959aaf5bfb70796a525fed318f7ae8ab"> 231</a></span> <a class="code hl_define" href="sort_8h.html#a0386011c52d03e60885a31e6fbd903dd">MLX_MTL_CONST</a> <span class="keywordtype">short</span> <a class="code hl_variable" href="struct_kernel_merge_sort.html#a959aaf5bfb70796a525fed318f7ae8ab">N_PER_BLOCK</a> = BLOCK_THREADS * N_PER_THREAD;</div>
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> </div>
<div class="foldopen" id="foldopen00233" data-start="{" data-end="}">
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"><a class="line" href="struct_kernel_merge_sort.html#a90102e73c3f6e9652e9870d57b129e71"> 233</a></span> <span class="keyword">static</span> METAL_FUNC <span class="keywordtype">void</span> <a class="code hl_function" href="struct_kernel_merge_sort.html#a90102e73c3f6e9652e9870d57b129e71">block_sort</a>(</div>
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> <span class="keyword">const</span> device T* inp,</div>
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> device U* out,</div>
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>&amp; size_sorted_axis,</div>
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>&amp; in_stride_sorted_axis,</div>
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>&amp; out_stride_sorted_axis,</div>
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>&amp; in_stride_segment_axis,</div>
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>&amp; out_stride_segment_axis,</div>
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> threadgroup <a class="code hl_typedef" href="struct_kernel_merge_sort.html#a92910d137ea47703820cde5666d80574">ValT</a>* tgp_vals,</div>
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> threadgroup <a class="code hl_typedef" href="struct_kernel_merge_sort.html#a587b32e6748cffd2ace5a70b8c59dee4">IdxT</a>* tgp_idxs,</div>
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> uint3 tid [[threadgroup_position_in_grid]],</div>
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> uint3 lid [[thread_position_in_threadgroup]]) {</div>
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> <span class="comment">// tid.y tells us the segment index</span></div>
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> inp += tid.y * in_stride_segment_axis;</div>
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> out += tid.y * out_stride_segment_axis;</div>
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> </div>
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> <span class="comment">// Copy into threadgroup memory</span></div>
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> <span class="keywordflow">for</span> (<span class="keywordtype">short</span> i = lid.x; i &lt; <a class="code hl_variable" href="struct_kernel_merge_sort.html#a959aaf5bfb70796a525fed318f7ae8ab">N_PER_BLOCK</a>; i += BLOCK_THREADS) {</div>
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> tgp_vals[i] = i &lt; size_sorted_axis ? inp[i * in_stride_sorted_axis]</div>
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> : <a class="code hl_typedef" href="struct_kernel_merge_sort.html#a92910d137ea47703820cde5666d80574">ValT</a>(CompareOp::init);</div>
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> <span class="keywordflow">if</span> (ARG_SORT) {</div>
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> tgp_idxs[i] = i;</div>
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> }</div>
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> }</div>
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> </div>
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> <span class="comment">// Sort elements within the block</span></div>
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> threadgroup_barrier(mem_flags::mem_threadgroup);</div>
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> </div>
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> <a class="code hl_function" href="struct_block_merge_sort.html#ad25513c2d02802ac35edb086aceb4ce8">block_merge_sort_t::sort</a>(tgp_vals, tgp_idxs, size_sorted_axis, lid);</div>
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> </div>
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> threadgroup_barrier(mem_flags::mem_threadgroup);</div>
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> </div>
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> <span class="comment">// Write output</span></div>
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = lid.x; i &lt; size_sorted_axis; i += BLOCK_THREADS) {</div>
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> <span class="keywordflow">if</span> (ARG_SORT) {</div>
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> out[i * out_stride_sorted_axis] = tgp_idxs[i];</div>
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> out[i * out_stride_sorted_axis] = tgp_vals[i];</div>
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> }</div>
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> }</div>
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> }</div>
</div>
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span>};</div>
</div>
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> </div>
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span><span class="keyword">template</span> &lt;</div>
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> <span class="keyword">typename</span> T,</div>
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> <span class="keyword">typename</span> U,</div>
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> <span class="keywordtype">bool</span> ARG_SORT,</div>
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> <span class="keywordtype">short</span> BLOCK_THREADS,</div>
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> <span class="keywordtype">short</span> N_PER_THREAD&gt;</div>
<div class="foldopen" id="foldopen00282" data-start="{" data-end="}">
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"><a class="line" href="sort_8h.html#a93f14092416169c4449141043ac45ffd"> 282</a></span>[[kernel, max_total_threads_per_threadgroup(BLOCK_THREADS)]] <span class="keywordtype">void</span> <a class="code hl_function" href="sort_8h.html#a93f14092416169c4449141043ac45ffd">block_sort</a>(</div>
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> <span class="keyword">const</span> device T* inp [[buffer(0)]],</div>
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> device U* out [[buffer(1)]],</div>
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>&amp; size_sorted_axis [[buffer(2)]],</div>
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>&amp; in_stride_sorted_axis [[buffer(3)]],</div>
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>&amp; out_stride_sorted_axis [[buffer(4)]],</div>
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>&amp; in_stride_segment_axis [[buffer(5)]],</div>
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>&amp; out_stride_segment_axis [[buffer(6)]],</div>
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> uint3 tid [[threadgroup_position_in_grid]],</div>
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> uint3 lid [[thread_position_in_threadgroup]]) {</div>
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> <span class="keyword">using </span>sort_kernel =</div>
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> <a class="code hl_struct" href="struct_kernel_merge_sort.html">KernelMergeSort&lt;T, U, ARG_SORT, BLOCK_THREADS, N_PER_THREAD&gt;</a>;</div>
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> <span class="keyword">using </span>ValT = <span class="keyword">typename</span> sort_kernel::ValT;</div>
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> <span class="keyword">using </span>IdxT = <span class="keyword">typename</span> sort_kernel::IdxT;</div>
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> </div>
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> <span class="keywordflow">if</span> (ARG_SORT) {</div>
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> threadgroup ValT tgp_vals[sort_kernel::N_PER_BLOCK];</div>
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> threadgroup IdxT tgp_idxs[sort_kernel::N_PER_BLOCK];</div>
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> sort_kernel::block_sort(</div>
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> inp,</div>
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> out,</div>
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> size_sorted_axis,</div>
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> in_stride_sorted_axis,</div>
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> out_stride_sorted_axis,</div>
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> in_stride_segment_axis,</div>
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> out_stride_segment_axis,</div>
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> tgp_vals,</div>
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> tgp_idxs,</div>
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> tid,</div>
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> lid);</div>
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> threadgroup ValT tgp_vals[sort_kernel::N_PER_BLOCK];</div>
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> sort_kernel::block_sort(</div>
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> inp,</div>
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> out,</div>
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</span> size_sorted_axis,</div>
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> in_stride_sorted_axis,</div>
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> out_stride_sorted_axis,</div>
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> in_stride_segment_axis,</div>
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span> out_stride_segment_axis,</div>
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> tgp_vals,</div>
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> <span class="keyword">nullptr</span>,</div>
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> tid,</div>
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> lid);</div>
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span> }</div>
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span>}</div>
</div>
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> </div>
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"><a class="line" href="sort_8h.html#aca8b6f36c9024b8406fe545765316dc0"> 329</a></span>constant <span class="keyword">constexpr</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="sort_8h.html#aca8b6f36c9024b8406fe545765316dc0">zero_helper</a> = 0;</div>
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"> 330</span> </div>
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"> 331</span><span class="keyword">template</span> &lt;</div>
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</span> <span class="keyword">typename</span> T,</div>
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"> 333</span> <span class="keyword">typename</span> U,</div>
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"> 334</span> <span class="keywordtype">bool</span> ARG_SORT,</div>
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span> <span class="keywordtype">short</span> BLOCK_THREADS,</div>
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span> <span class="keywordtype">short</span> N_PER_THREAD&gt;</div>
<div class="foldopen" id="foldopen00337" data-start="{" data-end="}">
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"><a class="line" href="sort_8h.html#ad272ef4422c75565a79b7f5e751bb247"> 337</a></span>[[kernel, max_total_threads_per_threadgroup(BLOCK_THREADS)]] <span class="keywordtype">void</span> <a class="code hl_function" href="sort_8h.html#ad272ef4422c75565a79b7f5e751bb247">block_sort_nc</a>(</div>
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> <span class="keyword">const</span> device T* inp [[buffer(0)]],</div>
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> device U* out [[buffer(1)]],</div>
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>&amp; size_sorted_axis [[buffer(2)]],</div>
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>&amp; in_stride_sorted_axis [[buffer(3)]],</div>
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>&amp; out_stride_sorted_axis [[buffer(4)]],</div>
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno"> 343</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>&amp; nc_dim [[buffer(5)]],</div>
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>* nc_shape [[buffer(6)]],</div>
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span> <span class="keyword">const</span> constant int64_t* in_nc_strides [[buffer(7)]],</div>
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span> <span class="keyword">const</span> constant int64_t* out_nc_strides [[buffer(8)]],</div>
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> uint3 tid [[threadgroup_position_in_grid]],</div>
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> uint3 lid [[thread_position_in_threadgroup]]) {</div>
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> <span class="keyword">using </span>sort_kernel =</div>
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span> <a class="code hl_struct" href="struct_kernel_merge_sort.html">KernelMergeSort&lt;T, U, ARG_SORT, BLOCK_THREADS, N_PER_THREAD&gt;</a>;</div>
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span> <span class="keyword">using </span>ValT = <span class="keyword">typename</span> sort_kernel::ValT;</div>
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</span> <span class="keyword">using </span>IdxT = <span class="keyword">typename</span> sort_kernel::IdxT;</div>
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"> 353</span> </div>
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno"> 354</span> <span class="keyword">auto</span> in_block_idx = <a class="code hl_function" href="backend_2metal_2kernels_2utils_8h.html#a497dd9f1a00c8a4303d8782158a0812a">elem_to_loc</a>(tid.y, nc_shape, in_nc_strides, nc_dim);</div>
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"> 355</span> <span class="keyword">auto</span> out_block_idx = <a class="code hl_function" href="backend_2metal_2kernels_2utils_8h.html#a497dd9f1a00c8a4303d8782158a0812a">elem_to_loc</a>(tid.y, nc_shape, out_nc_strides, nc_dim);</div>
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span> inp += in_block_idx;</div>
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span> out += out_block_idx;</div>
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> </div>
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</span> <span class="keywordflow">if</span> (ARG_SORT) {</div>
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"> 360</span> threadgroup ValT tgp_vals[sort_kernel::N_PER_BLOCK];</div>
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span> threadgroup IdxT tgp_idxs[sort_kernel::N_PER_BLOCK];</div>
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span> sort_kernel::block_sort(</div>
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span> inp,</div>
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</span> out,</div>
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span> size_sorted_axis,</div>
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span> in_stride_sorted_axis,</div>
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"> 367</span> out_stride_sorted_axis,</div>
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span> <a class="code hl_variable" href="sort_8h.html#aca8b6f36c9024b8406fe545765316dc0">zero_helper</a>,</div>
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"> 369</span> <a class="code hl_variable" href="sort_8h.html#aca8b6f36c9024b8406fe545765316dc0">zero_helper</a>,</div>
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"> 370</span> tgp_vals,</div>
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span> tgp_idxs,</div>
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span> tid,</div>
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span> lid);</div>
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"> 375</span> threadgroup ValT tgp_vals[sort_kernel::N_PER_BLOCK];</div>
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno"> 376</span> sort_kernel::block_sort(</div>
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"> 377</span> inp,</div>
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span> out,</div>
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span> size_sorted_axis,</div>
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"> 380</span> in_stride_sorted_axis,</div>
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno"> 381</span> out_stride_sorted_axis,</div>
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span> <a class="code hl_variable" href="sort_8h.html#aca8b6f36c9024b8406fe545765316dc0">zero_helper</a>,</div>
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</span> <a class="code hl_variable" href="sort_8h.html#aca8b6f36c9024b8406fe545765316dc0">zero_helper</a>,</div>
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno"> 384</span> tgp_vals,</div>
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno"> 385</span> <span class="keyword">nullptr</span>,</div>
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"> 386</span> tid,</div>
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span> lid);</div>
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"> 388</span> }</div>
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno"> 389</span>}</div>
</div>
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"> 390</span> </div>
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"> 391</span><span class="keyword">template</span> &lt;</div>
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</span> <span class="keyword">typename</span> ValT,</div>
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"> 393</span> <span class="keyword">typename</span> IdxT,</div>
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"> 394</span> <span class="keywordtype">bool</span> ARG_SORT,</div>
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno"> 395</span> <span class="keywordtype">short</span> BLOCK_THREADS,</div>
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno"> 396</span> <span class="keywordtype">short</span> N_PER_THREAD,</div>
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno"> 397</span> <span class="keyword">typename</span> CompareOp = <a class="code hl_struct" href="struct_less_than.html">LessThan&lt;ValT&gt;</a>&gt;</div>
<div class="foldopen" id="foldopen00398" data-start="{" data-end="};">
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"><a class="line" href="struct_kernel_multi_block_merge_sort.html"> 398</a></span><span class="keyword">struct </span><a class="code hl_struct" href="struct_kernel_multi_block_merge_sort.html">KernelMultiBlockMergeSort</a> {</div>
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno"><a class="line" href="struct_kernel_multi_block_merge_sort.html#aaf08efb1c540b276b0f1bbdeb514544d"> 399</a></span> <span class="keyword">using </span><a class="code hl_typedef" href="struct_kernel_multi_block_merge_sort.html#aaf08efb1c540b276b0f1bbdeb514544d">block_merge_sort_t</a> = <a class="code hl_struct" href="struct_block_merge_sort.html">BlockMergeSort</a>&lt;</div>
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno"> 400</span> ValT,</div>
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno"> 401</span> IdxT,</div>
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno"> 402</span> ARG_SORT,</div>
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno"> 403</span> BLOCK_THREADS,</div>
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno"> 404</span> N_PER_THREAD,</div>
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"> 405</span> CompareOp&gt;;</div>
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"> 406</span> </div>
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno"><a class="line" href="struct_kernel_multi_block_merge_sort.html#a4a0c920980c5e56471558d22a727a514"> 407</a></span> <a class="code hl_define" href="sort_8h.html#a0386011c52d03e60885a31e6fbd903dd">MLX_MTL_CONST</a> <span class="keywordtype">short</span> <a class="code hl_variable" href="struct_kernel_multi_block_merge_sort.html#a4a0c920980c5e56471558d22a727a514">N_PER_BLOCK</a> = BLOCK_THREADS * N_PER_THREAD;</div>
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"> 408</span> </div>
<div class="foldopen" id="foldopen00409" data-start="{" data-end="}">
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"><a class="line" href="struct_kernel_multi_block_merge_sort.html#a56b3d8bf726e5619325dd07752666f8a"> 409</a></span> <span class="keyword">static</span> METAL_FUNC <span class="keywordtype">void</span> <a class="code hl_function" href="struct_kernel_multi_block_merge_sort.html#a56b3d8bf726e5619325dd07752666f8a">block_sort</a>(</div>
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"> 410</span> <span class="keyword">const</span> device ValT* inp,</div>
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno"> 411</span> device ValT* out_vals,</div>
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno"> 412</span> device IdxT* out_idxs,</div>
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno"> 413</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>&amp; size_sorted_axis,</div>
<div class="line"><a id="l00414" name="l00414"></a><span class="lineno"> 414</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>&amp; stride_sorted_axis,</div>
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno"> 415</span> threadgroup ValT* tgp_vals,</div>
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno"> 416</span> threadgroup IdxT* tgp_idxs,</div>
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno"> 417</span> uint3 tid [[threadgroup_position_in_grid]],</div>
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno"> 418</span> uint3 lid [[thread_position_in_threadgroup]]) {</div>
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno"> 419</span> <span class="comment">// tid.y tells us the segment index</span></div>
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno"> 420</span> <span class="keywordtype">int</span> base_idx = tid.x * <a class="code hl_variable" href="struct_kernel_multi_block_merge_sort.html#a4a0c920980c5e56471558d22a727a514">N_PER_BLOCK</a>;</div>
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno"> 421</span> </div>
<div class="line"><a id="l00422" name="l00422"></a><span class="lineno"> 422</span> <span class="comment">// Copy into threadgroup memory</span></div>
<div class="line"><a id="l00423" name="l00423"></a><span class="lineno"> 423</span> <span class="keywordflow">for</span> (<span class="keywordtype">short</span> i = lid.x; i &lt; <a class="code hl_variable" href="struct_kernel_multi_block_merge_sort.html#a4a0c920980c5e56471558d22a727a514">N_PER_BLOCK</a>; i += BLOCK_THREADS) {</div>
<div class="line"><a id="l00424" name="l00424"></a><span class="lineno"> 424</span> <span class="keywordtype">int</span> idx = base_idx + i;</div>
<div class="line"><a id="l00425" name="l00425"></a><span class="lineno"> 425</span> tgp_vals[i] = idx &lt; size_sorted_axis ? inp[idx * stride_sorted_axis]</div>
<div class="line"><a id="l00426" name="l00426"></a><span class="lineno"> 426</span> : ValT(CompareOp::init);</div>
<div class="line"><a id="l00427" name="l00427"></a><span class="lineno"> 427</span> tgp_idxs[i] = idx;</div>
<div class="line"><a id="l00428" name="l00428"></a><span class="lineno"> 428</span> }</div>
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno"> 429</span> </div>
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno"> 430</span> <span class="comment">// Sort elements within the block</span></div>
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno"> 431</span> threadgroup_barrier(mem_flags::mem_threadgroup);</div>
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span> </div>
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno"> 433</span> <a class="code hl_function" href="struct_block_merge_sort.html#ad25513c2d02802ac35edb086aceb4ce8">block_merge_sort_t::sort</a>(tgp_vals, tgp_idxs, size_sorted_axis, lid);</div>
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno"> 434</span> </div>
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno"> 435</span> threadgroup_barrier(mem_flags::mem_threadgroup);</div>
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno"> 436</span> </div>
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno"> 437</span> <span class="comment">// Write output</span></div>
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno"> 438</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = lid.x; i &lt; <a class="code hl_variable" href="struct_kernel_multi_block_merge_sort.html#a4a0c920980c5e56471558d22a727a514">N_PER_BLOCK</a>; i += BLOCK_THREADS) {</div>
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno"> 439</span> <span class="keywordtype">int</span> idx = base_idx + i;</div>
<div class="line"><a id="l00440" name="l00440"></a><span class="lineno"> 440</span> <span class="keywordflow">if</span> (idx &lt; size_sorted_axis) {</div>
<div class="line"><a id="l00441" name="l00441"></a><span class="lineno"> 441</span> out_vals[idx] = tgp_vals[i];</div>
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno"> 442</span> out_idxs[idx] = tgp_idxs[i];</div>
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno"> 443</span> }</div>
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno"> 444</span> }</div>
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno"> 445</span> }</div>
</div>
<div class="line"><a id="l00446" name="l00446"></a><span class="lineno"> 446</span> </div>
<div class="foldopen" id="foldopen00447" data-start="{" data-end="}">
<div class="line"><a id="l00447" name="l00447"></a><span class="lineno"><a class="line" href="struct_kernel_multi_block_merge_sort.html#a811e72376de254af2bf5303133562a9a"> 447</a></span> <span class="keyword">static</span> METAL_FUNC <span class="keywordtype">int</span> <a class="code hl_function" href="struct_kernel_multi_block_merge_sort.html#a811e72376de254af2bf5303133562a9a">merge_partition</a>(</div>
<div class="line"><a id="l00448" name="l00448"></a><span class="lineno"> 448</span> <span class="keyword">const</span> device ValT* As,</div>
<div class="line"><a id="l00449" name="l00449"></a><span class="lineno"> 449</span> <span class="keyword">const</span> device ValT* Bs,</div>
<div class="line"><a id="l00450" name="l00450"></a><span class="lineno"> 450</span> <span class="keywordtype">int</span> A_sz,</div>
<div class="line"><a id="l00451" name="l00451"></a><span class="lineno"> 451</span> <span class="keywordtype">int</span> B_sz,</div>
<div class="line"><a id="l00452" name="l00452"></a><span class="lineno"> 452</span> <span class="keywordtype">int</span> sort_md) {</div>
<div class="line"><a id="l00453" name="l00453"></a><span class="lineno"> 453</span> CompareOp op;</div>
<div class="line"><a id="l00454" name="l00454"></a><span class="lineno"> 454</span> </div>
<div class="line"><a id="l00455" name="l00455"></a><span class="lineno"> 455</span> <span class="keywordtype">int</span> A_st = <a class="code hl_function" href="namespacemetal.html#a853c80479ab2264d9c4587c7bcac767b">max</a>(0, sort_md - B_sz);</div>
<div class="line"><a id="l00456" name="l00456"></a><span class="lineno"> 456</span> <span class="keywordtype">int</span> A_ed = <a class="code hl_function" href="namespacemetal.html#a6653b28c9473087141eddce39878d4d3">min</a>(sort_md, A_sz);</div>
<div class="line"><a id="l00457" name="l00457"></a><span class="lineno"> 457</span> </div>
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno"> 458</span> <span class="keywordflow">while</span> (A_st &lt; A_ed) {</div>
<div class="line"><a id="l00459" name="l00459"></a><span class="lineno"> 459</span> <span class="keywordtype">int</span> md = A_st + (A_ed - A_st) / 2;</div>
<div class="line"><a id="l00460" name="l00460"></a><span class="lineno"> 460</span> <span class="keyword">auto</span> a = As[md];</div>
<div class="line"><a id="l00461" name="l00461"></a><span class="lineno"> 461</span> <span class="keyword">auto</span> b = Bs[sort_md - 1 - md];</div>
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno"> 462</span> </div>
<div class="line"><a id="l00463" name="l00463"></a><span class="lineno"> 463</span> <span class="keywordflow">if</span> (op(b, a)) {</div>
<div class="line"><a id="l00464" name="l00464"></a><span class="lineno"> 464</span> A_ed = md;</div>
<div class="line"><a id="l00465" name="l00465"></a><span class="lineno"> 465</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00466" name="l00466"></a><span class="lineno"> 466</span> A_st = md + 1;</div>
<div class="line"><a id="l00467" name="l00467"></a><span class="lineno"> 467</span> }</div>
<div class="line"><a id="l00468" name="l00468"></a><span class="lineno"> 468</span> }</div>
<div class="line"><a id="l00469" name="l00469"></a><span class="lineno"> 469</span> </div>
<div class="line"><a id="l00470" name="l00470"></a><span class="lineno"> 470</span> <span class="keywordflow">return</span> A_ed;</div>
<div class="line"><a id="l00471" name="l00471"></a><span class="lineno"> 471</span> }</div>
</div>
<div class="line"><a id="l00472" name="l00472"></a><span class="lineno"> 472</span>};</div>
</div>
<div class="line"><a id="l00473" name="l00473"></a><span class="lineno"> 473</span> </div>
<div class="line"><a id="l00474" name="l00474"></a><span class="lineno"> 474</span><span class="keyword">template</span> &lt;</div>
<div class="line"><a id="l00475" name="l00475"></a><span class="lineno"> 475</span> <span class="keyword">typename</span> ValT,</div>
<div class="line"><a id="l00476" name="l00476"></a><span class="lineno"> 476</span> <span class="keyword">typename</span> IdxT,</div>
<div class="line"><a id="l00477" name="l00477"></a><span class="lineno"> 477</span> <span class="keywordtype">bool</span> ARG_SORT,</div>
<div class="line"><a id="l00478" name="l00478"></a><span class="lineno"> 478</span> <span class="keywordtype">short</span> BLOCK_THREADS,</div>
<div class="line"><a id="l00479" name="l00479"></a><span class="lineno"> 479</span> <span class="keywordtype">short</span> N_PER_THREAD&gt;</div>
<div class="foldopen" id="foldopen00480" data-start="{" data-end="}">
<div class="line"><a id="l00480" name="l00480"></a><span class="lineno"><a class="line" href="sort_8h.html#ad1ebc6ed8452f970c37c8aad5414551f"> 480</a></span>[[kernel, max_total_threads_per_threadgroup(BLOCK_THREADS)]] <span class="keywordtype">void</span> <a class="code hl_function" href="sort_8h.html#ad1ebc6ed8452f970c37c8aad5414551f">mb_block_sort</a>(</div>
<div class="line"><a id="l00481" name="l00481"></a><span class="lineno"> 481</span> <span class="keyword">const</span> device ValT* inp [[buffer(0)]],</div>
<div class="line"><a id="l00482" name="l00482"></a><span class="lineno"> 482</span> device ValT* out_vals [[buffer(1)]],</div>
<div class="line"><a id="l00483" name="l00483"></a><span class="lineno"> 483</span> device IdxT* out_idxs [[buffer(2)]],</div>
<div class="line"><a id="l00484" name="l00484"></a><span class="lineno"> 484</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>&amp; size_sorted_axis [[buffer(3)]],</div>
<div class="line"><a id="l00485" name="l00485"></a><span class="lineno"> 485</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>&amp; stride_sorted_axis [[buffer(4)]],</div>
<div class="line"><a id="l00486" name="l00486"></a><span class="lineno"> 486</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>&amp; nc_dim [[buffer(5)]],</div>
<div class="line"><a id="l00487" name="l00487"></a><span class="lineno"> 487</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>* nc_shape [[buffer(6)]],</div>
<div class="line"><a id="l00488" name="l00488"></a><span class="lineno"> 488</span> <span class="keyword">const</span> constant int64_t* nc_strides [[buffer(7)]],</div>
<div class="line"><a id="l00489" name="l00489"></a><span class="lineno"> 489</span> uint3 tid [[threadgroup_position_in_grid]],</div>
<div class="line"><a id="l00490" name="l00490"></a><span class="lineno"> 490</span> uint3 lid [[thread_position_in_threadgroup]]) {</div>
<div class="line"><a id="l00491" name="l00491"></a><span class="lineno"> 491</span> <span class="keyword">using </span>sort_kernel = <a class="code hl_struct" href="struct_kernel_multi_block_merge_sort.html">KernelMultiBlockMergeSort</a>&lt;</div>
<div class="line"><a id="l00492" name="l00492"></a><span class="lineno"> 492</span> ValT,</div>
<div class="line"><a id="l00493" name="l00493"></a><span class="lineno"> 493</span> IdxT,</div>
<div class="line"><a id="l00494" name="l00494"></a><span class="lineno"> 494</span> ARG_SORT,</div>
<div class="line"><a id="l00495" name="l00495"></a><span class="lineno"> 495</span> BLOCK_THREADS,</div>
<div class="line"><a id="l00496" name="l00496"></a><span class="lineno"> 496</span> N_PER_THREAD&gt;;</div>
<div class="line"><a id="l00497" name="l00497"></a><span class="lineno"> 497</span> </div>
<div class="line"><a id="l00498" name="l00498"></a><span class="lineno"> 498</span> <span class="keyword">auto</span> block_idx = <a class="code hl_function" href="backend_2metal_2kernels_2utils_8h.html#a497dd9f1a00c8a4303d8782158a0812a">elem_to_loc</a>(tid.y, nc_shape, nc_strides, nc_dim);</div>
<div class="line"><a id="l00499" name="l00499"></a><span class="lineno"> 499</span> inp += block_idx;</div>
<div class="line"><a id="l00500" name="l00500"></a><span class="lineno"> 500</span> out_vals += tid.y * size_sorted_axis;</div>
<div class="line"><a id="l00501" name="l00501"></a><span class="lineno"> 501</span> out_idxs += tid.y * size_sorted_axis;</div>
<div class="line"><a id="l00502" name="l00502"></a><span class="lineno"> 502</span> </div>
<div class="line"><a id="l00503" name="l00503"></a><span class="lineno"> 503</span> threadgroup ValT tgp_vals[sort_kernel::N_PER_BLOCK];</div>
<div class="line"><a id="l00504" name="l00504"></a><span class="lineno"> 504</span> threadgroup IdxT tgp_idxs[sort_kernel::N_PER_BLOCK];</div>
<div class="line"><a id="l00505" name="l00505"></a><span class="lineno"> 505</span> </div>
<div class="line"><a id="l00506" name="l00506"></a><span class="lineno"> 506</span> sort_kernel::block_sort(</div>
<div class="line"><a id="l00507" name="l00507"></a><span class="lineno"> 507</span> inp,</div>
<div class="line"><a id="l00508" name="l00508"></a><span class="lineno"> 508</span> out_vals,</div>
<div class="line"><a id="l00509" name="l00509"></a><span class="lineno"> 509</span> out_idxs,</div>
<div class="line"><a id="l00510" name="l00510"></a><span class="lineno"> 510</span> size_sorted_axis,</div>
<div class="line"><a id="l00511" name="l00511"></a><span class="lineno"> 511</span> stride_sorted_axis,</div>
<div class="line"><a id="l00512" name="l00512"></a><span class="lineno"> 512</span> tgp_vals,</div>
<div class="line"><a id="l00513" name="l00513"></a><span class="lineno"> 513</span> tgp_idxs,</div>
<div class="line"><a id="l00514" name="l00514"></a><span class="lineno"> 514</span> tid,</div>
<div class="line"><a id="l00515" name="l00515"></a><span class="lineno"> 515</span> lid);</div>
<div class="line"><a id="l00516" name="l00516"></a><span class="lineno"> 516</span>}</div>
</div>
<div class="line"><a id="l00517" name="l00517"></a><span class="lineno"> 517</span> </div>
<div class="line"><a id="l00518" name="l00518"></a><span class="lineno"> 518</span><span class="keyword">template</span> &lt;</div>
<div class="line"><a id="l00519" name="l00519"></a><span class="lineno"> 519</span> <span class="keyword">typename</span> ValT,</div>
<div class="line"><a id="l00520" name="l00520"></a><span class="lineno"> 520</span> <span class="keyword">typename</span> IdxT,</div>
<div class="line"><a id="l00521" name="l00521"></a><span class="lineno"> 521</span> <span class="keywordtype">bool</span> ARG_SORT,</div>
<div class="line"><a id="l00522" name="l00522"></a><span class="lineno"> 522</span> <span class="keywordtype">short</span> BLOCK_THREADS,</div>
<div class="line"><a id="l00523" name="l00523"></a><span class="lineno"> 523</span> <span class="keywordtype">short</span> N_PER_THREAD&gt;</div>
<div class="foldopen" id="foldopen00524" data-start="{" data-end="}">
<div class="line"><a id="l00524" name="l00524"></a><span class="lineno"><a class="line" href="sort_8h.html#a812f19ed1db562026edc24e29185fe8c"> 524</a></span>[[kernel]] <span class="keywordtype">void</span> <a class="code hl_function" href="sort_8h.html#a812f19ed1db562026edc24e29185fe8c">mb_block_partition</a>(</div>
<div class="line"><a id="l00525" name="l00525"></a><span class="lineno"> 525</span> device IdxT* block_partitions [[buffer(0)]],</div>
<div class="line"><a id="l00526" name="l00526"></a><span class="lineno"> 526</span> <span class="keyword">const</span> device ValT* dev_vals [[buffer(1)]],</div>
<div class="line"><a id="l00527" name="l00527"></a><span class="lineno"> 527</span> <span class="keyword">const</span> device IdxT* dev_idxs [[buffer(2)]],</div>
<div class="line"><a id="l00528" name="l00528"></a><span class="lineno"> 528</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>&amp; size_sorted_axis [[buffer(3)]],</div>
<div class="line"><a id="l00529" name="l00529"></a><span class="lineno"> 529</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>&amp; merge_tiles [[buffer(4)]],</div>
<div class="line"><a id="l00530" name="l00530"></a><span class="lineno"> 530</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>&amp; n_blocks [[buffer(5)]],</div>
<div class="line"><a id="l00531" name="l00531"></a><span class="lineno"> 531</span> uint3 tid [[threadgroup_position_in_grid]],</div>
<div class="line"><a id="l00532" name="l00532"></a><span class="lineno"> 532</span> uint3 lid [[thread_position_in_threadgroup]],</div>
<div class="line"><a id="l00533" name="l00533"></a><span class="lineno"> 533</span> uint3 tgp_dims [[threads_per_threadgroup]]) {</div>
<div class="line"><a id="l00534" name="l00534"></a><span class="lineno"> 534</span> <span class="keyword">using </span>sort_kernel = <a class="code hl_struct" href="struct_kernel_multi_block_merge_sort.html">KernelMultiBlockMergeSort</a>&lt;</div>
<div class="line"><a id="l00535" name="l00535"></a><span class="lineno"> 535</span> ValT,</div>
<div class="line"><a id="l00536" name="l00536"></a><span class="lineno"> 536</span> IdxT,</div>
<div class="line"><a id="l00537" name="l00537"></a><span class="lineno"> 537</span> ARG_SORT,</div>
<div class="line"><a id="l00538" name="l00538"></a><span class="lineno"> 538</span> BLOCK_THREADS,</div>
<div class="line"><a id="l00539" name="l00539"></a><span class="lineno"> 539</span> N_PER_THREAD&gt;;</div>
<div class="line"><a id="l00540" name="l00540"></a><span class="lineno"> 540</span> </div>
<div class="line"><a id="l00541" name="l00541"></a><span class="lineno"> 541</span> block_partitions += tid.y * tgp_dims.x;</div>
<div class="line"><a id="l00542" name="l00542"></a><span class="lineno"> 542</span> dev_vals += tid.y * size_sorted_axis;</div>
<div class="line"><a id="l00543" name="l00543"></a><span class="lineno"> 543</span> dev_idxs += tid.y * size_sorted_axis;</div>
<div class="line"><a id="l00544" name="l00544"></a><span class="lineno"> 544</span> </div>
<div class="line"><a id="l00545" name="l00545"></a><span class="lineno"> 545</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = lid.x; i &lt;= n_blocks; i += tgp_dims.x) {</div>
<div class="line"><a id="l00546" name="l00546"></a><span class="lineno"> 546</span> <span class="comment">// Find location in merge step</span></div>
<div class="line"><a id="l00547" name="l00547"></a><span class="lineno"> 547</span> <span class="keywordtype">int</span> merge_group = i / merge_tiles;</div>
<div class="line"><a id="l00548" name="l00548"></a><span class="lineno"> 548</span> <span class="keywordtype">int</span> merge_lane = i % merge_tiles;</div>
<div class="line"><a id="l00549" name="l00549"></a><span class="lineno"> 549</span> </div>
<div class="line"><a id="l00550" name="l00550"></a><span class="lineno"> 550</span> <span class="keywordtype">int</span> sort_sz = sort_kernel::N_PER_BLOCK * merge_tiles;</div>
<div class="line"><a id="l00551" name="l00551"></a><span class="lineno"> 551</span> <span class="keywordtype">int</span> sort_st = sort_kernel::N_PER_BLOCK * merge_tiles * merge_group;</div>
<div class="line"><a id="l00552" name="l00552"></a><span class="lineno"> 552</span> </div>
<div class="line"><a id="l00553" name="l00553"></a><span class="lineno"> 553</span> <span class="keywordtype">int</span> A_st = <a class="code hl_function" href="namespacemetal.html#a6653b28c9473087141eddce39878d4d3">min</a>(size_sorted_axis, sort_st);</div>
<div class="line"><a id="l00554" name="l00554"></a><span class="lineno"> 554</span> <span class="keywordtype">int</span> A_ed = <a class="code hl_function" href="namespacemetal.html#a6653b28c9473087141eddce39878d4d3">min</a>(size_sorted_axis, sort_st + sort_sz / 2);</div>
<div class="line"><a id="l00555" name="l00555"></a><span class="lineno"> 555</span> <span class="keywordtype">int</span> B_st = A_ed;</div>
<div class="line"><a id="l00556" name="l00556"></a><span class="lineno"> 556</span> <span class="keywordtype">int</span> B_ed = <a class="code hl_function" href="namespacemetal.html#a6653b28c9473087141eddce39878d4d3">min</a>(size_sorted_axis, B_st + sort_sz / 2);</div>
<div class="line"><a id="l00557" name="l00557"></a><span class="lineno"> 557</span> </div>
<div class="line"><a id="l00558" name="l00558"></a><span class="lineno"> 558</span> <span class="keywordtype">int</span> partition_at = <a class="code hl_function" href="namespacemetal.html#a6653b28c9473087141eddce39878d4d3">min</a>(B_ed - A_st, sort_kernel::N_PER_BLOCK * merge_lane);</div>
<div class="line"><a id="l00559" name="l00559"></a><span class="lineno"> 559</span> <span class="keywordtype">int</span> partition = sort_kernel::merge_partition(</div>
<div class="line"><a id="l00560" name="l00560"></a><span class="lineno"> 560</span> dev_vals + A_st,</div>
<div class="line"><a id="l00561" name="l00561"></a><span class="lineno"> 561</span> dev_vals + B_st,</div>
<div class="line"><a id="l00562" name="l00562"></a><span class="lineno"> 562</span> A_ed - A_st,</div>
<div class="line"><a id="l00563" name="l00563"></a><span class="lineno"> 563</span> B_ed - B_st,</div>
<div class="line"><a id="l00564" name="l00564"></a><span class="lineno"> 564</span> partition_at);</div>
<div class="line"><a id="l00565" name="l00565"></a><span class="lineno"> 565</span> </div>
<div class="line"><a id="l00566" name="l00566"></a><span class="lineno"> 566</span> block_partitions[i] = A_st + partition;</div>
<div class="line"><a id="l00567" name="l00567"></a><span class="lineno"> 567</span> }</div>
<div class="line"><a id="l00568" name="l00568"></a><span class="lineno"> 568</span>}</div>
</div>
<div class="line"><a id="l00569" name="l00569"></a><span class="lineno"> 569</span> </div>
<div class="line"><a id="l00570" name="l00570"></a><span class="lineno"> 570</span><span class="keyword">template</span> &lt;</div>
<div class="line"><a id="l00571" name="l00571"></a><span class="lineno"> 571</span> <span class="keyword">typename</span> ValT,</div>
<div class="line"><a id="l00572" name="l00572"></a><span class="lineno"> 572</span> <span class="keyword">typename</span> IdxT,</div>
<div class="line"><a id="l00573" name="l00573"></a><span class="lineno"> 573</span> <span class="keywordtype">bool</span> ARG_SORT,</div>
<div class="line"><a id="l00574" name="l00574"></a><span class="lineno"> 574</span> <span class="keywordtype">short</span> BLOCK_THREADS,</div>
<div class="line"><a id="l00575" name="l00575"></a><span class="lineno"> 575</span> <span class="keywordtype">short</span> N_PER_THREAD,</div>
<div class="line"><a id="l00576" name="l00576"></a><span class="lineno"> 576</span> <span class="keyword">typename</span> CompareOp = <a class="code hl_struct" href="struct_less_than.html">LessThan&lt;ValT&gt;</a>&gt;</div>
<div class="line"><a id="l00577" name="l00577"></a><span class="lineno"> 577</span>[[kernel, max_total_threads_per_threadgroup(BLOCK_THREADS)]] <span class="keywordtype">void</span></div>
<div class="foldopen" id="foldopen00578" data-start="{" data-end="}">
<div class="line"><a id="l00578" name="l00578"></a><span class="lineno"><a class="line" href="sort_8h.html#a9cd2751d251acde874a95330d35fac5f"> 578</a></span><a class="code hl_function" href="sort_8h.html#a9cd2751d251acde874a95330d35fac5f">mb_block_merge</a>(</div>
<div class="line"><a id="l00579" name="l00579"></a><span class="lineno"> 579</span> <span class="keyword">const</span> device IdxT* block_partitions [[buffer(0)]],</div>
<div class="line"><a id="l00580" name="l00580"></a><span class="lineno"> 580</span> <span class="keyword">const</span> device ValT* dev_vals_in [[buffer(1)]],</div>
<div class="line"><a id="l00581" name="l00581"></a><span class="lineno"> 581</span> <span class="keyword">const</span> device IdxT* dev_idxs_in [[buffer(2)]],</div>
<div class="line"><a id="l00582" name="l00582"></a><span class="lineno"> 582</span> device ValT* dev_vals_out [[buffer(3)]],</div>
<div class="line"><a id="l00583" name="l00583"></a><span class="lineno"> 583</span> device IdxT* dev_idxs_out [[buffer(4)]],</div>
<div class="line"><a id="l00584" name="l00584"></a><span class="lineno"> 584</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>&amp; size_sorted_axis [[buffer(5)]],</div>
<div class="line"><a id="l00585" name="l00585"></a><span class="lineno"> 585</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>&amp; merge_tiles [[buffer(6)]],</div>
<div class="line"><a id="l00586" name="l00586"></a><span class="lineno"> 586</span> <span class="keyword">const</span> constant <span class="keywordtype">int</span>&amp; num_tiles [[buffer(7)]],</div>
<div class="line"><a id="l00587" name="l00587"></a><span class="lineno"> 587</span> uint3 tid [[threadgroup_position_in_grid]],</div>
<div class="line"><a id="l00588" name="l00588"></a><span class="lineno"> 588</span> uint3 lid [[thread_position_in_threadgroup]]) {</div>
<div class="line"><a id="l00589" name="l00589"></a><span class="lineno"> 589</span> <span class="keyword">using </span>sort_kernel = <a class="code hl_struct" href="struct_kernel_multi_block_merge_sort.html">KernelMultiBlockMergeSort</a>&lt;</div>
<div class="line"><a id="l00590" name="l00590"></a><span class="lineno"> 590</span> ValT,</div>
<div class="line"><a id="l00591" name="l00591"></a><span class="lineno"> 591</span> IdxT,</div>
<div class="line"><a id="l00592" name="l00592"></a><span class="lineno"> 592</span> ARG_SORT,</div>
<div class="line"><a id="l00593" name="l00593"></a><span class="lineno"> 593</span> BLOCK_THREADS,</div>
<div class="line"><a id="l00594" name="l00594"></a><span class="lineno"> 594</span> N_PER_THREAD,</div>
<div class="line"><a id="l00595" name="l00595"></a><span class="lineno"> 595</span> CompareOp&gt;;</div>
<div class="line"><a id="l00596" name="l00596"></a><span class="lineno"> 596</span> </div>
<div class="line"><a id="l00597" name="l00597"></a><span class="lineno"> 597</span> <span class="keyword">using </span>block_sort_t = <span class="keyword">typename</span> sort_kernel::block_merge_sort_t;</div>
<div class="line"><a id="l00598" name="l00598"></a><span class="lineno"> 598</span> </div>
<div class="line"><a id="l00599" name="l00599"></a><span class="lineno"> 599</span> block_partitions += tid.y * (num_tiles + 1);</div>
<div class="line"><a id="l00600" name="l00600"></a><span class="lineno"> 600</span> dev_vals_in += tid.y * size_sorted_axis;</div>
<div class="line"><a id="l00601" name="l00601"></a><span class="lineno"> 601</span> dev_idxs_in += tid.y * size_sorted_axis;</div>
<div class="line"><a id="l00602" name="l00602"></a><span class="lineno"> 602</span> dev_vals_out += tid.y * size_sorted_axis;</div>
<div class="line"><a id="l00603" name="l00603"></a><span class="lineno"> 603</span> dev_idxs_out += tid.y * size_sorted_axis;</div>
<div class="line"><a id="l00604" name="l00604"></a><span class="lineno"> 604</span> </div>
<div class="line"><a id="l00605" name="l00605"></a><span class="lineno"> 605</span> <span class="keywordtype">int</span> block_idx = tid.x;</div>
<div class="line"><a id="l00606" name="l00606"></a><span class="lineno"> 606</span> <span class="keywordtype">int</span> merge_group = block_idx / merge_tiles;</div>
<div class="line"><a id="l00607" name="l00607"></a><span class="lineno"> 607</span> <span class="keywordtype">int</span> sort_st = sort_kernel::N_PER_BLOCK * merge_tiles * merge_group;</div>
<div class="line"><a id="l00608" name="l00608"></a><span class="lineno"> 608</span> <span class="keywordtype">int</span> sort_sz = sort_kernel::N_PER_BLOCK * merge_tiles;</div>
<div class="line"><a id="l00609" name="l00609"></a><span class="lineno"> 609</span> <span class="keywordtype">int</span> sort_md = sort_kernel::N_PER_BLOCK * block_idx - sort_st;</div>
<div class="line"><a id="l00610" name="l00610"></a><span class="lineno"> 610</span> </div>
<div class="line"><a id="l00611" name="l00611"></a><span class="lineno"> 611</span> <span class="keywordtype">int</span> A_st = block_partitions[block_idx + 0];</div>
<div class="line"><a id="l00612" name="l00612"></a><span class="lineno"> 612</span> <span class="keywordtype">int</span> A_ed = block_partitions[block_idx + 1];</div>
<div class="line"><a id="l00613" name="l00613"></a><span class="lineno"> 613</span> <span class="keywordtype">int</span> B_st = <a class="code hl_function" href="namespacemetal.html#a6653b28c9473087141eddce39878d4d3">min</a>(size_sorted_axis, 2 * sort_st + sort_sz / 2 + sort_md - A_st);</div>
<div class="line"><a id="l00614" name="l00614"></a><span class="lineno"> 614</span> <span class="keywordtype">int</span> B_ed = <a class="code hl_function" href="namespacemetal.html#a6653b28c9473087141eddce39878d4d3">min</a>(</div>
<div class="line"><a id="l00615" name="l00615"></a><span class="lineno"> 615</span> size_sorted_axis,</div>
<div class="line"><a id="l00616" name="l00616"></a><span class="lineno"> 616</span> 2 * sort_st + sort_sz / 2 + sort_md + sort_kernel::N_PER_BLOCK - A_ed);</div>
<div class="line"><a id="l00617" name="l00617"></a><span class="lineno"> 617</span> </div>
<div class="line"><a id="l00618" name="l00618"></a><span class="lineno"> 618</span> <span class="keywordflow">if</span> ((block_idx % merge_tiles) == merge_tiles - 1) {</div>
<div class="line"><a id="l00619" name="l00619"></a><span class="lineno"> 619</span> A_ed = <a class="code hl_function" href="namespacemetal.html#a6653b28c9473087141eddce39878d4d3">min</a>(size_sorted_axis, sort_st + sort_sz / 2);</div>
<div class="line"><a id="l00620" name="l00620"></a><span class="lineno"> 620</span> B_ed = <a class="code hl_function" href="namespacemetal.html#a6653b28c9473087141eddce39878d4d3">min</a>(size_sorted_axis, sort_st + sort_sz);</div>
<div class="line"><a id="l00621" name="l00621"></a><span class="lineno"> 621</span> }</div>
<div class="line"><a id="l00622" name="l00622"></a><span class="lineno"> 622</span> </div>
<div class="line"><a id="l00623" name="l00623"></a><span class="lineno"> 623</span> <span class="keywordtype">int</span> A_sz = A_ed - A_st;</div>
<div class="line"><a id="l00624" name="l00624"></a><span class="lineno"> 624</span> <span class="keywordtype">int</span> B_sz = B_ed - B_st;</div>
<div class="line"><a id="l00625" name="l00625"></a><span class="lineno"> 625</span> </div>
<div class="line"><a id="l00626" name="l00626"></a><span class="lineno"> 626</span> <span class="comment">// Load from global memory</span></div>
<div class="line"><a id="l00627" name="l00627"></a><span class="lineno"> 627</span> thread ValT thread_vals[N_PER_THREAD];</div>
<div class="line"><a id="l00628" name="l00628"></a><span class="lineno"> 628</span> thread IdxT thread_idxs[N_PER_THREAD];</div>
<div class="line"><a id="l00629" name="l00629"></a><span class="lineno"> 629</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; N_PER_THREAD; i++) {</div>
<div class="line"><a id="l00630" name="l00630"></a><span class="lineno"> 630</span> <span class="keywordtype">int</span> idx = BLOCK_THREADS * i + lid.x;</div>
<div class="line"><a id="l00631" name="l00631"></a><span class="lineno"> 631</span> <span class="keywordflow">if</span> (idx &lt; (A_sz + B_sz)) {</div>
<div class="line"><a id="l00632" name="l00632"></a><span class="lineno"> 632</span> thread_vals[i] = (idx &lt; A_sz) ? dev_vals_in[A_st + idx]</div>
<div class="line"><a id="l00633" name="l00633"></a><span class="lineno"> 633</span> : dev_vals_in[B_st + idx - A_sz];</div>
<div class="line"><a id="l00634" name="l00634"></a><span class="lineno"> 634</span> thread_idxs[i] = (idx &lt; A_sz) ? dev_idxs_in[A_st + idx]</div>
<div class="line"><a id="l00635" name="l00635"></a><span class="lineno"> 635</span> : dev_idxs_in[B_st + idx - A_sz];</div>
<div class="line"><a id="l00636" name="l00636"></a><span class="lineno"> 636</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00637" name="l00637"></a><span class="lineno"> 637</span> thread_vals[i] = CompareOp::init;</div>
<div class="line"><a id="l00638" name="l00638"></a><span class="lineno"> 638</span> thread_idxs[i] = 0;</div>
<div class="line"><a id="l00639" name="l00639"></a><span class="lineno"> 639</span> }</div>
<div class="line"><a id="l00640" name="l00640"></a><span class="lineno"> 640</span> }</div>
<div class="line"><a id="l00641" name="l00641"></a><span class="lineno"> 641</span> </div>
<div class="line"><a id="l00642" name="l00642"></a><span class="lineno"> 642</span> <span class="comment">// Write to shared memory</span></div>
<div class="line"><a id="l00643" name="l00643"></a><span class="lineno"> 643</span> threadgroup ValT tgp_vals[sort_kernel::N_PER_BLOCK];</div>
<div class="line"><a id="l00644" name="l00644"></a><span class="lineno"> 644</span> threadgroup IdxT tgp_idxs[sort_kernel::N_PER_BLOCK];</div>
<div class="line"><a id="l00645" name="l00645"></a><span class="lineno"> 645</span> threadgroup_barrier(mem_flags::mem_threadgroup);</div>
<div class="line"><a id="l00646" name="l00646"></a><span class="lineno"> 646</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; N_PER_THREAD; i++) {</div>
<div class="line"><a id="l00647" name="l00647"></a><span class="lineno"> 647</span> <span class="keywordtype">int</span> idx = BLOCK_THREADS * i + lid.x;</div>
<div class="line"><a id="l00648" name="l00648"></a><span class="lineno"> 648</span> tgp_vals[idx] = thread_vals[i];</div>
<div class="line"><a id="l00649" name="l00649"></a><span class="lineno"> 649</span> tgp_idxs[idx] = thread_idxs[i];</div>
<div class="line"><a id="l00650" name="l00650"></a><span class="lineno"> 650</span> }</div>
<div class="line"><a id="l00651" name="l00651"></a><span class="lineno"> 651</span> threadgroup_barrier(mem_flags::mem_threadgroup);</div>
<div class="line"><a id="l00652" name="l00652"></a><span class="lineno"> 652</span> </div>
<div class="line"><a id="l00653" name="l00653"></a><span class="lineno"> 653</span> <span class="comment">// Merge</span></div>
<div class="line"><a id="l00654" name="l00654"></a><span class="lineno"> 654</span> <span class="keywordtype">int</span> sort_md_local = <a class="code hl_function" href="namespacemetal.html#a6653b28c9473087141eddce39878d4d3">min</a>(A_sz + B_sz, N_PER_THREAD * <span class="keywordtype">int</span>(lid.x));</div>
<div class="line"><a id="l00655" name="l00655"></a><span class="lineno"> 655</span> </div>
<div class="line"><a id="l00656" name="l00656"></a><span class="lineno"> 656</span> <span class="keywordtype">int</span> A_st_local = block_sort_t::merge_partition(</div>
<div class="line"><a id="l00657" name="l00657"></a><span class="lineno"> 657</span> tgp_vals, tgp_vals + A_sz, A_sz, B_sz, sort_md_local);</div>
<div class="line"><a id="l00658" name="l00658"></a><span class="lineno"> 658</span> <span class="keywordtype">int</span> A_ed_local = A_sz;</div>
<div class="line"><a id="l00659" name="l00659"></a><span class="lineno"> 659</span> </div>
<div class="line"><a id="l00660" name="l00660"></a><span class="lineno"> 660</span> <span class="keywordtype">int</span> B_st_local = sort_md_local - A_st_local;</div>
<div class="line"><a id="l00661" name="l00661"></a><span class="lineno"> 661</span> <span class="keywordtype">int</span> B_ed_local = B_sz;</div>
<div class="line"><a id="l00662" name="l00662"></a><span class="lineno"> 662</span> </div>
<div class="line"><a id="l00663" name="l00663"></a><span class="lineno"> 663</span> <span class="keywordtype">int</span> A_sz_local = A_ed_local - A_st_local;</div>
<div class="line"><a id="l00664" name="l00664"></a><span class="lineno"> 664</span> <span class="keywordtype">int</span> B_sz_local = B_ed_local - B_st_local;</div>
<div class="line"><a id="l00665" name="l00665"></a><span class="lineno"> 665</span> </div>
<div class="line"><a id="l00666" name="l00666"></a><span class="lineno"> 666</span> <span class="comment">// Do merge</span></div>
<div class="line"><a id="l00667" name="l00667"></a><span class="lineno"> 667</span> block_sort_t::merge_step(</div>
<div class="line"><a id="l00668" name="l00668"></a><span class="lineno"> 668</span> tgp_vals + A_st_local,</div>
<div class="line"><a id="l00669" name="l00669"></a><span class="lineno"> 669</span> tgp_vals + A_ed_local + B_st_local,</div>
<div class="line"><a id="l00670" name="l00670"></a><span class="lineno"> 670</span> tgp_idxs + A_st_local,</div>
<div class="line"><a id="l00671" name="l00671"></a><span class="lineno"> 671</span> tgp_idxs + A_ed_local + B_st_local,</div>
<div class="line"><a id="l00672" name="l00672"></a><span class="lineno"> 672</span> A_sz_local,</div>
<div class="line"><a id="l00673" name="l00673"></a><span class="lineno"> 673</span> B_sz_local,</div>
<div class="line"><a id="l00674" name="l00674"></a><span class="lineno"> 674</span> thread_vals,</div>
<div class="line"><a id="l00675" name="l00675"></a><span class="lineno"> 675</span> thread_idxs);</div>
<div class="line"><a id="l00676" name="l00676"></a><span class="lineno"> 676</span> </div>
<div class="line"><a id="l00677" name="l00677"></a><span class="lineno"> 677</span> threadgroup_barrier(mem_flags::mem_threadgroup);</div>
<div class="line"><a id="l00678" name="l00678"></a><span class="lineno"> 678</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; N_PER_THREAD; ++i) {</div>
<div class="line"><a id="l00679" name="l00679"></a><span class="lineno"> 679</span> <span class="keywordtype">int</span> idx = lid.x * N_PER_THREAD;</div>
<div class="line"><a id="l00680" name="l00680"></a><span class="lineno"> 680</span> tgp_vals[idx + i] = thread_vals[i];</div>
<div class="line"><a id="l00681" name="l00681"></a><span class="lineno"> 681</span> tgp_idxs[idx + i] = thread_idxs[i];</div>
<div class="line"><a id="l00682" name="l00682"></a><span class="lineno"> 682</span> }</div>
<div class="line"><a id="l00683" name="l00683"></a><span class="lineno"> 683</span> </div>
<div class="line"><a id="l00684" name="l00684"></a><span class="lineno"> 684</span> threadgroup_barrier(mem_flags::mem_threadgroup);</div>
<div class="line"><a id="l00685" name="l00685"></a><span class="lineno"> 685</span> <span class="comment">// Write output</span></div>
<div class="line"><a id="l00686" name="l00686"></a><span class="lineno"> 686</span> <span class="keywordtype">int</span> base_idx = tid.x * sort_kernel::N_PER_BLOCK;</div>
<div class="line"><a id="l00687" name="l00687"></a><span class="lineno"> 687</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = lid.x; i &lt; sort_kernel::N_PER_BLOCK; i += BLOCK_THREADS) {</div>
<div class="line"><a id="l00688" name="l00688"></a><span class="lineno"> 688</span> <span class="keywordtype">int</span> idx = base_idx + i;</div>
<div class="line"><a id="l00689" name="l00689"></a><span class="lineno"> 689</span> <span class="keywordflow">if</span> (idx &lt; size_sorted_axis) {</div>
<div class="line"><a id="l00690" name="l00690"></a><span class="lineno"> 690</span> dev_vals_out[idx] = tgp_vals[i];</div>
<div class="line"><a id="l00691" name="l00691"></a><span class="lineno"> 691</span> dev_idxs_out[idx] = tgp_idxs[i];</div>
<div class="line"><a id="l00692" name="l00692"></a><span class="lineno"> 692</span> }</div>
<div class="line"><a id="l00693" name="l00693"></a><span class="lineno"> 693</span> }</div>
<div class="line"><a id="l00694" name="l00694"></a><span class="lineno"> 694</span>}</div>
</div>
<div class="ttc" id="abackend_2metal_2kernels_2utils_8h_html_a497dd9f1a00c8a4303d8782158a0812a"><div class="ttname"><a href="backend_2metal_2kernels_2utils_8h.html#a497dd9f1a00c8a4303d8782158a0812a">elem_to_loc</a></div><div class="ttdeci">METAL_FUNC IdxT elem_to_loc(IdxT elem, constant const int *shape, constant const int64_t *strides, int ndim)</div><div class="ttdef"><b>Definition</b> utils.h:93</div></div>
<div class="ttc" id="anamespacemetal_html"><div class="ttname"><a href="namespacemetal.html">metal</a></div><div class="ttdef"><b>Definition</b> bf16_math.h:226</div></div>
<div class="ttc" id="anamespacemetal_html_a6653b28c9473087141eddce39878d4d3"><div class="ttname"><a href="namespacemetal.html#a6653b28c9473087141eddce39878d4d3">metal::min</a></div><div class="ttdeci">METAL_FUNC bfloat16_t min(bfloat16_t x, bfloat16_t y)</div><div class="ttdef"><b>Definition</b> bf16_math.h:232</div></div>
<div class="ttc" id="anamespacemetal_html_a853c80479ab2264d9c4587c7bcac767b"><div class="ttname"><a href="namespacemetal.html#a853c80479ab2264d9c4587c7bcac767b">metal::max</a></div><div class="ttdeci">METAL_FUNC bfloat16_t max(bfloat16_t x, bfloat16_t y)</div><div class="ttdef"><b>Definition</b> bf16_math.h:232</div></div>
<div class="ttc" id="asort_8h_html_a0386011c52d03e60885a31e6fbd903dd"><div class="ttname"><a href="sort_8h.html#a0386011c52d03e60885a31e6fbd903dd">MLX_MTL_CONST</a></div><div class="ttdeci">#define MLX_MTL_CONST</div><div class="ttdef"><b>Definition</b> sort.h:3</div></div>
<div class="ttc" id="asort_8h_html_a6e8c2da4975a8001fd5ddf211a3058b7"><div class="ttname"><a href="sort_8h.html#a6e8c2da4975a8001fd5ddf211a3058b7">thread_swap</a></div><div class="ttdeci">METAL_FUNC void thread_swap(thread T &amp;a, thread T &amp;b)</div><div class="ttdef"><b>Definition</b> sort.h:16</div></div>
<div class="ttc" id="asort_8h_html_a812f19ed1db562026edc24e29185fe8c"><div class="ttname"><a href="sort_8h.html#a812f19ed1db562026edc24e29185fe8c">mb_block_partition</a></div><div class="ttdeci">void mb_block_partition(device IdxT *block_partitions, const device ValT *dev_vals, const device IdxT *dev_idxs, const constant int &amp;size_sorted_axis, const constant int &amp;merge_tiles, const constant int &amp;n_blocks, uint3 tid, uint3 lid, uint3 tgp_dims)</div><div class="ttdef"><b>Definition</b> sort.h:524</div></div>
<div class="ttc" id="asort_8h_html_a93f14092416169c4449141043ac45ffd"><div class="ttname"><a href="sort_8h.html#a93f14092416169c4449141043ac45ffd">block_sort</a></div><div class="ttdeci">void block_sort(const device T *inp, device U *out, const constant int &amp;size_sorted_axis, const constant int &amp;in_stride_sorted_axis, const constant int &amp;out_stride_sorted_axis, const constant int &amp;in_stride_segment_axis, const constant int &amp;out_stride_segment_axis, uint3 tid, uint3 lid)</div><div class="ttdef"><b>Definition</b> sort.h:282</div></div>
<div class="ttc" id="asort_8h_html_a9cd2751d251acde874a95330d35fac5f"><div class="ttname"><a href="sort_8h.html#a9cd2751d251acde874a95330d35fac5f">mb_block_merge</a></div><div class="ttdeci">void mb_block_merge(const device IdxT *block_partitions, const device ValT *dev_vals_in, const device IdxT *dev_idxs_in, device ValT *dev_vals_out, device IdxT *dev_idxs_out, const constant int &amp;size_sorted_axis, const constant int &amp;merge_tiles, const constant int &amp;num_tiles, uint3 tid, uint3 lid)</div><div class="ttdef"><b>Definition</b> sort.h:578</div></div>
<div class="ttc" id="asort_8h_html_aca8b6f36c9024b8406fe545765316dc0"><div class="ttname"><a href="sort_8h.html#aca8b6f36c9024b8406fe545765316dc0">zero_helper</a></div><div class="ttdeci">constant constexpr const int zero_helper</div><div class="ttdef"><b>Definition</b> sort.h:329</div></div>
<div class="ttc" id="asort_8h_html_ad1ebc6ed8452f970c37c8aad5414551f"><div class="ttname"><a href="sort_8h.html#ad1ebc6ed8452f970c37c8aad5414551f">mb_block_sort</a></div><div class="ttdeci">void mb_block_sort(const device ValT *inp, device ValT *out_vals, device IdxT *out_idxs, const constant int &amp;size_sorted_axis, const constant int &amp;stride_sorted_axis, const constant int &amp;nc_dim, const constant int *nc_shape, const constant int64_t *nc_strides, uint3 tid, uint3 lid)</div><div class="ttdef"><b>Definition</b> sort.h:480</div></div>
<div class="ttc" id="asort_8h_html_ad272ef4422c75565a79b7f5e751bb247"><div class="ttname"><a href="sort_8h.html#ad272ef4422c75565a79b7f5e751bb247">block_sort_nc</a></div><div class="ttdeci">void block_sort_nc(const device T *inp, device U *out, const constant int &amp;size_sorted_axis, const constant int &amp;in_stride_sorted_axis, const constant int &amp;out_stride_sorted_axis, const constant int &amp;nc_dim, const constant int *nc_shape, const constant int64_t *in_nc_strides, const constant int64_t *out_nc_strides, uint3 tid, uint3 lid)</div><div class="ttdef"><b>Definition</b> sort.h:337</div></div>
<div class="ttc" id="asort_8h_html_ad34b622323cebef136669fedd7229515"><div class="ttname"><a href="sort_8h.html#ad34b622323cebef136669fedd7229515">MLX_MTL_LOOP_UNROLL</a></div><div class="ttdeci">#define MLX_MTL_LOOP_UNROLL</div><div class="ttdef"><b>Definition</b> sort.h:4</div></div>
<div class="ttc" id="astruct_block_merge_sort_html"><div class="ttname"><a href="struct_block_merge_sort.html">BlockMergeSort</a></div><div class="ttdef"><b>Definition</b> sort.h:66</div></div>
<div class="ttc" id="astruct_block_merge_sort_html_a0386ce33d7bcfd12dbb17558d26da1bb"><div class="ttname"><a href="struct_block_merge_sort.html#a0386ce33d7bcfd12dbb17558d26da1bb">BlockMergeSort::merge_step</a></div><div class="ttdeci">static METAL_FUNC void merge_step(const threadgroup ValT *As, const threadgroup ValT *Bs, const threadgroup IdxT *As_idx, const threadgroup IdxT *Bs_idx, short A_sz, short B_sz, thread ValT(&amp;vals)[N_PER_THREAD], thread IdxT(&amp;idxs)[N_PER_THREAD])</div><div class="ttdef"><b>Definition</b> sort.h:95</div></div>
<div class="ttc" id="astruct_block_merge_sort_html_ad25513c2d02802ac35edb086aceb4ce8"><div class="ttname"><a href="struct_block_merge_sort.html#ad25513c2d02802ac35edb086aceb4ce8">BlockMergeSort::sort</a></div><div class="ttdeci">static METAL_FUNC void sort(threadgroup ValT *tgp_vals, threadgroup IdxT *tgp_idxs, int size_sorted_axis, uint3 lid)</div><div class="ttdef"><b>Definition</b> sort.h:121</div></div>
<div class="ttc" id="astruct_block_merge_sort_html_ad5bd0d853e9b4352ecfd902a706d7178"><div class="ttname"><a href="struct_block_merge_sort.html#ad5bd0d853e9b4352ecfd902a706d7178">BlockMergeSort::merge_partition</a></div><div class="ttdeci">static METAL_FUNC int merge_partition(const threadgroup ValT *As, const threadgroup ValT *Bs, short A_sz, short B_sz, short sort_md)</div><div class="ttdef"><b>Definition</b> sort.h:69</div></div>
<div class="ttc" id="astruct_block_merge_sort_html_afdec1074b7de04cbe083e3270b4ece88"><div class="ttname"><a href="struct_block_merge_sort.html#afdec1074b7de04cbe083e3270b4ece88">BlockMergeSort::thread_sort_t</a></div><div class="ttdeci">ThreadSort&lt; ValT, IdxT, ARG_SORT, N_PER_THREAD, CompareOp &gt; thread_sort_t</div><div class="ttdef"><b>Definition</b> sort.h:67</div></div>
<div class="ttc" id="astruct_kernel_merge_sort_html"><div class="ttname"><a href="struct_kernel_merge_sort.html">KernelMergeSort</a></div><div class="ttdef"><b>Definition</b> sort.h:220</div></div>
<div class="ttc" id="astruct_kernel_merge_sort_html_a37b94702630a4f97254d1da847d420c0"><div class="ttname"><a href="struct_kernel_merge_sort.html#a37b94702630a4f97254d1da847d420c0">KernelMergeSort::block_merge_sort_t</a></div><div class="ttdeci">BlockMergeSort&lt; ValT, IdxT, ARG_SORT, BLOCK_THREADS, N_PER_THREAD, CompareOp &gt; block_merge_sort_t</div><div class="ttdef"><b>Definition</b> sort.h:223</div></div>
<div class="ttc" id="astruct_kernel_merge_sort_html_a587b32e6748cffd2ace5a70b8c59dee4"><div class="ttname"><a href="struct_kernel_merge_sort.html#a587b32e6748cffd2ace5a70b8c59dee4">KernelMergeSort::IdxT</a></div><div class="ttdeci">uint IdxT</div><div class="ttdef"><b>Definition</b> sort.h:222</div></div>
<div class="ttc" id="astruct_kernel_merge_sort_html_a90102e73c3f6e9652e9870d57b129e71"><div class="ttname"><a href="struct_kernel_merge_sort.html#a90102e73c3f6e9652e9870d57b129e71">KernelMergeSort::block_sort</a></div><div class="ttdeci">static METAL_FUNC void block_sort(const device T *inp, device U *out, const constant int &amp;size_sorted_axis, const constant int &amp;in_stride_sorted_axis, const constant int &amp;out_stride_sorted_axis, const constant int &amp;in_stride_segment_axis, const constant int &amp;out_stride_segment_axis, threadgroup ValT *tgp_vals, threadgroup IdxT *tgp_idxs, uint3 tid, uint3 lid)</div><div class="ttdef"><b>Definition</b> sort.h:233</div></div>
<div class="ttc" id="astruct_kernel_merge_sort_html_a92910d137ea47703820cde5666d80574"><div class="ttname"><a href="struct_kernel_merge_sort.html#a92910d137ea47703820cde5666d80574">KernelMergeSort::ValT</a></div><div class="ttdeci">T ValT</div><div class="ttdef"><b>Definition</b> sort.h:221</div></div>
<div class="ttc" id="astruct_kernel_merge_sort_html_a959aaf5bfb70796a525fed318f7ae8ab"><div class="ttname"><a href="struct_kernel_merge_sort.html#a959aaf5bfb70796a525fed318f7ae8ab">KernelMergeSort::N_PER_BLOCK</a></div><div class="ttdeci">static constant constexpr const short N_PER_BLOCK</div><div class="ttdef"><b>Definition</b> sort.h:231</div></div>
<div class="ttc" id="astruct_kernel_multi_block_merge_sort_html"><div class="ttname"><a href="struct_kernel_multi_block_merge_sort.html">KernelMultiBlockMergeSort</a></div><div class="ttdef"><b>Definition</b> sort.h:398</div></div>
<div class="ttc" id="astruct_kernel_multi_block_merge_sort_html_a4a0c920980c5e56471558d22a727a514"><div class="ttname"><a href="struct_kernel_multi_block_merge_sort.html#a4a0c920980c5e56471558d22a727a514">KernelMultiBlockMergeSort::N_PER_BLOCK</a></div><div class="ttdeci">static constant constexpr const short N_PER_BLOCK</div><div class="ttdef"><b>Definition</b> sort.h:407</div></div>
<div class="ttc" id="astruct_kernel_multi_block_merge_sort_html_a56b3d8bf726e5619325dd07752666f8a"><div class="ttname"><a href="struct_kernel_multi_block_merge_sort.html#a56b3d8bf726e5619325dd07752666f8a">KernelMultiBlockMergeSort::block_sort</a></div><div class="ttdeci">static METAL_FUNC void block_sort(const device ValT *inp, device ValT *out_vals, device IdxT *out_idxs, const constant int &amp;size_sorted_axis, const constant int &amp;stride_sorted_axis, threadgroup ValT *tgp_vals, threadgroup IdxT *tgp_idxs, uint3 tid, uint3 lid)</div><div class="ttdef"><b>Definition</b> sort.h:409</div></div>
<div class="ttc" id="astruct_kernel_multi_block_merge_sort_html_a811e72376de254af2bf5303133562a9a"><div class="ttname"><a href="struct_kernel_multi_block_merge_sort.html#a811e72376de254af2bf5303133562a9a">KernelMultiBlockMergeSort::merge_partition</a></div><div class="ttdeci">static METAL_FUNC int merge_partition(const device ValT *As, const device ValT *Bs, int A_sz, int B_sz, int sort_md)</div><div class="ttdef"><b>Definition</b> sort.h:447</div></div>
<div class="ttc" id="astruct_kernel_multi_block_merge_sort_html_aaf08efb1c540b276b0f1bbdeb514544d"><div class="ttname"><a href="struct_kernel_multi_block_merge_sort.html#aaf08efb1c540b276b0f1bbdeb514544d">KernelMultiBlockMergeSort::block_merge_sort_t</a></div><div class="ttdeci">BlockMergeSort&lt; ValT, IdxT, ARG_SORT, BLOCK_THREADS, N_PER_THREAD, CompareOp &gt; block_merge_sort_t</div><div class="ttdef"><b>Definition</b> sort.h:399</div></div>
<div class="ttc" id="astruct_less_than_html"><div class="ttname"><a href="struct_less_than.html">LessThan</a></div><div class="ttdef"><b>Definition</b> sort.h:23</div></div>
<div class="ttc" id="astruct_less_than_html_a2798eb377b411c93a4ed30cf35caade2"><div class="ttname"><a href="struct_less_than.html#a2798eb377b411c93a4ed30cf35caade2">LessThan::operator()</a></div><div class="ttdeci">METAL_FUNC bool operator()(T a, T b)</div><div class="ttdef"><b>Definition</b> sort.h:26</div></div>
<div class="ttc" id="astruct_less_than_html_abf97a6b0163048e4ba96460939dbd3a3"><div class="ttname"><a href="struct_less_than.html#abf97a6b0163048e4ba96460939dbd3a3">LessThan::init</a></div><div class="ttdeci">static constexpr constant T init</div><div class="ttdef"><b>Definition</b> sort.h:24</div></div>
<div class="ttc" id="astruct_limits_html_a2f0673b6f9da89ce1d64f9f3d74f50a8"><div class="ttname"><a href="struct_limits.html#a2f0673b6f9da89ce1d64f9f3d74f50a8">Limits::max</a></div><div class="ttdeci">static const constant U max</div><div class="ttdef"><b>Definition</b> utils.h:24</div></div>
<div class="ttc" id="astruct_thread_sort_html"><div class="ttname"><a href="struct_thread_sort.html">ThreadSort</a></div><div class="ttdef"><b>Definition</b> sort.h:37</div></div>
<div class="ttc" id="astruct_thread_sort_html_a7c7cf65ffe4362596009fc1c05633e7a"><div class="ttname"><a href="struct_thread_sort.html#a7c7cf65ffe4362596009fc1c05633e7a">ThreadSort::sort</a></div><div class="ttdeci">static METAL_FUNC void sort(thread ValT(&amp;vals)[N_PER_THREAD], thread IdxT(&amp;idxs)[N_PER_THREAD])</div><div class="ttdef"><b>Definition</b> sort.h:38</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_938ab0ecf10b8b860ff766c820f665fd.html">mlx</a></li><li class="navelem"><a class="el" href="dir_1d446c9bd3c99228254c9484e0bc5c06.html">backend</a></li><li class="navelem"><a class="el" href="dir_d0c977ea65824390717cdb7efc36c157.html">metal</a></li><li class="navelem"><a class="el" href="dir_70a37effa88bcbd6b791977fa1e64356.html">kernels</a></li><li class="navelem"><a class="el" href="sort_8h.html">sort.h</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.13.2 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink