| /linux-4.1.27/fs/btrfs/ |
| D | ordered-data.c | 440 struct btrfs_ordered_extent *ordered; in btrfs_get_logged_extents() local
450 ordered = rb_entry(n, struct btrfs_ordered_extent, rb_node); in btrfs_get_logged_extents()
451 if (ordered->file_offset > end) in btrfs_get_logged_extents()
453 if (entry_end(ordered) <= start) in btrfs_get_logged_extents()
455 if (test_and_set_bit(BTRFS_ORDERED_LOGGED, &ordered->flags)) in btrfs_get_logged_extents()
457 list_add(&ordered->log_list, logged_list); in btrfs_get_logged_extents()
458 atomic_inc(&ordered->refs); in btrfs_get_logged_extents()
465 struct btrfs_ordered_extent *ordered; in btrfs_put_logged_extents() local
468 ordered = list_first_entry(logged_list, in btrfs_put_logged_extents()
471 list_del_init(&ordered->log_list); in btrfs_put_logged_extents()
[all …]
|
| D | file.c | 1385 struct btrfs_ordered_extent *ordered; in lock_and_cleanup_extent_if_need() local
1388 ordered = btrfs_lookup_ordered_range(inode, start_pos, in lock_and_cleanup_extent_if_need()
1390 if (ordered && in lock_and_cleanup_extent_if_need()
1391 ordered->file_offset + ordered->len > start_pos && in lock_and_cleanup_extent_if_need()
1392 ordered->file_offset <= last_pos) { in lock_and_cleanup_extent_if_need()
1400 btrfs_start_ordered_extent(inode, ordered, 1); in lock_and_cleanup_extent_if_need()
1401 btrfs_put_ordered_extent(ordered); in lock_and_cleanup_extent_if_need()
1404 if (ordered) in lock_and_cleanup_extent_if_need()
1405 btrfs_put_ordered_extent(ordered); in lock_and_cleanup_extent_if_need()
1430 struct btrfs_ordered_extent *ordered; in check_can_nocow() local
[all …]
|
| D | file-item.c | 430 struct btrfs_ordered_extent *ordered; in btrfs_csum_one_bio() local
453 ordered = btrfs_lookup_ordered_extent(inode, offset); in btrfs_csum_one_bio()
454 BUG_ON(!ordered); /* Logic error */ in btrfs_csum_one_bio()
462 if (offset >= ordered->file_offset + ordered->len || in btrfs_csum_one_bio()
463 offset < ordered->file_offset) { in btrfs_csum_one_bio()
467 btrfs_add_ordered_sum(inode, ordered, sums); in btrfs_csum_one_bio()
468 btrfs_put_ordered_extent(ordered); in btrfs_csum_one_bio()
476 ordered = btrfs_lookup_ordered_extent(inode, offset); in btrfs_csum_one_bio()
477 BUG_ON(!ordered); /* Logic error */ in btrfs_csum_one_bio()
500 btrfs_add_ordered_sum(inode, ordered, sums); in btrfs_csum_one_bio()
[all …]
|
| D | inode.c | 1956 struct btrfs_ordered_extent *ordered; in btrfs_writepage_fixup_worker() local
1984 ordered = btrfs_lookup_ordered_extent(inode, page_start); in btrfs_writepage_fixup_worker()
1985 if (ordered) { in btrfs_writepage_fixup_worker()
1989 btrfs_start_ordered_extent(inode, ordered, 1); in btrfs_writepage_fixup_worker()
1990 btrfs_put_ordered_extent(ordered); in btrfs_writepage_fixup_worker()
2401 struct btrfs_ordered_extent *ordered; in relink_extent_backref() local
2465 ordered = btrfs_lookup_first_ordered_extent(inode, lock_end); in relink_extent_backref()
2466 if (ordered) { in relink_extent_backref()
2467 btrfs_put_ordered_extent(ordered); in relink_extent_backref()
2664 struct btrfs_ordered_extent *ordered) in record_old_file_extents() argument
[all …]
|
| D | tree-log.c | 3787 struct btrfs_ordered_extent *ordered; in wait_ordered_extents() local
3808 list_for_each_entry(ordered, logged_list, log_list) { in wait_ordered_extents()
3814 if (ordered->file_offset + ordered->len <= mod_start || in wait_ordered_extents()
3815 mod_start + mod_len <= ordered->file_offset) in wait_ordered_extents()
3818 if (!test_bit(BTRFS_ORDERED_IO_DONE, &ordered->flags) && in wait_ordered_extents()
3819 !test_bit(BTRFS_ORDERED_IOERR, &ordered->flags) && in wait_ordered_extents()
3820 !test_bit(BTRFS_ORDERED_DIRECT, &ordered->flags)) { in wait_ordered_extents()
3821 const u64 start = ordered->file_offset; in wait_ordered_extents()
3822 const u64 end = ordered->file_offset + ordered->len - 1; in wait_ordered_extents()
3824 WARN_ON(ordered->inode != inode); in wait_ordered_extents()
[all …]
|
| D | Makefile | 7 extent_map.o sysfs.o struct-funcs.o xattr.o ordered-data.o \
|
| D | transaction.c | 527 INIT_LIST_HEAD(&h->ordered); in start_transaction()
759 if (!list_empty(&trans->ordered)) { in __btrfs_end_transaction()
761 list_splice_init(&trans->ordered, &cur_trans->pending_ordered); in __btrfs_end_transaction()
1752 struct btrfs_ordered_extent *ordered; in btrfs_wait_pending_ordered() local
1756 ordered = list_first_entry(&cur_trans->pending_ordered, in btrfs_wait_pending_ordered()
1759 list_del_init(&ordered->trans_list); in btrfs_wait_pending_ordered()
1762 wait_event(ordered->wait, test_bit(BTRFS_ORDERED_COMPLETE, in btrfs_wait_pending_ordered()
1763 &ordered->flags)); in btrfs_wait_pending_ordered()
1764 btrfs_put_ordered_extent(ordered); in btrfs_wait_pending_ordered()
1851 list_splice_init(&trans->ordered, &cur_trans->pending_ordered); in btrfs_commit_transaction()
|
| D | ordered-data.h | 195 struct btrfs_ordered_extent *ordered);
|
| D | transaction.h | 126 struct list_head ordered; member
|
| D | ioctl.c | 1110 struct btrfs_ordered_extent *ordered; in cluster_pages_for_defrag() local
1142 ordered = btrfs_lookup_ordered_extent(inode, in cluster_pages_for_defrag()
1146 if (!ordered) in cluster_pages_for_defrag()
1150 btrfs_start_ordered_extent(inode, ordered, 1); in cluster_pages_for_defrag()
1151 btrfs_put_ordered_extent(ordered); in cluster_pages_for_defrag()
2793 struct btrfs_ordered_extent *ordered; in lock_extent_range() local
2795 ordered = btrfs_lookup_first_ordered_extent(inode, in lock_extent_range()
2797 if ((!ordered || in lock_extent_range()
2798 ordered->file_offset + ordered->len <= off || in lock_extent_range()
2799 ordered->file_offset >= off + len) && in lock_extent_range()
[all …]
|
| D | extent_io.c | 3135 struct btrfs_ordered_extent *ordered; in __do_contiguous_readpages() local
3141 ordered = btrfs_lookup_ordered_range(inode, start, in __do_contiguous_readpages()
3143 if (!ordered) in __do_contiguous_readpages()
3146 btrfs_start_ordered_extent(inode, ordered, 1); in __do_contiguous_readpages()
3147 btrfs_put_ordered_extent(ordered); in __do_contiguous_readpages()
3206 struct btrfs_ordered_extent *ordered; in __extent_read_full_page() local
3213 ordered = btrfs_lookup_ordered_extent(inode, start); in __extent_read_full_page()
3214 if (!ordered) in __extent_read_full_page()
3217 btrfs_start_ordered_extent(inode, ordered, 1); in __extent_read_full_page()
3218 btrfs_put_ordered_extent(ordered); in __extent_read_full_page()
|
| D | disk-io.c | 4038 struct btrfs_ordered_extent *ordered; in btrfs_destroy_ordered_extents() local
4045 list_for_each_entry(ordered, &root->ordered_extents, in btrfs_destroy_ordered_extents()
4047 set_bit(BTRFS_ORDERED_IOERR, &ordered->flags); in btrfs_destroy_ordered_extents()
4265 struct btrfs_ordered_extent *ordered; in btrfs_free_pending_ordered() local
4269 ordered = list_first_entry(&cur_trans->pending_ordered, in btrfs_free_pending_ordered()
4272 list_del_init(&ordered->trans_list); in btrfs_free_pending_ordered()
4275 btrfs_put_ordered_extent(ordered); in btrfs_free_pending_ordered()
|
| D | relocation.c | 4484 struct btrfs_ordered_extent *ordered; local
4491 ordered = btrfs_lookup_ordered_extent(inode, file_pos);
4492 BUG_ON(ordered->file_offset != file_pos || ordered->len != len);
4516 new_bytenr = ordered->start + (sums->bytenr - disk_bytenr);
4519 btrfs_add_ordered_sum(inode, ordered, sums);
4522 btrfs_put_ordered_extent(ordered);
|
| D | scrub.c | 4028 struct btrfs_ordered_extent *ordered; in check_extent_to_block() local
4037 ordered = btrfs_lookup_ordered_range(inode, lockstart, len); in check_extent_to_block()
4038 if (ordered) { in check_extent_to_block()
4039 btrfs_put_ordered_extent(ordered); in check_extent_to_block()
|
| /linux-4.1.27/include/trace/events/ |
| D | btrfs.h | 231 TP_PROTO(struct inode *inode, struct btrfs_ordered_extent *ordered),
233 TP_ARGS(inode, ordered),
250 __entry->file_offset = ordered->file_offset;
251 __entry->start = ordered->start;
252 __entry->len = ordered->len;
253 __entry->disk_len = ordered->disk_len;
254 __entry->bytes_left = ordered->bytes_left;
255 __entry->flags = ordered->flags;
256 __entry->compress_type = ordered->compress_type;
257 __entry->refs = atomic_read(&ordered->refs);
[all …]
|
| /linux-4.1.27/Documentation/devicetree/bindings/sound/ |
| D | sirf-audio-port.txt | 6 - dmas: List of DMA controller phandle and DMA request line ordered pairs.
8 These strings correspond 1:1 with the ordered pairs in dmas.
|
| D | brcm,bcm2835-i2s.txt | 8 - dmas: List of DMA controller phandle and DMA request line ordered pairs.
10 These strings correspond 1:1 with the ordered pairs in dmas.
|
| D | sirf-usp.txt | 6 - dmas: List of DMA controller phandle and DMA request line ordered pairs.
8 These strings correspond 1:1 with the ordered pairs in dmas.
|
| D | davinci-mcasp-audio.txt | 23 ordered pairs.
25 These strings correspond 1:1 with the ordered pairs in dmas. The dma
|
| D | samsung-i2s.txt | 23 - dmas: list of DMA controller phandle and DMA request line ordered pairs.
25 These strings correspond 1:1 with the ordered pairs in dmas.
|
| /linux-4.1.27/tools/perf/Documentation/ |
| D | perf.txt | 23 ordered-events - ordered events object debug messages
|
| /linux-4.1.27/arch/avr32/boards/hammerhead/ |
| D | Kconfig | 20 Choose 'Y' here if you have ordered a Corona daugther board and
29 Choose 'Y' here if you have ordered a Corona daugther board and
|
| /linux-4.1.27/fs/ext3/ |
| D | Kconfig | 32 bool "Default to 'data=ordered' in ext3"
41 "data=ordered" mode can also result in major performance
48 data=ordered mode will be a safe choice and you should
|
| /linux-4.1.27/Documentation/filesystems/ |
| D | ext3.txt | 43 data=ordered (*) All data are forced directly out to the main file
114 in a file data buffer in ordered mode.
116 data buffer in ordered mode.
172 * ordered mode
173 In data=ordered mode, ext3 only officially journals metadata, but it logically
|
| D | ext4.txt | 100 * efficient new ordered mode in JBD2 and ext4(avoid using buffer head to force
165 data=ordered (*) All data are forced directly out to the main file
232 in a file data buffer in ordered mode.
234 data buffer in ordered mode.
321 journal commit, in the default data=ordered
404 * ordered mode
405 In data=ordered mode, ext4 only officially journals metadata, but it logically
|
| D | ocfs2.txt | 58 data=ordered (*) All data are forced directly out to the main file
|
| D | nilfs2.txt | 65 is equivalent to the ordered data mode of the ext3
|
| D | sharedsubtree.txt | 841 non-NULL, they form a contiguous (ordered) segment of slave list.
|
| D | xfs-delayed-logging-design.txt | 255 and as such are stored in the Active Item List (AIL) which is a LSN-ordered
|
| /linux-4.1.27/Documentation/devicetree/bindings/powerpc/4xx/ |
| D | hsta.txt | 17 - interrupts : ordered interrupt mapping for each MSI in the register
|
| /linux-4.1.27/fs/xfs/ |
| D | xfs_log_cil.c | 178 bool ordered = false; in xlog_cil_insert_format_items() local
197 ordered = true; in xlog_cil_insert_format_items()
231 if (ordered) in xlog_cil_insert_format_items()
245 if (ordered) { in xlog_cil_insert_format_items()
|
| D | xfs_log.c | 2370 bool ordered = false; in xlog_write() local
2375 ordered = true; in xlog_write()
2445 if (record_cnt == 0 && ordered == false) { in xlog_write()
|
| /linux-4.1.27/Documentation/devicetree/bindings/gpio/ |
| D | gpio-fan.txt | 8 ordered MSB-->LSB.
|
| D | brcm,kona-gpio.txt | 18 number of GPIO banks on the SoC. The interrupts must be ordered by bank,
|
| /linux-4.1.27/Documentation/devicetree/bindings/usb/ |
| D | ux500-usb.txt | 13 - dma-names : An ordered list of channel names affiliated to the above
|
| /linux-4.1.27/Documentation/devicetree/bindings/ |
| D | resource-names.txt | 1 Some properties contain an ordered list of 1 or more datum which are
|
| /linux-4.1.27/Documentation/devicetree/bindings/video/ |
| D | sharp,ls037v7dw01.txt | 14 ordered MO, LR, and UD as specified in the LS037V7DW01.pdf file.
|
| /linux-4.1.27/Documentation/devicetree/bindings/net/ |
| D | samsung-sxgbe.txt | 9 These interrupts are ordered by fixed and follows variable
|
| /linux-4.1.27/Documentation/networking/ |
| D | sctp.txt | 8 transparent multi-homing, and multiple ordered streams of messages.
|
| D | fib_trie.txt | 102 Dumps the routing table ordered by prefix length. This is somewhat
|
| D | 00-INDEX | 182 - Background on the reliable, ordered datagram delivery method RDS.
|
| D | rds.txt | 14 RDS provides reliable, ordered datagram delivery by using a single
|
| /linux-4.1.27/Documentation/ |
| D | ramoops.txt | 28 memory to be mapped strongly ordered, and atomic operations on strongly ordered
|
| D | io_ordering.txt | 1 On some platforms, so-called memory-mapped I/O is weakly ordered. On such
|
| D | DMA-attributes.txt | 29 may be weakly ordered, that is that reads and writes may pass each other.
|
| D | memory-barriers.txt | 210 ordered within that CPU. This means that for:
1747 ordered I/O regions to be partially ordered. Its effects may go beyond the
1905 the more strongly ordered systems may rule out some of the above orders.
2269 operations that affect both CPUs may have to be carefully ordered to prevent
2473 (1) On some systems, I/O stores are not strongly ordered across all CPUs, and
2523 sections will include synchronous load operations on strictly ordered I/O
2557 They are guaranteed to be fully ordered with respect to each other.
2559 They are not guaranteed to be fully ordered with respect to other types of
2564 Whether these are guaranteed to be fully ordered and uncombined with
2570 Ordinarily, these will be guaranteed to be fully ordered and uncombined,
[all …]
|
| D | atomic_ops.txt | 207 and after the atomic operation calls are strongly ordered with respect
302 call are strongly ordered with respect to the atomic counter
|
| D | SubmittingPatches | 641 series" is an ordered sequence of multiple, related patches).
|
| /linux-4.1.27/arch/arm/mach-s3c24xx/ |
| D | Kconfig | 178 # The "S3C2410 Boards" list is ordered alphabetically by option text.
306 # The "S3C2412 Boards" list is ordered alphabetically by option text.
434 # The "S3C2440 Boards" list is ordered alphabetically by option text.
532 # The "S3C2442 Boards" list is ordered alphabetically by option text.
|
| /linux-4.1.27/Documentation/scheduler/ |
| D | sched-design-CFS.txt | 54 runqueues, but it uses a time-ordered rbtree to build a "timeline" of future
68 CFS maintains a time-ordered rbtree, where all runnable tasks are sorted by the
79 becomes the "leftmost task" of the time-ordered rbtree it maintains (plus a
|
| /linux-4.1.27/Documentation/devicetree/bindings/powerpc/fsl/ |
| D | srio.txt | 13 compatible is provided it should be ordered before "fsl,srio".
|
| /linux-4.1.27/Documentation/devicetree/bindings/clock/ |
| D | brcm,kona-ccu.txt | 26 Shall be an ordered list of strings defining the names of
|
| /linux-4.1.27/Documentation/timers/ |
| D | hrtimers.txt | 103 Time-ordered enqueueing is not purely for the purposes of
110 be enqueued again. The time-ordered enqueueing and the storage of the
|
| D | highres.txt | 38 - time ordered enqueueing into a rb-tree
163 The time ordered insertion of timers provides all the infrastructure to decide
|
| /linux-4.1.27/Documentation/RCU/ |
| D | checklist.txt | 36 memory barriers on weakly ordered machines (pretty much all of
103 4. Weakly ordered CPUs pose special challenges. Almost all CPUs
104 are weakly ordered -- even x86 CPUs allow later loads to be
145 to prevent weakly ordered machines from misordering
|
| D | rcu_dereference.txt | 203 safe on strongly ordered systems (such as x86), but not on weakly
204 ordered systems (such as ARM or Power). Choose your compiler
|
| D | listRCU.txt | 150 needed on weakly ordered CPUs (most of them!). The list_del_rcu()
|
| /linux-4.1.27/tools/perf/util/ |
| D | Build | 45 libperf-y += ordered-events.o
|
| /linux-4.1.27/Documentation/parisc/ |
| D | registers | 65 O (ordered references) 1*
|
| /linux-4.1.27/Documentation/ABI/testing/ |
| D | sysfs-block-bcache | 102 switched on and off. In synchronous mode all writes are ordered
|
| /linux-4.1.27/net/netfilter/ipset/ |
| D | Kconfig | 164 an ordered union of the member sets.
|
| /linux-4.1.27/Documentation/device-mapper/ |
| D | verity.txt | 110 selected cryptographic digest algorithm. The hashes are linearly-ordered in
|
| D | dm-raid.txt | 154 Arguments that can be repeated are ordered by value.
|
| /linux-4.1.27/Documentation/netlabel/ |
| D | draft-ietf-cipso-ipsecurity-01.txt | 243 are ordered with 0 being the minimum value and 255 representing the maximum
340 are ordered with 0 being the minimum value and 255 representing the
403 are ordered with 0 being the minimum value and 255 representing the maximum
|
| /linux-4.1.27/Documentation/vm/ |
| D | numa | 72 an ordered "zonelist". A zonelist specifies the zones/nodes to visit when a
|
| /linux-4.1.27/Documentation/scsi/ |
| D | FlashPoint.txt | 87 made available, and that Linux users who mistakenly ordered systems with
|
| D | aic7xxx.txt | 245 Definition: Send an ordered tag periodically to prevent
|
| D | aic79xx.txt | 248 Definition: Send an ordered tag periodically to prevent
|
| D | ncr53c8xx.txt | 482 ordered: use ORDERED TAG for all operations
1085 Can be changed by "setorder <ordered|simple|default>"
1117 an ordered tag is used for the next command.
|
| D | scsi_mid_low_api.txt | 1231 instances (currently ordered by ascending host_no)
|
| /linux-4.1.27/Documentation/x86/ |
| D | exception-tables.txt | 289 Due to the way that the exception table is built and needs to be ordered,
|
| /linux-4.1.27/Documentation/driver-model/ |
| D | porting.txt | 136 The driver model maintains an ordered list of devices that it uses
|
| /linux-4.1.27/sound/soc/codecs/ |
| D | Kconfig | 3 # We use an ordered list of conditional defaults to pick the appropriate
|
| /linux-4.1.27/net/sctp/ |
| D | sm_statefuns.c | 6109 u8 ordered = 0; in sctp_eat_data() local
6258 ordered = 1; in sctp_eat_data()
6292 if (ordered && SSN_lt(ssn, sctp_ssn_peek(&asoc->ssnmap->in, sid))) { in sctp_eat_data()
|
| /linux-4.1.27/arch/m68k/ifpsp060/src/ |
| D | fpsp.S | 16693 # ordered greater than:
16698 fbogt.w fdbcc_ogt_yes # ordered greater than?
16717 # ordered greater than or equal:
16722 fboge.w fdbcc_oge_yes # ordered greater than or equal?
16741 # ordered less than:
16746 fbolt.w fdbcc_olt_yes # ordered less than?
16765 # ordered less than or equal:
16770 fbole.w fdbcc_ole_yes # ordered greater or less than?
16789 # ordered greater or less than:
16794 fbogl.w fdbcc_ogl_yes # ordered greater or less than?
[all …]
|
| /linux-4.1.27/Documentation/devicetree/bindings/thermal/ |
| D | thermal.txt | 166 The coefficients are ordered and they match with sensors
|
| /linux-4.1.27/drivers/md/ |
| D | Kconfig | 302 A cache policy that uses a multiqueue ordered by recent hit
|
| /linux-4.1.27/Documentation/kdump/ |
| D | kdump.txt | 55 ordered.
|
| /linux-4.1.27/Documentation/s390/ |
| D | s390dbf.txt | 39 The debug areas themselves are also ordered in form of a ring buffer.
|
| /linux-4.1.27/net/netfilter/ |
| D | Kconfig | 604 # alphabetically ordered list of targets
938 # alphabetically ordered list of matches
|
| /linux-4.1.27/Documentation/mtd/ |
| D | nand_ecc.txt | 282 ordered in a long is machine dependent, and might affect us.
|
| /linux-4.1.27/arch/arm/mm/ |
| D | Kconfig | 993 Historically, the kernel has used strongly ordered mappings to
|
| /linux-4.1.27/Documentation/sysctl/ |
| D | vm.txt | 529 In non-NUMA case, a zonelist for GFP_KERNEL is ordered as following.
|
| /linux-4.1.27/Documentation/virtual/kvm/ |
| D | api.txt | 1620 Each bit corresponds to one TLB entry, ordered the same as in the shared TLB
3385 - Within a TLB, entries are ordered first by increasing set number. Within a
3386 set, entries are ordered by way (increasing ESEL).
|
| /linux-4.1.27/Documentation/locking/ |
| D | rt-mutex-design.txt | 78 PI chain - The PI chain is an ordered series of locks and processes that cause
|
| /linux-4.1.27/drivers/watchdog/ |
| D | Kconfig | 1461 watchdog cards can be ordered from <http://www.berkprod.com/>.
|
| /linux-4.1.27/lib/ |
| D | Kconfig.debug | 1152 Enable this to turn on extended checks in the priority-ordered
|
| /linux-4.1.27/arch/arm/ |
| D | Kconfig | 309 # The "ARM system type" choice list is ordered alphabetically by option
|