Skip to content
GitLab
Menu
Projects
Groups
Snippets
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
Menu
Open sidebar
ruanhaishen
redis
Commits
a7dbe37d
Commit
a7dbe37d
authored
Jun 07, 2018
by
antirez
Browse files
Typo: entires -> entries in several places.
parent
dfb3bf1b
Changes
3
Hide whitespace changes
Inline
Side-by-side
src/cluster.c
View file @
a7dbe37d
...
@@ -2377,7 +2377,7 @@ void clusterSendPing(clusterLink *link, int type) {
...
@@ -2377,7 +2377,7 @@ void clusterSendPing(clusterLink *link, int type) {
* same time.
* same time.
*
*
* Since we have non-voting slaves that lower the probability of an entry
* Since we have non-voting slaves that lower the probability of an entry
* to feature our node, we set the number of ent
i
res per packet as
* to feature our node, we set the number of entr
i
es per packet as
* 10% of the total nodes we have. */
* 10% of the total nodes we have. */
wanted
=
floor
(
dictSize
(
server
.
cluster
->
nodes
)
/
10
);
wanted
=
floor
(
dictSize
(
server
.
cluster
->
nodes
)
/
10
);
if
(
wanted
<
3
)
wanted
=
3
;
if
(
wanted
<
3
)
wanted
=
3
;
...
...
src/t_stream.c
View file @
a7dbe37d
...
@@ -222,7 +222,7 @@ int streamAppendItem(stream *s, robj **argv, int numfields, streamID *added_id,
...
@@ -222,7 +222,7 @@ int streamAppendItem(stream *s, robj **argv, int numfields, streamID *added_id,
* +-------+---------+------------+---------+--/--+---------+---------+-+
* +-------+---------+------------+---------+--/--+---------+---------+-+
*
*
* count and deleted just represent respectively the total number of
* count and deleted just represent respectively the total number of
* ent
i
res inside the listpack that are valid, and marked as deleted
* entr
i
es inside the listpack that are valid, and marked as deleted
* (delted flag in the entry flags set). So the total number of items
* (delted flag in the entry flags set). So the total number of items
* actually inside the listpack (both deleted and not) is count+deleted.
* actually inside the listpack (both deleted and not) is count+deleted.
*
*
...
@@ -235,7 +235,7 @@ int streamAppendItem(stream *s, robj **argv, int numfields, streamID *added_id,
...
@@ -235,7 +235,7 @@ int streamAppendItem(stream *s, robj **argv, int numfields, streamID *added_id,
*
*
* The "0" entry at the end is the same as the 'lp-count' entry in the
* The "0" entry at the end is the same as the 'lp-count' entry in the
* regular stream entries (see below), and marks the fact that there are
* regular stream entries (see below), and marks the fact that there are
* no more ent
i
res, when we scan the stream from right to left. */
* no more entr
i
es, when we scan the stream from right to left. */
/* First of all, check if we can append to the current macro node or
/* First of all, check if we can append to the current macro node or
* if we need to switch to the next one. 'lp' will be set to NULL if
* if we need to switch to the next one. 'lp' will be set to NULL if
...
@@ -832,7 +832,7 @@ void streamPropagateXCLAIM(client *c, robj *key, robj *group, robj *id, streamNA
...
@@ -832,7 +832,7 @@ void streamPropagateXCLAIM(client *c, robj *key, robj *group, robj *id, streamNA
* Note that this function is recursive in certian cases. When it's called
* Note that this function is recursive in certian cases. When it's called
* with a non NULL group and consumer argument, it may call
* with a non NULL group and consumer argument, it may call
* streamReplyWithRangeFromConsumerPEL() in order to get entries from the
* streamReplyWithRangeFromConsumerPEL() in order to get entries from the
* consumer pending ent
i
res list. However such a function will then call
* consumer pending entr
i
es list. However such a function will then call
* streamReplyWithRange() in order to emit single entries (found in the
* streamReplyWithRange() in order to emit single entries (found in the
* PEL by ID) to the client. This is the use case for the STREAM_RWR_RAWENTRIES
* PEL by ID) to the client. This is the use case for the STREAM_RWR_RAWENTRIES
* flag.
* flag.
...
@@ -1840,7 +1840,7 @@ void xpendingCommand(client *c) {
...
@@ -1840,7 +1840,7 @@ void xpendingCommand(client *c) {
* becomes the specified <consumer>. If the minimum idle time specified
* becomes the specified <consumer>. If the minimum idle time specified
* is zero, messages are claimed regardless of their idle time.
* is zero, messages are claimed regardless of their idle time.
*
*
* All the messages that cannot be found inside the pending ent
i
res list
* All the messages that cannot be found inside the pending entr
i
es list
* are ignored, but in case the FORCE option is used. In that case we
* are ignored, but in case the FORCE option is used. In that case we
* create the NACK (representing a not yet acknowledged message) entry in
* create the NACK (representing a not yet acknowledged message) entry in
* the consumer group PEL.
* the consumer group PEL.
...
...
src/ziplist.c
View file @
a7dbe37d
...
@@ -27,7 +27,7 @@
...
@@ -27,7 +27,7 @@
* traversal.
* traversal.
*
*
* <uint16_t zllen> is the number of entries. When there are more than
* <uint16_t zllen> is the number of entries. When there are more than
* 2^16-2 ent
i
res, this value is set to 2^16-1 and we need to traverse the
* 2^16-2 entr
i
es, this value is set to 2^16-1 and we need to traverse the
* entire list to know how many items it holds.
* entire list to know how many items it holds.
*
*
* <uint8_t zlend> is a special entry representing the end of the ziplist.
* <uint8_t zlend> is a special entry representing the end of the ziplist.
...
@@ -256,7 +256,7 @@
...
@@ -256,7 +256,7 @@
#define ZIPLIST_ENTRY_END(zl) ((zl)+intrev32ifbe(ZIPLIST_BYTES(zl))-1)
#define ZIPLIST_ENTRY_END(zl) ((zl)+intrev32ifbe(ZIPLIST_BYTES(zl))-1)
/* Increment the number of items field in the ziplist header. Note that this
/* Increment the number of items field in the ziplist header. Note that this
* macro should never overflow the unsigned 16 bit integer, since ent
i
res are
* macro should never overflow the unsigned 16 bit integer, since entr
i
es are
* always pushed one at a time. When UINT16_MAX is reached we want the count
* always pushed one at a time. When UINT16_MAX is reached we want the count
* to stay there to signal that a full scan is needed to get the number of
* to stay there to signal that a full scan is needed to get the number of
* items inside the ziplist. */
* items inside the ziplist. */
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment