Home
last modified time | relevance | path

Searched refs:word (Results 1 – 25 of 407) sorted by relevance

12345678910>>...17

/onnv-gate/usr/src/common/crypto/aes/sun4u/
H A Daes_crypt_asm.s87 .word 1584
88 .word 1661148456
89 .word 1984
90 .word 2080629792
91 .word 1904
92 .word 1996733640
93 .word 1968
94 .word 2063850600
95 .word 2040
96 .word -234385304
[all …]
/onnv-gate/usr/src/common/crypto/des/sun4u/
H A Ddes_crypt_asm.s107 .word 5121
108 .word 1073872896
109 .word 0
110 .word 0
111 .word 1
112 .word 1073741824
113 .word 5121
114 .word 1073872928
115 .word 5121
116 .word 1073741856
[all …]
/onnv-gate/usr/src/cmd/perl/5.8.4/distrib/lib/
H A Dwarnings.pm312 foreach my $word ( @_ ) {
313 if ($word eq 'FATAL') {
317 elsif ($word eq 'NONFATAL') {
321 elsif ($catmask = $Bits{$word}) {
323 $mask |= $DeadBits{$word} if $fatal ;
324 $mask &= ~($DeadBits{$word}|$All) if $no_fatal ;
327 { Croaker("Unknown warnings category '$word'")}
350 foreach my $word ( @_ ) {
351 if ($word eq 'FATAL') {
355 elsif ($word eq 'NONFATAL') {
[all …]
/onnv-gate/usr/src/uts/common/os/
H A Dbitmap.c74 ulong_t word; in bt_availbit() local
78 word = bitmap[wx]; in bt_availbit()
81 if (!(word & bit)) { in bt_availbit()
97 ulong_t word; in bt_gethighbit() local
99 while ((word = mapp[wx]) == 0) { in bt_gethighbit()
105 return (wx << BT_ULSHIFT | (highbit(word) - 1)); in bt_gethighbit()
174 ulong_t word; in bt_getlowbit() local
190 word = map[counter]; in bt_getlowbit()
198 word = word & (BT_ULMAXMASK << partial_start); in bt_getlowbit()
205 while ((word == 0) && (counter < limit)) { in bt_getlowbit()
[all …]
/onnv-gate/usr/src/cmd/csh/
H A Dsh.parse.c72 if (p1->word[0] == ';' || in asyntax()
73 p1->word[0] == '&' || in asyntax()
74 p1->word[0] == '\n') in asyntax()
92 switch (p->word[0]) { in asyn0()
105 if (p->next != p2 && eq(p->next->word, S_AND /* "&"*/)) in asyn0()
135 if (p1->word[0] == '(') { in asyn3()
136 for (p2 = p2->prev; p2->word[0] != ')'; p2 = p2->prev) in asyn3()
144 ap = adrof1(p1->word, &aliases); in asyn3()
157 if (p1->word[0] && eq(p1->word, alout.next->word)) { in asyn3()
158 tchar *cp = alout.next->word; in asyn3()
[all …]
/onnv-gate/usr/src/cmd/sh/
H A Dblok.c43 #define busy(x) (Rcheat((x)->word) & BUSY)
85 while (!busy(q = p->word)) in alloc()
86 p->word = q->word; in alloc()
91 blokp->word = p->word; in alloc()
92 p->word = (struct blk *) in alloc()
101 p = (struct blk *)(Rcheat(p->word) & ~BUSY); in alloc()
129 blokstak->word = stakbsy; in addblok()
131 bloktop->word = (struct blk *)(Rcheat(rndstak) | BUSY); in addblok()
141 if ((unsigned char *)&bloktop->word >= brkend) { in addblok()
143 (&bloktop->word) - brkend + sizeof (struct blk))) == in addblok()
[all …]
/onnv-gate/usr/src/lib/libc/sparcv9/gen/
H A Dascii_strcasecmp.s119 ! a word boundary. During these steps, the bytes are translated to
130 andcc %i0, 3, %i3 ! s1 word-aligned ?
195 andcc %i1, 3, %i3 ! s2 word-aligned ?
207 andcc %i1, 3, %i3 ! s2 word aligned ?
212 bz .word4 ! yup, s2 word-aligned
217 andn %i1, 3, %i1 ! round s1 pointer down to next word
220 lduw [%i1], %i0 ! new lower word from s2
222 sll %i0, %l6, %g1 ! partial unaligned word from s2
228 ! word aligned, if it is, we use word4 & cmp4
231 andn %i4, %i0, %l4 ! ~word & 0x80808080
[all …]
H A Dstrcmp.s95 sllx %o0, %g5, %g1 ! partial unaligned word from s2
101 andn %o4, %o0, %o3 ! ~word & 0x80808080
102 sub %o0, %o5, %o0 ! word - 0x01010101
103 andcc %o0, %o3, %g0 ! (word - 0x01010101) & ~word & 0x80808080
104 bz,a,pt %xcc, .doload ! no null byte in previous word from s2
105 ldx [%o1+8], %o0 ! next aligned word in s2
107 srlx %o0, %g4, %o3 ! bytes from aligned word from s2
108 or %g1, %o3, %g1 ! merge to get unaligned word from s2
109 ldx [%o1 + %o2], %o3 ! word from s1
113 andn %o4, %o3, %g1 ! ~word & 0x80808080
[all …]
H A Dstrchr.s40 ! word aligned, we check a for the search char a byte at a time
171 ! check to see if we're half word aligned, which it better than
172 ! not being aligned at all. Search the first half of the word
173 ! if we are, and then search by whole word.
192 lduw [%o0], %o1 ! src word
193 andn %o5, %o1, %o3 ! ~word & 0x80808080
194 sub %o1, %o4, %g1 ! word = (word - 0x01010101)
195 andcc %o3, %g1, %g0 ! ((word - 0x01010101) & ~word & 0x80808080)
/onnv-gate/usr/src/lib/libc/sparc/gen/
H A Dascii_strcasecmp.s119 ! a word boundary. During these steps, the bytes are translated to
130 andcc %i0, 3, %i3 ! s1 word-aligned ?
195 andcc %i1, 3, %i3 ! s2 word-aligned ?
207 andcc %i1, 3, %i3 ! s2 word aligned ?
212 bz .word4 ! yup, s2 word-aligned
217 andn %i1, 3, %i1 ! round s1 pointer down to next word
220 lduw [%i1], %i0 ! new lower word from s2
222 sll %i0, %l6, %g1 ! partial unaligned word from s2
228 ! word aligned, if it is, we use word4 & cmp4
231 andn %i4, %i0, %l4 ! ~word & 0x80808080
[all …]
H A Dstrcpy.s58 ! Methods exist to handle per-byte, half-word, and word sized
66 andcc %o1, 3, %o4 ! src word aligned ?
95 andcc %o2, 3, %o1 ! destination word aligned?
100 lduw [%o2 + %o3], %o1 ! src word
102 andn %o5, %o1, %g1 ! ~word & 0x80808080
103 sub %o1, %o4, %o1 ! word - 0x01010101
104 andcc %o1, %g1, %g0 ! ((word - 0x01010101) & ~word & 0x80808080)
105 add %o1, %o4, %o1 ! restore word
107 st %o1, [%o2 - 4] ! store word to dst (address pre-incremented)
132 cmp %o1, 2 ! dst half word aligned?
[all …]
H A Dstrchr.s40 ! word aligned, we check a for the search char a byte at a time
171 ! check to see if we're half word aligned, which it better than
172 ! not being aligned at all. Search the first half of the word
173 ! if we are, and then search by whole word.
192 lduw [%o0], %o1 ! src word
193 andn %o5, %o1, %o3 ! ~word & 0x80808080
194 sub %o1, %o4, %g1 ! word = (word - 0x01010101)
195 andcc %o3, %g1, %g0 ! ((word - 0x01010101) & ~word & 0x80808080)
/onnv-gate/usr/src/cmd/perl/5.8.4/distrib/lib/Search/
H A DDict.t48 chomp($word = <DICT>);
49 print "not " if $pos < 0 || $word ne "Ababa";
55 chomp($word = <DICT>);
61 chomp($word = <DICT>);
62 print "not " if $pos < 0 || $word ne "abash";
69 chomp($word = <DICT>);
75 chomp($word = <DICT>);
76 print "not " if $pos < 0 || $word ne "Abba";
81 chomp($word = <DICT>);
83 print "not " if $pos < 0 || $word ne "Aarhus";
/onnv-gate/usr/src/cmd/perl/5.8.4/distrib/lib/Text/
H A DAbbrev.pm44 my ($word, $hashref, $glob, %table, $returnvoid);
56 WORD: foreach $word (@_) {
57 for (my $len = (length $word) - 1; $len > 0; --$len) {
58 my $abbrev = substr($word,0,$len);
62 $hashref->{$abbrev} = $word;
73 foreach $word (@_) {
74 $hashref->{$word} = $word;
/onnv-gate/usr/src/lib/libc/i386/gen/
H A Dstrcat.s51 / to check if a 32-bit word data contains a null byte or not:
54 / that means the 32-bit word data contains a null byte.
63 testl $3, %edi / if %edi not word aligned
67 movl (%edi), %edx / move 1 word from (%edi) to %edx
70 addl $4, %edi / next word
74 cmpl $0x80808080, %ecx / if no null byte in this word
81 testl $3, %edi / if %edi not word aligned
83 jmp .L2 / goto .L2 (%edi word aligned)
88 testl $3, %eax / if %eax not word aligned
92 movl (%eax), %edx / move 1 word from (%eax) to %edx
[all …]
H A Dstrncat.s56 / to check if a 32-bit word data contains a null byte or not:
59 / that means the 32-bit word data contains a null byte.
68 testl $3, %edi / if %edi not word aligned
72 movl (%edi), %edx / move 1 word from (%edi) to %edx
75 addl $4, %edi / next word
79 cmpl $0x80808080, %ecx / if no null byte in this word
86 testl $3, %edi / if %edi not word aligned
88 jmp .L2 / goto .L2 (%edi word aligned)
95 testl $3, %eax / if %eax not word aligned
101 movl (%eax), %edx / move 1 word from (%eax) to %edx
[all …]
/onnv-gate/usr/src/cmd/perl/5.8.4/distrib/ext/Encode/lib/Encode/MIME/
H A DHeader.pm111 my (@word, @subline);
112 for my $word (split /($re_especials)/o, $line){
113 if ($word =~ /[^\x00-\x7f]/o or $word =~ /^$re_encoded_word$/o){
114 push @word, $obj->_encode($word);
116 push @word, $word;
120 for my $word (@word){
122 if (bytes::length($subline) + bytes::length($word) > $obj->{bpl}){
126 $subline .= $word;
/onnv-gate/usr/src/common/openssl/crypto/
H A Dsparccpuid.S46 .word 0x91408000 !rd %ccr,%o0
52 .word 0xbfa00040 !fmovd %f0,%f62
53 .word 0xbba00040 !...
54 .word 0xb7a00040
55 .word 0xb3a00040
56 .word 0xafa00040
57 .word 0xaba00040
58 .word 0xa7a00040
59 .word 0xa3a00040
60 .word 0x9fa00040
[all …]
/onnv-gate/usr/src/cmd/spell/
H A Dspellprog.c179 static char word[LINE_MAX]; variable
289 for (ep = word; (*ep = j = getchar()) != '\n'; ep++) in main()
300 if (!tryword(word, ep, 0)) in main()
301 (void) fprintf(file, "%s\n", word); in main()
304 for (cp = word, dp = original; cp < ep; ) in main()
308 for (cp = word; cp < ep; cp++) in main()
311 if (((ep - word) == 1) && in main()
312 ((word[0] == 'A') || (word[0] == 'I'))) in main()
317 for (cp = original+1, dp = word+1; dp < ep; dp++, cp++) in main()
320 if (((ep - word) == 1) && (word[0] == 'a')) in main()
[all …]
/onnv-gate/usr/src/common/openssl/doc/crypto/
H A Dbn_internal.pod82 least significant word first. A B<BN_ULONG> can be either 16, 32 or 64 bits
103 bn_mul_words(B<rp>, B<ap>, B<num>, B<w>) operates on the B<num> word
105 in B<rp>, and returns the high word (carry).
108 word arrays B<rp> and B<ap>. It computes B<ap> * B<w> + B<rp>, places
109 the result in B<rp>, and returns the high word (carry).
111 bn_sqr_words(B<rp>, B<ap>, B<n>) operates on the B<num> word array
112 B<ap> and the 2*B<num> word array B<ap>. It computes B<ap> * B<ap>
113 word-wise, and places the low and high bytes of the result in B<rp>.
115 bn_div_words(B<h>, B<l>, B<d>) divides the two word number (B<h>,B<l>)
118 bn_add_words(B<rp>, B<ap>, B<bp>, B<num>) operates on the B<num> word
[all …]
/onnv-gate/usr/src/tools/depcheck/
H A Dget_depend_info354 foreach $word (@words) {
359 if ($FTYPE{"$KernelPath/$word"} =~ /\w/){
360 &Output("$KernelPath/$word");
365 if (($FTYPE{"/kernel/$word"} =~ /\w/) && ($found == 0)){
366 &Output("/kernel/$word");
371 if (($FTYPE{"/usr/kernel/$word"} =~ /\w/) && ($found == 0)){
372 &Output("/usr/kernel/$word");
407 foreach $word (@outlines) {
408 if ($lastword ne $word) {
409 $outstring .= $word; $outstring .= "\n";
[all …]
/onnv-gate/usr/src/tools/ctf/stabs/common/
H A Dforth.c295 char *word, *name, *c; in fth_process_line() local
321 word = "model_start "; in fth_process_line()
322 if (strncmp(line, word, strlen(word)) == 0) { in fth_process_line()
323 for (c = line + strlen(word); isspace(*c); c++); in fth_process_line()
365 for (n = 1, word = strtok(line, " \t"); word != NULL; in fth_process_line()
366 word = strtok(NULL, " \t"), n++) { in fth_process_line()
368 name = word; in fth_process_line()
370 format = word; in fth_process_line()
/onnv-gate/usr/src/cmd/fs.d/autofs/
H A Dns_files.c84 char word[MAXPATHLEN+1], wordq[MAXPATHLEN+1]; local
155 if ((getword(word, wordq, &lp, &lq, ' ', sizeof (word))
156 == -1) || (word[0] == '\0'))
158 if (strcmp(word, key) == 0)
160 if (word[0] == '*' && word[1] == '\0') {
165 if (word[0] == '+') {
166 nserr = getmapent(key, word+1, ml, stack, stkptr,
179 if (*word != '/') {
183 word, mapname);
186 if (strchr(word, '/')) {
[all …]
/onnv-gate/usr/src/cmd/look/
H A Dlook.c29 char word[WORDSIZE]; variable
98 canon(entry,word); in main()
99 switch(compare(key,word)) { in main()
118 canon(entry,word); in main()
119 switch(compare(key,word)) { in main()
133 canon(entry,word); in main()
134 switch(compare(key,word)) { in main()
/onnv-gate/usr/src/uts/i86pc/os/
H A Dbiosdisk.c134 rp.eax.word.ax = 0x4100; in bios_check_extension_present()
135 rp.ebx.word.bx = 0x55AA; in bios_check_extension_present()
136 rp.edx.word.dx = drivenum; in bios_check_extension_present()
141 if (((rp.eflags & PS_C) != 0) || (rp.ebx.word.bx != 0xAA55)) { in bios_check_extension_present()
143 "failed %d bx = %x\n", rp.eflags, rp.ebx.word.bx)); in bios_check_extension_present()
147 if ((rp.ecx.word.cx & 0x7) == 0) { in bios_check_extension_present()
149 "not supported cx = %x\n", rp.ecx.word.cx)); in bios_check_extension_present()
178 rp.eax.word.ax = 0x4800; in get_dev_params()
181 rp.esi.word.si = (uint16_t)FP_OFF((uint_t)(uintptr_t)bufp); in get_dev_params()
269 rp.ebx.word.bx = (uint16_t)FP_OFF((uint_t)(uintptr_t)bufp); in read_firstblock()
[all …]

12345678910>>...17