iliaal/phpser
最新稳定版本:0.2.0
Composer 安装命令:
pie install iliaal/phpser
包简介
Fast binary serializer for PHP cache workloads. Decoder-optimized, beats igbinary on packed numerics, deep-nested structures, and same-class DTO batches.
README 文档
README
A PHP serialization extension in C, targeting read-heavy cache workloads where decode time matters more than encode time or payload size.
Why phpser?
PHP cache workloads pay decode cost on every read. Encode happens once per write. The default igbinary was the right answer for over a decade, but lags on three shapes that show up everywhere: packed numeric arrays, deep-nested structures, and same-class DTO batches (Laravel queue payloads, cached models).
phpser is decoder-optimized. Pointer-equality dict intern, refcount-reuse of zend_strings, pre-sized hash tables with direct arPacked writes, tagged scalar runs, an O(1) pointer-hash intern cache. On the shapes above, it cuts size by 60-65% and decode time by 70-77% vs igbinary. On general-purpose rowsets it sits within 1% of igbinary's size and encodes 18-53% faster.
phpser is now also faster to encode than igbinary on every shape in the suite (−14% to −70%), so it's no longer just a read-path win. The remaining non-wins are small and on the de-prioritized axes: rowset size runs ~1-4% over igbinary, and rowset_1000 decode ~4% slower (the front-loaded dictionary trades streamability for decode speed everywhere else). The bench table below has the full shape-by-shape breakdown.
📖 The design writeup: phpser: a fast, secure binary serializer for PHP cache workloads — what the decoder does differently and why decode time is the metric to optimize. The interactive benchmark page compares phpser against igbinary, native serialize(), and msgpack across every cache shape.
Install
# PIE (PHP Foundation's extension installer; uses the composer.json # at the repo root with type: "php-ext") pie install iliaal/phpser
On a minimal PHP image (e.g. php:8.x-cli from Docker Hub), PIE needs a
few build tools installed first:
# Debian/Ubuntu sudo apt install -y git bison libtool-bin unzip # macOS brew install bison libtool
unzip is load-bearing on Debian: composer shells out to /usr/bin/unzip
when extracting PIE's prebuilt-binary zip. If unzip is missing, composer
silently falls back to PHP's ZipArchive which lays the .so out at a
path PIE doesn't check, and install fails with ExtensionBinaryNotFound
even though the zip downloaded fine.
From source
git clone https://github.com/iliaal/phpser.git cd phpser phpize && ./configure --enable-phpser make -j$(nproc) sudo make install echo 'extension=phpser.so' | sudo tee /etc/php/conf.d/phpser.ini
Pre-built binaries
Pre-built .dlls for Windows (PHP 8.2-8.5, TS/NTS, x64) and .sos for
Linux glibc (x86_64, arm64) and macOS arm64 (PHP 8.4-8.5) are attached
to each GitHub release. PIE
fetches the matching binary automatically; falls back to source-build
when no asset matches.
Usage
Basic round-trip. The encoded payload is opaque bytes; treat it as a binary blob in storage (no JSON-safety, no UTF-8 guarantees):
$payload = phpser_serialize(['id' => 42, 'name' => 'row', 'tags' => ['a','b']]); $value = phpser_unserialize($payload); // $value === ['id' => 42, 'name' => 'row', 'tags' => ['a','b']]
HMAC-signed mode for untrusted storage (memcached, redis, files, cookies). The signed entry points wrap the payload in a constant-time HMAC-SHA256 frame; tampered or foreign-keyed input is rejected before any decoding work runs:
$key = random_bytes(32); // store this key in your app config; an empty key is rejected $payload = phpser_serialize_signed($cacheValue, $key); // ... later, possibly across a process boundary ... $value = phpser_unserialize_signed($payload, $key); // throws an Exception if the payload was tampered or signed with a different key
allowed_classes option on both unserialize entry points. Same shape as
PHP's native unserialize($payload, ['allowed_classes' => ...]):
// Reject all classes (decode them as __PHP_Incomplete_Class) $value = phpser_unserialize($payload, ['allowed_classes' => false]); // Allowlist specific classes; everything else becomes __PHP_Incomplete_Class $value = phpser_unserialize($payload, ['allowed_classes' => [Foo::class, Bar::class]]); // Allow all (default) $value = phpser_unserialize($payload, ['allowed_classes' => true]); $value = phpser_unserialize($payload); // same as above
When decoding attacker-controlled bytes, use one of the two restricted
modes or the signed entry point. See SECURITY.md for the full threat
model.
✨ Features
- Signed payloads for integrity.
phpser_serialize_signed($value, $key)wraps the payload in an HMAC-SHA256 frame;phpser_unserialize_signed($payload, $key)verifies in constant time and rejects tampered or foreign-keyed input before any decoding work runs. Use this whenever the storage layer crosses a trust boundary: memcached, redis, files, cookies, anywhere an attacker who can write to the store could otherwise feed a crafted payload to your decoder. An empty key is rejected on both sides — a keyless HMAC is forgeable, so callers must supply real key material. - Safe handling of untrusted input.
allowed_classesoption on both unserialize entry points, matching PHP's nativeunserialize($payload, ['allowed_classes' => ...])shape: passfalseto reject all classes, an array to allowlist specific ones, ortruefor the default. Disallowed classes decode as__PHP_Incomplete_Classwith the original name preserved, never instantiated. Recursion depth is capped at 512 on both encode and decode (encode throws, decode returnsnull), and assoc decode useszend_hash_updateso duplicate-key payloads collapse to last-write-wins rather than phantom buckets. - PHP 8.2+ (8.3, 8.4, 8.5, master). BSD 3-Clause.
Bench (opt PHP 8.4.22-dev NTS release, 1000 iters, median of 9 runs)
| Shape | Size: ig → ps | Encode: ig → ps | Decode: ig → ps |
|---|---|---|---|
| rowset_100 | 4570 → 4771 (+4.4%) | 10.2k → 7.5k ns (-27%) | 11.2k → 11.1k ns (~parity) |
| rowset_1000 | 47K → 48K (+1.1%) | 170k → 77k ns (-55%) | 108k → 110k ns (+2%) |
| packed_1k | 5495 → 1941 (-65%) | 4.5k → 1.2k ns (-73%) | 7.4k → 1.8k ns (-76%) |
| packed_10k | 60K → 22K (-63%) | 46k → 12k ns (-73%) | 76k → 19k ns (-75%) |
| deep_50 | 419 → 424 (parity) | 1.4k → 0.73k ns (-48%) | 1.9k → 1.6k ns (-16%) |
| dto_100 | 7083 → 6362 (-10%) | 17k → 13k ns (-24%) | 29k → 18k ns (-40%) |
| dto_1000 | 73K → 65K (-12%) | 204k → 172k ns (-16%) | 297k → 175k ns (-41%) |
| dto_mixed | 22K → 18K (-17%) | 63k → 43k ns (-31%) | 123k → 61k ns (-51%) |
phpser is faster to encode than igbinary on every shape in the
suite (−16% to −73%) while staying decoder-first. Packed numerics:
~65% smaller, ~73% faster encode, ~75% faster decode. Deep-nested:
~48% faster encode at parity size. Rowsets encode 27-55% faster,
size within ~1%, decode at parity on x86 and 8-9% faster on arm64.
DTO workloads (Laravel-queue-style payloads, single-class arrays):
10-17% smaller, 40-51% faster decode, 16-31% faster encode vs
igbinary — dict dedup on prop names, the class-entry lookup cache that
amortizes zend_lookup_class_ex across same-typed batches, an O(1)
pointer-hash intern cache that keeps the per-value dedup lookup off
the critical path, dict strings resolved against the engine's
interned-string table on decode, and declared properties installed
straight into property slots instead of materializing each object's
properties HashTable.
The remaining non-win is small and on the de-prioritized axis: rowset size is ~1-4% over igbinary — the front-loaded dictionary is read once at the head and referenced by index, which is exactly what makes the decodes fast (not streamable; you can't have both).
Cross-validated on arm64 (aarch64, PHP 8.4.21 NTS, idle, median of 9): decode is faster on every shape including the rowsets (rowset −8/−9%, dto −40/−43/−48%, packed −78/−79%, deep −16%); encode −9% to −75%.
For the full four-way picture — phpser vs igbinary vs native serialize()
vs msgpack, with size/encode/decode side by side on every shape — see the
interactive benchmark page (arm64,
median of 9). Regenerate it with php ... bench.php --html > docs/index.html.
The short version: phpser decodes faster than all three on every shape,
and the object (dto_*) decode that msgpack is slowest at is exactly
the Laravel-queue workload phpser targets.
Design highlights
The core ideas that drive the perf wins above:
- Pointer-equality dict intern. Encoding hits a
*zend_string == *zend_stringcheck first; only on miss do we hash the bytes. Cuts intern cost to near-zero for rowset-shaped data where PHP literals share interned zend_strings. - Front-loaded string dictionary. Same shape as igbinary's
compact_strings, except we emit the table once at the head and reference by varint index from values. Trade-off: not streamable. - Refcount-reuse of zend_strings on decode. Per-decode cache parallel
to the dict. First reference allocates, subsequent ones
addref. - HT_IS_PACKED detection via flag, not iteration. Avoid scanning the buckets just to determine layout.
arPackedstride awareness. PHP 8+'s packed-array layout stores zvals directly, not Buckets. Stride is 16, not 32.- Sparse-packed fallback. Arrays with holes (post-
unset) preserve original int keys via Assoc rather than silently re-indexing.
Where phpser diverges from igbinary
igbinary is the closest reference point. The areas where there's still measurable perf to take, and that this project targets, are:
-
Pre-sized HT + direct
arPackedwrites on decode. When the wire format declaresPACKED_LEN N, allocate the HT once viazend_new_array(N)and write directly intoarPackedwithZVAL_*macros. Skips Nzend_hash_next_index_insertcalls, including their hash computation, growth checks, and capacity tuning. Shipped. -
Tagged scalar runs.
[1, 2, 3, ...](1000 longs) emits as a singlePACKED_LONGSheader + N zigzag varints, not 1000(tag, varint)pairs. Decode is one tight loop with no per-element tag dispatch. Shipped. -
O(1) pointer-hash intern. Open-addressed
zend_string* → slothash, grown without eviction. Hit rate near 100% on rowset shapes (PHP interns literals; the same"id"zend_string pointer flows through every row), and unique value strings (names, emails) hit a single-probe miss instead of a linear scan — the change that put encode ahead of igbinary on every shape. Skips the byte-hash entirely on hits. Shipped. -
Eager dict materialization with warm hashes. All dict slots are resolved up front during header parse, against the engine's interned-string table first — property names, class names, and hot literals come back as the engine's own interned strings (no allocation, no refcount traffic, pointer-equality hash lookups) — with a regular allocation as the fallback. Hashes are set on both paths;
zend_hash_add_newreuses the cached hash. Shipped. -
Provenance-gated
add_newon assoc decode. The default (unsigned) path useszend_hash_update: it's the security boundary, and adversarial payloads with duplicate keys must collapse to last-write-wins rather than produce phantom buckets (count($arr) != count(array_unique(array_keys($arr)))). The HMAC-authenticatedphpser_unserialize_signedpath provably came from our own encoder (unique-keyed HashTables, no duplicates), so it useszend_hash_*_add_newand skips the per-key existence check. Shipped. -
Inline-short-string tag with upgrade-on-second-encounter.
TAG_STR_INLINE(0x0c) andKEY_STR_INLINE(0x02) are emitted on a string's first occurrence; the next occurrence triggers an in-place upgrade to a dict entry, and all subsequent ones emitTAG_STR_DICT. Singletons (e.g.row_Xvalues in a rowset) never hit the upgrade branch. They cost nothing in the dict header. The intern cache doubles as the "seen once?" signal: high bit ofidxdistinguishesINLINE_EMITTEDfromDICT_IDX. No pre-pass; single walk of the zval tree as before.A count-then-emit variant was tried first: pre-walk the zval tree to tag occurrences, then emit inline for singletons and dict for repeats. The pre-pass cost ~200 ns per string and ate the per-singleton savings, so the single-walk upgrade-on-second-encounter version above is what ships.
rowset_1000encode landed at 25% faster than igbinary (up from 8% in the pre-upgrade implementation), with payload size dropping from +5% to +2.7%. -
Skip refcount machinery during build. All zvals built during decode are fresh and unshared until handed back to PHP. Internal writes can skip
Z_TRY_ADDREFguards.
Local dev build
The hand-rolled Makefile builds against an in-tree ~/php-src-8.4-opt
checkout without phpize/autoconf. Useful for hacking on the extension
while also hacking on PHP itself:
make -j$(nproc) # builds modules/phpser.so make test # runs tests/*.phpt via run-tests.php
Override PHP_SRC= to target a different in-tree PHP checkout. Load
alongside igbinary for the A/B bench:
~/php-src-8.4-opt/sapi/cli/php \ -d extension=$HOME/igbinary/modules/igbinary.so \ -d extension=$(pwd)/modules/phpser.so \ bench.php
The config.m4 auto-detects the session extension and registers phpser
as a session.serialize_handler when available.
Limitations / known gaps
- Recursion depth is capped at 512 on both encode and decode. On decode,
anything deeper than 512 nested containers / refs is rejected (returns
null) to bound stack consumption against adversarial wire payloads. On encode, input deeper than 512 throws anExceptionrather than silently shipping a truncated payload. Object cycles are preserved correctly via the id-table machinery and don't count against this cap for shared-graph cases; the cap only fires on genuinely deep trees. Cache workloads typically nest 5-10 deep, so the cap is many orders of magnitude past any legitimate payload. - Closures and resources encode as
NULL. Same shape as PHP's ownserialize(); these types are inherently non-serializable. - Unknown classes at decode fall back to
stdClassrather than PHP's__PHP_Incomplete_Class. This is deliberate for the typical cache workload;allowed_classes => [...]produces__PHP_Incomplete_Classwith the original name preserved for disallowed classes, matching PHP. session.serialize_handler=phpseris shipped (compiled in whenphpizedetects the session extension; gated onHAVE_PHP_SESSIONso the extension still loads on session-less PHP builds).phpredisintegration is not yet wired; callphpser_serialize/unserializedirectly when using the extension as a phpredis serializer.
Wire format (V1)
[u8 version=0x01]
[varint ndict]
per entry: [varint len] [bytes]
[value]
value tags:
0x00 NULL
0x01 FALSE
0x02 TRUE
0x03 LONG varint (zigzag-encoded)
0x04 DOUBLE 8 bytes (LE)
0x05 STR_DICT varint dict_idx
0x06 ASSOC varint(len), N×(key, val)
0x07 PACKED_MIXED varint(len), N×val
0x08 PACKED_LONGS varint(len), N×zigzag-varint
0x09 PACKED_DOUBLES varint(len), N×8-byte LE
0x0a OBJECT varint(class_idx), varint(nprops), N×(key_idx, val)
0x0b PACKED_STRINGS varint(len), N×varint(dict_idx) // typed string run
0x0c STR_INLINE varint(len), bytes // single-use string, skips dict
0x0d ENUM varint(class_idx), varint(case_name_idx)
0x0e OBJECT_MAGIC varint(class_idx), value // class with __serialize;
// value is the array __serialize returned
0x0f OBJECT_LEGACY varint(class_idx), varint(len), bytes // class with
// ce->serialize / ce->unserialize (Serializable etc.)
0x10 REF varint(id) // back-ref to a previously-emitted container
0x11 NEW_REF value // claims the next id for an IS_REFERENCE wrap
key tags:
0x00 LONG varint(zigzag)
0x01 STR varint(dict_idx)
0x02 STR_INLINE varint(len), bytes
Varints are LEB128 (unsigned); signed values use zigzag encoding. Tags 0x10/0x11 plus 0x0a/0x0d/0x0e/0x0f each implicitly claim the next id in encounter order, so the decoder reconstructs back-refs by counting container tags as it parses.
🔗 PHP Performance Toolkit
Companion native PHP extensions:
- php_excel: native XLS/XLSX read/write via LibXL
- mdparser: native CommonMark + GitHub Flavored Markdown parser
- php_clickhouse: native ClickHouse client over the binary protocol
- fastchart: 26 chart types in one PHP extension
- fastjson: drop-in faster
ext/json, backed by yyjson - statgrab: system statistics wrapper around libstatgrab
Follow on X • Read the writeup • If this cut your cache decode CPU, ⭐ star it!
统计信息
- 总下载量: 0
- 月度下载量: 0
- 日度下载量: 0
- 收藏数: 13
- 点击次数: 1
- 依赖项目数: 0
- 推荐数: 0
其他信息
- 授权协议: BSD-3-Clause
- 更新时间: 2026-05-20
