HomeSort by relevance Sort by last modified time
    Searched full:nwords (Results 1 - 25 of 43) sorted by null

1 2

  /external/bison/m4/
exponentf.m4 17 #define NWORDS \
19 typedef union { float value; unsigned int word[NWORDS]; } memory_float;
20 static unsigned int ored_words[NWORDS];
21 static unsigned int anded_words[NWORDS];
30 for (i = 0; i < NWORDS; i++)
42 for (j = 0; j < NWORDS; j++)
51 for (j = 0; j < NWORDS; j++)
54 for (j = 0; j < NWORDS; j++)
57 if (j < NWORDS)
60 for (i = j + 1; i < NWORDS; i++
    [all...]
exponentd.m4 17 #define NWORDS \
19 typedef union { double value; unsigned int word[NWORDS]; } memory_double;
20 static unsigned int ored_words[NWORDS];
21 static unsigned int anded_words[NWORDS];
29 for (i = 0; i < NWORDS; i++)
41 for (j = 0; j < NWORDS; j++)
50 for (j = 0; j < NWORDS; j++)
53 for (j = 0; j < NWORDS; j++)
56 if (j < NWORDS)
59 for (i = j + 1; i < NWORDS; i++
    [all...]
exponentl.m4 18 #define NWORDS \
20 typedef union { long double value; unsigned int word[NWORDS]; }
22 static unsigned int ored_words[NWORDS];
23 static unsigned int anded_words[NWORDS];
32 for (i = 0; i < NWORDS; i++)
44 for (j = 0; j < NWORDS; j++)
53 for (j = 0; j < NWORDS; j++)
56 for (j = 0; j < NWORDS; j++)
59 if (j < NWORDS)
62 for (i = j + 1; i < NWORDS; i++
    [all...]
isnanl.m4 136 #define NWORDS \
138 typedef union { unsigned int word[NWORDS]; long double value; }
167 m.word[NWORDS / 2] ^= (unsigned int) 1 << (sizeof (unsigned int) * CHAR_BIT - 1);
168 for (i = 0; i < NWORDS; i++)
isnanf.m4 148 #define NWORDS \
150 typedef union { unsigned int word[NWORDS]; float value; } memory_float;
signbit.m4 253 #define NWORDS \
255 typedef union { $1 value; unsigned int word[NWORDS]; }
268 for (j = 0; j < NWORDS; j++)
  /external/libedit/doc/
mdoc2man.awk 43 while(w<nwords) {
73 nwords=split($0,words)
74 for(w=1;w<=nwords;w++) {
88 w=nwords
94 w=nwords
122 while(w<nwords&&!match(words[w+1],"^[\\.,]"))
130 while(w<nwords&&!match(words[w+1],"^[\\.,]"))
231 if(w==nwords)
242 while(w<nwords&&match(words[w+1],"^[\\.,:;)]"))
261 while(w<nwords&&match(words[w+1],"^[\\.,:;)]")
    [all...]
  /system/core/libmincrypt/tools/
DumpPublicKey.java 113 int nwords = N.bitLength() / 32; // # of 32 bit integers in modulus local
122 result.append(nwords);
135 for (int i = 0; i < nwords; ++i) {
139 if (i != nwords - 1) {
149 for (int i = 0; i < nwords; ++i) {
153 if (i != nwords - 1) {
  /external/bison/lib/
signbitd.c 40 # define NWORDS \
42 union { double value; unsigned int word[NWORDS]; } m;
signbitf.c 40 # define NWORDS \
42 union { float value; unsigned int word[NWORDS]; } m;
signbitl.c 40 # define NWORDS \
42 union { long double value; unsigned int word[NWORDS]; } m;
isnan.c 78 #define NWORDS \
80 typedef union { DOUBLE value; unsigned int word[NWORDS]; } memory_double;
  /external/mksh/src/
edit.c 226 x_print_expansions(int nwords, char * const *words, bool is_command)
237 (prefix_len = x_longest_prefix(nwords, words)) > 0) {
241 if (nwords == 1)
244 for (i = 0; i < nwords; i++)
249 if (i == nwords) {
253 XPinit(l, nwords + 1);
254 for (i = 0; i < nwords; i++)
368 int nwords; local
393 nwords = DOGLOB | DOTILDE | DOMARKDIRS;
398 nwords = 0
458 size_t nwords; local
591 int len, nwords = 0; local
2677 int start, end, nwords, i; local
2711 int start, end, nlen, olen, nwords; local
5240 int rval = 0, nwords, start, end, i; local
5293 int rval, nwords, start, end, flags; local
5408 int start, end, nwords, i; local
    [all...]
  /external/fonttools/Lib/fontTools/ttLib/tables/
ttProgram.py 319 nWords = 0
321 while nWords < nArgs and nWords < 255 and not (0 <= args[nWords] <= 255):
322 nWords += 1
324 while nWords+nBytes < nArgs and nBytes < 255 and 0 <= args[nWords+nBytes] <= 255:
326 if nBytes < 2 and nWords + nBytes < 255 and nWords + nBytes != nArgs:
328 nWords += nByte
    [all...]
  /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/
BitSet.as 113 * @param nwords how many words the new set should be
115 private function set size(nwords:int):void {
116 bits.length = nwords;
  /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/
BitSet.java 152 * @param nwords how many words the new set should be
154 private void setSize(int nwords) {
155 long newbits[] = new long[nwords];
156 int n = Math.min(nwords, bits.length);
  /external/openssl/crypto/bn/
bn_lib.c 840 * nwords is the number of words to swap. The code assumes that at least nwords are allocated in both a and b,
841 * and that no more than nwords are used by either a or b.
844 void BN_consttime_swap(BN_ULONG condition, BIGNUM *a, BIGNUM *b, int nwords)
849 bn_wcheck_size(a, nwords);
850 bn_wcheck_size(b, nwords);
870 switch (nwords) {
872 for (i = 10; i < nwords; i++)
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/
BitSet.cs 161 * <param name="nwords">how many words the new set should be</param>
163 private void SetSize(int nwords) {
164 Array.Resize(ref _bits, nwords);
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/
BitSet.cs 181 * <param name="nwords">how many words the new set should be</param>
183 private void SetSize( int nwords )
185 Array.Resize(ref _bits, nwords);
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
BitSet.java 405 * @param nwords how many words the new set should be
407 private void setSize(int nwords) {
408 long newbits[] = new long[nwords];
409 int n = Math.min(nwords, bits.length);
  /external/pdfium/fpdfsdk/src/javascript/
Document.cpp     [all...]
  /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/
BitSet.js 507 * Grows the internal bits array to include at least nwords numbers.
508 * @param {Number} nwords how many words the new set should be
511 setSize: function(nwords) {
512 var n = nwords - this.bits.length;
  /external/elfutils/0.153/lib/
md5.c 303 size_t nwords = len / sizeof (md5_uint32); local
304 const md5_uint32 *endp = words + nwords;
sha1.c 228 size_t nwords = len / sizeof (sha1_uint32); local
229 const sha1_uint32 *endp = words + nwords;
  /external/valgrind/main/helgrind/
hg_wordset.h 92 void HG_(getPayloadWS) ( /*OUT*/UWord** words, /*OUT*/UWord* nWords,

Completed in 946 milliseconds

1 2