HomeSort by relevance Sort by last modified time
    Searched full:vectors (Results 301 - 325 of 1580) sorted by null

<<11121314151617181920>>

  /external/jmonkeyengine/engine/src/core/com/jme3/scene/shape/
AbstractBox.java 67 * Gets the array or vectors representing the 8 vertices of the box.
69 * @return a newly created array of vertex vectors.
  /external/libvpx/libvpx/vp9/common/arm/neon/
vp9_short_iht4x4_add_neon.asm 102 ; generate constant vectors
121 ; generate constant vectors
  /external/llvm/lib/Support/
regex2.h 95 * done as bit vectors, grouped 8 to a byte vector for compactness.
103 * vectors at run time.
  /external/mesa3d/src/gallium/auxiliary/gallivm/
lp_bld_type.h 68 * Several functions can only cope with vectors of length up to this value.
69 * You may need to increase that value if you want to represent bigger vectors.
lp_bld_sample_aos.c 443 * Return filtered color as two vectors of 16-bit fixed point values.
511 * Return filtered color as two vectors of 16-bit fixed point values.
638 * Return filtered color as two vectors of 16-bit fixed point values.
699 * vectors manually for better generated code.
723 * Return filtered color as two vectors of 16-bit fixed point values.
    [all...]
  /external/mesa3d/src/mesa/drivers/dri/radeon/
radeon_state_init.c 170 h.vectors.cmd_type = RADEON_CMD_VECTORS;
171 h.vectors.offset = offset;
172 h.vectors.stride = stride;
173 h.vectors.count = count;
246 OUT_BATCH(h.vectors.offset | (h.vectors.stride << RADEON_VEC_INDX_OCTWORD_STRIDE_SHIFT)); \
247 OUT_BATCH(CP_PACKET0_ONE(R200_SE_TCL_VECTOR_DATA_REG, h.vectors.count - 1)); \
248 OUT_BATCH_TABLE((data), h.vectors.count); \
    [all...]
  /external/neven/Embedded/common/src/b_TensorEm/
Int16Vec2D.h 85 /** dot product of vectors */
104 /** computes angle between two vectors */
  /external/webrtc/src/modules/audio_coding/codecs/isac/fix/source/
structs.h 89 //state vectors for each of the two analysis filters
104 //state vectors for each of the two analysis filters
  /frameworks/av/media/libstagefright/codecs/m4v_h263/dec/src/
mp4lib_int.h 71 int fcodeForward; /* VOP dynamic range of motion vectors */
72 int fcodeBackward; /* VOP dynamic range of motion vectors */
  /frameworks/ml/bordeaux/learning/multiclass_pa/native/
multiclass_pa.cpp 126 // Modify the parameter vectors of the correct and wrong classes
159 // Modify the parameter vectors of the correct and wrong classes
  /ndk/sources/host-tools/ndk-stack/regex/
regex2.h 95 * done as bit vectors, grouped 8 to a byte vector for compactness.
103 * vectors at run time.
  /external/llvm/lib/CodeGen/
BasicTargetTransformInfo.cpp 32 /// are set if the result needs to be inserted and/or extracted from vectors.
193 assert (Ty->isVectorTy() && "Can only scalarize vectors");
333 // If we are converting vectors and the operation is illegal, or
334 // if the vectors are legalized to different types, estimate the
346 // is where we handle bitcast between vectors and scalars. We need to assume
367 // Selects on vectors are actually vector selects.
  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/gallivm/
lp_bld_sample_aos.c 443 * Return filtered color as two vectors of 16-bit fixed point values.
511 * Return filtered color as two vectors of 16-bit fixed point values.
638 * Return filtered color as two vectors of 16-bit fixed point values.
699 * vectors manually for better generated code.
723 * Return filtered color as two vectors of 16-bit fixed point values.
    [all...]
  /external/antlr/antlr-3.4/runtime/C/include/
antlr3collections.h 281 /** Structure that tracks vectors in a vector and auto deletes the vectors
305 * by another caller. The available vectors are stored here. Note that
306 * the only vectors avaible in the free chain are produced by this factory, so they
409 * A vector of vectors of edges, built by calling the addEdge method()
  /external/llvm/lib/Target/X86/
X86TargetTransformInfo.cpp 40 /// are set if the result needs to be inserted and/or extracted from vectors.
305 // A v4i64 multiply is custom lowered as two split v2i64 vectors that then
321 // Custom lowering of vectors.
545 assert (Ty->isVectorTy() && "Can only scalarize vectors");
560 // Handle non power of two vectors such as <3 x float>
  /external/libvpx/libvpx/vp8/common/mips/dspr2/
loopfilter_filters_dspr2.c 159 /* inputs & outputs are quad-byte vectors */
381 /* load quad-byte vectors
426 /* load quad-byte vectors
471 /* load quad-byte vectors
516 /* load quad-byte vectors
588 /* load quad-byte vectors
633 /* load quad-byte vectors
715 /* load quad-byte vectors
868 /* load quad-byte vectors
    [all...]
  /external/ceres-solver/include/ceres/
types.h 357 // to stderr. The Jacobian is printed as a dense matrix. The vectors
358 // D, x and f are printed as dense vectors. This should only be used
365 // text file containing (i,j,s) triplets, the vectors D, x and f are
  /external/chromium_org/third_party/icu/source/common/unicode/
utrace.h 245 * Vectors
253 * Length==-1 means zero or NUL termination. Works for vectors of all types.
258 * parameter (required for all vectors) is the number of
  /external/chromium_org/third_party/mesa/src/src/glsl/
opt_constant_propagation.cpp 250 * = ...;). Since we only try to constant propagate vectors and
395 /* We don't track non-vectors. */
446 /* Only do constant propagation on vectors. Constant matrices,
  /external/icu4c/common/unicode/
utrace.h 246 * Vectors
254 * Length==-1 means zero or NUL termination. Works for vectors of all types.
259 * parameter (required for all vectors) is the number of
  /external/libvorbis/doc/
03-codebook.tex 162 values that are permuted in a set pattern to build a list of vectors,
165 vector explicitly, rather than building vectors from a smaller list of
283 Unpacking the VQ lookup table vectors relies on the following values:
  /external/mesa3d/src/glsl/
opt_constant_propagation.cpp 250 * = ...;). Since we only try to constant propagate vectors and
395 /* We don't track non-vectors. */
446 /* Only do constant propagation on vectors. Constant matrices,
  /external/srtp/doc/
draft-irtf-cfrg-icm-00.txt 46 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 vectors for AES with a 128 bit block size and 128 bit key (that is, with a BLOCK_LENGTH and KEY_LENGTH (…)
  /external/valgrind/main/exp-bbv/docs/
bbv-manual.xml 23 BBV is a tool that generates basic block vectors for use with the
56 <title>Using Basic Block Vectors to create SimPoints</title>
263 BBV vectors will be different than those generated by other tools.
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p2/src/
omxVCM4P2_MotionEstimationMB.c 227 * - pMV0[2][2] - estimated motion vectors; represented
243 * - pMV0[2][2] - estimated motion vectors; represented in
245 * - pMVPred[2][2] - predicted motion vectors; represented

Completed in 1617 milliseconds

<<11121314151617181920>>