| /external/chromium_org/third_party/libxml/src/ |
| xmlreader.c | 258 ID = xmlNodeListGetString(doc, attr->children, 1);
295 if (cur->children != NULL)
296 xmlTextReaderFreeNodeList(reader, cur->children);
314 * Free a property and all its siblings, all the children are freed too.
333 * the children are freed too.
356 if ((cur->children != NULL) &&
358 if (cur->children->parent == cur)
359 xmlTextReaderFreeNodeList(reader, cur->children);
360 cur->children = NULL;
410 * Free a node, this is a recursive behaviour, all the children are freed too
[all...] |
| check-relaxng-test-suite.py | 76 child = node.children
117 child = node.children
157 child = node.children
183 child = node.children
226 child = node.children
|
| check-relaxng-test-suite2.py | 65 child = node.children
118 child = node.children
171 child = node.children
197 child = node.children
240 child = node.children
|
| xinclude.c | 826 result = xmlXIncludeCopyNodeList(ctxt, target, source, elem->children);
879 cur = cur->children;
1017 cur = cur->children;
2101 xmlNodePtr children; local
[all...] |
| /external/libxml2/ |
| xmlreader.c | 258 ID = xmlNodeListGetString(doc, attr->children, 1);
295 if (cur->children != NULL)
296 xmlTextReaderFreeNodeList(reader, cur->children);
314 * Free a property and all its siblings, all the children are freed too.
333 * the children are freed too.
356 if ((cur->children != NULL) &&
358 if (cur->children->parent == cur)
359 xmlTextReaderFreeNodeList(reader, cur->children);
360 cur->children = NULL;
410 * Free a node, this is a recursive behaviour, all the children are freed too
[all...] |
| xinclude.c | 826 result = xmlXIncludeCopyNodeList(ctxt, target, source, elem->children);
879 cur = cur->children;
1017 cur = cur->children;
2101 xmlNodePtr children; local
[all...] |
| /external/chromium/webkit/glue/ |
| webkit_glue.cc | 225 const WebVector<WebHistoryItem>& children = item.children(); local
226 if (!children.isEmpty()) {
231 for (size_t i = 0; i < children.size(); ++i)
232 sorted_children.push_back(children[i]);
|
| /external/chromium_org/chrome/browser/extensions/ |
| context_menu_matcher.cc | 75 submenu_items = GetRelevantExtensionItems(item->children(),
218 MenuItem::List children = local
219 GetRelevantExtensionItems(item->children(), can_cross_incognito);
220 if (children.empty()) {
226 RecursivelyAppendExtensionItems(children, can_cross_incognito,
|
| /external/chromium_org/chrome/browser/safe_browsing/ |
| malware_details.cc | 131 const std::vector<GURL>* children) {
148 if (children) {
149 for (std::vector<GURL>::const_iterator it = children->begin();
150 it != children->end(); it++) {
249 AddUrl(node.url, node.parent, node.tag_name, &(node.children));
|
| /external/chromium_org/third_party/WebKit/Source/core/accessibility/ |
| AXTable.cpp | 337 // Go through all the available sections to pull out the rows and add them as children.
441 AccessibilityChildrenVector rowChildren = m_rows[row]->children();
480 AccessibilityChildrenVector children = m_rows[rowIndex]->children(); local
483 for (unsigned colIndexCounter = std::min(static_cast<unsigned>(children.size()), column + 1); colIndexCounter > 0; --colIndexCounter) {
485 AXObject* child = children[colIndex].get();
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| RevisionHistoryView.js | 85 for (var i = 0; i < this._treeOutline.children.length; ++i) {
86 if (this._treeOutline.children[i].title.localeCompare(uiSourceCode.displayName()) > 0) {
91 if (i === this._treeOutline.children.length)
136 if (uiSourceCodeItem.children.length)
137 uiSourceCodeItem.children[0].allowRevert();
|
| /external/llvm/include/llvm/Analysis/ |
| RegionInfo.h | 218 RegionSet children; member in class:llvm::Region
234 /// verifyRegionNest - Verify if the region and its children are valid
447 /// @param moveChildren Move the children of this region, that are also
483 iterator begin() { return children.begin(); }
484 iterator end() { return children.end(); }
486 const_iterator begin() const { return children.begin(); }
487 const_iterator end() const { return children.end(); }
512 // Mark the exit of the region as visited, so that the children of the
553 /// are direct children of this Region. It does not iterate over any
|
| /external/openfst/src/include/fst/extensions/ngram/ |
| ngram-fst.h | 565 const Label *children = root_children_; local
566 const Label *loc = lower_bound(children, children + root_num_children_,
568 if (loc == children + root_num_children_ || *loc != future) {
571 size_t node = root_first_child_ + loc - children;
579 children = context_words_ + context_index_.Rank1(first_child);
580 loc = lower_bound(children, children + last_child - first_child + 1,
582 if (loc == children + last_child - first_child + 1 ||
586 node = first_child + loc - children;
602 const Label *children = root_children_; local
[all...] |
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/ |
| ExpandableDictionary.java | 177 * @param children The node to recursively search for addition. Initially, the root of the tree.
186 private void addWordRec(final NodeArray children, final String word, final int depth,
192 // Does children have the current character?
193 final int childrenLength = children.mLength;
196 final Node node = children.mData[i];
208 children.add(childNode);
393 * @param roots node whose children have to be search for matches
428 final NodeArray children = node.mChildren; local
444 if (children != null) {
445 getWordsRec(children, codes, word, depth + 1, true, snr, inputIndex
[all...] |
| /external/chromium_org/content/browser/web_contents/ |
| web_contents_view_aura.cc | 743 const aura::Window::Windows& children = parent_->children(); local
744 for (size_t i = 0; i < children.size(); ++i)
745 children[i]->RemoveObserver(this);
751 const aura::Window::Windows& root_children = root_window->children();
760 // Constrained windows are added as children of the parent's parent's view
773 // Observe sibling windows of the WebContents, or children of the root
809 const aura::Window::Windows& children = parent_->children(); variable
810 for (size_t i = 0; i < children.size(); ++i
840 const aura::Window::Windows& children = parent->children(); variable
916 const aura::Window::Windows& children = parent_->children(); local
[all...] |
| /external/chromium_org/cc/layers/ |
| scrollbar_layer_unittest.cc | 64 LayerImpl* cc_child1 = layer_impl_tree_root->children()[0];
67 layer_impl_tree_root->children()[1]);
80 layer_impl_tree_root->children()[0]);
81 LayerImpl* cc_child2 = layer_impl_tree_root->children()[1];
95 layer_impl_tree_root->children()[1]);
110 layer_impl_tree_root->children()[1]);
145 layer_impl_tree_root->children()[1]);
204 root_layer_impl->children()[1]);
214 root_layer_impl->children()[1]);
224 root_layer_impl->children()[1])
[all...] |
| /external/chromium_org/v8/src/ |
| liveedit-debugger.js | 105 for (var i = 0; i < node.children.length; i++) {
106 CollectDamaged(node.children[i]);
115 CollectNew(node_list[i].children);
131 for (var i = 0; i < old_node.children.length; i++) {
132 HarvestTodo(old_node.children[i]);
257 // nested functions serialized as parent followed by serialized children.
295 // The recursive function, that goes over all children of a particular
336 for (var i = 0; i < old_node.children.length; i++) {
337 if (old_node.children[i].corresponding_node) {
339 old_node.children[i].corresponding_node.info
[all...] |
| /external/v8/src/ |
| liveedit-debugger.js | 93 for (var i = 0; i < node.children.length; i++) {
94 CollectDamaged(node.children[i]);
103 CollectNew(node_list[i].children);
119 for (var i = 0; i < old_node.children.length; i++) {
120 HarvestTodo(old_node.children[i]);
240 // nested functions serialized as parent followed by serialized children.
278 // The recursive function, that goes over all children of a particular
319 for (var i = 0; i < old_node.children.length; i++) {
320 if (old_node.children[i].corresponding_node) {
322 old_node.children[i].corresponding_node.info
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/refactoring/ |
| ChangeLayoutRefactoring.java | 189 // overlay children are replaced by their first element children
199 NodeList children = e.getChildNodes(); local
201 for (int i = 0, n = children.getLength(); i < n; i++) {
202 Node node = children.item(i);
289 // Layout attributes on children have already been removed as part of conversion
359 // conversion) and then convert all the children into <TableRow> elements.
364 NodeList children = layout.getChildNodes(); local
365 for (int i = 0, n = children.getLength(); i < n; i++) {
366 Node node = children.item(i)
411 NodeList children = layout.getChildNodes(); local
427 NodeList children = layout.getChildNodes(); local
529 NodeList children = layout.getChildNodes(); local
[all...] |
| /external/chromium_org/sync/syncable/ |
| directory.cc | 321 return; // Not a directory => no children.
326 return; // This directory has no children.
328 // Add our children to the list of items to be traversed.
1149 const OrderedChildSet* children = local
1163 const OrderedChildSet* children = local
1181 const OrderedChildSet* children = local
1283 const OrderedChildSet* children = local
[all...] |
| /external/valgrind/main/massif/ |
| ms_main.c | 79 // keeping XPt children sorted by 'ip' and use binary search in get_XCon.
551 // Children.
555 UInt n_children; // number of children
556 UInt max_children; // capacity of children array
557 XPt** children; // pointers to children XPts member in struct:_XPt
577 SXPt** children; member in struct:_SXPt::__anon30958::__anon30959
619 // Note that we cannot use perm_malloc for the 'children' array, because
626 // We don't initially allocate any space for children. We let that
628 // children anyway
[all...] |
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/lang/ |
| ThreadGroupTest.java | 178 assertEquals("Destroyed child can't have children", 0, child
463 assertTrue("Have to be parentOf all children", testRoot
565 ThreadGroup[] children = groups(current); local
566 assertEquals("Can only have 1 subgroup", 1, children.length);
567 current = children[0];
847 // No API to get the count of immediate children only ?
899 ThreadGroup[] children = groups(aGroup); local
900 for (ThreadGroup element : children) {
928 ThreadGroup[] children = groups(aGroup); local
930 for (ThreadGroup element : children) {
1036 ThreadGroup[] children = groups(aGroup); local
[all...] |
| /external/chromium/chrome/browser/extensions/ |
| extension_menu_manager_unittest.cc | 252 ASSERT_EQ(item3, item1->children()[0]);
257 ASSERT_EQ(item3, item2->children()[0]);
262 ASSERT_EQ(item2, item1->children()[0]);
264 ASSERT_EQ(item3, item2->children()[0]);
275 ASSERT_EQ(item2, item1->children()[0]);
276 ASSERT_EQ(item3, item1->children()[1]);
282 ASSERT_EQ(item2, item1->children()[0]);
283 ASSERT_EQ(item3, item1->children()[1]);
295 ASSERT_EQ(item3, item1->children()[0]);
|
| /external/chromium_org/cc/trees/ |
| layer_tree_impl.cc | 63 for (size_t i = 0; i < layer->children().size(); ++i) {
64 LayerImpl* found = FindRootScrollLayerRecursive(layer->children()[i]);
245 if (!root_scroll_layer_ || root_scroll_layer_->children().empty())
247 LayerImpl* layer = root_scroll_layer_->children()[0];
255 if (!root_scroll || !root_scroll->children().size())
440 if (!root_scroll_layer_ || root_scroll_layer_->children().empty())
442 return root_scroll_layer_->children()[0]->bounds();
468 for (size_t i = 0; i < layer->children().size(); ++i)
469 DidBecomeActiveRecursive(layer->children()[i]);
|
| /external/chromium_org/content/common/ |
| page_state_serialization.cc | 149 for (size_t i = 0; i < frame_state.children.size(); ++i) {
150 if (!RecursivelyAppendReferencedFiles(frame_state.children[i],
521 const std::vector<ExplodedFrameState>& children = state.children; local
522 WriteAndValidateVectorSize(children, obj);
523 for (size_t i = 0; i < children.size(); ++i)
524 WriteFrameState(children[i], obj, false);
601 state->children.resize(num_children);
603 ReadFrameState(obj, false, &state->children[i]);
|
