zoukankan      html  css  js  c++  java
  • c#获取网关和Ip

    方法很多,有简有烦,这里选择了个麻烦的。

    主要代码:

      private void getxx(){
    RegistryKey start = Registry.LocalMachine;
    RegistryKey cardServiceName, networkKey;
    string networkcardKey ="SOFTWARE\\Microsoft\\Windows NT\\CurrentVersion\\NetworkCards";
    string serviceKey = "SYSTEM\\CurrentControlSet\\Services\\";
    string networkcardKeyName, deviceName;
    string deviceServiceName, serviceName;
    RegistryKey serviceNames = start.OpenSubKey(networkcardKey);
     if (serviceNames == null)
    {
    MessageBox.Show("Bad registry key");
    return;
    }
    string[] networkCards = serviceNames.GetSubKeyNames();
    serviceNames.Close();
    foreach(string keyName in networkCards)
    {
    networkcardKeyName = networkcardKey + "\\" + keyName;
    cardServiceName = start.OpenSubKey(networkcardKeyName);
    if (cardServiceName == null)
    {
        MessageBox.Show(networkcardKeyName);
    return;
    }
    deviceServiceName =(string)cardServiceName.GetValue("ServiceName");
    deviceName = (string)cardServiceName.GetValue("Description");
        MessageBox.Show( deviceName);
    serviceName = serviceKey + deviceServiceName + "\\Parameters\\Tcpip";
    networkKey = start.OpenSubKey(serviceName);
    if (networkKey == null)
    {

    。。。。。。
    }
    else
    {
    string[] ipaddresses =(string[])networkKey.GetValue("IPAddress");
    string[] defaultGateways =(string[])networkKey.GetValue("DefaultGateway");
    string[] subnetmasks =(string[])networkKey.GetValue("SubnetMask");
    foreach(string ipaddress in ipaddresses)
    {
        MessageBox.Show( ipaddress);
         }
    foreach(string subnetmask in subnetmasks)

    。。。。。。}
    foreach(string defaultGateway in defaultGateways)
    {
        MessageBox.Show(defaultGateway);
    }
    networkKey.Close();
    }
    }
    start.Close(); 
            }

  • 相关阅读:
    洛谷P1622 释放囚犯(dp好题)
    精灵魔法(vector逆序对,离散化数状数组)
    十大排序方法
    线段树总结(萌新必看)
    【BZOJ4145】[AMPPZ2014]The Prices 状压dp
    TJOI2013 奖学金—大根堆实现(洛谷P3963)
    APIO强掠计划(spfa+tarjan缩点)
    火车运输(最大生成树+lca) 洛谷P1967
    计算机网络基础知识总结(二)
    测试用例--“好的”测试用例
  • 原文地址:https://www.cnblogs.com/jinyuttt/p/1805933.html
Copyright © 2011-2022 走看看