zoukankan      html  css  js  c++  java
  • 获取可用端口(转载)

    http://blog.csdn.net/hnpzhili/article/details/6234906 

    /// <summary>
            /// 获取第一个可用的端口号
            /// </summary>
            /// <returns></returns>
            public static int GetFirstAvailablePort()
            {
                int MAX_PORT = 65535; //系统tcp/udp端口数最大是65535            
                int BEGIN_PORT = 5000;//从这个端口开始检测

                for (int i = BEGIN_PORT; i < MAX_PORT; i++)
                {
                    if (PortIsAvailable(i)) return i;
                }

                return -1;
            }

            /// <summary>
            /// 获取操作系统已用的端口号
            /// </summary>
            /// <returns></returns>
            public static IList PortIsUsed()
            {
                //获取本地计算机的网络连接和通信统计数据的信息
                IPGlobalProperties ipGlobalProperties = IPGlobalProperties.GetIPGlobalProperties();

                //返回本地计算机上的所有Tcp监听程序
                IPEndPoint[] ipsTCP = ipGlobalProperties.GetActiveTcpListeners();

                //返回本地计算机上的所有UDP监听程序
                IPEndPoint[] ipsUDP = ipGlobalProperties.GetActiveUdpListeners();

                //返回本地计算机上的Internet协议版本4(IPV4 传输控制协议(TCP)连接的信息。
                TcpConnectionInformation[] tcpConnInfoArray = ipGlobalProperties.GetActiveTcpConnections();

                IList allPorts = new ArrayList();
                foreach (IPEndPoint ep in ipsTCP) allPorts.Add(ep.Port);
                foreach (IPEndPoint ep in ipsUDP) allPorts.Add(ep.Port);
                foreach (TcpConnectionInformation conn in tcpConnInfoArray) allPorts.Add(conn.LocalEndPoint.Port);

                return allPorts;
            }

            /// <summary>
            /// 检查指定端口是否已用
            /// </summary>
            /// <param name="port"></param>
            /// <returns></returns>
            public static bool PortIsAvailable(int port)
            {
                bool isAvailable = true;

                IList portUsed = PortIsUsed();

                foreach (int p in portUsed)
                {
                    if (p == port)
                    {
                        isAvailable = false; break;
                    }
                }

                return isAvailable;

            } 

  • 相关阅读:
    ACM: Copying Data 线段树-成段更新-解题报告
    POJ 2488 A Knight's Journey
    POJ 3349 Snowflake Snow Snowflakes Hash
    POJ 2299 Ultra-QuickSort 归并排序、二叉排序树,求逆序数
    POJ 1035 Spell checker 简单字符串匹配
    POJ 3267 The Cow Lexicon 简单DP
    POJ 1459 Power Network 最大流(Edmonds_Karp算法)
    POJ 3687 Labeling Balls 逆向建图,拓扑排序
    HDU 1532 Drainage Ditches 最大流 (Edmonds_Karp)
    POJ 3026 Borg Maze bfs+Kruskal
  • 原文地址:https://www.cnblogs.com/bobzhangfw/p/2440380.html
Copyright © 2011-2022 走看看