HomeSort by relevance Sort by last modified time
    Searched full:offsets (Results 201 - 225 of 3672) sorted by null

1 2 3 4 5 6 7 891011>>

  /external/mp4parser/isoparser/src/main/java/com/coremedia/iso/boxes/
FreeSpaceBox.java 25 * presentation. Care should be excercized when deleting the object, as this may invalidate the offsets used in the
  /external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/cff/
cfftypes.h 51 /* off_size :: The size in bytes of object offsets in index. */
58 /* offsets :: A table of element offsets in the index. Must be */
72 FT_ULong* offsets; member in struct:CFF_IndexRec_
  /external/proguard/src/proguard/evaluation/value/
InstructionOffsetValue.java 27 * contain 0 or more specific instruction offsets.
70 * offsets.
90 * Returns the minimum value from this list of instruction offsets.
115 * Returns the maximum value from this list of instruction offsets.
  /external/proguard/src/proguard/optimize/peephole/
ReachableCodeMarker.java 33 * This AttributeVisitor finds all instruction offsets, branch targets, and
61 * Returns whether any of the instructions at the given offsets are
170 // Mark the branch targets of the jump offsets.
199 * Marks the branch targets of the given jump offsets for the instruction
  /external/qemu/distrib/sdl-1.2.15/src/video/fbcon/
riva_regs.h 29 /* mapped_io register offsets */
  /external/sfntly/cpp/src/sfntly/
font_factory.h 94 // Offsets to specific elements in the underlying data. These offsets are
99 // Offsets within the main directory.
106 // Offsets from end of OffsetTable.
  /hardware/intel/common/libmix/videoencoder/
VideoEncoderUtils.cpp 618 LOG_V("offsets[0] = %d\n", destImage.offsets[0]);
619 LOG_V("offsets[1] = %d\n", destImage.offsets[1]);
634 dstY = pDestBuffer + destImage.offsets[0];
636 dstUV = pDestBuffer + destImage.offsets[1];
712 extbuf.offsets[0] = 0;
713 extbuf.offsets[1] = vinfo.lumaStride * vinfo.height;
714 extbuf.offsets[2] = extbuf.offsets[1]
    [all...]
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/common/
entropymv.h 31 /* probability offsets for coding each MV component */
  /ndk/tests/device/test-stlport_shared-exception/jni/
eh990323-2.cpp 2 // check MI and VBC offsets on throw
eh990323-4.cpp 2 // check MI and VBC offsets on throw
  /ndk/tests/device/test-stlport_static-exception/jni/
eh990323-2.cpp 2 // check MI and VBC offsets on throw
eh990323-4.cpp 2 // check MI and VBC offsets on throw
  /external/chromium_org/components/query_parser/
