|
|
<!DOCTYPE HTML>
|
|
|
<html lang="zh-CN" class="light sidebar-visible" dir="ltr">
|
|
|
<head>
|
|
|
<!-- Book generated using mdBook -->
|
|
|
<meta charset="UTF-8">
|
|
|
<title>使用多线程 - Rust语言圣经(Rust Course)</title>
|
|
|
|
|
|
|
|
|
<!-- Custom HTML head -->
|
|
|
|
|
|
<meta name="description" content="">
|
|
|
<meta name="viewport" content="width=device-width, initial-scale=1">
|
|
|
<meta name="theme-color" content="#ffffff">
|
|
|
|
|
|
<link rel="icon" href="../../favicon-de23e50b.svg">
|
|
|
<link rel="shortcut icon" href="../../favicon-8114d1fc.png">
|
|
|
<link rel="stylesheet" href="../../css/variables-8adf115d.css">
|
|
|
<link rel="stylesheet" href="../../css/general-2459343d.css">
|
|
|
<link rel="stylesheet" href="../../css/chrome-ae938929.css">
|
|
|
<link rel="stylesheet" href="../../css/print-9e4910d8.css" media="print">
|
|
|
|
|
|
<!-- Fonts -->
|
|
|
<link rel="stylesheet" href="../../fonts/fonts-9644e21d.css">
|
|
|
|
|
|
<!-- Highlight.js Stylesheets -->
|
|
|
<link rel="stylesheet" id="mdbook-highlight-css" href="../../highlight-493f70e1.css">
|
|
|
<link rel="stylesheet" id="mdbook-tomorrow-night-css" href="../../tomorrow-night-4c0ae647.css">
|
|
|
<link rel="stylesheet" id="mdbook-ayu-highlight-css" href="../../ayu-highlight-3fdfc3ac.css">
|
|
|
|
|
|
<!-- Custom theme stylesheets -->
|
|
|
<link rel="stylesheet" href="../../theme/style-78591068.css">
|
|
|
|
|
|
|
|
|
<!-- Provide site root and default themes to javascript -->
|
|
|
<script>
|
|
|
const path_to_root = "../../";
|
|
|
const default_light_theme = "light";
|
|
|
const default_dark_theme = "navy";
|
|
|
window.path_to_searchindex_js = "../../searchindex-4a1a74fa.js";
|
|
|
</script>
|
|
|
<!-- Start loading toc.js asap -->
|
|
|
<script src="../../toc-42887675.js"></script>
|
|
|
</head>
|
|
|
<body>
|
|
|
<div id="mdbook-help-container">
|
|
|
<div id="mdbook-help-popup">
|
|
|
<h2 class="mdbook-help-title">Keyboard shortcuts</h2>
|
|
|
<div>
|
|
|
<p>Press <kbd>←</kbd> or <kbd>→</kbd> to navigate between chapters</p>
|
|
|
<p>Press <kbd>S</kbd> or <kbd>/</kbd> to search in the book</p>
|
|
|
<p>Press <kbd>?</kbd> to show this help</p>
|
|
|
<p>Press <kbd>Esc</kbd> to hide this help</p>
|
|
|
</div>
|
|
|
</div>
|
|
|
</div>
|
|
|
<div id="mdbook-body-container">
|
|
|
<!-- Work around some values being stored in localStorage wrapped in quotes -->
|
|
|
<script>
|
|
|
try {
|
|
|
let theme = localStorage.getItem('mdbook-theme');
|
|
|
let sidebar = localStorage.getItem('mdbook-sidebar');
|
|
|
|
|
|
if (theme.startsWith('"') && theme.endsWith('"')) {
|
|
|
localStorage.setItem('mdbook-theme', theme.slice(1, theme.length - 1));
|
|
|
}
|
|
|
|
|
|
if (sidebar.startsWith('"') && sidebar.endsWith('"')) {
|
|
|
localStorage.setItem('mdbook-sidebar', sidebar.slice(1, sidebar.length - 1));
|
|
|
}
|
|
|
} catch (e) { }
|
|
|
</script>
|
|
|
|
|
|
<!-- Set the theme before any content is loaded, prevents flash -->
|
|
|
<script>
|
|
|
const default_theme = window.matchMedia("(prefers-color-scheme: dark)").matches ? default_dark_theme : default_light_theme;
|
|
|
let theme;
|
|
|
try { theme = localStorage.getItem('mdbook-theme'); } catch(e) { }
|
|
|
if (theme === null || theme === undefined) { theme = default_theme; }
|
|
|
const html = document.documentElement;
|
|
|
html.classList.remove('light')
|
|
|
html.classList.add(theme);
|
|
|
html.classList.add("js");
|
|
|
</script>
|
|
|
|
|
|
<input type="checkbox" id="mdbook-sidebar-toggle-anchor" class="hidden">
|
|
|
|
|
|
<!-- Hide / unhide sidebar before it is displayed -->
|
|
|
<script>
|
|
|
let sidebar = null;
|
|
|
const sidebar_toggle = document.getElementById("mdbook-sidebar-toggle-anchor");
|
|
|
if (document.body.clientWidth >= 1080) {
|
|
|
try { sidebar = localStorage.getItem('mdbook-sidebar'); } catch(e) { }
|
|
|
sidebar = sidebar || 'visible';
|
|
|
} else {
|
|
|
sidebar = 'hidden';
|
|
|
sidebar_toggle.checked = false;
|
|
|
}
|
|
|
if (sidebar === 'visible') {
|
|
|
sidebar_toggle.checked = true;
|
|
|
} else {
|
|
|
html.classList.remove('sidebar-visible');
|
|
|
}
|
|
|
</script>
|
|
|
|
|
|
<nav id="mdbook-sidebar" class="sidebar" aria-label="Table of contents">
|
|
|
<!-- populated by js -->
|
|
|
<mdbook-sidebar-scrollbox class="sidebar-scrollbox"></mdbook-sidebar-scrollbox>
|
|
|
<noscript>
|
|
|
<iframe class="sidebar-iframe-outer" src="../../toc.html"></iframe>
|
|
|
</noscript>
|
|
|
<div id="mdbook-sidebar-resize-handle" class="sidebar-resize-handle">
|
|
|
<div class="sidebar-resize-indicator"></div>
|
|
|
</div>
|
|
|
</nav>
|
|
|
|
|
|
<div id="mdbook-page-wrapper" class="page-wrapper">
|
|
|
|
|
|
<div class="page">
|
|
|
<div id="mdbook-menu-bar-hover-placeholder"></div>
|
|
|
<div id="mdbook-menu-bar" class="menu-bar sticky">
|
|
|
<div class="left-buttons">
|
|
|
<label id="mdbook-sidebar-toggle" class="icon-button" for="mdbook-sidebar-toggle-anchor" title="Toggle Table of Contents" aria-label="Toggle Table of Contents" aria-controls="mdbook-sidebar">
|
|
|
<span class=fa-svg><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M0 96C0 78.3 14.3 64 32 64H416c17.7 0 32 14.3 32 32s-14.3 32-32 32H32C14.3 128 0 113.7 0 96zM0 256c0-17.7 14.3-32 32-32H416c17.7 0 32 14.3 32 32s-14.3 32-32 32H32c-17.7 0-32-14.3-32-32zM448 416c0 17.7-14.3 32-32 32H32c-17.7 0-32-14.3-32-32s14.3-32 32-32H416c17.7 0 32 14.3 32 32z"/></svg></span>
|
|
|
</label>
|
|
|
<button id="mdbook-theme-toggle" class="icon-button" type="button" title="Change theme" aria-label="Change theme" aria-haspopup="true" aria-expanded="false" aria-controls="mdbook-theme-list">
|
|
|
<span class=fa-svg><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 576 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M371.3 367.1c27.3-3.9 51.9-19.4 67.2-42.9L600.2 74.1c12.6-19.5 9.4-45.3-7.6-61.2S549.7-4.4 531.1 9.6L294.4 187.2c-24 18-38.2 46.1-38.4 76.1L371.3 367.1zm-19.6 25.4l-116-104.4C175.9 290.3 128 339.6 128 400c0 3.9 .2 7.8 .6 11.6c1.8 17.5-10.2 36.4-27.8 36.4H96c-17.7 0-32 14.3-32 32s14.3 32 32 32H240c61.9 0 112-50.1 112-112c0-2.5-.1-5-.2-7.5z"/></svg></span>
|
|
|
</button>
|
|
|
<ul id="mdbook-theme-list" class="theme-popup" aria-label="Themes" role="menu">
|
|
|
<li role="none"><button role="menuitem" class="theme" id="mdbook-theme-default_theme">Auto</button></li>
|
|
|
<li role="none"><button role="menuitem" class="theme" id="mdbook-theme-light">Light</button></li>
|
|
|
<li role="none"><button role="menuitem" class="theme" id="mdbook-theme-rust">Rust</button></li>
|
|
|
<li role="none"><button role="menuitem" class="theme" id="mdbook-theme-coal">Coal</button></li>
|
|
|
<li role="none"><button role="menuitem" class="theme" id="mdbook-theme-navy">Navy</button></li>
|
|
|
<li role="none"><button role="menuitem" class="theme" id="mdbook-theme-ayu">Ayu</button></li>
|
|
|
</ul>
|
|
|
<button id="mdbook-search-toggle" class="icon-button" type="button" title="Search (`/`)" aria-label="Toggle Searchbar" aria-expanded="false" aria-keyshortcuts="/ s" aria-controls="mdbook-searchbar">
|
|
|
<span class=fa-svg><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M416 208c0 45.9-14.9 88.3-40 122.7L502.6 457.4c12.5 12.5 12.5 32.8 0 45.3s-32.8 12.5-45.3 0L330.7 376c-34.4 25.2-76.8 40-122.7 40C93.1 416 0 322.9 0 208S93.1 0 208 0S416 93.1 416 208zM208 352c79.5 0 144-64.5 144-144s-64.5-144-144-144S64 128.5 64 208s64.5 144 144 144z"/></svg></span>
|
|
|
</button>
|
|
|
</div>
|
|
|
|
|
|
<h1 class="menu-title">Rust语言圣经(Rust Course)</h1>
|
|
|
|
|
|
<div class="right-buttons">
|
|
|
<a href="../../print.html" title="Print this book" aria-label="Print this book">
|
|
|
<span class=fa-svg id="print-button"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M128 0C92.7 0 64 28.7 64 64v96h64V64H354.7L384 93.3V160h64V93.3c0-17-6.7-33.3-18.7-45.3L400 18.7C388 6.7 371.7 0 354.7 0H128zM384 352v32 64H128V384 368 352H384zm64 32h32c17.7 0 32-14.3 32-32V256c0-35.3-28.7-64-64-64H64c-35.3 0-64 28.7-64 64v96c0 17.7 14.3 32 32 32H64v64c0 35.3 28.7 64 64 64H384c35.3 0 64-28.7 64-64V384zm-16-88c-13.3 0-24-10.7-24-24s10.7-24 24-24s24 10.7 24 24s-10.7 24-24 24z"/></svg></span>
|
|
|
</a>
|
|
|
<a href="https://github.com/sunface/rust-course" title="Git repository" aria-label="Git repository">
|
|
|
<span class=fa-svg><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 496 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M165.9 397.4c0 2-2.3 3.6-5.2 3.6-3.3.3-5.6-1.3-5.6-3.6 0-2 2.3-3.6 5.2-3.6 3-.3 5.6 1.3 5.6 3.6zm-31.1-4.5c-.7 2 1.3 4.3 4.3 4.9 2.6 1 5.6 0 6.2-2s-1.3-4.3-4.3-5.2c-2.6-.7-5.5.3-6.2 2.3zm44.2-1.7c-2.9.7-4.9 2.6-4.6 4.9.3 2 2.9 3.3 5.9 2.6 2.9-.7 4.9-2.6 4.6-4.6-.3-1.9-3-3.2-5.9-2.9zM244.8 8C106.1 8 0 113.3 0 252c0 110.9 69.8 205.8 169.5 239.2 12.8 2.3 17.3-5.6 17.3-12.1 0-6.2-.3-40.4-.3-61.4 0 0-70 15-84.7-29.8 0 0-11.4-29.1-27.8-36.6 0 0-22.9-15.7 1.6-15.4 0 0 24.9 2 38.6 25.8 21.9 38.6 58.6 27.5 72.9 20.9 2.3-16 8.8-27.1 16-33.7-55.9-6.2-112.3-14.3-112.3-110.5 0-27.5 7.6-41.3 23.6-58.9-2.6-6.5-11.1-33.3 2.6-67.9 20.9-6.5 69 27 69 27 20-5.6 41.5-8.5 62.8-8.5s42.8 2.9 62.8 8.5c0 0 48.1-33.6 69-27 13.7 34.7 5.2 61.4 2.6 67.9 16 17.7 25.8 31.5 25.8 58.9 0 96.5-58.9 104.2-114.8 110.5 9.2 7.9 17 22.9 17 46.4 0 33.7-.3 75.4-.3 83.6 0 6.5 4.6 14.4 17.3 12.1C428.2 457.8 496 362.9 496 252 496 113.3 383.5 8 244.8 8zM97.2 352.9c-1.3 1-1 3.3.7 5.2 1.6 1.6 3.9 2.3 5.2 1 1.3-1 1-3.3-.7-5.2-1.6-1.6-3.9-2.3-5.2-1zm-10.8-8.1c-.7 1.3.3 2.9 2.3 3.9 1.6 1 3.6.7 4.3-.7.7-1.3-.3-2.9-2.3-3.9-2-.6-3.6-.3-4.3.7zm32.4 35.6c-1.6 1.3-1 4.3 1.3 6.2 2.3 2.3 5.2 2.6 6.5 1 1.3-1.3.7-4.3-1.3-6.2-2.2-2.3-5.2-2.6-6.5-1zm-11.4-14.7c-1.6 1-1.6 3.6 0 5.9 1.6 2.3 4.3 3.3 5.6 2.3 1.6-1.3 1.6-3.9 0-6.2-1.4-2.3-4-3.3-5.6-2z"/></svg></span>
|
|
|
</a>
|
|
|
<a href="https://github.com/sunface/rust-course/edit/main/src/advance/concurrency-with-threads/thread.md" title="Suggest an edit" aria-label="Suggest an edit" rel="edit">
|
|
|
<span class=fa-svg id="git-edit-button"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M421.7 220.3l-11.3 11.3-22.6 22.6-205 205c-6.6 6.6-14.8 11.5-23.8 14.1L30.8 511c-8.4 2.5-17.5 .2-23.7-6.1S-1.5 489.7 1 481.2L38.7 353.1c2.6-9 7.5-17.2 14.1-23.8l205-205 22.6-22.6 11.3-11.3 33.9 33.9 62.1 62.1 33.9 33.9zM96 353.9l-9.3 9.3c-.9 .9-1.6 2.1-2 3.4l-25.3 86 86-25.3c1.3-.4 2.5-1.1 3.4-2l9.3-9.3H112c-8.8 0-16-7.2-16-16V353.9zM453.3 19.3l39.4 39.4c25 25 25 65.5 0 90.5l-14.5 14.5-22.6 22.6-11.3 11.3-33.9-33.9-62.1-62.1L314.3 67.7l11.3-11.3 22.6-22.6 14.5-14.5c25-25 65.5-25 90.5 0z"/></svg></span>
|
|
|
</a>
|
|
|
|
|
|
</div>
|
|
|
</div>
|
|
|
|
|
|
<div id="mdbook-search-wrapper" class="hidden">
|
|
|
<form id="mdbook-searchbar-outer" class="searchbar-outer">
|
|
|
<div class="search-wrapper">
|
|
|
<input type="search" id="mdbook-searchbar" name="searchbar" placeholder="Search this book ..." aria-controls="mdbook-searchresults-outer" aria-describedby="searchresults-header">
|
|
|
<div class="spinner-wrapper">
|
|
|
<span class=fa-svg id="fa-spin"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M304 48c0-26.5-21.5-48-48-48s-48 21.5-48 48s21.5 48 48 48s48-21.5 48-48zm0 416c0-26.5-21.5-48-48-48s-48 21.5-48 48s21.5 48 48 48s48-21.5 48-48zM48 304c26.5 0 48-21.5 48-48s-21.5-48-48-48s-48 21.5-48 48s21.5 48 48 48zm464-48c0-26.5-21.5-48-48-48s-48 21.5-48 48s21.5 48 48 48s48-21.5 48-48zM142.9 437c18.7-18.7 18.7-49.1 0-67.9s-49.1-18.7-67.9 0s-18.7 49.1 0 67.9s49.1 18.7 67.9 0zm0-294.2c18.7-18.7 18.7-49.1 0-67.9S93.7 56.2 75 75s-18.7 49.1 0 67.9s49.1 18.7 67.9 0zM369.1 437c18.7 18.7 49.1 18.7 67.9 0s18.7-49.1 0-67.9s-49.1-18.7-67.9 0s-18.7 49.1 0 67.9z"/></svg></span>
|
|
|
</div>
|
|
|
</div>
|
|
|
</form>
|
|
|
<div id="mdbook-searchresults-outer" class="searchresults-outer hidden">
|
|
|
<div id="mdbook-searchresults-header" class="searchresults-header"></div>
|
|
|
<ul id="mdbook-searchresults">
|
|
|
</ul>
|
|
|
</div>
|
|
|
</div>
|
|
|
|
|
|
<!-- Apply ARIA attributes after the sidebar and the sidebar toggle button are added to the DOM -->
|
|
|
<script>
|
|
|
document.getElementById('mdbook-sidebar-toggle').setAttribute('aria-expanded', sidebar === 'visible');
|
|
|
document.getElementById('mdbook-sidebar').setAttribute('aria-hidden', sidebar !== 'visible');
|
|
|
Array.from(document.querySelectorAll('#mdbook-sidebar a')).forEach(function(link) {
|
|
|
link.setAttribute('tabIndex', sidebar === 'visible' ? 0 : -1);
|
|
|
});
|
|
|
</script>
|
|
|
|
|
|
<div id="mdbook-content" class="content">
|
|
|
<main>
|
|
|
<h1 id="使用线程"><a class="header" href="#使用线程">使用线程</a></h1>
|
|
|
<p>放在十年前，多线程编程可能还是一个少数人才掌握的核心概念，但是在今天，随着编程语言的不断发展，多线程、多协程、Actor 等并发编程方式已经深入人心，同时多线程编程的门槛也在不断降低，本章节我们来看看在 Rust 中该如何使用多线程。</p>
|
|
|
<h2 id="多线程编程的风险"><a class="header" href="#多线程编程的风险">多线程编程的风险</a></h2>
|
|
|
<p>由于多线程的代码是同时运行的，因此我们无法保证线程间的执行顺序，这会导致一些问题：</p>
|
|
|
<ul>
|
|
|
<li>竞态条件(race conditions)，多个线程以非一致性的顺序同时访问数据资源</li>
|
|
|
<li>死锁(deadlocks)，两个线程都想使用某个资源，但是又都在等待对方释放资源后才能使用，结果最终都无法继续执行</li>
|
|
|
<li>一些因为多线程导致的很隐晦的 BUG，难以复现和解决</li>
|
|
|
</ul>
|
|
|
<p>虽然 Rust 已经通过各种机制减少了上述情况的发生，但是依然无法完全避免上述情况，因此我们在编程时需要格外的小心，同时本书也会列出多线程编程时常见的陷阱，让你提前规避可能的风险。</p>
|
|
|
<h2 id="创建线程"><a class="header" href="#创建线程">创建线程</a></h2>
|
|
|
<p>使用 <code>thread::spawn</code> 可以创建线程：</p>
|
|
|
<pre class="playground"><code class="language-rust edition2021">use std::thread;
|
|
|
use std::time::Duration;
|
|
|
|
|
|
fn main() {
|
|
|
thread::spawn(|| {
|
|
|
for i in 1..10 {
|
|
|
println!("hi number {} from the spawned thread!", i);
|
|
|
thread::sleep(Duration::from_millis(1));
|
|
|
}
|
|
|
});
|
|
|
|
|
|
for i in 1..5 {
|
|
|
println!("hi number {} from the main thread!", i);
|
|
|
thread::sleep(Duration::from_millis(1));
|
|
|
}
|
|
|
}</code></pre>
|
|
|
<p>有几点值得注意：</p>
|
|
|
<ul>
|
|
|
<li>线程内部的代码使用闭包来执行</li>
|
|
|
<li><code>main</code> 线程一旦结束，程序就立刻结束，因此需要保持它的存活，直到其它子线程完成自己的任务</li>
|
|
|
<li><code>thread::sleep</code> 会让当前线程休眠指定的时间，随后其它线程会被调度运行（上一节并发与并行中有简单介绍过），因此就算你的电脑只有一个 CPU 核心，该程序也会表现的如同多 CPU 核心一般，这就是并发！</li>
|
|
|
</ul>
|
|
|
<p>来看看输出：</p>
|
|
|
<pre><code class="language-console">hi number 1 from the main thread!
|
|
|
hi number 1 from the spawned thread!
|
|
|
hi number 2 from the main thread!
|
|
|
hi number 2 from the spawned thread!
|
|
|
hi number 3 from the main thread!
|
|
|
hi number 3 from the spawned thread!
|
|
|
hi number 4 from the spawned thread!
|
|
|
hi number 4 from the main thread!
|
|
|
hi number 5 from the spawned thread!
|
|
|
</code></pre>
|
|
|
<p>如果多运行几次，你会发现好像每次输出会不太一样，因为：虽说线程往往是轮流执行的，但是这一点无法被保证！线程调度的方式往往取决于你使用的操作系统。总之，<strong>千万不要依赖线程的执行顺序</strong>。</p>
|
|
|
<h2 id="等待子线程的结束"><a class="header" href="#等待子线程的结束">等待子线程的结束</a></h2>
|
|
|
<p>上面的代码你不但可能无法让子线程从 1 顺序打印到 10，而且可能打印的数字会变少，因为主线程会提前结束，导致子线程也随之结束，更过分的是，如果当前系统繁忙，甚至该子线程还没被创建，主线程就已经结束了！</p>
|
|
|
<p>因此我们需要一个方法，让主线程安全、可靠地等所有子线程完成任务后，再 kill self：</p>
|
|
|
<pre class="playground"><code class="language-rust edition2021">use std::thread;
|
|
|
use std::time::Duration;
|
|
|
|
|
|
fn main() {
|
|
|
let handle = thread::spawn(|| {
|
|
|
for i in 1..5 {
|
|
|
println!("hi number {} from the spawned thread!", i);
|
|
|
thread::sleep(Duration::from_millis(1));
|
|
|
}
|
|
|
});
|
|
|
|
|
|
handle.join().unwrap();
|
|
|
|
|
|
for i in 1..5 {
|
|
|
println!("hi number {} from the main thread!", i);
|
|
|
thread::sleep(Duration::from_millis(1));
|
|
|
}
|
|
|
}</code></pre>
|
|
|
<p>通过调用 <code>handle.join</code>，可以让当前线程阻塞，直到它等待的子线程的结束，在上面代码中，由于 <code>main</code> 线程会被阻塞，因此它直到子线程结束后才会输出自己的 <code>1..5</code>：</p>
|
|
|
<pre><code class="language-console">hi number 1 from the spawned thread!
|
|
|
hi number 2 from the spawned thread!
|
|
|
hi number 3 from the spawned thread!
|
|
|
hi number 4 from the spawned thread!
|
|
|
hi number 1 from the main thread!
|
|
|
hi number 2 from the main thread!
|
|
|
hi number 3 from the main thread!
|
|
|
hi number 4 from the main thread!
|
|
|
</code></pre>
|
|
|
<p>以上输出清晰的展示了线程阻塞的作用，如果你将 <code>handle.join</code> 放置在 <code>main</code> 线程中的 <code>for</code> 循环后面，那就是另外一个结果：两个线程交替输出。</p>
|
|
|
<h2 id="在线程闭包中使用-move"><a class="header" href="#在线程闭包中使用-move">在线程闭包中使用 move</a></h2>
|
|
|
<p>在<a href="https://course.rs/advance/functional-programing/closure.html#move-和-fn">闭包</a>章节中，有讲过 <code>move</code> 关键字在闭包中的使用可以让该闭包拿走环境中某个值的所有权，同样地，你可以使用 <code>move</code> 来将所有权从一个线程转移到另外一个线程。</p>
|
|
|
<p>首先，来看看在一个线程中直接使用另一个线程中的数据会如何：</p>
|
|
|
<pre class="playground"><code class="language-rust edition2021">use std::thread;
|
|
|
|
|
|
fn main() {
|
|
|
let v = vec![1, 2, 3];
|
|
|
|
|
|
let handle = thread::spawn(|| {
|
|
|
println!("Here's a vector: {:?}", v);
|
|
|
});
|
|
|
|
|
|
handle.join().unwrap();
|
|
|
}</code></pre>
|
|
|
<p>以上代码在子线程的闭包中捕获了环境中的 <code>v</code> 变量，来看看结果：</p>
|
|
|
<pre><code class="language-console">error[E0373]: closure may outlive the current function, but it borrows `v`, which is owned by the current function
|
|
|
--> src/main.rs:6:32
|
|
|
|
|
|
|
6 | let handle = thread::spawn(|| {
|
|
|
| ^^ may outlive borrowed value `v`
|
|
|
7 | println!("Here's a vector: {:?}", v);
|
|
|
| - `v` is borrowed here
|
|
|
|
|
|
|
note: function requires argument type to outlive `'static`
|
|
|
--> src/main.rs:6:18
|
|
|
|
|
|
|
6 | let handle = thread::spawn(|| {
|
|
|
| __________________^
|
|
|
7 | | println!("Here's a vector: {:?}", v);
|
|
|
8 | | });
|
|
|
| |______^
|
|
|
help: to force the closure to take ownership of `v` (and any other referenced variables), use the `move` keyword
|
|
|
|
|
|
|
6 | let handle = thread::spawn(move || {
|
|
|
| ++++
|
|
|
</code></pre>
|
|
|
<p>其实代码本身并没有什么问题，问题在于 Rust 无法确定新的线程会活多久（多个线程的结束顺序并不是固定的），所以也无法确定新线程所引用的 <code>v</code> 是否在使用过程中一直合法：</p>
|
|
|
<pre class="playground"><code class="language-rust edition2021">use std::thread;
|
|
|
|
|
|
fn main() {
|
|
|
let v = vec![1, 2, 3];
|
|
|
|
|
|
let handle = thread::spawn(|| {
|
|
|
println!("Here's a vector: {:?}", v);
|
|
|
});
|
|
|
|
|
|
drop(v); // oh no!
|
|
|
|
|
|
handle.join().unwrap();
|
|
|
}</code></pre>
|
|
|
<p>大家要记住，线程的启动时间点和结束时间点是不确定的，因此存在一种可能，当主线程执行完， <code>v</code> 被释放掉时，新的线程很可能还没有结束甚至还没有被创建成功，此时新线程对 <code>v</code> 的引用立刻就不再合法！</p>
|
|
|
<p>好在报错里进行了提示：<code>to force the closure to take ownership of v (and any other referenced variables), use the `move` keyword</code>，让我们使用 <code>move</code> 关键字拿走 <code>v</code> 的所有权即可：</p>
|
|
|
<pre class="playground"><code class="language-rust edition2021">use std::thread;
|
|
|
|
|
|
fn main() {
|
|
|
let v = vec![1, 2, 3];
|
|
|
|
|
|
let handle = thread::spawn(move || {
|
|
|
println!("Here's a vector: {:?}", v);
|
|
|
});
|
|
|
|
|
|
handle.join().unwrap();
|
|
|
|
|
|
// 下面代码会报错borrow of moved value: `v`
|
|
|
// println!("{:?}",v);
|
|
|
}</code></pre>
|
|
|
<p>如上所示，很简单的代码，而且 Rust 的所有权机制保证了数据使用上的安全：<code>v</code> 的所有权被转移给新的线程后，<code>main</code> 线程将无法继续使用：最后一行代码将报错。</p>
|
|
|
<h2 id="线程是如何结束的"><a class="header" href="#线程是如何结束的">线程是如何结束的</a></h2>
|
|
|
<p>之前我们提到 <code>main</code> 线程是程序的主线程，一旦结束，则程序随之结束，同时各个子线程也将被强行终止。那么有一个问题，如果父线程不是 <code>main</code> 线程，那么父线程的结束会导致什么？自生自灭还是被干掉？</p>
|
|
|
<p>在系统编程中，操作系统提供了直接杀死线程的接口，简单粗暴，但是 Rust 并没有提供这样的接口，原因在于，粗暴地终止一个线程可能会导致资源没有释放、状态混乱等不可预期的结果，一向以安全自称的 Rust，自然不会砸自己的饭碗。</p>
|
|
|
<p>那么 Rust 中线程是如何结束的呢？答案很简单：线程的代码执行完，线程就会自动结束。但是如果线程中的代码不会执行完呢？那么情况可以分为两种进行讨论：</p>
|
|
|
<ul>
|
|
|
<li>线程的任务是一个循环 IO 读取，任务流程类似：IO 阻塞，等待读取新的数据 -> 读到数据，处理完成 -> 继续阻塞等待 ··· -> 收到 socket 关闭的信号 -> 结束线程，在此过程中，绝大部分时间线程都处于阻塞的状态，因此虽然看上去是循环，CPU 占用其实很小，也是网络服务中最最常见的模型</li>
|
|
|
<li>线程的任务是一个循环，里面没有任何阻塞，包括休眠这种操作也没有，此时 CPU 很不幸的会被跑满，而且你如果没有设置终止条件，该线程将持续跑满一个 CPU 核心，并且不会被终止，直到 <code>main</code> 线程的结束</li>
|
|
|
</ul>
|
|
|
<p>第一情况很常见，我们来模拟看看第二种情况：</p>
|
|
|
<pre class="playground"><code class="language-rust edition2021">use std::thread;
|
|
|
use std::time::Duration;
|
|
|
fn main() {
|
|
|
// 创建一个线程A
|
|
|
let new_thread = thread::spawn(move || {
|
|
|
// 再创建一个线程B
|
|
|
thread::spawn(move || {
|
|
|
loop {
|
|
|
println!("I am a new thread.");
|
|
|
}
|
|
|
})
|
|
|
});
|
|
|
|
|
|
// 等待新创建的线程执行完成
|
|
|
new_thread.join().unwrap();
|
|
|
println!("Child thread is finish!");
|
|
|
|
|
|
// 睡眠一段时间，看子线程创建的子线程是否还在运行
|
|
|
thread::sleep(Duration::from_millis(100));
|
|
|
}</code></pre>
|
|
|
<p>以上代码中，<code>main</code> 线程创建了一个新的线程 <code>A</code>，同时该新线程又创建了一个新的线程 <code>B</code>，可以看到 <code>A</code> 线程在创建完 <code>B</code> 线程后就立即结束了，而 <code>B</code> 线程则在不停地循环输出。</p>
|
|
|
<p>从之前的线程结束规则，我们可以猜测程序将这样执行：<code>A</code> 线程结束后，由它创建的 <code>B</code> 线程仍在疯狂输出，直到 <code>main</code> 线程在 100 毫秒后结束。如果你把该时间增加到几十秒，就可以看到你的 CPU 核心 100% 的盛况了-,-</p>
|
|
|
<h2 id="多线程的性能"><a class="header" href="#多线程的性能">多线程的性能</a></h2>
|
|
|
<p>下面我们从多个方面来看看多线程的性能大概是怎么样的。</p>
|
|
|
<h4 id="创建线程的性能"><a class="header" href="#创建线程的性能">创建线程的性能</a></h4>
|
|
|
<p>据不精确估算，创建一个线程大概需要 0.24 毫秒，随着线程的变多，这个值会变得更大，因此线程的创建耗时是不可忽略的，只有当真的需要处理一个值得用线程去处理的任务时，才使用线程，一些鸡毛蒜皮的任务，就无需创建线程了。</p>
|
|
|
<h4 id="创建多少线程合适"><a class="header" href="#创建多少线程合适">创建多少线程合适</a></h4>
|
|
|
<p>因为 CPU 的核心数限制，当任务是 CPU 密集型时，就算线程数超过了 CPU 核心数，也并不能帮你获得更好的性能，因为每个线程的任务都可以轻松让 CPU 的某个核心跑满，既然如此，让线程数等于 CPU 核心数是最好的。</p>
|
|
|
<p>但是当你的任务大部分时间都处于阻塞状态时，就可以考虑增多线程数量，这样当某个线程处于阻塞状态时，会被切走，进而运行其它的线程，典型就是网络 IO 操作，我们可以为每一个进来的用户连接创建一个线程去处理，该连接绝大部分时间都是处于 IO 读取阻塞状态，因此有限的 CPU 核心完全可以处理成百上千的用户连接线程，但是事实上，对于这种网络 IO 情况，一般都不再使用多线程的方式了，毕竟操作系统的线程数是有限的，意味着并发数也很容易达到上限，而且过多的线程也会导致线程上下文切换的代价过大，使用 <code>async/await</code> 的 <code>M:N</code> 并发模型，就没有这个烦恼。</p>
|
|
|
<h4 id="多线程的开销"><a class="header" href="#多线程的开销">多线程的开销</a></h4>
|
|
|
<p>下面的代码是一个无锁实现(CAS)的 <code>Hashmap</code> 在多线程下的使用：</p>
|
|
|
<pre class="playground"><code class="language-rust edition2021"><span class="boring">#![allow(unused)]
|
|
|
</span><span class="boring">fn main() {
|
|
|
</span>for i in 0..num_threads {
|
|
|
let ht = Arc::clone(&ht);
|
|
|
|
|
|
let handle = thread::spawn(move || {
|
|
|
for j in 0..adds_per_thread {
|
|
|
let key = thread_rng().gen::<u32>();
|
|
|
let value = thread_rng().gen::<u32>();
|
|
|
ht.set_item(key, value);
|
|
|
}
|
|
|
});
|
|
|
|
|
|
handles.push(handle);
|
|
|
}
|
|
|
|
|
|
for handle in handles {
|
|
|
handle.join().unwrap();
|
|
|
}
|
|
|
<span class="boring">}</span></code></pre>
|
|
|
<p>按理来说，既然是无锁实现了，那么锁的开销应该几乎没有，性能会随着线程数的增加接近线性增长，但是真的是这样吗？</p>
|
|
|
<p>下图是该代码在 <code>48</code> 核机器上的运行结果：</p>
|
|
|
<img alt="" src="https://pic3.zhimg.com/80/v2-af225672de09c0e377023f5f39dd87eb_1440w.png" class="center" />
|
|
|
<p>从图上可以明显的看出：吞吐并不是线性增长，尤其从 <code>16</code> 核开始，甚至开始肉眼可见的下降，这是为什么呢？</p>
|
|
|
<p>限于书本的篇幅有限，我们只能给出大概的原因：</p>
|
|
|
<ul>
|
|
|
<li>虽然是无锁，但是内部是 CAS 实现，大量线程的同时访问，会让 CAS 重试次数大幅增加</li>
|
|
|
<li>线程过多时，CPU 缓存的命中率会显著下降，同时多个线程竞争一个 CPU Cache-line 的情况也会经常发生</li>
|
|
|
<li>大量读写可能会让内存带宽也成为瓶颈</li>
|
|
|
<li>读和写不一样，无锁数据结构的读往往可以很好地线性增长，但是写不行，因为写竞争太大</li>
|
|
|
</ul>
|
|
|
<p>总之，多线程的开销往往是在锁、数据竞争、缓存失效上，这些限制了现代化软件系统随着 CPU 核心的增多性能也线性增加的野心。</p>
|
|
|
<h2 id="线程屏障barrier"><a class="header" href="#线程屏障barrier">线程屏障(Barrier)</a></h2>
|
|
|
<p>在 Rust 中，可以使用 <code>Barrier</code> 让多个线程都执行到某个点后，才继续一起往后执行：</p>
|
|
|
<pre class="playground"><code class="language-rust edition2021">use std::sync::{Arc, Barrier};
|
|
|
use std::thread;
|
|
|
|
|
|
fn main() {
|
|
|
let mut handles = Vec::with_capacity(6);
|
|
|
let barrier = Arc::new(Barrier::new(6));
|
|
|
|
|
|
for _ in 0..6 {
|
|
|
let b = barrier.clone();
|
|
|
handles.push(thread::spawn(move|| {
|
|
|
println!("before wait");
|
|
|
b.wait();
|
|
|
println!("after wait");
|
|
|
}));
|
|
|
}
|
|
|
|
|
|
for handle in handles {
|
|
|
handle.join().unwrap();
|
|
|
}
|
|
|
}</code></pre>
|
|
|
<p>上面代码，我们在线程打印出 <code>before wait</code> 后增加了一个屏障，目的就是等所有的线程都打印出<strong>before wait</strong>后，各个线程再继续执行：</p>
|
|
|
<pre><code class="language-console">before wait
|
|
|
before wait
|
|
|
before wait
|
|
|
before wait
|
|
|
before wait
|
|
|
before wait
|
|
|
after wait
|
|
|
after wait
|
|
|
after wait
|
|
|
after wait
|
|
|
after wait
|
|
|
after wait
|
|
|
</code></pre>
|
|
|
<h2 id="线程局部变量thread-local-variable"><a class="header" href="#线程局部变量thread-local-variable">线程局部变量(Thread Local Variable)</a></h2>
|
|
|
<p>对于多线程编程，线程局部变量在一些场景下非常有用，而 Rust 通过标准库和三方库对此进行了支持。</p>
|
|
|
<h4 id="标准库-thread_local"><a class="header" href="#标准库-thread_local">标准库 thread_local</a></h4>
|
|
|
<p>使用 <code>thread_local</code> 宏可以初始化线程局部变量，然后在线程内部使用该变量的 <code>with</code> 方法获取变量值：</p>
|
|
|
<pre class="playground"><code class="language-rust edition2021"><span class="boring">#![allow(unused)]
|
|
|
</span><span class="boring">fn main() {
|
|
|
</span>use std::cell::RefCell;
|
|
|
use std::thread;
|
|
|
|
|
|
thread_local!(static FOO: RefCell<u32> = RefCell::new(1));
|
|
|
|
|
|
FOO.with(|f| {
|
|
|
assert_eq!(*f.borrow(), 1);
|
|
|
*f.borrow_mut() = 2;
|
|
|
});
|
|
|
|
|
|
// 每个线程开始时都会拿到线程局部变量的FOO的初始值
|
|
|
let t = thread::spawn(move|| {
|
|
|
FOO.with(|f| {
|
|
|
assert_eq!(*f.borrow(), 1);
|
|
|
*f.borrow_mut() = 3;
|
|
|
});
|
|
|
});
|
|
|
|
|
|
// 等待线程完成
|
|
|
t.join().unwrap();
|
|
|
|
|
|
// 尽管子线程中修改为了3，我们在这里依然拥有main线程中的局部值：2
|
|
|
FOO.with(|f| {
|
|
|
assert_eq!(*f.borrow(), 2);
|
|
|
});
|
|
|
<span class="boring">}</span></code></pre>
|
|
|
<p>上面代码中，<code>FOO</code> 即是我们创建的<strong>线程局部变量</strong>，每个新的线程访问它时，都会使用它的初始值作为开始，各个线程中的 <code>FOO</code> 值彼此互不干扰。注意 <code>FOO</code> 使用 <code>static</code> 声明为生命周期为 <code>'static</code> 的静态变量。</p>
|
|
|
<p>可以注意到，线程中对 <code>FOO</code> 的使用是通过借用的方式，但是若我们需要每个线程独自获取它的拷贝，最后进行汇总，就有些强人所难了。</p>
|
|
|
<p>你还可以在结构体中使用线程局部变量：</p>
|
|
|
<pre class="playground"><code class="language-rust edition2021">use std::cell::RefCell;
|
|
|
|
|
|
struct Foo;
|
|
|
impl Foo {
|
|
|
thread_local! {
|
|
|
static FOO: RefCell<usize> = RefCell::new(0);
|
|
|
}
|
|
|
}
|
|
|
|
|
|
fn main() {
|
|
|
Foo::FOO.with(|x| println!("{:?}", x));
|
|
|
}</code></pre>
|
|
|
<p>或者通过引用的方式使用它:</p>
|
|
|
<pre class="playground"><code class="language-rust edition2021"><span class="boring">#![allow(unused)]
|
|
|
</span><span class="boring">fn main() {
|
|
|
</span>use std::cell::RefCell;
|
|
|
use std::thread::LocalKey;
|
|
|
|
|
|
thread_local! {
|
|
|
static FOO: RefCell<usize> = RefCell::new(0);
|
|
|
}
|
|
|
struct Bar {
|
|
|
foo: &'static LocalKey<RefCell<usize>>,
|
|
|
}
|
|
|
impl Bar {
|
|
|
fn constructor() -> Self {
|
|
|
Self {
|
|
|
foo: &FOO,
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
<span class="boring">}</span></code></pre>
|
|
|
<h4 id="三方库-thread-local"><a class="header" href="#三方库-thread-local">三方库 thread-local</a></h4>
|
|
|
<p>除了标准库外，一位大神还开发了 <a href="https://github.com/Amanieu/thread_local-rs">thread-local</a> 库，它允许每个线程持有值的独立拷贝：</p>
|
|
|
<pre class="playground"><code class="language-rust edition2021"><span class="boring">#![allow(unused)]
|
|
|
</span><span class="boring">fn main() {
|
|
|
</span>use thread_local::ThreadLocal;
|
|
|
use std::sync::Arc;
|
|
|
use std::cell::Cell;
|
|
|
use std::thread;
|
|
|
|
|
|
let tls = Arc::new(ThreadLocal::new());
|
|
|
let mut v = vec![];
|
|
|
// 创建多个线程
|
|
|
for _ in 0..5 {
|
|
|
let tls2 = tls.clone();
|
|
|
let handle = thread::spawn(move || {
|
|
|
// 将计数器加1
|
|
|
// 请注意，由于线程 ID 在线程退出时会被回收，因此一个线程有可能回收另一个线程的对象
|
|
|
// 这只能在线程退出后发生，因此不会导致任何竞争条件
|
|
|
let cell = tls2.get_or(|| Cell::new(0));
|
|
|
cell.set(cell.get() + 1);
|
|
|
});
|
|
|
v.push(handle);
|
|
|
}
|
|
|
for handle in v {
|
|
|
handle.join().unwrap();
|
|
|
}
|
|
|
// 一旦所有子线程结束，收集它们的线程局部变量中的计数器值，然后进行求和
|
|
|
let tls = Arc::try_unwrap(tls).unwrap();
|
|
|
let total = tls.into_iter().fold(0, |x, y| {
|
|
|
// 打印每个线程局部变量中的计数器值，发现不一定有5个线程，
|
|
|
// 因为一些线程已退出，并且其他线程会回收退出线程的对象
|
|
|
println!("x: {}, y: {}", x, y.get());
|
|
|
x + y.get()
|
|
|
});
|
|
|
|
|
|
// 和为5
|
|
|
assert_eq!(total, 5);
|
|
|
<span class="boring">}</span></code></pre>
|
|
|
<p>该库不仅仅使用了值的拷贝，而且还能自动把多个拷贝汇总到一个迭代器中，最后进行求和，非常好用。</p>
|
|
|
<h2 id="用条件控制线程的挂起和执行"><a class="header" href="#用条件控制线程的挂起和执行">用条件控制线程的挂起和执行</a></h2>
|
|
|
<p>条件变量(Condition Variables)经常和 <code>Mutex</code> 一起使用，可以让线程挂起，直到某个条件发生后再继续执行：</p>
|
|
|
<pre class="playground"><code class="language-rust edition2021">use std::thread;
|
|
|
use std::sync::{Arc, Mutex, Condvar};
|
|
|
|
|
|
fn main() {
|
|
|
let pair = Arc::new((Mutex::new(false), Condvar::new()));
|
|
|
let pair2 = pair.clone();
|
|
|
|
|
|
thread::spawn(move|| {
|
|
|
let (lock, cvar) = &*pair2;
|
|
|
let mut started = lock.lock().unwrap();
|
|
|
println!("changing started");
|
|
|
*started = true;
|
|
|
cvar.notify_one();
|
|
|
});
|
|
|
|
|
|
let (lock, cvar) = &*pair;
|
|
|
let mut started = lock.lock().unwrap();
|
|
|
while !*started {
|
|
|
started = cvar.wait(started).unwrap();
|
|
|
}
|
|
|
|
|
|
println!("started changed");
|
|
|
}</code></pre>
|
|
|
<p>上述代码流程如下：</p>
|
|
|
<ol>
|
|
|
<li><code>main</code> 线程首先进入 <code>while</code> 循环，调用 <code>wait</code> 方法挂起等待子线程的通知，并释放了锁 <code>started</code></li>
|
|
|
<li>子线程获取到锁，并将其修改为 <code>true</code>，然后调用条件变量的 <code>notify_one</code> 方法来通知主线程继续执行</li>
|
|
|
</ol>
|
|
|
<h2 id="只被调用一次的函数"><a class="header" href="#只被调用一次的函数">只被调用一次的函数</a></h2>
|
|
|
<p>有时，我们会需要某个函数在多线程环境下只被调用一次，例如初始化全局变量，无论是哪个线程先调用函数来初始化，都会保证全局变量只会被初始化一次，随后的其它线程调用就会忽略该函数：</p>
|
|
|
<pre class="playground"><code class="language-rust edition2021">use std::thread;
|
|
|
use std::sync::Once;
|
|
|
|
|
|
static mut VAL: usize = 0;
|
|
|
static INIT: Once = Once::new();
|
|
|
|
|
|
fn main() {
|
|
|
let handle1 = thread::spawn(move || {
|
|
|
INIT.call_once(|| {
|
|
|
unsafe {
|
|
|
VAL = 1;
|
|
|
}
|
|
|
});
|
|
|
});
|
|
|
|
|
|
let handle2 = thread::spawn(move || {
|
|
|
INIT.call_once(|| {
|
|
|
unsafe {
|
|
|
VAL = 2;
|
|
|
}
|
|
|
});
|
|
|
});
|
|
|
|
|
|
handle1.join().unwrap();
|
|
|
handle2.join().unwrap();
|
|
|
|
|
|
println!("{}", unsafe { VAL });
|
|
|
}</code></pre>
|
|
|
<p>代码运行的结果取决于哪个线程先调用 <code>INIT.call_once</code> （虽然代码具有先后顺序，但是线程的初始化顺序并无法被保证！因为线程初始化是异步的，且耗时较久），若 <code>handle1</code> 先，则输出 <code>1</code>，否则输出 <code>2</code>。</p>
|
|
|
<p><strong>call_once 方法</strong></p>
|
|
|
<p>执行初始化过程一次，并且只执行一次。</p>
|
|
|
<p>如果当前有另一个初始化过程正在运行，线程将阻止该方法被调用。</p>
|
|
|
<p>当这个函数返回时，保证一些初始化已经运行并完成，它还保证由执行的闭包所执行的任何内存写入都能被其他线程在这时可靠地观察到。</p>
|
|
|
<h2 id="总结"><a class="header" href="#总结">总结</a></h2>
|
|
|
<p><a href="https://course.rs/advance/concurrency-with-threads/intro.html">Rust 的线程模型</a>是 <code>1:1</code> 模型，因为 Rust 要保持尽量小的运行时。</p>
|
|
|
<p>我们可以使用 <code>thread::spawn</code> 来创建线程，创建出的多个线程之间并不存在执行顺序关系，因此代码逻辑千万不要依赖于线程间的执行顺序。</p>
|
|
|
<p><code>main</code> 线程若是结束，则所有子线程都将被终止，如果希望等待子线程结束后，再结束 <code>main</code> 线程，你需要使用创建线程时返回的句柄的 <code>join</code> 方法。</p>
|
|
|
<p>在线程中无法直接借用外部环境中的变量值，因为新线程的启动时间点和结束时间点是不确定的，所以 Rust 无法保证该线程中借用的变量在使用过程中依然是合法的。你可以使用 <code>move</code> 关键字将变量的所有权转移给新的线程，来解决此问题。</p>
|
|
|
<p>父线程结束后，子线程仍在持续运行，直到子线程的代码运行完成或者 <code>main</code> 线程的结束。</p>
|
|
|
|
|
|
</main>
|
|
|
|
|
|
<nav class="nav-wrapper" aria-label="Page navigation">
|
|
|
<!-- Mobile navigation buttons -->
|
|
|
<a rel="prev" href="../../advance/concurrency-with-threads/concurrency-parallelism.html" class="mobile-nav-chapters previous" title="Previous chapter" aria-label="Previous chapter" aria-keyshortcuts="Left">
|
|
|
<span class=fa-svg><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 320 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M41.4 233.4c-12.5 12.5-12.5 32.8 0 45.3l160 160c12.5 12.5 32.8 12.5 45.3 0s12.5-32.8 0-45.3L109.3 256 246.6 118.6c12.5-12.5 12.5-32.8 0-45.3s-32.8-12.5-45.3 0l-160 160z"/></svg></span>
|
|
|
</a>
|
|
|
|
|
|
<a rel="next prefetch" href="../../advance/concurrency-with-threads/message-passing.html" class="mobile-nav-chapters next" title="Next chapter" aria-label="Next chapter" aria-keyshortcuts="Right">
|
|
|
<span class=fa-svg><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 320 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M278.6 233.4c12.5 12.5 12.5 32.8 0 45.3l-160 160c-12.5 12.5-32.8 12.5-45.3 0s-12.5-32.8 0-45.3L210.7 256 73.4 118.6c-12.5-12.5-12.5-32.8 0-45.3s32.8-12.5 45.3 0l160 160z"/></svg></span>
|
|
|
</a>
|
|
|
|
|
|
<div style="clear: both"></div>
|
|
|
</nav>
|
|
|
</div>
|
|
|
</div>
|
|
|
|
|
|
<nav class="nav-wide-wrapper" aria-label="Page navigation">
|
|
|
<a rel="prev" href="../../advance/concurrency-with-threads/concurrency-parallelism.html" class="nav-chapters previous" title="Previous chapter" aria-label="Previous chapter" aria-keyshortcuts="Left">
|
|
|
<span class=fa-svg><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 320 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M41.4 233.4c-12.5 12.5-12.5 32.8 0 45.3l160 160c12.5 12.5 32.8 12.5 45.3 0s12.5-32.8 0-45.3L109.3 256 246.6 118.6c12.5-12.5 12.5-32.8 0-45.3s-32.8-12.5-45.3 0l-160 160z"/></svg></span>
|
|
|
</a>
|
|
|
|
|
|
<a rel="next prefetch" href="../../advance/concurrency-with-threads/message-passing.html" class="nav-chapters next" title="Next chapter" aria-label="Next chapter" aria-keyshortcuts="Right">
|
|
|
<span class=fa-svg><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 320 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M278.6 233.4c12.5 12.5 12.5 32.8 0 45.3l-160 160c-12.5 12.5-32.8 12.5-45.3 0s-12.5-32.8 0-45.3L210.7 256 73.4 118.6c-12.5-12.5-12.5-32.8 0-45.3s32.8-12.5 45.3 0l160 160z"/></svg></span>
|
|
|
</a>
|
|
|
</nav>
|
|
|
|
|
|
</div>
|
|
|
|
|
|
<template id=fa-eye><span class=fa-svg><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 576 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M288 32c-80.8 0-145.5 36.8-192.6 80.6C48.6 156 17.3 208 2.5 243.7c-3.3 7.9-3.3 16.7 0 24.6C17.3 304 48.6 356 95.4 399.4C142.5 443.2 207.2 480 288 480s145.5-36.8 192.6-80.6c46.8-43.5 78.1-95.4 93-131.1c3.3-7.9 3.3-16.7 0-24.6c-14.9-35.7-46.2-87.7-93-131.1C433.5 68.8 368.8 32 288 32zM432 256c0 79.5-64.5 144-144 144s-144-64.5-144-144s64.5-144 144-144s144 64.5 144 144zM288 192c0 35.3-28.7 64-64 64c-11.5 0-22.3-3-31.6-8.4c-.2 2.8-.4 5.5-.4 8.4c0 53 43 96 96 96s96-43 96-96s-43-96-96-96c-2.8 0-5.6 .1-8.4 .4c5.3 9.3 8.4 20.1 8.4 31.6z"/></svg></span></template>
|
|
|
<template id=fa-eye-slash><span class=fa-svg><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 640 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M38.8 5.1C28.4-3.1 13.3-1.2 5.1 9.2S-1.2 34.7 9.2 42.9l592 464c10.4 8.2 25.5 6.3 33.7-4.1s6.3-25.5-4.1-33.7L525.6 386.7c39.6-40.6 66.4-86.1 79.9-118.4c3.3-7.9 3.3-16.7 0-24.6c-14.9-35.7-46.2-87.7-93-131.1C465.5 68.8 400.8 32 320 32c-68.2 0-125 26.3-169.3 60.8L38.8 5.1zM223.1 149.5C248.6 126.2 282.7 112 320 112c79.5 0 144 64.5 144 144c0 24.9-6.3 48.3-17.4 68.7L408 294.5c5.2-11.8 8-24.8 8-38.5c0-53-43-96-96-96c-2.8 0-5.6 .1-8.4 .4c5.3 9.3 8.4 20.1 8.4 31.6c0 10.2-2.4 19.8-6.6 28.3l-90.3-70.8zm223.1 298L373 389.9c-16.4 6.5-34.3 10.1-53 10.1c-79.5 0-144-64.5-144-144c0-6.9 .5-13.6 1.4-20.2L83.1 161.5C60.3 191.2 44 220.8 34.5 243.7c-3.3 7.9-3.3 16.7 0 24.6c14.9 35.7 46.2 87.7 93 131.1C174.5 443.2 239.2 480 320 480c47.8 0 89.9-12.9 126.2-32.5z"/></svg></span></template>
|
|
|
<template id=fa-copy><span class=fa-svg><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M502.6 70.63l-61.25-61.25C435.4 3.371 427.2 0 418.7 0H255.1c-35.35 0-64 28.66-64 64l.0195 256C192 355.4 220.7 384 256 384h192c35.2 0 64-28.8 64-64V93.25C512 84.77 508.6 76.63 502.6 70.63zM464 320c0 8.836-7.164 16-16 16H255.1c-8.838 0-16-7.164-16-16L239.1 64.13c0-8.836 7.164-16 16-16h128L384 96c0 17.67 14.33 32 32 32h47.1V320zM272 448c0 8.836-7.164 16-16 16H63.1c-8.838 0-16-7.164-16-16L47.98 192.1c0-8.836 7.164-16 16-16H160V128H63.99c-35.35 0-64 28.65-64 64l.0098 256C.002 483.3 28.66 512 64 512h192c35.2 0 64-28.8 64-64v-32h-47.1L272 448z"/></svg></span></template>
|
|
|
<template id=fa-play><span class=fa-svg><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 384 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M73 39c-14.8-9.1-33.4-9.4-48.5-.9S0 62.6 0 80V432c0 17.4 9.4 33.4 24.5 41.9s33.7 8.1 48.5-.9L361 297c14.3-8.7 23-24.2 23-41s-8.7-32.2-23-41L73 39z"/></svg></span></template>
|
|
|
<template id=fa-clock-rotate-left><span class=fa-svg><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><!--! Font Awesome Free 6.2.0 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2022 Fonticons, Inc. --><path d="M75 75L41 41C25.9 25.9 0 36.6 0 57.9V168c0 13.3 10.7 24 24 24H134.1c21.4 0 32.1-25.9 17-41l-30.8-30.8C155 85.5 203 64 256 64c106 0 192 86 192 192s-86 192-192 192c-40.8 0-78.6-12.7-109.7-34.4c-14.5-10.1-34.4-6.6-44.6 7.9s-6.6 34.4 7.9 44.6C151.2 495 201.7 512 256 512c141.4 0 256-114.6 256-256S397.4 0 256 0C185.3 0 121.3 28.7 75 75zm181 53c-13.3 0-24 10.7-24 24V256c0 6.4 2.5 12.5 7 17l72 72c9.4 9.4 24.6 9.4 33.9 0s9.4-24.6 0-33.9l-65-65V152c0-13.3-10.7-24-24-24z"/></svg></span></template>
|
|
|
|
|
|
|
|
|
|
|
|
<script>
|
|
|
window.playground_copyable = true;
|
|
|
</script>
|
|
|
|
|
|
<script src="../../ace-2a3cd908.js"></script>
|
|
|
<script src="../../mode-rust-2c9d5c9a.js"></script>
|
|
|
<script src="../../editor-16ca416c.js"></script>
|
|
|
<script src="../../theme-dawn-4493f9c8.js"></script>
|
|
|
<script src="../../theme-tomorrow_night-9dbe62a9.js"></script>
|
|
|
|
|
|
<script src="../../elasticlunr-ef4e11c1.min.js"></script>
|
|
|
<script src="../../mark-09e88c2c.min.js"></script>
|
|
|
<script src="../../searcher-c2a407aa.js"></script>
|
|
|
|
|
|
<script src="../../clipboard-1626706a.min.js"></script>
|
|
|
<script src="../../highlight-abc7f01d.js"></script>
|
|
|
<script src="../../book-a0b12cfe.js"></script>
|
|
|
|
|
|
<!-- Custom JS scripts -->
|
|
|
<script src="../../assets/custom-7d8ae1df.js"></script>
|
|
|
<script src="../../assets/bigPicture-be03f9c8.js"></script>
|
|
|
|
|
|
|
|
|
|
|
|
</div>
|
|
|
</body>
|
|
|
</html>
|
