Searched refs:count (Results 451 - 475 of 878) sorted by relevance

<<11121314151617181920>>

/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/
H A DBenchmark.pm14 timethis ($count, "code");
17 timethese($count, {
23 timethese($count, {
29 cmpthese($count, {
34 cmpthese($count, {
40 $results = timethese($count,
49 $t = timeit($count, '...other code...')
50 print "$count loops of other code took:",timestr($t),"\n";
53 $count = $t->iters ;
54 print "$count loop
[all...]
/osnet-11/usr/src/lib/libsmbns/common/
H A Dsmbns_netbios_datagram.c320 size_t count, srclen, destlen, sinlen; local
370 count = &buffer[14 + srclen + destlen + length] - buffer;
385 (void) sendto(datagram_sock, buffer, count, 0,
400 size_t count, srclen, destlen, sinlen; local
450 count = &buffer[14 + srclen + destlen + length] - buffer;
464 (void) sendto(datagram_sock, buffer, count, 0,
/osnet-11/usr/src/lib/libcryptoutil/common/
H A Dconfig_parsing.c234 int count = 0; local
344 count++;
350 pent->count = count;
486 puent2->count = puent1->count;
/osnet-11/usr/src/lib/libdevinfo/
H A Ddevinfo_devlink.h297 uint32_t *count);
299 uint32_t *count);
330 static void count_node(cache_node_t *cnp, uint32_t *count);
331 static void count_minor(cache_minor_t *mnp, uint32_t *count);
332 static void count_link(cache_link_t *clp, uint32_t *count);
333 static void count_string(const char *str, uint32_t *count);
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Tie/
H A DArray.pm207 =item STORESIZE this, count
210 object I<this> to be I<count>. If this makes the array larger then
212 If the array becomes smaller then entries beyond count should be
215 =item EXTEND this, count
217 Informative call that array is likely to grow to have I<count> entries.
263 I<offset> is optional and defaults to zero, negative values count back
/osnet-11/usr/src/lib/libast/common/misc/
H A Dstk.c79 short stkref; /* reference count; */
112 # define count(x,n) (_stkstats.x += (n)) macro
115 # define count(x,n) macro
224 count(addsize,sizeof(*stream)+sizeof(*dp)+sizeof(*sp));
245 count(addsize,sizeof(*fp)+bsize);
295 * increase the reference count on the given <stack>
521 count(addsize,n - (dp?m:0));
538 count(movsize,m);
/osnet-11/usr/src/lib/libzfs/common/
H A Dlibzfs_graph.c48 * with a non-zero clone count, then we are finished.
640 const char *dataset, char ***result, size_t *count)
660 *count = 0;
661 if (topo_sort(hdl, allowrecursion, *result, count, zvp) != 0) {
671 assert(*count > 0);
672 free((*result)[*count - 1]);
673 (*count)--;
639 get_dependents(libzfs_handle_t *hdl, boolean_t allowrecursion, const char *dataset, char ***result, size_t *count) argument
/osnet-11/usr/src/lib/pkcs11/pkcs11_tpm/common/
H A Dobject.c522 CK_ULONG_32 count; local
528 count = template_get_count(obj->template);
546 (void) memcpy(buf + offset, &count, sizeof (CK_ULONG_32));
760 CK_ULONG_32 count = 0; local
778 (void) memcpy(&count, data + offset, sizeof (CK_ULONG_32));
785 rc = template_unflatten(&tmpl, data + offset, count);
/osnet-11/usr/src/lib/libnisdb/
H A Dldap_ruleval.c40 * Free an array of 'count' rule-value elements.
43 freeRuleValue(__nis_rule_value_t *rv, int count) { argument
49 for (n = 0; n < count; n++) {
91 * Return an array of 'count' __nis_rule_value_t elements, initialized
95 initRuleValue(int count, __nis_rule_value_t *rvIn) { argument
96 return (growRuleValue(0, count, 0, rvIn));
226 * String-valued NIS+ entries count the concluding NUL in the
237 * one. This (a) doesn't count the NUL in the value length, but
1040 int count = 0; local
1048 for (j = 0; j < count;
[all...]
H A Dldap_val.h63 void freeValue(__nis_value_t *val, int count);
64 __nis_value_t *cloneValue(__nis_value_t *val, int count);
/osnet-11/usr/src/lib/libnvpair/
H A Dlibnvpair.c129 #define ARENDER(pctl, type, nvl, name, arrp, count) \
134 CUSTPRTOPARG(pctl, type), nvl, name, arrp, count); \
138 DFLTPRTOPARG(pctl, type), nvl, name, arrp, count); \
224 nvlist_t *nvl, const char *name, vtype *valuep, uint_t count) \
230 for (i = 0; i < count; i++) { \
279 nvlist_t *nvl, const char *name, nvlist_t **valuep, uint_t count)
287 for (i = 0; i < count; i++) {
778 uint_t i, count; \
781 (void) nvpair_value_##type(elem, &value, &count); \
782 for (i = 0; i < count;
278 nvaprint_nvlist_array(nvlist_prtctl_t pctl, void *private, nvlist_t *nvl, const char *name, nvlist_t **valuep, uint_t count) argument
798 uint_t i, count; local
[all...]
/osnet-11/usr/src/lib/librdc/common/
H A Drdcpersist.c53 int count; member in struct:volcount_s
112 volcount->count++;
115 volcount->count = 1;
123 volcount->count++;
126 volcount->count = 1;
327 if (vc && (vc->count == 1)) {
336 if (vc && (vc->count == 1)) {
424 if (vc && (vc->count == 1)) {
/osnet-11/usr/src/lib/libshadowfs/common/
H A Dshadow_migrate.c92 shadow_read_fidlist(const char *root, int idx, size_t *count) argument
139 *count = retlen / fidlen;
150 if (*count > shadow_fid_load_max) {
155 if ((ret = shadow_alloc(*count * sizeof (fid_t))) == NULL) {
160 for (i = 0; i < *count; i++) {
219 size_t i, count, depth; local
230 &count)) == NULL)
252 for (i = 0; i < count; i++) {
/osnet-11/usr/src/grub/grub2/include/grub/arc/
H A Darc.h196 grub_arc_ulong_t *count);
200 grub_arc_ulong_t *count);
/osnet-11/usr/src/grub/grub-0.97/netboot/
H A Dmisc.c81 static int count=0; local
98 putchar(tiddles[(count++)&3]);
/osnet-11/usr/src/cmd/sendmail/db/lock/
H A Dlock_region.c522 u_int32_t count; local
524 count = 0;
528 count++;
530 return (count);
538 u_int32_t count; local
540 count = 0;
544 count++;
546 return (count);
/osnet-11/usr/src/cmd/dtrace_toolkit/DTT/Apps/
H A Dnfswizard.d55 @events = count();
/osnet-11/usr/src/cmd/dtrace_toolkit/DTT/Bin/
H A Dnfswizard.d55 @events = count();
H A Dstacksize.d12 * count number of samples at this size
87 @errors[execname] = count();
/osnet-11/usr/src/cmd/dtrace_toolkit/DTT/Proc/
H A Dstacksize.d12 * count number of samples at this size
87 @errors[execname] = count();
/osnet-11/usr/src/cmd/ldap/ns_ldap/
H A Dldapclient.c247 int count; member in struct:__anon56
863 counter < arglist->serviceAuthenticationMethod->count;
871 counter < arglist->serviceCredentialLevel->count;
879 counter < arglist->objectclassMap->count;
885 for (counter = 0; counter < arglist->attributeMap->count; counter++) {
890 counter < arglist->serviceSearchDescriptor->count;
1154 counter < arglist->serviceAuthenticationMethod->count;
1162 counter < arglist->serviceCredentialLevel->count;
1170 counter < arglist->objectclassMap->count;
1178 counter < arglist->attributeMap->count;
[all...]
/osnet-11/usr/src/lib/libsqlite/src/
H A Dmd5.c169 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
234 * 1 0* (64-bit count of bits processed, MSB-first)
238 unsigned count; local
242 count = (ctx->bits[0] >> 3) & 0x3F;
246 p = ctx->in + count;
250 count = 64 - 1 - count;
253 if (count < 8) {
255 memset(p, 0, count);
263 memset(p, 0, count
[all...]
/osnet-11/usr/src/lib/mpapi/libmpapi/common/
H A Dmpapi-plugin.h242 MP_UINT32 count,
248 MP_UINT32 count,
/osnet-11/usr/src/lib/pkcs11/libpkcs11/common/
H A DmetaGeneral.c165 obj_delay_freed.count = 0;
171 ses_delay_freed.count = 0;
/osnet-11/usr/src/lib/storage/liba5k/common/
H A Dlhot.c139 i < map->count; i++, dev_addr_ptr++) {
144 if (i >= map->count) {
209 for (i = 0, dev_addr_ptr = map->dev_addr; i < map->count;
220 if (i >= map->count) {
551 for (i = 0, dev_addr_ptr = map->dev_addr; i < map->count;
562 if (i >= map->count)
594 for (i = 0, dev_addr_ptr = map->dev_addr; i < map->count;
615 if (i >= map->count)

Completed in 83 milliseconds

<<11121314151617181920>>