| /linux-3.3/drivers/media/video/cx18/ |
| D | cx23418.h | 11 * This program is distributed in the hope that it will be useful,
33 IN[0] - Task ID. This is one of the XPU_CMD_MASK_YYY where XPU is
41 IN[0] - Task handle. Hanlde of the task to destroy
63 IN[0] - audio parameters (same as CX18_CPU_SET_AUDIO_PARAMETERS?)
64 IN[1] - caller buffer address, or 0
69 IN[0] - encoding method to stop
79 IN[0] - Task handle. Handle of the task
80 IN[1] - Offset of the MDL_ACK from the beginning of the local DDR.
81 IN[2] - Number of CNXT_MDL_ACK structures in the array pointed to by IN[1]
86 IN[0] - A value to log
[all …]
|
| /linux-3.3/crypto/ |
| D | rmd320.c | 54 static void rmd320_transform(u32 *state, const __le32 *in) in rmd320_transform() argument
73 ROUND(aa, bb, cc, dd, ee, F1, K1, in[0], 11); in rmd320_transform()
74 ROUND(ee, aa, bb, cc, dd, F1, K1, in[1], 14); in rmd320_transform()
75 ROUND(dd, ee, aa, bb, cc, F1, K1, in[2], 15); in rmd320_transform()
76 ROUND(cc, dd, ee, aa, bb, F1, K1, in[3], 12); in rmd320_transform()
77 ROUND(bb, cc, dd, ee, aa, F1, K1, in[4], 5); in rmd320_transform()
78 ROUND(aa, bb, cc, dd, ee, F1, K1, in[5], 8); in rmd320_transform()
79 ROUND(ee, aa, bb, cc, dd, F1, K1, in[6], 7); in rmd320_transform()
80 ROUND(dd, ee, aa, bb, cc, F1, K1, in[7], 9); in rmd320_transform()
81 ROUND(cc, dd, ee, aa, bb, F1, K1, in[8], 11); in rmd320_transform()
[all …]
|
| D | rmd160.c | 54 static void rmd160_transform(u32 *state, const __le32 *in) in rmd160_transform() argument
73 ROUND(aa, bb, cc, dd, ee, F1, K1, in[0], 11); in rmd160_transform()
74 ROUND(ee, aa, bb, cc, dd, F1, K1, in[1], 14); in rmd160_transform()
75 ROUND(dd, ee, aa, bb, cc, F1, K1, in[2], 15); in rmd160_transform()
76 ROUND(cc, dd, ee, aa, bb, F1, K1, in[3], 12); in rmd160_transform()
77 ROUND(bb, cc, dd, ee, aa, F1, K1, in[4], 5); in rmd160_transform()
78 ROUND(aa, bb, cc, dd, ee, F1, K1, in[5], 8); in rmd160_transform()
79 ROUND(ee, aa, bb, cc, dd, F1, K1, in[6], 7); in rmd160_transform()
80 ROUND(dd, ee, aa, bb, cc, F1, K1, in[7], 9); in rmd160_transform()
81 ROUND(cc, dd, ee, aa, bb, F1, K1, in[8], 11); in rmd160_transform()
[all …]
|
| D | rmd256.c | 50 static void rmd256_transform(u32 *state, const __le32 *in) in rmd256_transform() argument
67 ROUND(aa, bb, cc, dd, F1, K1, in[0], 11); in rmd256_transform()
68 ROUND(dd, aa, bb, cc, F1, K1, in[1], 14); in rmd256_transform()
69 ROUND(cc, dd, aa, bb, F1, K1, in[2], 15); in rmd256_transform()
70 ROUND(bb, cc, dd, aa, F1, K1, in[3], 12); in rmd256_transform()
71 ROUND(aa, bb, cc, dd, F1, K1, in[4], 5); in rmd256_transform()
72 ROUND(dd, aa, bb, cc, F1, K1, in[5], 8); in rmd256_transform()
73 ROUND(cc, dd, aa, bb, F1, K1, in[6], 7); in rmd256_transform()
74 ROUND(bb, cc, dd, aa, F1, K1, in[7], 9); in rmd256_transform()
75 ROUND(aa, bb, cc, dd, F1, K1, in[8], 11); in rmd256_transform()
[all …]
|
| D | rmd128.c | 50 static void rmd128_transform(u32 *state, const __le32 *in) in rmd128_transform() argument
67 ROUND(aa, bb, cc, dd, F1, K1, in[0], 11); in rmd128_transform()
68 ROUND(dd, aa, bb, cc, F1, K1, in[1], 14); in rmd128_transform()
69 ROUND(cc, dd, aa, bb, F1, K1, in[2], 15); in rmd128_transform()
70 ROUND(bb, cc, dd, aa, F1, K1, in[3], 12); in rmd128_transform()
71 ROUND(aa, bb, cc, dd, F1, K1, in[4], 5); in rmd128_transform()
72 ROUND(dd, aa, bb, cc, F1, K1, in[5], 8); in rmd128_transform()
73 ROUND(cc, dd, aa, bb, F1, K1, in[6], 7); in rmd128_transform()
74 ROUND(bb, cc, dd, aa, F1, K1, in[7], 9); in rmd128_transform()
75 ROUND(aa, bb, cc, dd, F1, K1, in[8], 11); in rmd128_transform()
[all …]
|
| D | md4.c | 9 * by Colin Plumb in 1993.
84 static void md4_transform(u32 *hash, u32 const *in) in md4_transform() argument
93 ROUND1(a, b, c, d, in[0], 3); in md4_transform()
94 ROUND1(d, a, b, c, in[1], 7); in md4_transform()
95 ROUND1(c, d, a, b, in[2], 11); in md4_transform()
96 ROUND1(b, c, d, a, in[3], 19); in md4_transform()
97 ROUND1(a, b, c, d, in[4], 3); in md4_transform()
98 ROUND1(d, a, b, c, in[5], 7); in md4_transform()
99 ROUND1(c, d, a, b, in[6], 11); in md4_transform()
100 ROUND1(b, c, d, a, in[7], 19); in md4_transform()
[all …]
|
| /linux-3.3/lib/ |
| D | md5.c | 10 #define MD5STEP(f, w, x, y, z, in, s) \ argument
11 (w += f(x, y, z) + in, w = (w<<s | w>>(32-s)) + x)
13 void md5_transform(__u32 *hash, __u32 const *in) in md5_transform() argument
22 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); in md5_transform()
23 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); in md5_transform()
24 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17); in md5_transform()
25 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22); in md5_transform()
26 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7); in md5_transform()
27 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12); in md5_transform()
28 MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17); in md5_transform()
[all …]
|
| D | halfmd4.c | 13 * good macro practice, in favor of extra legibility.
25 __u32 half_md4_transform(__u32 buf[4], __u32 const in[8]) in half_md4_transform()
30 ROUND(F, a, b, c, d, in[0] + K1, 3); in half_md4_transform()
31 ROUND(F, d, a, b, c, in[1] + K1, 7); in half_md4_transform()
32 ROUND(F, c, d, a, b, in[2] + K1, 11); in half_md4_transform()
33 ROUND(F, b, c, d, a, in[3] + K1, 19); in half_md4_transform()
34 ROUND(F, a, b, c, d, in[4] + K1, 3); in half_md4_transform()
35 ROUND(F, d, a, b, c, in[5] + K1, 7); in half_md4_transform()
36 ROUND(F, c, d, a, b, in[6] + K1, 11); in half_md4_transform()
37 ROUND(F, b, c, d, a, in[7] + K1, 19); in half_md4_transform()
[all …]
|
| /linux-3.3/arch/blackfin/include/asm/ |
| D | bfin_can.h | 258 #define RMP0 0x0001 /* RX Message Pending In Mailbox 0 */
259 #define RMP1 0x0002 /* RX Message Pending In Mailbox 1 */
260 #define RMP2 0x0004 /* RX Message Pending In Mailbox 2 */
261 #define RMP3 0x0008 /* RX Message Pending In Mailbox 3 */
262 #define RMP4 0x0010 /* RX Message Pending In Mailbox 4 */
263 #define RMP5 0x0020 /* RX Message Pending In Mailbox 5 */
264 #define RMP6 0x0040 /* RX Message Pending In Mailbox 6 */
265 #define RMP7 0x0080 /* RX Message Pending In Mailbox 7 */
266 #define RMP8 0x0100 /* RX Message Pending In Mailbox 8 */
267 #define RMP9 0x0200 /* RX Message Pending In Mailbox 9 */
[all …]
|
| /linux-3.3/fs/udf/ |
| D | udfend.h | 7 static inline struct kernel_lb_addr lelb_to_cpu(struct lb_addr in) in lelb_to_cpu() argument
11 out.logicalBlockNum = le32_to_cpu(in.logicalBlockNum); in lelb_to_cpu()
12 out.partitionReferenceNum = le16_to_cpu(in.partitionReferenceNum); in lelb_to_cpu()
17 static inline struct lb_addr cpu_to_lelb(struct kernel_lb_addr in) in cpu_to_lelb() argument
21 out.logicalBlockNum = cpu_to_le32(in.logicalBlockNum); in cpu_to_lelb()
22 out.partitionReferenceNum = cpu_to_le16(in.partitionReferenceNum); in cpu_to_lelb()
27 static inline struct short_ad lesa_to_cpu(struct short_ad in) in lesa_to_cpu() argument
31 out.extLength = le32_to_cpu(in.extLength); in lesa_to_cpu()
32 out.extPosition = le32_to_cpu(in.extPosition); in lesa_to_cpu()
37 static inline struct short_ad cpu_to_lesa(struct short_ad in) in cpu_to_lesa() argument
[all …]
|
| /linux-3.3/Documentation/scheduler/ |
| D | sched-stats.txt | 6 mainline kernel in 2.6.20 although it is identical to the stats from version
7 12 which was in the kernel from 2.6.13-2.6.19 (version 13 never saw a kernel
12 In version 14 of schedstat, there is at least one level of domain
14 domain. Domains have no particular names in this implementation, but
19 field in the domain stats is a bit map indicating which cpus are affected
24 the change in the counters at each subsequent observation. A perl script
30 reason to change versions is changes in the output format. For those wishing
50 7) sum of all time spent running by tasks on this processor (in jiffies)
51 8) sum of all time spent waiting to run by tasks on this processor (in
60 will not appear in the output.)
[all …]
|
| /linux-3.3/arch/avr32/mach-at32ap/ |
| D | pio.h | 44 /* Bitfields in PER */
46 /* Bitfields in PDR */
48 /* Bitfields in PSR */
50 /* Bitfields in OER */
52 /* Bitfields in ODR */
54 /* Bitfields in OSR */
56 /* Bitfields in IFER */
58 /* Bitfields in IFDR */
60 /* Bitfields in IFSR */
62 /* Bitfields in SODR */
[all …]
|
| /linux-3.3/Documentation/ |
| D | sysfs-rules.txt | 1 Rules on how to access information in the Linux kernel sysfs
9 To minimize the risk of breaking users of sysfs, which are in most cases
23 implementation details in its own API. Therefore it is not better than
25 Also, it is not actively maintained, in the sense of reflecting the
28 violates many of the rules in this document.
39 interfaces, and such that you can rely on in userspace. Everything is
42 applications that look for devices in sysfs.
46 - identical to the DEVPATH value in the event sent from the kernel
48 - the unique key to the device at that point in time
56 - using or exposing symlink values as elements in a devpath string
[all …]
|
| /linux-3.3/arch/arm/plat-samsung/ |
| D | Kconfig | 95 Use additional GPIO space in addition to the GPIO's the SOC
125 Core support for the ADC block found in the Samsung SoC systems
129 # device definitions to compile in
134 Compile in platform device definitions for HSMMC code
139 Compile in platform device definitions for HSMMC channel 1
144 Compile in platform device definitions for HSMMC channel 2
149 Compile in platform device definitions for HSMMC channel 3
154 Compile in platform device definitions for HWMON
159 Compile in platform device definitions for I2C channel 1
164 Compile in platform device definitions for I2C channel 2
[all …]
|
| /linux-3.3/arch/x86/math-emu/ |
| D | errors.c | 17 | other processes using the emulator while swapping is in progress. |
73 Called for opcodes which are illegal and which are known to result in a
197 printk("Whoops! Error in errors.c: tag%d is %d ", i, in FPU_printall()
222 EX_INTERNAL, "INTERNAL BUG in " FPU_VERSION}, {
231 0x14 in fpu_etc.c
232 0x1nn in a *.c file:
233 0x101 in reg_add_sub.c
234 0x102 in reg_mul.c
235 0x104 in poly_atan.c
236 0x105 in reg_mul.c
[all …]
|
| /linux-3.3/Documentation/block/ |
| D | biodoc.txt | 1 Notes on the Generic Block Layer Rewrite in Linux 2.5
6 Suparna Bhattacharya <suparna@in.ibm.com>
14 These are some notes describing some aspects of the 2.5 block layer in the
18 Please mail corrections & suggestions to suparna@in.ibm.com.
38 while it was still work-in-progress:
59 2.2 The bio struct in detail (multi-page io unit)
60 2.3 Changes in the request structure
64 3.2.1 Traversing segments and completion units in a request
86 Let us discuss the changes in the context of how some overall goals for the
97 important especially in the light of ever improving hardware capabilities
[all …]
|
| /linux-3.3/Documentation/kbuild/ |
| D | makefiles.txt | 11 --- 3.2 Built-in object goals - obj-y
15 --- 3.6 Descending down in directories
82 any built-in or modular targets.
99 working on. In order to do this effectively, they need some overall
116 kbuild infrastructure. This chapter introduces the syntax used in the
136 This tells kbuild that there is one object in that directory, named
145 $(CONFIG_FOO) evaluates to either y (for built-in) or m (for module).
149 --- 3.2 Built-in object goals - obj-y
152 in the $(obj-y) lists. These lists depend on the kernel
156 "$(LD) -r" to merge these files into one built-in.o file.
[all …]
|
| /linux-3.3/drivers/block/paride/ |
| D | Transition-notes | 6 one in ps_set_intr() (A) and two in ps_tq_int() (B and C).
15 ps_tq_int() are sandwiched between {A,C} and B in that sequence,
17 moments which, in turn, can not exceed the number of A and C.
18 In other words, the sequence of events is (A or C set ps_tq_active to
24 * in do_pd_request1(): to calls of pi_do_claimed() and return in
26 * in next_request(): to call of do_pd_request1()
27 * in do_pd_read(): to call of ps_set_intr()
28 * in do_pd_read_start(): to calls of pi_do_claimed(), next_request()
30 * in do_pd_read_drq(): to calls of pi_do_claimed() and next_request()
31 * in do_pd_write(): to call of ps_set_intr()
[all …]
|
| /linux-3.3/arch/powerpc/include/asm/ |
| D | kvm_para.h | 6 * This program is distributed in the hope that it will be useful,
72 extern unsigned long kvm_hypercall(unsigned long *in,
83 static unsigned long kvm_hypercall(unsigned long *in, in kvm_hypercall() argument
94 unsigned long in[8]; in kvm_hypercall0_1() local
98 r = kvm_hypercall(in, out, nr | HC_VENDOR_KVM); in kvm_hypercall0_1()
106 unsigned long in[8]; in kvm_hypercall0() local
109 return kvm_hypercall(in, out, nr | HC_VENDOR_KVM); in kvm_hypercall0()
114 unsigned long in[8]; in kvm_hypercall1() local
117 in[0] = p1; in kvm_hypercall1()
118 return kvm_hypercall(in, out, nr | HC_VENDOR_KVM); in kvm_hypercall1()
[all …]
|
| /linux-3.3/Documentation/power/ |
| D | pci.txt | 27 In general, power management is a feature allowing one to save energy by putting
28 devices into states in which they draw less power (low-power states) at the
38 PCI devices may be put into low-power states in two ways, by using the device
40 or with the help of platform firmware, such as an ACPI BIOS. In the first
42 in what follows, the device power state is changed as a result of writing a
58 In turn, if the methods provided by the platform firmware are used for changing
60 preparing the device to generate wakeup signals. In that case, however, it
65 Thus in many situations both the native and the platform-based power management
77 Spec, it has an 8 byte power management capability field in its PCI
83 in that state. However, the higher the number, the longer the latency for
[all …]
|
| /linux-3.3/Documentation/cgroups/ |
| D | cpusets.txt | 41 Nodes to a set of tasks. In this document "Memory Node" refers to
46 hierarchy visible in a virtual file system. These are the essential
50 Cpusets use the generic cgroup subsystem described in
54 include CPUs in its CPU affinity mask, and using the mbind(2) and
55 set_mempolicy(2) system calls to include Memory Nodes in its memory
57 CPUs or Memory Nodes not in that cpuset. The scheduler will not
58 schedule a task on a CPU that is not allowed in its cpus_allowed
60 node that is not allowed in the requesting task's mems_allowed vector.
62 User level code may create and destroy cpusets by name in the cgroup
102 leverages existing CPU and Memory Placement facilities in the Linux
[all …]
|
| /linux-3.3/Documentation/filesystems/ |
| D | coda.txt | 11 named Venus, as well as tools to manipulate ACLs, to log in, etc. The
12 client needs to have the Coda filesystem selected in the kernel
148 11.. IInnttrroodduuccttiioonn
152 A key component in the Coda Distributed File System is the cache
156 When processes on a Coda enabled system access files in the Coda
157 filesystem, requests are directed at the filesystem layer in the
175 Historically Coda was implemented in a BSD file system in Mach 2.6.
180 filesystem driver for Coda in a BSD system. However, other operating
189 kernel should be documented in great detail. This is the aim of this
194 22.. SSeerrvviicciinngg CCooddaa ffiilleessyysstteemm ccaallllss
[all …]
|
| D | xfs-delayed-logging-design.txt | 4 Introduction to Re-logging in XFS
8 such as inodes and dquots, are logged in logical format where the details
9 logged are made up of the changes to in-core structures rather than on-disk
18 modifications to a single object to be carried in the log at any given time.
23 changes in the new transaction that is written to the log.
26 written to disk after change D, we would see in the log the following series
39 In other words, each time an object is relogged, the new transaction contains
40 the aggregation of all the previous changes currently held only in the log.
42 This relogging technique also allows objects to be moved forward in the log so
44 moving forward. This can be seen in the table above by the changing
[all …]
|
| /linux-3.3/include/xen/interface/ |
| D | physdev.h | 4 * deal in the Software without restriction, including without limitation the
9 * The above copyright notice and this permission notice shall be included in
14 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
16 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
17 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
18 * DEALINGS IN THE SOFTWARE.
37 /* IN */
47 /* IN */
67 /* IN */
77 /* IN */
[all …]
|
| /linux-3.3/Documentation/scsi/ |
| D | ChangeLog.lpfc | 16 other than unmap list in lpfc_find_target(). Otherwise INQUIRY
17 to luns on nodes in NPR or other relevant states (PLOGI,
19 * Removed FC_TRANSPORT_PATCHESxxx defines. They're in 2.6.12-rc1.
27 * Changes in lpfc_abort_handler(): Return SUCCESS if we did not
28 find command in both TX and TX completion queues. Return ERROR
31 * Zero-out response sense length in lpfc_scsi_prep_cmnd to prevent
34 * Moved clearing of host_scribble inside host_lock in IO
37 * Allow hex format numbers in sysfs attribute setting. Fix
38 application hang when invalid numbers are used in sysfs
41 * Clear host_scribble in the scsi_cmnd structure when failing in
[all …]
|