| /cts/tests/tests/security/jni/ |
| android_security_cts_NativeCodeTest.cpp | 104 static jboolean parent(pid_t child) { function
126 ALOGE("parent: found writable at %x", addr);
163 return parent(pid);
|
| /cts/tests/tests/widget/src/android/widget/cts/ |
| RemoteViewsActivityTest.java | 54 ViewGroup parent = (ViewGroup) mActivity.findViewById(R.id.remoteView_host); local
56 View result = r.apply(mActivity, parent);
80 ViewGroup parent = (ViewGroup) mActivity.findViewById(R.id.remoteView_host); local
86 result = r.apply(mActivity, parent);
106 ViewGroup parent = (ViewGroup) mActivity.findViewById(R.id.remoteView_host); local
112 result = r.apply(mActivity, parent);
|
| /development/tools/idegen/src/com/android/idegen/ |
| DirectorySearch.java | 80 File parent = file.getParentFile(); local
81 if (parent == null) {
84 return findRepoRoot(parent);
|
| /device/generic/goldfish/camera/fake-pipeline2/ |
| JpegCompressor.h | 91 JpegCompressor *parent; member in struct:android::JpegCompressor::JpegError
96 JpegCompressor *parent; member in struct:android::JpegCompressor::JpegDestination
|
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3commontree.h | 69 pANTLR3_COMMON_TREE parent; member in struct:ANTLR3_COMMON_TREE_struct
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| CommonTree.cs | 40 * parent and child index is very difficult and cumbersome. Better to
59 /** <summary>Who is the parent node of this node; if null, implies node is root</summary> */
60 CommonTree parent; field in class:Antlr.Runtime.Tree.CommonTree
124 public override ITree Parent {
126 return parent;
129 parent = (CommonTree)value;
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| CommonTree.cs | 40 * parent and child index is very difficult and cumbersome. Better to
59 /** <summary>Who is the parent node of this node; if null, implies node is root</summary> */
60 CommonTree parent; field in class:Antlr.Runtime.Tree.CommonTree
149 public override ITree Parent
153 return parent;
158 parent = (CommonTree)value;
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| TreeIterator.java | 107 Object parent = adaptor.getParent(tree); local
109 while ( parent!=null &&
110 adaptor.getChildIndex(tree)+1 >= adaptor.getChildCount(parent) )
113 tree = parent;
114 parent = adaptor.getParent(tree);
117 if ( parent==null ) {
126 tree = adaptor.getChild(parent, nextSiblingIndex);
|
| /external/apache-xml/src/main/java/org/apache/xalan/processor/ |
| ProcessorCharacters.java | 85 ElemTemplateElement parent = handler.getElemTemplateElement(); local
87 parent.appendChild(elem);
|
| ProcessorExsltFunction.java | 178 ElemTemplateElement parent = child.getParentElem(); local
179 if (parent instanceof ElemExsltFuncResult
180 || parent instanceof ElemVariable
181 || parent instanceof ElemParam
182 || parent instanceof ElemMessage)
184 child = parent;
|
| ProcessorTemplateElem.java | 56 // ElemTemplateElement parent = handler.getElemTemplateElement();
103 ElemTemplateElement parent = handler.getElemTemplateElement(); local
104 if(null != parent) // defensive, for better multiple error reporting. -sb
106 parent.appendChild(elem);
|
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| DOM2Helper.java | 251 * Get the XPath-model parent of a node. This version takes advantage
254 * walking the document to find an Attr's parent.
258 * @return the DOM parent of the input node, if there is one, or the
264 Node parent=node.getParentNode(); local
265 if(parent==null && (Node.ATTRIBUTE_NODE == node.getNodeType()) )
266 parent=((Attr) node).getOwnerElement();
267 return parent;
|
| /external/apache-xml/src/main/java/org/apache/xpath/ |
| XPathException.java | 109 * Get the first non-Expression parent of this node.
114 ExpressionNode parent = ex.exprGetParent(); local
115 while((null != parent) && (parent instanceof Expression))
116 parent = parent.exprGetParent();
117 return parent;
|
| /external/blktrace/ |
| rbtree.c | 28 struct rb_node *parent = rb_parent(node); local
34 rb_set_parent(right, parent);
36 if (parent)
38 if (node == parent->rb_left)
39 parent->rb_left = right;
41 parent->rb_right = right;
51 struct rb_node *parent = rb_parent(node); local
57 rb_set_parent(left, parent);
59 if (parent)
61 if (node == parent->rb_right
73 struct rb_node *parent, *gparent; local
224 struct rb_node *child, *parent; local
318 struct rb_node *parent; local
346 struct rb_node *parent; local
371 struct rb_node *parent = rb_parent(victim); local
[all...] |
| /external/bzip2/ |
| huffman.c | 77 Int32 parent [ BZ_MAX_ALPHA_SIZE * 2 ]; local
89 parent[0] = -2;
92 parent[i] = -1;
104 parent[n1] = parent[n2] = nNodes;
106 parent[nNodes] = -1;
118 while (parent[k] >= 0) { k = parent[k]; j++; }
|
| /external/chromium/chrome/browser/ |
| fullscreen_linux.cc | 28 XID root, parent, *children; local
30 int status = XQueryTree(ui::GetXDisplay(), window, &root, &parent,
|
| /external/chromium/chrome/browser/ui/gtk/infobars/ |
| infobar_container_gtk.cc | 216 GtkWindow* parent = platform_util::GetTopLevel(widget()); local
218 BrowserWindowGtk::GetBrowserWindowForNativeWindow(parent);
|
| /external/chromium/third_party/libevent/ |
| min_heap.h | 90 unsigned parent = (e->min_heap_idx - 1) / 2; local
92 shift it upward if it is less than its parent, or downward if it is
94 to be less than the parent, it can't need to shift both up and
96 if (e->min_heap_idx > 0 && min_heap_elem_greater(s->p[parent], last))
124 unsigned parent = (hole_index - 1) / 2; local
125 while(hole_index && min_heap_elem_greater(s->p[parent], e))
127 (s->p[hole_index] = s->p[parent])->min_heap_idx = hole_index;
128 hole_index = parent;
129 parent = (hole_index - 1) / 2;
|
| /external/chromium/webkit/glue/ |
| webaccessibility.cc | 414 // unignored parent. For child nodes that are actually parented to
431 WebKit::WebAccessibilityObject parent = child.parentObject(); local
432 while (!parent.isNull() && parent.accessibilityIsIgnored())
433 parent = parent.parentObject();
434 return parent.equals(ancestor);
|
| /external/chromium_org/ash/wm/ |
| window_modality_controller_unittest.cc | 28 bool ValidateStacking(aura::Window* parent, int ids[], int count) {
30 if (parent->children().at(i)->id() != ids[i])
68 EXPECT_TRUE(ValidateStacking(w1->parent(), check1, arraysize(check1)));
72 // Transient children are always stacked above their transient parent, which
75 EXPECT_TRUE(ValidateStacking(w1->parent(), check2, arraysize(check2)));
115 EXPECT_TRUE(ValidateStacking(w1->parent(), check1, arraysize(check1)));
119 EXPECT_TRUE(ValidateStacking(w1->parent(), check1, arraysize(check1)));
123 EXPECT_TRUE(ValidateStacking(w1->parent(), check1, arraysize(check1)));
128 EXPECT_TRUE(ValidateStacking(w1->parent(), check2, arraysize(check2)));
180 // Modality also prevents events from being passed to the transient parent
371 aura::Window* parent = widget->GetNativeView(); local
431 aura::Window* parent = widget->GetNativeView(); local
[all...] |
| /external/chromium_org/chrome/browser/chromeos/policy/ |
| device_local_account_policy_service.h | 137 DeviceLocalAccountPolicyService* parent; member in struct:policy::DeviceLocalAccountPolicyService::PolicyBrokerWrapper
|
| /external/chromium_org/chrome/browser/component_updater/ |
| component_patcher_operation.cc | 74 const base::FilePath parent = output_abs_path_.DirName(); local
75 if (!base::DirectoryExists(parent)) {
76 if (!file_util::CreateDirectory(parent))
|
| /external/chromium_org/chrome/browser/extensions/ |
| lazy_background_page_apitest.cc | 362 const BookmarkNode* parent = bookmark_model->bookmark_bar_node(); local
364 parent, 0, ASCIIToUTF16("Title"), GURL("about:blank"));
|
| /external/chromium_org/chrome/browser/ |
| fullscreen_gtk.cc | 27 XID root, parent, *children; local
29 int status = XQueryTree(ui::GetXDisplay(), window, &root, &parent,
|
| /external/chromium_org/chrome/browser/history/android/ |
| bookmark_model_sql_handler.cc | 49 const BookmarkNode* parent = bookmark_model->GetNodeByID(parent_id); local
50 if (parent)
51 bookmark_model->AddURL(parent, 0, title, url);
62 const BookmarkNode* parent_node = (*i)->parent();
|
