/illumos-gate/usr/src/cmd/tic/ |
H A D | tic_scan.c | 398 register int count = 0; local 477 count ++; 479 if (count > 1000) 495 if (count == 0)
|
/illumos-gate/usr/src/cmd/ttymon/ |
H A D | ttyadm.c | 58 * -r count 80 char *count = ""; local 134 count = optarg; 208 ptr->p_device, ttyflags, count, ptr->p_server, 231 (void)fprintf(stderr, "\t-r count\n");
|
/illumos-gate/usr/src/uts/common/fs/zfs/ |
H A D | ddt_zap.c | 140 uint64_t count = 0; local 142 VERIFY(zap_count(os, object, &count) == 0); 144 return (count);
|
/illumos-gate/usr/src/uts/common/fs/doorfs/ |
H A D | door_vnops.c | 43 static int door_close(struct vnode *vp, int flag, int count, 106 int count, 124 * If the count is equal to 2, it means that I'm doing a VOP_CLOSE 129 * The door_active count is bumped during each invocation. 131 if (count == 2 && vp->v_count == 1 && 103 door_close( struct vnode *vp, int flag, int count, offset_t offset, struct cred *cr, caller_context_t *ct ) argument
|
/illumos-gate/usr/src/tools/ctf/dwarf/common/ |
H A D | dwarf_harmless.c | 67 unsigned count, 82 if(count) { 84 --count; 85 errmsg_ptrs_array[count] = 0; 91 if(i >= count ) { 151 Remember the maxcount we record is 1 > the user count, 152 so we adjust it so it looks like the user count. 66 dwarf_get_harmless_error_list(Dwarf_Debug dbg, unsigned count, const char ** errmsg_ptrs_array, unsigned * errs_count) argument
|
H A D | pro_arange.c | 218 unsigned long count = dbg->de_arange_count + 1; local 222 count = (3 * dbg->de_arange_count) + 1; 227 DEBUG_ARANGES, count);
|
H A D | pro_reloc.c | 54 relocations count we can preallocate the right size block. 89 keep this count for 197 On success returns count of 222 unsigned int count = 0; local 226 ++count; 229 *count_of_relocation_sections = (Dwarf_Unsigned) count;
|
/illumos-gate/usr/src/tools/protocmp/ |
H A D | depend.c | 220 int count = 0; local 234 count += process_package_dir(tmp->pkg_name, pkgdir, list, 239 return (count);
|
H A D | proto_list.c | 97 error("bad link-count", lc); 235 int count = 0; local 248 count = 0; 257 count++; 262 (void) printf("read in %d lines\n", count); 266 return (count);
|
/illumos-gate/usr/src/uts/common/c2/ |
H A D | adr.c | 65 adr_char(adr_t *adr, char *cp, int count) argument 67 while (count-- > 0) 75 adr_short(adr_t *adr, short *sp, int count) argument 78 for (; count-- > 0; sp++) { 88 adr_int32(adr_t *adr, int32_t *lp, int count) argument 93 for (; count-- > 0; lp++) { 106 adr_int64(adr_t *adr, int64_t *lp, int count) argument 111 for (; count-- > 0; lp++) {
|
/illumos-gate/usr/src/uts/common/crypto/api/ |
H A D | kcf_object.c | 42 crypto_object_attribute_t *attrs, uint_t count, 63 attrs, count, object_handle, KCF_SWFP_RHNDL(crq)); 67 sid, 0, attrs, count, object_handle, 0, 118 uint_t count, crypto_object_id_t *new_handle, crypto_call_req_t *crq) 138 object_handle, attrs, count, new_handle, 143 sid, object_handle, attrs, count, 157 crypto_object_attribute_t *attrs, uint_t count, crypto_call_req_t *crq) 178 sid, object_handle, attrs, count, KCF_SWFP_RHNDL(crq)); 183 attrs, count, NULL, 0, NULL, NULL, 0, NULL); 196 crypto_object_attribute_t *attrs, uint_t count, crypto_call_req_ 41 crypto_object_create(crypto_provider_t provider, crypto_session_id_t sid, crypto_object_attribute_t *attrs, uint_t count, crypto_object_id_t *object_handle, crypto_call_req_t *crq) argument 116 crypto_object_copy(crypto_provider_t provider, crypto_session_id_t sid, crypto_object_id_t object_handle, crypto_object_attribute_t *attrs, uint_t count, crypto_object_id_t *new_handle, crypto_call_req_t *crq) argument 155 crypto_object_get_attribute_value(crypto_provider_t provider, crypto_session_id_t sid, crypto_object_id_t object_handle, crypto_object_attribute_t *attrs, uint_t count, crypto_call_req_t *crq) argument 194 crypto_object_set_attribute_value(crypto_provider_t provider, crypto_session_id_t sid, crypto_object_id_t object_handle, crypto_object_attribute_t *attrs, uint_t count, crypto_call_req_t *crq) argument 270 crypto_object_find_init(crypto_provider_t provider, crypto_session_id_t sid, crypto_object_attribute_t *attrs, uint_t count, void **cookie, crypto_call_req_t *crq) argument 345 crypto_object_find(crypto_provider_t provider, void *cookie, crypto_object_id_t *handles, uint_t *count, uint_t max_count, crypto_call_req_t *crq) argument [all...] |
/illumos-gate/usr/src/lib/sun_sas/common/ |
H A D | devtree_phy_disco.c | 78 int rval, count, i; local 92 count = di_prop_lookup_bytes(DDI_DEV_T_ANY, node, "phy-info", 94 if (count < 0) { 105 rval = nvlist_unpack((char *)propByteData, count, &nvl, 0);
|
/illumos-gate/usr/src/uts/common/os/ |
H A D | ddi_hp_ndi.c | 67 int count; local 84 ndi_devi_enter(dip, &count); 89 ndi_devi_exit(dip, count); 119 ndi_devi_exit(dip, count); 126 ndi_devi_exit(dip, count); 138 int count; local 152 ndi_devi_enter(dip, &count); 156 ndi_devi_exit(dip, count); 175 ndi_devi_exit(dip, count); 209 int count; local 275 int count; local 344 int count; local [all...] |
H A D | ddi_nodeid.c | 51 uint32_t count; member in struct:available 161 if ((np->nodeid + np->count) == xp->nodeid) { 162 np->count += xp->count; 202 --np->count; 203 if (np->count == 0) { 248 ++np->count; 257 if (nodeid == (np->nodeid + np->count)) { 258 ++np->count; 269 fp->count [all...] |
H A D | memlist_new.c | 73 uint_t count; local 79 count = 1; 81 count++; 85 memlist_freelist_count += count; 93 uint_t count; local 95 count = bytes / sizeof (struct memlist); 96 if (count == 0) 100 mlendp = &mlp[count - 1]; 108 memlist_freelist_count += count;
|
/illumos-gate/usr/src/uts/common/tnf/ |
H A D | tnf_probe.c | 85 int nm_len, separator, count; local 147 for (count = 0; nm_start < slot_end; count++) { 157 (void) strncpy(slot_array[count], nm_start, nm_len); 158 slot_array[count][nm_len] = '\0'; 159 slot_args[count+CONST_SLOTS] = slot_array[count]; 164 slot_args[count+CONST_SLOTS] = NULL;
|
/illumos-gate/usr/src/uts/common/zmod/ |
H A D | inftrees.c | 60 unsigned short count[MAXBITS+1]; /* number of codes of each length */ local 95 The codes are sorted by computing a count of codes for each length, 110 count[len] = 0; 112 count[lens[sym]]++; 117 if (count[max] != 0) break; 129 if (count[min] != 0) break; 136 left -= count[len]; 145 offs[len + 1] = offs[len] + count[len]; 167 counts are used for this, and so count[] is decremented as codes are 254 /* go to next symbol, update count, le [all...] |
/illumos-gate/usr/src/uts/common/io/hxge/ |
H A D | hxge_classify.h | 75 int count; /* How many TCAM entries using this class. */ member in struct:__anon5394
|
/illumos-gate/usr/src/uts/common/io/ib/mgt/ibmf/ |
H A D | ibmf_ud_dest.c | 149 uint32_t count; local 176 count = cip->ci_ud_dest_list_count; 178 /* nothing to do if count is above the low water mark */ 179 if (count > IBMF_UD_DEST_LO_WATER_MARK) { 192 while (count < IBMF_UD_DEST_HI_WATER_MARK) { 231 * Get the latest count since other threads may have 234 count = cip->ci_ud_dest_list_count; 256 uint32_t count; local 268 count = cip->ci_ud_dest_list_count; 270 count [all...] |
/illumos-gate/usr/src/uts/common/io/nxge/npi/ |
H A D | npi.c | 149 int count) 154 if (count == 0 || count > MAX_RTRACE_ENTRIES) 155 count = 32; 159 * dump the <count> most recent records. 164 for (i = 0; i < count; i++) { 147 npi_trace_dump( rtrace_t *rt, int count) argument
|
/illumos-gate/usr/src/uts/common/krtld/ |
H A D | kobj_subr.c | 60 stand_bzero(void *p_arg, size_t count) argument 65 while (count != 0) 66 *p++ = zero, count--; 70 stand_bcopy(const void *src_arg, void *dest_arg, size_t count) argument 75 if (src < dest && (src + count) > dest) { 77 while (--count != -1) 78 *(dest + count) = *(src + count); 80 while (--count != -1)
|
/illumos-gate/usr/src/uts/common/smbsrv/ |
H A D | msgbuf.h | 69 * count: unused. 77 size_t count; member in struct:smb_msgbuf
|
/illumos-gate/usr/src/lib/libadm/common/ |
H A D | ckgid.c | 56 int count; local 69 count = 0; 76 if (count++)
|
H A D | ckuid.c | 56 int count; local 69 count = 0; 76 if (count++)
|
/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...] |