Home
last modified time | relevance | path

Searched refs:branch2 (Results 1 - 7 of 7) sorted by relevance

/third_party/node/test/fixtures/wpt/streams/readable-streams/
H A Dpatched-global.any.js37 const [branch1, branch2] = rs.tee();
39 assert_true(isReadableStream(branch2), 'branch2 should be a ReadableStream');
55 const [branch1, branch2] = rs.tee();
58 assert_true(isReadableStream(branch2), 'branch2 should be a ReadableStream');
120 const [branch1, branch2] = new ReadableStream().tee();
122 assert_true(isReadableStream(branch2), 'branch2 should be a ReadableStream');
/third_party/node/test/fixtures/wpt/streams/piping/
H A Dthen-interception.any.js55 const [ branch1, branch2 ] = rs.tee();
64 branch2.cancel();
/third_party/node/test/fixtures/wpt/streams/resources/
H A Drs-test-templates.js651 const [branch1, branch2] = rs.tee();
654 branch2.cancel(reason2),
675 const [branch1, branch2] = rs.tee();
677 branch2.cancel(reason2),
693 const [branch1, branch2] = rs.tee();
696 promise_rejects_exactly(t, theError, branch2.cancel())
711 const [branch1, branch2] = stream.tee();
716 promise_rejects_exactly(t, theError, branch2.cancel())
/third_party/node/deps/v8/src/compiler/
H A Djs-typed-lowering.cc1286 Node* branch2 = graph()->NewNode(common()->Branch(), check2, control); in ReduceJSHasInPrototypeChain() local
1288 Node* if_true2 = graph()->NewNode(common()->IfTrue(), branch2); in ReduceJSHasInPrototypeChain()
1292 control = graph()->NewNode(common()->IfFalse(), branch2); in ReduceJSHasInPrototypeChain()
H A Dsimplified-lowering.cc4683 Node* branch2 = graph()->NewNode(common()->Branch(), check2, if_false1); in Int32Div() local
4685 Node* if_true2 = graph()->NewNode(common()->IfTrue(), branch2); in Int32Div()
4688 Node* if_false2 = graph()->NewNode(common()->IfFalse(), branch2); in Int32Div()
4759 Node* branch2 = graph()->NewNode(common()->Branch(BranchHint::kFalse), in Int32Mod() local
4762 Node* if_true2 = graph()->NewNode(common()->IfTrue(), branch2); in Int32Mod()
4769 Node* if_false2 = graph()->NewNode(common()->IfFalse(), branch2); in Int32Mod()
H A Djs-call-reducer.cc5936 Node* branch2 = graph()->NewNode(common()->Branch(), check2, loop);
5938 if_true1 = graph()->NewNode(common()->IfFalse(), branch2);
5941 Node* control2 = graph()->NewNode(common()->IfTrue(), branch2);
H A Dwasm-compiler.cc2821 Node* branch2 = in BuildI32AsmjsRemS() local
2824 Node* if_true2 = graph()->NewNode(c->IfTrue(), branch2); in BuildI32AsmjsRemS()
2830 Node* if_false2 = graph()->NewNode(c->IfFalse(), branch2); in BuildI32AsmjsRemS()

Completed in 37 milliseconds