undefect. CWE-407 — 63 sites patched across 27 ecosystems
Authors: russell@unturf.com · brackishbert@gmail.com · foxhop.net · TimeHexOn.com Patches, unit tests, benchmarks, whitepaper, and outreach briefs. Public domain — no copyright claimed. Use freely.
This commit is contained in:
commit
0a580b313d
70422 changed files with 17213626 additions and 0 deletions
95
test/jdk/java/nio/channels/Selector/Connect.java
Normal file
95
test/jdk/java/nio/channels/Selector/Connect.java
Normal file
|
|
@ -0,0 +1,95 @@
|
|||
/*
|
||||
* Copyright (c) 2001, 2018, Oracle and/or its affiliates. All rights reserved.
|
||||
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||
*
|
||||
* This code is free software; you can redistribute it and/or modify it
|
||||
* under the terms of the GNU General Public License version 2 only, as
|
||||
* published by the Free Software Foundation.
|
||||
*
|
||||
* This code is distributed in the hope that it will be useful, but WITHOUT
|
||||
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
||||
* version 2 for more details (a copy is included in the LICENSE file that
|
||||
* accompanied this code).
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License version
|
||||
* 2 along with this work; if not, write to the Free Software Foundation,
|
||||
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||
*
|
||||
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
||||
* or visit www.oracle.com if you need additional information or have any
|
||||
* questions.
|
||||
*/
|
||||
|
||||
/* @test
|
||||
* @bug 4511624
|
||||
* @summary Test Making lots of Selectors
|
||||
* @library .. /test/lib
|
||||
* @build jdk.test.lib.Utils TestServers
|
||||
* @run main Connect
|
||||
*/
|
||||
|
||||
import java.net.*;
|
||||
import java.nio.*;
|
||||
import java.nio.channels.*;
|
||||
import java.nio.channels.spi.SelectorProvider;
|
||||
import java.util.*;
|
||||
|
||||
public class Connect {
|
||||
|
||||
static int success = 0;
|
||||
static int LIMIT = 100;
|
||||
|
||||
public static void main(String[] args) throws Exception {
|
||||
try (TestServers.DayTimeServer daytimeServer
|
||||
= TestServers.DayTimeServer.startNewServer(50)) {
|
||||
scaleTest(daytimeServer);
|
||||
}
|
||||
}
|
||||
|
||||
static void scaleTest(TestServers.DayTimeServer daytimeServer)
|
||||
throws Exception
|
||||
{
|
||||
InetAddress myAddress = daytimeServer.getAddress();
|
||||
InetSocketAddress isa
|
||||
= new InetSocketAddress(myAddress, daytimeServer.getPort());
|
||||
|
||||
for (int j=0; j<LIMIT; j++) {
|
||||
SocketChannel sc = SocketChannel.open();
|
||||
sc.configureBlocking(false);
|
||||
boolean connected = sc.connect(isa);
|
||||
if (!connected) {
|
||||
Selector RSelector = SelectorProvider.provider().openSelector();
|
||||
SelectionKey RKey = sc.register (RSelector, SelectionKey.OP_CONNECT);
|
||||
while (!connected) {
|
||||
int keysAdded = RSelector.select(100);
|
||||
if (keysAdded > 0) {
|
||||
Set<SelectionKey> readyKeys = RSelector.selectedKeys();
|
||||
Iterator<SelectionKey> i = readyKeys.iterator();
|
||||
while (i.hasNext()) {
|
||||
SelectionKey sk = i.next();
|
||||
SocketChannel nextReady = (SocketChannel)sk.channel();
|
||||
connected = nextReady.finishConnect();
|
||||
}
|
||||
readyKeys.clear();
|
||||
}
|
||||
}
|
||||
RSelector.close();
|
||||
}
|
||||
readAndClose(sc);
|
||||
}
|
||||
}
|
||||
|
||||
static void readAndClose(SocketChannel sc) throws Exception {
|
||||
ByteBuffer bb = ByteBuffer.allocateDirect(100);
|
||||
int n = 0;
|
||||
while (n == 0) // Note this is not a rigorous check for done reading
|
||||
n = sc.read(bb);
|
||||
//bb.position(bb.position() - 2);
|
||||
//bb.flip();
|
||||
//CharBuffer cb = Charset.forName("US-ASCII").newDecoder().decode(bb);
|
||||
//System.out.println("Received: \"" + cb + "\"");
|
||||
sc.close();
|
||||
success++;
|
||||
}
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue