mirror of
https://github.com/flutter/flutter.git
synced 2026-02-20 02:29:02 +08:00
464 lines
17 KiB
Dart
464 lines
17 KiB
Dart
// Copyright 2015 The Chromium Authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
// found in the LICENSE file.
|
|
|
|
import 'dart:math' as math;
|
|
import 'dart:ui' show Rect;
|
|
|
|
import 'package:flutter/painting.dart';
|
|
import 'package:sky_services/semantics/semantics.mojom.dart' as mojom;
|
|
import 'package:vector_math/vector_math_64.dart';
|
|
|
|
import 'basic_types.dart';
|
|
import 'node.dart';
|
|
|
|
/// The type of function returned by [RenderObject.getSemanticAnnotators()].
|
|
///
|
|
/// These callbacks are invoked with the [SemanticsNode] object that
|
|
/// corresponds to the [RenderObject]. (One [SemanticsNode] can
|
|
/// correspond to multiple [RenderObject] objects.)
|
|
///
|
|
/// See [RenderObject.getSemanticAnnotators()] for details on the
|
|
/// contract that semantic annotators must follow.
|
|
typedef void SemanticAnnotator(SemanticsNode semantics);
|
|
|
|
/// Interface for RenderObjects to implement when they want to support
|
|
/// being tapped, etc.
|
|
///
|
|
/// These handlers will only be called if the relevant flag is set
|
|
/// (e.g. handleSemanticTap() will only be called if canBeTapped is
|
|
/// true, handleSemanticScrollDown() will only be called if
|
|
/// canBeScrolledVertically is true, etc).
|
|
abstract class SemanticActionHandler {
|
|
void handleSemanticTap() { }
|
|
void handleSemanticLongPress() { }
|
|
void handleSemanticScrollLeft() { }
|
|
void handleSemanticScrollRight() { }
|
|
void handleSemanticScrollUp() { }
|
|
void handleSemanticScrollDown() { }
|
|
}
|
|
|
|
enum _SemanticFlags {
|
|
mergeAllDescendantsIntoThisNode,
|
|
canBeTapped,
|
|
canBeLongPressed,
|
|
canBeScrolledHorizontally,
|
|
canBeScrolledVertically,
|
|
hasCheckedState,
|
|
isChecked,
|
|
}
|
|
|
|
typedef bool SemanticsNodeVisitor(SemanticsNode node);
|
|
|
|
class SemanticsNode extends AbstractNode {
|
|
SemanticsNode({
|
|
SemanticActionHandler handler
|
|
}) : _id = _generateNewId(),
|
|
_actionHandler = handler;
|
|
|
|
SemanticsNode.root({
|
|
SemanticActionHandler handler
|
|
}) : _id = 0,
|
|
_actionHandler = handler {
|
|
attach();
|
|
}
|
|
|
|
static int _lastIdentifier = 0;
|
|
static int _generateNewId() {
|
|
_lastIdentifier += 1;
|
|
return _lastIdentifier;
|
|
}
|
|
|
|
final int _id;
|
|
final SemanticActionHandler _actionHandler;
|
|
|
|
|
|
// GEOMETRY
|
|
// These are automatically handled by RenderObject's own logic
|
|
|
|
Matrix4 get transform => _transform;
|
|
Matrix4 _transform; // defaults to null, which we say means the identity matrix
|
|
void set transform (Matrix4 value) {
|
|
if (!MatrixUtils.matrixEquals(_transform, value)) {
|
|
_transform = value;
|
|
_markDirty();
|
|
}
|
|
}
|
|
|
|
Rect get rect => _rect;
|
|
Rect _rect = Rect.zero;
|
|
void set rect (Rect value) {
|
|
assert(value != null);
|
|
if (_rect != value) {
|
|
_rect = value;
|
|
_markDirty();
|
|
}
|
|
}
|
|
|
|
bool wasAffectedByClip = false;
|
|
|
|
|
|
// FLAGS AND LABELS
|
|
// These are supposed to be set by SemanticAnnotator obtained from getSemanticAnnotators
|
|
|
|
BitField<_SemanticFlags> _flags = new BitField<_SemanticFlags>.filled(_SemanticFlags.values.length, false);
|
|
|
|
void _setFlag(_SemanticFlags flag, bool value, { bool needsHandler: false }) {
|
|
assert(value != null);
|
|
assert((!needsHandler) || (_actionHandler != null) || (value == false));
|
|
if (_flags[flag] != value) {
|
|
_flags[flag] = value;
|
|
_markDirty();
|
|
}
|
|
}
|
|
|
|
bool _canHandle(_SemanticFlags flag) {
|
|
return _actionHandler != null && _flags[flag];
|
|
}
|
|
|
|
bool get mergeAllDescendantsIntoThisNode => _flags[_SemanticFlags.mergeAllDescendantsIntoThisNode];
|
|
void set mergeAllDescendantsIntoThisNode(bool value) => _setFlag(_SemanticFlags.mergeAllDescendantsIntoThisNode, value);
|
|
|
|
bool get canBeTapped => _flags[_SemanticFlags.canBeTapped];
|
|
void set canBeTapped(bool value) => _setFlag(_SemanticFlags.canBeTapped, value, needsHandler: true);
|
|
|
|
bool get canBeLongPressed => _flags[_SemanticFlags.canBeLongPressed];
|
|
void set canBeLongPressed(bool value) => _setFlag(_SemanticFlags.canBeLongPressed, value, needsHandler: true);
|
|
|
|
bool get canBeScrolledHorizontally => _flags[_SemanticFlags.canBeScrolledHorizontally];
|
|
void set canBeScrolledHorizontally(bool value) => _setFlag(_SemanticFlags.canBeScrolledHorizontally, value, needsHandler: true);
|
|
|
|
bool get canBeScrolledVertically => _flags[_SemanticFlags.canBeScrolledVertically];
|
|
void set canBeScrolledVertically(bool value) => _setFlag(_SemanticFlags.canBeScrolledVertically, value, needsHandler: true);
|
|
|
|
bool get hasCheckedState => _flags[_SemanticFlags.hasCheckedState];
|
|
void set hasCheckedState(bool value) => _setFlag(_SemanticFlags.hasCheckedState, value);
|
|
|
|
bool get isChecked => _flags[_SemanticFlags.isChecked];
|
|
void set isChecked(bool value) => _setFlag(_SemanticFlags.isChecked, value);
|
|
|
|
String get label => _label;
|
|
String _label = '';
|
|
void set label(String value) {
|
|
assert(value != null);
|
|
if (_label != value) {
|
|
_label = value;
|
|
_markDirty();
|
|
}
|
|
}
|
|
|
|
void reset() {
|
|
_flags.reset();
|
|
_label = '';
|
|
_markDirty();
|
|
}
|
|
|
|
List<SemanticsNode> _newChildren;
|
|
void addChildren(Iterable<SemanticsNode> children) {
|
|
_newChildren ??= <SemanticsNode>[];
|
|
_newChildren.addAll(children);
|
|
// we do the asserts afterwards because children is an Iterable
|
|
// and doing the asserts before would mean the behaviour is
|
|
// different in checked mode vs release mode (if you walk an
|
|
// iterator after having reached the end, it'll just start over;
|
|
// the values are not cached).
|
|
assert(!_newChildren.any((SemanticsNode child) => child == this));
|
|
assert(() {
|
|
SemanticsNode ancestor = this;
|
|
while (ancestor.parent is SemanticsNode)
|
|
ancestor = ancestor.parent;
|
|
assert(!_newChildren.any((SemanticsNode child) => child == ancestor));
|
|
return true;
|
|
});
|
|
assert(() {
|
|
Set<SemanticsNode> seenChildren = new Set<SemanticsNode>();
|
|
for (SemanticsNode child in _newChildren)
|
|
assert(seenChildren.add(child)); // check for duplicate adds
|
|
return true;
|
|
});
|
|
}
|
|
|
|
List<SemanticsNode> _children;
|
|
bool get hasChildren => _children?.isNotEmpty ?? false;
|
|
bool _dead = false;
|
|
void finalizeChildren() {
|
|
if (_children != null) {
|
|
for (SemanticsNode child in _children)
|
|
child._dead = true;
|
|
}
|
|
if (_newChildren != null) {
|
|
for (SemanticsNode child in _newChildren)
|
|
child._dead = false;
|
|
}
|
|
bool sawChange = false;
|
|
if (_children != null) {
|
|
for (SemanticsNode child in _children) {
|
|
if (child._dead) {
|
|
if (child.parent == this) {
|
|
// we might have already had our child stolen from us by
|
|
// another node that is deeper in the tree.
|
|
dropChild(child);
|
|
}
|
|
sawChange = true;
|
|
}
|
|
}
|
|
}
|
|
if (_newChildren != null) {
|
|
for (SemanticsNode child in _newChildren) {
|
|
if (child.parent != this) {
|
|
if (child.parent != null) {
|
|
// we're rebuilding the tree from the bottom up, so it's possible
|
|
// that our child was, in the last pass, a child of one of our
|
|
// ancestors. In that case, we drop the child eagerly here.
|
|
// TODO(ianh): Find a way to assert that the same node didn't
|
|
// actually appear in the tree in two places.
|
|
child.parent?.dropChild(child);
|
|
}
|
|
assert(!child.attached);
|
|
adoptChild(child);
|
|
sawChange = true;
|
|
}
|
|
}
|
|
}
|
|
List<SemanticsNode> oldChildren = _children;
|
|
_children = _newChildren;
|
|
oldChildren?.clear();
|
|
_newChildren = oldChildren;
|
|
if (sawChange)
|
|
_markDirty();
|
|
}
|
|
|
|
SemanticsNode get parent => super.parent;
|
|
void redepthChildren() {
|
|
if (_children != null) {
|
|
for (SemanticsNode child in _children)
|
|
redepthChild(child);
|
|
}
|
|
}
|
|
|
|
// Visits all the descendants of this node, calling visitor for each one, until
|
|
// visitor returns false. Returns true if all the visitor calls returned true,
|
|
// otherwise returns false.
|
|
bool _visitDescendants(SemanticsNodeVisitor visitor) {
|
|
if (_children != null) {
|
|
for (SemanticsNode child in _children) {
|
|
if (!visitor(child) || !child._visitDescendants(visitor))
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
static Map<int, SemanticsNode> _nodes = <int, SemanticsNode>{};
|
|
static Set<SemanticsNode> _detachedNodes = new Set<SemanticsNode>();
|
|
|
|
void attach() {
|
|
super.attach();
|
|
assert(!_nodes.containsKey(_id));
|
|
_nodes[_id] = this;
|
|
_detachedNodes.remove(this);
|
|
if (_children != null) {
|
|
for (SemanticsNode child in _children)
|
|
child.attach();
|
|
}
|
|
}
|
|
void detach() {
|
|
super.detach();
|
|
assert(_nodes.containsKey(_id));
|
|
assert(!_detachedNodes.contains(this));
|
|
_nodes.remove(_id);
|
|
_detachedNodes.add(this);
|
|
if (_children != null) {
|
|
for (SemanticsNode child in _children)
|
|
child.detach();
|
|
}
|
|
}
|
|
|
|
static List<SemanticsNode> _dirtyNodes = <SemanticsNode>[];
|
|
bool _dirty = false;
|
|
void _markDirty() {
|
|
if (_dirty)
|
|
return;
|
|
_dirty = true;
|
|
assert(!_dirtyNodes.contains(this));
|
|
assert(!_detachedNodes.contains(this));
|
|
_dirtyNodes.add(this);
|
|
}
|
|
|
|
mojom.SemanticsNode _serialize() {
|
|
mojom.SemanticsNode result = new mojom.SemanticsNode();
|
|
result.id = _id;
|
|
if (_dirty) {
|
|
// We could be even more efficient about not sending data here, by only
|
|
// sending the bits that are dirty (tracking the geometry, flags, strings,
|
|
// and children separately). For now, we send all or nothing.
|
|
result.geometry = new mojom.SemanticGeometry();
|
|
result.geometry.transform = transform?.storage;
|
|
result.geometry.top = rect.top;
|
|
result.geometry.left = rect.left;
|
|
result.geometry.width = math.max(rect.width, 0.0);
|
|
result.geometry.height = math.max(rect.height, 0.0);
|
|
result.flags = new mojom.SemanticFlags();
|
|
result.flags.canBeTapped = canBeTapped;
|
|
result.flags.canBeLongPressed = canBeLongPressed;
|
|
result.flags.canBeScrolledHorizontally = canBeScrolledHorizontally;
|
|
result.flags.canBeScrolledVertically = canBeScrolledVertically;
|
|
result.flags.hasCheckedState = hasCheckedState;
|
|
result.flags.isChecked = isChecked;
|
|
result.strings = new mojom.SemanticStrings();
|
|
result.strings.label = label;
|
|
List<mojom.SemanticsNode> children = <mojom.SemanticsNode>[];
|
|
if (mergeAllDescendantsIntoThisNode) {
|
|
_visitDescendants((SemanticsNode node) {
|
|
result.flags.canBeTapped = result.flags.canBeTapped || node.canBeTapped;
|
|
result.flags.canBeLongPressed = result.flags.canBeLongPressed || node.canBeLongPressed;
|
|
result.flags.canBeScrolledHorizontally = result.flags.canBeScrolledHorizontally || node.canBeScrolledHorizontally;
|
|
result.flags.canBeScrolledVertically = result.flags.canBeScrolledVertically || node.canBeScrolledVertically;
|
|
result.flags.hasCheckedState = result.flags.hasCheckedState || node.hasCheckedState;
|
|
result.flags.isChecked = result.flags.isChecked || node.isChecked;
|
|
if (node.label != '')
|
|
result.strings.label = result.strings.label.isNotEmpty ? '${result.strings.label}\n${node.label}' : node.label;
|
|
return true; // continue walk
|
|
});
|
|
// and we pretend to have no children
|
|
} else {
|
|
if (_children != null) {
|
|
for (SemanticsNode child in _children)
|
|
children.add(child._serialize());
|
|
}
|
|
}
|
|
result.children = children;
|
|
_dirty = false;
|
|
}
|
|
return result;
|
|
}
|
|
|
|
static List<mojom.SemanticsListener> _listeners;
|
|
static bool get hasListeners => _listeners != null && _listeners.length > 0;
|
|
static VoidCallback onSemanticsEnabled; // set by the binding
|
|
static void addListener(mojom.SemanticsListener listener) {
|
|
if (!hasListeners)
|
|
onSemanticsEnabled();
|
|
_listeners ??= <mojom.SemanticsListener>[];
|
|
_listeners.add(listener);
|
|
}
|
|
|
|
static void sendSemanticsTree() {
|
|
assert(hasListeners);
|
|
for (SemanticsNode oldNode in _detachedNodes) {
|
|
// The other side will have forgotten this node if we even send
|
|
// it again, so make sure to mark it dirty so that it'll get
|
|
// sent if it is resurrected.
|
|
oldNode._dirty = true;
|
|
}
|
|
_detachedNodes.clear();
|
|
if (_dirtyNodes.isEmpty)
|
|
return;
|
|
_dirtyNodes.sort((SemanticsNode a, SemanticsNode b) => a.depth - b.depth);
|
|
for (int index = 0; index < _dirtyNodes.length; index += 1) {
|
|
// we mutate the list as we walk it here, which is why we use an index instead of an iterator
|
|
SemanticsNode node = _dirtyNodes[index];
|
|
assert(node._dirty);
|
|
assert(node.parent == null || !node.parent.mergeAllDescendantsIntoThisNode || node.mergeAllDescendantsIntoThisNode);
|
|
if (node.mergeAllDescendantsIntoThisNode) {
|
|
// if we're merged into our parent, make sure our parent is added to the list
|
|
if (node.parent != null && node.parent.mergeAllDescendantsIntoThisNode)
|
|
node.parent._markDirty(); // this can add the node to the dirty list
|
|
// make sure all the descendants are also marked, so that if one gets marked dirty later we know to walk up then too
|
|
if (node._children != null)
|
|
for (SemanticsNode child in node._children)
|
|
child.mergeAllDescendantsIntoThisNode = true; // this can add the node to the dirty list
|
|
}
|
|
assert(_dirtyNodes[index] == node); // make sure nothing went in front of us in the list
|
|
}
|
|
_dirtyNodes.sort((SemanticsNode a, SemanticsNode b) => a.depth - b.depth);
|
|
List<mojom.SemanticsNode> updatedNodes = <mojom.SemanticsNode>[];
|
|
for (SemanticsNode node in _dirtyNodes) {
|
|
assert(node.parent?._dirty != true); // could be null (no parent) or false (not dirty)
|
|
// The _serialize() method marks the node as not dirty, and
|
|
// recurses through the tree to do a deep serialization of all
|
|
// contiguous dirty nodes. This means that when we return here,
|
|
// it's quite possible that subsequent nodes are no longer
|
|
// dirty. We skip these here.
|
|
// We also skip any nodes that were reset and subsequently
|
|
// dropped entirely (RenderObject.markNeedsSemanticsUpdate()
|
|
// calls reset() on its SemanticsNode if onlyChanges isn't set,
|
|
// which happens e.g. when the node is no longer contributing
|
|
// semantics).
|
|
if (node._dirty && node.attached)
|
|
updatedNodes.add(node._serialize());
|
|
}
|
|
for (mojom.SemanticsListener listener in _listeners)
|
|
listener.updateSemanticsTree(updatedNodes);
|
|
_dirtyNodes.clear();
|
|
}
|
|
|
|
static SemanticActionHandler getSemanticActionHandlerForId(int id, { _SemanticFlags neededFlag }) {
|
|
assert(neededFlag != null);
|
|
SemanticsNode result = _nodes[id];
|
|
if (result != null && result.mergeAllDescendantsIntoThisNode && !result._canHandle(neededFlag)) {
|
|
result._visitDescendants((SemanticsNode node) {
|
|
if (node._actionHandler != null && node._flags[neededFlag]) {
|
|
result = node;
|
|
return false; // found node, abort walk
|
|
}
|
|
return true; // continue walk
|
|
});
|
|
}
|
|
if (result == null || !result._canHandle(neededFlag))
|
|
return null;
|
|
return result._actionHandler;
|
|
}
|
|
|
|
String toString() {
|
|
return '$runtimeType($_id'
|
|
'${_dirty ? " (dirty)" : ""}'
|
|
'${mergeAllDescendantsIntoThisNode ? " (leaf merge)" : ""}'
|
|
'; $rect'
|
|
'${wasAffectedByClip ? " (clipped)" : ""}'
|
|
'${canBeTapped ? "; canBeTapped" : ""}'
|
|
'${canBeLongPressed ? "; canBeLongPressed" : ""}'
|
|
'${canBeScrolledHorizontally ? "; canBeScrolledHorizontally" : ""}'
|
|
'${canBeScrolledVertically ? "; canBeScrolledVertically" : ""}'
|
|
'${hasCheckedState ? (isChecked ? "; checked" : "; unchecked") : ""}'
|
|
'${label != "" ? "; \"$label\"" : ""}'
|
|
')';
|
|
}
|
|
|
|
String toStringDeep([String prefixLineOne = '', String prefixOtherLines = '']) {
|
|
String result = '$prefixLineOne$this\n';
|
|
if (_children != null && _children.isNotEmpty) {
|
|
for (int index = 0; index < _children.length - 1; index += 1) {
|
|
SemanticsNode child = _children[index];
|
|
result += '${child.toStringDeep("$prefixOtherLines \u251C", "$prefixOtherLines \u2502")}';
|
|
}
|
|
result += '${_children.last.toStringDeep("$prefixOtherLines \u2514", "$prefixOtherLines ")}';
|
|
}
|
|
return result;
|
|
}
|
|
}
|
|
|
|
class SemanticsServer extends mojom.SemanticsServer {
|
|
void addSemanticsListener(mojom.SemanticsListenerProxy listener) {
|
|
SemanticsNode.addListener(listener.ptr);
|
|
}
|
|
void tap(int nodeID) {
|
|
SemanticsNode.getSemanticActionHandlerForId(nodeID, neededFlag: _SemanticFlags.canBeTapped)?.handleSemanticTap();
|
|
}
|
|
void longPress(int nodeID) {
|
|
SemanticsNode.getSemanticActionHandlerForId(nodeID, neededFlag: _SemanticFlags.canBeLongPressed)?.handleSemanticLongPress();
|
|
}
|
|
void scrollLeft(int nodeID) {
|
|
SemanticsNode.getSemanticActionHandlerForId(nodeID, neededFlag: _SemanticFlags.canBeScrolledHorizontally)?.handleSemanticScrollLeft();
|
|
}
|
|
void scrollRight(int nodeID) {
|
|
SemanticsNode.getSemanticActionHandlerForId(nodeID, neededFlag: _SemanticFlags.canBeScrolledHorizontally)?.handleSemanticScrollRight();
|
|
}
|
|
void scrollUp(int nodeID) {
|
|
SemanticsNode.getSemanticActionHandlerForId(nodeID, neededFlag: _SemanticFlags.canBeScrolledVertically)?.handleSemanticScrollUp();
|
|
}
|
|
void scrollDown(int nodeID) {
|
|
SemanticsNode.getSemanticActionHandlerForId(nodeID, neededFlag: _SemanticFlags.canBeScrolledVertically)?.handleSemanticScrollDown();
|
|
}
|
|
}
|