100 tasks from the HWE arm-linux code-gen pool (outside the lk/man/pth range given to batch 22), each with at least one independent contract-edge defect and plain public docs. Claude reviewed 100/100 USABLE against current digests; no ID or source overlap with main or batch 22. Difficulty is unmeasured. progress.md records the wrap-up: all Codex sessions and Qwen schedulers stopped for the user's rollout, Qwen results so far (57 HARD of 373), and what is left on each batch branch. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
281 lines
12 KiB
Python
281 lines
12 KiB
Python
"""Trusted independent state model; subprocesses receive only operational stdin."""
|
|
import copy
|
|
import json
|
|
import random
|
|
import re
|
|
import subprocess
|
|
import sys
|
|
import tempfile
|
|
from pathlib import Path
|
|
|
|
DEVICE_FIELDS = ('present','line','shared','enabled','mask','pending','handled','none','ack_bits','raises','cleared_bits')
|
|
LINE_FIELDS = ('cursor','dispatches','handled','none','visits','ack_bits')
|
|
SUMMARY_FIELDS = ('members','enabled_members','ready_members','pending_union','ready_union','deferred_union','pending_bits','ready_bits','deferred_bits')
|
|
|
|
def device():
|
|
return dict(zip(DEVICE_FIELDS, (0,-1,0,0,0,0,0,0,0,0,0)))
|
|
|
|
def initial():
|
|
return dict(devices=[device() for _ in range(8)], lines=[dict.fromkeys(LINE_FIELDS,0) for _ in range(4)],
|
|
accepted=0,rejected=0,last_line=-1,last_result=0,deliveries=[])
|
|
|
|
def bits(n):
|
|
return bin(n).count('1')
|
|
|
|
def compatible(devices):
|
|
for line in range(4):
|
|
peers = [d for d in devices if d['present'] and d['line'] == line]
|
|
if len(peers) > 1 and any(not d['shared'] for d in peers):
|
|
return False
|
|
return True
|
|
|
|
def operation(m, event):
|
|
name, *a = event
|
|
if name == 'RESET':
|
|
m.clear()
|
|
m.update(initial())
|
|
return 0
|
|
dev = m['devices']
|
|
error = 0
|
|
if name in ('BATCH','REBIND'):
|
|
changes = list(zip(a[1::2],a[2::2]))
|
|
upper = 3 if name == 'REBIND' else 65535
|
|
if a[0] > 8 or any(not 0 <= i < 8 or not 0 <= v <= upper for i,v in changes):
|
|
error = 1
|
|
elif len({i for i,v in changes}) != len(changes):
|
|
error = 5
|
|
elif any(not dev[i]['present'] for i,v in changes):
|
|
error = 3
|
|
elif name == 'REBIND':
|
|
prospective = copy.deepcopy(dev)
|
|
for i,v in changes:
|
|
prospective[i]['line'] = v
|
|
if not compatible(prospective):
|
|
error = 4
|
|
elif name == 'PULSE':
|
|
if not 0 <= a[0] < 4 or not 0 <= a[1] <= 8:
|
|
error = 1
|
|
else:
|
|
valid = 0 <= a[0] < 8
|
|
if name == 'ATTACH':
|
|
valid &= 0 <= a[1] < 4 and a[2] in (0,1) and 0 <= a[3] <= 65535
|
|
elif name in ('MASK','RAISE','CLEAR'):
|
|
valid &= 0 <= a[1] <= 65535
|
|
elif name == 'ENABLE':
|
|
valid &= a[1] in (0,1)
|
|
elif name == 'MOVE':
|
|
valid &= 0 <= a[1] < 4
|
|
elif name == 'TRANSFER':
|
|
valid &= 0 <= a[1] < 8 and 0 <= a[2] <= 65535
|
|
if not valid:
|
|
error = 1
|
|
elif name == 'ATTACH' and dev[a[0]]['present']:
|
|
error = 2
|
|
elif name != 'ATTACH' and not dev[a[0]]['present']:
|
|
error = 3
|
|
elif name == 'TRANSFER' and not dev[a[1]]['present']:
|
|
error = 3
|
|
elif name in ('ATTACH','MOVE'):
|
|
prospective = copy.deepcopy(dev)
|
|
if name == 'ATTACH':
|
|
prospective[a[0]]['present'] = 1
|
|
prospective[a[0]]['shared'] = a[2]
|
|
prospective[a[0]]['line'] = a[1]
|
|
if not compatible(prospective):
|
|
error = 4
|
|
if error:
|
|
m['rejected'] += 1
|
|
return error
|
|
m['accepted'] += 1
|
|
if name == 'ATTACH':
|
|
d = device()
|
|
d.update(present=1,line=a[1],shared=a[2],enabled=1,mask=a[3])
|
|
dev[a[0]] = d
|
|
elif name == 'DETACH':
|
|
dev[a[0]] = device()
|
|
elif name == 'MASK':
|
|
dev[a[0]]['mask'] = a[1]
|
|
elif name == 'ENABLE':
|
|
dev[a[0]]['enabled'] = a[1]
|
|
elif name == 'MOVE':
|
|
dev[a[0]]['line'] = a[1]
|
|
elif name == 'RAISE':
|
|
dev[a[0]]['pending'] |= a[1]
|
|
dev[a[0]]['raises'] += 1
|
|
elif name == 'CLEAR':
|
|
d = dev[a[0]]
|
|
d['cleared_bits'] += bits(d['pending'] & a[1])
|
|
d['pending'] &= ~a[1]
|
|
elif name == 'TRANSFER':
|
|
if a[0] != a[1]:
|
|
selected = dev[a[0]]['pending'] & a[2]
|
|
dev[a[0]]['pending'] &= ~selected
|
|
dev[a[1]]['pending'] |= selected
|
|
elif name == 'BATCH':
|
|
for i,v in changes:
|
|
dev[i]['pending'] |= v
|
|
dev[i]['raises'] += 1
|
|
elif name == 'REBIND':
|
|
for i,v in changes:
|
|
dev[i]['line'] = v
|
|
elif name == 'PULSE':
|
|
target,budget = a
|
|
line = m['lines'][target]
|
|
order = sorted((i for i,d in enumerate(dev) if d['present'] and d['enabled'] and d['line'] == target),
|
|
key=lambda i: (i-line['cursor'])%8)[:budget]
|
|
line['dispatches'] += 1
|
|
m['last_line'],m['last_result'],m['deliveries'] = target,0,[]
|
|
for i in order:
|
|
d = dev[i]
|
|
owned = d['pending'] & d['mask']
|
|
handled = int(owned != 0)
|
|
d['pending'] &= ~owned
|
|
d['handled'] += handled
|
|
d['none'] += 1-handled
|
|
d['ack_bits'] += bits(owned)
|
|
line['cursor'] = (i+1)%8
|
|
line['visits'] += 1
|
|
line['ack_bits'] += bits(owned)
|
|
m['last_result'] |= handled
|
|
m['deliveries'].append((i,handled,owned))
|
|
line['handled'] += m['last_result']
|
|
line['none'] += 1-m['last_result']
|
|
return 0
|
|
|
|
def flatten(m, status):
|
|
result = [status,m['accepted'],m['rejected'],m['last_line'],m['last_result']]
|
|
for d in m['devices']:
|
|
result += [d[f] for f in DEVICE_FIELDS]
|
|
for line in m['lines']:
|
|
result += [line[f] for f in LINE_FIELDS]
|
|
for line in range(4):
|
|
summary = dict.fromkeys(SUMMARY_FIELDS,0)
|
|
for i,d in enumerate(m['devices']):
|
|
if not d['present'] or d['line'] != line:
|
|
continue
|
|
pending = d['pending']
|
|
ready = pending & d['mask'] if d['enabled'] else 0
|
|
deferred = pending & ~ready
|
|
summary['members'] |= 1 << i
|
|
if d['enabled']:
|
|
summary['enabled_members'] |= 1 << i
|
|
if ready:
|
|
summary['ready_members'] |= 1 << i
|
|
for key,value in [('pending',pending),('ready',ready),('deferred',deferred)]:
|
|
summary[key+'_union'] |= value
|
|
summary[key+'_bits'] += bits(value)
|
|
result += [summary[f] for f in SUMMARY_FIELDS]
|
|
result += [len(m['deliveries'])]
|
|
for delivery in m['deliveries']:
|
|
result += list(delivery)
|
|
return result
|
|
|
|
def generate(seed):
|
|
rng = random.Random(seed)
|
|
e = [('RESET',),('ATTACH',0,0,1,1),('RAISE',0,3),('PULSE',0,8),('MASK',0,3),('PULSE',0,8)]
|
|
e += [('RESET',),('ATTACH',1,2,1,0),('ATTACH',4,2,1,65535),('ATTACH',7,2,1,65535),('RAISE',4,32768)]
|
|
e += [('PULSE',2,1)]*12
|
|
e += [('ENABLE',4,0),('RAISE',4,65535),('PULSE',2,8),('ENABLE',4,1),('MASK',1,65535),('RAISE',1,7),('PULSE',2,0),('PULSE',2,8)]
|
|
e += [('RESET',),('ATTACH',0,0,0,65535),('ATTACH',7,3,0,32768),('RAISE',0,65535),('RAISE',7,32768)]
|
|
e += [('MOVE',0,3),('REBIND',2,0,3,7,0),('PULSE',3,1),('PULSE',0,1),('REBIND',2,0,1,7,1),('TRANSFER',0,7,65535)]
|
|
e += [('CLEAR',7,3),('CLEAR',7,3),('TRANSFER',7,7,65535),('DETACH',7),('DETACH',7),('ATTACH',7,0,1,0)]
|
|
e += [('BATCH',0),('REBIND',0),('BATCH',2,0,7,7,65535),('BATCH',2,0,1,0,2),('BATCH',2,2,1,2,2)]
|
|
e += [('BATCH',2,2,1,2,65536),('BATCH',2,0,8,1,4),('REBIND',2,2,0,2,4),('REBIND',2,2,0,2,0)]
|
|
e += [('BATCH',n)+tuple(v for i in range(n) for v in (i%8,1)) for n in (9,16)]
|
|
e += [('REBIND',n)+tuple(v for i in range(n) for v in (i%8,1)) for n in (9,16)]
|
|
e += [('RESET',)]
|
|
for i in range(8):
|
|
e += [('ATTACH',i,i%4,1,[0,1,65535,32768][i%4])]
|
|
for n in range(1200):
|
|
if n and n%200 == 0:
|
|
e += [('RESET',)]
|
|
for i in range(8):
|
|
e += [('ATTACH',i,rng.randrange(4),1,rng.randrange(65536))]
|
|
name = rng.choice(['PULSE']*6+['RAISE']*5+['MASK']*2+['CLEAR','ENABLE','MOVE','TRANSFER','BATCH','REBIND','DETACH','ATTACH'])
|
|
i = rng.randrange(8)
|
|
value = rng.choice([0,1,2,3,7,32768,65535,rng.randrange(65536)])
|
|
if name == 'PULSE':
|
|
e += [(name,rng.randrange(4),rng.choice([0,1,2,7,8]))]
|
|
elif name in ('RAISE','MASK','CLEAR'):
|
|
e += [(name,i,value)]
|
|
elif name == 'ENABLE':
|
|
e += [(name,i,rng.randrange(2))]
|
|
elif name == 'MOVE':
|
|
e += [(name,i,rng.randrange(4))]
|
|
elif name == 'TRANSFER':
|
|
e += [(name,i,rng.randrange(8),value)]
|
|
elif name == 'ATTACH':
|
|
e += [(name,i,rng.randrange(4),rng.randrange(2),value)]
|
|
elif name == 'DETACH':
|
|
e += [(name,i)]
|
|
else:
|
|
ids = rng.sample(range(8),rng.randrange(9))
|
|
e += [(name,len(ids))+tuple(v for d in ids for v in (d,rng.randrange(4) if name == 'REBIND' else rng.randrange(65536)))]
|
|
# Cross all scalar range boundaries, including exact int64_t endpoints, and recover.
|
|
endpoints = [-9223372036854775808,-1,0,7,8,9223372036854775807]
|
|
for i in endpoints:
|
|
e += [('BATCH',1,i,0),('REBIND',1,i,0)]
|
|
e += [('ATTACH',i,0,1,65535),('DETACH',i),('MASK',i,0),('RAISE',i,65535),('CLEAR',i,0),('ENABLE',i,0),('MOVE',i,0),('TRANSFER',i,0,0),('TRANSFER',0,i,0)]
|
|
for value in [-9223372036854775808,-1,0,1,3,4,7,8,9,65535,65536,9223372036854775807]:
|
|
e += [('ATTACH',0,value,1,0),('ATTACH',0,0,value,0),('ATTACH',0,0,1,value),('MASK',0,value),('RAISE',0,value),('CLEAR',0,value),('ENABLE',0,value),('MOVE',0,value),('TRANSFER',0,0,value),('PULSE',value,1),('PULSE',0,value),('BATCH',1,0,value),('REBIND',1,0,value)]
|
|
# Successful maximum-length transactions, disabled summaries, coalescing and history.
|
|
e += [('RESET',)]
|
|
for i in range(8):
|
|
e += [('ATTACH',i,0,1,65535),('RAISE',i,65535),('RAISE',i,65535)]
|
|
e += [('BATCH',8)+tuple(v for i in range(8) for v in (i,1<<i))]
|
|
e += [('REBIND',8)+tuple(v for i in range(8) for v in (i,i%4))]
|
|
for line in range(4):
|
|
e += [('PULSE',line,8),('PULSE',line,8),('PULSE',line,0)]
|
|
e += [('DETACH',7),('ATTACH',7,3,1,65535),('RAISE',7,65535),('ENABLE',7,0),('PULSE',3,8),('RESET',)]
|
|
return e
|
|
|
|
def main():
|
|
config = json.loads((Path(__file__).parent/'oracle-data.json').read_text())
|
|
events = generate(config['seed'])
|
|
m = initial()
|
|
expected = []
|
|
for event in events:
|
|
expected.append(flatten(m,operation(m,event)))
|
|
stdin = ''.join(' '.join(map(str,event))+'\n' for event in events)
|
|
candidate = Path(sys.argv[1])
|
|
sources = {name:(candidate/name).read_bytes() for name in ('irq_router.hpp','irq_router.cpp')}
|
|
scratch = Path(tempfile.mkdtemp(prefix='dev-shared-irq-dispatch-'))
|
|
for name,data in sources.items():
|
|
(scratch/name).write_bytes(data)
|
|
(scratch/'observe.cpp').write_text(config['observer'])
|
|
# The first untrusted process starts below. No later scratch reads/writes,
|
|
# chmod/chown, iteration or cleanup occurs in this trusted check process.
|
|
built = subprocess.run(['g++','-std=c++17','-O2','-Wall','-Wextra','-I.',
|
|
'irq_router.cpp','observe.cpp','-o','observe'],cwd=scratch,
|
|
capture_output=True,text=True,timeout=30)
|
|
if built.returncode:
|
|
print('build failed: '+built.stderr[-1600:])
|
|
return 1
|
|
result = subprocess.run([str(scratch/'observe')],cwd=scratch,input=stdin,
|
|
capture_output=True,text=True,timeout=25)
|
|
if result.returncode:
|
|
print('candidate exit %d: %s' % (result.returncode,result.stderr[-500:]))
|
|
return 1
|
|
if result.stderr:
|
|
print('unexpected candidate stderr')
|
|
return 1
|
|
rows = result.stdout.splitlines()
|
|
if len(rows) != len(expected):
|
|
print('row count %d expected %d' % (len(rows),len(expected)))
|
|
return 1
|
|
for number,(row,want) in enumerate(zip(rows,expected),1):
|
|
tokens = row.split()
|
|
if len(tokens) != len(want) or any(re.fullmatch(r'-?[0-9]+',t) is None for t in tokens):
|
|
print('malformed observation at command %d' % number)
|
|
return 1
|
|
got = [int(token) for token in tokens]
|
|
if got != want:
|
|
field = next(i for i,(x,y) in enumerate(zip(got,want)) if x != y)
|
|
print('command %d %s field %d got %d expected %d' % (number,events[number-1][0],field,got[field],want[field]))
|
|
return 1
|
|
print('PASS')
|
|
return 0
|
|
|
|
if __name__ == '__main__':
|
|
raise SystemExit(main())
|