/osnet-11/usr/src/lib/libc/sparc/gen/ |
H A D | strncpy.s | 112 ! n has not expired, but src is at the end. we need to push out the 141 ! here there is a least one more byte to zero out: otherwise we would 148 bz .done ! n == 0, we are done 154 ! here we know that there at least another 4 bytes to pad, since 155 ! we don't get here unless there were >= 8 bytes to pad to begin 156 ! with, and we have padded at most 3 bytes suring dst aligning 175 bz .done ! if n == 0, we are done 182 bz .done ! yup, we are done 206 bz .done ! if n == 0, we're done 213 bz .done ! if n == 0, we'r [all...] |
H A D | strlcpy.s | 44 ! we must still continue to check for zero since the routine 49 ! Once this has occurred, we copy based upon destination alignment. 50 ! This is either by word, halfword, or byte. As this occurs, we 51 ! check for a zero-byte. If one is found, we branch to a method 189 bnz,pn %icc, .zerobyte ! non-zero, we have zero byte 206 bnz,pn %icc, .zerobyte ! non-zer, we have zero byte
|
H A D | ascii_strcasecmp.s | 197 ! Here, we initialize our checks for a zero byte and decide 198 ! whether or not we can optimize further if we're fortunate 228 ! word aligned, if it is, we use word4 & cmp4 272 ! we have a word aligned source and destination! This means 320 ! we know byte 1 is equal, so can compare bytes 1,2 as a group 329 ! we know bytes 1, 2 are equal, so can compare bytes 1,2,3 as a group 337 ! we know bytes 1,2,3 are equal, so can compare bytes 1,2,3,4 as group
|
H A D | strlen.s | 52 ! null byte. To this end, we attempt to get our string aligned 54 ! finding null bytes. If we are not aligned, the string is 56 ! we can proceed word-wise across it. Once a word with a 57 ! zero byte has been found, we then check the word a byte 58 ! at a time until we've located the zero byte, and return
|
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/ |
H A D | perl5db.pl | 44 API, but for now, the variables are what we've got. 125 bit-pattern, we can save and restore it easily (it will just look like 512 and the user's current package) and a add a newline before we do the C<eval()>. 514 Afterward, we restore C<$trace>, C<$single>, and C<$^D>. 516 Next we need to handle C<$@> without getting confused. We save C<$@> in a 520 considered sane by the debugger. If there was an C<eval()> error, we print 521 it on the debugger's output. If X<C<$onetimedump>> is defined, we call 528 In any case, we then return the list of output from C<eval> to the caller, 574 we want to be 'sandboxed' away from the debugger's internals when we d [all...] |
/osnet-11/usr/src/grub/grub2/docs/ |
H A D | texinfo.tex | 38 % complete document in each bug report with which we can reproduce the 63 % and turn on active characters that we couldn't do earlier because 72 % For @tex, we can use \tabalign. 75 % Save some plain tex macros whose names we will redefine. 106 % messages, but if we're using an old version of TeX, don't do anything. 154 % Since the category of space is not known, we have to be careful. 158 % sometimes characters are active, so we need control sequences. 202 % change spans more than two lines of output. To handle that, we would 257 % we did was a \nobreak, we do [all...] |
/osnet-11/usr/src/lib/libc/sparcv9/gen/ |
H A D | strncpy.s | 119 ! n has not expired, but src is at the end. we need to push out the 159 ! here there is a least one more byte to zero out: otherwise we would 166 bz,pt %ncc, .done ! n == 0, we are done 173 ! here we know that there at least another 8 bytes to pad, since 174 ! we don't get here unless there were >= 16 bytes to pad to begin 175 ! with, and we have padded at most 7 bytes suring dst aligning 194 bz,pn %ncc, .done ! if n == 0, we are done 200 bz,pt %ncc, .done ! yup, we are done 225 bz .done ! if n == 0, we're done 231 bz .done ! if n == 0, we'r [all...] |
H A D | ascii_strcasecmp.s | 197 ! Here, we initialize our checks for a zero byte and decide 198 ! whether or not we can optimize further if we're fortunate 228 ! word aligned, if it is, we use word4 & cmp4 273 ! we have a word aligned source and destination! This means 321 ! we know byte 1 is equal, so can compare bytes 1,2 as a group 330 ! we know bytes 1, 2 are equal, so can compare bytes 1,2,3 as a group 338 ! we know bytes 1,2,3 are equal, so can compare bytes 1,2,3,4 as group
|
H A D | strlcpy.s | 45 ! we must still continue to check for zero since the routine 50 ! Once this has occurred, we copy based upon destination alignment. 51 ! This is either by xword, word, halfword, or byte. As this occurs, we 52 ! check for a zero-byte. If one is found, we branch to a method 112 ! n has not expired, but src is at the end. we need to push out the 113 ! remaining src bytes. Since strlen(dts) == strlen(src), we can 163 ! processing of this last src word, we are done. Otherwise continue 164 ! to scan src until we hit the end, and compute strlen from the 169 add %i2, %g4, %i2 ! we want a single dst pointer here 171 add %i3, %g4, %i3 ! we wan [all...] |
H A D | memset.s | 135 stb %o1, [%o5 + -1] ! we've already incremented the address
|
H A D | strlen.s | 52 ! null byte. To this end, we attempt to get our string aligned 54 ! finding null bytes. If we are not aligned, the string is 56 ! we can proceed word-wise across it. Once a word with a 57 ! zero byte has been found, we then check the word a byte 58 ! at a time until we've located the zero byte, and return
|
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/CGI/examples/ |
H A D | javascript.cgi | 7 # Here's the javascript code that we include in the document. 27 // Since we've calculated the age in years already, 28 // we might as well send it up to our CGI script.
|
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Text/TabsWrap/t/ |
H A D | fill.t | 32 two weeks. In the meantime, we have released another version of 35 notes to see what we fixed! 49 available within the next two weeks. In the meantime, we have released 52 can check out our release notes to see what we fixed!
|
/osnet-11/usr/src/lib/libc/capabilities/sun4u-us3/common/ |
H A D | memcmp.s | 95 bgu %ncc, .dwcmp ! we should already be dbl aligned 131 fsrc1 %d8, %d8 ! be used for 3 cycles else we
|
/osnet-11/usr/src/lib/libc/sparc/threads/ |
H A D | asm_subr.s | 45 ! All we need to do now is (carefully) call lwp_exit(). 48 RET ! if we return, it is very bad 153 * This version is faster than the old non-threaded version because we
|
/osnet-11/usr/src/lib/libc/sparc/crt/ |
H A D | _rtboot.s | 84 ! Create a stack frame, perform PIC set up. If we're a "normal" start, we have 86 ! boot attribute value vector. Otherwise, it's already been done and we can 95 ! the stack. Note that we will call ld.so with an entry vector that causes 96 ! it to use the stack frame we have. 117 tst %l1 ! are we at a "0" entry in environment?
|
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/ext/Devel/Peek/ |
H A D | Peek.pm | 199 monumental task, and, frankly, we don't want this manpage to be an internals 206 Oh, one final bit of advice: take L<perlguts> with you. When you return we 229 current PV field is valid. Because POK is set we look at the PV item 232 If the FLAGS had been IOK we would look 255 being evaluated as a number. Because IOK is set we look at the IV item to 275 reference count. Compare this to the next example, where we dump C<$b> 300 ROK is set we have an RV item rather than an IV or PV. Notice that Dump 302 same C<$a> that we found in the previous example. 304 Note that the value of C<RV> coincides with the numbers we see when we [all...] |
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/ext/POSIX/ |
H A D | Makefile.PL | 89 /* HUGE_VALL is admittedly non-POSIX but if we are using long doubles 90 * we might as well use long doubles. --jhi */
|
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Time/ |
H A D | Local.pm | 42 # so we need to calculate an offset to apply later 124 # Is there a timezone offset from GMT or are we done 131 # Are we close to a DST change or are we done 139 # was a non-extent gap in a forward DST jump, we should 251 of any months we've seen before. If we know the start time of the month, 252 we can always calculate any time within the month. The start times 256 timelocal() is implemented using the same cache. We just assume that we're 257 translating a GMT time, and then fudge it when we'r [all...] |
/osnet-11/usr/src/lib/libc/i386/gen/ |
H A D | strncmp.s | 93 jc .neg / did we overflow in the sub
|
/osnet-11/usr/src/lib/libc/capabilities/sun4u/common/ |
H A D | memcmp.s | 89 bgu,a %ncc, .blkchk ! we should already be dbl aligned 127 fsrc1 %d8, %d8 ! be used for 3 cycles else we 186 fsrc1 %d8, %d8 ! be used for 3 cycles else we
|
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/ext/Digest/MD5/ |
H A D | MD5.pm | 160 The $data provided as argument are appended to the message we 174 message we calculate the digest for. The return value is the $md5 251 With OO style you can break the message arbitrary. This means that we 253 we can handle messages of any size. 270 Or we can use the addfile method for more efficient reading of
|
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/ExtUtils/ |
H A D | MM_Win32.pm | 94 Since Windows has nothing as simple as an executable bit, we check the 129 So we do it for them. 193 # -Lfoo must come first for Borland, so we put it in LDDLFLAGS 318 # we try to overcome non-relocateable-DLL problems by generating 425 All we send is -nologo to nmake to prevent it from printing its damned
|
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/File/ |
H A D | Spec.pm | 230 on two different volumes, we will not attempt to resolve the two 231 paths, and we will instead simply return $path. Note that previous 260 on two different volumes, we will not attempt to resolve the two 261 paths, and we will instead simply return $path. Note that previous
|
/osnet-11/usr/src/lib/libc/i386_hwcap1/gen/ |
H A D | memcpy.s | 107 / use aligned load since we're lucky 132 / use aligned load since we're lucky 166 cmpl $64, %ecx / after aligning, will we still have 64 bytes? 229 / .CopyLeft handles the memmove case where we must perform the copy backwards, 251 addl $1, %ecx / we need to insure that future
|