HomeSort by relevance Sort by last modified time
    Searched refs:accumulator (Results 101 - 125 of 200) sorted by null

1 2 3 45 6 7 8

  /frameworks/compile/libbcc/lib/
RSKernelExpand.cpp 72 * In the case of a general reduction kernel, the kernel's accumulator
74 * original accumulator function name "<ACCUMFN>" followed by
76 * for the function generated from the accumulator should not
77 * introduce any possibility for name clashes today: The accumulator
81 * any reduction kernels that share the accumulator <ACCUMFN> can
359 // Create skeleton of a general reduce kernel's expanded accumulator.
553 // ForEach-able function or a general reduction accumulator
621 // ForEach-able function or an expanded general reduction accumulator
705 // or an expanded general reduction accumulator function. Also, for the call to the
1419 llvm::Function *accumulator = Module.getFunction(ExportReduceList[i].mAccumulatorName); local
    [all...]
  /external/ImageMagick/MagickCore/
feature.c 1860 *accumulator; local
    [all...]
  /external/lz4/lib/
lz4.c 643 size_t accumulator = lastRun - RUN_MASK; local
645 for(; accumulator >= 255 ; accumulator-=255) *op++ = 255;
646 *op++ = (BYTE) accumulator;
860 size_t accumulator = lastRunSize - RUN_MASK; local
862 for(; accumulator >= 255 ; accumulator-=255) *op++ = 255;
863 *op++ = (BYTE) accumulator;
    [all...]
  /libcore/ojluni/src/main/java/java/util/stream/
DoublePipeline.java 471 ObjDoubleConsumer<R> accumulator,
477 return evaluate(ReduceOps.makeDouble(supplier, accumulator, operator));
LongPipeline.java 449 ObjLongConsumer<R> accumulator,
455 return evaluate(ReduceOps.makeLong(supplier, accumulator, operator));
IntStream.java 326 * result = accumulator.applyAsInt(result, element)
332 * <p>The {@code identity} value must be an identity for the accumulator
334 * {@code accumulator.apply(identity, x)} is equal to {@code x}.
335 * The {@code accumulator} function must be an
387 * result = accumulator.applyAsInt(result, element);
394 * <p>The {@code accumulator} function must be an
419 * accumulator.accept(result, element);
433 * @param accumulator an <a href="package-summary.html#Associativity">associative</a>,
441 * compatible with the accumulator function
446 ObjIntConsumer<R> accumulator,
    [all...]
LongStream.java 330 * result = accumulator.applyAsLong(result, element)
336 * <p>The {@code identity} value must be an identity for the accumulator
338 * {@code accumulator.apply(identity, x)} is equal to {@code x}.
339 * The {@code accumulator} function must be an
391 * result = accumulator.applyAsLong(result, element);
398 * <p>The {@code accumulator} function must be an
423 * accumulator.accept(result, element);
437 * @param accumulator an <a href="package-summary.html#Associativity">associative</a>,
445 * compatible with the accumulator function
450 ObjLongConsumer<R> accumulator,
    [all...]
IntPipeline.java 467 ObjIntConsumer<R> accumulator,
473 return evaluate(ReduceOps.makeInt(supplier, accumulator, operator));
  /external/ImageMagick/www/api/
feature.php 141 <p>Use HoughLineImage() in conjunction with any binary edge extracted image (we recommand Canny) to identify lines in the image. The algorithm accumulates counts for every white pixel for every possible orientation (for angles from 0 to 179 in 1 degree increments) and distance from the center of the image to the corner (in 1 px increments) and stores the counts in an accumulator matrix of angle vs distance. The size of the accumulator is 180x(diagonal/2). Next it searches this space for peaks in counts and converts the locations of the peaks to slope and intercept in the normal x,y input image space. Use the slope/intercepts to find the endpoints clipped to the bounds of the image. The lines are then drawn. The counts are a measure of the length of the lines</p>
  /external/libvpx/config/x86/
vp9_rtcd.h 92 void vp9_temporal_filter_apply_c(const uint8_t *frame1, unsigned int stride, const uint8_t *frame2, unsigned int block_width, unsigned int block_height, int strength, int filter_weight, uint32_t *accumulator, uint16_t *count);
  /external/libvpx/config/x86_64/
vp9_rtcd.h 94 void vp9_temporal_filter_apply_c(const uint8_t *frame1, unsigned int stride, const uint8_t *frame2, unsigned int block_width, unsigned int block_height, int strength, int filter_weight, uint32_t *accumulator, uint16_t *count);
  /external/v8/src/
elements.h 111 KeyAccumulator* accumulator,
objects.cc     [all...]
elements.cc     [all...]
string-builder.h 392 INLINE(Handle<String> accumulator()) { return accumulator_; } function in class:v8::internal::ReplacementStringBuilder::IncrementalStringBuilder
404 // Add the current part to the accumulator.
d8.cc 1074 Local<String> accumulator = local
    [all...]
  /libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/
GroupByOpTest.java 69 collector.accumulator().accept(m, i);
  /external/v8/src/compiler/
bytecode-graph-builder.cc 136 // [receiver] [parameters] [registers] [accumulator]
139 // parameters supplied to the method (arg0..argN-1). The accumulator
155 // Accumulator
443 // parameter and the accumulator is live and holds that parameter's value.
448 // re-use previous accumulator state values.
2161 Node* accumulator = environment()->LookupAccumulator(); local
2190 Node* accumulator = environment()->LookupAccumulator(); local
2197 Node* accumulator = environment()->LookupAccumulator(); local
2204 Node* accumulator = environment()->LookupAccumulator(); local
2211 Node* accumulator = environment()->LookupAccumulator(); local
    [all...]
  /art/compiler/optimizing/
nodes_vector.h 786 // Multiplies every component in the two vectors, adds the result vector to the accumulator vector.
793 HInstruction* accumulator,
807 DCHECK(HasConsistentPackedTypes(accumulator, packed_type));
810 SetRawInputAt(kInputAccumulatorIndex, accumulator);
  /external/brotli/java/org/brotli/dec/
Decode.java 120 int val = (int) (br.accumulator >>> br.bitOffset);
186 int p = (int) ((br.accumulator >>> br.bitOffset)) & 31;
284 int p = (int) (br.accumulator >>> br.bitOffset) & 15;
  /external/libvorbis/lib/
res0.c 611 long *accumulator=NULL; local
614 accumulator=look->training_data[s][partword[j][i]];
628 statebook,accumulator);
  /external/v8/src/runtime/
runtime-array.cc 222 KeyAccumulator accumulator(isolate, KeyCollectionMode::kOwnOnly,
234 accumulator.CollectOwnElementIndices(array, current);
238 accumulator.GetKeys(GetKeysConversion::kKeepNumbers);
  /external/skia/src/core/
SkMatrix44.cpp 474 SkMScalar accumulator = 0; local
477 accumulator *= matrix.get(row, col);
480 return accumulator == 0;
  /external/libvpx/libvpx/vp8/common/x86/
mfqe_sse2.asm 185 ; Prep accumulator registers
  /external/libvpx/libvpx/vp9/common/x86/
vp9_mfqe_sse2.asm 186 ; Prep accumulator registers

Completed in 3023 milliseconds

1 2 3 45 6 7 8