/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/ffmpeg-2.3.4/libavcodec/ |
H A D | dpx_parser.c | 44 int next = END_NOT_FOUND; local 51 next = 0; 92 next = i - 3; 99 if (ff_combine_frame(&d->pc, next, &buf, &buf_size) < 0) 106 return next;
|
H A D | latm_parser.c | 40 * @return the position of the first byte of the next frame, or -1 89 int next; local 92 next = buf_size; 94 next = latm_find_frame_end(s1, buf, buf_size); 96 if (ff_combine_frame(pc, next, &buf, &buf_size) < 0) { 104 return next;
|
H A D | parser.c | 36 return p->next; 44 parser->next = av_first_parser; 45 } while (parser->next != avpriv_atomic_ptr_cas((void * volatile *)&av_first_parser, parser->next, parser)); 57 for (parser = av_first_parser; parser != NULL; parser = parser->next) { 167 /* offset of the next frame */ 220 int ff_combine_frame(ParseContext *pc, int next, argument 224 av_dlog(NULL, "overread %d, state:%X next:%d index:%d o_index:%d\n", 225 pc->overread, pc->state, next, pc->index, pc->overread_index); 235 if (!*buf_size && next [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libav-0.8.8/libavcodec/ |
H A D | latm_parser.c | 40 * @return the position of the first byte of the next frame, or -1 90 int next; local 93 next = buf_size; 95 next = latm_find_frame_end(s1, buf, buf_size); 97 if (ff_combine_frame(pc, next, &buf, &buf_size) < 0) { 105 return next;
|
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/staging/tidspbridge/rmgr/ |
H A D | rmm.c | 26 * the alignment specification; if this is not possible then the next 59 struct rmm_header *next; /* form a free memory link list */ member in struct:rmm_header 225 hptr->next = NULL; 264 struct rmm_header *next; local 283 hptr = next = target->free_list[i]; 284 while (next) { 285 hptr = next; 286 next = hptr->next; 393 head = head->next; 428 struct rmm_header *next; local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/xz/src/liblzma/lz/ |
H A D | lz_encoder.c | 32 lzma_next_coder next; member in struct:lzma_coder_s 73 /// Otherwise we call the next filter in the chain to process in[] and 93 if (coder->next.code == NULL) { 102 ret = coder->next.code(coder->next.coder, allocator, 297 // Round dictionary size up to the next 2^n - 1 so it can 466 lzma_next_end(&coder->next, allocator); 493 &coder->next, allocator, reversed_filters + 1); 498 lzma_lz_encoder_init(lzma_next_coder *next, lzma_allocator *allocator, argument 510 if (next [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/src/tools/misc/xz/src/liblzma/lz/ |
H A D | lz_encoder.c | 32 lzma_next_coder next; member in struct:lzma_coder_s 73 /// Otherwise we call the next filter in the chain to process in[] and 93 if (coder->next.code == NULL) { 102 ret = coder->next.code(coder->next.coder, allocator, 297 // Round dictionary size up to the next 2^n - 1 so it can 466 lzma_next_end(&coder->next, allocator); 493 &coder->next, allocator, reversed_filters + 1); 498 lzma_lz_encoder_init(lzma_next_coder *next, lzma_allocator *allocator, argument 510 if (next [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/ffmpeg-2.3.4/libavutil/ |
H A D | tree.c | 40 int (*cmp)(void *key, const void *b), void *next[2]) 45 if (next) 46 next[v >> 31] = t->elem; 47 return av_tree_find(t->child[(v >> 31) ^ 1], key, cmp, next); 49 if (next) { 50 av_tree_find(t->child[0], key, cmp, next); 51 av_tree_find(t->child[1], key, cmp, next); 60 int (*cmp)(void *key, const void *b), AVTreeNode **next) 67 if (*next) 76 *next 39 av_tree_find(const AVTreeNode *t, void *key, int (*cmp)(void *key, const void *b), void *next[2]) argument 59 av_tree_insert(AVTreeNode **tp, void *key, int (*cmp)(void *key, const void *b), AVTreeNode **next) argument [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/net/rose/ |
H A D | rose_route.c | 71 rose_node = rose_node->next; 85 rose_neigh = rose_neigh->next; 130 rose_neigh->next = rose_neigh_list; 148 rose_tmpn = rose_tmpn->next; 170 rose_node->next = NULL; 172 rose_tmpp->next = rose_node; 173 rose_node->next = NULL; 177 rose_node->next = rose_node_list; 180 rose_tmpp->next = rose_node; 181 rose_node->next [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libav-0.8.8/libavutil/ |
H A D | tree.c | 33 int (*cmp)(void *key, const void *b), void *next[2]) 38 if (next) next[v >> 31] = t->elem; 39 return av_tree_find(t->child[(v >> 31) ^ 1], key, cmp, next); 41 if (next) { 42 av_tree_find(t->child[0], key, cmp, next); 43 av_tree_find(t->child[1], key, cmp, next); 52 int (*cmp)(void *key, const void *b), AVTreeNode **next) 59 if (*next) 68 *next 32 av_tree_find(const AVTreeNode *t, void *key, int (*cmp)(void *key, const void *b), void *next[2]) argument 51 av_tree_insert(AVTreeNode **tp, void *key, int (*cmp)(void *key, const void *b), AVTreeNode **next) argument [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/zlib-1.2.8/test/ |
H A D | infcover.c | 51 allocation routines on the next zlib initialization 59 struct mem_item *next; /* pointer to next item in list, or NULL */ member in struct:mem_item 99 item->next = zone->first; 114 struct mem_item *item, *next; local 123 /* point next to the item that matches ptr, or NULL if not found -- remove 125 next = zone->first; 126 if (next) { 127 if (next->ptr == ptr) 128 zone->first = next 203 struct mem_item *item, *next; local 248 unsigned next, val; local 449 static unsigned int next = 0; local 622 code *next, table[ENOUGH_DISTS]; local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/gettext-0.17/gnulib-local/lib/libxml/ |
H A D | dict.c | 42 struct _xmlDictEntry *next; member in struct:_xmlDictEntry 51 xmlDictStringsPtr next; member in struct:_xmlDictStrings 138 pool = pool->next; 155 pool->next = dict->strings; 194 pool = pool->next; 211 pool->next = dict->strings; 407 xmlDictEntryPtr iter, next; local 444 dict->dict[key].next = NULL; 451 iter = olddict[i].next; 453 next 499 xmlDictEntryPtr next; local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/zlib-1.2.7/test/ |
H A D | infcover.c | 51 allocation routines on the next zlib initialization 59 struct mem_item *next; /* pointer to next item in list, or NULL */ member in struct:mem_item 99 item->next = zone->first; 114 struct mem_item *item, *next; local 123 /* point next to the item that matches ptr, or NULL if not found -- remove 125 next = zone->first; 126 if (next) { 127 if (next->ptr == ptr) 128 zone->first = next 203 struct mem_item *item, *next; local 248 unsigned next, val; local 449 static unsigned int next = 0; local 622 code *next, table[ENOUGH_DISTS]; local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/gettext-0.17/gettext-tools/gnulib-lib/libxml/ |
H A D | dict.c | 42 struct _xmlDictEntry *next; member in struct:_xmlDictEntry 51 xmlDictStringsPtr next; member in struct:_xmlDictStrings 138 pool = pool->next; 155 pool->next = dict->strings; 194 pool = pool->next; 211 pool->next = dict->strings; 407 xmlDictEntryPtr iter, next; local 444 dict->dict[key].next = NULL; 451 iter = olddict[i].next; 453 next 499 xmlDictEntryPtr next; local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/samba-3.0.25b/source/smbd/ |
H A D | files.c | 142 files_struct *fsp, *next; local 144 for (fsp=Files;fsp;fsp=next) { 145 next = fsp->next; 158 files_struct *fsp, *next; local 160 for (fsp=Files;fsp;fsp=next) { 161 next = fsp->next; 216 files_struct *fsp, *next; local 218 for (fsp=Files;fsp;fsp=next) { 412 files_struct *fsp, *next; local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/sound/isa/gus/ |
H A D | gus_mem.c | 55 nblock->next = pblock; 60 nblock->prev->next = nblock; 64 pblock = pblock->next; 66 nblock->next = NULL; 72 alloc->last->next = nblock; 86 alloc->first = block->next; 87 if (block->next) 88 block->next->prev = NULL; 90 block->prev->next = block->next; [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/netatalk-2.2.5/libatalk/acl/ |
H A D | cache.c | 37 struct cacheduser *next; member in struct:cacheduser 70 } while ((entry = entry->next) != NULL); 91 } while ((entry = entry->next) != NULL); 165 cacheduser->next = NULL; 175 cacheduser->next = namecache[hash]; 225 entry->prev->next = entry->next; 226 if (entry->next) 228 entry->next->prev = entry->prev; 231 if ((namecache[hash] = entry->next) ! [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/net/core/ |
H A D | dst.c | 70 struct dst_entry *dst, *next, head; local 78 next = dst_busy_list; 81 while ((dst = next) != NULL) { 82 next = dst->next; 83 prefetch(&next->next); 86 last->next = dst; 107 dst->next = next; [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/xz/src/liblzma/common/ |
H A D | stream_decoder.c | 355 // Prepare to decode the next Stream. 404 lzma_stream_decoder_init(lzma_next_coder *next, lzma_allocator *allocator, argument 407 lzma_next_coder_init(&lzma_stream_decoder_init, next, allocator); 415 if (next->coder == NULL) { 416 next->coder = lzma_alloc(sizeof(lzma_coder), allocator); 417 if (next->coder == NULL) 420 next->code = &stream_decode; 421 next->end = &stream_decoder_end; 422 next->get_check = &stream_decoder_get_check; 423 next [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/src/tools/misc/xz/src/liblzma/common/ |
H A D | stream_decoder.c | 355 // Prepare to decode the next Stream. 404 lzma_stream_decoder_init(lzma_next_coder *next, lzma_allocator *allocator, argument 407 lzma_next_coder_init(&lzma_stream_decoder_init, next, allocator); 415 if (next->coder == NULL) { 416 next->coder = lzma_alloc(sizeof(lzma_coder), allocator); 417 if (next->coder == NULL) 420 next->code = &stream_decode; 421 next->end = &stream_decoder_end; 422 next->get_check = &stream_decoder_get_check; 423 next [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/zebra/lib/ |
H A D | routemap.c | 52 struct route_map_rule *next; 100 map->next = NULL; 103 list->tail->next = map; 130 if (map->next) 131 map->next->prev = map->prev; 136 map->prev->next = map->next; 138 list->head = map->next; 157 for (map = route_map_master.head; map; map = map->next) 211 for (map = route_map_master.head; map; map = map->next) 51 struct route_map_rule *next; member in struct:route_map_rule 473 struct route_map_rule *next; local 559 struct route_map_rule *next; local 739 struct route_map_index *next; local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/autofs4/ |
H A D | expire.c | 94 * Calculate next entry in top down tree traversal. 99 struct list_head *next = p->d_subdirs.next; local 101 if (next == &p->d_subdirs) { 105 next = p->d_u.d_child.next; 106 if (next != &p->d_parent->d_subdirs) 111 return list_entry(next, struct dentry, d_u.d_child); 306 struct list_head *next; local 319 next [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/samba-3.0.25b/source/libsmb/ |
H A D | libsmb_cache.c | 43 struct smbc_server_cache *next, *prev; member in struct:smbc_server_cache 118 for (srv=((struct smbc_server_cache *)context->server_cache);srv;srv=srv->next) { 198 for (srv=((struct smbc_server_cache *)context->server_cache);srv;srv=srv->next) { 223 struct smbc_server_cache * next; local 227 next = (srv ? srv->next :NULL); 229 srv = next, next = (srv ? srv->next : NULL)) {
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/l2tpd-0.69/ |
H A D | scheduler.c | 48 see how long we should set the next timer 68 events = events->next; 143 p = p->next; 147 q->next = 149 q = q->next; 160 q->next = p; 200 q->next = p->next; 204 events = events->next; 210 p = p->next; [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/ffmpeg-2.3.4/libavfilter/ |
H A D | vf_yadif.c | 58 int temporal_diff2 =(FFABS(next[mrefs] - c) + FFABS(next[prefs] - e) )>>1; \ 88 next++; \ 100 uint8_t *next = next1; local 103 uint8_t *next2 = parity ? cur : next; 119 uint8_t *next = next1; local 122 uint8_t *next2 = parity ? cur : next; 131 next = (uint8_t*)next1 + w - (MAX_ALIGN-1); 133 next2 = (uint8_t*)(parity ? cur : next); 148 uint16_t *next local 164 uint16_t *next = next1; local 202 uint8_t *next = &s->next->data[td->plane][y * refs]; local 391 AVFrame *next = av_frame_clone(yadif->next); local [all...] |