Home
last modified time | relevance | path

Searched +full:0 +full:- +full:9 +full:a +full:- +full:f (Results 1 – 25 of 1008) sorted by relevance

12345678910>>...41

/linux-3.3/scripts/
Dmarkup_oops.pl25 'cross-compile|c=s' => \$cross_compile,
29 my $vmlinux_name = $ARGV[0];
31 my $kerver = `uname -r`;
40 my $target = "0";
43 my $func_offset = 0;
44 my $vmaoffset = 0;
52 if ($line =~ /EAX: ([0-9a-f]+) EBX: ([0-9a-f]+) ECX: ([0-9a-f]+) EDX: ([0-9a-f]+)/) {
58 if ($line =~ /ESI: ([0-9a-f]+) EDI: ([0-9a-f]+) EBP: ([0-9a-f]+) ESP: ([0-9a-f]+)/) {
63 if ($line =~ /RAX: ([0-9a-f]+) RBX: ([0-9a-f]+) RCX: ([0-9a-f]+)/) {
68 if ($line =~ /RDX: ([0-9a-f]+) RSI: ([0-9a-f]+) RDI: ([0-9a-f]+)/) {
[all …]
Dcleanpatch1 #!/usr/bin/perl -w
3 # Clean a patch file -- or directory of patch files -- of stealth whitespace.
4 # WARNING: this can be a highly destructive operation. Use with caution.
13 # Clean up space-tab sequences, either by removing spaces or
21 my $pos = 0;
22 my $nsp = 0;
25 for ($i = 0; $i < length($li); $i++) {
29 my $ntab = ($npos >> 3) - ($pos >> 3);
32 $nsp = 0;
36 $nsp = 0;
[all …]
Drecordmcount.pl1 #!/usr/bin/perl -w
5 # recordmcount.pl - makes a section called __mcount_loc that holds
9 # What we want to end up with this is that each object file will have a
22 # functions in a section that has a call site to mcount, will have the
30 # The trick is to change the call offset referring the start of a section to
31 # referring a function symbol in this section. During the link step, 'ld' will
40 # call mcount (offset: 0x10)
44 # func2: (offset: 0x20)
50 # call mcount (offset: 0x30)
54 # offset from .sched.text. If we choose global symbol func2 as a reference and
[all …]
/linux-3.3/arch/m68k/math-emu/
Dfp_util.S22 * necessary due to a potential bad interaction between the GPL and
23 * the restrictions contained in a BSD-style copyright.)
27 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
63 tst.l (TASK_MM-8,%a2)
64 jmi 1f
65 tst.l (TASK_MM-4,%a2)
66 jmi 1f
68 jpl 2f
69 1: printf ,"oops:%p,%p,%p\n",3,%a2@(TASK_MM-8),%a2@(TASK_MM-4),%a2@(TASK_MM)
85 * First several conversion functions from a source operand
[all …]
/linux-3.3/arch/sparc/lib/
Drem.S2 * rem.S: This routine was taken from glibc-1.09 and is covered
26 * TOPBITS number of bits in the top decade of a number
29 * Q the partial quotient under development (initially 0)
34 * V the current comparand, initially divisor*2^(ITER*N-1)
37 * Current estimate for non-large dividend is
39 * A large dividend is one greater than 2^(31-TOPBITS) and takes a
41 * one bit at a time.
51 bge 2f ! no, go do the divide
55 bge 1f
58 bge 2f ! if %o0 not negative...
[all …]
Dsdiv.S2 * sdiv.S: This routine was taken from glibc-1.09 and is covered
26 * TOPBITS number of bits in the top decade of a number
29 * Q the partial quotient under development (initially 0)
34 * V the current comparand, initially divisor*2^(ITER*N-1)
37 * Current estimate for non-large dividend is
39 * A large dividend is one greater than 2^(31-TOPBITS) and takes a
41 * one bit at a time.
51 bge 2f ! no, go do the divide
55 bge 1f
58 bge 2f ! if %o0 not negative...
[all …]
Dudiv.S2 * udiv.S: This routine was taken from glibc-1.09 and is covered
26 * TOPBITS number of bits in the top decade of a number
29 * Q the partial quotient under development (initially 0)
34 * V the current comparand, initially divisor*2^(ITER*N-1)
37 * Current estimate for non-large dividend is
39 * A large dividend is one greater than 2^(31-TOPBITS) and takes a
41 * one bit at a time.
52 bne 1f
55 ! Divide by zero trap. If it returns, return 0 (about as
66 sethi %hi(1 << (32 - 4 - 1)), %g1
[all …]
Durem.S2 * urem.S: This routine was taken from glibc-1.09 and is covered
25 * TOPBITS number of bits in the top decade of a number
28 * Q the partial quotient under development (initially 0)
33 * V the current comparand, initially divisor*2^(ITER*N-1)
36 * Current estimate for non-large dividend is
38 * A large dividend is one greater than 2^(31-TOPBITS) and takes a
40 * one bit at a time.
50 bne 1f
53 ! Divide by zero trap. If it returns, return 0 (about as
64 sethi %hi(1 << (32 - 4 - 1)), %g1
[all …]
Dstrlen_user_32.S3 * Return length of string in userspace including terminating 0
4 * or 0 for error
11 #define LO_MAGIC 0x01010101
12 #define HI_MAGIC 0x80808080
16 cmp %o5, 0
17 be 1f
20 be 4f
24 cmp %o5, 0
25 be 2f
28 be 5f
[all …]
Dmemset.S6 * Returns 0, if ok, and number of bytes not yet set if exception
12 /* Work around cpp -rob */
15 #define EX(x,y,a,b) \ argument
19 99: ba 30f; \
20 a, b, %o0; \
30 .word start, 0, end, handler; \
38 std source, [base + offset + 0x00]; \
39 std source, [base + offset + 0x08]; \
40 std source, [base + offset + 0x10]; \
41 std source, [base + offset + 0x18]; \
[all …]
Dstrncmp_32.S12 mov 0, %o3
15 ble 7f
16 mov 0, %g2
21 0:
24 and %o3, 0xff, %o0
26 cmp %o0, 0
27 be 8f
31 be,a 1f
40 and %o3, 0xff, %o0
42 cmp %o0, 0
[all …]
/linux-3.3/arch/m32r/lib/
Dusercopy.c3 * The non inlined parts of asm-m32r/uaccess.h are here.
30 memset(to, 0, n); in __generic_copy_from_user()
36 * Copy a null terminated string from userspace.
45 " beqz %1, 2f\n" \
47 "0: ldb r14, @%3 || addi %3, #1\n" \
49 " beqz r14, 1f\n" \
50 " addi %1, #-1\n" \
51 " bnez %1, 0b\n" \
53 "1: sub %0, %1\n" \
60 " jmp r14 || ldi %0, #%5\n" \
[all …]
/linux-3.3/arch/sparc/boot/
Dbtfixupprep.c4 a special .s object to link to the image.
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 You should have received a copy of the GNU General Public License
43 struct _btfixup *f; member
58 int last = 0;
60 unsigned long lastfoffset = -1;
74 for (i = 0; i < last; i++) { in find()
80 array[last].setinitval = 0; in find()
88 return array + last - 1; in find()
93 for (mode = 0;; mode++) in set_mode()
[all …]
/linux-3.3/arch/powerpc/kernel/vdso32/
Dsigtramp.S2 * Signal trampolines for 32 bits processes in a ppc64 kernel for
20 /* The nop here is a hack. The dwarf2 unwind routines subtract 1 from
22 call instruction. Since we don't have a call here, we artificially
23 extend the range covered by the unwind info by adding a nop before
27 .Lsig_start = . - 4
41 .section .eh_frame,"a",@progbits
43 /* Register r1 can be found at offset 4 of a pt_regs structure.
44 A pointer to the pt_regs is stored in memory at the old sp plus PTREGS. */
46 .byte 0x0f; /* DW_CFA_def_cfa_expression */ \
47 .uleb128 9f - 1f; /* length */ \
[all …]
/linux-3.3/arch/powerpc/kernel/vdso64/
Dsigtramp.S2 * Signal trampoline for 64 bits processes in a ppc64 kernel for
21 /* The nop here is a hack. The dwarf2 unwind routines subtract 1 from
23 call instruction. Since we don't have a call here, we artificially
29 .Lsigrt_start = . - 4
37 chosen in such a way that older libgcc unwind code returns a zero
38 for a sigcontext pointer. */
39 .long 0,0,0
40 .quad 0,-21*8
42 /* Register r1 can be found at offset 8 of a pt_regs structure.
43 A pointer to the pt_regs is stored in memory at the old sp plus PTREGS. */
[all …]
/linux-3.3/arch/powerpc/lib/
Dcopy_32.S2 * Memory copy functions for 32-bit PowerPC.
4 * Copyright (C) 1996-2005 Paul Mackerras.
27 8 ## n ## 0: \
45 9 ## n ## 0: \
46 addi r5,r5,-(16 * n); \
47 b 104f; \
48 9 ## n ## 1: \
49 addi r5,r5,-(16 * n); \
50 b 105f; \
51 .section __ex_table,"a"; \
[all …]
/linux-3.3/drivers/w1/slaves/
Dw1_therm.c14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * You should have received a copy of the GNU General Public License
19 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
38 MODULE_DESCRIPTION("Driver for 1-wire Dallas network protocol, temperature family.");
41 * If it was disabled a parasite powered device might not get the require
42 * current to do a temperature conversion. If it is enabled parasite powered
43 * devices have a better chance of getting the current required.
46 module_param_named(strong_pullup, w1_strong_pullup, int, 0);
48 static u8 bad_roms[][9] = {
49 {0xaa, 0x00, 0x4b, 0x46, 0xff, 0xff, 0x0c, 0x10, 0x87},
[all …]
/linux-3.3/lib/
Dhalfmd4.c5 /* F, G and H are basic MD4 functions: selection, majority, parity */
6 #define F(x, y, z) ((z) ^ ((x) & ((y) ^ (z)))) macro
16 #define ROUND(f, a, b, c, d, x, s) \ argument
17 (a += f(b, c, d) + x, a = (a << s) | (a >> (32 - s)))
18 #define K1 0
23 * Basic cut-down MD4 transform. Returns only 32 bits of result.
27 __u32 a = buf[0], b = buf[1], c = buf[2], d = buf[3]; in half_md4_transform() local
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()
[all …]
/linux-3.3/arch/s390/lib/
Duaccess_std.c36 tmp1 = -256UL; in copy_from_user_std()
38 "0: mvcp 0(%0,%2),0(%1),%3\n" in copy_from_user_std()
39 "10:jz 8f\n" in copy_from_user_std()
40 "1:"ALR" %0,%3\n" in copy_from_user_std()
43 "2: mvcp 0(%0,%2),0(%1),%3\n" in copy_from_user_std()
45 " j 8f\n" in copy_from_user_std()
47 " "LHI" %3,-4096\n" in copy_from_user_std()
48 " nr %4,%3\n" /* %4 = (ptr + 255) & -4096 */ in copy_from_user_std()
50 " "CLR" %0,%4\n" /* copy crosses next page boundary? */ in copy_from_user_std()
51 " jnh 5f\n" in copy_from_user_std()
[all …]
/linux-3.3/arch/x86/tools/
Ddistill.awk1 #!/bin/awk -f
2 # Usage: objdump -d a.out | awk -f distill.awk | ./test_get_len
4 # - Removes all lines except the disassembled instructions.
5 # - For instructions that exceed 1 line (7 bytes), crams all the hex bytes
6 # into a single line.
7 # - Remove bad(or prefix only) instructions
14 fwait_expr = "^9b "
15 fwait_str="9b\tfwait"
18 /^ *[0-9a-f]+ <[^>]*>:/ {
23 /^ *[0-9a-f]+:/ {
[all …]
/linux-3.3/arch/sparc/kernel/
Duna_asm_64.S12 wr %o3, 0, %asi
15 be,pn %icc, 2f
17 be,pt %icc, 1f
30 9: stba %g1, [%o0 + 5] %asi
32 ba,pt %xcc, 0f
39 ba,pt %xcc, 0f
44 0:
45 wr %o4, 0x0, %asi
47 mov 0, %o0
48 .size __do_int_store, .-__do_int_store
[all …]
/linux-3.3/arch/openrisc/lib/
Dstring.S10 * Copyright (C) 2010-2011 Jonas Bonn <jonas@southpole.se>
37 l.addi r1,r1,-12
38 l.sw 0(r1),r6
42 l.addi r11,r5,0
44 l.bf 1f
45 l.addi r11,r11,-1
46 8: l.lbz r6,0(r4)
47 9: l.sb 0(r3),r6
54 l.lwz r6,0(r1)
66 .section __ex_table, "a"
[all …]
/linux-3.3/arch/powerpc/boot/
Dgamecube-head.S2 * arch/powerpc/boot/gamecube-head.S
5 * Copyright (C) 2004-2009 The GameCube Linux Team
19 * - if the data and instruction caches are enabled or not
20 * - if the MMU is enabled or not
32 mfmsr 9
33 rlwinm 9, 9, 0, ~((1<<4)|(1<<5)) /* MSR_DR|MSR_IR */
34 bcl 20, 31, 1f
37 clrlwi 8, 8, 3 /* convert to a real address */
38 addi 8, 8, _mmu_off - 1b
40 mtsrr1 9
[all …]
/linux-3.3/arch/sh/lib/
Dmemmove.S18 bf 1f
19 mov.l 2f,r0
27 bt/s 9f ! if n=0, do nothing
32 bt/s 8f ! if it's too small, copy a byte at once
33 add #-1,r4
39 ! r0+r4--> [ ... ] r0 --> [ ... ]
42 ! r5 -->
61 ! copy a byte at once
67 9:
74 add #-1,r4
[all …]
Dchecksum.S35 * computes a partial checksum, e.g. for TCP/UDP fragments
46 * is aligned on either a 2-byte or 4-byte boundary. We get at
47 * least a twofold speedup on 486 and Pentium if it is 4-byte aligned.
48 * Fortunately, it is easy to convert 2-byte alignment to 4-byte
53 bt/s 2f ! Jump if alignment is ok.
54 mov r4, r7 ! Keep a copy to check for alignment
57 bt 21f ! Jump if alignment is boundary of 2bytes.
61 add #-1, r5
62 bt 9f
65 addc r0, r6 ! t=0 from previous tst
[all …]

12345678910>>...41