chamgj
/
FT_DSP.gitlink.net
forked from FT_DSP/FT_DSP.gitlink.net
0
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
FT_DSP.gitlink.net/master/html/functionlib/dsplib/maxpoolgrad.html

324 lines
47 KiB
HTML
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

<!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>MaxPoolGrad &mdash; 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="OneHot" href="onehot.html" />
<link rel="prev" title="MaxPoolFusion" href="maxpoolfusion.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">MaxPoolGrad</li>
<li class="wy-breadcrumbs-aside">
<a href="../../_sources/functionlib/dsplib/maxpoolgrad.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="maxpoolgrad">
<h1>MaxPoolGrad<a class="headerlink" href="#maxpoolgrad" title="Link to this heading"></a></h1>
<blockquote>
<div><p>描述 MaxPool 的反向传播（梯度）计算。该算子将上游梯度（dy）只回传到前向最大池化过程中被选为最大值的位置；其它位置的梯度为 0。</p>
<p>数学定义:</p>
<div class="math notranslate nohighlight">
\[\begin{split}\text{output}_{b,\ h_i,\ w_i,\ c} =
\begin{cases}
\text{dy}_{b,\ h_o,\ w_o,\ c}, &amp;
\text{if } (h_i,\ w_i)
= \displaystyle \arg\max_{(h,w)\in\mathcal{W}(h_o,w_o)}
\text{input}_{b,\ h,\ w,\ c}, \\
0, &amp; \text{otherwise}.
\end{cases}\end{split}\]</div>
<p>其中，<span class="math notranslate nohighlight">\(\mathcal{W}(h_o, w_o)\)</span> 表示输出位置 <span class="math notranslate nohighlight">\((h_o, w_o)\)</span> 对应的池化窗口区域。窗口像素位置 <span class="math notranslate nohighlight">\((h, w)\)</span> 可表示为：</p>
<div class="math notranslate nohighlight">
\[h = h_o \cdot \text{stride}_h - \text{pad}_u + \Delta h\]</div>
<div class="math notranslate nohighlight">
\[w = w_o \cdot \text{stride}_w - \text{pad}_l + \Delta w\]</div>
<div class="math notranslate nohighlight">
\[\Delta h \in [0,\ \text{win}_h - 1], \qquad
\Delta w \in [0,\ \text{win}_w - 1]\]</div>
<p>并且仅当采样点落在输入有效范围内时会被考虑：</p>
<div class="math notranslate nohighlight">
\[0 \le h &lt; \text{in}_h, \qquad 0 \le w &lt; \text{in}_w.\]</div>
<dl class="simple">
<dt>实现细节说明:</dt><dd><ul class="simple">
<li><p>前向池化使用窗口 <span class="math notranslate nohighlight">\(\text{win}_h \times \text{win}_w\)</span>，步长为 <span class="math notranslate nohighlight">\(\text{stride}_h\)</span>, <span class="math notranslate nohighlight">\(\text{stride}_w\)</span>，并且在边界处使用 pad（pad_u, pad_l）。</p></li>
<li><p>反向传播时，输出梯度 tensor（即需要写入的输入梯度）在每个 batch 开始前先被初始化为 0（代码中有一次整体清零）。</p></li>
<li><p>对于每个输出像素 <span class="math notranslate nohighlight">\((h_o,w_o)\)</span> 以及每个通道 c：</p></li>
<li><p>在对应的输入窗口中找到前向最大值的位置 <span class="math notranslate nohighlight">\((h^*,w^*)\)</span>；</p></li>
<li><p>将上游梯度 <span class="math notranslate nohighlight">\(\text{dy}_{b,h_o,w_o,c}\)</span> 累加到该位置：<span class="math notranslate nohighlight">\(\text{output}_{b,h^*,w^*,c} \mathrel{+}= \text{dy}_{b,h_o,w_o,c}\)</span>。</p></li>
<li><p>其他位置梯度保持 0。</p></li>
</ul>
</dd>
<dt>输入:</dt><dd><ul class="simple">
<li><p><strong>input</strong> - 输入张量指针，采用 <strong>NHWC 格式</strong>，形状为 <span class="math notranslate nohighlight">\([batch,\ in\_h,\ in\_w,\ channel]\)</span></p></li>
<li><p><strong>dy</strong> - 上游梯度张量指针，采用 <strong>NHWC 格式</strong>，形状为 <span class="math notranslate nohighlight">\([batch,\ output\_h,\ output\_w,\ channel]\)</span></p></li>
<li><p><strong>in_w</strong> - 输入张量的宽度 (W)</p></li>
<li><p><strong>in_h</strong> - 输入张量的高度 (H)</p></li>
<li><p><strong>win_w</strong> - 池化窗口的宽度，即窗口在 W 方向的大小</p></li>
<li><p><strong>win_h</strong> - 池化窗口的高度，即窗口在 H 方向的大小</p></li>
<li><p><strong>output_w</strong> - 输出特征图的宽度</p></li>
<li><p><strong>output_h</strong> - 输出特征图的高度</p></li>
<li><p><strong>batch</strong> - 批次大小，即输入中的 batch 数</p></li>
<li><p><strong>channel</strong> - 通道数 C ，每个池化位置都分别对 C 个通道独立执行最大池化与裁剪</p></li>
<li><p><strong>stride_w</strong> - 池化窗口在 W 方向的步长</p></li>
<li><p><strong>stride_h</strong> - 池化窗口在 H 方向的步长</p></li>
<li><p><strong>pad_l</strong> - 输入特征图左侧的填充大小</p></li>
<li><p><strong>pad_u</strong> - 输入特征图上侧的填充大小</p></li>
<li><p><strong>minf</strong> - 输出结果的下界值。池化结果会执行 <span class="math notranslate nohighlight">\(\max(v,\ \text{minf})\)</span></p></li>
<li><p><strong>maxf</strong> - 输出结果的上界值。池化结果会执行 <span class="math notranslate nohighlight">\(\min(v,\ \text{maxf})\)</span></p></li>
<li><p><strong>core_mask</strong> - 核心掩码，指定使用的计算核心</p></li>
</ul>
</dd>
<dt>输出:</dt><dd><ul class="simple">
<li><p><strong>output</strong> - 输出张量指针，采用 <strong>NHWC 格式</strong>，形状为 <span class="math notranslate nohighlight">\([batch,\ in\_h,\ in\_w,\ channel]\)</span>。</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, fp64</p></li>
<li><p>MT7004 支持fp16, fp32</p></li>
<li><p>调用时将除 core_mask 外的参数打包通过 long long params 数组传入，顺序为：
input, dy, output, in_w, in_h, win_w, win_h, output_w, output_h, batch, channel,
stride_w, stride_h, pad_l, pad_u, minf, maxf</p></li>
</ul>
</div>
</div></blockquote>
<p><strong>共享存储版本:</strong></p>
<dl class="c function">
<dt class="sig sig-object c" id="c.hp_maxpool_grad_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">hp_maxpool_grad_s</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">long</span></span><span class="w"> </span><span class="kt"><span class="pre">long</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n"><span class="pre">params</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.hp_maxpool_grad_s" title="Link to this definition"></a><br /></dt>
<dd></dd></dl>
<dl class="c function">
<dt class="sig sig-object c" id="c.fp_maxpool_grad_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">fp_maxpool_grad_s</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">long</span></span><span class="w"> </span><span class="kt"><span class="pre">long</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n"><span class="pre">params</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.fp_maxpool_grad_s" title="Link to this definition"></a><br /></dt>
<dd></dd></dl>
<dl class="c function">
<dt class="sig sig-object c" id="c.dp_maxpool_grad_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">dp_maxpool_grad_s</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">long</span></span><span class="w"> </span><span class="kt"><span class="pre">long</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n"><span class="pre">params</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.dp_maxpool_grad_s" title="Link to this definition"></a><br /></dt>
<dd><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">&lt;stdio.h&gt;</span>
<span class="linenos"> 3</span>
<span class="linenos"> 4</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"> 5</span><span class="w"> </span><span class="kt">double</span><span class="o">*</span><span class="w"> </span><span class="n">input_ptr</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">double</span><span class="o">*</span><span class="p">)</span><span class="mh">0xA0000000</span><span class="p">;</span>
<span class="linenos"> 6</span><span class="w"> </span><span class="kt">double</span><span class="o">*</span><span class="w"> </span><span class="n">dy_ptr</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">double</span><span class="o">*</span><span class="p">)</span><span class="mh">0xB0000000</span><span class="p">;</span>
<span class="linenos"> 7</span><span class="w"> </span><span class="kt">double</span><span class="o">*</span><span class="w"> </span><span class="n">output_ptr</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">double</span><span class="o">*</span><span class="p">)</span><span class="mh">0xC0000000</span><span class="p">;</span>
<span class="linenos"> 8</span><span class="w"> </span><span class="kt">double</span><span class="o">*</span><span class="w"> </span><span class="n">check_ptr</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">double</span><span class="o">*</span><span class="p">)</span><span class="mh">0xD0000000</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">in_w</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">gin_w</span><span class="p">;</span>
<span class="linenos">10</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">in_h</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">gin_h</span><span class="p">;</span>
<span class="linenos">11</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">win_w</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">6</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">win_h</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">6</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">batch</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">gbatch</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">channel</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">15</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">stride_w</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">4</span><span class="p">;</span>
<span class="linenos">16</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">stride_h</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">4</span><span class="p">;</span>
<span class="linenos">17</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">pad_l</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="kt">int</span><span class="w"> </span><span class="n">pad_u</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">19</span><span class="w"> </span><span class="kt">double</span><span class="w"> </span><span class="n">minf</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.0f</span><span class="p">;</span>
<span class="linenos">20</span><span class="w"> </span><span class="kt">double</span><span class="w"> </span><span class="n">maxf</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">50.0f</span><span class="p">;</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="n">dividor</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">in_w</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">pad_l</span><span class="o">*</span><span class="mi">2</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">win_w</span><span class="p">;</span>
<span class="linenos">24</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">output_w</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">dividor</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">stride_w</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="o">/</span><span class="w"> </span><span class="n">stride_w</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">25</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">dividor2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">in_h</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">pad_u</span><span class="o">*</span><span class="mi">2</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">win_h</span><span class="p">;</span>
<span class="linenos">26</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">output_h</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">dividor2</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">stride_h</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="o">/</span><span class="w"> </span><span class="n">stride_h</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">27</span>
<span class="linenos">28</span><span class="w"> </span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="w"> </span><span class="n">params</span><span class="p">[</span><span class="mi">17</span><span class="p">];</span>
<span class="linenos">29</span><span class="w"> </span><span class="n">params</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="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">input_ptr</span><span class="p">;</span>
<span class="linenos">30</span><span class="w"> </span><span class="n">params</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="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">dy_ptr</span><span class="p">;</span>
<span class="linenos">31</span><span class="w"> </span><span class="n">params</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="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">output_ptr</span><span class="p">;</span>
<span class="linenos">32</span><span class="w"> </span><span class="n">params</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="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">in_w</span><span class="p">;</span>
<span class="linenos">33</span><span class="w"> </span><span class="n">params</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="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">in_h</span><span class="p">;</span>
<span class="linenos">34</span><span class="w"> </span><span class="n">params</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="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">win_w</span><span class="p">;</span>
<span class="linenos">35</span><span class="w"> </span><span class="n">params</span><span class="p">[</span><span class="mi">6</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">win_h</span><span class="p">;</span>
<span class="linenos">36</span><span class="w"> </span><span class="n">params</span><span class="p">[</span><span class="mi">7</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">output_w</span><span class="p">;</span>
<span class="linenos">37</span><span class="w"> </span><span class="n">params</span><span class="p">[</span><span class="mi">8</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">output_h</span><span class="p">;</span>
<span class="linenos">38</span><span class="w"> </span><span class="n">params</span><span class="p">[</span><span class="mi">9</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">batch</span><span class="p">;</span>
<span class="linenos">39</span><span class="w"> </span><span class="n">params</span><span class="p">[</span><span class="mi">10</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">channel</span><span class="p">;</span>
<span class="linenos">40</span><span class="w"> </span><span class="n">params</span><span class="p">[</span><span class="mi">11</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">stride_w</span><span class="p">;</span>
<span class="linenos">41</span><span class="w"> </span><span class="n">params</span><span class="p">[</span><span class="mi">12</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">stride_h</span><span class="p">;</span>
<span class="linenos">42</span><span class="w"> </span><span class="n">params</span><span class="p">[</span><span class="mi">13</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">pad_l</span><span class="p">;</span>
<span class="linenos">43</span><span class="w"> </span><span class="n">params</span><span class="p">[</span><span class="mi">14</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">pad_u</span><span class="p">;</span>
<span class="linenos">44</span><span class="w"> </span><span class="n">params</span><span class="p">[</span><span class="mi">15</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="o">&amp;</span><span class="n">minf</span><span class="p">;</span><span class="w"> </span><span class="c1">//注意这里传指针，不能直接强制转换成long long</span>
<span class="linenos">45</span><span class="w"> </span><span class="n">params</span><span class="p">[</span><span class="mi">16</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="o">&amp;</span><span class="n">maxf</span><span class="p">;</span>
<span class="linenos">46</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">0x0f</span><span class="p">;</span>
<span class="hll"><span class="linenos">47</span><span class="w"> </span><span class="n">fp_maxpool_grad_s</span><span class="p">(</span><span class="n">params</span><span class="p">,</span><span class="w"> </span><span class="n">core_mask</span><span class="p">);</span>
</span><span class="linenos">48</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">49</span><span class="p">}</span>
</pre></div>
</div>
</dd></dl>
<p><strong>私有存储版本:</strong></p>
<dl class="c function">
<dt class="sig sig-object c" id="c.hp_maxpool_grad_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">hp_maxpool_grad_p</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">long</span></span><span class="w"> </span><span class="kt"><span class="pre">long</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n"><span class="pre">params</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.hp_maxpool_grad_p" title="Link to this definition"></a><br /></dt>
<dd></dd></dl>
<dl class="c function">
<dt class="sig sig-object c" id="c.fp_maxpool_grad_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">fp_maxpool_grad_p</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">long</span></span><span class="w"> </span><span class="kt"><span class="pre">long</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n"><span class="pre">params</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.fp_maxpool_grad_p" title="Link to this definition"></a><br /></dt>
<dd></dd></dl>
<dl class="c function">
<dt class="sig sig-object c" id="c.dp_maxpool_grad_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">dp_maxpool_grad_p</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">long</span></span><span class="w"> </span><span class="kt"><span class="pre">long</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n"><span class="pre">params</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.dp_maxpool_grad_p" title="Link to this definition"></a><br /></dt>
<dd><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">&lt;stdio.h&gt;</span>
<span class="linenos"> 3</span>
<span class="linenos"> 4</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"> 5</span><span class="w"> </span><span class="kt">double</span><span class="o">*</span><span class="w"> </span><span class="n">input_ptr</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">double</span><span class="o">*</span><span class="p">)</span><span class="mh">0xA0000000</span><span class="p">;</span>
<span class="linenos"> 6</span><span class="w"> </span><span class="kt">double</span><span class="o">*</span><span class="w"> </span><span class="n">dy_ptr</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">double</span><span class="o">*</span><span class="p">)</span><span class="mh">0xB0000000</span><span class="p">;</span>
<span class="linenos"> 7</span><span class="w"> </span><span class="kt">double</span><span class="o">*</span><span class="w"> </span><span class="n">output_ptr</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">double</span><span class="o">*</span><span class="p">)</span><span class="mh">0xC0000000</span><span class="p">;</span>
<span class="linenos"> 8</span><span class="w"> </span><span class="kt">double</span><span class="o">*</span><span class="w"> </span><span class="n">check_ptr</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">double</span><span class="o">*</span><span class="p">)</span><span class="mh">0xD0000000</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">in_w</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">gin_w</span><span class="p">;</span>
<span class="linenos">10</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">in_h</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">gin_h</span><span class="p">;</span>
<span class="linenos">11</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">win_w</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">6</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">win_h</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">6</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">batch</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">gbatch</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">channel</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">15</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">stride_w</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">4</span><span class="p">;</span>
<span class="linenos">16</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">stride_h</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">4</span><span class="p">;</span>
<span class="linenos">17</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">pad_l</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="kt">int</span><span class="w"> </span><span class="n">pad_u</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">19</span><span class="w"> </span><span class="kt">double</span><span class="w"> </span><span class="n">minf</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.0f</span><span class="p">;</span>
<span class="linenos">20</span><span class="w"> </span><span class="kt">double</span><span class="w"> </span><span class="n">maxf</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">50.0f</span><span class="p">;</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="n">dividor</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">in_w</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">pad_l</span><span class="o">*</span><span class="mi">2</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">win_w</span><span class="p">;</span>
<span class="linenos">24</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">output_w</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">dividor</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">stride_w</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="o">/</span><span class="w"> </span><span class="n">stride_w</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">25</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">dividor2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">in_h</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">pad_u</span><span class="o">*</span><span class="mi">2</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">win_h</span><span class="p">;</span>
<span class="linenos">26</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">output_h</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">dividor2</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">stride_h</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="o">/</span><span class="w"> </span><span class="n">stride_h</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">27</span>
<span class="linenos">28</span><span class="w"> </span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="w"> </span><span class="n">params</span><span class="p">[</span><span class="mi">17</span><span class="p">];</span>
<span class="linenos">29</span><span class="w"> </span><span class="n">params</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="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">input_ptr</span><span class="p">;</span>
<span class="linenos">30</span><span class="w"> </span><span class="n">params</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="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">dy_ptr</span><span class="p">;</span>
<span class="linenos">31</span><span class="w"> </span><span class="n">params</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="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">output_ptr</span><span class="p">;</span>
<span class="linenos">32</span><span class="w"> </span><span class="n">params</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="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">in_w</span><span class="p">;</span>
<span class="linenos">33</span><span class="w"> </span><span class="n">params</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="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">in_h</span><span class="p">;</span>
<span class="linenos">34</span><span class="w"> </span><span class="n">params</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="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">win_w</span><span class="p">;</span>
<span class="linenos">35</span><span class="w"> </span><span class="n">params</span><span class="p">[</span><span class="mi">6</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">win_h</span><span class="p">;</span>
<span class="linenos">36</span><span class="w"> </span><span class="n">params</span><span class="p">[</span><span class="mi">7</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">output_w</span><span class="p">;</span>
<span class="linenos">37</span><span class="w"> </span><span class="n">params</span><span class="p">[</span><span class="mi">8</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">output_h</span><span class="p">;</span>
<span class="linenos">38</span><span class="w"> </span><span class="n">params</span><span class="p">[</span><span class="mi">9</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">batch</span><span class="p">;</span>
<span class="linenos">39</span><span class="w"> </span><span class="n">params</span><span class="p">[</span><span class="mi">10</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">channel</span><span class="p">;</span>
<span class="linenos">40</span><span class="w"> </span><span class="n">params</span><span class="p">[</span><span class="mi">11</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">stride_w</span><span class="p">;</span>
<span class="linenos">41</span><span class="w"> </span><span class="n">params</span><span class="p">[</span><span class="mi">12</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">stride_h</span><span class="p">;</span>
<span class="linenos">42</span><span class="w"> </span><span class="n">params</span><span class="p">[</span><span class="mi">13</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">pad_l</span><span class="p">;</span>
<span class="linenos">43</span><span class="w"> </span><span class="n">params</span><span class="p">[</span><span class="mi">14</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="n">pad_u</span><span class="p">;</span>
<span class="linenos">44</span><span class="w"> </span><span class="n">params</span><span class="p">[</span><span class="mi">15</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="o">&amp;</span><span class="n">minf</span><span class="p">;</span><span class="w"> </span><span class="c1">//注意这里传指针，不能直接强制转换成long long</span>
<span class="linenos">45</span><span class="w"> </span><span class="n">params</span><span class="p">[</span><span class="mi">16</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">long</span><span class="w"> </span><span class="kt">long</span><span class="p">)</span><span class="o">&amp;</span><span class="n">maxf</span><span class="p">;</span>
<span class="hll"><span class="linenos">46</span><span class="w"> </span><span class="n">fp_maxpool_grad_p</span><span class="p">(</span><span class="n">params</span><span class="p">);</span>
</span><span class="linenos">47</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">48</span><span class="p">}</span>
</pre></div>
</div>
</dd></dl>
</section>
</div>
</div>
<footer><div class="rst-footer-buttons" role="navigation" aria-label="页脚">
<a href="maxpoolfusion.html" class="btn btn-neutral float-left" title="MaxPoolFusion" accesskey="p" rel="prev"><span class="fa fa-arrow-circle-left" aria-hidden="true"></span> 上一页</a>
<a href="onehot.html" class="btn btn-neutral float-right" title="OneHot" accesskey="n" rel="next">下一页 <span class="fa fa-arrow-circle-right" aria-hidden="true"></span></a>
</div>
<hr/>
<div role="contentinfo">
<p>&#169; 版权所有 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>
Reference in New Issue View Git Blame Copy Permalink