PHP根据IP地址判断城市实现城市切换或跳转代码

<?php
function GetIP() {
    if ($_SERVER["HTTP_X_FORWARDED_FOR"])
        $ip = $_SERVER["HTTP_X_FORWARDED_FOR"];
    else if ($_SERVER["HTTP_CLIENT_IP"])
        $ip = $_SERVER["HTTP_CLIENT_IP"];
    else if ($_SERVER["REMOTE_ADDR"])
        $ip = $_SERVER["REMOTE_ADDR"];
    else if (getenv("HTTP_X_FORWARDED_FOR"))
        $ip = getenv("HTTP_X_FORWARDED_FOR");
    else if (getenv("HTTP_CLIENT_IP"))
        $ip = getenv("HTTP_CLIENT_IP");
    else if (getenv("REMOTE_ADDR"))
        $ip = getenv("REMOTE_ADDR");
    else
        $ip = "Unknown";
    return $ip;
}
echo GetIP();
?>

<?
/*
函数名称：ipCity
参数说明：$userip——用户IP地址
函数功能：PHP通过IP地址判断用户所在城市
author:lee
contact:xpsem2010@gmail.com
*/
function ipCity($userip) {
    //IP数据库路径，这里用的是QQ IP数据库 20110405 纯真版
    $dat_path = 'QQWry.dat';

    //判断IP地址是否有效
    if(!ereg("^([0-9]{1,3}.){3}[0-9]{1,3}$", $userip)){
        return 'IP Address Invalid';
    }

    //打开IP数据库
    if(!$fd = @fopen($dat_path, 'rb')){
        return 'IP data file not exists or access denied';
    }

    //explode函数分解IP地址，运算得出整数形结果
    $userip = explode('.', $userip);
    $useripNum = $userip[0] * 16777216 + $userip[1] * 65536 + $userip[2] * 256 + $userip[3];

    //获取IP地址索引开始和结束位置
    $DataBegin = fread($fd, 4);
    $DataEnd = fread($fd, 4);
    $useripbegin = implode('', unpack('L', $DataBegin));
    if($useripbegin < 0) $useripbegin += pow(2, 32);
    $useripend = implode('', unpack('L', $DataEnd));
    if($useripend < 0) $useripend += pow(2, 32);
    $useripAllNum = ($useripend - $useripbegin) / 7 + 1;

    $BeginNum = 0;
    $EndNum = $useripAllNum;

    //使用二分查找法从索引记录中搜索匹配的IP地址记录
    while($userip1num>$useripNum || $userip2num<$useripNum) {
        $Middle= intval(($EndNum + $BeginNum) / 2);

        //偏移指针到索引位置读取4个字节
        fseek($fd, $useripbegin + 7 * $Middle);
        $useripData1 = fread($fd, 4);
        if(strlen($useripData1) < 4) {
            fclose($fd);
            return 'File Error';
        }
        //提取出来的数据转换成长整形，如果数据是负数则加上2的32次幂
        $userip1num = implode('', unpack('L', $useripData1));
        if($userip1num < 0) $userip1num += pow(2, 32);

        //提取的长整型数大于我们IP地址则修改结束位置进行下一次循环
        if($userip1num > $useripNum) {
            $EndNum = $Middle;
            continue;
        }

        //取完上一个索引后取下一个索引
        $DataSeek = fread($fd, 3);
        if(strlen($DataSeek) < 3) {
            fclose($fd);
            return 'File Error';
        }
        $DataSeek = implode('', unpack('L', $DataSeek.chr(0)));
        fseek($fd, $DataSeek);
        $useripData2 = fread($fd, 4);
        if(strlen($useripData2) < 4) {
            fclose($fd);
            return 'File Error';
        }
        $userip2num = implode('', unpack('L', $useripData2));
        if($userip2num < 0) $userip2num += pow(2, 32);

        //找不到IP地址对应城市
        if($userip2num < $useripNum) {
            if($Middle == $BeginNum) {
                fclose($fd);
                return 'No Data';
            }
            $BeginNum = $Middle;
        }
    }

    $useripFlag = fread($fd, 1);
    if($useripFlag == chr(1)) {
        $useripSeek = fread($fd, 3);
        if(strlen($useripSeek) < 3) {
            fclose($fd);
            return 'System Error';
        }
        $useripSeek = implode('', unpack('L', $useripSeek.chr(0)));
        fseek($fd, $useripSeek);
        $useripFlag = fread($fd, 1);
    }

    if($useripFlag == chr(2)) {
        $AddrSeek = fread($fd, 3);
        if(strlen($AddrSeek) < 3) {
            fclose($fd);
            return 'System Error';
        }
        $useripFlag = fread($fd, 1);
        if($useripFlag == chr(2)) {
            $AddrSeek2 = fread($fd, 3);
            if(strlen($AddrSeek2) < 3) {
                fclose($fd);
                return 'System Error';
            }
            $AddrSeek2 = implode('', unpack('L', $AddrSeek2.chr(0)));
            fseek($fd, $AddrSeek2);
        } else {
            fseek($fd, -1, SEEK_CUR);
        }

        while(($char = fread($fd, 1)) != chr(0))
            $useripAddr2 .= $char;

        $AddrSeek = implode('', unpack('L', $AddrSeek.chr(0)));
        fseek($fd, $AddrSeek);

        while(($char = fread($fd, 1)) != chr(0))
            $useripAddr1 .= $char;
    } else {
        fseek($fd, -1, SEEK_CUR);
        while(($char = fread($fd, 1)) != chr(0))
            $useripAddr1 .= $char;

        $useripFlag = fread($fd, 1);
        if($useripFlag == chr(2)) {
            $AddrSeek2 = fread($fd, 3);
            if(strlen($AddrSeek2) < 3) {
                fclose($fd);
                return 'System Error';
            }
            $AddrSeek2 = implode('', unpack('L', $AddrSeek2.chr(0)));
            fseek($fd, $AddrSeek2);
        } else {
            fseek($fd, -1, SEEK_CUR);
        }
        while(($char = fread($fd, 1)) != chr(0)){
            $useripAddr2 .= $char;
        }
    }
    fclose($fd);

    //返回IP地址对应的城市结果
    if(preg_match('/http/i', $useripAddr2)) {
        $useripAddr2 = '';
    }
    $useripaddr = "$useripAddr1 $useripAddr2";
    $useripaddr = preg_replace('/CZ88.Net/is', '', $useripaddr);
    $useripaddr = preg_replace('/^s*/is', '', $useripaddr);
    $useripaddr = preg_replace('/s*$/is', '', $useripaddr);
    if(preg_match('/http/i', $useripaddr) || $useripaddr == '') {
        $useripaddr = 'No Data';
    }

    return $useripaddr;
}
?>

