/illumos-gate/usr/src/cmd/mdb/intel/amd64/libfksmbsrv/ |
H A D | Makefile | 43 CPPFLAGS.first += -I../../../../../lib/smbsrv/libfksmbsrv/common 44 CPPFLAGS.first += -I../../../../../lib/libfakekernel/common
|
/illumos-gate/usr/src/cmd/mdb/intel/ia32/libfksmbsrv/ |
H A D | Makefile | 42 CPPFLAGS.first += -I../../../../../lib/smbsrv/libfksmbsrv/common 43 CPPFLAGS.first += -I../../../../../lib/libfakekernel/common
|
/illumos-gate/usr/src/cmd/mdb/sparc/v7/libfksmbsrv/ |
H A D | Makefile | 43 CPPFLAGS.first += -I../../../../../lib/smbsrv/libfksmbsrv/common 44 CPPFLAGS.first += -I../../../../../lib/libfakekernel/common
|
/illumos-gate/usr/src/cmd/mdb/sparc/v9/libfksmbsrv/ |
H A D | Makefile | 44 CPPFLAGS.first += -I../../../../../lib/smbsrv/libfksmbsrv/common 45 CPPFLAGS.first += -I../../../../../lib/libfakekernel/common
|
/illumos-gate/usr/src/lib/libsqlite/src/ |
H A D | hash.c | 41 new->first = 0; 55 elem = pH->first; 56 pH->first = 0; 181 for(elem=pH->first, pH->first=0; elem; elem = next_elem){ 189 else pH->first = elem; 192 elem->next = pH->first; 193 if( pH->first ) pH->first->prev = elem; 195 pH->first [all...] |
/illumos-gate/usr/src/lib/libc/i386/unwind/ |
H A D | unwind_frame.s | 44 movl (%ebp), %edx / pop first frame [ back to f1() ] 63 pushl 8(%esp) / first argument [arg]
|
/illumos-gate/usr/src/test/util-tests/tests/libnvpair_json/ |
H A D | json_07_nested_arrays.ksh | 32 "first level":[\ 73 add_object_array "first level";
|
/illumos-gate/usr/src/lib/cfgadm_plugins/sbd/common/ |
H A D | ap_seq.c | 47 ap_suspend_check(apd_t *a, int cmd, int first, int last, int *suspend) argument 61 for (check = 0, c = first; c <= last; c++) 91 ap_seq_get(apd_t *a, int cmd, int *first, int *last) argument 204 *first = f; 208 rs, os, cmd, (void *)first, (void *)last, f, l); 214 DBG("Sequencing recovery: first = %s, last = %s\n", \ 218 ap_seq_exec(apd_t *a, int cmd, int first, int last) argument 225 int recover_f = CMD_NONE; /* first recovery cmd */ 245 rc = ap_platopts_check(a, first, last); 251 for (c = first; 415 int first, last; local [all...] |
/illumos-gate/usr/src/cmd/pools/poold/com/sun/solaris/domain/pools/ |
H A D | Statistic.java | 290 Date first = start, last = end; 298 if (first == null) 299 first = s.getStart(); 311 return (new DoubleStatistic(new Double(total / count), first, 378 Date first = start, last = end; 385 if (first == null) 386 first = s.getStart(); 398 return (new LongStatistic(new Long(total / count), first, 465 Date first = start, last = end; 473 if (first [all...] |
/illumos-gate/usr/src/uts/common/fs/zfs/ |
H A D | zle.c | 45 uchar_t *first = src; local 51 *len = src - first - 1 + n; 60 *len = src - first - 1;
|
/illumos-gate/usr/src/tools/cscope-fast/ |
H A D | crossref.c | 72 int first; /* index of first character in text */ member in struct:symbol 110 length = last - first; 114 last = first + 8; 124 strncmp(yytext + first, yytext + 125 symbol[i].first, length) == 0 && 128 first = yyleng; 174 symbol[symbols].first = first; 176 symbol[symbols].length = last - first; [all...] |
/illumos-gate/usr/src/lib/libast/common/sfio/ |
H A D | sffilbuf.c | 26 ** If n == 0, if the buffer is not empty, just return the first byte; 27 ** otherwise fill the buffer and return the first byte. 43 reg int first, local, rcrv, rc, justseek; local 56 for(first = 1;; first = 0, (f->mode &= ~SF_LOCK) ) 64 { /* on first iteration, n is amount beyond current buffer; 66 if((first && n <= 0) || (!first && n <= r) ||
|
/illumos-gate/usr/src/cmd/mandoc/ |
H A D | tbl.c | 114 while (rp->first != NULL) { 115 cp = rp->first; 116 rp->first = cp->next; 124 while (sp->first != NULL) { 125 dp = sp->first; 126 sp->first = dp->next; 175 while (sp != NULL && sp->first == NULL)
|
/illumos-gate/usr/src/uts/intel/io/vgatext/ |
H A D | bdf_to_c.awk | 74 first = 1; 210 if (first) { 212 first = 0;
|
/illumos-gate/usr/src/lib/libc/sparc/gen/ |
H A D | strcpy.s | 54 ! first checking the alignment of its source pointer. And, 74 stb %o1, [%o2] ! store first byte 82 srl %o1, 8, %o4 ! %o4<7:0> = first byte 83 tst %o4 ! first byte zero ? 85 stb %o4, [%o2] ! store first byte 111 srl %o1, 24, %o3 ! %o3<7:0> = first byte 112 andcc %o1, %o4, %g0 ! first byte zero? 114 stb %o3, [%o2 - 4] ! store first byte 143 srl %o1, 24, %g1 ! %g1<7:0> = first byte 144 stb %g1, [%o2 - 4] ! store first byt [all...] |
H A D | memchr.s | 50 ! The first part of this algorithm focuses on determining 51 ! whether or not the desired character is in the first few bytes 72 bz .notfound ! c not found in first n bytes 81 bz .notfound ! c not found in first n bytes 90 bz .notfound ! c not found in first n bytes 124 andcc %g1, %o4, %g0 ! first byte zero (= found c) ? 152 andcc %g1, %o4, %g0 ! first byte zero (= found c) ? 156 bz .notfound ! c not found in first n bytes 161 bz .notfound ! c not found in first n bytes 166 bz .notfound ! c not found in first [all...] |
/illumos-gate/usr/src/cmd/sendmail/libsm/ |
H A D | config.c | 47 static bool first = true; local 80 ** If this is our first time through, use malloc(), else realloc(). 83 if (first) 89 first = false;
|
/illumos-gate/usr/src/psm/stand/cpr/sparcv9/sun4u/ |
H A D | cb_srt0.s | 96 ! first stage 102 mov 1, %o1 ! first=true 116 mov 0, %o1 ! first=false
|
/illumos-gate/usr/src/uts/common/sys/ |
H A D | kiconv_cck_common.h | 56 #define KICONV_IS_INVALID_UTF8_SECOND_BYTE(second, first) \ 57 ((second) < u8_valid_min_2nd_byte[(first)] || \ 58 (second) > u8_valid_max_2nd_byte[(first)])
|
H A D | strft.h | 133 struct ftblk first; member in struct:fthdr 154 _hp->tail = &_hp->first; \ 158 _hp->first.nxt = NULL; \ 159 _hp->first.ix = 0; \
|
/illumos-gate/usr/src/uts/sun4/io/px/ |
H A D | px_msi.c | 134 int first, count, i, n; local 152 for (first = 0; (first + count) < msi_state_p->msi_cnt; 153 first += count) { 154 for (i = first; i < (first + count); i++) { 160 if (i == (first + count)) { 184 for (i = first; i < (first + count); i++, inum++) { 202 first [all...] |
/illumos-gate/usr/src/lib/libtecla/common/ |
H A D | keytab.c | 80 int nc, int *first, int *last); 266 int first,last; /* The first and last entries in the table which */ local 306 switch(_kt_locate_keybinding(kt, binary, nc, &first, &last)) { 314 _kt_assign_action(kt->table + first, binder, keyfn, data); 316 _del_StringMemString(kt->smem, kt->table[first].keyseq); 317 memmove(kt->table + first, kt->table + first + 1, 318 (kt->nkey - first - 1) * sizeof(kt->table[0])); 395 * first,las 408 _kt_locate_keybinding(KeyTab *kt, const char *binary_keyseq, int nc, int *first, int *last) argument 486 int first,last; /* The indexes of the first and last matching entry */ local [all...] |
/illumos-gate/usr/src/lib/libc/sparcv9/gen/ |
H A D | memchr.s | 50 ! The first part of this algorithm focuses on determining 51 ! whether or not the desired character is in the first few bytes 72 bz %ncc, .notfound ! c not found in first n bytes 81 bz %ncc, .notfound ! c not found in first n bytes 90 bz %ncc, .notfound ! c not found in first n bytes 123 andcc %g1, %o4, %g0 ! first byte zero (= found c) ? 152 andcc %g1, %o4, %g0 ! first byte zero (= found c) ? 156 bz %ncc, .notfound ! c not found in first n bytes 161 bz %ncc, .notfound ! c not found in first n bytes 166 bz %ncc, .notfound ! c not found in first [all...] |
/illumos-gate/usr/src/lib/brand/shared/brand/amd64/ |
H A D | crt.s | 59 movq %rsp, %rbp / first stack frame
|
/illumos-gate/usr/src/uts/common/io/mega_sas/ |
H A D | list.h | 174 * @head: the place to add it in the first list. 178 struct mlist_head *first = list->next; local 180 if (first != list) { 184 first->prev = head; 185 head->next = first;
|