zoukankan      html  css  js  c++  java
  • 获取IP(windows和linux)

    #ifdef _WIN32
    #include <winsock2.h>
    #include <Ws2tcpip.h>
    #pragma comment(lib,"ws2_32.lib")
    #else
    #include <sys/types.h>
    #include <sys/socket.h>
    #include <sys/ioctl.h>
    #include <net/if.h>
    #include <net/if_arp.h>
    #include <arpa/inet.h>
    #include <unistd.h>
    #endif

    int getselfiplist(unsigned long ipbuf[],int bufcount)
    {
    int i,count=0;
    #ifdef _WIN32
    char hostname[128];
    struct hostent* inaddrs;
    if(gethostname(hostname,128)==0)
    {
    inaddrs=gethostbyname(hostname);
    if(inaddrs)
    {
    count=inaddrs->h_length/sizeof(in_addr);
    if(count>bufcount)count=bufcount;
    for(i=0;i<count;i++)
    {
    ipbuf=*(unsigned long*)inaddrs->h_addr_list;
    }
    }
    }
    #else
    int sock;
    struct sockaddr_in sin;
    struct ifreq ifr;

    sock = socket(AF_INET, SOCK_DGRAM, 0);
    if(sock>=0)//!<0
    {
    if(bufcount>100)bufcount=100;
    for(i=0;i<bufcount;i++)
    {
    sprintf(ifr.ifr_name,"eth%d",i);
    if(ioctl(sock,SIOCGIFADDR,&ifr)<0) break;
    ::memcpy(&sin, &ifr.ifr_addr, sizeof(sin));
    ipbuf[count++]=sin.sin_addr.s_addr;
    }
    close(sock);
    }
    #endif
    return count;
    }

    #ifdef _WIN32
    #include <winsock2.h>
    #include <Ws2tcpip.h>
    #pragma comment(lib,"ws2_32.lib")
    #else
    #include <sys/types.h>
    #include <sys/socket.h>
    #include <sys/ioctl.h>
    #include <net/if.h>
    #include <net/if_arp.h>
    #include <arpa/inet.h>
    #include <unistd.h>
    #endif

    int getselfiplist(unsigned long ipbuf[],int bufcount)
    {
    int i,count=0;
    #ifdef _WIN32
    char hostname[128];
    struct hostent* inaddrs;
    if(gethostname(hostname,128)==0)
    {
    inaddrs=gethostbyname(hostname);
    if(inaddrs)
    {
    count=inaddrs->h_length/sizeof(in_addr);
    if(count>bufcount)count=bufcount;
    for(i=0;i<count;i++)
    {
    ipbuf=*(unsigned long*)inaddrs->h_addr_list;
    }
    }
    }
    #else
    int sock;
    struct sockaddr_in sin;
    struct ifreq ifr;

    sock = socket(AF_INET, SOCK_DGRAM, 0);
    if(sock>=0)//!<0
    {
    if(bufcount>100)bufcount=100;
    for(i=0;i<bufcount;i++)
    {
    sprintf(ifr.ifr_name,"eth%d",i);
    if(ioctl(sock,SIOCGIFADDR,&ifr)<0) break;
    ::memcpy(&sin, &ifr.ifr_addr, sizeof(sin));
    ipbuf[count++]=sin.sin_addr.s_addr;
    }
    close(sock);
    }
    #endif
    return count;
    }

  • 相关阅读:
    《剑指offer》第十二题(矩阵中的路径)
    《剑指offer》第十五题(二进制中1的个数)
    《剑指offer》第十题(斐波那契数列)
    《剑指offer》第十一题(旋转数组的最小数字)
    原始的生成对抗网络GAN
    《剑指offer》第九题(用两个栈实现队列)
    (转)c++一些知识点
    贪心算法
    动态规划——最长公共子串
    动态规划——主元素算法
  • 原文地址:https://www.cnblogs.com/yunsicai/p/3659278.html
Copyright © 2011-2022 走看看