【面試題】一文講清,為啥redis單線程還有很高的性能?
面試的時(shí)候如果聊到緩存,肯定會(huì)聊到redis,因?yàn)樗F(xiàn)在是緩存事實(shí)上的標(biāo)準(zhǔn)。
早些年一些互聯(lián)網(wǎng)公司會(huì)用到memcached作為緩存,它是多線程的,用c語(yǔ)言開(kāi)發(fā),不過(guò)現(xiàn)在基本很少了,有興趣的同學(xué)可以學(xué)習(xí)下它的源碼。
那么聊redis,第一個(gè)問(wèn)題就是它的工作原理,redis最最重要的工作原理,就是它的線程模型。
redis是單線程、nio、異步的線程模型,你要是這個(gè)都不知道,工作中用到redis,出了問(wèn)題都不知道如何入手排查。
學(xué)習(xí)redis線程模型之前,必須了解socket網(wǎng)絡(luò)編程相關(guān)知識(shí),如果你不懂socket,肯定搞不懂redis原理。
redis使用文件事件處理器(file event handler)處理所有事件,這個(gè)文件事件處理器是單線程的,所以redis才叫單線程的。
文件事件處理器采用IO多路復(fù)用器,同時(shí)監(jiān)聽(tīng)多個(gè)socket,將產(chǎn)生事件的socket放入內(nèi)存隊(duì)列中,事件分發(fā)器根據(jù)socket上的事件類(lèi)型,選擇對(duì)應(yīng)的事件處理器進(jìn)行處理。

圖1 redis 文件事件處理器過(guò)程
文件事件處理器的結(jié)構(gòu)包含 4 個(gè)部分:
客戶(hù)端socket IO 多路復(fù)用器 文件事件分派器 事件處理器(連接應(yīng)答處理器、命令請(qǐng)求處理器、命令回復(fù)處理器)
連接應(yīng)答處理器
在redis server啟動(dòng)的時(shí)候,會(huì)設(shè)置客戶(hù)端建立連接時(shí)的連接應(yīng)答處理器acceptTcpHandler,并和服務(wù)器監(jiān)聽(tīng)套接字的AE_READABLE 事件關(guān)聯(lián)起來(lái),具體代碼在server.c的initServer方法中:

在networking.c 文件中acceptTcpHandler方法實(shí)現(xiàn)中,redis的連接應(yīng)答處理器,用于對(duì)連接服務(wù)器進(jìn)行監(jiān)聽(tīng),對(duì)套接字的客戶(hù)端進(jìn)行應(yīng)答相應(yīng)。
void acceptTcpHandler(aeEventLoop *el, int fd, void *privdata, int mask) {int cport, cfd, max = MAX_ACCEPTS_PER_CALL;char cip[NET_IP_STR_LEN];UNUSED(el);UNUSED(mask);UNUSED(privdata);//循環(huán)處理連接應(yīng)答while(max--) {cfd = anetTcpAccept(server.neterr, fd, cip, sizeof(cip), &cport);if (cfd == ANET_ERR) {if (errno != EWOULDBLOCK)serverLog(LL_WARNING,"Accepting client connection: %s", server.neterr);return;}serverLog(LL_VERBOSE,"Accepted %s:%d", cip, cport);acceptCommonHandler(connCreateAcceptedSocket(cfd),0,cip);}}
連接應(yīng)答處理器

void readQueryFromClient(aeEventLoop *el, int fd, void *privdata, int mask) {client *c = (client*) privdata;int nread, readlen;size_t qblen;UNUSED(el);UNUSED(mask);readlen = PROTO_IOBUF_LEN;/* If this is a multi bulk request, and we are processing a bulk reply* that is large enough, try to maximize the probability that the query* buffer contains exactly the SDS string representing the object, even* at the risk of requiring more read(2) calls. This way the function* processMultiBulkBuffer() can avoid copying buffers to create the* Redis Object representing the argument. */if (c->reqtype == PROTO_REQ_MULTIBULK && c->multibulklen && c->bulklen != -1&& c->bulklen >= PROTO_MBULK_BIG_ARG){ssize_t remaining = (size_t)(c->bulklen+2)-sdslen(c->querybuf);/* Note that the 'remaining' variable may be zero in some edge case,* for example once we resume a blocked client after CLIENT PAUSE. */if (remaining > 0 && remaining < readlen) readlen = remaining;}qblen = sdslen(c->querybuf);if (c->querybuf_peak < qblen) c->querybuf_peak = qblen;c->querybuf = sdsMakeRoomFor(c->querybuf, readlen);nread = read(fd, c->querybuf+qblen, readlen);if (nread == -1) {if (errno == EAGAIN) {return;} else {serverLog(LL_VERBOSE, "Reading from client: %s",strerror(errno));freeClient(c);return;}} else if (nread == 0) {serverLog(LL_VERBOSE, "Client closed connection");freeClient(c);return;} else if (c->flags & CLIENT_MASTER) {/* Append the query buffer to the pending (not applied) buffer* of the master. We'll use this buffer later in order to have a* copy of the string applied by the last command executed. */c->pending_querybuf = sdscatlen(c->pending_querybuf,c->querybuf+qblen,nread);}sdsIncrLen(c->querybuf,nread);c->lastinteraction = server.unixtime;if (c->flags & CLIENT_MASTER) c->read_reploff += nread;server.stat_net_input_bytes += nread;if (sdslen(c->querybuf) > server.client_max_querybuf_len) {sds ci = catClientInfoString(sdsempty(),c), bytes = sdsempty();bytes = sdscatrepr(bytes,c->querybuf,64);serverLog(LL_WARNING,"Closing client that reached max query buffer length: %s (qbuf initial bytes: %s)", ci, bytes);sdsfree(ci);sdsfree(bytes);freeClient(c);return;}/* Time to process the buffer. If the client is a master we need to* compute the difference between the applied offset before and after* processing the buffer, to understand how much of the replication stream* was actually applied to the master state: this quantity, and its* corresponding part of the replication stream, will be propagated to* the sub-slaves and to the replication backlog. */processInputBufferAndReplicate(c);}void processInputBufferAndReplicate(client *c) {if (!(c->flags & CLIENT_MASTER)) {processInputBuffer(c);} else {size_t prev_offset = c->reploff;processInputBuffer(c);size_t applied = c->reploff - prev_offset;if (applied) {replicationFeedSlavesFromMasterStream(server.slaves,c->pending_querybuf, applied);sdsrange(c->pending_querybuf,applied,-1);}}}
命令回復(fù)處理器


有道無(wú)術(shù),術(shù)可成;有術(shù)無(wú)道,止于術(shù)
歡迎大家關(guān)注Java之道公眾號(hào)
好文章,我在看??
