114 lines
9.2 KiB
HTML
114 lines
9.2 KiB
HTML
<!DOCTYPE html>
|
|
<html lang="zh" dir="ltr" class="client-nojs" xmlns="http://www.w3.org/1999/xhtml" xml:lang="zh">
|
|
<head><meta http-equiv="x-ua-compatible" content="ie=edge">
|
|
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
|
|
<title>std::basic_stacktrace<Allocator>::current</title>
|
|
<link rel="stylesheet" href="ext.css" />
|
|
<link rel="stylesheet" href="site_modules.css" />
|
|
</head>
|
|
<body class="mediawiki ltr sitedir-ltr ns-0 ns-subject page-cpp_utility_basic_stacktrace_current skin-cppreference2 action-view cpp-navbar">
|
|
<div id="cpp-content-base">
|
|
<div id="content"><a id="top"></a>
|
|
<h1 id="firstHeading" class="firstHeading"><span style="font-size:0.7em; line-height:130%">std::basic_stacktrace<Allocator>::</span>current</h1>
|
|
<div id="bodyContent">
|
|
<div id="contentSub"><span class="subpages">< <a href="cpp.html">cpp</a>‎ | <a href="cpp-utility.html">utility</a>‎ | <a href="cpp-utility-basic_stacktrace.html">basic stacktrace</a></span></div>
|
|
<div id="mw-content-text" lang="zh" dir="ltr" class="mw-content-ltr" xml:lang="zh">
|
|
<table class="t-dcl-begin">
|
|
<tbody>
|
|
<tr class="t-dcl t-since-cxx23">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw4">static</span> basic_stacktrace current<span class="br0">(</span> <span class="kw4">const</span> allocator_type<span class="sy3">&</span> alloc <span class="sy1">=</span><br />
|
|
allocator_type<span class="br0">(</span><span class="br0">)</span> <span class="br0">)</span> <span class="kw1">noexcept</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(1)</td>
|
|
<td><span class="t-mark-rev t-since-cxx23">(C++23 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx23">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw4">static</span> basic_stacktrace current<span class="br0">(</span> size_type skip, <span class="kw4">const</span> allocator_type<span class="sy3">&</span> alloc <span class="sy1">=</span><br />
|
|
allocator_type<span class="br0">(</span><span class="br0">)</span> <span class="br0">)</span> <span class="kw1">noexcept</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(2)</td>
|
|
<td><span class="t-mark-rev t-since-cxx23">(C++23 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx23">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw4">static</span> basic_stacktrace current<span class="br0">(</span> size_type skip, size_type max_depth,<br /></span>
|
|
<p> <span class="kw4">const</span> allocator_type<span class="sy3">&</span> alloc <span class="sy1">=</span><br /></p>
|
|
allocator_type<span class="br0">(</span><span class="br0">)</span> <span class="br0">)</span> <span class="kw1">noexcept</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(3)</td>
|
|
<td><span class="t-mark-rev t-since-cxx23">(C++23 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl-sep">
|
|
<td></td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<p>令 <span class="t-c"><span class="mw-geshi cpp source-cpp">s<span class="br0">[</span>i<span class="br0">]</span></span></span> (0 ≤ <code><i>i</i></code> < <code><i>n</i></code>) 代表当前执行线程中当前求值的第 <code><i>i</i>+1</code> 个栈踪条目，其中 <code><i>n</i></code> 为栈踪中的栈踪条目数。</p>
|
|
<div class="t-li1"><span class="t-li">1)</span> 试图创建由 <span class="t-c"><span class="mw-geshi cpp source-cpp">s<span class="br0">[</span><span class="nu0">0</span><span class="br0">]</span></span></span>、 <span class="t-c"><span class="mw-geshi cpp source-cpp">s<span class="br0">[</span><span class="nu0">1</span><span class="br0">]</span></span></span> …… <span class="t-c"><span class="mw-geshi cpp source-cpp">s<span class="br0">[</span>n <span class="sy2">-</span> <span class="nu0">1</span><span class="br0">]</span></span></span> 组成的 <code>basic_stacktrace</code> 。</div>
|
|
<div class="t-li1"><span class="t-li">2)</span> 试图创建由 <span class="t-c"><span class="mw-geshi cpp source-cpp">s<span class="br0">[</span>m<span class="br0">]</span></span></span>、 <span class="t-c"><span class="mw-geshi cpp source-cpp">s<span class="br0">[</span>m <span class="sy2">+</span> <span class="nu0">1</span><span class="br0">]</span></span></span> …… <span class="t-c"><span class="mw-geshi cpp source-cpp">s<span class="br0">[</span>n <span class="sy2">-</span> <span class="nu0">1</span><span class="br0">]</span></span></span> 组成的 <code>basic_stacktrace</code> ，其中 <code><i>m</i></code> 为 <code>min(skip, <i>n</i>)</code> 。</div>
|
|
<div class="t-li1"><span class="t-li">3)</span> 试图创建由 <span class="t-c"><span class="mw-geshi cpp source-cpp">s<span class="br0">[</span>m<span class="br0">]</span></span></span>、 <span class="t-c"><span class="mw-geshi cpp source-cpp">s<span class="br0">[</span>m <span class="sy2">+</span> <span class="nu0">1</span><span class="br0">]</span></span></span> …… <span class="t-c"><span class="mw-geshi cpp source-cpp">s<span class="br0">[</span>o <span class="sy2">-</span> <span class="nu0">1</span><span class="br0">]</span></span></span> 组成的 <code>basic_stacktrace</code> ，其中 <code><i>m</i></code> 为 <code>min(skip, <i>n</i>)</code> 而 <code><i>o</i></code> 为 <code>min(skip + max_depth, <i>n</i>)</code> 。若 <span class="t-c"><span class="mw-geshi cpp source-cpp">skip <span class="sy2">+</span> max_depth <span class="sy1"><</span> skip</span></span> （即 <span class="t-c"><span class="mw-geshi cpp source-cpp">skip <span class="sy2">+</span> max_depth</span></span> 的数学结果上溢）则行为未定义。</div>
|
|
<p>所有情况下，存储 <code>alloc</code> 到创建的 <code>basic_stacktrace</code> 中并用它分配栈踪条目的存储。</p>
|
|
<h3><span class="mw-headline" id=".E5.8F.82.E6.95.B0">参数</span></h3>
|
|
<table class="t-par-begin">
|
|
<tr class="t-par">
|
|
<td>alloc</td>
|
|
<td>-</td>
|
|
<td>用于构造的 <code>basic_stacktrace</code> 的所有内存分配的分配器</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>skip</td>
|
|
<td>-</td>
|
|
<td>要跳过的栈踪条目数</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>max_depth</td>
|
|
<td>-</td>
|
|
<td>栈踪条目的最大深度</td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E8.BF.94.E5.9B.9E.E5.80.BC">返回值</span></h3>
|
|
<p>若分配成功则为如上描述的 <code>basic_stacktrace</code> 。</p>
|
|
<p>否则为空的 <code>basic_stacktrace</code> 。</p>
|
|
<h3><span class="mw-headline" id=".E7.A4.BA.E4.BE.8B">示例</span></h3>
|
|
<table class="metadata plainlinks ambox mbox-small-left ambox-notice" style="">
|
|
<tr>
|
|
<td class="mbox-empty-cell"></td>
|
|
<td class="mbox-text" style="">本节未完成<br />
|
|
原因：暂无示例</td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E5.8F.82.E9.98.85">参阅</span></h3>
|
|
<table class="t-dsc-begin">
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div t-dsc-member-nobold-div">
|
|
<div><a href="cpp-utility-basic_stacktrace-basic_stacktrace.html"><span class="t-lines"><span>(构造函数)</span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx23">(C++23)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>创建新的 <code>basic_stacktrace</code><br />
|
|
<span class="t-mark">(公开成员函数)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-utility-source_location-current.html"><span class="t-lines"><span>current</span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-cmark">[静态]</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>构造对应调用点位置的新 <code>source_location</code><br />
|
|
<span class="t-mark">(<code>std::source_location</code> 的公开静态成员函数)</span></td>
|
|
</tr>
|
|
</table>
|
|
</div>
|
|
<div class="visualClear"></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|