Searched refs:search_start (Results 1 - 14 of 14) sorted by relevance

/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/ffmpeg-2.3.4/libavcodec/
H A Dflac_parser.c205 int search_start)
213 size = find_headers_search_validate(fpc, search_start + i);
221 size = find_headers_search_validate(fpc, search_start + i + j);
228 static int find_new_headers(FLACParseContext *fpc, int search_start) argument
237 read_len = search_end - search_start + 1;
238 buf = flac_fifo_read(fpc, search_start, &read_len);
239 size = find_headers_search(fpc, buf, read_len, search_start);
240 search_start += read_len - 1;
243 if (search_start != search_end) {
247 read_len = search_end - search_start
204 find_headers_search(FLACParseContext *fpc, uint8_t *buf, int buf_size, int search_start) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libav-0.8.8/libavcodec/
H A Dflac_parser.c201 int search_start)
209 size = find_headers_search_validate(fpc, search_start + i);
217 size = find_headers_search_validate(fpc, search_start + i + j);
224 static int find_new_headers(FLACParseContext *fpc, int search_start) argument
233 read_len = search_end - search_start + 1;
234 buf = flac_fifo_read(fpc, search_start, &read_len);
235 size = find_headers_search(fpc, buf, read_len, search_start);
236 search_start += read_len - 1;
239 if (search_start != search_end) {
243 read_len = search_end - search_start
200 find_headers_search(FLACParseContext *fpc, uint8_t *buf, int buf_size, int search_start) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/reiserfs/
H A Dbitmap.c643 //hint->search_start = hint->beg;
653 hint->search_start =
678 hint->search_start = hash;
706 hint->search_start = hash;
723 * structure supplied; then we rely on supplied search_start */
733 hint->search_start = bh->b_blocknr;
744 hint->search_start = t;
775 hint->search_start =
780 hint->search_start =
797 hint->search_start
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/btrfs/
H A Dfree-space-cache.c426 u64 search_start, search_bytes; local
433 search_start = *offset;
435 ret = search_bitmap(block_group, bitmap_info, &search_start,
437 BUG_ON(ret < 0 || search_start != *offset);
482 search_start = *offset;
484 ret = search_bitmap(block_group, bitmap_info, &search_start,
486 if (ret < 0 || search_start != *offset)
994 u64 search_start = cluster->window_start; local
1008 * search_start is the beginning of the bitmap, but at some point it may
1014 offset_to_bitmap(block_group, search_start),
[all...]
H A Ddelayed-ref.h178 struct list_head *cluster, u64 search_start);
H A Dfile.c285 u64 search_start = start; local
306 search_start, -1);
309 if (ret > 0 && path->slots[0] > 0 && search_start == start) {
353 extent_end = search_start;
356 if (extent_end <= search_start) {
361 search_start = max(key.offset, start);
435 search_start = extent_end;
H A Dextent-tree.c546 u64 search_start, u64 search_hint, int owner)
550 u64 last = max(search_hint, search_start);
580 last = search_start;
585 last = search_start;
3690 static u64 first_logical_byte(struct btrfs_root *root, u64 search_start) argument
3695 cache = btrfs_lookup_first_block_group(root->fs_info, search_start);
4380 * Any available blocks before search_start are skipped.
4385 u64 search_start, u64 search_end,
4437 search_start = max(search_start, first_logical_byt
545 btrfs_find_block_group(struct btrfs_root *root, u64 search_start, u64 search_hint, int owner) argument
4382 find_free_extent(struct btrfs_trans_handle *trans, struct btrfs_root *orig_root, u64 num_bytes, u64 empty_size, u64 search_start, u64 search_end, u64 hint_byte, struct btrfs_key *ins, int data) argument
4849 u64 search_start = 0; local
[all...]
H A Droot-tree.c25 * search forward for a root, starting with objectid 'search_start'
30 int btrfs_search_root(struct btrfs_root *root, u64 search_start, argument
38 search_key.objectid = search_start;
H A Dvolumes.c741 u64 search_start = 0; local
758 search_start = max((u64)1024 * 1024, search_start);
761 search_start = max(root->fs_info->alloc_start, search_start);
764 key.offset = search_start;
789 if (search_start >= search_end) {
793 *start = search_start;
797 *start = last_byte > search_start ?
798 last_byte : search_start;
[all...]
H A Dctree.c381 * search_start -- an allocation hint for the new block
392 u64 search_start, u64 empty_size)
427 level, search_start, empty_size);
515 u64 search_start; local
537 search_start = buf->start & ~((u64)(1024 * 1024 * 1024) - 1);
544 parent_slot, cow_ret, search_start, 0);
606 u64 search_start = *last_ret; local
693 if (search_start == 0)
694 search_start = last_block;
699 &cur, search_start,
387 __btrfs_cow_block(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct extent_buffer *buf, struct extent_buffer *parent, int parent_slot, struct extent_buffer **cow_ret, u64 search_start, u64 empty_size) argument
[all...]
H A Drelocation.c178 u64 search_start; member in struct:reloc_control
3457 if (rc->search_start >= last) {
3462 key.objectid = rc->search_start;
3488 key.objectid + key.offset <= rc->search_start) {
3499 rc->search_start = end + 1;
3501 rc->search_start = key.objectid + key.offset;
3565 rc->search_start = rc->block_group->key.objectid;
3680 rc->search_start = key.objectid;
H A Dctree.h2012 u64 search_start, u64 search_hint, int owner);
2236 int btrfs_search_root(struct btrfs_root *root, u64 search_start,
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/ocfs2/
H A Dreservations.c401 * inside the reservations tree (search_start, search_len). The range
407 * This function searches the bitmap range starting at search_start
417 unsigned int search_start,
427 wanted, search_start, search_len, resmap->m_bitmap_len);
431 start = search_start;
435 if (offset >= (search_start + search_len))
415 ocfs2_resmap_find_free_bits(struct ocfs2_reservation_map *resmap, unsigned int wanted, unsigned int search_start, unsigned int search_len, unsigned int *rstart, unsigned int *rlen) argument
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/include/linux/
H A Dreiserfs_fs.h2232 struct treepath *path; /* search path, used by allocator to deternine search_start by
2237 b_blocknr_t search_start; /* a field used to transfer search start value (block number) member in struct:__reiserfs_blocknr_hint

Completed in 214 milliseconds