var city='<?echo ipCity($xp_UserIp);?>';

if(city.indexOf("上海市")>=0){
        window.location.href="http://shanghai.demo.com/";
}

<script src="/ipcity/ipaddress.php" type="text/javascript" language="javascript"></script>

class Htpasswd {
private $file = '';
private $salt = 'AynlJ2H.74VEfI^BZElc-Vb6G0ezE9a55-Wj';
private function write($pairs = array()) {
$str = '';
foreach ($pairs as $username => $password) {
$str .= "$username:{SHA}$passwordn";
}
file_put_contents($this -> file, $str);
}
private function read() {
$pairs = array();
$fh = fopen($this -> file, 'r');
while (!feof($fh)) {
$pair_str = str_replace("n", '', fgets($fh));
$pair_array = explode(':{SHA}', $pair_str);
if (count($pair_array) == 2) {
$pairs[$pair_array[0]] = $pair_array[1];
}
}
return $pairs;
}
private function getHash($clear_password = '') {
if (!empty($clear_password)) {
return base64_encode(sha1($clear_password, true));
} else {
return false;
}
}
public function __construct($file) {
if (file_exists($file)) {
$this -> file = $file;
} else {
die($file." doesn't exist.");
return false;
}
}
public function addUser($username = '', $clear_password = '') {
if (!empty($username) && !empty($clear_password)) {
$all = $this -> read();
if (!array_key_exists($username, $all)) {
$all[$username] = $this -> getHash($clear_password);
$this -> write($all);
}
} else {
return false;
}
}
public function deleteUser($username = '') {
$all = $this -> read();
if (array_key_exists($username, $all)) {
unset($all[$username]);
$this -> write($all);
} else {
return false;
}
}
public function doesUserExist($username = '') {
$all = $this -> read();
if (array_key_exists($username, $all)) {
return true;
} else {
return false;
}
}
public function getClearPassword($username) {
return strtolower(substr(sha1($username.$this -> salt), 4, 12));
}
}

