| /third_party/e2fsprogs/lib/ext2fs/ |
| D | blkmap64_ba.c | 219 int mark_count = 0; in ba_test_clear_bmap_extent() local
234 mark_count = 8 - start_bit; in ba_test_clear_bmap_extent()
236 mark_count = (int)len; in ba_test_clear_bmap_extent()
241 for (i = mark_count; i > 0; i--, mark_bit--) in ba_test_clear_bmap_extent()
254 len_bit = (len - mark_count) % 8; in ba_test_clear_bmap_extent()
255 len_byte = (len - mark_count) >> 3; in ba_test_clear_bmap_extent()
|
| D | gen_bitmap.c | 474 int mark_count = 0; in ext2fs_test_clear_generic_bitmap_range() local
488 mark_count = 8 - start_bit; in ext2fs_test_clear_generic_bitmap_range()
490 mark_count = (int)len; in ext2fs_test_clear_generic_bitmap_range()
495 for (i = mark_count; i > 0; i--, mark_bit--) in ext2fs_test_clear_generic_bitmap_range()
508 len_bit = (len - mark_count) % 8; in ext2fs_test_clear_generic_bitmap_range()
509 len_byte = (len - mark_count) >> 3; in ext2fs_test_clear_generic_bitmap_range()
|
| D | gen_bitmap64.c | 196 if (stats->mark_count) { in ext2fs_print_bmap_statistics()
198 stats->mark_count) * 100; in ext2fs_print_bmap_statistics()
200 stats->mark_count) * 100; in ext2fs_print_bmap_statistics()
223 stats->mark_count, stats->unmark_count); in ext2fs_print_bmap_statistics()
470 bitmap->stats.mark_count++; in ext2fs_mark_generic_bmap()
|
| D | bmap64.h | 19 unsigned long mark_count; member
|
| D | blkmap64_rb.c | 940 mark_all = bitmap->stats.mark_count + bitmap->stats.mark_ext_count; in rb_print_stats()
|
| /third_party/skia/fuzz/ |
| D | FuzzSkParagraph.cpp | 148 uint8_t mark_count; in AddZalgoText() local
149 fuzz->next(&mark_count); in AddZalgoText()
150 for (int i = 0; i < mark_count; i++) { in AddZalgoText()
|
| /third_party/boost/libs/regex/doc/ |
| D | basic_regex.qbk | 148 ``[link boost_regex.basic_regex.mark_count size_type mark_count]``()const;
316 [[`mark_count()`][The number of marked sub-expressions within the expression.]]
340 [[`mark_count()`][The number of marked sub-expressions within the expression.]]
363 [[`mark_count()`][The number of marked sub-expressions within the expression.]]
393 [[`mark_count()`][The number of marked sub-expressions within the expression.]]
416 [[`mark_count()`][The number of marked sub-expressions within the expression.]]
450 /n/ must be in within the range `0 <= n < mark_count()`.
486 [#boost_regex.basic_regex.mark_count]
488 size_type mark_count() const;
531 [[`mark_count()`][The number of marked sub-expressions within the expression.]]
|
| D | regex_match.qbk | 85 [[`m.size()`][`1 + e.mark_count()`]]
|
| D | regex_search.qbk | 83 [[`m.size()`][`1 + e.mark_count()`]]
|
| D | regex_iterator.qbk | 129 [[`(*it).size()`][`1 + re.mark_count()`]]
|
| D | history.qbk | 62 * [*Breaking change:] corrected behavior of `basic_regex<>::mark_count()` to match existing documen…
|
| /third_party/libsnd/src/ |
| D | aiff.c | 402 uint32_t chunk_size = 0, FORMsize, SSNDsize, bytesread, mark_count = 0 ; in aiff_read_header() local
793 mark_count = n ; in aiff_read_header()
794 psf_log_printf (psf, " Count : %u\n", mark_count) ; in aiff_read_header()
799 paiff->markstr = calloc (mark_count, sizeof (MARK_ID_POS)) ; in aiff_read_header()
803 …if (mark_count > 2500) /* 2500 is close to the largest number of cues possible because of block si… in aiff_read_header()
813 if ((psf->cues = psf_cues_alloc (mark_count)) == NULL) in aiff_read_header()
816 for (n = 0 ; n < mark_count && bytesread < chunk_size ; n++) in aiff_read_header()
931 …s [ji].start = marker_to_position (paiff->markstr, psf->instrument->loops [ji].start, mark_count) ; in aiff_read_header()
932 …loops [ji].end = marker_to_position (paiff->markstr, psf->instrument->loops [ji].end, mark_count) ; in aiff_read_header()
|
| /third_party/boost/boost/regex/v4/ |
| D | perl_matcher_common.hpp | 226 …h_nosubs) ? 1u : static_cast<typename results_type::size_type>(1u + re.mark_count()), search_base,… in match_imp()
288 …ch_nosubs) ? 1u : static_cast<typename results_type::size_type>(1u + re.mark_count()), base, last); in find_imp()
307 …h_nosubs) ? 1u : static_cast<typename results_type::size_type>(1u + re.mark_count()), search_base,… in find_imp()
313 …m_result.set_size(static_cast<typename results_type::size_type>(1u + re.mark_count()), base, last); in find_imp()
|
| D | regex_split.hpp | 124 if(max_split && (last != s.end()) && (e.mark_count() == 0)) in regex_split()
|
| D | basic_regex.hpp | 283 size_type BOOST_REGEX_CALL mark_count()const in mark_count() function in boost::BOOST_REGEX_DETAIL_NS::basic_regex_implementation
545 size_type BOOST_REGEX_CALL mark_count()const in mark_count() function in boost::basic_regex
547 return (m_pimpl.get() ? m_pimpl->mark_count() : 0); in mark_count()
|
| /third_party/boost/libs/regex/src/ |
| D | posix_api.cpp | 129 expression->re_nsub = static_cast<c_regex_type*>(expression->guts)->mark_count(); in regcompA()
|
| D | wide_posix_api.cpp | 139 expression->re_nsub = static_cast<wc_regex_type*>(expression->guts)->mark_count(); in regcompW()
|
| D | cregex.cpp | 518 return pdata->e.mark_count(); in Marks()
|
| /third_party/boost/boost/xpressive/ |
| D | basic_regex.hpp | 139 std::size_t mark_count() const in mark_count() function
|
| /third_party/boost/libs/regex/test/regress/ |
| D | test_regex_search.hpp | 519 for(std::size_t i = 0; i < r.mark_count(); ++i) in test()
|
| /third_party/boost/libs/xpressive/test/ |
| D | regress.ipp | 326 std::vector<int> subs(rx.mark_count() + 1, 0);
|
| /third_party/boost/boost/regex/ |
| D | concepts.hpp | 417 typename Regex::size_type i = ce.mark_count(); in constraints()
|