You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 

1 lines
75 KiB

<!doctypehtml><html lang=zh-CN><meta charset=UTF-8><meta content=width=device-width name=viewport><meta media="(prefers-color-scheme: light)" content=#222 name=theme-color><meta media="(prefers-color-scheme: dark)" content=#222 name=theme-color><meta content="Hexo 7.1.0" name=generator><link href=https://cdnjs.cloudflare.com rel=preconnect><link href=/images/apple-touch-icon-next.png rel=apple-touch-icon sizes=180x180><link href=/images/favicon-32x32-next.png rel=icon sizes=32x32 type=image/png><link href=/images/favicon-16x16-next.png rel=icon sizes=16x16 type=image/png><link color=#222 href=/images/logo.svg rel=mask-icon><meta content=2X6S9P7CAjXjVvw8YyQR8pCu-B0oEu7O9quLgxXuWyA name=google-site-verification><meta content=dV8JGNzi0c name=baidu-site-verification><script>!function(){var t=!1;function e(){var e;t||(t=!0,(e=document.createElement("script")).setAttribute("data-ad-client","ca-pub-7480618470784058"),e.async=!0,e.src="https://pagead2.googlesyndication.com/pagead/js/adsbygoogle.js",document.head.appendChild(e))}function a(){"requestIdleCallback"in window?window.requestIdleCallback(e,{timeout:5e3}):window.setTimeout(e,5e3)}"complete"===document.readyState?a():window.addEventListener("load",a,{once:!0})}()</script><link href=/css/main.css rel=stylesheet><link crossorigin=anonymous href=https://cdnjs.cloudflare.com/ajax/libs/font-awesome/7.0.0/css/all.min.css integrity=sha256-VHqXKFhhMxcpubYf9xiWdCiojEbY9NexQ4jh8AxbvcM= rel=stylesheet><link crossorigin=anonymous href=https://cdnjs.cloudflare.com/ajax/libs/fancyapps-ui/6.1.14/fancybox/fancybox.css integrity=sha256-mdaMxrItEW6hMIVJJNPKuX0B7KCSJQVEv3mVY4N2we4= rel=stylesheet><script class=next-config data-name=main type=application/json>{"hostname":"nicksxs.me","root":"/","images":"/images","scheme":"Pisces","darkmode":true,"version":"8.29.0","exturl":false,"sidebar":{"position":"left","width_expanded":320,"width_dual_column":240,"display":"post","padding":18,"offset":12},"hljswrap":true,"codeblock":{"theme":{"light":"default","dark":"stackoverflow-dark"},"prism":{"light":"prism","dark":"prism-dark"},"copy_button":{"enable":true,"style":"default"},"fold":{"enable":false,"height":500},"language":false},"bookmark":{"enable":false,"color":"#222","save":"auto"},"mediumzoom":false,"pangu":false,"comments":{"style":"tabs","active":null,"storage":true,"lazyload":true,"nav":null},"stickytabs":false,"motion":{"enable":false,"async":false,"duration":200,"transition":{"menu_item":"fadeInDown","post_block":"fadeIn","post_header":"fadeInDown","post_body":"fadeInDown","coll_header":"fadeInLeft","sidebar":"fadeInUp"}},"prism":false,"i18n":{"placeholder":"搜索...","empty":"没有找到任何搜索结果:${query}","hits_time":"找到 ${hits} 个搜索结果(用时 ${time} 毫秒)","hits":"找到 ${hits} 个搜索结果"},"algolia":{"appID":"663Q99OQQD","apiKey":"e461a1371d12cec1491c1153b288a9ed","indexName":"nicksxs","hits":{"per_page":10}}}</script><script defer src=/js/config.js></script><meta content="这一篇不再是数据结构介绍了,大致的数据结构基本都介绍了,这一篇主要是查漏补缺,或者说讲一些重要且基本的概念,也可能是经常被忽略的,很多讲 redis 的系列文章可能都会忽略,学习 redis 的时候也会,因为觉得源码学习就是讲主要的数据结构和“算法”学习了就好了。" name=description><meta content=article property=og:type><meta content=redis系列介绍七-过期策略 property=og:title><meta content=https://nicksxs.me/2020/04/12/redis%E7%B3%BB%E5%88%97%E4%BB%8B%E7%BB%8D%E4%B8%83/index.html property=og:url><meta content="Nicksxs's Blog" property=og:site_name><meta content="这一篇不再是数据结构介绍了,大致的数据结构基本都介绍了,这一篇主要是查漏补缺,或者说讲一些重要且基本的概念,也可能是经常被忽略的,很多讲 redis 的系列文章可能都会忽略,学习 redis 的时候也会,因为觉得源码学习就是讲主要的数据结构和“算法”学习了就好了。" property=og:description><meta content=zh_CN property=og:locale><meta content=2020-04-12T13:22:00.000Z property=article:published_time><meta content=2020-04-12T13:22:00.000Z property=article:modified_time><meta content=Nicksxs property=article:author><meta content=Redis property=article:tag><meta content=数据结构 property=article:tag><meta content=源码 property=article:tag><meta content=summary name=twitter:card><link href=https://nicksxs.me/2020/04/12/redis%E7%B3%BB%E5%88%97%E4%BB%8B%E7%BB%8D%E4%B8%83/ rel=canonical><script class=next-config data-name=page type=application/json>{"sidebar":"","isHome":false,"isPost":true,"lang":"zh-CN","comments":true,"permalink":"https://nicksxs.me/2020/04/12/redis%E7%B3%BB%E5%88%97%E4%BB%8B%E7%BB%8D%E4%B8%83/","path":"2020/04/12/redis系列介绍七/","title":"redis系列介绍七-过期策略"}</script><script class=next-config data-name=calendar type=application/json>""</script><title>redis系列介绍七-过期策略 | Nicksxs's Blog</title><script async src=https://www.googletagmanager.com/gtag/js?id=UA-61358619-1></script><script class=next-config data-name=google_analytics type=application/json>{"tracking_id":"UA-61358619-1","only_pageview":false,"measure_protocol_api_secret":null}</script><script defer src=/js/third-party/analytics/google-analytics.js></script><script defer src=/js/third-party/analytics/baidu-analytics.js></script><script async src=https://hm.baidu.com/hm.js?20f33b3c0c0eff9b1522999c0015646d></script><script crossorigin=anonymous defer integrity=sha256-QnJV4HT5r8i89ovZGRD86iynZqHerEbT2xt69vDM36I= src=https://cdnjs.cloudflare.com/ajax/libs/fancyapps-ui/6.1.14/fancybox/fancybox.umd.js></script><script defer src=/js/utils.js></script><script defer src=/js/sidebar.js></script><script defer src=/js/next-boot.js></script><script data-algolia-integrity=sha256-o49zoHLDPBm9WLg6AiliAVi3axCRTqe3ltTxLvhzAVg= data-algolia-src=https://cdnjs.cloudflare.com/ajax/libs/algoliasearch/5.36.0/lite/builds/browser.umd.js data-search-src=/js/third-party/search/algolia-search.js src=/js/third-party/search/algolia-search-loader.js></script><script defer src=/js/third-party/fancybox.js></script><noscript><link href=/css/noscript.css rel=stylesheet></noscript><link title="Nicksxs's Blog" href=/atom.xml rel=alternate type=application/atom+xml><body itemscope itemtype=http://schema.org/WebPage><div class=headband></div><main class=main><div class=column><header class=header itemscope itemtype=http://schema.org/WPHeader><div class=site-brand-container><div class=site-nav-toggle><div aria-label=切换导航栏 class=toggle role=button><span class=toggle-line></span><span class=toggle-line></span><span class=toggle-line></span></div></div><div class=site-meta><a class=brand href=/ rel=start><i class=logo-line></i><p class=site-title>Nicksxs's Blog</p><i class=logo-line></i></a><p class=site-subtitle itemprop=description>Java 运行时、生产诊断与 AI 工程实践</div><div class=site-nav-right><div class="toggle popup-trigger" aria-label=搜索 role=button><i class="fa fa-search fa-fw fa-lg"></i></div></div></div><nav class=site-nav><ul class="main-menu menu"><li class="menu-item menu-item-home"><a href=/ rel=section><i class="fa fa-home fa-fw"></i>首页</a><li class="menu-item menu-item-专题"><a href=/topics/ rel=section><i class="fa fa-layer-group fa-fw"></i>专题</a><li class="menu-item menu-item-工具"><a href=/tools/ rel=section><i class="fa fa-toolbox fa-fw"></i>工具</a><li class="menu-item menu-item-about"><a href=/about/ rel=section><i class="fa fa-user fa-fw"></i>关于我</a><li class="menu-item menu-item-tags"><a href=/tags/ rel=section><i class="fa fa-tags fa-fw"></i>标签</a><li class="menu-item menu-item-categories"><a href=/categories/ rel=section><i class="fa fa-th fa-fw"></i>分类</a><li class="menu-item menu-item-archives"><a href=/archives/ rel=section><i class="fa fa-archive fa-fw"></i>归档</a><li class="menu-item menu-item-search"><a class=popup-trigger role=button><i class="fa fa-search fa-fw"></i>搜索</a></ul></nav><div class=search-pop-overlay><div class="popup search-popup"><div class=search-header><span class=search-icon><i class="fa fa-search"></i></span><div class=search-input-container><input autocapitalize=off autocomplete=off class=search-input maxlength=80 placeholder=搜索... spellcheck=false type=search></div><span class=popup-btn-close role=button><i class="fa fa-times-circle"></i></span></div><div class=search-result-container><div class=search-result-icon><i class="fab fa-algolia fa-5x"></i></div></div></div></div></header><aside class=sidebar><div class="sidebar-inner sidebar-nav-active sidebar-toc-active"><ul class=sidebar-nav><li class=sidebar-nav-toc>文章目录<li class=sidebar-nav-overview>站点概览</ul><div class=sidebar-panel-container><div class="post-toc-wrap sidebar-panel"><div class="post-toc animated"><ol class=nav><li class="nav-item nav-level-2"><a class=nav-link href=#redis%E8%BF%87%E6%9C%9F%E7%AD%96%E7%95%A5><span class=nav-number>1.</span> <span class=nav-text>redis过期策略</span></a></ol></div></div><div class="site-overview-wrap sidebar-panel"><div class="site-author animated" itemprop=author itemscope itemtype=http://schema.org/Person><img alt=Nicksxs class=site-author-image itemprop=image src=/uploads/avatar.jpg><p class=site-author-name itemprop=name>Nicksxs<div class=site-description itemprop=description>Nicksxs 的技术博客,深入 Java 运行时与生产诊断、低成本大模型推理和 Agent 工程实践。</div></div><div class="site-state-wrap animated"><nav class=site-state><div class="site-state-item site-state-posts"><a href=/archives/><span class=site-state-item-count>391</span> <span class=site-state-item-name>日志</span></a></div><div class="site-state-item site-state-categories"><a href=/categories/><span class=site-state-item-count>179</span> <span class=site-state-item-name>分类</span></a></div><div class="site-state-item site-state-tags"><a href=/tags/><span class=site-state-item-count>333</span> <span class=site-state-item-name>标签</span></a></div></nav></div><div class="links-of-author animated"><span class=links-of-author-item><a rel="noopener me" title="GitHub → https://github.com/nicksxs" href=https://github.com/nicksxs target=_blank><i class="fab fa-github fa-fw"></i>GitHub</a> </span><span class=links-of-author-item><a rel="noopener me" title="E-Mail → mailto:nicksxs1202@gmail.com" href=mailto:nicksxs1202@gmail.com target=_blank><i class="fa fa-envelope fa-fw"></i>E-Mail</a></span></div><div class="cc-license animated" itemprop=license><a class=cc-opacity href=https://creativecommons.org/licenses/by-nc-sa/4.0/ rel=noopener target=_blank><img alt="Creative Commons" src=https://cdnjs.cloudflare.com/ajax/libs/creativecommons-vocabulary/2020.11.3/assets/license_badges/small/by_nc_sa.svg></a></div><div class="widget-wrap sidebar-tag-cloud"><div class=tag-cloud-tags><a class=tag-cloud-10 href=/tags/Java/ style=font-size:16px>Java</a><a class=tag-cloud-9 href=/tags/leetcode/ style=font-size:15.64px>leetcode</a><a class=tag-cloud-9 href=/tags/%E7%94%9F%E6%B4%BB/ style=font-size:15.29px>生活</a><a class=tag-cloud-8 href=/tags/LLM/ style=font-size:14.93px>LLM</a><a class=tag-cloud-7 href=/tags/%E9%A2%98%E8%A7%A3/ style=font-size:14.57px>题解</a><a class=tag-cloud-6 href=/tags/SpringBoot/ style=font-size:14.21px>SpringBoot</a><a class=tag-cloud-6 href=/tags/MySQL/ style=font-size:14.21px>MySQL</a><a class=tag-cloud-6 href=/tags/C/ style=font-size:13.86px>C++</a><a class=tag-cloud-5 href=/tags/Redis/ style=font-size:13.5px>Redis</a><a class=tag-cloud-4 href=/tags/Tomcat/ style=font-size:13.14px>Tomcat</a><a class=tag-cloud-4 href=/tags/Mybatis/ style=font-size:13.14px>Mybatis</a><a class=tag-cloud-4 href=/tags/%E5%B0%8F%E6%8A%80%E5%B7%A7/ style=font-size:12.79px>小技巧</a><a class=tag-cloud-3 href=/tags/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/ style=font-size:12.43px>数据结构</a><a class=tag-cloud-3 href=/tags/%E6%BA%90%E7%A0%81/ style=font-size:12.43px>源码</a><a class=tag-cloud-2 href=/tags/MQ/ style=font-size:12.07px>MQ</a><a class=tag-cloud-2 href=/tags/%E6%B6%88%E6%81%AF%E9%98%9F%E5%88%97/ style=font-size:12.07px>消息队列</a><a class=tag-cloud-2 href=/tags/RocketMQ/ style=font-size:12.07px>RocketMQ</a><a class=tag-cloud-2 href=/tags/%E8%BF%90%E5%8A%A8/ style=font-size:12.07px>运动</a><a class=tag-cloud-1 href=/tags/php/ style=font-size:11.71px>php</a><a class=tag-cloud-1 href=/tags/Spring/ style=font-size:11.36px>Spring</a><a class=tag-cloud-1 href=/tags/linux/ style=font-size:11.36px>linux</a><a class=tag-cloud-1 href=/tags/%E5%87%8F%E8%82%A5/ style=font-size:11.36px>减肥</a><a class=tag-cloud-1 href=/tags/%E8%B7%91%E6%AD%A5/ style=font-size:11.36px>跑步</a><a class=tag-cloud-0 href=/tags/Dubbo/ style=font-size:11px>Dubbo</a></div></div><div class="affiliate-creative affiliate-creative--sidebar" data-affiliate-id=tencent-cloud-general><a rel="sponsored noopener" aria-label=腾讯云产品优惠 href=https://cloud.tencent.com/act/cps/redirect?redirect=2446&cps_key=2e33a1eedb380997d03618b4a5ba6ca7&from=console target=_blank><img alt=腾讯云服务器、数据库和云产品优惠 decoding=async height=419 loading=lazy src=/uploads/affiliate/tencent-cloud-general.webp width=690> </a><span class=affiliate-disclosure>推广</span></div></div></div></div><div class="sidebar-inner sidebar-blogroll"><div class="links-of-blogroll animated"><div class=links-of-blogroll-title><i class="fa fa-globe fa-fw"></i> 链接</div><ul class=links-of-blogroll-list><li class=links-of-blogroll-item><a href=https://covermusic.cn/ rel=noopener target=_blank title=https://covermusic.cn>69伙伴</a></ul></div></div></aside></div><div class="main-inner post posts-expand"><div class=post-block><article class=post-content itemscope itemtype=http://schema.org/Article lang=zh-CN><link href=https://nicksxs.me/2020/04/12/redis%E7%B3%BB%E5%88%97%E4%BB%8B%E7%BB%8D%E4%B8%83/ itemprop=mainEntityOfPage><span hidden itemprop=author itemscope itemtype=http://schema.org/Person><meta content=/uploads/avatar.jpg itemprop=image><meta content=Nicksxs itemprop=name></span><span hidden itemprop=publisher itemscope itemtype=http://schema.org/Organization><meta content="Nicksxs's Blog" itemprop=name><meta content="Nicksxs 的技术博客,深入 Java 运行时与生产诊断、低成本大模型推理和 Agent 工程实践。" itemprop=description></span><span hidden itemprop=post itemscope itemtype=http://schema.org/CreativeWork><meta content="redis系列介绍七-过期策略 | Nicksxs's Blog" itemprop=name><meta content="这一篇不再是数据结构介绍了,大致的数据结构基本都介绍了,这一篇主要是查漏补缺,或者说讲一些重要且基本的概念,也可能是经常被忽略的,很多讲 redis 的系列文章可能都会忽略,学习 redis 的时候也会,因为觉得源码学习就是讲主要的数据结构和“算法”学习了就好了。" itemprop=description></span><header class=post-header><h1 itemprop="name headline" class=post-title>redis系列介绍七-过期策略</h1><div class=post-meta-container><div class=post-meta><span class=post-meta-item><span class=post-meta-item-icon><i class="far fa-calendar"></i> </span><span class=post-meta-item-text>发表于</span> <time itemprop="dateCreated datePublished" title="创建时间:2020-04-12 21:22:00" datetime=2020-04-12T21:22:00+08:00>2020-04-12</time> </span><span class=post-meta-item><span class=post-meta-item-icon><i class="far fa-folder"></i> </span><span class=post-meta-item-text>分类于</span> <span itemprop=about itemscope itemtype=http://schema.org/Thing><a href=/categories/Redis/ itemprop=url rel=index><span itemprop=name>Redis</span></a> </span>, <span itemprop=about itemscope itemtype=http://schema.org/Thing><a href=/categories/Redis/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/ itemprop=url rel=index><span itemprop=name>数据结构</span></a> </span>, <span itemprop=about itemscope itemtype=http://schema.org/Thing><a href=/categories/C/ itemprop=url rel=index><span itemprop=name>C</span></a> </span>, <span itemprop=about itemscope itemtype=http://schema.org/Thing><a href=/categories/Redis/%E6%BA%90%E7%A0%81/ itemprop=url rel=index><span itemprop=name>源码</span></a> </span>, <span itemprop=about itemscope itemtype=http://schema.org/Thing><a href=/categories/C/Redis/ itemprop=url rel=index><span itemprop=name>Redis</span></a> </span></span><span class="post-meta-item cloudflare-page-counter" data-increment=true data-path=/2020/04/12/redis%E7%B3%BB%E5%88%97%E4%BB%8B%E7%BB%8D%E4%B8%83/ data-title=redis系列介绍七-过期策略 title=阅读次数><span class=post-meta-item-icon><i class="far fa-eye"></i> </span><span class=post-meta-item-text>阅读次数:</span> <span class=cloudflare-page-counter-count></span></span></div><div class=post-description>这一篇不再是数据结构介绍了,大致的数据结构基本都介绍了,这一篇主要是查漏补缺,或者说讲一些重要且基本的概念,也可能是经常被忽略的,很多讲 redis 的系列文章可能都会忽略,学习 redis 的时候也会,因为觉得源码学习就是讲主要的数据结构和“算法”学习了就好了。</div></div></header><div class=post-body itemprop=articleBody><p>这一篇不再是数据结构介绍了,大致的数据结构基本都介绍了,这一篇主要是查漏补缺,或者说讲一些重要且基本的概念,也可能是经常被忽略的,很多讲 redis 的系列文章可能都会忽略,学习 redis 的时候也会,因为觉得源码学习就是讲主要的数据结构和“算法”学习了就好了。<br>redis 的主要应用就是拿来作为高性能的缓存,那么缓存一般有些啥需要注意的,首先是访问速度,如果取得跟数据库一样快,那就没什么存在的意义,第二个是缓存的字面意思,我只是为了让数据读取快一些,通常大部分的场景这个是需要更新过期的,这里就把我要讲的第一点引出来了(真累,<h2 id=redis过期策略><a class=headerlink href=#redis过期策略 title=redis过期策略></a>redis过期策略</h2><p>redis 是如何过期缓存的,可以猜测下,最无脑的就是每个设置了过期时间的 key 都设个定时器,过期了就删除,这种显然消耗太大,清理地最及时,还有的就是 redis 正在采用的懒汉清理策略和定期清理<br>懒汉策略就是在使用的时候去检查缓存是否过期,比如 get 操作时,先判断下这个 key 是否已经过期了,如果过期了就删掉,并且返回空,如果没过期则正常返回<br>主要代码是<figure class="highlight c"><table><tr><td class=gutter><pre><span class=line>1</span><br><span class=line>2</span><br><span class=line>3</span><br><span class=line>4</span><br><span class=line>5</span><br><span class=line>6</span><br><span class=line>7</span><br><span class=line>8</span><br><span class=line>9</span><br><span class=line>10</span><br><span class=line>11</span><br><span class=line>12</span><br><span class=line>13</span><br><span class=line>14</span><br><span class=line>15</span><br><span class=line>16</span><br><span class=line>17</span><br><span class=line>18</span><br><span class=line>19</span><br><span class=line>20</span><br><span class=line>21</span><br><span class=line>22</span><br><span class=line>23</span><br><span class=line>24</span><br><span class=line>25</span><br><span class=line>26</span><br><span class=line>27</span><br><span class=line>28</span><br><span class=line>29</span><br><span class=line>30</span><br><span class=line>31</span><br><span class=line>32</span><br><span class=line>33</span><br><span class=line>34</span><br><span class=line>35</span><br><span class=line>36</span><br><span class=line>37</span><br><span class=line>38</span><br><span class=line>39</span><br><span class=line>40</span><br><span class=line>41</span><br><span class=line>42</span><br><span class=line>43</span><br><span class=line>44</span><br><span class=line>45</span><br><span class=line>46</span><br><span class=line>47</span><br><span class=line>48</span><br><span class=line>49</span><br><span class=line>50</span><br><span class=line>51</span><br><span class=line>52</span><br><span class=line>53</span><br><span class=line>54</span><br><span class=line>55</span><br><span class=line>56</span><br><span class=line>57</span><br><span class=line>58</span><br><span class=line>59</span><br><span class=line>60</span><br><span class=line>61</span><br><span class=line>62</span><br><span class=line>63</span><br><span class=line>64</span><br><span class=line>65</span><br><span class=line>66</span><br><span class=line>67</span><br><span class=line>68</span><br><span class=line>69</span><br><span class=line>70</span><br><span class=line>71</span><br><span class=line>72</span><br><span class=line>73</span><br><span class=line>74</span><br><span class=line>75</span><br><span class=line>76</span><br><span class=line>77</span><br><span class=line>78</span><br><span class=line>79</span><br><span class=line>80</span><br><span class=line>81</span><br><span class=line>82</span><br><span class=line>83</span><br><span class=line>84</span><br><span class=line>85</span><br><span class=line>86</span><br><span class=line>87</span><br><span class=line>88</span><br><span class=line>89</span><br><span class=line>90</span><br><span class=line>91</span><br><span class=line>92</span><br></pre><td class=code><pre><span class=line><span class=comment>/* This function is called when we are going to perform some operation</span></span><br><span class=line><span class=comment> * in a given key, but such key may be already logically expired even if</span></span><br><span class=line><span class=comment> * it still exists in the database. The main way this function is called</span></span><br><span class=line><span class=comment> * is via lookupKey*() family of functions.</span></span><br><span class=line><span class=comment> *</span></span><br><span class=line><span class=comment> * The behavior of the function depends on the replication role of the</span></span><br><span class=line><span class=comment> * instance, because slave instances do not expire keys, they wait</span></span><br><span class=line><span class=comment> * for DELs from the master for consistency matters. However even</span></span><br><span class=line><span class=comment> * slaves will try to have a coherent return value for the function,</span></span><br><span class=line><span class=comment> * so that read commands executed in the slave side will be able to</span></span><br><span class=line><span class=comment> * behave like if the key is expired even if still present (because the</span></span><br><span class=line><span class=comment> * master has yet to propagate the DEL).</span></span><br><span class=line><span class=comment> *</span></span><br><span class=line><span class=comment> * In masters as a side effect of finding a key which is expired, such</span></span><br><span class=line><span class=comment> * key will be evicted from the database. Also this may trigger the</span></span><br><span class=line><span class=comment> * propagation of a DEL/UNLINK command in AOF / replication stream.</span></span><br><span class=line><span class=comment> *</span></span><br><span class=line><span class=comment> * The return value of the function is 0 if the key is still valid,</span></span><br><span class=line><span class=comment> * otherwise the function returns 1 if the key is expired. */</span></span><br><span class=line><span class=type>int</span> <span class="title function_">expireIfNeeded</span><span class=params>(redisDb *db, robj *key)</span> {</span><br><span class=line> <span class=keyword>if</span> (!keyIsExpired(db,key)) <span class=keyword>return</span> <span class=number>0</span>;</span><br><span class=line></span><br><span class=line> <span class=comment>/* If we are running in the context of a slave, instead of</span></span><br><span class=line><span class=comment> * evicting the expired key from the database, we return ASAP:</span></span><br><span class=line><span class=comment> * the slave key expiration is controlled by the master that will</span></span><br><span class=line><span class=comment> * send us synthesized DEL operations for expired keys.</span></span><br><span class=line><span class=comment> *</span></span><br><span class=line><span class=comment> * Still we try to return the right information to the caller,</span></span><br><span class=line><span class=comment> * that is, 0 if we think the key should be still valid, 1 if</span></span><br><span class=line><span class=comment> * we think the key is expired at this time. */</span></span><br><span class=line> <span class=keyword>if</span> (server.masterhost != <span class=literal>NULL</span>) <span class=keyword>return</span> <span class=number>1</span>;</span><br><span class=line></span><br><span class=line> <span class=comment>/* Delete the key */</span></span><br><span class=line> server.stat_expiredkeys++;</span><br><span class=line> propagateExpire(db,key,server.lazyfree_lazy_expire);</span><br><span class=line> notifyKeyspaceEvent(NOTIFY_EXPIRED,</span><br><span class=line> <span class=string>"expired"</span>,key,db->id);</span><br><span class=line> <span class=keyword>return</span> server.lazyfree_lazy_expire ? dbAsyncDelete(db,key) :</span><br><span class=line> dbSyncDelete(db,key);</span><br><span class=line>}</span><br><span class=line></span><br><span class=line><span class=comment>/* Check if the key is expired. */</span></span><br><span class=line><span class=type>int</span> <span class="title function_">keyIsExpired</span><span class=params>(redisDb *db, robj *key)</span> {</span><br><span class=line> <span class=type>mstime_t</span> when = getExpire(db,key);</span><br><span class=line> <span class=type>mstime_t</span> now;</span><br><span class=line></span><br><span class=line> <span class=keyword>if</span> (when < <span class=number>0</span>) <span class=keyword>return</span> <span class=number>0</span>; <span class=comment>/* No expire for this key */</span></span><br><span class=line></span><br><span class=line> <span class=comment>/* Don't expire anything while loading. It will be done later. */</span></span><br><span class=line> <span class=keyword>if</span> (server.loading) <span class=keyword>return</span> <span class=number>0</span>;</span><br><span class=line></span><br><span class=line> <span class=comment>/* If we are in the context of a Lua script, we pretend that time is</span></span><br><span class=line><span class=comment> * blocked to when the Lua script started. This way a key can expire</span></span><br><span class=line><span class=comment> * only the first time it is accessed and not in the middle of the</span></span><br><span class=line><span class=comment> * script execution, making propagation to slaves / AOF consistent.</span></span><br><span class=line><span class=comment> * See issue #1525 on Github for more information. */</span></span><br><span class=line> <span class=keyword>if</span> (server.lua_caller) {</span><br><span class=line> now = server.lua_time_start;</span><br><span class=line> }</span><br><span class=line> <span class=comment>/* If we are in the middle of a command execution, we still want to use</span></span><br><span class=line><span class=comment> * a reference time that does not change: in that case we just use the</span></span><br><span class=line><span class=comment> * cached time, that we update before each call in the call() function.</span></span><br><span class=line><span class=comment> * This way we avoid that commands such as RPOPLPUSH or similar, that</span></span><br><span class=line><span class=comment> * may re-open the same key multiple times, can invalidate an already</span></span><br><span class=line><span class=comment> * open object in a next call, if the next call will see the key expired,</span></span><br><span class=line><span class=comment> * while the first did not. */</span></span><br><span class=line> <span class=keyword>else</span> <span class=keyword>if</span> (server.fixed_time_expire > <span class=number>0</span>) {</span><br><span class=line> now = server.mstime;</span><br><span class=line> }</span><br><span class=line> <span class=comment>/* For the other cases, we want to use the most fresh time we have. */</span></span><br><span class=line> <span class=keyword>else</span> {</span><br><span class=line> now = mstime();</span><br><span class=line> }</span><br><span class=line></span><br><span class=line> <span class=comment>/* The key expired if the current (virtual or real) time is greater</span></span><br><span class=line><span class=comment> * than the expire time of the key. */</span></span><br><span class=line> <span class=keyword>return</span> now > when;</span><br><span class=line>}</span><br><span class=line><span class=comment>/* Return the expire time of the specified key, or -1 if no expire</span></span><br><span class=line><span class=comment> * is associated with this key (i.e. the key is non volatile) */</span></span><br><span class=line><span class=type>long</span> <span class=type>long</span> <span class="title function_">getExpire</span><span class=params>(redisDb *db, robj *key)</span> {</span><br><span class=line> dictEntry *de;</span><br><span class=line></span><br><span class=line> <span class=comment>/* No expire? return ASAP */</span></span><br><span class=line> <span class=keyword>if</span> (dictSize(db->expires) == <span class=number>0</span> ||</span><br><span class=line> (de = dictFind(db->expires,key->ptr)) == <span class=literal>NULL</span>) <span class=keyword>return</span> <span class=number>-1</span>;</span><br><span class=line></span><br><span class=line> <span class=comment>/* The entry was found in the expire dict, this means it should also</span></span><br><span class=line><span class=comment> * be present in the main dict (safety check). */</span></span><br><span class=line> serverAssertWithInfo(<span class=literal>NULL</span>,key,dictFind(db->dict,key->ptr) != <span class=literal>NULL</span>);</span><br><span class=line> <span class=keyword>return</span> dictGetSignedIntegerVal(de);</span><br><span class=line>}</span><br></pre></table></figure><p>这里有几点要注意的,第一是当惰性删除时会根据lazyfree_lazy_expire这个参数去判断是执行同步删除还是异步删除,另外一点是对于 slave,是不需要执行的,因为会在 master 过期时向 slave 发送 del 指令。<br>光采用这个策略会有什么问题呢,假如一些key 一直未被访问,那这些 key 就不会过期了,导致一直被占用着内存,所以 redis 采取了懒汉式过期加定期过期策略,定期策略是怎么执行的呢<figure class="highlight c"><table><tr><td class=gutter><pre><span class=line>1</span><br><span class=line>2</span><br><span class=line>3</span><br><span class=line>4</span><br><span class=line>5</span><br><span class=line>6</span><br><span class=line>7</span><br><span class=line>8</span><br><span class=line>9</span><br><span class=line>10</span><br><span class=line>11</span><br><span class=line>12</span><br><span class=line>13</span><br><span class=line>14</span><br><span class=line>15</span><br><span class=line>16</span><br><span class=line>17</span><br><span class=line>18</span><br><span class=line>19</span><br><span class=line>20</span><br><span class=line>21</span><br><span class=line>22</span><br><span class=line>23</span><br><span class=line>24</span><br><span class=line>25</span><br><span class=line>26</span><br><span class=line>27</span><br><span class=line>28</span><br><span class=line>29</span><br><span class=line>30</span><br><span class=line>31</span><br><span class=line>32</span><br><span class=line>33</span><br><span class=line>34</span><br><span class=line>35</span><br><span class=line>36</span><br><span class=line>37</span><br><span class=line>38</span><br><span class=line>39</span><br><span class=line>40</span><br><span class=line>41</span><br><span class=line>42</span><br><span class=line>43</span><br><span class=line>44</span><br><span class=line>45</span><br><span class=line>46</span><br><span class=line>47</span><br><span class=line>48</span><br><span class=line>49</span><br><span class=line>50</span><br><span class=line>51</span><br><span class=line>52</span><br><span class=line>53</span><br><span class=line>54</span><br><span class=line>55</span><br><span class=line>56</span><br><span class=line>57</span><br><span class=line>58</span><br><span class=line>59</span><br><span class=line>60</span><br><span class=line>61</span><br><span class=line>62</span><br><span class=line>63</span><br><span class=line>64</span><br><span class=line>65</span><br><span class=line>66</span><br><span class=line>67</span><br><span class=line>68</span><br><span class=line>69</span><br><span class=line>70</span><br><span class=line>71</span><br><span class=line>72</span><br><span class=line>73</span><br><span class=line>74</span><br><span class=line>75</span><br><span class=line>76</span><br><span class=line>77</span><br><span class=line>78</span><br><span class=line>79</span><br><span class=line>80</span><br><span class=line>81</span><br><span class=line>82</span><br><span class=line>83</span><br><span class=line>84</span><br><span class=line>85</span><br><span class=line>86</span><br><span class=line>87</span><br><span class=line>88</span><br><span class=line>89</span><br><span class=line>90</span><br><span class=line>91</span><br><span class=line>92</span><br><span class=line>93</span><br><span class=line>94</span><br><span class=line>95</span><br><span class=line>96</span><br><span class=line>97</span><br><span class=line>98</span><br><span class=line>99</span><br><span class=line>100</span><br><span class=line>101</span><br><span class=line>102</span><br><span class=line>103</span><br><span class=line>104</span><br><span class=line>105</span><br><span class=line>106</span><br><span class=line>107</span><br><span class=line>108</span><br><span class=line>109</span><br><span class=line>110</span><br><span class=line>111</span><br><span class=line>112</span><br><span class=line>113</span><br><span class=line>114</span><br><span class=line>115</span><br><span class=line>116</span><br><span class=line>117</span><br><span class=line>118</span><br><span class=line>119</span><br><span class=line>120</span><br><span class=line>121</span><br><span class=line>122</span><br><span class=line>123</span><br><span class=line>124</span><br><span class=line>125</span><br><span class=line>126</span><br><span class=line>127</span><br><span class=line>128</span><br><span class=line>129</span><br><span class=line>130</span><br><span class=line>131</span><br><span class=line>132</span><br><span class=line>133</span><br><span class=line>134</span><br><span class=line>135</span><br><span class=line>136</span><br><span class=line>137</span><br><span class=line>138</span><br><span class=line>139</span><br><span class=line>140</span><br><span class=line>141</span><br><span class=line>142</span><br><span class=line>143</span><br><span class=line>144</span><br><span class=line>145</span><br><span class=line>146</span><br><span class=line>147</span><br><span class=line>148</span><br><span class=line>149</span><br><span class=line>150</span><br><span class=line>151</span><br><span class=line>152</span><br><span class=line>153</span><br><span class=line>154</span><br><span class=line>155</span><br><span class=line>156</span><br><span class=line>157</span><br><span class=line>158</span><br><span class=line>159</span><br><span class=line>160</span><br><span class=line>161</span><br><span class=line>162</span><br><span class=line>163</span><br><span class=line>164</span><br><span class=line>165</span><br><span class=line>166</span><br><span class=line>167</span><br><span class=line>168</span><br><span class=line>169</span><br><span class=line>170</span><br><span class=line>171</span><br><span class=line>172</span><br><span class=line>173</span><br><span class=line>174</span><br><span class=line>175</span><br><span class=line>176</span><br><span class=line>177</span><br><span class=line>178</span><br><span class=line>179</span><br><span class=line>180</span><br><span class=line>181</span><br><span class=line>182</span><br><span class=line>183</span><br><span class=line>184</span><br><span class=line>185</span><br><span class=line>186</span><br><span class=line>187</span><br><span class=line>188</span><br><span class=line>189</span><br><span class=line>190</span><br><span class=line>191</span><br><span class=line>192</span><br><span class=line>193</span><br><span class=line>194</span><br><span class=line>195</span><br><span class=line>196</span><br><span class=line>197</span><br><span class=line>198</span><br><span class=line>199</span><br><span class=line>200</span><br><span class=line>201</span><br><span class=line>202</span><br><span class=line>203</span><br><span class=line>204</span><br><span class=line>205</span><br><span class=line>206</span><br><span class=line>207</span><br><span class=line>208</span><br><span class=line>209</span><br><span class=line>210</span><br><span class=line>211</span><br><span class=line>212</span><br><span class=line>213</span><br><span class=line>214</span><br><span class=line>215</span><br><span class=line>216</span><br><span class=line>217</span><br><span class=line>218</span><br><span class=line>219</span><br><span class=line>220</span><br><span class=line>221</span><br><span class=line>222</span><br><span class=line>223</span><br><span class=line>224</span><br><span class=line>225</span><br><span class=line>226</span><br><span class=line>227</span><br><span class=line>228</span><br><span class=line>229</span><br><span class=line>230</span><br><span class=line>231</span><br><span class=line>232</span><br><span class=line>233</span><br><span class=line>234</span><br><span class=line>235</span><br><span class=line>236</span><br><span class=line>237</span><br><span class=line>238</span><br><span class=line>239</span><br><span class=line>240</span><br><span class=line>241</span><br><span class=line>242</span><br><span class=line>243</span><br><span class=line>244</span><br><span class=line>245</span><br><span class=line>246</span><br><span class=line>247</span><br><span class=line>248</span><br><span class=line>249</span><br><span class=line>250</span><br><span class=line>251</span><br><span class=line>252</span><br><span class=line>253</span><br><span class=line>254</span><br><span class=line>255</span><br><span class=line>256</span><br><span class=line>257</span><br><span class=line>258</span><br><span class=line>259</span><br><span class=line>260</span><br><span class=line>261</span><br><span class=line>262</span><br><span class=line>263</span><br><span class=line>264</span><br><span class=line>265</span><br><span class=line>266</span><br><span class=line>267</span><br><span class=line>268</span><br><span class=line>269</span><br><span class=line>270</span><br><span class=line>271</span><br><span class=line>272</span><br><span class=line>273</span><br><span class=line>274</span><br><span class=line>275</span><br><span class=line>276</span><br><span class=line>277</span><br><span class=line>278</span><br><span class=line>279</span><br><span class=line>280</span><br><span class=line>281</span><br><span class=line>282</span><br><span class=line>283</span><br><span class=line>284</span><br><span class=line>285</span><br><span class=line>286</span><br><span class=line>287</span><br><span class=line>288</span><br><span class=line>289</span><br><span class=line>290</span><br><span class=line>291</span><br><span class=line>292</span><br><span class=line>293</span><br><span class=line>294</span><br><span class=line>295</span><br><span class=line>296</span><br><span class=line>297</span><br><span class=line>298</span><br><span class=line>299</span><br><span class=line>300</span><br><span class=line>301</span><br><span class=line>302</span><br><span class=line>303</span><br><span class=line>304</span><br></pre><td class=code><pre><span class=line><span class=comment>/* This function handles 'background' operations we are required to do</span></span><br><span class=line><span class=comment> * incrementally in Redis databases, such as active key expiring, resizing,</span></span><br><span class=line><span class=comment> * rehashing. */</span></span><br><span class=line><span class=type>void</span> <span class="title function_">databasesCron</span><span class=params>(<span class=type>void</span>)</span> {</span><br><span class=line> <span class=comment>/* Expire keys by random sampling. Not required for slaves</span></span><br><span class=line><span class=comment> * as master will synthesize DELs for us. */</span></span><br><span class=line> <span class=keyword>if</span> (server.active_expire_enabled) {</span><br><span class=line> <span class=keyword>if</span> (server.masterhost == <span class=literal>NULL</span>) {</span><br><span class=line> activeExpireCycle(ACTIVE_EXPIRE_CYCLE_SLOW);</span><br><span class=line> } <span class=keyword>else</span> {</span><br><span class=line> expireSlaveKeys();</span><br><span class=line> }</span><br><span class=line> }</span><br><span class=line></span><br><span class=line> <span class=comment>/* Defrag keys gradually. */</span></span><br><span class=line> activeDefragCycle();</span><br><span class=line></span><br><span class=line> <span class=comment>/* Perform hash tables rehashing if needed, but only if there are no</span></span><br><span class=line><span class=comment> * other processes saving the DB on disk. Otherwise rehashing is bad</span></span><br><span class=line><span class=comment> * as will cause a lot of copy-on-write of memory pages. */</span></span><br><span class=line> <span class=keyword>if</span> (!hasActiveChildProcess()) {</span><br><span class=line> <span class=comment>/* We use global counters so if we stop the computation at a given</span></span><br><span class=line><span class=comment> * DB we'll be able to start from the successive in the next</span></span><br><span class=line><span class=comment> * cron loop iteration. */</span></span><br><span class=line> <span class=type>static</span> <span class=type>unsigned</span> <span class=type>int</span> resize_db = <span class=number>0</span>;</span><br><span class=line> <span class=type>static</span> <span class=type>unsigned</span> <span class=type>int</span> rehash_db = <span class=number>0</span>;</span><br><span class=line> <span class=type>int</span> dbs_per_call = CRON_DBS_PER_CALL;</span><br><span class=line> <span class=type>int</span> j;</span><br><span class=line></span><br><span class=line> <span class=comment>/* Don't test more DBs than we have. */</span></span><br><span class=line> <span class=keyword>if</span> (dbs_per_call > server.dbnum) dbs_per_call = server.dbnum;</span><br><span class=line></span><br><span class=line> <span class=comment>/* Resize */</span></span><br><span class=line> <span class=keyword>for</span> (j = <span class=number>0</span>; j < dbs_per_call; j++) {</span><br><span class=line> tryResizeHashTables(resize_db % server.dbnum);</span><br><span class=line> resize_db++;</span><br><span class=line> }</span><br><span class=line></span><br><span class=line> <span class=comment>/* Rehash */</span></span><br><span class=line> <span class=keyword>if</span> (server.activerehashing) {</span><br><span class=line> <span class=keyword>for</span> (j = <span class=number>0</span>; j < dbs_per_call; j++) {</span><br><span class=line> <span class=type>int</span> work_done = incrementallyRehash(rehash_db);</span><br><span class=line> <span class=keyword>if</span> (work_done) {</span><br><span class=line> <span class=comment>/* If the function did some work, stop here, we'll do</span></span><br><span class=line><span class=comment> * more at the next cron loop. */</span></span><br><span class=line> <span class=keyword>break</span>;</span><br><span class=line> } <span class=keyword>else</span> {</span><br><span class=line> <span class=comment>/* If this db didn't need rehash, we'll try the next one. */</span></span><br><span class=line> rehash_db++;</span><br><span class=line> rehash_db %= server.dbnum;</span><br><span class=line> }</span><br><span class=line> }</span><br><span class=line> }</span><br><span class=line> }</span><br><span class=line>}</span><br><span class=line><span class=comment>/* Try to expire a few timed out keys. The algorithm used is adaptive and</span></span><br><span class=line><span class=comment> * will use few CPU cycles if there are few expiring keys, otherwise</span></span><br><span class=line><span class=comment> * it will get more aggressive to avoid that too much memory is used by</span></span><br><span class=line><span class=comment> * keys that can be removed from the keyspace.</span></span><br><span class=line><span class=comment> *</span></span><br><span class=line><span class=comment> * Every expire cycle tests multiple databases: the next call will start</span></span><br><span class=line><span class=comment> * again from the next db, with the exception of exists for time limit: in that</span></span><br><span class=line><span class=comment> * case we restart again from the last database we were processing. Anyway</span></span><br><span class=line><span class=comment> * no more than CRON_DBS_PER_CALL databases are tested at every iteration.</span></span><br><span class=line><span class=comment> *</span></span><br><span class=line><span class=comment> * The function can perform more or less work, depending on the "type"</span></span><br><span class=line><span class=comment> * argument. It can execute a "fast cycle" or a "slow cycle". The slow</span></span><br><span class=line><span class=comment> * cycle is the main way we collect expired cycles: this happens with</span></span><br><span class=line><span class=comment> * the "server.hz" frequency (usually 10 hertz).</span></span><br><span class=line><span class=comment> *</span></span><br><span class=line><span class=comment> * However the slow cycle can exit for timeout, since it used too much time.</span></span><br><span class=line><span class=comment> * For this reason the function is also invoked to perform a fast cycle</span></span><br><span class=line><span class=comment> * at every event loop cycle, in the beforeSleep() function. The fast cycle</span></span><br><span class=line><span class=comment> * will try to perform less work, but will do it much more often.</span></span><br><span class=line><span class=comment> *</span></span><br><span class=line><span class=comment> * The following are the details of the two expire cycles and their stop</span></span><br><span class=line><span class=comment> * conditions:</span></span><br><span class=line><span class=comment> *</span></span><br><span class=line><span class=comment> * If type is ACTIVE_EXPIRE_CYCLE_FAST the function will try to run a</span></span><br><span class=line><span class=comment> * "fast" expire cycle that takes no longer than EXPIRE_FAST_CYCLE_DURATION</span></span><br><span class=line><span class=comment> * microseconds, and is not repeated again before the same amount of time.</span></span><br><span class=line><span class=comment> * The cycle will also refuse to run at all if the latest slow cycle did not</span></span><br><span class=line><span class=comment> * terminate because of a time limit condition.</span></span><br><span class=line><span class=comment> *</span></span><br><span class=line><span class=comment> * If type is ACTIVE_EXPIRE_CYCLE_SLOW, that normal expire cycle is</span></span><br><span class=line><span class=comment> * executed, where the time limit is a percentage of the REDIS_HZ period</span></span><br><span class=line><span class=comment> * as specified by the ACTIVE_EXPIRE_CYCLE_SLOW_TIME_PERC define. In the</span></span><br><span class=line><span class=comment> * fast cycle, the check of every database is interrupted once the number</span></span><br><span class=line><span class=comment> * of already expired keys in the database is estimated to be lower than</span></span><br><span class=line><span class=comment> * a given percentage, in order to avoid doing too much work to gain too</span></span><br><span class=line><span class=comment> * little memory.</span></span><br><span class=line><span class=comment> *</span></span><br><span class=line><span class=comment> * The configured expire "effort" will modify the baseline parameters in</span></span><br><span class=line><span class=comment> * order to do more work in both the fast and slow expire cycles.</span></span><br><span class=line><span class=comment> */</span></span><br><span class=line></span><br><span class=line><span class=meta>#<span class=keyword>define</span> ACTIVE_EXPIRE_CYCLE_KEYS_PER_LOOP 20 <span class=comment>/* Keys for each DB loop. */</span></span></span><br><span class=line><span class=meta>#<span class=keyword>define</span> ACTIVE_EXPIRE_CYCLE_FAST_DURATION 1000 <span class=comment>/* Microseconds. */</span></span></span><br><span class=line><span class=meta>#<span class=keyword>define</span> ACTIVE_EXPIRE_CYCLE_SLOW_TIME_PERC 25 <span class=comment>/* Max % of CPU to use. */</span></span></span><br><span class=line><span class=meta>#<span class=keyword>define</span> ACTIVE_EXPIRE_CYCLE_ACCEPTABLE_STALE 10 <span class=comment>/* % of stale keys after which</span></span></span><br><span class=line><span class=comment><span class=meta> we do extra efforts. */</span></span></span><br><span class=line><span class=type>void</span> <span class="title function_">activeExpireCycle</span><span class=params>(<span class=type>int</span> type)</span> {</span><br><span class=line> <span class=comment>/* Adjust the running parameters according to the configured expire</span></span><br><span class=line><span class=comment> * effort. The default effort is 1, and the maximum configurable effort</span></span><br><span class=line><span class=comment> * is 10. */</span></span><br><span class=line> <span class=type>unsigned</span> <span class=type>long</span></span><br><span class=line> effort = server.active_expire_effort<span class=number>-1</span>, <span class=comment>/* Rescale from 0 to 9. */</span></span><br><span class=line> config_keys_per_loop = ACTIVE_EXPIRE_CYCLE_KEYS_PER_LOOP +</span><br><span class=line> ACTIVE_EXPIRE_CYCLE_KEYS_PER_LOOP/<span class=number>4</span>*effort,</span><br><span class=line> config_cycle_fast_duration = ACTIVE_EXPIRE_CYCLE_FAST_DURATION +</span><br><span class=line> ACTIVE_EXPIRE_CYCLE_FAST_DURATION/<span class=number>4</span>*effort,</span><br><span class=line> config_cycle_slow_time_perc = ACTIVE_EXPIRE_CYCLE_SLOW_TIME_PERC +</span><br><span class=line> <span class=number>2</span>*effort,</span><br><span class=line> config_cycle_acceptable_stale = ACTIVE_EXPIRE_CYCLE_ACCEPTABLE_STALE-</span><br><span class=line> effort;</span><br><span class=line></span><br><span class=line> <span class=comment>/* This function has some global state in order to continue the work</span></span><br><span class=line><span class=comment> * incrementally across calls. */</span></span><br><span class=line> <span class=type>static</span> <span class=type>unsigned</span> <span class=type>int</span> current_db = <span class=number>0</span>; <span class=comment>/* Last DB tested. */</span></span><br><span class=line> <span class=type>static</span> <span class=type>int</span> timelimit_exit = <span class=number>0</span>; <span class=comment>/* Time limit hit in previous call? */</span></span><br><span class=line> <span class=type>static</span> <span class=type>long</span> <span class=type>long</span> last_fast_cycle = <span class=number>0</span>; <span class=comment>/* When last fast cycle ran. */</span></span><br><span class=line></span><br><span class=line> <span class=type>int</span> j, iteration = <span class=number>0</span>;</span><br><span class=line> <span class=type>int</span> dbs_per_call = CRON_DBS_PER_CALL;</span><br><span class=line> <span class=type>long</span> <span class=type>long</span> start = ustime(), timelimit, elapsed;</span><br><span class=line></span><br><span class=line> <span class=comment>/* When clients are paused the dataset should be static not just from the</span></span><br><span class=line><span class=comment> * POV of clients not being able to write, but also from the POV of</span></span><br><span class=line><span class=comment> * expires and evictions of keys not being performed. */</span></span><br><span class=line> <span class=keyword>if</span> (clientsArePaused()) <span class=keyword>return</span>;</span><br><span class=line></span><br><span class=line> <span class=keyword>if</span> (type == ACTIVE_EXPIRE_CYCLE_FAST) {</span><br><span class=line> <span class=comment>/* Don't start a fast cycle if the previous cycle did not exit</span></span><br><span class=line><span class=comment> * for time limit, unless the percentage of estimated stale keys is</span></span><br><span class=line><span class=comment> * too high. Also never repeat a fast cycle for the same period</span></span><br><span class=line><span class=comment> * as the fast cycle total duration itself. */</span></span><br><span class=line> <span class=keyword>if</span> (!timelimit_exit &&</span><br><span class=line> server.stat_expired_stale_perc < config_cycle_acceptable_stale)</span><br><span class=line> <span class=keyword>return</span>;</span><br><span class=line></span><br><span class=line> <span class=keyword>if</span> (start < last_fast_cycle + (<span class=type>long</span> <span class=type>long</span>)config_cycle_fast_duration*<span class=number>2</span>)</span><br><span class=line> <span class=keyword>return</span>;</span><br><span class=line></span><br><span class=line> last_fast_cycle = start;</span><br><span class=line> }</span><br><span class=line></span><br><span class=line> <span class=comment>/* We usually should test CRON_DBS_PER_CALL per iteration, with</span></span><br><span class=line><span class=comment> * two exceptions:</span></span><br><span class=line><span class=comment> *</span></span><br><span class=line><span class=comment> * 1) Don't test more DBs than we have.</span></span><br><span class=line><span class=comment> * 2) If last time we hit the time limit, we want to scan all DBs</span></span><br><span class=line><span class=comment> * in this iteration, as there is work to do in some DB and we don't want</span></span><br><span class=line><span class=comment> * expired keys to use memory for too much time. */</span></span><br><span class=line> <span class=keyword>if</span> (dbs_per_call > server.dbnum || timelimit_exit)</span><br><span class=line> dbs_per_call = server.dbnum;</span><br><span class=line></span><br><span class=line> <span class=comment>/* We can use at max 'config_cycle_slow_time_perc' percentage of CPU</span></span><br><span class=line><span class=comment> * time per iteration. Since this function gets called with a frequency of</span></span><br><span class=line><span class=comment> * server.hz times per second, the following is the max amount of</span></span><br><span class=line><span class=comment> * microseconds we can spend in this function. */</span></span><br><span class=line> timelimit = config_cycle_slow_time_perc*<span class=number>1000000</span>/server.hz/<span class=number>100</span>;</span><br><span class=line> timelimit_exit = <span class=number>0</span>;</span><br><span class=line> <span class=keyword>if</span> (timelimit <= <span class=number>0</span>) timelimit = <span class=number>1</span>;</span><br><span class=line></span><br><span class=line> <span class=keyword>if</span> (type == ACTIVE_EXPIRE_CYCLE_FAST)</span><br><span class=line> timelimit = config_cycle_fast_duration; <span class=comment>/* in microseconds. */</span></span><br><span class=line></span><br><span class=line> <span class=comment>/* Accumulate some global stats as we expire keys, to have some idea</span></span><br><span class=line><span class=comment> * about the number of keys that are already logically expired, but still</span></span><br><span class=line><span class=comment> * existing inside the database. */</span></span><br><span class=line> <span class=type>long</span> total_sampled = <span class=number>0</span>;</span><br><span class=line> <span class=type>long</span> total_expired = <span class=number>0</span>;</span><br><span class=line></span><br><span class=line> <span class=keyword>for</span> (j = <span class=number>0</span>; j < dbs_per_call && timelimit_exit == <span class=number>0</span>; j++) {</span><br><span class=line> <span class=comment>/* Expired and checked in a single loop. */</span></span><br><span class=line> <span class=type>unsigned</span> <span class=type>long</span> expired, sampled;</span><br><span class=line></span><br><span class=line> redisDb *db = server.db+(current_db % server.dbnum);</span><br><span class=line></span><br><span class=line> <span class=comment>/* Increment the DB now so we are sure if we run out of time</span></span><br><span class=line><span class=comment> * in the current DB we'll restart from the next. This allows to</span></span><br><span class=line><span class=comment> * distribute the time evenly across DBs. */</span></span><br><span class=line> current_db++;</span><br><span class=line></span><br><span class=line> <span class=comment>/* Continue to expire if at the end of the cycle more than 25%</span></span><br><span class=line><span class=comment> * of the keys were expired. */</span></span><br><span class=line> <span class=keyword>do</span> {</span><br><span class=line> <span class=type>unsigned</span> <span class=type>long</span> num, slots;</span><br><span class=line> <span class=type>long</span> <span class=type>long</span> now, ttl_sum;</span><br><span class=line> <span class=type>int</span> ttl_samples;</span><br><span class=line> iteration++;</span><br><span class=line></span><br><span class=line> <span class=comment>/* If there is nothing to expire try next DB ASAP. */</span></span><br><span class=line> <span class=keyword>if</span> ((num = dictSize(db->expires)) == <span class=number>0</span>) {</span><br><span class=line> db->avg_ttl = <span class=number>0</span>;</span><br><span class=line> <span class=keyword>break</span>;</span><br><span class=line> }</span><br><span class=line> slots = dictSlots(db->expires);</span><br><span class=line> now = mstime();</span><br><span class=line></span><br><span class=line> <span class=comment>/* When there are less than 1% filled slots, sampling the key</span></span><br><span class=line><span class=comment> * space is expensive, so stop here waiting for better times...</span></span><br><span class=line><span class=comment> * The dictionary will be resized asap. */</span></span><br><span class=line> <span class=keyword>if</span> (num && slots > DICT_HT_INITIAL_SIZE &&</span><br><span class=line> (num*<span class=number>100</span>/slots < <span class=number>1</span>)) <span class=keyword>break</span>;</span><br><span class=line></span><br><span class=line> <span class=comment>/* The main collection cycle. Sample random keys among keys</span></span><br><span class=line><span class=comment> * with an expire set, checking for expired ones. */</span></span><br><span class=line> expired = <span class=number>0</span>;</span><br><span class=line> sampled = <span class=number>0</span>;</span><br><span class=line> ttl_sum = <span class=number>0</span>;</span><br><span class=line> ttl_samples = <span class=number>0</span>;</span><br><span class=line></span><br><span class=line> <span class=keyword>if</span> (num > config_keys_per_loop)</span><br><span class=line> num = config_keys_per_loop;</span><br><span class=line></span><br><span class=line> <span class=comment>/* Here we access the low level representation of the hash table</span></span><br><span class=line><span class=comment> * for speed concerns: this makes this code coupled with dict.c,</span></span><br><span class=line><span class=comment> * but it hardly changed in ten years.</span></span><br><span class=line><span class=comment> *</span></span><br><span class=line><span class=comment> * Note that certain places of the hash table may be empty,</span></span><br><span class=line><span class=comment> * so we want also a stop condition about the number of</span></span><br><span class=line><span class=comment> * buckets that we scanned. However scanning for free buckets</span></span><br><span class=line><span class=comment> * is very fast: we are in the cache line scanning a sequential</span></span><br><span class=line><span class=comment> * array of NULL pointers, so we can scan a lot more buckets</span></span><br><span class=line><span class=comment> * than keys in the same time. */</span></span><br><span class=line> <span class=type>long</span> max_buckets = num*<span class=number>20</span>;</span><br><span class=line> <span class=type>long</span> checked_buckets = <span class=number>0</span>;</span><br><span class=line></span><br><span class=line> <span class=keyword>while</span> (sampled < num && checked_buckets < max_buckets) {</span><br><span class=line> <span class=keyword>for</span> (<span class=type>int</span> table = <span class=number>0</span>; table < <span class=number>2</span>; table++) {</span><br><span class=line> <span class=keyword>if</span> (table == <span class=number>1</span> && !dictIsRehashing(db->expires)) <span class=keyword>break</span>;</span><br><span class=line></span><br><span class=line> <span class=type>unsigned</span> <span class=type>long</span> idx = db->expires_cursor;</span><br><span class=line> idx &= db->expires->ht[table].sizemask;</span><br><span class=line> dictEntry *de = db->expires->ht[table].table[idx];</span><br><span class=line> <span class=type>long</span> <span class=type>long</span> ttl;</span><br><span class=line></span><br><span class=line> <span class=comment>/* Scan the current bucket of the current table. */</span></span><br><span class=line> checked_buckets++;</span><br><span class=line> <span class=keyword>while</span>(de) {</span><br><span class=line> <span class=comment>/* Get the next entry now since this entry may get</span></span><br><span class=line><span class=comment> * deleted. */</span></span><br><span class=line> dictEntry *e = de;</span><br><span class=line> de = de->next;</span><br><span class=line></span><br><span class=line> ttl = dictGetSignedIntegerVal(e)-now;</span><br><span class=line> <span class=keyword>if</span> (activeExpireCycleTryExpire(db,e,now)) expired++;</span><br><span class=line> <span class=keyword>if</span> (ttl > <span class=number>0</span>) {</span><br><span class=line> <span class=comment>/* We want the average TTL of keys yet</span></span><br><span class=line><span class=comment> * not expired. */</span></span><br><span class=line> ttl_sum += ttl;</span><br><span class=line> ttl_samples++;</span><br><span class=line> }</span><br><span class=line> sampled++;</span><br><span class=line> }</span><br><span class=line> }</span><br><span class=line> db->expires_cursor++;</span><br><span class=line> }</span><br><span class=line> total_expired += expired;</span><br><span class=line> total_sampled += sampled;</span><br><span class=line></span><br><span class=line> <span class=comment>/* Update the average TTL stats for this database. */</span></span><br><span class=line> <span class=keyword>if</span> (ttl_samples) {</span><br><span class=line> <span class=type>long</span> <span class=type>long</span> avg_ttl = ttl_sum/ttl_samples;</span><br><span class=line></span><br><span class=line> <span class=comment>/* Do a simple running average with a few samples.</span></span><br><span class=line><span class=comment> * We just use the current estimate with a weight of 2%</span></span><br><span class=line><span class=comment> * and the previous estimate with a weight of 98%. */</span></span><br><span class=line> <span class=keyword>if</span> (db->avg_ttl == <span class=number>0</span>) db->avg_ttl = avg_ttl;</span><br><span class=line> db->avg_ttl = (db->avg_ttl/<span class=number>50</span>)*<span class=number>49</span> + (avg_ttl/<span class=number>50</span>);</span><br><span class=line> }</span><br><span class=line></span><br><span class=line> <span class=comment>/* We can't block forever here even if there are many keys to</span></span><br><span class=line><span class=comment> * expire. So after a given amount of milliseconds return to the</span></span><br><span class=line><span class=comment> * caller waiting for the other active expire cycle. */</span></span><br><span class=line> <span class=keyword>if</span> ((iteration & <span class=number>0xf</span>) == <span class=number>0</span>) { <span class=comment>/* check once every 16 iterations. */</span></span><br><span class=line> elapsed = ustime()-start;</span><br><span class=line> <span class=keyword>if</span> (elapsed > timelimit) {</span><br><span class=line> timelimit_exit = <span class=number>1</span>;</span><br><span class=line> server.stat_expired_time_cap_reached_count++;</span><br><span class=line> <span class=keyword>break</span>;</span><br><span class=line> }</span><br><span class=line> }</span><br><span class=line> <span class=comment>/* We don't repeat the cycle for the current database if there are</span></span><br><span class=line><span class=comment> * an acceptable amount of stale keys (logically expired but yet</span></span><br><span class=line><span class=comment> * not reclained). */</span></span><br><span class=line> } <span class=keyword>while</span> ((expired*<span class=number>100</span>/sampled) > config_cycle_acceptable_stale);</span><br><span class=line> }</span><br><span class=line></span><br><span class=line> elapsed = ustime()-start;</span><br><span class=line> server.stat_expire_cycle_time_used += elapsed;</span><br><span class=line> latencyAddSampleIfNeeded(<span class=string>"expire-cycle"</span>,elapsed/<span class=number>1000</span>);</span><br><span class=line></span><br><span class=line> <span class=comment>/* Update our estimate of keys existing but yet to be expired.</span></span><br><span class=line><span class=comment> * Running average with this sample accounting for 5%. */</span></span><br><span class=line> <span class=type>double</span> current_perc;</span><br><span class=line> <span class=keyword>if</span> (total_sampled) {</span><br><span class=line> current_perc = (<span class=type>double</span>)total_expired/total_sampled;</span><br><span class=line> } <span class=keyword>else</span></span><br><span class=line> current_perc = <span class=number>0</span>;</span><br><span class=line> server.stat_expired_stale_perc = (current_perc*<span class=number>0.05</span>)+</span><br><span class=line> (server.stat_expired_stale_perc*<span class=number>0.95</span>);</span><br><span class=line>}</span><br></pre></table></figure><p>执行定期清除分成两种类型,快和慢,分别由<code>beforeSleep</code>和<code>databasesCron</code>调用,快版有两个限制,一个是执行时长由ACTIVE_EXPIRE_CYCLE_FAST_DURATION限制,另一个是执行间隔是 2 倍的ACTIVE_EXPIRE_CYCLE_FAST_DURATION,另外这还可以由配置的server.active_expire_effort参数来控制,默认是 1,最大是 10<figure class="highlight c"><table><tr><td class=gutter><pre><span class=line>1</span><br><span class=line>2</span><br></pre><td class=code><pre><span class=line>onfig_cycle_fast_duration = ACTIVE_EXPIRE_CYCLE_FAST_DURATION +</span><br><span class=line> ACTIVE_EXPIRE_CYCLE_FAST_DURATION/<span class=number>4</span>*effort</span><br></pre></table></figure><p>然后会从一定数量的 db 中找出一定数量的带过期时间的 key(保存在 expires中),这里的数量是由<figure class="highlight c"><table><tr><td class=gutter><pre><span class=line>1</span><br><span class=line>2</span><br><span class=line>3</span><br><span class=line>4</span><br><span class=line>5</span><br><span class=line>6</span><br><span class=line>7</span><br><span class=line>8</span><br></pre><td class=code><pre><span class=line>config_keys_per_loop = ACTIVE_EXPIRE_CYCLE_KEYS_PER_LOOP +</span><br><span class=line> ACTIVE_EXPIRE_CYCLE_KEYS_PER_LOOP/<span class=number>4</span>*effort</span><br><span class=line>``` </span><br><span class=line>控制,慢速的执行时长是</span><br><span class=line>```C</span><br><span class=line>config_cycle_slow_time_perc = ACTIVE_EXPIRE_CYCLE_SLOW_TIME_PERC +</span><br><span class=line> <span class=number>2</span>*effort</span><br><span class=line>timelimit = config_cycle_slow_time_perc*<span class=number>1000000</span>/server.hz/<span class=number>100</span>;</span><br></pre></table></figure><p>这里还有一个额外的退出条件,如果当前数据库的抽样结果已经达到我们所允许的过期 key 百分比,则下次不再处理当前 db,继续处理下个 db</div><footer class=post-footer><div class="affiliate-creative affiliate-creative--post-end" data-affiliate-id=tencent-cloud-general><a rel="sponsored noopener" aria-label=腾讯云产品优惠 href=https://cloud.tencent.com/act/cps/redirect?redirect=2446&cps_key=2e33a1eedb380997d03618b4a5ba6ca7&from=console target=_blank><img alt=腾讯云服务器、数据库和云产品优惠 decoding=async height=419 loading=lazy src=/uploads/affiliate/tencent-cloud-general.webp width=690> </a><span class=affiliate-disclosure>推广</span></div><div class=reward-container><div>请我一杯咖啡吧!</div><button>赞赏</button><div class=post-reward><div><img alt="Nicksxs 微信" src=https://i.loli.net/2020/01/12/NUlWanT31E8LQGx.png><span>微信</span></div><div><img alt="Nicksxs 支付宝" src=https://ooo.0o0.ooo/2016/08/17/57b421e773057.jpg><span>支付宝</span></div></div></div><div class=post-copyright><ul><li class=post-copyright-author><strong>本文作者: </strong>Nicksxs<li class=post-copyright-link><strong>本文链接:</strong> <a href=https://nicksxs.me/2020/04/12/redis%E7%B3%BB%E5%88%97%E4%BB%8B%E7%BB%8D%E4%B8%83/ title=redis系列介绍七-过期策略>https://nicksxs.me/2020/04/12/redis系列介绍七/</a><li class=post-copyright-license><strong>版权声明: </strong>本博客所有文章除特别声明外,均采用 <a href=https://creativecommons.org/licenses/by-nc-sa/4.0/ rel=noopener target=_blank><i class="fab fa-fw fa-creative-commons"></i>BY-NC-SA</a> 许可协议。转载请注明出处!</ul></div><div class=post-tags><a href=/tags/Redis/ rel=tag># Redis</a><a href=/tags/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/ rel=tag># 数据结构</a><a href=/tags/%E6%BA%90%E7%A0%81/ rel=tag># 源码</a></div><div class=post-nav><div class=post-nav-item><a href=/2020/04/05/Comparator%E4%BD%BF%E7%94%A8%E5%B0%8F%E8%AE%B0/ rel=prev title=Comparator使用小记><i class="fa fa-angle-left"></i> Comparator使用小记</a></div><div class=post-nav-item><a href=/2020/04/18/redis%E7%B3%BB%E5%88%97%E4%BB%8B%E7%BB%8D%E5%85%AB/ rel=next title=redis系列介绍八-淘汰策略>redis系列介绍八-淘汰策略 <i class="fa fa-angle-right"></i></a></div></div></footer></article></div><div class=comments id=disqus_thread><noscript>Please enable JavaScript to view the comments powered by Disqus.</noscript></div></div></main><footer class=footer><div class=footer-inner><div class=beian><a href=https://beian.miit.gov.cn/ rel=noopener target=_blank>浙ICP备16002580号-2 </a><img alt src=/uploads/beian.png><a href=https://beian.mps.gov.cn/#/query/webSearch?code=33010602011094 rel=noopener target=_blank>浙公网安备 33010602011094号</a></div><div class=copyright>© <span itemprop=copyrightYear>2026</span><span class=with-love><i class="fa fa-heart"></i> </span><span class=author itemprop=copyrightHolder>Nicksxs</span></div></div></footer><div class="toggle sidebar-toggle" role=button><span class=toggle-line></span><span class=toggle-line></span><span class=toggle-line></span></div><div class=sidebar-dimmer></div><div aria-label=返回顶部 class=back-to-top role=button><i class="fa fa-arrow-up fa-lg"></i><span>0%</span></div><a aria-label="在 GitHub 上关注我" title="在 GitHub 上关注我" class=github-corner href=https://github.com/nicksxs rel=noopener target=_blank><svg viewbox="0 0 250 250" aria-hidden=true height=80 width=80><path d="M0,0 L115,115 L130,115 L142,142 L250,250 L250,0 Z"></path><path d="M128.3,109.0 C113.8,99.7 119.0,89.6 119.0,89.6 C122.0,82.7 120.5,78.6 120.5,78.6 C119.2,72.0 123.4,76.3 123.4,76.3 C127.3,80.9 125.5,87.3 125.5,87.3 C122.9,97.6 130.6,101.9 134.4,103.2" style="transform-origin:130px 106px" class=octo-arm fill=currentColor></path><path d="M115.0,115.0 C114.9,115.1 118.7,116.5 119.8,115.4 L133.7,101.6 C136.9,99.2 139.9,98.4 142.2,98.6 C133.8,88.0 127.5,74.4 143.8,58.0 C148.5,53.4 154.0,51.2 159.7,51.0 C160.3,49.4 163.2,43.6 171.4,40.1 C171.4,40.1 176.1,42.5 178.8,56.2 C183.1,58.6 187.2,61.8 190.9,65.4 C194.5,69.0 197.7,73.2 200.1,77.6 C213.8,80.2 216.3,84.9 216.3,84.9 C212.7,93.1 206.9,96.0 205.4,96.6 C205.1,102.4 203.0,107.8 198.3,112.5 C181.9,128.9 168.3,122.5 157.7,114.1 C157.9,116.9 156.7,120.9 152.7,124.9 L141.0,136.5 C139.8,137.7 141.6,141.9 141.8,141.8 Z" class=octo-body fill=currentColor></path></svg></a><noscript><div class=noscript-warning>Theme NexT works best with JavaScript enabled</div></noscript><script data-cloudflare-page-counter-config type=application/json>{"enable":true,"endpoint":"https://counter.nicksxs.me","site":"nicksxs","local_cache":true,"timeout":5000,"icon":"far fa-eye","item_text":true}</script><script src=/js/cloudflare-page-counter.js></script><script class=next-config data-name=disqus type=application/json>{"enable":true,"shortname":"nicksxs","count":false,"i18n":{"disqus":"disqus"}}</script><script defer src=/js/third-party/comments/disqus.js></script>