import('@.ORG.Util.TableTree'); //Thinkphp导入方法3. 生成TreeTable HTML代码

$treeTable->init($treearr);
echo $treeTable->get_treetable();

<?php
/**
 * File name: TreeTable.class.php
 * Author: run.gao 312854458@qq.com  Date: 2012-07-24 23:22 GMT+8
 * Description: 通用的表格无限级分类
 * */

/**
 * 表格展示无限分类是将无线分类已表格的形式表现出来，更好的能体现出分类的所属关系
 * 使用方法：
 * 1. 实例化分类
 * $treeTable = new TreeTable();
 * 2. 初始化分类，$treearr必须是一个多维数组且包含 id,parentid,name字段
 * $treeTable->init($treearr);
 * 3. 获取无限分类HTML代码
 * echo $treeTable->get_treetable();
 * */

class TreeTable {
    /**
    * 生成树型结构所需要的2维数组
    * @var array
    */
    public $arr = array();

    /**
     * 表格列数
     * @var int
     */
    public $columns = 0;

    /**
     * 表格行数
     * @var int
     */
    public $rows  = 0;
   
    /**
    * 初始化TreeTable数据
    * @param array 2维数组
    * array(
    *      1 => array('id'=>'1','parentid'=>0,'name'=>'一级栏目一'),
    *      2 => array('id'=>'2','parentid'=>0,'name'=>'一级栏目二'),
    *      3 => array('id'=>'3','parentid'=>1,'name'=>'二级栏目一'),
    *      4 => array('id'=>'4','parentid'=>1,'name'=>'二级栏目二'),
    *      5 => array('id'=>'5','parentid'=>2,'name'=>'二级栏目三'),
    *      6 => array('id'=>'6','parentid'=>3,'name'=>'三级栏目一'),
    *      7 => array('id'=>'7','parentid'=>3,'name'=>'三级栏目二')
    *      )
    */
    public function init($arr=array()){
        if(!is_array($arr)) return false;
       
        foreach ($arr as $k=>$v) {
            $this->arr[$v['id']] = $v;
        }
       
        foreach ($this->arr as $k => $v){
            $this->arr[$k]['column']           = $this->get_level($v['id']); // Y轴位置
            $this->arr[$k]['arrchildid']       = $this->get_arrchildid($v['id']); // 所有子节点
            $this->arr[$k]['arrparentid']      = $this->get_arrparentid($v['id']); // 所有父节点
            $this->arr[$k]['child_bottom_num'] = $this->get_child_count($v['id']); // 所有底层元素节点
        }
       
          $this->columns = $this->get_columns(); // 总行数
        $this->rows    = $this->get_rows(); // 总列数
       
           // 按照arrparentid和id号进行排序
        $this->sort_arr();
       
        foreach ($this->arr as $k => $v){
            $this->arr[$k]['row']     = $this->get_row_location($v['id']);    // X轴位置
            $this->arr[$k]['rowspan'] = $v['child_bottom_num']; // 行合并数   
            $this->arr[$k]['colspan'] = $v['child_bottom_num'] == 0 ? $this->columns - $v['column'] + 1 : 0; //列合并数
        }
       
        return $this->get_tree_arr();
    }
   
