Searched refs:edge (Results 226 - 250 of 253) sorted by path

1234567891011

/external/v8/src/compiler/
H A Dnode-properties.h54 static bool IsValueEdge(Edge edge);
55 static bool IsContextEdge(Edge edge);
56 static bool IsFrameStateEdge(Edge edge);
57 static bool IsEffectEdge(Edge edge);
58 static bool IsControlEdge(Edge edge);
172 static inline bool IsInputRange(Edge edge, int first, int count);
H A Dnode.cc399 { // Input edge iteration.
401 for (Edge edge : this->input_edges()) {
402 CHECK_EQ(edge.from(), this);
403 CHECK_EQ(index, edge.index());
404 CHECK_EQ(this->InputAt(index), edge.to());
H A Dosr.cc154 TRACE(" edge @%d #%d:%s, incoming depth %zu\n", i, control->id(),
193 // Gather edge inputs into {tmp_inputs}.
195 for (int edge = 0; edge < backedge_count; edge++) {
196 tmp_inputs.push_back(backedges[edge][index]);
H A Dscheduler.cc142 for (Edge const edge : node->input_edges()) {
143 DecrementUnscheduledUseCount(edge.to(), edge.index(), edge.from());
820 // Use the next outgoing edge if there are any.
1174 // If the edge is from an unscheduled node, then tally it in the use count
1204 Edge edge = *stack.top(); local
1205 Node* node = edge.to();
1207 prepare_uses.PostEdge(edge.from(), edge
1548 GetBlockForUse(Edge edge) argument
[all...]
H A Dsimplified-lowering.cc163 for (Edge edge : node->use_edges()) {
164 if (NodeProperties::IsControlEdge(edge)) {
165 edge.UpdateTo(control);
166 } else if (NodeProperties::IsEffectEdge(edge)) {
167 edge.UpdateTo(effect);
169 DCHECK(NodeProperties::IsValueEdge(edge) ||
170 NodeProperties::IsContextEdge(edge));
2903 for (Edge edge : node->use_edges()) {
2904 if (NodeProperties::IsControlEdge(edge)) {
2905 if (edge
[all...]
H A Dstore-store-elimination.cc425 for (Edge edge : node->use_edges()) {
427 if (!NodeProperties::IsEffectEdge(edge)) {
431 Node* use = edge.from();
H A Dverifier.cc158 for (Edge edge : node->use_edges()) {
159 if (!NodeProperties::IsControlEdge(edge)) {
162 Node* control_use = edge.from();
1672 for (Edge edge : node->use_edges()) {
1673 Node* const user = edge.from();
1675 if (NodeProperties::IsControlEdge(edge)) {
1677 } else if (NodeProperties::IsEffectEdge(edge)) {
1679 } else if (NodeProperties::IsFrameStateEdge(edge)) {
1706 void Verifier::VerifyEdgeInputReplacement(const Edge& edge, argument
1709 DCHECK(!NodeProperties::IsControlEdge(edge) ||
[all...]
H A Dverifier.h43 // (effect, control or frame state) to be used as an input for {edge}.
44 static void VerifyEdgeInputReplacement(const Edge& edge,
48 static void VerifyEdgeInputReplacement(const Edge& edge, argument
H A Dwasm-compiler.cc2514 for (Edge const edge : value->use_edges()) {
2515 if (NodeProperties::IsControlEdge(edge)) continue;
2516 if (NodeProperties::IsEffectEdge(edge)) continue;
2517 DCHECK(NodeProperties::IsValueEdge(edge));
/external/v8/src/inspector/build/closure-compiler/
H A Dclosure-compiler.jarMETA-INF/MANIFEST.MF META-INF/ com/ com/google/ com/google/debugging/ com/google/debugging/sourcemap/ ...
/external/v8/src/profiler/
H A Dheap-snapshot-generator.cc72 HeapGraphEdge edge(type, name, this->index(), entry->index());
73 snapshot_->edges().push_back(edge);
81 HeapGraphEdge edge(type, index, this->index(), entry->index());
82 snapshot_->edges().push_back(edge);
108 HeapGraphEdge& edge = **i; local
112 switch (edge.type()) {
115 edge_name = edge.name();
118 SNPrintF(index, "%d", edge.index());
122 edge_name = edge.name();
125 edge_name = edge
287 HeapGraphEdge* edge = &edges()[i]; local
2788 SerializeEdge(HeapGraphEdge* edge, bool first_edge) argument
[all...]
H A Dheap-snapshot-generator.h117 void add_child(HeapGraphEdge* edge) { argument
118 *(children_begin() + children_count_++) = edge;
599 void SerializeEdge(HeapGraphEdge* edge, bool first_edge);
/external/v8/tools/clang/blink_gc_plugin/
H A DBlinkGCPluginConsumer.cpp452 if (field.second.edge()->NeedsFinalization())
498 if (field.second.edge()->NeedsFinalization())
612 point_->edge()->Accept(this);
H A DCheckFieldsVisitor.cpp32 current_->edge()->Accept(this);
37 void CheckFieldsVisitor::AtMember(Member* edge) { argument
50 void CheckFieldsVisitor::AtIterator(Iterator* edge) { argument
54 if (edge->IsUnsafe())
58 void CheckFieldsVisitor::AtValue(Value* edge) { argument
60 if (edge->value()->record()->isUnion())
63 if (!stack_allocated_host_ && edge->value()->IsStackAllocated()) {
69 edge->value()->IsGCDerived() &&
70 !edge->value()->IsGCMixin()) {
86 edge
112 AtCollection(Collection* edge) argument
[all...]
H A DCheckFieldsVisitor.h43 void AtMember(Member* edge) override;
44 void AtValue(Value* edge) override;
45 void AtCollection(Collection* edge) override;
H A DCheckFinalizerVisitor.cpp20 void VisitMember(Member* edge) override;
21 void VisitCollection(Collection* edge) override;
43 void MightBeCollectedVisitor::VisitMember(Member* edge) { argument
45 if (edge->ptr()->IsValue()) {
46 Value* member = static_cast<Value*>(edge->ptr());
57 void MightBeCollectedVisitor::VisitCollection(Collection* edge) { argument
58 if (edge->on_heap() && !is_eagerly_finalized_) {
59 might_be_collected_ = !edge->is_root();
61 edge->AcceptMembers(this);
130 point->edge()
[all...]
H A DCheckGCRootsVisitor.cpp19 it->second.edge()->Accept(this);
25 void CheckGCRootsVisitor::VisitValue(Value* edge) { argument
27 if (edge->value()->record()->isUnion())
31 if (visiting_set_.find(edge->value()) != visiting_set_.end())
34 visiting_set_.insert(edge->value());
42 ContainsGCRoots(edge->value());
43 visiting_set_.erase(edge->value());
46 void CheckGCRootsVisitor::VisitPersistent(Persistent* edge) { argument
50 void CheckGCRootsVisitor::AtCollection(Collection* edge) { argument
51 if (edge
[all...]
H A DCheckGCRootsVisitor.h28 void VisitValue(Value* edge) override;
29 void VisitPersistent(Persistent* edge) override;
30 void AtCollection(Collection* edge) override;
H A DCheckTraceVisitor.cpp365 if (IsWeakCallback() && !it->second.edge()->IsWeakMember())
396 if (field.second.edge()->IsWeakMember())
H A DRecordInfo.cpp422 Edge* edge = CreateEdgeFromOriginalType(unexpandedType); local
423 if (!edge)
424 edge = CreateEdge(field->getType().getTypePtrOrNull());
425 if (edge) {
426 fields_status = fields_status.LUB(edge->NeedsTracing(Edge::kRecursive));
427 fields->insert(std::make_pair(field, FieldPoint(field, edge)));
528 if (it->second.edge()->NeedsFinalization())
690 Collection* edge = new Collection(info, on_heap, is_root);
693 edge->members().push_back(member);
695 // TODO: Handle the case where we fail to create an edge (e
[all...]
H A DRecordInfo.h55 FieldPoint(clang::FieldDecl* field, Edge* edge) argument
56 : field_(field), edge_(edge) {}
61 Edge* edge() { return edge_; } function in class:FieldPoint
H A Dprocess-graph.py103 edge = self.edges.get(new_edge.key)
104 if edge:
105 # If an edge exist, its kind is the strongest of the two.
106 edge.kind = max(edge.kind, new_edge.kind)
133 # The label does not uniquely determine an edge from a node. We
136 # edge to a particular type. For example, if the field A::m_f
138 # strong edge with key m_f#B from A to B.
176 # Add/update an edge entry
186 def copy_super_edges(edge)
[all...]
/external/v8/tools/turbolizer/
H A Dgraph-layout.js133 var edge = node.inputs[i];
134 if (!edge.isBackEdge()) {
135 var source = edge.source;
136 var horizontalPos = edge.getInputHorizontalPosition(graph);
211 source.outputs.forEach(function(edge) {
212 if (edge.isVisible()) {
213 var target = edge.target;
216 var horizontalPos = edge.getInputHorizontalPosition(graph);
355 var edge = n.outputs[l];
356 if (edge
[all...]
H A Dgraph-view.js190 edges.forEach(function(edge) {
191 if (edgeFilter == undefined || edgeFilter(edge, edgeNumber)) {
192 frontier.add(edge);
207 edgeFrontier.forEach(function(edge) {
208 if (edge.visible) {
213 edgeFrontier.forEach(function(edge) {
214 edge.visible = newState;
216 var node = inEdges ? edge.source : edge.target;
322 element.__data__.inputs.forEach(function(edge) {
[all...]
H A Dnode.js113 var edge = this.inputs[i];
114 edge.visible = v;
116 if (!edge.source.visible) {
117 edge.source.visible = true;

Completed in 595 milliseconds

1234567891011