/external/wpa_supplicant_8/wpa_supplicant/src/eap_peer/ |
H A D | eap_pwd.c | 168 BN_clear_free(data->grp->order); 373 order_len = BN_num_bytes(data->grp->order); 398 if (BN_rand_range(data->private_value, data->grp->order) != 1 || 399 BN_rand_range(mask, data->grp->order) != 1 || 401 BN_mod(data->my_scalar, data->my_scalar, data->grp->order, 446 BN_bin2bn(ptr, BN_num_bytes(data->grp->order), data->server_scalar); 460 "server element by order!\n"); 487 "shared key point by order"); 519 if (((scalar = os_malloc(BN_num_bytes(data->grp->order))) == NULL) || 528 * sufficiently smaller than the prime or order migh [all...] |
/external/wpa_supplicant_8/wpa_supplicant/src/eap_server/ |
H A D | eap_server_pwd.c | 154 BN_clear_free(data->grp->order); 222 if (BN_rand_range(data->private_value, data->grp->order) != 1 || 223 BN_rand_range(mask, data->grp->order) != 1 || 225 BN_mod(data->my_scalar, data->my_scalar, data->grp->order, 262 if (((scalar = os_malloc(BN_num_bytes(data->grp->order))) == NULL) || 271 * sufficiently smaller than the prime or order might need pre-pending 274 os_memset(scalar, 0, BN_num_bytes(data->grp->order)); 276 offset = BN_num_bytes(data->grp->order) - 286 BN_num_bytes(data->grp->order)); 293 wpabuf_put_data(data->outbuf, scalar, BN_num_bytes(data->grp->order)); [all...] |
/external/eigen/Eigen/src/OrderingMethods/ |
H A D | Eigen_Colamd.h | 147 IndexType order ; /* pivot ordering of this column, if col is dead */ member in union:internal::colamd_col::__anon5647 744 /* Put the empty columns at the end in their natural order, so that LU */ 751 /* this is a empty column, kill and order it last */ 752 Col [c].shared2.order = --n_col2 ; 760 /* Put the dense columns at the end, in their natural order */ 771 /* this is a dense column, kill and order it last */ 772 Col [c].shared2.order = --n_col2 ; 847 Col [c].shared2.order = --n_col2 ; 876 /* place in reverse order, so low column indices are at the front */ 946 IndexType n_col2, /* Remaining columns to order */ 1460 IndexType order ; /* column's order */ local [all...] |
/external/boringssl/src/crypto/evp/ |
H A D | print.c | 329 BIGNUM *order = NULL; local 400 order = BN_new(); 401 if (order == NULL || !EC_GROUP_get_order(group, order, NULL) || 402 BIO_printf(bp, "%s: (%d bit)\n", ecstr, BN_num_bits(order)) <= 0) { 424 BN_free(order);
|
/external/libexif/libexif/pentax/ |
H A D | mnote-pentax-entry.c | 344 vs = exif_get_short (entry->data, entry->order); 367 vs = exif_get_short (entry->data, entry->order); 368 vs2 = exif_get_short (entry->data+2, entry->order) << 16; 393 vl = exif_get_long (entry->data, entry->order); 411 /* Note: format is UNDEFINED, not SHORT -> order is fixed: MOTOROLA */ 430 vs = exif_get_short (data, entry->order); 442 vl = exif_get_long (data, entry->order);
|
/external/pdfium/core/fpdftext/ |
H A D | cpdf_textpagefind.cpp | 246 int order = -1, MatchedCount = 0; local 254 order = order1; 258 if (order == -1) { 262 m_resStart = m_pTextPage->TextIndexFromCharIndex(order); 263 m_resEnd = m_pTextPage->TextIndexFromCharIndex(order + MatchedCount - 1); 265 m_resArray = m_pTextPage->GetRectArray(order, MatchedCount);
|
/external/selinux/libselinux/src/ |
H A D | get_context_list.c | 318 unsigned int order; member in struct:context_order 324 if (c1->order < c2->order) 326 else if (c1->order > c2->order) 478 co[i].order = ordering[i];
|
/external/boringssl/src/crypto/ec/ |
H A D | ec.c | 105 /* order */ 134 /* order */ 167 /* order */ 211 /* order */ 294 BIGNUM *order = BN_new(); local 299 order == NULL) { 314 if (!BN_bin2bn(params + 5 * param_len, param_len, order) || 315 !BN_MONT_CTX_set(mont_ctx, order, bn_ctx)) { 331 BN_free(order); 356 BN_init(&ret->order); 384 EC_GROUP_set_generator(EC_GROUP *group, const EC_POINT *generator, const BIGNUM *order, const BIGNUM *cofactor) argument 573 EC_GROUP_get_order(const EC_GROUP *group, BIGNUM *order, BN_CTX *ctx) argument [all...] |
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/collator/ |
H A D | CollationTest.java | 97 int order; 98 while ((order = iter.next()) != CollationElementIterator.NULLORDER) { 105 orders[size++] = order; 279 // and sort in ascending order by set and then code point. 293 // Starting with CLDR 26/ICU 54, the root Han order may instead be 294 // the Unihan radical-stroke order. 295 // The tests should pass either way, so we only test the order of a small set of Han characters 296 // whose radical-stroke order is the same as their code point order. 1164 // in order t 1468 getDifferenceLevel(CollationKey prevKey, CollationKey key, int order, boolean collHasCaseLevel) argument [all...] |
/external/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/ |
H A D | CollationTest.java | 96 int order; 97 while ((order = iter.next()) != CollationElementIterator.NULLORDER) { 104 orders[size++] = order; 278 // and sort in ascending order by set and then code point. 292 // Starting with CLDR 26/ICU 54, the root Han order may instead be 293 // the Unihan radical-stroke order. 294 // The tests should pass either way, so we only test the order of a small set of Han characters 295 // whose radical-stroke order is the same as their code point order. 1163 // in order t 1467 getDifferenceLevel(CollationKey prevKey, CollationKey key, int order, boolean collHasCaseLevel) argument [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
H A D | ActionScriptTarget.java | 68 * If the int is above 0x7fff, we use a unicode literal of 0x80hh, where hh is the high-order 69 * bits followed by \xll where ll is the lower order bits of a 16-bit number. 91 buf.append(Integer.toHexString((v >> 8) | 0x100).substring(1, 3)); // high - order bits 93 buf.append(Integer.toHexString((v & 0xff) | 0x100).substring(1, 3)); // low -order bits 102 * Note that the low order bits are first, followed by the high order bits. 104 * passed in in 32-bit chunks with low-order bits coming first.
|
/external/guava/guava/src/com/google/common/hash/ |
H A D | AbstractStreamingHashFunction.java | 114 .order(ByteOrder.LITTLE_ENDIAN); 150 return putBytes(ByteBuffer.wrap(bytes, off, len).order(ByteOrder.LITTLE_ENDIAN));
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
H A D | SetTestSuiteBuilder.java | 111 public Iterable<E> order(List<E> insertionOrder) { method in class:SetTestSuiteBuilder.ReserializedSetGenerator 112 return gen.order(insertionOrder);
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
H A D | MultisetIteratorTester.java | 43 new IteratorTester<E>(4, IteratorFeature.MODIFIABLE, getSubjectGenerator().order( 70 new IteratorTester<E>(4, IteratorFeature.UNMODIFIABLE, getSubjectGenerator().order(
|
H A D | SortedMapGenerators.java | 77 public Iterable<Entry<String, Integer>> order(List<Entry<String, Integer>> insertionOrder) { method in class:SortedMapGenerators.ImmutableSortedMapEntryListGenerator 108 public List<String> order(List<String> insertionOrder) { method in class:SortedMapGenerators.ImmutableSortedMapKeyListGenerator
|
/external/guava/guava-testlib/test/com/google/common/collect/testing/ |
H A D | SafeTreeSetTest.java | 50 @Override public List<String> order(List<String> insertionOrder) { 64 @Override public List<String> order(List<String> insertionOrder) {
|
/external/icu/icu4j/ |
H A D | adjust_icudt_path.mk | 1 # In order to append $(icu4c_data) to the dataPath line in ICUConfig.properties
|
/external/jemalloc/include/jemalloc/ |
H A D | jemalloc_mangle.sh | 10 * in the same application. Define JEMALLOC_MANGLE in order to cause automatic
|
/external/libopus/silk/ |
H A D | decode_indices.c | 82 silk_assert( psDec->psNLSF_CB->order == psDec->LPC_order ); 83 for( i = 0; i < psDec->psNLSF_CB->order; i++ ) {
|
/external/libvorbis/doc/ |
H A D | 04-codec.tex | 20 packets are, in order, the identification header, the comments header, 39 is an audio packet). The packets must occur in the order of 63 \varname{[vorbis_version]} is to read '0' in order to be compatible 101 needed for decode. The setup header contains, in order, the lists of 106 proceeds in the following order: 112 \item Decode \varname{[vorbis_codebook_count]} codebooks in order as defined 114 order, in an array of 384 Floor curves are decoded one-by-one in channel order. 438 Unlike floors, which are decoded in channel order, the residue vectors 439 are decoded in submap order [all...] |
/external/mesa3d/docs/ |
H A D | MESA_window_pos.spec | 31 In order to set the current raster position to a specific window 35 rely on a subtle side-effect of the Bitmap command in order to circumvent
|
/external/opencv/cvaux/src/ |
H A D | enmin.cpp | 352 int* order = mem; 353 int* lengthArr = order + width + 2; 387 /* add vertex s to order */ 388 order[ orderCount ] = s; 393 /* getting u from order */ 394 u = order[ orderFirst ]; 422 /* adding vertex v to order */ 423 order[ orderCount ] = v; 464 /* adding vertex v to order */ 465 order[ orderCoun [all...] |
/external/skia/tests/ |
H A D | PathOpsQuadLineIntersectionThreadedTest.cpp | 88 int order = reducer.reduce(quad); local 89 if (order < 3) {
|
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue29/ |
H A D | FlexibleScalarStylesInJavaBeanTest.java | 76 * Change the default order. Important data goes first. 94 List<String> order = new ArrayList<String>(Arrays.asList("id", "name", 96 for (String name : order) {
|
/external/valgrind/drd/tests/ |
H A D | annotate_hb_err.stderr.exp | 19 order annotation 0x........ was first observed at:
|