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

  /external/llvm/test/MC/ARM/
directive-arch-armv4.s 31 @ Check that multiplication is supported
  /external/chromium_org/third_party/webrtc/common_audio/signal_processing/
filter_ar_fast_q12_armv7.S 29 @ r5: data_out[j] as multiplication inputs
31 @ r7: Partial sum of a filtering multiplication results
32 @ r8: Partial sum of a filtering multiplication results
  /external/chromium_org/v8/test/mjsunit/
unary-minus-deopt.js 31 // After deopting, the multiplication for unary minus stayed in Smi
  /external/libhevc/common/arm/
ihevc_weighted_pred_bi.s 154 vmov.s16 d7[0],r6 @moved for scalar multiplication
158 vmov.s16 d7[1],r8 @moved for scalar multiplication
ihevc_weighted_pred_uni.s 139 vmov.s16 d0[0],r4 @moved for scalar multiplication
  /external/chromium_org/v8/test/webkit/
math-transforms.js 26 "This test checks for potential edge case bugs with certain math transforms involving multiplication by 1 and unary plus."
  /external/libvpx/libvpx/vp8/common/arm/neon/
shortidct4x4llm_neon.asm 37 ; result of the multiplication that is needed in IDCT.
sixtappredict16x16_neon.asm 37 ; filter coeffs to make them u8. Then, use vmlsl for negtive coeffs. After multiplication,
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/common/arm/neon/
shortidct4x4llm_neon.asm 37 ; result of the multiplication that is needed in IDCT.
sixtappredict16x16_neon.asm 37 ; filter coeffs to make them u8. Then, use vmlsl for negtive coeffs. After multiplication,
  /external/chromium_org/third_party/boringssl/src/crypto/aes/asm/
bsaes-armv7.pl 447 @ multiplication by 0x0e
476 @ multiplication by 0x0b
517 @ multiplication by 0x0d
560 @ multiplication by 0x09
607 @ multiplication by 0x05-0x00-0x04-0x00
    [all...]
  /external/openssl/crypto/aes/asm/
bsaes-armv7.pl 447 @ multiplication by 0x0e
476 @ multiplication by 0x0b
517 @ multiplication by 0x0d
560 @ multiplication by 0x09
607 @ multiplication by 0x05-0x00-0x04-0x00
    [all...]
  /external/chromium_org/v8/src/
math.js 152 // Division by 0x100000000 through multiplication by reciprocal.
  /external/chromium_org/v8/test/webkit/fast/js/kde/
operators.js 252 // multiplication
  /external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/
math_semantic_attr.js 515 * Invisible operator for multiplication.
    [all...]
math_semantic_tree.js 589 // For now we assume this is a multiplication using invisible times.
842 return op.role == cvox.SemanticAttr.Role.MULTIPLICATION ?
    [all...]
  /external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/neon/
omxSP_FFTFwd_RToCCS_S16_Sfs_s.S 408 @ chk the code below for multiplication by j factor
  /external/libvorbis/doc/
