/illumos-gate/usr/src/cmd/sendmail/src/ |
H A D | bf.c | 349 ssize_t count = 0; /* Number of bytes put in buf so far */ local 358 count = nbytes; 359 if ((bfp->bf_offset + count) > bfp->bf_buffilled) 360 count = bfp->bf_buffilled - bfp->bf_offset; 362 memcpy(buf, bfp->bf_buf + bfp->bf_offset, count); 385 bfp->bf_offset + count, SEEK_SET) < 0) 400 while (count < nbytes) 403 buf + count, 404 nbytes - count); 413 count 494 ssize_t count = 0; /* Number of bytes written so far */ local [all...] |
/illumos-gate/usr/src/cmd/spell/ |
H A D | spellin.c | 81 long count; local 97 (void) fprintf(stderr, gettext("%s: arg count\n"), argv[0]); 107 (void) fprintf(stderr, gettext("%s: illegal count"), argv[0]); 114 for (count = 0; scanf("%lo", (unsigned long *)&h) == 1; ++count) { 155 argv[0], count, ignore, extra, wp); 156 count -= ignore; 158 argv[0], (((float)BYTE * wp) * sizeof (*table) / count), 159 (BYTE * ((float)wp * sizeof (*table) + sizeof (hindex)) / count));
|
/illumos-gate/usr/src/uts/common/io/scsi/impl/ |
H A D | scsi_reset_notify.c | 107 int i, count; local 117 count = 0; 119 count++; 123 list = kmem_alloc(count * sizeof (struct notify_entry), KM_NOSLEEP); 129 for (i = 0, p = *listp; i < count; i++, p = p->next) { 135 for (i = 0; i < count; i++) { 139 kmem_free(list, count * sizeof (struct notify_entry));
|
/illumos-gate/usr/src/lib/gss_mechs/mech_dh/backend/mech/ |
H A D | oid.c | 122 for (i = 0; i < set->count; i++) 145 set->elements = New(gss_OID_desc, source->count); 151 set->count = source->count; 154 for (i = 0; i < source->count; i++) 160 if (i != source->count) { 198 /* Set the set count */ 199 set->count = nel; 202 for (i = 0; i < set->count; i++) 208 if (i != set->count) { [all...] |
/illumos-gate/usr/src/cmd/dtrace/test/tst/common/ustack/ |
H A D | tst.spin.ksh | 53 @total = count(); 54 @stacks[ustack(4)] = count(); 99 \$count = \$1; 100 die "too few samples (\$count)\n" unless \$count >= 1000;
|
/illumos-gate/usr/src/cmd/lp/cmd/scripts/ |
H A D | lpsched | 65 addpg cmd_opts count P 81 setprop cmd_opts/num_filters = count: ${num_filters} 92 setprop cmd_opts/num_notifiers = count: ${num_notifiers} 103 setprop cmd_opts/fd_limit = count: ${fd_limit} 114 setprop cmd_opts/reserved_fds = count: ${reserved_fds}
|
/illumos-gate/usr/src/lib/gss_mechs/mech_krb5/krb5/krb/ |
H A D | bld_pr_ext.c | 40 register int i, count = 0; local 48 /* count up */ 51 count++; 58 princ_data = (krb5_data *) malloc(sizeof(krb5_data) * count); 67 princ_ret->length = count; 81 for (i = 0; i < count; i++) {
|
/illumos-gate/usr/src/lib/libshell/common/tests/ |
H A D | cubetype.sh | 36 integer -S count=0 44 (( _.count++)) 65 exp=2 got=$(( b.count )) 66 (( got == exp )) || err_exit "b.count incorrect for iteration $i -- expected $exp, got '$got'" 67 exp=2 got=${b.count} 95 b.count=0 110 (( _.count++)) 125 (( b.count == 1 )) || err_exit "b.count incorrect -- expected 1, got '$(( b.count ))'" [all...] |
/illumos-gate/usr/src/uts/common/io/drm/ |
H A D | drm_io32.h | 70 uint32_t iocs; /* Ioctl count */ 75 uint32_t count; member in struct:drm_stats_32 84 int count; /* Number of buffers of this size */ member in struct:drm_buf_desc_32 99 int count; member in struct:drm_buf_free_32 114 int count; /* Length of the buffer list */ member in struct:drm_buf_map_32 158 int count; member in struct:drm_ctx_res_32
|
/illumos-gate/usr/src/uts/i86pc/io/ |
H A D | microfind.c | 23 * a loop count that approximates a ten microsecond delay. 45 * Loop count for 10 microsecond wait. MUST be initialized for those who 85 int count; local 89 * In this mode, the PIT will count down from the loaded value and 119 count = inb(PITCTR0_PORT); 120 count |= inb(PITCTR0_PORT) << 8; 123 * Verify that the counter started counting down. The null count 129 * The counter did not begin. This means the loop count 131 * a zero count to represent that the delay was too small 145 * value. This means the loop count use [all...] |
/illumos-gate/usr/src/cmd/zinject/ |
H A D | zinject.c | 355 int *count = data; local 360 if (*count == 0) { 367 *count += 1; 387 int *count = data; local 395 if (*count == 0) { 400 *count += 1; 412 int *count = data; local 420 if (*count == 0) { 427 *count += 1; 441 int *count local 465 int count = 0, total = 0; local [all...] |
/illumos-gate/usr/src/stand/lib/fs/nfs/ |
H A D | nfs2ops.c | 64 uint_t count = 0; /* # bytes transferred to buf */ local 83 read_args.count = size; 85 read_args.count = nfs_readsize; 95 if ((count + read_args.count) > size) 96 read_args.count = size - count; 107 read_args.count); 119 read_args.count > NFS_READ_DECR) { 120 read_args.count [all...] |
/illumos-gate/usr/src/uts/sun4v/io/n2rng/ |
H A D | n2rng_entp_algs.c | 239 size_t count = 1; local 250 if (count > largestcount) { 251 largestcount = count; 254 shannonsum -= (count * (lg2(count) + 258 sqsum += count * count; 259 count = 1; 262 count++; 267 if (count > largestcoun [all...] |
/illumos-gate/usr/src/cmd/cmd-crypto/cryptoadm/ |
H A D | adm_kef_ioctl.c | 223 setup_get_soft_info(char *provname, int count) argument 232 if (count > 1) { 233 extra_mech_size = sizeof (crypto_mech_name_t) * (count - 1); 243 psoft_info->si_count = count; 257 int count = DEFAULT_DEV_NUM; local 260 sizeof (crypto_dev_list_entry_t) * (count - 1)); 272 pdevlist->dl_dev_count = count; 283 count = pdevlist->dl_dev_count; 286 sizeof (crypto_dev_list_entry_t) * (count - 1)); 321 get_dev_info(char *devname, int inst_num, int count, mechlist_ argument 416 int count; local 543 int count = DEFAULT_SOFT_NUM; local [all...] |
/illumos-gate/usr/src/lib/libdtrace_jni/java/src/org/opensolaris/os/dtrace/ |
H A D | StddevValue.java | 48 private final long count; field in class:StddevValue 57 new String[] {"value", "total", "count", "totalSquares"}) 142 count = stddevCount; 147 if (count < 0) { 148 throw new IllegalArgumentException("count is negative"); 164 * @throws IllegalArgumentException if the given count is negative 166 * the given total, total of squares, and count 176 count = stddevCount; 184 if (count < 0) { 185 throw new IllegalArgumentException("count i [all...] |
/illumos-gate/usr/src/cmd/filesync/ |
H A D | acls.c | 50 static int acl(const char *name, int opcode, int count, aclent_t *acls) argument 72 { int count; local 77 count = acl(name, GETACL, MAX_ACL_ENTRIES, acls); 78 if (count <= 0) 81 /* with a count of 3 or 4 there may not be any real ones */ 82 if (count > 4) 86 for (i = 0; i < count; i++) 102 list = (aclent_t *) malloc(count * sizeof (*list)); 107 for (i = 0; i < count; i++) { 114 ip->f_numacls = count; [all...] |
/illumos-gate/usr/src/boot/lib/libz/ |
H A D | inftrees.c | 58 unsigned short count[MAXBITS+1]; /* number of codes of each length */ local 93 The codes are sorted by computing a count of codes for each length, 108 count[len] = 0; 110 count[lens[sym]]++; 115 if (count[max] != 0) break; 127 if (count[min] != 0) break; 134 left -= count[len]; 143 offs[len + 1] = offs[len] + count[len]; 165 counts are used for this, and so count[] is decremented as codes are 252 /* go to next symbol, update count, le [all...] |
/illumos-gate/usr/src/lib/libnisdb/ |
H A D | db_table_c.x | 66 long count; 77 % long count; 82 % count = 0; 104 % <loc1...locn> are the entries. n2 <= n1 because we never count beyond n1. 135 long count; /* measures fullness of table */ 154 % long count; /* measures fullness of table */ 193 % long fullness() { return count; } 242 % is placed. 'count' is incremented if entry is added. Table may grow 255 % the freelist. 'count' is decremented if the deletion occurs. The object 260 % <table_size><last_used><count>[freelis [all...] |
/illumos-gate/usr/src/lib/libldap5/sources/ldap/common/ |
H A D | sort.c | 84 size_t count, i; local 95 count = ldap_count_entries( ld, *chain ); 97 kt = (keything_t**)NSLDAPI_MALLOC( count * (sizeof(keything_t*) + sizeof(keything_t)) ); 102 for ( i = 0; i < count; i++ ) { 103 kt[i] = i + (keything_t*)(kt + count); 108 for ( e = *chain, i = 0; i < count; i++, e = e->lm_chain ) { 121 XP_QSORT( (void*)kt, count, (size_t)sizeof(keything_t*), ldapi_keycmp ); 124 for ( i = 0; i < count; i++ ) { 206 int i, count; local 216 count [all...] |
/illumos-gate/usr/src/uts/common/fs/zfs/ |
H A D | spa_errlog.c | 140 uint64_t total = 0, count; local 145 &count) == 0) 146 total += count; 150 &count) == 0) 151 total += count; 164 process_error_log(spa_t *spa, uint64_t obj, void *addr, size_t *count) argument 177 if (*count == 0) { 185 (*count - 1) * sizeof (zbookmark_phys_t), 191 *count -= 1; 200 process_error_list(avl_tree_t *list, void *addr, size_t *count) argument 233 spa_get_errlog(spa_t *spa, void *uaddr, size_t *count) argument [all...] |
/illumos-gate/usr/src/uts/common/fs/hsfs/ |
H A D | hsfs_vnops.c | 118 /* Min count of adjacent bufs that will avoid buf coalescing */ 692 int count, 750 uint_t count; local 755 for (count = 0; count < info->bufsused; count++) { 756 wbuf = &(info->bufs[count]); 759 while (sema_tryp(&(info->sema[count])) == 0) { 761 sema_p(&(info->sema[count])); 765 sema_destroy(&(info->sema[count])); 689 hsfs_close( struct vnode *vp, int flag, int count, offset_t offset, struct cred *cred, caller_context_t *ct) argument 822 uint_t count; local 1115 uint_t count; local [all...] |
/illumos-gate/usr/src/lib/libtnfprobe/ |
H A D | tnf_args.c | 46 int count = 0; local 51 count++; 54 return (count); 69 int count = 0; local 80 while (count <= index) { 95 count++;
|
/illumos-gate/usr/src/uts/common/io/ib/clients/of/sol_ofs/ |
H A D | sol_ofs_gen_util.c | 64 if (!list->count) { 71 list->count++; 95 list->count--; 110 list->count--; 151 if (!list->count) { 158 list->count++;
|
/illumos-gate/usr/src/test/zfs-tests/tests/functional/cli_root/zpool_import/ |
H A D | zpool_import_missing_001_pos.ksh | 108 typeset -i count=0 127 count=0 151 (( count = count + 1 )) 154 'mirror') (( count == $GROUP_NUM )) && \ 157 'raidz') (( count > 1 )) && \
|
H A D | zpool_import_missing_002_pos.ksh | 119 typeset -i count=0 142 count=0 167 (( count = count + 1 )) 171 'mirror') (( count < $GROUP_NUM )) && \ 174 'raidz') (( count == 1 )) && \
|