| /linux-4.1.27/Documentation/x86/ |
| D | entry_64.txt | 52 so. If we mess that up even slightly, we crash.
54 So when we have a secondary entry, already in kernel mode, we *must
55 not* use SWAPGS blindly - nor must we forget doing a SWAPGS when it's
81 If we are at an interrupt or user-trap/gate-alike boundary then we can
83 whether SWAPGS was already done: if we see that we are a secondary
84 entry interrupting kernel mode execution, then we know that the GS
85 base has already been switched. If it says that we interrupted
86 user-space execution then we must do the SWAPGS.
88 But if we are in an NMI/MCE/DEBUG/whatever super-atomic entry context,
90 stack but before we executed SWAPGS, then the only safe way to check
[all …]
|
| D | intel_mpx.txt | 31 is how we expect the compiler, application and kernel to work together.
59 6) Whenever memory is freed, we know that it can no longer contain valid
60 pointers, and we attempt to free the associated space in the bounds
61 tables. If an entire table becomes unused, we will attempt to free
127 Q: Can virtual space simply be reserved for the bounds tables so that we
132 even if we clean them up aggressively. In the worst-case scenario, the
136 If we were to preallocate them for the 128TB of user virtual address
137 space, we would need to reserve 512TB+2GB, which is larger than the
143 Q: Can we preallocate bounds table space at the same time memory is
146 A: This would work if we could hook the site of each and every memory
[all …]
|
| D | exception-tables.txt | 41 we are interested in the other case: the address is not valid, there
53 Since we jump to the contents of fixup, fixup obviously points
152 The optimizer does a good job and gives us something we can actually
153 understand. Can we? The actual user access is quite obvious. Thanks
154 to the unified address space we can just access the address in user
157 To understand this we have to look at the final kernel:
183 file. But first we want to find out what happened to our code in the
275 8b) DL becomes zero (the value we "read" from user space)
282 we set EAX to -EFAULT in the exception handler code. Well, the
|
| /linux-4.1.27/fs/jffs2/ |
| D | TODO | 5 reservations will necessarily be pessimistic. With this we could even
6 do shared writable mmap, if we can have a fs hook for do_wp_page() to
11 - checkpointing (do we need this? scan is quite fast)
25 nodes to a different one, we can separate clean nodes from those which
28 - Stop keeping name in-core with struct jffs2_full_dirent. If we keep the hash in
29 the full dirent, we only need to go to the flash in lookup() when we think we've
|
| D | README.Locking | 26 until this happens we ensure that any data in the write-buffer at the
28 was written afterwards. Hence, we can ensure the newly-obsoleted nodes
55 lead to deadlock, unless we played games with unlocking the i_sem
58 Instead of playing such games, we just have an extra internal
109 if we need to deal with wrapping after 4 milliard inode numbers are used.
142 write-behind buffer ('wbuf') used for flash chips where we must write
|
| /linux-4.1.27/arch/frv/kernel/ |
| D | break.S | 83 # traps will be enabled, so we have to do this now
92 # determine whether we have stepped through into an exception
93 # - we need to take special action to suspend h/w single stepping if we've done
273 # do the bit we had to skip
305 # we single-stepped into an interrupt handler whilst interrupts were merely virtually disabled
334 # we stepped through into the virtual interrupt reenablement trap
336 # we also want to single step anyway, but after fixing up so that we get an event on the
381 # do the bit we had to skip
412 # we'll want to try the trap stub again
427 # we'll swap the real return address for one with a BREAK insn so that we can re-enable
[all …]
|
| D | entry.S | 155 # make sure we (the kernel) get div-zero and misalignment exceptions
598 # now that we've accessed the exception regs, we can enable exceptions
623 # now that we've accessed the exception regs, we can enable exceptions
651 # now that we've accessed the exception regs, we can enable exceptions
671 # now that we've accessed the exception regs, we can enable exceptions
690 # now that we've accessed the exception regs, we can enable exceptions
712 # now that we've accessed the exception regs, we can enable exceptions
738 # now that we've accessed the exception regs, we can enable exceptions
758 # now that we've accessed the exception regs, we can enable exceptions
777 # now that we've accessed the exception regs, we can enable exceptions
[all …]
|
| /linux-4.1.27/Documentation/locking/ |
| D | rt-mutex-design.txt | 28 with the resource. This is a priority inversion. What we want to prevent
40 to release the lock, because for all we know, B is a CPU hog and will
61 for this document. Here we only discuss PI.
144 To show where two chains merge, we could add another process F and
154 Here we show both chains:
162 For PI to work, the processes at the right end of these chains (or we may
166 Also since a mutex may have more than one process blocked on it, we can
167 have multiple chains merge at mutexes. If we add another process G that is
238 the nesting of mutexes. Let's look at the example where we have 3 mutexes,
283 Now we add 4 processes that run each of these functions separately.
[all …]
|
| D | lockstat.txt | 43 With these hooks we provide the following statistics:
47 wait time min - shortest (non-0) time we ever had to wait for a lock
48 max - longest time we ever had to wait for a lock
49 total - total time we spend waiting on this lock
52 acquisitions - number of times we took the lock
53 hold time min - shortest (non-0) time we ever held the lock
54 max - longest time we ever held the lock
132 points are the points we're contending with.
|
| D | lockdep-design.txt | 113 - if a new hardirq-safe lock is discovered, we check whether it
116 - if a new softirq-safe lock is discovered, we check whether it took
119 - if a new hardirq-unsafe lock is discovered, we check whether any
122 - if a new softirq-unsafe lock is discovered, we check whether any
125 (Again, we do these checks too on the basis that an interrupt context
210 The above rules require _massive_ amounts of runtime checking. If we did
213 is O(N^2), so even with just a few hundred lock-classes we'd have to do
222 locking chain occurs again later on, the hash table tells us that we
|
| /linux-4.1.27/Documentation/virtual/kvm/ |
| D | locking.txt | 17 we just need change the W bit of the spte.
19 What we use to avoid all the race is the SPTE_HOST_WRITEABLE bit and
26 On fast page fault path, we will use cmpxchg to atomically set the spte W
30 But we need carefully check these cases:
32 The mapping from gfn to pfn may be changed since we can only ensure the pfn
61 For direct sp, we can easily avoid it since the spte of direct sp is fixed
62 to gfn. For indirect sp, before we do cmpxchg, we call gfn_to_pfn_atomic()
69 Then, we can ensure the dirty bitmaps is correctly set for a gfn.
71 Currently, to simplify the whole things, we disable fast page fault for
113 In order to avoid this kind of issue, we always treat the spte as "volatile"
[all …]
|
| D | ppc-pv.txt | 5 space code in PR=1 which is user space. This way we trap all privileged
21 To find out if we're running on KVM or not, we leverage the device tree. When
73 applicable to the target. For now, we always map the page to -4096. This way we
106 feature we also have a channel for a guest to tell the guest whether it's capable
107 of something. This is what we call "flags".
179 or store instruction can deliver. To enable patching of those, we keep some
180 RAM around where we can live translate instructions to. What happens is the
188 That way we can inject an arbitrary amount of code as replacement for a single
|
| D | nested-vmx.txt | 29 In nested virtualization, we have three levels: The host (KVM), which we call
30 L0, the guest hypervisor, which we call L1, and its nested guest, which we
79 The name "vmcs12" refers to the VMCS that L1 builds for L2. In the code we
84 For convenience, we repeat the content of struct vmcs12 here. If the internals
|
| D | mmu.txt | 11 on an emulated mmu except for timing (we attempt to comply
62 - when guest paging is disabled, we translate guest physical addresses to
64 - when guest paging is enabled, we translate guest virtual addresses, to
66 - when the guest launches a guest of its own, we translate nested guest
248 A tlb flush means that we need to synchronize all sptes reachable from the
249 guest's cr3. This is expensive, so we keep all guest page tables write
257 the amount of emulation we have to do when the guest modifies multiple gptes,
261 As a side effect we have to resynchronize all reachable unsynchronized shadow
304 - if successful, we can let the guest continue and modify the gpte
338 we cannot map the permissions for gpte.u=1, gpte.w=0 to any spte (the
[all …]
|
| /linux-4.1.27/Documentation/filesystems/ |
| D | xfs-delayed-logging-design.txt | 25 That is, if we have a sequence of changes A through to F, and the object was
26 written to disk after change D, we would see in the log the following series
91 relogging technique XFS uses is that we can be relogging changed objects
92 multiple times before they are committed to disk in the log buffers. If we
98 contains all the changes from the previous changes. In other words, we have one
100 wasting space. When we are doing repeated operations on the same set of
103 log would greatly reduce the amount of metadata we write to the log, and this
110 formatting the changes in a transaction to the log buffer. Hence we cannot avoid
113 Delayed logging is the name we've given to keeping and tracking transactional
163 changes to the log buffers, we need to ensure that the object we are formatting
[all …]
|
| D | path-lookup.txt | 49 the path given by the name's starting point (which we know in advance -- eg.
55 A parent, of course, must be a directory, and we must have appropriate
79 In order to lookup a dcache (parent, name) tuple, we take a hash on the tuple
81 in that bucket is then walked, and we do a full comparison of each entry
148 However, when inserting object 2 onto a new list, we end up with this:
161 Because we didn't wait for a grace period, there may be a concurrent lookup
182 As explained above, we would like to do path walking without taking locks or
188 than reloading from the dentry later on (otherwise we'd have interesting things
192 no non-atomic stores to shared data), and to recheck the seqcount when we are
194 Avoiding destructive or changing operations means we can easily unwind from
[all …]
|
| D | directory-locking | 5 When taking the i_mutex on multiple non-directory objects, we
11 1) read access. Locking rules: caller locks directory we are accessing.
20 it. If source is a non-directory, lock it. If that means we need to
39 it. In case that means we need to lock both source and target,
51 First of all, at any moment we have a partial ordering of the
57 attempts to acquire lock on B, A will remain the parent of B until we
63 renames will be blocked on filesystem lock and we don't start changing
64 the order until we had acquired all locks).
93 would have a contended child and we had assumed that no object is its
98 of its descendents is locked by cross-directory rename (otherwise we
[all …]
|
| D | xfs-self-describing-metadata.txt | 28 However, if we scale the filesystem up to 1PB, we now have 10x as much metadata
40 magic number in the metadata block, we have no other way of identifying what it
53 Hence we need to record more information into the metadata to allow us to
55 of analysis. We can't protect against every possible type of error, but we can
62 hence parse and verify the metadata object. IF we can't independently identify
68 magic numbers. Hence we can change the on-disk format of all these objects to
72 self identifying and we can do much more expansive automated verification of the
76 integrity checking. We cannot trust the metadata if we cannot verify that it has
77 not been changed as a result of external influences. Hence we need some form of
79 block. If we can verify the block contains the metadata it was intended to
[all …]
|
| D | autofs4-mount-control.txt | 19 file descriptor for these operations if we don't already have one open.
60 operation. So we see a mount of shark:/autofs/export1 on /test/g1, for
65 trigger. So when we walk on the path we mount shark:/autofs/export1 "on
66 top of this mount point". Since these are always directories we can
91 entry with a large number of offsets, possibly with nesting, we needed
94 This mechanism is used for the well known "hosts" map and we have seen
98 In version 5 we mount only as we go down the tree of offsets and
117 offset mounts in place we need to be able to obtain a file handle
129 Since we're re-implementing the control interface, a couple of other
159 issued for a mount (file handle) we should continually call back to
[all …]
|
| D | inotify.txt | 32 thousand times is silly. If we can implement user-space's preferences
33 cleanly--and we can, the idr layer makes stuff like this trivial--then we
77 interfaces. The only real difference was whether we wanted to use open(2)
|
| D | gfs2-glocks.txt | 69 grant for which we ignore remote demote requests. This is in order to
79 Also, eventually we hope to make the glock "EX" mode locally shared
117 In general we prefer to lock local locks prior to cluster locks.
170 we'd like to get a better idea of these timings:
185 the average time between lock requests for a glock means we
191 Great care has been taken to ensure that we
192 measure exactly the quantities that we want, as accurately
194 measuring system, but I hope this is as accurate as we
|
| D | sysfs-tagging.txt | 16 the sysfs directory entries we ensure that we don't have conflicts
|
| D | sharedsubtree.txt | 61 Now let's say we mount a device at /tmp/a
106 However let's see what happens if we mount something on the mount at /tmp
121 This is the mount we are familiar with. Its the default type.
126 let's say we have a mount at /mnt and we make is unbindable
425 eg: let's say we have the following mount tree.
625 At this point we have the first mount at /tmp and
627 And then we have a second mount at /tmp1 with root
629 Next we have a third mount at /mnt with root dentry
635 at this point if we execute the following command
661 Let's say we want to replicate the mount tree at multiple
[all …]
|
| D | exofs.txt | 152 operations should execute in the order written, and we need to prevent them
155 flags. OBJ_CREATED is set when we know the object exists on the OSD -
156 in create's callback function, and when we successfully do a
158 OBJ_2BCREATED is set in the beginning of the create function, so we
159 know that we should wait.
|
| /linux-4.1.27/drivers/block/paride/ |
| D | Transition-notes | 9 ps_spinlock. C is always preceded by B, since we can't reach it
10 other than through B and we don't drop ps_spinlock between them.
14 A and each B is preceded by either A or C. Moments when we enter
37 * in ps_tq_int(): from the moment when we get ps_spinlock() to the
73 we would have to be called for the PIA that got ->claimed_cont
83 it is holding pd_lock. The only place within the area where we
87 we were acquiring the lock, (1) would be already false, since
89 If it was 0 before we tried to acquire pd_lock, (2) would be
96 (4) is done the same way - all places where we release pi_spinlock within
100 in the area, under pi_spinlock and we do not release it until after leaving
[all …]
|
| /linux-4.1.27/drivers/scsi/aic7xxx/ |
| D | aic79xx.seq | 85 * If we have completions stalled waiting for the qfreeze
109 * ENSELO is cleared by a SELDO, so we must test for SELDO
169 * Since this status did not consume a FIFO, we have to
170 * be a bit more dilligent in how we check for FIFOs pertaining
178 * count in the SCB. In this case, we allow the routine servicing
183 * we detect case 1, we will properly defer the post of the SCB
222 * bad SCSI status (currently only for underruns), we
223 * queue the SCB for normal completion. Otherwise, we
258 * If we have relatively few commands outstanding, don't
303 * one byte of lun information we support.
[all …]
|
| D | aic7xxx.seq | 52 * After starting the selection hardware, we check for reconnecting targets
54 * bus arbitration. The problem with this is that we must keep track of the
55 * SCB that we've already pulled from the QINFIFO and started the selection
56 * on just in case the reselection wins so that we can retry the selection at
104 * We have at least one queued SCB now and we don't have any
124 * before we completed the DMA operation. If it was,
211 /* The Target ID we were selected at */
239 * Watch ATN closely now as we pull in messages from the
285 * we've got a failed selection and must transition to bus
333 * Reselection has been initiated by a target. Make a note that we've been
[all …]
|
| /linux-4.1.27/arch/cris/arch-v10/mm/ |
| D | fault.c | 51 int miss, we, writeac; in handle_mmu_bus_fault() local
67 we = IO_EXTRACT(R_MMU_CAUSE, we_excp, cause); in handle_mmu_bus_fault()
71 regs->irp, address, miss, inv, we, acc, index, page_id)); in handle_mmu_bus_fault()
77 do_page_fault(address, regs, 1, we); in handle_mmu_bus_fault()
|
| D | tlb.c | 54 IO_STATE(R_TLB_LO, we, no ) | in flush_tlb_all()
90 IO_STATE(R_TLB_LO, we, no ) | in flush_tlb_mm()
130 IO_STATE(R_TLB_LO, we, no ) | in flush_tlb_page()
|
| /linux-4.1.27/Documentation/usb/ |
| D | WUSB-Design-overview.txt | 192 So let's say we connect a dongle to the system: it is detected and
195 Now we have a real HWA device connected and
214 So assuming we have devices and we have agreed for a channel to connect
215 on (let's say 9), we put the new RC to beacon:
283 ID and tell the HC to use all that. Then we start it. This means the HC
309 the device. First we allocate a /fake port/ and assign an
310 unauthenticated address (128 to 255--what we really do is
314 So now we are in the reset path -- we know we have a non-yet enumerated
315 device with an unauthorized address; we ask user space to authenticate
316 (FIXME: not yet done, similar to bluetooth pairing), then we do the key
[all …]
|
| D | wusb-cbaf | 39 Get the device ID associated to the HOST-CHID we sent with
44 If we allow the device to connect, set a random new CDID and CK
46 connect wireless. We save them for that next time also so we can
47 authenticate the device (when we see the CDID he uses to id
|
| D | dwc3.txt | 8 As it turns out some DWC3-commands ~1ms to complete. Currently we spin
34 We probably have to pay attention not to process events once we
35 handed something to thread so we don't process event X prio Y
|
| /linux-4.1.27/Documentation/RCU/ |
| D | rculist_nulls.txt | 23 * reuse these object before the RCU grace period, we
26 if (obj->key != key) { // not the object we expected
87 * we need to make sure obj->key is updated before obj->next
98 Nothing special here, we can use a standard RCU hlist deletion.
112 With hlist_nulls we can avoid extra smp_rmb() in lockless_lookup()
115 For example, if we choose to store the slot number as the 'nulls'
116 end-of-list marker for each slot of the hash table, we can detect
120 is not the slot number, then we must restart the lookup at
135 if (obj->key != key) { // not the object we expected
142 * if the nulls value we got at the end of this lookup is
[all …]
|
| D | lockdep-splat.txt | 69 case. Instead, we hold three locks, one of which might be RCU related.
84 On the other hand, perhaps we really do need an RCU read-side critical
102 But in this particular case, we don't actually deference the pointer
|
| /linux-4.1.27/Documentation/block/ |
| D | deadline-iosched.txt | 21 service time for a request. As we focus mainly on read latencies, this is
50 When we have to move requests from the io scheduler queue to the block
51 device dispatch queue, we always give a preference to reads. However, we
53 how many times we give preference to reads over writes. When that has been
54 done writes_starved number of times, we dispatch some writes based on the
69 that comes at basically 0 cost we leave that on. We simply disable the
|
| D | biovecs.txt | 8 Instead, we have a new struct bvec_iter which represents a range of a biovec -
26 * Driver code should no longer refer to biovecs directly; we now have
69 bios. Note that this means we _only_ use bi_size to determine when we've
74 bios with more than a single bvec! Now, we can efficiently split arbitrary
106 actually needed for iterating over the bio anymore - we only use bi_size.
108 biovec, in order to calculate bi_vcnt for the new bio we'd have to iterate
|
| D | cfq-iosched.txt | 21 By default slice_idle is a non-zero value. That means by default we idle on
23 single spindle SATA/SAS disks where we can cut down on overall number of
232 one), then not dispatching request from other queue should help as we
241 On this tree we idle on each queue individually.
245 tree we do not idle on individual queues instead idle on the whole group
247 we will idle only once last queue has dispatched the IO and there is
270 roughly after 1 second. If after completion of REQ_NOIDLE request we
286 time we do not idle on individual threads.
|
| /linux-4.1.27/Documentation/power/ |
| D | freezing-of-tasks.txt | 17 we only consider hibernation, but the description also applies to suspend).
28 it loop until PF_FROZEN is cleared for it. Then, we say that the task is
75 - freezes all tasks (including kernel threads) because we can't freeze
79 - thaws only kernel threads; this is particularly useful if we need to do
81 userspace tasks, or if we want to postpone the thawing of userspace tasks
84 - thaws all tasks (including kernel threads) because we can't thaw userspace
95 IV. Why do we do that?
100 hibernation. At the moment we have no simple means of checkpointing
102 metadata on disks, we cannot bring them back to the state from before the
113 2. Next, to create the hibernation image we need to free a sufficient amount of
[all …]
|
| D | swsusp-dmcrypt.txt | 119 First we have to decide if we want to try to resume, or not.
123 Then we need to set up dmcrypt with the setup data from the
124 pcmcia flash disk. If this succeeds we need to reset the swap
125 device if we don't want to resume. The line "echo 254:0 > /sys/power/resume"
131 Otherwise we just remove the encrypted swap device and leave it to the
|
| D | swsusp.txt | 77 ram and the machine can continue its work. It has two real benefits. First we
79 are real high when running from batteries. The other gain is that we don't have to
125 A: We do use the regular I/O paths. However we cannot restore the data
126 to its original location as we load it. That would create an
128 Instead, we load the image into unused memory and then atomically copy
137 * assume we had special "polling" ide driver that only uses memory
162 Q: What is the freezing of tasks and why are we using it?
233 A: That's correct. We need to resume them if we want to write image to
247 resume(): devices are woken up so that we can write image to swap
251 suspend(PMSG_SUSPEND): suspend devices so that we can power off
[all …]
|
| /linux-4.1.27/Documentation/powerpc/ |
| D | pci_iov_resource_on_powernv.txt | 32 The following section provides a rough description of what we have on P8
43 For DMA, MSIs and inbound PCIe error messages, we have a table (in
48 - For DMA we then provide an entire address space for each PE that can
54 - For MSIs, we have two windows in the address space (one at the top of
82 reserved for MSIs but this is not a problem at this point; we just
84 ignores that however and will forward in that space if we try).
91 Now, this is the "main" window we use in Linux today (excluding
96 Ideally we would like to be able to have individual functions in PEs
107 bits which are not conveyed by PowerBus but we don't use this.
109 * Can be configured to be segmented. When not segmented, we can
[all …]
|
| D | ptrace.txt | 8 For that, we need to extend ptrace so that GDB can query and set these
9 resources. Since we're extending, we're trying to create an interface
22 Since we're at it, we added other useful info that the kernel can return to
|
| D | transactional_memory.txt | 139 /* Yes, we crashed during a transaction. Oops. */
150 When in an active transaction that takes a signal, we need to be careful with
154 transactional memory state. If we write over this non transactionally or in
155 suspend, we are in trouble because if we get a tm abort, the program counter and
159 To avoid this, when taking a signal in an active transaction, we need to use
166 For signals taken in non-TM or suspended mode, we use the
|
| /linux-4.1.27/Documentation/devicetree/bindings/i2c/ |
| D | i2c-arb-gpio-challenge.txt | 24 - OUR_CLAIM: output from us signaling to other hosts that we want the bus
31 Let's say we want to claim the bus. We:
35 3. Check THEIR_CLAIMS. If none are asserted then the we have the bus and we are
44 - our-claim-gpio: The GPIO that we use to claim the bus.
52 - wait-retry-us: we'll attempt another claim after this many microseconds.
54 - wait-free-us: we'll give up after this many microseconds. Default is 50000 us.
|
| D | i2c-cros-ec-tunnel.txt | 3 On some ChromeOS board designs we've got a connection to the EC (embedded
5 the EC (like a battery and PMIC). To get access to those devices we need
14 - google,remote-bus: The EC bus we'd like to talk to.
|
| /linux-4.1.27/Documentation/networking/ |
| D | fib_trie.txt | 33 verify that they actually do match the key we are searching for.
68 fib_find_node(). Inserting a new node means we might have to run the
103 slower than the corresponding fib_hash function, as we have to walk the
120 trie, key segment by key segment, until we find a leaf. check_leaf() does
123 If we find a match, we are done.
125 If we don't find a match, we enter prefix matching mode. The prefix length,
127 and we backtrack upwards through the trie trying to find a longest matching
133 the child index until we find a match or the child index consists of nothing but
136 At this point we backtrack (t->stats.backtrack++) up the trie, continuing to
139 At this point we will repeatedly descend subtries to look for a match, and there
|
| D | tcp.txt | 20 once we exceed slow start threshold.
72 one that has been queued already. To add a frame we throw it on the end. Ack
98 When a write is done we try to clear any pending events and piggy back them.
99 If the window is full we queue full sized frames. On the first timeout in
100 zero window we split this.
102 On a timer we walk the retransmit list to send any retransmits, update the
|
| D | tcp-thin.txt | 4 protocols display what we call thin-stream properties. This means
16 applications, we have seen that they often produce thin streams
|
| /linux-4.1.27/arch/cris/boot/rescue/ |
| D | head_v10.S | 71 ;; sector. Sector size is 65536 bytes in all flashes we use.
77 ;; That is not where we put our downloaded serial boot-code.
123 ;; Since etrax actually starts at address 2 when booting from flash, we
124 ;; put a nop (2 bytes) here first so we dont accidentally skip the di
135 ;; We put a longword of -1 here and if it is not -1, we jump using
136 ;; the value as jump target. Since we can always change 1's to 0's
157 ;; We need to setup the bus registers before we start using the DRAM
160 ;; we now should go through the checksum-table and check the listed
232 ;; (so we can flash LEDs, and so that DTR and others are set)
289 ;; check if we got something on the serial port
[all …]
|
| D | kimagerescue.S | 48 ;; since etrax actually starts at address 2 when booting from flash, we
49 ;; put a nop (2 bytes) here first so we dont accidentally skip the di
54 ;; (so we can flash LEDs, and so that DTR and others are set)
66 ;; We need to setup the bus registers before we start using the DRAM
123 ;; check if we got something on the serial port
|
| /linux-4.1.27/tools/perf/ |
| D | builtin-timechart.c | 408 struct wake_event *we = zalloc(sizeof(*we)); in sched_wakeup() local
410 if (!we) in sched_wakeup()
413 we->time = timestamp; in sched_wakeup()
414 we->waker = waker; in sched_wakeup()
415 we->backtrace = backtrace; in sched_wakeup()
418 we->waker = -1; in sched_wakeup()
420 we->wakee = wakee; in sched_wakeup()
421 we->next = tchart->wake_events; in sched_wakeup()
422 tchart->wake_events = we; in sched_wakeup()
423 p = find_create_pid(tchart, we->wakee); in sched_wakeup()
[all …]
|
| /linux-4.1.27/arch/mn10300/mm/ |
| D | cache-inv-by-tag.S | 123 # If we are in writeback mode we check the start and end alignments,
240 # approx every N steps we re-enable the cache and see if there are any
242 # we also break out if we've reached the end of the loop
263 # - we don't bother with delay NOPs as we'll have enough instructions
264 # before we disable interrupts again to give the interrupts a chance
|
| D | cache-inv-by-reg.S | 115 # If we are in writeback mode we check the start and end alignments,
136 # writeback mode, in which case we would be in flush and invalidate by
|
| D | cache-dbg-inv.S | 36 # we only need to invalidate the icache in this cache mode
|
| D | cache.inc | 20 # On some cores it is necessary to disable the icache whilst we do this.
81 # On some cores it is necessary to disable the dcache whilst we do this.
|
| /linux-4.1.27/scripts/genksyms/ |
| D | lex.lex.c_shipped | 16 /* First, we deal with platform-specific or compiler-specific issues. */
115 * we want to instead treat it as an 8-bit unsigned char, hence the
121 * but we do it the disgusting crufty way forced on us by the ()-less
205 /* Whether we "own" the buffer - i.e., we know we created it,
212 * if we're using stdio for input, then we want to use getc()
213 * instead of fread(), to make sure we stop fetching input after
218 /* Whether we're considered to be at the beginning of a line.
227 /* Whether to try to fill the input buffer when we reach the
237 * then we mark the buffer as YY_EOF_PENDING, to indicate that we
242 * When we actually see the EOF, we change the status to "new"
[all …]
|
| /linux-4.1.27/arch/cris/arch-v10/kernel/ |
| D | entry.S | 96 ;; we cannot simply test $dccr, because that does not necessarily
97 ;; reflect what mode we'll return into.
119 ;; Since we dont really want to have two epilogues (one for system calls
120 ;; and one for interrupts) we push the contents of BRP instead of IRP in the
124 ;; Since we can't have system calls inside interrupts, it should not matter
127 ;; In r9 we have the wanted syscall number. Arguments come in r10,r11,r12,r13,mof,srp
208 ;; now we have a 4-word SBFS frame which we do not want to restore
209 ;; using RBF since it was not stacked with SBFS. instead we would like to
285 ;; we need to restore $r9 here to contain the wanted syscall, and
307 push $srp ; we keep the old/new PC on the stack
[all …]
|
| D | head.S | 32 ;; since etrax actually starts at address 2 when booting from flash, we
33 ;; put a nop (2 bytes) here first so we dont accidentally skip the di
44 ;; we cannot do very much! See arch/cris/README.mm
46 ;; Notice that since we're potentially running at 0x00 or 0x40 right now,
52 ;; an address. Though we can check the version register for
54 ;; be variables, so we don't. The drawback is that you can "only" map
146 ;; Check if we start from DRAM or FLASH by testing PC
160 ;; Put this in a suitable section where we can reclaim storage
177 ;; We need to initialze DRAM registers before we start using the DRAM
196 ;; DRAM and we never get here in the first place :))
[all …]
|
| /linux-4.1.27/Documentation/ABI/stable/ |
| D | sysfs-firmware-opal-dump | 11 we will initiate a dump.
31 we could not get the type from firmware.
35 acknowledge: When 'ack' is written to this, we will
36 acknowledge that we've retrieved the
|
| /linux-4.1.27/firmware/ |
| D | README.AddingFirmware | 8 As we update those drivers to use request_firmware() and keep a clean
9 separation between code and firmware, we put the extracted firmware
19 we were never permitted to include in a GPL'd work, but which we _have_
|
| /linux-4.1.27/Documentation/scsi/ |
| D | ChangeLog.1992-1997 | 141 * scsi.c: If we get a FMK, EOM, or ILI when attempting to scan
145 * scsi.h: Update and add a bunch of missing commands which we
204 we detected.
240 * sr.c: More photo-cd hacks to make sure we get the xa stuff right.
256 * hosts.c: If we remove last host registered, reuse host number.
424 * sd.c: Fail if we are opening a non-existent partition.
440 In particular, we now receive the irq number as one of the arguments.
445 that we receive the irq as an arg.
450 message if we cannot reserve the port addresses.
453 message if we cannot reserve the port addresses.
[all …]
|
| /linux-4.1.27/arch/arm/boot/dts/ |
| D | omap3430-sdp.dts | 74 gpmc,we-on-ns = <54>;
75 gpmc,we-off-ns = <168>;
120 gpmc,we-on-ns = <6>;
121 gpmc,we-off-ns = <30>;
165 gpmc,we-on-ns = <0>;
166 gpmc,we-off-ns = <42>;
|
| D | omap-gpmc-smsc911x.dtsi | 37 gpmc,we-on-ns = <45>;
38 gpmc,we-off-ns = <140>;
|
| D | omap-gpmc-smsc9221.dtsi | 40 gpmc,we-on-ns = <0>;
41 gpmc,we-off-ns = <36>;
|
| D | omap2420-h4.dts | 42 gpmc,we-on-ns = <60>;
43 gpmc,we-off-ns = <120>;
|
| D | omap2430-sdp.dts | 59 gpmc,we-on-ns = <66>;
60 gpmc,we-off-ns = <169>;
|
| D | omap2420-n8x0-common.dtsi | 66 gpmc,we-on-ns = <27>;
67 gpmc,we-off-ns = <72>;
|
| D | omap-zoom-common.dtsi | 39 gpmc,we-on-ns = <45>;
40 gpmc,we-off-ns = <145>;
|
| D | omap3-sb-t35.dtsi | 121 gpmc,we-on-ns = <45>;
122 gpmc,we-off-ns = <140>;
|
| D | omap3-lilly-a83x.dtsi | 130 * reset can't be controlled. So we clamp this GPIO to
383 gpmc,we-on-ns = <5>;
384 gpmc,we-off-ns = <75>;
436 gpmc,we-on-ns = <10>;
437 gpmc,we-off-ns = <60>;
|
| /linux-4.1.27/scripts/kconfig/ |
| D | zconf.lex.c_shipped | 35 /* First, we deal with platform-specific or compiler-specific issues. */
134 * we want to instead treat it as an 8-bit unsigned char, hence the
140 * but we do it the disgusting crufty way forced on us by the ()-less
224 /* Whether we "own" the buffer - i.e., we know we created it,
231 * if we're using stdio for input, then we want to use getc()
232 * instead of fread(), to make sure we stop fetching input after
237 /* Whether we're considered to be at the beginning of a line.
246 /* Whether to try to fill the input buffer when we reach the
256 * then we mark the buffer as YY_EOF_PENDING, to indicate that we
261 * When we actually see the EOF, we change the status to "new"
[all …]
|
| /linux-4.1.27/arch/x86/realmode/rm/ |
| D | trampoline_64.S | 51 # write marker for master knows we're running
115 * EFER.LMA = 1). Now we want to jump in 64bit mode, to do that we use
|
| D | trampoline_32.S | 41 movl tr_start, %eax # where we need to go
44 # write marker for master knows we're running
|
| /linux-4.1.27/Documentation/vm/ |
| D | active_mm.txt | 18 - we have "real address spaces" and "anonymous address spaces". The
20 user-level page tables at all, so when we do a context switch into an
21 anonymous address space we just leave the previous address space
36 - however, we obviously need to keep track of which address space we
37 "stole" for such an anonymous user. For that, we have "tsk->active_mm",
73 we have a user context", and is generally done by the page fault handler
|
| D | split_page_table_lock | 9 With split page table lock we have separate per-table lock to serialize
10 access to the table. At the moment we use split lock for PTE and PMD
82 To avoid increasing size of struct page and have best performance, we use a
84 - if spinlock_t fits into long, we use page->ptr as spinlock, so we
86 - if size of spinlock_t is bigger then size of long, we use page->ptl as
|
| D | balance | 35 zone size (and possibly of the size of lower class zones), we can decide
36 at init time how many free pages we should aim for while balancing any
37 zone. The good part is, while balancing, we do not need to look at sizes
38 of lower class zones, the bad part is, we might do too frequent balancing
43 Another possible solution is that we balance only when the free memory
48 which have different numbers and types of zones. If we wanted to get
49 fancy, we could assign different weights to free pages in different
|
| D | unevictable-lru.txt | 93 (1) We get to "treat unevictable pages just like we treat other pages in the
94 system - which means we get to use the same code to manipulate them, the
101 lists. If we were to maintain pages elsewhere than on an LRU-like list,
102 where they can be found by isolate_lru_page(), we would prevent their
103 migration, unless we reworked migration code to find the unevictable pages
211 from the unevictable list. However, there may be situations where we decide,
326 do end up getting faulted into this VM_LOCKED VMA, we'll handle them in the
330 migrated out from under us, while we're trying to mlock it. To detect this,
332 If the page is still associated with its mapping, we'll go ahead and call
333 mlock_vma_page(). If the mapping is gone, we just unlock the page and move on.
[all …]
|
| D | page_owner.txt | 10 When we need to know about status of all pages, we can get and analyze
13 Although we already have tracepoint for tracing page allocation/free,
58 at least, we can tell whether the page is allocated or not,
|
| D | zsmalloc.txt | 7 fail under memory pressure. On the other hand, if we just use single
36 With CONFIG_ZSMALLOC_STAT, we could see zsmalloc internal information via
67 Similarly, we assign zspage to:
|
| D | page_migration | 95 3. Prep the new page that we want to move to. It is locked
105 mapcount is not zero then we do not migrate the page.
112 7. The refcount of the page is examined and we back out if references remain
113 otherwise we know that we are the only one referencing this page.
116 page then we back out because someone else modified the radix tree.
|
| D | highmem.txt | 31 The part of (physical) memory not covered by a permanent mapping is what we
35 In the i386 arch, for example, we choose to map the kernel into every process's
36 VM space so that we don't have to pay the full TLB invalidation costs for
52 time, but because we need virtual address space for other things - including
|
| /linux-4.1.27/Documentation/ |
| D | static-keys.txt | 38 be shared with other memory accesses). As we increase the number of tracepoints
53 Using the 'asm goto', we can create branches that are either taken or not taken
54 by default, without the need to check memory. Then, at run-time, we can patch
57 For example, if we have a simple branch that is disabled by default:
64 straight-line code path. When the branch is 'flipped', we will patch the
146 to take advantage of this optimization. If there is no architecture support, we
237 If we then include the padding bytes, the jump label code saves, 16 total bytes
239 function is 80 bytes long. Thus, we have saved 20% of the instruction
241 really can be a 2-byte no-op since we can reach the branch with a 2-byte jmp.
242 However, we have not yet implemented optimal no-op sizes (they are currently
[all …]
|
| D | kmemcheck.txt | 132 any context, we need a temporary storage area which is guaranteed not
264 If your kernel was compiled with CONFIG_DEBUG_INFO=y, then all we have to do
300 of calls, we move upwards to see where "from" was allocated or initialized,
334 Now we need to follow the "pending" pointer, since that is being passed on to
335 collect_signal() as "list". At this point, we've run out of lines from the
336 "addr2line" output. Not to worry, we just paste the next addresses from the
354 addresses). This becomes obvious when we look at the code for line 446:
364 436 * itimers are process shared and we restart periodic
378 So instead of looking at 446, we should be looking at 431, which is the line
379 that executes just before 446. Here we see that what we are looking for is
[all …]
|
| D | crc32.txt | 14 subtract, we just xor. Thus, we tend to get a bit sloppy about
38 When computing a CRC, we don't care about the quotient, so we can
40 the polynomial from the remainder and we're back to where we started,
49 Notice how, to get at bit 32 of the shifted remainder, we look
52 But also notice how the next_input_bit() bits we're shifting into
55 Also, to add the CRC to a message, we need a 32-bit-long hole for it at
56 the end, so we have to add 32 extra cycles shifting in zeros at the
82 As long as next_input_bit is returning the bits in a sensible order, we don't
115 in the correct multiple to subtract, we can shift a byte at a time.
|
| D | pi-futex.txt | 32 technique that often cannot be replaced with lockless algorithms. As we
48 we've got even more priority levels.
50 So once we accept that synchronization objects (locks) are an
51 unavoidable fact of life, and once we accept that multi-task userspace
52 apps have a very fair expectation of being able to use locks, we've got
58 different, there we cannot disable interrupts or make the task
84 To handle the slowpath, we have added two new futex ops:
|
| D | assoc_array.txt | 157 (3) See if this is the object we're looking for.
536 (3) Insertion replacing part of a subtree that we haven't yet entered. This
538 the iteration as we won't have reached the pointer to it yet and the
541 (4) Insertion replacing nodes that we're actively processing. This isn't a
542 problem as we've passed the anchoring pointer and won't switch onto the
543 new layout until we follow the back pointers - at which point we've
544 already examined the leaves in the replaced node (we iterate over all the
548 branch that's in a slot further along than we were at.
550 (5) Insertion replacing nodes that we're processing a dependent branch of.
551 This won't affect us until we follow the back pointers. Similar to (4).
[all …]
|
| D | SecurityBugs | 1 Linux kernel developers take security very seriously. As such, we'd
26 the solution is not well-tested or for vendor coordination. However, we
32 to a few weeks. As a basic default policy, we expect report date to
|
| D | remoteproc.txt | 38 the way remoteproc_rpmsg.c does this, or, if this becomes prevalent, we
49 - we're not decrementing the rproc's refcount, only the power refcount.
58 /* in case we were given a valid 'rproc' handle */
179 it is quite expected that other platforms/devices which we'd want to
182 When those use cases show up, we will have to decouple the binary format
183 from the framework core, so we can support several binary formats without
191 also include a special section which we call "the resource table".
214 * contains a version number (should we need to change this format in the
280 at some point. When that happens, we could easily add a new RSC_PLATFORM
298 using the rpmsg bus (similar to how we already do dynamic allocations of
|
| D | Intel-IOMMU.txt | 30 reserved in the e820 map. When we turn on DMA translation, DMA to those
51 We also allocate guard pages with each mapping, so we can attempt to catch
64 The same is true for peer to peer transactions. Hence we reserve the
|
| D | ManagementStyle | 24 making it painfully obvious to the questioner that we don't have a clue
38 particular, if somebody tells you "choose (a) or (b), we really need you
90 engineer. And remember: "irrevocable" was what we tried to avoid in
118 we just do both?" and look pitiful. Trust me, it works. If it's not
177 sadly that you are one too, and that while we can all bask in the secure
178 knowledge that we're better than the average person (let's face it,
179 nobody ever believes that they're average or below-average), we should
180 also admit that we're not the sharpest knife around, and there will be
238 We all think we're better than anybody else, which means that when
253 silly. It can thus help get through the personal mental block we all
|
| D | bus-virt-phys-mapping.txt | 15 at memory addresses, and in this case we actually want the third, the
88 * this is the hardware "mailbox" we use to communicate with
119 So why do we care about the physical address at all? We do need the physical
156 * size 1MB, so that we can access it: We can directly
165 /* unmap when we unload the driver */
|
| /linux-4.1.27/Documentation/ia64/ |
| D | efirtc.txt | 26 Because we wanted to minimize the impact on existing user-level apps using
27 the CMOS clock, we decided to expose an API that was very similar to the one
35 The Epoch is January 1st 1998. For backward compatibility reasons we don't
36 expose this new way of representing time. Instead we use something very
45 As of today we don't offer a /proc/sys interface.
48 we have created the include/linux/rtc.h header file to contain only the
95 RTC which is some kind of interval timer alarm. For this reason we don't use
96 the same ioctl()s to get access to the service. Instead we have
|
| D | aliasing.txt | 24 The Itanium architecture requires that we avoid accessing the same
145 If the region is in kern_memmap, we should use the attribute
149 WB, we should use that (granules that are partially reserved
152 If the granule contains non-WB memory, but we can cover the
153 region safely with kernel page table mappings, we can use
156 Failing all of the above, we have to fall back to a UC mapping.
188 same attributes, we can allow the mmap (and we will prefer WB if
193 machines with VGA enabled), we must fail the mmap because there's no
197 that doesn't report the VGA frame buffer at all), we should fail the
|
| /linux-4.1.27/drivers/bcma/ |
| D | README | 2 however from programming point of view there is nothing AMBA specific we use.
11 and PIDs (0x103BB369), but we do not use that info for anything. One of that
17 In this situation we decided to introduce separated bus. It can contain up to
|
| /linux-4.1.27/arch/x86/kernel/acpi/ |
| D | wakeup_32.S | 20 # reload the gdt, as we need the full 32 bit address
36 # jump to place where we left off
79 # In case of S3 failure, we'll emerge here. Jump
|
| /linux-4.1.27/arch/arm/lib/ |
| D | div64.S | 57 @ See if we need to handle upper 32-bit result.
96 @ See if we need to handle lower 32-bit result.
104 @ Here we shift remainer bits leftwards rather than moving the
119 @ Otherwise, if lower part is also null then we are done.
128 clz xh, xl @ we know xh is zero here so...
144 @ If no bit position left then we are done.
|
| D | memzero.S | 23 1: subs r1, r1, #4 @ 1 do we have enough
42 cmp r1, #16 @ 1 we can skip this chunk if we
|
| D | lib1funcs.S | 73 @ For very big divisors, we must shift it a bit at a time, or
74 @ we will be in danger of overflowing.
160 @ For very big divisors, we must shift it a bit at a time, or
161 @ we will be in danger of overflowing.
|
| /linux-4.1.27/drivers/lguest/ |
| D | README | 7 But be warned; this is an arduous journey of several hours or more! And as we
23 - Where we encounter the first tantalising wisps of code, and come to
31 - Where we trace back to the creation of the Guest, and thus begin our
35 - Where we master the Host code, through a long and tortuous journey.
|
| /linux-4.1.27/arch/frv/mm/ |
| D | tlb-flush.S | 69 # now, we assume that the TLB line step is page size in size
99 # specify the context we want to flush
110 # now, we assume that the TLB line step is page size in size
139 # specify the context we want to flush
167 # specify the context we want to flush
|
| D | tlb-miss.S | 51 # see if we're supposed to re-enable single-step mode upon return
96 # see if we're supposed to re-enable single-step mode upon return
172 # we're using IAMR1 as an extra TLB entry
216 # the PTE we want wasn't in the PTD we have mapped, so we need to go looking for a more
304 # - need to check IAMR1 lest we cause an multiple-DAT-hit exception
345 # the PTE we want wasn't in the PTD we have mapped, so we need to go looking for a more
463 # the PTE we want wasn't in the PTD we have mapped, so we need to go looking for a more
583 # the PTE we want wasn't in the PTD we have mapped, so we need to go looking for a more
620 # we can now resume normal service
|
| /linux-4.1.27/scripts/dtc/ |
| D | dtc-lexer.lex.c_shipped | 17 /* First, we deal with platform-specific or compiler-specific issues. */
117 * we want to instead treat it as an 8-bit unsigned char, hence the
123 * but we do it the disgusting crufty way forced on us by the ()-less
215 /* Whether we "own" the buffer - i.e., we know we created it,
222 * if we're using stdio for input, then we want to use getc()
223 * instead of fread(), to make sure we stop fetching input after
228 /* Whether we're considered to be at the beginning of a line.
237 /* Whether to try to fill the input buffer when we reach the
247 * then we mark the buffer as YY_EOF_PENDING, to indicate that we
252 * When we actually see the EOF, we change the status to "new"
[all …]
|
| /linux-4.1.27/Documentation/devicetree/bindings/mmc/ |
| D | synopsys-dw-mshc.txt | 33 we'd assume that the write protect is hooked up directly to the
35 the WRTPRT register). However, it's possible that we simply don't
46 If the biu clock is missing we'll simply skip enabling it. If the
47 ciu clock is missing we'll just assume that the clock is running at
52 is specified and the ciu clock is specified then we'll try to set the ciu
76 specified we'll defer probe until we can find this regulator.
|
| /linux-4.1.27/Documentation/scheduler/ |
| D | sched-nice-design.txt | 8 scheduler, (otherwise we'd have done it long ago) because nice level
12 In the O(1) scheduler (in 2003) we changed negative nice levels to be
14 that change), and we also intentionally calibrated the linear timeslice
41 we felt to be a bit excessive. Excessive _not_ because it's too small of
47 So for HZ=1000 we changed nice +19 to 5msecs, because that felt like the
50 and we never got a single complaint about nice +19 being too _weak_ in
51 terms of CPU utilization, we only got complaints about it (still) being
54 To sum it up: we always wanted to make nice levels more consistent, but
|
| /linux-4.1.27/arch/cris/arch-v10/lib/ |
| D | checksum.S | 16 ;; we also do _NOT_ want to compute a checksum over more than the
23 ;; need to save the registers we use below in the movem loop
24 ;; this overhead is why we have a check above for breakeven length
106 ;; see if we have one odd byte more
|
| D | checksumcopy.S | 20 ;; we also do _NOT_ want to compute a checksum over more than the
27 ;; need to save the registers we use below in the movem loop
28 ;; this overhead is why we have a check above for breakeven length
112 ;; see if we have one odd byte more
|
| /linux-4.1.27/fs/befs/ |
| D | TODO | 10 Use that if we can. (include/linux/parser.h)
12 * See if we really need separate types for on-disk and in-memory
|
| /linux-4.1.27/arch/cris/arch-v32/kernel/ |
| D | head.S | 90 move.d REG_STATE(mmu, rw_mm_cfg, we, on) \
111 move.d REG_STATE(mmu, rw_mm_cfg, we, on) \
244 move.d nand_boot, $r1 ; tell axisflashmap we're booting from NAND
328 lsrq 1, $r2 ; Size is in bytes, we copy words.
341 ;; Clear romfs_in_flash flag, as we now know romfs is in DRAM
342 ;; Also clear nand_boot flag; if we got here, we know we've not
|
| D | kgdb_asm.S | 17 ;; First of all, save the ACR on the stack since we need it for address calculations.
23 ;; Now we are free to use ACR all we want.
24 ;; If we were running this handler with interrupts on, we would have to be careful
25 ;; to save and restore CCS manually, but since we aren't we treat it like every other
|
| /linux-4.1.27/Documentation/fmc/ |
| D | FMC-and-SDB.txt | 2 FMC (FPGA Mezzanine Card) is the standard we use for our I/O devices,
5 In our I/O environments we need to write drivers for each mezzanine
7 To achieve this, we abstract the FMC interface.
10 but more are planned. Also, we support stand-alone devices (usually
58 SDB (Self Describing Bus) is a set of data structures that we use for
80 <linux/fmc-sdb.h>. The linux/ prefix in the name is there because we
|
| D | identifiers.txt | 31 standard is awful and difficult without reason, so we only support the
32 minimum mandatory subset - we create a simple structure and parse it
33 back at run time, but we are not able to either generate or parse more
118 other files at a special offset (we sometimes do it for backward
119 compatibility with drivers we wrote before implementing SDB for flash
|
| /linux-4.1.27/arch/arm/vfp/ |
| D | vfphw.S | 105 @ On UP, we lazily save the VFP context. As a different
110 @ exceptions, so we can get at the
131 @ For SMP, if this thread does not own the hw context, then we
133 @ we always save the state when we switch away from a thread.
|
| /linux-4.1.27/arch/xtensa/lib/ |
| D | strnlen_user.S | 58 addi a4, a2, -4 # because we overincrement at the end;
59 # we compensate with load offsets of 4
101 # Actually, we don't need to check. Zero or nonzero, we'll add one.
102 # Do not add an extra one for the NULL terminator since we have
109 # NOTE that in several places below, we point to the byte just after
|
| /linux-4.1.27/fs/exofs/ |
| D | Kconfig.ore | 4 # for every ORE user we do it like this. Any user should add itself here
6 # selected here, and we default to "ON". So in effect it is like been
|
| /linux-4.1.27/Documentation/arm/ |
| D | Interrupts | 7 Firstly, it contains some pretty major changes to the way we handle the
9 we have TLB v3, TLB v4 (without write buffer), TLB v4 (with write buffer),
19 machine type that we currently have.
21 Lets take an example. On the Assabet with Neponset, we have:
36 data, which can be a long time. Note also that since we loop in the
90 For each IRQ, we keep the following information:
93 - flags indicating what we can do with this IRQ (valid, probe,
103 The "level" handler is what we currently have - its pretty simple.
|
| D | vlocks.txt | 57 return true; /* we won */
102 /* we won the town election, let's go for the state */
125 we can read the whole array in one transaction (providing the number
129 In the ARM implementation, this means that we can use a single load
152 we do not care which element of currently_voting appears in which
163 In principle, we could aggregate further by using LDRD or LDM, but
|
| /linux-4.1.27/Documentation/device-mapper/ |
| D | log-writes.txt | 15 We log things in order of completion once we are sure the write is no longer in
22 Once we see a REQ_FLUSH request we splice this list onto the request and once
23 the FLUSH request completes we log all of the WRITEs and then the FLUSH. Only
41 Any REQ_DISCARD requests are treated like WRITE requests. Otherwise we would
47 If we logged DISCARD when it completed, the replay would look like this
77 we're fsck'ing something reasonable, you would do something like
|
| D | cache.txt | 20 policy module. Several of these have been written as we experiment,
21 and we hope other people will contribute others for specific io
60 is configurable when you first create the cache. Typically we've been
116 migration occurring at any one time. Currently we're not taking any
134 to keep updating it on the fly. So we treat it as a hint. In normal
156 Policies will have different tunables, specific to each one, so we
163 We can avoid copying data during migration if we know the block has
166 blocks. However, we allow this bitset to have a different block size
167 from the cache blocks. This is because we need to track the discard
211 the policy we currently think is giving best all round performance.
[all …]
|
| D | zero.txt | 20 desired size of the sparse device. For this example, we'll assume a 10TB
28 space available to the sparse device. For this example, we'll assume /dev/sdb1
|
| /linux-4.1.27/Documentation/xtensa/ |
| D | atomctl.txt | 15 On the FPGA Cards we typically simulate an Intelligent Memory controller
17 Memory controller we let it to the atomic operations internally while
21 For systems without an coherent cache controller, non-MX, we always
|
| D | mmu.txt | 31 After step 2, we jump to virtual address in 0x40000000..0x5fffffff
33 After step 4, we jump to intended (linked) address of this code.
|
| /linux-4.1.27/Documentation/ABI/testing/ |
| D | sysfs-bus-event_source-devices-hv_gpci | 14 0 or 1. Indicates whether we have access to "GA" events (listed
21 0 or 1. Indicates whether we have access to "EXPANDED" events (listed
28 0 or 1. Indicates whether we have access to "LAB" events (listed
|
| D | debugfs-ideapad | 17 status shows infos we can read and tells its meaning and value.
|
| /linux-4.1.27/Documentation/mtd/ |
| D | nand_ecc.txt | 156 Fortunately the exclusive or operation is commutative, so we can combine
163 Similarly we can first xor the bytes for the various rows.
266 In step 1 we moved from bit-wise calculation to byte-wise calculation.
267 However in C we can also use the unsigned long data type and virtually
269 to write our code in such a way that we process data in 32 bit chunks.
273 for the column parity we use the par variable. When extending to 32 bits
274 we can in the end easily calculate p0 and p1 from it.
325 we need to adapt the code generation for the fact that rp vars are now
327 we'll bring rp4 to 15 back to single byte entities by shifting and
388 The code (of course) works, and hurray: we are a little bit faster than
[all …]
|
| D | spi-nor.txt | 4 Part I - Why do we need this framework?
15 receive bytes (Tx and Rx). Therefore, we must define a new layering scheme under
|
| /linux-4.1.27/tools/build/Documentation/ |
| D | Build.txt | 10 Unlike the kernel we don't have a single build object 'obj-y' list that where
11 we setup source objects, but we support more. This allows one 'Build' file to
47 Assume we have the following project structure:
103 It's possible to include special rule if needed (like we do for flex or bison
|
| /linux-4.1.27/arch/x86/lib/ |
| D | cmpxchg16b_emu.S | 27 # Emulate 'cmpxchg16b %gs:(%rsi)' except we return the result in %al not
30 # Note that this is only useful for a cpuops operation. Meaning that we
|
| D | cmpxchg8b_emu.S | 26 # Emulate 'cmpxchg8b (%esi)' on UP except we don't
|
| /linux-4.1.27/arch/powerpc/boot/dts/ |
| D | ps3.dts | 34 * so we'll put a null entry here.
46 * we'll put a null entries here. These will be initialized after
51 * here so we can bring up both of ours. See smp_setup_cpu_maps().
|
| /linux-4.1.27/arch/mn10300/lib/ |
| D | memset.S | 45 # we want to transfer as much as we can in chunks of 32 bytes
91 # check we set the correct amount
|
| D | memcpy.S | 41 # we want to transfer as much as we can in chunks of 32 bytes
104 # check we copied the correct amount
|
| D | memmove.S | 47 # we want to transfer as much as we can in chunks of 32 bytes
127 # check we copied the correct amount
|
| D | do_csum.S | 57 # we want to checksum as much as we can in chunks of 32 bytes
|
| /linux-4.1.27/Documentation/acpi/ |
| D | enumeration.txt | 7 In addition we are starting to see peripherals integrated in the
12 possible we decided to do following:
35 Since we are using platform devices to represent devices that are not
36 connected to any physical bus we only need to implement a platform driver
165 the platform device drivers. Below is an example where we add ACPI support
307 we need to translate them to the corresponding Linux GPIO descriptors.
312 In the above example we can get the corresponding two GPIO descriptors with
328 /* Now we can use the GPIO descriptors */
341 we provide two ways:
350 If the ACPI namespace has a device that we can match using an ACPI id,
|
| D | method-customizing.txt | 54 We just need to create the ASL code of the method we want to
59 right now, i.e. we can not remove a method currently.
67 method override. i.e. if we want to insert/override multiple
68 ACPI methods, we need to redo step c) ~ g) for multiple times.
|
| /linux-4.1.27/arch/arc/kernel/ |
| D | entry.S | 438 ; Do the Sys Call as we normally would.
464 ; we'd done before calling post hook above
588 ; However, here we need to explicitly save callee regs because
602 ; Ideally we want to discard the Callee reg above, however if this was
655 ; Note that we use realtime STATUS32 (not pt_regs->status32) to
681 ; if L2 IRQ interrupted an L1 ISR, we'd disabled preemption earlier
683 ; undeterministically. Now that we've achieved that, let's reset
695 ; must not be 0 because we would have incremented it.
696 ; If this does happen we simply HALT as it means a BUG !!!
773 ; section (.debug_frame) as loadable. So we force it here.
|
| /linux-4.1.27/Documentation/devicetree/bindings/mtd/ |
| D | gpmc-nor.txt | 19 - gpmc,we-on-ns Write-enable assertion time
20 - gpmc,we-off-ns: Write-enable de-assertion time
68 gpmc,we-on-ns = <54>;
69 gpmc,we-off-ns = <168>;
|
| /linux-4.1.27/Documentation/devicetree/bindings/usb/ |
| D | generic.txt | 4 - maximum-speed: tells USB controllers we want to work up to a certain
9 - dr_mode: tells Dual-Role USB controllers that we want to work on a
|
| D | samsung-usbphy.txt | 40 '0x4' in case we have only one PHY_CONTROL register (e.g.
42 and, '0x8' in case we have two PHY_CONTROL registers (e.g.
96 '0x4' in case we have only one PHY_CONTROL register (e.g.
98 and, '0x8' in case we have two PHY_CONTROL registers (e.g.
|
| D | dwc3.txt | 22 - snps,u2exit_lfps_quirk: set if we want to enable u2exit lfps quirk
23 - snps,u2ss_inp3_quirk: set if we enable P3 OK for U2/SS Inactive quirk
|
| /linux-4.1.27/Documentation/ide/ |
| D | ChangeLog.ide-tape.1995-2002 | 8 * we received non serial read-ahead requests from the
29 * so that we won't have to wait for the tape to finish
31 * as a rewind) before we can access the other device
34 * requests are relatively fast, and once we are
39 * On each read / write request, we now ask the drive
40 * if we can transfer a constant number of bytes
42 * without causing actual media access. If we can't,
43 * we just wait until we can by polling the DSC bit.
44 * This ensures that while we are not transferring
47 * we won't cause an interrupt timeout, as happened
[all …]
|
| /linux-4.1.27/Documentation/i2c/ |
| D | summary | 18 Because the SMBus is mostly a subset of the generalized I2C bus, we can
27 When we talk about I2C, we use the following terms:
|
| /linux-4.1.27/Documentation/devicetree/bindings/ |
| D | ABI.txt | 4 I. Regarding stable bindings/ABI, we quote from the 2013 ARM mini-summit
23 2) Use specific compatible strings so that if we need to add a feature (DMA)
24 in the future, we can create a new compatible string. See I.
|
| /linux-4.1.27/arch/c6x/lib/ |
| D | divremu.S | 22 ;; We use a series of up to 31 subc instructions. First, we find
25 ;; to the, and the number of times we have to execute subc.
27 ;; At the end, we have both the remainder and most of the quotient
44 ;; The loop performs a maximum of 28 steps, so we do the
|
| D | divu.S | 39 ;; We use a series of up to 31 subc instructions. First, we find
42 ;; to the, and the number of times we have to execute subc.
44 ;; At the end, we have both the remainder and most of the quotient
56 ;; The loop performs a maximum of 28 steps, so we do the
|
| /linux-4.1.27/arch/alpha/lib/ |
| D | ev6-clear_user.S | 70 # Note - we never actually use $2, so this is a moot computation
71 # and we can rewrite this later...
98 subq $1, 16, $4 # .. .. .. E : If < 16, we can not use the huge loop
210 # so we will use $0 as the loop counter
|
| D | memchr.S | 45 # search til the end of the address space, we will overflow
46 # below when we find the address of the last byte. Given
47 # that we will never have a 56-bit address space, cropping
|
| D | ev6-memcpy.S | 56 and $16, 7, $1 # E : Are we at 0mod8 yet?
61 cmple $18, 127, $1 # E : Can we unroll the loop?
79 cmple $18, 127, $1 # E : Can we go through the unrolled loop?
195 bne $1, $aligndest # U : go until we are aligned.
|
| D | ev6-memchr.S | 42 # search til the end of the address space, we will overflow
43 # below when we find the address of the last byte. Given
44 # that we will never have a 56-bit address space, cropping
|
| D | ev67-strchr.S | 58 cttz t0, a2 # U0 : speculative (in case we get a match)
75 cttz t3, a2 # U0 : speculative (in case we get a match)
|
| D | strrchr.S | 40 bne t1, $eos # .. e1 : did we already hit the terminator?
51 beq t1, $loop # .. e1 : if we havnt seen a null, loop
|
| /linux-4.1.27/drivers/gpu/drm/msm/ |
| D | NOTES | 3 In the current snapdragon SoC's, we have (at least) 3 different
21 seems like we can do some clever tricks like use GPU to trigger
44 we'll let msm_mdp4_kms provide the irq install/uninstall/etc functions
56 Unlike MDP4, it appears we can get by with a single encoder, rather
68 logistics of finding/mapping io region, irq, etc. Idealy we would
|
| /linux-4.1.27/tools/perf/Documentation/ |
| D | perf-script-python.txt | 75 that, but first we need to record the data that will be processed by
76 that script. Theoretically, there are a couple of ways we could do
79 - we could enable every event under the tracing/events/syscalls
82 useful if we want to later use the guidance we get from the
86 - we can enable the sys_enter and/or sys_exit syscalls found under
91 For this script, we only need to know that a syscall was entered; we
92 don't care how it exited, so we'll use 'perf record' to record only
107 Once we have a perf.data file containing our data, we can use the -g
208 Of course, for this script, we're not interested in printing every
209 trace event, but rather aggregating it in a useful way. So we'll get
[all …]
|
| /linux-4.1.27/Documentation/timers/ |
| D | hrtimers.txt | 7 One might ask the question: we already have a timer subsystem
8 (kernel/timers.c), why do we need two timer subsystems? After a lot of
11 such high-resolution timer implementations in practice, we came to the
15 things into the timer wheel, but we failed. In hindsight, there are
75 hrtimers. E.g. we could decrease the frequency of the timeout subsystem
92 such as radix trees and hashes, we chose the red black tree as the basic
99 (This separate list is also useful for later when we'll introduce
100 high-resolution clocks, where we need separate pending and expired
152 the hrtimer implementation details in praxis, and we also ran the posix
|
| /linux-4.1.27/Documentation/fb/ |
| D | deferred_io.txt | 12 - we get pagefault and reach fault handler
14 - we get page_mkwrite where we add this page to a list
26 have gone quiet, we go and really update the framebuffer which would be
|
| D | viafb.txt | 113 To enable one device, such as DVI only, we can use:
118 For DuoView case, we can use:
124 If CRT is primary and DVI is secondary, we should use:
126 If DVI is primary and CRT is secondary, we should use:
161 we should use:
|
| D | pvr2fb.txt | 51 composite. If none is specified, we guess.
54 vga. If none is specified, we guess.
|
| /linux-4.1.27/drivers/staging/speakup/ |
| D | TODO | 9 Currently, speakup has several issues we know of.
12 ports. Currently, we communicate directly with the hardware
15 such as PCI-based serial ports. Also, there is not a way we can
|
| /linux-4.1.27/drivers/gpu/drm/omapdrm/ |
| D | TODO | 2 . Where should we do eviction (detatch_pages())? We aren't necessarily
3 accessing the pages via a GART, so maybe we need some other threshold
|
| /linux-4.1.27/firmware/keyspan_pda/ |
| D | keyspan_pda.S | 329 ;; hey, what say we RENUMERATE! (TRM p.62)
347 ;; we are back online. the host device will now re-query us
392 ;; Anchor reserves bRequest 0xa0-0xaf, we use small ones
474 ;; are we self-powered? no. can we do remote wakeup? no
613 ;; since we only have one interface, ignore wIndexL, return a 0
745 ;; copy data into buffer. for now, assume we will have enough space
882 ;; can we unthrottle the host tx process?
883 ;; step 1: do we care?
894 ;; a is now write_room. If thresh >= a, we can unthrottle
898 ;; yes, we can unthrottle. remove the threshold and mark a request
[all …]
|
| D | xircom_pgs.S | 367 ;; hey, what say we RENUMERATE! (TRM p.62)
385 ;; we are back online. the host device will now re-query us
430 ;; Anchor reserves bRequest 0xa0-0xaf, we use small ones
512 ;; are we self-powered? no. can we do remote wakeup? no
651 ;; since we only have one interface, ignore wIndexL, return a 0
802 ;; copy data into buffer. for now, assume we will have enough space
943 ;; can we unthrottle the host tx process?
944 ;; step 1: do we care?
955 ;; a is now write_room. If thresh >= a, we can unthrottle
959 ;; yes, we can unthrottle. remove the threshold and mark a request
[all …]
|
| /linux-4.1.27/arch/alpha/kernel/ |
| D | head.S | 61 # masking, and we cannot duplicate the effort without causing problems
88 # Putting it here means we dont have to recompile the whole
|
| /linux-4.1.27/Documentation/devicetree/bindings/net/ |
| D | gpmc-eth.txt | 34 - gpmc,we-on-ns: Write-enable assertion time
35 - gpmc,we-off-ns: Write-enable de-assertion time
76 gpmc,we-on-ns = <54>;
77 gpmc,we-off-ns = <168>;
|
| /linux-4.1.27/drivers/scsi/ |
| D | 53c700.scr | 41 ; The following represent status interrupts we use 3 hex digits for
119 ; SCSI Messages we interpret in the script
190 ; Use this entry if we've just tried to look at the first byte
269 ; Could be we have nothing more to transfer
351 ; we return here after a reselection
364 ; we return here after a reselection
391 ; we return here after a reselection
|
| /linux-4.1.27/Documentation/dmaengine/ |
| D | provider.txt | 30 cycle. For example, we may want to transfer as much data as the
47 transfers we usually have are not, and want to copy data from
52 scatter-gather. So we're left with two cases here: either we have a
53 quite simple DMA controller that doesn't support it, and we'll have to
54 implement it in software, or we have a more advanced DMA controller,
59 over that collection, doing whatever we programmed there.
71 not and the three parameters we saw earlier: the burst size, the
203 - While in the mem2mem case we were having two distinct types to
205 we just have a single transaction type that is supposed to
239 order to implement the actual logic, now that we described what
[all …]
|
| /linux-4.1.27/arch/ia64/hp/sim/boot/ |
| D | bootloader.lds | 21 we can shorten the on-disk segment size. */
42 of the section so we begin them at 0. */
|
| /linux-4.1.27/Documentation/networking/caif/ |
| D | README | 22 Since the CAIF stack is running in the kernel and we want to use the existing
23 TTY, we are installing our physical serial driver as a line discipline above
26 To achieve this we need to install the N_CAIF ldisc from user space.
27 The benefit is that we can hook up to any TTY.
|
| /linux-4.1.27/arch/m68k/math-emu/ |
| D | fp_entry.S | 80 | we jump here after an access error while trying to access
81 | user space, we correct stackpointer and send a SIGSEGV to
95 | send a trace signal if we are debugged
110 | directly, others are on the stack, as we read/write the stack
|
| /linux-4.1.27/Documentation/filesystems/nfs/ |
| D | nfs41-server.txt | 143 * The spec claims this is mandatory, but we don't actually know of any
144 implementations, so we're ignoring it for now. The server returns
155 persist across client reboots). Thus we need not implement this for
169 ca_maxrequestsize request and a ca_maxresponsesize reply, so we may
170 fail to live up to the promise we made in CREATE_SESSION fore channel
|
| /linux-4.1.27/Documentation/devicetree/bindings/serial/ |
| D | sirf-uart.txt | 13 - sirf,uart-has-rtscts: we have hardware flow controller pins in hardware
28 On the board-specific dts, we can put rts-gpios and cts-gpios like
|
| /linux-4.1.27/drivers/gpu/drm/nouveau/nvkm/engine/gr/fuc/ |
| D | hub.fuc | 95 // the IRQ handler will signal the host if we ever get one.. we
96 // may find out if/why we need to handle these if so..
149 // set mmctx base addresses now so we don't have to do it later,
212 // save context size, and tell host we're ready
222 // sleep until we have something to do
346 // none we handle; report to host and ack
362 // anything we didn't handle, bring it to the host's attention
426 // good description for the bits we turn off? Anyways, without this,
548 // it's definitely needed for NVIDIA's, so we may as well use it for now
583 // disable the mmio list now, we don't need/want to execute it again
|
| /linux-4.1.27/Documentation/frv/ |
| D | kernel-ABI.txt | 169 Because accesses to the PSR is so slow, and to disable interrupts we have
170 to access it twice (once to read and once to write), we don't actually
171 disable interrupts at all if we don't have to. What we do instead is use
172 the ICC2 condition code flags to note virtual disablement, such that if we
173 then do take an interrupt, we note the flag, really disable interrupts, set
179 The flags we use are:
|
| /linux-4.1.27/arch/powerpc/lib/ |
| D | div64.S | 33 cntlzw r0,r5 # we are shifting the dividend right
43 divwu r11,r11,r9 # then we divide the shifted quantities
|
| /linux-4.1.27/arch/metag/lib/ |
| D | memcpy.S | 38 ! destination address alignment (i.e we should never copy more than 7
74 ! If there are any remaining bytes use the byte copy loop, otherwise we are done
114 ! Move data 4 bytes before we enter the main loop
175 ! If there are no remaining bytes to copy, we are done.
|
| /linux-4.1.27/Documentation/cgroups/ |
| D | devices.txt | 39 suffice, but we can decide the best way to adequately restrict
43 isn't a descendant of the current one. Or we may want to use
44 CAP_MAC_ADMIN, since we really are trying to lock down root.
47 task to a new cgroup. (Again we'll probably want to change that).
|
| D | memory.txt | 4 rewrite. It still contains a useful information so we are keeping it
14 When we mention a cgroup (cgroupfs's directory) with memory controller,
15 we call it "memory cgroup". When you see git-log and source code, you'll
17 In this document, we avoid using it.
100 that we handle both page cache and RSS together. Another request was raised
186 causing page fault. So, we avoid accounting at swap-in I/O.
190 Note: we just account pages-on-LRU because our purpose is to control amount
230 memory+swap. In other words, when we want to limit the usage of swap without
244 global VM. When a cgroup goes over its limit, we first try
254 NOTE: Reclaim does not work for the root cgroup, since we cannot set any
[all …]
|
| /linux-4.1.27/arch/arm/boot/compressed/ |
| D | head-sa1100.S | 23 @ UNTIL we've something like an open bootldr
|
| /linux-4.1.27/Documentation/sh/ |
| D | new-machine.txt | 110 explain this, we use some examples for adding an imaginary board. For
111 setup code, we're required at the very least to provide definitions for
129 * If our hardware actually existed, we would do real
137 * and also presume that we've defined foo_timer_init to
205 Now that we have the corresponding directories setup, and all of the
228 provided that we've placed everything in the arch/sh/boards/vapor/ directory.
238 list. The method for doing this is self explanatory, and so we won't waste
243 /* Make sure we're on the FooTech Vaporboard */
|
| /linux-4.1.27/arch/m32r/kernel/ |
| D | entry.S | 164 DISABLE_INTERRUPTS(r4) ; make sure we don't miss an interrupt
229 DISABLE_INTERRUPTS(r4) ; make sure we don't miss an interrupt
|
| /linux-4.1.27/Documentation/devicetree/bindings/mips/cavium/ |
| D | bootbus.txt | 38 - cavium,t-we: A cell specifying the WE timing (in nS).
91 cavium,t-we = <45>;
111 cavium,t-we = <150>;
|
| /linux-4.1.27/arch/arm/mach-zynq/ |
| D | headsmp.S | 14 ARM_BE8(setend be) @ ensure we are in BE8 mode
|
| /linux-4.1.27/arch/m68k/ifpsp060/src/ |
| D | pfpsp.S | 953 # maybe we can make these entry points ONLY the OVFL entry points of each routine.
963 # underflow exception. Since this is incorrect, we need to check
969 # the exceptional possibilities we have left ourselves with are ONLY overflow
988 # overflow is enabled AND overflow, of course, occurred. so, we have the EXOP
1320 # we determine the highest priority exception(if any) set by the
1394 # here, we insert the correct fsave status value into the fsave frame for the
1483 # here, we count on norm not to alter a0...
1560 # it here. if it was used from supervisor mode, then we have to handle this
1586 # the extended precision result is still in fp0. but, we need to save it
1587 # somewhere on the stack until we can copy it to its final resting place.
[all …]
|
| D | fpsp.S | 954 # maybe we can make these entry points ONLY the OVFL entry points of each routine.
964 # underflow exception. Since this is incorrect, we need to check
970 # the exceptional possibilities we have left ourselves with are ONLY overflow
989 # overflow is enabled AND overflow, of course, occurred. so, we have the EXOP
1321 # we determine the highest priority exception(if any) set by the
1395 # here, we insert the correct fsave status value into the fsave frame for the
1484 # here, we count on norm not to alter a0...
1561 # it here. if it was used from supervisor mode, then we have to handle this
1587 # the extended precision result is still in fp0. but, we need to save it
1588 # somewhere on the stack until we can copy it to its final resting place.
[all …]
|
| /linux-4.1.27/arch/mn10300/kernel/ |
| D | mn10300-serial-low.S | 62 # - induces a scheduler tick timer interrupt when done, which we then subvert
109 # - induces a scheduler tick timer interrupt when done, which we then subvert
152 and __UART_XMIT_SIZE-1,d2 # see if we just made a hole
|
| /linux-4.1.27/arch/sparc/kernel/ |
| D | wof.S | 124 rett %t_npc ! we are done
359 andcc %glob_tmp, 0x2, %g0 ! did we fault?
364 b spwin_user_stack_is_bolixed + 0x4 ! we faulted, ugh
|
| /linux-4.1.27/fs/ntfs/ |
| D | Kconfig | 63 While we cannot guarantee that it will not damage any data, we have
65 damaged someones data so we assume it is perfectly safe to use.
|
| /linux-4.1.27/drivers/staging/olpc_dcon/ |
| D | TODO | 2 - see if vx855 gpio API can be made similar enough to cs5535 so we can
|
| /linux-4.1.27/arch/x86/boot/ |
| D | code16gcc.h | 8 # gcc 4.9+ has a real -m16 option so we can drop this hack long term.
|
| /linux-4.1.27/Documentation/sound/oss/ |
| D | README.modules | 82 possible that we can't find a large enough free block in this region after
85 them when the module is unloaded. For this to be effective we need to load
87 init script, and keep them around until we shut down. This is a little
90 To make the sound driver use persistent DMA buffers we need to pass the
|
| D | VIBRA16 | 10 Playing with a SB Vibra 16x soundcard we found it very difficult
19 8-bit and a 16-bit dma, which we could not allocate for vibra... it supports
|
| /linux-4.1.27/arch/arm/mm/ |
| D | tlb-v4.S | 37 retne lr @ no, we dont do anything
|
| /linux-4.1.27/arch/mn10300/include/asm/ |
| D | frame.inc | 51 # we may be holding current in E2
64 # - we need that when returning from interrupts to kernel mode
|
| /linux-4.1.27/Documentation/security/ |
| D | tomoyo.txt | 23 Materials we prepared for seminars and symposiums are available at
48 and both should be used together. But unfortunately, so far, we cannot enable
|
| /linux-4.1.27/arch/arm/mach-shmobile/ |
| D | headsmp-scu.S | 32 lsl r1, r1, #3 @ we will shift by cpu_id * 8 bits
|
| /linux-4.1.27/Documentation/mtd/nand/ |
| D | pxa3xx-nand.txt | 15 For instance, if we choose a 2048 data chunk and set "BCH" ECC (see below)
16 we'll have this layout in the pages:
36 So, in order to achieve reading (for instance), we issue several READ0 commands
|
| /linux-4.1.27/arch/arm/kvm/ |
| D | interrupts.S | 120 @ then it is safer if we deny guests from using it as well.
184 @ Restore FPEXC_EN which we clobbered on entry
410 @ Check if we need the fault information
|
| /linux-4.1.27/Documentation/trace/ |
| D | ftrace-design.txt | 8 Here we will cover the architecture pieces that the common function tracing
288 With the header out of the way, we can fill out the assembly code. While we
297 Before we get confused anymore, let's check out some pseudo code so you can
321 This might look a little odd at first, but keep in mind that we will be runtime
322 patching multiple things. First, only functions that we actually want to trace
323 will be patched to call ftrace_caller(). Second, since we only have one tracer
324 active at a time, we will patch the ftrace_caller() function itself to call the
|
| /linux-4.1.27/drivers/usb/misc/sisusbvga/ |
| D | sisusb_con.c | 720 int ul, we, p, st; in sisusbcon_scrolldelta() local
742 we = sisusb->con_rolled_over + c->vc_size_row; in sisusbcon_scrolldelta()
747 we = sisusb->scrbuf_size; in sisusbcon_scrolldelta()
751 p = (c->vc_visible_origin - sisusb->scrbuf - ul + we) % we + in sisusbcon_scrolldelta()
754 st = (c->vc_origin - sisusb->scrbuf - ul + we) % we; in sisusbcon_scrolldelta()
765 c->vc_visible_origin = sisusb->scrbuf + (p + ul) % we; in sisusbcon_scrolldelta()
|
| /linux-4.1.27/arch/arc/lib/ |
| D | strchr-700.S | 44 breq r7,0,.Loop ; For speed, we want this branch to be unaligned.
48 breq r12,0,.Loop ; For speed, we want this branch to be unaligned.
|
| /linux-4.1.27/arch/cris/boot/compressed/ |
| D | head_v10.S | 27 ;; We need to initialze DRAM registers before we start using the DRAM
58 ;; in the flash (since we wont try to copy it to DRAM
|