/external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/ |
H A D | XMPNodeUtils.java | 450 * @param nextStep the xpath segment 556 * @param segment the segment containing the array index 561 private static int findIndexedItem(XMPNode arrayNode, String segment, boolean createNodes) argument 568 segment = segment.substring(1, segment.length() - 1); 569 index = Integer.parseInt(segment);
|
/external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/xpath/ |
H A D | XMPPath.java | 17 * Representates an XMP XMPPath with segment accessor methods. 51 * Append a path segment 53 * @param segment the segment to add 55 public void add(XMPPathSegment segment) argument 57 segments.add(segment); 62 * @param index the index of the segment to return 63 * @return Returns a path segment.
|
/external/webp/src/enc/ |
H A D | frame.c | 305 const int segment = it->mb_->segment_; local 346 it->bit_count_[segment][i16] += it->luma_bits_; 347 it->bit_count_[segment][2] += it->uv_bits_; 533 VP8SetSegmentParams(enc, q); // setup segment quantizations and filters 534 SetSegmentProbas(enc); // compute segment probabilities
|
H A D | iterator.c | 356 void VP8SetSegment(const VP8EncIterator* const it, int segment) { argument 357 it->mb_->segment_ = segment;
|
/external/valgrind/main/coregrind/m_debuginfo/ |
H A D | readpdb.c | 68 relative to segment (here it is one PE section), which in 72 directly to the image base, without the segment indirection. 400 unsigned short segment; member in struct:_PDB_SYMBOL_RANGE 412 unsigned short segment; member in struct:_PDB_SYMBOL_RANGE_EX 535 unsigned short segment; member in struct:codeview_symbol::__anon32483 546 unsigned short segment; member in struct:codeview_symbol::__anon32484 556 unsigned short segment; member in struct:codeview_symbol::__anon32485 568 unsigned short segment; member in struct:codeview_symbol::__anon32486 582 unsigned short segment; member in struct:codeview_symbol::__anon32487 599 unsigned short segment; member in struct:codeview_symbol::__anon32488 617 unsigned short segment; member in struct:codeview_symbol::__anon32489 634 unsigned short segment; member in struct:codeview_symbol::__anon32490 645 unsigned short segment; member in struct:codeview_symbol::__anon32491 655 unsigned short segment; member in struct:codeview_symbol::__anon32492 734 unsigned short segment; member in struct:codeview_symbol::__anon32500 746 unsigned short segment; member in struct:codeview_symbol::__anon32501 755 unsigned short segment; member in struct:codeview_symbol::__anon32502 765 unsigned short segment; member in struct:codeview_symbol::__anon32503 865 unsigned short segment; member in struct:codeview_symbol::__anon32514 [all...] |
/external/valgrind/main/drd/ |
H A D | drd_segment.h | 30 * Segments and segment lists. A segment represents information about 32 * clock associated with each segment. 42 typedef struct segment struct 44 struct segment* g_next; 45 struct segment* g_prev; 47 struct segment* thr_next; 48 struct segment* thr_prev; 50 /** Reference count: number of pointers that point to this segment. */ 52 /** Stack trace of the first instruction of the segment [all...] |
/external/stressapptest/src/ |
H A D | disk_blocks.cc | 181 BlockData *DiskBlockTable::GetUnusedBlock(int64 segment) { argument 204 // Use the entire disk or a small segment of the disk to allocate the first 215 sector += segment * segment_size_; 217 // Make sure the block is within the segment. 218 if (sector + num_sectors > (segment + 1) * segment_size_) {
|
H A D | worker.cc | 2542 segment_size_ = -1; // use the entire disk as one segment 2644 logprintf(0, "Process Error: Blocks per segment must be greater than " 2828 // Confine testing to a particular segment of the disk. 2829 int64 segment = (block_num / blocks_per_segment_) % num_segments; local 2832 logprintf(20, "Log: Starting to write segment %lld out of " 2834 segment, num_segments, device_name_.c_str(), 2839 BlockData *block = block_table_->GetUnusedBlock(segment); 2842 // next block to process. Soon, a new segment will come and new 2849 // 1. In order to allocate 'y' blocks from a segment, the 2850 // segment mus [all...] |
/external/sonivox/jet_tools/JetCreator/ |
H A D | JetDialogs.py | 299 self.segment = None
359 InfoMsg("Start/End", "The segment starting and ending times are illogical.")
363 InfoMsg("Segment Name", "The segment must have a name.")
367 InfoMsg("MIDI File", "The segment must have a midi file selected.")
383 """ Builds the segment info for graphing """
386 segment = JetSegment(self.GetValue(JetDefs.F_SEGNAME),
401 segment = JetSegment(self.GetValue(JetDefs.F_SEGNAME),
414 return segment
423 """ Play the segment button pressed """
581 self.segment 1017 segment = JetSegment("Test Segment Name", 'C:/_Data/JetCreator/JetDemo1/jenn_Burning Line.mid', variable [all...] |
/external/sonivox/arm-wt-22k/host_src/ |
H A D | jet.h | 62 EAS_U8 segment; member in struct:s_jet_event_tag 140 * Queue a segment for playback
|
/external/skia/src/pathops/ |
H A D | SkIntersectionHelper.h | 86 const SkOpSegment& segment = fContour->segments()[fIndex]; local 88 SkDPoint midPtByT = segment.dPtAtT(mid); 106 const SkOpSegment& segment = fContour->segments()[fIndex]; local 107 SegmentType type = (SegmentType) segment.verb(); 111 if (segment.isHorizontal()) { 114 if (segment.isVertical()) {
|
H A D | SkOpAngle.cpp | 383 const SkOpSegment& segment = *this->segment(); local 384 int ptCount = SkPathOpsVerbToPoints(segment.verb()); 385 const SkPoint* pts = segment.pts(); 413 const SkOpSegment& segment = index ? *rh.fSegment : *fSegment; local 415 (*CurveIntersectRay[index ? rPts : lPts])(segment.pts(), rays[index], &i); 420 double tStart = segment.t(index ? rh.fStart : fStart); 421 double tEnd = segment.t(index ? rh.fComputedEnd : fComputedEnd); 468 const SkOpSegment& segment = index ? *rh.fSegment : *fSegment; 469 const SkDPoint& dPt = segment 881 set(const SkOpSegment* segment, int start, int end) argument [all...] |
H A D | SkOpAngle.h | 53 void set(const SkOpSegment* segment, int start, int end); 59 SkOpSegment* segment() const { function in class:SkOpAngle
|
H A D | SkOpContour.cpp | 20 // or needs to check to see if the self-intersection bit was set on the cubic segment 231 const SkOpSegment& segment = fSegments[index]; local 233 *point = segment.pts()[0]; 235 *point = segment.pts()[SkPathOpsVerbToPoints(segment.verb())];
|
H A D | SkOpContour.h | 102 SkOpSegment& segment = fSegments[sIndex]; local 103 if (segment.hasMultiples()) { 104 segment.alignMultiples(aligned); 123 SkOpSegment& segment = fSegments[sIndex]; local 124 if (segment.count() > 2) { 125 segment.checkDuplicates(); 136 SkOpSegment* segment = &fSegments[sIndex]; local 137 if (segment->verb() == SkPath::kLine_Verb) { 140 if (segment->done()) { 143 segment 150 SkOpSegment& segment = fSegments[sIndex]; local 161 SkOpSegment& segment = fSegments[sIndex]; local 176 SkOpSegment& segment = fSegments[sIndex]; local 206 const SkOpSegment& segment = fSegments.back(); local 291 SkOpSegment& segment = fSegments[index]; local [all...] |
H A D | SkPathOpsCommon.cpp | 142 SkOpSegment* segment = backPtr.fOther; local 147 if (const SkOpAngle* last = segment->activeAngle(*tIndex, tIndex, endIndex, &done, 156 return last->segment(); 165 const SkOpAngle* angle = segment->spanToAngle(*tIndex, *endIndex); 174 segment = angle->segment(); 175 winding = segment->windSum(angle); 177 int spanWinding = segment->spanSign(angle->start(), angle->end()); 191 winding -= firstAngle->segment()->spanSign(firstAngle); 193 segment [all...] |
H A D | SkPathOpsDebug.cpp | 159 const SkOpSegment* segment = next->fSegment; local 160 bool operandsMatch = firstOperand == segment->operand(); 161 signSum += operandsMatch ? segment->spanSign(next) : segment->oppSign(next); 162 oppSum += operandsMatch ? segment->oppSign(next) : segment->spanSign(next); 163 const SkOpSpan& span = segment->span(SkMin32(next->fStart, next->fEnd)); 164 if (segment->_xor()) { 168 if (segment->oppXor()) { 187 const SkOpSegment* segment local 232 const SkOpSegment* segment = next->fSegment; local [all...] |
H A D | SkPathOpsOp.cpp | 17 SkOpSegment* segment = backPtr.fOther; local 22 if (const SkOpAngle* last = segment->activeAngle(*tIndex, tIndex, endIndex, &done, 34 return last->segment(); 43 const SkOpAngle* angle = segment->spanToAngle(*tIndex, *endIndex); 54 segment = angle->segment(); 55 winding = segment->windSum(angle); 57 int sumMiWinding = segment->updateWindingReverse(angle); 58 int sumSuWinding = segment->updateOppWindingReverse(angle); 59 if (segment [all...] |
/external/skia/tests/ |
H A D | PathOpsAngleIdeas.cpp | 411 static void ConstructQuad(SkOpSegment* segment, SkPoint shortQuad[3]) { argument 412 segment->debugConstructQuad(shortQuad);
|
H A D | PathOpsDebug.cpp | 88 void SkOpAngle::dumpTo(const SkOpSegment* segment, const SkOpAngle* to) const { argument 95 if (segment == next->fSegment) { 191 const SkOpSegment& segment = fSegments[test]; local 192 if (segment.debugID() == index) { 210 const SkOpSegment& segment = fSegments[test]; local 211 if (segment.debugID() == index) { 490 const SkOpSegment* segment = oSpan.fOther; local 491 SkDebugf("((SkOpSegment*) 0x%p) [%d] ", segment, segment->debugID()); 581 const SkOpSegment* segment local [all...] |
/external/sfntly/cpp/src/sample/subtly/ |
H A D | font_assembler.cc | 96 // For simplicity, we will have one segment per contiguous range. 105 if (character != last_chararacter + 1) { // new segment 122 // The last segment is still open. 125 // Updating the id_range_offset for every segment. 127 Ptr<CMapTable::CMapFormat4::Builder::Segment> segment = segment_list->at(i); local 128 segment->set_id_range_offset(segment->id_range_offset() 131 // Adding the final, required segment.
|
/external/sfntly/cpp/src/sfntly/table/core/ |
H A D | cmap_table.cc | 607 int32_t segment = data_->SearchUShort(StartCodeOffset(seg_count_), local 613 if (segment == -1) { 616 int32_t start_code = StartCode(segment); 617 return RetrieveGlyphId(segment, start_code, character); 620 int32_t CMapTable::CMapFormat4::RetrieveGlyphId(int32_t segment, argument 626 int32_t id_range_offset = IdRangeOffset(segment); 628 return (character + IdDelta(segment)) % 65536; 631 IdRangeOffsetLocation(segment) + 643 int32_t CMapTable::CMapFormat4::StartCode(int32_t segment) { argument 644 if (!IsValidIndex(segment)) { 736 EndCode(int32_t segment) argument 747 IsValidIndex(int32_t segment) argument 758 IdDelta(int32_t segment) argument 764 IdRangeOffset(int32_t segment) argument 770 IdRangeOffsetLocation(int32_t segment) argument 982 Ptr<Segment> segment = new Segment; local [all...] |
/external/skia/experimental/Intersection/ |
H A D | ShapeOps.cpp | 25 Segment* segment = backPtr.fOther; local 29 if (segment->activeAngle(nextStart, done, angles)) { 38 return last->segment(); 47 sorted[0]->segment()->debugShowSort(__FUNCTION__, sorted, 0); 57 segment = angle->segment(); 58 } while (segment->windSum(angle) == SK_MinS32); 60 segment->debugShowSort(__FUNCTION__, sorted, firstIndex); 62 int sumMiWinding = segment->updateWindingReverse(angle); 63 int sumSuWinding = segment [all...] |
H A D | Simplify.cpp | 854 void set(const SkPoint* orig, SkPath::Verb verb, const Segment* segment, argument 856 fSegment = segment; 950 Segment* segment() const { function 1690 // This could later limit segment tests to the two adjacent 1831 // two span in one segment are separated by float epsilon on one span but 1832 // not the other, if one segment is very small. For this 2137 sorted[0]->segment()->debugShowSort(__FUNCTION__, sorted, 0, 0, 0); 2150 base = angle->segment(); 2183 Segment* segment = angle->segment(); [all...] |
H A D | SimplifyAngle_Test.cpp | 55 struct segment { struct 60 static const segment segmentTest1[] = { 68 static const segment segmentTest2[] = { 75 static const segment segmentTest3[] = { 81 static const segment* segmentTests[] = { 91 const segment* segPtr = segmentTests[testIndex];
|