漫话Redis源码之八十三

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

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

触发并掩码掉给定的fd:

static int aeApiLookupPending(aeApiState *state, int fd) {uint_t i;for (i = 0; i < state->npending; i++) {if (state->pending_fds[i] == fd)return (i);}return (-1);
}/** Helper function to invoke port_associate for the given fd and mask.*/
static int aeApiAssociate(const char *where, int portfd, int fd, int mask) {int events = 0;int rv, err;if (mask & AE_READABLE)events |= POLLIN;if (mask & AE_WRITABLE)events |= POLLOUT;if (evport_debug)fprintf(stderr, "%s: port_associate(%d, 0x%x) = ", where, fd, events);rv = port_associate(portfd, PORT_SOURCE_FD, fd, events,(void *)(uintptr_t)mask);err = errno;if (evport_debug)fprintf(stderr, "%d (%s)\n", rv, rv == 0 ? "no error" : strerror(err));if (rv == -1) {fprintf(stderr, "%s: port_associate: %s\n", where, strerror(err));if (err == EAGAIN)fprintf(stderr, "aeApiAssociate: event port limit exceeded.");}return rv;
}static int aeApiAddEvent(aeEventLoop *eventLoop, int fd, int mask) {aeApiState *state = eventLoop->apidata;int fullmask, pfd;if (evport_debug)fprintf(stderr, "aeApiAddEvent: fd %d mask 0x%x\n", fd, mask);/** Since port_associate's "events" argument replaces any existing events, we* must be sure to include whatever events are already associated when* we call port_associate() again.*/fullmask = mask | eventLoop->events[fd].mask;pfd = aeApiLookupPending(state, fd);if (pfd != -1) {/** This fd was recently returned from aeApiPoll.  It should be safe to* assume that the consumer has processed that poll event, but we play* it safer by simply updating pending_mask.  The fd will be* re-associated as usual when aeApiPoll is called again.*/if (evport_debug)fprintf(stderr, "aeApiAddEvent: adding to pending fd %d\n", fd);state->pending_masks[pfd] |= fullmask;return 0;}return (aeApiAssociate("aeApiAddEvent", state->portfd, fd, fullmask));
}static void aeApiDelEvent(aeEventLoop *eventLoop, int fd, int mask) {aeApiState *state = eventLoop->apidata;int fullmask, pfd;if (evport_debug)fprintf(stderr, "del fd %d mask 0x%x\n", fd, mask);pfd = aeApiLookupPending(state, fd);if (pfd != -1) {if (evport_debug)fprintf(stderr, "deleting event from pending fd %d\n", fd);/** This fd was just returned from aeApiPoll, so it's not currently* associated with the port.  All we need to do is update* pending_mask appropriately.*/state->pending_masks[pfd] &= ~mask;if (state->pending_masks[pfd] == AE_NONE)state->pending_fds[pfd] = -1;return;}/** The fd is currently associated with the port.  Like with the add case* above, we must look at the full mask for the file descriptor before* updating that association.  We don't have a good way of knowing what the* events are without looking into the eventLoop state directly.  We rely on* the fact that our caller has already updated the mask in the eventLoop.*/fullmask = eventLoop->events[fd].mask;if (fullmask == AE_NONE) {/** We're removing *all* events, so use port_dissociate to remove the* association completely.  Failure here indicates a bug.*/if (evport_debug)fprintf(stderr, "aeApiDelEvent: port_dissociate(%d)\n", fd);if (port_dissociate(state->portfd, PORT_SOURCE_FD, fd) != 0) {perror("aeApiDelEvent: port_dissociate");abort(); /* will not return */}} else if (aeApiAssociate("aeApiDelEvent", state->portfd, fd,fullmask) != 0) {/** ENOMEM is a potentially transient condition, but the kernel won't* generally return it unless things are really bad.  EAGAIN indicates* we've reached a resource limit, for which it doesn't make sense to* retry (counter-intuitively).  All other errors indicate a bug.  In any* of these cases, the best we can do is to abort.*/abort(); /* will not return */}
}static int aeApiPoll(aeEventLoop *eventLoop, struct timeval *tvp) {aeApiState *state = eventLoop->apidata;struct timespec timeout, *tsp;uint_t mask, i;uint_t nevents;port_event_t event[MAX_EVENT_BATCHSZ];/** If we've returned fd events before, we must re-associate them with the* port now, before calling port_get().  See the block comment at the top of* this file for an explanation of why.*/for (i = 0; i < state->npending; i++) {if (state->pending_fds[i] == -1)/* This fd has since been deleted. */continue;if (aeApiAssociate("aeApiPoll", state->portfd,state->pending_fds[i], state->pending_masks[i]) != 0) {/* See aeApiDelEvent for why this case is fatal. */abort();}state->pending_masks[i] = AE_NONE;state->pending_fds[i] = -1;}state->npending = 0;if (tvp != NULL) {timeout.tv_sec = tvp->tv_sec;timeout.tv_nsec = tvp->tv_usec * 1000;tsp = &timeout;} else {tsp = NULL;}/** port_getn can return with errno == ETIME having returned some events (!).* So if we get ETIME, we check nevents, too.*/nevents = 1;if (port_getn(state->portfd, event, MAX_EVENT_BATCHSZ, &nevents,tsp) == -1 && (errno != ETIME || nevents == 0)) {if (errno == ETIME || errno == EINTR)return 0;/* Any other error indicates a bug. */perror("aeApiPoll: port_get");abort();}state->npending = nevents;for (i = 0; i < nevents; i++) {mask = 0;if (event[i].portev_events & POLLIN)mask |= AE_READABLE;if (event[i].portev_events & POLLOUT)mask |= AE_WRITABLE;eventLoop->fired[i].fd = event[i].portev_object;eventLoop->fired[i].mask = mask;if (evport_debug)fprintf(stderr, "aeApiPoll: fd %d mask 0x%x\n",(int)event[i].portev_object, mask);state->pending_fds[i] = event[i].portev_object;state->pending_masks[i] = (uintptr_t)event[i].portev_user;}return nevents;
}static char *aeApiName(void) {return "evport";
}

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



