HomeSort by: relevance | last modified time | path
    Searched refs:total (Results 1 - 25 of 248) sorted by relevancy

1 2 3 4 5 6 7 8 910

  /src/usr.bin/m4/lib/
ohash_entries.c 25 return h->total - h->deleted;
ohash_do.c 31 if (4 * h->deleted < h->total)
33 else if (3 * h->deleted > 2 * h->total)
64 h->total -= h->deleted;
81 if (h->deleted >= MINDELETED && 4 * h->deleted > h->total)
107 if (++h->total * 4 > h->size * 3)
ohash.h 41 unsigned int total; member in struct:ohash
  /src/sys/arch/hpc/stand/libz/
zalloc.c 37 size_t total = items * size; local in function:zcalloc
39 opaque = malloc(total);
41 memset(opaque, 0, total);
  /src/games/canfield/cfscores/
cfscores.c 107 struct betinfo total; local in function:printuser
120 i = read(dbfd, &total, sizeof(total));
123 if (i == 0 || total.hand == 0) {
129 if (total.worth >= 0)
134 printf("|Costs Total |\n");
135 printf("| Hands %8ld |\n", total.hand);
136 printf("| Inspections %8ld |\n", total.inspection);
137 printf("| Games %8ld |\n", total.game);
138 printf("| Runs %8ld |\n", total.runs)
    [all...]
  /src/usr.bin/cksum/
sum1.c 53 off_t total; local in function:csum1
63 thecrc = total = 0;
65 for (total += nr, p = buf; nr--; ++p) {
74 *clen = total;
sum2.c 54 off_t total; local in function:csum2
67 total = 0;
69 for (total += nr, p = buf; nr--; ++p)
78 *clen = total;
  /src/sys/arch/ews4800mips/stand/common/
inckern.c 42 int err, i, n, total, nulldata; local in function:main
46 total = 0;
54 total = strtoul(optarg, 0, 0);
58 if ((optarg == 0) || (total != 0) ||
74 fprintf(ofd, "%d];\n", total);
75 fprintf(ofd, "int kernel_binary_size = %d;\n", total);
84 total += n;
86 fprintf(ofd, "\n};\nint kernel_binary_size = %d;\n", total);
  /src/sbin/newfs_v7fs/
newfs_v7fs.h 41 off_t total; member in struct:progress_arg
  /src/games/mille/
mille.c 103 if (!restore || (Player[PLAYER].total >= 5000
104 || Player[COMP].total >= 5000)) {
105 if (Player[COMP].total < Player[PLAYER].total)
107 else if (Player[COMP].total > Player[PLAYER].total)
109 Player[COMP].total = 0;
110 Player[PLAYER].total = 0;
131 } while (Player[COMP].total < 5000
132 && Player[PLAYER].total < 5000)
    [all...]
misc.c 225 if (Player[PLAYER].total >= 5000 || Player[COMP].total >= 5000)
232 if (Player[PLAYER].total > Player[COMP].total)
234 else if (Player[PLAYER].total < Player[COMP].total)
236 Player[COMP].total = 0;
237 Player[PLAYER].total = 0;
  /src/lib/librefuse/refuse/
buf.c 50 size_t total = 0; local in function:fuse_buf_size
53 total += bufv->buf[i].size;
56 return total;
75 ssize_t total = 0; local in function:fuse_buf_read_fd_to_mem
89 else if (total == 0)
101 total += n_read;
111 return total;
120 ssize_t total = 0; local in function:fuse_buf_write_mem_to_fd
134 else if (total == 0)
145 total += n_wrote
164 ssize_t total = 0; local in function:fuse_buf_copy_fd_to_fd
279 ssize_t total = 0; local in function:fuse_buf_copy
    [all...]
  /src/distrib/utils/embedded/
mkpkgs 110 total=0
112 total=$(expr $total + $(sizeone ${pkgdir}/${p}-*.tgz))
114 total=$(expr \( $total / 1000000 \) + 2)
117 size=${total}
120 if [ ${total} -gt ${size} ]; then
121 echo "File system size given as ${size} MB, but it needs ${total} MB" >&2
  /src/lib/libc/db/recno/
rec_search.c 75 recno_t total; local in function:__rec_search
79 for (pg = P_ROOT, total = 0;;) {
84 t->bt_cur.index = recno - total;
89 if (++idx == top || total + r->nrecs > recno)
91 total += r->nrecs;
  /src/games/backgammon/common_source/
odds.c 72 int total; local in function:count
74 total = 0;
77 total += table[i][j];
78 return (total);
  /src/lib/libc/stdio/
fread.c 59 size_t total; local in function:fread
84 total = resid;
100 count = (total - resid) / size;
131 return (total - resid) / size;
  /src/sbin/fsck_v7fs/
inode.c 48 int total; member in struct:ilistcheck_arg
127 arg->total++;
138 struct ilistcheck_arg arg = { .total = 0, .alloc = 0 };
143 int nfree = arg.total - arg.alloc;
146 pwarn("*** corrupt total freeinode. %d(sb) != %d(cnt)\n",
158 pwarn("\ninode usage: %d/%d (%d)\n", arg.alloc, arg.total, nfree);
  /src/tests/net/if/
t_ifconf.sh 51 atf_check -s exit:0 -o match:'^2$' "$ifconf" total
56 atf_check -s exit:0 -o match:'^3$' "$ifconf" total
61 atf_check -s exit:0 -o match:'^4$' "$ifconf" total
67 atf_check -s exit:0 -o match:'^5$' "$ifconf" total
79 atf_check -s exit:0 -o match:'^3$' "$ifconf" total
  /src/sys/kern/
subr_localcount.c 100 int64_t total = 0; local in function:localcount_drain
106 lc->lc_totalp = &total;
120 while (total != 0) {
123 * references on all CPUs, the total had better be
126 KASSERTMSG((0 < total),
128 lc, total);
154 * global total, resetting the per-CPU counter to zero. Once
155 * localcount_drain() has started, we only maintain the total
279 * Return a total reference count of lc. It returns a correct value
  /src/usr.bin/systat/
pigs.c 97 float total; local in function:showpigs
105 total = 0.0;
108 total += pt[i].pt_pctcpu;
111 if (total < 1.0)
112 total = 1.0;
113 factor = 50.0/total;
  /src/common/dist/zlib/contrib/dotzlib/DotZLib/
Inflater.cs 60 int total = count;
64 while (err >= 0 && inputIndex < total)
66 copyInput(data, inputIndex, Math.Min(total - inputIndex, kBufferSize));
  /src/games/rogue/
hit.c 180 int i = 0, j, n, d, total = 0; local in function:get_damage
201 total += get_rand(1, d);
203 total += d;
207 return(total);
239 int total = 0; local in function:get_number
242 total = (10 * total) + (s[i] - '0');
245 return(total);
252 long total = 0; local in function:lget_number
255 total = (10 * total) + (s[i] - '0')
    [all...]
  /src/usr.sbin/npf/npftest/libnpftest/
npf_perf_test.c 57 uint64_t total = 0; local in function:npf_test_conc
84 total += npackets[i];
89 printf("%u\t%" PRIu64 "\n", nthreads, total / NSECS);
  /src/sys/arch/ews4800mips/ews4800mips/
sbd.c 80 size_t size, total = 0; local in function:sbd_memcluster_init
123 total += size;
126 printf(" total %dMB\n", total);
128 mem_clusters[0].size = total << 20;
  /src/sys/modules/examples/readhappy/
readhappy.c 85 unsigned total = dsum(n); local in function:check_happy
87 if (total == HAPPY_NUMBER)
89 if (total == SAD_NUMBER)
92 n = total;

Completed in 37 milliseconds

1 2 3 4 5 6 7 8 910