| /linux/net/batman-adv/ |
| H A D | fragmentation.c | 33 * @dropped: whether the chain is cleared because all fragments are dropped
35 * Free fragments in the passed hlist. Should be called with appropriate lock.
55 * batadv_frag_purge_orig() - free fragments associated to an orig
56 * @orig_node: originator to free fragments from
66 chain = &orig_node->fragments[i]; in batadv_frag_purge_orig()
95 * @chain: chain in fragments table to init
127 * @chain_out: list head to attach complete chains of fragments to
130 * entry. The hash table entry is cleared if "old" fragments exist in it.
133 * fragments needed to merge the packet, the chain is moved to the passed head
166 /* Select entry in the "chain table" and delete any prior fragments in batadv_frag_insert_packet()
[all …]
|
| /linux/fs/xfs/scrub/ |
| H A D | refcount.c | 67 * 2. Pull the first $target_nr fragments from the list; all of them
69 * Call this subset of fragments the working set.
70 * 3. Until there are no more unprocessed fragments,
71 * a. Find the shortest fragments in the set and remove them.
72 * b. Note the block number of the end of these fragments.
73 * c. Pull the same number of fragments from the list. All of these
74 * fragments should start at the block number recorded in the
76 * d. Put those fragments in the set.
77 * 4. Check that there are $target_nr fragments remaining in the list,
90 struct list_head fragments; member
[all …]
|
| H A D | rtrefcount.c | 81 * 2. Pull the first $target_nr fragments from the list; all of them
83 * Call this subset of fragments the working set.
84 * 3. Until there are no more unprocessed fragments,
85 * a. Find the shortest fragments in the set and remove them.
86 * b. Note the block number of the end of these fragments.
87 * c. Pull the same number of fragments from the list. All of these
88 * fragments should start at the block number recorded in the
90 * d. Put those fragments in the set.
91 * 4. Check that there are $target_nr fragments remaining in the list,
104 struct list_head fragments; member
[all …]
|
| /linux/include/net/libeth/ |
| H A D | types.h | 15 * @fragments: sum of fragments of received S/G frames
24 u32 fragments; member
52 * @fragments: sum of fragments of completed S/G frames
60 u32 fragments; member
|
| /linux/drivers/of/ |
| H A D | overlay.c | 65 * @fragments: fragment nodes in the overlay expanded device tree
66 * @symbols_fragment: last element of @fragments[] is the __symbols__ node
67 * @cset: changeset to apply fragments to live device tree
77 struct fragment *fragments; member
170 struct fragment *fragment = &ovcs->fragments[i]; in overlay_notify()
232 fragment = &ovcs->fragments[k]; in dup_and_fixup_symbol_prop()
550 pr_err("ERROR: multiple fragments add and/or delete node %pOF\n", in find_dup_cset_node_entry()
586 pr_err("ERROR: multiple fragments add, update, and/or delete property %pOF/%s\n", in find_dup_cset_prop()
619 * build_changeset() - populate overlay changeset in @ovcs from @ovcs->fragments
623 * overlay device tree fragments in @ovcs->fragments[]. If an error occurs,
[all …]
|
| /linux/Documentation/mm/ |
| H A D | page_frags.rst | 2 Page fragments
7 fragments within that page are individually refcounted, in the page's
11 simple allocation framework for page fragments. This is used by the
35 fragments, but the page fragments are cached at the ring or descriptor
|
| /linux/fs/squashfs/ |
| H A D | fragment.c | 12 * This file implements code to handle compressed fragments (tail-end packed
43 if (fragment >= msblk->fragments) in squashfs_frag_lookup()
64 u64 fragment_table_start, u64 next_table, unsigned int fragments) in squashfs_read_fragment_index_table() argument
66 unsigned int length = SQUASHFS_FRAGMENT_INDEX_BYTES(fragments); in squashfs_read_fragment_index_table()
|
| H A D | super.c | 188 unsigned int fragments; in squashfs_fill_super() local
295 msblk->fragments = le32_to_cpu(sblk->fragments); in squashfs_fill_super()
307 TRACE("Number of fragments %d\n", msblk->fragments); in squashfs_fill_super()
411 fragments = msblk->fragments; in squashfs_fill_super()
412 if (fragments == 0) in squashfs_fill_super()
416 min(SQUASHFS_CACHED_FRAGMENTS, fragments), msblk->block_size); in squashfs_fill_super()
424 le64_to_cpu(sblk->fragment_table_start), next_table, fragments); in squashfs_fill_super()
|
| /linux/lib/kunit/ |
| H A D | string-stream.c | 84 list_add_tail(&frag_container->node, &stream->fragments); in string_stream_vadd()
109 &stream->fragments, in string_stream_clear()
128 list_for_each_entry(frag_container, &stream->fragments, node) in string_stream_get_string()
154 return list_empty(&stream->fragments); in string_stream_is_empty()
166 INIT_LIST_HEAD(&stream->fragments); in alloc_string_stream()
|
| H A D | string-stream.h | 23 struct list_head fragments; member
24 /* length and fragments are protected by this lock */
|
| /linux/tools/testing/selftests/net/ |
| H A D | ip_defrag.c | 212 /* Send the UDP datagram using raw IP fragments: the 0th fragment in send_udp_frags()
213 * has the UDP header; other fragments are pieces of udp_payload in send_udp_frags()
216 * Odd fragments (1st, 3rd, 5th, etc.) are sent out first, then in send_udp_frags()
217 * even fragments (0th, 2nd, etc.) are sent out. in send_udp_frags()
244 /* Occasionally test in-order fragments. */ in send_udp_frags()
275 /* Odd fragments. */ in send_udp_frags()
288 * Duplicates and some fragments completely inside in send_udp_frags()
289 * previously sent fragments are dropped/ignored. So in send_udp_frags()
323 /* Event fragments. */ in send_udp_frags()
402 printf("processed %d messages, %d fragments\n", in run_test()
|
| /linux/drivers/net/wireless/intel/ipw2x00/ |
| H A D | libipw_tx.c | 172 if (txb->fragments[i]) in libipw_txb_free()
173 dev_kfree_skb_any(txb->fragments[i]); in libipw_txb_free()
183 txb = kzalloc_flex(*txb, fragments, nr_frags, gfp_mask); in libipw_alloc_txb()
191 txb->fragments[i] = __dev_alloc_skb(txb_size + headroom, in libipw_alloc_txb()
193 if (unlikely(!txb->fragments[i])) { in libipw_alloc_txb()
197 skb_reserve(txb->fragments[i], headroom); in libipw_alloc_txb()
201 dev_kfree_skb_any(txb->fragments[i--]); in libipw_alloc_txb()
389 /* Number of fragments is the total in libipw_xmit()
426 skb_frag = txb->fragments[0]; in libipw_xmit()
451 skb_frag = txb->fragments[i]; in libipw_xmit()
|
| /linux/include/net/ |
| H A D | inet_frag.h | 73 * @rb_fragments: received fragments rb-tree root
74 * @fragments_tail: received fragments tail
78 * @meat: length of received fragments so far
160 * We want to check ECN values of all fragments, do detect invalid combinations.
|
| /linux/tools/testing/selftests/net/netfilter/ |
| H A D | conntrack_ipip_mtu.sh | 6 # Conntrack needs to reassemble fragments in order to have complete
181 # UDP packet is sent as two fragments (1380 + 20). Router A forwards the
182 # fragments between eth1 and ipip0. The fragments fit into the tunnel and
186 #fragments before routing the packet over ipip0. The resulting IPIP
|
| /linux/arch/powerpc/mm/ |
| H A D | pgtable-frag.c | 4 * Handling Page Tables through page fragments
26 /* We allow PTE_FRAG_NR fragments from a PTE page */ in pte_frag_destroy()
45 * If we have taken up all the fragments mark PTE page NULL in get_pte_from_cache()
|
| /linux/Documentation/networking/ |
| H A D | ppp_generic.rst | 18 ordering and combining received fragments
180 or more fragments and puts a multilink header on each fragment. It
181 decides how many fragments to use based on the length of the packet
184 fragment if it doesn't have any fragments currently queued up for it
187 scheme has the effect that more fragments are given to higher-
191 transmitted as single fragments, thus reducing the overhead of
358 numbers on received multilink fragments
453 fragments is disabled. This ioctl is only available if the
|
| /linux/net/ipv4/ |
| H A D | inet_fragment.c | 3 * inet fragments management
29 /* Use skb->cb to track consecutive/adjacent fragments coming at
31 * contain "runs" of one or more adjacent fragments.
84 /* Given the OR values of all fragments, apply RFC 3168 5.3 requirements
439 * one or more its constituent fragments is determined to be an in inet_frag_queue_insert()
441 * fragments) MUST be silently discarded. in inet_frag_queue_insert()
444 * queue/fragments kept for later reassembly). in inet_frag_queue_insert()
559 * and the second, holding only fragments. in inet_frag_reasm_prepare()
|
| /linux/scripts/gendwarfksyms/ |
| H A D | die.c | 29 INIT_LIST_HEAD(&cd->fragments); in init_die()
76 list_for_each_entry_safe(df, tmp, &cd->fragments, list) { in reset_die()
128 list_add_tail(&df->list, &cd->fragments); in append_item()
|
| /linux/scripts/kconfig/ |
| H A D | Makefile | 105 all-config-fragments = $(call configfiles,*.config)
106 config-fragments = $(call configfiles,$@)
108 …rge_fragments = $(srctree)/scripts/kconfig/merge_config.sh -m $(KCONFIG_CONFIG) $(config-fragments)
111 $(if $(config-fragments),, $(error $@ fragment does not exists on this architecture))
159 @$(foreach f, $(all-config-fragments), \
|
| /linux/Documentation/ABI/testing/ |
| H A D | dev-kmsg | 118 By default, kernel tries to avoid fragments by concatenating
119 when it can and fragments are rare; however, when extended
121 disabled and /dev/kmsg output will contain more fragments. If
|
| /linux/tools/testing/selftests/drivers/net/ |
| H A D | netcons_fragmented_msg.sh | |
| /linux/drivers/net/wireless/intel/iwlwifi/fw/api/ |
| H A D | time-event.h | 52 * the first 2 fragments are scheduled.
54 * number of fragments are valid.
67 /* If a Time Event can be fragmented, this is the max number of fragments */
118 * the first 2 fragments are scheduled.
120 * number of fragments are valid.
206 * @max_frags: maximal number of fragments the Time Event can be divided to
|
| /linux/fs/jffs2/ |
| H A D | jffs2_fs_i.h | 32 /* List of data fragments which make up the file */
36 above fragments, if it contains a metadata update but no actual
|
| /linux/scripts/ |
| H A D | Makefile.defconf | 14 # Input config fragments without '.config' suffix
26 # Input config fragments without '.config' suffix
|
| /linux/drivers/net/ethernet/sfc/siena/ |
| H A D | rx.c | 66 /* Allocate and construct an SKB around page fragments */
133 /* Validate the number of fragments and completed length */ in efx_siena_rx_packet()
181 /* Release/sync DMA mapping for additional fragments. in efx_siena_rx_packet()
196 /* All fragments have been DMA-synced, so recycle pages. */ in efx_siena_rx_packet()
275 "XDP is not possible with multiple receive fragments (%d)\n", in efx_do_xdp()
|