| /external/oj-libjdwp/src/share/back/ |
| eventFilter.h | 33 jvmtiError eventFilter_setConditionalFilter(HandlerNode *node,
35 jvmtiError eventFilter_setCountFilter(HandlerNode *node,
37 jvmtiError eventFilter_setThreadOnlyFilter(HandlerNode *node,
39 jvmtiError eventFilter_setLocationOnlyFilter(HandlerNode *node,
44 jvmtiError eventFilter_setFieldOnlyFilter(HandlerNode *node,
48 jvmtiError eventFilter_setClassOnlyFilter(HandlerNode *node,
51 jvmtiError eventFilter_setExceptionOnlyFilter(HandlerNode *node,
56 jvmtiError eventFilter_setInstanceOnlyFilter(HandlerNode *node,
59 jvmtiError eventFilter_setClassMatchFilter(HandlerNode *node,
62 jvmtiError eventFilter_setClassExcludeFilter(HandlerNode *node,
[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...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/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...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/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...] |
| /external/libxkbcommon/xkbcommon/src/ |
| atom.c | 107 struct atom_node *node; local
112 darray_foreach(node, table->table)
113 free(node->string);
141 struct atom_node *node = &darray_item(table->table, *atomp); local
143 if (fingerprint < node->fingerprint) {
144 atomp = &node->left;
146 else if (fingerprint > node->fingerprint) {
147 atomp = &node->right;
151 const int cmp = strncmp(string, node->string, len);
152 if (cmp < 0 || (cmp == 0 && len < strlen(node->string)))
196 struct atom_node node; local
[all...] |
| /external/python/cpython2/Lib/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...] |
| /external/python/cpython2/Lib/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...] |
| /external/python/cpython3/Lib/lib2to3/fixes/ |
| fix_operator.py | 43 def transform(self, node, results):
44 method = self._check_method(node, results)
46 return method(node, results)
49 def _sequenceIncludes(self, node, results):
50 return self._handle_rename(node, results, "contains")
53 def _isCallable(self, node, results):
56 return Call(Name("hasattr"), args, prefix=node.prefix)
59 def _repeat(self, node, results):
60 return self._handle_rename(node, results, "mul")
63 def _irepeat(self, node, results)
[all...] |
| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| model_pruner.cc | 29 bool IsTrivialOp(const NodeDef& node, const GraphRewriter& rewriter) {
32 if (IsStopGradient(node)) {
35 if (IsIdentity(node)) {
36 if (rewriter.FeedsMerge(node) || rewriter.IsDrivenBySwitch(node) ||
37 rewriter.IsDrivenByControlDependency(node) ||
38 rewriter.DrivesControlDependency(node)) {
44 if (IsAddN(node) && NumNonControlInputs(node) <= 1) {
56 // the fanin of a fetch node. If fetch nodes aren't specified, we'll assum
[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...] |
| /external/jemalloc/src/ |
| base.c | 20 extent_node_t *node; local
26 node = base_nodes;
27 base_nodes = *(extent_node_t **)node;
28 JEMALLOC_VALGRIND_MAKE_MEM_UNDEFINED(node, sizeof(extent_node_t));
29 return (node);
33 base_node_dalloc(tsdn_t *tsdn, extent_node_t *node)
38 JEMALLOC_VALGRIND_MAKE_MEM_UNDEFINED(node, sizeof(extent_node_t));
39 *(extent_node_t **)node = base_nodes;
40 base_nodes = node;
44 base_extent_node_init(extent_node_t *node, void *addr, size_t size
54 extent_node_t *node; local
94 extent_node_t *node; local
[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...] |
| /external/dtc/ |
| livetree.c | 100 struct node *build_node(struct property *proplist, struct node *children)
102 struct node *new = xmalloc(sizeof(*new));
103 struct node *child;
117 struct node *build_node_delete(void)
119 struct node *new = xmalloc(sizeof(*new));
128 struct node *name_node(struct node *node, char *name)
130 assert(node->name == NULL)
222 struct node *node; local
297 struct node *node = parent->children; local
515 struct node *child, *node; local
535 struct node *child, *node; local
758 struct node *node; local
[all...] |
| /external/skia/src/xml/ |
| SkDOM.cpp | 14 bool SkXMLParser::parse(const SkDOM& dom, const SkDOMNode* node) {
15 const char* elemName = dom.getName(node);
21 SkDOM::AttrIter iter(dom, node);
30 if ((node = dom.getFirstChild(node)) != nullptr) {
32 if (!this->parse(dom, node)) {
35 } while ((node = dom.getNextSibling(node)) != nullptr);
73 const SkDOM::Node* SkDOM::getRootNode() const {
77 const SkDOM::Node* SkDOM::getFirstChild(const Node* node, const char name[]) const
205 SkDOM::Node* node = fAlloc->make<SkDOM::Node>(); local
[all...] |
| /external/skqp/src/xml/ |
| SkDOM.cpp | 14 bool SkXMLParser::parse(const SkDOM& dom, const SkDOMNode* node) {
15 const char* elemName = dom.getName(node);
21 SkDOM::AttrIter iter(dom, node);
30 if ((node = dom.getFirstChild(node)) != nullptr) {
32 if (!this->parse(dom, node)) {
35 } while ((node = dom.getNextSibling(node)) != nullptr);
73 const SkDOM::Node* SkDOM::getRootNode() const {
77 const SkDOM::Node* SkDOM::getFirstChild(const Node* node, const char name[]) const
205 SkDOM::Node* node = fAlloc->make<SkDOM::Node>(); local
[all...] |
| /external/tensorflow/tensorflow/contrib/py2tf/converters/ |
| call_trees.py | 77 def _resolve_name(self, node):
78 if isinstance(node, gast.Call):
79 return self._resolve_name(node.func)
80 if isinstance(node, gast.Name):
81 return self.context.namespace.get(node.id)
82 if isinstance(node, gast.Attribute):
83 parent = self._resolve_name(node.value)
85 return getattr(parent, node.attr)
87 raise ValueError(node)
89 def _try_resolve_target(self, node)
[all...] |
| /external/v8/src/compiler/ |
| redundancy-elimination.cc | 7 #include "src/compiler/node-properties.h"
18 Reduction RedundancyElimination::Reduce(Node* node) {
19 if (node_checks_.Get(node)) return NoChange();
20 switch (node->opcode()) {
41 return ReduceCheckNode(node);
46 return TryReuseBoundsCheckForFirstInput(node);
48 return ReduceEffectPhi(node);
52 return ReduceStart(node);
54 return ReduceOtherNode(node);
[all...] |
