| /external/v8/src/interpreter/ |
| interpreter-assembler.cc | 25 using compiler::Node;
77 Node* InterpreterAssembler::GetInterpretedFramePointer() {
88 Node* InterpreterAssembler::BytecodeOffset() {
97 Node* InterpreterAssembler::ReloadBytecodeOffset() {
98 Node* offset = LoadAndUntagRegister(Register::bytecode_offset());
108 Node* offset = BytecodeOffset();
117 Node* InterpreterAssembler::BytecodeArrayTaggedPointer() {
127 Node* InterpreterAssembler::DispatchTableRawPointer() {
137 Node* InterpreterAssembler::GetAccumulatorUnchecked() {
141 Node* InterpreterAssembler::GetAccumulator()
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| Trie.h | 36 class Node {
40 typedef std::vector<Node*> NodeVectorType;
54 bool operator() (Node* N1, Node* N2) {
57 bool operator() (Node* N, char Id) {
67 Node(const Node&);
68 Node& operator=(const Node&);
70 inline void addEdge(Node* N)
[all...] |
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_stackdepotbase.h | 24 template <class Node, int kReservedBits, int kTabSizeLog>
27 typedef typename Node::args_type args_type;
28 typedef typename Node::handle_type handle_type;
40 static Node *find(Node *s, args_type args, u32 hash);
41 static Node *lock(atomic_uintptr_t *p);
42 static void unlock(atomic_uintptr_t *p, Node *s);
52 atomic_uintptr_t tab[kTabSize]; // Hash table of Node's.
60 template <class Node, int kReservedBits, int kTabSizeLog>
61 Node *StackDepotBase<Node, kReservedBits, kTabSizeLog>::find(Node *s
107 Node *node = find(s, args, h); local
[all...] |
| /external/v8/src/builtins/ |
| builtins-arguments-gen.cc | 20 typedef compiler::Node Node;
22 std::tuple<Node*, Node*, Node*>
23 ArgumentsBuiltinsAssembler::GetArgumentsFrameAndCount(Node* function,
40 Node* frame_ptr_above = LoadBufferObject(
43 Node* shared =
46 Node* formal_parameter_count =
52 Node* marker_or_function = LoadBufferObject
[all...] |
| builtins-promise-gen.cc | 19 using compiler::Node;
21 Node* PromiseBuiltinsAssembler::AllocateJSPromise(Node* context) {
22 Node* const native_context = LoadNativeContext(context);
23 Node* const promise_fun =
26 Node* const promise_map =
28 Node* const promise = Allocate(JSPromise::kSizeWithEmbedderFields);
37 void PromiseBuiltinsAssembler::PromiseInit(Node* promise) {
49 Node* PromiseBuiltinsAssembler::AllocateAndInitJSPromise(Node* context)
[all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/ |
| CachedXPathAPI.java | 30 import org.w3c.dom.Node;
111 * Use an XPath string to select a single node. XPath namespace
112 * prefixes are resolved from the context node, which may not
115 * @param contextNode The node to start searching from.
117 * @return The first node found that matches the XPath, or null.
121 public Node selectSingleNode(Node contextNode, String str)
128 * Use an XPath string to select a single node.
131 * @param contextNode The node to start searching from.
133 * @param namespaceNode The node from which prefixes in the XPath will be resolved to namespaces
[all...] |
| XPathAPI.java | 30 import org.w3c.dom.Node;
56 * Use an XPath string to select a single node. XPath namespace
57 * prefixes are resolved from the context node, which may not
60 * @param contextNode The node to start searching from.
62 * @return The first node found that matches the XPath, or null.
66 public static Node selectSingleNode(Node contextNode, String str)
73 * Use an XPath string to select a single node.
76 * @param contextNode The node to start searching from.
78 * @param namespaceNode The node from which prefixes in the XPath will be resolved to namespaces
[all...] |
| /external/icu/icu4c/source/common/unicode/ |
| stringtriebuilder.h | 69 static int32_t hashNode(const void *node);
97 class Node;
101 Node *makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode);
103 Node *makeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex,
148 * Makes sure that there is only one unique node registered that is
150 * @param newNode Input node. The builder takes ownership.
154 * an equivalent node if newNode is a duplicate.
157 Node *registerNode(Node *newNode, UErrorCode &errorCode);
161 * Avoids creating a node if the value is a duplicate
[all...] |
| /external/libaom/libaom/tools/txfm_analyzer/ |
| txfm_graph.h | 15 struct Node {
16 Node *inNode[2];
54 void connect_node(Node *node, int stage_num, int node_num, int stage_idx,
56 void propagate(Node *node, int stage_num, int node_num, int stage);
57 void init_graph(Node *node, int stage_num, int node_num);
58 void graph_reset_visited(Node *node, int stage_num, int node_num)
[all...] |
| /external/v8/src/compiler/ |
| graph-assembler.h | 9 #include "src/compiler/node.h"
107 Node* PhiAt(size_t index);
138 Node* effect_;
139 Node* control_;
140 Node* bindings_[VarCount + 1];
146 GraphAssembler(JSGraph* jsgraph, Node* effect, Node* control, Zone* zone);
148 void Reset(Node* effect, Node* control);
176 Node* IntPtrConstant(intptr_t value)
[all...] |
| graph.cc | 11 #include "src/compiler/node-properties.h"
12 #include "src/compiler/node.h"
28 void Graph::Decorate(Node* node) {
30 decorator->Decorate(node);
46 Node* Graph::NewNode(const Operator* op, int input_count, Node* const* inputs,
48 Node* node = NewNodeUnchecked(op, input_count, inputs, incomplete); local
49 Verifier::VerifyNode(node);
55 Node* const node = local
[all...] |
| scheduler.h | 9 #include "src/compiler/node.h"
43 // Placement of a node changes during scheduling. The placement state
61 // Per-node data tracked during scheduling.
64 int unscheduled_count_; // Number of unscheduled uses of this node.
65 Placement placement_; // Whether the node is fixed, schedulable,
66 // coupled to another node, or not yet known.
76 ZoneQueue<Node*> schedule_queue_; // Worklist of schedulable nodes.
77 ZoneVector<SchedulerData> node_data_; // Per-node data for all nodes.
86 inline SchedulerData* GetData(Node* node);
[all...] |
| /external/clang/include/clang/Tooling/ |
| FixIt.h | 41 /// \brief Returns the SourceRange of an given Node. \p Node is typically a
43 template <typename T> SourceRange getSourceRange(const T &Node) {
44 return Node.getSourceRange();
48 // \brief Returns a textual representation of \p Node.
50 StringRef getText(const T &Node, const ASTContext &Context) {
51 return internal::getText(internal::getSourceRange(Node), Context);
54 // \brief Returns a FixItHint to remove \p Node.
56 template <typename T> FixItHint createRemoval(const T &Node) {
57 return FixItHint::CreateRemoval(internal::getSourceRange(Node));
[all...] |
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| Node.java | 22 * Node in a guice dependency graph.
27 public abstract class Node {
37 protected Node(NodeId id, Object source) {
52 if (!(obj instanceof Node)) {
55 Node other = (Node) obj;
66 * Returns a copy of the node with a new ID.
68 * @param id new ID of the node
69 * @return copy of the node with a new ID
71 public abstract Node copy(NodeId id)
[all...] |
| /external/skia/src/core/ |
| SkRTree.h | 51 // Insertion count (not overall node count, which may be greater).
62 struct Node;
66 Node* fSubtree;
72 struct Node {
78 void search(Node* root, const SkRect& query, SkTDArray<int>* results) const;
86 Node* allocateNodeAtLevel(uint16_t level);
92 SkTDArray<Node> fNodes;
|
| /external/skqp/src/core/ |
| SkRTree.h | 51 // Insertion count (not overall node count, which may be greater).
62 struct Node;
66 Node* fSubtree;
72 struct Node {
78 void search(Node* root, const SkRect& query, SkTDArray<int>* results) const;
86 Node* allocateNodeAtLevel(uint16_t level);
92 SkTDArray<Node> fNodes;
|
| /external/tensorflow/tensorflow/compiler/jit/ |
| xla_cluster_util.h | 38 // The attribute that marks certain inputs to a Node as required to be a
44 // the inputs to the node that must be constant.
47 using OrderedNodeSet = std::set<Node*, NodeComparatorID>;
52 // Returns true if `node` has a ref tensor input that it forwards to its output.
53 bool HasForwardedRefInput(const Node& node);
64 // Returns the XLA cluster in which `node` is placed if it is in an XLA cluster,
66 absl::optional<absl::string_view> GetXlaClusterForNode(const Node& node);
71 // Removes `node` its XLA cluster (by clearing its _XlaCluster attribute)
[all...] |
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| functionalize_cond.h | 46 // When we keep track of which switch/merge node's feed into a node, we record
47 // 1) predicate for non-dead switch node,
48 // 2) the switch node itself for dead switch node,
49 // 3) the merge node itself for merge node.
64 // Compare two AncestorNodes by (node id, index, type).
73 // StateMap is responsible for mapping from each graph Node to
77 // that are an ancestor of the node in the graph
[all...] |
| /external/tensorflow/tensorflow/core/graph/ |
| while_context.h | 37 WhileContext(StringPiece frame_name, std::vector<Node*> enter_nodes,
38 std::vector<Node*> exit_nodes, OutputTensor cond_output,
43 const std::vector<Node*>& enter_nodes() const { return enter_nodes_; }
44 const std::vector<Node*>& exit_nodes() const { return exit_nodes_; }
60 const std::vector<Node*> enter_nodes_;
64 const std::vector<Node*> exit_nodes_;
|
| /device/linaro/bootloader/edk2/DuetPkg/PciBusNoEnumerationDxe/ |
| PciDriverOverride.c | 80 PCI_DRIVER_OVERRIDE_LIST *Node;
88 Node = DRIVER_OVERRIDE_FROM_LINK (CurrentLink);
92 *DriverImageHandle = Node->DriverImageHandle;
96 if (*DriverImageHandle == Node->DriverImageHandle) {
104 // Get next node
106 Node = DRIVER_OVERRIDE_FROM_LINK (CurrentLink->ForwardLink);
107 *DriverImageHandle = Node->DriverImageHandle;
140 PCI_DRIVER_OVERRIDE_LIST *Node;
147 Node = AllocatePool (sizeof (PCI_DRIVER_OVERRIDE_LIST));
148 if (Node == NULL) {
[all...] |
| /external/apache-commons-bcel/src/examples/Mini/ |
| JJTMiniParserState.java | 23 private java.util.Stack<Node> nodes;
31 nodes = new java.util.Stack<Node>();
37 /* Determines whether the current node was actually closed and
39 node scope. */
44 /* Call this to reinitialize the node stack. It is called
53 /* Returns the root node of the AST. It only makes sense to call
55 Node rootNode() {
59 /* Pushes a node on to the stack. */
60 void pushNode(Node n) {
65 /* Returns the node on the top of the stack, and remove it from th
[all...] |
| /external/cldr/tools/java/org/unicode/cldr/util/ |
| NodeListIterator.java | 5 import org.w3c.dom.Node;
17 public class NodeListIterator implements Iterator<Node> {
23 * Since node lists are indexed by position, the current
38 public Node next() {
|
| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/validator/ |
| TreeVisitorValidator.java | 3 import com.github.javaparser.ast.Node;
6 * A validator that walks the whole tree, visiting every node.
16 public final void accept(Node node, ProblemReporter reporter) {
17 validator.accept(node, reporter);
18 for (Node child : node.getChildNodes()) {
|
| /external/v8/src/ |
| locked-queue.h | 30 struct Node;
34 Node* head_;
35 Node* tail_;
|
| code-stub-assembler.h | 108 [&]() -> compiler::Node* { \
145 [&]() -> compiler::Node* { \
162 [&]() -> compiler::Node* { \
163 compiler::Node* const argc = \
229 using Node = compiler::Node;
272 TNode<IntPtrT> ParameterToIntPtr(Node* value, ParameterMode mode) {
277 Node* IntPtrToParameter(SloppyTNode<IntPtrT> value, ParameterMode mode) {
282 Node* Int32ToParameter(SloppyTNode<Int32T> value, ParameterMode mode) {
286 TNode<Smi> ParameterToTagged(Node* value, ParameterMode mode)
[all...] |
