/illumos-gate/usr/src/cmd/compress/ |
H A D | compress.c | 162 static code_int free_ent = 0; /* first unused entry */ 192 #define FIRST 257 /* first free entry */ 957 * secondary probe. Here, the modular division first probe is gives way 1174 * Get to the first byte. 1179 * Since code is always >= 8 bits, only need to mask the first 1287 * As above, initialize the first 256 entries in the table. 1299 /* first code must be 8 bits = char */ 1429 * Get to the first byte. 1433 /* Get first part (low order bits) */ 1486 int i, first; local [all...] |
/illumos-gate/usr/src/cmd/mdb/common/modules/pmcs/ |
H A D | pmcs.c | 974 /* If this is the first entry, just add it */ 1123 int first, i; local 1127 first = 1; 1129 if (first) { 1137 print_spcmd(&s, sp, first, verbose); 1139 first = 0; 1143 first = 1; 1145 if (first) { 1153 print_spcmd(&s, sp, first, verbose); 1155 first [all...] |
/illumos-gate/usr/src/cmd/msgfmt/ |
H A D | xgettext.c | 181 * This variable contains the first line of gettext(), dgettext(), or 734 * the first open paren, no action is necessary. 983 int first = 0; local 1003 * Find the position of the first non-whitespace character 1020 first = --i; 1030 if (line[first] == '"') { 1031 first++; 1040 p = first; 1041 for (i = 0; i <= (last-first); i++) { 1138 * From the string list, find non-null string first 1490 char *first, *pc; local [all...] |
/illumos-gate/usr/src/cmd/fm/fmdump/common/ |
H A D | fmdump.c | 592 * Each pipeline will process first the rotated logs of that type and then 627 struct loglink *pl_rotated; /* rotated logs to process first */ 772 int first = 1; local 782 if (first) { 785 first = 0;
|
/illumos-gate/usr/src/cmd/sendmail/src/ |
H A D | srvrsmtp.c | 570 volatile bool first; local 1108 /* output the first line, inserting "ESMTP" as second word */ 1158 first = true; 1242 if (first) 1267 first = false; 1543 /* avoid information leak; take first two words? */ 2285 usrerr("503 5.0.0 Polite people say HELO first"); 2372 /* must parse sender first */ 2941 usrerr("503 5.0.0 I demand that you introduce yourself first"); 4878 bool first local [all...] |
/illumos-gate/usr/src/cmd/bnu/ |
H A D | uustat.c | 476 short first = 1; local 537 if (first) 576 first = 0; 716 short first = 1; local 781 if (first) { 794 first = 0;
|
/illumos-gate/usr/src/cmd/svc/svcs/ |
H A D | explain.c | 1954 static int first = 1; variable 1969 if (first) 1970 first = 0;
|
/illumos-gate/usr/src/uts/common/fs/sockfs/ |
H A D | nl7curi.c | 197 * Primes for N of 3 - 24 where P is first prime less then (2^(N-1))+(2^(N-2)) 486 * the first call here set it to the current uri_bytes value then backoff 865 * Have a match, ready URI for return, first put a reference 889 * cv_wait_sig() in the first case can't 1122 boolean_t first; local 1136 first = B_TRUE; 1138 first = B_FALSE; 1182 error = uri_rd_response(so, uri, rdp, first); 1295 boolean_t first = B_TRUE; local 1396 error = uri_rd_response(so, uri, rdp, first); 1704 uri_rd_response(struct sonode *so, uri_desc_t *uri, uri_rd_t *rdp, boolean_t first) argument 1846 boolean_t first = B_TRUE; local [all...] |
/illumos-gate/usr/src/uts/common/inet/sctp/ |
H A D | sctp_input.c | 657 * reassembled, the first mblk in the series is returned. dc is adjusted 1054 * in the reassembly queue. Try the tail first, on the assumption 1159 /* used to check if we have the first and last fragments */ 1257 /* first time? */ 1646 /* Stop at the first gap in the sequence */ 2055 * aware, if this is not the first chunk in the 2342 * of incomplete processing when it was first processed. 2456 * We only check in the first meta since otherwise we can't 2559 * TSN. For the first gap it is always the cumulative TSN. 3243 sctp_check_input(sctp_t *sctp, sctp_chunk_hdr_t *ch, ssize_t len, int first) argument [all...] |
/illumos-gate/usr/src/uts/common/os/ |
H A D | aio.c | 1124 int first, error = 0; local 1132 first = aiop->aio_ok; 1137 if (error == 0 && first == 0) { 2722 * unmap event happened first.
|
H A D | mem_cage.c | 498 * Check if the delete is OK first as a number of elements 1098 static int first = 1; local 1109 if (first) { 1110 first = 0;
|
H A D | contract.c | 96 * Locks at the top are taken first: 1951 * Check obvious things first. If we are looking for a 1975 * first test for a NULL holder so that events 2062 ct_kevent_t *e, *first = NULL; local 2076 if (first == NULL) 2077 first = e; 2093 if (first) 2094 cte_qwakeup(newq, first); 2106 * first referenced event is found. 2109 * acknowledgement) generated by that contract until the first even [all...] |
/illumos-gate/usr/src/uts/common/vm/ |
H A D | page_retire.c | 264 * By default we do not since FMA wants to run its diagnostics first 996 * UE error on the page which occurs while the first is currently being 1019 * if the first attempt fails. Success is determined by looking to see whether 1063 /* Avoid setting toxic bits in the first place */ 1264 page_t *first, *pp, *cpp, *cpp2, *lpp; local 1276 pp = first = page_first(); 1297 } while ((pp = page_next(pp)) != first);
|
H A D | seg_dev.c | 115 * One trash page is allocated on the first ddi_umem_setup call that uses it 1020 if (dhpp == dhp) { /* releasing first dhp, change sdp data */ 1046 * dhp can be either the first handle or a subsequent handle 1060 if (len != 0) { /* partial unmap at head of first remaining dhp */ 1384 * Check for waiters first without the mutex 1675 * To support these two features, the code first goes through the 1760 * will hang waiting on the first to complete. 1774 /* calculate the offset corresponds to 'addr' in the first dhp. */ 1837 * If not first dhp, use 2815 * support len. Offset is set to the byte offset of the first byt 2863 uint_t first = 1; local [all...] |
H A D | vm_usage.c | 42 * The vm_getusage() calculation is implemented so that the first thread 665 end, char type, vmu_bound_t **first, vmu_bound_t **last) 674 *first = *last = NULL; 684 *first = walker; 694 *first = walker; 700 * At this point, if *first is still NULL, then we 708 if (*first == NULL) { 713 *first = tmp; 717 *first = *last = tmp; 723 ASSERT(*first ! 664 vmu_insert_lookup_object_bounds(vmu_object_t *ro, pgcnt_t start, pgcnt_t end, char type, vmu_bound_t **first, vmu_bound_t **last) argument 799 vmu_update_bounds(avl_tree_t *tree, vmu_bound_t **first, vmu_bound_t **last, avl_tree_t *new_tree, vmu_bound_t *new_first, vmu_bound_t *new_last) argument 858 vmu_merge_bounds(avl_tree_t *tree, vmu_bound_t **first, vmu_bound_t **last) argument 896 vmu_amp_update_incore_bounds(avl_tree_t *tree, struct anon_map *amp, vmu_bound_t **first, vmu_bound_t **last, boolean_t incore) argument 991 vmu_vnode_update_incore_bounds(avl_tree_t *tree, vnode_t *vnode, vmu_bound_t **first, vmu_bound_t **last) argument 1093 vmu_bound_t *first = NULL; local 1378 shared_object->vmo_key, &first, local 1384 shared_object->vmo_key, &first, local [all...] |
/illumos-gate/usr/src/uts/i86pc/cpu/generic_cpu/ |
H A D | gcpu_mca.c | 557 * Throttle spamming of the console. The first gcpu_bleat_count_thresh 995 * size than on our first call. 1104 global_nbanks = nbanks; /* no race - BSP will get here first */ 1109 * first to set global_nbanks then bail. The latter requirement 1596 clear_mc(int first, int last, int ismc, boolean_t clrstatus, argument 1603 if (first < 0 || last < 0) 1606 for (i = first, gbl = &gcl->gcl_data[first]; i <= last; i++, gbl++) { 1710 int first = -1; local 1779 if (first < [all...] |
/illumos-gate/usr/src/uts/common/io/ib/adapters/tavor/ |
H A D | tavor_wr.c | 102 uint64_t *desc, *prev, *first; local 158 * However, we do not want to link the first one to the previous 170 * For the first WQE on a new chain we need "prev" to point 254 * If this is not the first descriptor on the current 257 * "first" and "first_sz" respectively) and continue. 274 first = desc; 324 tavor_wqe_mlx_linknext(NULL, first, first_sz, 328 first, first_sz, qp->qp_sq_lastwqeaddr, 369 (uint32_t)((uintptr_t)first - qp->qp_desc_off), 399 uint64_t *desc, *prev, *first; local 654 uint64_t *desc, *prev, *first, *last_wqe_addr; local [all...] |
/illumos-gate/usr/src/uts/common/io/ |
H A D | stream.c | 340 return (ftblk_constructor(&fhp->first, cdrarg, kmflags)); 348 ftblk_destructor(&fhp->first, cdrarg); 507 * We find the first mblk which has a non-NULL db_cred and use that. 565 * 2. Clears the first cred in the mblk. 623 * Get the label for a message. Uses the first mblk in the message 1551 * Concatenate and align first len bytes of common 1583 * If the length is less than that of the first mblk, 1628 * Concatenate and align at least the first len bytes of common message 1655 * Copy all of the first msg type into one new mblk, then dupmsg 1704 int first; local [all...] |
/illumos-gate/usr/src/uts/common/sys/ |
H A D | kbd.h | 75 * The first entry is used if none match. 129 #define COMPOSE2 3 /* Got COMPOSE plus first key */ 320 unsigned char first; /* first ASCII char after COMPOSE key */ member in struct:compose_sequence_t
|
/illumos-gate/usr/src/uts/common/io/lvm/mirror/ |
H A D | mirror_resync.c | 265 * The first one is a kernel daemon, the other two result from system calls. 266 * Thus, only the first case needs to deal with kernel CPR activity. This 1330 diskaddr_t first, stopbefore; local 1419 RR_TO_BLK(first, rr, un); 1423 err = resync_read_blk_range(un, first, stopbefore, 2192 * Thread started on first resync of a unit which simply blocks until woken up 2318 * regardless of whether another type of resync was in progress, we must first 2398 * If this is the first resync following the initial 2518 * Always perform an optimized resync first as this will bring 2918 * may spin on its first md_unit_readerloc [all...] |
/illumos-gate/usr/src/uts/common/io/mii/ |
H A D | mii.c | 1801 int first; local 1818 * exporting a "first-phy" property. 1821 first = ddi_prop_get_int(DDI_DEV_T_ANY, mh->m_dip, 0, "first-phy", 1); 1822 if ((first < 0) || (first > 31)) { 1823 first = 1; 1825 for (int i = first; i < (first + 32); i++) {
|
/illumos-gate/usr/src/cmd/lockstat/ |
H A D | lockstat.c | 250 int i, first = -1, last; local 257 if (first == -1) 258 first = i; 264 desc, event_type, first, last); 266 for (i = first; i <= last; i++) 744 * first aggregation variable ID and @hist assigned the 852 fail(0, "bad event size in first record"); 911 * that "avg" will be allocated the first aggregation variable ID, and 1019 lsrec_t *lsp, **current, **first, **sort_buf, **merge_buf; local 1581 first [all...] |
/illumos-gate/usr/src/lib/libshare/smb/ |
H A D | libshare_smb.c | 666 boolean_t first = B_TRUE; /* work around sharetab issue */ local 714 * If we are no longer the first case, 721 if (!first) 729 first = B_FALSE; 787 /* first basic type checking */ 1043 * and dots. The first and last character of a label must be alphanumeric. 1461 * services, first. If it fails, the SMB service will 1464 * first time unless the admin has done it 1809 * is a set of properties "before" the first name="", those 2030 * do the default set first bu [all...] |
/illumos-gate/usr/src/cmd/truss/ |
H A D | main.c | 99 * OR the second set into the first set. 171 * This is called from the first worker thread to encounter one of 259 int first; local 612 while (i < ngrab) { /* grab first process */ 769 first = created? FALSE : TRUE; 773 first = FALSE; 775 main_thread(first); 783 main_thread(int first) argument 802 primary_lwp = (first && Pstate(Proc) == PS_STOP)? 871 int first local [all...] |
/illumos-gate/usr/src/uts/i86pc/io/pcplusmp/ |
H A D | apic_common.c | 850 boolean_t first = B_TRUE; local 925 * version number of the first existing CPU. 927 if (first) { 928 first = B_FALSE; 932 ASSERT(first == B_FALSE); 1444 /* Find the first CPU with the passed-in flag set */ 1614 * check whether the first level children of root_node have
|