HomeSort by relevance Sort by last modified time
    Searched refs:Node (Results 126 - 150 of 2349) sorted by null

1 2 3 4 56 7 8 91011>>

  /external/llvm/include/llvm/Analysis/
CFGPrinter.h 34 static std::string getSimpleNodeLabel(const BasicBlock *Node,
36 if (!Node->getName().empty())
37 return Node->getName().str();
42 Node->printAsOperand(OS, false);
46 static std::string getCompleteNodeLabel(const BasicBlock *Node,
52 if (Node->getName().empty()) {
53 Node->printAsOperand(OS, false);
57 OS << *Node;
91 std::string getNodeLabel(const BasicBlock *Node,
94 return getSimpleNodeLabel(Node, Graph)
    [all...]
  /external/llvm/unittests/ADT/
ilistTest.cpp 20 struct Node : ilist_node<Node> {
23 Node() {}
24 Node(int Value) : Value(Value) {}
25 Node(const Node&) = default;
26 ~Node() { Value = -1; }
30 ilist<Node> List;
31 List.push_back(Node(1));
36 List.push_back(Node(2))
    [all...]
  /external/llvm/lib/Target/WebAssembly/
WebAssemblyISelDAGToDAG.cpp 57 SDNode *Select(SDNode *Node) override;
70 SDNode *WebAssemblyDAGToDAGISel::Select(SDNode *Node) {
71 // Dump information about the Node being selected.
73 DEBUG(Node->dump(CurDAG));
76 // If we have a custom node, we already have selected!
77 if (Node->isMachineOpcode()) {
78 DEBUG(errs() << "== "; Node->dump(CurDAG); errs() << "\n");
79 Node->setNodeId(-1);
85 EVT VT = Node->getValueType(0);
87 switch (Node->getOpcode())
    [all...]
  /external/v8/src/
locked-queue-inl.h 15 struct LockedQueue<Record>::Node : Malloced {
16 Node() : next(nullptr) {}
18 AtomicValue<Node*> next;
24 head_ = new Node();
33 Node* old_node = nullptr;
34 Node* cur_node = head_;
45 Node* n = new Node();
58 Node* old_head = nullptr;
62 Node* const next_node = head_->next.Value()
    [all...]
  /libcore/luni/src/test/java/libcore/xml/
NodeTest.java 22 import org.w3c.dom.Node;
36 * For bug 779: Node#getNextSibling throws IndexOutOfBoundsException.
43 Node root = document.getDocumentElement();
55 for (Node node : flattenSubtree(documentElement)) {
56 if (node.getNodeType() == Node.ELEMENT_NODE
57 || node.getNodeType() == Node.DOCUMENT_NODE) {
58 assertFileUriEquals(file, node.getBaseURI())
    [all...]
  /external/v8/test/unittests/compiler/
linkage-tail-call-unittest.cc 8 #include "src/compiler/node.h"
59 Node* const node = Node::New(zone(), 1, op, 0, nullptr, false); local
61 EXPECT_TRUE(desc->CanTailCall(node, &stack_param_delta));
77 Node* const node = Node::New(zone(), 1, op, 0, nullptr, false); local
79 EXPECT_TRUE(desc1->CanTailCall(node, &stack_param_delta));
97 Node* const node = Node::New(zone(), 1, op, 0, nullptr, false) local
118 Node* const node = Node::New(zone(), 1, op, 0, nullptr, false); local
139 Node* const node = Node::New(zone(), 1, op, 0, nullptr, false); local
160 Node* const node = Node::New(zone(), 1, op, 0, nullptr, false); local
181 Node* const node = Node::New(zone(), 1, op, 0, nullptr, false); local
206 Node* const node = local
232 Node* const node = local
259 Node* const node = local
287 Node* const node = local
315 Node* const node = local
343 Node* const node = local
    [all...]
js-intrinsic-lowering-unittest.cc 12 #include "test/unittests/compiler/node-test-utils.h"
33 Reduction Reduce(Node* node, MachineOperatorBuilder::Flags flags =
44 return reducer.Reduce(node);
47 Node* EmptyFrameState() {
66 Node* const input0 = Parameter(0);
67 Node* const input1 = Parameter(1);
68 Node* const context = Parameter(2);
69 Node* const effect = graph()->start();
70 Node* const control = graph()->start()
    [all...]
liveness-analyzer-unittest.cc 8 #include "src/compiler/node-matchers.h"
11 #include "test/unittests/compiler/node-test-utils.h"
48 Node* Checkpoint() {
54 ZoneVector<Node*> local_inputs(locals_count_, nullptr, zone());
58 Node* locals =
68 Node* result =
80 class CheckpointMatcher : public MatcherInterface<Node*> {
82 explicit CheckpointMatcher(const char* liveness, Node* empty_values,
83 int locals_count, Node* replacement)
95 bool MatchAndExplain(Node* frame_state
    [all...]
  /external/v8/src/compiler/
js-graph.cc 7 #include "src/compiler/node-properties.h"
18 Node* JSGraph::CEntryStubConstant(int result_size) {
27 Node* JSGraph::EmptyFixedArrayConstant() {
33 Node* JSGraph::UndefinedConstant() {
38 Node* JSGraph::TheHoleConstant() {
43 Node* JSGraph::TrueConstant() {
48 Node* JSGraph::FalseConstant() {
53 Node* JSGraph::NullConstant() {
58 Node* JSGraph::ZeroConstant() {
63 Node* JSGraph::OneConstant()
    [all...]
representation-change.h 89 Node* GetRepresentationFor(Node* node, MachineRepresentation output_rep,
115 Node* GetTaggedRepresentationFor(Node* node, MachineRepresentation output_rep,
117 Node* GetFloat32RepresentationFor(Node* node,
120 Node* GetFloat64RepresentationFor(Node* node
    [all...]
change-lowering.cc 12 #include "src/compiler/node-properties.h"
23 Reduction ChangeLowering::Reduce(Node* node) {
24 Node* control = graph()->start();
25 switch (node->opcode()) {
27 return ChangeBitToBool(node->InputAt(0), control);
29 return ChangeBoolToBit(node->InputAt(0));
31 return ChangeFloat64ToTagged(node->InputAt(0), control);
33 return ChangeInt32ToTagged(node->InputAt(0), control);
35 return ChangeTaggedToFloat64(node->InputAt(0), control)
    [all...]
common-node-cache.h 8 #include "src/compiler/node-cache.h"
28 Node** FindInt32Constant(int32_t value) {
32 Node** FindInt64Constant(int64_t value) {
36 Node** FindFloat32Constant(float value) {
41 Node** FindFloat64Constant(double value) {
46 Node** FindExternalConstant(ExternalReference value);
48 Node** FindNumberConstant(double value) {
53 Node** FindHeapConstant(Handle<HeapObject> value);
56 void GetCachedNodes(ZoneVector<Node*>* nodes);
js-call-reducer.h 36 Reduction Reduce(Node* node) final;
39 Reduction ReduceArrayConstructor(Node* node);
40 Reduction ReduceNumberConstructor(Node* node);
41 Reduction ReduceFunctionPrototypeApply(Node* node);
42 Reduction ReduceFunctionPrototypeCall(Node* node);
    [all...]
load-elimination.h 19 Reduction Reduce(Node* node) final;
22 Reduction ReduceLoadField(Node* node);
  /external/llvm/lib/Target/BPF/
BPFISelDAGToDAG.cpp 76 // If the first operand is a FI, get the TargetFI Node
104 // If the first operand is a FI, get the TargetFI Node
118 SDNode *BPFDAGToDAGISel::Select(SDNode *Node) {
119 unsigned Opcode = Node->getOpcode();
121 // Dump information about the Node being selected
122 DEBUG(dbgs() << "Selecting: "; Node->dump(CurDAG); dbgs() << '\n');
124 // If we have a custom node, we already have selected!
125 if (Node->isMachineOpcode()) {
126 DEBUG(dbgs() << "== "; Node->dump(CurDAG); dbgs() << '\n');
134 unsigned IntNo = cast<ConstantSDNode>(Node->getOperand(1))->getZExtValue()
    [all...]
  /external/chromium-trace/catapult/third_party/html5lib-python/html5lib/treewalkers/
dom.py 3 from xml.dom import Node
9 def getNodeDetails(self, node):
10 if node.nodeType == Node.DOCUMENT_TYPE_NODE:
11 return _base.DOCTYPE, node.name, node.publicId, node.systemId
13 elif node.nodeType in (Node.TEXT_NODE, Node.CDATA_SECTION_NODE)
    [all...]
  /external/snakeyaml/src/main/java/org/yaml/snakeyaml/constructor/
AbstractConstruct.java 19 import org.yaml.snakeyaml.nodes.Node;
31 * @see org.yaml.snakeyaml.constructor.Construct#construct2ndStep(org.yaml.snakeyaml.nodes.Node,
34 public void construct2ndStep(Node node, Object data) {
35 if (node.isTwoStepsConstruction()) {
38 throw new YAMLException("Unexpected recursive structure for Node: " + node);
  /libcore/luni/src/main/java/java/util/concurrent/locks/
AbstractQueuedSynchronizer.java 274 * Wait queue node class.
280 * information about a thread in the predecessor of its node. A
281 * "status" field in each node keeps track of whether a thread
282 * should block. A node is signalled when its predecessor
283 * releases. Each node of the queue otherwise serves as a
308 * needed to handle cancellation. If a node is cancelled, its
315 * The thread id for each node is kept in its own node, so a
316 * predecessor signals the next node to wake up by traversing
321 * updated "tail" when a node's successor appears to be null
608 Node node = new Node(mode); local
888 final Node node = addWaiter(Node.EXCLUSIVE); local
919 final Node node = addWaiter(Node.EXCLUSIVE); local
950 final Node node = addWaiter(Node.SHARED); local
981 final Node node = addWaiter(Node.SHARED); local
1015 final Node node = addWaiter(Node.SHARED); local
1850 Node node = new Node(Node.CONDITION); local
1968 Node node = addConditionWaiter(); local
2031 Node node = addConditionWaiter(); local
2068 Node node = addConditionWaiter(); local
2111 Node node = addConditionWaiter(); local
2155 Node node = addConditionWaiter(); local
    [all...]
  /libcore/luni/src/main/java/org/apache/harmony/xml/dom/
DocumentFragmentImpl.java 20 import org.w3c.dom.Node;
46 return Node.DOCUMENT_FRAGMENT_NODE;
  /libcore/luni/src/main/java/org/w3c/dom/ls/
LSParserFilter.java 16 import org.w3c.dom.Node;
20 * nodes as they are being constructed while parsing. As each node is
30 * <code>EntityReference</code> node are passed to the filter if the
51 * Accept the node.
55 * Reject the node and its children.
59 * Skip this single node. The children of this node will still be
75 * <br>The element node passed to <code>startElement</code> for filtering
78 * being constructed (it may not have a parent node.)
82 * <br>For efficiency, the Element node passed to the filter may not b
    [all...]
  /packages/apps/UnifiedEmail/src/org/apache/james/mime4j/field/address/parser/
BaseNode.java 22 import org.apache.james.mime4j.field.address.parser.Node;
25 public abstract class BaseNode implements Node {
  /packages/services/Telephony/src/org/apache/james/mime4j/field/address/parser/
BaseNode.java 22 import org.apache.james.mime4j.field.address.parser.Node;
25 public abstract class BaseNode implements Node {
  /external/libcxx/test/std/containers/associative/
tree_left_rotate.pass.cpp 20 struct Node
22 Node* __left_;
23 Node* __right_;
24 Node* __parent_;
26 Node() : __left_(), __right_(), __parent_() {}
32 Node root;
33 Node x;
34 Node y;
57 Node root;
58 Node x
    [all...]
tree_right_rotate.pass.cpp 20 struct Node
22 Node* __left_;
23 Node* __right_;
24 Node* __parent_;
26 Node() : __left_(), __right_(), __parent_() {}
32 Node root;
33 Node x;
34 Node y;
57 Node root;
58 Node x
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/
tree_left_rotate.pass.cpp 20 struct Node
22 Node* __left_;
23 Node* __right_;
24 Node* __parent_;
26 Node() : __left_(), __right_(), __parent_() {}
32 Node root;
33 Node x;
34 Node y;
57 Node root;
58 Node x
    [all...]

Completed in 826 milliseconds

1 2 3 4 56 7 8 91011>>