| /external/v8/src/compiler/ |
| 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** FindPointerConstant(intptr_t value) {
52 Node** FindNumberConstant(double value) {
57 Node** FindHeapConstant(Handle<HeapObject> value);
59 Node** FindRelocatableInt32Constant(int32_t value, RelocInfoMode rmode)
[all...] |
| raw-machine-assembler.cc | 7 #include "src/compiler/node-properties.h"
29 // Add an extra input for the JSFunction parameter to the start node.
38 Node* RawMachineAssembler::RelocatableIntPtrConstant(intptr_t value,
67 Node* RawMachineAssembler::Parameter(size_t index) {
80 void RawMachineAssembler::Branch(Node* condition, RawMachineLabel* true_val,
83 Node* branch = MakeNode(common()->Branch(), 1, &condition);
88 void RawMachineAssembler::Continuations(Node* call, RawMachineLabel* if_success,
96 void RawMachineAssembler::Switch(Node* index, RawMachineLabel* default_label,
102 Node* switch_node = AddNode(common()->Switch(succ_count), index);
107 Node* case_node
330 Node* node = MakeNode(op, input_count, inputs); local
331 schedule()->AddNode(CurrentBlock(), node); local
[all...] |
| checkpoint-elimination.h | 23 Reduction Reduce(Node* node) final;
26 Reduction ReduceCheckpoint(Node* node);
|
| js-generic-lowering.h | 30 Reduction Reduce(Node* node) final;
33 #define DECLARE_LOWER(x) void Lower##x(Node* node);
39 void ReplaceWithStubCall(Node* node, Callable c, CallDescriptor::Flags flags);
40 void ReplaceWithStubCall(Node* node, Callable c, CallDescriptor::Flags flags,
43 void ReplaceWithRuntimeCall(Node* node, Runtime::FunctionId f, int args = -1)
[all...] |
| /external/v8/src/ |
| locked-queue-inl.h | 15 struct LockedQueue<Record>::Node : Malloced {
16 Node() : next(nullptr) {}
18 base::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...] |
| /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Compatibility/FrameworkHiiOnUefiHiiThunk/ |
| UefiIfrDefault.c | 28 Set the data position at Offset with Width in Node->Buffer based
31 @param Node The Buffer Storage Node.
33 @param Offset The offset in Node->Buffer for the update.
39 OUT UEFI_IFR_BUFFER_STORAGE_NODE *Node,
45 ASSERT (Node->Signature == UEFI_IFR_BUFFER_STORAGE_NODE_SIGNATURE);
46 ASSERT (Offset + Width <= Node->Size);
48 CopyMem (Node->Buffer + Offset, &Value->Value.u8, Width);
63 @param Node Var storage buffer to store the got default value.
73 OUT UEFI_IFR_BUFFER_STORAGE_NODE *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);
|
| /frameworks/base/tools/aapt2/ |
| DominatorTree.cpp | 31 util::make_unique<Node>(config.get(), nullptr));
41 bool DominatorTree::Node::TryAddChild(std::unique_ptr<Node> new_child) {
42 CHECK(new_child->value_) << "cannot add a root or empty node as a child";
50 bool DominatorTree::Node::AddChild(std::unique_ptr<Node> new_child) {
65 [](const std::unique_ptr<Node>& child) -> bool {
83 bool DominatorTree::Node::Dominates(const Node* other) const {
84 // Check root node dominations
[all...] |
| /frameworks/base/tools/incident_report/ |
| generic_message.cpp | 30 Node node; local
31 node.type = TYPE_VALUE32;
32 node.value32 = value;
33 mNodes.insert(pair<int32_t,Node>(fieldId, node));
39 Node node; local
40 node.type = TYPE_VALUE64;
41 node.value64 = value
49 Node node; local
59 Node node; 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...] |
| /libcore/ojluni/src/main/java/java/util/concurrent/locks/ |
| AbstractQueuedSynchronizer.java | 302 * Wait queue node class.
308 * information about a thread in the predecessor of its node. A
309 * "status" field in each node keeps track of whether a thread
310 * should block. A node is signalled when its predecessor
311 * releases. Each node of the queue otherwise serves as a
336 * needed to handle cancellation. If a node is cancelled, its
343 * The thread id for each node is kept in its own node, so a
344 * predecessor signals the next node to wake up by traversing
349 * updated "tail" when a node's successor appears to be null
636 Node node = new Node(mode); local
915 final Node node = addWaiter(Node.EXCLUSIVE); local
946 final Node node = addWaiter(Node.EXCLUSIVE); local
977 final Node node = addWaiter(Node.SHARED); local
1008 final Node node = addWaiter(Node.SHARED); local
1042 final Node node = addWaiter(Node.SHARED); local
1874 Node node = new Node(Node.CONDITION); local
1992 Node node = addConditionWaiter(); local
2055 Node node = addConditionWaiter(); local
2092 Node node = addConditionWaiter(); local
2135 Node node = addConditionWaiter(); local
2179 Node node = addConditionWaiter(); local
[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 {
|
| /device/linaro/bootloader/edk2/StdLib/LibC/Uefi/Devices/Utility/ |
| DevGenisis.c | 110 DeviceNode *Node;
121 Node = (DeviceNode *)AllocateZeroPool(sizeof(DeviceNode));
122 if(Node == NULL) {
127 Node->DevName = DevName;
128 Node->DevProto = DevProto;
129 Node->InstanceList = InstanceList;
130 Node->OpenFunc = OpenFunc;
131 Node->InstanceSize = InstanceSize;
132 Node->NumInstances = NumInstance;
133 Node->OpModes = Modes;
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
| InstrEmitter.h | 39 /// EmitCopyFromReg - Generate machine code for an CopyFromReg node or an
41 void EmitCopyFromReg(SDNode *Node, unsigned ResNo,
47 /// node is a CopyToReg, return its destination register. Return 0 otherwise.
48 unsigned getDstOfOnlyCopyToRegUse(SDNode *Node,
51 void CreateVirtualRegisters(SDNode *Node, MachineInstr *MI,
57 /// of the specified node.
71 /// specifies the instruction information for the node, and IIOpNum is the
88 void EmitSubregNode(SDNode *Node, DenseMap<SDValue, unsigned> &VRBaseMap,
95 void EmitCopyToRegClassNode(SDNode *Node,
100 void EmitRegSequence(SDNode *Node, DenseMap<SDValue, unsigned> &VRBaseMap
[all...] |
| /prebuilts/ndk/r11/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...] |
| 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...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/libcxx/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...] |
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/nodes/ |
| SequenceNode.java | 29 final private List<Node> value;
31 public SequenceNode(Tag tag, boolean resolved, List<Node> value, Mark startMark, Mark endMark,
35 throw new NullPointerException("value in a Node is required.");
41 public SequenceNode(Tag tag, List<Node> value, Boolean flowStyle) {
55 public List<Node> getValue() {
60 for (Node node : value) {
61 node.setType(listType);
|
| /external/valgrind/memcheck/tests/ |
| leak-tree.c | 24 } Node;
26 Node* mk(void)
28 Node *x = malloc(sizeof(Node));
35 Node* t;
|
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/clang/include/clang/ASTMatchers/ |
| ASTMatchers.h | 34 // where "child" is bound to the RecordDecl node of the matching child
62 /// The bound nodes are generated by calling \c bind("id") on the node matchers
69 /// \brief Returns the AST node bound to \c ID.
71 /// Returns NULL if there was no node bound to \c ID or if there is a node but
98 /// \brief If the provided matcher matches a node, binds the node to \c ID.
119 /// \brief Matches any node.
211 SourceManager.getExpansionLoc(Node.getLocStart()));
231 auto ExpansionLoc = SourceManager.getExpansionLoc(Node.getLocStart())
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/clang/include/clang/ASTMatchers/ |
| ASTMatchers.h | 34 // where "child" is bound to the RecordDecl node of the matching child
62 /// The bound nodes are generated by calling \c bind("id") on the node matchers
69 /// \brief Returns the AST node bound to \c ID.
71 /// Returns NULL if there was no node bound to \c ID or if there is a node but
98 /// \brief If the provided matcher matches a node, binds the node to \c ID.
119 /// \brief Matches any node.
211 SourceManager.getExpansionLoc(Node.getLocStart()));
231 auto ExpansionLoc = SourceManager.getExpansionLoc(Node.getLocStart())
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/clang/include/clang/ASTMatchers/ |
| ASTMatchers.h | 34 // where "child" is bound to the RecordDecl node of the matching child
62 /// The bound nodes are generated by calling \c bind("id") on the node matchers
69 /// \brief Returns the AST node bound to \c ID.
71 /// Returns NULL if there was no node bound to \c ID or if there is a node but
98 /// \brief If the provided matcher matches a node, binds the node to \c ID.
119 /// \brief Matches any node.
211 SourceManager.getExpansionLoc(Node.getLocStart()));
231 auto ExpansionLoc = SourceManager.getExpansionLoc(Node.getLocStart())
[all...] |
