lightbenc.php,Lightbenc.php

本文介绍了一种使用PHP实现的轻量级B编码,相比TB dev版本,它内存消耗降低一个数量级。编码速度接近TB dev,解码更快。该实现支持复杂的数据类型解析,包括整数、字符串、列表和有序字典,并保持了灵活性和易用性。
摘要由CSDN通过智能技术生成

/**

* Created by PhpStorm.

* User: ziziliang

* Date: 2017/9/12

* Time: 下午12:53

lightbenc.php

Dear Bram Cohen,

You are an arse

WHAT were you smoking ?

This implementation should use one order of magnitude less memory then the TBdev version.

The bdecoding speed is similar to TBdev, bencoding is faster, and much faster then bdecoding.

Call the bdecode() function with the bencoded string:

$str="d7:oneListl8:a stringe10:oneIntegeri34ee";

var_dump(bdecode($str));

array(3) {

["oneList"]=>

array(1) {

[0]=>

string(8) "a string"

}

["oneInteger"]=>

int(34)

["isDct"]=>

bool(true)

}

The returned value is a nested data type with the following type of elements:

- ints (test type with is_integer($x))

- strings (test type with is_string($x))

- lists (test type with is_array($x) && !isset($x[isDct])

- dicts (test type with is_array($x) && isset($x[isDct])

All elements have the native PHP type, except for the dictionary which is an array with an "isDct" key.

This is necessary since PHP makes no distinction between flat and associative arrays. Note that the isDct

key is allways set as a bool, so that even if the dictionary contains an actual "isDct" value, the

functions behave transparently, i.e. they don't strip out or overwrite actual "isDct" keys.

As such, this implementation is not a drop-in replacement of the TBDev code, hence the new function names

For all practical purposes, it's just as flexible, and very easy to use. For example:

// decode the torrent file

$dict= bdecode_file($torrentfilename);

// change announce url

$dict['announce']='http://inferno.demonoid.com';

// add private tracker flag

$dict['info']['private']=1;

// compute infohash

$infohash = pack("H*", sha1(bencode($dict["info"])));

// recreate the torrent file

$torrentfile=bencode($dict);

After calling bencode(), the passed nested array will have all it's dictionaries sorted by key.

The bencoded data generated by bencode() will have sorted dictionaries, but bdecode() does not require

this in the input stream, and will keep the order unchanged.

This implementation is hereby released under the GFYPL, version 1.00.

The Go Fuck Yourself Public License, version 1.00

Article 1

You can go fuck yourself.

END OF ALL TERMS AND CONDITIONS

*/

class Lightbenc{

public static function bdecode($s, &$pos=0) {

if($pos>=strlen($s)) {

return null;

}

switch($s[$pos]){

case 'd':

$pos++;

$retval=array();

while ($s[$pos]!='e'){

$key=Lightbenc::bdecode($s, $pos);

$val=Lightbenc::bdecode($s, $pos);

if ($key===null || $val===null)

break;

$retval[$key]=$val;

}

$retval["isDct"]=true;

$pos++;

return $retval;

case 'l':

$pos++;

$retval=array();

while ($s[$pos]!='e'){

$val=Lightbenc::bdecode($s, $pos);

if ($val===null)

break;

$retval[]=$val;

}

$pos++;

return $retval;

case 'i':

$pos++;

$digits=strpos($s, 'e', $pos)-$pos;

$val=(int)substr($s, $pos, $digits);

$pos+=$digits+1;

return $val;

//case "0": case "1": case "2": case "3": case "4":

//case "5": case "6": case "7": case "8": case "9":

default:

$digits=strpos($s, ':', $pos)-$pos;

if ($digits<0 || $digits >20)

return null;

$len=(int)substr($s, $pos, $digits);

$pos+=$digits+1;

$str=substr($s, $pos, $len);

$pos+=$len;

//echo "pos: $pos str: [$str] len: $len digits: $digits\n";

return (string)$str;

}

return null;

}

public static function bencode(&$d){

if(is_array($d)){

$ret="l";

if(isset($d["isDct"])&&$d["isDct"]){

$isDict=1;

$ret="d";

// this is required by the specs, and BitTornado actualy chokes on unsorted dictionaries

ksort($d, SORT_STRING);

}

foreach($d as $key=>$value) {

if(isset($isDict)&&$isDict){

// skip the isDct element, only if it's set by us

if($key=="isDct" and is_bool($value)) continue;

$ret.=strlen($key).":".$key;

}

if (is_string($value)) {

$ret.=strlen($value).":".$value;

} elseif (is_int($value)){

$ret.="i${value}e";

} else {

$ret.=Lightbenc::bencode ($value);

}

}

return $ret."e";

} elseif (is_string($d)) // fallback if we're given a single bencoded string or int

return strlen($d).":".$d;

elseif (is_int($d))

return "i${d}e";

else

return null;

}

public static function bdecode_file($filename){

$f=file_get_contents($filename, FILE_BINARY);

return Lightbenc::bdecode($f);

}

public static function bdecode_getinfo($filename){

$t = Lightbenc::bdecode(file_get_contents($filename, FILE_BINARY));

$t['info_hash'] = sha1(Lightbenc::bencode($t['info']));

if(isset($t['info']['files']) && is_array($t['info']['files'])){ //multifile

$t['info']['size'] = 0;

$t['info']['filecount'] = 0;

foreach($t['info']['files'] as $file){

$t['info']['filecount']++;

$t['info']['size']+=$file['length'];

}

}else{

$t['info']['size'] = $t['info']['length'];

$t['info']["filecount"] = 1;

$t['info']['files'][0]['path'] = isset($t['info']['name'])?self::characet($t['info']['name']):"";

$t['info']['files'][0]['length'] = isset($t['info']['length'])?$t['info']['length']:'';

}

return $t;

}

public static function characet($data){

if( !empty($data) ){

$fileType = mb_detect_encoding($data , array('UTF-8','GBK','LATIN1','BIG5')) ;

if( $fileType != 'UTF-8'){

$data = mb_convert_encoding($data ,'utf-8' , $fileType);

}

}

return $data;

}

}

?>

一键复制

编辑

Web IDE

原始数据

按行查看

历史

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值