Home
last modified time | relevance | path

Searched full:a (Results 1 – 25 of 10403) sorted by relevance

12345678910>>...417

/linux-3.3/drivers/isdn/hardware/eicon/
Dos_bri.c26 extern int diva_card_read_xlog(diva_os_xdi_adapter_t * a);
36 static int diva_bri_cleanup_adapter(diva_os_xdi_adapter_t * a);
37 static dword diva_bri_get_serial_number(diva_os_xdi_adapter_t * a);
38 static int diva_bri_cmd_card_proc(struct _diva_os_xdi_adapter *a,
40 static int diva_bri_reregister_io(diva_os_xdi_adapter_t * a);
47 static int diva_bri_stop_adapter(diva_os_xdi_adapter_t * a);
49 static void diva_bri_set_addresses(diva_os_xdi_adapter_t * a) in diva_bri_set_addresses() argument
51 a->resources.pci.mem_type_id[MEM_TYPE_RAM] = 0; in diva_bri_set_addresses()
52 a->resources.pci.mem_type_id[MEM_TYPE_CFG] = 1; in diva_bri_set_addresses()
53 a->resources.pci.mem_type_id[MEM_TYPE_ADDRESS] = 2; in diva_bri_set_addresses()
[all …]
Dos_pri.c31 extern int diva_card_read_xlog(diva_os_xdi_adapter_t * a);
40 static int diva_pri_cleanup_adapter(diva_os_xdi_adapter_t * a);
41 static int diva_pri_cmd_card_proc(struct _diva_os_xdi_adapter *a,
43 static int pri_get_serial_number(diva_os_xdi_adapter_t * a);
44 static int diva_pri_stop_adapter(diva_os_xdi_adapter_t * a);
45 static dword diva_pri_detect_dsps(diva_os_xdi_adapter_t * a);
60 static void diva_pri_set_addresses(diva_os_xdi_adapter_t * a) in diva_pri_set_addresses() argument
62 a->resources.pci.mem_type_id[MEM_TYPE_ADDRESS] = 0; in diva_pri_set_addresses()
63 a->resources.pci.mem_type_id[MEM_TYPE_CONTROL] = 2; in diva_pri_set_addresses()
64 a->resources.pci.mem_type_id[MEM_TYPE_CONFIG] = 4; in diva_pri_set_addresses()
[all …]
Dos_4bri.c30 extern void diva_add_slave_adapter(diva_os_xdi_adapter_t * a);
35 extern int diva_card_read_xlog(diva_os_xdi_adapter_t * a);
60 static int diva_4bri_cleanup_adapter(diva_os_xdi_adapter_t * a);
61 static int _4bri_get_serial_number(diva_os_xdi_adapter_t * a);
62 static int diva_4bri_cmd_card_proc(struct _diva_os_xdi_adapter *a,
65 static int diva_4bri_cleanup_slave_adapters(diva_os_xdi_adapter_t * a);
66 static int diva_4bri_write_fpga_image(diva_os_xdi_adapter_t * a,
76 static int diva_4bri_stop_adapter(diva_os_xdi_adapter_t * a);
102 static void diva_4bri_set_addresses(diva_os_xdi_adapter_t *a) in diva_4bri_set_addresses() argument
104 dword offset = a->resources.pci.qoffset; in diva_4bri_set_addresses()
[all …]
Ddi.c18 implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
21 You should have received a copy of the GNU General Public License
43 void pr_out(ADAPTER * a);
44 byte pr_dpc(ADAPTER * a);
45 static byte pr_ready(ADAPTER * a);
78 void pr_out(ADAPTER * a) in pr_out() argument
92 /* while a request is pending ... */ in pr_out()
93 e_no = look_req(a); in pr_out()
99 ReadyCount = pr_ready(a); in pr_out()
107 next_req(a); in pr_out()
[all …]
/linux-3.3/Documentation/i2c/
Dsmbus-protocol4 The following is a summary of the SMBus protocol. It applies to
10 which is a subset from the I2C protocol. Fortunately, many devices use
13 If you write a driver for some I2C device, please try to use the SMBus
20 Below is a list of SMBus protocol operations, and the functions executing
22 don't match these function names. For some of the operations which pass a
24 a different protocol operation entirely.
33 A, NA (1 bit) : Accept and reverse accept bit.
35 get a 10 bit I2C address.
36 Comm (8 bits): Command byte, a data byte which often selects a register on
38 Data (8 bits): A plain data byte. Sometimes, I write DataLow, DataHigh
[all …]
Di2c-protocol9 A, NA (1 bit) : Accept and reverse accept bit.
11 get a 10 bit I2C address.
12 Comm (8 bits): Command byte, a data byte which often selects a register on
14 Data (8 bits): A plain data byte. Sometimes, I write DataLow, DataHigh
16 Count (8 bits): A data byte containing the length of a block operation.
26 S Addr Wr [A] Data [A] Data [A] ... [A] Data [A] P
34 S Addr Rd [A] [Data] A [Data] A ... A [Data] NA P
42 They are just like the above transactions, but instead of a stop bit P
43 a start bit S is sent and the transaction continues. An example of
44 a byte read, followed by a byte write:
[all …]
/linux-3.3/sound/pci/au88x0/
Dau88x0_a3d.c19 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 * You should have received a copy of the GNU General Public License
33 a3dsrc_SetTimeConsts(a3dsrc_t * a, short HrtfTrack, short ItdTrack, in a3dsrc_SetTimeConsts() argument
36 vortex_t *vortex = (vortex_t *) (a->vortex); in a3dsrc_SetTimeConsts()
38 a3d_addrA(a->slice, a->source, A3D_A_HrtfTrackTC), HrtfTrack); in a3dsrc_SetTimeConsts()
40 a3d_addrA(a->slice, a->source, A3D_A_ITDTrackTC), ItdTrack); in a3dsrc_SetTimeConsts()
42 a3d_addrA(a->slice, a->source, A3D_A_GainTrackTC), GTrack); in a3dsrc_SetTimeConsts()
44 a3d_addrA(a->slice, a->source, A3D_A_CoeffTrackTC), CTrack); in a3dsrc_SetTimeConsts()
49 a3dsrc_GetTimeConsts(a3dsrc_t * a, short *HrtfTrack, short *ItdTrack,
59 a3dsrc_SetAtmosTarget(a3dsrc_t * a, short aa, short b, short c, short d, in a3dsrc_SetAtmosTarget() argument
[all …]
/linux-3.3/tools/perf/util/
Dctype.c10 A = GIT_ALPHA, enumerator
20 /* 0 1 2 3 4 5 6 7 8 9 A B C D E F */
26 P, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, /* 64.. 79 */
27 A, A, A, A, A, A, A, A, A, A, A, G, G, P, R, P, /* 80.. 95 */
28 P, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, /* 96..111 */
29 A, A, A, A, A, A, A, A, A, A, A, R, R, P, P, 0, /* 112..127 */
/linux-3.3/firmware/keyspan_pda/
Dxircom_pgs.S3 * Firmware for the Keyspan PDA Serial Adapter, a USB serial port based on
13 * "Keyspan PDA Serial Adapter" is probably a copyright of Keyspan, the
17 * in a little widget that has a DB-9 on one end and a USB plug on the other.
19 * as a baud-rate generator. The wiring is:
31 * into a separate .h file.
41 * it will request a "tx unthrottle" interrupt. If sending a serial character
42 * empties the ring below the desired threshold, we set a bit that will send
72 * simulating a bus disconnect, then reconnect with a different device ID
89 * a bit to make it build.
94 * KeySpan, for making a handy, cheap ($40) widget that was so easy to take
[all …]
Dkeyspan_pda.S3 * Firmware for the Keyspan PDA Serial Adapter, a USB serial port based on
13 * "Keyspan PDA Serial Adapter" is probably a copyright of Keyspan, the
17 * in a little widget that has a DB-9 on one end and a USB plug on the other.
19 * as a baud-rate generator. The wiring is:
31 * into a separate .h file.
41 * it will request a "tx unthrottle" interrupt. If sending a serial character
42 * empties the ring below the desired threshold, we set a bit that will send
72 * simulating a bus disconnect, then reconnect with a different device ID
89 * a bit to make it build.
94 * KeySpan, for making a handy, cheap ($40) widget that was so easy to take
[all …]
/linux-3.3/net/ceph/crush/
Dhash.c8 * a, b = random bits, c = input and output
10 #define crush_hashmix(a, b, c) do { \ argument
11 a = a-b; a = a-c; a = a^(c>>13); \
12 b = b-c; b = b-a; b = b^(a<<8); \
13 c = c-a; c = c-b; c = c^(b>>13); \
14 a = a-b; a = a-c; a = a^(c>>12); \
15 b = b-c; b = b-a; b = b^(a<<16); \
16 c = c-a; c = c-b; c = c^(b>>5); \
17 a = a-b; a = a-c; a = a^(c>>3); \
18 b = b-c; b = b-a; b = b^(a<<10); \
[all …]
/linux-3.3/Documentation/filesystems/
Dsharedsubtree.txt20 A process wants to clone its own namespace, but still wants to access the CD
33 a. shared mount
39 2a) A shared mount can be replicated to as many mountpoints and all the
44 Let's say /mnt has a mount that is shared.
56 a b c
59 a b c
61 Now let's say we mount a device at /tmp/a
62 # mount /dev/sd0 /tmp/a
64 #ls /tmp/a
67 #ls /mnt/a
[all …]
/linux-3.3/lib/
Dsha1.c22 * with a 'W(t)=(val);asm("":"+m" (W(t))' there instead, as
31 * On ARM we get the best code generation by forcing a full memory barrier
54 #define SHA_ROUND(t, input, fn, constant, A, B, C, D, E) do { \ argument
56 E += TEMP + rol32(A,5) + (fn) + (constant); \
59 #define T_0_15(t, A, B, C, D, E) SHA_ROUND(t, SHA_SRC, (((C^D)&B)^D) , 0x5a827999, A, B, C, D, E ) argument
60 #define T_16_19(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (((C^D)&B)^D) , 0x5a827999, A, B, C, D, E ) argument
61 #define T_20_39(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (B^C^D) , 0x6ed9eba1, A, B, C, D, E ) argument
62 #define T_40_59(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, ((B&C)+(D&(B^C))) , 0x8f1bbcdc, A, B, C, D,… argument
63 #define T_60_79(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (B^C^D) , 0xca62c1d6, A, B, C, D, E ) argument
72 * This function generates a SHA1 digest for a single 512-bit block.
[all …]
Dmd5.c15 u32 a, b, c, d; in md5_transform() local
17 a = hash[0]; in md5_transform()
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()
29 MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22); in md5_transform()
[all …]
/linux-3.3/lib/mpi/
Dmpiutil.c13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * You should have received a copy of the GNU General Public License
24 * Note: It was a bad idea to use the number of limbs to allocate
25 * because on a alpha the limbs are large but we normally need
28 * But mpi_alloc is used in a lot of places :-)
32 MPI a; in mpi_alloc() local
34 a = kmalloc(sizeof *a, GFP_KERNEL); in mpi_alloc()
35 if (!a) in mpi_alloc()
36 return a; in mpi_alloc()
39 a->d = mpi_alloc_limb_space(nlimbs); in mpi_alloc()
[all …]
Dmpi-bit.c13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * You should have received a copy of the GNU General Public License
30 void mpi_normalize(MPI a) in mpi_normalize() argument
32 for (; a->nlimbs && !a->d[a->nlimbs - 1]; a->nlimbs--) in mpi_normalize()
37 * Return the number of bits in A.
39 unsigned mpi_get_nbits(MPI a) in mpi_get_nbits() argument
43 mpi_normalize(a); in mpi_get_nbits()
45 if (a->nlimbs) { in mpi_get_nbits()
46 mpi_limb_t alimb = a->d[a->nlimbs - 1]; in mpi_get_nbits()
51 n = BITS_PER_MPI_LIMB - n + (a->nlimbs - 1) * BITS_PER_MPI_LIMB; in mpi_get_nbits()
[all …]
/linux-3.3/Documentation/
Dkobject.txt13 place. Dealing with kobjects requires understanding a few different types,
15 easier, we'll take a multi-pass approach, starting with vague terms and
19 - A kobject is an object of type struct kobject. Kobjects have a name
20 and a reference count. A kobject also has a parent pointer (allowing
21 objects to be arranged into hierarchies), a specific type, and,
22 usually, a representation in the sysfs virtual filesystem.
32 - A ktype is the type of object that embeds a kobject. Every structure
33 that embeds a kobject needs a corresponding ktype. The ktype controls
36 - A kset is a group of kobjects. These kobjects can be of the same ktype
42 When you see a sysfs directory full of other directories, generally each
[all …]
/linux-3.3/Documentation/filesystems/nfs/
DExporting8 All filesystem operations require a dentry (or two) as a starting
9 point. Local applications have a reference-counted hold on suitable
11 applications that access a filesystem via a remote filesystem protocol
12 such as NFS may not be able to hold such a reference, and so need a
13 different way to refer to a particular dentry. As the alternative
22 This byte string will be called a "filehandle fragment" as it
25 A filesystem which supports the mapping between filehandle fragments
33 The dcache normally contains a proper prefix of any given filesystem
37 maintained easily (by each object maintaining a reference count on
40 However when objects are included into the dcache by interpreting a
[all …]
Drpc-cache.txt1 This document gives a brief introduction to the caching
8 a wide variety of values to be caches.
10 There are a number of caches that are similar in structure though
11 quite possibly very different in content and use. There is a corpus
35 Creating a Cache
38 1/ A cache needs a datum to store. This is in the form of a
39 structure definition that must contain a
42 It will also contain a key and some content.
45 2/ A cache needs a "cache_detail" structure that
52 a pointer to the cache_detail embedded within the
[all …]
/linux-3.3/Documentation/development-process/
D5.Posting5 kernel. Unsurprisingly, the kernel development community has evolved a set
16 There is a constant temptation to avoid posting patches before they are
17 completely "ready." For simple patches, that is not a problem. If the
18 work being done is complex, though, there is a lot to be gained by getting
20 consider posting in-progress work, or even making a git tree available so
23 When posting code which is not yet considered ready for inclusion, it is a
32 There are a number of things which should be done before you consider
44 benchmarks showing what the impact (or benefit) of your change is; a
48 for an employer, the employer likely has a right to the work and must be
51 As a general rule, putting in some extra thought before posting code almost
[all …]
/linux-3.3/drivers/net/wireless/iwlwifi/
Diwl-debug.h13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
16 * You should have received a copy of the GNU General Public License along with
38 #define IWL_ERR(m, f, a...) dev_err(bus(m)->dev, f, ## a) argument
39 #define IWL_WARN(m, f, a...) dev_warn(bus(m)->dev, f, ## a) argument
40 #define IWL_INFO(m, f, a...) dev_info(bus(m)->dev, f, ## a) argument
41 #define IWL_CRIT(m, f, a...) dev_crit(bus(m)->dev, f, ## a) argument
115 * If you are defining a new debug classification, simply add it to the #define
122 * You then need to either add a IWL_xxxx_DEBUG() macro definition for your
172 #define IWL_DEBUG_INFO(p, f, a...) IWL_DEBUG(p, IWL_DL_INFO, f, ## a) argument
173 #define IWL_DEBUG_MAC80211(p, f, a...) IWL_DEBUG(p, IWL_DL_MAC80211, f, ## a) argument
[all …]
/linux-3.3/Documentation/cgroups/
Dcgroups.txt40 Control Groups provide a mechanism for aggregating/partitioning sets of
46 A *cgroup* associates a set of tasks with a set of parameters for one
49 A *subsystem* is a module that makes use of the task grouping
51 particular ways. A subsystem is typically a "resource controller" that
52 schedules a resource or applies per-cgroup limits, but it may be
53 anything that wants to act on a group of processes, e.g. a
56 A *hierarchy* is a set of cgroups arranged in a tree, such that
58 hierarchy, and a set of subsystems; each subsystem has system-specific
63 cgroups. Each hierarchy is a partition of all tasks in the system.
67 which cgroup a task is assigned, and list the task pids assigned to
[all …]
/linux-3.3/arch/m32r/include/asm/
Daddrspace.h25 * Returns the kernel segment base of a given address
28 #define KSEGX(a) (((unsigned long)(a)) & 0xe0000000) argument
30 #define KSEGX(a) ((a) & 0xe0000000) argument
34 * Returns the physical address of a KSEG0/KSEG1 address
37 #define PHYSADDR(a) (((unsigned long)(a)) & 0x1fffffff) argument
39 #define PHYSADDR(a) ((a) & 0x1fffffff) argument
43 * Map an address to a certain kernel segment
46 #define KSEG0ADDR(a) ((__typeof__(a))(((unsigned long)(a) & 0x1fffffff) | KSEG0)) argument
47 #define KSEG1ADDR(a) ((__typeof__(a))(((unsigned long)(a) & 0x1fffffff) | KSEG1)) argument
48 #define KSEG2ADDR(a) ((__typeof__(a))(((unsigned long)(a) & 0x1fffffff) | KSEG2)) argument
[all …]
/linux-3.3/Documentation/security/
Dkeys.txt9 Keyrings are permitted; these are a special type of key that can hold links to
10 other keys. Processes each have three standard keyring subscriptions that a
27 - Defining a key type
39 Each key has a number of attributes:
41 - A serial number.
42 - A type.
43 - A description (for matching a key in a search).
46 - A payload.
50 (*) Each key is issued a serial number of type key_serial_t that is unique for
54 Userspace programs can use a key's serial numbers as a way to gain access
[all …]
DSmack.txt7 Smack is a kernel based implementation of mandatory access
18 - A start-up script and a few modified applications
21 The kernel component of Smack is implemented as a Linux
25 It is safe to run a Smack kernel under a "vanilla" distribution.
41 A version of "ls" that provides a "-M" option to display
44 A hacked version of sshd that allows network logins by users
65 The command to set a Smack label on a file is:
82 access is a combination of the letters rwxa which specify the
83 kind of access permitted a subject with subjectlabel on an
86 A process can see the smack label it is running with by
[all …]

12345678910>>...417