HomeSort by: relevance | last modified time | path
    Searched defs:sum (Results 1 - 25 of 442) sorted by relevancy

1 2 3 4 5 6 7 8 91011>>

  /src/tests/usr.bin/xlint/lint1/
gcc_builtin_overflow.c 16 int sum; local
18 if (__builtin_add_overflow(1, 2, &sum))
  /src/common/lib/libc/quad/
adddi3.c 49 * u_int addition x+y occurs if and only if the sum x+y is less than
55 union uu aa, bb, sum; local
59 sum.ul[L] = aa.ul[L] + bb.ul[L];
60 sum.ul[H] = aa.ul[H] + bb.ul[H] + (sum.ul[L] < bb.ul[L]);
61 return (sum.q);
  /src/lib/libutil/
disklabel_dkcksum.c 50 uint16_t sum; local
52 sum = 0;
56 sum ^= *start++;
57 return (sum);
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.base/
sum.c 4 int sum(int *list, int low, int high) function
6 int i = 0, s = 0; /* stop-in-sum */
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.base/
sum.c 4 int sum(int *list, int low, int high) function
6 int i = 0, s = 0; /* stop-in-sum */
  /src/sbin/disklabel/
dkcksum.c 64 uint16_t sum; local
66 sum = 0;
70 sum ^= *start++;
72 return sum;
  /src/sys/lib/libkern/
dkcksum.c 58 uint16_t sum; local
60 sum = 0;
64 sum ^= *start++;
66 return sum;
  /src/sys/netinet/
in4_cksum.c 58 uint32_t sum; local
81 * sum = one_add(&ip);
85 sum = ((len & 0xffff) + nxt) << 8;
87 sum = (len & 0xffff) + nxt;
91 sum += w[0];
92 sum += w[1];
93 sum += w[2];
94 sum += w[3];
111 sum += partial << 8;
114 return cpu_in_cksum(m, len, off, sum);
    [all...]
  /src/tests/lib/libc/ssp/
h_raw.c 43 volatile int sum = 0; local
47 sum += b[i];
  /src/tests/lib/libm/
t_cabsl.cxx 44 int sum = 0; local
47 sum += std::abs(cld);
49 sum += std::abs(cd);
52 sum += std::abs(cf);
54 ATF_REQUIRE_EQ(sum, 3*5);
  /src/tests/usr.bin/indent/
opt_ci.c 70 sum(int a, int b) function
81 sum(int a, int b) function
92 sum(int a, int b) function
103 sum(int a, int b) function
114 sum(int a, int b) function
129 sum(int a, int b) function
141 sum(int a, int b) function
159 sum(int a, int b) function
171 sum(int a, int b) function
183 sum(int a, int b function
    [all...]
  /src/sys/lib/libsa/
ip_cksum.c 69 int sum = 0, oddbyte = 0, v = 0, len = (int)llen; local
75 sum += v + *cp++;
80 sum += *(const u_short *)cp;
86 sum += *cp++ << 8;
87 sum += *cp++;
89 sum += *cp++;
90 sum += *cp++ << 8;
102 sum += v;
103 sum = (sum >> 16) + (sum & 0xffff); /* add in accumulated carries *
    [all...]
  /src/usr.sbin/timed/timed/
cksum.c 59 int sum = 0; local
62 * Our algorithm is simple, using a 32 bit accumulator (sum),
71 sum += w;
78 sum += *addr << 8;
83 sum = (sum >> 16) + (sum & 0xffff); /* add hi 16 to low 16 */
84 sum += (sum >> 16); /* add carry */
85 answer = ~sum; /* truncate to 16 bits *
    [all...]
  /src/crypto/external/bsd/heimdal/dist/lib/otp/
otp_print.c 49 unsigned sum = 0; local
52 sum += ((key[i] >> 0) & 0x03)
56 sum &= 0x03;
57 return sum;
63 unsigned sum; local
65 sum = otp_checksum (key);
73 std_dict[((key[6] & 0x01) << 10) | (key[7] << 2) | sum]);
  /src/external/gpl3/binutils/dist/gprofng/src/
Sample.cc 85 // Now make sure that the sum of states is >= prusage->pr_rtime
86 hrtime_t sum = prusage->pr_utime + prusage->pr_stime + prusage->pr_ttime local
91 sum = sum - prusage->pr_rtime;
92 if (sum < 0)// increment sleep time to make it match
93 prusage->pr_slptime = prusage->pr_slptime - sum;
  /src/external/gpl3/binutils.old/dist/gprofng/src/
Sample.cc 85 // Now make sure that the sum of states is >= prusage->pr_rtime
86 hrtime_t sum = prusage->pr_utime + prusage->pr_stime + prusage->pr_ttime local
91 sum = sum - prusage->pr_rtime;
92 if (sum < 0)// increment sleep time to make it match
93 prusage->pr_slptime = prusage->pr_slptime - sum;
  /src/lib/libc/gdtoa/
sum.c 1 /* $NetBSD: sum.c,v 1.2 2008/03/21 23:13:48 christos Exp $ */
38 sum(a, b) Bigint *a; Bigint *b; function
40 sum(Bigint *a, Bigint *b)
  /src/lib/libukfs/
ukfs_disklabel.c 132 uint16_t sum; local
140 sum = 0;
145 sum ^= bswap16(*start);
147 sum ^= *start;
150 return (sum);
  /src/sys/arch/amiga/stand/bootblock/elf2bb/
chksum.c 45 uint32_t sum, lastsum; local
48 sum = 0;
51 lastsum = sum;
52 sum += be32toh(block[i]);
53 if (sum < lastsum)
54 ++sum;
57 return sum;
  /src/sys/arch/atari/stand/ahdilabel/
cksum.c 41 u_short *start, *end, sum = 0; local
46 sum ^= *start++;
47 return (sum);
  /src/sys/arch/atari/stand/tostools/libtos/
bsdlabel.c 81 u_short *start, *end, sum = 0; local
86 sum ^= *start++;
87 return(sum);
  /src/sys/arch/hppa/spmath/
sfsqrt.c 60 register int src_exponent, newbit, sum; local
137 Sgl_addition(result,newbit,sum);
138 if(sum <= Sgl_all(src)) {
141 Sgl_subtract(src,sum,src);
  /src/sys/arch/m68k/m68k/
cpu_in_cksum.c 51 uint32_t sum, partial; local
61 sum = (initial_sum >> 16) + (initial_sum & 0xffff);
113 sum += (partial >> 16) + (partial & 0xffff);
115 * Reduce sum to allow potential byte swap
118 sum = (sum >> 16) + (sum & 0xffff);
120 final_acc = ((sum >> 16) & 0xffff) + (sum & 0xffff);
  /src/sys/arch/vax/vax/
cpu_in_cksum.S 77 #define sum %r4 define
91 movl 16(%ap),sum
136 addl2 tmp,sum # sum += tmp;
137 adwc $0,sum
138 rotl $8,sum,sum # sum = (sum << 8 | sum >> 24)
    [all...]
  /src/sys/external/bsd/sljit/dist/doc/tutorial/
temp_var.c 11 long sum = 0; local
13 sum += a[i];
16 return sum;

Completed in 79 milliseconds

1 2 3 4 5 6 7 8 91011>>