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

1 2 3 4 56 7 8 91011>>

  /external/tensorflow/tensorflow/core/grappler/costs/
virtual_placer_test.cc 38 NodeDef node; local
39 node.set_op("Conv2D");
40 // node.device() is empty, but GPU is default device if there is.
41 EXPECT_EQ("GPU", placer.get_device(node).type());
43 placer.get_canonical_device_name(node));
45 node.set_device("CPU");
46 EXPECT_EQ("CPU", placer.get_device(node).type());
48 placer.get_canonical_device_name(node));
50 node.set_device("GPU:0");
51 EXPECT_EQ("GPU", placer.get_device(node).type())
68 NodeDef node; local
98 NodeDef node; local
128 NodeDef node; local
150 NodeDef node; local
161 NodeDef node; local
260 NodeDef node; local
276 NodeDef node; local
296 NodeDef node; local
    [all...]
  /external/dtc/
checks.c 43 typedef void (*check_fn)(struct check *c, struct dt_info *dti, struct node *node);
99 static void check_nodes_props(struct check *c, struct dt_info *dti, struct node *node)
101 struct node *child;
103 TRACE(c, "%s", node->fullpath);
105 c->fn(c, dti, node);
107 for_each_child(node, child)
113 struct node *dt = dti->dt;
157 struct node *node
    [all...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/_sqlite/
cache.c 31 pysqlite_Node* node; local
33 node = (pysqlite_Node*) (pysqlite_NodeType.tp_alloc(&pysqlite_NodeType, 0));
34 if (!node) {
39 node->key = key;
42 node->data = data;
44 node->prev = NULL;
45 node->next = NULL;
47 return node;
92 pysqlite_Node* node; local
101 node = self->first;
119 pysqlite_Node* node; local
    [all...]
  /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_src/proper_source/com/github/javaparser/
Position.java 24 import com.github.javaparser.ast.Node;
30 public static final Position ABSOLUTE_START = new Position(Node.ABSOLUTE_BEGIN_LINE,-1);
31 public static final Position ABSOLUTE_END = new Position(Node.ABSOLUTE_END_LINE,-1);
33 public static Position beginOf(Node node){
34 return new Position(node.getBeginLine(),node.getBeginColumn());
37 public static Position endOf(Node node){
38 return new Position(node.getEndLine(),node.getEndColumn())
    [all...]
  /external/pdfium/xfa/fxfa/parser/
cxfa_value.cpp 51 XFA_ObjectType::Node,
71 CXFA_Node* node = GetFirstChild(); local
72 ASSERT(!node || node->GetElementType() == XFA_Element::Arc);
73 return static_cast<CXFA_Arc*>(node);
77 CXFA_Node* node = GetFirstChild(); local
78 ASSERT(!node || node->GetElementType() == XFA_Element::Line);
79 return static_cast<CXFA_Line*>(node);
83 CXFA_Node* node = GetFirstChild() local
89 CXFA_Node* node = GetFirstChild(); local
95 CXFA_Node* node = GetFirstChild(); local
101 CXFA_Node* node = GetFirstChild(); local
    [all...]
  /external/python/cpython2/Modules/_sqlite/
cache.c 31 pysqlite_Node* node; local
33 node = (pysqlite_Node*) (pysqlite_NodeType.tp_alloc(&pysqlite_NodeType, 0));
34 if (!node) {
39 node->key = key;
42 node->data = data;
44 node->prev = NULL;
45 node->next = NULL;
47 return node;
92 pysqlite_Node* node; local
101 node = self->first
119 pysqlite_Node* node; local
    [all...]
  /external/python/cpython3/Lib/lib2to3/fixes/
fix_numliterals.py 17 def match(self, node):
19 return (node.value.startswith("0") or node.value[-1] in "Ll")
21 def transform(self, node, results):
22 val = node.value
28 return Number(val, prefix=node.prefix)
  /external/python/cpython3/Modules/_sqlite/
cache.c 30 pysqlite_Node* node; local
32 node = (pysqlite_Node*) (pysqlite_NodeType.tp_alloc(&pysqlite_NodeType, 0));
33 if (!node) {
38 node->key = key;
41 node->data = data;
43 node->prev = NULL;
44 node->next = NULL;
46 return node;
91 pysqlite_Node* node; local
100 node = self->first
118 pysqlite_Node* node; local
    [all...]
  /external/snakeyaml/src/test/java/org/yaml/snakeyaml/nodes/
ScalarNodeTest.java 27 Node node = new ScalarNode(new Tag("str"), "text", null, null, '>'); local
28 assertEquals(NodeId.scalar, node.getNodeId());
32 Node node = new ScalarNode(new Tag("str"), "text", null, null, '>'); local
33 assertTrue(node.toString().contains("ScalarNode"));
34 assertTrue(node.toString().contains("tag="));
35 assertTrue(node.toString().contains("value="));
  /external/v8/src/compiler/
control-equivalence.cc 6 #include "src/compiler/node-properties.h"
17 void ControlEquivalence::Run(Node* exit) {
29 void ControlEquivalence::VisitPre(Node* node) {
30 TRACE("CEQ: Pre-visit of #%d:%s\n", node->id(), node->op()->mnemonic());
33 SetNumber(node, NewDFSNumber());
34 TRACE(" Assigned DFS number is %zu\n", GetNumber(node));
38 void ControlEquivalence::VisitMid(Node* node, DFSDirection direction)
99 Node* node = entry.node; local
182 Node* node = queue.front(); local
    [all...]
js-generic-lowering.cc 14 #include "src/compiler/node-matchers.h"
15 #include "src/compiler/node-properties.h"
25 CallDescriptor::Flags FrameStateFlagForCall(Node* node) {
26 return OperatorProperties::HasFrameStateInput(node->op())
38 Reduction JSGenericLowering::Reduce(Node* node) {
39 switch (node->opcode()) {
42 Lower##x(node); \
50 return Changed(node);
    [all...]
instruction-selector.cc 12 #include "src/compiler/node-matchers.h"
59 for (Node* const phi : *block) {
63 for (Node* const input : phi->inputs()) {
237 bool InstructionSelector::CanCover(Node* user, Node* node) const {
238 // 1. Both {user} and {node} must be in the same basic block.
239 if (schedule()->block(node) != schedule()->block(user)) {
242 // 2. Pure {node}s must be owned by the {user}.
243 if (node->op()->HasProperty(Operator::kPure))
1458 MarkAsRepresentation(MachineType::PointerRepresentation(), node); local
    [all...]
js-frame-specialization.cc 15 Reduction JSFrameSpecialization::Reduce(Node* node) {
16 switch (node->opcode()) {
18 return ReduceOsrValue(node);
20 return ReduceOsrGuard(node);
22 return ReduceParameter(node);
29 Reduction JSFrameSpecialization::ReduceOsrValue(Node* node) {
33 DCHECK_EQ(IrOpcode::kOsrValue, node->opcode());
35 int index = OsrValueIndexOf(node->op())
    [all...]
redundancy-elimination.h 19 Reduction Reduce(Node* node) final;
23 Check(Node* node, Check* next) : node(node), next(next) {}
24 Node* node; member in struct:v8::internal::compiler::final::Check
35 EffectPathChecks const* AddCheck(Zone* zone, Node* node) const
    [all...]
  /system/bt/osi/src/
list.cc 20 static list_node_t* list_free_node_(list_t* list, list_node_t* node);
55 for (const list_node_t* node = list_begin(list); node != list_end(list);
56 node = list_next(node)) {
57 if (list_node(node) == data) return true;
94 list_node_t* node = (list_node_t*)list->allocator->alloc(sizeof(list_node_t)); local
95 if (!node) return false;
97 node->next = prev_node->next;
98 node->data = data
109 list_node_t* node = (list_node_t*)list->allocator->alloc(sizeof(list_node_t)); local
123 list_node_t* node = (list_node_t*)list->allocator->alloc(sizeof(list_node_t)); local
    [all...]
  /external/icu/icu4c/source/common/
bytestrie.cpp 74 int32_t node; local
75 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ?
76 valueResult(node) : USTRINGTRIE_NO_VALUE;
104 int32_t node=*pos; local
105 U_ASSERT(node>=kMinValueLead);
106 if(node&kValueIsFinal) {
112 // int32_t delta=readValue(pos, node>>1);
113 node>>=1;
115 if(node<kMinTwoByteValueLead) {
116 delta=node-kMinOneByteValueLead
142 int32_t node=*pos; local
153 int32_t node=*pos++; local
397 int32_t node=*pos++; local
    [all...]
  /frameworks/compile/mclinker/unittests/
InputTreeTest.cpp 68 InputTree::iterator node = m_pTestee->root(); local
69 InputTree::const_iterator const_node = node;
70 --node;
73 ASSERT_TRUE(isGroup(node));
78 --node;
80 m_pTestee->enterGroup(node, InputTree::Downward);
82 InputTree::const_iterator const_node2 = node;
84 ASSERT_FALSE(node.isRoot());
86 ASSERT_FALSE(isGroup(node));
95 InputTree::iterator node = m_pTestee->root() local
120 InputTree::iterator node = m_pTestee->root(); local
139 InputTree::iterator node = m_pTestee->root(); local
    [all...]
  /external/jsilver/src/com/google/clearsilver/jsilver/syntax/
DataCommandConsolidator.java 20 import com.google.clearsilver.jsilver.syntax.node.AAltCommand;
21 import com.google.clearsilver.jsilver.syntax.node.ACallCommand;
22 import com.google.clearsilver.jsilver.syntax.node.ADataCommand;
23 import com.google.clearsilver.jsilver.syntax.node.ADefCommand;
24 import com.google.clearsilver.jsilver.syntax.node.AEachCommand;
25 import com.google.clearsilver.jsilver.syntax.node.AEvarCommand;
26 import com.google.clearsilver.jsilver.syntax.node.AHardIncludeCommand;
27 import com.google.clearsilver.jsilver.syntax.node.AHardLincludeCommand;
28 import com.google.clearsilver.jsilver.syntax.node.AIfCommand;
29 import com.google.clearsilver.jsilver.syntax.node.AIncludeCommand
    [all...]
  /external/v8/src/compiler/ppc/
instruction-selector-ppc.cc 7 #include "src/compiler/node-matchers.h"
8 #include "src/compiler/node-properties.h"
32 InstructionOperand UseOperand(Node* node, ImmediateMode mode) {
33 if (CanBeImmediate(node, mode)) {
34 return UseImmediate(node);
36 return UseRegister(node);
39 bool CanBeImmediate(Node* node, ImmediateMode mode) {
41 if (node->opcode() == IrOpcode::kInt32Constant
1700 Node* const node = value->InputAt(0); local
    [all...]
  /external/v8/src/compiler/mips/
instruction-selector-mips.cc 8 #include "src/compiler/node-matchers.h"
9 #include "src/compiler/node-properties.h"
27 InstructionOperand UseOperand(Node* node, InstructionCode opcode) {
28 if (CanBeImmediate(node, opcode)) {
29 return UseImmediate(node);
31 return UseRegister(node);
34 // Use the zero register if the node has the immediate value zero, otherwise
36 InstructionOperand UseRegisterOrImmediateZero(Node* node) {
1567 Node* const node = value->InputAt(0); local
    [all...]
  /device/google/marlin/camera/QCamera2/stack/common/
cam_queue.h 57 cam_node_t *node = local
59 if (NULL == node) {
63 memset(node, 0, sizeof(cam_node_t));
64 node->data = data;
67 cam_list_add_tail_node(&node->list, &queue->head.list);
76 cam_node_t *node = NULL; local
85 node = member_of(pos, cam_node_t, list);
86 cam_list_del_node(&node->list);
91 if (NULL != node) {
92 data = node->data
101 cam_node_t *node = NULL; local
    [all...]
  /external/libmojo/third_party/jinja2/
visitor.py 11 from jinja2.nodes import Node
16 node found. The visitor functions may return values which will be
20 class name of the node. So a `TryFinally` node visit function would
22 the `get_visitor` function. If no visitor function exists for a node
26 def get_visitor(self, node):
27 """Return the visitor function for this node or `None` if no visitor
28 exists for this node. In that case the generic visit function is
31 method = 'visit_' + node.__class__.__name__
34 def visit(self, node, *args, **kwargs)
    [all...]
  /external/selinux/libsemanage/include/semanage/
node_record.h 22 extern int semanage_node_compare(const semanage_node_t * node,
25 extern int semanage_node_compare2(const semanage_node_t * node,
34 const semanage_node_t * node,
41 const semanage_node_t * node, char **addr);
44 const semanage_node_t * node,
48 semanage_node_t * node,
52 semanage_node_t * node,
57 const semanage_node_t * node, char **mask);
60 const semanage_node_t * node,
64 semanage_node_t * node,
    [all...]
  /external/selinux/libsepol/include/sepol/
node_record.h 21 extern int sepol_node_compare(const sepol_node_t * node,
24 extern int sepol_node_compare2(const sepol_node_t * node,
37 const sepol_node_t * node,
44 const sepol_node_t * node, char **addr);
47 const sepol_node_t * node,
51 sepol_node_t * node,
55 sepol_node_t * node,
60 const sepol_node_t * node, char **mask);
63 const sepol_node_t * node,
67 sepol_node_t * node,
    [all...]
  /hardware/qcom/camera/msm8998/QCamera2/stack/common/
cam_queue.h 57 cam_node_t *node = local
59 if (NULL == node) {
63 memset(node, 0, sizeof(cam_node_t));
64 node->data = data;
67 cam_list_add_tail_node(&node->list, &queue->head.list);
76 cam_node_t *node = NULL; local
85 node = member_of(pos, cam_node_t, list);
86 cam_list_del_node(&node->list);
91 if (NULL != node) {
92 data = node->data
101 cam_node_t *node = NULL; local
    [all...]

Completed in 726 milliseconds

1 2 3 4 56 7 8 91011>>