summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorisaacs <i@izs.me>2013-01-23 17:52:45 -0800
committerisaacs <i@izs.me>2013-01-24 07:49:27 -0800
commit782149ddc3c7a0ab8e72ad8afc3eb891ea0a6aef (patch)
treee9f6dfdd0f4d6930547d499f8388a13c920a2605
parent444bbd4fa7315423a6b55aba0e0c12ea6534b2cb (diff)
downloadnode-new-782149ddc3c7a0ab8e72ad8afc3eb891ea0a6aef.tar.gz
streams2: Handle sync read callbacks nicely
-rw-r--r--lib/_stream_readable.js39
-rw-r--r--test/simple/test-stream2-read-sync-stack.js54
2 files changed, 77 insertions, 16 deletions
diff --git a/lib/_stream_readable.js b/lib/_stream_readable.js
index a5921805c6..f57be90fcc 100644
--- a/lib/_stream_readable.js
+++ b/lib/_stream_readable.js
@@ -286,16 +286,9 @@ function onread(stream, er, chunk) {
// if we've ended and we have some data left, then emit
// 'readable' now to make sure it gets picked up.
- if (!sync) {
- if (state.length > 0) {
- state.needReadable = false;
- if (!state.emittedReadable) {
- state.emittedReadable = true;
- stream.emit('readable');
- }
- } else
- endReadable(stream);
- } else
+ if (state.length > 0)
+ emitReadable(stream);
+ else
endReadable(stream);
return;
}
@@ -320,15 +313,29 @@ function onread(stream, er, chunk) {
return;
}
- if (state.needReadable && !sync) {
- state.needReadable = false;
- if (!state.emittedReadable) {
- state.emittedReadable = true;
- stream.emit('readable');
- }
+ // Don't emit readable right away in sync mode, because this can trigger
+ // another read() call => stack overflow. This way, it might trigger
+ // a nextTick recursion warning, but that's not so bad.
+ if (state.needReadable) {
+ if (!sync)
+ emitReadable(stream);
+ else
+ process.nextTick(function() {
+ emitReadable(stream);
+ });
}
}
+function emitReadable(stream) {
+ var state = stream._readableState;
+ state.needReadable = false;
+ if (state.emittedReadable)
+ return;
+
+ state.emittedReadable = true;
+ stream.emit('readable');
+}
+
// abstract method. to be overridden in specific implementation classes.
// call cb(er, data) where data is <= n in length.
// for virtual (non-string, non-buffer) streams, "length" is somewhat
diff --git a/test/simple/test-stream2-read-sync-stack.js b/test/simple/test-stream2-read-sync-stack.js
new file mode 100644
index 0000000000..4e5ab17295
--- /dev/null
+++ b/test/simple/test-stream2-read-sync-stack.js
@@ -0,0 +1,54 @@
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// Permission is hereby granted, free of charge, to any person obtaining a
+// copy of this software and associated documentation files (the
+// "Software"), to deal in the Software without restriction, including
+// without limitation the rights to use, copy, modify, merge, publish,
+// distribute, sublicense, and/or sell copies of the Software, and to permit
+// persons to whom the Software is furnished to do so, subject to the
+// following conditions:
+//
+// The above copyright notice and this permission notice shall be included
+// in all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
+// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
+// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
+// USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+var common = require('../common');
+var assert = require('assert');
+var Readable = require('stream').Readable;
+var r = new Readable();
+var N = 256 * 1024;
+
+// Go ahead and allow the pathological case for this test.
+// Yes, it's an infinite loop, that's the point.
+process.maxTickDepth = N + 2;
+
+var reads = 0;
+r._read = function(n, cb) {
+ var chunk = reads++ === N ? null : new Buffer(1);
+ cb(null, chunk);
+};
+
+r.on('readable', function onReadable() {
+ if (!(r._readableState.length % 256))
+ console.error('readable', r._readableState.length);
+ r.read(N * 2);
+});
+
+var ended = false;
+r.on('end', function onEnd() {
+ ended = true;
+});
+
+r.read(0);
+
+process.on('exit', function() {
+ assert(ended);
+ console.log('ok');
+});