http://www.chinasem.cn/article/683881

相关文章

redis群集简单部署过程

《redis群集简单部署过程》文章介绍了Redis,一个高性能的键值存储系统,其支持多种数据结构和命令,它还讨论了Redis的服务器端架构、数据存储和获取、协议和命令、高可用性方案、缓存机制以及监控和... 目录Redis介绍1. 基本概念2. 服务器端3. 存储和获取数据4. 协议和命令5. 高可用性6.

Redis的数据过期策略和数据淘汰策略

《Redis的数据过期策略和数据淘汰策略》本文主要介绍了Redis的数据过期策略和数据淘汰策略,文中通过示例代码介绍的非常详细,对大家的学习或者工作具有一定的参考学习价值,需要的朋友们下面随着小编来一... 目录一、数据过期策略1、惰性删除2、定期删除二、数据淘汰策略1、数据淘汰策略概念2、8种数据淘汰策略

Redis存储的列表分页和检索的实现方法

《Redis存储的列表分页和检索的实现方法》在Redis中,列表(List)是一种有序的数据结构,通常用于存储一系列元素,由于列表是有序的,可以通过索引来访问元素,因此可以很方便地实现分页和检索功能,... 目录一、Redis 列表的基本操作二、分页实现三、检索实现3.1 方法 1:客户端过滤3.2 方法

Python中操作Redis的常用方法小结

《Python中操作Redis的常用方法小结》这篇文章主要为大家详细介绍了Python中操作Redis的常用方法,文中的示例代码简洁易懂,具有一定的借鉴价值,有需要的小伙伴可以了解一下... 目录安装Redis开启、关闭Redisredis数据结构redis-cli操作安装redis-py数据库连接和释放增

redis防止短信恶意调用的实现

《redis防止短信恶意调用的实现》本文主要介绍了在场景登录或注册接口中使用短信验证码时遇到的恶意调用问题,并通过使用Redis分布式锁来解决,具有一定的参考价值,感兴趣的可以了解一下... 目录1.场景2.排查3.解决方案3.1 Redis锁实现3.2 方法调用1.场景登录或注册接口中,使用短信验证码场

Redis 多规则限流和防重复提交方案实现小结

《Redis多规则限流和防重复提交方案实现小结》本文主要介绍了Redis多规则限流和防重复提交方案实现小结,包括使用String结构和Zset结构来记录用户IP的访问次数,具有一定的参考价值,感兴趣... 目录一:使用 String 结构记录固定时间段内某用户 IP 访问某接口的次数二:使用 Zset 进行

解读Redis秒杀优化方案(阻塞队列+基于Stream流的消息队列)

《解读Redis秒杀优化方案(阻塞队列+基于Stream流的消息队列)》该文章介绍了使用Redis的阻塞队列和Stream流的消息队列来优化秒杀系统的方案,通过将秒杀流程拆分为两条流水线,使用Redi... 目录Redis秒杀优化方案(阻塞队列+Stream流的消息队列)什么是消息队列?消费者组的工作方式每

Redis如何使用zset处理排行榜和计数问题

《Redis如何使用zset处理排行榜和计数问题》Redis的ZSET数据结构非常适合处理排行榜和计数问题,它可以在高并发的点赞业务中高效地管理点赞的排名,并且由于ZSET的排序特性,可以轻松实现根据... 目录Redis使用zset处理排行榜和计数业务逻辑ZSET 数据结构优化高并发的点赞操作ZSET 结

Redis的Zset类型及相关命令详细讲解

《Redis的Zset类型及相关命令详细讲解》:本文主要介绍Redis的Zset类型及相关命令的相关资料,有序集合Zset是一种Redis数据结构,它类似于集合Set,但每个元素都有一个关联的分数... 目录Zset简介ZADDZCARDZCOUNTZRANGEZREVRANGEZRANGEBYSCOREZ

Go中sync.Once源码的深度讲解

《Go中sync.Once源码的深度讲解》sync.Once是Go语言标准库中的一个同步原语,用于确保某个操作只执行一次,本文将从源码出发为大家详细介绍一下sync.Once的具体使用,x希望对大家有... 目录概念简单示例源码解读总结概念sync.Once是Go语言标准库中的一个同步原语,用于确保某个操