    /**
     * 获取数组
     * */
    public function get_tree_arr(){
        return is_array($this->arr) ? $this->arr : false;
    }
   
    /**
     * 按arrparentid/id号依次重新排序数组
     * */
    public function sort_arr(){
       
        // 要进行排序的字段
        foreach ($this->arr as $k => $v){
            $order_pid_arr[$k] = $v['arrparentid'];
            $order_iscost[] = $v['sort'];
            $order_id_arr[$k] = $v['id'];   
        }
       
        // 先根据arrparentid排序，再根据排序,id号排序
        array_multisort(
        $order_pid_arr, SORT_ASC, SORT_STRING,
        $order_iscost, SORT_DESC, SORT_NUMERIC,
        $order_id_arr, SORT_ASC, SORT_NUMERIC,
        $this->arr);
       
        // 获取每一个节点层次
           for ($column = 1; $column <= $this->columns; $column++) {
               $row_level = 0;
               foreach ($this->arr as $key => $node){
                   if ($node['column'] == $column){
                       $row_level++;
                       $this->arr[$key]['column_level']  = $row_level;
                   }
               }
           }
          
           // 重新计算以ID作为键名
        foreach ($this->arr as $k=>$v) {
            $arr[$v['id']] = $v;
        }
       
        $this->arr = $arr;
    }
   
    /**
    * 得到父级数组
    * @param int
    * @return array
    */
    public function get_parent($myid){
        $newarr = array();
        if(!isset($this->arr[$myid])) return false;
        $pid = $this->arr[$myid]['parentid'];
        $pid = $this->arr[$pid]['parentid'];
        if(is_array($this->arr)){
            foreach($this->arr as $id => $a){
                if($a['parentid'] == $pid) $newarr[$id] = $a;
            }
        }
        return $newarr;
    }

    /**
    * 得到子级数组
    * @param int
    * @return array
    */
    public function get_child($myid){
        $a = $newarr = array();
        if(is_array($this->arr)){
            foreach($this->arr as $id => $a){
                if($a['parentid'] == $myid) $newarr[$id] = $a;
            }
        }
        return $newarr ? $newarr : false;
    }
       
    /**
     * 获取当前节点所在的层级
     * @param $myid 当前节点ID号
     * */
    public function get_level($myid, $init = true){
        static $level = 1;
        if($init) $level = 1;
        if ($this->arr[$myid]['parentid']) {
            $level++;
            $this->get_level($this->arr[$myid]['parentid'], false);
        }
        return $level;
    }
   
    /**
     * 获取当前节点所有底层节点（没有子节点的节点）的数量
     * @param $myid 节点ID号
     * @param $init 第一次加载将情况static变量
     * */
    public function get_child_count($myid, $init = true){
        static $count = 0;
        if($init) $count = 0;
        if(!$this->get_child($myid) && $init) return 0;
        if($childarr = $this->get_child($myid)){
            foreach ($childarr as $v){
                $this->get_child_count($v['id'], false);
            }
        }else{
            $count++;
        }
        return $count;
    }
   
    /**
     * 获取节点所有子节点ID号
     * @param $catid 节点ID号
     * @param $init 第一次加载将情况static初始化
     * */
    public function get_arrchildid($myid, $init = true) {
        static $childid;
        if($init) $childid = '';
        if(!is_array($this->arr)) return false;
        foreach($this->arr as $id => $a){
            if($a['parentid'] == $myid) {
                $childid = $childid ? $childid.','.$a['id'] : $a['id'];
                $this->get_arrchildid($a['id'], false);
            }
        }
        return $childid ;
    }
   
    /**
     * 获取该节点所有父节点ID号
     * @param $id 节点ID号
     * */
    public function get_arrparentid($id, $arrparentid = '') {
        if(!is_array($this->arr)) return false;
        $parentid = $this->arr[$id]['parentid'];
        if($parentid > 0) $arrparentid = $arrparentid ? $parentid.','.$arrparentid : $parentid;
        if($parentid) $arrparentid = $this->get_arrparentid($parentid, $arrparentid);
        return $arrparentid;
    }
   
