mirror of
https://github.com/MobileGL-Dev/MobileGL
synced 2026-09-08 20:28:32 +09:00
swung0x48
8d0ed5b82c
- the write analysis under-approximated in the exact direction its own claim forbids: written_tokens recorded a write through a member's field (m_foo.bar = v) as FIELD:bar and never as MEM:m_foo, while resolve_reader resolves a shutter's accessor to MEM:m_foo, so for any struct-valued member the two halves could not meet; a new MEMBER_ROOTED_WRITE_RE records both, for m_x.f, m_x[i].f, m_x->f and nested - it could not see RenderState::SetPixelStoreParam's sixteen writes twice over, because they are spelled with the token-pasting operator and the file was read raw - the "field" it recorded was the macro parameter name, paramNameTail. The derivation now expands the function-like macros defined under its two roots (directives blanked, parameters substituted, ## pasted), which is also what makes SET_CAPABILITY's m_parameters.capability##Enabled writes visible - and it now DECLINES rather than answers wherever it cannot say it read every writer: a body carrying a construct it does not model (an unexpandable token paste), anything that reaches such a body through the call-graph fixed point the writes already travel, and any shutter member with a write-shaped occurrence outside the analysed roots. --check prints every decline with its site, plus how many bodies and files the absence claim rests on and the one place it stays coarse - the BitwiseEqual bits' shutter window now also starts at the last `}` before the `dirty |=`, so the pack block's trailing `m_pack = pack;` no longer leaks the pixel store into NEW_PATCH_STATE's reader set - consequence in the map: X(SetPixelStoreParam, NEW_PIXEL_PACK) went from a verdict the gate could not support - no function name in the tree could carry that bit - to an accepted, checked answer, and the row it forced (kPulledEveryVerb, documented as "no shutter exists, and none is needed yet") said that of the only mutator behind the shipped set_pixel_pack_state. The row is now kPulledPartialShutter|NEW_PIXEL_PACK: the pull is what holds on every mutating path, the bit moves on the eight Pack arms, and both facts are machine-readable for the P3a reader D16 writes this file for - --self-test grows from 7 negative controls to 10 - kPulledPartialShutter naming no bit, a mutator whose write analysis is incomplete, and a shutter member written outside the roots, the last two asserting a DECLINE and no verdict - and gains a positive control that fails if SetPixelStoreParam's pasted writes ever go unread again
1225 lines
60 KiB
Python
1225 lines
60 KiB
Python
#!/usr/bin/env python3
|
|
# MobileGL - scripts/gen_pipe_dirty_surface.py
|
|
# Copyright (c) 2025-2026 MobileGL-Dev
|
|
# Licensed under the GNU Lesser General Public License v3.0:
|
|
# https://www.gnu.org/licenses/gpl-3.0.txt
|
|
# https://www.gnu.org/licenses/lgpl-3.0.txt
|
|
# SPDX-License-Identifier: LGPL-3.0-only
|
|
# End of Source File Header
|
|
"""The dirty-surface scanner (plan B corollary 4, section 5.2).
|
|
|
|
MGPipe replaces "the backend rediscovers what changed" with "the frontend says what
|
|
changed", which only works if EVERY frontend mutation that a backend can observe bumps an
|
|
aggregate generation. The failure mode is silent and one-directional: a mutation that
|
|
forgets to bump renders stale, and no purity gate can see it.
|
|
|
|
So the mutation surface has to be enumerated mechanically rather than by memory. This
|
|
script reports every place in MG_Impl/GLImpl where a GL entry point BOTH mutates frontend
|
|
state through pGLContext AND reaches the backend in the same function - those are the
|
|
publish points, the ones that must map onto an aggregate generation.
|
|
|
|
P0 is the skeleton: it reports. P1 adds the mapping file and CI regenerates it with
|
|
`git diff --exit-code` and zero unmapped mutators, the same shape as gen_pipe.py's G6.
|
|
|
|
P2 adds the half a completeness gate cannot have: for the RenderState family the ANSWER is
|
|
derived from RenderState.cpp rather than believed, so a row that names a publisher which
|
|
fires on only some paths through the setter (or omits one that always fires) is red. Without
|
|
it a row could be wrong in exactly the direction ARCHITECTURE.md 13.2 calls dangerous while
|
|
--check stayed green, which is how two rows in this mapping were wrong for a whole review.
|
|
|
|
Every other bit answer is derived too, one-directionally, against the shutter Tracker.h
|
|
builds for that bit. That half makes an ABSENCE claim ("this mutator writes nothing that
|
|
shutter reads"), so it is only as good as the code it reads, and it once was not: it missed
|
|
every write through a member's field and every write the preprocessor pastes together, and
|
|
reported their absence as a fact about RenderState.cpp. It now expands MG_State's
|
|
function-like macros, records the member as well as the field, and DECLINES - prints the row
|
|
and the site, and does not fail it - wherever it cannot say it read every writer.
|
|
|
|
python3 scripts/gen_pipe_dirty_surface.py # human-readable report
|
|
python3 scripts/gen_pipe_dirty_surface.py --summary # counts only
|
|
python3 scripts/gen_pipe_dirty_surface.py --check # THE GATE: rc 1 on any hole
|
|
python3 scripts/gen_pipe_dirty_surface.py --self-test # the gate's own negative controls
|
|
"""
|
|
|
|
import argparse
|
|
import os
|
|
import re
|
|
import sys
|
|
|
|
REPO_ROOT = os.path.dirname(os.path.dirname(os.path.abspath(__file__)))
|
|
SCAN_ROOT = os.path.join(REPO_ROOT, "MobileGL", "MG_Impl", "GLImpl")
|
|
|
|
# The mutating half of GLContext's surface. Prefix-matched, per the plan's list.
|
|
MUTATOR_PREFIXES = ("Add", "Set", "Mark", "Bump", "Allocate", "Truncate", "Record", "Notify",
|
|
"Begin", "End")
|
|
|
|
MUTATOR_RE = re.compile(r"pGLContext->\s*((?:%s)\w*)\s*\(" % "|".join(MUTATOR_PREFIXES))
|
|
BACKEND_RE = re.compile(r"gBackendFunctionsTable\.GL\.(\w+)|pActiveBackendObject->\s*(\w+)")
|
|
FUNCTION_RE = re.compile(r"(?:^|\n)[ \t]*(?:[A-Za-z_][\w:<>,&*\s]*?)\b(\w+)\s*\([^;{}]*\)\s*"
|
|
r"(?:const\s*)?(?:noexcept\s*)?\{")
|
|
|
|
|
|
def mask_comments_and_strings(text):
|
|
"""Replace comment and string-literal bodies with spaces, keeping every offset and
|
|
newline, so the regexes below cannot match inside a comment or a literal."""
|
|
out = list(text)
|
|
i = 0
|
|
n = len(text)
|
|
while i < n:
|
|
c = text[i]
|
|
if c == "/" and i + 1 < n and text[i + 1] == "/":
|
|
while i < n and text[i] != "\n":
|
|
out[i] = " "
|
|
i += 1
|
|
elif c == "/" and i + 1 < n and text[i + 1] == "*":
|
|
out[i] = out[i + 1] = " "
|
|
i += 2
|
|
while i < n and not (text[i] == "*" and i + 1 < n and text[i + 1] == "/"):
|
|
if text[i] != "\n":
|
|
out[i] = " "
|
|
i += 1
|
|
if i < n:
|
|
out[i] = " "
|
|
if i + 1 < n:
|
|
out[i + 1] = " "
|
|
i += 2
|
|
elif c in "\"'":
|
|
quote = c
|
|
i += 1
|
|
while i < n and text[i] != quote:
|
|
if text[i] == "\\":
|
|
out[i] = " "
|
|
i += 1
|
|
if i < n and text[i] != "\n":
|
|
out[i] = " "
|
|
i += 1
|
|
if i < n:
|
|
out[i] = " "
|
|
i += 1
|
|
else:
|
|
i += 1
|
|
return "".join(out)
|
|
|
|
|
|
def function_bodies(masked):
|
|
"""Yield (name, start_offset, end_offset) for every braced function body."""
|
|
for match in FUNCTION_RE.finditer(masked):
|
|
name = match.group(1)
|
|
start = masked.index("{", match.end() - 1) if masked[match.end() - 1] != "{" else match.end() - 1
|
|
depth = 0
|
|
i = start
|
|
while i < len(masked):
|
|
if masked[i] == "{":
|
|
depth += 1
|
|
elif masked[i] == "}":
|
|
depth -= 1
|
|
if depth == 0:
|
|
yield name, start, i
|
|
break
|
|
i += 1
|
|
|
|
|
|
def line_of(text, offset):
|
|
return text.count("\n", 0, offset) + 1
|
|
|
|
|
|
def scan_file(path):
|
|
with open(path, "r", encoding="utf-8", errors="replace") as handle:
|
|
text = handle.read()
|
|
masked = mask_comments_and_strings(text)
|
|
findings = []
|
|
# Every mutator in the file, whether or not it shares a function with a backend call.
|
|
# The difference between this and the publish points below is the whole point of the
|
|
# report: a mutation that does NOT reach the backend in the same function is published
|
|
# by the NEXT verb, and it is exactly those that need an aggregate generation rather
|
|
# than an inline push.
|
|
all_mutators = [(m.group(1), line_of(masked, m.start())) for m in MUTATOR_RE.finditer(masked)]
|
|
for name, start, end in function_bodies(masked):
|
|
body = masked[start:end]
|
|
mutators = [(m.group(1), line_of(masked, start + m.start())) for m in MUTATOR_RE.finditer(body)]
|
|
if not mutators:
|
|
continue
|
|
backend = sorted(set(m.group(1) or m.group(2) for m in BACKEND_RE.finditer(body)))
|
|
if not backend:
|
|
continue
|
|
findings.append({
|
|
"function": name,
|
|
"line": line_of(masked, start),
|
|
"mutators": mutators,
|
|
"backend": backend,
|
|
})
|
|
return findings, all_mutators
|
|
|
|
|
|
DEF_PATH = os.path.join(REPO_ROOT, "MobileGL", "MG_Pipe", "DirtySurface.def")
|
|
TRACKER_PATH = os.path.join(REPO_ROOT, "MobileGL", "MG_Impl", "Pipe", "Tracker.h")
|
|
RENDER_STATE_PATH = os.path.join(REPO_ROOT, "MobileGL", "MG_State", "GLState", "RenderState",
|
|
"RenderState.cpp")
|
|
|
|
# An answer is one or more publishers joined with "|" - every publisher that fires on EVERY
|
|
# path through the mutator (DirtySurface.def's header states the rule).
|
|
ROW_RE = re.compile(r"^[ \t]*X\((\w+),\s*([\w|]+)\)\s*\\?\s*$", re.M)
|
|
DIRTY_NAME_RE = re.compile(r'^\s*"(NEW_[A-Z0-9_]+)",\s*$', re.M)
|
|
|
|
# The answers that are not a dirty-bit name. Each one is documented in DirtySurface.def's
|
|
# header; a row that uses anything else is a typo, and a typo that read as "mapped" would be
|
|
# exactly the silent hole this gate exists to close.
|
|
NON_BIT_ANSWERS = ("kImmediate", "kReverseChannel", "kNoBackendRead", "kExplicitDestroy",
|
|
"kUnpublishedDestroy", "kPulledEveryVerb", "kPulledPartialShutter")
|
|
|
|
# The one non-bit answer that must NOT stand alone. kPulledEveryVerb says "no shutter exists";
|
|
# kPulledPartialShutter says "the pull is what holds on every mutating path, and these bits DO
|
|
# move on some of them" - so it carries those bits, and the derivation below checks that each
|
|
# one really is movable by that mutator. Without the distinction, a reader of this file (P3a
|
|
# builds its shutters from it) is told that the mutator behind a bit P2 already emits a call
|
|
# for has no shutter at all, which is exactly what X(SetPixelStoreParam, kPulledEveryVerb)
|
|
# said about NEW_PIXEL_PACK.
|
|
PARTIAL_ANSWERS = ("kPulledPartialShutter",)
|
|
|
|
# ---- the render-state answers, DERIVED rather than believed -----------------------------
|
|
# The two RenderState counters are the one place in the mapping where "what publishes this"
|
|
# has a mechanical answer, and where getting it wrong is not a documentation slip: P3a builds
|
|
# its narrow shutters from this file, so a row that claims NEW_PIPELINE_STATE for a setter
|
|
# whose pipeline bump is conditional (SetStencilFunc) or absent (SetCapability's
|
|
# ClipDistance0..7 arms) encodes exactly the under-firing ARCHITECTURE.md 13.2 calls the
|
|
# dangerous direction. So the gate derives the answer from RenderState.cpp:
|
|
#
|
|
# BumpVersions() moves m_version AND m_pipelineStateVersion (RenderState.h);
|
|
# a bare ++m_version moves only the first;
|
|
# a setter that has BOTH kinds of path always-fires only NEW_RENDER_STATE.
|
|
#
|
|
# A setter whose body has no bump at all is resolved through the RenderState setter it
|
|
# delegates to (SetPolygonOffset -> SetPolygonOffsetClamped).
|
|
RENDER_STATE_BIT = "NEW_RENDER_STATE"
|
|
PIPELINE_STATE_BIT = "NEW_PIPELINE_STATE"
|
|
BUMP_VERSIONS_RE = re.compile(r"\bBumpVersions\s*\(\s*\)")
|
|
BARE_VERSION_RE = re.compile(r"\+\+\s*m_version\b")
|
|
BARE_PIPELINE_RE = re.compile(r"\+\+\s*m_pipelineStateVersion\b")
|
|
SETTER_CALL_RE = re.compile(r"\b(Set\w+)\s*\(")
|
|
|
|
|
|
def render_state_publishers():
|
|
"""{setter: set of always-firing render-state publishers} read out of RenderState.cpp.
|
|
|
|
A setter absent from the result is not a RenderState setter at all; a setter mapped to an
|
|
EMPTY set moves neither counter (SetPixelStoreParam)."""
|
|
with open(RENDER_STATE_PATH, "r", encoding="utf-8", errors="replace") as handle:
|
|
masked = mask_comments_and_strings(handle.read())
|
|
|
|
bodies = {}
|
|
for name, start, end in function_bodies(masked):
|
|
if name.startswith("Set"):
|
|
bodies.setdefault(name, []).append(masked[start:end])
|
|
|
|
def direct(body):
|
|
publishers = set()
|
|
bump = BUMP_VERSIONS_RE.search(body) is not None
|
|
bare_version = BARE_VERSION_RE.search(body) is not None
|
|
bare_pipeline = BARE_PIPELINE_RE.search(body) is not None
|
|
if bump or bare_version:
|
|
publishers.add(RENDER_STATE_BIT)
|
|
if bump and not bare_version and not bare_pipeline:
|
|
publishers.add(PIPELINE_STATE_BIT)
|
|
return publishers
|
|
|
|
def resolve_body(name, body, seen):
|
|
publishers = direct(body)
|
|
if publishers:
|
|
return publishers
|
|
# No bump of its own: whatever the setter it delegates to publishes.
|
|
for match in SETTER_CALL_RE.finditer(body):
|
|
callee = match.group(1)
|
|
if callee != name and callee in bodies:
|
|
publishers |= resolve(callee, seen)
|
|
return publishers
|
|
|
|
def resolve(name, seen):
|
|
if name in seen:
|
|
return set()
|
|
seen.add(name)
|
|
# INTERSECTION, not union, across the bodies of one name. A union would let two
|
|
# overloads - one calling BumpVersions(), one bumping m_version alone - derive as
|
|
# "both counters always fire" and bless the exact under-firing row this derivation
|
|
# exists to catch. Every Set* name in RenderState.cpp has exactly one body today, so
|
|
# this changes no answer; it is the fold that stays right when one does not.
|
|
answers = [resolve_body(name, body, seen) for body in bodies[name]]
|
|
return set.intersection(*answers) if answers else set()
|
|
|
|
return {name: resolve(name, set()) for name in bodies}
|
|
|
|
|
|
# ---- the OTHER answers, derived from the shutter each bit is built out of ---------------
|
|
# The render-state derivation above covers 45 of the 73 rows. For the rest, "does this
|
|
# mutator move the shutter it names" is still a mechanical question, just one asked of a
|
|
# different pair of files: MG_Impl/Pipe/Tracker.h says which counters and which bytes each
|
|
# MGPipeDirty bit compares, and MG_State says who moves those. So:
|
|
#
|
|
# 1. read Tracker.h's Update() and, per bit, collect what its shutter READS -
|
|
# ctx.GetXxx() accessors and `render.Field` reads, with the walk's own locals expanded;
|
|
# 2. resolve each accessor, through MG_State's one-line getters, to the MEMBER it returns;
|
|
# 3. walk every function body under MG_State/GLState and MG_Impl/Pipe and compute, as a
|
|
# fixed point over call names, which members and struct fields each one transitively
|
|
# WRITES - including through MGP_NOTE_AGGREGATE, whose per-aggregate hop is read out of
|
|
# MGPipeNoteAggregate's own switch rather than assumed;
|
|
# 4. a row claiming bit B for mutator M is UNDER-FIRING when M writes nothing B reads.
|
|
#
|
|
# STEP 4 IS AN ABSENCE CLAIM, so step 3 must not MISS a write, and that is an obligation this
|
|
# script violated rather than a slogan: until this commit a write through a member's FIELD
|
|
# (`m_foo.bar = v`) recorded FIELD:bar and never MEM:m_foo, while the reader side resolves an
|
|
# accessor to MEM:m_foo - so the two halves could not meet for any struct-valued member, and
|
|
# the gate printed "SetPixelStoreParam writes nothing NEW_PIXEL_PACK's shutter reads" about a
|
|
# setter whose entire body is sixteen writes to exactly that member. It could not see them
|
|
# twice over, because those writes are spelled with the token-pasting operator
|
|
# (RenderState.cpp's SET_PIXEL_STORE_PARAM) and the file was read raw, so the "field" it
|
|
# recorded was the MACRO PARAMETER NAME. What step 3 models is therefore written down here,
|
|
# and what it does not model is DECLINED rather than answered:
|
|
#
|
|
# modelled ++m_x / m_x = / m_x op=; a write through a member-rooted lvalue (m_x.f,
|
|
# m_x[i].f, m_x->f, nested), which records BOTH MEM:m_x and FIELD:f; a bare
|
|
# `.f =` write (FIELD:f alone - the FIELD tokens are coarse, and coarse only
|
|
# ever WIDENS what a mutator is credited with writing, which is the safe
|
|
# direction for an absence claim); MGP_NOTE_AGGREGATE; a call to any function
|
|
# whose body is under the two roots; and any function-like macro defined under
|
|
# the two roots, which is EXPANDED first, token pasting performed.
|
|
# declined a body that still contains `##` after expansion, or that invokes a macro this
|
|
# script can see but could not expand and whose body pastes tokens. The taint is
|
|
# a token like every other, so it travels the same call-graph fixed point the
|
|
# writes do: a mutator that REACHES an unreadable body gets no verdict either.
|
|
# A shutter member with a write-shaped occurrence OUTSIDE the two roots is
|
|
# declined the same way - the analysis has not read every writer, so it cannot
|
|
# say there is none. --check prints every decline with the site that caused it.
|
|
#
|
|
# What remains one-directional is the OTHER direction: a call name resolves to every body of
|
|
# that name, a write inside an `if` counts, and a reader that resolves through a ternary
|
|
# yields both members - so "M does write something B reads" is not proof that it does so on
|
|
# every path and cannot become a MISSING check without false reds. That is why a mutator
|
|
# whose bit moves on half its arms answers kPulledPartialShutter rather than the bit. "M
|
|
# writes NOTHING B reads" is the direction the gate fails on, and it is the under-firing one
|
|
# ARCHITECTURE.md 13.2 calls dangerous - which is what was wrong in this file:
|
|
# X(SetNamedTransformFeedbackBinding, NEW_SO_TARGETS) named a shutter that moves on NO path
|
|
# through that mutator.
|
|
STATE_ROOTS = (os.path.join(REPO_ROOT, "MobileGL", "MG_State", "GLState"),
|
|
os.path.join(REPO_ROOT, "MobileGL", "MG_Impl", "Pipe"))
|
|
# Everything the absence claim has to be checked against, which is wider than what it reads:
|
|
# a write to a shutter member from outside STATE_ROOTS is a writer this analysis never looks
|
|
# at, and the only honest answer to a row whose shutter has one is "declined".
|
|
MOBILEGL_ROOT = os.path.join(REPO_ROOT, "MobileGL")
|
|
UPDATE_RE = re.compile(r"Uint32\s+Update\s*\(")
|
|
NOW_RE = re.compile(r"now\[Index\(MGPipeDirty::(\w+)\)\]\s*=\s*([^;]*);")
|
|
DIRTY_OR_RE = re.compile(r"dirty\s*\|=\s*MGPipeDirtyBit\(MGPipeDirty::(\w+)\)")
|
|
DIRTY_ANY_RE = re.compile(r"dirty\s*\|=")
|
|
LOCAL_RE = re.compile(r"(\w+)\s*=\s*([^;]*);")
|
|
CTX_READ_RE = re.compile(r"\bctx\.(\w+)\s*\(")
|
|
ARROW_READ_RE = re.compile(r"\b\w+\s*->\s*(\w+)\s*\(")
|
|
FIELD_READ_RE = re.compile(r"\brender\.(\w+)")
|
|
RETURN_RE = re.compile(r"\breturn\s+([^;]*);")
|
|
MEMBER_RE = re.compile(r"\b(m_\w+)\b")
|
|
MEMBER_CALL_RE = re.compile(r"\b(m_\w+)\s*\.\s*(\w+)\s*\(")
|
|
CALL_RE = re.compile(r"\b(\w+)\s*\(")
|
|
WORD_RE = re.compile(r"\b(\w+)\b")
|
|
AGGREGATE_RE = re.compile(r"MGP_NOTE_AGGREGATE\(\s*(\w+)\s*\)")
|
|
AGGREGATE_CASE_RE = re.compile(r"case\s+MGPipeAggregate::(\w+)\s*:\s*([^;]*);")
|
|
|
|
# The assignment operators, as a suffix every write pattern below shares. `=(?!=)` keeps ==
|
|
# out; !=, <= and >= cannot match at all, because the character where the operator must start
|
|
# is then `!`, `<` or `>` and no alternative here begins with one except <<= / >>=.
|
|
ASSIGN = r"(?:\+\+|--|\+=|-=|\*=|/=|%=|&=|\|=|\^=|<<=|>>=|=(?!=))"
|
|
# A write to the member itself: ++m_x, m_x = v, m_x += v.
|
|
MEMBER_WRITE_RE = re.compile(r"\+\+\s*(m_\w+)|\b(m_\w+)\s*%s" % ASSIGN)
|
|
# A write THROUGH a member: m_x.f = v, m_x[i].f = v, m_x->f = v, and nested. This is the one
|
|
# that was missing, and its absence is why the reader side (which resolves an accessor to
|
|
# MEM:m_x) and the writer side could never meet for a struct-valued member.
|
|
MEMBER_ROOTED_WRITE_RE = re.compile(
|
|
r"\b(m_\w+)\s*(?:\[[^;\n]*?\]|\.\s*\w+|->\s*\w+)+\s*%s" % ASSIGN)
|
|
# A write to a field whose base this script did not resolve to a member. Coarse on purpose:
|
|
# a FIELD token only ever widens what a mutator is credited with writing.
|
|
FIELD_WRITE_RE = re.compile(r"\.\s*(\w+)\s*(?:\[[^\]]*\])?\s*%s" % ASSIGN)
|
|
|
|
# ---- the preprocessor's half of the write analysis --------------------------------------
|
|
# Sixteen of RenderState.cpp's writes exist only after the preprocessor has run: SET_PIXEL_
|
|
# STORE_PARAM (:829) pastes `m_pixelStore##paramNameHead##Parameters`, and SET_CAPABILITY
|
|
# (:309) pastes `m_parameters.capability##Enabled`. Read raw, neither is a write to any token
|
|
# this script can name, so it saw none of them and reported their absence as a fact. So the
|
|
# function-like macros defined under the two roots are expanded first, and the ones that
|
|
# cannot be expanded are recorded so that a body reaching one is declined rather than
|
|
# answered.
|
|
MACRO_DIRECTIVE_RE = re.compile(
|
|
r"^[ \t]*#[ \t]*(define|undef)[ \t]+(\w+)(\([^()\n]*\))?((?:\\\n|[^\n])*)", re.M)
|
|
# MGP_NOTE_AGGREGATE is modelled directly (its hop is read out of MGPipeNoteAggregate's own
|
|
# switch), so expanding it would delete the very token AGGREGATE_RE looks for.
|
|
NEVER_EXPAND = frozenset(("MGP_NOTE_AGGREGATE", "MGP_NOTE_MUTATION"))
|
|
MACRO_BODY_LIMIT = 4000
|
|
PASTE_RE = re.compile(r"##")
|
|
# A member DECLARATION - a type, then the name, then the end of the statement. Used to keep
|
|
# the containment check below from confusing two classes that spell a member the same way:
|
|
# MG_Backend/MGPipe/PipeInputs.h has its own m_transformFeedbackGeneration, and a write to
|
|
# THAT one says nothing about who writes GLContext's.
|
|
MEMBER_DECL_RE = re.compile(
|
|
r"^[ \t]*[A-Za-z_][\w:<>,&*\s]*?[\s&*](m_\w+)\s*(?:\[[^\]\n]*\])?"
|
|
r"\s*(?:=[^;\n]*|\{[^}\n]*\})?;", re.M)
|
|
|
|
|
|
def source_files(root):
|
|
"""Every .h/.cpp under `root`, in a stable order."""
|
|
out = []
|
|
for directory, _, files in os.walk(root):
|
|
for name in sorted(files):
|
|
if name.endswith((".h", ".cpp")):
|
|
out.append(os.path.join(directory, name))
|
|
return sorted(out)
|
|
|
|
|
|
def macro_definitions(masked):
|
|
"""(kind, name, params-or-None, body, start, end) for every #define / #undef, with line
|
|
continuations joined."""
|
|
for match in MACRO_DIRECTIVE_RE.finditer(masked):
|
|
yield (match.group(1), match.group(2), match.group(3),
|
|
match.group(4).replace("\\\n", " "), match.start(), match.end())
|
|
|
|
|
|
def blank_directives(masked):
|
|
"""`masked` with every #define / #undef blanked (newlines kept), so a macro BODY is never
|
|
read as code belonging to whatever function encloses the directive - RenderState.cpp
|
|
defines SET_PIXEL_STORE_PARAM *inside* SetPixelStoreParam, and read raw its body
|
|
contributed a field literally named `paramNameTail`."""
|
|
out = list(masked)
|
|
for _, _, _, _, start, end in macro_definitions(masked):
|
|
for index in range(start, end):
|
|
if out[index] != "\n":
|
|
out[index] = " "
|
|
return "".join(out)
|
|
|
|
|
|
def balanced(text):
|
|
counts = {"(": 0, "[": 0, "{": 0}
|
|
closing = {")": "(", "]": "[", "}": "{"}
|
|
for char in text:
|
|
if char in counts:
|
|
counts[char] += 1
|
|
elif char in closing:
|
|
counts[closing[char]] -= 1
|
|
if counts[closing[char]] < 0:
|
|
return False
|
|
return not any(counts.values())
|
|
|
|
|
|
def macro_table(paths):
|
|
"""({name: (params, body)} this script will expand, {name: body} it saw and refused).
|
|
|
|
Function-like macros only - an object-like macro is a constant and expanding it buys the
|
|
write analysis nothing. A macro is REFUSED when expanding it could corrupt the brace
|
|
matching every function body here is found by (an unbalanced body), when it is variadic,
|
|
over-long or defined more than once with different bodies, or when the analysis models it
|
|
directly. A refused macro is not silently ignored: if its body pastes tokens, every body
|
|
that invokes it is declined."""
|
|
seen = {}
|
|
for path in paths:
|
|
with open(path, "r", encoding="utf-8", errors="replace") as handle:
|
|
masked = mask_comments_and_strings(handle.read())
|
|
for kind, name, params, body, _, _ in macro_definitions(masked):
|
|
if kind == "undef" or params is None:
|
|
continue
|
|
seen.setdefault(name, []).append((params, body))
|
|
expandable = {}
|
|
refused = {}
|
|
for name, definitions in seen.items():
|
|
bodies = set(body for _, body in definitions)
|
|
params = [part.strip() for part in definitions[0][0][1:-1].split(",") if part.strip()]
|
|
body = definitions[0][1]
|
|
if (name in NEVER_EXPAND or len(bodies) > 1 or len(body) > MACRO_BODY_LIMIT
|
|
or not balanced(body) or any(not part.isidentifier() for part in params)):
|
|
refused[name] = " ".join(sorted(bodies))
|
|
continue
|
|
expandable[name] = (params, body)
|
|
return expandable, refused
|
|
|
|
|
|
def matching_paren(text, open_index):
|
|
depth = 0
|
|
for index in range(open_index, len(text)):
|
|
if text[index] == "(":
|
|
depth += 1
|
|
elif text[index] == ")":
|
|
depth -= 1
|
|
if depth == 0:
|
|
return index
|
|
return None
|
|
|
|
|
|
def split_arguments(text):
|
|
args = []
|
|
current = []
|
|
depth = 0
|
|
for char in text:
|
|
if char in "([{":
|
|
depth += 1
|
|
elif char in ")]}":
|
|
depth -= 1
|
|
if char == "," and depth == 0:
|
|
args.append("".join(current))
|
|
current = []
|
|
continue
|
|
current.append(char)
|
|
if current or args:
|
|
args.append("".join(current))
|
|
return args
|
|
|
|
|
|
def substitute(body, params, args):
|
|
"""One macro expansion: parameters replaced, then `##` pasted away - which is the step
|
|
that turns `m_pixelStore##paramNameHead##Parameters` into a member this script can name."""
|
|
text = body
|
|
for param, arg in sorted(zip(params, args), key=lambda pair: -len(pair[0])):
|
|
text = re.sub(r"\b%s\b" % re.escape(param), lambda _match, value=arg: value, text)
|
|
return re.sub(r"\s*##\s*", "", text)
|
|
|
|
|
|
def expand_macros(masked, expandable, rounds=4):
|
|
"""`masked` with its directives blanked and every invocation of an expandable
|
|
function-like macro replaced by its expansion."""
|
|
text = blank_directives(masked)
|
|
if not expandable:
|
|
return text
|
|
pattern = re.compile(r"\b(%s)\s*\(" % "|".join(sorted((re.escape(name) for name in expandable),
|
|
key=len, reverse=True)))
|
|
for _ in range(rounds):
|
|
out = []
|
|
index = 0
|
|
changed = False
|
|
while True:
|
|
match = pattern.search(text, index)
|
|
if match is None:
|
|
out.append(text[index:])
|
|
break
|
|
close = matching_paren(text, match.end() - 1)
|
|
params, body = expandable[match.group(1)]
|
|
args = split_arguments(text[match.end():close]) if close is not None else None
|
|
if args is None or len(args) != len(params):
|
|
out.append(text[index:match.end()])
|
|
index = match.end()
|
|
continue
|
|
out.append(text[index:match.start()])
|
|
out.append(" %s " % substitute(body, params, args))
|
|
index = close + 1
|
|
changed = True
|
|
text = "".join(out)
|
|
if not changed:
|
|
break
|
|
return text
|
|
|
|
|
|
def unmodelled_sites(body, relative, pasting):
|
|
"""The constructs in `body` this script does NOT model, as decline reasons. Today there
|
|
is exactly one class of them, and it is the one that produced a false verdict: a token
|
|
paste it could not expand."""
|
|
sites = set()
|
|
if PASTE_RE.search(body):
|
|
sites.add("%s: a `##` token paste no visible macro definition expands" % relative)
|
|
for match in CALL_RE.finditer(body):
|
|
if match.group(1) in pasting:
|
|
sites.add("%s: %s(), a token-pasting macro this script refused to expand"
|
|
% (relative, match.group(1)))
|
|
return sites
|
|
|
|
|
|
def state_bodies():
|
|
"""({function name: [body text]}, {function name: {decline reason}}, [analysed paths])
|
|
over MG_State/GLState and MG_Impl/Pipe, macros expanded first."""
|
|
paths = []
|
|
for root in STATE_ROOTS:
|
|
paths += source_files(root)
|
|
expandable, refused = macro_table(paths)
|
|
# A macro this script MODELS is not an unread construct even though it is not expanded.
|
|
pasting = frozenset(name for name, body in refused.items()
|
|
if name not in NEVER_EXPAND and PASTE_RE.search(body))
|
|
bodies = {}
|
|
taints = {}
|
|
for path in paths:
|
|
relative = os.path.relpath(path, REPO_ROOT).replace(os.sep, "/")
|
|
with open(path, "r", encoding="utf-8", errors="replace") as handle:
|
|
expanded = expand_macros(mask_comments_and_strings(handle.read()), expandable)
|
|
for fn, start, end in function_bodies(expanded):
|
|
body = expanded[start:end]
|
|
bodies.setdefault(fn, []).append(body)
|
|
sites = unmodelled_sites(body, relative, pasting)
|
|
if sites:
|
|
taints.setdefault(fn, set())
|
|
taints[fn] |= sites
|
|
return bodies, taints, paths
|
|
|
|
|
|
def writers_outside(analysed):
|
|
"""{MEM token: a file OUTSIDE the analysed roots that writes it}.
|
|
|
|
The absence claim is only as good as the set of writers the analysis reads. Every .h/.cpp
|
|
under MobileGL/ that is not one of the analysed files is scanned with the same write
|
|
patterns, and a shutter member that turns up here is declined rather than answered.
|
|
|
|
A file that DECLARES a member of that name is writing its own, not the frontend's - the
|
|
backend's PipeInputs mirrors half of GLState's member names - so its writes do not count.
|
|
That is the one judgement here, and it is the conservative way round only for names the
|
|
two sides share; a genuine outside writer of a frontend member does not declare it."""
|
|
seen = set(analysed)
|
|
out = {}
|
|
for path in source_files(MOBILEGL_ROOT):
|
|
if path in seen:
|
|
continue
|
|
with open(path, "r", encoding="utf-8", errors="replace") as handle:
|
|
masked = mask_comments_and_strings(handle.read())
|
|
relative = os.path.relpath(path, REPO_ROOT).replace(os.sep, "/")
|
|
own = set(MEMBER_DECL_RE.findall(masked))
|
|
written = set(match.group(1) or match.group(2) for match in MEMBER_WRITE_RE.finditer(masked))
|
|
written |= set(match.group(1) for match in MEMBER_ROOTED_WRITE_RE.finditer(masked))
|
|
for member in written - own:
|
|
out.setdefault("MEM:" + member, relative)
|
|
return out
|
|
|
|
|
|
def written_tokens(bodies, taints=None):
|
|
"""{function name: set of tokens it transitively WRITES}, a fixed point over call names.
|
|
|
|
A token is MEM:<member>, FIELD:<struct field>, AGG:<MGPipeAggregate enumerator> or
|
|
TAINT:<site>. The last is not a write: it is "this body contains something the analysis
|
|
does not model", and it rides the same fixed point so that a mutator which REACHES an
|
|
unreadable body inherits it and is declined rather than answered."""
|
|
taints = taints or {}
|
|
reach = {}
|
|
for name, bodylist in bodies.items():
|
|
tokens = set("TAINT:" + site for site in taints.get(name, ()))
|
|
for body in bodylist:
|
|
tokens |= set("AGG:" + m.group(1) for m in AGGREGATE_RE.finditer(body))
|
|
for match in MEMBER_WRITE_RE.finditer(body):
|
|
tokens.add("MEM:" + (match.group(1) or match.group(2)))
|
|
# A write THROUGH a member records the member AND the field: the reader side
|
|
# resolves an accessor to the member, so recording only the field is what kept
|
|
# the two halves from ever meeting.
|
|
for match in MEMBER_ROOTED_WRITE_RE.finditer(body):
|
|
tokens.add("MEM:" + match.group(1))
|
|
tokens |= set("FIELD:" + m.group(1) for m in FIELD_WRITE_RE.finditer(body))
|
|
reach[name] = tokens
|
|
changed = True
|
|
rounds = 0
|
|
while changed and rounds < 16:
|
|
changed = False
|
|
rounds += 1
|
|
for name, bodylist in bodies.items():
|
|
before = len(reach[name])
|
|
for body in bodylist:
|
|
for match in CALL_RE.finditer(body):
|
|
callee = match.group(1)
|
|
if callee != name and callee in reach:
|
|
reach[name] |= reach[callee]
|
|
if len(reach[name]) != before:
|
|
changed = True
|
|
return reach
|
|
|
|
|
|
def aggregate_tokens(bodies, reach):
|
|
"""{MGPipeAggregate enumerator: the tokens its notice writes}, read out of
|
|
MGPipeNoteAggregate's own switch rather than assumed."""
|
|
out = {}
|
|
for body in bodies.get("MGPipeNoteAggregate", []):
|
|
for match in AGGREGATE_CASE_RE.finditer(body):
|
|
aggregate, statement = match.group(1), match.group(2)
|
|
tokens = set()
|
|
for call in CALL_RE.finditer(statement):
|
|
tokens |= reach.get(call.group(1), set())
|
|
out.setdefault(aggregate, set())
|
|
out[aggregate] |= tokens
|
|
return out
|
|
|
|
|
|
def expand_aggregates(tokens, aggregates):
|
|
"""AGG:X stands for whatever X's notice writes."""
|
|
out = set()
|
|
for token in tokens:
|
|
if token.startswith("AGG:"):
|
|
out |= aggregates.get(token[4:], set())
|
|
else:
|
|
out.add(token)
|
|
return out
|
|
|
|
|
|
def resolve_reader(name, bodies, seen=None):
|
|
"""The members an accessor returns, through however many one-line getters it delegates
|
|
to. An empty answer means the derivation could not follow it, which is reported as
|
|
UNVERIFIED rather than treated as "moves nothing"."""
|
|
seen = seen if seen is not None else set()
|
|
if name in seen or name not in bodies:
|
|
return set()
|
|
seen.add(name)
|
|
members = set()
|
|
for body in bodies[name]:
|
|
for match in RETURN_RE.finditer(body):
|
|
expression = match.group(1)
|
|
delegated = set()
|
|
for call in MEMBER_CALL_RE.finditer(expression):
|
|
delegated.add(call.group(1))
|
|
members |= resolve_reader(call.group(2), bodies, seen)
|
|
for member in MEMBER_RE.finditer(expression):
|
|
if member.group(1) not in delegated:
|
|
members.add("MEM:" + member.group(1))
|
|
return members
|
|
|
|
|
|
def shutter_readers():
|
|
"""{MGPipeDirty bit name: set of reader tokens} out of Tracker.h's Update()."""
|
|
with open(TRACKER_PATH, "r", encoding="utf-8", errors="replace") as handle:
|
|
masked = mask_comments_and_strings(handle.read())
|
|
body = None
|
|
for name, start, end in function_bodies(masked):
|
|
if name == "Update" and UPDATE_RE.search(masked[max(0, start - 200):start]):
|
|
body = masked[start:end]
|
|
break
|
|
if body is None:
|
|
return {}
|
|
|
|
assignments = {}
|
|
for match in LOCAL_RE.finditer(body):
|
|
assignments.setdefault(match.group(1), set()).add(match.group(2))
|
|
|
|
def readers_of(expression, depth=0):
|
|
found = set()
|
|
if depth > 4:
|
|
return found
|
|
found |= set("CTX:" + m.group(1) for m in CTX_READ_RE.finditer(expression))
|
|
found |= set("CTX:" + m.group(1) for m in ARROW_READ_RE.finditer(expression))
|
|
found |= set("FIELD:" + m.group(1) for m in FIELD_READ_RE.finditer(expression))
|
|
for word in WORD_RE.findall(expression):
|
|
if word in assignments and word not in ("now", "dirty"):
|
|
for assigned in assignments[word]:
|
|
if assigned != expression:
|
|
found |= readers_of(assigned, depth + 1)
|
|
return found
|
|
|
|
out = {}
|
|
for match in NOW_RE.finditer(body):
|
|
out.setdefault(match.group(1), set())
|
|
out[match.group(1)] |= readers_of(match.group(2))
|
|
# The two BitwiseEqual bits have no `now[]` entry: their shutter is the byte compare
|
|
# itself. The window is the text since the previous `dirty |=`, which is the block that
|
|
# builds the value being compared.
|
|
for match in DIRTY_OR_RE.finditer(body):
|
|
# Since the previous `dirty |=` of ANY form - the counter loop's included, or the
|
|
# window would start at the top of the walk and inherit every other bit's readers -
|
|
# AND since the last `}` before this one, whichever is later. The second boundary is
|
|
# what keeps the pack block's trailing `m_pack = pack;` out of the PATCH bit's
|
|
# window: `pack` is a local of the walk, so it expands to ctx.GetPixelStore
|
|
# Parameters and the patch shutter would read as though it compared the pixel store.
|
|
previous = 0
|
|
for boundary in DIRTY_ANY_RE.finditer(body, 0, match.start()):
|
|
previous = boundary.end()
|
|
closing = body.rfind("}", 0, match.start())
|
|
window = body[max(previous, closing + 1):match.start()]
|
|
out.setdefault(match.group(1), set())
|
|
out[match.group(1)] |= readers_of(window)
|
|
return out
|
|
|
|
|
|
ENUM_BODY_RE = re.compile(r"enum\s+class\s+MGPipeDirty\s*:\s*Uint32\s*\{([^}]*)\}")
|
|
ENUMERATOR_RE = re.compile(r"^\s*(\w+)\s*(?:=\s*\d+\s*)?,", re.M)
|
|
|
|
|
|
def dirty_bit_aliases():
|
|
"""{MGPipeDirty enumerator: the NEW_* name a row spells}, paired BY POSITION with
|
|
kMGPipeDirtyNames. Tracker.h's Update() names the enumerators and DirtySurface.def names
|
|
the strings, so the two spellings have to be tied together somewhere; doing it by
|
|
position also checks that the enum and its name table have not drifted apart."""
|
|
with open(TRACKER_PATH, "r", encoding="utf-8", errors="replace") as handle:
|
|
text = handle.read()
|
|
match = ENUM_BODY_RE.search(mask_comments_and_strings(text))
|
|
if not match:
|
|
return {}
|
|
enumerators = [name for name in ENUMERATOR_RE.findall(match.group(1)) if name != "Count"]
|
|
names = DIRTY_NAME_RE.findall(text)
|
|
if len(enumerators) != len(names):
|
|
return {}
|
|
return dict(zip(enumerators, names))
|
|
|
|
|
|
def shutter_movers(readers, bodies, aliases):
|
|
"""{NEW_* bit name: (tokens whose write moves that bit's shutter, every reader resolved?)}"""
|
|
out = {}
|
|
for enumerator, tokens in readers.items():
|
|
bit = aliases.get(enumerator)
|
|
if bit is None:
|
|
continue
|
|
movers = set()
|
|
resolved = True
|
|
for token in tokens:
|
|
if token.startswith("FIELD:"):
|
|
movers.add(token)
|
|
continue
|
|
members = resolve_reader(token[4:], bodies)
|
|
if not members:
|
|
resolved = False
|
|
movers |= members
|
|
out[bit] = (movers, resolved and bool(movers))
|
|
return out
|
|
|
|
|
|
def dirty_bit_names():
|
|
"""The MGPipeDirty bit names, read out of Tracker.h's kMGPipeDirtyNames so a row cannot
|
|
name a bit that does not exist and a bit cannot be renamed out from under a row. Read
|
|
from the RAW text on purpose: the names are string literals, which is exactly what
|
|
mask_comments_and_strings blanks."""
|
|
with open(TRACKER_PATH, "r", encoding="utf-8", errors="replace") as handle:
|
|
return set(DIRTY_NAME_RE.findall(handle.read()))
|
|
|
|
|
|
def load_mapping(text=None):
|
|
"""{mutator: answer} from DirtySurface.def, or from `text` for the self-test. An answer
|
|
keeps its "|"-joined spelling; answer_set() below is what compares them."""
|
|
if text is None:
|
|
with open(DEF_PATH, "r", encoding="utf-8", errors="replace") as handle:
|
|
text = handle.read()
|
|
rows = {}
|
|
duplicates = []
|
|
for match in ROW_RE.finditer(mask_comments_and_strings(text)):
|
|
mutator, answer = match.group(1), match.group(2)
|
|
if mutator in rows:
|
|
duplicates.append(mutator)
|
|
rows[mutator] = answer
|
|
return rows, duplicates
|
|
|
|
|
|
def answer_set(answer):
|
|
return {part.strip() for part in answer.split("|") if part.strip()}
|
|
|
|
|
|
def object_class_problems(mapping, bits, movers, moved, outside=None):
|
|
"""The under-firing check for every answer the RenderState derivation cannot reach.
|
|
|
|
Returns (problems, verified, declined) - `declined` names the rows the derivation REFUSED
|
|
to answer, with the reason. Every branch below that does not end in a verdict ends here
|
|
instead, because the alternative is what this gate did to NEW_PIXEL_PACK: turn "this
|
|
script cannot read that construct" into "that mutator writes nothing"."""
|
|
outside = outside or {}
|
|
problems = []
|
|
verified = 0
|
|
declined = []
|
|
render_bits = {RENDER_STATE_BIT, PIPELINE_STATE_BIT}
|
|
for mutator in sorted(mapping):
|
|
claimed = (answer_set(mapping[mutator]) & bits) - render_bits
|
|
if not claimed:
|
|
continue
|
|
if mutator not in moved:
|
|
declined.append("%s (no body found under MG_State/GLState or MG_Impl/Pipe to "
|
|
"derive from)" % mutator)
|
|
continue
|
|
blind = sorted(token[6:] for token in moved[mutator] if token.startswith("TAINT:"))
|
|
for bit in sorted(claimed):
|
|
shutter, resolved = movers.get(bit, (set(), False))
|
|
if not resolved:
|
|
declined.append("%s <- %s (Tracker.h's shutter for that bit reads something "
|
|
"this script cannot resolve to a member)" % (mutator, bit))
|
|
continue
|
|
if moved[mutator] & shutter:
|
|
verified += 1
|
|
continue
|
|
# Everything past here would be an ABSENCE claim, so the gate first has to be
|
|
# able to say it read every writer of that shutter. Two things stop it, and each
|
|
# is a decline rather than a verdict.
|
|
unread = sorted(set(outside[token] for token in shutter if token in outside))
|
|
if unread:
|
|
declined.append("%s <- %s (that shutter's members are written outside the "
|
|
"analysed roots too, e.g. %s, so 'it writes nothing that "
|
|
"shutter reads' is not a fact this script has)"
|
|
% (mutator, bit, unread[0]))
|
|
continue
|
|
if blind:
|
|
declined.append("%s <- %s (it reaches %s, so the write analysis is not "
|
|
"complete for this mutator)" % (mutator, bit, blind[0]))
|
|
continue
|
|
problems.append(
|
|
"UNDER-FIRING answer %s for %s - it writes nothing %s's shutter reads "
|
|
"(shutter: %s), so a mutation through it publishes nothing"
|
|
% (bit, mutator, bit, ", ".join(sorted(t.split(":", 1)[1] for t in shutter))))
|
|
return problems, verified, declined
|
|
|
|
|
|
def check_mapping(mapping, duplicates, scanned, bits, publishers=None, movers=None, moved=None,
|
|
outside=None):
|
|
"""Every problem the gate fails on, as a list of human-readable lines. BOTH directions:
|
|
an unmapped mutator renders stale, and a row naming a mutator the scan no longer finds is
|
|
a stale row that would keep a real hole looking covered. `publishers` is
|
|
render_state_publishers()'s table; passing None checks only existence and vocabulary,
|
|
which is what the mutator-level negative controls want."""
|
|
problems = []
|
|
for mutator in sorted(set(scanned) - set(mapping)):
|
|
problems.append("UNMAPPED mutator %s - add a row to MG_Pipe/DirtySurface.def" % mutator)
|
|
for mutator in sorted(set(mapping) - set(scanned)):
|
|
problems.append("STALE row %s - the scan no longer finds this mutator; delete the row"
|
|
% mutator)
|
|
for mutator in sorted(duplicates):
|
|
problems.append("DUPLICATE row %s" % mutator)
|
|
for mutator in sorted(mapping):
|
|
answers = answer_set(mapping[mutator])
|
|
if not answers:
|
|
problems.append("BAD answer for %s - empty" % mutator)
|
|
continue
|
|
for answer in sorted(answers):
|
|
if answer in NON_BIT_ANSWERS or answer in bits:
|
|
continue
|
|
problems.append("BAD answer %s for %s - not a MGPipeDirty bit name and not one of %s"
|
|
% (answer, mutator, ", ".join(NON_BIT_ANSWERS)))
|
|
partial = answers & set(PARTIAL_ANSWERS)
|
|
if len(answers) > 1 and (answers & set(NON_BIT_ANSWERS)) - partial:
|
|
problems.append("BAD answer %s for %s - a non-bit answer stands alone"
|
|
% (mapping[mutator], mutator))
|
|
if partial and not answers & bits:
|
|
problems.append("BAD answer %s for %s - %s has to NAME the bits that move on some "
|
|
"of the paths that mutate; kPulledEveryVerb is the answer when "
|
|
"none does" % (mapping[mutator], mutator, "|".join(sorted(partial))))
|
|
|
|
if movers is not None and moved is not None:
|
|
object_problems, _, _ = object_class_problems(mapping, bits, movers, moved, outside)
|
|
problems += object_problems
|
|
|
|
if publishers is None:
|
|
return problems
|
|
|
|
# THE TRUTH HALF, and it is the half a row can be green and wrong without. For every
|
|
# mutator that is a RenderState setter, the render-state publishers the row claims must
|
|
# be exactly the ones RenderState.cpp always moves - a claimed publisher that does not
|
|
# always fire is an under-firing shutter waiting to be built from this file, and a
|
|
# publisher that always fires but is not claimed hides one.
|
|
render_bits = {RENDER_STATE_BIT, PIPELINE_STATE_BIT}
|
|
for mutator in sorted(mapping):
|
|
claimed = answer_set(mapping[mutator]) & render_bits
|
|
if mutator not in publishers:
|
|
if claimed:
|
|
problems.append(
|
|
"UNVERIFIABLE answer %s for %s - it claims a render-state publisher but "
|
|
"RenderState.cpp has no such setter to derive it from"
|
|
% (mapping[mutator], mutator))
|
|
continue
|
|
derived = publishers[mutator] & render_bits
|
|
if claimed == derived:
|
|
continue
|
|
for missing in sorted(derived - claimed):
|
|
problems.append(
|
|
"MISSING publisher %s for %s - RenderState.cpp moves it on every path, so the "
|
|
"row must name it (derived: %s)"
|
|
% (missing, mutator, "|".join(sorted(derived)) or "none"))
|
|
for extra in sorted(claimed - derived):
|
|
problems.append(
|
|
"UNDER-FIRING answer %s for %s - RenderState.cpp does NOT move it on every "
|
|
"path, so a shutter built on it would miss a mutation (derived: %s)"
|
|
% (extra, mutator, "|".join(sorted(derived)) or "none"))
|
|
return problems
|
|
|
|
|
|
SELF_TEST_WITHHELD = """
|
|
#define MGP_DIRTY_SURFACE_LIST(X) \\
|
|
X(RecordError, kReverseChannel)
|
|
"""
|
|
|
|
SELF_TEST_STALE = None # built from the real def at run time
|
|
|
|
|
|
def scan_all():
|
|
"""(findings-per-file, {mutator: call count}) over the whole scan root."""
|
|
sources = []
|
|
for root, _, files in os.walk(SCAN_ROOT):
|
|
for name in sorted(files):
|
|
if name.endswith((".cpp", ".h")):
|
|
sources.append(os.path.join(root, name))
|
|
sources.sort()
|
|
|
|
per_file = []
|
|
distinct_all = {}
|
|
for path in sources:
|
|
findings, all_mutators = scan_file(path)
|
|
for mutator, _ in all_mutators:
|
|
distinct_all[mutator] = distinct_all.get(mutator, 0) + 1
|
|
per_file.append((path, findings, all_mutators))
|
|
return sources, per_file, distinct_all
|
|
|
|
|
|
def self_test(scanned, bits, publishers, movers, moved, outside=None):
|
|
"""Canned negative controls. Each MUST trip; trips == 0 is an error, which is the shape
|
|
check_include_closure.py and gen_pipe.py --self-test already use."""
|
|
trips = 0
|
|
failures = []
|
|
|
|
# 1. a mutator withheld from the def.
|
|
mapping, duplicates = load_mapping(SELF_TEST_WITHHELD)
|
|
problems = check_mapping(mapping, duplicates, scanned, bits)
|
|
if any(p.startswith("UNMAPPED") for p in problems):
|
|
trips += 1
|
|
else:
|
|
failures.append("negative control 1 (a withheld mutator) did NOT trip")
|
|
|
|
# 2. a row naming a mutator the scan does not find.
|
|
real, real_duplicates = load_mapping()
|
|
with_ghost = dict(real)
|
|
with_ghost["SetSomethingThatDoesNotExist"] = "kImmediate"
|
|
problems = check_mapping(with_ghost, real_duplicates, scanned, bits)
|
|
if any(p.startswith("STALE") for p in problems):
|
|
trips += 1
|
|
else:
|
|
failures.append("negative control 2 (a stale row) did NOT trip")
|
|
|
|
# 3. a row whose answer is neither a dirty bit nor one of the documented non-bit answers.
|
|
with_typo = dict(real)
|
|
with_typo["RecordError"] = "NEW_TYPO_THAT_IS_NOT_A_BIT"
|
|
problems = check_mapping(with_typo, real_duplicates, scanned, bits)
|
|
if any(p.startswith("BAD answer") for p in problems):
|
|
trips += 1
|
|
else:
|
|
failures.append("negative control 3 (a bad answer) did NOT trip")
|
|
|
|
# 4. THE CONTROL FOR THE TRUTH HALF, and it is the shape of the defect that was actually
|
|
# in this file: a row claiming a publisher that fires on only some paths through the
|
|
# setter. SetCapability's ClipDistance0..7 arms move m_version alone, so
|
|
# NEW_PIPELINE_STATE here must read as under-firing rather than as a valid answer.
|
|
with_under_firing = dict(real)
|
|
with_under_firing["SetCapability"] = PIPELINE_STATE_BIT
|
|
problems = check_mapping(with_under_firing, real_duplicates, scanned, bits, publishers)
|
|
if any(p.startswith("UNDER-FIRING") for p in problems):
|
|
trips += 1
|
|
else:
|
|
failures.append("negative control 4 (an under-firing render-state answer) did NOT trip")
|
|
|
|
# 5. the other direction: a row that drops a publisher which DOES always fire. Silent
|
|
# today, load-bearing the moment P3a builds a shutter from the file.
|
|
with_missing = dict(real)
|
|
with_missing["SetBlendEquation"] = RENDER_STATE_BIT
|
|
problems = check_mapping(with_missing, real_duplicates, scanned, bits, publishers)
|
|
if any(p.startswith("MISSING publisher") for p in problems):
|
|
trips += 1
|
|
else:
|
|
failures.append("negative control 5 (a dropped render-state publisher) did NOT trip")
|
|
|
|
# 6. THE CONTROL FOR THE OBJECT-CLASS HALF, and it is again the shape of a defect that
|
|
# was actually in this file: X(SetNamedTransformFeedbackBinding, NEW_SO_TARGETS)
|
|
# named a shutter (the buffer-content aggregate mixed with the transform-feedback
|
|
# generation) that GLContext::SetNamedTransformFeedbackBinding moves on no path - it
|
|
# binds a BufferState binding point or writes a saved-bindings entry, and neither is
|
|
# a buffer CONTENT write or a BeginTransformFeedback.
|
|
with_dead_shutter = dict(real)
|
|
with_dead_shutter["SetNamedTransformFeedbackBinding"] = "NEW_SO_TARGETS"
|
|
problems = check_mapping(with_dead_shutter, real_duplicates, scanned, bits, publishers,
|
|
movers, moved, outside)
|
|
if any("UNDER-FIRING answer NEW_SO_TARGETS" in p for p in problems):
|
|
trips += 1
|
|
else:
|
|
failures.append("negative control 6 (an object-class answer whose shutter the mutator "
|
|
"never moves) did NOT trip")
|
|
|
|
# 7. the same check pointed at a value-class bit, so one passing control cannot stand in
|
|
# for the whole family: a vertex-attribute default does not move the pixel-store bytes.
|
|
with_wrong_bit = dict(real)
|
|
with_wrong_bit["SetCurrentVertexAttributeInt"] = "NEW_PIXEL_PACK"
|
|
problems = check_mapping(with_wrong_bit, real_duplicates, scanned, bits, publishers,
|
|
movers, moved, outside)
|
|
if any("UNDER-FIRING answer NEW_PIXEL_PACK" in p for p in problems):
|
|
trips += 1
|
|
else:
|
|
failures.append("negative control 7 (a value-class answer whose shutter the mutator "
|
|
"never moves) did NOT trip")
|
|
|
|
# 8. A row that says kPulledPartialShutter and names no bit. The whole point of that
|
|
# answer is to carry the bits that DO move, so an empty one is kPulledEveryVerb with
|
|
# a different spelling - and kPulledEveryVerb is the claim that got NEW_PIXEL_PACK
|
|
# wrong in the first place.
|
|
with_empty_partial = dict(real)
|
|
with_empty_partial["SetPixelStoreParam"] = "kPulledPartialShutter"
|
|
problems = check_mapping(with_empty_partial, real_duplicates, scanned, bits)
|
|
if any("has to NAME the bits" in p for p in problems):
|
|
trips += 1
|
|
else:
|
|
failures.append("negative control 8 (kPulledPartialShutter naming no bit) did NOT trip")
|
|
|
|
# 9. THE CONTROL FOR THE DECLINE PATH, and it is the shape of the defect this round fixed.
|
|
# The gate did not merely miss a check: it turned "this script cannot read that
|
|
# construct" into "that mutator writes nothing", and printed a verdict about
|
|
# RenderState.cpp that was false. So a mutator whose reachable text contains something
|
|
# the analysis does not model has to come out DECLINED and must NOT appear as a
|
|
# problem, whatever else is true of it.
|
|
blinded = dict(moved)
|
|
blinded["SetCurrentVertexAttributeInt"] = {"TAINT:a canned unexpandable token paste"}
|
|
problems, _, declined = object_class_problems(with_wrong_bit, bits, movers, blinded, outside)
|
|
if (not any("SetCurrentVertexAttributeInt" in p for p in problems)
|
|
and any(d.startswith("SetCurrentVertexAttributeInt <- NEW_PIXEL_PACK") for d in declined)):
|
|
trips += 1
|
|
else:
|
|
failures.append("negative control 9 (a mutator whose write analysis is incomplete) did "
|
|
"NOT decline - the gate answered a question it cannot answer")
|
|
|
|
# 10. The other decline reason, and the other half of the same principle: a shutter whose
|
|
# members have a writer OUTSIDE the roots this analysis reads. "Nobody writes it" is
|
|
# not a claim about code the script never opened.
|
|
hidden = dict(outside or {})
|
|
for token in movers.get("NEW_PIXEL_PACK", (set(), False))[0]:
|
|
hidden[token] = "MobileGL/MG_Backend/a-file-this-analysis-never-reads.cpp"
|
|
problems, _, declined = object_class_problems(with_wrong_bit, bits, movers, moved, hidden)
|
|
if (not any("SetCurrentVertexAttributeInt" in p for p in problems)
|
|
and any("outside the analysed roots" in d for d in declined)):
|
|
trips += 1
|
|
else:
|
|
failures.append("negative control 10 (a shutter member written outside the analysed "
|
|
"roots) did NOT decline - the gate claimed an absence over code it "
|
|
"never read")
|
|
|
|
# THE POSITIVE CONTROL, and it is the row that was wrong: RenderState::SetPixelStoreParam
|
|
# writes NEW_PIXEL_PACK's shutter member sixteen times, through a token-pasting macro. If
|
|
# this ever reads as UNDER-FIRING again, the write analysis has lost the preprocessor and
|
|
# every absence claim in this gate is worthless.
|
|
with_the_bit = dict(real)
|
|
with_the_bit["SetPixelStoreParam"] = "NEW_PIXEL_PACK"
|
|
problems, _, declined = object_class_problems(with_the_bit, bits, movers, moved, outside)
|
|
if any("SetPixelStoreParam" in line for line in problems + declined):
|
|
failures.append("the positive control (SetPixelStoreParam DOES write "
|
|
"NEW_PIXEL_PACK's shutter) did not pass: %s"
|
|
% "; ".join(line for line in problems + declined
|
|
if "SetPixelStoreParam" in line))
|
|
|
|
for failure in failures:
|
|
print("dirty-surface self-test: %s" % failure)
|
|
if trips == 0:
|
|
print("dirty-surface self-test: NOTHING tripped - the gate cannot fail, which is worse "
|
|
"than a red gate")
|
|
return 1
|
|
if failures:
|
|
return 1
|
|
print("dirty-surface self-test: %d negative controls, all tripped; positive control OK "
|
|
"(SetPixelStoreParam's sixteen token-pasted writes are read)" % trips)
|
|
return 0
|
|
|
|
|
|
def main():
|
|
parser = argparse.ArgumentParser(description=__doc__)
|
|
parser.add_argument("--summary", action="store_true", help="print the counts only")
|
|
parser.add_argument("--check", action="store_true",
|
|
help="fail when a scanned mutator has no row in DirtySurface.def, or a "
|
|
"row names a mutator the scan no longer finds")
|
|
parser.add_argument("--self-test", action="store_true",
|
|
help="run the canned negative controls; each must trip")
|
|
args = parser.parse_args()
|
|
|
|
if not os.path.isdir(SCAN_ROOT):
|
|
sys.exit("missing %s" % SCAN_ROOT)
|
|
if not os.path.isfile(DEF_PATH):
|
|
sys.exit("missing %s" % DEF_PATH)
|
|
if not os.path.isfile(RENDER_STATE_PATH):
|
|
sys.exit("missing %s" % RENDER_STATE_PATH)
|
|
|
|
sources, per_file, distinct_all = scan_all()
|
|
bits = dirty_bit_names()
|
|
if not bits:
|
|
sys.exit("could not read the MGPipeDirty bit names out of %s" % TRACKER_PATH)
|
|
publishers = render_state_publishers()
|
|
if not publishers:
|
|
sys.exit("could not derive any RenderState setter out of %s" % RENDER_STATE_PATH)
|
|
bodies, taints, analysed = state_bodies()
|
|
reach = written_tokens(bodies, taints)
|
|
outside = writers_outside(analysed)
|
|
aggregates = aggregate_tokens(bodies, reach)
|
|
moved = {name: expand_aggregates(tokens, aggregates) for name, tokens in reach.items()}
|
|
readers = shutter_readers()
|
|
if not readers:
|
|
sys.exit("could not read the dirty shutters out of %s - has MGPipeTracker::Update been "
|
|
"renamed?" % TRACKER_PATH)
|
|
aliases = dirty_bit_aliases()
|
|
if not aliases:
|
|
sys.exit("could not pair MGPipeDirty's enumerators with kMGPipeDirtyNames in %s - the "
|
|
"enum and its name table have drifted apart" % TRACKER_PATH)
|
|
movers = shutter_movers(readers, bodies, aliases)
|
|
|
|
if args.self_test:
|
|
return self_test(distinct_all, bits, publishers, movers, moved, outside)
|
|
|
|
mapping, duplicates = load_mapping()
|
|
|
|
if args.check:
|
|
problems = check_mapping(mapping, duplicates, distinct_all, bits, publishers, movers,
|
|
moved, outside)
|
|
for problem in problems:
|
|
print("dirty-surface: %s" % problem)
|
|
if problems:
|
|
print("dirty-surface: %d problem(s); the mapping must cover every mutator the scan "
|
|
"finds, in both directions, and every render-state answer must be the one "
|
|
"RenderState.cpp actually publishes" % len(problems))
|
|
return 1
|
|
derived = sum(1 for m in mapping if m in publishers)
|
|
_, verified, declined = object_class_problems(mapping, bits, movers, moved, outside)
|
|
prose = sorted(m for m in mapping if not (answer_set(mapping[m]) & bits))
|
|
print("dirty-surface: %d mutators, all mapped, no stale rows; %d render-state answers "
|
|
"derived from RenderState.cpp and matching" % (len(mapping), derived))
|
|
# What the gate did NOT check is part of its output, or "all mapped" reads as "all
|
|
# verified" - which it is not, and was not for two rows through a whole review.
|
|
print("dirty-surface: %d other bit answers derived from their shutter in Tracker.h "
|
|
"(under-firing only); %d declined; %d rows carry a prose answer (%s) that no "
|
|
"derivation checks"
|
|
% (verified, len(declined), len(prose),
|
|
", ".join(sorted(set(a for m in prose for a in answer_set(mapping[m]))))))
|
|
for row in declined:
|
|
print("dirty-surface: DECLINED, no verdict: %s" % row)
|
|
# The absence claim's own footprint, printed rather than assumed: what the write
|
|
# analysis read, and the one place it is still coarse.
|
|
print("dirty-surface: the under-firing half read %d function bodies across %d files "
|
|
"under %s, macros expanded first; %d of those bodies carry a construct it does "
|
|
"not model and taint whatever reaches them; %d members are written outside "
|
|
"those roots and any shutter that names one is declined; a FIELD token is "
|
|
"matched by name and not scoped to a type, so it only ever WIDENS what a "
|
|
"mutator is credited with writing"
|
|
% (sum(len(v) for v in bodies.values()), len(analysed),
|
|
" + ".join(os.path.relpath(root, REPO_ROOT).replace(os.sep, "/")
|
|
for root in STATE_ROOTS),
|
|
len(taints), len(outside)))
|
|
return 0
|
|
|
|
total_functions = 0
|
|
total_mutators = 0
|
|
deferred_mutators = 0
|
|
distinct_mutators = {}
|
|
for path, findings, all_mutators in per_file:
|
|
deferred_mutators += len(all_mutators)
|
|
if not findings:
|
|
continue
|
|
relative = os.path.relpath(path, REPO_ROOT).replace(os.sep, "/")
|
|
if not args.summary:
|
|
print("\n%s" % relative)
|
|
for finding in findings:
|
|
total_functions += 1
|
|
total_mutators += len(finding["mutators"])
|
|
for mutator, _ in finding["mutators"]:
|
|
distinct_mutators[mutator] = distinct_mutators.get(mutator, 0) + 1
|
|
if args.summary:
|
|
continue
|
|
print(" %s (line %d) -> backend: %s" % (finding["function"], finding["line"],
|
|
", ".join(finding["backend"][:4])))
|
|
for mutator, line in finding["mutators"]:
|
|
print(" %-44s :%d %s" % (mutator, line, mapping.get(mutator, "UNMAPPED")))
|
|
|
|
print("\ndirty-surface: %d files scanned under MG_Impl/GLImpl" % len(sources))
|
|
print("dirty-surface: %d mutator calls in total, %d distinct mutators" % (deferred_mutators,
|
|
len(distinct_all)))
|
|
print("dirty-surface: %d of them sit in %d IMMEDIATE PUBLISH POINTS - functions that also "
|
|
"reach the backend - across %d distinct mutators"
|
|
% (total_mutators, total_functions, len(distinct_mutators)))
|
|
print("dirty-surface: the remaining %d are DEFERRED: nothing reaches the backend in the same "
|
|
"function, so the next verb publishes them, and each one needs an aggregate generation"
|
|
% (deferred_mutators - total_mutators))
|
|
print("dirty-surface: distinct mutators, by call count, with what publishes each")
|
|
for mutator in sorted(distinct_all, key=lambda k: (-distinct_all[k], k)):
|
|
print(" %5d %-42s %s%s" % (distinct_all[mutator], mutator,
|
|
mapping.get(mutator, "UNMAPPED"),
|
|
" (immediate)" if mutator in distinct_mutators else ""))
|
|
unmapped = sorted(set(distinct_all) - set(mapping))
|
|
if unmapped:
|
|
print("dirty-surface: %d UNMAPPED - run --check, which is a gate since P2" % len(unmapped))
|
|
else:
|
|
print("dirty-surface: every mutator above is mapped (MG_Pipe/DirtySurface.def); --check "
|
|
"is a gate and --self-test proves it can fail")
|
|
print("dirty-surface: known limits of this scanner - it matches braced function bodies "
|
|
"textually, so a mutator inside a lambda is attributed to the enclosing function, and a "
|
|
"mutation published through a helper the entry point calls reads as deferred here.")
|
|
return 0
|
|
|
|
|
|
if __name__ == "__main__":
|
|
sys.exit(main())
|