01-introduction.tex 458 multiplication of the vectors is sufficient for acceptable spectral
473 multiplication. This range may be achieved using large (64 bit or
04-codec.tex 546 multiplication of the vectors is sufficient for acceptable spectral
561 multiplication. This range may be achieved using large (64 bit or
  /external/chromium_org/v8/third_party/fdlibm/
fdlibm.js 585 // (A). To save one multiplication, we scale the coefficient Qi
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/pydoc_data/
topics.py 9 'binary': '\nBinary arithmetic operations\n****************************\n\nThe binary arithmetic operations have the conventional priority\nlevels. Note that some of these operations also apply to certain non-\nnumeric types. Apart from the power operator, there are only two\nlevels, one for multiplicative operators and one for additive\noperators:\n\n m_expr ::= u_expr | m_expr "*" u_expr | m_expr "//" u_expr | m_expr "/" u_expr\n | m_expr "%" u_expr\n a_expr ::= m_expr | a_expr "+" m_expr | a_expr "-" m_expr\n\nThe ``*`` (multiplication) operator yields the product of its\narguments. The arguments must either both be numbers, or one argument\nmust be an integer (plain or long) and the other must be a sequence.\nIn the former case, the numbers are converted to a common type and\nthen multiplied together. In the latter case, sequence repetition is\nperformed; a negative repetition factor yields an empty sequence.\n\nThe ``/`` (division) and ``//`` (floor division) operators yield the\nquotient of their arguments. The numeric arguments are first\nconverted to a common type. Plain or long integer division yields an\ninteger of the same type; the result is that of mathematical division\nwith the \'floor\' function applied to the result. Division by zero\nraises the ``ZeroDivisionError`` exception.\n\nThe ``%`` (modulo) operator yields the remainder from the division of\nthe first argument by the second. The numeric arguments are first\nconverted to a common type. A zero right argument raises the\n``ZeroDivisionError`` exception. The arguments may be floating point\nnumbers, e.g., ``3.14%0.7`` equals ``0.34`` (since ``3.14`` equals\n``4*0.7 + 0.34``.) The modulo operator always yields a result with\nthe same sign as its second operand (or zero); the absolute value of\nthe result is strictly smaller than the absolute value of the second\noperand [2].\n\nThe integer division and modulo operators are connected by the\nfollowing identity: ``x == (x/y)*y + (x%y)``. Integer division and\nmodulo are also connected with the built-in function ``divmod()``:\n``divmod(x, y) == (x/y, x%y)``. These identities don\'t hold for\nfloating point numbers; there similar identities hold approximately\nwhere ``x/y`` is replaced by ``floor(x/y)`` or ``floor(x/y) - 1`` [3].\n\nIn addition to performing the modulo operation on numbers, the ``%``\noperator is also overloaded by string and unicode objects to perform\nstring formatting (also known as interpolation). The syntax for string\nformatting is described in the Python Library Reference, section\n*String Formatting Operations*.\n\nDeprecated since version 2.3: The floor division operator, the modulo\noperator, and the ``divmod()`` function are no longer defined for\ncomplex numbers. Instead, convert to a floating point number using\nthe ``abs()`` function if appropriate.\n\nThe ``+`` (addition) operator yields the sum of its arguments. The\narguments must either both be numbers or both sequences of the same\ntype. In the former case, the numbers are converted to a common type\nand then added together. In the latter case, the sequences are\nconcatenated.\n\nThe ``-`` (subtraction) operator yields the difference of its\narguments. The numeric arguments are first converted to a common\ntype.\n',
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/pydoc_data/
topics.py 9 'binary': '\nBinary arithmetic operations\n****************************\n\nThe binary arithmetic operations have the conventional priority\nlevels. Note that some of these operations also apply to certain non-\nnumeric types. Apart from the power operator, there are only two\nlevels, one for multiplicative operators and one for additive\noperators:\n\n m_expr ::= u_expr | m_expr "*" u_expr | m_expr "//" u_expr | m_expr "/" u_expr\n | m_expr "%" u_expr\n a_expr ::= m_expr | a_expr "+" m_expr | a_expr "-" m_expr\n\nThe ``*`` (multiplication) operator yields the product of its\narguments. The arguments must either both be numbers, or one argument\nmust be an integer (plain or long) and the other must be a sequence.\nIn the former case, the numbers are converted to a common type and\nthen multiplied together. In the latter case, sequence repetition is\nperformed; a negative repetition factor yields an empty sequence.\n\nThe ``/`` (division) and ``//`` (floor division) operators yield the\nquotient of their arguments. The numeric arguments are first\nconverted to a common type. Plain or long integer division yields an\ninteger of the same type; the result is that of mathematical division\nwith the \'floor\' function applied to the result. Division by zero\nraises the ``ZeroDivisionError`` exception.\n\nThe ``%`` (modulo) operator yields the remainder from the division of\nthe first argument by the second. The numeric arguments are first\nconverted to a common type. A zero right argument raises the\n``ZeroDivisionError`` exception. The arguments may be floating point\nnumbers, e.g., ``3.14%0.7`` equals ``0.34`` (since ``3.14`` equals\n``4*0.7 + 0.34``.) The modulo operator always yields a result with\nthe same sign as its second operand (or zero); the absolute value of\nthe result is strictly smaller than the absolute value of the second\noperand [2].\n\nThe integer division and modulo operators are connected by the\nfollowing identity: ``x == (x/y)*y + (x%y)``. Integer division and\nmodulo are also connected with the built-in function ``divmod()``:\n``divmod(x, y) == (x/y, x%y)``. These identities don\'t hold for\nfloating point numbers; there similar identities hold approximately\nwhere ``x/y`` is replaced by ``floor(x/y)`` or ``floor(x/y) - 1`` [3].\n\nIn addition to performing the modulo operation on numbers, the ``%``\noperator is also overloaded by string and unicode objects to perform\nstring formatting (also known as interpolation). The syntax for string\nformatting is described in the Python Library Reference, section\n*String Formatting Operations*.\n\nDeprecated since version 2.3: The floor division operator, the modulo\noperator, and the ``divmod()`` function are no longer defined for\ncomplex numbers. Instead, convert to a floating point number using\nthe ``abs()`` function if appropriate.\n\nThe ``+`` (addition) operator yields the sum of its arguments. The\narguments must either both be numbers or both sequences of the same\ntype. In the former case, the numbers are converted to a common type\nand then added together. In the latter case, the sequences are\nconcatenated.\n\nThe ``-`` (subtraction) operator yields the difference of its\narguments. The numeric arguments are first converted to a common\ntype.\n',
    [all...]
  /external/chromium_org/chrome/third_party/chromevox/
chromeVoxChromeBackgroundScript.js     [all...]
chromeVoxChromeOptionsScript.js     [all...]
chromeVoxChromePageScript.js     [all...]

Completed in 1229 milliseconds