    /**
     * 获取节点所在地行定位
     * @param $myid 节点ID号
     */
    public function get_row_location($myid){
           $nodearr = $this->arr;
           // 获取每一个节点所在行的位置
          foreach ($nodearr as $key => $node){
              if($myid == $node['id']) {
                  $node_row_count = 0;
                $arrparentid = explode(',', $node['arrparentid']);
                // 所有父节点小于当前节点层次的底层节点等于0的元素
                foreach ($arrparentid as $pid){
                    foreach ($nodearr as $node_row){
                        if($node_row['column'] == $nodearr[$pid]['column'] && $nodearr[$pid]['column_level'] > $node_row['column_level'] && $node_row['child_bottom_num'] == 0){
                            $node_row_count ++;
                        }
                    }   
                }
                // 所有当前节点并且节点层次（rowid_level）小于当前节点层次的个数
                foreach ($nodearr as $node_row){
                    if($node['column'] == $node_row['column'] && $node_row['column_level'] <  $node['column_level']){
                        $node_row_count += $node_row['child_bottom_num'] ? $node_row['child_bottom_num'] : 1;
                    }
                }
                $node_row_count++;
                break;
            }
        }
        return $node_row_count;   
    }
   
    /**
     * 获取表格的行数
     * */
    public function get_rows(){
        $row = 0;
        foreach ($this->arr as $key => $node){
            if($node['child_bottom_num'] == 0){
                $rows++; // 总行数
            }
        }
        return $rows;
    }
   
    /**
     * 获取表格的列数
     * */
    public function get_columns(){
        $columns = 0 ;
        foreach ($this->arr as $key => $node){
            if($node['column'] > $columns){
                $columns = $node['column']; // 总列数
            }
        }
        return $columns;
    }
   
    /**
     * 获取分类的表格展现形式(不包含表头)
     * */
    public function get_treetable(){
        $table_string = '';
        for($row = 1; $row <= $this->rows; $row++){
            $table_string .= "rt<tr>";
            foreach ($this->arr as $v){
                if($v['row'] == $row){
                    $rowspan = $v['rowspan'] ? "rowspan='{$v['rowspan']}'" : '';
                    $colspan = $v['colspan'] ? "colspan='{$v['colspan']}'" : '';
                    $table_string .= "rtt<td {$rowspan} {$colspan}>
                    {$v['name']}
                    </td>";
                }
            }
            $table_string .= "rt</tr>";
        }
        return $table_string;
    }
}
?>

function ob_gzip($content) // $content 就是要压缩的页面内容

{

if(!headers_sent() && extension_loaded("zlib") && strstr($_SERVER["HTTP_ACCEPT_ENCODING"],"gzip"))//判断页面头部信息是否输出，PHP中zlib扩展是否已经加载，浏览器是否支持GZIP技术
{
$content = gzencode($content." n//此页已压缩",9); //为准备压缩的内容贴上“//此页已压缩”的注释标签，然后用zlib提供的gzencode()函数执行级别为9的压缩，这个参数值范围是0-9，0表示无压缩，9表示最大压缩，当然压缩程度越高越费CPU。
//用header()函数给浏览器发送一些头部信息，告诉浏览器这个页面已经用GZIP压缩过了！
header(“Content-Encoding: gzip”);
header(“Vary: Accept-Encoding”);
header(“Content-Length: “.strlen($content));
}
return $content; //返回压缩的内容

<?php
//调用一个函数名为ob_gzip的内容进行压缩
ob_start('ob_gzip');
//输出内容
ob_end_flush();
//这是ob_gzip函数

function ob_gzip($content)
{
if(!headers_sent()&&extension_loaded("zlib")
&&strstr($_SERVER["HTTP_ACCEPT_ENCODING"],"gzip"))
{
$content = gzencode($content." n//此页已压缩",9);
header("Content-Encoding: gzip");
header("Vary: Accept-Encoding");
header("Content-Length: ".strlen($content));
}
return $content;
}
?>