| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/tests/data/fixers/myfixes/ |
| fix_last.py | 7 def match(self, node): return False
|
| fix_preorder.py | 6 def match(self, node): return False
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/ |
| EditTextRule.java | 40 public void onCreate(@NonNull INode node, @NonNull INode parent,
42 super.onCreate(node, parent, insertType);
48 node.appendChild(REQUEST_FOCUS);
52 node.setAttribute(ANDROID_URI, ATTR_EMS, "10"); //$NON-NLS-1$
79 public void handle(@NonNull INode node) {
80 INode focus = findFocus(findRoot(node));
85 node.appendChild(REQUEST_FOCUS);
97 /** Returns true if the given node currently has focus */
98 private static boolean hasFocus(INode node) {
99 INode focus = findFocus(node);
[all...] |
| /external/libdrm/amdgpu/ |
| util_hash.c | 105 static void util_free_node(struct util_node *node)
107 free(node);
115 struct util_node *node = util_data_allocate_node(hash->data.d); local
117 if (!node)
120 node->key = akey;
121 node->value = avalue;
123 node->next = (struct util_node*)(*anextNode);
124 *anextNode = node;
126 return node;
208 struct util_node **node; local
228 struct util_node *node = util_hash_create_node(hash, key, data, nextNode); local
350 struct util_node **node = util_hash_find_node(hash, akey); local
373 struct util_node *node = iter.node; local
[all...] |
| /external/selinux/libsepol/cil/src/ |
| cil_verify.c | 371 int __cil_verify_ordered_node_helper(struct cil_tree_node *node, __attribute__((unused)) uint32_t *finished, void *extra_args)
376 if (node->flavor == *flavor) {
377 if (node->flavor == CIL_SID) {
378 struct cil_sid *sid = node->data;
380 cil_log(CIL_ERR, "SID %s not in sidorder statement at line %d of %s\n", sid->datum.name, node->line, node->path);
383 } else if (node->flavor == CIL_CLASS) {
384 struct cil_class *class = node->data;
386 cil_log(CIL_ERR, "Class %s not in classorder statement at line %d of %s\n", class->datum.name, node->line, node->path)
432 struct cil_tree_node *node = sid->datum.nodes->head->data; local
1569 struct cil_tree_node *node; member in struct:cil_verify_map_args
[all...] |
| /external/selinux/libsepol/src/ |
| node_record.c | 265 ERR(handle, "could not create node key for (%s, %s, %s)",
284 const sepol_node_t * node,
293 tmp_key->addr = malloc(node->addr_sz);
294 tmp_key->mask = malloc(node->mask_sz);
299 memcpy(tmp_key->addr, node->addr, node->addr_sz);
300 memcpy(tmp_key->mask, node->mask, node->mask_sz);
301 tmp_key->addr_sz = node->addr_sz;
302 tmp_key->mask_sz = node->mask_sz
[all...] |
| /external/libxml2/ |
| debugXML.c | 46 xmlNodePtr node; /* current node */ member in struct:_xmlDebugCtxt
54 static void xmlCtxtDumpNodeList(xmlDebugCtxtPtr ctxt, xmlNodePtr node);
66 ctxt->node = NULL;
83 * @node: the node
84 * @ns: the namespace node
86 * Check that a given namespace is in scope on a node.
90 * an ancestor node.
93 xmlNsCheckScope(xmlNodePtr node, xmlNsPtr ns
2687 xmlNodePtr node; local
[all...] |
| /external/v8/src/compiler/ |
| common-operator-reducer.cc | 12 #include "src/compiler/node.h"
13 #include "src/compiler/node-matchers.h"
14 #include "src/compiler/node-properties.h"
22 Decision DecideCondition(Node* const cond) {
50 Reduction CommonOperatorReducer::Reduce(Node* node) {
51 switch (node->opcode()) {
53 return ReduceBranch(node);
56 return ReduceDeoptimizeConditional(node);
58 return ReduceMerge(node);
[all...] |
| verifier.cc | 17 #include "src/compiler/node.h"
18 #include "src/compiler/node-properties.h"
31 static bool IsDefUseChainLinkPresent(Node* def, Node* use) {
32 const Node::Uses uses = def->uses();
37 static bool IsUseDefChainLinkPresent(Node* def, Node* use) {
38 const Node::Inputs inputs = use->inputs();
48 void Check(Node* node);
1185 Node* node = proj->InputAt(0); local
1428 Node* node = block->NodeAt(i); local
[all...] |
| /external/chromium-trace/catapult/devil/devil/android/ |
| app_ui_test.py | 22 <node bounds="[0,50][1536,178]" content-desc="Loading"
31 <node bounds="[0,50][1536,178]" content-desc=""
33 <node bounds="[0,58][112,170]" content-desc="Open navigation drawer"/>
34 <node bounds="[121,50][1536,178]"
36 <node bounds="[121,50][1424,178]"
38 <node bounds="[1424,50][1536,178]" content-desc="Search"
40 </node>
41 </node>
42 <node bounds="[0,178][576,1952]" resource-id="com.example.app:id/drawer">
43 <node bounds="[0,178][144,1952]
[all...] |
| /external/droiddriver/src/io/appium/droiddriver/uiautomation/ |
| UiAutomationElement.java | 54 private final AccessibilityNodeInfo node; field in class:UiAutomationElement
69 protected UiAutomationElement(UiAutomationContext context, AccessibilityNodeInfo node,
71 this.node = Preconditions.checkNotNull(node);
76 put(attribs, Attribute.PACKAGE, charSequenceToString(node.getPackageName()));
77 put(attribs, Attribute.CLASS, charSequenceToString(node.getClassName()));
78 put(attribs, Attribute.TEXT, charSequenceToString(node.getText()));
79 put(attribs, Attribute.CONTENT_DESC, charSequenceToString(node.getContentDescription()));
80 put(attribs, Attribute.RESOURCE_ID, charSequenceToString(node.getViewIdResourceName()));
81 put(attribs, Attribute.CHECKABLE, node.isCheckable())
[all...] |
| /external/jemalloc/include/jemalloc/internal/ |
| rb.h | 6 * bit of right-child pointers (if RB_COMPACT is defined), thus making node
26 /* Node structure. */
82 /* Node initializer. */
84 /* Bookkeeping bit cannot be used by node pointer. */ \
111 /* Node initializer. */
173 a_prefix##next(a_rbt_type *rbtree, a_type *node); \
175 a_prefix##prev(a_rbt_type *rbtree, a_type *node); \
183 a_prefix##insert(a_rbt_type *rbtree, a_type *node); \
185 a_prefix##remove(a_rbt_type *rbtree, a_type *node); \
205 * a_type : Type for red-black tree node data structure (ex: ex_node_t)
[all...] |
| /toolchain/binutils/binutils-2.25/gold/ |
| arm-reloc-property.cc | 40 // Parse an S-expression S and build a tree and return the root node.
58 // Remember the node stack position for start of a new internal node.
63 // children to build a new internal node. Push internal node back.
67 Tree_node* node = local
71 node_stack.push_back(node);
74 // Just push a leaf node to node_stack.
83 // contain the root node.
165 Tree_node* node = root_node local
[all...] |
| /frameworks/base/core/java/android/animation/ |
| AnimatorSet.java | 74 * to a single node representing that Animator, not create a new Node
77 private ArrayMap<Animator, Node> mNodeMap = new ArrayMap<Animator, Node>();
84 private ArrayList<Node> mNodes = new ArrayList<Node>();
123 private Node mRootNode = new Node(mDelayAnim);
248 Node node = mNodes.get(i) local
267 Node node = mNodes.get(i); local
415 Node node = mNodeMap.get(anim); local
442 Node node = mNodes.get(i); local
492 Node node = mNodes.get(i); local
545 Node node = mNodes.get(i); local
556 Node node = mNodes.get(i); local
574 Node node = mNodes.get(i); local
594 Node node = mNodes.get(i); local
619 Node node = mNodes.get(i); local
626 Node node = mNodes.get(i); local
665 Node node = mNodes.get(i); local
706 final Node node = mNodes.get(n); local
730 Node node = mNodes.get(i); local
851 Node node = mNodes.get(i); local
867 Node node = mNodes.get(i); local
878 Node node = mNodes.get(i); local
894 Node node = list.get(index); local
935 Node node = mNodes.get(i); local
964 Node node = mNodes.get(i); local
979 Node node = mNodes.get(i); local
1001 Node node = mNodes.get(i); local
1086 Node node = mNodeMap.get(anim); local
1159 Node node = (Node) super.clone(); local
1298 Node node = getNodeForAnimation(anim); local
1313 Node node = getNodeForAnimation(anim); local
1328 Node node = getNodeForAnimation(anim); local
[all...] |
| /external/bison/src/ |
| symlist.c | 132 | Prepend NODE to the LIST. |
136 symbol_list_prepend (symbol_list *list, symbol_list *node)
138 node->next = list;
139 return node;
150 symbol_list *node, *next; local
151 for (node = list; node; node = next)
153 next = node->next;
154 named_ref_free (node->named_ref)
[all...] |
| /external/chromium-trace/catapult/third_party/vinn/vinn/ |
| html_to_js_generator.js | 51 startLocation(node) {
52 if (!node.__location)
54 return node.__location.start;
57 startLineNumber(node) {
58 if (!node.__location)
61 this.html_text_.substring(0, node.__location.start)) + 1;
64 startLocationOfContent(node) {
65 if (!node.__location || !node.__location.startTag)
67 return node.__location.startTag.end
[all...] |
| /external/wpa_supplicant_8/src/utils/ |
| xml-utils.h | 18 int xml_validate(struct xml_node_ctx *ctx, xml_node_t *node,
20 int xml_validate_dtd(struct xml_node_ctx *ctx, xml_node_t *node,
22 void xml_node_free(struct xml_node_ctx *ctx, xml_node_t *node);
23 xml_node_t * xml_node_get_parent(struct xml_node_ctx *ctx, xml_node_t *node);
26 xml_node_t *node);
27 char * xml_node_to_str(struct xml_node_ctx *ctx, xml_node_t *node);
28 void xml_node_detach(struct xml_node_ctx *ctx, xml_node_t *node);
42 void xml_node_set_text(struct xml_node_ctx *ctx, xml_node_t *node,
44 int xml_node_add_attr(struct xml_node_ctx *ctx, xml_node_t *node,
46 char * xml_node_get_attr_value(struct xml_node_ctx *ctx, xml_node_t *node,
[all...] |
| /frameworks/base/cmds/uiautomator/library/core-src/com/android/uiautomator/core/ |
| UiObject.java | 151 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
152 if(node == null) {
155 return node.getChildCount();
167 AccessibilityNodeInfo node = null; local
171 node = getQueryController().findAccessibilityNodeInfo(getSelector());
172 if (node != null) {
183 return node;
335 * @param node
336 * @return null if node is null, else a Rect containing visible bounds
338 private Rect getVisibleBounds(AccessibilityNodeInfo node) {
397 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
437 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
455 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
472 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
489 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
506 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
523 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
540 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
558 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
576 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
628 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
652 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
668 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
684 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
700 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
716 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
732 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
748 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
764 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
780 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
796 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
816 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
832 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
932 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
970 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
[all...] |
| /frameworks/support/design/src/android/support/design/widget/ |
| DirectedAcyclicGraph.java | 39 * Add a node to the graph.
41 * <p>If the node already exists in the graph then this method is a no-op.</p>
43 * @param node the node to add
45 void addNode(@NonNull T node) {
46 if (!mGraph.containsKey(node)) {
47 mGraph.put(node, null);
52 * Returns true if the node is already present in the graph, false otherwise.
54 boolean contains(@NonNull T node) {
55 return mGraph.containsKey(node);
[all...] |
| /external/libweave/src/notification/ |
| xml_node_unittest.cc | 50 static const XmlNode* GetParent(const XmlNode& node) { return node.parent_; }
52 static void SetText(XmlNode* node, const std::string& text) {
53 node->SetText(text);
56 static void AppendText(XmlNode* node, const std::string& text) {
57 node->AppendText(text);
111 XmlNode new_node{"node", {}};
117 const XmlNode* node = node_->FindFirstChild("node3", false); local
118 ASSERT_NE(nullptr, node);
119 EXPECT_EQ("node3", node->name())
133 const XmlNode* node = node_->FindFirstChild("node2\/node3", false); local
[all...] |
| /external/mesa3d/src/gallium/tools/trace/ |
| model.py | 43 class Node:
56 class Literal(Node):
65 class NamedConstant(Node):
74 class Array(Node):
83 class Struct(Node):
93 class Pointer(Node):
126 def visit_literal(self, node):
129 def visit_named_constant(self, node):
132 def visit_array(self, node):
135 def visit_struct(self, node)
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| rbtree.h | 56 struct rb_node * node)
75 rb_link_node(node, parent, p);
82 struct rb_node * node)
85 if ((ret = __rb_insert_page_cache(inode, offset, node)))
87 rb_insert_color(node, &inode->i_rb_page_cache);
146 #define EXT2FS_RB_EMPTY_NODE(node) (ext2fs_rb_parent(node) == node)
147 #define EXT2FS_RB_CLEAR_NODE(node) (ext2fs_rb_set_parent(node, node)
[all...] |
| /external/jemalloc/src/ |
| huge.c | 9 extent_node_t *node; local
11 node = chunk_lookup(ptr, true);
12 assert(!extent_node_achunk_get(node));
14 return (node);
18 huge_node_set(const void *ptr, extent_node_t *node)
21 assert(extent_node_addr_get(node) == ptr);
22 assert(!extent_node_achunk_get(node));
23 return (chunk_register(ptr, node));
27 huge_node_unset(const void *ptr, const extent_node_t *node)
30 chunk_deregister(ptr, node);
49 extent_node_t *node; local
140 extent_node_t *node; local
197 extent_node_t *node; local
246 extent_node_t *node; local
383 extent_node_t *node; local
413 extent_node_t *node; local
429 extent_node_t *node; local
444 extent_node_t *node; local
[all...] |
| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/cache/ |
| ftcmanag.c | 80 FTC_MruNodeRec node; member in struct:FTC_SizeNodeRec_
93 FTC_SizeNode node = (FTC_SizeNode)ftcnode; local
94 FT_Size size = node->size;
107 FTC_SizeNode node = (FTC_SizeNode)ftcnode; local
109 FTC_Scaler scaler0 = &node->scaler;
114 FT_Activate_Size( node->size );
126 FTC_SizeNode node = (FTC_SizeNode)ftcnode; local
131 node->scaler = scaler[0];
133 return ftc_scaler_lookup_size( manager, scaler, &node->size );
142 FTC_SizeNode node = (FTC_SizeNode)ftcnode local
171 FTC_SizeNode node = (FTC_SizeNode)ftcnode; local
224 FTC_MruNodeRec node; member in struct:FTC_FaceNodeRec_
238 FTC_FaceNode node = (FTC_FaceNode)ftcnode; local
265 FTC_FaceNode node = (FTC_FaceNode)ftcnode; local
286 FTC_FaceNode node = (FTC_FaceNode)ftcnode; local
473 FTC_Node node, first; local
539 FTC_Node node, first; local
635 FTC_Node node; local
[all...] |
| /external/clang/bindings/python/examples/cindex/ |
| cindex-dump.py | 39 def get_info(node, depth=0):
44 for c in node.get_children()]
45 return { 'id' : get_cursor_id(node),
46 'kind' : node.kind,
47 'usr' : node.get_usr(),
48 'spelling' : node.spelling,
49 'location' : node.location,
50 'extent.start' : node.extent.start,
51 'extent.end' : node.extent.end,
52 'is_definition' : node.is_definition()
[all...] |
