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

  /external/chromium_org/cc/animation/
transform_operation.cc 211 int* num_candidates) {
213 *num_candidates = 4;
215 for (int i = 1; i < *num_candidates; ++i)
218 for (int i = 0; i < *num_candidates; ++i)
250 int num_candidates = kMaxNumCandidates; local
292 point.x(), point.y(), axis.z(), candidates, &num_candidates);
295 point.z(), point.x(), axis.y(), candidates, &num_candidates);
298 point.y(), point.z(), axis.x(), candidates, &num_candidates);
346 for (int i = 0; i < num_candidates; ++i) {
  /external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/
vp9_mcomp.c 489 // candidates as indicated in the num_candidates and candidates arrays
502 const int num_candidates[MAX_PATTERN_SCALES],
537 for (i = 0; i < num_candidates[t]; i++) {
546 for (i = 0; i < num_candidates[t]; i++) {
580 for (i = 0; i < num_candidates[s]; i++) {
589 for (i = 0; i < num_candidates[s]; i++) {
613 next_chkpts_indices[0] = (k == 0) ? num_candidates[s] - 1 : k - 1;
615 next_chkpts_indices[2] = (k == num_candidates[s] - 1) ? 0 : k + 1;
703 const int num_candidates[MAX_PATTERN_SCALES],
742 for (i = 0; i < num_candidates[t]; i++)
    [all...]
  /external/libvpx/libvpx/vp9/encoder/
vp9_mcomp.c 497 // candidates as indicated in the num_candidates and candidates arrays
507 const int num_candidates[MAX_PATTERN_SCALES],
546 for (i = 0; i < num_candidates[t]; i++) {
555 for (i = 0; i < num_candidates[t]; i++) {
589 for (i = 0; i < num_candidates[s]; i++) {
598 for (i = 0; i < num_candidates[s]; i++) {
622 next_chkpts_indices[0] = (k == 0) ? num_candidates[s] - 1 : k - 1;
624 next_chkpts_indices[2] = (k == num_candidates[s] - 1) ? 0 : k + 1;
    [all...]
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/encoder/
vp9_mcomp.c 497 // candidates as indicated in the num_candidates and candidates arrays
507 const int num_candidates[MAX_PATTERN_SCALES],
546 for (i = 0; i < num_candidates[t]; i++) {
555 for (i = 0; i < num_candidates[t]; i++) {
589 for (i = 0; i < num_candidates[s]; i++) {
598 for (i = 0; i < num_candidates[s]; i++) {
622 next_chkpts_indices[0] = (k == 0) ? num_candidates[s] - 1 : k - 1;
624 next_chkpts_indices[2] = (k == num_candidates[s] - 1) ? 0 : k + 1;
    [all...]

Completed in 577 milliseconds