| /external/v8/src/compiler/ |
| instruction-selector-impl.h | 40 InstructionOperand DefineAsRegister(Node* node) {
41 return Define(node,
43 GetVReg(node)));
46 InstructionOperand DefineSameAsFirst(Node* node) {
47 return Define(node,
49 GetVReg(node)));
52 InstructionOperand DefineAsFixed(Node* node, Register reg)
[all...] |
| machine-operator-reducer.cc | 13 #include "src/compiler/node-matchers.h"
26 Node* MachineOperatorReducer::Float32Constant(volatile float value) {
31 Node* MachineOperatorReducer::Float64Constant(volatile double value) {
36 Node* MachineOperatorReducer::Int32Constant(int32_t value) {
41 Node* MachineOperatorReducer::Int64Constant(int64_t value) {
46 Node* MachineOperatorReducer::Word32And(Node* lhs, Node* rhs) {
47 Node* const node = graph()->NewNode(machine()->Word32And(), lhs, rhs) local
71 Node* const node = graph()->NewNode(machine()->Int32Add(), lhs, rhs); local
78 Node* const node = graph()->NewNode(machine()->Int32Sub(), lhs, rhs); local
[all...] |
| simplified-lowering.h | 10 #include "src/compiler/node.h"
35 // representation analysis is stored in the node bounds.
36 void DoLoadBuffer(Node* node, MachineRepresentation rep,
38 void DoStoreBuffer(Node* node);
39 void DoObjectIsNumber(Node* node);
40 void DoObjectIsSmi(Node* node);
[all...] |
| js-context-specialization.cc | 10 #include "src/compiler/node-matchers.h"
11 #include "src/compiler/node-properties.h"
19 Reduction JSContextSpecialization::Reduce(Node* node) {
20 switch (node->opcode()) {
22 return ReduceJSLoadContext(node);
24 return ReduceJSStoreContext(node);
33 Node* node) {
34 DCHECK(node->opcode() == IrOpcode::kJSLoadContext |
[all...] |
| /external/skia/src/xml/ |
| SkDOM.cpp | 17 bool SkXMLParser::parse(const SkDOM& dom, const SkDOMNode* node)
19 const char* elemName = dom.getName(node);
24 SkDOM::AttrIter iter(dom, node);
31 if ((node = dom.getFirstChild(node)) != nullptr)
33 if (!this->parse(dom, node))
35 } while ((node = dom.getNextSibling(node)) != nullptr);
77 const SkDOM::Node* SkDOM::getRootNode() const
82 const SkDOM::Node* SkDOM::getFirstChild(const Node* node, const char name[]) cons
221 SkDOM::Node* node = (SkDOM::Node*)fAlloc->alloc(sizeof(SkDOM::Node) + attrCount * sizeof(SkDOM::Attr), local
[all...] |
| /device/huawei/angler/camera/QCamera2/stack/common/ |
| cam_queue.h | 53 cam_node_t *node = local
55 if (NULL == node) {
59 memset(node, 0, sizeof(cam_node_t));
60 node->data = data;
63 cam_list_add_tail_node(&node->list, &queue->head.list);
72 cam_node_t *node = NULL; local
81 node = member_of(pos, cam_node_t, list);
82 cam_list_del_node(&node->list);
87 if (NULL != node) {
88 data = node->data
97 cam_node_t *node = NULL; local
[all...] |
| /device/lge/bullhead/camera/QCamera2/stack/common/ |
| cam_queue.h | 53 cam_node_t *node = local
55 if (NULL == node) {
59 memset(node, 0, sizeof(cam_node_t));
60 node->data = data;
63 cam_list_add_tail_node(&node->list, &queue->head.list);
72 cam_node_t *node = NULL; local
81 node = member_of(pos, cam_node_t, list);
82 cam_list_del_node(&node->list);
87 if (NULL != node) {
88 data = node->data
97 cam_node_t *node = NULL; local
[all...] |
| /device/moto/shamu/camera/QCamera2/stack/common/ |
| cam_queue.h | 55 cam_node_t *node = local
57 if (NULL == node) {
61 memset(node, 0, sizeof(cam_node_t));
62 node->data = data;
65 cam_list_add_tail_node(&node->list, &queue->head.list);
74 cam_node_t *node = NULL; local
83 node = member_of(pos, cam_node_t, list);
84 cam_list_del_node(&node->list);
89 if (NULL != node) {
90 data = node->data
99 cam_node_t *node = NULL; local
[all...] |
| /external/opencv3/3rdparty/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 | 20 extern int sepol_node_compare(const sepol_node_t * node,
23 extern int sepol_node_compare2(const sepol_node_t * node,
36 const sepol_node_t * node,
43 const sepol_node_t * node, char **addr);
46 const sepol_node_t * node,
50 sepol_node_t * node,
54 sepol_node_t * node,
59 const sepol_node_t * node, char **mask);
62 const sepol_node_t * node,
66 sepol_node_t * node,
[all...] |
| /hardware/qcom/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...] |
| /hardware/intel/img/psb_video/src/ |
| psb_ws_driver.c | 51 struct _ValidateNode *node = malloc(sizeof(*node)); local
53 if (node == NULL) return NULL;
55 node->func = func;
56 node->type_id = 1;
57 return node;
62 * Free an allocated validate list node.
66 psb_free(struct _ValidateNode *node)
68 if (node->type_id == 0)
69 free(containerOf(node, struct _PsbDrmValidateNode, base))
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/util/ |
| LinkedNode.java | 28 public void insert(LinkedNode node) {
29 node.mNext = mNext;
30 mNext.mPrev = node;
31 node.mPrev = this;
32 mNext = node;
46 public void insertLast(T node) {
47 mHead.mPrev.insert(node);
58 public T nextOf(T node) {
59 return (T) (node.mNext == mHead ? null : node.mNext)
[all...] |
| /external/chromium-trace/catapult/telemetry/third_party/modulegraph/modulegraph_tests/ |
| test_implies.py | 21 node = mg.findNode('mod')
22 self.assertIsInstance(node, modulegraph.SourceModule)
24 node = mg.findNode('syslog')
25 self.assertEqual(node, None)
31 self.assertEqual(node, None)
33 node = mg.findNode('mod')
34 self.assertIsInstance(node, modulegraph.SourceModule)
36 node = mg.findNode('syslog')
37 self.assertIsInstance(node, modulegraph.Extension)
40 self.assertTrue(mg.findNode('mod') in mg.get_edges(node)[1]
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/compiler/ |
| visitor.py | 15 tree: an instance of ast.Node
19 correct order. For each node, it checks the visitor argument for
21 node's class, e.g. Class. If the method exists, it is called
22 with the node as its sole argument.
24 The visitor method for a particular node type can control how
29 be used to visit a child node of arbitrary type.
35 self.node = None
38 def default(self, node, *args):
39 for child in node.getChildNodes():
42 def dispatch(self, node, *args)
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/lib2to3/fixes/ |
| fix_operator.py | 41 def transform(self, node, results):
42 method = self._check_method(node, results)
44 return method(node, results)
47 def _sequenceIncludes(self, node, results):
48 return self._handle_rename(node, results, u"contains")
51 def _isCallable(self, node, results):
54 return Call(Name(u"hasattr"), args, prefix=node.prefix)
57 def _repeat(self, node, results):
58 return self._handle_rename(node, results, u"mul")
61 def _irepeat(self, node, results)
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/compiler/ |
| visitor.py | 15 tree: an instance of ast.Node
19 correct order. For each node, it checks the visitor argument for
21 node's class, e.g. Class. If the method exists, it is called
22 with the node as its sole argument.
24 The visitor method for a particular node type can control how
29 be used to visit a child node of arbitrary type.
35 self.node = None
38 def default(self, node, *args):
39 for child in node.getChildNodes():
42 def dispatch(self, node, *args)
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/lib2to3/fixes/ |
| fix_operator.py | 41 def transform(self, node, results):
42 method = self._check_method(node, results)
44 return method(node, results)
47 def _sequenceIncludes(self, node, results):
48 return self._handle_rename(node, results, u"contains")
51 def _isCallable(self, node, results):
54 return Call(Name(u"hasattr"), args, prefix=node.prefix)
57 def _repeat(self, node, results):
58 return self._handle_rename(node, results, u"mul")
61 def _irepeat(self, node, results)
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/ |
| visitor.py | 15 tree: an instance of ast.Node
19 correct order. For each node, it checks the visitor argument for
21 node's class, e.g. Class. If the method exists, it is called
22 with the node as its sole argument.
24 The visitor method for a particular node type can control how
29 be used to visit a child node of arbitrary type.
35 self.node = None
38 def default(self, node, *args):
39 for child in node.getChildNodes():
42 def dispatch(self, node, *args)
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_operator.py | 41 def transform(self, node, results):
42 method = self._check_method(node, results)
44 return method(node, results)
47 def _sequenceIncludes(self, node, results):
48 return self._handle_rename(node, results, u"contains")
51 def _isCallable(self, node, results):
54 return Call(Name(u"hasattr"), args, prefix=node.prefix)
57 def _repeat(self, node, results):
58 return self._handle_rename(node, results, u"mul")
61 def _irepeat(self, node, results)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
| visitor.py | 15 tree: an instance of ast.Node
19 correct order. For each node, it checks the visitor argument for
21 node's class, e.g. Class. If the method exists, it is called
22 with the node as its sole argument.
24 The visitor method for a particular node type can control how
29 be used to visit a child node of arbitrary type.
35 self.node = None
38 def default(self, node, *args):
39 for child in node.getChildNodes():
42 def dispatch(self, node, *args)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_operator.py | 41 def transform(self, node, results):
42 method = self._check_method(node, results)
44 return method(node, results)
47 def _sequenceIncludes(self, node, results):
48 return self._handle_rename(node, results, u"contains")
51 def _isCallable(self, node, results):
54 return Call(Name(u"hasattr"), args, prefix=node.prefix)
57 def _repeat(self, node, results):
58 return self._handle_rename(node, results, u"mul")
61 def _irepeat(self, node, results)
[all...] |
| /frameworks/rs/ |
| rsMap.h | 57 LinkNode* node = bucket[index]; local
60 while (node != nullptr) {
61 if (node->entry.first == key) {
62 return node->entry.second;
64 prev = node;
65 node = node->next;
68 node = new LinkNode();
69 node->entry.first = key;
70 node->next = nullptr
122 LinkNode* node; member in class:android::renderscript::Map::iterator
128 LinkNode* node = bucket[i]; local
145 LinkNode* node = bucket[index]; local
[all...] |
| /frameworks/base/tools/aapt2/java/ |
| ProguardRules.cpp | 34 virtual void visit(xml::Namespace* node) override {
35 for (const auto& child : node->children) {
40 virtual void visit(xml::Element* node) override {
41 if (!node->namespaceUri.empty()) {
43 node->namespaceUri);
46 std::u16string package = maybePackage.value().package + u"." + node->name;
48 addClass(node->lineNumber, package);
51 } else if (util::isJavaClassName(node->name)) {
52 addClass(node->lineNumber, node->name)
[all...] |
