漫话Redis源码之七十八

2024-02-06 09:38
文章标签 源码 redis 七十八 漫话

本文主要是介绍漫话Redis源码之七十八，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

bio操作相关的实现，对于线程，互斥量，条件变量，也需要理解清楚哦：

#include "server.h"
#include "bio.h"static pthread_t bio_threads[BIO_NUM_OPS];
static pthread_mutex_t bio_mutex[BIO_NUM_OPS];
static pthread_cond_t bio_newjob_cond[BIO_NUM_OPS];
static pthread_cond_t bio_step_cond[BIO_NUM_OPS];
static list *bio_jobs[BIO_NUM_OPS];
/* The following array is used to hold the number of pending jobs for every* OP type. This allows us to export the bioPendingJobsOfType() API that is* useful when the main thread wants to perform some operation that may involve* objects shared with the background thread. The main thread will just wait* that there are no longer jobs of this type to be executed before performing* the sensible operation. This data is also useful for reporting. */
static unsigned long long bio_pending[BIO_NUM_OPS];/* This structure represents a background Job. It is only used locally to this* file as the API does not expose the internals at all. */
struct bio_job {time_t time; /* Time at which the job was created. *//* Job specific arguments.*/int fd; /* Fd for file based background jobs */lazy_free_fn *free_fn; /* Function that will free the provided arguments */void *free_args[]; /* List of arguments to be passed to the free function */
};void *bioProcessBackgroundJobs(void *arg);/* Make sure we have enough stack to perform all the things we do in the* main thread. */
#define REDIS_THREAD_STACK_SIZE (1024*1024*4)/* Initialize the background system, spawning the thread. */
void bioInit(void) {pthread_attr_t attr;pthread_t thread;size_t stacksize;int j;/* Initialization of state vars and objects */for (j = 0; j < BIO_NUM_OPS; j++) {pthread_mutex_init(&bio_mutex[j],NULL);pthread_cond_init(&bio_newjob_cond[j],NULL);pthread_cond_init(&bio_step_cond[j],NULL);bio_jobs[j] = listCreate();bio_pending[j] = 0;}/* Set the stack size as by default it may be small in some system */pthread_attr_init(&attr);pthread_attr_getstacksize(&attr,&stacksize);if (!stacksize) stacksize = 1; /* The world is full of Solaris Fixes */while (stacksize < REDIS_THREAD_STACK_SIZE) stacksize *= 2;pthread_attr_setstacksize(&attr, stacksize);/* Ready to spawn our threads. We use the single argument the thread* function accepts in order to pass the job ID the thread is* responsible of. */for (j = 0; j < BIO_NUM_OPS; j++) {void *arg = (void*)(unsigned long) j;if (pthread_create(&thread,&attr,bioProcessBackgroundJobs,arg) != 0) {serverLog(LL_WARNING,"Fatal: Can't initialize Background Jobs.");exit(1);}bio_threads[j] = thread;}
}void bioSubmitJob(int type, struct bio_job *job) {job->time = time(NULL);pthread_mutex_lock(&bio_mutex[type]);listAddNodeTail(bio_jobs[type],job);bio_pending[type]++;pthread_cond_signal(&bio_newjob_cond[type]);pthread_mutex_unlock(&bio_mutex[type]);
}void bioCreateLazyFreeJob(lazy_free_fn free_fn, int arg_count, ...) {va_list valist;/* Allocate memory for the job structure and all required* arguments */struct bio_job *job = zmalloc(sizeof(*job) + sizeof(void *) * (arg_count));job->free_fn = free_fn;va_start(valist, arg_count);for (int i = 0; i < arg_count; i++) {job->free_args[i] = va_arg(valist, void *);}va_end(valist);bioSubmitJob(BIO_LAZY_FREE, job);
}void bioCreateCloseJob(int fd) {struct bio_job *job = zmalloc(sizeof(*job));job->fd = fd;bioSubmitJob(BIO_CLOSE_FILE, job);
}void bioCreateFsyncJob(int fd) {struct bio_job *job = zmalloc(sizeof(*job));job->fd = fd;bioSubmitJob(BIO_AOF_FSYNC, job);
}void *bioProcessBackgroundJobs(void *arg) {struct bio_job *job;unsigned long type = (unsigned long) arg;sigset_t sigset;/* Check that the type is within the right interval. */if (type >= BIO_NUM_OPS) {serverLog(LL_WARNING,"Warning: bio thread started with wrong type %lu",type);return NULL;}switch (type) {case BIO_CLOSE_FILE:redis_set_thread_title("bio_close_file");break;case BIO_AOF_FSYNC:redis_set_thread_title("bio_aof_fsync");break;case BIO_LAZY_FREE:redis_set_thread_title("bio_lazy_free");break;}redisSetCpuAffinity(server.bio_cpulist);makeThreadKillable();pthread_mutex_lock(&bio_mutex[type]);/* Block SIGALRM so we are sure that only the main thread will* receive the watchdog signal. */sigemptyset(&sigset);sigaddset(&sigset, SIGALRM);if (pthread_sigmask(SIG_BLOCK, &sigset, NULL))serverLog(LL_WARNING,"Warning: can't mask SIGALRM in bio.c thread: %s", strerror(errno));while(1) {listNode *ln;/* The loop always starts with the lock hold. */if (listLength(bio_jobs[type]) == 0) {pthread_cond_wait(&bio_newjob_cond[type],&bio_mutex[type]);continue;}/* Pop the job from the queue. */ln = listFirst(bio_jobs[type]);job = ln->value;/* It is now possible to unlock the background system as we know have* a stand alone job structure to process.*/pthread_mutex_unlock(&bio_mutex[type]);/* Process the job accordingly to its type. */if (type == BIO_CLOSE_FILE) {close(job->fd);} else if (type == BIO_AOF_FSYNC) {/* The fd may be closed by main thread and reused for another* socket, pipe, or file. We just ignore these errno because* aof fsync did not really fail. */if (redis_fsync(job->fd) == -1 &&errno != EBADF && errno != EINVAL){int last_status;atomicGet(server.aof_bio_fsync_status,last_status);atomicSet(server.aof_bio_fsync_status,C_ERR);atomicSet(server.aof_bio_fsync_errno,errno);if (last_status == C_OK) {serverLog(LL_WARNING,"Fail to fsync the AOF file: %s",strerror(errno));}} else {atomicSet(server.aof_bio_fsync_status,C_OK);}} else if (type == BIO_LAZY_FREE) {job->free_fn(job->free_args);} else {serverPanic("Wrong job type in bioProcessBackgroundJobs().");}zfree(job);/* Lock again before reiterating the loop, if there are no longer* jobs to process we'll block again in pthread_cond_wait(). */pthread_mutex_lock(&bio_mutex[type]);listDelNode(bio_jobs[type],ln);bio_pending[type]--;/* Unblock threads blocked on bioWaitStepOfType() if any. */pthread_cond_broadcast(&bio_step_cond[type]);}
}/* Return the number of pending jobs of the specified type. */
unsigned long long bioPendingJobsOfType(int type) {unsigned long long val;pthread_mutex_lock(&bio_mutex[type]);val = bio_pending[type];pthread_mutex_unlock(&bio_mutex[type]);return val;
}/* If there are pending jobs for the specified type, the function blocks* and waits that the next job was processed. Otherwise the function* does not block and returns ASAP.** The function returns the number of jobs still to process of the* requested type.** This function is useful when from another thread, we want to wait* a bio.c thread to do more work in a blocking way.*/
unsigned long long bioWaitStepOfType(int type) {unsigned long long val;pthread_mutex_lock(&bio_mutex[type]);val = bio_pending[type];if (val != 0) {pthread_cond_wait(&bio_step_cond[type],&bio_mutex[type]);val = bio_pending[type];}pthread_mutex_unlock(&bio_mutex[type]);return val;
}/* Kill the running bio threads in an unclean way. This function should be* used only when it's critical to stop the threads for some reason.* Currently Redis does this only on crash (for instance on SIGSEGV) in order* to perform a fast memory check without other threads messing with memory. */
void bioKillThreads(void) {int err, j;for (j = 0; j < BIO_NUM_OPS; j++) {if (bio_threads[j] == pthread_self()) continue;if (bio_threads[j] && pthread_cancel(bio_threads[j]) == 0) {if ((err = pthread_join(bio_threads[j],NULL)) != 0) {serverLog(LL_WARNING,"Bio thread for job type #%d can not be joined: %s",j, strerror(err));} else {serverLog(LL_WARNING,"Bio thread for job type #%d terminated",j);}}}
}

