1 /* SocketRepository.java -- 2 Copyright (C) 2005 Free Software Foundation, Inc. 3 4 This file is part of GNU Classpath. 5 6 GNU Classpath is free software; you can redistribute it and/or modify 7 it under the terms of the GNU General Public License as published by 8 the Free Software Foundation; either version 2, or (at your option) 9 any later version. 10 11 GNU Classpath is distributed in the hope that it will be useful, but 12 WITHOUT ANY WARRANTY; without even the implied warranty of 13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 14 General Public License for more details. 15 16 You should have received a copy of the GNU General Public License 17 along with GNU Classpath; see the file COPYING. If not, write to the 18 Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 19 02110-1301 USA. 20 21 Linking this library statically or dynamically with other modules is 22 making a combined work based on this library. Thus, the terms and 23 conditions of the GNU General Public License cover the whole 24 combination. 25 26 As a special exception, the copyright holders of this library give you 27 permission to link this library with independent modules to produce an 28 executable, regardless of the license terms of these independent 29 modules, and to copy and distribute the resulting executable under 30 terms of your choice, provided that you also meet, for each linked 31 independent module, the terms and conditions of the license of that 32 module. An independent module is a module which is not derived from 33 or based on this library. If you modify this library, you may extend 34 this exception to your version of the library, but you are not 35 obligated to do so. If you do not wish to do so, delete this 36 exception statement from your version. */ 37 38 39 package gnu.CORBA; 40 41 import java.net.Socket; 42 import java.net.SocketException; 43 import java.util.Hashtable; 44 import java.util.Iterator; 45 import java.util.Map; 46 47 /** 48 * This class caches the opened sockets that are reused during the 49 * frequent calls. Otherwise, some CORBA applications may spend 50 * up to 90 % of the working time just for closing and opening the sockets. 51 * 52 * @author Audrius Meskauskas, Lithuania (AudriusA@Bioinformatics.org) 53 */ 54 public class SocketRepository 55 { 56 /** 57 * The socket map. 58 */ 59 private static Hashtable sockets = new Hashtable(); 60 61 /** 62 * Put a socket. This method also discards all not reusable sockets from 63 * the map. 64 * 65 * @param key as socket key. 66 * 67 * @param s a socket. 68 */ put_socket(Object key, Socket s)69 public static void put_socket(Object key, Socket s) 70 { 71 sockets.put(key, s); 72 gc(); 73 } 74 75 /** 76 * Removes all non reusable sockets. 77 */ gc()78 public static void gc() 79 { 80 Iterator iter = sockets.entrySet().iterator(); 81 82 Map.Entry e; 83 Socket sx; 84 85 while (iter.hasNext()) 86 { 87 e = (Map.Entry) iter.next(); 88 sx = (Socket) e.getValue(); 89 90 if (not_reusable(sx)) 91 iter.remove(); 92 } 93 } 94 95 /** 96 * Return true if the socket is no longer reusable. 97 */ not_reusable(Socket s)98 static boolean not_reusable(Socket s) 99 { 100 return (s.isClosed() || !s.isBound() || !s.isConnected() || 101 s.isInputShutdown() || s.isOutputShutdown()); 102 } 103 104 /** 105 * Get a socket. 106 * 107 * @param key a socket key. 108 * 109 * @return an opened socket for reuse, null if no such available or it is 110 * closed, its input or output has been shutown or otherwise the socket 111 * is not reuseable. 112 */ get_socket(Object key)113 public static Socket get_socket(Object key) 114 { 115 if (true) 116 return null; 117 118 Socket s = (Socket) sockets.get(key); 119 if (s == null) 120 return null; 121 122 // Ensure that the socket is fully reusable. 123 else if (not_reusable(s)) 124 { 125 sockets.remove(key); 126 return null; 127 } 128 else 129 { 130 try 131 { 132 // Set one minute time out that will be changed later. 133 s.setSoTimeout(60*1000); 134 } 135 catch (SocketException e) 136 { 137 s = null; 138 } 139 140 sockets.remove(key); 141 return s; 142 } 143 } 144 }