/osnet-11/usr/src/cmd/dtrace_toolkit/DTT/Bin/ |
H A D | pathopens.d | 3 * pathopens.d - full pathnames opened successfully count. 7 * successfully opened. This is somewhat special in that the full pathname 15 * PATHNAME full pathname 66 * Make the full pathname 69 * full pathname. If the filename is absolute, we ignore the base dir. 74 self->full = strjoin(strjoin(self->dir, self->join), self->file); 77 @num[self->full] = count(); 81 self->full = 0;
|
H A D | j_calltime.d | 90 self->full = (boolean_t)arg0; 99 @num[pid, "gc", self->full == B_FALSE ? "GC" : "Full GC"] = count(); 100 @types[pid, "gc", self->full == B_FALSE ? "GC" : "Full GC"] = 102 self->full = 0;
|
H A D | j_cputime.d | 90 self->full = (boolean_t)arg0; 99 @num[pid, "gc", self->full == B_FALSE ? "GC" : "Full GC"] = count(); 100 @types[pid, "gc", self->full == B_FALSE ? "GC" : "Full GC"] = 102 self->full = 0;
|
H A D | j_calldist.d | 88 self->full = (boolean_t)arg0; 96 @types[pid, "gc", self->full == B_FALSE ? "GC" : "Full GC"] = 100 self->full = 0;
|
H A D | j_cpudist.d | 88 self->full = (boolean_t)arg0; 96 @types[pid, "gc", self->full == B_FALSE ? "GC" : "Full GC"] = 100 self->full = 0;
|
/osnet-11/usr/src/cmd/dtrace_toolkit/DTT/Proc/ |
H A D | pathopens.d | 3 * pathopens.d - full pathnames opened successfully count. 7 * successfully opened. This is somewhat special in that the full pathname 15 * PATHNAME full pathname 66 * Make the full pathname 69 * full pathname. If the filename is absolute, we ignore the base dir. 74 self->full = strjoin(strjoin(self->dir, self->join), self->file); 77 @num[self->full] = count(); 81 self->full = 0;
|
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/t/op/ |
H A D | my.t | 97 for my $full (keys %fonts) { 98 $full =~ s/^n//; 100 print "$full $fonts{nok}\n";
|
/osnet-11/usr/src/cmd/dtrace_toolkit/DTT/Java/ |
H A D | j_calltime.d | 90 self->full = (boolean_t)arg0; 99 @num[pid, "gc", self->full == B_FALSE ? "GC" : "Full GC"] = count(); 100 @types[pid, "gc", self->full == B_FALSE ? "GC" : "Full GC"] = 102 self->full = 0;
|
H A D | j_cputime.d | 90 self->full = (boolean_t)arg0; 99 @num[pid, "gc", self->full == B_FALSE ? "GC" : "Full GC"] = count(); 100 @types[pid, "gc", self->full == B_FALSE ? "GC" : "Full GC"] = 102 self->full = 0;
|
H A D | j_calldist.d | 88 self->full = (boolean_t)arg0; 96 @types[pid, "gc", self->full == B_FALSE ? "GC" : "Full GC"] = 100 self->full = 0;
|
H A D | j_cpudist.d | 88 self->full = (boolean_t)arg0; 96 @types[pid, "gc", self->full == B_FALSE ? "GC" : "Full GC"] = 100 self->full = 0;
|
/osnet-11/usr/src/lib/libproc/common/ |
H A D | pr_lseek.c | 35 offset_t full; /* full 64 bit offset value */ member in union:__anon2368 75 off.full = offset; 108 offset = (off_t)off.full; 150 off.full = offset; 183 offset = off.full;
|
/osnet-11/usr/src/lib/libtsol/common/ |
H A D | getpathbylabel.c | 56 * Return a pointer to the trailing suffix of full that follows the prefix 57 * given by pref. If pref isn't a prefix of full, return NULL. Apply 62 pathsuffix(char *full, char *pref) argument 66 if (full == NULL || pref == NULL) 70 if (strncmp(pref, full, preflen) != 0) 74 * pref is a substring of full. To be a subpath, it cannot cover a 75 * partial component of full. The last clause of the test handles the 78 if (full[preflen] != '\0' && full[preflen] != '/' && preflen > 1) 81 if (preflen == 1 && full[ 94 subpath(char *full, char *sub) argument [all...] |
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Tie/ |
H A D | SubstrHash.t | 55 print "not " unless $@ =~ /Table is full \(3 elements\)/;
|
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/ |
H A D | DirHandle.pm | 36 about specifying relative pathnames. While a full path always begins
|
H A D | charnames.t | 20 use charnames ':full'; 30 use charnames ":full"; 68 use charnames ':full'; 81 use charnames ':full'; 99 use charnames qw(:full); 110 use charnames qw(:full); 117 use charnames ':full'; 130 use charnames ':full'; 351 use charnames ":alias" => ":full"; 354 :alias cannot use existing pragma :full \(reverse [all...] |
/osnet-11/usr/src/grub/grub2/grub-core/lib/xzembed/ |
H A D | xz_dec_lzma2.c | 45 * start <= pos <= full <= end 67 * How full dictionary is. This is used to detect corrupt input that 70 size_t full; member in struct:dictionary 84 * together with "full" to detect corrupt input that would make us 292 dict->full = 0; 324 return dict->full > 0 ? dict->buf[offset] : 0; 334 if (dict->full < dict->pos) 335 dict->full = dict->pos; 349 if (dist >= dict->full || dist >= dict->size) 365 if (dict->full < dic [all...] |
/osnet-11/usr/src/grub/grub-0.97/stage2/ |
H A D | char_io.c | 309 auto void cl_refresh (int full, int len); 372 /* Refresh the screen. If FULL is true, redraw the full line, otherwise, 374 void cl_refresh (int full, int len) argument 380 if (full) 416 if (! full) 427 if (! full) 482 /* Print full line and set position here. */
|
/osnet-11/usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/ |
H A D | bt_split.c | 625 indx_t full, half, nxt, off, skip, top, used; local 637 full = t->bt_psize - BTDATAOFF; 638 half = full / 2; 676 if ((skip <= off && used + nbytes + sizeof(indx_t) >= full)
|
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/pod/ |
H A D | pod2latex.PL | 55 "full" => 0, 66 "full", 128 AddPreamble => $options{'full'}, 129 AddPostamble => $options{'full'}, 130 MakeIndex => $options{'full'}, 131 TableOfContents => $options{'full'}, 184 $preamble = 1 if ($converted == 0 && $options{'full'}); 190 my $postamble = ( ($converted == $#pods && $options{'full'}) ? 1 : 0 ); 196 MakeIndex => $options{'full'}, 200 StartWithNewPage => $options{'full'}, [all...] |
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/File/ |
H A D | stat.pm | 114 function functions with their full qualified names.
|
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Net/ |
H A D | protoent.pm | 85 function functions with their full qualified names.
|
H A D | servent.pm | 87 function functions with their full qualified names.
|
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Time/ |
H A D | gmtime.pm | 79 function functions with their full qualified names.
|
H A D | localtime.pm | 75 function functions with their full qualified names.
|