snippet.cc 170 std::vector<std::string> offsets;
171 base::SplitString(offsets_str, ' ', &offsets);
172 // SQLite offsets are sets of four integers:
175 for (size_t i = 0; i < offsets.size() - 3; i += 4) {
176 if (offsets[i] != column_num)
178 const size_t start = atoi(offsets[i + 2].c_str());
179 const size_t end = start + atoi(offsets[i + 3].c_str());
  /external/chromium_org/third_party/WebKit/Source/devtools/front_end/components/
TimelineGrid.js 53 * @return {!{offsets: !Array.<number>, precision: number}}
89 var offsets = [];
94 offsets.push(firstDividerTime + gridSliceTime * i);
97 return {offsets: offsets, precision: Math.max(0, -Math.floor(Math.log(gridSliceTime * 1.01) / Math.LN10))};
117 dividerOffsets = dividersData.offsets;
186 dividerOffsets = dividersData.offsets;
  /external/chromium_org/third_party/icu/source/common/
unisetspan.cpp 27 * List of offsets from the current position from where to try matching
29 * Store offsets rather than indexes to simplify the code and use the same list
32 * Assumption: The maximum offset is limited, and the offsets that are stored
38 * This avoids inserting into a sorted list of offsets (or absolute indexes) and
50 * the integer would simply be shifted when lower offsets are removed.
86 // Reduce all stored offsets by delta, used when the current position
88 // There must not be any offsets lower than delta.
124 // and reduce all other offsets by this minimum.
640 OffsetList offsets; local
643 offsets.setMaxLength(maxLength16)
801 OffsetList offsets; local
962 OffsetList offsets; local
1143 OffsetList offsets; local
    [all...]
ucnvhz.c 13 * 10/31/2000 Ram Implemented offsets logic function
42 if(args->offsets!=NULL){ \
43 *(offsets++) = sourceIndex-1; \
186 if(args->offsets) {
187 args->offsets[myTarget - args->target]=(int32_t)(mySource - args->source - 2);
297 if(args->offsets) {
298 args->offsets[myTarget - args->target]=(int32_t)(mySource - args->source - 1-(myData->isStateDBCS));
338 int32_t* offsets = args->offsets; local
413 if(offsets){
    [all...]
  /external/deqp/modules/gles3/stress/
es3sVertexArrayTests.cpp 280 int offsets[] = {1, 17}; local
283 for (int offsetNdx = 0; offsetNdx < DE_LENGTH_OF_ARRAY(offsets); offsetNdx++)
295 const bool aligned = ((stride % alignment) == 0) && ((offsets[offsetNdx] % alignment) == 0);
296 std::string name = "first" + typeToString(firsts[firstNdx]) + "_offset" + typeToString(offsets[offsetNdx]) + "_stride" + typeToString(stride) + "_quads" + typeToString(counts[countNdx]);
303 offsets[offsetNdx],
383 int offsets[] = {1, 4, 17, 32}; local
386 for (int offsetNdx = 0; offsetNdx < DE_LENGTH_OF_ARRAY(offsets); offsetNdx++)
396 const bool aligned = ((stride % alignment) == 0) && ((offsets[offsetNdx] % alignment) == 0);
397 const std::string name = "offset" + typeToString(offsets[offsetNdx]) + "_stride" + typeToString(strides[strideNdx]) + "_quads" + typeToString(counts[countNdx]);
404 offsets[offsetNdx]
    [all...]
  /external/icu/icu4c/source/common/
unisetspan.cpp 29 * List of offsets from the current position from where to try matching
31 * Store offsets rather than indexes to simplify the code and use the same list
34 * Assumption: The maximum offset is limited, and the offsets that are stored
40 * This avoids inserting into a sorted list of offsets (or absolute indexes) and
52 * the integer would simply be shifted when lower offsets are removed.
88 // Reduce all stored offsets by delta, used when the current position
90 // There must not be any offsets lower than delta.
126 // and reduce all other offsets by this minimum.
642 OffsetList offsets; local
645 offsets.setMaxLength(maxLength16)
803 OffsetList offsets; local
964 OffsetList offsets; local
1145 OffsetList offsets; local
    [all...]
propname.h 85 // Byte offsets from the start of the data, after the generic header.
136 * The first 6 indexes are byte offsets from the beginning of the data
140 * All offsets are filled in: Where there is no data between two offsets,
141 * those two offsets are the same.
  /development/ndk/platforms/android-18/samples/gles3jni/jni/
gles3jni.cpp 138 float* offsets = mapOffsetBuf(); local
139 calcSceneParams(w, h, offsets);
153 float* offsets) {
183 offsets[2*idx + major] = centers[0][i];
184 offsets[2*idx + minor] = centers[1][j];
  /external/deqp/modules/gles31/functional/
es31fTextureBufferTests.cpp 137 const size_t offsets[] = local
201 for (int offsetNdx = 0; offsetNdx < DE_LENGTH_OF_ARRAY(offsets); offsetNdx++)
203 const size_t offset = offsets[offsetNdx];
242 for (int offsetNdx = 0; offsetNdx < DE_LENGTH_OF_ARRAY(offsets); offsetNdx++)
244 const size_t offset = offsets[offsetNdx];
  /external/icu/icu4c/source/i18n/
collationdatareader.h 54 // Byte offsets from the start of the data, after the generic header.
139 * Indexes 5..19 are byte offsets in ascending order.
142 * When two consecutive byte offsets are the same (or too short),
144 * Byte offsets are offsets from after the header,
  /external/kernel-headers/original/uapi/linux/
binder.h 52 * between processes. The 'offsets' supplied as part of a binder transaction
53 * contains offsets into the data where these structures occur. The Binder
145 binder_size_t offsets_size; /* number of bytes of offsets */
155 /* offsets from buffer to flat_binder_object structs */
156 binder_uintptr_t offsets; member in struct:binder_transaction_data::__anon26699::__anon26700
  /external/chromium_org/net/tools/tld_cleanup/
make_dafsa.py 78 <offsets> ::= <end_offset>
79 | <offset> <offsets>
81 <source> ::= <offsets>
83 <node> ::= <label> <offsets>
102 The first offset in a list of offsets is the distance in bytes between the
103 offset itself and the first child node. Subsequent offsets are the distance
338 def encode_links(children, offsets, current):
339 """Encodes a list of children as one, two or three byte offsets."""
346 children = sorted(children, key = lambda x: -offsets[id(x)])
352 distance = offset - offsets[id(child)
    [all...]
  /external/chromium_org/third_party/sqlite/src/test/
fts3near.test 91 # Output format of the offsets() function:
100 SELECT offsets(t1) FROM t1 WHERE content MATCH 'A NEAR/0 B'
105 SELECT offsets(t1) FROM t1 WHERE content MATCH 'B NEAR/0 A'
110 SELECT offsets(t1) FROM t1 WHERE content MATCH '"C D" NEAR/0 A'
115 SELECT offsets(t1) FROM t1 WHERE content MATCH 'A NEAR/0 "C D"'
120 SELECT offsets(t1) FROM t1 WHERE content MATCH 'A NEAR A'
126 SELECT offsets(t1) FROM t1 WHERE content MATCH 'A NEAR/2 A';
133 SELECT offsets(t1) FROM t1 WHERE content MATCH 'A NEAR A NEAR A';
149 execsql {SELECT offsets(t1) FROM t1 WHERE content MATCH 'three NEAR/1 one'}
152 execsql {SELECT offsets(t1) FROM t1 WHERE content MATCH 'one NEAR/1 three'
    [all...]

Completed in 796 milliseconds

1 2 3 4 5 6 7 891011>>