mirror of
https://github.com/priyanshujain/sanderling.git
synced 2026-10-04 20:17:09 +00:00
docs(runner): say what makes the two reads comparable
the reread's comment claimed the round trip was the only interval between them; what it left out is that the two rpcs have to read the same way, which the repo's own android backend did not do.
This commit is contained in:
1 parent
1afe9c3a7d
commit
127234b58c
2 files changed
+11
-2
No files matched your search
@@ -74,8 +74,10 @@ func (d *leavesForegroundAfterSubmitDriver) Snapshot(context.Context) (string, d
|
|||||||
return fmt.Sprintf(homeWithTxnCount, d.committed.Load()), driver.Image{}, nil
|
return fmt.Sprintf(homeWithTxnCount, d.committed.Load()), driver.Image{}, nil
|
||||||
}
|
}
|
||||||
|
|
||||||
// No device answers Snapshot and Hierarchy off different trees, and the runner
|
// The runner reads both per step and compares them, so a device that answered
|
||||||
// reads both per step, so this one answers them off the same commit count.
|
// them off different trees would make every step of this test transitional and
|
||||||
|
// judged by nothing. The sidecar serves both off one read path (snapshotTree)
|
||||||
|
// for the same reason; this one answers them off the same commit count.
|
||||||
func (d *leavesForegroundAfterSubmitDriver) Hierarchy(context.Context) (string, error) {
|
func (d *leavesForegroundAfterSubmitDriver) Hierarchy(context.Context) (string, error) {
|
||||||
return fmt.Sprintf(homeWithTxnCount, d.committed.Load()), nil
|
return fmt.Sprintf(homeWithTxnCount, d.committed.Load()), nil
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -1079,6 +1079,13 @@ retryLoop:
|
|||||||
// filling in. Two reads a read apart are the cheapest thing that can see it
|
// filling in. Two reads a read apart are the cheapest thing that can see it
|
||||||
// happening: the round trip IS the interval, so there is no sleep here.
|
// happening: the round trip IS the interval, so there is no sleep here.
|
||||||
//
|
//
|
||||||
|
// The comparison only means anything because the Hierarchy RPC serves the tree
|
||||||
|
// the snapshot's own read produces (see snapshotTree in the sidecar). Off the
|
||||||
|
// bare device read it does not: with an IME standing open, the snapshot answers
|
||||||
|
// with 134 nodes and the bare read with 489, and the pair then differs over
|
||||||
|
// whether the sidecar closed a keyboard between them rather than over anything
|
||||||
|
// the app did.
|
||||||
|
//
|
||||||
// Waiting for the change to stop was measured on an API 34 device and refused:
|
// Waiting for the change to stop was measured on an API 34 device and refused:
|
||||||
// a 750ms-quiet poll capped at 2s cost a median 1434ms against 76ms for one
|
// a 750ms-quiet poll capped at 2s cost a median 1434ms against 76ms for one
|
||||||
// read, hit its cap on every frame it fired for, and still handed back a frame
|
// read, hit its cap on every frame it fired for, and still handed back a frame
|
||||||
|
|||||||
Reference in new issue
Block a user