Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched full:significant (Results 301 - 325 of 2106) sorted by null

<<11121314151617181920>>

/prebuilts/ndk/9/platforms/android-21/arch-mips64/usr/include/arpa/
nameser_compat.h	54 #define LITTLE_ENDIAN 1234 /* least-significant byte first (vax, pc) */ 55 #define BIG_ENDIAN 4321 /* most-significant byte first (IBM, net) */
/prebuilts/ndk/9/platforms/android-21/arch-x86/usr/include/arpa/
nameser_compat.h	54 #define LITTLE_ENDIAN 1234 /* least-significant byte first (vax, pc) */ 55 #define BIG_ENDIAN 4321 /* most-significant byte first (IBM, net) */
/prebuilts/ndk/9/platforms/android-21/arch-x86_64/usr/include/arpa/
nameser_compat.h	54 #define LITTLE_ENDIAN 1234 /* least-significant byte first (vax, pc) */ 55 #define BIG_ENDIAN 4321 /* most-significant byte first (IBM, net) */
/prebuilts/ndk/9/sources/cxx-stl/llvm-libc++/libcxx/include/support/win32/
support.h	121 // Returns the number of trailing 0-bits in x, starting at the least significant 163 // Returns the number of leading 0-bits in x, starting at the most significant
/system/bt/embdrv/sbc/decoder/include/
oi_bt_spec.h	99 * the most significant 32 bits are stored with the same endian-ness as is 104 OI_UINT32 ms32bits; /**< most significant 32 bits of 128-bit UUID */
/external/v8/src/
conversions-inl.h	46 // least significant non-fractional bits in the low 32 bits of the 61 // Copy least significant 32 bits of mantissa. 198 // up if significant part is odd and down otherwise. 443 // The longest form of simplified number is: "-<significant digits>'.1eXXX\0". 545 // Copy significant digits of the integer part (if any) to the buffer. 580 // Integer part consists of 0 or is absent. Significant digits start after
/libcore/dom/src/test/java/org/w3c/domts/
DOMTestCase.java	301 * that only differs by case. Order is not significant. 319 * that only differs by case. Order is significant. 388 * that only differs by case. Order is not significant. 419 * that only differs by case. Order is significant. 509 * expected. Order is not significant. 532 * expected. Order is not significant.
/packages/apps/ExactCalculator/src/com/android/calculator2/
CalculatorResult.java	82 private int mLsdOffset; // Position of least-significant digit in result 222 * @param msd Position of most significant digit. Offset from left of string. 224 * @param leastDigPos Position of least significant digit (1 = tenths digit) 275 // Position of leftmost significant digit relative to dec. point. 337 * Return the most significant digit position in the given string or Evaluator.INVALID_MSD. 338 * Unlike Evaluator.getMsdPos, we treat a final 1 as significant.
Evaluator.java	163 private int mMsd = INVALID_MSD; // Position of most significant digit 529 * @param msd Position of most significant digit in result. Index in cache. 531 * @param lastDigit Position of least significant digit (1 = tenths digit) 576 * that if it doesn't contain enough significant digits, we can 578 * @param msdIndex Index of most significant digit in cache, or INVALID_MSD. 579 * @param lsd Position of least significant digit in finite representation, 604 // Instead stretch significant digits to include decimal point. 651 // Return the most significant digit position in the given string 672 // Return most significant digit position in the cache, if determined,     [all...]
/external/libavc/encoder/
ih264e_core_coding.c	759 * represented by 3 parameters (nnz, significant coefficient map and the 805 /* significant coefficient map */ 848 /* write significant coeff map */ 901 /* write significant coeff map */ 934 * represented by 3 parameters (nnz, significant coefficient map and th     [all...]
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
DigitList.java	46 * The maximum number of significant digits in an IEEE 754 double, that 68 * unlimited magnitude. The count value contains the number of significant 587 * If maximumDigits is lower than the number of significant digits 630 * If maximumDigits is lower than the number of significant digits 664 * If maximumDigits is lower than the number of significant digits 737 * If maximumDigits is lower than the number of significant digits 752 * If maximumDigits is lower than the number of significant digits     [all...]
CompactDecimalFormat.java	40 * By default, there are 2 significant digits. After creation, if more than three significant digits are set (with 188 setMaximumSignificantDigits(2); // default significant digits
/bionic/libm/upstream-freebsd/lib/msun/src/
math_private.h	105 /* Get the more significant 32 bit int from a double. */ 114 /* Get the less significant 32 bit int from a double. */ 141 /* Set the more significant 32 bits of a double from an int. */ 151 /* Set the less significant 32 bits of a double from an int. */ 403 * significantly relative to b. The caller must ensure that significant
/ndk/sources/android/support/src/msun/
math_private.h	105 /* Get the more significant 32 bit int from a double. */ 114 /* Get the less significant 32 bit int from a double. */ 141 /* Set the more significant 32 bits of a double from an int. */ 151 /* Set the less significant 32 bits of a double from an int. */ 403 * significantly relative to b. The caller must ensure that significant
/external/kernel-headers/original/uapi/linux/
fb.h	183 * components. Offset specifies the position of the least significant bit 190 __u32 msb_right; /* != 0 : Most significant bit is */ 252 struct fb_bitfield green; /* else only length is significant */
/external/linux-tools-perf/src/tools/perf/
design.txt	74 raw_type: 1 bit (most significant bit) 0x8000_0000_0000_0000 75 type: 7 bits (next most significant) 0x7f00_0000_0000_0000 76 event_id: 56 bits (least significant) 0x00ff_ffff_ffff_ffff
/external/nanopb-c/
pb.h	17 * stores the most-significant byte first. */ 130 * Least-significant 4 bits tell the scalar type 131 * Most-significant 4 bits specify repeated/required/packed etc.
/external/srtp/doc/
draft-irtf-cfrg-icm-00.txt	125 Crypto Forum Research Group David A. McGrew Internet Draft Cisco Systems, Inc. Expires April, 2003 October, 2002 Integer Counter Mode <draft-irtf-cfrg-icm-00.txt> Status of this Memo This document is an Internet Draft and is in full conformance with all provisions of Section 10 of RFC-2026. Internet Drafts are working documents of the Internet Engineering Task Force (IETF), its areas, and working groups. Note that other groups may also distribute working documents as Internet Drafts. Internet Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet Drafts as reference material or to cite them other than as "work in progress." The list of current Internet-Drafts can be accessed at http://www.ietf.org/ietf/1id-abstracts.txt The list of Internet-Draft Shadow Directories can be accessed at http://www.ietf.org/shadow.html. 1. Abstract This document specifies Integer Counter Mode (ICM), a mode of operation of a block cipher which defines an indexed keystream generator (which generates a keystream segment given an index). This mode is efficient, parallelizable, and has been proven secure given realistic assumptions about the block cipher. Test vectors are provided for AES. Counter Mode admits many variations. The variant specified in this document is secure and flexible, yet it enables a single implementation of a keystream generator to suffice in different application domains. McGrew [Page 1] Internet Draft Integer Counter Mode October, 2002 2. Notational Conventions The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in RFC-2119 [B97]. 3. Introduction Counter Mode is a way to define a pseudorandom keystream generator using a block cipher [CTR]. The keystream can be used for additive encryption, key derivation, or any other application requiring pseudorandom data. In ICM, the keystream is logically broken into segments. Each segment is identified with a segment index, and the segments have equal lengths. This segmentation makes ICM especially appropriate for securing packet-based protocols. 4. ICM In this section, ICM keystream generation and encryption are defined. 4.1. ICM Parameters The following parameters are used in ICM. These parameters MUST remain fixed for any given use of a key. Parameter Meaning ----------------------------------------------------------------- BLOCK_LENGTH the number of octets in the cipher block KEY_LENGTH the number of octets in the cipher key OFFSET_LENGTH the number of octets in the offset SEGMENT_INDEX_LENGTH the number of octets in the segment index BLOCK_INDEX_LENGTH the number of octets in the block index 4.2. Keystream Segments Conceptually, ICM is a keystream generator that takes a secret key and a segment index as an input and then outputs a keystream segment. The segmentation lends itself to packet encryption, as each keystream segment can be used to encrypt a distinct packet. A counter is a value containing BLOCK_LENGTH octets which is McGrew [Page 2] Internet Draft Integer Counter Mode October, 2002 incremented using an increment function based on integer addition, to produce a sequence of distinct values which are used as inputs to the block cipher. (In the context of this specification, an integer is an octet string, the most significant of which is the first.) The output blocks of the cipher are concatenated to form the keystream segment. The first octet of the segment is the first octet of the first output block, and so on. A schematic of this process is shown in Figure 1. Figure 1. The generation of a keystream segment given a segment index and a block cipher key K. Here C[i] and S[i] denote the ith counter and keystream block, respectively. segment index | v C[0] -----> C[1] -----> C[2] -----> ... | | | v v v +---+ +---+ +---+ K->| E | K->| E | K->| E | ... +---+ +---+ +---+ | | | v v v S[0] S[1] S[2] ... The ith counter C[i] of the keystream segment with segment index s is defined as C[i] = (i + s * (256^BLOCK_INDEX_LENGTH)) (+) r where r denotes the shifted Offset, which is defined as the Offset times 256^(BLOCK_LENGTH - OFFSET_LENGTH). (This multiplication left-shifts the Offset so that it is aligned with the leftmost edge of the block.) Here ^ denotes exponentiation and (+) denotes the bitwise exclusive-or operation. The number of blocks in any segment MUST NOT exceed 256^BLOCK_INDEX_LENGTH. The number of segments MUST NOT exceed 256^SEGMENT_INDEX_LENGTH. These restrictions ensure the uniqueness of each block cipher input. They also imply that each segment contains no more than (256^BLOCK_INDEX_LENGTH)*BLOCK_LENGTH octets. The sum of SEGMENT_INDEX_LENGTH and BLOCK_INDEX_LENGTH MUST NOT exceed BLOCK_LENGTH / 2. This requirement protects the ICM keystream generator from potentially failing to be pseudorandom (see McGrew [Page 3] Internet Draft Integer Counter Mode October, 2002 the rationale). Figure 2. An illustration of the structure of a counter with BLOCK_LENGTH = 8, SEGMENT_INDEX_LENGTH = 2, and BLOCK_INDEX_LENGTH = 2. The field marked `null' is not part of either the block or segment indices. 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | null | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | segment index | block index | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 4.3. ICM Encryption Unless otherwise specified, ICM encryption consists of bitwise exclusive-oring the keystream into the plaintext to produce the ciphertext. 4.4 ICM KEY An ICM key consists of the block cipher key and an Offset. The Offset is an integer with OFFSET_LENGTH octets, which is used to `randomize' the logical starting point of keystream. The Offset is crucial to providing security; see the rationale. The value of OFFSET_LENGTH SHOULD be at least half that of BLOCK_LENGTH. For the purposes of transporting an ICM key, e.g. in a signaling protocol, that key SHOULD be considered a sequence of octets in which the block cipher key precedes the Offset. 5. Implementation Considerations Implementation of the `add one modulo 2^m' operation is simple. For example, with BLOCK_LENGTH = 8 (m=64), it can be implemented in C as if (!++x) ++y; where x and y are 32-bit unsigned integers in network byte order. The implementation of general purpose addition modulo 2^m is slightly more complicated. The fact that the Offset is left-aligned enables an implementation McGrew [Page 4] Internet Draft Integer Counter Mode October, 2002 to avoid propagating carry values outside of the block index and/or the segment index. Choosing an OFFSET_LENGTH value equal to half that of BLOCK_LENGTH avoids all of these carries, since the Offset is then shifted so that it occupies the most significant octets of the block, while the block and segment indices occupy the least significant ones. 6. Parameters and Test Vectors for AES This section provides ICM parameters and test ve (…)
/external/tremolo/Tremolo/
treminfo.c	358 case 0x01: /* least significant *bit* is read first */ 370 case 0x03: /* least significant *bit* is read first */ 378 case 0x05: /* least significant *bit* is read first */
/libcore/luni/src/main/java/javax/net/ssl/
DistinguishedNameParser.java	47 // significant values of repeated attributes occur first. 349 * Parses the DN and returns the most significant attribute value 415 * the order of decreasing significance (most significant first).
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/linux/
fb.h	176 * components. Offset specifies the position of the least significant bit 183 __u32 msb_right; /* != 0 : Most significant bit is */ 245 struct fb_bitfield green; /* else only length is significant */
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/linux/
fb.h	176 * components. Offset specifies the position of the least significant bit 183 __u32 msb_right; /* != 0 : Most significant bit is */ 245 struct fb_bitfield green; /* else only length is significant */
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
test_strtod.py	108 # exact halfway cases with a small number of significant digits 119 # with small number of significant digits. 128 # until n * 2**p2 has more than 20 significant digits.
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
test_strtod.py	108 # exact halfway cases with a small number of significant digits 119 # with small number of significant digits. 128 # until n * 2**p2 has more than 20 significant digits.
/frameworks/av/media/libstagefright/codecs/amrnb/common/include/
basic_op_arm_gcc_v5.h	316 L_var1_hi = most significant word of first input (Word16). 317 L_var1_lo = least significant word of first input (Word16). 318 L_var2_hi = most significant word of second input (Word16). 319 L_var2_lo = least significant word of second input (Word16). 401 L_var1_hi = most significant 16 bits of 32-bit input (Word16). 402 L_var1_lo = least significant 16 bits of 32-bit input (Word16).

Completed in 194 milliseconds

<<11121314151617181920>>