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

1 2 3

  /external/python/cpython3/Modules/_decimal/libmpdec/
memory.c 154 /* Allocate a new decimal with a coefficient of length 'nwords'. In case
157 mpd_qnew_size(mpd_ssize_t nwords)
161 nwords = (nwords < MPD_MINALLOC) ? MPD_MINALLOC : nwords;
168 result->data = mpd_alloc(nwords, sizeof *result->data);
178 result->alloc = nwords;
207 * Assumption: 'nwords' >= result->alloc.
214 mpd_switch_to_dyn(mpd_t *result, mpd_ssize_t nwords, uint32_t *status)
218 assert(nwords >= result->alloc)
    [all...]
  /external/fio/lib/
bloom.h 11 bool bloom_set(struct bloom *b, uint32_t *data, unsigned int nwords);
bloom.c 116 bool bloom_set(struct bloom *b, uint32_t *data, unsigned int nwords)
118 return __bloom_check(b, data, nwords * sizeof(uint32_t), true);
  /external/vboot_reference/host/lib/
util_misc.c 35 uint32_t i, nwords; local
49 nwords = BN_num_bits(rsa_private_key->n) / 32;
51 bufsize = (2 + nwords + nwords) * sizeof(uint32_t);
59 *outbuf++ = nwords;
104 for (i = 0; i < nwords; ++i) {
115 for (i = 0; i < nwords; ++i) {
  /external/vboot_reference/utility/
dumpRSAPublicKey.c 42 int i, nwords; local
53 nwords = BN_num_bits(N) / 32;
54 if (-1 == write(1, &nwords, sizeof(nwords)))
98 for (i = 0; i < nwords; ++i) {
110 for (i = 0; i < nwords; ++i) {
  /external/tensorflow/tensorflow/core/lib/core/
bitmap.cc 81 const size_t nwords = NumWords(nbits_); local
82 for (size_t i = start / kBits; i < nwords; i++) {
  /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...]
  /bootable/recovery/tools/dumpkey/
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/mksh/src/
edit.c 241 x_print_expansions(int nwords, char * const *words, bool is_command)
253 (prefix_len = x_longest_prefix(nwords, words)) > 0) {
257 if (nwords == 1)
260 for (i = 0; i < nwords; i++)
265 if (i == nwords) {
270 XPinit(l, nwords + 1);
271 for (i = 0; i < nwords; i++)
389 int nwords; local
414 nwords = DOGLOB | DOTILDE | DOMARKDIRS;
419 nwords = 0
484 size_t nwords; local
616 int len, nwords = 0; local
2708 int start, end, nwords, i; local
2742 int start, end, nlen, olen, nwords; local
5299 int rval = 0, nwords, start, end, i; local
5352 int rval, nwords, start, end, flags; local
5467 int start, end, nwords, i; local
    [all...]
  /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/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/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/syslinux/com32/libutil/
sha256crypt.c 68 size_t nwords = len / sizeof(uint32_t); local
87 while (nwords > 0) {
144 nwords -= 16;
sha512crypt.c 99 size_t nwords = len / sizeof(uint64_t); local
118 while (nwords > 0) {
175 nwords -= 16;
  /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/lib/
md5.c 290 size_t nwords = len / sizeof (md5_uint32); local
291 const md5_uint32 *endp = words + nwords;
sha1.c 220 size_t nwords = len / sizeof (sha1_uint32); local
221 const sha1_uint32 *endp = words + nwords;
  /external/libvncserver/common/
md5.c 304 size_t nwords = len / sizeof (md5_uint32); local
305 const md5_uint32 *endp = words + nwords;
  /external/toybox/toys/pending/
traceroute.c 91 int nwords = len >> 1; local
93 while (nwords-- != 0) sum += *p++;
  /toolchain/binutils/binutils-2.27/libiberty/
md5.c 285 size_t nwords = len / sizeof (md5_uint32); local
286 const md5_uint32 *endp = words + nwords;
sha1.c 290 size_t nwords = len / sizeof (sha1_uint32); local
291 const sha1_uint32 *endp = words + nwords;
  /prebuilts/go/darwin-x86/src/math/big/
nat_test.go 647 func benchmarkNatSqr(b *testing.B, nwords int) {
648 x := rndNat(nwords)
  /prebuilts/go/linux-x86/src/math/big/
nat_test.go 647 func benchmarkNatSqr(b *testing.B, nwords int) {
648 x := rndNat(nwords)

Completed in 591 milliseconds

1 2 3