Skip to content
Projects
Groups
Snippets
Help
Loading...
Sign in / Register
Toggle navigation
L
libzmq
Project
Project
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Packages
Packages
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
submodule
libzmq
Commits
21e20127
Commit
21e20127
authored
Aug 27, 2014
by
Martin Hurton
Browse files
Options
Browse Files
Download
Plain Diff
Merge pull request #1171 from hintjens/master
Problem: nodrop code is ugly
parents
128bed47
f15146b5
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
13 additions
and
18 deletions
+13
-18
xpub.cpp
src/xpub.cpp
+13
-18
No files found.
src/xpub.cpp
View file @
21e20127
...
...
@@ -132,25 +132,20 @@ int zmq::xpub_t::xsend (msg_t *msg_)
subscriptions
.
match
((
unsigned
char
*
)
msg_
->
data
(),
msg_
->
size
(),
mark_as_matching
,
this
);
if
(
lossy
==
false
&&
!
dist
.
check_hwm
())
{
errno
=
EAGAIN
;
return
-
1
;
int
rc
=
-
1
;
// Assume we fail
if
(
lossy
||
dist
.
check_hwm
())
{
if
(
dist
.
send_to_matching
(
msg_
)
==
0
)
{
// If we are at the end of multi-part message we can mark
// all the pipes as non-matching.
if
(
!
msg_more
)
dist
.
unmatch
();
more
=
msg_more
;
rc
=
0
;
// Yay, sent successfully
}
}
// Send the message to all the pipes that were marked as matching
// in the previous step.
int
rc
=
dist
.
send_to_matching
(
msg_
);
if
(
rc
!=
0
)
return
rc
;
// If we are at the end of multi-part message we can mark all the pipes
// as non-matching.
if
(
!
msg_more
)
dist
.
unmatch
();
more
=
msg_more
;
return
0
;
else
errno
=
EAGAIN
;
return
rc
;
}
bool
zmq
::
xpub_t
::
xhas_out
()
...
...
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