Detect residential+datacenter IPs
This commit is contained in:
706
lib/MMDBWriter.php
Normal file
706
lib/MMDBWriter.php
Normal file
@@ -0,0 +1,706 @@
|
||||
<?php
|
||||
/**
|
||||
* MMDBWriter - a pure-PHP library for generating MaxMind DB (.mmdb) files.
|
||||
*
|
||||
* Implements the MaxMind DB binary format from scratch:
|
||||
* https://maxmind.github.io/MaxMind-DB/
|
||||
*
|
||||
* Supports IPv4 and IPv6 (dual-stack) databases, arbitrary nested
|
||||
* map/array data structures, and all MMDB scalar types.
|
||||
*
|
||||
* Usage:
|
||||
* $w = new MMDBWriter(6, 'GeoIP-Custom', ['en']);
|
||||
* $w->addRecord('1.2.3.0/24', ['country' => 'US', 'city' => 'Ashburn']);
|
||||
* $w->addRecord('2001:db8::/32', ['country' => 'DE']);
|
||||
* $w->write('/path/to/out.mmdb');
|
||||
*/
|
||||
|
||||
// ---------------------------------------------------------------------
|
||||
// Explicit value typing (use when auto-detection of PHP types isn't
|
||||
// precise enough, e.g. you need a uint16 instead of the default uint32).
|
||||
// ---------------------------------------------------------------------
|
||||
final class MMDBType
|
||||
{
|
||||
const POINTER = 1;
|
||||
const STRING = 2;
|
||||
const DOUBLE = 3;
|
||||
const BYTES = 4;
|
||||
const UINT16 = 5;
|
||||
const UINT32 = 6;
|
||||
const MAP = 7;
|
||||
const INT32 = 8;
|
||||
const UINT64 = 9;
|
||||
const UINT128 = 10;
|
||||
const ARRAY_T = 11;
|
||||
const BOOLEAN = 14;
|
||||
const FLOAT = 15;
|
||||
}
|
||||
|
||||
final class MMDBValue
|
||||
{
|
||||
public $type;
|
||||
public $value;
|
||||
|
||||
private function __construct(int $type, $value)
|
||||
{
|
||||
$this->type = $type;
|
||||
$this->value = $value;
|
||||
}
|
||||
|
||||
public static function string(string $v): self { return new self(MMDBType::STRING, $v); }
|
||||
public static function bytes(string $v): self { return new self(MMDBType::BYTES, $v); }
|
||||
public static function double(float $v): self { return new self(MMDBType::DOUBLE, $v); }
|
||||
public static function float(float $v): self { return new self(MMDBType::FLOAT, $v); }
|
||||
public static function uint16(int $v): self { return new self(MMDBType::UINT16, $v); }
|
||||
public static function uint32(int $v): self { return new self(MMDBType::UINT32, $v); }
|
||||
public static function uint64(int $v): self { return new self(MMDBType::UINT64, $v); }
|
||||
// $v may be a PHP int (<= 64 bit) or a hex string like "0x1ff...".
|
||||
public static function uint128($v): self { return new self(MMDBType::UINT128, $v); }
|
||||
public static function int32(int $v): self { return new self(MMDBType::INT32, $v); }
|
||||
public static function bool(bool $v): self { return new self(MMDBType::BOOLEAN, $v); }
|
||||
public static function map(array $v): self { return new self(MMDBType::MAP, $v); }
|
||||
public static function arr(array $v): self { return new self(MMDBType::ARRAY_T, $v); }
|
||||
}
|
||||
|
||||
// ---------------------------------------------------------------------
|
||||
// Binary encoder for the MaxMind DB "data format"
|
||||
// ---------------------------------------------------------------------
|
||||
final class MMDBEncoder
|
||||
{
|
||||
/** Encode any supported PHP value (or MMDBValue wrapper) to raw bytes. */
|
||||
public static function encode($value): string
|
||||
{
|
||||
if ($value instanceof MMDBValue) {
|
||||
return self::encodeTyped($value->type, $value->value);
|
||||
}
|
||||
|
||||
if (is_bool($value)) {
|
||||
return self::encodeTyped(MMDBType::BOOLEAN, $value);
|
||||
}
|
||||
if (is_int($value)) {
|
||||
if ($value >= 0 && $value <= 0xFFFFFFFF) {
|
||||
return self::encodeTyped(MMDBType::UINT32, $value);
|
||||
}
|
||||
if ($value < 0 && $value >= -2147483648) {
|
||||
return self::encodeTyped(MMDBType::INT32, $value);
|
||||
}
|
||||
return self::encodeTyped(MMDBType::UINT64, $value);
|
||||
}
|
||||
if (is_float($value)) {
|
||||
return self::encodeTyped(MMDBType::DOUBLE, $value);
|
||||
}
|
||||
if (is_string($value)) {
|
||||
return self::encodeTyped(MMDBType::STRING, $value);
|
||||
}
|
||||
if (is_array($value)) {
|
||||
if (self::isList($value)) {
|
||||
return self::encodeTyped(MMDBType::ARRAY_T, $value);
|
||||
}
|
||||
return self::encodeTyped(MMDBType::MAP, $value);
|
||||
}
|
||||
|
||||
throw new InvalidArgumentException('Unsupported value type: ' . gettype($value));
|
||||
}
|
||||
|
||||
private static function isList(array $a): bool
|
||||
{
|
||||
$i = 0;
|
||||
foreach ($a as $k => $_) {
|
||||
if ($k !== $i++) {
|
||||
return false;
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
private static function encodeTyped(int $type, $value): string
|
||||
{
|
||||
if ($type !== MMDBType::MAP && $type !== MMDBType::ARRAY_T) {
|
||||
return self::encodeScalar($type, $value);
|
||||
}
|
||||
switch ($type) {
|
||||
case MMDBType::MAP:
|
||||
$out = self::controlAndSize($type, count($value));
|
||||
foreach ($value as $k => $v) {
|
||||
$out .= self::encodeTyped(MMDBType::STRING, (string) $k);
|
||||
$out .= self::encode($v);
|
||||
}
|
||||
return $out;
|
||||
|
||||
case MMDBType::ARRAY_T:
|
||||
$out = self::controlAndSize($type, count($value));
|
||||
foreach ($value as $v) {
|
||||
$out .= self::encode($v);
|
||||
}
|
||||
return $out;
|
||||
}
|
||||
}
|
||||
|
||||
/** Encode a single non-composite (leaf) MMDB value to bytes. Public so
|
||||
* MMDBDataSection can reuse it for the leaves of its deduped structures. */
|
||||
public static function encodeScalar(int $type, $value): string
|
||||
{
|
||||
switch ($type) {
|
||||
case MMDBType::STRING:
|
||||
$payload = $value;
|
||||
return self::controlAndSize($type, strlen($payload)) . $payload;
|
||||
|
||||
case MMDBType::BYTES:
|
||||
$payload = $value;
|
||||
return self::controlAndSize($type, strlen($payload)) . $payload;
|
||||
|
||||
case MMDBType::DOUBLE:
|
||||
$payload = pack('E', $value); // 8-byte big-endian double
|
||||
return self::controlAndSize($type, 8) . $payload;
|
||||
|
||||
case MMDBType::FLOAT:
|
||||
$payload = pack('G', $value); // 4-byte big-endian float
|
||||
return self::controlAndSize($type, 4) . $payload;
|
||||
|
||||
case MMDBType::UINT16:
|
||||
$payload = pack('n', $value & 0xFFFF);
|
||||
return self::controlAndSize($type, 2) . $payload;
|
||||
|
||||
case MMDBType::UINT32:
|
||||
$payload = pack('N', $value & 0xFFFFFFFF);
|
||||
return self::controlAndSize($type, 4) . $payload;
|
||||
|
||||
case MMDBType::INT32:
|
||||
$payload = pack('N', $value & 0xFFFFFFFF);
|
||||
return self::controlAndSize($type, 4) . $payload;
|
||||
|
||||
case MMDBType::UINT64:
|
||||
$payload = pack('J', $value); // 8-byte big-endian uint64
|
||||
return self::controlAndSize($type, 8) . $payload;
|
||||
|
||||
case MMDBType::UINT128:
|
||||
$payload = self::to16Bytes($value);
|
||||
return self::controlAndSize($type, 16) . $payload;
|
||||
|
||||
case MMDBType::BOOLEAN:
|
||||
// Boolean has no payload; the value lives in the size field.
|
||||
return self::controlAndSize($type, $value ? 1 : 0);
|
||||
|
||||
default:
|
||||
throw new InvalidArgumentException("Unsupported MMDB type: $type");
|
||||
}
|
||||
}
|
||||
|
||||
private static function to16Bytes($value): string
|
||||
{
|
||||
if (is_string($value) && preg_match('/^0x[0-9a-fA-F]+$/', $value)) {
|
||||
$hex = str_pad(substr($value, 2), 32, '0', STR_PAD_LEFT);
|
||||
return hex2bin($hex);
|
||||
}
|
||||
// Treat as a (<=64-bit) PHP int, zero-padded to 128 bits.
|
||||
return str_repeat("\x00", 8) . pack('J', (int) $value);
|
||||
}
|
||||
|
||||
/**
|
||||
* Build the control byte (+ extra size bytes, + extended-type byte)
|
||||
* for a given MMDB type and payload size, per the spec's control
|
||||
* byte format.
|
||||
*/
|
||||
public static function controlAndSize(int $type, int $size): string
|
||||
{
|
||||
$typeBits = $type <= 7 ? $type : 0; // 0 = "look at next byte for real type"
|
||||
$out = '';
|
||||
|
||||
if ($size < 29) {
|
||||
$out .= chr(($typeBits << 5) | $size);
|
||||
} elseif ($size < 285) {
|
||||
$out .= chr(($typeBits << 5) | 29);
|
||||
$out .= chr($size - 29);
|
||||
} elseif ($size < 65821) {
|
||||
$out .= chr(($typeBits << 5) | 30);
|
||||
$out .= substr(pack('N', $size - 285), 2, 2); // 2-byte BE
|
||||
} else {
|
||||
$out .= chr(($typeBits << 5) | 31);
|
||||
$out .= substr(pack('N', $size - 65821), 1, 3); // 3-byte BE
|
||||
}
|
||||
|
||||
if ($type > 7) {
|
||||
$out .= chr($type - 7); // extended type byte
|
||||
}
|
||||
|
||||
return $out;
|
||||
}
|
||||
}
|
||||
|
||||
// ---------------------------------------------------------------------
|
||||
// Deduplicating data section builder. Any value (string, number, or
|
||||
// whole map/array structure) that has already been written once is
|
||||
// replaced everywhere else with a 2-5 byte MMDB "pointer" record instead
|
||||
// of being re-encoded, which is where most of the size savings on
|
||||
// real-world data (repeated keys like "country", repeated country codes,
|
||||
// repeated sub-structures) comes from.
|
||||
// ---------------------------------------------------------------------
|
||||
final class MMDBDataSection
|
||||
{
|
||||
private $buffer = '';
|
||||
/** @var array<string,int> cache key => byte offset of its real (non-pointer) encoding */
|
||||
private $cache = [];
|
||||
|
||||
public function bytes(): string
|
||||
{
|
||||
return $this->buffer;
|
||||
}
|
||||
|
||||
/**
|
||||
* Ensure $value is present in the data section (writing it if this is
|
||||
* the first time it's been seen) and return the offset of its real
|
||||
* encoding. Used for top-level records referenced directly by tree
|
||||
* leaves, so this always returns a real offset, never a pointer.
|
||||
*/
|
||||
public function internTop($value): int
|
||||
{
|
||||
[$type, $raw, $cacheKey] = $this->classify($value);
|
||||
if ($cacheKey !== null && isset($this->cache[$cacheKey])) {
|
||||
return $this->cache[$cacheKey];
|
||||
}
|
||||
$offset = strlen($this->buffer);
|
||||
if ($cacheKey !== null) {
|
||||
$this->cache[$cacheKey] = $offset;
|
||||
}
|
||||
$this->appendEncoding($type, $raw);
|
||||
return $offset;
|
||||
}
|
||||
|
||||
/** Append bytes for a value nested inside a map/array: a pointer if
|
||||
* it's a repeat, otherwise its full encoding (registering it for
|
||||
* future reuse). */
|
||||
private function writeRef($value): void
|
||||
{
|
||||
[$type, $raw, $cacheKey] = $this->classify($value);
|
||||
if ($cacheKey !== null && isset($this->cache[$cacheKey])) {
|
||||
$this->buffer .= $this->pointerBytes($this->cache[$cacheKey]);
|
||||
return;
|
||||
}
|
||||
$offset = strlen($this->buffer);
|
||||
if ($cacheKey !== null) {
|
||||
$this->cache[$cacheKey] = $offset;
|
||||
}
|
||||
$this->appendEncoding($type, $raw);
|
||||
}
|
||||
|
||||
private function appendEncoding(int $type, $raw): void
|
||||
{
|
||||
if ($type === MMDBType::MAP) {
|
||||
$this->buffer .= MMDBEncoder::controlAndSize(MMDBType::MAP, count($raw));
|
||||
foreach ($raw as $k => $v) {
|
||||
$this->writeRef((string) $k);
|
||||
$this->writeRef($v);
|
||||
}
|
||||
return;
|
||||
}
|
||||
if ($type === MMDBType::ARRAY_T) {
|
||||
$this->buffer .= MMDBEncoder::controlAndSize(MMDBType::ARRAY_T, count($raw));
|
||||
foreach ($raw as $v) {
|
||||
$this->writeRef($v);
|
||||
}
|
||||
return;
|
||||
}
|
||||
$this->buffer .= MMDBEncoder::encodeScalar($type, $raw);
|
||||
}
|
||||
|
||||
/** @return array{0:int,1:mixed,2:?string} [type, raw value, cache key or null if not worth caching] */
|
||||
private function classify($value): array
|
||||
{
|
||||
if ($value instanceof MMDBValue) {
|
||||
$type = $value->type;
|
||||
$raw = $value->value;
|
||||
} elseif (is_bool($value)) {
|
||||
$type = MMDBType::BOOLEAN;
|
||||
$raw = $value;
|
||||
} elseif (is_int($value)) {
|
||||
if ($value >= 0 && $value <= 0xFFFFFFFF) {
|
||||
$type = MMDBType::UINT32;
|
||||
} elseif ($value < 0 && $value >= -2147483648) {
|
||||
$type = MMDBType::INT32;
|
||||
} else {
|
||||
$type = MMDBType::UINT64;
|
||||
}
|
||||
$raw = $value;
|
||||
} elseif (is_float($value)) {
|
||||
$type = MMDBType::DOUBLE;
|
||||
$raw = $value;
|
||||
} elseif (is_string($value)) {
|
||||
$type = MMDBType::STRING;
|
||||
$raw = $value;
|
||||
} elseif (is_array($value)) {
|
||||
$type = $this->isList($value) ? MMDBType::ARRAY_T : MMDBType::MAP;
|
||||
$raw = $value;
|
||||
} else {
|
||||
throw new InvalidArgumentException('Unsupported value type: ' . gettype($value));
|
||||
}
|
||||
|
||||
// A pointer costs 2-5 bytes; booleans already cost 1 byte with no
|
||||
// payload, so caching them can only ever waste space -- skip.
|
||||
$cacheKey = $type === MMDBType::BOOLEAN ? null : ($type . ':' . serialize($raw));
|
||||
|
||||
return [$type, $raw, $cacheKey];
|
||||
}
|
||||
|
||||
private function isList(array $a): bool
|
||||
{
|
||||
$i = 0;
|
||||
foreach ($a as $k => $_) {
|
||||
if ($k !== $i++) {
|
||||
return false;
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
/** Encode an MMDB pointer (type 1) record per the spec's 4 size classes. */
|
||||
private function pointerBytes(int $offset): string
|
||||
{
|
||||
if ($offset <= 0x7FF) { // 11-bit value, 1 extra byte
|
||||
$b0 = (MMDBType::POINTER << 5) | (0 << 3) | (($offset >> 8) & 0x07);
|
||||
return chr($b0) . chr($offset & 0xFF);
|
||||
}
|
||||
|
||||
$v = $offset - 2048;
|
||||
if ($v <= 0x7FFFF) { // 19-bit value, 2 extra bytes
|
||||
$b0 = (MMDBType::POINTER << 5) | (1 << 3) | (($v >> 16) & 0x07);
|
||||
return chr($b0) . chr(($v >> 8) & 0xFF) . chr($v & 0xFF);
|
||||
}
|
||||
|
||||
$v2 = $offset - 2048 - 524288;
|
||||
if ($v2 <= 0x7FFFFFF) { // 27-bit value, 3 extra bytes
|
||||
$b0 = (MMDBType::POINTER << 5) | (2 << 3) | (($v2 >> 24) & 0x07);
|
||||
return chr($b0) . chr(($v2 >> 16) & 0xFF) . chr(($v2 >> 8) & 0xFF) . chr($v2 & 0xFF);
|
||||
}
|
||||
|
||||
// Size class 3: full absolute 32-bit offset, 4 extra bytes.
|
||||
$b0 = (MMDBType::POINTER << 5) | (3 << 3);
|
||||
return chr($b0) . pack('N', $offset);
|
||||
}
|
||||
}
|
||||
|
||||
// ---------------------------------------------------------------------
|
||||
// Binary trie used to build the MMDB search tree
|
||||
// ---------------------------------------------------------------------
|
||||
final class MMDBTree
|
||||
{
|
||||
/** @var array<int, array{0:mixed,1:mixed}> node index => [left, right] */
|
||||
private $nodes = [[null, null]];
|
||||
|
||||
public function nodeCount(): int
|
||||
{
|
||||
return count($this->nodes);
|
||||
}
|
||||
|
||||
/**
|
||||
* @param int[] $bits 0/1 array, the path from the root
|
||||
* @param int $prefixLen how many bits of $bits to actually use
|
||||
* @param int $dataOffset byte offset of this record's value in the data section
|
||||
*/
|
||||
public function insert(array $bits, int $prefixLen, int $dataOffset): void
|
||||
{
|
||||
$current = 0;
|
||||
for ($i = 0; $i < $prefixLen; $i++) {
|
||||
$bit = $bits[$i];
|
||||
$isLast = ($i === $prefixLen - 1);
|
||||
$rec = $this->nodes[$current][$bit];
|
||||
|
||||
if ($isLast) {
|
||||
$this->nodes[$current][$bit] = ['data' => $dataOffset];
|
||||
continue;
|
||||
}
|
||||
|
||||
if ($rec === null) {
|
||||
$newIdx = count($this->nodes);
|
||||
$this->nodes[] = [null, null];
|
||||
$this->nodes[$current][$bit] = $newIdx;
|
||||
$current = $newIdx;
|
||||
} elseif (is_array($rec)) {
|
||||
// A less-specific network already terminates here; split it
|
||||
// so both children inherit its data, then keep descending.
|
||||
$newIdx = count($this->nodes);
|
||||
$this->nodes[] = [$rec, $rec];
|
||||
$this->nodes[$current][$bit] = $newIdx;
|
||||
$current = $newIdx;
|
||||
} else {
|
||||
$current = $rec;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Look up the data offset of whatever already-inserted network covers
|
||||
* this bit path (the "parent" network), without mutating the tree.
|
||||
* Returns null if no covering network has been inserted yet.
|
||||
*/
|
||||
public function lookupCoveringData(array $bits, int $prefixLen): ?int
|
||||
{
|
||||
$current = 0;
|
||||
for ($i = 0; $i < $prefixLen; $i++) {
|
||||
$bit = $bits[$i];
|
||||
$rec = $this->nodes[$current][$bit];
|
||||
if ($rec === null) {
|
||||
return null;
|
||||
}
|
||||
if (is_array($rec)) {
|
||||
return $rec['data'];
|
||||
}
|
||||
$current = $rec;
|
||||
}
|
||||
return null;
|
||||
}
|
||||
|
||||
/**
|
||||
* Serialize the tree to bytes using the smallest record size (24, 28,
|
||||
* or 32 bits) that fits every record value.
|
||||
*
|
||||
* @return array{0:string,1:int} [tree bytes, record size used]
|
||||
*/
|
||||
public function serialize(int $dataSectionLength): array
|
||||
{
|
||||
$nodeCount = count($this->nodes);
|
||||
$maxDataPointer = $dataSectionLength + $nodeCount + 16;
|
||||
$maxValue = max($nodeCount, $maxDataPointer);
|
||||
|
||||
if ($maxValue <= 0xFFFFFF) {
|
||||
$recordSize = 24;
|
||||
} elseif ($maxValue <= 0xFFFFFFF) {
|
||||
$recordSize = 28;
|
||||
} elseif ($maxValue <= 0xFFFFFFFF) {
|
||||
$recordSize = 32;
|
||||
} else {
|
||||
throw new RuntimeException('Database too large for a 32-bit record size.');
|
||||
}
|
||||
|
||||
$out = '';
|
||||
foreach ($this->nodes as $node) {
|
||||
$left = $this->recordValue($node[0], $nodeCount);
|
||||
$right = $this->recordValue($node[1], $nodeCount);
|
||||
$out .= $this->packPair($left, $right, $recordSize);
|
||||
}
|
||||
|
||||
return [$out, $recordSize];
|
||||
}
|
||||
|
||||
private function recordValue($rec, int $nodeCount): int
|
||||
{
|
||||
if ($rec === null) {
|
||||
return $nodeCount; // "not found" sentinel
|
||||
}
|
||||
if (is_array($rec)) {
|
||||
return $rec['data'] + $nodeCount + 16;
|
||||
}
|
||||
return $rec; // pointer to another node
|
||||
}
|
||||
|
||||
private function packPair(int $left, int $right, int $recordSize): string
|
||||
{
|
||||
if ($recordSize === 24) {
|
||||
return substr(pack('N', $left), 1, 3) . substr(pack('N', $right), 1, 3);
|
||||
}
|
||||
if ($recordSize === 32) {
|
||||
return pack('N', $left) . pack('N', $right);
|
||||
}
|
||||
// 28-bit: 7 bytes total, per the MMDB spec's packing scheme.
|
||||
$b0 = ($left >> 20) & 0xFF;
|
||||
$b1 = ($left >> 12) & 0xFF;
|
||||
$b2 = ($left >> 4) & 0xFF;
|
||||
$b3 = (($left & 0xF) << 4) | (($right >> 24) & 0xF);
|
||||
$b4 = ($right >> 16) & 0xFF;
|
||||
$b5 = ($right >> 8) & 0xFF;
|
||||
$b6 = $right & 0xFF;
|
||||
return chr($b0) . chr($b1) . chr($b2) . chr($b3) . chr($b4) . chr($b5) . chr($b6);
|
||||
}
|
||||
}
|
||||
|
||||
// ---------------------------------------------------------------------
|
||||
// Top-level writer: ties the tree, data section and metadata together
|
||||
// ---------------------------------------------------------------------
|
||||
final class MMDBWriter
|
||||
{
|
||||
private $ipVersion;
|
||||
private $totalDepth;
|
||||
private $tree;
|
||||
private $data;
|
||||
private $rawDataByOffset = [];
|
||||
private $pending = [];
|
||||
private $databaseType;
|
||||
private $languages;
|
||||
private $description;
|
||||
|
||||
/**
|
||||
* @param int $ipVersion 4 (IPv4-only tree) or 6 (dual-stack tree)
|
||||
* @param string $databaseType free-form name, e.g. "GeoIP-Custom"
|
||||
* @param string[] $languages language codes present in $description
|
||||
* @param array $description language code => human description
|
||||
*/
|
||||
public function __construct(
|
||||
int $ipVersion = 6,
|
||||
string $databaseType = 'Custom',
|
||||
array $languages = ['en'],
|
||||
array $description = ['en' => 'Custom MMDB database']
|
||||
) {
|
||||
if ($ipVersion !== 4 && $ipVersion !== 6) {
|
||||
throw new InvalidArgumentException('ipVersion must be 4 or 6');
|
||||
}
|
||||
$this->ipVersion = $ipVersion;
|
||||
$this->totalDepth = $ipVersion === 4 ? 32 : 128;
|
||||
$this->tree = new MMDBTree();
|
||||
$this->data = new MMDBDataSection();
|
||||
$this->databaseType = $databaseType;
|
||||
$this->languages = $languages;
|
||||
$this->description = $description;
|
||||
}
|
||||
|
||||
/**
|
||||
* Queue a network to be written. Records can be added in ANY order --
|
||||
* broader and narrower networks alike -- regardless of which one you
|
||||
* call this with first. At write() time, records are resolved from
|
||||
* broadest to narrowest so inheritance (see $inherit) always works
|
||||
* correctly no matter the call order.
|
||||
*
|
||||
* @param string $cidr e.g. "1.2.3.0/24", "2001:db8::/32", or a bare IP
|
||||
* @param mixed $data scalar/array/MMDBValue data to associate with the network
|
||||
* @param bool $inherit if true (default), and this network falls inside
|
||||
* a broader network also added to this writer,
|
||||
* fields from that broader record are merged in
|
||||
* first (this record's own fields still win on
|
||||
* conflicts).
|
||||
*/
|
||||
public function addRecord(string $cidr, $data, bool $inherit = true): void
|
||||
{
|
||||
[$ip, $prefixLen] = $this->parseCidr($cidr);
|
||||
[$bits, $treePrefixLen] = $this->ipToTreeBits($ip, $prefixLen);
|
||||
$this->pending[] = [$bits, $treePrefixLen, $data, $inherit, count($this->pending)];
|
||||
}
|
||||
|
||||
/**
|
||||
* Resolve all queued records (broadest network first, so inheritance
|
||||
* is correct regardless of the order addRecord() was called in) and
|
||||
* insert them into the tree.
|
||||
*/
|
||||
private function resolveRecords(): void
|
||||
{
|
||||
$records = $this->pending;
|
||||
usort($records, function ($a, $b) {
|
||||
return $a[1] <=> $b[1] ?: $a[4] <=> $b[4]; // prefix length asc, then original call order
|
||||
});
|
||||
|
||||
foreach ($records as [$bits, $treePrefixLen, $data, $inherit]) {
|
||||
if ($inherit) {
|
||||
$parentOffset = $this->tree->lookupCoveringData($bits, $treePrefixLen);
|
||||
if ($parentOffset !== null && isset($this->rawDataByOffset[$parentOffset])) {
|
||||
$data = $this->mergeWithParent($this->rawDataByOffset[$parentOffset], $data);
|
||||
}
|
||||
}
|
||||
|
||||
$offset = $this->data->internTop($data);
|
||||
$this->rawDataByOffset[$offset] = $data;
|
||||
$this->tree->insert($bits, $treePrefixLen, $offset);
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Shallow-merge a child record over a parent record: parent fields are
|
||||
* inherited, and any key the child also sets overrides the parent's
|
||||
* value for that key. Non-map values (or MMDBValue-wrapped non-maps)
|
||||
* are left untouched -- the child value simply replaces the parent.
|
||||
*/
|
||||
private function mergeWithParent($parentData, $data)
|
||||
{
|
||||
$parentArr = $parentData instanceof MMDBValue && $parentData->type === MMDBType::MAP
|
||||
? $parentData->value
|
||||
: $parentData;
|
||||
$childArr = $data instanceof MMDBValue && $data->type === MMDBType::MAP
|
||||
? $data->value
|
||||
: $data;
|
||||
|
||||
if (!$this->isMap($parentArr) || !$this->isMap($childArr)) {
|
||||
return $data; // nothing sensible to merge; child value wins outright
|
||||
}
|
||||
|
||||
return array_replace($parentArr, $childArr);
|
||||
}
|
||||
|
||||
private function isMap($v): bool
|
||||
{
|
||||
if (!is_array($v) || $v === []) {
|
||||
return false;
|
||||
}
|
||||
$i = 0;
|
||||
foreach ($v as $k => $_) {
|
||||
if ($k !== $i++) {
|
||||
return true; // has at least one non-sequential/string key -> it's a map
|
||||
}
|
||||
}
|
||||
return false; // it's a plain list
|
||||
}
|
||||
|
||||
public function write(string $path): void
|
||||
{
|
||||
$this->resolveRecords();
|
||||
|
||||
[$treeBytes, $recordSize] = $this->tree->serialize(strlen($this->data->bytes()));
|
||||
|
||||
$metadata = [
|
||||
'node_count' => MMDBValue::uint32($this->tree->nodeCount()),
|
||||
'record_size' => MMDBValue::uint16($recordSize),
|
||||
'ip_version' => MMDBValue::uint16($this->ipVersion),
|
||||
'database_type' => MMDBValue::string($this->databaseType),
|
||||
'languages' => array_values($this->languages),
|
||||
'binary_format_major_version' => MMDBValue::uint16(2),
|
||||
'binary_format_minor_version' => MMDBValue::uint16(0),
|
||||
'build_epoch' => MMDBValue::uint64(time()),
|
||||
'description' => $this->description,
|
||||
];
|
||||
|
||||
$metadataBytes = MMDBEncoder::encode(MMDBValue::map($metadata));
|
||||
|
||||
$separator = str_repeat("\x00", 16);
|
||||
$marker = "\xAB\xCD\xEFMaxMind.com";
|
||||
|
||||
$blob = $treeBytes . $separator . $this->data->bytes() . $marker . $metadataBytes;
|
||||
|
||||
if (file_put_contents($path, $blob) === false) {
|
||||
throw new RuntimeException("Failed to write $path");
|
||||
}
|
||||
}
|
||||
|
||||
private function parseCidr(string $cidr): array
|
||||
{
|
||||
if (strpos($cidr, '/') !== false) {
|
||||
[$ip, $prefix] = explode('/', $cidr, 2);
|
||||
return [$ip, (int) $prefix];
|
||||
}
|
||||
$isV4 = strpos($cidr, ':') === false;
|
||||
return [$cidr, $isV4 ? 32 : 128];
|
||||
}
|
||||
|
||||
private function ipToTreeBits(string $ip, int $prefixLen): array
|
||||
{
|
||||
$packed = @inet_pton($ip);
|
||||
if ($packed === false) {
|
||||
throw new InvalidArgumentException("Invalid IP address: $ip");
|
||||
}
|
||||
$isV4 = strlen($packed) === 4;
|
||||
|
||||
if ($isV4 && $this->totalDepth === 128) {
|
||||
// Embed IPv4 networks under ::/96, as MaxMind's own dual-stack
|
||||
// databases do.
|
||||
$prefix = array_fill(0, 96, 0);
|
||||
$treePrefixLen = 96 + $prefixLen;
|
||||
} else {
|
||||
$prefix = [];
|
||||
$treePrefixLen = $prefixLen;
|
||||
}
|
||||
|
||||
$bits = $prefix;
|
||||
foreach (str_split($packed) as $byte) {
|
||||
$b = ord($byte);
|
||||
for ($i = 7; $i >= 0; $i--) {
|
||||
$bits[] = ($b >> $i) & 1;
|
||||
}
|
||||
}
|
||||
|
||||
return [$bits, $treePrefixLen];
|
||||
}
|
||||
}
|
||||
395
lib/MMDB_ASN_Extractor.php
Normal file
395
lib/MMDB_ASN_Extractor.php
Normal file
@@ -0,0 +1,395 @@
|
||||
<?php
|
||||
|
||||
/**
|
||||
* GeoLite2ASNExtractor
|
||||
*
|
||||
* Pure-PHP reader for MaxMind's GeoLite2-ASN.mmdb that walks the entire
|
||||
* binary search tree and returns every network grouped by ASN, e.g.:
|
||||
*
|
||||
* [
|
||||
* "as1400" => ["1.0.0.0/32", "1.0.0.1/32", ...],
|
||||
* "as13335" => ["1.1.1.0/24", ...],
|
||||
* ]
|
||||
*
|
||||
* No Composer dependency required — implements the MaxMind DB binary
|
||||
* format (search tree + data section) directly per the public spec:
|
||||
* https://maxmind.github.io/MaxMind-DB/
|
||||
*
|
||||
* Usage:
|
||||
* $extractor = new GeoLite2ASNExtractor('/path/to/GeoLite2-ASN.mmdb');
|
||||
* $asnMap = $extractor->extract();
|
||||
*
|
||||
* Notes:
|
||||
* - GeoLite2-ASN.mmdb is normally built as an IPv6 tree with the IPv4
|
||||
* address space embedded under ::/96. This class detects that and
|
||||
* emits plain IPv4 CIDRs (e.g. "1.0.0.0/32"), skipping true
|
||||
* IPv6-only ranges. Set $includeIPv6 = true in extract() if you
|
||||
* want IPv6 ranges included too (returned as e.g. "2606:4700::/32").
|
||||
* - The whole file is loaded into memory once (file_get_contents).
|
||||
* GeoLite2-ASN.mmdb is tens of MB, which is fine for most setups,
|
||||
* but be aware if running under a memory-constrained environment.
|
||||
* - Walking the full tree is O(number of tree nodes), which can be a
|
||||
* few million recursive calls for the ASN database. This can take
|
||||
* anywhere from several seconds to a couple of minutes depending on
|
||||
* hardware. Consider raising max_execution_time for CLI/cron use.
|
||||
*/
|
||||
class GeoLite2ASNExtractor
|
||||
{
|
||||
private const METADATA_MARKER = "\xab\xcd\xefMaxMind.com";
|
||||
|
||||
private string $data;
|
||||
private array $metadata = [];
|
||||
|
||||
private int $nodeCount = 0;
|
||||
private int $recordSize = 0;
|
||||
private int $nodeByteSize = 0;
|
||||
private int $searchTreeSize = 0;
|
||||
private int $dataSectionStart = 0;
|
||||
private int $ipVersion = 6;
|
||||
|
||||
public function __construct(string $mmdbPath)
|
||||
{
|
||||
if (!is_readable($mmdbPath)) {
|
||||
throw new \RuntimeException("Cannot read file: {$mmdbPath}");
|
||||
}
|
||||
|
||||
$contents = file_get_contents($mmdbPath);
|
||||
if ($contents === false) {
|
||||
throw new \RuntimeException("Failed to read file: {$mmdbPath}");
|
||||
}
|
||||
|
||||
$this->data = $contents;
|
||||
$this->parseMetadata();
|
||||
}
|
||||
|
||||
/**
|
||||
* Optional convenience helper: download an .mmdb file over HTTP(S)
|
||||
* and construct an extractor from it.
|
||||
*/
|
||||
public static function fromUrl(string $url, ?string $saveTo = null): self
|
||||
{
|
||||
$tmpPath = $saveTo ?? tempnam(sys_get_temp_dir(), 'mmdb_');
|
||||
|
||||
$ch = curl_init($url);
|
||||
$fh = fopen($tmpPath, 'wb');
|
||||
if ($fh === false) {
|
||||
throw new \RuntimeException("Cannot open temp file for writing: {$tmpPath}");
|
||||
}
|
||||
|
||||
curl_setopt_array($ch, [
|
||||
CURLOPT_FILE => $fh,
|
||||
CURLOPT_FOLLOWLOCATION => true,
|
||||
CURLOPT_MAXREDIRS => 5,
|
||||
CURLOPT_TIMEOUT => 300,
|
||||
CURLOPT_FAILONERROR => true,
|
||||
CURLOPT_USERAGENT => 'GeoLite2ASNExtractor/1.0',
|
||||
]);
|
||||
|
||||
$ok = curl_exec($ch);
|
||||
$err = curl_error($ch);
|
||||
curl_close($ch);
|
||||
fclose($fh);
|
||||
|
||||
if ($ok === false) {
|
||||
if ($saveTo === null) {
|
||||
@unlink($tmpPath);
|
||||
}
|
||||
throw new \RuntimeException("Download failed: {$err}");
|
||||
}
|
||||
|
||||
return new self($tmpPath);
|
||||
}
|
||||
|
||||
/**
|
||||
* Walk the entire tree and return ["as<N>" => ["a.b.c.d/x", ...], ...]
|
||||
*/
|
||||
public function extract(bool $includeIPv6 = false): array
|
||||
{
|
||||
$result = [];
|
||||
$this->walk(0, '', $result, $includeIPv6);
|
||||
return $result;
|
||||
}
|
||||
|
||||
public function getMetadata(): array
|
||||
{
|
||||
return $this->metadata;
|
||||
}
|
||||
|
||||
// ------------------------------------------------------------------
|
||||
// Search tree traversal
|
||||
// ------------------------------------------------------------------
|
||||
|
||||
/**
|
||||
* @param string $bits '0'/'1' characters representing the path taken so far
|
||||
*/
|
||||
private function walk(int $recordValue, string $bits, array &$result, bool $includeIPv6): void
|
||||
{
|
||||
if ($recordValue === $this->nodeCount) {
|
||||
// Empty branch, no data assigned here.
|
||||
return;
|
||||
}
|
||||
|
||||
if ($recordValue > $this->nodeCount) {
|
||||
// Leaf: record points into the data section.
|
||||
//
|
||||
// Per the MaxMind DB spec, the offset within the data section is
|
||||
// (record_value - node_count - 16), and the data section itself
|
||||
// starts at (search_tree_size + 16) — the two 16s cancel out, so
|
||||
// the correct absolute file offset is search_tree_size plus
|
||||
// (record_value - node_count). Using data_section_start here
|
||||
// instead would shift every leaf read by 16 bytes.
|
||||
$absoluteOffset = $this->searchTreeSize + ($recordValue - $this->nodeCount);
|
||||
[$record, ] = $this->decodeData($absoluteOffset);
|
||||
$this->addResult($bits, $record, $result, $includeIPv6);
|
||||
return;
|
||||
}
|
||||
|
||||
// Otherwise it's an index of another node — recurse both children.
|
||||
[$left, $right] = $this->readNode($recordValue);
|
||||
$this->walk($left, $bits . '0', $result, $includeIPv6);
|
||||
$this->walk($right, $bits . '1', $result, $includeIPv6);
|
||||
}
|
||||
|
||||
private function readNode(int $nodeNumber): array
|
||||
{
|
||||
$offset = $nodeNumber * $this->nodeByteSize;
|
||||
$bytes = substr($this->data, $offset, $this->nodeByteSize);
|
||||
|
||||
if ($this->recordSize === 24) {
|
||||
$left = (ord($bytes[0]) << 16) | (ord($bytes[1]) << 8) | ord($bytes[2]);
|
||||
$right = (ord($bytes[3]) << 16) | (ord($bytes[4]) << 8) | ord($bytes[5]);
|
||||
} elseif ($this->recordSize === 28) {
|
||||
$middle = ord($bytes[3]);
|
||||
$left = (ord($bytes[0]) << 16) | (ord($bytes[1]) << 8) | ord($bytes[2]);
|
||||
$left |= ($middle >> 4) << 24;
|
||||
$right = (($middle & 0x0f) << 24) | (ord($bytes[4]) << 16) | (ord($bytes[5]) << 8) | ord($bytes[6]);
|
||||
} elseif ($this->recordSize === 32) {
|
||||
$left = (ord($bytes[0]) << 24) | (ord($bytes[1]) << 16) | (ord($bytes[2]) << 8) | ord($bytes[3]);
|
||||
$right = (ord($bytes[4]) << 24) | (ord($bytes[5]) << 16) | (ord($bytes[6]) << 8) | ord($bytes[7]);
|
||||
} else {
|
||||
throw new \RuntimeException("Unsupported record_size: {$this->recordSize}");
|
||||
}
|
||||
|
||||
return [$left, $right];
|
||||
}
|
||||
|
||||
private function addResult(string $bits, $record, array &$result, bool $includeIPv6): void
|
||||
{
|
||||
if (!is_array($record) || !isset($record['autonomous_system_number'])) {
|
||||
return; // no ASN data at this leaf
|
||||
}
|
||||
|
||||
$asn = 'as' . $record['autonomous_system_number'];
|
||||
$prefixLen = strlen($bits);
|
||||
|
||||
if ($this->ipVersion === 6) {
|
||||
if ($prefixLen >= 96 && substr($bits, 0, 96) === str_repeat('0', 96)) {
|
||||
// Embedded IPv4 space (::/96).
|
||||
$ipv4Bits = substr($bits, 96);
|
||||
$cidr = $this->bitsToIPv4($ipv4Bits) . '/' . strlen($ipv4Bits);
|
||||
$result[$asn][] = $cidr;
|
||||
} elseif ($includeIPv6) {
|
||||
$cidr = $this->bitsToIPv6($bits) . '/' . $prefixLen;
|
||||
$result[$asn][] = $cidr;
|
||||
}
|
||||
// else: real IPv6 range but caller doesn't want IPv6 — skip.
|
||||
} else {
|
||||
// Pure IPv4 tree (older / rare db builds).
|
||||
$cidr = $this->bitsToIPv4($bits) . '/' . $prefixLen;
|
||||
$result[$asn][] = $cidr;
|
||||
}
|
||||
}
|
||||
|
||||
private function bitsToIPv4(string $bits): string
|
||||
{
|
||||
$bits = str_pad($bits, 32, '0'); // pad host bits with 0 -> network address
|
||||
$octets = [];
|
||||
for ($i = 0; $i < 4; $i++) {
|
||||
$octets[] = bindec(substr($bits, $i * 8, 8));
|
||||
}
|
||||
return implode('.', $octets);
|
||||
}
|
||||
|
||||
private function bitsToIPv6(string $bits): string
|
||||
{
|
||||
$bits = str_pad($bits, 128, '0');
|
||||
$groups = [];
|
||||
for ($i = 0; $i < 8; $i++) {
|
||||
$groups[] = dechex(bindec(substr($bits, $i * 16, 16)));
|
||||
}
|
||||
$expanded = implode(':', $groups);
|
||||
return inet_ntop(inet_pton($expanded)) ?: $expanded;
|
||||
}
|
||||
|
||||
// ------------------------------------------------------------------
|
||||
// Metadata / data section decoding (MaxMind DB data format)
|
||||
// ------------------------------------------------------------------
|
||||
|
||||
private function parseMetadata(): void
|
||||
{
|
||||
$pos = strrpos($this->data, self::METADATA_MARKER);
|
||||
if ($pos === false) {
|
||||
throw new \RuntimeException('MaxMind DB metadata marker not found — not a valid .mmdb file');
|
||||
}
|
||||
|
||||
$offset = $pos + strlen(self::METADATA_MARKER);
|
||||
[$metadata, ] = $this->decodeData($offset);
|
||||
|
||||
if (!is_array($metadata) || !isset($metadata['node_count'], $metadata['record_size'], $metadata['ip_version'])) {
|
||||
throw new \RuntimeException('Malformed MaxMind DB metadata');
|
||||
}
|
||||
|
||||
$this->metadata = $metadata;
|
||||
$this->nodeCount = (int) $metadata['node_count'];
|
||||
$this->recordSize = (int) $metadata['record_size'];
|
||||
$this->ipVersion = (int) $metadata['ip_version'];
|
||||
$this->nodeByteSize = (int) (($this->recordSize * 2) / 8);
|
||||
$this->searchTreeSize = $this->nodeCount * $this->nodeByteSize;
|
||||
$this->dataSectionStart = $this->searchTreeSize + 16; // 16-byte all-zero separator
|
||||
}
|
||||
|
||||
/**
|
||||
* Decodes one MaxMind DB data item starting at $offset.
|
||||
* Returns [decodedValue, offsetAfterThisItem].
|
||||
*/
|
||||
private function decodeData(int $offset): array
|
||||
{
|
||||
$ctrl = ord($this->data[$offset]);
|
||||
$offset++;
|
||||
|
||||
$type = $ctrl >> 5; // top 3 bits
|
||||
$size = $ctrl & 0x1f; // bottom 5 bits
|
||||
|
||||
if ($type === 0) {
|
||||
// Extended type: real type = next byte + 7
|
||||
$type = 7 + ord($this->data[$offset]);
|
||||
$offset++;
|
||||
}
|
||||
|
||||
if ($type === 1) {
|
||||
return $this->decodePointer($ctrl, $offset);
|
||||
}
|
||||
|
||||
if ($type !== 14) { // not boolean — booleans store their value in $size directly
|
||||
if ($size === 29) {
|
||||
$size = 29 + ord($this->data[$offset]);
|
||||
$offset += 1;
|
||||
} elseif ($size === 30) {
|
||||
$size = 285 + $this->readUint($offset, 2);
|
||||
$offset += 2;
|
||||
} elseif ($size === 31) {
|
||||
$size = 65821 + $this->readUint($offset, 3);
|
||||
$offset += 3;
|
||||
}
|
||||
}
|
||||
|
||||
switch ($type) {
|
||||
case 2: // utf8_string
|
||||
case 4: // bytes
|
||||
$value = substr($this->data, $offset, $size);
|
||||
$offset += $size;
|
||||
return [$value, $offset];
|
||||
|
||||
case 3: // double
|
||||
$bytes = substr($this->data, $offset, 8);
|
||||
$offset += 8;
|
||||
$u = unpack('E', $bytes);
|
||||
return [$u[1], $offset];
|
||||
|
||||
case 5: // uint16
|
||||
case 6: // uint32
|
||||
case 9: // uint64 (may lose precision above 2^63 — not expected for ASN fields)
|
||||
$value = $this->readUint($offset, $size);
|
||||
$offset += $size;
|
||||
return [$value, $offset];
|
||||
|
||||
case 7: // map
|
||||
$map = [];
|
||||
for ($i = 0; $i < $size; $i++) {
|
||||
[$key, $offset] = $this->decodeData($offset);
|
||||
[$val, $offset] = $this->decodeData($offset);
|
||||
$map[$key] = $val;
|
||||
}
|
||||
return [$map, $offset];
|
||||
|
||||
case 8: // int32
|
||||
$value = $this->readUint($offset, $size);
|
||||
if ($size > 0 && ($value & (1 << (8 * $size - 1)))) {
|
||||
$value -= (1 << (8 * $size));
|
||||
}
|
||||
$offset += $size;
|
||||
return [$value, $offset];
|
||||
|
||||
case 10: // uint128 — returned as a hex string (not used by ASN records)
|
||||
$hex = bin2hex(substr($this->data, $offset, $size));
|
||||
$offset += $size;
|
||||
return [$hex, $offset];
|
||||
|
||||
case 11: // array
|
||||
$arr = [];
|
||||
for ($i = 0; $i < $size; $i++) {
|
||||
[$val, $offset] = $this->decodeData($offset);
|
||||
$arr[] = $val;
|
||||
}
|
||||
return [$arr, $offset];
|
||||
|
||||
case 13: // end marker
|
||||
return [null, $offset];
|
||||
|
||||
case 14: // boolean — value is $size itself (0 or 1)
|
||||
return [$size === 1, $offset];
|
||||
|
||||
case 15: // float
|
||||
$bytes = substr($this->data, $offset, 4);
|
||||
$offset += 4;
|
||||
$u = unpack('G', $bytes);
|
||||
return [$u[1], $offset];
|
||||
|
||||
default:
|
||||
throw new \RuntimeException("Unsupported MaxMind DB data type: {$type} at offset {$offset}");
|
||||
}
|
||||
}
|
||||
|
||||
private function decodePointer(int $ctrl, int $offset): array
|
||||
{
|
||||
$ptrSize = ($ctrl >> 3) & 0x03;
|
||||
$valueHigh = $ctrl & 0x07;
|
||||
|
||||
switch ($ptrSize) {
|
||||
case 0:
|
||||
$pointer = ($valueHigh << 8) | ord($this->data[$offset]);
|
||||
$offset += 1;
|
||||
$base = 0;
|
||||
break;
|
||||
case 1:
|
||||
$pointer = ($valueHigh << 16) | $this->readUint($offset, 2);
|
||||
$offset += 2;
|
||||
$base = 2048;
|
||||
break;
|
||||
case 2:
|
||||
$pointer = ($valueHigh << 24) | $this->readUint($offset, 3);
|
||||
$offset += 3;
|
||||
$base = 526336;
|
||||
break;
|
||||
default: // 3
|
||||
$pointer = $this->readUint($offset, 4);
|
||||
$offset += 4;
|
||||
$base = 0;
|
||||
break;
|
||||
}
|
||||
|
||||
$target = $this->dataSectionStart + $pointer + $base;
|
||||
[$value, ] = $this->decodeData($target);
|
||||
|
||||
return [$value, $offset];
|
||||
}
|
||||
|
||||
private function readUint(int $offset, int $numBytes): int
|
||||
{
|
||||
$value = 0;
|
||||
for ($i = 0; $i < $numBytes; $i++) {
|
||||
$value = ($value << 8) | ord($this->data[$offset + $i]);
|
||||
}
|
||||
return $value;
|
||||
}
|
||||
}
|
||||
628
lib/fuckhtml.php
Normal file
628
lib/fuckhtml.php
Normal file
@@ -0,0 +1,628 @@
|
||||
<?php
|
||||
class fuckhtml{
|
||||
|
||||
public function __construct($html = null, $isfile = false){
|
||||
|
||||
if($html !== null){
|
||||
|
||||
$this->load($html, $isfile);
|
||||
}
|
||||
}
|
||||
|
||||
public function load($html, $isfile = false){
|
||||
|
||||
if(is_array($html)){
|
||||
|
||||
if(!array_key_exists("innerHTML", $html)){
|
||||
|
||||
throw new Exception("(load) Supplied array doesn't contain an innerHTML index");
|
||||
}
|
||||
$html = $html["innerHTML"];
|
||||
}
|
||||
|
||||
if($isfile){
|
||||
|
||||
$handle = fopen($html, "r");
|
||||
$fetch = fread($handle, filesize($html));
|
||||
fclose($handle);
|
||||
|
||||
$this->html = $fetch;
|
||||
}else{
|
||||
|
||||
$this->html = $html;
|
||||
}
|
||||
|
||||
$this->strlen = strlen($this->html);
|
||||
}
|
||||
|
||||
public function getloadedhtml(){
|
||||
|
||||
return $this->html;
|
||||
}
|
||||
|
||||
public function getElementsByTagName(string $tagname){
|
||||
|
||||
$out = [];
|
||||
|
||||
/*
|
||||
Scrape start of the tag. Example
|
||||
<div class="mydiv"> ...
|
||||
*/
|
||||
|
||||
if($tagname == "*"){
|
||||
|
||||
$tagname = '[A-Za-z0-9._-]+';
|
||||
}else{
|
||||
|
||||
$tagname = preg_quote(strtolower($tagname));
|
||||
}
|
||||
|
||||
preg_match_all(
|
||||
'/<\s*(' . $tagname . ')(\s(?:[^>\'"]*|"[^"]*"|\'[^\']*\')+)?\s*>/i',
|
||||
/* '/<\s*(' . $tagname . ')(\s[\S\s]*?)?>/i', */
|
||||
$this->html,
|
||||
$starting_tags,
|
||||
PREG_OFFSET_CAPTURE
|
||||
);
|
||||
|
||||
for($i=0; $i<count($starting_tags[0]); $i++){
|
||||
|
||||
/*
|
||||
Parse attributes
|
||||
*/
|
||||
$attributes = [];
|
||||
|
||||
preg_match_all(
|
||||
'/([^\/\s\\=]+)(?:\s*=\s*("[^"]*"|\'[^\']*\'|[^\s]*))?/i',
|
||||
$starting_tags[2][$i][0],
|
||||
$regex_attributes
|
||||
);
|
||||
|
||||
for($k=0; $k<count($regex_attributes[0]); $k++){
|
||||
|
||||
if(trim($regex_attributes[2][$k]) == ""){
|
||||
|
||||
$attributes[$regex_attributes[1][$k]] =
|
||||
"true";
|
||||
|
||||
continue;
|
||||
}
|
||||
|
||||
$attributes[strtolower($regex_attributes[1][$k])] =
|
||||
trim($regex_attributes[2][$k], "'\" \n\r\t\v\x00");
|
||||
}
|
||||
|
||||
$out[] = [
|
||||
"tagName" => strtolower($starting_tags[1][$i][0]),
|
||||
"startPos" => $starting_tags[0][$i][1],
|
||||
"endPos" => 0,
|
||||
"startTag" => $starting_tags[0][$i][0],
|
||||
"attributes" => $attributes,
|
||||
"innerHTML" => null
|
||||
];
|
||||
}
|
||||
|
||||
/*
|
||||
Get innerHTML
|
||||
*/
|
||||
// get closing tag positions
|
||||
preg_match_all(
|
||||
'/<\s*\/\s*(' . $tagname . ')\s*>/i',
|
||||
$this->html,
|
||||
$regex_closing_tags,
|
||||
PREG_OFFSET_CAPTURE
|
||||
);
|
||||
|
||||
// merge opening and closing tags together
|
||||
for($i=0; $i<count($regex_closing_tags[1]); $i++){
|
||||
|
||||
$out[] = [
|
||||
"tagName" => strtolower($regex_closing_tags[1][$i][0]),
|
||||
"endTag" => $regex_closing_tags[0][$i][0],
|
||||
"startPos" => $regex_closing_tags[0][$i][1]
|
||||
];
|
||||
}
|
||||
|
||||
usort(
|
||||
$out,
|
||||
function($a, $b){
|
||||
|
||||
return $a["startPos"] > $b["startPos"];
|
||||
}
|
||||
);
|
||||
|
||||
// compute the indent level for each element
|
||||
$level = [];
|
||||
$count = count($out);
|
||||
|
||||
for($i=0; $i<$count; $i++){
|
||||
|
||||
if(!isset($level[$out[$i]["tagName"]])){
|
||||
|
||||
$level[$out[$i]["tagName"]] = 0;
|
||||
}
|
||||
|
||||
if(isset($out[$i]["startTag"])){
|
||||
|
||||
// encountered starting tag
|
||||
$level[$out[$i]["tagName"]]++;
|
||||
$out[$i]["level"] = $level[$out[$i]["tagName"]];
|
||||
}else{
|
||||
|
||||
// encountered closing tag
|
||||
$out[$i]["level"] = $level[$out[$i]["tagName"]];
|
||||
$level[$out[$i]["tagName"]]--;
|
||||
}
|
||||
}
|
||||
|
||||
// if the indent level is the same for a div,
|
||||
// we encountered _THE_ closing tag
|
||||
for($i=0; $i<$count; $i++){
|
||||
|
||||
if(!isset($out[$i]["startTag"])){
|
||||
|
||||
continue;
|
||||
}
|
||||
|
||||
for($k=$i; $k<$count; $k++){
|
||||
|
||||
if(
|
||||
isset($out[$k]["endTag"]) &&
|
||||
$out[$i]["tagName"] == $out[$k]["tagName"] &&
|
||||
$out[$i]["level"]
|
||||
=== $out[$k]["level"]
|
||||
){
|
||||
|
||||
$startlen = strlen($out[$i]["startTag"]);
|
||||
$endlen = strlen($out[$k]["endTag"]);
|
||||
|
||||
$out[$i]["endPos"] = $out[$k]["startPos"] + $endlen;
|
||||
|
||||
$out[$i]["innerHTML"] =
|
||||
substr(
|
||||
$this->html,
|
||||
$out[$i]["startPos"] + $startlen,
|
||||
$out[$k]["startPos"] - ($out[$i]["startPos"] + $startlen)
|
||||
);
|
||||
|
||||
$out[$i]["outerHTML"] =
|
||||
substr(
|
||||
$this->html,
|
||||
$out[$i]["startPos"],
|
||||
$out[$k]["startPos"] - $out[$i]["startPos"] + $endlen
|
||||
);
|
||||
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// filter out ending divs
|
||||
for($i=0; $i<$count; $i++){
|
||||
|
||||
if(isset($out[$i]["endTag"])){
|
||||
|
||||
unset($out[$i]);
|
||||
}
|
||||
|
||||
unset($out[$i]["startTag"]);
|
||||
}
|
||||
|
||||
return array_values($out);
|
||||
}
|
||||
|
||||
public function getElementsByAttributeName(string $name, $collection = null){
|
||||
|
||||
if($collection === null){
|
||||
|
||||
$collection = $this->getElementsByTagName("*");
|
||||
}elseif(is_string($collection)){
|
||||
|
||||
$collection = $this->getElementsByTagName($collection);
|
||||
}
|
||||
|
||||
$return = [];
|
||||
foreach($collection as $elem){
|
||||
|
||||
foreach($elem["attributes"] as $attrib_name => $attrib_value){
|
||||
|
||||
if($attrib_name == $name){
|
||||
|
||||
$return[] = $elem;
|
||||
continue 2;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return $return;
|
||||
}
|
||||
|
||||
public function getElementsByFuzzyAttributeValue(string $name, string $value, $collection = null){
|
||||
|
||||
$elems = $this->getElementsByAttributeName($name, $collection);
|
||||
|
||||
$value =
|
||||
explode(
|
||||
" ",
|
||||
trim(
|
||||
preg_replace(
|
||||
'/\s+/',
|
||||
" ",
|
||||
$value
|
||||
)
|
||||
)
|
||||
);
|
||||
|
||||
$return = [];
|
||||
|
||||
foreach($elems as $elem){
|
||||
|
||||
foreach($elem["attributes"] as $attrib_name => $attrib_value){
|
||||
|
||||
$attrib_value =
|
||||
explode(
|
||||
" ",
|
||||
trim(
|
||||
preg_replace(
|
||||
'/\s+/',
|
||||
" ",
|
||||
$attrib_value
|
||||
)
|
||||
)
|
||||
);
|
||||
|
||||
$ac = count($attrib_value);
|
||||
$nc = count($value);
|
||||
$cr = 0;
|
||||
|
||||
for($i=0; $i<$nc; $i++){
|
||||
|
||||
for($k=0; $k<$ac; $k++){
|
||||
|
||||
if($value[$i] == $attrib_value[$k]){
|
||||
|
||||
$cr++;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if($cr === $nc){
|
||||
|
||||
$return[] = $elem;
|
||||
continue 2;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return $return;
|
||||
}
|
||||
|
||||
public function getElementsByAttributeValue(string $name, string $value, $collection = null){
|
||||
|
||||
$elems = $this->getElementsByAttributeName($name, $collection);
|
||||
|
||||
$return = [];
|
||||
|
||||
foreach($elems as $elem){
|
||||
|
||||
foreach($elem["attributes"] as $attrib_name => $attrib_value){
|
||||
|
||||
if($attrib_value == $value){
|
||||
|
||||
$return[] = $elem;
|
||||
continue 2;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return $return;
|
||||
}
|
||||
|
||||
public function getElementById(string $idname, $collection = null){
|
||||
|
||||
$id = $this->getElementsByAttributeValue("id", $idname, $collection);
|
||||
|
||||
if(count($id) !== 0){
|
||||
|
||||
return $id[0];
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
public function getElementsByClassName(string $classname, $collection = null){
|
||||
|
||||
return $this->getElementsByFuzzyAttributeValue("class", $classname, $collection);
|
||||
}
|
||||
|
||||
public function getTextContent($html, $whitespace = false, $trim = true){
|
||||
|
||||
if(is_array($html)){
|
||||
|
||||
if(!array_key_exists("innerHTML", $html)){
|
||||
|
||||
throw new Exception("(getTextContent) Supplied array doesn't contain an innerHTML index");
|
||||
}
|
||||
|
||||
$html = $html["innerHTML"];
|
||||
}
|
||||
|
||||
$html = preg_split('/\n|<\/?br>/i', $html);
|
||||
|
||||
$out = "";
|
||||
for($i=0; $i<count($html); $i++){
|
||||
|
||||
$tmp =
|
||||
html_entity_decode(
|
||||
strip_tags(
|
||||
$html[$i]
|
||||
),
|
||||
ENT_QUOTES | ENT_XML1, "UTF-8"
|
||||
);
|
||||
|
||||
if($trim){
|
||||
|
||||
$tmp = trim($tmp);
|
||||
}
|
||||
|
||||
$out .= $tmp;
|
||||
|
||||
if($whitespace === true){
|
||||
|
||||
$out .= "\n";
|
||||
}else{
|
||||
|
||||
$out .= " ";
|
||||
}
|
||||
}
|
||||
|
||||
if($trim){
|
||||
|
||||
return trim($out);
|
||||
}
|
||||
|
||||
return $out;
|
||||
}
|
||||
|
||||
public function parseJsObject(string $json){
|
||||
|
||||
$bracket = false;
|
||||
$is_close_bracket = false;
|
||||
$escape = false;
|
||||
$lastchar = false;
|
||||
$json_out = null;
|
||||
$last_char = null;
|
||||
|
||||
$keyword_check = null;
|
||||
|
||||
for($i=0; $i<strlen($json); $i++){
|
||||
|
||||
switch($json[$i]){
|
||||
|
||||
case "\"":
|
||||
case "'":
|
||||
if($escape === true){
|
||||
|
||||
break;
|
||||
}
|
||||
|
||||
if($json[$i] == $bracket){
|
||||
|
||||
$bracket = false;
|
||||
$is_close_bracket = true;
|
||||
|
||||
}else{
|
||||
|
||||
if($bracket === false){
|
||||
|
||||
$bracket = $json[$i];
|
||||
}
|
||||
}
|
||||
break;
|
||||
|
||||
default:
|
||||
$is_close_bracket = false;
|
||||
break;
|
||||
}
|
||||
|
||||
if(
|
||||
$json[$i] == "\\" &&
|
||||
!(
|
||||
$lastchar !== false &&
|
||||
$lastchar . $json[$i] == "\\\\"
|
||||
)
|
||||
){
|
||||
|
||||
$escape = true;
|
||||
}else{
|
||||
|
||||
$escape = false;
|
||||
}
|
||||
|
||||
if(
|
||||
$bracket === false &&
|
||||
$is_close_bracket === false
|
||||
){
|
||||
|
||||
// do keyword check
|
||||
$keyword_check .= $json[$i];
|
||||
|
||||
if(in_array($json[$i], [":", "{"])){
|
||||
|
||||
$keyword_check = substr($keyword_check, 0, -1);
|
||||
|
||||
if(
|
||||
preg_match(
|
||||
'/function|array|return/i',
|
||||
$keyword_check
|
||||
)
|
||||
){
|
||||
|
||||
$json_out =
|
||||
preg_replace(
|
||||
'/[{"]*' . preg_quote($keyword_check, "/") . '$/',
|
||||
"",
|
||||
$json_out
|
||||
);
|
||||
}
|
||||
|
||||
$keyword_check = null;
|
||||
}
|
||||
|
||||
// here we know we're not iterating over a quoted string
|
||||
switch($json[$i]){
|
||||
|
||||
case "[":
|
||||
case "{":
|
||||
$json_out .= $json[$i];
|
||||
break;
|
||||
|
||||
case "]":
|
||||
case "}":
|
||||
case ",":
|
||||
case ":":
|
||||
if(!in_array($last_char, ["[", "{", "}", "]", "\""])){
|
||||
|
||||
$json_out .= "\"";
|
||||
}
|
||||
|
||||
$json_out .= $json[$i];
|
||||
break;
|
||||
|
||||
default:
|
||||
if(in_array($last_char, ["{", "[", ",", ":"])){
|
||||
|
||||
$json_out .= "\"";
|
||||
}
|
||||
|
||||
$json_out .= $json[$i];
|
||||
break;
|
||||
}
|
||||
}else{
|
||||
|
||||
$json_out .= $json[$i];
|
||||
}
|
||||
|
||||
$last_char = $json[$i];
|
||||
}
|
||||
|
||||
return json_decode($json_out, true);
|
||||
}
|
||||
|
||||
public function parseJsString($string){
|
||||
|
||||
return
|
||||
preg_replace_callback(
|
||||
'/\\\u[A-Fa-f0-9]{4}|\\\x[A-Fa-f0-9]{2}|\\\n|\\\r/',
|
||||
function($match){
|
||||
|
||||
switch($match[0][1]){
|
||||
|
||||
case "u":
|
||||
return json_decode('"' . $match[0] . '"');
|
||||
break;
|
||||
|
||||
case "x":
|
||||
return mb_convert_encoding(
|
||||
stripcslashes($match[0]),
|
||||
"utf-8",
|
||||
"windows-1252"
|
||||
);
|
||||
break;
|
||||
|
||||
default:
|
||||
return " ";
|
||||
break;
|
||||
}
|
||||
},
|
||||
$string
|
||||
);
|
||||
}
|
||||
|
||||
public function extract_json($json){
|
||||
|
||||
$len = strlen($json);
|
||||
$array_level = 0;
|
||||
$object_level = 0;
|
||||
$in_quote = null;
|
||||
$start = null;
|
||||
|
||||
for($i=0; $i<$len; $i++){
|
||||
|
||||
switch($json[$i]){
|
||||
|
||||
case "\"":
|
||||
case "'":
|
||||
// count preceding backslashes
|
||||
$bsCount = 0;
|
||||
$j = $i - 1;
|
||||
|
||||
while($j >= 0 && $json[$j] === "\\"){
|
||||
$bsCount++;
|
||||
$j--;
|
||||
}
|
||||
|
||||
// quote is NOT escaped if even number of backslashes
|
||||
if($bsCount % 2 === 0){
|
||||
if($in_quote === null){
|
||||
// open quote
|
||||
$in_quote = $json[$i];
|
||||
}elseif($in_quote === $json[$i]){
|
||||
// close quote
|
||||
$in_quote = null;
|
||||
}
|
||||
}
|
||||
break;
|
||||
|
||||
case "[":
|
||||
if($in_quote === null){
|
||||
|
||||
$array_level++;
|
||||
if($start === null){
|
||||
|
||||
$start = $i;
|
||||
}
|
||||
}
|
||||
break;
|
||||
|
||||
case "]":
|
||||
if($in_quote === null){
|
||||
|
||||
$array_level--;
|
||||
}
|
||||
break;
|
||||
|
||||
case "{":
|
||||
if($in_quote === null){
|
||||
|
||||
$object_level++;
|
||||
if($start === null){
|
||||
|
||||
$start = $i;
|
||||
}
|
||||
}
|
||||
break;
|
||||
|
||||
case "}":
|
||||
if($in_quote === null){
|
||||
|
||||
$object_level--;
|
||||
}
|
||||
break;
|
||||
}
|
||||
|
||||
if(
|
||||
$array_level === 0 &&
|
||||
$object_level === 0 &&
|
||||
$start !== null
|
||||
){
|
||||
|
||||
return substr($json, $start, $i - $start + 1);
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
// fallback
|
||||
return "[]";
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user