예제 #1
0
 protected void implDereg(SelectionKeyImpl ski) throws IOException {
   // Algorithm: Copy the sc from the end of the list and put it into
   // the location of the sc to be removed (since order doesn't
   // matter). Decrement the sc count. Update the index of the sc
   // that is moved.
   int i = ski.getIndex();
   assert (i >= 0);
   if (i != totalChannels - 1) {
     // Copy end one over it
     SelectionKeyImpl endChannel = channelArray[totalChannels - 1];
     channelArray[i] = endChannel;
     endChannel.setIndex(i);
     pollWrapper.release(i);
     PollArrayWrapper.replaceEntry(pollWrapper, totalChannels - 1, pollWrapper, i);
   } else {
     pollWrapper.release(i);
   }
   // Destroy the last one
   channelArray[totalChannels - 1] = null;
   totalChannels--;
   pollWrapper.totalChannels--;
   ski.setIndex(-1);
   // Remove the key from keys and selectedKeys
   keys.remove(ski);
   selectedKeys.remove(ski);
   deregister((AbstractSelectionKey) ski);
   SelectableChannel selch = ski.channel();
   if (!selch.isOpen() && !selch.isRegistered()) ((SelChImpl) selch).kill();
 }
예제 #2
0
 protected void implClose() throws IOException {
   synchronized (closeLock) {
     if (closed) return;
     closed = true;
     // Deregister channels
     for (int i = channelOffset; i < totalChannels; i++) {
       SelectionKeyImpl ski = channelArray[i];
       assert (ski.getIndex() != -1);
       ski.setIndex(-1);
       deregister(ski);
       SelectableChannel selch = channelArray[i].channel();
       if (!selch.isOpen() && !selch.isRegistered()) ((SelChImpl) selch).kill();
     }
     implCloseInterrupt();
     pollWrapper.free();
     pollWrapper = null;
     selectedKeys = null;
     channelArray = null;
     totalChannels = 0;
   }
 }