这篇关于漫话Redis源码之七十八的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！


http://www.chinasem.cn/article/683878。

相关文章

JAVA智听未来一站式有声阅读平台听书系统小程序源码

JAVA智听未来一站式有声阅读平台听书系统小程序源码

智听未来，一站式有声阅读平台听书系统 🌟&nbsp;开篇：遇见未来，从“智听”开始 在这个快节奏的时代，你是否渴望在忙碌的间隙，找到一片属于自己的宁静角落？是否梦想着能随时随地，沉浸在知识的海洋，或是故事的奇幻世界里？今天，就让我带你一起探索“智听未来”——这一站式有声阅读平台听书系统，它正悄悄改变着我们的阅读方式，让未来触手可及！ 📚&nbsp;第一站：海量资源，应有尽有 走进“智听
阅读更多...
零基础学习Redis(10) -- zset类型命令使用

零基础学习Redis(10) -- zset类型命令使用

zset是有序集合，内部除了存储元素外，还会存储一个score，存储在zset中的元素会按照score的大小升序排列，不同元素的score可以重复，score相同的元素会按照元素的字典序排列。 1. zset常用命令 1.1 zadd  zadd key [NX | XX] [GT | LT]   [CH] [INCR] score member [score member ...]
阅读更多...
Java ArrayList扩容机制 （源码解读）

