forked from FT_DSP/FT_DSP.gitlink.net
240 lines
29 KiB
HTML
240 lines
29 KiB
HTML
|
||
|
||
<!DOCTYPE html>
|
||
<html class="writer-html5" lang="zh-CN" data-content_root="../../">
|
||
<head>
|
||
<meta charset="utf-8" /><meta name="viewport" content="width=device-width, initial-scale=1" />
|
||
|
||
<meta name="viewport" content="width=device-width, initial-scale=1.0" />
|
||
<title>Sparsereshape — MindSpore Signal+ 使用手册 alpha 文档</title>
|
||
<link rel="stylesheet" type="text/css" href="../../_static/pygments.css?v=03e43079" />
|
||
<link rel="stylesheet" type="text/css" href="../../_static/css/theme.css?v=e59714d7" />
|
||
<link rel="stylesheet" type="text/css" href="../../_static/table.css?v=72b86d3e" />
|
||
|
||
|
||
<script src="../../_static/jquery.js?v=5d32c60e"></script>
|
||
<script src="../../_static/_sphinx_javascript_frameworks_compat.js?v=2cd50e6c"></script>
|
||
<script src="../../_static/documentation_options.js?v=406e4f49"></script>
|
||
<script src="../../_static/doctools.js?v=9bcbadda"></script>
|
||
<script src="../../_static/sphinx_highlight.js?v=dc90522c"></script>
|
||
<script src="../../_static/translations.js?v=beaddf03"></script>
|
||
<script async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
|
||
<script src="../../_static/table.js?v=99ed15ba"></script>
|
||
<script src="../../_static/js/theme.js"></script>
|
||
<link rel="index" title="索引" href="../../genindex.html" />
|
||
<link rel="search" title="搜索" href="../../search.html" />
|
||
<link rel="next" title="Sparsesegmentsum" href="sparsesegmentsum.html" />
|
||
<link rel="prev" title="Smoothl1lossgrad" href="smoothl1lossgrad.html" />
|
||
</head>
|
||
|
||
<body class="wy-body-for-nav">
|
||
<div class="wy-grid-for-nav">
|
||
<nav data-toggle="wy-nav-shift" class="wy-nav-side">
|
||
<div class="wy-side-scroll">
|
||
<div class="wy-side-nav-search" >
|
||
|
||
|
||
|
||
<a href="../../index.html" class="icon icon-home">
|
||
MindSpore Signal+ 使用手册
|
||
</a>
|
||
<div role="search">
|
||
<form id="rtd-search-form" class="wy-form" action="../../search.html" method="get">
|
||
<input type="text" name="q" placeholder="搜索文档" aria-label="搜索文档" />
|
||
<input type="hidden" name="check_keywords" value="yes" />
|
||
<input type="hidden" name="area" value="default" />
|
||
</form>
|
||
</div>
|
||
</div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="导航菜单">
|
||
<ul>
|
||
<li class="toctree-l1"><a class="reference internal" href="../../quickstart/index.html">快速入门</a></li>
|
||
<li class="toctree-l1"><a class="reference internal" href="../../appdevelop/index.html">应用开发示例</a></li>
|
||
<li class="toctree-l1"><a class="reference internal" href="../index.html">算子库支持</a></li>
|
||
<li class="toctree-l1"><a class="reference internal" href="../../refdoc/index.html">参考资料</a></li>
|
||
</ul>
|
||
|
||
</div>
|
||
</div>
|
||
</nav>
|
||
|
||
<section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="移动版导航菜单" >
|
||
<i data-toggle="wy-nav-top" class="fa fa-bars"></i>
|
||
<a href="../../index.html">MindSpore Signal+ 使用手册</a>
|
||
</nav>
|
||
|
||
<div class="wy-nav-content">
|
||
<div class="rst-content">
|
||
<div role="navigation" aria-label="页面导航">
|
||
<ul class="wy-breadcrumbs">
|
||
<li><a href="../../index.html" class="icon icon-home" aria-label="Home"></a></li>
|
||
<li class="breadcrumb-item"><a href="../index.html">算子库支持</a></li>
|
||
<li class="breadcrumb-item"><a href="dsplib_index.html">DSP Library C API Reference</a></li>
|
||
<li class="breadcrumb-item active">Sparsereshape</li>
|
||
<li class="wy-breadcrumbs-aside">
|
||
<a href="../../_sources/functionlib/dsplib/sparsereshape.rst.txt" rel="nofollow"> 查看页面源码</a>
|
||
</li>
|
||
</ul>
|
||
<hr/>
|
||
</div>
|
||
<div role="main" class="document" itemscope="itemscope" itemtype="http://schema.org/Article">
|
||
<div itemprop="articleBody">
|
||
|
||
<section id="sparsereshape">
|
||
<h1>Sparsereshape<a class="headerlink" href="#sparsereshape" title="Link to this heading"></a></h1>
|
||
<p>对稀疏张量进行形状重塑（Reshape）。该算子将稀疏张量的索引从输入形状转换到输出形状，不改变稀疏值本身，只更新索引。该算子不区分数据类型，只处理索引信息。</p>
|
||
<p>对于每个稀疏元素：
|
||
- 计算其在输入形状中的线性索引：</p>
|
||
<blockquote>
|
||
<div><p><span class="math notranslate nohighlight">\(\text{ori\_index} = \sum_{j=0}^{\text{input\_rank}-1} \text{in\_indices}[j] \times \text{in\_stride}[j]\)</span></p>
|
||
</div></blockquote>
|
||
<ul>
|
||
<li><p>将线性索引转换为输出形状的多维索引：</p>
|
||
<p><span class="math notranslate nohighlight">\(\text{out\_indices}[j] = \text{ori\_index} / \text{out\_stride}[j]\)</span>，然后 <span class="math notranslate nohighlight">\(\text{ori\_index} = \text{ori\_index} \% \text{out\_stride}[j]\)</span></p>
|
||
</li>
|
||
</ul>
|
||
<dl class="simple">
|
||
<dt>输入：</dt><dd><ul class="simple">
|
||
<li><p><strong>in_indices_ptr</strong> - 输入稀疏张量的索引数组，大小为 <cite>N * input_rank</cite>，每 <cite>input_rank</cite> 个元素表示一个非零元素的索引。</p></li>
|
||
<li><p><strong>in_inshape_ptr</strong> - 输入稀疏张量的形状数组，大小为 <cite>input_rank</cite>，例如 <cite>[2, 3]</cite> 表示 2×3 的矩阵。</p></li>
|
||
<li><p><strong>in_outshape_ptr</strong> - 目标输出形状数组，大小为 <cite>output_rank</cite>，例如 <cite>[3, 2]</cite> 表示要将形状转换为 3×2。</p></li>
|
||
<li><p><strong>out_outshape_ptr</strong> - 输出形状数组，应该与 <cite>in_outshape_ptr</cite> 一致，大小为 <cite>output_rank</cite>。</p></li>
|
||
<li><p><strong>input_rank</strong> - 输入稀疏张量的维度数。</p></li>
|
||
<li><p><strong>output_rank</strong> - 输出稀疏张量的维度数。</p></li>
|
||
<li><p><strong>N</strong> - 稀疏张量中非零元素的数量。</p></li>
|
||
<li><p><strong>in_stride</strong> - 输入形状的步长数组（临时空间），大小为 <cite>input_rank</cite>，用于中间计算。</p></li>
|
||
<li><p><strong>out_stride</strong> - 输出形状的步长数组（临时空间），大小为 <cite>output_rank</cite>，用于中间计算。</p></li>
|
||
<li><p><strong>core_mask</strong> - 核掩码（仅共享存储版本需要）。</p></li>
|
||
</ul>
|
||
</dd>
|
||
<dt>输出：</dt><dd><ul class="simple">
|
||
<li><p><strong>out_indices_ptr</strong> - 转换后的索引数组，大小为 <cite>N * output_rank</cite>，每 <cite>output_rank</cite> 个元素表示一个非零元素在输出形状中的索引。</p></li>
|
||
</ul>
|
||
</dd>
|
||
<dt>支持平台：</dt><dd><p><code class="docutils literal notranslate"><span class="pre">FT78NE</span></code>
|
||
<code class="docutils literal notranslate"><span class="pre">MT7004</span></code></p>
|
||
</dd>
|
||
</dl>
|
||
<div class="admonition note">
|
||
<p class="admonition-title">备注</p>
|
||
<ul class="simple">
|
||
<li><p>FT78NE 支持fp32</p></li>
|
||
<li><p>MT7004 支持fp32</p></li>
|
||
</ul>
|
||
</div>
|
||
<p><strong>共享存储版本:</strong></p>
|
||
<dl class="c function">
|
||
<dt class="sig sig-object c" id="c.sparsereshape_s">
|
||
<span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">sparsereshape_s</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n"><span class="pre">in_indices_ptr</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n"><span class="pre">in_inshape_ptr</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n"><span class="pre">in_outshape_ptr</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n"><span class="pre">out_indices_ptr</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n"><span class="pre">out_outshape_ptr</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n"><span class="pre">input_rank</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n"><span class="pre">output_rank</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n"><span class="pre">N</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n"><span class="pre">in_stride</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n"><span class="pre">out_stride</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n"><span class="pre">core_mask</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.sparsereshape_s" title="Link to this definition"></a><br /></dt>
|
||
<dd></dd></dl>
|
||
|
||
<p><strong>C调用示例：</strong></p>
|
||
<div class="highlight-c notranslate"><div class="highlight"><pre><span></span><span class="linenos"> 1</span><span class="c1">//FT78NE示例</span>
|
||
<span class="linenos"> 2</span><span class="cp">#include</span><span class="w"> </span><span class="cpf"><stdio.h></span>
|
||
<span class="linenos"> 3</span><span class="cp">#include</span><span class="w"> </span><span class="cpf"><sparsereshape.h></span>
|
||
<span class="linenos"> 4</span>
|
||
<span class="linenos"> 5</span><span class="kt">int</span><span class="w"> </span><span class="nf">main</span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="n">argc</span><span class="p">,</span><span class="w"> </span><span class="kt">char</span><span class="o">*</span><span class="w"> </span><span class="n">argv</span><span class="p">[])</span><span class="w"> </span><span class="p">{</span>
|
||
<span class="linenos"> 6</span><span class="w"> </span><span class="c1">// 假设在DDR空间</span>
|
||
<span class="linenos"> 7</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">N</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">3</span><span class="p">;</span><span class="w"> </span><span class="c1">// 有3个非零元素</span>
|
||
<span class="linenos"> 8</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">input_rank</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">2</span><span class="p">;</span><span class="w"> </span><span class="c1">// 输入是2维</span>
|
||
<span class="linenos"> 9</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">output_rank</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">2</span><span class="p">;</span><span class="w"> </span><span class="c1">// 输出也是2维</span>
|
||
<span class="linenos">10</span>
|
||
<span class="linenos">11</span><span class="w"> </span><span class="c1">// 输入形状 [2, 3]，输出形状 [3, 2]</span>
|
||
<span class="linenos">12</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">in_inshape</span><span class="p">[]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="mi">2</span><span class="p">,</span><span class="w"> </span><span class="mi">3</span><span class="p">};</span>
|
||
<span class="linenos">13</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">in_outshape</span><span class="p">[]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="mi">3</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">};</span>
|
||
<span class="linenos">14</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">out_outshape</span><span class="p">[]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="mi">3</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">};</span><span class="w"> </span><span class="c1">// 应该和 in_outshape 一致</span>
|
||
<span class="linenos">15</span>
|
||
<span class="linenos">16</span><span class="w"> </span><span class="c1">// 输入索引：[[0,0], [0,1], [1,2]]</span>
|
||
<span class="linenos">17</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="o">*</span><span class="n">in_indices_ptr</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="o">*</span><span class="p">)</span><span class="mh">0xA0000000</span><span class="p">;</span>
|
||
<span class="linenos">18</span><span class="w"> </span><span class="n">in_indices_ptr</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span><span class="p">;</span><span class="w"> </span><span class="n">in_indices_ptr</span><span class="p">[</span><span class="mi">1</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span><span class="p">;</span><span class="w"> </span><span class="c1">// 第一个元素在位置(0,0)</span>
|
||
<span class="linenos">19</span><span class="w"> </span><span class="n">in_indices_ptr</span><span class="p">[</span><span class="mi">2</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span><span class="p">;</span><span class="w"> </span><span class="n">in_indices_ptr</span><span class="p">[</span><span class="mi">3</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">;</span><span class="w"> </span><span class="c1">// 第二个元素在位置(0,1)</span>
|
||
<span class="linenos">20</span><span class="w"> </span><span class="n">in_indices_ptr</span><span class="p">[</span><span class="mi">4</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">;</span><span class="w"> </span><span class="n">in_indices_ptr</span><span class="p">[</span><span class="mi">5</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">2</span><span class="p">;</span><span class="w"> </span><span class="c1">// 第三个元素在位置(1,2)</span>
|
||
<span class="linenos">21</span>
|
||
<span class="linenos">22</span><span class="w"> </span><span class="c1">// 输出索引（待填充）</span>
|
||
<span class="linenos">23</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="o">*</span><span class="n">out_indices_ptr</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="o">*</span><span class="p">)</span><span class="mh">0xB0000000</span><span class="p">;</span>
|
||
<span class="linenos">24</span>
|
||
<span class="linenos">25</span><span class="w"> </span><span class="c1">// 临时空间：步长数组</span>
|
||
<span class="linenos">26</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="o">*</span><span class="n">in_stride</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="o">*</span><span class="p">)</span><span class="mh">0xC0000000</span><span class="p">;</span><span class="w"> </span><span class="c1">// 大小为 input_rank</span>
|
||
<span class="linenos">27</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="o">*</span><span class="n">out_stride</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="o">*</span><span class="p">)</span><span class="mh">0xC0100000</span><span class="p">;</span><span class="w"> </span><span class="c1">// 大小为 output_rank</span>
|
||
<span class="linenos">28</span>
|
||
<span class="linenos">29</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">core_mask</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mh">0xff</span><span class="p">;</span>
|
||
<span class="linenos">30</span>
|
||
<span class="hll"><span class="linenos">31</span><span class="w"> </span><span class="n">sparsereshape_s</span><span class="p">(</span><span class="n">in_indices_ptr</span><span class="p">,</span><span class="w"> </span><span class="n">in_inshape</span><span class="p">,</span><span class="w"> </span><span class="n">in_outshape</span><span class="p">,</span><span class="w"> </span><span class="n">out_indices_ptr</span><span class="p">,</span>
|
||
</span><span class="hll"><span class="linenos">32</span><span class="w"> </span><span class="n">out_outshape</span><span class="p">,</span><span class="w"> </span><span class="n">input_rank</span><span class="p">,</span><span class="w"> </span><span class="n">output_rank</span><span class="p">,</span><span class="w"> </span><span class="n">N</span><span class="p">,</span><span class="w"> </span><span class="n">in_stride</span><span class="p">,</span>
|
||
</span><span class="hll"><span class="linenos">33</span><span class="w"> </span><span class="n">out_stride</span><span class="p">,</span><span class="w"> </span><span class="n">core_mask</span><span class="p">);</span>
|
||
</span><span class="linenos">34</span>
|
||
<span class="linenos">35</span><span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="mi">0</span><span class="p">;</span>
|
||
<span class="linenos">36</span><span class="p">}</span>
|
||
</pre></div>
|
||
</div>
|
||
<p><strong>私有存储版本:</strong></p>
|
||
<dl class="c function">
|
||
<dt class="sig sig-object c" id="c.sparsereshape_p">
|
||
<span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">sparsereshape_p</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n"><span class="pre">in_indices_ptr</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n"><span class="pre">in_inshape_ptr</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n"><span class="pre">in_outshape_ptr</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n"><span class="pre">out_indices_ptr</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n"><span class="pre">out_outshape_ptr</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n"><span class="pre">input_rank</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n"><span class="pre">output_rank</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n"><span class="pre">N</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n"><span class="pre">in_stride</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n"><span class="pre">out_stride</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.sparsereshape_p" title="Link to this definition"></a><br /></dt>
|
||
<dd></dd></dl>
|
||
|
||
<p><strong>C调用示例：</strong></p>
|
||
<div class="highlight-c notranslate"><div class="highlight"><pre><span></span><span class="linenos"> 1</span><span class="c1">//FT78NE示例</span>
|
||
<span class="linenos"> 2</span><span class="cp">#include</span><span class="w"> </span><span class="cpf"><stdio.h></span>
|
||
<span class="linenos"> 3</span><span class="cp">#include</span><span class="w"> </span><span class="cpf"><sparsereshape.h></span>
|
||
<span class="linenos"> 4</span>
|
||
<span class="linenos"> 5</span><span class="kt">int</span><span class="w"> </span><span class="nf">main</span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="n">argc</span><span class="p">,</span><span class="w"> </span><span class="kt">char</span><span class="o">*</span><span class="w"> </span><span class="n">argv</span><span class="p">[])</span><span class="w"> </span><span class="p">{</span>
|
||
<span class="linenos"> 6</span><span class="w"> </span><span class="c1">// 假设在L2空间</span>
|
||
<span class="linenos"> 7</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">N</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">3</span><span class="p">;</span>
|
||
<span class="linenos"> 8</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">input_rank</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">2</span><span class="p">;</span>
|
||
<span class="linenos"> 9</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">output_rank</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">2</span><span class="p">;</span>
|
||
<span class="linenos">10</span>
|
||
<span class="linenos">11</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">in_inshape</span><span class="p">[]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="mi">2</span><span class="p">,</span><span class="w"> </span><span class="mi">3</span><span class="p">};</span>
|
||
<span class="linenos">12</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">in_outshape</span><span class="p">[]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="mi">3</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">};</span>
|
||
<span class="linenos">13</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">out_outshape</span><span class="p">[]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="mi">3</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">};</span>
|
||
<span class="linenos">14</span>
|
||
<span class="linenos">15</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="o">*</span><span class="n">in_indices_ptr</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="o">*</span><span class="p">)</span><span class="mh">0x10000000</span><span class="p">;</span>
|
||
<span class="linenos">16</span><span class="w"> </span><span class="n">in_indices_ptr</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span><span class="p">;</span><span class="w"> </span><span class="n">in_indices_ptr</span><span class="p">[</span><span class="mi">1</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span><span class="p">;</span>
|
||
<span class="linenos">17</span><span class="w"> </span><span class="n">in_indices_ptr</span><span class="p">[</span><span class="mi">2</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span><span class="p">;</span><span class="w"> </span><span class="n">in_indices_ptr</span><span class="p">[</span><span class="mi">3</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">;</span>
|
||
<span class="linenos">18</span><span class="w"> </span><span class="n">in_indices_ptr</span><span class="p">[</span><span class="mi">4</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">;</span><span class="w"> </span><span class="n">in_indices_ptr</span><span class="p">[</span><span class="mi">5</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">2</span><span class="p">;</span>
|
||
<span class="linenos">19</span>
|
||
<span class="linenos">20</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="o">*</span><span class="n">out_indices_ptr</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="o">*</span><span class="p">)</span><span class="mh">0x10001000</span><span class="p">;</span>
|
||
<span class="linenos">21</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="o">*</span><span class="n">in_stride</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="o">*</span><span class="p">)</span><span class="mh">0x10002000</span><span class="p">;</span>
|
||
<span class="linenos">22</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="o">*</span><span class="n">out_stride</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="o">*</span><span class="p">)</span><span class="mh">0x10003000</span><span class="p">;</span>
|
||
<span class="linenos">23</span>
|
||
<span class="hll"><span class="linenos">24</span><span class="w"> </span><span class="n">sparsereshape_p</span><span class="p">(</span><span class="n">in_indices_ptr</span><span class="p">,</span><span class="w"> </span><span class="n">in_inshape</span><span class="p">,</span><span class="w"> </span><span class="n">in_outshape</span><span class="p">,</span><span class="w"> </span><span class="n">out_indices_ptr</span><span class="p">,</span>
|
||
</span><span class="hll"><span class="linenos">25</span><span class="w"> </span><span class="n">out_outshape</span><span class="p">,</span><span class="w"> </span><span class="n">input_rank</span><span class="p">,</span><span class="w"> </span><span class="n">output_rank</span><span class="p">,</span><span class="w"> </span><span class="n">N</span><span class="p">,</span><span class="w"> </span><span class="n">in_stride</span><span class="p">,</span>
|
||
</span><span class="hll"><span class="linenos">26</span><span class="w"> </span><span class="n">out_stride</span><span class="p">);</span>
|
||
</span><span class="linenos">27</span>
|
||
<span class="linenos">28</span><span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="mi">0</span><span class="p">;</span>
|
||
<span class="linenos">29</span><span class="p">}</span>
|
||
</pre></div>
|
||
</div>
|
||
</section>
|
||
|
||
|
||
</div>
|
||
</div>
|
||
<footer><div class="rst-footer-buttons" role="navigation" aria-label="页脚">
|
||
<a href="smoothl1lossgrad.html" class="btn btn-neutral float-left" title="Smoothl1lossgrad" accesskey="p" rel="prev"><span class="fa fa-arrow-circle-left" aria-hidden="true"></span> 上一页</a>
|
||
<a href="sparsesegmentsum.html" class="btn btn-neutral float-right" title="Sparsesegmentsum" accesskey="n" rel="next">下一页 <span class="fa fa-arrow-circle-right" aria-hidden="true"></span></a>
|
||
</div>
|
||
|
||
<hr/>
|
||
|
||
<div role="contentinfo">
|
||
<p>© 版权所有 2025 - 2026, NUDT-674。</p>
|
||
</div>
|
||
|
||
利用 <a href="https://www.sphinx-doc.org/">Sphinx</a> 构建，使用的
|
||
<a href="https://github.com/readthedocs/sphinx_rtd_theme">主题</a>
|
||
由 <a href="https://readthedocs.org">Read the Docs</a> 开发.
|
||
|
||
|
||
</footer>
|
||
</div>
|
||
</div>
|
||
</section>
|
||
</div>
|
||
<script>
|
||
jQuery(function () {
|
||
SphinxRtdTheme.Navigation.enable(true);
|
||
});
|
||
</script>
|
||
|
||
</body>
|
||
</html> |