Searched refs:fragments (Results 1 - 25 of 63) sorted by relevance

123

/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/squashfs/
H A Dfragment.c25 * This file implements code to handle compressed fragments (tail-end packed
74 u64 fragment_table_start, unsigned int fragments)
76 unsigned int length = SQUASHFS_FRAGMENT_INDEX_BYTES(fragments);
73 squashfs_read_fragment_index_table(struct super_block *sb, u64 fragment_table_start, unsigned int fragments) argument
H A Dsuper.c85 unsigned int fragments; local
187 TRACE("Number of fragments %d\n", le32_to_cpu(sblk->fragments));
230 fragments = le32_to_cpu(sblk->fragments);
231 if (fragments == 0)
243 le64_to_cpu(sblk->fragment_table_start), fragments);
H A Dsquashfs_fs.h252 __le32 fragments; member in struct:squashfs_super_block
/netgear-R7000-V1.0.7.12_1.2.5/src/router/squashfs-4.2/
H A Dunsquash-2.c45 int res, i, indexes = SQUASHFS_FRAGMENT_INDEXES_2(sBlk.s.fragments);
48 TRACE("read_fragment_table: %d fragments, reading %d fragment indexes "
49 "from 0x%llx\n", sBlk.s.fragments, indexes,
52 if(sBlk.s.fragments == 0)
55 fragment_table = malloc(sBlk.s.fragments *
65 SQUASHFS_FRAGMENT_INDEX_BYTES_2(sBlk.s.fragments),
76 SQUASHFS_FRAGMENT_INDEX_BYTES_2(sBlk.s.fragments),
100 for(i = 0; i < sBlk.s.fragments; i++) {
H A Dunsquash-3.c32 int res, i, indexes = SQUASHFS_FRAGMENT_INDEXES_3(sBlk.s.fragments);
35 TRACE("read_fragment_table: %d fragments, reading %d fragment indexes "
36 "from 0x%llx\n", sBlk.s.fragments, indexes,
39 if(sBlk.s.fragments == 0)
42 fragment_table = malloc(sBlk.s.fragments *
52 SQUASHFS_FRAGMENT_INDEX_BYTES_3(sBlk.s.fragments),
63 SQUASHFS_FRAGMENT_INDEX_BYTES_3(sBlk.s.fragments),
87 for(i = 0; i < sBlk.s.fragments; i++) {
H A Dunsquash-4.c34 int res, i, indexes = SQUASHFS_FRAGMENT_INDEXES(sBlk.s.fragments);
37 TRACE("read_fragment_table: %d fragments, reading %d fragment indexes "
38 "from 0x%llx\n", sBlk.s.fragments, indexes,
41 if(sBlk.s.fragments == 0)
44 fragment_table = malloc(sBlk.s.fragments *
51 SQUASHFS_FRAGMENT_INDEX_BYTES(sBlk.s.fragments),
73 for(i = 0; i < sBlk.s.fragments; i++)
H A Dread_fs.c470 printf("\tNumber of fragments %d\n", sBlk->fragments);
608 int res, i, indexes = SQUASHFS_FRAGMENT_INDEXES(sBlk->fragments);
611 TRACE("read_fragment_table: %d fragments, reading %d fragment indexes "
612 "from 0x%llx\n", sBlk->fragments, indexes,
614 if(sBlk->fragments == 0)
617 *fragment_table = malloc(sBlk->fragments *
625 SQUASHFS_FRAGMENT_INDEX_BYTES(sBlk->fragments),
649 for(i = 0; i < sBlk->fragments; i++)
H A Dsquashfs_fs.h283 unsigned int fragments; member in struct:squashfs_super_block
H A Dmksquashfs.c231 int fragments = 0; variable
792 fragments = sfragments;
1842 if(fragments % FRAG_SIZE == 0) {
1843 void *ft = realloc(fragment_table, (fragments +
1852 fragment_data->block = fragments;
1853 fragment_table[fragments].unused = 0;
1856 fragments ++;
1879 fragment_data = cache_get(fragment_buffer, fragments, 1);
1881 ffrg->index = fragments;
1946 unsigned int frag_bytes = SQUASHFS_FRAGMENT_BYTES(fragments);
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openvpn-2.3.1/src/openvpn/
H A Dfragment.c47 list->fragments[i].buf = alloc_buf (BUF_SIZE (frame));
55 free_buf (&list->fragments[i].buf);
70 list->fragments[i].defined = false;
77 list->fragments[list->index = modulo_add (list->index, 1, N_FRAG_BUF)].defined = false;
81 return &list->fragments[modulo_add (list->index, diff, N_FRAG_BUF)];
131 * If the datagram is a fragment, join with other fragments received so far.
212 /* set elements in bit array to reflect which fragments have been received */
286 * Without changing the number of fragments, return a possibly smaller
288 * similar size as previous fragments.
304 /* process an outgoing datagram, possibly breaking it up into fragments */
[all...]
H A Dfragment.h74 # define MAX_FRAGS 32 /**< Maximum number of fragments per packet. */
77 * fragments have been received.
103 * fragment_list.fragments array. */
109 * fragment_list.fragments[fragment_list.index] has an ID of \c
115 struct fragment fragments[N_FRAG_BUF]; member in struct:fragment_list
398 * Check whether outgoing fragments are ready to be send, and if so make
428 * Check whether a \c fragment_master structure contains fragments ready
435 * @li True, if there are one or more fragments ready to be sent.
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/ffmpeg-2.3.4/libavformat/
H A Dhdsenc.c55 Fragment **fragments; member in struct:OutputStream
155 av_free(os->fragments[j]);
156 av_free(os->fragments);
232 int start = 0, fragments; local
237 fragments = os->nb_fragments - start;
241 cur_media_time = os->fragments[os->nb_fragments - 1]->start_time;
283 avio_wb32(out, fragments); // FragmentRunEntryCount
285 avio_wb32(out, os->fragments[i]->n);
286 avio_wb64(out, os->fragments[i]->start_time);
287 avio_wb32(out, os->fragments[
[all...]
H A Dsmoothstreamingenc.c60 Fragment **fragments; member in struct:__anon3632
117 Fragment *frag = os->fragments[i];
186 av_free(os->fragments[j]);
187 av_free(os->fragments);
197 if (os->fragments[0]->n > 0)
204 Fragment *frag = os->fragments[i];
231 Fragment *last = os->fragments[os->nb_fragments - 1];
463 if ((err = av_reallocp(&os->fragments, sizeof(*os->fragments) *
480 os->fragments[o
[all...]
H A Dmovenc.h166 int fragments; member in struct:MOVMuxContext
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/net/wireless/ipw2x00/
H A Dlibipw_tx.c186 if (txb->fragments[i])
187 dev_kfree_skb_any(txb->fragments[i]);
206 txb->fragments[i] = __dev_alloc_skb(txb_size + headroom,
208 if (unlikely(!txb->fragments[i])) {
212 skb_reserve(txb->fragments[i], headroom);
216 dev_kfree_skb_any(txb->fragments[i--]);
404 /* Number of fragments is the total
441 skb_frag = txb->fragments[0];
467 skb_frag = txb->fragments[i];
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/staging/rtl8192su/ieee80211/
H A Dieee80211_tx.c253 txb->fragments[i] = dev_alloc_skb(txb_size);
254 if (unlikely(!txb->fragments[i])) {
258 memset(txb->fragments[i]->cb, 0, sizeof(txb->fragments[i]->cb));
262 dev_kfree_skb_any(txb->fragments[i--]);
458 // Other fragments are protected by previous fragment.
739 /* Number of fragments is the total bytes_per_frag /
770 skb_frag = txb->fragments[i];
864 memcpy(skb_put(txb->fragments[0],skb->len), skb->data, skb->len);
871 cb_desc *tcb_desc = (cb_desc *)(txb->fragments[
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/staging/rtl8192u/ieee80211/
H A Dieee80211_tx.c255 txb->fragments[i] = dev_alloc_skb(txb_size);
256 if (unlikely(!txb->fragments[i])) {
260 memset(txb->fragments[i]->cb, 0, sizeof(txb->fragments[i]->cb));
264 dev_kfree_skb_any(txb->fragments[i--]);
453 // Other fragments are protected by previous fragment.
730 /* Number of fragments is the total bytes_per_frag /
762 skb_frag = txb->fragments[i];
857 memcpy(skb_put(txb->fragments[0],skb->len), skb->data, skb->len);
864 cb_desc *tcb_desc = (cb_desc *)(txb->fragments[
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/include/net/
H A Dinet_frag.h22 struct sk_buff *fragments; /* list of received fragments */ member in struct:inet_frag_queue
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/staging/rtl8187se/ieee80211/
H A Dieee80211_tx.c236 if (txb->fragments[i])
237 dev_kfree_skb_any(txb->fragments[i]);
257 txb->fragments[i] = dev_alloc_skb(txb_size);
258 if (unlikely(!txb->fragments[i])) {
265 dev_kfree_skb_any(txb->fragments[i--]);
452 /* Number of fragments is the total bytes_per_frag /
474 skb_frag = txb->fragments[i];
555 memcpy(skb_put(txb->fragments[0],skb->len), skb->data, skb->len);
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/net/ipv4/
H A Dip_fragment.c152 /* Memory limiting on fragments. Evictor trashes the oldest
185 if ((qp->q.last_in & INET_FRAG_FIRST_IN) && qp->q.fragments != NULL) {
186 struct sk_buff *head = qp->q.fragments;
265 rc = qp->q.fragments && (end - start) > max;
286 fp = qp->q.fragments;
296 qp->q.fragments = NULL;
366 /* Find out which fragments are in front and at the back of us
367 * in the chain of fragments so far. We must know where to put
376 for (next = qp->q.fragments; next != NULL; next = next->next) {
430 qp->q.fragments
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/staging/rtl8192e/ieee80211/
H A Dieee80211_tx.c256 txb->fragments[i] = dev_alloc_skb(txb_size);
257 if (unlikely(!txb->fragments[i])) {
261 memset(txb->fragments[i]->cb, 0, sizeof(txb->fragments[i]->cb));
265 dev_kfree_skb_any(txb->fragments[i--]);
464 // Other fragments are protected by previous fragment.
791 /* Number of fragments is the total bytes_per_frag /
823 skb_frag = txb->fragments[i];
918 memcpy(skb_put(txb->fragments[0],skb->len), skb->data, skb->len);
925 cb_desc *tcb_desc = (cb_desc *)(txb->fragments[
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/net/ipv6/
H A Dreassembly.c213 if (!(fq->q.last_in & INET_FRAG_FIRST_IN) || !fq->q.fragments)
221 fq->q.fragments->dev = dev;
222 icmpv6_send(fq->q.fragments, ICMPV6_TIME_EXCEED, ICMPV6_EXC_FRAGTIME, 0);
325 /* Find out which fragments are in front and at the back of us
326 * in the chain of fragments so far. We must know where to put
335 for(next = fq->q.fragments; next != NULL; next = next->next) {
344 * one or more its constituent fragments is determined to be an
346 * fragments, including those not yet received) MUST be silently
363 /* Insert this fragment in the chain of fragments. */
370 fq->q.fragments
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/sound/oss/
H A Daudio.c158 * Clean all unused buffer fragments.
783 info.fragments = dmap->qlen;
787 info.fragments = 0;
790 info.fragments = DMAbuf_space_in_queue(dev);
794 if (tmp && info.fragments)
798 info.fragments -= tmp;
802 if (info.fragments < 0)
803 info.fragments = 0;
804 else if (info.fragments > dmap->nbufs)
805 info.fragments
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/docs/latex/wx/
H A Dhtmlcell.tex9 You can divide any text (or HTML) into small fragments. Let's call these
10 fragments {\bf cells}. Cell is for example one word, horizontal line, image
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/net/ipv6/netfilter/
H A Dnf_conntrack_reasm.c260 /* Find out which fragments are in front and at the back of us
261 * in the chain of fragments so far. We must know where to put
270 for (next = fq->q.fragments; next != NULL; next = next->next) {
279 * one or more its constituent fragments is determined to be an
281 * fragments, including those not yet received) MUST be silently
296 /* Insert this fragment in the chain of fragments. */
303 fq->q.fragments = skb;
340 struct sk_buff *fp, *op, *head = fq->q.fragments;
365 * and the second, holding only fragments. */
424 fq->q.fragments
[all...]

Completed in 145 milliseconds

123