Java ArrayList扩容机制 （源码解读）

结论：初始长度为10，若所需长度小于1.5倍原长度，则按照1.5倍扩容。若不够用则按照所需长度扩容。 一. 明确类内部重要变量含义         1：数组默认长度         2:这是一个共享的空数组实例，用于明确创建长度为0时的ArrayList ，比如通过 new ArrayList<>(0)，ArrayList 内部的数组 elementData 会指向这个 EMPTY_EL
阅读更多...
如何在Visual Studio中调试.NET源码

如何在Visual Studio中调试.NET源码

今天偶然在看别人代码时，发现在他的代码里使用了Any判断List<T>是否为空。 我一般的做法是先判断是否为null，再判断Count。 看了一下Count的源码如下： 1 [__DynamicallyInvokable]2 public int Count3 {4 [__DynamicallyInvokable]5 get
阅读更多...
工厂ERP管理系统实现源码（JAVA）

工厂ERP管理系统实现源码（JAVA）

工厂进销存管理系统是一个集采购管理、仓库管理、生产管理和销售管理于一体的综合解决方案。该系统旨在帮助企业优化流程、提高效率、降低成本，并实时掌握各环节的运营状况。 在采购管理方面，系统能够处理采购订单、供应商管理和采购入库等流程，确保采购过程的透明和高效。仓库管理方面，实现库存的精准管理，包括入库、出库、盘点等操作，确保库存数据的准确性和实时性。 生产管理模块则涵盖了生产计划制定、物料需求计划、
阅读更多...
Spring 源码解读：自定义实现Bean定义的注册与解析

Spring 源码解读：自定义实现Bean定义的注册与解析

引言 在Spring框架中，Bean的注册与解析是整个依赖注入流程的核心步骤。通过Bean定义，Spring容器知道如何创建、配置和管理每个Bean实例。本篇文章将通过实现一个简化版的Bean定义注册与解析机制，帮助你理解Spring框架背后的设计逻辑。我们还将对比Spring中的BeanDefinition和BeanDefinitionRegistry，以全面掌握Bean注册和解析的核心原理。
阅读更多...
音视频入门基础：WAV专题（10）——FFmpeg源码中计算WAV音频文件每个packet的pts、dts的实现

音视频入门基础：WAV专题（10）——FFmpeg源码中计算WAV音频文件每个packet的pts、dts的实现

一、引言 从文章《音视频入门基础：WAV专题（6）——通过FFprobe显示WAV音频文件每个数据包的信息》中我们可以知道，通过FFprobe命令可以打印WAV音频文件每个packet（也称为数据包或多媒体包）的信息，这些信息包含该packet的pts、dts： 打印出来的“pts”实际是AVPacket结构体中的成员变量pts，是以AVStream->time_base为单位的显
阅读更多...
kubelet组件的启动流程源码分析

kubelet组件的启动流程源码分析

概述 摘要: 本文将总结kubelet的作用以及原理，在有一定基础认识的前提下，通过阅读kubelet源码，对kubelet组件的启动流程进行分析。 正文 kubelet的作用 这里对kubelet的作用做一个简单总结。 节点管理 节点的注册 节点状态更新 容器管理(pod生命周期管理) 监听apiserver的容器事件 容器的创建、删除(CRI) 容器的网络的创建与删除
阅读更多...
Redis中使用布隆过滤器解决缓存穿透问题

Redis中使用布隆过滤器解决缓存穿透问题

一、缓存穿透(失效)问题 缓存穿透是指查询一个一定不存在的数据，由于缓存中没有命中，会去数据库中查询，而数据库中也没有该数据，并且每次查询都不会命中缓存，从而每次请求都直接打到了数据库上，这会给数据库带来巨大压力。 二、布隆过滤器原理 布隆过滤器（Bloom Filter）是一种空间效率很高的随机数据结构，它利用多个不同的哈希函数将一个元素映射到一个位数组中的多个位置，并将这些位置的值置
阅读更多...
red5-server源码

red5-server源码

red5-server源码：https://github.com/Red5/red5-server
阅读更多...

Copyright China编程 23002807@qq.com

沪ICP备2023033072号-2