next 113 android_webview/java/src/org/chromium/android_webview/AwResource.java result = new Scanner(isr).useDelimiter("\\A").next(); next 191 android_webview/test/shell/src/org/chromium/android_webview/shell/AwShellActivity.java mNextButton = (ImageButton) findViewById(R.id.next); next 155 base/android/javatests/src/org/chromium/base/ObserverListTest.java assertTrue(5 == it.next()); next 157 base/android/javatests/src/org/chromium/base/ObserverListTest.java assertTrue(15 == it.next()); next 172 base/android/javatests/src/org/chromium/base/ObserverListTest.java it.next(); next 191 base/android/javatests/src/org/chromium/base/ObserverListTest.java assertTrue(5 == it.next()); next 193 base/android/javatests/src/org/chromium/base/ObserverListTest.java assertTrue(10 == it.next()); next 195 base/android/javatests/src/org/chromium/base/ObserverListTest.java assertTrue(15 == it.next()); next 201 base/android/javatests/src/org/chromium/base/ObserverListTest.java assertTrue(5 == it.next()); next 203 base/android/javatests/src/org/chromium/base/ObserverListTest.java assertTrue(10 == it.next()); next 205 base/android/javatests/src/org/chromium/base/ObserverListTest.java assertTrue(15 == it.next()); next 214 base/android/javatests/src/org/chromium/base/ObserverListTest.java assertTrue(10 == it.next()); next 216 base/android/javatests/src/org/chromium/base/ObserverListTest.java assertTrue(15 == it.next()); next 242 base/android/jni_generator/java/src/org/chromium/example/jni_generator/SampleForTests.java InnerStructA element = it.next(); next 277 base/android/jni_generator/java/src/org/chromium/example/jni_generator/SampleForTests.java InnerStructB element = it.next(); next 86 base/containers/linked_list.h LinkNode(LinkNode<T>* previous, LinkNode<T>* next) next 87 base/containers/linked_list.h : previous_(previous), next_(next) {} next 115 base/containers/linked_list.h LinkNode<T>* next() const { next 147 base/containers/linked_list.h return root_.next(); next 42 base/containers/linked_list_unittest.cc node = (forward ? node->next() : node->previous())) { next 95 base/containers/mru_cache_unittest.cc Cache::reverse_iterator next = cache.Erase(cache.rbegin()); next 99 base/containers/mru_cache_unittest.cc EXPECT_TRUE(next == cache.rbegin()); next 100 base/containers/mru_cache_unittest.cc EXPECT_EQ(kItem1Key, next->first); next 101 base/containers/mru_cache_unittest.cc EXPECT_EQ(item1.value, next->second.value); next 87 base/debug/leak_tracker.h node = node->next()) { next 115 base/debug/leak_tracker.h node = node->next()) { next 64 base/i18n/streaming_utf8_validator_perftest.cc std::string next = previous; next 69 base/i18n/streaming_utf8_validator_perftest.cc if (i > 0 && next[i] == '\xbf') { next 70 base/i18n/streaming_utf8_validator_perftest.cc next[i] = '\x80'; next 73 base/i18n/streaming_utf8_validator_perftest.cc ++next[i]; next 76 base/i18n/streaming_utf8_validator_perftest.cc DCHECK(StreamingUtf8Validator::Validate(next)) next 77 base/i18n/streaming_utf8_validator_perftest.cc << "Result \"" << next << "\" failed validation"; next 78 base/i18n/streaming_utf8_validator_perftest.cc return next; next 170 base/metrics/histogram.cc Sample next; next 171 base/metrics/histogram.cc next = static_cast<int>(floor(exp(log_next) + 0.5)); next 172 base/metrics/histogram.cc if (next > current) next 173 base/metrics/histogram.cc current = next; next 46 base/path_service.cc struct Provider* next; next 135 base/path_service.cc Provider* next = p->next; next 138 base/path_service.cc p = next; next 213 base/path_service.cc provider = provider->next; next 320 base/path_service.cc iter = iter->next; next 324 base/path_service.cc p->next = path_data->providers; next 720 base/strings/string_util.cc NEXT next) { next 732 base/strings/string_util.cc next(pattern, pattern_end); next 739 base/strings/string_util.cc base_icu::UChar32 pattern_char = next(&pattern_next, pattern_end); next 740 base/strings/string_util.cc if (pattern_char == next(&string_next, string_end) && next 761 base/strings/string_util.cc static void EatWildcard(const CHAR** pattern, const CHAR* end, NEXT next) { next 765 base/strings/string_util.cc next(pattern, end); next 773 base/strings/string_util.cc NEXT next) { next 779 base/strings/string_util.cc EatSameChars(&pattern, pattern_end, &eval, eval_end, next); next 784 base/strings/string_util.cc EatWildcard(&pattern, pattern_end, next); next 795 base/strings/string_util.cc next(&next_pattern, pattern_end); next 798 base/strings/string_util.cc depth + 1, next)) next 801 base/strings/string_util.cc next(&next_eval, eval_end); next 803 base/strings/string_util.cc depth + 1, next)) next 812 base/strings/string_util.cc EatWildcard(&next_pattern, pattern_end, next); next 816 base/strings/string_util.cc depth + 1, next)) next 824 base/strings/string_util.cc EatWildcard(&pattern, pattern_end, next); next 174 base/test/expectations/parser.cc Parser::StateFunc Parser::SkipWhitespace(Parser::StateFunc next) { next 178 base/test/expectations/parser.cc return next; next 181 base/test/expectations/parser.cc Parser::StateFunc Parser::SkipWhitespaceAndNewLines(Parser::StateFunc next) { next 188 base/test/expectations/parser.cc return next; next 100 base/test/expectations/parser.h StateFunc SkipWhitespace(StateFunc next); next 103 base/test/expectations/parser.h StateFunc SkipWhitespaceAndNewLines(StateFunc next); next 531 base/third_party/dmg_fp/dtoa.cc struct Bigint *next; next 558 base/third_party/dmg_fp/dtoa.cc freelist[k] = rv->next; next 598 base/third_party/dmg_fp/dtoa.cc v->next = freelist[v->k]; next 936 base/third_party/dmg_fp/dtoa.cc p5->next = 0; next 941 base/third_party/dmg_fp/dtoa.cc p5->next = 0; next 952 base/third_party/dmg_fp/dtoa.cc if (!(p51 = p5->next)) { next 955 base/third_party/dmg_fp/dtoa.cc if (!(p51 = p5->next)) { next 956 base/third_party/dmg_fp/dtoa.cc p51 = p5->next = mult(p5,p5); next 957 base/third_party/dmg_fp/dtoa.cc p51->next = 0; next 961 base/third_party/dmg_fp/dtoa.cc p51 = p5->next = mult(p5,p5); next 962 base/third_party/dmg_fp/dtoa.cc p51->next = 0; next 83 base/third_party/xdg_mime/xdgmime.c XdgDirTimeList *next; next 88 base/third_party/xdg_mime/xdgmime.c XdgCallbackList *next; next 107 base/third_party/xdg_mime/xdgmime.c for (list = dir_time_list; list; list = list->next) next 120 base/third_party/xdg_mime/xdgmime.c list->next = dir_time_list; next 127 base/third_party/xdg_mime/xdgmime.c XdgDirTimeList *next; next 131 base/third_party/xdg_mime/xdgmime.c next = list->next; next 134 base/third_party/xdg_mime/xdgmime.c list = next; next 320 base/third_party/xdg_mime/xdgmime.c for (list = dir_time_list; list; list = list->next) next 398 base/third_party/xdg_mime/xdgmime.c for (list = dir_time_list; list; list = list->next) next 407 base/third_party/xdg_mime/xdgmime.c for (list = dir_time_list; list; list = list->next) next 665 base/third_party/xdg_mime/xdgmime.c for (list = callback_list; list; list = list->next) next 879 base/third_party/xdg_mime/xdgmime.c list_el->next = callback_list; next 880 base/third_party/xdg_mime/xdgmime.c if (list_el->next) next 881 base/third_party/xdg_mime/xdgmime.c list_el->next->prev = list_el; next 894 base/third_party/xdg_mime/xdgmime.c for (list = callback_list; list; list = list->next) next 898 base/third_party/xdg_mime/xdgmime.c if (list->next) next 899 base/third_party/xdg_mime/xdgmime.c list->next = list->prev; next 902 base/third_party/xdg_mime/xdgmime.c list->prev->next = list->next; next 904 base/third_party/xdg_mime/xdgmime.c callback_list = list->next; next 57 base/third_party/xdg_mime/xdgmimeglob.c XdgGlobHashNode *next; next 66 base/third_party/xdg_mime/xdgmimeglob.c XdgGlobList *next; next 93 base/third_party/xdg_mime/xdgmimeglob.c XdgGlobList *ptr, *next; next 99 base/third_party/xdg_mime/xdgmimeglob.c next = ptr->next; next 107 base/third_party/xdg_mime/xdgmimeglob.c ptr = next; next 128 base/third_party/xdg_mime/xdgmimeglob.c tmp_element = tmp_element->next; next 140 base/third_party/xdg_mime/xdgmimeglob.c while (tmp_element->next != NULL) next 141 base/third_party/xdg_mime/xdgmimeglob.c tmp_element = tmp_element->next; next 143 base/third_party/xdg_mime/xdgmimeglob.c tmp_element->next = new_element; next 176 base/third_party/xdg_mime/xdgmimeglob.c if (glob_hash_node->next) next 177 base/third_party/xdg_mime/xdgmimeglob.c _xdg_glob_hash_node_dump (glob_hash_node->next, depth); next 197 base/third_party/xdg_mime/xdgmimeglob.c node->next = glob_hash_node; next 212 base/third_party/xdg_mime/xdgmimeglob.c node = prev_node->next; next 220 base/third_party/xdg_mime/xdgmimeglob.c node->next = prev_node->next; next 221 base/third_party/xdg_mime/xdgmimeglob.c prev_node->next = node; next 232 base/third_party/xdg_mime/xdgmimeglob.c node = node->next; next 239 base/third_party/xdg_mime/xdgmimeglob.c node->next = prev_node->next; next 240 base/third_party/xdg_mime/xdgmimeglob.c prev_node->next = node; next 262 base/third_party/xdg_mime/xdgmimeglob.c child = child->next; next 273 base/third_party/xdg_mime/xdgmimeglob.c child->next = node->child; next 333 base/third_party/xdg_mime/xdgmimeglob.c for (node = glob_hash_node; node && character >= node->character; node = node->next) next 369 base/third_party/xdg_mime/xdgmimeglob.c node = node->next; next 424 base/third_party/xdg_mime/xdgmimeglob.c for (list = glob_hash->literal_list; list; list = list->next) next 434 base/third_party/xdg_mime/xdgmimeglob.c for (list = glob_hash->literal_list; list; list = list->next) next 455 base/third_party/xdg_mime/xdgmimeglob.c for (list = glob_hash->full_list; list && n < n_mime_types; list = list->next) next 501 base/third_party/xdg_mime/xdgmimeglob.c if (node->next) next 502 base/third_party/xdg_mime/xdgmimeglob.c _xdg_glob_hash_free_nodes (node->next); next 583 base/third_party/xdg_mime/xdgmimeglob.c for (list = glob_hash->literal_list; list; list = list->next) next 603 base/third_party/xdg_mime/xdgmimeglob.c for (list = glob_hash->full_list; list; list = list->next) next 70 base/third_party/xdg_mime/xdgmimemagic.c XdgMimeMagicMatch *next; next 83 base/third_party/xdg_mime/xdgmimemagic.c XdgMimeMagicMatchlet *next; next 114 base/third_party/xdg_mime/xdgmimemagic.c matchlet->next = NULL; next 125 base/third_party/xdg_mime/xdgmimemagic.c if (mime_magic_matchlet->next) next 126 base/third_party/xdg_mime/xdgmimemagic.c _xdg_mime_magic_matchlet_free (mime_magic_matchlet->next); next 141 base/third_party/xdg_mime/xdgmimemagic.c XdgMimeMagicMatch *ptr, *next; next 146 base/third_party/xdg_mime/xdgmimemagic.c next = ptr->next; next 154 base/third_party/xdg_mime/xdgmimemagic.c ptr = next; next 505 base/third_party/xdg_mime/xdgmimemagic.c matchlet->next = match->matchlet; next 571 base/third_party/xdg_mime/xdgmimemagic.c if ((matchlet->next == NULL) || next 572 base/third_party/xdg_mime/xdgmimemagic.c (matchlet->next->indent <= indent)) next 575 base/third_party/xdg_mime/xdgmimemagic.c if (_xdg_mime_magic_matchlet_compare_level (matchlet->next, next 584 base/third_party/xdg_mime/xdgmimemagic.c matchlet = matchlet->next; next 614 base/third_party/xdg_mime/xdgmimemagic.c match->next = mime_magic->match_list; next 620 base/third_party/xdg_mime/xdgmimemagic.c while (list->next != NULL) next 622 base/third_party/xdg_mime/xdgmimemagic.c if (list->next->priority < match->priority) next 624 base/third_party/xdg_mime/xdgmimemagic.c match->next = list->next; next 625 base/third_party/xdg_mime/xdgmimemagic.c list->next = match; next 628 base/third_party/xdg_mime/xdgmimemagic.c list = list->next; next 630 base/third_party/xdg_mime/xdgmimemagic.c list->next = match; next 631 base/third_party/xdg_mime/xdgmimemagic.c match->next = NULL; next 670 base/third_party/xdg_mime/xdgmimemagic.c for (match = mime_magic->match_list; match; match = match->next) next 710 base/third_party/xdg_mime/xdgmimemagic.c for (match = mime_magic->match_list; match; match = match->next) next 714 base/third_party/xdg_mime/xdgmimemagic.c for (matchlet = match->matchlet; matchlet; matchlet = matchlet->next) next 733 base/third_party/xdg_mime/xdgmimemagic.c if ((matchlets == NULL) || (matchlets->next == NULL)) next 743 base/third_party/xdg_mime/xdgmimemagic.c tmp = tmp->next; next 744 base/third_party/xdg_mime/xdgmimemagic.c matchlet->next = new_list; next 596 base/tracked_objects.cc thread_data = thread_data->next()) { next 662 base/tracked_objects.cc thread_data = thread_data->next()) next 841 base/tracked_objects.cc thread_data = thread_data->next(); next 851 base/tracked_objects.cc thread_data_list = thread_data_list->next(); next 519 base/tracked_objects.h ThreadData* next() const; next 106 base/tracked_objects_unittest.cc EXPECT_FALSE(data->next()); next 126 base/tracked_objects_unittest.cc EXPECT_FALSE(data->next()); next 149 base/tracked_objects_unittest.cc EXPECT_FALSE(data->next()); next 103 cc/base/region.cc for (Iterator it(*this); it.has_rect(); it.next()) { next 113 cc/base/region.cc for (Iterator it(*this); it.has_rect(); it.next()) { next 73 cc/base/region.h void next() { next 74 cc/base/region.h it_.next(); next 97 cc/base/region_unittest.cc for (Region::Iterator it(r); it.has_rect(); it.next()) next 194 cc/debug/debug_rect_history.cc iter.next()) { next 252 cc/debug/debug_rect_history.cc iter.next()) { next 157 cc/layers/tiled_layer.cc new_rects.next()) next 2013 cc/output/renderer_pixeltest.cc for (Region::Iterator iter(outside); iter.has_rect(); iter.next()) { next 359 cc/resources/picture.cc for (Region::Iterator it(negated_content_region); it.has_rect(); it.next()) next 180 cc/resources/picture_layer_tiling.cc for (Region::Iterator iter(layer_region); iter.has_rect(); iter.next()) { next 282 cc/resources/picture_layer_tiling_set.cc region_iter_.next(); next 363 cc/resources/picture_layer_tiling_set_unittest.cc iter.next()) { next 172 cc/resources/picture_pile.cc for (Region::Iterator i(invalidation); i.has_rect(); i.next()) { next 324 cc/resources/picture_pile_impl.cc for (Region::Iterator it(total_clip); it.has_rect(); it.next()) next 653 cc/trees/layer_tree_host_impl.cc fill_rects.next()) { next 668 cc/trees/layer_tree_host_impl.cc fill_rects.next()) { next 87 cc/trees/occlusion_tracker.cc for (Region::Iterator rects(region); rects.has_rect(); rects.next()) { next 273 cc/trees/occlusion_tracker.cc for (; affected_occlusion_rects.has_rect(); affected_occlusion_rects.next()) { next 443 cc/trees/occlusion_tracker.cc opaque_content_rects.next()) { next 479 cc/trees/occlusion_tracker.cc non_opaque_content_rects.next()) { next 129 cc/trees/occlusion_tracker_perftest.cc LayerIteratorPosition<LayerImpl> next = begin; next 130 cc/trees/occlusion_tracker_perftest.cc EXPECT_EQ(active_tree()->root_layer(), next.current_layer); next 200 cc/trees/occlusion_tracker_perftest.cc LayerIteratorPosition<LayerImpl> next = begin; next 201 cc/trees/occlusion_tracker_perftest.cc EXPECT_EQ(active_tree()->root_layer(), next.current_layer); next 3340 cc/trees/occlusion_tracker_unittest.cc expected_rects.next(), target_surface_rects.next()) { next 254 chrome/android/java/src/org/chromium/chrome/browser/infobar/InfoBarContainer.java InfoBarTransitionInfo info = iterator.next(); next 1051 chrome/browser/autocomplete/history_url_provider.cc for (history::HistoryMatches::iterator next(std::find_first_of(first + 1, next 1054 chrome/browser/autocomplete/history_url_provider.cc next != matches->end(); next = std::find_first_of(next, matches->end(), next 1058 chrome/browser/autocomplete/history_url_provider.cc next = matches->erase(next); next 1059 chrome/browser/autocomplete/history_url_provider.cc if (static_cast<size_t>(next - matches->begin()) < next_index) next 56 chrome/browser/component_updater/update_response.cc for (xmlNode* child = root->children; child != NULL; child = child->next) { next 68 chrome/browser/component_updater/update_response.cc for (xmlAttr* attr = node->properties; attr != NULL; attr = attr->next) { next 226 chrome/browser/devtools/devtools_adb_bridge_browsertest.cc virtual void HttpQueryCallback(const CommandCallback& next, int code, next 336 chrome/browser/extensions/api/declarative_webrequest/webrequest_condition_attribute_unittest.cc size_t next = 0; next 339 chrome/browser/extensions/api/declarative_webrequest/webrequest_condition_attribute_unittest.cc for (size_t j = next; j < next + sizes[i]; ++j) { next 342 chrome/browser/extensions/api/declarative_webrequest/webrequest_condition_attribute_unittest.cc next += sizes[i]; next 388 chrome/browser/extensions/api/downloads/downloads_api_browsertest.cc for (std::string::size_type next = result.find("\\"); next 389 chrome/browser/extensions/api/downloads/downloads_api_browsertest.cc next != std::string::npos; next 390 chrome/browser/extensions/api/downloads/downloads_api_browsertest.cc next = result.find("\\", next)) { next 391 chrome/browser/extensions/api/downloads/downloads_api_browsertest.cc result.replace(next, 1, "\\\\"); next 392 chrome/browser/extensions/api/downloads/downloads_api_browsertest.cc next += 2; next 397 chrome/browser/extensions/menu_manager.cc MenuItem* next = GetItemById(*id); next 398 chrome/browser/extensions/menu_manager.cc if (!next) { next 402 chrome/browser/extensions/menu_manager.cc id = next->parent_id(); next 248 chrome/browser/extensions/updater/extension_updater.cc Time next = Time::Now() + actual_delay; next 249 chrome/browser/extensions/updater/extension_updater.cc prefs_->SetInt64(pref_names::kNextUpdateCheck, next.ToInternalValue()); next 130 chrome/browser/history/snippet.cc bi->next(count); next 154 chrome/browser/history/snippet.cc bi->next(kSnippetContext); next 221 chrome/browser/net/url_info.cc char next = output[i]; next 222 chrome/browser/net/url_info.cc if (isalnum(next) || isspace(next) || strchr(".-:/", next) != NULL) next 232 chrome/browser/prerender/prerender_link_manager.cc std::list<LinkPrerender>::iterator next = prerenders_.begin(); next 233 chrome/browser/prerender/prerender_link_manager.cc while (next != prerenders_.end()) { next 234 chrome/browser/prerender/prerender_link_manager.cc std::list<LinkPrerender>::iterator it = next; next 235 chrome/browser/prerender/prerender_link_manager.cc ++next; next 494 chrome/browser/safe_browsing/protocol_manager.cc base::TimeDelta next = next_update_interval_; next 496 chrome/browser/safe_browsing/protocol_manager.cc next = GetNextBackOffInterval(&update_error_count_, &update_back_off_mult_); next 502 chrome/browser/safe_browsing/protocol_manager.cc return next; next 511 chrome/browser/safe_browsing/protocol_manager.cc base::TimeDelta next = base::TimeDelta::FromMinutes( next 516 chrome/browser/safe_browsing/protocol_manager.cc return next; next 687 chrome/browser/safe_browsing/protocol_manager.cc base::TimeDelta next = GetNextBackOffInterval( next 689 chrome/browser/safe_browsing/protocol_manager.cc next_gethash_time_ = now + next; next 92 chrome/browser/safe_browsing/protocol_manager_unittest.cc TimeDelta next; next 95 chrome/browser/safe_browsing/protocol_manager_unittest.cc next = pm->GetNextUpdateInterval(false); next 96 chrome/browser/safe_browsing/protocol_manager_unittest.cc EXPECT_EQ(next, TimeDelta::FromSeconds(1800)); next 99 chrome/browser/safe_browsing/protocol_manager_unittest.cc next = pm->GetNextUpdateInterval(true); next 100 chrome/browser/safe_browsing/protocol_manager_unittest.cc EXPECT_EQ(next, TimeDelta::FromSeconds(60)); next 103 chrome/browser/safe_browsing/protocol_manager_unittest.cc next = pm->GetNextUpdateInterval(true); next 104 chrome/browser/safe_browsing/protocol_manager_unittest.cc EXPECT_TRUE(next >= TimeDelta::FromMinutes(30) && next 105 chrome/browser/safe_browsing/protocol_manager_unittest.cc next <= TimeDelta::FromMinutes(60)); next 108 chrome/browser/safe_browsing/protocol_manager_unittest.cc next = pm->GetNextUpdateInterval(true); next 109 chrome/browser/safe_browsing/protocol_manager_unittest.cc EXPECT_TRUE(next >= TimeDelta::FromMinutes(60) && next 110 chrome/browser/safe_browsing/protocol_manager_unittest.cc next <= TimeDelta::FromMinutes(120)); next 113 chrome/browser/safe_browsing/protocol_manager_unittest.cc next = pm->GetNextUpdateInterval(true); next 114 chrome/browser/safe_browsing/protocol_manager_unittest.cc EXPECT_TRUE(next >= TimeDelta::FromMinutes(120) && next 115 chrome/browser/safe_browsing/protocol_manager_unittest.cc next <= TimeDelta::FromMinutes(240)); next 118 chrome/browser/safe_browsing/protocol_manager_unittest.cc next = pm->GetNextUpdateInterval(true); next 119 chrome/browser/safe_browsing/protocol_manager_unittest.cc EXPECT_TRUE(next >= TimeDelta::FromMinutes(240) && next 120 chrome/browser/safe_browsing/protocol_manager_unittest.cc next <= TimeDelta::FromMinutes(480)); next 123 chrome/browser/safe_browsing/protocol_manager_unittest.cc next = pm->GetNextUpdateInterval(true); next 124 chrome/browser/safe_browsing/protocol_manager_unittest.cc EXPECT_EQ(next, TimeDelta::FromMinutes(480)); next 127 chrome/browser/safe_browsing/protocol_manager_unittest.cc next = pm->GetNextUpdateInterval(true); next 128 chrome/browser/safe_browsing/protocol_manager_unittest.cc EXPECT_EQ(next, TimeDelta::FromMinutes(480)); next 131 chrome/browser/safe_browsing/protocol_manager_unittest.cc next = pm->GetNextUpdateInterval(false); next 132 chrome/browser/safe_browsing/protocol_manager_unittest.cc EXPECT_EQ(next, TimeDelta::FromSeconds(1800)); next 207 chrome/browser/ui/app_list/extension_app_item.cc const ExtensionAppItem* next) { next 208 chrome/browser/ui/app_list/extension_app_item.cc if (!prev && !next) next 217 chrome/browser/ui/app_list/extension_app_item.cc next_id = next->extension_id(); next 219 chrome/browser/ui/app_list/extension_app_item.cc } else if (!next) { next 226 chrome/browser/ui/app_list/extension_app_item.cc if (page.Equals(sorting->GetPageOrdinal(next->extension_id()))) next 227 chrome/browser/ui/app_list/extension_app_item.cc next_id = next->extension_id(); next 57 chrome/browser/ui/app_list/extension_app_item.h void Move(const ExtensionAppItem* prev, const ExtensionAppItem* next); next 308 chrome/browser/ui/app_list/extension_app_model_builder.cc ExtensionAppItem* next = NULL; next 312 chrome/browser/ui/app_list/extension_app_model_builder.cc next = static_cast<ExtensionAppItem*>(item); next 317 chrome/browser/ui/app_list/extension_app_model_builder.cc if (prev || next) next 318 chrome/browser/ui/app_list/extension_app_model_builder.cc static_cast<ExtensionAppItem*>(item)->Move(prev, next); next 75 chrome/browser/ui/bookmarks/bookmark_utils.cc const GURL* next = next_; next 77 chrome/browser/ui/bookmarks/bookmark_utils.cc return next; next 325 chrome/browser/ui/fullscreen/fullscreen_controller_state_test.cc StateTransitionInfo next = NextTransitionInShortestPath(source_state, next 328 chrome/browser/ui/fullscreen/fullscreen_controller_state_test.cc if (next.state == STATE_INVALID) { next 337 chrome/browser/ui/fullscreen/fullscreen_controller_state_test.cc return InvokeEvent(next.event); next 1116 chrome/browser/ui/gtk/bookmarks/bookmark_bar_gtk.cc for (GList* item = children; item; item = item->next, index++) { next 419 chrome/browser/ui/gtk/collected_cookies_gtk.cc for (GList* item = paths; item; item = item->next) { next 482 chrome/browser/ui/gtk/collected_cookies_gtk.cc for (GList* item = paths; item; item = item->next) { next 525 chrome/browser/ui/gtk/collected_cookies_gtk.cc for (GList* item = paths; item; item = item->next) { next 383 chrome/browser/ui/gtk/gtk_custom_menu_item.cc for (; current != NULL; current = current->next) { next 74 chrome/browser/ui/gtk/gtk_tree.cc for (node = list; node != NULL; node = node->next) { next 271 chrome/browser/ui/gtk/gtk_util.cc for (GList* item = children; item; item = item->next) { next 426 chrome/browser/ui/gtk/gtk_util.cc for (GList* window = all_windows; window; window = window->next) { next 446 chrome/browser/ui/gtk/gtk_util.cc for (GList* item = windows; item; item = item->next) { next 144 chrome/browser/ui/gtk/omnibox/omnibox_view_gtk.cc for (GList* item = list; item != NULL; item = item->next, ++index) { next 752 chrome/browser/ui/gtk/task_manager_gtk.cc for (GList* item = paths; item; item = item->next) { next 881 chrome/browser/ui/gtk/task_manager_gtk.cc for (GList* item = paths; item; item = item->next) { next 1323 chrome/browser/ui/tabs/tab_strip_model.cc void TabStripModel::SelectRelativeTab(bool next) { next 1330 chrome/browser/ui/tabs/tab_strip_model.cc int delta = next ? 1 : -1; next 1577 chrome/browser/ui/views/autofill/autofill_dialog_views.cc for (views::View* next = scrollable_area_; next 1578 chrome/browser/ui/views/autofill/autofill_dialog_views.cc next; next 1579 chrome/browser/ui/views/autofill/autofill_dialog_views.cc next = manager->GetNextFocusableView(next, window_, false, true)) { next 1580 chrome/browser/ui/views/autofill/autofill_dialog_views.cc views::View* input_view = GetAncestralInputView(next); next 1588 chrome/browser/ui/views/autofill/autofill_dialog_views.cc return next; next 592 chrome/browser/ui/views/frame/global_menu_bar_x11.cc for (; childs != NULL; childs = childs->next, i++) { next 607 chrome/browser/ui/views/frame/global_menu_bar_x11.cc for (; childs != NULL; childs = childs->next) { next 302 chrome/browser/ui/views/menu_model_adapter_test.cc virtual void Click(views::View* view, const base::Closure& next) { next 307 chrome/browser/ui/views/menu_model_adapter_test.cc next); next 25 chrome/browser/ui/views/menu_test_base.cc void MenuTestBase::Click(views::View* view, const base::Closure& next) { next 30 chrome/browser/ui/views/menu_test_base.cc next); next 34 chrome/browser/ui/views/menu_test_base.cc const base::Closure& next) { next 37 chrome/browser/ui/views/menu_test_base.cc false, false, next); next 43 chrome/browser/ui/views/menu_test_base.h virtual void Click(views::View* view, const base::Closure& next); next 46 chrome/browser/ui/views/menu_test_base.h void KeyPress(ui::KeyboardCode keycode, const base::Closure& next); next 200 chrome/common/extensions/docs/examples/apps/hello-php/lib/lightopenid/openid.php $next = false; next 204 chrome/common/extensions/docs/examples/apps/hello-php/lib/lightopenid/openid.php $next = true; next 258 chrome/common/extensions/docs/examples/apps/hello-php/lib/lightopenid/openid.php $next = true; next 265 chrome/common/extensions/docs/examples/apps/hello-php/lib/lightopenid/openid.php if ($next) continue; next 63 chrome/common/extensions/update_manifest.cc for (xmlNode* child = root->children; child != NULL; child = child->next) { next 75 chrome/common/extensions/update_manifest.cc for (xmlAttr* attr = node->properties; attr != NULL; attr = attr->next) { next 116 chrome/common/extensions/update_manifest.cc for (xmlNs* ns = node->ns; ns != NULL; ns = ns->next) { next 166 chrome/renderer/safe_browsing/phishing_term_feature_extractor.cc for (int next = ubrk_next(state_->iterator); next 167 chrome/renderer/safe_browsing/phishing_term_feature_extractor.cc next != UBRK_DONE; next = ubrk_next(state_->iterator)) { next 171 chrome/renderer/safe_browsing/phishing_term_feature_extractor.cc next - state_->position)); next 174 chrome/renderer/safe_browsing/phishing_term_feature_extractor.cc state_->position = next; next 380 chrome/renderer/spellchecker/spellcheck_worditerator.cc int next = ubrk_next(iterator_); next 381 chrome/renderer/spellchecker/spellcheck_worditerator.cc while (next != UBRK_DONE) { next 383 chrome/renderer/spellchecker/spellcheck_worditerator.cc if (Normalize(position_, next - position_, word_string)) { next 385 chrome/renderer/spellchecker/spellcheck_worditerator.cc *word_length = next - position_; next 386 chrome/renderer/spellchecker/spellcheck_worditerator.cc position_ = next; next 390 chrome/renderer/spellchecker/spellcheck_worditerator.cc position_ = next; next 391 chrome/renderer/spellchecker/spellcheck_worditerator.cc next = ubrk_next(iterator_); next 427 chrome/renderer/spellchecker/spellcheck_worditerator.cc for (UChar c = it.first(); c != icu::CharacterIterator::DONE; c = it.next()) next 122 chrome/test/chromedriver/util.cc size_t next = buffer_.length(); next 123 chrome/test/chromedriver/util.cc buffer_.resize(next + size); next 124 chrome/test/chromedriver/util.cc memcpy(&buffer_[next], bytes, size); next 66 chrome/test/data/nacl/manifest_file/pm_manifest_file_test.cc next(reinterpret_cast<WorkRequest *>(NULL)) {} next 68 chrome/test/data/nacl/manifest_file/pm_manifest_file_test.cc WorkRequest *next; next 301 chrome/test/data/nacl/manifest_file/pm_manifest_file_test.cc queue_head_ = head->next; next 310 chrome/test/data/nacl/manifest_file/pm_manifest_file_test.cc req->next = NULL; next 312 chrome/test/data/nacl/manifest_file/pm_manifest_file_test.cc queue_insert_ = &req->next; next 112 components/autofill/core/browser/name_field.cc const AutofillField* next = NULL; next 115 components/autofill/core/browser/name_field.cc ParseEmptyLabel(scanner, &next)) { next 119 components/autofill/core/browser/name_field.cc v->middle_name_ = next; next 122 components/autofill/core/browser/name_field.cc v->last_name_ = next; next 77 components/policy/core/common/generate_policy_source_unittest.cc const char** next = kExpectedProperties; next 79 components/policy/core/common/generate_policy_source_unittest.cc !it.IsAtEnd(); it.Advance(), ++next) { next 80 components/policy/core/common/generate_policy_source_unittest.cc ASSERT_TRUE(*next != NULL); next 81 components/policy/core/common/generate_policy_source_unittest.cc EXPECT_STREQ(*next, it.key()); next 85 components/policy/core/common/generate_policy_source_unittest.cc EXPECT_TRUE(*next == NULL); next 735 components/policy/core/common/policy_loader_win_unittest.cc GROUP_POLICY_OBJECT* next, next 740 components/policy/core/common/policy_loader_win_unittest.cc gpo->pNext = next; next 144 components/rappor/log_uploader_unittest.cc base::TimeDelta next = base::TimeDelta::FromSeconds(1); next 146 components/rappor/log_uploader_unittest.cc while (next > current) { next 147 components/rappor/log_uploader_unittest.cc current = next; next 148 components/rappor/log_uploader_unittest.cc next = TestLogUploader::BackOff(current); next 151 components/rappor/log_uploader_unittest.cc EXPECT_EQ(next, current); next 96 components/url_matcher/substring_set_matcher.cc size_t next = 0; next 99 components/url_matcher/substring_set_matcher.cc ++i, ++next) { next 100 components/url_matcher/substring_set_matcher.cc sorted_patterns[next] = i->second; next 535 content/child/npapi/plugin_instance.cc range_list = range_list->next; next 167 content/common/android/address_parser_internal.cc base::char16 next = SafeNextChar(it_, end_); next 168 content/common/android/address_parser_internal.cc if (IsPostDelimiter(next)) { next 174 content/common/android/address_parser_internal.cc if (IsAsciiAlpha(next)) { next 177 content/common/android/address_parser_internal.cc base::char16 second_letter = base::ToLowerASCII(next); next 810 content/common/gpu/client/gl_helper.cc for (SkRegion::Iterator it(region); !it.done(); it.next()) { next 1229 content/public/android/java/src/org/chromium/content/browser/ContentViewCore.java mGestureStateListenersIterator.next().onFlingStartGesture( next 1240 content/public/android/java/src/org/chromium/content/browser/ContentViewCore.java mGestureStateListenersIterator.next().onUnhandledFlingStartEvent(vx, vy); next 1265 content/public/android/java/src/org/chromium/content/browser/ContentViewCore.java mGestureStateListenersIterator.next().onScrollUpdateGestureConsumed(); next 1341 content/public/android/java/src/org/chromium/content/browser/ContentViewCore.java GestureStateListener listener = mGestureStateListenersIterator.next(); next 2348 content/public/android/java/src/org/chromium/content/browser/ContentViewCore.java mGestureStateListenersIterator.next().onScrollOffsetOrExtentChanged( next 143 content/public/android/java/src/org/chromium/content/browser/ContentViewRenderView.java mCurrentVSyncListenersIterator.next().onVSync(vsyncTimeMicros); next 424 content/public/android/java/src/org/chromium/content/browser/accessibility/AccessibilityInjector.java String key = keyIt.next(); next 121 content/public/android/java/src/org/chromium/content/browser/accessibility/JellyBeanAccessibilityInjector.java keys.next(); next 174 content/renderer/gpu/compositor_software_output_device.cc for (SkRegion::Iterator it(region); !it.done(); it.next()) { next 13 content/renderer/renderer_webcolorchooser_impl.cc static int next = 0; next 14 content/renderer/renderer_webcolorchooser_impl.cc return ++next; next 208 content/shell/android/java/src/org/chromium/content_shell/Shell.java mNextButton = (ImageButton) findViewById(R.id.next); next 801 content/shell/renderer/test_runner/web_ax_object_proxy.cc blink::WebRect next = BoundsForCharacter(accessibility_object(), start + i); next 802 content/shell/renderer/test_runner/web_ax_object_proxy.cc int right = std::max(bounds.x + bounds.width, next.x + next.width); next 803 content/shell/renderer/test_runner/web_ax_object_proxy.cc int bottom = std::max(bounds.y + bounds.height, next.y + next.height); next 804 content/shell/renderer/test_runner/web_ax_object_proxy.cc bounds.x = std::min(bounds.x, next.x); next 805 content/shell/renderer/test_runner/web_ax_object_proxy.cc bounds.y = std::min(bounds.y, next.y); next 46 content/test/plugin/plugin_request_read_test.cc requested_ranges_[0].next = NULL; next 155 crypto/rsa_private_key_nss.cc for (SECMODModuleList* item = head; item != NULL; item = item->next) { next 156 gpu/command_buffer/client/fenced_allocator.cc Block &next = blocks_[i + 1]; next 158 gpu/command_buffer/client/fenced_allocator.cc if (next.offset <= current.offset) next 160 gpu/command_buffer/client/fenced_allocator.cc if (next.offset != current.offset + current.size) next 162 gpu/command_buffer/client/fenced_allocator.cc if (current.state == FREE && next.state == FREE) next 179 gpu/command_buffer/client/fenced_allocator.cc Block &next = blocks_[index + 1]; next 180 gpu/command_buffer/client/fenced_allocator.cc if (next.state == FREE) { next 181 gpu/command_buffer/client/fenced_allocator.cc blocks_[index].size += next.size; next 124 gpu/config/gpu_info_collector_x11.cc device != NULL; device = device->next) { next 96 jingle/glue/thread_wrapper.cc MessagesQueue::iterator next = it; next 97 jingle/glue/thread_wrapper.cc ++next; next 108 jingle/glue/thread_wrapper.cc it = next; next 113 jingle/glue/thread_wrapper.cc std::list<PendingSend*>::iterator next = it; next 114 jingle/glue/thread_wrapper.cc ++next; next 126 jingle/glue/thread_wrapper.cc it = next; next 105 media/audio/win/wavein_input_win.cc WAVEHDR* next = GetNextBuffer(current); next 109 media/audio/win/wavein_input_win.cc current = next; next 124 media/base/audio_buffer_queue.cc BufferQueue::iterator next = current_buffer + 1; next 125 media/base/audio_buffer_queue.cc if (next == buffers_.end()) next 129 media/base/audio_buffer_queue.cc current_buffer = next; next 425 media/base/container_names.cc uint32 next = Read24(buffer + *offset); next 426 media/base/container_names.cc if (((next >> bits_to_shift) & mask) == start_code) next 470 media/base/container_names.cc int next; next 471 media/base/container_names.cc if (!reader.ReadBits(16, &next)) next 473 media/base/container_names.cc RCHECK(next == 1); next 234 media/base/seekable_buffer.cc BufferQueue::iterator next = current_buffer; next 235 media/base/seekable_buffer.cc ++next; next 237 media/base/seekable_buffer.cc if (next == buffers_.end()) next 241 media/base/seekable_buffer.cc current_buffer = next; next 359 media/cast/test/utility/udp_proxy.cc void BuildPipe(scoped_ptr<PacketPipe>* pipe, PacketPipe* next) { next 361 media/cast/test/utility/udp_proxy.cc (*pipe)->AppendToPipe(scoped_ptr<PacketPipe>(next).Pass()); next 363 media/cast/test/utility/udp_proxy.cc pipe->reset(next); next 52 media/midi/midi_message_queue.cc const uint8 next = queue_.front(); next 59 media/midi/midi_message_queue.cc if (IsSystemRealTimeMessage(next)) { next 60 media/midi/midi_message_queue.cc message->push_back(next); next 68 media/midi/midi_message_queue.cc ((next_message_[0] == kSysEx && IsFirstStatusByte(next)) || next 69 media/midi/midi_message_queue.cc (next_message_[0] != kSysEx && !IsDataByte(next)))) { next 76 media/midi/midi_message_queue.cc if (IsFirstStatusByte(next)) { next 77 media/midi/midi_message_queue.cc next_message_.push_back(next); next 88 media/midi/midi_message_queue.cc next_message_.push_back(next); next 91 media/midi/midi_message_queue.cc if (next == kEndOfSysEx) { next 99 media/midi/midi_message_queue.cc DCHECK(IsDataByte(next)); next 27 mojo/public/cpp/bindings/lib/scratch_buffer.cc fixed_.next = NULL; next 40 mojo/public/cpp/bindings/lib/scratch_buffer.cc overflow_ = overflow_->next; next 90 mojo/public/cpp/bindings/lib/scratch_buffer.cc segment->next = overflow_; next 30 mojo/public/cpp/bindings/lib/scratch_buffer.h Segment* next; next 119 native_client_sdk/src/libraries/error_handling/error_handling.c uintptr_t next; next 125 native_client_sdk/src/libraries/error_handling/error_handling.c next = frame->next_ptr; next 128 native_client_sdk/src/libraries/error_handling/error_handling.c if (next <= frame_ptr || next == 0) return 0; next 131 native_client_sdk/src/libraries/error_handling/error_handling.c if (next - frame_ptr > MAX_FRAME_SIZE) return 0; next 134 native_client_sdk/src/libraries/error_handling/error_handling.c frame->frame_ptr = next; next 270 native_client_sdk/src/libraries/third_party/pthreads-win32/implement.h ptw32_robust_node_t* next; next 318 native_client_sdk/src/libraries/third_party/pthreads-win32/implement.h struct ptw32_mcs_node_t_ *next; /* ptr to successor in queue */ next 373 native_client_sdk/src/libraries/third_party/pthreads-win32/implement.h pthread_cond_t next; /* Doubly linked list */ next 198 native_client_sdk/src/libraries/third_party/pthreads-win32/pthread_cond_destroy.c ptw32_cond_list_head = cv->next; next 202 native_client_sdk/src/libraries/third_party/pthreads-win32/pthread_cond_destroy.c cv->prev->next = cv->next; next 211 native_client_sdk/src/libraries/third_party/pthreads-win32/pthread_cond_destroy.c cv->next->prev = cv->prev; next 145 native_client_sdk/src/libraries/third_party/pthreads-win32/pthread_cond_init.c cv->next = NULL; next 150 native_client_sdk/src/libraries/third_party/pthreads-win32/pthread_cond_init.c ptw32_cond_list_tail->next = cv; next 128 native_client_sdk/src/libraries/third_party/pthreads-win32/pthread_mutex_consistent.c robust->next = NULL; next 134 native_client_sdk/src/libraries/third_party/pthreads-win32/pthread_mutex_consistent.c robust->next = *list; next 150 native_client_sdk/src/libraries/third_party/pthreads-win32/pthread_mutex_consistent.c if (robust->next != NULL) next 152 native_client_sdk/src/libraries/third_party/pthreads-win32/pthread_mutex_consistent.c robust->next->prev = robust->prev; next 156 native_client_sdk/src/libraries/third_party/pthreads-win32/pthread_mutex_consistent.c robust->prev->next = robust->next; next 160 native_client_sdk/src/libraries/third_party/pthreads-win32/pthread_mutex_consistent.c *list = robust->next; next 108 native_client_sdk/src/libraries/third_party/pthreads-win32/pthread_mutex_init.c mx->robustNode->next = NULL; next 102 native_client_sdk/src/libraries/third_party/pthreads-win32/pthread_timechange_handler_np.c cv = cv->next; next 165 native_client_sdk/src/libraries/third_party/pthreads-win32/ptw32_MCS_lock.c node->next = 0; /* initially, no successor */ next 174 native_client_sdk/src/libraries/third_party/pthreads-win32/ptw32_MCS_lock.c pred->next = node; next 195 native_client_sdk/src/libraries/third_party/pthreads-win32/ptw32_MCS_lock.c ptw32_mcs_local_node_t *next = next 197 native_client_sdk/src/libraries/third_party/pthreads-win32/ptw32_MCS_lock.c PTW32_INTERLOCKED_EXCHANGE_ADD_SIZE((PTW32_INTERLOCKED_SIZEPTR)&node->next, (PTW32_INTERLOCKED_SIZE)0); /* MBR fence */ next 199 native_client_sdk/src/libraries/third_party/pthreads-win32/ptw32_MCS_lock.c if (0 == next) next 214 native_client_sdk/src/libraries/third_party/pthreads-win32/ptw32_MCS_lock.c next = (ptw32_mcs_local_node_t *) next 215 native_client_sdk/src/libraries/third_party/pthreads-win32/ptw32_MCS_lock.c PTW32_INTERLOCKED_EXCHANGE_ADD_SIZE((PTW32_INTERLOCKED_SIZEPTR)&node->next, (PTW32_INTERLOCKED_SIZE)0); /* MBR fence */ next 219 native_client_sdk/src/libraries/third_party/pthreads-win32/ptw32_MCS_lock.c ptw32_mcs_flag_set(&next->readyFlag); next 234 native_client_sdk/src/libraries/third_party/pthreads-win32/ptw32_MCS_lock.c node->next = 0; /* initially, no successor */ next 262 native_client_sdk/src/libraries/third_party/pthreads-win32/ptw32_MCS_lock.c new_node->next = 0; next 272 native_client_sdk/src/libraries/third_party/pthreads-win32/ptw32_MCS_lock.c while (old_node->next == 0) next 276 native_client_sdk/src/libraries/third_party/pthreads-win32/ptw32_MCS_lock.c new_node->next = old_node->next; next 65 native_client_sdk/src/libraries/third_party/pthreads-win32/ptw32_tkAssocDestroy.c ThreadKeyAssoc * prev, * next; next 69 native_client_sdk/src/libraries/third_party/pthreads-win32/ptw32_tkAssocDestroy.c next = assoc->nextKey; next 72 native_client_sdk/src/libraries/third_party/pthreads-win32/ptw32_tkAssocDestroy.c prev->nextKey = next; next 74 native_client_sdk/src/libraries/third_party/pthreads-win32/ptw32_tkAssocDestroy.c if (next != NULL) next 76 native_client_sdk/src/libraries/third_party/pthreads-win32/ptw32_tkAssocDestroy.c next->prevKey = prev; next 82 native_client_sdk/src/libraries/third_party/pthreads-win32/ptw32_tkAssocDestroy.c assoc->thread->keys = next; next 90 native_client_sdk/src/libraries/third_party/pthreads-win32/ptw32_tkAssocDestroy.c assoc->thread->nextAssoc = next; next 95 native_client_sdk/src/libraries/third_party/pthreads-win32/ptw32_tkAssocDestroy.c next = assoc->nextThread; next 98 native_client_sdk/src/libraries/third_party/pthreads-win32/ptw32_tkAssocDestroy.c prev->nextThread = next; next 100 native_client_sdk/src/libraries/third_party/pthreads-win32/ptw32_tkAssocDestroy.c if (next != NULL) next 102 native_client_sdk/src/libraries/third_party/pthreads-win32/ptw32_tkAssocDestroy.c next->prevThread = prev; next 108 native_client_sdk/src/libraries/third_party/pthreads-win32/ptw32_tkAssocDestroy.c assoc->key->threads = next; next 22 native_client_sdk/src/libraries/xray/stringpool.c struct XRayStringPoolNode* next; next 37 native_client_sdk/src/libraries/xray/stringpool.c s->next = NULL; next 60 native_client_sdk/src/libraries/xray/stringpool.c pool->current->next = XRayStringPoolAllocNode(); next 61 native_client_sdk/src/libraries/xray/stringpool.c pool->current = pool->current->next; next 87 native_client_sdk/src/libraries/xray/stringpool.c n = n->next; next 37 native_client_sdk/src/libraries/xray/symtable.c struct XRaySymbolPoolNode* next; next 77 native_client_sdk/src/libraries/xray/symtable.c sympool->current->next = new_pool; next 103 native_client_sdk/src/libraries/xray/symtable.c n = n->next; next 97 net/base/priority_queue_unittest.cc PriorityQueue<int>::Pointer next = queue_.GetNextTowardsLastMin(current); next 99 net/base/priority_queue_unittest.cc current = next; next 25 net/cert/nss_profile_filter_chromeos_unittest.cc for (SECMODModuleList* item = head; item != NULL; item = item->next) { next 2153 net/disk_cache/backend_unittest.cc entry_impl->rankings()->Data()->next = 0; next 388 net/disk_cache/blockfile/backend_impl.cc EntryImpl* next = OpenNextEntryImpl(&iter); next 389 net/disk_cache/blockfile/backend_impl.cc if (!next) next 392 net/disk_cache/blockfile/backend_impl.cc while (next) { next 393 net/disk_cache/blockfile/backend_impl.cc node = next; next 394 net/disk_cache/blockfile/backend_impl.cc next = OpenNextEntryImpl(&iter); next 400 net/disk_cache/blockfile/backend_impl.cc if (next) next 401 net/disk_cache/blockfile/backend_impl.cc next->Release(); next 402 net/disk_cache/blockfile/backend_impl.cc next = NULL; next 778 net/disk_cache/blockfile/backend_impl.cc return entry.Data()->next; next 1705 net/disk_cache/blockfile/backend_impl.cc Rankings::ScopedRankingsBlock next(&rankings_, next_block); next 1708 net/disk_cache/blockfile/backend_impl.cc *next_entry = GetEnumeratedEntry(next.get(), list); next 1712 net/disk_cache/blockfile/backend_impl.cc *from_entry = next.release(); next 1716 net/disk_cache/blockfile/backend_impl.cc EntryImpl* BackendImpl::GetEnumeratedEntry(CacheRankingsBlock* next, next 1718 net/disk_cache/blockfile/backend_impl.cc if (!next || disabled_) next 1722 net/disk_cache/blockfile/backend_impl.cc int rv = NewEntry(Addr(next->Data()->contents), &entry); next 1725 net/disk_cache/blockfile/backend_impl.cc rankings_.Remove(next, list, false); next 1728 net/disk_cache/blockfile/backend_impl.cc DeleteBlock(next->address(), true); next 320 net/disk_cache/blockfile/backend_impl.h EntryImpl* GetEnumeratedEntry(CacheRankingsBlock* next, Rankings::List list); next 621 net/disk_cache/blockfile/backend_impl_v3.cc EntryImpl* next = OpenNextEntryImpl(&iter); next 622 net/disk_cache/blockfile/backend_impl_v3.cc if (!next) next 625 net/disk_cache/blockfile/backend_impl_v3.cc while (next) { next 626 net/disk_cache/blockfile/backend_impl_v3.cc node = next; next 627 net/disk_cache/blockfile/backend_impl_v3.cc next = OpenNextEntryImpl(&iter); next 633 net/disk_cache/blockfile/backend_impl_v3.cc if (next) next 634 net/disk_cache/blockfile/backend_impl_v3.cc next->Release(); next 635 net/disk_cache/blockfile/backend_impl_v3.cc next = NULL; next 103 net/disk_cache/blockfile/disk_format.h CacheAddr next; // Next entry with the same hash or bucket. next 141 net/disk_cache/blockfile/disk_format.h CacheAddr next; // LRU list. next 191 net/disk_cache/blockfile/disk_format_v3.h int32 next; next 518 net/disk_cache/blockfile/entry_impl.cc return entry_.Data()->next; next 523 net/disk_cache/blockfile/entry_impl.cc entry_.Data()->next = address.value(); next 587 net/disk_cache/blockfile/entry_impl.cc Addr next_addr(stored->next); next 349 net/disk_cache/blockfile/entry_impl_v3.cc Addr next_addr(stored->next); next 127 net/disk_cache/blockfile/eviction.cc Rankings::ScopedRankingsBlock next( next 131 net/disk_cache/blockfile/eviction.cc while ((header_->num_bytes > target_size || test_mode_) && next.get()) { next 133 net/disk_cache/blockfile/eviction.cc if (!next->HasData()) next 135 net/disk_cache/blockfile/eviction.cc node.reset(next.release()); next 136 net/disk_cache/blockfile/eviction.cc next.reset(rankings_->GetPrev(node.get(), Rankings::NO_USE)); next 322 net/disk_cache/blockfile/eviction.cc Rankings::ScopedRankingsBlock next[kListsToSearch]; next 328 net/disk_cache/blockfile/eviction.cc next[i].set_rankings(rankings_); next 331 net/disk_cache/blockfile/eviction.cc next[i].reset(rankings_->GetPrev(NULL, static_cast<Rankings::List>(i))); next 332 net/disk_cache/blockfile/eviction.cc if (!empty && NodeIsOldEnough(next[i].get(), i)) { next 340 net/disk_cache/blockfile/eviction.cc list = SelectListByLength(next); next 351 net/disk_cache/blockfile/eviction.cc next[list].get()) { next 353 net/disk_cache/blockfile/eviction.cc if (!next[list]->HasData()) next 355 net/disk_cache/blockfile/eviction.cc node.reset(next[list].release()); next 356 net/disk_cache/blockfile/eviction.cc next[list].reset(rankings_->GetPrev(node.get(), next 501 net/disk_cache/blockfile/eviction.cc Rankings::ScopedRankingsBlock next( next 504 net/disk_cache/blockfile/eviction.cc while (next.get() && next 507 net/disk_cache/blockfile/eviction.cc node.reset(next.release()); next 508 net/disk_cache/blockfile/eviction.cc next.reset(rankings_->GetPrev(node.get(), Rankings::DELETED)); next 553 net/disk_cache/blockfile/eviction.cc int Eviction::SelectListByLength(Rankings::ScopedRankingsBlock* next) { next 566 net/disk_cache/blockfile/eviction.cc if (!NodeIsOldEnough(next[list].get(), 0) && next 69 net/disk_cache/blockfile/eviction.h int SelectListByLength(Rankings::ScopedRankingsBlock* next); next 132 net/disk_cache/blockfile/eviction_v3.cc Rankings::ScopedRankingsBlock next( next 136 net/disk_cache/blockfile/eviction_v3.cc while ((header_->num_bytes > target_size || test_mode_) && next.get()) { next 138 net/disk_cache/blockfile/eviction_v3.cc if (!next->HasData()) next 140 net/disk_cache/blockfile/eviction_v3.cc node.reset(next.release()); next 141 net/disk_cache/blockfile/eviction_v3.cc next.reset(rankings_->GetPrev(node.get(), Rankings::NO_USE)); next 311 net/disk_cache/blockfile/eviction_v3.cc Rankings::ScopedRankingsBlock next[kListsToSearch]; next 317 net/disk_cache/blockfile/eviction_v3.cc next[i].set_rankings(rankings_); next 320 net/disk_cache/blockfile/eviction_v3.cc next[i].reset(rankings_->GetPrev(NULL, static_cast<Rankings::List>(i))); next 321 net/disk_cache/blockfile/eviction_v3.cc if (!empty && NodeIsOldEnough(next[i].get(), i)) { next 329 net/disk_cache/blockfile/eviction_v3.cc list = SelectListByLength(next); next 340 net/disk_cache/blockfile/eviction_v3.cc next[list].get()) { next 342 net/disk_cache/blockfile/eviction_v3.cc if (!next[list]->HasData()) next 344 net/disk_cache/blockfile/eviction_v3.cc node.reset(next[list].release()); next 345 net/disk_cache/blockfile/eviction_v3.cc next[list].reset(rankings_->GetPrev(node.get(), next 398 net/disk_cache/blockfile/eviction_v3.cc Rankings::ScopedRankingsBlock next( next 401 net/disk_cache/blockfile/eviction_v3.cc while (next.get() && next 404 net/disk_cache/blockfile/eviction_v3.cc node.reset(next.release()); next 405 net/disk_cache/blockfile/eviction_v3.cc next.reset(rankings_->GetPrev(node.get(), Rankings::DELETED)); next 464 net/disk_cache/blockfile/eviction_v3.cc int EvictionV3::SelectListByLength(Rankings::ScopedRankingsBlock* next) { next 477 net/disk_cache/blockfile/eviction_v3.cc if (!NodeIsOldEnough(next[list].get(), 0) && next 210 net/disk_cache/blockfile/index_table_v3.cc if (!(*bucket)->next) next 213 net/disk_cache/blockfile/index_table_v3.cc int bucket_num = (*bucket)->next / disk_cache::kCellsPerBucket; next 220 net/disk_cache/blockfile/index_table_v3.cc (*bucket)->next = 0; next 641 net/disk_cache/blockfile/index_table_v3.cc bucket->next = cell_num; next 270 net/disk_cache/blockfile/rankings.cc node->Data()->next = my_head.value(); next 276 net/disk_cache/blockfile/rankings.cc node->Data()->next = my_tail.value(); next 320 net/disk_cache/blockfile/rankings.cc node->Data()->next, node->Data()->prev, list); next 325 net/disk_cache/blockfile/rankings.cc Addr next_addr(node->Data()->next); next 336 net/disk_cache/blockfile/rankings.cc CacheRankingsBlock next(backend_->File(next_addr), next_addr); next 338 net/disk_cache/blockfile/rankings.cc if (!GetRanking(&next) || !GetRanking(&prev)) { next 343 net/disk_cache/blockfile/rankings.cc if (!CheckLinks(node, &prev, &next, &list)) next 347 net/disk_cache/blockfile/rankings.cc prev.Data()->next = next.address().value(); next 348 net/disk_cache/blockfile/rankings.cc next.Data()->prev = prev.address().value(); next 364 net/disk_cache/blockfile/rankings.cc my_head.set_value(next.address().value()); next 365 net/disk_cache/blockfile/rankings.cc next.Data()->prev = next.address().value(); next 371 net/disk_cache/blockfile/rankings.cc prev.Data()->next = prev.address().value(); next 383 net/disk_cache/blockfile/rankings.cc node->Data()->next = 0; next 388 net/disk_cache/blockfile/rankings.cc next.Store(); next 394 net/disk_cache/blockfile/rankings.cc UpdateIterators(&next); next 418 net/disk_cache/blockfile/rankings.cc ScopedRankingsBlock next(this); next 423 net/disk_cache/blockfile/rankings.cc next.reset(new CacheRankingsBlock(backend_->File(my_head), my_head)); next 432 net/disk_cache/blockfile/rankings.cc Addr address(node->Data()->next); next 435 net/disk_cache/blockfile/rankings.cc next.reset(new CacheRankingsBlock(backend_->File(address), address)); next 438 net/disk_cache/blockfile/rankings.cc TrackRankingsBlock(next.get(), true); next 440 net/disk_cache/blockfile/rankings.cc if (!GetRanking(next.get())) next 443 net/disk_cache/blockfile/rankings.cc ConvertToLongLived(next.get()); next 444 net/disk_cache/blockfile/rankings.cc if (node && !CheckSingleLink(node, next.get())) next 447 net/disk_cache/blockfile/rankings.cc return next.release(); next 520 net/disk_cache/blockfile/rankings.cc if ((!data->next && data->prev) || (data->next && !data->prev)) next 524 net/disk_cache/blockfile/rankings.cc if (!data->next && !data->prev && from_list) next 531 net/disk_cache/blockfile/rankings.cc if ((node->address().value() == data->next) && !IsTail(data->next, &list)) next 534 net/disk_cache/blockfile/rankings.cc if (!data->next && !data->prev) next 537 net/disk_cache/blockfile/rankings.cc Addr next_addr(data->next); next 677 net/disk_cache/blockfile/rankings.cc node->Data()->next = my_tail.value(); next 688 net/disk_cache/blockfile/rankings.cc Addr next_addr(node->Data()->next); next 702 net/disk_cache/blockfile/rankings.cc CacheRankingsBlock next(backend_->File(next_addr), next_addr); next 704 net/disk_cache/blockfile/rankings.cc if (!next.Load() || !prev.Load()) next 708 net/disk_cache/blockfile/rankings.cc DCHECK(prev.Data()->next == node_value || next 709 net/disk_cache/blockfile/rankings.cc prev.Data()->next == prev_addr.value() || next 710 net/disk_cache/blockfile/rankings.cc prev.Data()->next == next.address().value()); next 711 net/disk_cache/blockfile/rankings.cc DCHECK(next.Data()->prev == node_value || next 712 net/disk_cache/blockfile/rankings.cc next.Data()->prev == next_addr.value() || next 713 net/disk_cache/blockfile/rankings.cc next.Data()->prev == prev.address().value()); next 716 net/disk_cache/blockfile/rankings.cc prev.Data()->next = node_value; next 718 net/disk_cache/blockfile/rankings.cc next.Data()->prev = node_value; next 728 net/disk_cache/blockfile/rankings.cc } else if (my_head.value() == next.address().value()) { next 730 net/disk_cache/blockfile/rankings.cc prev.Data()->next = next.address().value(); next 734 net/disk_cache/blockfile/rankings.cc next.Data()->prev = prev.address().value(); next 738 net/disk_cache/blockfile/rankings.cc next.Store(); next 746 net/disk_cache/blockfile/rankings.cc CacheRankingsBlock* next, List* list) { next 748 net/disk_cache/blockfile/rankings.cc if (prev->Data()->next == node_addr && next 749 net/disk_cache/blockfile/rankings.cc next->Data()->prev == node_addr) { next 755 net/disk_cache/blockfile/rankings.cc prev->Data()->next, next->Data()->prev); next 758 net/disk_cache/blockfile/rankings.cc node_addr != next->address().value() && next 759 net/disk_cache/blockfile/rankings.cc prev->Data()->next == next->address().value() && next 760 net/disk_cache/blockfile/rankings.cc next->Data()->prev == prev->address().value()) { next 763 net/disk_cache/blockfile/rankings.cc node->Data()->next = 0; next 769 net/disk_cache/blockfile/rankings.cc if (prev->Data()->next == node_addr || next 770 net/disk_cache/blockfile/rankings.cc next->Data()->prev == node_addr) { next 772 net/disk_cache/blockfile/rankings.cc if (prev->Data()->next != node_addr && IsHead(node_addr, list)) next 775 net/disk_cache/blockfile/rankings.cc if (next->Data()->prev != node_addr && IsTail(node_addr, list)) next 787 net/disk_cache/blockfile/rankings.cc CacheRankingsBlock* next) { next 788 net/disk_cache/blockfile/rankings.cc if (prev->Data()->next != next->address().value() || next 789 net/disk_cache/blockfile/rankings.cc next->Data()->prev != prev->address().value()) { next 832 net/disk_cache/blockfile/rankings.cc CacheAddr next = forward ? node->Data()->next : node->Data()->prev; next 833 net/disk_cache/blockfile/rankings.cc CacheAddr prev = forward ? node->Data()->prev : node->Data()->next; next 838 net/disk_cache/blockfile/rankings.cc Addr next_addr(next); next 171 net/disk_cache/blockfile/rankings.h CacheRankingsBlock* next, List* list); next 174 net/disk_cache/blockfile/rankings.h bool CheckSingleLink(CacheRankingsBlock* prev, CacheRankingsBlock* next); next 308 net/disk_cache/memory/mem_backend_impl.cc MemEntryImpl* next = rankings_.GetPrev(NULL); next 309 net/disk_cache/memory/mem_backend_impl.cc if (!next) next 313 net/disk_cache/memory/mem_backend_impl.cc while (current_size_ > target_size && next) { next 314 net/disk_cache/memory/mem_backend_impl.cc MemEntryImpl* node = next; next 315 net/disk_cache/memory/mem_backend_impl.cc next = rankings_.GetPrev(next); next 65 net/disk_cache/memory/mem_entry_impl.h MemEntryImpl* next() const { next 73 net/disk_cache/memory/mem_entry_impl.h void set_next(MemEntryImpl* next) { next 74 net/disk_cache/memory/mem_entry_impl.h next_ = next; next 30 net/disk_cache/memory/mem_rankings.cc MemEntryImpl* next = node->next(); next 33 net/disk_cache/memory/mem_rankings.cc head_ = next; next 39 net/disk_cache/memory/mem_rankings.cc prev->set_next(next); next 41 net/disk_cache/memory/mem_rankings.cc if (next) next 42 net/disk_cache/memory/mem_rankings.cc next->set_prev(prev); next 57 net/disk_cache/memory/mem_rankings.cc return node->next(); next 135 net/dns/dns_response.cc const char* next = cur_ + consumed + 2 * sizeof(uint16); // QTYPE + QCLASS next 136 net/dns/dns_response.cc if (next > packet_ + length_) next 139 net/dns/dns_response.cc cur_ = next; next 1028 net/http/http_cache.cc Transaction* next = entry->pending_queue.front(); next 1029 net/http/http_cache.cc if ((next->mode() & Transaction::WRITE) && !entry->readers.empty()) next 1034 net/http/http_cache.cc int rv = AddTransactionToEntry(entry, next); next 1036 net/http/http_cache.cc next->io_callback().Run(rv); next 446 net/proxy/proxy_config_service_linux.cc for (GSList *it = list; it; it = it->next) { next 40 net/quic/crypto/strike_register.cc void SetNextPtr(uint32 next) { data_[0] = next; } next 253 net/quic/crypto/strike_register.cc i = internal_nodes_[i].next()) { next 296 net/quic/crypto/strike_register.cc uint32 next = internal_node_head_ >> 8; next 297 net/quic/crypto/strike_register.cc while ((next & kExternalFlag) == 0) { next 298 net/quic/crypto/strike_register.cc InternalNode* node = &internal_nodes_[next]; next 302 net/quic/crypto/strike_register.cc next = node->child(direction); next 305 net/quic/crypto/strike_register.cc return next & ~kExternalFlag; next 334 net/quic/crypto/strike_register.cc internal_node_free_head_ = internal_nodes_[index].next(); next 1702 net/quic/quic_connection.cc FecGroupMap::iterator next = it; next 1703 net/quic/quic_connection.cc ++next; next 1706 net/quic/quic_connection.cc it = next; next 43 net/quic/test_tools/test_task_runner.cc std::vector<PostedTask>::iterator next = FindNextTask(); next 44 net/quic/test_tools/test_task_runner.cc DCHECK(next != tasks_.end()); next 46 net/quic/test_tools/test_task_runner.cc (next->GetTimeToRun() - clock_->NowInTicks()).InMicroseconds())); next 47 net/quic/test_tools/test_task_runner.cc PostedTask task = *next; next 48 net/quic/test_tools/test_task_runner.cc tasks_.erase(next); next 70 net/spdy/hpack_huffman_table_test.cc const DecodeEntry& next = entries[i + j]; next 71 net/spdy/hpack_huffman_table_test.cc if (next.next_table_index != entry.next_table_index || next 72 net/spdy/hpack_huffman_table_test.cc next.length != entry.length || next 73 net/spdy/hpack_huffman_table_test.cc next.symbol_id != entry.symbol_id) next 468 net/spdy/spdy_priority_forest.h for (Node* next = node; next->child != NodeId();) { next 469 net/spdy/spdy_priority_forest.h DCHECK(NodeExists(next->child)); next 470 net/spdy/spdy_priority_forest.h Node *child = &all_nodes_[next->child]; next 476 net/spdy/spdy_priority_forest.h group.push_back(next->child); next 478 net/spdy/spdy_priority_forest.h next = child; next 7148 net/third_party/nss/ssl/ssl3con.c struct dnameNode *next; next 7252 net/third_party/nss/ssl/ssl3con.c node->next = PORT_ArenaZNew(arena, dnameNode); next 7253 net/third_party/nss/ssl/ssl3con.c node = node->next; next 7265 net/third_party/nss/ssl/ssl3con.c i++, node = node->next) { next 10103 net/third_party/nss/ssl/ssl3con.c for (; certs; certs = certs->next) { next 10127 net/third_party/nss/ssl/ssl3con.c c->next = NULL; next 10129 net/third_party/nss/ssl/ssl3con.c lastCert->next = c; next 10143 net/third_party/nss/ssl/ssl3con.c for (; i < MAX_PEER_CERT_CHAIN_SIZE && c; i++, c = c->next) { next 10338 net/third_party/nss/ssl/ssl3con.c c->next = NULL; next 10340 net/third_party/nss/ssl/ssl3con.c lastCert->next = c; next 57 net/third_party/nss/ssl/sslauth.c for (cur = ss->ssl3.peerCertChain; cur; cur = cur->next) { next 186 net/third_party/nss/ssl/sslimpl.h struct ssl3CertNodeStr *next; next 626 net/third_party/nss/ssl/sslimpl.h sslSessionID * next; /* chain used for client sockets, only */ next 231 net/third_party/nss/ssl/sslnonce.c *sidp = sid->next; /* delink it from the list. */ next 254 net/third_party/nss/ssl/sslnonce.c sidp = &sid->next; next 330 net/third_party/nss/ssl/sslnonce.c sid->next = cache; next 372 net/third_party/nss/ssl/sslnonce.c *sidp = zap->next; next 377 net/third_party/nss/ssl/sslnonce.c sidp = &sid->next; next 156 net/third_party/nss/ssl/sslsnce.c PRIntn next; next 695 net/third_party/nss/ssl/sslsnce.c PRUint32 ndx = cache->sidCacheSets[setNum].next; next 911 net/third_party/nss/ssl/sslsnce.c PRUint32 next = cache->sidCacheSets[set].next; next 912 net/third_party/nss/ssl/sslsnce.c PRUint32 ndx = set * SID_CACHE_ENTRIES_PER_SET + next; next 917 net/third_party/nss/ssl/sslsnce.c cache->sidCacheSets[set].next = next 918 net/third_party/nss/ssl/sslsnce.c (next + 1) % SID_CACHE_ENTRIES_PER_SET; next 247 net/tools/dump_cache/dump_files.cc next_addr_ = entry->next; next 282 net/tools/dump_cache/dump_files.cc printf("next entry: 0x%x\n", entry.next); next 298 net/tools/dump_cache/dump_files.cc printf("next: 0x%x\n", rankings.next); next 97 net/websockets/websocket_extension_parser.cc char next = current_[1]; next 98 net/websockets/websocket_extension_parser.cc if (IsControl(next) || IsSeparator(next)) break; next 99 net/websockets/websocket_extension_parser.cc *token += next; next 37 ppapi/examples/2d/graphics_2d_example.c struct InstanceInfo* next; next 107 ppapi/examples/2d/graphics_2d_example.c cur = cur->next; next 123 ppapi/examples/2d/graphics_2d_example.c info->next = all_instances; next 136 ppapi/examples/2d/graphics_2d_example.c *prev_ptr = cur->next; next 140 ppapi/examples/2d/graphics_2d_example.c prev_ptr = &cur->next; next 141 ppapi/examples/2d/graphics_2d_example.c cur = cur->next; next 6159 ppapi/native_client/src/untrusted/pnacl_irt_shim/pnacl_shim.c struct __PnaclWrapperInfo **next = s_ppb_wrappers; next 6160 ppapi/native_client/src/untrusted/pnacl_irt_shim/pnacl_shim.c while (*next != NULL) { next 6161 ppapi/native_client/src/untrusted/pnacl_irt_shim/pnacl_shim.c if (mystrcmp(name, (*next)->iface_macro) == 0) return *next; next 6162 ppapi/native_client/src/untrusted/pnacl_irt_shim/pnacl_shim.c ++next; next 6170 ppapi/native_client/src/untrusted/pnacl_irt_shim/pnacl_shim.c struct __PnaclWrapperInfo **next = s_ppp_wrappers; next 6171 ppapi/native_client/src/untrusted/pnacl_irt_shim/pnacl_shim.c while (*next != NULL) { next 6172 ppapi/native_client/src/untrusted/pnacl_irt_shim/pnacl_shim.c if (mystrcmp(name, (*next)->iface_macro) == 0) return *next; next 6173 ppapi/native_client/src/untrusted/pnacl_irt_shim/pnacl_shim.c ++next; next 62 ppapi/proxy/file_chooser_resource.cc PP_Resource next = file_queue_.front(); next 64 ppapi/proxy/file_chooser_resource.cc return next; next 59 ppapi/tests/test_trace_event.cc int64_t next = interface_->Now(); next 60 ppapi/tests/test_trace_event.cc ASSERT_LE(last, next); next 61 ppapi/tests/test_trace_event.cc last = next; next 383 printing/android/java/src/org/chromium/printing/PrintingControllerImpl.java ret[i] = iterator.next().intValue(); next 165 remoting/host/win/host_service.cc std::list<RegisteredObserver>::iterator next = i; next 166 remoting/host/win/host_service.cc ++next; next 174 remoting/host/win/host_service.cc i = next; next 191 remoting/host/win/host_service.cc std::list<RegisteredObserver>::iterator j = next; next 199 remoting/host/win/host_service.cc i = next; next 27 sandbox/linux/seccomp-bpf/codegen.cc TraverseRecursively(visited, instruction->next); next 140 sandbox/linux/seccomp-bpf/codegen.cc Instruction* next) { next 150 sandbox/linux/seccomp-bpf/codegen.cc if (next && BPF_CLASS(code) == BPF_RET) { next 155 sandbox/linux/seccomp-bpf/codegen.cc Instruction* insn = new Instruction(code, 0, next, NULL); next 160 sandbox/linux/seccomp-bpf/codegen.cc Instruction* insn = new Instruction(code, k, next); next 217 sandbox/linux/seccomp-bpf/codegen.cc } else if (head->next) { next 220 sandbox/linux/seccomp-bpf/codegen.cc head->next = tail; next 271 sandbox/linux/seccomp-bpf/codegen.cc if (!insn->next != (BPF_CLASS(insn->code) == BPF_RET)) { next 276 sandbox/linux/seccomp-bpf/codegen.cc if (seen_instructions.find(insn->next) == seen_instructions.end()) { next 277 sandbox/linux/seccomp-bpf/codegen.cc insn = insn->next; next 314 sandbox/linux/seccomp-bpf/codegen.cc for (;; head = head->next) { next 406 sandbox/linux/seccomp-bpf/codegen.cc insn = insn->next; next 457 sandbox/linux/seccomp-bpf/codegen.cc CHECK(insns1_last->next); next 458 sandbox/linux/seccomp-bpf/codegen.cc CHECK(insns2_last->next); next 459 sandbox/linux/seccomp-bpf/codegen.cc return PointerCompare(blocks.find(insns1_last->next)->second, next 460 sandbox/linux/seccomp-bpf/codegen.cc blocks.find(insns2_last->next)->second, next 577 sandbox/linux/seccomp-bpf/codegen.cc ComputeIncomingBranches(targets_to_blocks.find(last_insn->next)->second, next 628 sandbox/linux/seccomp-bpf/codegen.cc iter = blocks.find(last_insn->next); next 636 sandbox/linux/seccomp-bpf/codegen.cc Instruction* ja = MakeInstruction(BPF_JMP + BPF_JA, 0, last_insn->next); next 638 sandbox/linux/seccomp-bpf/codegen.cc last_insn->next = ja; next 721 sandbox/linux/seccomp-bpf/codegen.cc targets_to_blocks.find(insn->next)->second != last_bb) { next 71 sandbox/linux/seccomp-bpf/codegen.h Instruction* next = NULL); next 95 sandbox/linux/seccomp-bpf/codegen_unittest.cc SANDBOX_ASSERT(insn0->next == NULL); next 105 sandbox/linux/seccomp-bpf/codegen_unittest.cc SANDBOX_ASSERT(insn2->next == NULL); next 123 sandbox/linux/seccomp-bpf/codegen_unittest.cc SANDBOX_ASSERT(insn0->next == insn2); next 130 sandbox/linux/seccomp-bpf/codegen_unittest.cc SANDBOX_ASSERT(insn5->next == insn4); next 292 sandbox/linux/seccomp-bpf/codegen_unittest.cc SANDBOX_ASSERT(insn->next == NULL); next 299 sandbox/linux/seccomp-bpf/codegen_unittest.cc SANDBOX_ASSERT(insn->next != NULL); next 300 sandbox/linux/seccomp-bpf/codegen_unittest.cc insn = insn->next; next 358 sandbox/linux/seccomp-bpf/codegen_unittest.cc branch_targets.find(insn->next) != branch_targets.end()); next 432 sandbox/linux/seccomp-bpf/codegen_unittest.cc bb = all_blocks[insn->next]; next 470 sandbox/linux/seccomp-bpf/codegen_unittest.cc for (const Instruction* insn = prg, *next; insn; insn = next) { next 474 sandbox/linux/seccomp-bpf/codegen_unittest.cc next = insn->jt_ptr; next 478 sandbox/linux/seccomp-bpf/codegen_unittest.cc next = insn->jt_ptr; next 482 sandbox/linux/seccomp-bpf/codegen_unittest.cc next = NULL; next 484 sandbox/linux/seccomp-bpf/codegen_unittest.cc next = source_stack.back(); next 488 sandbox/linux/seccomp-bpf/codegen_unittest.cc next = insn->next; next 30 sandbox/linux/seccomp-bpf/instruction.h : code(c), next(n), k(parm) {} next 55 sandbox/linux/seccomp-bpf/instruction.h Instruction* next; next 17 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc uint32_t next = iter.Next(); next 21 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc SANDBOX_ASSERT(next == 0); next 23 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc for (uint32_t last = next; !iter.Done(); last = next) { next 24 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc next = iter.Next(); next 25 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc SANDBOX_ASSERT(last < next); next 28 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc SANDBOX_ASSERT(next == 0xFFFFFFFFu); next 34 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc uint32_t next = iter.Next(); next 41 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc SANDBOX_ASSERT(next == MIN_SYSCALL); next 42 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc for (uint32_t last = next; next < MAX_PUBLIC_SYSCALL + 1; last = next) { next 43 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc SANDBOX_ASSERT((next = iter.Next()) == last + 1); next 45 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc SANDBOX_ASSERT(next == MAX_PUBLIC_SYSCALL + 1); next 51 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc uint32_t next = iter.Next(); next 52 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc while (next < MIN_PRIVATE_SYSCALL - 1) { next 53 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc next = iter.Next(); next 57 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc SANDBOX_ASSERT(next == MIN_PRIVATE_SYSCALL - 1); next 58 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc for (uint32_t last = next; next < MAX_PRIVATE_SYSCALL + 1; last = next) { next 59 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc SANDBOX_ASSERT((next = iter.Next()) == last + 1); next 61 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc SANDBOX_ASSERT(next == MAX_PRIVATE_SYSCALL + 1); next 66 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc uint32_t next = iter.Next(); next 67 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc while (next < MIN_GHOST_SYSCALL - 1) { next 68 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc next = iter.Next(); next 72 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc SANDBOX_ASSERT(next == MIN_GHOST_SYSCALL - 1); next 73 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc for (uint32_t last = next; next < MAX_SYSCALL + 1; last = next) { next 74 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc SANDBOX_ASSERT((next = iter.Next()) == last + 1); next 76 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc SANDBOX_ASSERT(next == MAX_SYSCALL + 1); next 84 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc uint32_t next = iter.Next(); next 86 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc while (next < MAX_SYSCALL + 1) { next 87 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc next = iter.Next(); next 90 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc SANDBOX_ASSERT(next == MAX_SYSCALL + 1); next 91 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc while (next < 0x7FFFFFFFu) { next 92 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc next = iter.Next(); next 96 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc SANDBOX_ASSERT(next == 0x7FFFFFFFu); next 97 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc next = iter.Next(); next 98 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc SANDBOX_ASSERT(next == 0x80000000u); next 100 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc next = iter.Next(); next 102 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc SANDBOX_ASSERT(next == 0xFFFFFFFFu); next 109 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc uint32_t next = iter.Next(); next 114 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc SANDBOX_ASSERT(next == MAX_PUBLIC_SYSCALL + 1); next 117 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc next = iter.Next(); next 119 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc SANDBOX_ASSERT(next == MIN_PRIVATE_SYSCALL - 1); next 120 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc while (next <= MAX_PRIVATE_SYSCALL) { next 121 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc next = iter.Next(); next 124 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc next = iter.Next(); next 126 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc SANDBOX_ASSERT(next == MIN_GHOST_SYSCALL - 1); next 127 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc while (next <= MAX_SYSCALL) { next 128 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc next = iter.Next(); next 130 sandbox/linux/seccomp-bpf/syscall_iterator_unittest.cc SANDBOX_ASSERT(next == MAX_SYSCALL + 1); next 68 sandbox/win/wow_helper/wow_helper.cc wchar_t* next; next 69 sandbox/win/wow_helper/wow_helper.cc DWORD process_id = wcstoul(command_line, &next, 0); next 78 sandbox/win/wow_helper/wow_helper.cc DWORD buffer = wcstoul(next, NULL, 0); next 47 skia/ext/platform_device_mac.cc for (SkPath::Verb verb = iter.next(points); verb != SkPath::kDone_Verb; next 48 skia/ext/platform_device_mac.cc verb = iter.next(points)) { next 150 skia/ext/platform_device_win.cc for (SkPath::Verb verb = iter.next(current_points); next 152 skia/ext/platform_device_win.cc verb = iter.next(current_points)) { next 188 sync/internal_api/change_reorder_buffer.cc int64 next = to_visit.front(); next 192 sync/internal_api/change_reorder_buffer.cc i = operations_.find(next); next 195 sync/internal_api/change_reorder_buffer.cc record.id = next; next 205 sync/internal_api/change_reorder_buffer.cc Traversal::LinkSet::const_iterator j = traversal.begin_children(next); next 206 sync/internal_api/change_reorder_buffer.cc Traversal::LinkSet::const_iterator end = traversal.end_children(next); next 208 sync/internal_api/change_reorder_buffer.cc CHECK(j->first == next); next 218 third_party/expat/files/lib/xmlparse.c struct block *next; next 294 third_party/expat/files/lib/xmlparse.c struct open_internal_entity *next; next 328 third_party/expat/files/lib/xmlparse.c const char *s, const char *next); next 333 third_party/expat/files/lib/xmlparse.c const char *end, int tok, const char *next, const char **nextPtr, next 945 third_party/expat/files/lib/xmlparse.c openEntityList = openEntity->next; next 946 third_party/expat/files/lib/xmlparse.c openEntity->next = freeInternalEntities; next 1163 third_party/expat/files/lib/xmlparse.c entityList = entityList->next; next 2133 third_party/expat/files/lib/xmlparse.c const char *next = start; /* XmlContentTok doesn't always set the last arg */ next 2134 third_party/expat/files/lib/xmlparse.c int tok = XmlContentTok(encoding, start, end, &next); next 2142 third_party/expat/files/lib/xmlparse.c if (next == end && !ps_finalBuffer) { next 2143 third_party/expat/files/lib/xmlparse.c *endPtr = next; next 2146 third_party/expat/files/lib/xmlparse.c start = next; next 2174 third_party/expat/files/lib/xmlparse.c const char *next = start; /* XmlContentTok doesn't always set the last arg */ next 2176 third_party/expat/files/lib/xmlparse.c tok = XmlContentTok(encoding, start, end, &next); next 2177 third_party/expat/files/lib/xmlparse.c eventEndPtr = next; next 2183 third_party/expat/files/lib/xmlparse.c result = processXmlDecl(parser, 1, start, next); next 2188 third_party/expat/files/lib/xmlparse.c *endPtr = next; next 2193 third_party/expat/files/lib/xmlparse.c start = next; next 2255 third_party/expat/files/lib/xmlparse.c const char *next = s; /* XmlContentTok doesn't always set the last arg */ next 2256 third_party/expat/files/lib/xmlparse.c int tok = XmlContentTok(enc, s, end, &next); next 2257 third_party/expat/files/lib/xmlparse.c *eventEndPP = next; next 2293 third_party/expat/files/lib/xmlparse.c *eventPP = next; next 2313 third_party/expat/files/lib/xmlparse.c next - enc->minBytesPerChar); next 2318 third_party/expat/files/lib/xmlparse.c reportDefault(parser, enc, s, next); next 2323 third_party/expat/files/lib/xmlparse.c next - enc->minBytesPerChar); next 2342 third_party/expat/files/lib/xmlparse.c reportDefault(parser, enc, s, next); next 2355 third_party/expat/files/lib/xmlparse.c reportDefault(parser, enc, s, next); next 2378 third_party/expat/files/lib/xmlparse.c reportDefault(parser, enc, s, next); next 2446 third_party/expat/files/lib/xmlparse.c reportDefault(parser, enc, s, next); next 2479 third_party/expat/files/lib/xmlparse.c reportDefault(parser, enc, s, next); next 2492 third_party/expat/files/lib/xmlparse.c return epilogProcessor(parser, next, end, nextPtr); next 2535 third_party/expat/files/lib/xmlparse.c reportDefault(parser, enc, s, next); next 2546 third_party/expat/files/lib/xmlparse.c return epilogProcessor(parser, next, end, nextPtr); next 2559 third_party/expat/files/lib/xmlparse.c reportDefault(parser, enc, s, next); next 2570 third_party/expat/files/lib/xmlparse.c reportDefault(parser, enc, s, next); next 2594 third_party/expat/files/lib/xmlparse.c reportDefault(parser, enc, s, next); next 2595 third_party/expat/files/lib/xmlparse.c result = doCdataSection(parser, enc, &next, end, nextPtr, haveMore); next 2598 third_party/expat/files/lib/xmlparse.c else if (!next) { next 2643 third_party/expat/files/lib/xmlparse.c XmlConvert(enc, &s, next, &dataPtr, (ICHAR *)dataBufEnd); next 2647 third_party/expat/files/lib/xmlparse.c if (s == next) next 2655 third_party/expat/files/lib/xmlparse.c (int)((XML_Char *)next - (XML_Char *)s)); next 2658 third_party/expat/files/lib/xmlparse.c reportDefault(parser, enc, s, next); next 2662 third_party/expat/files/lib/xmlparse.c if (!reportProcessingInstruction(parser, enc, s, next)) next 2666 third_party/expat/files/lib/xmlparse.c if (!reportComment(parser, enc, s, next)) next 2671 third_party/expat/files/lib/xmlparse.c reportDefault(parser, enc, s, next); next 2674 third_party/expat/files/lib/xmlparse.c *eventPP = s = next; next 2677 third_party/expat/files/lib/xmlparse.c *nextPtr = next; next 3216 third_party/expat/files/lib/xmlparse.c const char *next; next 3217 third_party/expat/files/lib/xmlparse.c int tok = XmlCdataSectionTok(enc, s, end, &next); next 3218 third_party/expat/files/lib/xmlparse.c *eventEndPP = next; next 3229 third_party/expat/files/lib/xmlparse.c reportDefault(parser, enc, s, next); next 3230 third_party/expat/files/lib/xmlparse.c *startPtr = next; next 3231 third_party/expat/files/lib/xmlparse.c *nextPtr = next; next 3242 third_party/expat/files/lib/xmlparse.c reportDefault(parser, enc, s, next); next 3251 third_party/expat/files/lib/xmlparse.c XmlConvert(enc, &s, next, &dataPtr, (ICHAR *)dataBufEnd); next 3252 third_party/expat/files/lib/xmlparse.c *eventEndPP = next; next 3255 third_party/expat/files/lib/xmlparse.c if (s == next) next 3263 third_party/expat/files/lib/xmlparse.c (int)((XML_Char *)next - (XML_Char *)s)); next 3266 third_party/expat/files/lib/xmlparse.c reportDefault(parser, enc, s, next); next 3270 third_party/expat/files/lib/xmlparse.c *eventPP = next; next 3286 third_party/expat/files/lib/xmlparse.c *eventPP = next; next 3290 third_party/expat/files/lib/xmlparse.c *eventPP = s = next; next 3293 third_party/expat/files/lib/xmlparse.c *nextPtr = next; next 3336 third_party/expat/files/lib/xmlparse.c const char *next; next 3352 third_party/expat/files/lib/xmlparse.c tok = XmlIgnoreSectionTok(enc, s, end, &next); next 3353 third_party/expat/files/lib/xmlparse.c *eventEndPP = next; next 3357 third_party/expat/files/lib/xmlparse.c reportDefault(parser, enc, s, next); next 3358 third_party/expat/files/lib/xmlparse.c *startPtr = next; next 3359 third_party/expat/files/lib/xmlparse.c *nextPtr = next; next 3365 third_party/expat/files/lib/xmlparse.c *eventPP = next; next 3381 third_party/expat/files/lib/xmlparse.c *eventPP = next; next 3420 third_party/expat/files/lib/xmlparse.c const char *s, const char *next) next 3434 third_party/expat/files/lib/xmlparse.c next, next 3475 third_party/expat/files/lib/xmlparse.c reportDefault(parser, encoding, s, next); next 3593 third_party/expat/files/lib/xmlparse.c const char *next = start; next 3597 third_party/expat/files/lib/xmlparse.c tok = XmlPrologTok(encoding, start, end, &next); next 3598 third_party/expat/files/lib/xmlparse.c eventEndPtr = next; next 3620 third_party/expat/files/lib/xmlparse.c result = processXmlDecl(parser, 0, start, next); next 3625 third_party/expat/files/lib/xmlparse.c *nextPtr = next; next 3630 third_party/expat/files/lib/xmlparse.c *nextPtr = next; next 3634 third_party/expat/files/lib/xmlparse.c return entityValueProcessor(parser, next, end, nextPtr); next 3643 third_party/expat/files/lib/xmlparse.c else if (tok == XML_TOK_BOM && next == end && !ps_finalBuffer) { next 3644 third_party/expat/files/lib/xmlparse.c *nextPtr = next; next 3647 third_party/expat/files/lib/xmlparse.c start = next; next 3658 third_party/expat/files/lib/xmlparse.c const char *next = s; next 3661 third_party/expat/files/lib/xmlparse.c tok = XmlPrologTok(encoding, s, end, &next); next 3684 third_party/expat/files/lib/xmlparse.c s = next; next 3685 third_party/expat/files/lib/xmlparse.c tok = XmlPrologTok(encoding, s, end, &next); next 3689 third_party/expat/files/lib/xmlparse.c return doProlog(parser, encoding, s, end, tok, next, next 3700 third_party/expat/files/lib/xmlparse.c const char *next = s; next 3705 third_party/expat/files/lib/xmlparse.c tok = XmlPrologTok(enc, start, end, &next); next 3725 third_party/expat/files/lib/xmlparse.c start = next; next 3737 third_party/expat/files/lib/xmlparse.c const char *next = s; next 3738 third_party/expat/files/lib/xmlparse.c int tok = XmlPrologTok(encoding, s, end, &next); next 3739 third_party/expat/files/lib/xmlparse.c return doProlog(parser, encoding, s, end, tok, next, next 3749 third_party/expat/files/lib/xmlparse.c const char *next, next 3796 third_party/expat/files/lib/xmlparse.c *eventEndPP = next; next 3804 third_party/expat/files/lib/xmlparse.c *eventPP = next; next 3835 third_party/expat/files/lib/xmlparse.c next = end; next 3839 third_party/expat/files/lib/xmlparse.c role = XmlTokenRole(&prologState, tok, s, next, enc); next 3843 third_party/expat/files/lib/xmlparse.c enum XML_Error result = processXmlDecl(parser, 0, s, next); next 3852 third_party/expat/files/lib/xmlparse.c doctypeName = poolStoreString(&tempPool, enc, s, next); next 3873 third_party/expat/files/lib/xmlparse.c enum XML_Error result = processXmlDecl(parser, 1, s, next); next 3894 third_party/expat/files/lib/xmlparse.c if (!XmlIsPublicId(enc, s, next, eventPP)) next 3898 third_party/expat/files/lib/xmlparse.c next - enc->minBytesPerChar); next 3909 third_party/expat/files/lib/xmlparse.c if (!XmlIsPublicId(enc, s, next, eventPP)) next 3916 third_party/expat/files/lib/xmlparse.c next - enc->minBytesPerChar); next 4018 third_party/expat/files/lib/xmlparse.c declElementType = getElementType(parser, enc, s, next); next 4023 third_party/expat/files/lib/xmlparse.c declAttributeId = getAttributeId(parser, enc, s, next); next 4073 third_party/expat/files/lib/xmlparse.c if (!poolAppend(&tempPool, enc, s, next)) next 4113 third_party/expat/files/lib/xmlparse.c next - enc->minBytesPerChar, next 4148 third_party/expat/files/lib/xmlparse.c next - enc->minBytesPerChar); next 4178 third_party/expat/files/lib/xmlparse.c next - enc->minBytesPerChar); next 4215 third_party/expat/files/lib/xmlparse.c next - enc->minBytesPerChar); next 4240 third_party/expat/files/lib/xmlparse.c declEntity->notation = poolStoreString(&dtd->pool, enc, s, next); next 4269 third_party/expat/files/lib/xmlparse.c if (XmlPredefinedEntityName(enc, s, next)) { next 4274 third_party/expat/files/lib/xmlparse.c const XML_Char *name = poolStoreString(&dtd->pool, enc, s, next); next 4306 third_party/expat/files/lib/xmlparse.c const XML_Char *name = poolStoreString(&dtd->pool, enc, s, next); next 4341 third_party/expat/files/lib/xmlparse.c declNotationName = poolStoreString(&tempPool, enc, s, next); next 4349 third_party/expat/files/lib/xmlparse.c if (!XmlIsPublicId(enc, s, next, eventPP)) next 4355 third_party/expat/files/lib/xmlparse.c next - enc->minBytesPerChar); next 4369 third_party/expat/files/lib/xmlparse.c next - enc->minBytesPerChar); next 4410 third_party/expat/files/lib/xmlparse.c reportDefault(parser, enc, s, next); next 4412 third_party/expat/files/lib/xmlparse.c result = doIgnoreSection(parser, enc, &next, end, nextPtr, haveMore); next 4415 third_party/expat/files/lib/xmlparse.c else if (!next) { next 4488 third_party/expat/files/lib/xmlparse.c next - enc->minBytesPerChar); next 4561 third_party/expat/files/lib/xmlparse.c declElementType = getElementType(parser, enc, s, next); next 4619 third_party/expat/files/lib/xmlparse.c ? next next 4620 third_party/expat/files/lib/xmlparse.c : next - enc->minBytesPerChar); next 4672 third_party/expat/files/lib/xmlparse.c if (!reportProcessingInstruction(parser, enc, s, next)) next 4677 third_party/expat/files/lib/xmlparse.c if (!reportComment(parser, enc, s, next)) next 4711 third_party/expat/files/lib/xmlparse.c reportDefault(parser, enc, s, next); next 4715 third_party/expat/files/lib/xmlparse.c *nextPtr = next; next 4720 third_party/expat/files/lib/xmlparse.c s = next; next 4721 third_party/expat/files/lib/xmlparse.c tok = XmlPrologTok(enc, s, end, &next); next 4736 third_party/expat/files/lib/xmlparse.c const char *next = NULL; next 4737 third_party/expat/files/lib/xmlparse.c int tok = XmlPrologTok(encoding, s, end, &next); next 4738 third_party/expat/files/lib/xmlparse.c eventEndPtr = next; next 4743 third_party/expat/files/lib/xmlparse.c reportDefault(parser, encoding, s, next); next 4747 third_party/expat/files/lib/xmlparse.c *nextPtr = next; next 4754 third_party/expat/files/lib/xmlparse.c reportDefault(parser, encoding, s, next); next 4757 third_party/expat/files/lib/xmlparse.c if (!reportProcessingInstruction(parser, encoding, s, next)) next 4761 third_party/expat/files/lib/xmlparse.c if (!reportComment(parser, encoding, s, next)) next 4765 third_party/expat/files/lib/xmlparse.c eventPtr = next; next 4782 third_party/expat/files/lib/xmlparse.c eventPtr = s = next; next 4785 third_party/expat/files/lib/xmlparse.c *nextPtr = next; next 4799 third_party/expat/files/lib/xmlparse.c const char *next; next 4805 third_party/expat/files/lib/xmlparse.c freeInternalEntities = openEntity->next; next 4814 third_party/expat/files/lib/xmlparse.c openEntity->next = openInternalEntities; next 4826 third_party/expat/files/lib/xmlparse.c int tok = XmlPrologTok(internalEncoding, textStart, textEnd, &next); next 4828 third_party/expat/files/lib/xmlparse.c next, &next, XML_FALSE); next 4833 third_party/expat/files/lib/xmlparse.c textEnd, &next, XML_FALSE); next 4836 third_party/expat/files/lib/xmlparse.c if (textEnd != next && ps_parsing == XML_SUSPENDED) { next 4837 third_party/expat/files/lib/xmlparse.c entity->processed = (int)(next - textStart); next 4842 third_party/expat/files/lib/xmlparse.c openInternalEntities = openEntity->next; next 4844 third_party/expat/files/lib/xmlparse.c openEntity->next = freeInternalEntities; next 4859 third_party/expat/files/lib/xmlparse.c const char *next; next 4871 third_party/expat/files/lib/xmlparse.c int tok = XmlPrologTok(internalEncoding, textStart, textEnd, &next); next 4873 third_party/expat/files/lib/xmlparse.c next, &next, XML_FALSE); next 4878 third_party/expat/files/lib/xmlparse.c textStart, textEnd, &next, XML_FALSE); next 4882 third_party/expat/files/lib/xmlparse.c else if (textEnd != next && ps_parsing == XML_SUSPENDED) { next 4883 third_party/expat/files/lib/xmlparse.c entity->processed = (int)(next - (char *)entity->textPtr); next 4888 third_party/expat/files/lib/xmlparse.c openInternalEntities = openEntity->next; next 4890 third_party/expat/files/lib/xmlparse.c openEntity->next = freeInternalEntities; next 4898 third_party/expat/files/lib/xmlparse.c tok = XmlPrologTok(encoding, s, end, &next); next 4899 third_party/expat/files/lib/xmlparse.c return doProlog(parser, encoding, s, end, tok, next, nextPtr, next 4944 third_party/expat/files/lib/xmlparse.c const char *next; next 4945 third_party/expat/files/lib/xmlparse.c int tok = XmlAttributeValueTok(enc, ptr, end, &next); next 4951 third_party/expat/files/lib/xmlparse.c eventPtr = next; next 4984 third_party/expat/files/lib/xmlparse.c if (!poolAppend(pool, enc, ptr, next)) next 4988 third_party/expat/files/lib/xmlparse.c next = ptr + enc->minBytesPerChar; next 5004 third_party/expat/files/lib/xmlparse.c next - enc->minBytesPerChar); next 5012 third_party/expat/files/lib/xmlparse.c next - enc->minBytesPerChar); next 5082 third_party/expat/files/lib/xmlparse.c ptr = next; next 5109 third_party/expat/files/lib/xmlparse.c const char *next; next 5110 third_party/expat/files/lib/xmlparse.c int tok = XmlEntityValueTok(enc, entityTextPtr, entityTextEnd, &next); next 5119 third_party/expat/files/lib/xmlparse.c next - enc->minBytesPerChar); next 5186 third_party/expat/files/lib/xmlparse.c if (!poolAppend(pool, enc, entityTextPtr, next)) { next 5192 third_party/expat/files/lib/xmlparse.c next = entityTextPtr + enc->minBytesPerChar; next 5235 third_party/expat/files/lib/xmlparse.c eventPtr = next; next 5244 third_party/expat/files/lib/xmlparse.c entityTextPtr = next; next 6115 third_party/expat/files/lib/xmlparse.c BLOCK *tem = p->next; next 6116 third_party/expat/files/lib/xmlparse.c p->next = pool->freeBlocks; next 6132 third_party/expat/files/lib/xmlparse.c BLOCK *tem = p->next; next 6138 third_party/expat/files/lib/xmlparse.c BLOCK *tem = p->next; next 6215 third_party/expat/files/lib/xmlparse.c pool->freeBlocks = pool->freeBlocks->next; next 6216 third_party/expat/files/lib/xmlparse.c pool->blocks->next = NULL; next 6223 third_party/expat/files/lib/xmlparse.c BLOCK *tem = pool->freeBlocks->next; next 6224 third_party/expat/files/lib/xmlparse.c pool->freeBlocks->next = pool->blocks; next 6261 third_party/expat/files/lib/xmlparse.c tem->next = pool->blocks; next 6278 third_party/expat/files/lib/xmlparse.c int next; next 6305 third_party/expat/files/lib/xmlparse.c next = dtd->scaffCount++; next 6306 third_party/expat/files/lib/xmlparse.c me = &dtd->scaffold[next]; next 6310 third_party/expat/files/lib/xmlparse.c dtd->scaffold[parent->lastchild].nextsib = next; next 6313 third_party/expat/files/lib/xmlparse.c parent->firstchild = next; next 6314 third_party/expat/files/lib/xmlparse.c parent->lastchild = next; next 6318 third_party/expat/files/lib/xmlparse.c return next; next 1328 third_party/harfbuzz-ng/src/hb-buffer.cc const T *next = text + item_offset; next 1329 third_party/harfbuzz-ng/src/hb-buffer.cc const T *end = next + item_length; next 1330 third_party/harfbuzz-ng/src/hb-buffer.cc while (next < end) next 1333 third_party/harfbuzz-ng/src/hb-buffer.cc const T *old_next = next; next 1334 third_party/harfbuzz-ng/src/hb-buffer.cc next = hb_utf_next (next, end, &u); next 1341 third_party/harfbuzz-ng/src/hb-buffer.cc while (next < end && buffer->context_len[1] < buffer->CONTEXT_LENGTH) next 1344 third_party/harfbuzz-ng/src/hb-buffer.cc next = hb_utf_next (next, end, &u); next 214 third_party/harfbuzz-ng/src/hb-common.cc struct hb_language_item_t *next; next 242 third_party/harfbuzz-ng/src/hb-common.cc hb_language_item_t *next = langs->next; next 245 third_party/harfbuzz-ng/src/hb-common.cc langs = next; next 256 third_party/harfbuzz-ng/src/hb-common.cc for (hb_language_item_t *lang = first_lang; lang; lang = lang->next) next 264 third_party/harfbuzz-ng/src/hb-common.cc lang->next = first_lang; next 61 third_party/harfbuzz-ng/src/hb-face-private.hh plan_node_t *next; next 232 third_party/harfbuzz-ng/src/hb-face.cc hb_face_t::plan_node_t *next = node->next; next 235 third_party/harfbuzz-ng/src/hb-face.cc node = next; next 47 third_party/harfbuzz-ng/src/hb-graphite2.cc struct hb_graphite2_tablelist_t *next; next 65 third_party/harfbuzz-ng/src/hb-graphite2.cc for (hb_graphite2_tablelist_t *p = tlist; p; p = p->next) next 85 third_party/harfbuzz-ng/src/hb-graphite2.cc p->next = face_data->tlist; next 132 third_party/harfbuzz-ng/src/hb-graphite2.cc tlist = tlist->next; next 674 third_party/harfbuzz-ng/src/hb-ot-layout-common-private.hh inline void next (void) { i++; } next 776 third_party/harfbuzz-ng/src/hb-ot-layout-common-private.hh inline void next (void) { next 847 third_party/harfbuzz-ng/src/hb-ot-layout-common-private.hh for (iter.init (*this); iter.more (); iter.next ()) { next 888 third_party/harfbuzz-ng/src/hb-ot-layout-common-private.hh inline void next (void) { next 890 third_party/harfbuzz-ng/src/hb-ot-layout-common-private.hh case 1: u.format1.next (); break; next 891 third_party/harfbuzz-ng/src/hb-ot-layout-common-private.hh case 2: u.format2.next (); break; next 679 third_party/harfbuzz-ng/src/hb-ot-layout-gpos-table.hh if (!skippy_iter.next ()) return TRACE_RETURN (false); next 750 third_party/harfbuzz-ng/src/hb-ot-layout-gpos-table.hh if (!skippy_iter.next ()) return TRACE_RETURN (false); next 901 third_party/harfbuzz-ng/src/hb-ot-layout-gpos-table.hh if (!skippy_iter.next ()) return TRACE_RETURN (false); next 44 third_party/harfbuzz-ng/src/hb-ot-layout-gsub-table.hh for (iter.init (this+coverage); iter.more (); iter.next ()) { next 55 third_party/harfbuzz-ng/src/hb-ot-layout-gsub-table.hh for (iter.init (this+coverage); iter.more (); iter.next ()) { next 122 third_party/harfbuzz-ng/src/hb-ot-layout-gsub-table.hh for (iter.init (this+coverage); iter.more (); iter.next ()) { next 132 third_party/harfbuzz-ng/src/hb-ot-layout-gsub-table.hh for (iter.init (this+coverage); iter.more (); iter.next ()) { next 322 third_party/harfbuzz-ng/src/hb-ot-layout-gsub-table.hh for (iter.init (this+coverage); iter.more (); iter.next ()) { next 447 third_party/harfbuzz-ng/src/hb-ot-layout-gsub-table.hh for (iter.init (this+coverage); iter.more (); iter.next ()) { next 461 third_party/harfbuzz-ng/src/hb-ot-layout-gsub-table.hh for (iter.init (this+coverage); iter.more (); iter.next ()) { next 766 third_party/harfbuzz-ng/src/hb-ot-layout-gsub-table.hh for (iter.init (this+coverage); iter.more (); iter.next ()) { next 776 third_party/harfbuzz-ng/src/hb-ot-layout-gsub-table.hh for (iter.init (this+coverage); iter.more (); iter.next ()) { next 929 third_party/harfbuzz-ng/src/hb-ot-layout-gsub-table.hh for (iter.init (this+coverage); iter.more (); iter.next ()) { next 411 third_party/harfbuzz-ng/src/hb-ot-layout-gsubgpos-private.hh inline bool next (void) next 760 third_party/harfbuzz-ng/src/hb-ot-layout-gsubgpos-private.hh if (!skippy_iter.next ()) return TRACE_RETURN (false); next 920 third_party/harfbuzz-ng/src/hb-ot-layout-gsubgpos-private.hh if (!skippy_iter.next ()) next 1000 third_party/harfbuzz-ng/src/hb-ot-layout-gsubgpos-private.hh unsigned int next = idx + 1; /* next now is the position after the recursed lookup. */ next 1010 third_party/harfbuzz-ng/src/hb-ot-layout-gsubgpos-private.hh delta = MAX (delta, (int) next - (int) count); next 1011 third_party/harfbuzz-ng/src/hb-ot-layout-gsubgpos-private.hh next -= delta; next 1015 third_party/harfbuzz-ng/src/hb-ot-layout-gsubgpos-private.hh memmove (match_positions + next + delta, match_positions + next, next 1016 third_party/harfbuzz-ng/src/hb-ot-layout-gsubgpos-private.hh (count - next) * sizeof (match_positions[0])); next 1017 third_party/harfbuzz-ng/src/hb-ot-layout-gsubgpos-private.hh next += delta; next 1021 third_party/harfbuzz-ng/src/hb-ot-layout-gsubgpos-private.hh for (unsigned int j = idx + 1; j < next; j++) next 1025 third_party/harfbuzz-ng/src/hb-ot-layout-gsubgpos-private.hh for (; next < count; next++) next 1026 third_party/harfbuzz-ng/src/hb-ot-layout-gsubgpos-private.hh match_positions[next] += delta; next 1015 third_party/harfbuzz-ng/src/hb-ot-shape-complex-indic.cc unsigned int next = start + info[j].syllable(); next 1017 third_party/harfbuzz-ng/src/hb-ot-shape-complex-indic.cc j = next; next 447 third_party/harfbuzz-ng/src/hb-ot-shape-fallback.cc if (!skippy_iter.next ()) next 256 third_party/harfbuzz-ng/src/hb-set-private.hh inline bool next (hb_codepoint_t *codepoint) const next 281 third_party/harfbuzz-ng/src/hb-set-private.hh if (!next (&i)) next 288 third_party/harfbuzz-ng/src/hb-set-private.hh while (next (&i) && i == *last + 1) next 449 third_party/harfbuzz-ng/src/hb-set.cc return set->next (codepoint); next 420 third_party/harfbuzz-ng/src/hb-shape-plan.cc for (hb_face_t::plan_node_t *node = cached_plan_nodes; node; node = node->next) next 438 third_party/harfbuzz-ng/src/hb-shape-plan.cc node->next = cached_plan_nodes; next 189 third_party/iccjpeg/iccjpeg.c for (marker = cinfo->marker_list; marker != NULL; marker = marker->next) { next 229 third_party/iccjpeg/iccjpeg.c for (marker = cinfo->marker_list; marker != NULL; marker = marker->next) { next 178 third_party/libevent/evdns.c struct request *next, *prev; next 219 third_party/libevent/evdns.c struct nameserver *next, *prev; next 247 third_party/libevent/evdns.c struct server_reply_item *next; /* next item in sequence. */ next 439 third_party/libevent/evdns.c req = req->next; next 527 third_party/libevent/evdns.c req = req->next; next 556 third_party/libevent/evdns.c if (req->next == req) { next 560 third_party/libevent/evdns.c req->next->prev = req->prev; next 561 third_party/libevent/evdns.c req->prev->next = req->next; next 562 third_party/libevent/evdns.c if (*head == req) *head = req->next; next 622 third_party/libevent/evdns.c if (req_waiting_head->next == req_waiting_head) { next 628 third_party/libevent/evdns.c req->next->prev = req->prev; next 629 third_party/libevent/evdns.c req->prev->next = req->next; next 630 third_party/libevent/evdns.c req_waiting_head = req->next; next 1111 third_party/libevent/evdns.c req = req->next; next 1130 third_party/libevent/evdns.c server_head = server_head->next; next 1139 third_party/libevent/evdns.c server_head = server_head->next; next 1143 third_party/libevent/evdns.c server_head = server_head->next; next 1150 third_party/libevent/evdns.c server_head = server_head->next; next 1537 third_party/libevent/evdns.c itemp = &((*itemp)->next); next 1542 third_party/libevent/evdns.c item->next = NULL; next 1701 third_party/libevent/evdns.c item = item->next; next 1777 third_party/libevent/evdns.c struct server_reply_item *victim, *next, **list; next 1789 third_party/libevent/evdns.c next = victim->next; next 1794 third_party/libevent/evdns.c victim = next; next 2030 third_party/libevent/evdns.c req = req->next; next 2047 third_party/libevent/evdns.c server = server->next; next 2062 third_party/libevent/evdns.c struct nameserver *next = server->next; next 2069 third_party/libevent/evdns.c if (next == started_at) next 2071 third_party/libevent/evdns.c server = next; next 2077 third_party/libevent/evdns.c struct request *next = req->next; next 2093 third_party/libevent/evdns.c if (next == req_started_at) next 2095 third_party/libevent/evdns.c req = next; next 2122 third_party/libevent/evdns.c server = server->next; next 2150 third_party/libevent/evdns.c ns->next = ns->prev = ns; next 2153 third_party/libevent/evdns.c ns->next = server_head->next; next 2155 third_party/libevent/evdns.c server_head->next = ns; next 2213 third_party/libevent/evdns.c req->next = req->prev = req; next 2218 third_party/libevent/evdns.c req->prev->next = req; next 2219 third_party/libevent/evdns.c req->next = *head; next 2268 third_party/libevent/evdns.c req->next = req->prev = NULL; next 2379 third_party/libevent/evdns.c struct search_domain *next; next 2397 third_party/libevent/evdns.c struct search_domain *next, *dom; next 2398 third_party/libevent/evdns.c for (dom = state->head; dom; dom = next) { next 2399 third_party/libevent/evdns.c next = dom->next; next 2444 third_party/libevent/evdns.c sdomain->next = global_search_state->head; next 2454 third_party/libevent/evdns.c struct search_domain *cur, *prev = NULL, *next; next 2457 third_party/libevent/evdns.c next = cur->next; next 2458 third_party/libevent/evdns.c cur->next = prev; next 2460 third_party/libevent/evdns.c cur = next; next 2498 third_party/libevent/evdns.c for (dom = state->head; dom; dom = dom->next) { next 3052 third_party/libevent/evdns.c server_next = server->next; next 3067 third_party/libevent/evdns.c dom_next = dom->next; next 221 third_party/libevent/event.c struct event *next = TAILQ_NEXT(ev, ev_next); next 226 third_party/libevent/event.c ev = next; next 235 third_party/libevent/event.c struct event *next = TAILQ_NEXT(ev, ev_active_next); next 240 third_party/libevent/event.c ev = next; next 248 third_party/libevent/event.h TAILQ_ENTRY(evkeyval) next; next 190 third_party/libevent/evhttp.h TAILQ_ENTRY(evhttp_request) next; next 195 third_party/libevent/evhttp.h } next; next 37 third_party/libevent/evrpc-internal.h TAILQ_ENTRY(evrpc_hook) (next); next 124 third_party/libevent/evrpc.c TAILQ_INSERT_TAIL(head, hook, next); next 133 third_party/libevent/evrpc.c TAILQ_FOREACH(hook, head, next) { next 135 third_party/libevent/evrpc.c TAILQ_REMOVE(head, hook, next); next 172 third_party/libevent/evrpc.c TAILQ_FOREACH(hook, head, next) { next 217 third_party/libevent/evrpc.c TAILQ_INSERT_TAIL(&base->registered_rpcs, rpc, next); next 236 third_party/libevent/evrpc.c TAILQ_FOREACH(rpc, &base->registered_rpcs, next) { next 244 third_party/libevent/evrpc.c TAILQ_REMOVE(&base->registered_rpcs, rpc, next); next 416 third_party/libevent/evrpc.c TAILQ_REMOVE(&pool->requests, request, next); next 422 third_party/libevent/evrpc.c TAILQ_REMOVE(&pool->connections, connection, next); next 446 third_party/libevent/evrpc.c TAILQ_INSERT_TAIL(&pool->connections, connection, next); next 469 third_party/libevent/evrpc.c TAILQ_REMOVE(&pool->requests, request, next); next 478 third_party/libevent/evrpc.c TAILQ_FOREACH(evcon, &pool->connections, next) { next 496 third_party/libevent/evrpc.c TAILQ_FOREACH(connection, &pool->connections, next) { next 579 third_party/libevent/evrpc.c TAILQ_INSERT_TAIL(&pool->requests, ctx, next); next 644 third_party/libevent/evrpc.c TAILQ_REMOVE(&pool->requests, ctx, next); next 75 third_party/libevent/evrpc.h TAILQ_ENTRY(evrpc) next; next 341 third_party/libevent/evrpc.h TAILQ_ENTRY(evrpc_request_wrapper) next; next 55 third_party/libevent/http-internal.h TAILQ_ENTRY(evhttp_connection) (next); next 95 third_party/libevent/http-internal.h TAILQ_ENTRY(evhttp_cb) next; next 108 third_party/libevent/http-internal.h TAILQ_ENTRY(evhttp_bound_socket) (next); next 526 third_party/libevent/http.c TAILQ_FOREACH(header, req->output_headers, next) { next 657 third_party/libevent/http.c TAILQ_REMOVE(&evcon->requests, req, next); next 725 third_party/libevent/http.c TAILQ_REMOVE(&evcon->requests, req, next); next 995 third_party/libevent/http.c TAILQ_REMOVE(&evcon->requests, req, next); next 1001 third_party/libevent/http.c TAILQ_REMOVE(&http->connections, evcon, next); next 1187 third_party/libevent/http.c TAILQ_REMOVE(&evcon->requests, request, next); next 1313 third_party/libevent/http.c TAILQ_FOREACH(header, headers, next) { next 1329 third_party/libevent/http.c TAILQ_REMOVE(headers, header, next); next 1346 third_party/libevent/http.c TAILQ_FOREACH(header, headers, next) { next 1355 third_party/libevent/http.c TAILQ_REMOVE(headers, header, next); next 1419 third_party/libevent/http.c TAILQ_INSERT_TAIL(headers, header, next); next 1821 third_party/libevent/http.c TAILQ_INSERT_TAIL(&evcon->requests, req, next); next 1861 third_party/libevent/http.c TAILQ_REMOVE(&evcon->requests, req, next); next 2171 third_party/libevent/http.c TAILQ_FOREACH(cb, callbacks, next) { next 2299 third_party/libevent/http.c TAILQ_INSERT_TAIL(&http->sockets, bound, next); next 2360 third_party/libevent/http.c TAILQ_REMOVE(&http->sockets, bound, next); next 2375 third_party/libevent/http.c TAILQ_REMOVE(&http->callbacks, http_cb, next); next 2402 third_party/libevent/http.c TAILQ_INSERT_TAIL(&http->callbacks, http_cb, next); next 2410 third_party/libevent/http.c TAILQ_FOREACH(http_cb, &http->callbacks, next) { next 2417 third_party/libevent/http.c TAILQ_REMOVE(&http->callbacks, http_cb, next); next 2578 third_party/libevent/http.c TAILQ_INSERT_TAIL(&evcon->requests, req, next); next 2610 third_party/libevent/http.c TAILQ_INSERT_TAIL(&http->connections, evcon, next); next 772 third_party/libjpeg/jdmarker.c cur_marker->next = NULL; next 814 third_party/libjpeg/jdmarker.c while (prev->next != NULL) next 815 third_party/libjpeg/jdmarker.c prev = prev->next; next 816 third_party/libjpeg/jdmarker.c prev->next = cur_marker; next 93 third_party/libjpeg/jmemmgr.c small_pool_ptr next; /* next in list of pools */ next 104 third_party/libjpeg/jmemmgr.c large_pool_ptr next; /* next in list of pools */ next 162 third_party/libjpeg/jmemmgr.c jvirt_sarray_ptr next; /* link to next virtual sarray control block */ next 178 third_party/libjpeg/jmemmgr.c jvirt_barray_ptr next; /* link to next virtual barray control block */ next 200 third_party/libjpeg/jmemmgr.c lhdr_ptr = lhdr_ptr->hdr.next) { next 206 third_party/libjpeg/jmemmgr.c shdr_ptr = shdr_ptr->hdr.next) { next 283 third_party/libjpeg/jmemmgr.c hdr_ptr = hdr_ptr->hdr.next; next 308 third_party/libjpeg/jmemmgr.c hdr_ptr->hdr.next = NULL; next 314 third_party/libjpeg/jmemmgr.c prev_hdr_ptr->hdr.next = hdr_ptr; next 369 third_party/libjpeg/jmemmgr.c hdr_ptr->hdr.next = mem->large_list[pool_id]; next 545 third_party/libjpeg/jmemmgr.c result->next = mem->virt_sarray_list; /* add to list of virtual arrays */ next 575 third_party/libjpeg/jmemmgr.c result->next = mem->virt_barray_list; /* add to list of virtual arrays */ next 598 third_party/libjpeg/jmemmgr.c for (sptr = mem->virt_sarray_list; sptr != NULL; sptr = sptr->next) { next 606 third_party/libjpeg/jmemmgr.c for (bptr = mem->virt_barray_list; bptr != NULL; bptr = bptr->next) { next 639 third_party/libjpeg/jmemmgr.c for (sptr = mem->virt_sarray_list; sptr != NULL; sptr = sptr->next) { next 663 third_party/libjpeg/jmemmgr.c for (bptr = mem->virt_barray_list; bptr != NULL; bptr = bptr->next) { next 950 third_party/libjpeg/jmemmgr.c for (sptr = mem->virt_sarray_list; sptr != NULL; sptr = sptr->next) { next 957 third_party/libjpeg/jmemmgr.c for (bptr = mem->virt_barray_list; bptr != NULL; bptr = bptr->next) { next 971 third_party/libjpeg/jmemmgr.c large_pool_ptr next_lhdr_ptr = lhdr_ptr->hdr.next; next 985 third_party/libjpeg/jmemmgr.c small_pool_ptr next_shdr_ptr = shdr_ptr->hdr.next; next 200 third_party/libjpeg/jpeglib.h jpeg_saved_marker_ptr next; /* next in list, or NULL */ next 257 third_party/liblouis/overrides/liblouis/compileTranslationTable.c struct CharacterClass *next; next 825 third_party/liblouis/overrides/liblouis/compileTranslationTable.c bucket = character->next; next 892 third_party/liblouis/overrides/liblouis/compileTranslationTable.c while (oldchar->next) next 894 third_party/liblouis/overrides/liblouis/compileTranslationTable.c (TranslationTableCharacter *) & table->ruleArea[oldchar->next]; next 895 third_party/liblouis/overrides/liblouis/compileTranslationTable.c oldchar->next = offset; next 915 third_party/liblouis/overrides/liblouis/compileTranslationTable.c bucket = cdPtr->next; next 951 third_party/liblouis/overrides/liblouis/compileTranslationTable.c cdPtr->next = 0; next 961 third_party/liblouis/overrides/liblouis/compileTranslationTable.c while (oldcdPtr->next) next 962 third_party/liblouis/overrides/liblouis/compileTranslationTable.c oldcdPtr = (CharOrDots *) & table->ruleArea[oldcdPtr->next]; next 963 third_party/liblouis/overrides/liblouis/compileTranslationTable.c oldcdPtr->next = offset; next 971 third_party/liblouis/overrides/liblouis/compileTranslationTable.c cdPtr->next = 0; next 981 third_party/liblouis/overrides/liblouis/compileTranslationTable.c while (oldcdPtr->next) next 982 third_party/liblouis/overrides/liblouis/compileTranslationTable.c oldcdPtr = (CharOrDots *) & table->ruleArea[oldcdPtr->next]; next 983 third_party/liblouis/overrides/liblouis/compileTranslationTable.c oldcdPtr->next = offset; next 1325 third_party/liblouis/overrides/liblouis/compileTranslationTable.c class = class->next; next 1343 third_party/liblouis/overrides/liblouis/compileTranslationTable.c class->next = characterClasses; next 1358 third_party/liblouis/overrides/liblouis/compileTranslationTable.c characterClasses = characterClasses->next; next 1840 third_party/liblouis/overrides/liblouis/compileTranslationTable.c struct RuleName *next; next 1856 third_party/liblouis/overrides/liblouis/compileTranslationTable.c nameRule = nameRule->next; next 1887 third_party/liblouis/overrides/liblouis/compileTranslationTable.c nameRule->next = ruleNames; next 1898 third_party/liblouis/overrides/liblouis/compileTranslationTable.c ruleNames = ruleNames->next; next 2211 third_party/liblouis/overrides/liblouis/compileTranslationTable.c struct PassName *next; next 2235 third_party/liblouis/overrides/liblouis/compileTranslationTable.c curname = curname->next; next 2266 third_party/liblouis/overrides/liblouis/compileTranslationTable.c curname->next = passNames; next 3503 third_party/liblouis/overrides/liblouis/compileTranslationTable.c void *next; next 3544 third_party/liblouis/overrides/liblouis/compileTranslationTable.c HyphenHashEntry *e, *next; next 3546 third_party/liblouis/overrides/liblouis/compileTranslationTable.c for (e = hashTab->entries[i]; e; e = next) next 3548 third_party/liblouis/overrides/liblouis/compileTranslationTable.c next = e->next; next 3563 third_party/liblouis/overrides/liblouis/compileTranslationTable.c e->next = hashTab->entries[i]; next 3581 third_party/liblouis/overrides/liblouis/compileTranslationTable.c for (e = hashTab->entries[i]; e; e = e->next) next 3719 third_party/liblouis/overrides/liblouis/compileTranslationTable.c for (e = hashTab->entries[i]; e; e = e->next) next 4831 third_party/liblouis/overrides/liblouis/compileTranslationTable.c void *next; next 4875 third_party/liblouis/overrides/liblouis/compileTranslationTable.c currentEntry = currentEntry->next; next 4885 third_party/liblouis/overrides/liblouis/compileTranslationTable.c lastEntry->next = newEntry; next 4886 third_party/liblouis/overrides/liblouis/compileTranslationTable.c newEntry->next = NULL; next 5123 third_party/liblouis/overrides/liblouis/compileTranslationTable.c currentEntry = currentEntry->next; next 156 third_party/libpng/pngrtran.c struct png_dsort_struct FAR * next; next 373 third_party/libpng/pngrtran.c t->next = hash[d]; next 390 third_party/libpng/pngrtran.c for (p = hash[i]; p; p = p->next) next 455 third_party/libpng/pngrtran.c t = p->next; next 1797 third_party/libusb/src/libusb/core.c struct libusb_device *dev, *next; next 1886 third_party/libusb/src/libusb/core.c list_for_each_entry_safe(dev, next, &ctx->usb_devs, list, struct libusb_device) { next 1909 third_party/libusb/src/libusb/core.c struct libusb_device *dev, *next; next 1935 third_party/libusb/src/libusb/core.c list_for_each_entry_safe(dev, next, &ctx->usb_devs, list, struct libusb_device) { next 180 third_party/libusb/src/libusb/hotplug.c struct libusb_hotplug_callback *hotplug_cb, *next; next 185 third_party/libusb/src/libusb/hotplug.c list_for_each_entry_safe(hotplug_cb, next, &ctx->hotplug_cbs, list, struct libusb_hotplug_callback) { next 312 third_party/libusb/src/libusb/hotplug.c struct libusb_hotplug_callback *hotplug_cb, *next; next 315 third_party/libusb/src/libusb/hotplug.c list_for_each_entry_safe(hotplug_cb, next, &ctx->hotplug_cbs, list, next 74 third_party/libusb/src/libusb/libusbi.h struct list_head *prev, *next; next 92 third_party/libusb/src/libusb/libusbi.h for (pos = list_entry((head)->next, type, member); \ next 94 third_party/libusb/src/libusb/libusbi.h pos = list_entry(pos->member.next, type, member)) next 97 third_party/libusb/src/libusb/libusbi.h for (pos = list_entry((head)->next, type, member), \ next 98 third_party/libusb/src/libusb/libusbi.h n = list_entry(pos->member.next, type, member); \ next 100 third_party/libusb/src/libusb/libusbi.h pos = n, n = list_entry(n->member.next, type, member)) next 102 third_party/libusb/src/libusb/libusbi.h #define list_empty(entry) ((entry)->next == (entry)) next 106 third_party/libusb/src/libusb/libusbi.h entry->prev = entry->next = entry; next 111 third_party/libusb/src/libusb/libusbi.h entry->next = head->next; next 114 third_party/libusb/src/libusb/libusbi.h head->next->prev = entry; next 115 third_party/libusb/src/libusb/libusbi.h head->next = entry; next 121 third_party/libusb/src/libusb/libusbi.h entry->next = head; next 124 third_party/libusb/src/libusb/libusbi.h head->prev->next = entry; next 130 third_party/libusb/src/libusb/libusbi.h entry->next->prev = entry->prev; next 131 third_party/libusb/src/libusb/libusbi.h entry->prev->next = entry->next; next 132 third_party/libusb/src/libusb/libusbi.h entry->next = entry->prev = NULL; next 402 third_party/libusb/src/libusb/os/darwin_usb.c struct darwin_cached_device *dev, *next; next 405 third_party/libusb/src/libusb/os/darwin_usb.c list_for_each_entry_safe(dev, next, &darwin_cached_devices, list, struct darwin_cached_device) { next 707 third_party/libusb/src/libusb/os/linux_usbfs.c int next = seek_to_next_descriptor(ctx, LIBUSB_DT_CONFIG, next 709 third_party/libusb/src/libusb/os/linux_usbfs.c if (next == LIBUSB_ERROR_NOT_FOUND) next 710 third_party/libusb/src/libusb/os/linux_usbfs.c next = size; next 711 third_party/libusb/src/libusb/os/linux_usbfs.c if (next < 0) next 712 third_party/libusb/src/libusb/os/linux_usbfs.c return next; next 714 third_party/libusb/src/libusb/os/linux_usbfs.c if (next != config.wTotalLength) next 716 third_party/libusb/src/libusb/os/linux_usbfs.c "%d real %d", config.wTotalLength, next); next 717 third_party/libusb/src/libusb/os/linux_usbfs.c return next; next 751 third_party/libusb/src/libusb/os/linux_usbfs.c int next = seek_to_next_config(ctx, descriptors, size); next 752 third_party/libusb/src/libusb/os/linux_usbfs.c if (next < 0) next 753 third_party/libusb/src/libusb/os/linux_usbfs.c return next; next 757 third_party/libusb/src/libusb/os/linux_usbfs.c return next; next 759 third_party/libusb/src/libusb/os/linux_usbfs.c size -= next; next 760 third_party/libusb/src/libusb/os/linux_usbfs.c descriptors += next; next 127 third_party/libusb/src/libusb/os/threads_windows.c pos = list_entry(&cond->waiters.next, struct usbi_cond_perthread, list); next 1817 third_party/libva/va/va.h void *next; next 69 third_party/libva/va/x11/va_dricommon.h struct dri_drawable *next; next 53 third_party/libwebp/enc/token.c const VP8Tokens* const next = p->next_; next 55 third_party/libwebp/enc/token.c p = next; next 219 third_party/libwebp/enc/token.c const VP8Tokens* const next = p->next_; next 220 third_party/libwebp/enc/token.c const int N = (next == NULL) ? b->left_ : 0; next 232 third_party/libwebp/enc/token.c p = next; next 244 third_party/libwebp/enc/token.c const VP8Tokens* const next = p->next_; next 245 third_party/libwebp/enc/token.c const int N = (next == NULL) ? b->left_ : 0; next 256 third_party/libwebp/enc/token.c p = next; next 1406 third_party/libxml/src/HTMLparser.c child = child->next; next 1430 third_party/libxml/src/HTMLparser.c child = child->next; next 4972 third_party/libxml/src/HTMLparser.c xmlChar next, xmlChar third, int iscomment, next 5004 third_party/libxml/src/HTMLparser.c else if (next) next 5043 third_party/libxml/src/HTMLparser.c if ((buf[base + 1] != next) || (buf[base + 2] != third)) next 5045 third_party/libxml/src/HTMLparser.c } else if (next != 0) { next 5046 third_party/libxml/src/HTMLparser.c if (buf[base + 1] != next) next 5051 third_party/libxml/src/HTMLparser.c if (next == 0) next 5058 third_party/libxml/src/HTMLparser.c first, next, base); next 5062 third_party/libxml/src/HTMLparser.c first, next, third, base); next 5070 third_party/libxml/src/HTMLparser.c if (next == 0) next 5075 third_party/libxml/src/HTMLparser.c "HPP: lookup '%c%c' failed\n", first, next); next 5078 third_party/libxml/src/HTMLparser.c "HPP: lookup '%c%c%c' failed\n", first, next, next 5172 third_party/libxml/src/HTMLparser.c xmlChar cur, next; next 5280 third_party/libxml/src/HTMLparser.c next = in->cur[1]; next 5281 third_party/libxml/src/HTMLparser.c if ((cur == '<') && (next == '!') && next 5316 third_party/libxml/src/HTMLparser.c next = in->cur[1]; next 5317 third_party/libxml/src/HTMLparser.c if ((cur == '<') && (next == '!') && next 5328 third_party/libxml/src/HTMLparser.c } else if ((cur == '<') && (next == '?')) { next 5338 third_party/libxml/src/HTMLparser.c } else if ((cur == '<') && (next == '!') && next 5356 third_party/libxml/src/HTMLparser.c } else if ((cur == '<') && (next == '!') && next 5376 third_party/libxml/src/HTMLparser.c next = in->cur[1]; next 5377 third_party/libxml/src/HTMLparser.c if ((cur == '<') && (next == '!') && next 5388 third_party/libxml/src/HTMLparser.c } else if ((cur == '<') && (next == '?')) { next 5398 third_party/libxml/src/HTMLparser.c } else if ((cur == '<') && (next == '!') && next 5423 third_party/libxml/src/HTMLparser.c next = in->cur[1]; next 5424 third_party/libxml/src/HTMLparser.c if ((cur == '<') && (next == '!') && next 5435 third_party/libxml/src/HTMLparser.c } else if ((cur == '<') && (next == '?')) { next 5445 third_party/libxml/src/HTMLparser.c } else if ((cur == '<') && (next == '!') && next 5601 third_party/libxml/src/HTMLparser.c next = in->cur[1]; next 5620 third_party/libxml/src/HTMLparser.c if ((cur == '<') && (next == '/')) { next 5633 third_party/libxml/src/HTMLparser.c if ((cur == '<') && (next == '!') && next 5645 third_party/libxml/src/HTMLparser.c } else if ((cur == '<') && (next == '!') && next 5657 third_party/libxml/src/HTMLparser.c } else if ((cur == '<') && (next == '?')) { next 5667 third_party/libxml/src/HTMLparser.c } else if ((cur == '<') && (next == '!') && (avail < 4)) { next 5669 third_party/libxml/src/HTMLparser.c } else if ((cur == '<') && (next == '/')) { next 69 third_party/libxml/src/HTMLtree.c cur = cur->next; next 85 third_party/libxml/src/HTMLtree.c cur = cur->next; next 108 third_party/libxml/src/HTMLtree.c (attr->children->next == NULL)) { next 119 third_party/libxml/src/HTMLtree.c attr = attr->next; next 123 third_party/libxml/src/HTMLtree.c cur = cur->next; next 195 third_party/libxml/src/HTMLtree.c cur = cur->next; next 213 third_party/libxml/src/HTMLtree.c cur = cur->next; next 240 third_party/libxml/src/HTMLtree.c (attr->children->next == NULL)) { next 254 third_party/libxml/src/HTMLtree.c attr = attr->next; next 263 third_party/libxml/src/HTMLtree.c cur = cur->next; next 739 third_party/libxml/src/HTMLtree.c cur = cur->next; next 763 third_party/libxml/src/HTMLtree.c cur = cur->next; next 875 third_party/libxml/src/HTMLtree.c if ((format) && (!info->isinline) && (cur->next != NULL)) { next 876 third_party/libxml/src/HTMLtree.c if ((cur->next->type != HTML_TEXT_NODE) && next 877 third_party/libxml/src/HTMLtree.c (cur->next->type != HTML_ENTITY_REF_NODE) && next 900 third_party/libxml/src/HTMLtree.c if ((format) && (cur->next != NULL) && next 902 third_party/libxml/src/HTMLtree.c if ((cur->next->type != HTML_TEXT_NODE) && next 903 third_party/libxml/src/HTMLtree.c (cur->next->type != HTML_ENTITY_REF_NODE) && next 946 third_party/libxml/src/HTMLtree.c (cur->next != NULL)) { next 947 third_party/libxml/src/HTMLtree.c if ((cur->next->type != HTML_TEXT_NODE) && next 948 third_party/libxml/src/HTMLtree.c (cur->next->type != HTML_ENTITY_REF_NODE) && next 1281 third_party/libxml/src/SAX2.c prop = prop->next; next 1299 third_party/libxml/src/SAX2.c if (tmp->next == NULL) next 1301 third_party/libxml/src/SAX2.c tmp = tmp->next; next 1818 third_party/libxml/src/SAX2.c ctxt->freeElems = ret->next; next 1944 third_party/libxml/src/SAX2.c ctxt->freeAttrs = ret->next; next 1964 third_party/libxml/src/SAX2.c while (prev->next != NULL) prev = prev->next; next 1965 third_party/libxml/src/SAX2.c prev->next = ret; next 2006 third_party/libxml/src/SAX2.c if (tmp->next == NULL) next 2008 third_party/libxml/src/SAX2.c tmp = tmp->next; next 2189 third_party/libxml/src/SAX2.c ctxt->freeElems = ret->next; next 2239 third_party/libxml/src/SAX2.c last->next = ns; next 264 third_party/libxml/src/c14n.c ns.next = (xmlNsPtr)parent->parent; next 266 third_party/libxml/src/c14n.c ns.next = (xmlNsPtr)parent; next 623 third_party/libxml/src/c14n.c for(ns = n->nsDef; ns != NULL; ns = ns->next) { next 793 third_party/libxml/src/c14n.c for(attr = cur->properties; attr != NULL; attr = attr->next) { next 1170 third_party/libxml/src/c14n.c attr = attr->next; next 1194 third_party/libxml/src/c14n.c attr = attr->next; next 1216 third_party/libxml/src/c14n.c attr = attr->next; next 1287 third_party/libxml/src/c14n.c attr = attr->next; next 1318 third_party/libxml/src/c14n.c xml_base_attr->next = attrs_to_delete; next 1384 third_party/libxml/src/c14n.c ns = ns->next; next 1721 third_party/libxml/src/c14n.c for (ret = 0; cur != NULL && ret >= 0; cur = cur->next) { next 131 third_party/libxml/src/catalog.c struct _xmlCatalogEntry *next; next 281 third_party/libxml/src/catalog.c ret->next = NULL; next 362 third_party/libxml/src/catalog.c xmlCatalogEntryPtr next; next 365 third_party/libxml/src/catalog.c next = ret->next; next 367 third_party/libxml/src/catalog.c ret = next; next 380 third_party/libxml/src/catalog.c xmlCatalogEntryPtr children, next; next 387 third_party/libxml/src/catalog.c next = children->next; next 391 third_party/libxml/src/catalog.c children = next; next 582 third_party/libxml/src/catalog.c xmlDumpXMLCatalogNode(cur->next, node, doc, ns, cur); next 648 third_party/libxml/src/catalog.c cur = cur->next; next 765 third_party/libxml/src/catalog.c entry->next = NULL; next 772 third_party/libxml/src/catalog.c while (prev->next != NULL) next 773 third_party/libxml/src/catalog.c prev = prev->next; next 774 third_party/libxml/src/catalog.c prev->next = entry; next 1286 third_party/libxml/src/catalog.c while (prev->next != NULL) next 1287 third_party/libxml/src/catalog.c prev = prev->next; next 1288 third_party/libxml/src/catalog.c prev->next = entry; next 1322 third_party/libxml/src/catalog.c cur = cur->next; next 1540 third_party/libxml/src/catalog.c if (cur->next == NULL) next 1542 third_party/libxml/src/catalog.c cur = cur->next; next 1552 third_party/libxml/src/catalog.c cur->next = xmlNewCatalogEntry(typ, orig, replace, next 1606 third_party/libxml/src/catalog.c cur = cur->next; next 1682 third_party/libxml/src/catalog.c cur = cur->next; next 1710 third_party/libxml/src/catalog.c cur = cur->next; next 1731 third_party/libxml/src/catalog.c cur = cur->next; next 1769 third_party/libxml/src/catalog.c cur = cur->next; next 1789 third_party/libxml/src/catalog.c cur = cur->next; next 1810 third_party/libxml/src/catalog.c cur = cur->next; next 1836 third_party/libxml/src/catalog.c cur = cur->next; next 1913 third_party/libxml/src/catalog.c cur = cur->next; next 1941 third_party/libxml/src/catalog.c cur = cur->next; next 1960 third_party/libxml/src/catalog.c cur = cur->next; next 1980 third_party/libxml/src/catalog.c cur = cur->next; next 2073 third_party/libxml/src/catalog.c catal = catal->next; next 2128 third_party/libxml/src/catalog.c catal = catal->next; next 2763 third_party/libxml/src/catalog.c while (cur->next != NULL) cur = cur->next; next 2764 third_party/libxml/src/catalog.c cur->next = tmp; next 3171 third_party/libxml/src/catalog.c nextent = &((*nextent)->next); next 3642 third_party/libxml/src/catalog.c while (catal->next != NULL) next 3643 third_party/libxml/src/catalog.c catal = catal->next; next 3644 third_party/libxml/src/catalog.c catal->next = add; next 121 third_party/libxml/src/debugXML.c cur = cur->next; next 319 third_party/libxml/src/debugXML.c if (node->prev->next != node) next 323 third_party/libxml/src/debugXML.c if (node->next == NULL) { next 330 third_party/libxml/src/debugXML.c if (node->next->prev != node) next 333 third_party/libxml/src/debugXML.c if (node->next->parent != node->parent) next 343 third_party/libxml/src/debugXML.c ns = ns->next; next 546 third_party/libxml/src/debugXML.c cur = cur->next; next 756 third_party/libxml/src/debugXML.c ns = ns->next; next 864 third_party/libxml/src/debugXML.c attr = attr->next; next 1091 third_party/libxml/src/debugXML.c node = node->next; next 1647 third_party/libxml/src/debugXML.c list = list->next; next 2024 third_party/libxml/src/debugXML.c cur = cur->next; next 2109 third_party/libxml/src/debugXML.c xmlChar* next; next 2112 third_party/libxml/src/debugXML.c next = nsListDup; next 2113 third_party/libxml/src/debugXML.c while(next != NULL) { next 2116 third_party/libxml/src/debugXML.c if((*next) == '\0') break; next 2119 third_party/libxml/src/debugXML.c prefix = next; next 2120 third_party/libxml/src/debugXML.c next = (xmlChar*)xmlStrchr(next, '='); next 2121 third_party/libxml/src/debugXML.c if(next == NULL) { next 2126 third_party/libxml/src/debugXML.c *(next++) = '\0'; next 2129 third_party/libxml/src/debugXML.c href = next; next 2130 third_party/libxml/src/debugXML.c next = (xmlChar*)xmlStrchr(next, ' '); next 2131 third_party/libxml/src/debugXML.c if(next != NULL) { next 2132 third_party/libxml/src/debugXML.c *(next++) = '\0'; next 2173 third_party/libxml/src/debugXML.c ns = ns->next; next 2234 third_party/libxml/src/debugXML.c } else if (node->next != NULL) { next 2236 third_party/libxml/src/debugXML.c node = node->next; next 2243 third_party/libxml/src/debugXML.c if (node->next != NULL) { next 2244 third_party/libxml/src/debugXML.c node = node->next; next 2714 third_party/libxml/src/debugXML.c } else if ((node != tree) && (node->next != NULL)) { next 2716 third_party/libxml/src/debugXML.c node = node->next; next 2724 third_party/libxml/src/debugXML.c if ((node != tree) && (node->next != NULL)) { next 2725 third_party/libxml/src/debugXML.c node = node->next; next 72 third_party/libxml/src/dict.c struct _xmlDictEntry *next; next 82 third_party/libxml/src/dict.c xmlDictStringsPtr next; next 171 third_party/libxml/src/dict.c pool = pool->next; next 188 third_party/libxml/src/dict.c pool->next = dict->strings; next 233 third_party/libxml/src/dict.c pool = pool->next; next 250 third_party/libxml/src/dict.c pool->next = dict->strings; next 529 third_party/libxml/src/dict.c xmlDictEntryPtr iter, next; next 581 third_party/libxml/src/dict.c dict->dict[key].next = NULL; next 591 third_party/libxml/src/dict.c entry->next = dict->dict[key].next; next 593 third_party/libxml/src/dict.c dict->dict[key].next = entry; next 608 third_party/libxml/src/dict.c iter = olddict[i].next; next 610 third_party/libxml/src/dict.c next = iter->next; next 623 third_party/libxml/src/dict.c dict->dict[key].next = NULL; next 628 third_party/libxml/src/dict.c iter->next = dict->dict[key].next; next 630 third_party/libxml/src/dict.c dict->dict[key].next = iter; next 637 third_party/libxml/src/dict.c iter = next; next 662 third_party/libxml/src/dict.c xmlDictEntryPtr next; next 694 third_party/libxml/src/dict.c next = iter->next; next 699 third_party/libxml/src/dict.c iter = next; next 706 third_party/libxml/src/dict.c nextp = pool->next; next 744 third_party/libxml/src/dict.c for (insert = &(dict->dict[key]); insert->next != NULL; next 745 third_party/libxml/src/dict.c insert = insert->next) { next 786 third_party/libxml/src/dict.c for (tmp = &(dict->subdict->dict[key]); tmp->next != NULL; next 787 third_party/libxml/src/dict.c tmp = tmp->next) { next 826 third_party/libxml/src/dict.c entry->next = NULL; next 832 third_party/libxml/src/dict.c insert->next = entry; next 875 third_party/libxml/src/dict.c for (insert = &(dict->dict[key]); insert->next != NULL; next 876 third_party/libxml/src/dict.c insert = insert->next) { next 917 third_party/libxml/src/dict.c for (tmp = &(dict->subdict->dict[key]); tmp->next != NULL; next 918 third_party/libxml/src/dict.c tmp = tmp->next) { next 983 third_party/libxml/src/dict.c for (insert = &(dict->dict[key]); insert->next != NULL; next 984 third_party/libxml/src/dict.c insert = insert->next) { next 1010 third_party/libxml/src/dict.c for (tmp = &(dict->subdict->dict[key]); tmp->next != NULL; next 1011 third_party/libxml/src/dict.c tmp = tmp->next) { next 1036 third_party/libxml/src/dict.c entry->next = NULL; next 1041 third_party/libxml/src/dict.c insert->next = entry; next 1073 third_party/libxml/src/dict.c pool = pool->next; next 327 third_party/libxml/src/entities.c dtd->last->next = (xmlNodePtr) ret; next 376 third_party/libxml/src/entities.c dtd->last->next = (xmlNodePtr) ret; next 40 third_party/libxml/src/hash.c struct _xmlHashEntry *next; next 200 third_party/libxml/src/hash.c xmlHashEntryPtr iter, next; next 238 third_party/libxml/src/hash.c table->table[key].next = NULL; next 242 third_party/libxml/src/hash.c iter = oldtable[i].next; next 244 third_party/libxml/src/hash.c next = iter->next; next 254 third_party/libxml/src/hash.c table->table[key].next = NULL; next 257 third_party/libxml/src/hash.c iter->next = table->table[key].next; next 258 third_party/libxml/src/hash.c table->table[key].next = iter; next 265 third_party/libxml/src/hash.c iter = next; next 291 third_party/libxml/src/hash.c xmlHashEntryPtr next; next 305 third_party/libxml/src/hash.c next = iter->next; next 321 third_party/libxml/src/hash.c iter = next; next 524 third_party/libxml/src/hash.c for (insert = &(table->table[key]); insert->next != NULL; next 525 third_party/libxml/src/hash.c insert = insert->next) { next 537 third_party/libxml/src/hash.c for (insert = &(table->table[key]); insert->next != NULL; next 538 third_party/libxml/src/hash.c insert = insert->next) { next 570 third_party/libxml/src/hash.c entry->next = NULL; next 575 third_party/libxml/src/hash.c insert->next = entry; next 640 third_party/libxml/src/hash.c for (insert = &(table->table[key]); insert->next != NULL; next 641 third_party/libxml/src/hash.c insert = insert->next) { next 660 third_party/libxml/src/hash.c for (insert = &(table->table[key]); insert->next != NULL; next 661 third_party/libxml/src/hash.c insert = insert->next) { next 700 third_party/libxml/src/hash.c entry->next = NULL; next 706 third_party/libxml/src/hash.c insert->next = entry; next 736 third_party/libxml/src/hash.c for (entry = &(table->table[key]); entry != NULL; entry = entry->next) { next 743 third_party/libxml/src/hash.c for (entry = &(table->table[key]); entry != NULL; entry = entry->next) { next 782 third_party/libxml/src/hash.c for (entry = &(table->table[key]); entry != NULL; entry = entry->next) { next 832 third_party/libxml/src/hash.c xmlHashEntryPtr next; next 845 third_party/libxml/src/hash.c next = iter->next; next 855 third_party/libxml/src/hash.c if (table->table[i].next != next) next 858 third_party/libxml/src/hash.c iter = next; next 860 third_party/libxml/src/hash.c iter = next; next 906 third_party/libxml/src/hash.c xmlHashEntryPtr next; next 919 third_party/libxml/src/hash.c next = iter->next; next 927 third_party/libxml/src/hash.c iter = next; next 946 third_party/libxml/src/hash.c xmlHashEntryPtr next; next 961 third_party/libxml/src/hash.c next = iter->next; next 964 third_party/libxml/src/hash.c iter = next; next 1052 third_party/libxml/src/hash.c for (entry = &(table->table[key]); entry != NULL; entry = entry->next) { next 1068 third_party/libxml/src/hash.c prev->next = entry->next; next 1071 third_party/libxml/src/hash.c if (entry->next == NULL) { next 1074 third_party/libxml/src/hash.c entry = entry->next; next 45 third_party/libxml/src/include/libxml/entities.h struct _xmlNode *next; /* next sibling link */ next 151 third_party/libxml/src/include/libxml/schemasInternals.h struct _xmlSchemaAnnot *next; next 250 third_party/libxml/src/include/libxml/schemasInternals.h struct _xmlSchemaAttribute *next; /* the next attribute (not used?) */ next 279 third_party/libxml/src/include/libxml/schemasInternals.h struct _xmlSchemaAttributeLink *next;/* the next attribute link ... */ next 297 third_party/libxml/src/include/libxml/schemasInternals.h struct _xmlSchemaWildcardNs *next;/* the next constraint link ... */ next 363 third_party/libxml/src/include/libxml/schemasInternals.h struct _xmlSchemaAttribute *next;/* the next attribute if in a group ... */ next 388 third_party/libxml/src/include/libxml/schemasInternals.h struct _xmlSchemaTypeLink *next;/* the next type link ... */ next 399 third_party/libxml/src/include/libxml/schemasInternals.h struct _xmlSchemaFacetLink *next;/* the next facet link ... */ next 604 third_party/libxml/src/include/libxml/schemasInternals.h struct _xmlSchemaType *next; /* the next type if in a sequence ... */ next 767 third_party/libxml/src/include/libxml/schemasInternals.h struct _xmlSchemaType *next; /* Not used? */ next 825 third_party/libxml/src/include/libxml/schemasInternals.h struct _xmlSchemaFacet *next;/* the next type if in a sequence ... */ next 202 third_party/libxml/src/include/libxml/tree.h struct _xmlEnumeration *next; /* next one */ next 221 third_party/libxml/src/include/libxml/tree.h struct _xmlNode *next; /* next sibling link */ next 314 third_party/libxml/src/include/libxml/tree.h struct _xmlNode *next; /* next sibling link */ next 351 third_party/libxml/src/include/libxml/tree.h struct _xmlNs *next; /* next Ns link for this node */ next 375 third_party/libxml/src/include/libxml/tree.h struct _xmlNode *next; /* next sibling link */ next 403 third_party/libxml/src/include/libxml/tree.h struct _xmlAttr *next; /* next sibling link */ next 420 third_party/libxml/src/include/libxml/tree.h struct _xmlID *next; /* next ID */ next 437 third_party/libxml/src/include/libxml/tree.h struct _xmlRef *next; /* next Ref */ next 458 third_party/libxml/src/include/libxml/tree.h struct _xmlNode *next; /* next sibling link */ next 520 third_party/libxml/src/include/libxml/tree.h struct _xmlNode *next; /* next sibling link */ next 419 third_party/libxml/src/include/libxml/valid.h xmlNode *next, next 33 third_party/libxml/src/list.c struct _xmlLink *next; next 61 third_party/libxml/src/list.c (lk->prev)->next = lk->next; next 62 third_party/libxml/src/list.c (lk->next)->prev = lk->prev; next 104 third_party/libxml/src/list.c for(lk = l->sentinel->next;lk != l->sentinel && l->linkCompare(lk->data, data) <0 ;lk = lk->next); next 206 third_party/libxml/src/list.c l->sentinel->next = l->sentinel; next 289 third_party/libxml/src/list.c lkNew->next = lkPlace->next; next 290 third_party/libxml/src/list.c (lkPlace->next)->prev = lkNew; next 291 third_party/libxml/src/list.c lkPlace->next = lkNew; next 320 third_party/libxml/src/list.c lkNew->next = lkPlace->next; next 321 third_party/libxml/src/list.c (lkPlace->next)->prev = lkNew; next 322 third_party/libxml/src/list.c lkPlace->next = lkNew; next 428 third_party/libxml/src/list.c lk = l->sentinel->next; next 430 third_party/libxml/src/list.c xmlLinkPtr next = lk->next; next 433 third_party/libxml/src/list.c lk = next; next 450 third_party/libxml/src/list.c return (l->sentinel->next == l->sentinel); next 466 third_party/libxml/src/list.c return (l->sentinel->next); next 502 third_party/libxml/src/list.c for(lk = l->sentinel->next; lk != l->sentinel; lk = lk->next, count++); next 516 third_party/libxml/src/list.c xmlLinkDeallocator(l, l->sentinel->next); next 557 third_party/libxml/src/list.c lkNew->next = lkPlace->next; next 558 third_party/libxml/src/list.c (lkPlace->next)->prev = lkNew; next 559 third_party/libxml/src/list.c lkPlace->next = lkNew; next 588 third_party/libxml/src/list.c lkNew->next = lkPlace->next; next 589 third_party/libxml/src/list.c (lkPlace->next)->prev = lkNew; next 590 third_party/libxml/src/list.c lkPlace->next = lkNew; next 626 third_party/libxml/src/list.c for (lk = l->sentinel->next; lk != l->sentinel; lk = lk->next) { next 627 third_party/libxml/src/list.c lkPrev->next = lkPrev->prev; next 632 third_party/libxml/src/list.c lkPrev->next = lkPrev->prev; next 681 third_party/libxml/src/list.c for(lk = l->sentinel->next; lk != l->sentinel; lk = lk->next) { next 768 third_party/libxml/src/list.c for(lk = old->sentinel->next; lk != old->sentinel; lk = lk->next) { next 5433 third_party/libxml/src/parser.c tmp = tmp->next; next 5443 third_party/libxml/src/parser.c last->next = cur; next 5501 third_party/libxml/src/parser.c tmp = tmp->next; next 5513 third_party/libxml/src/parser.c last->next = cur; next 6920 third_party/libxml/src/parser.c (list->next == NULL)) || next 6930 third_party/libxml/src/parser.c if (list->next == NULL) next 6932 third_party/libxml/src/parser.c list = list->next; next 6944 third_party/libxml/src/parser.c if (list->next == NULL) next 6946 third_party/libxml/src/parser.c list = list->next; next 7093 third_party/libxml/src/parser.c cur = cur->next; next 7100 third_party/libxml/src/parser.c xmlNodePtr nw = NULL, cur, next, last, next 7113 third_party/libxml/src/parser.c next = cur->next; next 7114 third_party/libxml/src/parser.c cur->next = NULL; next 7128 third_party/libxml/src/parser.c cur = next; next 10507 third_party/libxml/src/parser.c xmlChar next, xmlChar third) { next 10527 third_party/libxml/src/parser.c else if (next) len --; next 10531 third_party/libxml/src/parser.c if ((buf[base + 1] != next) || next 10533 third_party/libxml/src/parser.c } else if (next != 0) { next 10534 third_party/libxml/src/parser.c if (buf[base + 1] != next) continue; next 10538 third_party/libxml/src/parser.c if (next == 0) next 10545 third_party/libxml/src/parser.c first, next, base); next 10549 third_party/libxml/src/parser.c first, next, third, base); next 10556 third_party/libxml/src/parser.c if (next == 0) next 10561 third_party/libxml/src/parser.c "PP: lookup '%c%c' failed\n", first, next); next 10564 third_party/libxml/src/parser.c "PP: lookup '%c%c%c' failed\n", first, next, third); next 10706 third_party/libxml/src/parser.c xmlChar cur, next; next 10847 third_party/libxml/src/parser.c next = ctxt->input->cur[1]; next 10862 third_party/libxml/src/parser.c if ((cur == '<') && (next == '?')) { next 11047 third_party/libxml/src/parser.c next = ctxt->input->cur[1]; next 11051 third_party/libxml/src/parser.c if ((cur == '<') && (next == '/')) { next 11054 third_party/libxml/src/parser.c } else if ((cur == '<') && (next == '?')) { next 11059 third_party/libxml/src/parser.c } else if ((cur == '<') && (next != '!')) { next 11062 third_party/libxml/src/parser.c } else if ((cur == '<') && (next == '!') && next 11087 third_party/libxml/src/parser.c } else if ((cur == '<') && (next == '!') && next 11255 third_party/libxml/src/parser.c next = ctxt->input->cur[1]; next 11256 third_party/libxml/src/parser.c if ((cur == '<') && (next == '?')) { next 11268 third_party/libxml/src/parser.c } else if ((cur == '<') && (next == '!') && next 11283 third_party/libxml/src/parser.c } else if ((cur == '<') && (next == '!') && next 11326 third_party/libxml/src/parser.c } else if ((cur == '<') && (next == '!') && next 11348 third_party/libxml/src/parser.c next = ctxt->input->cur[1]; next 11349 third_party/libxml/src/parser.c if ((cur == '<') && (next == '?')) { next 11360 third_party/libxml/src/parser.c } else if ((cur == '<') && (next == '!') && next 11373 third_party/libxml/src/parser.c } else if ((cur == '<') && (next == '!') && next 11396 third_party/libxml/src/parser.c next = ctxt->input->cur[1]; next 11397 third_party/libxml/src/parser.c if ((cur == '<') && (next == '?')) { next 11409 third_party/libxml/src/parser.c } else if ((cur == '<') && (next == '!') && next 11422 third_party/libxml/src/parser.c } else if ((cur == '<') && (next == '!') && next 11541 third_party/libxml/src/parser.c if (next == 0) next 12156 third_party/libxml/src/parser.c tmp = tmp->next; next 12284 third_party/libxml/src/parser.c tmp = tmp->next; next 12499 third_party/libxml/src/parser.c cur = cur->next; next 12680 third_party/libxml/src/parser.c cur = cur->next; next 12938 third_party/libxml/src/parser.c cur = cur->next; next 13119 third_party/libxml/src/parser.c ns = ns->next; next 13165 third_party/libxml/src/parser.c cur = fake->next; next 13166 third_party/libxml/src/parser.c fake->next = NULL; next 13177 third_party/libxml/src/parser.c cur = cur->next; next 13348 third_party/libxml/src/parser.c cur = cur->next; next 1810 third_party/libxml/src/parserInternals.c xmlNodePtr cur, next; next 1814 third_party/libxml/src/parserInternals.c next = cur->next; next 1816 third_party/libxml/src/parserInternals.c cur = next; next 1820 third_party/libxml/src/parserInternals.c xmlAttrPtr cur, next; next 1824 third_party/libxml/src/parserInternals.c next = cur->next; next 1826 third_party/libxml/src/parserInternals.c cur = next; next 106 third_party/libxml/src/pattern.c struct _xmlStreamCtxt *next;/* link to next sub pattern if | */ next 164 third_party/libxml/src/pattern.c struct _xmlPattern *next; /* next pattern if | is used */ next 234 third_party/libxml/src/pattern.c if (comp->next != NULL) next 235 third_party/libxml/src/pattern.c xmlFreePattern(comp->next); next 271 third_party/libxml/src/pattern.c comp = comp->next; next 272 third_party/libxml/src/pattern.c cur->next = NULL; next 558 third_party/libxml/src/pattern.c lst = lst->next; next 1788 third_party/libxml/src/pattern.c xmlStreamCtxtPtr next; next 1791 third_party/libxml/src/pattern.c next = stream->next; next 1795 third_party/libxml/src/pattern.c stream = next; next 1897 third_party/libxml/src/pattern.c stream = stream->next; next 1910 third_party/libxml/src/pattern.c stream = stream->next; next 2184 third_party/libxml/src/pattern.c stream = stream->next; next 2306 third_party/libxml/src/pattern.c stream = stream->next; next 2331 third_party/libxml/src/pattern.c streamCtxt = streamCtxt->next; next 2393 third_party/libxml/src/pattern.c cur->next = ret->next; next 2394 third_party/libxml/src/pattern.c ret->next = cur; next 2437 third_party/libxml/src/pattern.c cur = cur->next; next 2470 third_party/libxml/src/pattern.c comp = comp->next; next 2501 third_party/libxml/src/pattern.c cur->next = ret->next; next 2502 third_party/libxml/src/pattern.c ret->next = cur; next 2505 third_party/libxml/src/pattern.c comp = comp->next; next 2529 third_party/libxml/src/pattern.c comp = comp->next; next 2556 third_party/libxml/src/pattern.c comp = comp->next; next 2583 third_party/libxml/src/pattern.c comp = comp->next; next 2605 third_party/libxml/src/pattern.c comp = comp->next; next 110 third_party/libxml/src/relaxng.c xmlRelaxNGGrammarPtr next; /* the next grammar if any */ next 163 third_party/libxml/src/relaxng.c xmlRelaxNGDefinePtr next; /* list within grouping sequences */ next 400 third_party/libxml/src/relaxng.c xmlRelaxNGIncludePtr next; /* keep a chain of includes */ next 413 third_party/libxml/src/relaxng.c xmlRelaxNGDocumentPtr next; /* keep a chain of documents */ next 702 third_party/libxml/src/relaxng.c xmlRelaxNGDocumentPtr next; next 705 third_party/libxml/src/relaxng.c next = docu->next; next 707 third_party/libxml/src/relaxng.c docu = next; next 741 third_party/libxml/src/relaxng.c xmlRelaxNGIncludePtr next; next 744 third_party/libxml/src/relaxng.c next = incl->next; next 746 third_party/libxml/src/relaxng.c incl = next; next 867 third_party/libxml/src/relaxng.c if (grammar->next != NULL) { next 868 third_party/libxml/src/relaxng.c xmlRelaxNGFreeGrammar(grammar->next); next 1201 third_party/libxml/src/relaxng.c attr = attr->next; next 1259 third_party/libxml/src/relaxng.c attr = attr->next; next 1535 third_party/libxml/src/relaxng.c tmp2 = tmp->next; next 1644 third_party/libxml/src/relaxng.c ret->next = ctxt->includes; next 1740 third_party/libxml/src/relaxng.c cur = cur->next; next 1974 third_party/libxml/src/relaxng.c ret->next = ctxt->documents; next 2908 third_party/libxml/src/relaxng.c list = list->next; next 2959 third_party/libxml/src/relaxng.c list = list->next; next 2977 third_party/libxml/src/relaxng.c list = list->next; next 3059 third_party/libxml/src/relaxng.c list = list->next; next 3091 third_party/libxml/src/relaxng.c list = list->next; next 3131 third_party/libxml/src/relaxng.c list = list->next; next 3145 third_party/libxml/src/relaxng.c list = list->next; next 3158 third_party/libxml/src/relaxng.c list = list->next; next 3164 third_party/libxml/src/relaxng.c list = list->next; next 3187 third_party/libxml/src/relaxng.c list = list->next; next 3203 third_party/libxml/src/relaxng.c list = list->next; next 3314 third_party/libxml/src/relaxng.c list = list->next; next 3409 third_party/libxml/src/relaxng.c list = list->next; next 3423 third_party/libxml/src/relaxng.c list = list->next; next 3577 third_party/libxml/src/relaxng.c (node->children->next != NULL)) { next 3692 third_party/libxml/src/relaxng.c content = content->next; next 3695 third_party/libxml/src/relaxng.c content = content->next; next 3709 third_party/libxml/src/relaxng.c lastparam->next = param; next 3715 third_party/libxml/src/relaxng.c content = content->next; next 3743 third_party/libxml/src/relaxng.c last->next = tmp2; next 3747 third_party/libxml/src/relaxng.c child = child->next; next 3749 third_party/libxml/src/relaxng.c content = content->next; next 3947 third_party/libxml/src/relaxng.c tmp = tmp->next; next 3954 third_party/libxml/src/relaxng.c if (cur->next != NULL) { next 3955 third_party/libxml/src/relaxng.c cur = cur->next; next 3964 third_party/libxml/src/relaxng.c if (cur->next != NULL) { next 3965 third_party/libxml/src/relaxng.c cur = cur->next; next 4047 third_party/libxml/src/relaxng.c tmp = tmp->next; next 4054 third_party/libxml/src/relaxng.c if (cur->next != NULL) { next 4055 third_party/libxml/src/relaxng.c cur = cur->next; next 4064 third_party/libxml/src/relaxng.c if (cur->next != NULL) { next 4065 third_party/libxml/src/relaxng.c cur = cur->next; next 4110 third_party/libxml/src/relaxng.c cur = cur->next; next 4176 third_party/libxml/src/relaxng.c cur = cur->next; next 4242 third_party/libxml/src/relaxng.c cur = cur->next; next 4247 third_party/libxml/src/relaxng.c cur = cur->next; next 4262 third_party/libxml/src/relaxng.c cur = cur->next; next 4268 third_party/libxml/src/relaxng.c cur = cur->next; next 4338 third_party/libxml/src/relaxng.c cur = cur->next; next 4360 third_party/libxml/src/relaxng.c cur = cur->next; next 4520 third_party/libxml/src/relaxng.c last->next = cur; next 4524 third_party/libxml/src/relaxng.c child = child->next; next 5005 third_party/libxml/src/relaxng.c grammar->next = old->next; next 5006 third_party/libxml/src/relaxng.c old->next = grammar; next 5078 third_party/libxml/src/relaxng.c if ((def->content != NULL) && (def->content->next != NULL)) { next 5091 third_party/libxml/src/relaxng.c tmp->next = def->content; next 5136 third_party/libxml/src/relaxng.c child = child->next; next 5177 third_party/libxml/src/relaxng.c child = child->next; next 5209 third_party/libxml/src/relaxng.c if (node->next != NULL) { next 5238 third_party/libxml/src/relaxng.c last->next = cur; next 5242 third_party/libxml/src/relaxng.c child = child->next; next 5362 third_party/libxml/src/relaxng.c last->next = tmp; next 5366 third_party/libxml/src/relaxng.c child = child->next; next 5381 third_party/libxml/src/relaxng.c while (tmp->next != NULL) { next 5382 third_party/libxml/src/relaxng.c tmp = tmp->next; next 5384 third_party/libxml/src/relaxng.c tmp->next = ret; next 5420 third_party/libxml/src/relaxng.c child = child->next; next 5466 third_party/libxml/src/relaxng.c last->next = cur; next 5471 third_party/libxml/src/relaxng.c cur->next = ret->attrs; next 5496 third_party/libxml/src/relaxng.c child = child->next; next 5531 third_party/libxml/src/relaxng.c last->next = cur; next 5541 third_party/libxml/src/relaxng.c last->next = cur; next 5546 third_party/libxml/src/relaxng.c nodes = nodes->next; next 5594 third_party/libxml/src/relaxng.c while (last->next != NULL) next 5595 third_party/libxml/src/relaxng.c last = last->next; next 5596 third_party/libxml/src/relaxng.c last->next = def; next 5600 third_party/libxml/src/relaxng.c nodes = nodes->next; next 5653 third_party/libxml/src/relaxng.c nodes = nodes->next; next 5790 third_party/libxml/src/relaxng.c if (tmp->content->next != NULL) { next 5805 third_party/libxml/src/relaxng.c last->next = tmp2; next 5853 third_party/libxml/src/relaxng.c if ((starts == NULL) || (starts->next == NULL)) next 5900 third_party/libxml/src/relaxng.c cur = cur->next; next 5973 third_party/libxml/src/relaxng.c cur = cur->next; next 5995 third_party/libxml/src/relaxng.c prev->next = cur->next; next 5999 third_party/libxml/src/relaxng.c parent->content = cur->next; next 6001 third_party/libxml/src/relaxng.c parent->attrs = cur->next; next 6003 third_party/libxml/src/relaxng.c parent->nameClass = cur->next; next 6086 third_party/libxml/src/relaxng.c cur->content = tmp->next; next 6087 third_party/libxml/src/relaxng.c tmp->next = cur->attrs; next 6097 third_party/libxml/src/relaxng.c while ((pre != NULL) && (pre->next != NULL)) { next 6098 third_party/libxml/src/relaxng.c tmp = pre->next; next 6104 third_party/libxml/src/relaxng.c pre->next = tmp->next; next 6105 third_party/libxml/src/relaxng.c tmp->next = cur->attrs; next 6119 third_party/libxml/src/relaxng.c else if (cur->content->next == NULL) { next 6124 third_party/libxml/src/relaxng.c cur->content->next = cur->next; next 6127 third_party/libxml/src/relaxng.c cur->content->next = cur->next; next 6128 third_party/libxml/src/relaxng.c prev->next = cur->content; next 6174 third_party/libxml/src/relaxng.c cur = cur->next; next 6526 third_party/libxml/src/relaxng.c cur = cur->next; next 6586 third_party/libxml/src/relaxng.c while (tmp->next != NULL) next 6587 third_party/libxml/src/relaxng.c tmp = tmp->next; next 6588 third_party/libxml/src/relaxng.c tmp->next = ret; next 6673 third_party/libxml/src/relaxng.c while (tmp->next != NULL) next 6674 third_party/libxml/src/relaxng.c tmp = tmp->next; next 6675 third_party/libxml/src/relaxng.c tmp->next = ret; next 6691 third_party/libxml/src/relaxng.c (schema->topgrammar->start->next != NULL)) next 6909 third_party/libxml/src/relaxng.c xmlAttrPtr cur, next; next 6913 third_party/libxml/src/relaxng.c next = cur->next; next 6982 third_party/libxml/src/relaxng.c cur = next; next 7340 third_party/libxml/src/relaxng.c tmp = child->next; next 7356 third_party/libxml/src/relaxng.c while (parDef->next != NULL) next 7357 third_party/libxml/src/relaxng.c parDef = parDef->next; next 7358 third_party/libxml/src/relaxng.c parDef->next = cur->nsDef; next 7400 third_party/libxml/src/relaxng.c if (cur->next != NULL) { next 7401 third_party/libxml/src/relaxng.c cur = cur->next; next 7413 third_party/libxml/src/relaxng.c if (cur->next != NULL) { next 7414 third_party/libxml/src/relaxng.c cur = cur->next; next 7685 third_party/libxml/src/relaxng.c defines = defines->next; next 8017 third_party/libxml/src/relaxng.c cur = cur->next; next 8515 third_party/libxml/src/relaxng.c node = node->next; next 8622 third_party/libxml/src/relaxng.c cur = cur->next; next 8689 third_party/libxml/src/relaxng.c defines = defines->next; next 8792 third_party/libxml/src/relaxng.c list = list->next; next 8864 third_party/libxml/src/relaxng.c list = list->next; next 8919 third_party/libxml/src/relaxng.c list = list->next; next 8935 third_party/libxml/src/relaxng.c list = list->next; next 8973 third_party/libxml/src/relaxng.c defines = defines->next; next 9021 third_party/libxml/src/relaxng.c list = list->next; next 9162 third_party/libxml/src/relaxng.c cur = cur->next; next 9180 third_party/libxml/src/relaxng.c cur = cur->next; next 9361 third_party/libxml/src/relaxng.c lasts[i]->next = cur; next 9367 third_party/libxml/src/relaxng.c if (cur->next != NULL) next 9368 third_party/libxml/src/relaxng.c lastchg = cur->next; next 9371 third_party/libxml/src/relaxng.c cur = xmlRelaxNGSkipIgnored(ctxt, cur->next); next 9384 third_party/libxml/src/relaxng.c last = lasts[i]->next; next 9385 third_party/libxml/src/relaxng.c lasts[i]->next = NULL; next 9477 third_party/libxml/src/relaxng.c lasts[i]->next = last; next 9499 third_party/libxml/src/relaxng.c cur->prev->next = cur; next 9544 third_party/libxml/src/relaxng.c defines = defines->next; next 9615 third_party/libxml/src/relaxng.c list = list->next; next 9642 third_party/libxml/src/relaxng.c list = list->next; next 9824 third_party/libxml/src/relaxng.c node = node->next; next 9849 third_party/libxml/src/relaxng.c ctxt->state->seq = xmlRelaxNGSkipIgnored(ctxt, node->next); next 10035 third_party/libxml/src/relaxng.c oldstate->seq = xmlRelaxNGSkipIgnored(ctxt, node->next); next 10337 third_party/libxml/src/relaxng.c list = list->next; next 10391 third_party/libxml/src/relaxng.c child = child->next; next 10434 third_party/libxml/src/relaxng.c child = child->next; next 10485 third_party/libxml/src/relaxng.c child = child->next; next 10511 third_party/libxml/src/relaxng.c ctxt->state->seq = node->next; next 10795 third_party/libxml/src/relaxng.c if (cur->next != NULL) { next 10796 third_party/libxml/src/relaxng.c cur = cur->next; next 10807 third_party/libxml/src/relaxng.c if (cur->next != NULL) { next 10808 third_party/libxml/src/relaxng.c cur = cur->next; next 3485 third_party/libxml/src/runtest.c for (ns = root->nsDef, j = 0;ns != NULL && j < 20;ns=ns->next) { next 3584 third_party/libxml/src/runtest.c node = node->next; next 3620 third_party/libxml/src/runtest.c ns = ns->next; next 60 third_party/libxml/src/schematron.c node = node->next; \ next 86 third_party/libxml/src/schematron.c xmlSchematronTestPtr next; /* the next test in the list */ next 102 third_party/libxml/src/schematron.c xmlSchematronRulePtr next; /* the next rule in the list */ next 119 third_party/libxml/src/schematron.c xmlSchematronPatternPtr next;/* the next pattern in the list */ next 340 third_party/libxml/src/schematron.c ret->next = NULL; next 346 third_party/libxml/src/schematron.c while (prev->next != NULL) next 347 third_party/libxml/src/schematron.c prev = prev->next; next 348 third_party/libxml/src/schematron.c prev->next = ret; next 361 third_party/libxml/src/schematron.c xmlSchematronTestPtr next; next 364 third_party/libxml/src/schematron.c next = tests->next; next 372 third_party/libxml/src/schematron.c tests = next; next 422 third_party/libxml/src/schematron.c ret->next = NULL; next 428 third_party/libxml/src/schematron.c while (prev->next != NULL) next 429 third_party/libxml/src/schematron.c prev = prev->next; next 430 third_party/libxml/src/schematron.c prev->next = ret; next 453 third_party/libxml/src/schematron.c xmlSchematronRulePtr next; next 456 third_party/libxml/src/schematron.c next = rules->next; next 466 third_party/libxml/src/schematron.c rules = next; next 497 third_party/libxml/src/schematron.c ret->next = NULL; next 503 third_party/libxml/src/schematron.c while (prev->next != NULL) next 504 third_party/libxml/src/schematron.c prev = prev->next; next 505 third_party/libxml/src/schematron.c prev->next = ret; next 518 third_party/libxml/src/schematron.c xmlSchematronPatternPtr next; next 521 third_party/libxml/src/schematron.c next = patterns->next; next 525 third_party/libxml/src/schematron.c patterns = next; next 786 third_party/libxml/src/schematron.c ret = ret->next; next 939 third_party/libxml/src/schematron.c cur = cur->next; next 987 third_party/libxml/src/schematron.c cur = cur->next; next 1024 third_party/libxml/src/schematron.c return(cur->next); next 1163 third_party/libxml/src/schematron.c cur = cur->next; next 1188 third_party/libxml/src/schematron.c cur = cur->next; next 1200 third_party/libxml/src/schematron.c cur = cur->next; next 1325 third_party/libxml/src/schematron.c child = child->next; next 1352 third_party/libxml/src/schematron.c child = child->next; next 1569 third_party/libxml/src/schematron.c while (cur->next != NULL) { next 1570 third_party/libxml/src/schematron.c cur = cur->next; next 1580 third_party/libxml/src/schematron.c if (cur->next != NULL) { next 1581 third_party/libxml/src/schematron.c cur = cur->next; next 1695 third_party/libxml/src/schematron.c test = test->next; next 1698 third_party/libxml/src/schematron.c rule = rule->next; next 1726 third_party/libxml/src/schematron.c test = test->next; next 1734 third_party/libxml/src/schematron.c pattern = pattern->next; next 264 third_party/libxml/src/testC14N.c node = node->next; next 300 third_party/libxml/src/testC14N.c ns = ns->next; next 85 third_party/libxml/src/testapi.c (api_doc->children->next != NULL) && next 86 third_party/libxml/src/testapi.c (api_doc->children->next->type == XML_ELEMENT_NODE)) next 87 third_party/libxml/src/testapi.c api_root = api_doc->children->next; next 25987 third_party/libxml/src/testapi.c xmlNode * next; /* an element to insert next */ next 26000 third_party/libxml/src/testapi.c next = gen_xmlNodePtr(n_next, 1); next 26004 third_party/libxml/src/testapi.c ret_val = xmlValidGetValidElements(prev, next, (const xmlChar **)names, max); next 26008 third_party/libxml/src/testapi.c des_xmlNodePtr(n_next, next, 1); next 620 third_party/libxml/src/threads.c struct _xmlGlobalStateCleanupHelperParams *next; next 719 third_party/libxml/src/threads.c p->next = cleanup_helpers_head; next 925 third_party/libxml/src/threads.c p = p->next; next 1017 third_party/libxml/src/threads.c cleanup_helpers_head = p->next; next 1019 third_party/libxml/src/threads.c p->prev->next = p->next; next 1020 third_party/libxml/src/threads.c if (p->next != NULL) next 1021 third_party/libxml/src/threads.c p->next->prev = p->prev; next 126 third_party/libxml/src/tree.c while (ulccur->next != NULL) { \ next 128 third_party/libxml/src/tree.c ulccur = ulccur->next; \ next 758 third_party/libxml/src/tree.c while (prev->next != NULL) { next 759 third_party/libxml/src/tree.c prev = prev->next; next 766 third_party/libxml/src/tree.c prev->next = cur; next 819 third_party/libxml/src/tree.c xmlNsPtr next; next 828 third_party/libxml/src/tree.c next = cur->next; next 830 third_party/libxml/src/tree.c cur = next; next 905 third_party/libxml/src/tree.c cur = cur->next; next 989 third_party/libxml/src/tree.c cur->next = prev; next 992 third_party/libxml/src/tree.c xmlNodePtr next; next 994 third_party/libxml/src/tree.c next = doc->children; next 995 third_party/libxml/src/tree.c while ((next != NULL) && (next->type != XML_ELEMENT_NODE)) next 996 third_party/libxml/src/tree.c next = next->next; next 997 third_party/libxml/src/tree.c if (next == NULL) { next 999 third_party/libxml/src/tree.c cur->prev->next = (xmlNodePtr) cur; next 1000 third_party/libxml/src/tree.c cur->next = NULL; next 1003 third_party/libxml/src/tree.c cur->next = next; next 1004 third_party/libxml/src/tree.c cur->prev = next->prev; next 1008 third_party/libxml/src/tree.c cur->prev->next = (xmlNodePtr) cur; next 1009 third_party/libxml/src/tree.c next->prev = (xmlNodePtr) cur; next 1087 third_party/libxml/src/tree.c xmlNodePtr next, c = cur->children; next 1094 third_party/libxml/src/tree.c next = c->next; next 1102 third_party/libxml/src/tree.c c = next; next 1274 third_party/libxml/src/tree.c last->next = node; next 1381 third_party/libxml/src/tree.c temp = temp->next; next 1471 third_party/libxml/src/tree.c last->next = node; next 1565 third_party/libxml/src/tree.c temp = temp->next; next 1691 third_party/libxml/src/tree.c node = node->next; next 1774 third_party/libxml/src/tree.c node = node->next; next 1840 third_party/libxml/src/tree.c if (tmp->next == NULL) next 1842 third_party/libxml/src/tree.c tmp = tmp->next; next 1855 third_party/libxml/src/tree.c while (prev->next != NULL) next 1856 third_party/libxml/src/tree.c prev = prev->next; next 1857 third_party/libxml/src/tree.c prev->next = cur; next 1993 third_party/libxml/src/tree.c if (tmp->next == NULL) next 1995 third_party/libxml/src/tree.c tmp = tmp->next; next 2012 third_party/libxml/src/tree.c xmlAttrPtr next; next 2015 third_party/libxml/src/tree.c next = cur->next; next 2017 third_party/libxml/src/tree.c cur = next; next 2074 third_party/libxml/src/tree.c cur->parent->properties = cur->next; next 2075 third_party/libxml/src/tree.c if (cur->next != NULL) next 2076 third_party/libxml/src/tree.c cur->next->prev = NULL; next 2081 third_party/libxml/src/tree.c if (tmp->next == cur) { next 2082 third_party/libxml/src/tree.c tmp->next = cur->next; next 2083 third_party/libxml/src/tree.c if (tmp->next != NULL) next 2084 third_party/libxml/src/tree.c tmp->next->prev = tmp; next 2088 third_party/libxml/src/tree.c tmp = tmp->next; next 2480 third_party/libxml/src/tree.c prev->next = cur; next 2759 third_party/libxml/src/tree.c prop = prop->next; next 2785 third_party/libxml/src/tree.c cur = cur->next; next 2860 third_party/libxml/src/tree.c prev->next = cur; next 2901 third_party/libxml/src/tree.c prop->next = prev->next; next 2902 third_party/libxml/src/tree.c prev->next = prop; next 2903 third_party/libxml/src/tree.c if (prop->next) next 2904 third_party/libxml/src/tree.c prop->next->prev = prop; next 2906 third_party/libxml/src/tree.c prop->next = cur; next 2965 third_party/libxml/src/tree.c if ((cur->next != NULL) && (cur->next->type == XML_TEXT_NODE) && next 2966 third_party/libxml/src/tree.c (cur->name == cur->next->name)) { next 2970 third_party/libxml/src/tree.c tmp = xmlStrcat(tmp, cur->next->content); next 2971 third_party/libxml/src/tree.c xmlNodeSetContent(cur->next, tmp); next 2974 third_party/libxml/src/tree.c return(cur->next); next 2985 third_party/libxml/src/tree.c elem->next = cur->next; next 2986 third_party/libxml/src/tree.c cur->next = elem; next 2987 third_party/libxml/src/tree.c if (elem->next != NULL) next 2988 third_party/libxml/src/tree.c elem->next->prev = elem; next 3062 third_party/libxml/src/tree.c elem->next = cur; next 3066 third_party/libxml/src/tree.c elem->prev->next = elem; next 3121 third_party/libxml/src/tree.c (cur->parent->last->next == NULL)) { next 3124 third_party/libxml/src/tree.c while (cur->next != NULL) cur = cur->next; next 3143 third_party/libxml/src/tree.c elem->next = NULL; next 3145 third_party/libxml/src/tree.c cur->next = elem; next 3207 third_party/libxml/src/tree.c if (cur->next == NULL) { next 3212 third_party/libxml/src/tree.c cur = cur->next; next 3216 third_party/libxml/src/tree.c prev->next = cur; next 3219 third_party/libxml/src/tree.c while (cur->next != NULL) { next 3224 third_party/libxml/src/tree.c cur = cur->next; next 3345 third_party/libxml/src/tree.c while (lastattr->next != NULL) { next 3346 third_party/libxml/src/tree.c lastattr = lastattr->next; next 3348 third_party/libxml/src/tree.c lastattr->next = (xmlAttrPtr) cur; next 3357 third_party/libxml/src/tree.c prev->next = cur; next 3421 third_party/libxml/src/tree.c cur = cur->next; next 3456 third_party/libxml/src/tree.c cur = cur->next; next 3562 third_party/libxml/src/tree.c node = node->next; next 3570 third_party/libxml/src/tree.c node = node->next; next 3586 third_party/libxml/src/tree.c xmlNodePtr next; next 3604 third_party/libxml/src/tree.c next = cur->next; next 3643 third_party/libxml/src/tree.c cur = next; next 3771 third_party/libxml/src/tree.c parent->properties = ((xmlAttrPtr) cur)->next; next 3774 third_party/libxml/src/tree.c parent->children = cur->next; next 3780 third_party/libxml/src/tree.c if (cur->next != NULL) next 3781 third_party/libxml/src/tree.c cur->next->prev = cur->prev; next 3783 third_party/libxml/src/tree.c cur->prev->next = cur->next; next 3784 third_party/libxml/src/tree.c cur->next = cur->prev = NULL; next 3833 third_party/libxml/src/tree.c cur->next = old->next; next 3834 third_party/libxml/src/tree.c if (cur->next != NULL) next 3835 third_party/libxml/src/tree.c cur->next->prev = cur; next 3838 third_party/libxml/src/tree.c cur->prev->next = cur; next 3850 third_party/libxml/src/tree.c old->next = old->prev = NULL; next 3907 third_party/libxml/src/tree.c p->next = q; next 3910 third_party/libxml/src/tree.c cur = cur->next; next 3990 third_party/libxml/src/tree.c if (tmp->next == NULL) next 3992 third_party/libxml/src/tree.c tmp = tmp->next; next 4049 third_party/libxml/src/tree.c p->next = q; next 4053 third_party/libxml/src/tree.c cur = cur->next; next 4239 third_party/libxml/src/tree.c node = node->next; next 4260 third_party/libxml/src/tree.c p->next = q; next 4264 third_party/libxml/src/tree.c node = node->next; next 4402 third_party/libxml/src/tree.c cur = cur->next; next 4409 third_party/libxml/src/tree.c p->next = q; next 4413 third_party/libxml/src/tree.c q->next = NULL; next 4416 third_party/libxml/src/tree.c cur = cur->next; next 4471 third_party/libxml/src/tree.c if (tmp->next == NULL) next 4473 third_party/libxml/src/tree.c tmp = tmp->next; next 4533 third_party/libxml/src/tree.c xmlNodePtr cur, tmp, next; next 4569 third_party/libxml/src/tree.c next = NULL; next 4589 third_party/libxml/src/tree.c next = cur->parent; next 4607 third_party/libxml/src/tree.c tmp = cur->next; next 4616 third_party/libxml/src/tree.c tmp = tmp->next; next 4625 third_party/libxml/src/tree.c next = cur->parent; next 4637 third_party/libxml/src/tree.c tmp = cur->next; next 4641 third_party/libxml/src/tree.c tmp = tmp->next; next 4651 third_party/libxml/src/tree.c next = cur->parent; next 4668 third_party/libxml/src/tree.c tmp = cur->next; next 4676 third_party/libxml/src/tree.c tmp = tmp->next; next 4687 third_party/libxml/src/tree.c next = cur->parent; next 4700 third_party/libxml/src/tree.c tmp = cur->next; next 4705 third_party/libxml/src/tree.c tmp = tmp->next; next 4725 third_party/libxml/src/tree.c next = ((xmlAttrPtr) cur)->parent; next 4727 third_party/libxml/src/tree.c next = cur->parent; next 4760 third_party/libxml/src/tree.c cur = next; next 4785 third_party/libxml/src/tree.c ret = ret->next; next 4816 third_party/libxml/src/tree.c old = old->next; next 5144 third_party/libxml/src/tree.c cur = cur->next; next 5158 third_party/libxml/src/tree.c cur = cur->next; next 5253 third_party/libxml/src/tree.c if (tmp->next != NULL) { next 5254 third_party/libxml/src/tree.c tmp = tmp->next; next 5266 third_party/libxml/src/tree.c if (tmp->next != NULL) { next 5267 third_party/libxml/src/tree.c tmp = tmp->next; next 5283 third_party/libxml/src/tree.c tmp = tmp->next; next 5308 third_party/libxml/src/tree.c tmp = tmp->next; next 5331 third_party/libxml/src/tree.c cur = cur->next; next 5635 third_party/libxml/src/tree.c if ((last != NULL) && (last->next == newNode)) { next 5782 third_party/libxml/src/tree.c cur = cur->next; next 5863 third_party/libxml/src/tree.c cur->next = node->nsDef; next 5895 third_party/libxml/src/tree.c cur = cur->next; next 5948 third_party/libxml/src/tree.c tst = tst->next; next 5996 third_party/libxml/src/tree.c cur->next = node->nsDef; next 6028 third_party/libxml/src/tree.c cur = cur->next; next 6270 third_party/libxml/src/tree.c attr = attr->next; next 6280 third_party/libxml/src/tree.c } else if ((node != tree) && (node->next != NULL)) { next 6282 third_party/libxml/src/tree.c node = node->next; next 6288 third_party/libxml/src/tree.c if ((node != tree) && (node->next != NULL)) { next 6289 third_party/libxml/src/tree.c node = node->next; next 6330 third_party/libxml/src/tree.c prop = prop->next; next 6343 third_party/libxml/src/tree.c prop = prop->next; next 6436 third_party/libxml/src/tree.c if ((prop->children->next == NULL) && next 6486 third_party/libxml/src/tree.c prop = prop->next; next 6739 third_party/libxml/src/tree.c if (tmp->next == NULL) next 6741 third_party/libxml/src/tree.c tmp = tmp->next; next 7596 third_party/libxml/src/tree.c xmlNsMapItemPtr next; next 7620 third_party/libxml/src/tree.c #define XML_NSMAP_FOREACH(m, i) for (i = (m)->first; i != NULL; i = (i)->next) next 7627 third_party/libxml/src/tree.c (m)->last->next = NULL; \ next 7628 third_party/libxml/src/tree.c (i)->next = (m)->pool; \ next 7647 third_party/libxml/src/tree.c cur = cur->next; next 7653 third_party/libxml/src/tree.c cur = cur->next; next 7699 third_party/libxml/src/tree.c map->pool = ret->next; next 7724 third_party/libxml/src/tree.c map->last->next = ret; next 7731 third_party/libxml/src/tree.c ret->next = map->first; next 7767 third_party/libxml/src/tree.c if (ns->next != NULL) { next 7769 third_party/libxml/src/tree.c ns = ns->next; next 7776 third_party/libxml/src/tree.c if (ns->next == NULL) next 7778 third_party/libxml/src/tree.c ns = ns->next; next 7783 third_party/libxml/src/tree.c ns->next = xmlNewNs(NULL, nsName, prefix); next 7784 third_party/libxml/src/tree.c return (ns->next); next 7852 third_party/libxml/src/tree.c ns = ns->next; next 7910 third_party/libxml/src/tree.c ns = ns->next; next 8045 third_party/libxml/src/tree.c ns = ns->next; next 8104 third_party/libxml/src/tree.c if (node->next != NULL) next 8105 third_party/libxml/src/tree.c node = node->next; next 8158 third_party/libxml/src/tree.c for (ns = cur->nsDef; ns != NULL; ns = ns->next) { next 8177 third_party/libxml/src/tree.c prevns = prevns->next; next 8275 third_party/libxml/src/tree.c ns = ns->next; next 8339 third_party/libxml/src/tree.c while (ns2->next != NULL) next 8340 third_party/libxml/src/tree.c ns2 = ns2->next; next 8341 third_party/libxml/src/tree.c ns2->next = ret; next 8592 third_party/libxml/src/tree.c prevns->next = ns->next; next 8594 third_party/libxml/src/tree.c cur->nsDef = ns->next; next 8629 third_party/libxml/src/tree.c ns = ns->next; next 8732 third_party/libxml/src/tree.c if (cur->next != NULL) next 8733 third_party/libxml/src/tree.c cur = cur->next; next 8840 third_party/libxml/src/tree.c if (cur->next == NULL) next 8843 third_party/libxml/src/tree.c cur = cur->next; next 8847 third_party/libxml/src/tree.c } while (cur->next != NULL); next 8883 third_party/libxml/src/tree.c for (ns = cur->nsDef; ns != NULL; ns = ns->next) { next 9079 third_party/libxml/src/tree.c if (cur->next != NULL) next 9080 third_party/libxml/src/tree.c cur = cur->next; next 9107 third_party/libxml/src/tree.c nsMap->last->next = nsMap->pool; next 9251 third_party/libxml/src/tree.c prevClone->next = clone; next 9276 third_party/libxml/src/tree.c prevClone->next = clone; next 9340 third_party/libxml/src/tree.c for (ns = cur->nsDef; ns != NULL; ns = ns->next) { next 9359 third_party/libxml/src/tree.c cloneNsDefSlot = &(cloneNs->next); next 9596 third_party/libxml/src/tree.c if (cur->next != NULL) { next 9598 third_party/libxml/src/tree.c cur = cur->next; next 9639 third_party/libxml/src/tree.c nsMap->last->next = nsMap->pool; next 9762 third_party/libxml/src/tree.c if (cur->next != NULL) next 9763 third_party/libxml/src/tree.c cur = cur->next; next 725 third_party/libxml/src/trio.c struct _trio_userdef_t *next; next 1027 third_party/libxml/src/trio.c for (def = internalUserDef; def; def = def->next) next 4317 third_party/libxml/src/trio.c prev->next = def; next 4324 third_party/libxml/src/trio.c def->next = NULL; next 4359 third_party/libxml/src/trio.c prev->next = def->next; next 564 third_party/libxml/src/valid.c cur = cur->next; next 1102 third_party/libxml/src/valid.c xmlElementContentPtr next; next 1109 third_party/libxml/src/valid.c next = cur->c2; next 1133 third_party/libxml/src/valid.c cur = next; next 1585 third_party/libxml/src/valid.c dtd->last->next = (xmlNodePtr) ret; next 1779 third_party/libxml/src/valid.c if (cur->next != NULL) xmlFreeEnumeration(cur->next); next 1802 third_party/libxml/src/valid.c if (cur->next != NULL) ret->next = xmlCopyEnumeration(cur->next); next 1803 third_party/libxml/src/valid.c else ret->next = NULL; next 1823 third_party/libxml/src/valid.c if (cur->next == NULL) next 1827 third_party/libxml/src/valid.c xmlDumpEnumeration(buf, cur->next); next 2132 third_party/libxml/src/valid.c dtd->last->next = (xmlNodePtr) ret; next 4197 third_party/libxml/src/valid.c tree = tree->next; next 4245 third_party/libxml/src/valid.c xmlElementContentPtr cur, next; next 4254 third_party/libxml/src/valid.c next = cur->c2; next 4255 third_party/libxml/src/valid.c while (next != NULL) { next 4256 third_party/libxml/src/valid.c if (next->type == XML_ELEMENT_CONTENT_ELEMENT) { next 4257 third_party/libxml/src/valid.c if ((xmlStrEqual(next->name, name)) && next 4258 third_party/libxml/src/valid.c (xmlStrEqual(next->prefix, cur->c1->prefix))) { next 4272 third_party/libxml/src/valid.c if (next->c1 == NULL) break; next 4273 third_party/libxml/src/valid.c if (next->c1->type != XML_ELEMENT_CONTENT_ELEMENT) break; next 4274 third_party/libxml/src/valid.c if ((xmlStrEqual(next->c1->name, name)) && next 4275 third_party/libxml/src/valid.c (xmlStrEqual(next->c1->prefix, cur->c1->prefix))) { next 4287 third_party/libxml/src/valid.c next = next->c2; next 4458 third_party/libxml/src/valid.c tree = tree->next; next 4473 third_party/libxml/src/valid.c tree = tree->next; next 4661 third_party/libxml/src/valid.c tree = tree->next; next 4682 third_party/libxml/src/valid.c tree = tree->next; next 4745 third_party/libxml/src/valid.c child = child->next; next 4749 third_party/libxml/src/valid.c child = child->next; next 4839 third_party/libxml/src/valid.c NODE = NODE->next; next 4880 third_party/libxml/src/valid.c NODE = NODE->next; next 5173 third_party/libxml/src/valid.c if (cur->next != NULL) next 5182 third_party/libxml/src/valid.c if (cur->next != NULL) next 5196 third_party/libxml/src/valid.c if (cur->next != NULL) next 5210 third_party/libxml/src/valid.c cur = cur->next; next 5309 third_party/libxml/src/valid.c cur = cur->next; next 5314 third_party/libxml/src/valid.c cur = cur->next; next 5394 third_party/libxml/src/valid.c tmp->next = NULL; next 5399 third_party/libxml/src/valid.c last->next = tmp; next 5416 third_party/libxml/src/valid.c cur = cur->next; next 5421 third_party/libxml/src/valid.c cur = cur->next; next 5484 third_party/libxml/src/valid.c tmp = repl->next; next 5552 third_party/libxml/src/valid.c cur = cur->next; next 5557 third_party/libxml/src/valid.c cur = cur->next; next 6119 third_party/libxml/src/valid.c child = child->next; next 6145 third_party/libxml/src/valid.c child =child->next; next 6171 third_party/libxml/src/valid.c ns = ns->next; next 6180 third_party/libxml/src/valid.c ns = ns->next; next 6217 third_party/libxml/src/valid.c attrib = attrib->next; next 6263 third_party/libxml/src/valid.c ns = ns->next; next 6279 third_party/libxml/src/valid.c ns = ns->next; next 6402 third_party/libxml/src/valid.c attr= attr->next; next 6412 third_party/libxml/src/valid.c ns = ns->next; next 6418 third_party/libxml/src/valid.c child = child->next; next 6691 third_party/libxml/src/valid.c tree = tree->next; next 6938 third_party/libxml/src/valid.c xmlValidGetValidElements(xmlNode *prev, xmlNode *next, const xmlChar **names, next 6957 third_party/libxml/src/valid.c if (prev == NULL && next == NULL) next 6967 third_party/libxml/src/valid.c ref_node = prev ? prev : next; next 6983 third_party/libxml/src/valid.c prev_next = prev ? prev->next : NULL; next 6984 third_party/libxml/src/valid.c next_prev = next ? next->prev : NULL; next 6994 third_party/libxml/src/valid.c test_node->next = next; next 6997 third_party/libxml/src/valid.c if (prev) prev->next = test_node; next 7000 third_party/libxml/src/valid.c if (next) next->prev = test_node; next 7025 third_party/libxml/src/valid.c if (prev) prev->next = prev_next; next 7026 third_party/libxml/src/valid.c if (next) next->prev = next_prev; next 857 third_party/libxml/src/xinclude.c last->next = res; next 862 third_party/libxml/src/xinclude.c cur = cur->next; next 880 third_party/libxml/src/xinclude.c for (i = 0;i <= no;cur = cur->next) { next 1156 third_party/libxml/src/xinclude.c cur = cur->next; next 1174 third_party/libxml/src/xinclude.c cur = cur->next; next 1201 third_party/libxml/src/xinclude.c if (last->next != NULL) next 1202 third_party/libxml/src/xinclude.c last = last->next; next 1220 third_party/libxml/src/xinclude.c while (last->next != NULL) next 1221 third_party/libxml/src/xinclude.c last = last->next; next 1763 third_party/libxml/src/xinclude.c node = node->next; next 2120 third_party/libxml/src/xinclude.c children = children->next; next 2190 third_party/libxml/src/xinclude.c tmp = tmp->next; next 2207 third_party/libxml/src/xinclude.c list = list->next; next 2234 third_party/libxml/src/xinclude.c list = list->next; next 2293 third_party/libxml/src/xinclude.c child = child->next; next 2364 third_party/libxml/src/xinclude.c } else if (cur->next != NULL) { next 2365 third_party/libxml/src/xinclude.c cur = cur->next; next 2375 third_party/libxml/src/xinclude.c if (cur->next != NULL) { next 2376 third_party/libxml/src/xinclude.c cur = cur->next; next 1992 third_party/libxml/src/xmllint.c for (ns = root->nsDef, i = 0;ns != NULL && i < 20;ns=ns->next) { next 2468 third_party/libxml/src/xmllint.c while ((node != NULL) && (node->last == NULL)) node = node->next; next 301 third_party/libxml/src/xmlreader.c cur->next = reader->ctxt->freeAttrs; next 318 third_party/libxml/src/xmlreader.c xmlAttrPtr next; next 321 third_party/libxml/src/xmlreader.c next = cur->next; next 323 third_party/libxml/src/xmlreader.c cur = next; next 337 third_party/libxml/src/xmlreader.c xmlNodePtr next; next 352 third_party/libxml/src/xmlreader.c next = cur->next; next 394 third_party/libxml/src/xmlreader.c cur->next = reader->ctxt->freeElems; next 401 third_party/libxml/src/xmlreader.c cur = next; next 470 third_party/libxml/src/xmlreader.c cur->next = reader->ctxt->freeElems; next 1085 third_party/libxml/src/xmlreader.c node = node->next; next 1107 third_party/libxml/src/xmlreader.c if (node->next != NULL) { next 1108 third_party/libxml/src/xmlreader.c node = node->next; next 1133 third_party/libxml/src/xmlreader.c if (node->next != NULL) { next 1134 third_party/libxml/src/xmlreader.c node = node->next; next 1155 third_party/libxml/src/xmlreader.c if (cur->next != NULL) return(cur->next) ; next 1159 third_party/libxml/src/xmlreader.c if (cur->next != NULL) return(cur->next); next 1219 third_party/libxml/src/xmlreader.c for ( ; node != NULL; node = node->next) { next 1328 third_party/libxml/src/xmlreader.c while ((reader->node != NULL) && (reader->node->next == NULL) && next 1335 third_party/libxml/src/xmlreader.c (reader->node->children->next == NULL)) || next 1363 third_party/libxml/src/xmlreader.c if (reader->node->next != NULL) { next 1383 third_party/libxml/src/xmlreader.c reader->node = reader->node->next; next 1472 third_party/libxml/src/xmlreader.c (reader->node->next == NULL) && next 1682 third_party/libxml/src/xmlreader.c cur_node = cur_node->next) { next 1871 third_party/libxml/src/xmlreader.c if (reader->node->next != 0) { next 1873 third_party/libxml/src/xmlreader.c reader->node = reader->node->next; next 1888 third_party/libxml/src/xmlreader.c if (reader->node->next != 0) { next 1889 third_party/libxml/src/xmlreader.c reader->node = reader->node->next; next 1956 third_party/libxml/src/xmlreader.c if (reader->node->next != NULL) { next 1957 third_party/libxml/src/xmlreader.c reader->node = reader->node->next; next 2011 third_party/libxml/src/xmlreader.c if (reader->node->next != NULL) { next 2012 third_party/libxml/src/xmlreader.c reader->node = reader->node->next; next 2314 third_party/libxml/src/xmlreader.c ns = ns->next; next 2323 third_party/libxml/src/xmlreader.c cur = cur->next; next 2373 third_party/libxml/src/xmlreader.c ns = ns->next; next 2390 third_party/libxml/src/xmlreader.c ns = ns->next; next 2443 third_party/libxml/src/xmlreader.c ns = ns->next; next 2558 third_party/libxml/src/xmlreader.c ns = ns->next; next 2569 third_party/libxml/src/xmlreader.c cur = cur->next; next 2617 third_party/libxml/src/xmlreader.c ns = ns->next; next 2634 third_party/libxml/src/xmlreader.c prop = prop->next; next 2649 third_party/libxml/src/xmlreader.c ns = ns->next; next 2665 third_party/libxml/src/xmlreader.c prop = prop->next; next 2720 third_party/libxml/src/xmlreader.c ns = ns->next; next 2738 third_party/libxml/src/xmlreader.c prop = prop->next; next 2794 third_party/libxml/src/xmlreader.c if (ns->next != NULL) { next 2795 third_party/libxml/src/xmlreader.c reader->curnode = (xmlNodePtr) ns->next; next 2804 third_party/libxml/src/xmlreader.c (reader->curnode->next != NULL)) { next 2805 third_party/libxml/src/xmlreader.c reader->curnode = reader->curnode->next; next 2872 third_party/libxml/src/xmlreader.c if (reader->curnode->next == NULL) next 2874 third_party/libxml/src/xmlreader.c reader->curnode = reader->curnode->next; next 2946 third_party/libxml/src/xmlreader.c attr = attr->next; next 2951 third_party/libxml/src/xmlreader.c ns = ns->next; next 3585 third_party/libxml/src/xmlreader.c (attr->children->next == NULL)) next 6426 third_party/libxml/src/xmlregexp.c xmlExpNodePtr next;/* the next node in the hash table or free list */ next 6525 third_party/libxml/src/xmlregexp.c ret->next = NULL; next 6692 third_party/libxml/src/xmlregexp.c insert = insert->next) { next 6760 third_party/libxml/src/xmlregexp.c entry->next = ctxt->table[key]; next 6786 third_party/libxml/src/xmlregexp.c ctxt->table[key] = exp->next; next 6792 third_party/libxml/src/xmlregexp.c if (tmp->next == exp) { next 6793 third_party/libxml/src/xmlregexp.c tmp->next = exp->next; next 6796 third_party/libxml/src/xmlregexp.c tmp = tmp->next; next 450 third_party/libxml/src/xmlsave.c children = children->next; next 541 third_party/libxml/src/xmlsave.c cur = cur->next; next 640 third_party/libxml/src/xmlsave.c cur = cur->next; next 671 third_party/libxml/src/xmlsave.c cur = cur->next; next 879 third_party/libxml/src/xmlsave.c tmp = tmp->next; next 1067 third_party/libxml/src/xmlsave.c child = child->next; next 1201 third_party/libxml/src/xmlsave.c cur = cur->next; next 1267 third_party/libxml/src/xmlsave.c cur = cur->next; next 1402 third_party/libxml/src/xmlsave.c tmp = tmp->next; next 1445 third_party/libxml/src/xmlsave.c tmp = tmp->next; next 1583 third_party/libxml/src/xmlsave.c child = child->next; next 384 third_party/libxml/src/xmlschemas.c xmlSchemaSchemaRelationPtr next; next 502 third_party/libxml/src/xmlschemas.c xmlSchemaTreeItemPtr next; next 519 third_party/libxml/src/xmlschemas.c xmlSchemaAttributeUsePtr next; /* The next attr. use. */ next 555 third_party/libxml/src/xmlschemas.c xmlSchemaRedefPtr next; next 664 third_party/libxml/src/xmlschemas.c xmlSchemaTreeItemPtr next; /* next particle */ next 684 third_party/libxml/src/xmlschemas.c xmlSchemaTreeItemPtr next; /* not used */ next 702 third_party/libxml/src/xmlschemas.c xmlSchemaTreeItemPtr next; /* not used */ next 722 third_party/libxml/src/xmlschemas.c xmlSchemaIDCSelectPtr next; next 739 third_party/libxml/src/xmlschemas.c xmlSchemaIDCPtr next; next 757 third_party/libxml/src/xmlschemas.c xmlSchemaIDCAugPtr next; /* next in a list */ next 798 third_party/libxml/src/xmlschemas.c xmlSchemaPSVIIDCBindingPtr next; /* next binding of a specific node */ next 825 third_party/libxml/src/xmlschemas.c xmlSchemaIDCStateObjPtr next; /* next if in a list */ next 846 third_party/libxml/src/xmlschemas.c xmlSchemaIDCMatcherPtr next; /* next in the list */ next 1244 third_party/libxml/src/xmlschemas.c return ((xmlSchemaBasicItemPtr) ((xmlSchemaElementPtr) item)->next); next 1246 third_party/libxml/src/xmlschemas.c return ((xmlSchemaBasicItemPtr) ((xmlSchemaAttributePtr) item)->next); next 1249 third_party/libxml/src/xmlschemas.c return ((xmlSchemaBasicItemPtr) ((xmlSchemaTypePtr) item)->next); next 1254 third_party/libxml/src/xmlschemas.c return ((xmlSchemaBasicItemPtr) ((xmlSchemaParticlePtr) item)->next); next 1262 third_party/libxml/src/xmlschemas.c return ((xmlSchemaBasicItemPtr) ((xmlSchemaAttributeGroupPtr) item)->next); next 1266 third_party/libxml/src/xmlschemas.c return ((xmlSchemaBasicItemPtr) ((xmlSchemaIDCPtr) item)->next); next 1797 third_party/libxml/src/xmlschemas.c for (facet = type->facets; facet != NULL; facet = facet->next) { next 3511 third_party/libxml/src/xmlschemas.c cur = cur->next; next 3682 third_party/libxml/src/xmlschemas.c if (annot->next == NULL) { next 3689 third_party/libxml/src/xmlschemas.c annot = annot->next; next 3768 third_party/libxml/src/xmlschemas.c xmlSchemaWildcardNsPtr next; next 3771 third_party/libxml/src/xmlschemas.c next = set->next; next 3773 third_party/libxml/src/xmlschemas.c set = next; next 3836 third_party/libxml/src/xmlschemas.c xmlSchemaTypeLinkPtr next; next 3839 third_party/libxml/src/xmlschemas.c next = link->next; next 3841 third_party/libxml/src/xmlschemas.c link = next; next 3848 third_party/libxml/src/xmlschemas.c xmlSchemaIDCStateObjPtr next; next 3850 third_party/libxml/src/xmlschemas.c next = sto->next; next 3856 third_party/libxml/src/xmlschemas.c sto = next; next 3886 third_party/libxml/src/xmlschemas.c cur = cur->next; next 3949 third_party/libxml/src/xmlschemas.c xmlSchemaFacetPtr facet, next; next 3953 third_party/libxml/src/xmlschemas.c next = facet->next; next 3955 third_party/libxml/src/xmlschemas.c facet = next; next 3963 third_party/libxml/src/xmlschemas.c xmlSchemaFacetLinkPtr next, link; next 3967 third_party/libxml/src/xmlschemas.c next = link->next; next 3969 third_party/libxml/src/xmlschemas.c link = next; next 4325 third_party/libxml/src/xmlschemas.c if (particle->next != NULL) next 4326 third_party/libxml/src/xmlschemas.c xmlSchemaContentModelDump((xmlSchemaParticlePtr) particle->next, next 4582 third_party/libxml/src/xmlschemas.c bind = bind->next; next 4615 third_party/libxml/src/xmlschemas.c prop = prop->next; next 4644 third_party/libxml/src/xmlschemas.c prop = prop->next; next 5087 third_party/libxml/src/xmlschemas.c rel = rel->next; next 5235 third_party/libxml/src/xmlschemas.c WXS_CONSTRUCTOR(pctxt)->lastRedef->next = ret; next 5508 third_party/libxml/src/xmlschemas.c ret->next = NULL; next 5589 third_party/libxml/src/xmlschemas.c ret->next = NULL; next 6412 third_party/libxml/src/xmlschemas.c rel = rel->next; next 6474 third_party/libxml/src/xmlschemas.c *child = (*child)->next; next 6523 third_party/libxml/src/xmlschemas.c attr = attr->next; next 6548 third_party/libxml/src/xmlschemas.c attr = attr->next; next 6552 third_party/libxml/src/xmlschemas.c child = child->next; next 6576 third_party/libxml/src/xmlschemas.c attr = attr->next; next 6585 third_party/libxml/src/xmlschemas.c child = child->next; next 6592 third_party/libxml/src/xmlschemas.c child = child->next; next 6680 third_party/libxml/src/xmlschemas.c child = child->next; next 6788 third_party/libxml/src/xmlschemas.c tmp = tmp->next; next 6797 third_party/libxml/src/xmlschemas.c tmp->next = NULL; next 6801 third_party/libxml/src/xmlschemas.c lastNs->next = tmp; next 6901 third_party/libxml/src/xmlschemas.c attr = attr->next; next 6925 third_party/libxml/src/xmlschemas.c child = child->next; next 6987 third_party/libxml/src/xmlschemas.c child = child->next; next 7042 third_party/libxml/src/xmlschemas.c attr = attr->next; next 7056 third_party/libxml/src/xmlschemas.c child = child->next; next 7212 third_party/libxml/src/xmlschemas.c attr = attr->next; next 7347 third_party/libxml/src/xmlschemas.c child = child->next; next 7426 third_party/libxml/src/xmlschemas.c child = child->next; next 7460 third_party/libxml/src/xmlschemas.c child = child->next; next 7555 third_party/libxml/src/xmlschemas.c attr = attr->next; next 7588 third_party/libxml/src/xmlschemas.c child = child->next; next 7602 third_party/libxml/src/xmlschemas.c child = child->next; next 7666 third_party/libxml/src/xmlschemas.c attr = attr->next; next 7680 third_party/libxml/src/xmlschemas.c child = child->next; next 7805 third_party/libxml/src/xmlschemas.c attr = attr->next; next 7815 third_party/libxml/src/xmlschemas.c child = child->next; next 7832 third_party/libxml/src/xmlschemas.c child = child->next; next 8075 third_party/libxml/src/xmlschemas.c if (cur->next != NULL) { \ next 8076 third_party/libxml/src/xmlschemas.c cur = cur->next; \ next 8078 third_party/libxml/src/xmlschemas.c cur->next = annot; next 8212 third_party/libxml/src/xmlschemas.c attr = attr->next; next 8262 third_party/libxml/src/xmlschemas.c child = child->next; next 8314 third_party/libxml/src/xmlschemas.c attr = attr->next; next 8370 third_party/libxml/src/xmlschemas.c child = child->next; next 8385 third_party/libxml/src/xmlschemas.c child = child->next; next 8397 third_party/libxml/src/xmlschemas.c lastField->next = field; next 8402 third_party/libxml/src/xmlschemas.c child = child->next; next 8475 third_party/libxml/src/xmlschemas.c child = child->next; next 8525 third_party/libxml/src/xmlschemas.c attr = attr->next; next 8540 third_party/libxml/src/xmlschemas.c attr = attr->next; next 8638 third_party/libxml/src/xmlschemas.c attr = attr->next; next 8751 third_party/libxml/src/xmlschemas.c child = child->next; next 8766 third_party/libxml/src/xmlschemas.c child = child->next; next 8781 third_party/libxml/src/xmlschemas.c lastIDC->next = curIDC; next 8785 third_party/libxml/src/xmlschemas.c child = child->next; next 8869 third_party/libxml/src/xmlschemas.c attr = attr->next; next 8908 third_party/libxml/src/xmlschemas.c link->next = NULL; next 8912 third_party/libxml/src/xmlschemas.c lastLink->next = link; next 8944 third_party/libxml/src/xmlschemas.c child = child->next; next 8961 third_party/libxml/src/xmlschemas.c last->next = subtype; next 8964 third_party/libxml/src/xmlschemas.c last->next = NULL; next 8966 third_party/libxml/src/xmlschemas.c child = child->next; next 9037 third_party/libxml/src/xmlschemas.c attr = attr->next; next 9058 third_party/libxml/src/xmlschemas.c child = child->next; next 9075 third_party/libxml/src/xmlschemas.c child = child->next; next 9204 third_party/libxml/src/xmlschemas.c attr = attr->next; next 9235 third_party/libxml/src/xmlschemas.c attr = attr->next; next 9275 third_party/libxml/src/xmlschemas.c child = child->next; next 9285 third_party/libxml/src/xmlschemas.c child = child->next; next 9288 third_party/libxml/src/xmlschemas.c child = child->next; next 9291 third_party/libxml/src/xmlschemas.c child = child->next; next 9371 third_party/libxml/src/xmlschemas.c attr = attr->next; next 9394 third_party/libxml/src/xmlschemas.c child = child->next; next 9471 third_party/libxml/src/xmlschemas.c attr = attr->next; next 9480 third_party/libxml/src/xmlschemas.c child = child->next; next 9485 third_party/libxml/src/xmlschemas.c child = child->next; next 9489 third_party/libxml/src/xmlschemas.c child = child->next; next 9493 third_party/libxml/src/xmlschemas.c child = child->next; next 9556 third_party/libxml/src/xmlschemas.c if (cur->next != NULL) { next 9557 third_party/libxml/src/xmlschemas.c cur = cur->next; next 9569 third_party/libxml/src/xmlschemas.c if (cur->next != NULL) { next 9570 third_party/libxml/src/xmlschemas.c cur = cur->next; next 9771 third_party/libxml/src/xmlschemas.c child = child->next; next 9780 third_party/libxml/src/xmlschemas.c child = child->next; next 9783 third_party/libxml/src/xmlschemas.c child = child->next; next 9786 third_party/libxml/src/xmlschemas.c child = child->next; next 9789 third_party/libxml/src/xmlschemas.c child = child->next; next 9792 third_party/libxml/src/xmlschemas.c child = child->next; next 9795 third_party/libxml/src/xmlschemas.c child = child->next; next 9798 third_party/libxml/src/xmlschemas.c child = child->next; next 9806 third_party/libxml/src/xmlschemas.c child = child->next; next 9817 third_party/libxml/src/xmlschemas.c child = child->next; next 9859 third_party/libxml/src/xmlschemas.c redef = redef->next; next 10211 third_party/libxml/src/xmlschemas.c while (cur->next != NULL) next 10212 third_party/libxml/src/xmlschemas.c cur = cur->next; next 10213 third_party/libxml/src/xmlschemas.c cur->next = rel; next 10716 third_party/libxml/src/xmlschemas.c attr = attr->next; next 10751 third_party/libxml/src/xmlschemas.c child = child->next; next 10863 third_party/libxml/src/xmlschemas.c attr = attr->next; next 11107 third_party/libxml/src/xmlschemas.c child = child->next; next 11116 third_party/libxml/src/xmlschemas.c child = child->next; next 11245 third_party/libxml/src/xmlschemas.c attr = attr->next; next 11262 third_party/libxml/src/xmlschemas.c attr = attr->next; next 11276 third_party/libxml/src/xmlschemas.c child = child->next; next 11313 third_party/libxml/src/xmlschemas.c last->next = (xmlSchemaTreeItemPtr) part; next 11316 third_party/libxml/src/xmlschemas.c child = child->next; next 11420 third_party/libxml/src/xmlschemas.c last->next = part; next 11423 third_party/libxml/src/xmlschemas.c child = child->next; next 11486 third_party/libxml/src/xmlschemas.c attr = attr->next; next 11554 third_party/libxml/src/xmlschemas.c child = child->next; next 11576 third_party/libxml/src/xmlschemas.c child = child->next; next 11595 third_party/libxml/src/xmlschemas.c child = child->next; next 11600 third_party/libxml/src/xmlschemas.c child = child->next; next 11605 third_party/libxml/src/xmlschemas.c child = child->next; next 11616 third_party/libxml/src/xmlschemas.c child = child->next; next 11634 third_party/libxml/src/xmlschemas.c child = child->next; next 11671 third_party/libxml/src/xmlschemas.c lastfacet->next = facet; next 11673 third_party/libxml/src/xmlschemas.c lastfacet->next = NULL; next 11675 third_party/libxml/src/xmlschemas.c child = child->next; next 11693 third_party/libxml/src/xmlschemas.c facetLink->next = NULL; next 11697 third_party/libxml/src/xmlschemas.c lastFacetLink->next = facetLink; next 11699 third_party/libxml/src/xmlschemas.c facet = facet->next; next 11717 third_party/libxml/src/xmlschemas.c child = child->next; next 11790 third_party/libxml/src/xmlschemas.c attr = attr->next; next 11815 third_party/libxml/src/xmlschemas.c child = child->next; next 11827 third_party/libxml/src/xmlschemas.c child = child->next; next 11832 third_party/libxml/src/xmlschemas.c child = child->next; next 11837 third_party/libxml/src/xmlschemas.c child = child->next; next 11845 third_party/libxml/src/xmlschemas.c child = child->next; next 11862 third_party/libxml/src/xmlschemas.c child = child->next; next 11926 third_party/libxml/src/xmlschemas.c attr = attr->next; next 11941 third_party/libxml/src/xmlschemas.c child = child->next; next 11959 third_party/libxml/src/xmlschemas.c child = child->next; next 11964 third_party/libxml/src/xmlschemas.c child = child->next; next 12017 third_party/libxml/src/xmlschemas.c attr = attr->next; next 12036 third_party/libxml/src/xmlschemas.c child = child->next; next 12054 third_party/libxml/src/xmlschemas.c child = child->next; next 12059 third_party/libxml/src/xmlschemas.c child = child->next; next 12231 third_party/libxml/src/xmlschemas.c attr = attr->next; next 12257 third_party/libxml/src/xmlschemas.c child = child->next; next 12271 third_party/libxml/src/xmlschemas.c child = child->next; next 12279 third_party/libxml/src/xmlschemas.c child = child->next; next 12299 third_party/libxml/src/xmlschemas.c child = child->next; next 12304 third_party/libxml/src/xmlschemas.c child = child->next; next 12309 third_party/libxml/src/xmlschemas.c child = child->next; next 12317 third_party/libxml/src/xmlschemas.c child = child->next; next 12331 third_party/libxml/src/xmlschemas.c child = child->next; next 12770 third_party/libxml/src/xmlschemas.c ns = ns->next; next 12805 third_party/libxml/src/xmlschemas.c ns = ns->next; next 12841 third_party/libxml/src/xmlschemas.c sub = sub->next; next 12863 third_party/libxml/src/xmlschemas.c sub = sub->next; next 12885 third_party/libxml/src/xmlschemas.c sub = sub->next; next 12920 third_party/libxml/src/xmlschemas.c sub = sub->next; next 12939 third_party/libxml/src/xmlschemas.c sub = sub->next; next 12970 third_party/libxml/src/xmlschemas.c sub = sub->next; next 12996 third_party/libxml/src/xmlschemas.c sub = sub->next; next 13075 third_party/libxml/src/xmlschemas.c sub = (xmlSchemaParticlePtr) sub->next; next 13288 third_party/libxml/src/xmlschemas.c type->memberTypes = link->next; next 13290 third_party/libxml/src/xmlschemas.c lastLink->next = link->next; next 13292 third_party/libxml/src/xmlschemas.c link = link->next; next 13297 third_party/libxml/src/xmlschemas.c link = link->next; next 13311 third_party/libxml/src/xmlschemas.c link->next = NULL; next 13315 third_party/libxml/src/xmlschemas.c lastLink->next = link; next 13317 third_party/libxml/src/xmlschemas.c memberType = memberType->next; next 13469 third_party/libxml/src/xmlschemas.c last->next = tmp; next 13471 third_party/libxml/src/xmlschemas.c cur = cur->next; next 13529 third_party/libxml/src/xmlschemas.c curB = curB->next; next 13533 third_party/libxml/src/xmlschemas.c cur = cur->next; next 13576 third_party/libxml/src/xmlschemas.c curB = curB->next; next 13583 third_party/libxml/src/xmlschemas.c tmp->next = completeWild->nsSet; next 13586 third_party/libxml/src/xmlschemas.c cur = cur->next; next 13629 third_party/libxml/src/xmlschemas.c cur = cur->next; next 13723 third_party/libxml/src/xmlschemas.c cur = cur->next; next 13789 third_party/libxml/src/xmlschemas.c curB = curB->next; next 13793 third_party/libxml/src/xmlschemas.c cur = cur->next; next 13833 third_party/libxml/src/xmlschemas.c completeWild->nsSet = cur->next; next 13835 third_party/libxml/src/xmlschemas.c prev->next = cur->next; next 13840 third_party/libxml/src/xmlschemas.c cur = cur->next; next 13848 third_party/libxml/src/xmlschemas.c completeWild->nsSet = cur->next; next 13850 third_party/libxml/src/xmlschemas.c prev->next = cur->next; next 13855 third_party/libxml/src/xmlschemas.c cur = cur->next; next 13878 third_party/libxml/src/xmlschemas.c curB = curB->next; next 13882 third_party/libxml/src/xmlschemas.c completeWild->nsSet = cur->next; next 13884 third_party/libxml/src/xmlschemas.c prev->next = cur->next; next 13885 third_party/libxml/src/xmlschemas.c tmp = cur->next; next 13891 third_party/libxml/src/xmlschemas.c cur = cur->next; next 13971 third_party/libxml/src/xmlschemas.c curB = curB->next; next 13975 third_party/libxml/src/xmlschemas.c cur = cur->next; next 13989 third_party/libxml/src/xmlschemas.c cur = cur->next; next 14053 third_party/libxml/src/xmlschemas.c cur = cur->next; next 14642 third_party/libxml/src/xmlschemas.c part = (xmlSchemaParticlePtr) part->next; next 14659 third_party/libxml/src/xmlschemas.c part = (xmlSchemaParticlePtr) part->next; next 14686 third_party/libxml/src/xmlschemas.c for (; part != NULL; part = (xmlSchemaParticlePtr) part->next) { next 14707 third_party/libxml/src/xmlschemas.c for (; part != NULL; part = (xmlSchemaParticlePtr) part->next) { next 14853 third_party/libxml/src/xmlschemas.c cur = cur->next; next 14968 third_party/libxml/src/xmlschemas.c member = member->next; next 15289 third_party/libxml/src/xmlschemas.c facet = facet->next; next 15343 third_party/libxml/src/xmlschemas.c member = member->next; next 15382 third_party/libxml/src/xmlschemas.c facet = facet->next; next 15490 third_party/libxml/src/xmlschemas.c facet = facet->next; next 15524 third_party/libxml/src/xmlschemas.c member = member->next; next 15547 third_party/libxml/src/xmlschemas.c member = member->next; next 15637 third_party/libxml/src/xmlschemas.c member = member->next; next 15639 third_party/libxml/src/xmlschemas.c baseMember = baseMember->next; next 15660 third_party/libxml/src/xmlschemas.c facet = facet->next; next 17061 third_party/libxml/src/xmlschemas.c part = (xmlSchemaParticlePtr) part->next; next 17234 third_party/libxml/src/xmlschemas.c while (last->next != NULL) next 17235 third_party/libxml/src/xmlschemas.c last = last->next; next 17237 third_party/libxml/src/xmlschemas.c for (cur = type->facetSet; cur != NULL; cur = cur->next) { next 17262 third_party/libxml/src/xmlschemas.c for (cur = base->facetSet; cur != NULL; cur = cur->next) { next 17655 third_party/libxml/src/xmlschemas.c for (cur = base->facetSet; cur != NULL; cur = cur->next) { next 17695 third_party/libxml/src/xmlschemas.c link = link->next; next 17710 third_party/libxml/src/xmlschemas.c link->next = NULL; next 17714 third_party/libxml/src/xmlschemas.c last->next = link; next 17751 third_party/libxml/src/xmlschemas.c if (subLink->next != NULL) { next 17752 third_party/libxml/src/xmlschemas.c lastLink = link->next; next 17753 third_party/libxml/src/xmlschemas.c subLink = subLink->next; next 17764 third_party/libxml/src/xmlschemas.c prevLink->next = newLink; next 17766 third_party/libxml/src/xmlschemas.c newLink->next = lastLink; next 17768 third_party/libxml/src/xmlschemas.c subLink = subLink->next; next 17773 third_party/libxml/src/xmlschemas.c link = link->next; next 17793 third_party/libxml/src/xmlschemas.c for (fac = type->facets; fac != NULL; fac = fac->next) { next 17848 third_party/libxml/src/xmlschemas.c for (lin = type->facetSet; lin != NULL; lin = lin->next) { next 18489 third_party/libxml/src/xmlschemas.c particle->next = effectiveContent; next 18831 third_party/libxml/src/xmlschemas.c facet = facet->next; next 18862 third_party/libxml/src/xmlschemas.c for (; particle != NULL; particle = particle->next) { next 18977 third_party/libxml/src/xmlschemas.c particle = WXS_PTC_CAST particle->next; next 18985 third_party/libxml/src/xmlschemas.c particle = WXS_PTC_CAST particle->next; next 18994 third_party/libxml/src/xmlschemas.c particle = WXS_PTC_CAST particle->next; next 19944 third_party/libxml/src/xmlschemas.c cur = (xmlSchemaParticlePtr) cur->next; next 20064 third_party/libxml/src/xmlschemas.c particle = WXS_PTC_CAST particle->next; next 20486 third_party/libxml/src/xmlschemas.c redef = redef->next; next 20586 third_party/libxml/src/xmlschemas.c redef = redef->next; next 20589 third_party/libxml/src/xmlschemas.c redef = redef->next; next 20607 third_party/libxml/src/xmlschemas.c redef = redef->next; next 20665 third_party/libxml/src/xmlschemas.c redef = redef->next; next 20784 third_party/libxml/src/xmlschemas.c rel = rel->next; next 21966 third_party/libxml/src/xmlschemas.c aidc->next = NULL; next 21970 third_party/libxml/src/xmlschemas.c aidc->next = vctxt->aidcs; next 22172 third_party/libxml/src/xmlschemas.c if (bind->next == NULL) { next 22173 third_party/libxml/src/xmlschemas.c bind->next = xmlSchemaIDCNewBinding(matcher->aidc->def); next 22174 third_party/libxml/src/xmlschemas.c if (bind->next == NULL) next 22176 third_party/libxml/src/xmlschemas.c return(bind->next); next 22178 third_party/libxml/src/xmlschemas.c bind = bind->next; next 22236 third_party/libxml/src/xmlschemas.c bind = bind->next; next 22250 third_party/libxml/src/xmlschemas.c xmlSchemaIDCMatcherPtr next; next 22253 third_party/libxml/src/xmlschemas.c next = matcher->next; next 22280 third_party/libxml/src/xmlschemas.c matcher = next; next 22295 third_party/libxml/src/xmlschemas.c xmlSchemaIDCMatcherPtr next; next 22298 third_party/libxml/src/xmlschemas.c next = matcher->next; next 22329 third_party/libxml/src/xmlschemas.c matcher->next = NULL; next 22337 third_party/libxml/src/xmlschemas.c matcher = next; next 22368 third_party/libxml/src/xmlschemas.c vctxt->xpathStatePool = sto->next; next 22369 third_party/libxml/src/xmlschemas.c sto->next = NULL; next 22386 third_party/libxml/src/xmlschemas.c sto->next = vctxt->xpathStates; next 22528 third_party/libxml/src/xmlschemas.c sel = sel->next; next 22550 third_party/libxml/src/xmlschemas.c if (sto->next == NULL) { next 22557 third_party/libxml/src/xmlschemas.c sto = sto->next; next 22619 third_party/libxml/src/xmlschemas.c sto = sto->next; next 22681 third_party/libxml/src/xmlschemas.c sto = sto->next; next 23112 third_party/libxml/src/xmlschemas.c nextsto = sto->next; next 23116 third_party/libxml/src/xmlschemas.c vctxt->xpathStates = sto->next; next 23117 third_party/libxml/src/xmlschemas.c sto->next = vctxt->xpathStatePool; next 23124 third_party/libxml/src/xmlschemas.c sto = sto->next; next 23188 third_party/libxml/src/xmlschemas.c aidc = aidc->next; next 23208 third_party/libxml/src/xmlschemas.c aidc = aidc->next; next 23238 third_party/libxml/src/xmlschemas.c last->next = matcher; next 23255 third_party/libxml/src/xmlschemas.c idc = idc->next; next 23278 third_party/libxml/src/xmlschemas.c matcher = matcher->next; next 23289 third_party/libxml/src/xmlschemas.c matcher = matcher->next; next 23437 third_party/libxml/src/xmlschemas.c matcher = matcher->next; next 23493 third_party/libxml/src/xmlschemas.c aidc = aidc->next; next 23506 third_party/libxml/src/xmlschemas.c parBind = parBind->next; next 23729 third_party/libxml/src/xmlschemas.c parBind->next = *parTable; next 23736 third_party/libxml/src/xmlschemas.c bind = bind->next; next 23780 third_party/libxml/src/xmlschemas.c bind = bind->next; next 23861 third_party/libxml/src/xmlschemas.c matcher = matcher->next; next 24180 third_party/libxml/src/xmlschemas.c facetLink = facetLink->next) { next 24225 third_party/libxml/src/xmlschemas.c facetLink = facetLink->next) { next 24266 third_party/libxml/src/xmlschemas.c for (facet = tmpType->facets; facet != NULL; facet = facet->next) { next 24315 third_party/libxml/src/xmlschemas.c facetLink = facetLink->next) { next 24723 third_party/libxml/src/xmlschemas.c memberLink = memberLink->next; next 26411 third_party/libxml/src/xmlschemas.c aidc = aidc->next; next 27480 third_party/libxml/src/xmlschemas.c xmlSchemaIDCAugPtr cur = vctxt->aidcs, next; next 27482 third_party/libxml/src/xmlschemas.c next = cur->next; next 27484 third_party/libxml/src/xmlschemas.c cur = next; next 27597 third_party/libxml/src/xmlschemas.c xmlSchemaIDCAugPtr cur = ctxt->aidcs, next; next 27599 third_party/libxml/src/xmlschemas.c next = cur->next; next 27601 third_party/libxml/src/xmlschemas.c cur = next; next 27842 third_party/libxml/src/xmlschemas.c attr = attr->next; next 27928 third_party/libxml/src/xmlschemas.c if (node->next != NULL) next 27929 third_party/libxml/src/xmlschemas.c node = node->next; next 118 third_party/libxml/src/xmlschemastypes.c struct _xmlSchemaVal *next; next 337 third_party/libxml/src/xmlschemastypes.c xmlSchemaTreeItemPtr next; next 346 third_party/libxml/src/xmlschemastypes.c xmlSchemaTreeItemPtr next; next 358 third_party/libxml/src/xmlschemastypes.c xmlSchemaTreeItemPtr next; next 851 third_party/libxml/src/xmlschemastypes.c prev->next = cur; next 869 third_party/libxml/src/xmlschemastypes.c return (cur->next); next 1053 third_party/libxml/src/xmlschemastypes.c value = value->next; next 3651 third_party/libxml/src/xmlschemastypes.c ret->next = NULL; next 3723 third_party/libxml/src/xmlschemastypes.c prev->next = cur; next 3725 third_party/libxml/src/xmlschemastypes.c val = val->next; next 915 third_party/libxml/src/xpath.c cur = cur->next; next 2811 third_party/libxml/src/xpath.c if (cur->next != NULL) { next 2812 third_party/libxml/src/xpath.c cur = cur->next; next 2823 third_party/libxml/src/xpath.c if (cur->next != NULL) { next 2824 third_party/libxml/src/xpath.c cur = cur->next; next 2889 third_party/libxml/src/xpath.c if (node1 == node2->next) next 2953 third_party/libxml/src/xpath.c if (node1 == node2->next) next 2973 third_party/libxml/src/xpath.c for (cur = node1->next;cur != NULL;cur = cur->next) next 3200 third_party/libxml/src/xpath.c if (node1 == node2->next) next 3245 third_party/libxml/src/xpath.c if (node1 == node2->next) next 3264 third_party/libxml/src/xpath.c for (cur = node1->next;cur != NULL;cur = cur->next) next 3345 third_party/libxml/src/xpath.c cur->next = (xmlNsPtr) node; next 3362 third_party/libxml/src/xpath.c if ((ns->next != NULL) && (ns->next->type != XML_NAMESPACE_DECL)) { next 3404 third_party/libxml/src/xpath.c xmlXPathNodeSetDupNs((xmlNodePtr) ns->next, ns); next 3465 third_party/libxml/src/xpath.c if ((ns1->next != NULL) && (ns2->next == ns1->next) && next 3504 third_party/libxml/src/xpath.c (((xmlNsPtr)cur->nodeTab[i])->next == (xmlNsPtr) node) && next 3591 third_party/libxml/src/xpath.c xmlXPathNodeSetDupNs((xmlNodePtr) ns->next, ns); next 3643 third_party/libxml/src/xpath.c xmlXPathNodeSetDupNs((xmlNodePtr) ns->next, ns); next 3713 third_party/libxml/src/xpath.c if ((((xmlNsPtr) n1)->next == ((xmlNsPtr) n2)->next) && next 3754 third_party/libxml/src/xpath.c xmlXPathNodeSetDupNs((xmlNodePtr) ns->next, ns); next 3816 third_party/libxml/src/xpath.c xmlXPathNodeSetDupNs((xmlNodePtr) ns->next, ns); next 3881 third_party/libxml/src/xpath.c if ((((xmlNsPtr) n1)->next == ((xmlNsPtr) n2)->next) && next 3923 third_party/libxml/src/xpath.c xmlXPathNodeSetDupNs((xmlNodePtr) ns->next, ns); next 5321 third_party/libxml/src/xpath.c cur = cur->next; next 6290 third_party/libxml/src/xpath.c if (tmp->next != NULL) { next 6291 third_party/libxml/src/xpath.c tmp = tmp->next; next 6303 third_party/libxml/src/xpath.c if (tmp->next != NULL) { next 6304 third_party/libxml/src/xpath.c tmp = tmp->next; next 7581 third_party/libxml/src/xpath.c return(cur->next); next 7613 third_party/libxml/src/xpath.c cur = cur->next; next 7647 third_party/libxml/src/xpath.c if (cur->next != NULL) { next 7648 third_party/libxml/src/xpath.c if (cur->next->type == XML_ELEMENT_NODE) next 7649 third_party/libxml/src/xpath.c return(cur->next); next 7650 third_party/libxml/src/xpath.c cur = cur->next; next 7652 third_party/libxml/src/xpath.c cur = cur->next; next 7724 third_party/libxml/src/xpath.c if (cur->next != NULL) { next 7725 third_party/libxml/src/xpath.c cur = cur->next; next 7777 third_party/libxml/src/xpath.c while (cur->next != NULL) { next 7778 third_party/libxml/src/xpath.c cur = cur->next; next 7788 third_party/libxml/src/xpath.c if (cur->next != NULL) { next 7789 third_party/libxml/src/xpath.c cur = cur->next; next 7883 third_party/libxml/src/xpath.c if ((ns->next != NULL) && next 7884 third_party/libxml/src/xpath.c (ns->next->type != XML_NAMESPACE_DECL)) next 7885 third_party/libxml/src/xpath.c return((xmlNodePtr) ns->next); next 7956 third_party/libxml/src/xpath.c if ((ns->next != NULL) && next 7957 third_party/libxml/src/xpath.c (ns->next->type != XML_NAMESPACE_DECL)) next 7958 third_party/libxml/src/xpath.c return((xmlNodePtr) ns->next); next 8000 third_party/libxml/src/xpath.c if ((ns->next != NULL) && next 8001 third_party/libxml/src/xpath.c (ns->next->type != XML_NAMESPACE_DECL)) next 8002 third_party/libxml/src/xpath.c return((xmlNodePtr) ns->next); next 8059 third_party/libxml/src/xpath.c return(ctxt->context->node->next); next 8060 third_party/libxml/src/xpath.c return(cur->next); next 8121 third_party/libxml/src/xpath.c if (cur->next != NULL) return(cur->next) ; next 8126 third_party/libxml/src/xpath.c if (cur->next != NULL) return(cur->next); next 8308 third_party/libxml/src/xpath.c return((xmlNodePtr)cur->next); next 8437 third_party/libxml/src/xpath.c tmp = tmp->next; next 11969 third_party/libxml/src/xpath.c xmlXPathTraversalFunction next = NULL; next 12007 third_party/libxml/src/xpath.c next = xmlXPathNextAncestor; next 12011 third_party/libxml/src/xpath.c next = xmlXPathNextAncestorOrSelf; next 12016 third_party/libxml/src/xpath.c next = xmlXPathNextAttribute; next 12034 third_party/libxml/src/xpath.c next = xmlXPathNextChildElement; next 12036 third_party/libxml/src/xpath.c next = xmlXPathNextChild; next 12041 third_party/libxml/src/xpath.c next = xmlXPathNextDescendant; next 12045 third_party/libxml/src/xpath.c next = xmlXPathNextDescendantOrSelf; next 12049 third_party/libxml/src/xpath.c next = xmlXPathNextFollowing; next 12053 third_party/libxml/src/xpath.c next = xmlXPathNextFollowingSibling; next 12058 third_party/libxml/src/xpath.c next = (xmlXPathTraversalFunction) xmlXPathNextNamespace; next 12063 third_party/libxml/src/xpath.c next = xmlXPathNextParent; next 12067 third_party/libxml/src/xpath.c next = xmlXPathNextPrecedingInternal; next 12071 third_party/libxml/src/xpath.c next = xmlXPathNextPrecedingSibling; next 12076 third_party/libxml/src/xpath.c next = xmlXPathNextSelf; next 12086 third_party/libxml/src/xpath.c if (next == NULL) { next 12198 third_party/libxml/src/xpath.c cur = next(ctxt, cur); next 14224 third_party/libxml/src/xpath.c while (cur->next != NULL) { next 14225 third_party/libxml/src/xpath.c cur = cur->next; next 14254 third_party/libxml/src/xpath.c while (cur->next != NULL) { next 14255 third_party/libxml/src/xpath.c cur = cur->next; next 14276 third_party/libxml/src/xpath.c if (cur->next != NULL) { next 14277 third_party/libxml/src/xpath.c cur = cur->next; next 140 third_party/libxml/src/xpointer.c for (i = 0;cur != NULL;cur = cur->next) { next 185 third_party/libxml/src/xpointer.c for (i = 0;i <= no;cur = cur->next) { next 1649 third_party/libxml/src/xpointer.c if (last->next != NULL) next 1650 third_party/libxml/src/xpointer.c last = last->next; next 1666 third_party/libxml/src/xpointer.c while (last->next != NULL) next 1667 third_party/libxml/src/xpointer.c last = last->next; next 1710 third_party/libxml/src/xpointer.c node = node->next; next 2305 third_party/libxml/src/xpointer.c next: next 2315 third_party/libxml/src/xpointer.c if (cur->next != NULL) { next 2316 third_party/libxml/src/xpointer.c cur = cur->next; next 2324 third_party/libxml/src/xpointer.c if (cur->next != NULL) { next 2325 third_party/libxml/src/xpointer.c cur = cur->next; next 2340 third_party/libxml/src/xpointer.c goto next; next 288 third_party/libxslt/libexslt/functions.c struct objChain *next; next 364 third_party/libxslt/libexslt/functions.c savedObj->next = savedObjChain; next 392 third_party/libxslt/libexslt/functions.c savedObjChain = savedObjChain->next; next 396 third_party/libxslt/libexslt/functions.c param->next = params; next 398 third_party/libxslt/libexslt/functions.c paramNode = paramNode->next; next 499 third_party/libxslt/libexslt/functions.c func->content = func->content->next; next 555 third_party/libxslt/libexslt/functions.c for (test = inst->next; test != NULL; test = test->next) { next 519 third_party/libxslt/libexslt/strings.c const xmlChar *curr, *next; next 527 third_party/libxslt/libexslt/strings.c next = xmlStrstr(curr, searchStr); next 528 third_party/libxslt/libexslt/strings.c if (next == NULL) { next 533 third_party/libxslt/libexslt/strings.c ret = xmlStrncat (ret, curr, next - curr); next 535 third_party/libxslt/libexslt/strings.c curr = next + searchStrSize; next 88 third_party/libxslt/libxslt/attributes.c struct _xsltAttrElem *next;/* chained list */ next 142 third_party/libxslt/libxslt/attributes.c xsltAttrElemPtr next; next 145 third_party/libxslt/libxslt/attributes.c next = list->next; next 147 third_party/libxslt/libxslt/attributes.c list = next; next 167 third_party/libxslt/libxslt/attributes.c xsltAttrElemPtr next, cur; next 175 third_party/libxslt/libxslt/attributes.c next = cur->next; next 178 third_party/libxslt/libxslt/attributes.c if (cur->next == NULL) { next 179 third_party/libxslt/libxslt/attributes.c cur->next = xsltNewAttrElem(attr); next 182 third_party/libxslt/libxslt/attributes.c cur = next; next 206 third_party/libxslt/libxslt/attributes.c old = old->next; next 216 third_party/libxslt/libxslt/attributes.c if (cur->next == NULL) next 218 third_party/libxslt/libxslt/attributes.c cur = cur->next; next 226 third_party/libxslt/libxslt/attributes.c if (cur->next == NULL) next 228 third_party/libxslt/libxslt/attributes.c cur = cur->next; next 232 third_party/libxslt/libxslt/attributes.c if (cur->next == NULL) next 234 third_party/libxslt/libxslt/attributes.c cur = cur->next; next 242 third_party/libxslt/libxslt/attributes.c if (cur->next == NULL) next 244 third_party/libxslt/libxslt/attributes.c cur = cur->next; next 260 third_party/libxslt/libxslt/attributes.c cur->next = xsltNewAttrElem(old->attr); next 262 third_party/libxslt/libxslt/attributes.c cur->next->set = xmlDictLookup(style->dict, old->set, -1); next 264 third_party/libxslt/libxslt/attributes.c cur->next->ns = xmlDictLookup(style->dict, old->ns, -1); next 269 third_party/libxslt/libxslt/attributes.c old = old->next; next 367 third_party/libxslt/libxslt/attributes.c nextAttr = curAttr->next; next 378 third_party/libxslt/libxslt/attributes.c if (curAttr->next == NULL) next 379 third_party/libxslt/libxslt/attributes.c curAttr->next = xsltNewAttrElem(child); next 402 third_party/libxslt/libxslt/attributes.c child = child->next; next 535 third_party/libxslt/libxslt/attributes.c tmp = tmp->next; next 928 third_party/libxslt/libxslt/attributes.c } else if ((inst->children->next == NULL) && next 1118 third_party/libxslt/libxslt/attributes.c attrs = attrs->next; next 39 third_party/libxslt/libxslt/attrvt.c struct _xsltAttrVT *next; /* next xsltAttrVT */ next 78 third_party/libxslt/libxslt/attrvt.c cur->next = style->attVTs; next 126 third_party/libxslt/libxslt/attrvt.c xsltAttrVTPtr cur = (xsltAttrVTPtr) avt, next; next 129 third_party/libxslt/libxslt/attrvt.c next = cur->next; next 131 third_party/libxslt/libxslt/attrvt.c cur = next; next 182 third_party/libxslt/libxslt/attrvt.c (attr->children->next != NULL)) { next 157 third_party/libxslt/libxslt/documents.c cur->next = ctxt->docList; next 195 third_party/libxslt/libxslt/documents.c cur->next = style->docList; next 229 third_party/libxslt/libxslt/documents.c cur = cur->next; next 257 third_party/libxslt/libxslt/documents.c cur = cur->next; next 266 third_party/libxslt/libxslt/documents.c cur = cur->next; next 315 third_party/libxslt/libxslt/documents.c ret = ret->next; next 391 third_party/libxslt/libxslt/documents.c ret = ret->next; next 428 third_party/libxslt/libxslt/documents.c ret = ret->next; next 55 third_party/libxslt/libxslt/extensions.c struct _xsltExtDef *next; next 156 third_party/libxslt/libxslt/extensions.c extensiond = extensiond->next; next 523 third_party/libxslt/libxslt/extensions.c def = def->next; next 529 third_party/libxslt/libxslt/extensions.c def = def->next; next 535 third_party/libxslt/libxslt/extensions.c ret->next = (xsltExtDefPtr) style->nsDefs; next 1198 third_party/libxslt/libxslt/extensions.c cur = cur->next; next 1230 third_party/libxslt/libxslt/extensions.c cur = cur->next; next 1542 third_party/libxslt/libxslt/extensions.c comp->next = style->preComps; next 108 third_party/libxslt/libxslt/extra.c cur = cur->next; next 478 third_party/libxslt/libxslt/functions.c if ((((xmlNsPtr) xpctxt->node)->next != NULL) && next 479 third_party/libxslt/libxslt/functions.c (((xmlNsPtr) xpctxt->node)->next->type == XML_ELEMENT_NODE)) next 481 third_party/libxslt/libxslt/functions.c tmpNode = (xmlNodePtr) ((xmlNsPtr) xpctxt->node)->next; next 71 third_party/libxslt/libxslt/imports.c for (res = style->imports; res != NULL; res = res->next) { next 152 third_party/libxslt/libxslt/imports.c res->next = style->imports; next 293 third_party/libxslt/libxslt/imports.c if (cur->next != NULL) next 294 third_party/libxslt/libxslt/imports.c return(cur->next) ; next 298 third_party/libxslt/libxslt/imports.c if (cur->next != NULL) return(cur->next); next 412 third_party/libxslt/libxslt/imports.c cur = cur->next; next 113 third_party/libxslt/libxslt/keys.c keyd = keyd->next; next 179 third_party/libxslt/libxslt/keys.c keyt = keyt->next; next 384 third_party/libxslt/libxslt/keys.c while (prev->next != NULL) next 385 third_party/libxslt/libxslt/keys.c prev = prev->next; next 387 third_party/libxslt/libxslt/keys.c prev->next = key; next 389 third_party/libxslt/libxslt/keys.c key->next = NULL; next 448 third_party/libxslt/libxslt/keys.c table = table->next; next 498 third_party/libxslt/libxslt/keys.c keyd = keyd->next; next 569 third_party/libxslt/libxslt/keys.c table = table->next; next 577 third_party/libxslt/libxslt/keys.c keyd = keyd->next; next 720 third_party/libxslt/libxslt/keys.c table = table->next; next 730 third_party/libxslt/libxslt/keys.c table->next = idoc->keys; next 896 third_party/libxslt/libxslt/keys.c keyDef = keyDef->next; next 78 third_party/libxslt/libxslt/namespaces.c ret->next = cctxt->nsAliases; next 399 third_party/libxslt/libxslt/namespaces.c ns = ns->next; next 459 third_party/libxslt/libxslt/namespaces.c ns = ns->next; next 537 third_party/libxslt/libxslt/namespaces.c attr = attr->next; next 763 third_party/libxslt/libxslt/namespaces.c cur = cur->next; next 768 third_party/libxslt/libxslt/namespaces.c cur = cur->next; next 781 third_party/libxslt/libxslt/namespaces.c p->next = q; next 803 third_party/libxslt/libxslt/namespaces.c p->next = q; next 808 third_party/libxslt/libxslt/namespaces.c cur = cur->next; next 100 third_party/libxslt/libxslt/pattern.c struct _xsltCompMatch *next; /* siblings in the name hash */ next 214 third_party/libxslt/libxslt/pattern.c comp = comp->next; next 938 third_party/libxslt/libxslt/pattern.c sibling = sibling->next; next 986 third_party/libxslt/libxslt/pattern.c siblings = siblings->next; next 1048 third_party/libxslt/libxslt/pattern.c sibling = sibling->next; next 1083 third_party/libxslt/libxslt/pattern.c siblings = siblings->next; next 1214 third_party/libxslt/libxslt/pattern.c comp = comp->next; next 1885 third_party/libxslt/libxslt/pattern.c previous->next = element; next 2031 third_party/libxslt/libxslt/pattern.c xsltCompMatchPtr pat, list, next; next 2049 third_party/libxslt/libxslt/pattern.c next = pat->next; next 2050 third_party/libxslt/libxslt/pattern.c pat->next = NULL; next 2138 third_party/libxslt/libxslt/pattern.c pat->next = list; next 2142 third_party/libxslt/libxslt/pattern.c while (list->next != NULL) { next 2143 third_party/libxslt/libxslt/pattern.c if (list->next->priority <= pat->priority) next 2145 third_party/libxslt/libxslt/pattern.c list = list->next; next 2147 third_party/libxslt/libxslt/pattern.c pat->next = list->next; next 2148 third_party/libxslt/libxslt/pattern.c list->next = pat; next 2156 third_party/libxslt/libxslt/pattern.c pat->next = NULL; next 2158 third_party/libxslt/libxslt/pattern.c pat->next = list; next 2161 third_party/libxslt/libxslt/pattern.c while (list->next != NULL) { next 2162 third_party/libxslt/libxslt/pattern.c if (list->next->priority <= pat->priority) next 2164 third_party/libxslt/libxslt/pattern.c list = list->next; next 2166 third_party/libxslt/libxslt/pattern.c pat->next = list->next; next 2167 third_party/libxslt/libxslt/pattern.c list->next = pat; next 2186 third_party/libxslt/libxslt/pattern.c pat = next; next 2309 third_party/libxslt/libxslt/pattern.c list = list->next; next 2378 third_party/libxslt/libxslt/pattern.c list = list->next; next 2395 third_party/libxslt/libxslt/pattern.c list = list->next; next 2408 third_party/libxslt/libxslt/pattern.c list = list->next; next 2423 third_party/libxslt/libxslt/pattern.c list = list->next; next 367 third_party/libxslt/libxslt/preproc.c cur->next = style->preComps; next 1936 third_party/libxslt/libxslt/preproc.c xsltElemPreCompPtr cur, next; next 1943 third_party/libxslt/libxslt/preproc.c next = cur->next; next 1948 third_party/libxslt/libxslt/preproc.c cur = next; next 490 third_party/libxslt/libxslt/templates.c (attr->children->next != NULL)) next 513 third_party/libxslt/libxslt/templates.c ret = ret->next; next 638 third_party/libxslt/libxslt/templates.c while (last->next != NULL) next 639 third_party/libxslt/libxslt/templates.c last = last->next; next 664 third_party/libxslt/libxslt/templates.c (attr->children->next != NULL)) next 701 third_party/libxslt/libxslt/templates.c last->next = copy; next 775 third_party/libxslt/libxslt/templates.c attr = attr->next; next 799 third_party/libxslt/libxslt/templates.c attr = attr->next; next 378 third_party/libxslt/libxslt/transform.c cur = (xmlDocPtr) cur->next; next 396 third_party/libxslt/libxslt/transform.c cur = cur->next; next 1114 third_party/libxslt/libxslt/transform.c (attr->children->next == NULL)) { next 1128 third_party/libxslt/libxslt/transform.c attr = attr->next; next 1259 third_party/libxslt/libxslt/transform.c list = list->next; next 1304 third_party/libxslt/libxslt/transform.c ns = ns->next; next 1310 third_party/libxslt/libxslt/transform.c ns = ns->next; next 1318 third_party/libxslt/libxslt/transform.c p->next = q; next 1321 third_party/libxslt/libxslt/transform.c ns = ns->next; next 1407 third_party/libxslt/libxslt/transform.c tmpns = tmpns->next; next 1511 third_party/libxslt/libxslt/transform.c copy->next = NULL; next 1701 third_party/libxslt/libxslt/transform.c child = child->next; next 1785 third_party/libxslt/libxslt/transform.c cur = cur->next; next 1827 third_party/libxslt/libxslt/transform.c if (cur->next != NULL) next 1828 third_party/libxslt/libxslt/transform.c cur->next->prev = cur->prev; next 1830 third_party/libxslt/libxslt/transform.c cur->prev->next = cur->next; next 1840 third_party/libxslt/libxslt/transform.c cur = cur->next; next 1962 third_party/libxslt/libxslt/transform.c cur = cur->next; next 2144 third_party/libxslt/libxslt/transform.c cur = (xmlDocPtr) cur->next; next 2147 third_party/libxslt/libxslt/transform.c cur = (xmlDocPtr) cur->next; next 2160 third_party/libxslt/libxslt/transform.c tmp->prev->next = (xmlNodePtr) cur; next 2342 third_party/libxslt/libxslt/transform.c effNs = effNs->next; next 2358 third_party/libxslt/libxslt/transform.c lastns->next =ns; next 2361 third_party/libxslt/libxslt/transform.c effNs = effNs->next; next 2696 third_party/libxslt/libxslt/transform.c child = child->next; next 2828 third_party/libxslt/libxslt/transform.c if (cur->next != NULL) { next 2829 third_party/libxslt/libxslt/transform.c cur = cur->next; next 2850 third_party/libxslt/libxslt/transform.c if (cur->next != NULL) { next 2851 third_party/libxslt/libxslt/transform.c cur = cur->next; next 2985 third_party/libxslt/libxslt/transform.c cur = cur->next; next 2997 third_party/libxslt/libxslt/transform.c list = cur->next; next 3026 third_party/libxslt/libxslt/transform.c tmpParam = tmpParam->next; next 3039 third_party/libxslt/libxslt/transform.c cur = cur->next; next 3066 third_party/libxslt/libxslt/transform.c curdoc = (xmlDocPtr) curdoc->next; next 3071 third_party/libxslt/libxslt/transform.c tmp->prev->next = (xmlNodePtr) curdoc; next 3090 third_party/libxslt/libxslt/transform.c curdoc = (xmlDocPtr) curdoc->next; next 3183 third_party/libxslt/libxslt/transform.c params = params->next; next 3614 third_party/libxslt/libxslt/transform.c tmp = tmp->next; next 3859 third_party/libxslt/libxslt/transform.c text = text->next; next 4636 third_party/libxslt/libxslt/transform.c param->next = withParams; next 4647 third_party/libxslt/libxslt/transform.c cur = cur->next; next 4879 third_party/libxslt/libxslt/transform.c if (cur->next != NULL) next 4880 third_party/libxslt/libxslt/transform.c cur->next->prev = cur->prev; next 4882 third_party/libxslt/libxslt/transform.c cur->prev->next = cur->next; next 4892 third_party/libxslt/libxslt/transform.c cur = cur->next; next 4939 third_party/libxslt/libxslt/transform.c cur = cur->next; next 4947 third_party/libxslt/libxslt/transform.c param->next = withParams; next 4969 third_party/libxslt/libxslt/transform.c cur = cur->next; next 4978 third_party/libxslt/libxslt/transform.c param->next = withParams; next 4994 third_party/libxslt/libxslt/transform.c cur = cur->next; next 5007 third_party/libxslt/libxslt/transform.c cur = cur->next; next 5205 third_party/libxslt/libxslt/transform.c cur = cur->next; next 5589 third_party/libxslt/libxslt/transform.c curInst = curInst->next; next 5605 third_party/libxslt/libxslt/transform.c curInst = curInst->next; next 5740 third_party/libxslt/libxslt/transform.c cur = cur->next; next 5762 third_party/libxslt/libxslt/transform.c } else if (current->next != NULL) { next 5763 third_party/libxslt/libxslt/transform.c current = current->next; next 5771 third_party/libxslt/libxslt/transform.c if (current->next != NULL) { next 5772 third_party/libxslt/libxslt/transform.c current = current->next; next 5817 third_party/libxslt/libxslt/transform.c keyd = keyd->next; next 5871 third_party/libxslt/libxslt/transform.c if (cur->next != NULL) next 5872 third_party/libxslt/libxslt/transform.c cur->next->prev = cur->prev; next 5874 third_party/libxslt/libxslt/transform.c cur->prev->next = cur->next; next 5876 third_party/libxslt/libxslt/transform.c doc->children = cur->next; next 5879 third_party/libxslt/libxslt/transform.c cur->prev = cur->next = NULL; next 6066 third_party/libxslt/libxslt/transform.c while (vptr->next != variables) next 6067 third_party/libxslt/libxslt/transform.c vptr = vptr->next; next 6068 third_party/libxslt/libxslt/transform.c vptr->next = NULL; next 6081 third_party/libxslt/libxslt/transform.c vptr = vptr->next; next 6122 third_party/libxslt/libxslt/transform.c tmp = tmp->next; next 6164 third_party/libxslt/libxslt/transform.c res->children->next = node; next 81 third_party/libxslt/libxslt/variables.c ctxt->cache->RVT = (xmlDocPtr) container->next; next 83 third_party/libxslt/libxslt/variables.c container->next = NULL; next 131 third_party/libxslt/libxslt/variables.c RVT->next = (xmlNodePtr) XSLT_TCTXT_VARIABLE(ctxt)->fragment; next 136 third_party/libxslt/libxslt/variables.c RVT->next = (xmlNodePtr) ctxt->tmpRVT; next 171 third_party/libxslt/libxslt/variables.c RVT->next = (xmlNodePtr) XSLT_TCTXT_VARIABLE(ctxt)->fragment; next 180 third_party/libxslt/libxslt/variables.c RVT->next = (xmlNodePtr) ctxt->localRVT; next 224 third_party/libxslt/libxslt/variables.c cur = (xmlDocPtr) cur->next; next 271 third_party/libxslt/libxslt/variables.c if ((((xmlNsPtr) cur)->next != NULL) && next 272 third_party/libxslt/libxslt/variables.c (((xmlNsPtr) cur)->next->type == XML_ELEMENT_NODE)) next 274 third_party/libxslt/libxslt/variables.c cur = (xmlNodePtr) ((xmlNsPtr) cur)->next; next 357 third_party/libxslt/libxslt/variables.c RVT->next = (xmlNodePtr) ctxt->cache->RVT; next 394 third_party/libxslt/libxslt/variables.c RVT->next = (xmlNodePtr) ctxt->persistRVT; next 412 third_party/libxslt/libxslt/variables.c xmlDocPtr cur, next; next 421 third_party/libxslt/libxslt/variables.c next = (xmlDocPtr) cur->next; next 427 third_party/libxslt/libxslt/variables.c cur = next; next 435 third_party/libxslt/libxslt/variables.c next = (xmlDocPtr) cur->next; next 441 third_party/libxslt/libxslt/variables.c cur = next; next 449 third_party/libxslt/libxslt/variables.c next = (xmlDocPtr) cur->next; next 455 third_party/libxslt/libxslt/variables.c cur = next; next 482 third_party/libxslt/libxslt/variables.c ctxt->cache->stackItems = ret->next; next 483 third_party/libxslt/libxslt/variables.c ret->next = NULL; next 549 third_party/libxslt/libxslt/variables.c elem->fragment = (xmlDocPtr) cur->next; next 585 third_party/libxslt/libxslt/variables.c elem->next = ctxt->cache->stackItems; next 604 third_party/libxslt/libxslt/variables.c xsltStackElemPtr next; next 607 third_party/libxslt/libxslt/variables.c next = elem->next; next 609 third_party/libxslt/libxslt/variables.c elem = next; next 650 third_party/libxslt/libxslt/variables.c cur = cur->next; next 671 third_party/libxslt/libxslt/variables.c cur = cur->next; next 756 third_party/libxslt/libxslt/variables.c elem = elem->next; next 1283 third_party/libxslt/libxslt/variables.c elem = elem->next; next 1346 third_party/libxslt/libxslt/variables.c elem->next = NULL; next 1360 third_party/libxslt/libxslt/variables.c if (tmp->next == NULL) next 1362 third_party/libxslt/libxslt/variables.c tmp = tmp->next; next 1364 third_party/libxslt/libxslt/variables.c elem->next = NULL; next 1365 third_party/libxslt/libxslt/variables.c tmp->next = elem; next 1479 third_party/libxslt/libxslt/variables.c elem = elem->next; next 2234 third_party/libxslt/libxslt/variables.c cur = cur->next; next 282 third_party/libxslt/libxslt/xslt.c self->next = NULL; next 341 third_party/libxslt/libxslt/xslt.c tmp = iter->next; next 365 third_party/libxslt/libxslt/xslt.c for (result = style->decimalFormat->next; next 367 third_party/libxslt/libxslt/xslt.c result = result->next) { next 436 third_party/libxslt/libxslt/xslt.c template = template->next; next 450 third_party/libxslt/libxslt/xslt.c item = item->next; next 464 third_party/libxslt/libxslt/xslt.c item = item->next; next 496 third_party/libxslt/libxslt/xslt.c ret->next = cctxt->psData->nsMap; next 516 third_party/libxslt/libxslt/xslt.c ivar = ivar->next; next 546 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 845 third_party/libxslt/libxslt/xslt.c xsltStylesheetPtr next; next 848 third_party/libxslt/libxslt/xslt.c next = style->next; next 850 third_party/libxslt/libxslt/xslt.c style = next; next 901 third_party/libxslt/libxslt/xslt.c if (cur->next != NULL) next 902 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 1122 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 1394 third_party/libxslt/libxslt/xslt.c for (iter = style->decimalFormat; iter->next; iter = iter->next) next 1397 third_party/libxslt/libxslt/xslt.c iter->next = format; next 1818 third_party/libxslt/libxslt/xslt.c if (ns->next != NULL) { next 1820 third_party/libxslt/libxslt/xslt.c ns = ns->next; next 1834 third_party/libxslt/libxslt/xslt.c if (ns->next == NULL) next 1836 third_party/libxslt/libxslt/xslt.c ns = ns->next; next 1840 third_party/libxslt/libxslt/xslt.c ns->next = xmlNewNs(NULL, nsName, prefix); next 1841 third_party/libxslt/libxslt/xslt.c return (ns->next); next 1939 third_party/libxslt/libxslt/xslt.c alias = alias->next; next 1949 third_party/libxslt/libxslt/xslt.c attr = attr->next; next 1999 third_party/libxslt/libxslt/xslt.c alias = alias->next; next 2002 third_party/libxslt/libxslt/xslt.c attr = attr->next; next 2095 third_party/libxslt/libxslt/xslt.c alias = alias->next; next 2111 third_party/libxslt/libxslt/xslt.c alias = alias->next; next 2144 third_party/libxslt/libxslt/xslt.c tmpns = tmpns->next; next 2169 third_party/libxslt/libxslt/xslt.c effNs->next = NULL; next 2177 third_party/libxslt/libxslt/xslt.c lastEffNs->next = effNs; next 2218 third_party/libxslt/libxslt/xslt.c item->next = cctxt->style->preComps; next 2251 third_party/libxslt/libxslt/xslt.c if ((cctxt->ivar != NULL) && (cctxt->ivar->next != NULL)) { next 2252 third_party/libxslt/libxslt/xslt.c ivar = cctxt->ivar->next; next 2268 third_party/libxslt/libxslt/xslt.c cctxt->ivar->next = ivar; next 2272 third_party/libxslt/libxslt/xslt.c ivar->next = NULL; next 2314 third_party/libxslt/libxslt/xslt.c if ((cctxt->inode != NULL) && (cctxt->inode->next != NULL)) { next 2315 third_party/libxslt/libxslt/xslt.c inode = cctxt->inode->next; next 2333 third_party/libxslt/libxslt/xslt.c cctxt->inodeLast->next = inode; next 2562 third_party/libxslt/libxslt/xslt.c ns = ns->next; next 3251 third_party/libxslt/libxslt/xslt.c attr = attr->next; next 3296 third_party/libxslt/libxslt/xslt.c if ((cur->next == NULL) || next 3297 third_party/libxslt/libxslt/xslt.c (cur->next->type == XML_ELEMENT_NODE)) next 3316 third_party/libxslt/libxslt/xslt.c if ((cur->next == NULL) || next 3317 third_party/libxslt/libxslt/xslt.c (cur->next->type == XML_ELEMENT_NODE)) next 3390 third_party/libxslt/libxslt/xslt.c if (cur->next != NULL) { next 3391 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 3483 third_party/libxslt/libxslt/xslt.c attr = attr->next; next 3499 third_party/libxslt/libxslt/xslt.c xmlNsPtr ns = cur->nsDef, prev = NULL, next; next 3507 third_party/libxslt/libxslt/xslt.c next = ns->next; next 3518 third_party/libxslt/libxslt/xslt.c cur->nsDef = ns->next; next 3520 third_party/libxslt/libxslt/xslt.c prev->next = ns->next; next 3522 third_party/libxslt/libxslt/xslt.c ns->next = root->nsDef; next 3530 third_party/libxslt/libxslt/xslt.c ns = next; next 3588 third_party/libxslt/libxslt/xslt.c if (cur->next != NULL) { next 3589 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 3601 third_party/libxslt/libxslt/xslt.c if (cur->next != NULL) { next 3602 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 3675 third_party/libxslt/libxslt/xslt.c ns = ns->next; next 3688 third_party/libxslt/libxslt/xslt.c if (cur->next != NULL) { next 3689 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 3701 third_party/libxslt/libxslt/xslt.c if (cur->next != NULL) { next 3702 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 4030 third_party/libxslt/libxslt/xslt.c child = child->next; next 4054 third_party/libxslt/libxslt/xslt.c child = child->next; next 4070 third_party/libxslt/libxslt/xslt.c child = child->next; next 4091 third_party/libxslt/libxslt/xslt.c child = child->next; next 4148 third_party/libxslt/libxslt/xslt.c child = child->next; next 4186 third_party/libxslt/libxslt/xslt.c child = child->next; next 4207 third_party/libxslt/libxslt/xslt.c if ((elem->next != NULL) && next 4258 third_party/libxslt/libxslt/xslt.c item->next = cctxt->style->preComps; next 4343 third_party/libxslt/libxslt/xslt.c child = child->next; next 4442 third_party/libxslt/libxslt/xslt.c (tmp->next == NULL)) next 4499 third_party/libxslt/libxslt/xslt.c attr = attr->next; next 4541 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 4611 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 4715 third_party/libxslt/libxslt/xslt.c attr = attr->next; next 4737 third_party/libxslt/libxslt/xslt.c attr = attr->next; next 4754 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 4809 third_party/libxslt/libxslt/xslt.c child = child->next; next 4860 third_party/libxslt/libxslt/xslt.c xmlNodePtr text = cur->children, next; next 4885 third_party/libxslt/libxslt/xslt.c text = text->next; next 4897 third_party/libxslt/libxslt/xslt.c text = text->next; next 4925 third_party/libxslt/libxslt/xslt.c next = text->next; next 4928 third_party/libxslt/libxslt/xslt.c text = next; next 4959 third_party/libxslt/libxslt/xslt.c attr = attr->next; next 4973 third_party/libxslt/libxslt/xslt.c if (cur->next != NULL) { next 4974 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 4986 third_party/libxslt/libxslt/xslt.c if (cur->next != NULL) { next 4987 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 5009 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 5022 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 5156 third_party/libxslt/libxslt/xslt.c templ->next = cctxt->style->templates; next 5241 third_party/libxslt/libxslt/xslt.c curTempl = templ->next; next 5253 third_party/libxslt/libxslt/xslt.c curTempl = curTempl->next; next 5311 third_party/libxslt/libxslt/xslt.c ret->next = style->templates; next 5391 third_party/libxslt/libxslt/xslt.c cur = ret->next; next 5402 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 5451 third_party/libxslt/libxslt/xslt.c item->next = cctxt->style->preComps; next 5486 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 5577 third_party/libxslt/libxslt/xslt.c child = child->next; next 5746 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 5755 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 5768 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 5779 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 5794 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 5808 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 5904 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 5979 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 5993 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 6006 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 6067 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 6075 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 6083 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 6092 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 6100 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 6116 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 6169 third_party/libxslt/libxslt/xslt.c cur = cur->next; next 6225 third_party/libxslt/libxslt/xslt.c templ->next = cctxt->style->templates; next 6280 third_party/libxslt/libxslt/xslt.c ns = ns->next; next 6449 third_party/libxslt/libxslt/xslt.c template->next = ret->templates; next 6878 third_party/libxslt/libxslt/xslt.c child = child->next; next 6956 third_party/libxslt/libxslt/xslt.c for (ns = subtree->ns; ns; ns = ns->next) { next 275 third_party/libxslt/libxslt/xsltInternals.h struct _xsltTemplate *next;/* chained list sorted by priority */ next 307 third_party/libxslt/libxslt/xsltInternals.h struct _xsltDecimalFormat *next; /* chained list */ next 332 third_party/libxslt/libxslt/xsltInternals.h struct _xsltDocument *next; /* documents are kept in a chained list */ next 349 third_party/libxslt/libxslt/xsltInternals.h struct _xsltKeyDef *next; next 370 third_party/libxslt/libxslt/xsltInternals.h struct _xsltKeyTable *next; next 474 third_party/libxslt/libxslt/xsltInternals.h xsltElemPreCompPtr next; /* next item in the global chained next 537 third_party/libxslt/libxslt/xsltInternals.h xsltElemPreCompPtr next;\ next 586 third_party/libxslt/libxslt/xsltInternals.h xsltElemPreCompPtr next; /* next item in the global chained next 1160 third_party/libxslt/libxslt/xsltInternals.h xsltEffectiveNsPtr next; /* next item in the list */ next 1199 third_party/libxslt/libxslt/xsltInternals.h xsltNsAliasPtr next; /* next in the list */ next 1211 third_party/libxslt/libxslt/xsltInternals.h xsltNsMapPtr next; /* next in the list */ next 1232 third_party/libxslt/libxslt/xsltInternals.h xsltNsListPtr next; /* next in the list */ next 1244 third_party/libxslt/libxslt/xsltInternals.h xsltVarInfoPtr next; /* next in the list */ next 1259 third_party/libxslt/libxslt/xsltInternals.h xsltCompilerNodeInfoPtr next; next 1365 third_party/libxslt/libxslt/xsltInternals.h xsltElemPreCompPtr next; /* chained list */ next 1426 third_party/libxslt/libxslt/xsltInternals.h struct _xsltStackElem *next;/* chained list */ next 1486 third_party/libxslt/libxslt/xsltInternals.h struct _xsltStylesheet *next; next 118 third_party/libxslt/libxslt/xsltutils.c prop = prop->next; next 204 third_party/libxslt/libxslt/xsltutils.c prop = prop->next; next 1450 third_party/libxslt/libxslt/xsltutils.c (result->children->next == NULL))) next 1511 third_party/libxslt/libxslt/xsltutils.c if (cur->next != NULL) { next 1512 third_party/libxslt/libxslt/xsltutils.c cur = cur->next; next 1524 third_party/libxslt/libxslt/xsltutils.c if (cur->next != NULL) { next 1525 third_party/libxslt/libxslt/xsltutils.c cur = cur->next; next 1576 third_party/libxslt/libxslt/xsltutils.c (child->next != NULL))) next 1578 third_party/libxslt/libxslt/xsltutils.c child = child->next; next 1912 third_party/libxslt/libxslt/xsltutils.c template = template->next; next 2035 third_party/libxslt/libxslt/xsltutils.c templ = templ->next; next 234 third_party/npapi/bindings/npapi.h struct _NPByteRange* next; next 46 third_party/npapi/npspy/common/epmanager.cpp next(NULL), next 56 third_party/npapi/npspy/common/epmanager.cpp next(NULL), next 80 third_party/npapi/npspy/common/epmanager.cpp InstanceList * next = instances->next; next 82 third_party/npapi/npspy/common/epmanager.cpp instances = next; next 85 third_party/npapi/npspy/common/epmanager.cpp PluginEntryPointList * next = eps->next; next 87 third_party/npapi/npspy/common/epmanager.cpp eps = next; next 123 third_party/npapi/npspy/common/epmanager.cpp eps->next = mEntryPoints; next 133 third_party/npapi/npspy/common/epmanager.cpp for(PluginEntryPointList * eps = mEntryPoints; eps != NULL; eps = eps->next) next 138 third_party/npapi/npspy/common/epmanager.cpp prev->next = eps->next; next 140 third_party/npapi/npspy/common/epmanager.cpp mEntryPoints = eps->next; next 153 third_party/npapi/npspy/common/epmanager.cpp for(PluginEntryPointList * eps = mEntryPoints; eps != NULL; eps = eps->next) next 164 third_party/npapi/npspy/common/epmanager.cpp for(PluginEntryPointList * eps = mEntryPoints; eps != NULL; eps = eps->next) next 166 third_party/npapi/npspy/common/epmanager.cpp for(InstanceList * instances = eps->instances; instances != NULL; instances = instances->next) next 178 third_party/npapi/npspy/common/epmanager.cpp for(PluginEntryPointList * eps = mEntryPoints; eps != NULL; eps = eps->next) next 191 third_party/npapi/npspy/common/epmanager.cpp for(PluginEntryPointList * eps = mEntryPoints; eps != NULL; eps = eps->next) next 193 third_party/npapi/npspy/common/epmanager.cpp for(InstanceList * instances = eps->instances; instances != NULL; instances = instances->next) next 212 third_party/npapi/npspy/common/epmanager.cpp for(PluginEntryPointList * eps = mEntryPoints; eps != NULL; eps = eps->next) next 221 third_party/npapi/npspy/common/epmanager.cpp inst->next = eps->instances; next 242 third_party/npapi/npspy/common/epmanager.cpp for(PluginEntryPointList * eps = mEntryPoints; eps != NULL; eps = eps->next) next 245 third_party/npapi/npspy/common/epmanager.cpp for(InstanceList * instances = eps->instances; instances != NULL; instances = instances->next) next 253 third_party/npapi/npspy/common/epmanager.cpp if(eps->instances->next == NULL) next 260 third_party/npapi/npspy/common/epmanager.cpp prev->next = instances->next; next 262 third_party/npapi/npspy/common/epmanager.cpp eps->instances = instances->next; next 134 third_party/npapi/npspy/extern/nspr/md/_os2.h struct PRThread *prev, *next; /* used by the cvar wait queue to next 112 third_party/npapi/npspy/extern/nspr/md/_win95.h struct PRThread *prev, *next; /* used by the cvar wait queue to next 56 third_party/npapi/npspy/extern/nspr/plarena.h PLArena *next; /* next arena for this lifetime */ next 66 third_party/npapi/npspy/extern/nspr/plarena.h PLArenaStats *next; /* next in arenaStats list */ next 177 third_party/npapi/npspy/extern/nspr/plarena.h *(pnext) = (a)->next; \ next 78 third_party/npapi/npspy/extern/nspr/plhash.h PLHashEntry *next; /* hash chain linkage */ next 46 third_party/npapi/npspy/extern/nspr/prclist.h PRCList *next; next 55 third_party/npapi/npspy/extern/nspr/prclist.h (_e)->next = (_l); \ next 57 third_party/npapi/npspy/extern/nspr/prclist.h (_l)->prev->next = (_e); \ next 66 third_party/npapi/npspy/extern/nspr/prclist.h (_e)->next = (_l)->next; \ next 68 third_party/npapi/npspy/extern/nspr/prclist.h (_l)->next->prev = (_e); \ next 69 third_party/npapi/npspy/extern/nspr/prclist.h (_l)->next = (_e); \ next 76 third_party/npapi/npspy/extern/nspr/prclist.h ((_e)->next) next 94 third_party/npapi/npspy/extern/nspr/prclist.h #define PR_LIST_HEAD(_l) (_l)->next next 102 third_party/npapi/npspy/extern/nspr/prclist.h (_e)->prev->next = (_e)->next; \ next 103 third_party/npapi/npspy/extern/nspr/prclist.h (_e)->next->prev = (_e)->prev; \ next 112 third_party/npapi/npspy/extern/nspr/prclist.h (_e)->prev->next = (_e)->next; \ next 113 third_party/npapi/npspy/extern/nspr/prclist.h (_e)->next->prev = (_e)->prev; \ next 114 third_party/npapi/npspy/extern/nspr/prclist.h (_e)->next = (_e); \ next 123 third_party/npapi/npspy/extern/nspr/prclist.h ((_l)->next == (_l)) next 130 third_party/npapi/npspy/extern/nspr/prclist.h (_l)->next = (_l); \ next 497 third_party/npapi/npspy/extern/nspr/prcountr.h #define PR_FIND_NEXT_COUNTER_QNAME(next,handle)\ next 498 third_party/npapi/npspy/extern/nspr/prcountr.h (next) = PR_FindNextCounterQname((handle)) next 500 third_party/npapi/npspy/extern/nspr/prcountr.h #define PR_FIND_NEXT_COUNTER_QNAME(next,handle) NULL next 540 third_party/npapi/npspy/extern/nspr/prcountr.h #define PR_FIND_NEXT_COUNTER_RNAME(next,rhandle,qhandle)\ next 541 third_party/npapi/npspy/extern/nspr/prcountr.h (next) = PR_FindNextCounterRname((rhandle),(qhandle)) next 543 third_party/npapi/npspy/extern/nspr/prcountr.h #define PR_FIND_NEXT_COUNTER_RNAME(next,rhandle,qhandle) next 156 third_party/npapi/npspy/extern/nspr/prlog.h struct PRLogModuleInfo *next; next 509 third_party/npapi/npspy/extern/nspr/prtrace.h #define PR_FIND_NEXT_TRACE_QNAME(next,handle)\ next 510 third_party/npapi/npspy/extern/nspr/prtrace.h (next) = PR_FindNextTraceQname((handle)) next 512 third_party/npapi/npspy/extern/nspr/prtrace.h #define PR_FIND_NEXT_TRACE_QNAME(next,handle) next 551 third_party/npapi/npspy/extern/nspr/prtrace.h #define PR_FIND_NEXT_TRACE_RNAME(next,rhandle,qhandle)\ next 552 third_party/npapi/npspy/extern/nspr/prtrace.h (next) = PR_FindNextTraceRname((rhandle),(qhandle)) next 554 third_party/npapi/npspy/extern/nspr/prtrace.h #define PR_FIND_NEXT_TRACE_RNAME(next,rhandle,qhandle) next 275 third_party/npapi/npspy/extern/plugin/npapi.h struct _NPByteRange* next; next 50 third_party/npapi/npspy/include/epmanager.h InstanceList * next; next 59 third_party/npapi/npspy/include/epmanager.h PluginEntryPointList * next; next 431 third_party/protobuf/java/src/main/java/com/google/protobuf/ByteString.java result = iterator.next(); next 686 third_party/protobuf/java/src/main/java/com/google/protobuf/GeneratedMessage.java private Map.Entry<FieldDescriptor, Object> next; next 691 third_party/protobuf/java/src/main/java/com/google/protobuf/GeneratedMessage.java next = iter.next(); next 698 third_party/protobuf/java/src/main/java/com/google/protobuf/GeneratedMessage.java while (next != null && next.getKey().getNumber() < end) { next 699 third_party/protobuf/java/src/main/java/com/google/protobuf/GeneratedMessage.java FieldDescriptor descriptor = next.getKey(); next 703 third_party/protobuf/java/src/main/java/com/google/protobuf/GeneratedMessage.java if (next instanceof LazyField.LazyEntry<?>) { next 705 third_party/protobuf/java/src/main/java/com/google/protobuf/GeneratedMessage.java ((LazyField.LazyEntry<?>) next).getField().toByteString()); next 708 third_party/protobuf/java/src/main/java/com/google/protobuf/GeneratedMessage.java (Message) next.getValue()); next 718 third_party/protobuf/java/src/main/java/com/google/protobuf/GeneratedMessage.java FieldSet.writeField(descriptor, next.getValue(), output); next 721 third_party/protobuf/java/src/main/java/com/google/protobuf/GeneratedMessage.java next = iter.next(); next 723 third_party/protobuf/java/src/main/java/com/google/protobuf/GeneratedMessage.java next = null; next 256 third_party/protobuf/java/src/main/java/com/google/protobuf/GeneratedMessageLite.java private Map.Entry<ExtensionDescriptor, Object> next; next 261 third_party/protobuf/java/src/main/java/com/google/protobuf/GeneratedMessageLite.java next = iter.next(); next 268 third_party/protobuf/java/src/main/java/com/google/protobuf/GeneratedMessageLite.java while (next != null && next.getKey().getNumber() < end) { next 269 third_party/protobuf/java/src/main/java/com/google/protobuf/GeneratedMessageLite.java ExtensionDescriptor extension = next.getKey(); next 274 third_party/protobuf/java/src/main/java/com/google/protobuf/GeneratedMessageLite.java (MessageLite) next.getValue()); next 276 third_party/protobuf/java/src/main/java/com/google/protobuf/GeneratedMessageLite.java FieldSet.writeField(extension, next.getValue(), output); next 279 third_party/protobuf/java/src/main/java/com/google/protobuf/GeneratedMessageLite.java next = iter.next(); next 281 third_party/protobuf/java/src/main/java/com/google/protobuf/GeneratedMessageLite.java next = null; next 199 third_party/protobuf/java/src/main/java/com/google/protobuf/LazyField.java Entry<K, ?> entry = iterator.next(); next 392 third_party/protobuf/java/src/main/java/com/google/protobuf/RopeByteString.java LiteralByteString byteString = pieces.next(); next 481 third_party/protobuf/java/src/main/java/com/google/protobuf/RopeByteString.java LiteralByteString thisString = thisIter.next(); next 485 third_party/protobuf/java/src/main/java/com/google/protobuf/RopeByteString.java LiteralByteString thatString = thatIter.next(); next 511 third_party/protobuf/java/src/main/java/com/google/protobuf/RopeByteString.java thisString = thisIter.next(); next 517 third_party/protobuf/java/src/main/java/com/google/protobuf/RopeByteString.java thatString = thatIter.next(); next 706 third_party/protobuf/java/src/main/java/com/google/protobuf/RopeByteString.java private LiteralByteString next; next 709 third_party/protobuf/java/src/main/java/com/google/protobuf/RopeByteString.java next = getLeafByLeft(root); next 738 third_party/protobuf/java/src/main/java/com/google/protobuf/RopeByteString.java return next != null; next 747 third_party/protobuf/java/src/main/java/com/google/protobuf/RopeByteString.java if (next == null) { next 750 third_party/protobuf/java/src/main/java/com/google/protobuf/RopeByteString.java LiteralByteString result = next; next 751 third_party/protobuf/java/src/main/java/com/google/protobuf/RopeByteString.java next = getNextNonEmptyLeaf(); next 776 third_party/protobuf/java/src/main/java/com/google/protobuf/RopeByteString.java bytes = pieces.next().iterator(); next 790 third_party/protobuf/java/src/main/java/com/google/protobuf/RopeByteString.java bytes = pieces.next().iterator(); next 916 third_party/protobuf/java/src/main/java/com/google/protobuf/RopeByteString.java currentPiece = pieceIterator.next(); next 934 third_party/protobuf/java/src/main/java/com/google/protobuf/RopeByteString.java currentPiece = pieceIterator.next(); next 303 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java entryList.add(new Entry(iterator.next())); next 552 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java return getOverflowIterator().next(); next 597 third_party/protobuf/java/src/main/java/com/google/protobuf/SmallSortedMap.java public Object next() { next 85 third_party/protobuf/java/src/main/java/com/google/protobuf/UnmodifiableLazyStringList.java public String next() { next 86 third_party/protobuf/java/src/main/java/com/google/protobuf/UnmodifiableLazyStringList.java return iter.next(); next 137 third_party/protobuf/java/src/main/java/com/google/protobuf/UnmodifiableLazyStringList.java public String next() { next 138 third_party/protobuf/java/src/main/java/com/google/protobuf/UnmodifiableLazyStringList.java return iter.next(); next 597 third_party/protobuf/java/src/test/java/com/google/protobuf/ByteStringTest.java ByteString concatenatedString = iter.next(); next 599 third_party/protobuf/java/src/test/java/com/google/protobuf/ByteStringTest.java concatenatedString = concatenatedString.concat(iter.next()); next 49 third_party/protobuf/java/src/test/java/com/google/protobuf/RopeByteStringSubstringTest.java ByteString sourceString = iter.next(); next 51 third_party/protobuf/java/src/test/java/com/google/protobuf/RopeByteStringSubstringTest.java sourceString = sourceString.concat(iter.next()); next 53 third_party/protobuf/java/src/test/java/com/google/protobuf/RopeByteStringTest.java stringUnderTest = iter.next(); next 55 third_party/protobuf/java/src/test/java/com/google/protobuf/RopeByteStringTest.java stringUnderTest = stringUnderTest.concat(iter.next()); next 224 third_party/protobuf/java/src/test/java/com/google/protobuf/SmallSortedMapTest.java Map.Entry<Integer, Integer> entry = it.next(); next 300 third_party/protobuf/java/src/test/java/com/google/protobuf/SmallSortedMapTest.java Map.Entry<Integer, Integer> entry = it.next(); next 315 third_party/protobuf/java/src/test/java/com/google/protobuf/SmallSortedMapTest.java it.next(); next 329 third_party/protobuf/java/src/test/java/com/google/protobuf/SmallSortedMapTest.java Map.Entry<Integer, Integer> entry = it.next(); next 381 third_party/protobuf/java/src/test/java/com/google/protobuf/SmallSortedMapTest.java Map.Entry<Integer, Integer> entry = it.next(); next 403 third_party/protobuf/java/src/test/java/com/google/protobuf/SmallSortedMapTest.java Integer key = keys.next(); next 100 third_party/protobuf/java/src/test/java/com/google/protobuf/UnmodifiableLazyStringListTest.java iter.next(); next 120 third_party/protobuf/java/src/test/java/com/google/protobuf/UnmodifiableLazyStringListTest.java iter.next(); next 1155 third_party/protobuf/python/google/protobuf/pyext/python-proto2.cc PyObject* next; next 1156 third_party/protobuf/python/google/protobuf/pyext/python-proto2.cc while ((next = PyIter_Next(iter)) != NULL) { next 1158 third_party/protobuf/python/google/protobuf/pyext/python-proto2.cc message, cfield_descriptor->descriptor, next) == NULL) { next 1159 third_party/protobuf/python/google/protobuf/pyext/python-proto2.cc Py_DECREF(next); next 1163 third_party/protobuf/python/google/protobuf/pyext/python-proto2.cc Py_DECREF(next); next 89 third_party/re2/re2/compile.cc PatchList next = PatchList::Deref(inst0, l); next 90 third_party/re2/re2/compile.cc if (next.p == 0) next 92 third_party/re2/re2/compile.cc l = next; next 200 third_party/re2/re2/compile.cc int RuneByteSuffix(uint8 lo, uint8 hi, bool foldcase, int next); next 201 third_party/re2/re2/compile.cc int UncachedRuneByteSuffix(uint8 lo, uint8 hi, bool foldcase, int next); next 486 third_party/re2/re2/compile.cc int next) { next 488 third_party/re2/re2/compile.cc if (next != 0) { next 489 third_party/re2/re2/compile.cc PatchList::Patch(inst_, f.end, next); next 496 third_party/re2/re2/compile.cc int Compiler::RuneByteSuffix(uint8 lo, uint8 hi, bool foldcase, int next) { next 503 third_party/re2/re2/compile.cc return UncachedRuneByteSuffix(lo, hi, foldcase, next); next 506 third_party/re2/re2/compile.cc uint64 key = ((uint64)next << 17) | (lo<<9) | (hi<<1) | (foldcase ? 1ULL : 0ULL); next 510 third_party/re2/re2/compile.cc int id = UncachedRuneByteSuffix(lo, hi, foldcase, next); next 569 third_party/re2/re2/compile.cc int next; next 596 third_party/re2/re2/compile.cc int next = 0; next 597 third_party/re2/re2/compile.cc if (p.next >= 0) next 598 third_party/re2/re2/compile.cc next = inst[p.next]; next 599 third_party/re2/re2/compile.cc inst[i] = UncachedRuneByteSuffix(p.lo, p.hi, false, next); next 60 third_party/re2/re2/nfa.cc Thread* next; // when on free list next 149 third_party/re2/re2/nfa.cc Thread* next; next 150 third_party/re2/re2/nfa.cc for (Thread* t = free_threads_; t; t = next) { next 151 third_party/re2/re2/nfa.cc next = t->next; next 160 third_party/re2/re2/nfa.cc t->next = free_threads_; next 171 third_party/re2/re2/nfa.cc free_threads_ = t->next; next 179 third_party/re2/re2/parse.cc Regexp* next; next 180 third_party/re2/re2/parse.cc for (Regexp* re = stacktop_; re != NULL; re = next) { next 181 third_party/re2/re2/parse.cc next = re->down_; next 1000 third_party/re2/re2/parse.cc Regexp* next = NULL; next 1002 third_party/re2/re2/parse.cc for (sub = stacktop_; sub != NULL && !IsMarker(sub->op()); sub = next) { next 1003 third_party/re2/re2/parse.cc next = sub->down_; next 1012 third_party/re2/re2/parse.cc if (stacktop_ != NULL && stacktop_->down_ == next) next 1017 third_party/re2/re2/parse.cc next = NULL; next 1019 third_party/re2/re2/parse.cc for (sub = stacktop_; sub != NULL && !IsMarker(sub->op()); sub = next) { next 1020 third_party/re2/re2/parse.cc next = sub->down_; next 1034 third_party/re2/re2/parse.cc re->down_ = next; next 1467 third_party/re2/re2/parse.cc int next = 0; next 1469 third_party/re2/re2/parse.cc if (next < g->r16[i].lo) next 1470 third_party/re2/re2/parse.cc cc->AddRangeFlags(next, g->r16[i].lo - 1, parse_flags); next 1471 third_party/re2/re2/parse.cc next = g->r16[i].hi + 1; next 1474 third_party/re2/re2/parse.cc if (next < g->r32[i].lo) next 1475 third_party/re2/re2/parse.cc cc->AddRangeFlags(next, g->r32[i].lo - 1, parse_flags); next 1476 third_party/re2/re2/parse.cc next = g->r32[i].hi + 1; next 1478 third_party/re2/re2/parse.cc if (next <= Runemax) next 1479 third_party/re2/re2/parse.cc cc->AddRangeFlags(next, Runemax, parse_flags); next 532 third_party/simplejson/_speedups.c Py_ssize_t next = begin; next 548 third_party/simplejson/_speedups.c for (next = end; next < len; next++) { next 549 third_party/simplejson/_speedups.c c = (unsigned char)buf[next]; next 554 third_party/simplejson/_speedups.c raise_errmsg("Invalid control character at", pystr, next); next 566 third_party/simplejson/_speedups.c if (next != end) { next 569 third_party/simplejson/_speedups.c strchunk = PyString_FromStringAndSize(&buf[end], next - end); next 584 third_party/simplejson/_speedups.c next++; next 586 third_party/simplejson/_speedups.c end = next; next 589 third_party/simplejson/_speedups.c if (next == len) { next 593 third_party/simplejson/_speedups.c c = buf[next]; next 596 third_party/simplejson/_speedups.c end = next + 1; next 615 third_party/simplejson/_speedups.c next++; next 616 third_party/simplejson/_speedups.c end = next + 4; next 618 third_party/simplejson/_speedups.c raise_errmsg("Invalid \\uXXXX escape", pystr, next - 1); next 622 third_party/simplejson/_speedups.c for (; next < end; next++) { next 623 third_party/simplejson/_speedups.c Py_UNICODE digit = buf[next]; next 648 third_party/simplejson/_speedups.c if (buf[next++] != '\\' || buf[next++] != 'u') { next 654 third_party/simplejson/_speedups.c for (; next < end; next++) { next 656 third_party/simplejson/_speedups.c Py_UNICODE digit = buf[next]; next 742 third_party/simplejson/_speedups.c Py_ssize_t next = begin; next 757 third_party/simplejson/_speedups.c for (next = end; next < len; next++) { next 758 third_party/simplejson/_speedups.c c = buf[next]; next 763 third_party/simplejson/_speedups.c raise_errmsg("Invalid control character at", pystr, next); next 772 third_party/simplejson/_speedups.c if (next != end) { next 774 third_party/simplejson/_speedups.c chunk = PyUnicode_FromUnicode(&buf[end], next - end); next 779 third_party/simplejson/_speedups.c next++; next 781 third_party/simplejson/_speedups.c end = next; next 784 third_party/simplejson/_speedups.c if (next == len) { next 788 third_party/simplejson/_speedups.c c = buf[next]; next 791 third_party/simplejson/_speedups.c end = next + 1; next 810 third_party/simplejson/_speedups.c next++; next 811 third_party/simplejson/_speedups.c end = next + 4; next 813 third_party/simplejson/_speedups.c raise_errmsg("Invalid \\uXXXX escape", pystr, next - 1); next 817 third_party/simplejson/_speedups.c for (; next < end; next++) { next 818 third_party/simplejson/_speedups.c Py_UNICODE digit = buf[next]; next 843 third_party/simplejson/_speedups.c if (buf[next++] != '\\' || buf[next++] != 'u') { next 849 third_party/simplejson/_speedups.c for (; next < end; next++) { next 851 third_party/simplejson/_speedups.c Py_UNICODE digit = buf[next]; next 7083 third_party/sqlite/amalgamation/sqlite3.c HashElem *next, *prev; /* Next and previous elements in the table */ next 7109 third_party/sqlite/amalgamation/sqlite3.c #define sqliteHashNext(E) ((E)->next) next 15196 third_party/sqlite/amalgamation/sqlite3.c u32 next; /* Index in mem3.aPool[] of next free chunk */ next 15256 third_party/sqlite/amalgamation/sqlite3.c u32 next = mem3.aPool[i].u.list.next; next 15260 third_party/sqlite/amalgamation/sqlite3.c *pRoot = next; next 15262 third_party/sqlite/amalgamation/sqlite3.c mem3.aPool[prev].u.list.next = next; next 15264 third_party/sqlite/amalgamation/sqlite3.c if( next ){ next 15265 third_party/sqlite/amalgamation/sqlite3.c mem3.aPool[next].u.list.prev = prev; next 15267 third_party/sqlite/amalgamation/sqlite3.c mem3.aPool[i].u.list.next = 0; next 15297 third_party/sqlite/amalgamation/sqlite3.c mem3.aPool[i].u.list.next = *pRoot; next 15428 third_party/sqlite/amalgamation/sqlite3.c iNext = mem3.aPool[i].u.list.next; next 15436 third_party/sqlite/amalgamation/sqlite3.c iNext = mem3.aPool[prev].u.list.next; next 15489 third_party/sqlite/amalgamation/sqlite3.c for(i=mem3.aiHash[hash]; i>0; i=mem3.aPool[i].u.list.next){ next 15741 third_party/sqlite/amalgamation/sqlite3.c for(j = mem3.aiSmall[i]; j>0; j=mem3.aPool[j].u.list.next){ next 15750 third_party/sqlite/amalgamation/sqlite3.c for(j = mem3.aiHash[i]; j>0; j=mem3.aPool[j].u.list.next){ next 15866 third_party/sqlite/amalgamation/sqlite3.c int next; /* Index of next free chunk */ next 15945 third_party/sqlite/amalgamation/sqlite3.c int next, prev; next 15950 third_party/sqlite/amalgamation/sqlite3.c next = MEM5LINK(i)->next; next 15953 third_party/sqlite/amalgamation/sqlite3.c mem5.aiFreelist[iLogsize] = next; next 15955 third_party/sqlite/amalgamation/sqlite3.c MEM5LINK(prev)->next = next; next 15957 third_party/sqlite/amalgamation/sqlite3.c if( next>=0 ){ next 15958 third_party/sqlite/amalgamation/sqlite3.c MEM5LINK(next)->prev = prev; next 15973 third_party/sqlite/amalgamation/sqlite3.c x = MEM5LINK(i)->next = mem5.aiFreelist[iLogsize]; next 16022 third_party/sqlite/amalgamation/sqlite3.c i = MEM5LINK(i)->next; next 16339 third_party/sqlite/amalgamation/sqlite3.c for(n=0, j=mem5.aiFreelist[i]; j>=0; j = MEM5LINK(j)->next, n++){} next 21416 third_party/sqlite/amalgamation/sqlite3.c HashElem *next_elem = elem->next; next 21454 third_party/sqlite/amalgamation/sqlite3.c pNew->next = pHead; next 21456 third_party/sqlite/amalgamation/sqlite3.c if( pHead->prev ){ pHead->prev->next = pNew; } next 21460 third_party/sqlite/amalgamation/sqlite3.c pNew->next = pH->first; next 21500 third_party/sqlite/amalgamation/sqlite3.c next_elem = elem->next; next 21531 third_party/sqlite/amalgamation/sqlite3.c elem = elem->next; next 21546 third_party/sqlite/amalgamation/sqlite3.c elem->prev->next = elem->next; next 21548 third_party/sqlite/amalgamation/sqlite3.c pH->first = elem->next; next 21550 third_party/sqlite/amalgamation/sqlite3.c if( elem->next ){ next 21551 third_party/sqlite/amalgamation/sqlite3.c elem->next->prev = elem->prev; next 21556 third_party/sqlite/amalgamation/sqlite3.c pEntry->chain = elem->next; next 48564 third_party/sqlite/amalgamation/sqlite3.c u16 next, size; next 48569 third_party/sqlite/amalgamation/sqlite3.c next = get2byte(&data[pc]); next 48571 third_party/sqlite/amalgamation/sqlite3.c if( (next>0 && next<=pc+size+3) || pc+size>usableSize ){ next 48577 third_party/sqlite/amalgamation/sqlite3.c pc = next; next 50829 third_party/sqlite/amalgamation/sqlite3.c Pgno next = 0; next 50855 third_party/sqlite/amalgamation/sqlite3.c next = iGuess; next 50862 third_party/sqlite/amalgamation/sqlite3.c assert( next==0 || rc==SQLITE_DONE ); next 50867 third_party/sqlite/amalgamation/sqlite3.c next = get4byte(pPage->aData); next 50871 third_party/sqlite/amalgamation/sqlite3.c *pPgnoNext = next; next 112929 third_party/sqlite/amalgamation/sqlite3.c Fts3HashElem *next, *prev; /* Next and previous elements in the table */ next 112980 third_party/sqlite/amalgamation/sqlite3.c #define fts3HashNext(E) ((E)->next) next 118243 third_party/sqlite/amalgamation/sqlite3.c Fts3HashElem *next_elem = elem->next; next 118333 third_party/sqlite/amalgamation/sqlite3.c pNew->next = pHead; next 118335 third_party/sqlite/amalgamation/sqlite3.c if( pHead->prev ){ pHead->prev->next = pNew; } next 118339 third_party/sqlite/amalgamation/sqlite3.c pNew->next = pH->first; next 118369 third_party/sqlite/amalgamation/sqlite3.c next_elem = elem->next; next 118398 third_party/sqlite/amalgamation/sqlite3.c elem = elem->next; next 118414 third_party/sqlite/amalgamation/sqlite3.c elem->prev->next = elem->next; next 118416 third_party/sqlite/amalgamation/sqlite3.c pH->first = elem->next; next 118418 third_party/sqlite/amalgamation/sqlite3.c if( elem->next ){ next 118419 third_party/sqlite/amalgamation/sqlite3.c elem->next->prev = elem->prev; next 118423 third_party/sqlite/amalgamation/sqlite3.c pEntry->chain = elem->next; next 72 third_party/sqlite/src/ext/fts1/ft_hash.c HashElem *next_elem = elem->next; next 211 third_party/sqlite/src/ext/fts1/ft_hash.c pNew->next = pHead; next 213 third_party/sqlite/src/ext/fts1/ft_hash.c if( pHead->prev ){ pHead->prev->next = pNew; } next 217 third_party/sqlite/src/ext/fts1/ft_hash.c pNew->next = pH->first; next 245 third_party/sqlite/src/ext/fts1/ft_hash.c next_elem = elem->next; next 273 third_party/sqlite/src/ext/fts1/ft_hash.c elem = elem->next; next 289 third_party/sqlite/src/ext/fts1/ft_hash.c elem->prev->next = elem->next; next 291 third_party/sqlite/src/ext/fts1/ft_hash.c pH->first = elem->next; next 293 third_party/sqlite/src/ext/fts1/ft_hash.c if( elem->next ){ next 294 third_party/sqlite/src/ext/fts1/ft_hash.c elem->next->prev = elem->prev; next 298 third_party/sqlite/src/ext/fts1/ft_hash.c pEntry->chain = elem->next; next 53 third_party/sqlite/src/ext/fts1/ft_hash.h HashElem *next, *prev; /* Next and previous elements in the table */ next 101 third_party/sqlite/src/ext/fts1/ft_hash.h #define HashNext(E) ((E)->next) next 79 third_party/sqlite/src/ext/fts1/fts1_hash.c fts1HashElem *next_elem = elem->next; next 169 third_party/sqlite/src/ext/fts1/fts1_hash.c pNew->next = pHead; next 171 third_party/sqlite/src/ext/fts1/fts1_hash.c if( pHead->prev ){ pHead->prev->next = pNew; } next 175 third_party/sqlite/src/ext/fts1/fts1_hash.c pNew->next = pH->first; next 203 third_party/sqlite/src/ext/fts1/fts1_hash.c next_elem = elem->next; next 231 third_party/sqlite/src/ext/fts1/fts1_hash.c elem = elem->next; next 247 third_party/sqlite/src/ext/fts1/fts1_hash.c elem->prev->next = elem->next; next 249 third_party/sqlite/src/ext/fts1/fts1_hash.c pH->first = elem->next; next 251 third_party/sqlite/src/ext/fts1/fts1_hash.c if( elem->next ){ next 252 third_party/sqlite/src/ext/fts1/fts1_hash.c elem->next->prev = elem->prev; next 256 third_party/sqlite/src/ext/fts1/fts1_hash.c pEntry->chain = elem->next; next 53 third_party/sqlite/src/ext/fts1/fts1_hash.h fts1HashElem *next, *prev; /* Next and previous elements in the table */ next 102 third_party/sqlite/src/ext/fts1/fts1_hash.h #define fts1HashNext(E) ((E)->next) next 1209 third_party/sqlite/src/ext/fts1/fulltext.c DocList *next = docListNew(need_positions ? DL_POSITIONS : DL_DOCIDS); next 1213 third_party/sqlite/src/ext/fts1/fulltext.c rc = query_merge(v, &pSelect, q.pTerm[i].zTerm, d, i - phrase_start, next); next 1218 third_party/sqlite/src/ext/fts1/fulltext.c d = next; next 4293 third_party/sqlite/src/ext/fts2/fts2.c struct InteriorBlock *next; next 4452 third_party/sqlite/src/ext/fts2/fts2.c pWriter->last->next = interiorBlockNew(pWriter->iHeight, iChildBlock, next 4454 third_party/sqlite/src/ext/fts2/fts2.c pWriter->last = pWriter->last->next; next 4473 third_party/sqlite/src/ext/fts2/fts2.c block = block->next; next 4522 third_party/sqlite/src/ext/fts2/fts2.c for(block=block->next; block!=NULL; block=block->next){ next 84 third_party/sqlite/src/ext/fts2/fts2_hash.c fts2HashElem *next_elem = elem->next; next 174 third_party/sqlite/src/ext/fts2/fts2_hash.c pNew->next = pHead; next 176 third_party/sqlite/src/ext/fts2/fts2_hash.c if( pHead->prev ){ pHead->prev->next = pNew; } next 180 third_party/sqlite/src/ext/fts2/fts2_hash.c pNew->next = pH->first; next 208 third_party/sqlite/src/ext/fts2/fts2_hash.c next_elem = elem->next; next 236 third_party/sqlite/src/ext/fts2/fts2_hash.c elem = elem->next; next 252 third_party/sqlite/src/ext/fts2/fts2_hash.c elem->prev->next = elem->next; next 254 third_party/sqlite/src/ext/fts2/fts2_hash.c pH->first = elem->next; next 256 third_party/sqlite/src/ext/fts2/fts2_hash.c if( elem->next ){ next 257 third_party/sqlite/src/ext/fts2/fts2_hash.c elem->next->prev = elem->prev; next 261 third_party/sqlite/src/ext/fts2/fts2_hash.c pEntry->chain = elem->next; next 51 third_party/sqlite/src/ext/fts2/fts2_hash.h fts2HashElem *next, *prev; /* Next and previous elements in the table */ next 100 third_party/sqlite/src/ext/fts2/fts2_hash.h #define fts2HashNext(E) ((E)->next) next 84 third_party/sqlite/src/ext/fts3/fts3_hash.c Fts3HashElem *next_elem = elem->next; next 174 third_party/sqlite/src/ext/fts3/fts3_hash.c pNew->next = pHead; next 176 third_party/sqlite/src/ext/fts3/fts3_hash.c if( pHead->prev ){ pHead->prev->next = pNew; } next 180 third_party/sqlite/src/ext/fts3/fts3_hash.c pNew->next = pH->first; next 210 third_party/sqlite/src/ext/fts3/fts3_hash.c next_elem = elem->next; next 239 third_party/sqlite/src/ext/fts3/fts3_hash.c elem = elem->next; next 255 third_party/sqlite/src/ext/fts3/fts3_hash.c elem->prev->next = elem->next; next 257 third_party/sqlite/src/ext/fts3/fts3_hash.c pH->first = elem->next; next 259 third_party/sqlite/src/ext/fts3/fts3_hash.c if( elem->next ){ next 260 third_party/sqlite/src/ext/fts3/fts3_hash.c elem->next->prev = elem->prev; next 264 third_party/sqlite/src/ext/fts3/fts3_hash.c pEntry->chain = elem->next; next 51 third_party/sqlite/src/ext/fts3/fts3_hash.h Fts3HashElem *next, *prev; /* Next and previous elements in the table */ next 102 third_party/sqlite/src/ext/fts3/fts3_hash.h #define fts3HashNext(E) ((E)->next) next 1445 third_party/sqlite/src/src/btree.c u16 next, size; next 1450 third_party/sqlite/src/src/btree.c next = get2byte(&data[pc]); next 1452 third_party/sqlite/src/src/btree.c if( (next>0 && next<=pc+size+3) || pc+size>usableSize ){ next 1458 third_party/sqlite/src/src/btree.c pc = next; next 3710 third_party/sqlite/src/src/btree.c Pgno next = 0; next 3736 third_party/sqlite/src/src/btree.c next = iGuess; next 3743 third_party/sqlite/src/src/btree.c assert( next==0 || rc==SQLITE_DONE ); next 3748 third_party/sqlite/src/src/btree.c next = get4byte(pPage->aData); next 3752 third_party/sqlite/src/src/btree.c *pPgnoNext = next; next 45 third_party/sqlite/src/src/hash.c HashElem *next_elem = elem->next; next 83 third_party/sqlite/src/src/hash.c pNew->next = pHead; next 85 third_party/sqlite/src/src/hash.c if( pHead->prev ){ pHead->prev->next = pNew; } next 89 third_party/sqlite/src/src/hash.c pNew->next = pH->first; next 129 third_party/sqlite/src/src/hash.c next_elem = elem->next; next 160 third_party/sqlite/src/src/hash.c elem = elem->next; next 175 third_party/sqlite/src/src/hash.c elem->prev->next = elem->next; next 177 third_party/sqlite/src/src/hash.c pH->first = elem->next; next 179 third_party/sqlite/src/src/hash.c if( elem->next ){ next 180 third_party/sqlite/src/src/hash.c elem->next->prev = elem->prev; next 185 third_party/sqlite/src/src/hash.c pEntry->chain = elem->next; next 60 third_party/sqlite/src/src/hash.h HashElem *next, *prev; /* Next and previous elements in the table */ next 86 third_party/sqlite/src/src/hash.h #define sqliteHashNext(E) ((E)->next) next 88 third_party/sqlite/src/src/mem3.c u32 next; /* Index in mem3.aPool[] of next free chunk */ next 148 third_party/sqlite/src/src/mem3.c u32 next = mem3.aPool[i].u.list.next; next 152 third_party/sqlite/src/src/mem3.c *pRoot = next; next 154 third_party/sqlite/src/src/mem3.c mem3.aPool[prev].u.list.next = next; next 156 third_party/sqlite/src/src/mem3.c if( next ){ next 157 third_party/sqlite/src/src/mem3.c mem3.aPool[next].u.list.prev = prev; next 159 third_party/sqlite/src/src/mem3.c mem3.aPool[i].u.list.next = 0; next 189 third_party/sqlite/src/src/mem3.c mem3.aPool[i].u.list.next = *pRoot; next 320 third_party/sqlite/src/src/mem3.c iNext = mem3.aPool[i].u.list.next; next 328 third_party/sqlite/src/src/mem3.c iNext = mem3.aPool[prev].u.list.next; next 381 third_party/sqlite/src/src/mem3.c for(i=mem3.aiHash[hash]; i>0; i=mem3.aPool[i].u.list.next){ next 633 third_party/sqlite/src/src/mem3.c for(j = mem3.aiSmall[i]; j>0; j=mem3.aPool[j].u.list.next){ next 642 third_party/sqlite/src/src/mem3.c for(j = mem3.aiHash[i]; j>0; j=mem3.aPool[j].u.list.next){ next 69 third_party/sqlite/src/src/mem5.c int next; /* Index of next free chunk */ next 148 third_party/sqlite/src/src/mem5.c int next, prev; next 153 third_party/sqlite/src/src/mem5.c next = MEM5LINK(i)->next; next 156 third_party/sqlite/src/src/mem5.c mem5.aiFreelist[iLogsize] = next; next 158 third_party/sqlite/src/src/mem5.c MEM5LINK(prev)->next = next; next 160 third_party/sqlite/src/src/mem5.c if( next>=0 ){ next 161 third_party/sqlite/src/src/mem5.c MEM5LINK(next)->prev = prev; next 176 third_party/sqlite/src/src/mem5.c x = MEM5LINK(i)->next = mem5.aiFreelist[iLogsize]; next 225 third_party/sqlite/src/src/mem5.c i = MEM5LINK(i)->next; next 542 third_party/sqlite/src/src/mem5.c for(n=0, j=mem5.aiFreelist[i]; j>=0; j = MEM5LINK(j)->next, n++){} next 203 third_party/sqlite/src/tool/lemon.c struct rule *next; /* Next rule in the global list */ next 223 third_party/sqlite/src/tool/lemon.c struct config *next; /* Next configuration in the state */ next 248 third_party/sqlite/src/tool/lemon.c struct action *next; /* Next action for this state */ next 270 third_party/sqlite/src/tool/lemon.c struct plink *next; /* The next propagate link */ next 383 third_party/sqlite/src/tool/lemon.c for(i=0; i<amt-1; i++) freelist[i].next = &freelist[i+1]; next 384 third_party/sqlite/src/tool/lemon.c freelist[amt-1].next = 0; next 387 third_party/sqlite/src/tool/lemon.c freelist = freelist->next; next 417 third_party/sqlite/src/tool/lemon.c ap = (struct action *)msort((char *)ap,(char **)&ap->next, next 430 third_party/sqlite/src/tool/lemon.c newaction->next = *app; next 661 third_party/sqlite/src/tool/lemon.c for(rp=xp->rule; rp; rp=rp->next){ next 703 third_party/sqlite/src/tool/lemon.c for(rp=lemp->rule; rp; rp=rp->next){ next 720 third_party/sqlite/src/tool/lemon.c for(rp=lemp->rule; rp; rp=rp->next){ next 774 third_party/sqlite/src/tool/lemon.c for(rp=lemp->rule; rp; rp=rp->next){ next 879 third_party/sqlite/src/tool/lemon.c for(cfp=stp->cfp; cfp; cfp=cfp->next) cfp->status = INCOMPLETE; next 882 third_party/sqlite/src/tool/lemon.c for(cfp=stp->cfp; cfp; cfp=cfp->next){ next 891 third_party/sqlite/src/tool/lemon.c for(bcfp=cfp; bcfp; bcfp=bcfp->next){ next 933 third_party/sqlite/src/tool/lemon.c for(cfp=stp->cfp; cfp; cfp=cfp->next){ next 942 third_party/sqlite/src/tool/lemon.c for(cfp=stp->cfp; cfp; cfp=cfp->next){ next 943 third_party/sqlite/src/tool/lemon.c for(plp=cfp->bplp; plp; plp=plp->next){ next 965 third_party/sqlite/src/tool/lemon.c for(cfp=lemp->sorted[i]->cfp; cfp; cfp=cfp->next){ next 973 third_party/sqlite/src/tool/lemon.c for(cfp=lemp->sorted[i]->cfp; cfp; cfp=cfp->next){ next 975 third_party/sqlite/src/tool/lemon.c for(plp=cfp->fplp; plp; plp=plp->next){ next 1006 third_party/sqlite/src/tool/lemon.c for(cfp=stp->cfp; cfp; cfp=cfp->next){ /* Loop over all configurations */ next 1038 third_party/sqlite/src/tool/lemon.c for(ap=stp->ap; ap && ap->next; ap=ap->next){ next 1039 third_party/sqlite/src/tool/lemon.c for(nap=ap->next; nap && nap->sp==ap->sp; nap=nap->next){ next 1048 third_party/sqlite/src/tool/lemon.c for(rp=lemp->rule; rp; rp=rp->next) rp->canReduce = LEMON_FALSE; next 1051 third_party/sqlite/src/tool/lemon.c for(ap=lemp->sorted[i]->ap; ap; ap=ap->next){ next 1055 third_party/sqlite/src/tool/lemon.c for(rp=lemp->rule; rp; rp=rp->next){ next 1161 third_party/sqlite/src/tool/lemon.c for(i=0; i<amt-1; i++) freelist[i].next = &freelist[i+1]; next 1162 third_party/sqlite/src/tool/lemon.c freelist[amt-1].next = 0; next 1165 third_party/sqlite/src/tool/lemon.c freelist = freelist->next; next 1172 third_party/sqlite/src/tool/lemon.c old->next = freelist; next 1214 third_party/sqlite/src/tool/lemon.c cfp->next = 0; next 1217 third_party/sqlite/src/tool/lemon.c currentend = &cfp->next; next 1240 third_party/sqlite/src/tool/lemon.c cfp->next = 0; next 1243 third_party/sqlite/src/tool/lemon.c currentend = &cfp->next; next 1260 third_party/sqlite/src/tool/lemon.c for(cfp=current; cfp; cfp=cfp->next){ next 1298 third_party/sqlite/src/tool/lemon.c current = (struct config *)msort((char *)current,(char **)&(current->next),Configcmp); next 1335 third_party/sqlite/src/tool/lemon.c nextcfp = cfp->next; next 1642 third_party/sqlite/src/tool/lemon.c char **next, next 1649 third_party/sqlite/src/tool/lemon.c offset = (unsigned long)next - (unsigned long)list; next 2139 third_party/sqlite/src/tool/lemon.c rp->next = 0; next 2143 third_party/sqlite/src/tool/lemon.c psp->lastrule->next = rp; next 2678 third_party/sqlite/src/tool/lemon.c for(i=0; i<amt-1; i++) plink_freelist[i].next = &plink_freelist[i+1]; next 2679 third_party/sqlite/src/tool/lemon.c plink_freelist[amt-1].next = 0; next 2682 third_party/sqlite/src/tool/lemon.c plink_freelist = plink_freelist->next; next 2691 third_party/sqlite/src/tool/lemon.c newlink->next = *plpp; next 2701 third_party/sqlite/src/tool/lemon.c nextpl = from->next; next 2702 third_party/sqlite/src/tool/lemon.c from->next = *to; next 2714 third_party/sqlite/src/tool/lemon.c nextpl = plp->next; next 2715 third_party/sqlite/src/tool/lemon.c plp->next = plink_freelist; next 2810 third_party/sqlite/src/tool/lemon.c for(rp=lemp->rule; rp; rp=rp->next){ next 2882 third_party/sqlite/src/tool/lemon.c plp = plp->next; next 2969 third_party/sqlite/src/tool/lemon.c else cfp=cfp->next; next 2972 third_party/sqlite/src/tool/lemon.c for(ap=stp->ap; ap; ap=ap->next){ next 3744 third_party/sqlite/src/tool/lemon.c for(ap=stp->ap; ap; ap=ap->next){ next 3755 third_party/sqlite/src/tool/lemon.c for(ap=stp->ap; ap; ap=ap->next){ next 3903 third_party/sqlite/src/tool/lemon.c for(i=0, rp=lemp->rule; rp; rp=rp->next, i++){ next 3982 third_party/sqlite/src/tool/lemon.c for(rp=lemp->rule; rp; rp=rp->next){ next 3988 third_party/sqlite/src/tool/lemon.c for(rp=lemp->rule; rp; rp=rp->next){ next 3992 third_party/sqlite/src/tool/lemon.c for(rp=lemp->rule; rp; rp=rp->next){ next 3999 third_party/sqlite/src/tool/lemon.c for(rp2=rp->next; rp2; rp2=rp2->next){ next 4014 third_party/sqlite/src/tool/lemon.c for(rp=lemp->rule; rp; rp=rp->next){ next 4099 third_party/sqlite/src/tool/lemon.c for(ap=stp->ap; ap; ap=ap->next){ next 4108 third_party/sqlite/src/tool/lemon.c for(ap2=ap->next; ap2; ap2=ap2->next){ next 4128 third_party/sqlite/src/tool/lemon.c for(ap=stp->ap; ap; ap=ap->next){ next 4133 third_party/sqlite/src/tool/lemon.c for(ap=ap->next; ap; ap=ap->next){ next 4180 third_party/sqlite/src/tool/lemon.c for(ap=stp->ap; ap; ap=ap->next){ next 4312 third_party/sqlite/src/tool/lemon.c struct s_x1node *next; /* Next entry with the same hash */ next 4356 third_party/sqlite/src/tool/lemon.c np = np->next; next 4374 third_party/sqlite/src/tool/lemon.c if( array.ht[h] ) array.ht[h]->from = &(newnp->next); next 4375 third_party/sqlite/src/tool/lemon.c newnp->next = array.ht[h]; next 4387 third_party/sqlite/src/tool/lemon.c if( x1a->ht[h] ) x1a->ht[h]->from = &(np->next); next 4388 third_party/sqlite/src/tool/lemon.c np->next = x1a->ht[h]; next 4406 third_party/sqlite/src/tool/lemon.c np = np->next; next 4478 third_party/sqlite/src/tool/lemon.c struct s_x2node *next; /* Next entry with the same hash */ next 4522 third_party/sqlite/src/tool/lemon.c np = np->next; next 4540 third_party/sqlite/src/tool/lemon.c if( array.ht[h] ) array.ht[h]->from = &(newnp->next); next 4541 third_party/sqlite/src/tool/lemon.c newnp->next = array.ht[h]; next 4555 third_party/sqlite/src/tool/lemon.c if( x2a->ht[h] ) x2a->ht[h]->from = &(np->next); next 4556 third_party/sqlite/src/tool/lemon.c np->next = x2a->ht[h]; next 4574 third_party/sqlite/src/tool/lemon.c np = np->next; next 4677 third_party/sqlite/src/tool/lemon.c struct s_x3node *next; /* Next entry with the same hash */ next 4721 third_party/sqlite/src/tool/lemon.c np = np->next; next 4739 third_party/sqlite/src/tool/lemon.c if( array.ht[h] ) array.ht[h]->from = &(newnp->next); next 4740 third_party/sqlite/src/tool/lemon.c newnp->next = array.ht[h]; next 4754 third_party/sqlite/src/tool/lemon.c if( x3a->ht[h] ) x3a->ht[h]->from = &(np->next); next 4755 third_party/sqlite/src/tool/lemon.c np->next = x3a->ht[h]; next 4773 third_party/sqlite/src/tool/lemon.c np = np->next; next 4819 third_party/sqlite/src/tool/lemon.c struct s_x4node *next; /* Next entry with the same hash */ next 4863 third_party/sqlite/src/tool/lemon.c np = np->next; next 4881 third_party/sqlite/src/tool/lemon.c if( array.ht[h] ) array.ht[h]->from = &(newnp->next); next 4882 third_party/sqlite/src/tool/lemon.c newnp->next = array.ht[h]; next 4894 third_party/sqlite/src/tool/lemon.c if( x4a->ht[h] ) x4a->ht[h]->from = &(np->next); next 4895 third_party/sqlite/src/tool/lemon.c np->next = x4a->ht[h]; next 4913 third_party/sqlite/src/tool/lemon.c np = np->next; next 320 third_party/talloc/libreplace/getaddrinfo.c struct addrinfo *next = NULL; next 322 third_party/talloc/libreplace/getaddrinfo.c for (;res; res = next) { next 323 third_party/talloc/libreplace/getaddrinfo.c next = res->ai_next; next 324 third_party/talloc/libreplace/getifaddrs.c next: next 219 third_party/talloc/libreplace/snprintf.c struct pr_chunk *next; next 276 third_party/talloc/libreplace/snprintf.c cnk->next = new_chunk(); next 277 third_party/talloc/libreplace/snprintf.c cnk = cnk->next; next 734 third_party/talloc/libreplace/snprintf.c cnk = cnk->next; next 748 third_party/talloc/libreplace/snprintf.c cnk = chunks->next; next 1130 third_party/talloc/libreplace/snprintf.c new_c->next = NULL; next 116 third_party/talloc/talloc.c struct talloc_reference_handle *next, *prev; next 124 third_party/talloc/talloc.c struct talloc_chunk *next, *prev; next 262 third_party/talloc/talloc.c (p)->next = (p)->prev = NULL; \ next 265 third_party/talloc/talloc.c (p)->next = (list); \ next 275 third_party/talloc/talloc.c (list) = (p)->next; \ next 278 third_party/talloc/talloc.c if ((p)->prev) (p)->prev->next = (p)->next; \ next 279 third_party/talloc/talloc.c if ((p)->next) (p)->next->prev = (p)->prev; \ next 281 third_party/talloc/talloc.c if ((p) && ((p) != (list))) (p)->next = (p)->prev = NULL; \ next 430 third_party/talloc/talloc.c tc->next = parent->child; next 431 third_party/talloc/talloc.c tc->next->prev = tc; next 433 third_party/talloc/talloc.c tc->next = NULL; next 439 third_party/talloc/talloc.c tc->next = tc->prev = tc->parent = NULL; next 621 third_party/talloc/talloc.c if (tc->prev) tc->prev->next = tc->next; next 622 third_party/talloc/talloc.c if (tc->next) tc->next->prev = tc->prev; next 708 third_party/talloc/talloc.c if (tc->prev) tc->prev->next = tc->next; next 709 third_party/talloc/talloc.c if (tc->next) tc->next->prev = tc->prev; next 712 third_party/talloc/talloc.c tc->parent = tc->next = tc->prev = NULL; next 728 third_party/talloc/talloc.c if (tc->prev) tc->prev->next = tc->next; next 729 third_party/talloc/talloc.c if (tc->next) tc->next->prev = tc->prev; next 760 third_party/talloc/talloc.c for (h=tc->refs; h; h=h->next) { next 790 third_party/talloc/talloc.c for (h=tc->refs;h;h=h->next) { next 817 third_party/talloc/talloc.c for (h=tc->refs;h;h=h->next) { next 1134 third_party/talloc/talloc.c for (h=tc->refs; h; h=h->next) { next 1240 third_party/talloc/talloc.c tc->prev->next = tc; next 1242 third_party/talloc/talloc.c if (tc->next) { next 1243 third_party/talloc/talloc.c tc->next->prev = tc; next 1290 third_party/talloc/talloc.c for (c=tc->child;c;c=c->next) { next 1323 third_party/talloc/talloc.c for (c=tc->child;c;c=c->next) { next 1341 third_party/talloc/talloc.c for (h=tc->refs;h;h=h->next) { next 1377 third_party/talloc/talloc.c for (c=tc->child;c;c=c->next) { next 1512 third_party/talloc/talloc.c for (tc2 = tc->child; tc2; tc2=tc2->next) { next 1516 third_party/talloc/talloc.c for (tc2 = tc->next; tc2; tc2=tc2->next) { next 1521 third_party/talloc/talloc.c tc->next = NULL; next 163 third_party/tcmalloc/chromium/src/addressmap-inl.h Entry* next; next 177 third_party/tcmalloc/chromium/src/addressmap-inl.h Cluster* next; // Next cluster in hash table chain next 217 third_party/tcmalloc/chromium/src/addressmap-inl.h for (Cluster* c = hashtable_[h]; c != NULL; c = c->next) { next 227 third_party/tcmalloc/chromium/src/addressmap-inl.h c->next = hashtable_[h]; next 246 third_party/tcmalloc/chromium/src/addressmap-inl.h Object* next; next 261 third_party/tcmalloc/chromium/src/addressmap-inl.h obj->next = allocated_; next 282 third_party/tcmalloc/chromium/src/addressmap-inl.h Object* next = obj->next; next 284 third_party/tcmalloc/chromium/src/addressmap-inl.h obj = next; next 298 third_party/tcmalloc/chromium/src/addressmap-inl.h for (Entry* e = c->blocks[BlockID(num)]; e != NULL; e = e->next) { next 314 third_party/tcmalloc/chromium/src/addressmap-inl.h for (Entry* e = c->blocks[block]; e != NULL; e = e->next) { next 326 third_party/tcmalloc/chromium/src/addressmap-inl.h array[i].next = &array[i+1]; next 328 third_party/tcmalloc/chromium/src/addressmap-inl.h array[ALLOC_COUNT-1].next = free_; next 332 third_party/tcmalloc/chromium/src/addressmap-inl.h free_ = e->next; next 335 third_party/tcmalloc/chromium/src/addressmap-inl.h e->next = c->blocks[block]; next 344 third_party/tcmalloc/chromium/src/addressmap-inl.h for (Entry** p = &c->blocks[BlockID(num)]; *p != NULL; p = &(*p)->next) { next 348 third_party/tcmalloc/chromium/src/addressmap-inl.h *p = e->next; // Remove e from linked-list next 349 third_party/tcmalloc/chromium/src/addressmap-inl.h e->next = free_; // Add e to free-list next 371 third_party/tcmalloc/chromium/src/addressmap-inl.h for (const Entry* e = c->blocks[block]; e != NULL; e = e->next) { next 411 third_party/tcmalloc/chromium/src/addressmap-inl.h for (const Cluster* c = hashtable_[h]; c != NULL; c = c->next) { next 413 third_party/tcmalloc/chromium/src/addressmap-inl.h for (Entry* e = c->blocks[b]; e != NULL; e = e->next) { next 78 third_party/tcmalloc/chromium/src/base/low_level_alloc.cc AllocList *next[kMaxLevel]; // actually has levels elements. next 127 third_party/tcmalloc/chromium/src/base/low_level_alloc.cc int max_fit = (size-OFFSETOF_MEMBER(AllocList, next)) / sizeof (AllocList *); next 143 third_party/tcmalloc/chromium/src/base/low_level_alloc.cc for (AllocList *n; (n = p->next[level]) != 0 && n < e; p = n) { next 147 third_party/tcmalloc/chromium/src/base/low_level_alloc.cc return (head->levels == 0) ? 0 : prev[0]->next[0]; next 160 third_party/tcmalloc/chromium/src/base/low_level_alloc.cc e->next[i] = prev[i]->next[i]; next 161 third_party/tcmalloc/chromium/src/base/low_level_alloc.cc prev[i]->next[i] = e; next 172 third_party/tcmalloc/chromium/src/base/low_level_alloc.cc for (int i = 0; i != e->levels && prev[i]->next[i] == e; i++) { next 173 third_party/tcmalloc/chromium/src/base/low_level_alloc.cc prev[i]->next[i] = e->next[i]; next 175 third_party/tcmalloc/chromium/src/base/low_level_alloc.cc while (head->levels > 0 && head->next[head->levels - 1] == 0) { next 279 third_party/tcmalloc/chromium/src/base/low_level_alloc.cc memset(arena->freelist.next, 0, sizeof (arena->freelist.next)); next 321 third_party/tcmalloc/chromium/src/base/low_level_alloc.cc while (arena->freelist.next[0] != 0) { next 322 third_party/tcmalloc/chromium/src/base/low_level_alloc.cc AllocList *region = arena->freelist.next[0]; next 324 third_party/tcmalloc/chromium/src/base/low_level_alloc.cc arena->freelist.next[0] = region->next[0]; next 363 third_party/tcmalloc/chromium/src/base/low_level_alloc.cc AllocList *next = prev->next[i]; next 364 third_party/tcmalloc/chromium/src/base/low_level_alloc.cc if (next != 0) { next 365 third_party/tcmalloc/chromium/src/base/low_level_alloc.cc RAW_CHECK(next->header.magic == Magic(kMagicUnallocated, &next->header), next 367 third_party/tcmalloc/chromium/src/base/low_level_alloc.cc RAW_CHECK(next->header.arena == arena, next 370 third_party/tcmalloc/chromium/src/base/low_level_alloc.cc RAW_CHECK(prev < next, "unordered freelist"); next 372 third_party/tcmalloc/chromium/src/base/low_level_alloc.cc reinterpret_cast<char *>(next), "malformed freelist"); next 375 third_party/tcmalloc/chromium/src/base/low_level_alloc.cc return next; next 380 third_party/tcmalloc/chromium/src/base/low_level_alloc.cc AllocList *n = a->next[0]; next 83 third_party/tcmalloc/chromium/src/central_freelist.cc void *next = FL_Next(start); next 85 third_party/tcmalloc/chromium/src/central_freelist.cc start = next; next 291 third_party/tcmalloc/chromium/src/central_freelist.cc Span* span = nonempty_.next; next 620 third_party/tcmalloc/chromium/src/deep-heap-profile.cc x = x->next; next 655 third_party/tcmalloc/chromium/src/deep-heap-profile.cc for (DeepBucket* db = table_[buck]; db != 0; db = db->next) { next 672 third_party/tcmalloc/chromium/src/deep-heap-profile.cc db->next = table_[buck]; next 682 third_party/tcmalloc/chromium/src/deep-heap-profile.cc deep_bucket = deep_bucket->next) { next 705 third_party/tcmalloc/chromium/src/deep-heap-profile.cc deep_bucket = deep_bucket->next) { next 728 third_party/tcmalloc/chromium/src/deep-heap-profile.cc deep_bucket = deep_bucket->next) { next 738 third_party/tcmalloc/chromium/src/deep-heap-profile.cc deep_bucket = deep_bucket->next) { next 252 third_party/tcmalloc/chromium/src/deep-heap-profile.h DeepBucket* next; // A reference to the next entry in the hash table next 68 third_party/tcmalloc/chromium/src/free_list.h inline void EnsureNonLoop(void* node, void* next) { next 71 third_party/tcmalloc/chromium/src/free_list.h if (node != next) return; next 72 third_party/tcmalloc/chromium/src/free_list.h Log(kCrash, __FILE__, __LINE__, "Circular loop in list detected: ", next); next 116 third_party/tcmalloc/chromium/src/free_list.h void *next = FL_Next_No_Check(t); next 117 third_party/tcmalloc/chromium/src/free_list.h if (next) { next 118 third_party/tcmalloc/chromium/src/free_list.h FL_EqualityCheck(FL_Previous_No_Check(next), t, __FILE__, __LINE__); next 120 third_party/tcmalloc/chromium/src/free_list.h return next; next 49 third_party/tcmalloc/chromium/src/heap-profile-stats.h HeapProfileBucket* next; // Next entry in hash-table. next 163 third_party/tcmalloc/chromium/src/heap-profile-table.cc curr = curr->next; next 186 third_party/tcmalloc/chromium/src/heap-profile-table.cc for (Bucket* b = bucket_table_[buck]; b != 0; b = b->next) { next 203 third_party/tcmalloc/chromium/src/heap-profile-table.cc b->next = bucket_table_[buck]; next 341 third_party/tcmalloc/chromium/src/heap-profile-table.cc for (Bucket* curr = bucket_table_[i]; curr != 0; curr = curr->next) { next 254 third_party/tcmalloc/chromium/src/memory_region_map.cc curr = curr->next; next 393 third_party/tcmalloc/chromium/src/memory_region_map.cc bucket = bucket->next) { next 410 third_party/tcmalloc/chromium/src/memory_region_map.cc bucket->next = NULL; next 423 third_party/tcmalloc/chromium/src/memory_region_map.cc bucket->next = bucket_table_[hash_index]; next 509 third_party/tcmalloc/chromium/src/memory_region_map.cc curr = curr->next) { next 532 third_party/tcmalloc/chromium/src/memory_region_map.cc new_bucket->next = bucket_table_[hash_index]; next 409 third_party/tcmalloc/chromium/src/memory_region_map.h bucket = bucket->next) { next 79 third_party/tcmalloc/chromium/src/page_heap.cc ASSERT(ll->next->location == Span::ON_NORMAL_FREELIST); next 80 third_party/tcmalloc/chromium/src/page_heap.cc return Carve(ll->next, n); next 85 third_party/tcmalloc/chromium/src/page_heap.cc ASSERT(ll->next->location == Span::ON_RETURNED_FREELIST); next 86 third_party/tcmalloc/chromium/src/page_heap.cc return Carve(ll->next, n); next 116 third_party/tcmalloc/chromium/src/page_heap.cc for (Span* span = large_.normal.next; next 118 third_party/tcmalloc/chromium/src/page_heap.cc span = span->next) { next 130 third_party/tcmalloc/chromium/src/page_heap.cc for (Span* span = large_.returned.next; next 132 third_party/tcmalloc/chromium/src/page_heap.cc span = span->next) { next 197 third_party/tcmalloc/chromium/src/page_heap.cc Span* next = GetDescriptor(p+len); next 198 third_party/tcmalloc/chromium/src/page_heap.cc ASSERT (next == NULL || next 199 third_party/tcmalloc/chromium/src/page_heap.cc next->location == Span::IN_USE || next 200 third_party/tcmalloc/chromium/src/page_heap.cc next->location != leftover->location); next 280 third_party/tcmalloc/chromium/src/page_heap.cc Span* next = GetDescriptor(p+n); next 281 third_party/tcmalloc/chromium/src/page_heap.cc if (next != NULL && next->location != Span::IN_USE) { next 283 third_party/tcmalloc/chromium/src/page_heap.cc ASSERT(next->start == p+n); next 284 third_party/tcmalloc/chromium/src/page_heap.cc const Length len = next->length; next 285 third_party/tcmalloc/chromium/src/page_heap.cc if (next->location == Span::ON_RETURNED_FREELIST) { next 287 third_party/tcmalloc/chromium/src/page_heap.cc stats_.committed_bytes += next->length << kPageShift; next 289 third_party/tcmalloc/chromium/src/page_heap.cc RemoveFromFreeList(next); next 290 third_party/tcmalloc/chromium/src/page_heap.cc DeleteSpan(next); next 417 third_party/tcmalloc/chromium/src/page_heap.cc for (Span* s = large_.normal.next; s != &large_.normal; s = s->next) { next 421 third_party/tcmalloc/chromium/src/page_heap.cc for (Span* s = large_.returned.next; s != &large_.returned; s = s->next) { next 518 third_party/tcmalloc/chromium/src/page_heap.cc ASSERT(free_[0].normal.next == &free_[0].normal); next 519 third_party/tcmalloc/chromium/src/page_heap.cc ASSERT(free_[0].returned.next == &free_[0].returned); next 536 third_party/tcmalloc/chromium/src/page_heap.cc for (Span* s = list->next; s != list; s = s->next) { next 73 third_party/tcmalloc/chromium/src/span.cc list->next = list; next 78 third_party/tcmalloc/chromium/src/span.cc span->prev->next = span->next; next 79 third_party/tcmalloc/chromium/src/span.cc span->next->prev = span->prev; next 81 third_party/tcmalloc/chromium/src/span.cc span->next = NULL; next 86 third_party/tcmalloc/chromium/src/span.cc for (Span* s = list->next; s != list; s = s->next) { next 93 third_party/tcmalloc/chromium/src/span.cc ASSERT(span->next == NULL); next 95 third_party/tcmalloc/chromium/src/span.cc span->next = list->next; next 97 third_party/tcmalloc/chromium/src/span.cc list->next->prev = span; next 98 third_party/tcmalloc/chromium/src/span.cc list->next = span; next 47 third_party/tcmalloc/chromium/src/span.h Span* next; // Used when in link list next 90 third_party/tcmalloc/chromium/src/span.h return list->next == list; next 86 third_party/tcmalloc/chromium/src/stack_trace_table.cc b = b->next; next 103 third_party/tcmalloc/chromium/src/stack_trace_table.cc b->next = table_[idx]; next 135 third_party/tcmalloc/chromium/src/stack_trace_table.cc b = b->next; next 149 third_party/tcmalloc/chromium/src/stack_trace_table.cc Bucket* next = b->next; next 151 third_party/tcmalloc/chromium/src/stack_trace_table.cc b = next; next 71 third_party/tcmalloc/chromium/src/stack_trace_table.h Bucket* next; next 640 third_party/tcmalloc/chromium/src/tcmalloc.cc for (Span* s = sampled->next; s != sampled; s = s->next) { next 163 third_party/tcmalloc/vendor/src/addressmap-inl.h Entry* next; next 177 third_party/tcmalloc/vendor/src/addressmap-inl.h Cluster* next; // Next cluster in hash table chain next 217 third_party/tcmalloc/vendor/src/addressmap-inl.h for (Cluster* c = hashtable_[h]; c != NULL; c = c->next) { next 227 third_party/tcmalloc/vendor/src/addressmap-inl.h c->next = hashtable_[h]; next 246 third_party/tcmalloc/vendor/src/addressmap-inl.h Object* next; next 261 third_party/tcmalloc/vendor/src/addressmap-inl.h obj->next = allocated_; next 282 third_party/tcmalloc/vendor/src/addressmap-inl.h Object* next = obj->next; next 284 third_party/tcmalloc/vendor/src/addressmap-inl.h obj = next; next 298 third_party/tcmalloc/vendor/src/addressmap-inl.h for (Entry* e = c->blocks[BlockID(num)]; e != NULL; e = e->next) { next 314 third_party/tcmalloc/vendor/src/addressmap-inl.h for (Entry* e = c->blocks[block]; e != NULL; e = e->next) { next 326 third_party/tcmalloc/vendor/src/addressmap-inl.h array[i].next = &array[i+1]; next 328 third_party/tcmalloc/vendor/src/addressmap-inl.h array[ALLOC_COUNT-1].next = free_; next 332 third_party/tcmalloc/vendor/src/addressmap-inl.h free_ = e->next; next 335 third_party/tcmalloc/vendor/src/addressmap-inl.h e->next = c->blocks[block]; next 344 third_party/tcmalloc/vendor/src/addressmap-inl.h for (Entry** p = &c->blocks[BlockID(num)]; *p != NULL; p = &(*p)->next) { next 348 third_party/tcmalloc/vendor/src/addressmap-inl.h *p = e->next; // Remove e from linked-list next 349 third_party/tcmalloc/vendor/src/addressmap-inl.h e->next = free_; // Add e to free-list next 371 third_party/tcmalloc/vendor/src/addressmap-inl.h for (const Entry* e = c->blocks[block]; e != NULL; e = e->next) { next 411 third_party/tcmalloc/vendor/src/addressmap-inl.h for (const Cluster* c = hashtable_[h]; c != NULL; c = c->next) { next 413 third_party/tcmalloc/vendor/src/addressmap-inl.h for (Entry* e = c->blocks[b]; e != NULL; e = e->next) { next 78 third_party/tcmalloc/vendor/src/base/low_level_alloc.cc AllocList *next[kMaxLevel]; // actually has levels elements. next 127 third_party/tcmalloc/vendor/src/base/low_level_alloc.cc int max_fit = (size-OFFSETOF_MEMBER(AllocList, next)) / sizeof (AllocList *); next 143 third_party/tcmalloc/vendor/src/base/low_level_alloc.cc for (AllocList *n; (n = p->next[level]) != 0 && n < e; p = n) { next 147 third_party/tcmalloc/vendor/src/base/low_level_alloc.cc return (head->levels == 0) ? 0 : prev[0]->next[0]; next 160 third_party/tcmalloc/vendor/src/base/low_level_alloc.cc e->next[i] = prev[i]->next[i]; next 161 third_party/tcmalloc/vendor/src/base/low_level_alloc.cc prev[i]->next[i] = e; next 172 third_party/tcmalloc/vendor/src/base/low_level_alloc.cc for (int i = 0; i != e->levels && prev[i]->next[i] == e; i++) { next 173 third_party/tcmalloc/vendor/src/base/low_level_alloc.cc prev[i]->next[i] = e->next[i]; next 175 third_party/tcmalloc/vendor/src/base/low_level_alloc.cc while (head->levels > 0 && head->next[head->levels - 1] == 0) { next 279 third_party/tcmalloc/vendor/src/base/low_level_alloc.cc memset(arena->freelist.next, 0, sizeof (arena->freelist.next)); next 321 third_party/tcmalloc/vendor/src/base/low_level_alloc.cc while (arena->freelist.next[0] != 0) { next 322 third_party/tcmalloc/vendor/src/base/low_level_alloc.cc AllocList *region = arena->freelist.next[0]; next 324 third_party/tcmalloc/vendor/src/base/low_level_alloc.cc arena->freelist.next[0] = region->next[0]; next 363 third_party/tcmalloc/vendor/src/base/low_level_alloc.cc AllocList *next = prev->next[i]; next 364 third_party/tcmalloc/vendor/src/base/low_level_alloc.cc if (next != 0) { next 365 third_party/tcmalloc/vendor/src/base/low_level_alloc.cc RAW_CHECK(next->header.magic == Magic(kMagicUnallocated, &next->header), next 367 third_party/tcmalloc/vendor/src/base/low_level_alloc.cc RAW_CHECK(next->header.arena == arena, next 370 third_party/tcmalloc/vendor/src/base/low_level_alloc.cc RAW_CHECK(prev < next, "unordered freelist"); next 372 third_party/tcmalloc/vendor/src/base/low_level_alloc.cc reinterpret_cast<char *>(next), "malformed freelist"); next 375 third_party/tcmalloc/vendor/src/base/low_level_alloc.cc return next; next 380 third_party/tcmalloc/vendor/src/base/low_level_alloc.cc AllocList *n = a->next[0]; next 83 third_party/tcmalloc/vendor/src/central_freelist.cc void *next = SLL_Next(start); next 85 third_party/tcmalloc/vendor/src/central_freelist.cc start = next; next 293 third_party/tcmalloc/vendor/src/central_freelist.cc Span* span = nonempty_.next; next 169 third_party/tcmalloc/vendor/src/heap-profile-table.cc x = x->next; next 193 third_party/tcmalloc/vendor/src/heap-profile-table.cc for (Bucket* b = table[buck]; b != 0; b = b->next) { next 210 third_party/tcmalloc/vendor/src/heap-profile-table.cc b->next = table[buck]; next 337 third_party/tcmalloc/vendor/src/heap-profile-table.cc for (Bucket* x = alloc_table_[b]; x != 0; x = x->next) { next 345 third_party/tcmalloc/vendor/src/heap-profile-table.cc for (Bucket* x = mmap_table_[b]; x != 0; x = x->next) { next 210 third_party/tcmalloc/vendor/src/heap-profile-table.h Bucket* next; // Next entry in hash-table next 79 third_party/tcmalloc/vendor/src/page_heap.cc ASSERT(ll->next->location == Span::ON_NORMAL_FREELIST); next 80 third_party/tcmalloc/vendor/src/page_heap.cc return Carve(ll->next, n); next 85 third_party/tcmalloc/vendor/src/page_heap.cc ASSERT(ll->next->location == Span::ON_RETURNED_FREELIST); next 86 third_party/tcmalloc/vendor/src/page_heap.cc return Carve(ll->next, n); next 115 third_party/tcmalloc/vendor/src/page_heap.cc for (Span* span = large_.normal.next; next 117 third_party/tcmalloc/vendor/src/page_heap.cc span = span->next) { next 129 third_party/tcmalloc/vendor/src/page_heap.cc for (Span* span = large_.returned.next; next 131 third_party/tcmalloc/vendor/src/page_heap.cc span = span->next) { next 226 third_party/tcmalloc/vendor/src/page_heap.cc Span* next = GetDescriptor(p+n); next 227 third_party/tcmalloc/vendor/src/page_heap.cc if (next != NULL && next->location == span->location) { next 229 third_party/tcmalloc/vendor/src/page_heap.cc ASSERT(next->start == p+n); next 230 third_party/tcmalloc/vendor/src/page_heap.cc const Length len = next->length; next 231 third_party/tcmalloc/vendor/src/page_heap.cc RemoveFromFreeList(next); next 232 third_party/tcmalloc/vendor/src/page_heap.cc DeleteSpan(next); next 356 third_party/tcmalloc/vendor/src/page_heap.cc for (Span* s = large_.normal.next; s != &large_.normal; s = s->next) { next 360 third_party/tcmalloc/vendor/src/page_heap.cc for (Span* s = large_.returned.next; s != &large_.returned; s = s->next) { next 455 third_party/tcmalloc/vendor/src/page_heap.cc ASSERT(free_[0].normal.next == &free_[0].normal); next 456 third_party/tcmalloc/vendor/src/page_heap.cc ASSERT(free_[0].returned.next == &free_[0].returned); next 473 third_party/tcmalloc/vendor/src/page_heap.cc for (Span* s = list->next; s != list; s = s->next) { next 73 third_party/tcmalloc/vendor/src/span.cc list->next = list; next 78 third_party/tcmalloc/vendor/src/span.cc span->prev->next = span->next; next 79 third_party/tcmalloc/vendor/src/span.cc span->next->prev = span->prev; next 81 third_party/tcmalloc/vendor/src/span.cc span->next = NULL; next 86 third_party/tcmalloc/vendor/src/span.cc for (Span* s = list->next; s != list; s = s->next) { next 93 third_party/tcmalloc/vendor/src/span.cc ASSERT(span->next == NULL); next 95 third_party/tcmalloc/vendor/src/span.cc span->next = list->next; next 97 third_party/tcmalloc/vendor/src/span.cc list->next->prev = span; next 98 third_party/tcmalloc/vendor/src/span.cc list->next = span; next 47 third_party/tcmalloc/vendor/src/span.h Span* next; // Used when in link list next 90 third_party/tcmalloc/vendor/src/span.h return list->next == list; next 86 third_party/tcmalloc/vendor/src/stack_trace_table.cc b = b->next; next 103 third_party/tcmalloc/vendor/src/stack_trace_table.cc b->next = table_[idx]; next 135 third_party/tcmalloc/vendor/src/stack_trace_table.cc b = b->next; next 149 third_party/tcmalloc/vendor/src/stack_trace_table.cc Bucket* next = b->next; next 151 third_party/tcmalloc/vendor/src/stack_trace_table.cc b = next; next 71 third_party/tcmalloc/vendor/src/stack_trace_table.h Bucket* next; next 612 third_party/tcmalloc/vendor/src/tcmalloc.cc for (Span* s = sampled->next; s != sampled; s = s->next) { next 96 third_party/zlib/gzguts.h unsigned char *next; /* next output data to deliver or write */ next 339 third_party/zlib/gzlib.c state->next += n; next 214 third_party/zlib/gzread.c state->next = state->out; next 216 third_party/zlib/gzread.c memcpy(state->next + state->have, strm->next_in, strm->avail_in); next 272 third_party/zlib/gzread.c state->next = strm->next_out - state->have; next 273 third_party/zlib/gzread.c strm->adler = crc32(strm->adler, state->next, state->have); next 318 third_party/zlib/gzread.c state->next = state->out; next 343 third_party/zlib/gzread.c state->next += n; next 405 third_party/zlib/gzread.c memcpy(buf, state->next, n); next 406 third_party/zlib/gzread.c state->next += n; next 473 third_party/zlib/gzread.c return *(state->next)++; next 511 third_party/zlib/gzread.c state->next = state->out + (state->size << 1) - 1; next 512 third_party/zlib/gzread.c state->next[0] = c; next 524 third_party/zlib/gzread.c if (state->next == state->out) { next 529 third_party/zlib/gzread.c state->next = dest; next 532 third_party/zlib/gzread.c state->next--; next 533 third_party/zlib/gzread.c state->next[0] = c; next 584 third_party/zlib/gzread.c eol = memchr(state->next, '\n', n); next 586 third_party/zlib/gzread.c n = (unsigned)(eol - state->next) + 1; next 589 third_party/zlib/gzread.c memcpy(buf, state->next, n); next 591 third_party/zlib/gzread.c state->next += n; next 51 third_party/zlib/gzwrite.c state->next = strm->next_out; next 78 third_party/zlib/gzwrite.c have = (unsigned)(strm->next_out - state->next); next 79 third_party/zlib/gzwrite.c if (have && ((got = write(state->fd, state->next, have)) < 0 || next 88 third_party/zlib/gzwrite.c state->next = strm->next_out; next 84 third_party/zlib/infback.c static code *next; next 92 third_party/zlib/infback.c next = fixed; next 93 third_party/zlib/infback.c lenfix = next; next 95 third_party/zlib/infback.c inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work); next 100 third_party/zlib/infback.c distfix = next; next 102 third_party/zlib/infback.c inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work); next 123 third_party/zlib/infback.c next = strm->next_in; \ next 134 third_party/zlib/infback.c strm->next_in = next; \ next 152 third_party/zlib/infback.c have = in(in_desc, &next); \ next 154 third_party/zlib/infback.c next = Z_NULL; \ next 167 third_party/zlib/infback.c hold += (unsigned long)(*next++) << bits; \ next 249 third_party/zlib/infback.c unsigned char FAR *next; /* next input */ next 273 third_party/zlib/infback.c next = strm->next_in; next 274 third_party/zlib/infback.c have = next != Z_NULL ? strm->avail_in : 0; next 338 third_party/zlib/infback.c zmemcpy(put, next, copy); next 340 third_party/zlib/infback.c next += copy; next 376 third_party/zlib/infback.c state->next = state->codes; next 377 third_party/zlib/infback.c state->lencode = (code const FAR *)(state->next); next 379 third_party/zlib/infback.c ret = inflate_table(CODES, state->lens, 19, &(state->next), next 451 third_party/zlib/infback.c state->next = state->codes; next 452 third_party/zlib/infback.c state->lencode = (code const FAR *)(state->next); next 454 third_party/zlib/infback.c ret = inflate_table(LENS, state->lens, state->nlen, &(state->next), next 461 third_party/zlib/infback.c state->distcode = (code const FAR *)(state->next); next 464 third_party/zlib/infback.c &(state->next), &(state->distbits), state->work); next 618 third_party/zlib/infback.c strm->next_in = next; next 123 third_party/zlib/inflate.c state->lencode = state->distcode = state->next = state->codes; next 251 third_party/zlib/inflate.c static code *next; next 259 third_party/zlib/inflate.c next = fixed; next 260 third_party/zlib/inflate.c lenfix = next; next 262 third_party/zlib/inflate.c inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work); next 267 third_party/zlib/inflate.c distfix = next; next 269 third_party/zlib/inflate.c inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work); next 442 third_party/zlib/inflate.c next = strm->next_in; \ next 453 third_party/zlib/inflate.c strm->next_in = next; \ next 472 third_party/zlib/inflate.c hold += (unsigned long)(*next++) << bits; \ next 594 third_party/zlib/inflate.c unsigned char FAR *next; /* next input */ next 725 third_party/zlib/inflate.c zmemcpy(state->head->extra + len, next, next 730 third_party/zlib/inflate.c state->check = crc32(state->check, next, copy); next 732 third_party/zlib/inflate.c next += copy; next 744 third_party/zlib/inflate.c len = (unsigned)(next[copy++]); next 751 third_party/zlib/inflate.c state->check = crc32(state->check, next, copy); next 753 third_party/zlib/inflate.c next += copy; next 765 third_party/zlib/inflate.c len = (unsigned)(next[copy++]); next 772 third_party/zlib/inflate.c state->check = crc32(state->check, next, copy); next 774 third_party/zlib/inflate.c next += copy; next 870 third_party/zlib/inflate.c zmemcpy(put, next, copy); next 872 third_party/zlib/inflate.c next += copy; next 907 third_party/zlib/inflate.c state->next = state->codes; next 908 third_party/zlib/inflate.c state->lencode = (code const FAR *)(state->next); next 910 third_party/zlib/inflate.c ret = inflate_table(CODES, state->lens, 19, &(state->next), next 982 third_party/zlib/inflate.c state->next = state->codes; next 983 third_party/zlib/inflate.c state->lencode = (code const FAR *)(state->next); next 985 third_party/zlib/inflate.c ret = inflate_table(LENS, state->lens, state->nlen, &(state->next), next 992 third_party/zlib/inflate.c state->distcode = (code const FAR *)(state->next); next 995 third_party/zlib/inflate.c &(state->next), &(state->distbits), state->work); next 1328 third_party/zlib/inflate.c unsigned next; next 1331 third_party/zlib/inflate.c next = 0; next 1332 third_party/zlib/inflate.c while (next < len && got < 4) { next 1333 third_party/zlib/inflate.c if ((int)(buf[next]) == (got < 2 ? 0 : 0xff)) next 1335 third_party/zlib/inflate.c else if (buf[next]) next 1339 third_party/zlib/inflate.c next++; next 1342 third_party/zlib/inflate.c return next; next 1443 third_party/zlib/inflate.c copy->next = copy->codes + (state->next - state->codes); next 115 third_party/zlib/inflate.h code FAR *next; /* next available space in codes[] */ next 54 third_party/zlib/inftrees.c code FAR *next; /* next available space in table */ next 203 third_party/zlib/inftrees.c next = *table; /* current table to fill in */ next 238 third_party/zlib/inftrees.c next[(huff >> drop) + fill] = here; next 266 third_party/zlib/inftrees.c next += min; /* here min is 1 << curr */ next 288 third_party/zlib/inftrees.c (*table)[low].val = (unsigned short)(next - *table); next 307 third_party/zlib/inftrees.c next = *table; next 312 third_party/zlib/inftrees.c next[huff >> drop] = here; next 266 tools/gn/file_template.cc size_t next = str.find("{{", cur); next 269 tools/gn/file_template.cc if (next == std::string::npos) { next 273 tools/gn/file_template.cc } else if (next > cur) { next 275 tools/gn/file_template.cc Subrange(Subrange::LITERAL, str.substr(cur, next - cur))); next 279 tools/gn/file_template.cc if (str.compare(next, arraysize(kSource) - 1, kSource) == 0) { next 283 tools/gn/file_template.cc cur = next + arraysize(kSource) - 1; next 284 tools/gn/file_template.cc } else if (str.compare(next, arraysize(kSourceNamePart) - 1, next 289 tools/gn/file_template.cc cur = next + arraysize(kSourceNamePart) - 1; next 290 tools/gn/file_template.cc } else if (str.compare(next, arraysize(kSourceFilePart) - 1, next 295 tools/gn/file_template.cc cur = next + arraysize(kSourceFilePart) - 1; next 301 tools/gn/file_template.cc cur = next + 1; next 45 tools/perf/clear_system_cache/clear_system_cache_main.cc for (base::FilePath next = enumerator.Next(); !next.empty(); next 46 tools/perf/clear_system_cache/clear_system_cache_main.cc next = enumerator.Next()) { next 47 tools/perf/clear_system_cache/clear_system_cache_main.cc ClearCacheForFile(next); next 60 ui/app_list/app_list_item_list.cc AppListItem* next = next 62 ui/app_list/app_list_item_list.cc CHECK_NE(prev, next); next 65 ui/app_list/app_list_item_list.cc new_position = next->position().CreateBefore(); next 66 ui/app_list/app_list_item_list.cc } else if (!next) { next 72 ui/app_list/app_list_item_list.cc if (prev->position().Equals(next->position())) next 74 ui/app_list/app_list_item_list.cc new_position = prev->position().CreateBetween(next->position()); next 80 ui/app_list/app_list_item_list.cc << " Next: " << (next ? next->position().ToDebugString() : "(none)") next 40 ui/base/gtk/gtk_expanded_container_unittest.cc for (GList* child = children; child; child = child->next) { next 166 ui/base/gtk/gtk_floating_container.cc children = children->next; next 185 ui/base/gtk/gtk_floating_container.cc children = children->next; next 239 ui/base/gtk/gtk_floating_container.cc children = children->next; next 603 ui/compositor/layer.cc for (SkRegion::Iterator iter(damaged_region_); !iter.done(); iter.next()) { next 141 ui/gfx/break_list.h const typename BreakList<T>::const_iterator next = i + 1; next 142 ui/gfx/break_list.h return Range(i->first, next == breaks_.end() ? max_ : next->first); next 235 ui/gfx/gtk_preserve_window.cc children = children->next; next 18 ui/gfx/path_win.cc for (SkRegion::Iterator i(region); !i.done(); i.next()) { next 18 ui/gfx/path_x11.cc for (SkRegion::Iterator i(region); !i.done(); i.next()) { next 28 ui/gfx/render_text_pango.cc for (GSList* cur = head; cur != item; cur = cur->next) { next 127 ui/gfx/render_text_pango.cc for (GSList* it = current_line_->runs; it; it = it->next) { next 176 ui/gfx/render_text_pango.cc run->next : GSListPrevious(current_line_->runs, run); next 425 ui/gfx/render_text_pango.cc for (GSList* it = current_line_->runs; it; it = it->next) { next 506 ui/gfx/render_text_pango.cc run = run->next; next 914 ui/gfx/render_text_unittest.cc size_t next = render_text->IndexOfAdjacentGrapheme(cases[i].index, next 916 ui/gfx/render_text_unittest.cc EXPECT_EQ(cases[i].expected_next, next); next 917 ui/gfx/render_text_unittest.cc EXPECT_TRUE(render_text->IsCursorablePosition(next)); next 798 ui/gfx/text_elider.cc char_iterator.next(); next 222 ui/views/controls/menu/menu_controller.cc View* next = GetFirstFocusableView(new_parent, index, forward); next 223 ui/views/controls/menu/menu_controller.cc if (next) next 224 ui/views/controls/menu/menu_controller.cc return next; next 680 ui/views/controls/textfield/textfield_model.cc size_t next = next 682 ui/views/controls/textfield/textfield_model.cc if (next == model.caret_pos()) next 685 ui/views/controls/textfield/textfield_model.cc render_text_->SelectRange(gfx::Range(next, model.caret_pos())); next 61 ui/views/controls/tree/tree_view_unittest.cc void IncrementSelection(bool next); next 107 ui/views/controls/tree/tree_view_unittest.cc void TreeViewTest::IncrementSelection(bool next) { next 108 ui/views/controls/tree/tree_view_unittest.cc tree_.IncrementSelection(next ? TreeView::INCREMENT_NEXT : next 90 ui/views/focus/focus_manager.cc bool next = (key_code == ui::VKEY_RIGHT || key_code == ui::VKEY_DOWN); next 98 ui/views/focus/focus_manager.cc index += next ? 1 : -1; next 408 ui/views/layout/grid_layout.cc for (int last = first, next = va_arg(marker, int); next != -1; next 409 ui/views/layout/grid_layout.cc next = va_arg(marker, int)) { next 410 ui/views/layout/grid_layout.cc DCHECK(next >= 0 && next < num_columns()); next 411 ui/views/layout/grid_layout.cc columns_[last]->same_size_column_ = next; next 412 ui/views/layout/grid_layout.cc last = next; next 68 ui/views/view_unittest.cc int next = parent->GetIndexOf(v) + 1; next 69 ui/views/view_unittest.cc if (next != parent->child_count()) next 70 ui/views/view_unittest.cc return FirstView(parent->child_at(next)); next 92 ui/views/view_unittest.cc size_t next = index + 1; next 93 ui/views/view_unittest.cc if (next < children.size()) next 94 ui/views/view_unittest.cc return FirstLayer(children[next]); next 325 ui/wm/core/focus_controller.cc aura::Window* next) { next 341 ui/wm/core/focus_controller.cc SetFocusedWindow(rules_->GetFocusableWindow(next)); next 103 ui/wm/core/focus_controller.h aura::Window* next); next 50 webkit/browser/fileapi/local_file_util.cc base::FilePath next = file_enum_.Next(); next 52 webkit/browser/fileapi/local_file_util.cc while (!next.empty() && base::IsLink(next)) next 53 webkit/browser/fileapi/local_file_util.cc next = file_enum_.Next(); next 54 webkit/browser/fileapi/local_file_util.cc if (next.empty()) next 55 webkit/browser/fileapi/local_file_util.cc return next; next 59 webkit/browser/fileapi/local_file_util.cc platform_root_path_.AppendRelativePath(next, &path); next 669 webkit/browser/fileapi/sandbox_directory_database.cc bool SandboxDirectoryDatabase::GetNextInteger(int64* next) { next 672 webkit/browser/fileapi/sandbox_directory_database.cc DCHECK(next); next 689 webkit/browser/fileapi/sandbox_directory_database.cc *next = temp; next 700 webkit/browser/fileapi/sandbox_directory_database.cc return GetNextInteger(next); next 91 webkit/browser/fileapi/sandbox_directory_database.h bool GetNextInteger(int64* next); next 496 webkit/browser/fileapi/sandbox_directory_database_unittest.cc int64 next = -1; next 497 webkit/browser/fileapi/sandbox_directory_database_unittest.cc EXPECT_TRUE(db()->GetNextInteger(&next)); next 498 webkit/browser/fileapi/sandbox_directory_database_unittest.cc EXPECT_EQ(0, next); next 499 webkit/browser/fileapi/sandbox_directory_database_unittest.cc EXPECT_TRUE(db()->GetNextInteger(&next)); next 500 webkit/browser/fileapi/sandbox_directory_database_unittest.cc EXPECT_EQ(1, next); next 502 webkit/browser/fileapi/sandbox_directory_database_unittest.cc EXPECT_TRUE(db()->GetNextInteger(&next)); next 503 webkit/browser/fileapi/sandbox_directory_database_unittest.cc EXPECT_EQ(2, next); next 504 webkit/browser/fileapi/sandbox_directory_database_unittest.cc EXPECT_TRUE(db()->GetNextInteger(&next)); next 505 webkit/browser/fileapi/sandbox_directory_database_unittest.cc EXPECT_EQ(3, next); next 507 webkit/browser/fileapi/sandbox_directory_database_unittest.cc EXPECT_TRUE(db()->GetNextInteger(&next)); next 508 webkit/browser/fileapi/sandbox_directory_database_unittest.cc EXPECT_EQ(4, next); next 514 webkit/browser/fileapi/sandbox_directory_database_unittest.cc int64 next = -1; next 515 webkit/browser/fileapi/sandbox_directory_database_unittest.cc EXPECT_TRUE(db()->GetNextInteger(&next)); next 516 webkit/browser/fileapi/sandbox_directory_database_unittest.cc EXPECT_EQ(0, next); next 314 webkit/renderer/compositor_bindings/web_layer_impl.cc region_rects.next()) next 321 webkit/renderer/compositor_bindings/web_layer_impl.cc region_rects.next()) { next 339 webkit/renderer/compositor_bindings/web_layer_impl.cc region_rects.next()) next 346 webkit/renderer/compositor_bindings/web_layer_impl.cc region_rects.next()) {