| /src/tests/usr.bin/xlint/lint1/ |
| gcc_builtin_overflow.c | 16 int sum; local
18 if (__builtin_add_overflow(1, 2, &sum))
|
| /src/external/bsd/ipf/dist/lib/ |
| getsumd.c | 13 char *getsumd(sum)
14 u_32_t sum;
18 if (sum & NAT_HW_CKSUM)
19 sprintf(sumdbuf, "hw(%#0x)", sum & 0xffff);
21 sprintf(sumdbuf, "%#0x", sum);
|
| /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/external/bsd/tcpdump/dist/ |
| in_cksum.c | 57 #define REDUCE {l_util.l = sum; sum = l_util.s[0] + l_util.s[1]; ADDCARRY(sum);}
63 int sum = 0; local
90 sum += s_util.s;
100 sum <<= 8;
111 sum += w[0]; sum += w[1]; sum += w[2]; sum += w[3]
[all...] |
| /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/arch/sparc/sparc/ |
| cpu_in_cksum.c | 162 : "=r" (sum), "=&r" (tmp1), "=&r" (tmp2)\
163 : "0" (sum), "r" (w))
173 : "=r" (sum), "=&r" (tmp1), "=&r" (tmp2)\
174 : "0" (sum), "r" (w))
180 : "=r" (sum), "=&r" (tmp1), "=&r" (tmp2)\
181 : "0" (sum), "r" (w))
185 : "=r" (sum), "=&r" (tmp1), "=&r" (tmp2)\
186 : "0" (sum), "r" (w))
190 : "=r" (sum), "=&r" (tmp1) \
191 : "0" (sum), "r" (w)
[all...] |
| /src/sys/netinet6/ |
| in6_cksum.c | 59 uint32_t sum; local
82 * sum = one_add(&ip6);
86 sum = ((len & 0xffff) + ((len >> 16) & 0xffff) + nxt) << 8;
88 sum = (len & 0xffff) + ((len >> 16) & 0xffff) + nxt;
103 sum += w[0];
105 sum += w[1];
106 sum += w[2];
107 sum += w[3];
108 sum += w[4];
109 sum += w[5]
[all...] |
| /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/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/sys/arch/hppa/hppa/ |
| in_cksum.c | 60 : "+r" (sum), "+r" (w) :: "r20", "r19")
66 : "+r" (sum), "+r" (w) :: "r20", "r19")
68 #define ADDCARRY {if (sum > 0xffff) sum -= 0xffff;}
69 #define REDUCE {sum = (sum & 0xffff) + (sum >> 16); ADDCARRY}
70 #define ROL __asm volatile ("shd %0, %0, 8, %0" : "+r" (sum))
71 #define ADDBYTE {ROL; sum += *w++; bins++; mlen--;}
72 #define ADDSHORT {sum += *(u_short *)w; w += 2; mlen -= 2;
80 u_int sum = 0; local
[all...] |
| /src/external/bsd/nsd/dist/ |
| xdp-util.h | 29 * Add u16 to checksum value and preserve one's complement sum.
39 * Subtract u16 from checksum value and preserve one's complement sum.
46 * Replace u16 from checksum value and preserve one's complement sum.
48 static inline void csum16_replace(__sum16 *sum, __be16 old, __be16 new) {
49 *sum = ~csum16_add(csum16_sub(~(*sum), old), new);
53 * Sum up _data_len amount of 16-bit words in _data and add to result.
85 uint32_t sum = 0; local
86 sum += udp->len;
87 sum += htons(IPPROTO_UDP)
108 uint32_t sum = 0; local
[all...] |
| /src/external/cddl/dtracetoolkit/dist/Bin/ |
| minfbyproc.d | 10 vminfo:::as_fault { @mem[execname] = sum(arg0); }
|
| pgpginbyproc.d | 10 vminfo:::pgpgin { @pg[execname] = sum(arg0); }
|
| readbytes.d | 10 sysinfo:::readch { @bytes[execname] = sum(arg0); }
|
| writebytes.d | 10 sysinfo:::writech { @bytes[execname] = sum(arg0); }
|
| /src/external/cddl/dtracetoolkit/dist/Mem/ |
| minfbyproc.d | 10 vminfo:::as_fault { @mem[execname] = sum(arg0); }
|
| pgpginbyproc.d | 10 vminfo:::pgpgin { @pg[execname] = sum(arg0); }
|
| /src/external/cddl/dtracetoolkit/dist/Proc/ |
| readbytes.d | 10 sysinfo:::readch { @bytes[execname] = sum(arg0); }
|
| writebytes.d | 10 sysinfo:::writech { @bytes[execname] = sum(arg0); }
|
| /src/lib/libutil/ |
| disklabel_dkcksum.c | 50 uint16_t sum; local
52 sum = 0;
56 sum ^= *start++;
57 return (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/sys/arch/mips/mips/ |
| in_cksum.c | 30 * Basic algorithm is 3-instruction inner loop sum by Peter Desnoyers.
68 * Compute 1's complement sum over a contiguous block at 'buf' for 'n' bytes.
73 * and so we must byteswap the memory-aligned 1's-complement sum
81 unsigned int sum = 0; local
93 * and we must byteswap our 16-bit-aligned sum of
98 sum += *(buf.c++);
100 sum += (*(buf.c++) << 8);
111 sum += *(buf.s++);
116 /* 32-bit-aligned sum.
194 sum += hilo
285 uint sum = 0; local
[all...] |
| /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/powerpc/powerpc/ |
| in_cksum.c | 58 #define REDUCE1 sum = (sum & 0xffff) + (sum >> 16)
59 /* Two REDUCE1s is faster than REDUCE1; if (sum > 65535) sum -= 65536; */
63 in_cksum_internal(struct mbuf *m, int off, int len, u_int sum)
95 sum += s_util.s;
112 sum <<= 8;
119 * Since the `sum' may contain full 32 bit
125 "addc %0,%0,7;" /* add to sum */
250 u_int sum = 0; local
[all...] |
| /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...] |
