Searched defs:segment (Results 26 - 50 of 86) sorted by relevance

1234

/external/webkit/Source/WebCore/platform/graphics/win/
H A DFontCGWin.cpp77 LPTTPOLYCURVE segment = reinterpret_cast<LPTTPOLYCURVE>(reinterpret_cast<UInt8*>(subpath) + subpathOffset); local
78 switch (segment->wType) {
80 for (unsigned i = 0; i < segment->cpfx; i++)
81 CGPathAddLineToPoint(path, 0, toCGFloat(segment->apfx[i].x), toCGFloat(segment->apfx[i].y));
85 for (unsigned i = 0; i < segment->cpfx; i++) {
86 CGFloat x = toCGFloat(segment->apfx[i].x);
87 CGFloat y = toCGFloat(segment->apfx[i].y);
91 if (i == segment->cpfx - 2) {
92 cpx = toCGFloat(segment
[all...]
/external/webp/src/enc/
H A Diterator.c319 void VP8SetSegment(const VP8EncIterator* const it, int segment) { argument
320 it->mb_->segment_ = segment;
H A Dframe.c421 const int segment = it->mb_->segment_; local
462 it->bit_count_[segment][i16] += it->luma_bits_;
463 it->bit_count_[segment][2] += it->uv_bits_;
850 VP8SetSegmentParams(enc, q); // setup segment quantizations and filters
/external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/
H A DXMPNodeUtils.java450 * @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/elfutils/libdwfl/
H A DlibdwflP.h118 GElf_Addr *lookup_addr; /* Start address of segment. */
119 Dwfl_Module **lookup_module; /* Module associated with segment, or null. */
120 int *lookup_segndx; /* User segment index, or -1. */
183 int segment; /* Index of first segment table entry. */ member in struct:Dwfl_Module
H A Ddwfl_segment_report_module.c64 This more than covers the phdrs and note segment in the average 64-bit
76 /* Return user segment index closest to ADDR but not above it. */
78 addr_segndx (Dwfl *dwfl, size_t segment, GElf_Addr addr) argument
80 int ndx = dwfl->lookup_segndx[segment];
83 if (dwfl->lookup_segndx[segment] >= 0)
84 ndx = dwfl->lookup_segndx[segment];
85 ++segment;
87 while (segment < dwfl->lookup_elts - 1
88 && dwfl->lookup_addr[segment] < addr);
90 while (dwfl->lookup_segndx[segment] <
107 size_t segment = ndx; local
[all...]
/external/webkit/Source/WebCore/platform/image-decoders/png/
H A DPNGImageDecoder.cpp137 const char* segment; local
138 while (unsigned segmentLength = data.getSomeData(segment, m_readOffset)) {
141 png_process_data(m_png, m_info, reinterpret_cast<png_bytep>(const_cast<char*>(segment)), segmentLength);
/external/freetype/src/autofit/
H A Dafhints.c24 /* Get new segment for given axis. */
32 AF_Segment segment = NULL; local
39 FT_Int big_max = (FT_Int)( FT_INT_MAX / sizeof ( *segment ) );
58 segment = axis->segments + axis->num_segments++;
61 *asegment = segment;
526 * note that we don't need to free the segment and edge
1157 /* PASS 1: Move segment points to edge positions */
H A Daflatin.c299 /* segment; we first need to find in which contour the extremum */
338 /* now set the `round' flag depending on the segment's kind */
732 AF_Segment segment = NULL; local
780 FT_Pos min_pos = 32000; /* minimum segment pos != min_coord */
781 FT_Pos max_pos = -32000; /* maximum segment pos != max_coord */
825 /* we are just leaving an edge; record a new segment! */
826 segment->last = point;
827 segment->pos = (FT_Short)( ( min_pos + max_pos ) >> 1 );
829 /* a segment is round if either its first or last point */
831 if ( ( segment
[all...]
H A Daflatin2.c292 /* segment; we first need to find in which contour the extremum */
331 /* now, set the `round' flag depending on the segment's kind */
684 AF_Segment segment = NULL; local
745 else /* otherwise, find first segment start, if any */
763 /* we're at the start of a new segment */
790 /* record new segment */
791 error = af_axis_hints_new_segment( axis, memory, &segment );
795 segment[0] = seg0;
796 segment->dir = first->out_dir;
797 segment
[all...]
/external/freetype/src/truetype/
H A Dttgxvar.c285 GX_AVarSegment segment; local
312 segment = &blend->avar_segment[0];
313 for ( i = 0; i < axisCount; ++i, ++segment )
315 segment->pairCount = FT_GET_USHORT();
316 if ( FT_NEW_ARRAY( segment->correspondence, segment->pairCount ) )
329 for ( j = 0; j < segment->pairCount; ++j )
331 segment->correspondence[j].fromCoord =
333 segment->correspondence[j].toCoord =
/external/grub/stage2/
H A Dasm.S303 /* copy the original int13 handler segment:offset */
342 .word 0 /* segment */
641 /* compute the segment */
740 * chain_stage1(segment, offset, part_table_addr)
742 * This starts another stage1 loader, at segment:offset.
755 /* store new segment */
757 movw %ax, segment
776 * chain_stage2(segment, offset, second_sector)
778 * This starts another stage2 loader, at segment:offset. It presumes
791 /* store new segment */
2309 segment: label
[all...]
/external/libxml2/
H A Duri.c505 * @empty: allow an empty segment
507 * Parse a segment and fills in the appropriate fields
510 * segment = *pchar
511 * segment-nz = 1*pchar
512 * segment-nz-nc = 1*( unreserved / pct-encoded / sub-delims / "@" )
513 * ; non-zero-length segment without any colon ":"
542 * path-abempty = *( "/" segment )
582 * path-absolute = "/" [ segment-nz *( "/" segment ) ]
628 * path-rootless = segment
1821 xmlChar *ret, *segment = NULL; local
[all...]
/external/opencv/cv/src/
H A Dcvsmooth.cpp730 ushort* segment; local
744 /* Update corresponding histogram segment */
764 /* Find median in segment */
765 segment = H[c].fine[k];
767 sum += segment[b];
/external/replicaisland/src/com/replica/replicaisland/
H A DCollisionSystem.java95 * The first intersecting segment that is found is returned; in the case where more than one
96 * segment is found, the segment closest to the start point is returned.
429 * returns the closest intersecting segment, if any exists.
443 LineSegment segment = (LineSegment)segmentArray[x];
448 movementDirection.dot(segment.mNormal) : -1.0f;
451 (excludeObject == null || segment.owner != excludeObject) &&
452 segment.calculateIntersection(startPoint, endPoint, hitPoint)) {
458 normalX = segment.mNormal.x;
459 normalY = segment
849 addSegment(LineSegment segment) argument
[all...]
/external/elfutils/src/
H A Dld.c1472 struct output_segment *segment = ld_state.output_segments->next; local
1477 for (orule = segment->output_rules; orule != NULL; orule = orule->next)
1576 segment = segment->next;
1578 while (segment != ld_state.output_segments->next);
/external/grub/grub/
H A Dasmstub.c279 chain_stage1 (unsigned long segment, unsigned long offset, argument
287 chain_stage2 (unsigned long segment, unsigned long offset, int second_sector) argument
929 int sector, int nsec, int segment)
962 buf = (char *) (segment << 4);
928 biosdisk(int subfunc, int drive, struct geometry *geometry, int sector, int nsec, int segment) argument
/external/guava/guava-tests/test/com/google/common/collect/
H A DMapMakerInternalMapTest.java164 // share capacity over each segment, then round up to nearest power of two
383 Segment<Object, Object> segment = map.segments[0];
395 ReferenceEntry<Object, Object> entry = segment.getEntry(one, hash);
519 Segment<Object, Object> segment = map.segments[0];
525 AtomicReferenceArray<ReferenceEntry<Object, Object>> table = segment.table;
532 assertNull(segment.get(key, hash));
536 assertNull(segment.get(key, hash));
537 assertFalse(segment.containsKey(key, hash));
538 assertFalse(segment.containsValue(value));
541 segment
1406 checkAndDrainRecencyQueue(MapMakerInternalMap<K, V> map, Segment<K, V> segment, List<ReferenceEntry<K, V>> reads) argument
1414 checkEvictionQueues(MapMakerInternalMap<K, V> map, Segment<K, V> segment, List<ReferenceEntry<K, V>> readOrder, List<ReferenceEntry<K, V>> writeOrder) argument
[all...]
/external/icu4c/common/
H A Dustring.c1347 /* Append an escape-free segment of the text; used by u_unescape() */
1362 const char *segment = src; local
1373 if (src != segment) {
1376 segment, (int32_t)(src - segment));
1378 i += (int32_t)(src - segment);
1391 segment = src;
1396 if (src != segment) {
1399 segment, (int32_t)(src - segment));
[all...]
/external/libnfc-nci/src/nfc/tags/
H A Drw_t1t_ndef.c56 static UINT8 rw_t1t_get_lock_bits_for_segment (UINT8 segment,UINT8 *p_start_byte, UINT8 *p_start_bit,UINT8 *p_end_byte);
191 start = p_t1t->segment * T1T_SEGMENT_SIZE;
192 end = (p_t1t->segment + 1) * T1T_SEGMENT_SIZE;
861 p_t1t->segment = 0;
1202 /* If not found and not failed, try to read next segment in Dynamic Memory structure */
1246 p_t1t->segment = 0;
1267 p_t1t->segment++;
1281 RW_T1T_BLD_ADDS ((adds), (p_t1t->segment));
1336 p_t1t->segment = (p_t1t->block_read * T1T_BLOCK_SIZE)/T1T_SEGMENT_SIZE;
1357 p_t1t->block_read = ((p_t1t->segment
2004 rw_t1t_get_lock_bits_for_segment(UINT8 segment,UINT8 *p_start_byte, UINT8 *p_start_bit,UINT8 *p_end_byte) argument
[all...]
H A Drw_t2t_ndef.c456 p_t2t->segment = 0;
2073 ** Description This function will update attribute for the current segment
2088 /* Prepare attr for the current segment */
2091 /* calculate offset where the current segment starts in the tag */
2092 lower_offset = p_t2t->segment * RW_T2T_SEGMENT_BYTES;
2093 /* calculate offset where the current segment ends in the tag */
2094 upper_offset = (p_t2t->segment + 1) * RW_T2T_SEGMENT_BYTES;
2098 * for every lock byte that is present in the current segment */
2105 /* Calculate offset in the current segment as p_t2t->attr is prepared for one segment onl
2159 rw_t2t_get_lock_bits_for_segment(UINT8 segment, UINT8 *p_start_byte, UINT8 *p_start_bit, UINT8 *p_end_byte) argument
[all...]
/external/webkit/Source/WebCore/inspector/front-end/
H A DNetworkPanel.js1157 var segment = {start: -1, end: -1};
1176 if (resource.startTime <= segment.end) {
1177 segment.end = Math.max(segment.end, resource.endTime);
1181 categoryValues[category] += segment.end - segment.start;
1183 segment.start = resource.startTime;
1184 segment.end = resource.endTime;
1187 // Add the last segment
1188 categoryValues[category] += segment
[all...]
/external/webkit/Source/WebCore/platform/graphics/gpu/
H A DLoopBlinnPathProcessor.cpp127 // Describes a segment of the path: either a cubic or a line segment.
198 // The contour this segment belongs to.
201 // Subdivides the current segment at the given parameter value (0 <=
232 // Subdivides the current segment at the halfway point and replaces
240 // point and extending to x=+infinity crosses this segment. Outgoing
242 // endpoint or tangent point of the segment, indicating that another
254 // segment. This operation only makes sense for cubic type segments.
261 // this segment.
269 // Fetches the given control point triangle for this segment
373 add(Segment* segment) argument
398 subdivide(Segment* segment, float param) argument
409 subdivide(Segment* segment) argument
645 Segment* segment = m_arena->allocateObject<Segment>(); local
669 Segment* segment = m_arena->allocateObject<Segment>(); local
681 Segment* segment = m_arena->allocateObject<Segment>(); local
692 Segment* segment = m_arena->allocateObject<Segment>(); local
878 Segment* segment; member in struct:WebCore::__anon14672::SweepData
[all...]
/external/guava/guava-tests/test/com/google/common/cache/
H A DLocalCacheTest.java211 // share capacity over each segment, then round up to nearest power of two
419 Segment<Object, Object> segment = map.segments[0];
427 ReferenceEntry<Object, Object> entry = segment.getEntry(key, hash);
432 checkEvictionQueues(map, segment, readOrder, writeOrder);
434 assertTrue(segment.recencyQueue.isEmpty());
446 assertTrue(segment.recencyQueue.size() <= DRAIN_THRESHOLD);
449 int undrainedIndex = reads.size() - segment.recencyQueue.size();
450 checkAndDrainRecencyQueue(map, segment, reads.subList(undrainedIndex, reads.size()));
453 checkEvictionQueues(map, segment, readOrder, writeOrder);
475 Segment<Object, Object> segment
1974 checkAndDrainRecencyQueue(LocalCache<K, V> map, Segment<K, V> segment, List<ReferenceEntry<K, V>> reads) argument
1982 checkEvictionQueues(LocalCache<K, V> map, Segment<K, V> segment, List<ReferenceEntry<K, V>> readOrder, List<ReferenceEntry<K, V>> writeOrder) argument
[all...]
/external/webkit/Source/WebCore/editing/
H A DTextIterator.cpp2530 const TextSegment& segment = textSegments->at(i); local
2531 memcpy(resultPos, segment.first, segment.second * sizeof(UChar));
2532 resultPos += segment.second;

Completed in 624 milliseconds

1234