mirror of
https://github.com/jmcorgan/fips.git
synced 2026-10-05 19:18:25 +00:00
A client process opens a flow to a peer's public key on a chosen port and sends and receives datagrams on a file descriptor the daemon hands it. No IPv6 emulation, no TUN device, no DNS: a datagram travels from key to key. The feature is off by default and is not a stable interface. The wire needs no change and gets none. Every FSP data packet has carried a port pair inside its AEAD envelope since v0.2.0, and port 256 is simply the IPv6 shim. What was missing was a way for a program to ask for a port of its own and be handed the traffic. Addressing is the part worth reading twice, because the obvious design is wrong. The x-only public key is the address. An npub is that key written in bech32, so converting between them is a local encoding rather than a lookup or a name service. The 16-byte node address that travels on the wire is the first half of a SHA-256 of the key: it is a truncated hash, it does not invert, and it appears nowhere a client can see. An earlier iteration of this work reported a peer by that hash and could supply a key only sometimes, which is what treating a wire identifier as an identity produces. An accepted flow therefore always knows its peer. The key is captured where the peer is authenticated rather than looked up when a report is rendered: every inbound datagram passes one call site inside a handler that refuses anything whose session is not established, and the responder has already rejected the session unless the claimed address derives from the key it proved. Reaching for the identity cache instead gives a best-effort answer from a structure that evicts. A listener is a descriptor. The daemon writes one message per arrival to it, carrying the new flow's descriptor and the peer's address, so poll, select and epoll work on a listener and accepting is a recvmsg. That is what lets the API be used from a program that already has an event loop, which a command-and-reply listener could not support: an arrival could not be waited on beside anything else. There is no accept command and no reject command. Refusing a flow is closing the descriptor you were handed. The Rust surface mirrors std::net. FipsStream::connect, FipsListener::bind, incoming, accept, io::Result and an errno mapping rather than a bespoke error type. An address is given as an npub, as a key, or as a pair, through one parameter, the way ToSocketAddrs takes several spellings of one thing. Each type holds its descriptor and copies of what setup told it and nothing else, so a stream that outlives its setup connection is not representable. set_nonblocking, AsFd and the four deadline methods carry the names and signatures std::net uses for the same jobs. They were asked for by a user integrating the API with tokio: AsyncFd requires a non-blocking descriptor, and anything receiving from a peer needs a bounded wait. AsFd is the better of the two descriptor accessors, because the borrow cannot outlive the value that owns the descriptor, so a reactor cannot hold a registration for a descriptor that has since been closed and its number reused by the next open. The non-blocking flag is read, modified and written back rather than assigned, since the flag word carries more than that one bit and a caller may have set O_ASYNC. A zero timeout is refused with EINVAL, because the kernel reads a zero timeval as "wait for ever", which inverts what a caller passing zero means; std::net refuses it for the same reason. The two directions are separate options and stay that way. FipsListener gets no timeout methods, matching TcpListener: bounding an accept is set_nonblocking plus the caller's own poll, which the reactor how-to builds. A flow taken from accept is blocking whatever the listener was set to, because the two are separate sockets and the daemon hands over a fresh one. One rule has no counterpart in Berkeley sockets and a client author must know it: the v1 wire carries no half-close, so nothing peer-driven ever closes a flow. A server written to read until the flow ends waits for a signal that cannot arrive, holding a thread and a flow per peer until its process exits. A program decides its own termination, and the example serves one datagram per flow. The tests reach a live daemon rather than a stand-in. Every public item had a unit test against a hand-written stand-in with canned replies, and the five entry points a program actually calls first, connect, connect_from, connect_at, bind and the SOCKET constant, had no coverage of any kind, because the tests that appear to cover them build a Wire over a socket pair and hand it to the private open and hold, so nothing ever resolved a socket path or mapped its errors. examples/native-surface.rs walks all thirty-eight items against a running daemon and reports the number of assertions it made. The count is read from the recorder rather than written as a literal, and the harness asserts the exit status, the completion marker and the count together, so deleting an assertion fails the check rather than quietly shrinking it. Watchdogs turn a hang into a named failure, which several of the walked behaviours would otherwise produce. The shared Docker image is built once for every integration leg, so the new binary is staged at all ten places the existing one is, the interop builder included, which gets a stub because those images exercise the wire between daemon versions and older refs do not carry the example. The platform gating was tested rather than reasoned about: flipping all eleven gates so the native API is excluded leaves the crate compiling clean across the workspace, every target and the profiling feature. The shipped docs tree gains what only the LaTeX manual under design/ had, which is not published with the daemon. A reference entry covers the whole surface: addressing and the port tiers, the Berkeley mapping, every method on FipsAddr, FipsStream, FipsListener and Incoming, the errno table, the ceilings, the four places data disappears with nothing reported, the line protocol and the command reference. The errno table gives names rather than numbers, since the client maps each name onto the libc constant for the platform it was built for and the supported platforms disagree on the numbers. A tutorial side trip stands up two throwaway nodes on one machine, peered over loopback UDP with no TUN and no DNS, then writes a listening program and a connecting program against them; it needs neither the public mesh nor root, because the native path is the one that does not go through the IPv6 adapter. The obligations a client in another language carries are a how-to of their own, since they are a task rather than a description: reading the setup connection with recvmsg, associating a descriptor with the last complete line, telling an empty datagram from a close, and six others. Serving many peers from one poll loop is another, with the whole program, because the straightforward listener spawns a thread per flow and that is wrong at the node's ceiling of 256. The drop causes are a table mapping each of the seven texts DropReason::as_str produces to the counter it increments, with drop_oversize called out as the ninth counter that is not in the table. What a daemon restart costs is a section of its own: every flow and listener ends, descriptors do not survive, there is no resumption, and datagrams sent but not yet forwarded are lost through a window nothing bounds. A stack comparison diagram places the interface against the stack a reader already knows: the same application over HTTP, TLS, TCP, IP and Ethernet on one side, and over its own format, FSP, FMP and a FIPS transport on the other, aligned so each row is one concern. The two columns are not alternatives and are not drawn as such. An unmodified IPv6 program's packets reach fips0, and the adapter hands each one to FSP as a payload, so the left stack runs inside the right one; the left column ends at a fork, eth0 for the ordinary internet and fips0 for the mesh, and an arrow leaves fips0 and runs back up into FSP's input. The row where TCP would be is empty on purpose and names Reliable Object Delivery, which is where that capability is expected to land. ROD is a v2 capability, the box is dashed because none of it exists yet, and the design entry says the part a reader needs most: nothing on the surface anticipates it, so a program written today should assume it does not exist. Both endpoints carry a scheme and a worked port, https://<npub>.fips:443 and fips://<npub>:443, with a footnote saying the two ports are not the same kind of thing, a TCP port inside the tunnel on the left and an FSP port on the right. The fips:// form is a coinage: nothing in the tree parses it, nothing registers the scheme, and the API takes a key and a port as separate arguments rather than a URL. The diagram also says where the right column stops, since FIPS over UDP still rides IP and Ethernet beneath. It appears in fips-concepts.md and fips-ipv6-adapter.md, which were making its argument in prose without a picture, and deliberately not in fips-architecture.md, which already carries the OSI mapping and makes the same point about the transport row. The gateway's control socket moves onto the same bind policy this API uses, which is the one change here that touches deployed behaviour: fips-gateway now tightens /run/fips to 0750. That is unreachable under the packaged deployment, where fips.service has already created the directory at that mode, and reachable for a source build or a container that starts the gateway alone. One changelog entry under Added, describing the released state: what a client opens and reads, the addressing and why the node address is not it, the listener being a descriptor, the std::net shape of the Rust surface, and the one rule Berkeley sockets have no counterpart for. It says in as many words that the wire is unchanged.
442 lines
17 KiB
Python
Executable File
442 lines
17 KiB
Python
Executable File
#!/usr/bin/env python3
|
|
"""Native datagram API client for the increment checks.
|
|
|
|
Speaks the line-delimited JSON command protocol on the daemon's native API
|
|
socket. A run takes a script: a list of steps sent over ONE connection. The
|
|
connection owns nothing — a flow lives until its own descriptor is closed, and a
|
|
listener until its own is — so the single connection is a convenience for the
|
|
checks rather than a lifetime the daemon respects. Descriptors are what keep
|
|
things alive, and this tool holds them until the step that closes them or until
|
|
it exits.
|
|
|
|
Kinds of step:
|
|
|
|
RPC step: {"command": str, "params": {...}?, "expect": {"dotted.key": val}?,
|
|
"keep_fd": name?, "keep_listener": name?, "keep_flow": name?}
|
|
Sends a command and checks the reply. `keep_fd` stores a flow
|
|
descriptor under that name, `keep_listener` a listener descriptor;
|
|
every reply that carries one must name it, because a descriptor
|
|
nothing named is a flow or a port silently dropped. `keep_flow`
|
|
stores the reply's data.flow_id.
|
|
|
|
A parameter or expectation whose value is the string "@name" is
|
|
replaced by the flow identifier stored under `name`. Identifiers
|
|
are assigned by the node and keep counting up for its lifetime, so
|
|
a check that asserted a literal 1 would hold only for the first
|
|
flow the daemon ever made.
|
|
|
|
Accept step: {"accept": listener, "keep_fd": name, "expect": {...}?,
|
|
"keep_flow": name?}
|
|
One recvmsg on a stored listener descriptor. There is no accept
|
|
command: an arriving flow is one SOCK_SEQPACKET message on the
|
|
listener itself, carrying the flow's descriptor as ancillary data
|
|
and the arrival object as its payload. Expectations are checked
|
|
against that object, whose peer is an npub and never a hex address.
|
|
|
|
Sleep step: {"sleep": seconds}
|
|
Holds every descriptor open for a while, which is what a check that
|
|
reads the daemon's own view of a live flow needs.
|
|
|
|
Flow step: {"fd": name, ...} operating on a stored descriptor:
|
|
"write": hex, "repeat": n? send n datagrams of those bytes
|
|
"read": n, "expect_bytes": hex?, "sizes": [..]?
|
|
read n datagrams and check them
|
|
"readable": bool check poll readability now
|
|
"close": true close the descriptor
|
|
`readable` and `close` work on a listener descriptor too: a
|
|
listener is pollable, and closing it unbinds its port.
|
|
|
|
Reading is per-datagram: the descriptor is SOCK_SEQPACKET, so one recv is one
|
|
datagram. A check that reads three and gets one concatenated blob is a real
|
|
failure, not a quirk of the tool.
|
|
|
|
Usage:
|
|
client.py --socket PATH --script '<json list of steps>'
|
|
client.py --socket PATH --script-file steps.json
|
|
|
|
Exit 0 when every expectation holds, 1 otherwise, 2 on a connection failure.
|
|
"""
|
|
|
|
from __future__ import annotations
|
|
|
|
import argparse
|
|
import array
|
|
import json
|
|
import os
|
|
import select
|
|
import socket
|
|
import sys
|
|
import time
|
|
from typing import Any
|
|
|
|
# A flow's descriptor and a listener's are both AF_UNIX SOCK_SEQPACKET, so the
|
|
# wrap happens to be the same for both. Naming the roles anyway is the point:
|
|
# the next descriptor kind that is not one of these must not be wrapped
|
|
# correctly by accident.
|
|
FLOW = "flow"
|
|
LISTENER = "listener"
|
|
|
|
|
|
def recvfds(sock: socket.socket, bufsize: int, maxfds: int) -> tuple[bytes, list[int]]:
|
|
"""One recvmsg, returning its payload and whatever descriptors it carried.
|
|
|
|
Written out rather than calling `socket.recv_fds`, which takes a `flags`
|
|
argument and never forwards it to `recvmsg`: MSG_CMSG_CLOEXEC passed to that
|
|
helper does nothing, and a descriptor the harness kept would then survive
|
|
into any child process it forked. Measured on CPython 3.12 by reading
|
|
FD_CLOEXEC back with `fcntl.F_GETFD` after each of the two calls.
|
|
"""
|
|
fds = array.array("i")
|
|
data, ancillary, _flags, _addr = sock.recvmsg(
|
|
bufsize, socket.CMSG_LEN(maxfds * fds.itemsize), socket.MSG_CMSG_CLOEXEC
|
|
)
|
|
for level, kind, payload in ancillary:
|
|
if level == socket.SOL_SOCKET and kind == socket.SCM_RIGHTS:
|
|
# Truncated to whole descriptors: the kernel may cut the array
|
|
# short, and a partial one names nothing.
|
|
fds.frombytes(payload[: len(payload) - (len(payload) % fds.itemsize)])
|
|
return data, list(fds)
|
|
|
|
|
|
class Protocol(Exception):
|
|
"""The daemon broke the local protocol, so the run cannot continue."""
|
|
|
|
|
|
class Client:
|
|
"""One connection to the native API socket, plus the descriptors it holds."""
|
|
|
|
def __init__(self, path: str, timeout: float) -> None:
|
|
"""Connect to the socket at `path`, failing after `timeout` seconds."""
|
|
self.sock = socket.socket(socket.AF_UNIX, socket.SOCK_STREAM)
|
|
self.sock.settimeout(timeout)
|
|
self.sock.connect(path)
|
|
self.timeout = timeout
|
|
self.buf = b""
|
|
# Complete lines, oldest first, each with the descriptor it arrived
|
|
# with. See `fill` for the rule that decides which line that is.
|
|
self.lines: list[list[Any]] = []
|
|
self.fds: dict[str, tuple[socket.socket, str]] = {}
|
|
self.flows: dict[str, int] = {}
|
|
|
|
def call(self, command: str, params: dict | None) -> tuple[dict, int | None]:
|
|
"""Send one command; return the decoded reply and any descriptor.
|
|
|
|
The socket carries replies only, in command order, so the next complete
|
|
line is this command's answer and there is nothing to separate out.
|
|
"""
|
|
request: dict[str, Any] = {"command": command}
|
|
if params is not None:
|
|
request["params"] = params
|
|
self.sock.sendall(json.dumps(request).encode() + b"\n")
|
|
line, fd = self.line()
|
|
return json.loads(line), fd
|
|
|
|
def line(self) -> tuple[bytes, int | None]:
|
|
"""Take the next complete line, reading until one is available."""
|
|
while not self.lines:
|
|
self.fill()
|
|
line, fd = self.lines.pop(0)
|
|
return line, fd
|
|
|
|
def fill(self) -> None:
|
|
"""One recvmsg, split into lines, with any descriptor placed by the rule.
|
|
|
|
A DESCRIPTOR BELONGS TO THE LAST COMPLETE LINE OF THE READ THAT CARRIED
|
|
IT, never to the next line the reader assembles. A recvmsg returning
|
|
ancillary data ends exactly at the end of the sendmsg that carried it,
|
|
but it may begin with any amount of data written before it, so a reader
|
|
that attached the descriptor to the first line it completed would hand a
|
|
flow to the wrong reply. Both reply kinds carry a descriptor now, so
|
|
this is reachable rather than theoretical.
|
|
|
|
A read that carries a descriptor and completes no line is reported
|
|
rather than guessed at: holding it would mean choosing a later line for
|
|
it, and choosing wrong loses a flow with no error anywhere.
|
|
"""
|
|
chunk, fds = recvfds(self.sock, 65536, 4)
|
|
if not chunk:
|
|
for stray in fds:
|
|
# Closed rather than leaked: nothing can name it now.
|
|
os.close(stray)
|
|
raise ConnectionError("daemon closed the connection")
|
|
self.buf += chunk
|
|
|
|
produced = 0
|
|
while b"\n" in self.buf:
|
|
line, self.buf = self.buf.split(b"\n", 1)
|
|
self.lines.append([line, None])
|
|
produced += 1
|
|
|
|
if not fds:
|
|
return
|
|
# This protocol never sends two at once. Extras are closed rather than
|
|
# left open with no owner.
|
|
for stray in fds[1:]:
|
|
os.close(stray)
|
|
if produced == 0:
|
|
os.close(fds[0])
|
|
raise Protocol("a descriptor arrived on a read that completed no line")
|
|
self.lines[-1][1] = fds[0]
|
|
|
|
def accept(self, listener: str) -> tuple[dict, int]:
|
|
"""Take the next arriving flow off a stored listener descriptor.
|
|
|
|
One recvmsg, one arrival: SOCK_SEQPACKET means the message carries
|
|
exactly its own descriptor, so the association rule the RPC socket needs
|
|
does not arise here. The payload has no trailing newline, because the
|
|
message boundary is the framing.
|
|
"""
|
|
sock = self.held(listener, LISTENER)
|
|
data, fds = recvfds(sock, 65536, 1)
|
|
if not fds:
|
|
raise Protocol(f"{listener!r} produced an arrival with no descriptor")
|
|
if not data:
|
|
os.close(fds[0])
|
|
raise Protocol(f"{listener!r} produced a descriptor with no arrival")
|
|
return json.loads(data), fds[0]
|
|
|
|
def held(self, name: str, want: str) -> socket.socket:
|
|
"""Return a stored descriptor, refusing one of the wrong kind."""
|
|
if name not in self.fds:
|
|
raise Protocol(f"no descriptor named {name!r}")
|
|
sock, role = self.fds[name]
|
|
if role != want:
|
|
raise Protocol(f"{name!r} is a {role} descriptor, not a {want} one")
|
|
return sock
|
|
|
|
def keep(self, name: str, fd: int, role: str) -> None:
|
|
"""Store a received descriptor under `name`, wrapped for its kind."""
|
|
sock = socket.socket(socket.AF_UNIX, socket.SOCK_SEQPACKET, fileno=fd)
|
|
sock.settimeout(self.timeout)
|
|
self.fds[name] = (sock, role)
|
|
|
|
def close(self) -> None:
|
|
"""Close every descriptor, then the connection itself."""
|
|
for sock, _role in self.fds.values():
|
|
sock.close()
|
|
self.sock.close()
|
|
|
|
|
|
def substitute(value: Any, flows: dict[str, int]) -> Any:
|
|
"""Replace every "@name" with the flow identifier stored under `name`."""
|
|
if isinstance(value, str) and value.startswith("@"):
|
|
name = value[1:]
|
|
if name not in flows:
|
|
raise KeyError(f"no flow captured as {name!r}")
|
|
return flows[name]
|
|
if isinstance(value, dict):
|
|
return {key: substitute(item, flows) for key, item in value.items()}
|
|
if isinstance(value, list):
|
|
return [substitute(item, flows) for item in value]
|
|
return value
|
|
|
|
|
|
def dig(value: Any, dotted: str) -> Any:
|
|
"""Read a dotted path out of a decoded reply, or None where it is absent."""
|
|
for key in dotted.split("."):
|
|
if not isinstance(value, dict) or key not in value:
|
|
return None
|
|
value = value[key]
|
|
return value
|
|
|
|
|
|
def check(reply: dict, expect: dict) -> list[str]:
|
|
"""Return one message per expectation the reply does not satisfy."""
|
|
problems = []
|
|
for dotted, wanted in expect.items():
|
|
got = dig(reply, dotted)
|
|
if got != wanted:
|
|
problems.append(f"{dotted}: wanted {wanted!r}, got {got!r}")
|
|
return problems
|
|
|
|
|
|
def store(client: Client, step: dict, body: dict, fd: int | None) -> list[str]:
|
|
"""Store what a step asked to keep, reporting a descriptor nobody named."""
|
|
problems: list[str] = []
|
|
|
|
keep = step.get("keep_flow")
|
|
if keep is not None:
|
|
# A reply nests the identifier under `data`; an arrival message is the
|
|
# object itself. One reader for both, because a step should not have to
|
|
# know which produced it.
|
|
flow = dig(body, "data.flow_id")
|
|
if flow is None:
|
|
flow = body.get("flow_id")
|
|
if flow is None:
|
|
problems.append("keep_flow: nothing carried a flow_id")
|
|
else:
|
|
client.flows[keep] = flow
|
|
|
|
wanted = [(step.get("keep_fd"), FLOW), (step.get("keep_listener"), LISTENER)]
|
|
named = [(name, role) for name, role in wanted if name is not None]
|
|
if len(named) > 1:
|
|
if fd is not None:
|
|
os.close(fd)
|
|
problems.append("a step named both keep_fd and keep_listener")
|
|
elif named and fd is None:
|
|
problems.append(f"{named[0][0]!r}: no descriptor arrived to keep")
|
|
elif named:
|
|
client.keep(named[0][0], fd, named[0][1])
|
|
elif fd is not None:
|
|
# Leaving it unnamed would leak a flow or a held port for the rest of
|
|
# the run, with nothing to say so.
|
|
os.close(fd)
|
|
problems.append("a descriptor arrived that the step did not name")
|
|
|
|
return problems
|
|
|
|
|
|
def run_rpc(client: Client, step: dict) -> list[str]:
|
|
"""Send one command and report what did not hold."""
|
|
command = step["command"]
|
|
try:
|
|
params = substitute(step.get("params"), client.flows)
|
|
expect = substitute(step.get("expect", {}), client.flows)
|
|
except KeyError as error:
|
|
return [str(error)]
|
|
|
|
reply, fd = client.call(command, params)
|
|
problems = check(reply, expect)
|
|
problems += store(client, step, reply, fd)
|
|
|
|
if problems:
|
|
problems.append(f"reply: {json.dumps(reply)}")
|
|
return problems
|
|
|
|
|
|
def run_accept(client: Client, step: dict) -> list[str]:
|
|
"""Take one arrival off a listener and report what did not hold."""
|
|
try:
|
|
arrival, fd = client.accept(step["accept"])
|
|
except socket.timeout:
|
|
return [f"timed out waiting for an arrival on {step['accept']!r}"]
|
|
|
|
problems = check(arrival, substitute(step.get("expect", {}), client.flows))
|
|
problems += store(client, step, arrival, fd)
|
|
|
|
if problems:
|
|
problems.append(f"arrival: {json.dumps(arrival)}")
|
|
return problems
|
|
|
|
|
|
def run_sleep(step: dict) -> list[str]:
|
|
"""Hold every descriptor open for a while, failing nothing."""
|
|
time.sleep(float(step["sleep"]))
|
|
return []
|
|
|
|
|
|
def run_flow(client: Client, step: dict) -> list[str]:
|
|
"""Operate on a stored descriptor and report what did not hold."""
|
|
name = step["fd"]
|
|
if name not in client.fds:
|
|
return [f"no descriptor named {name!r}"]
|
|
flow, _role = client.fds[name]
|
|
|
|
problems: list[str] = []
|
|
|
|
if "readable" in step:
|
|
ready, _, _ = select.select([flow], [], [], 0.25)
|
|
got = bool(ready)
|
|
if got != step["readable"]:
|
|
problems.append(f"readable: wanted {step['readable']}, got {got}")
|
|
|
|
if "write" in step:
|
|
payload = bytes.fromhex(step["write"])
|
|
for _ in range(step.get("repeat", 1)):
|
|
flow.send(payload)
|
|
|
|
if "read" in step:
|
|
wanted = bytes.fromhex(step["expect_bytes"]) if "expect_bytes" in step else None
|
|
sizes = []
|
|
for index in range(step["read"]):
|
|
try:
|
|
got = flow.recv(65536)
|
|
except socket.timeout:
|
|
problems.append(f"read {index}: timed out waiting for a datagram")
|
|
break
|
|
sizes.append(len(got))
|
|
if wanted is not None and got != wanted:
|
|
problems.append(
|
|
f"read {index}: wanted {wanted.hex()}, got {got.hex()}"
|
|
)
|
|
if "sizes" in step and sizes != step["sizes"]:
|
|
problems.append(f"sizes: wanted {step['sizes']}, got {sizes}")
|
|
|
|
if step.get("close"):
|
|
flow.close()
|
|
del client.fds[name]
|
|
|
|
return problems
|
|
|
|
|
|
def label_of(step: dict) -> str:
|
|
"""The name a step is reported under, which callers wait on by substring."""
|
|
if "fd" in step:
|
|
return f"fd {step['fd']}"
|
|
if "accept" in step:
|
|
return f"accept {step['accept']}"
|
|
if "sleep" in step:
|
|
return f"sleep {step['sleep']}"
|
|
return step.get("command", "?")
|
|
|
|
|
|
def main() -> int:
|
|
"""Run the script against the socket and report every failing step."""
|
|
parser = argparse.ArgumentParser(description=__doc__)
|
|
parser.add_argument("--socket", required=True, help="native API socket path")
|
|
group = parser.add_mutually_exclusive_group(required=True)
|
|
group.add_argument("--script", help="steps as a JSON list")
|
|
group.add_argument("--script-file", help="file holding the steps as a JSON list")
|
|
parser.add_argument(
|
|
"--timeout",
|
|
type=float,
|
|
default=5.0,
|
|
help="socket timeout in seconds (default: 5)",
|
|
)
|
|
args = parser.parse_args()
|
|
|
|
text = args.script
|
|
if text is None:
|
|
with open(args.script_file, encoding="utf-8") as handle:
|
|
text = handle.read()
|
|
steps = json.loads(text)
|
|
|
|
try:
|
|
client = Client(args.socket, args.timeout)
|
|
except OSError as error:
|
|
print(f"connect to {args.socket} failed: {error}", file=sys.stderr)
|
|
return 2
|
|
|
|
failures = 0
|
|
try:
|
|
for index, step in enumerate(steps):
|
|
label = label_of(step)
|
|
try:
|
|
if "fd" in step:
|
|
problems = run_flow(client, step)
|
|
elif "accept" in step:
|
|
problems = run_accept(client, step)
|
|
elif "sleep" in step:
|
|
problems = run_sleep(step)
|
|
else:
|
|
problems = run_rpc(client, step)
|
|
except (OSError, ConnectionError, Protocol, json.JSONDecodeError) as error:
|
|
print(f"step {index} ({label}): {error}", file=sys.stderr)
|
|
return 2
|
|
|
|
if problems:
|
|
failures += 1
|
|
print(f"step {index} ({label}) FAILED", file=sys.stderr)
|
|
for problem in problems:
|
|
print(f" {problem}", file=sys.stderr)
|
|
else:
|
|
print(f"step {index} ({label}) ok")
|
|
finally:
|
|
client.close()
|
|
|
|
return 1 if failures else 0
|
|
|
|
|
|
if __name__ == "__main__":
|
|
sys.exit(main())
|