Home
last modified time | relevance | path

Searched full:segments (Results 1 – 25 of 1260) sorted by relevance

12345678910>>...51

/external/swiftshader/third_party/llvm-7.0/llvm/unittests/ProfileData/
DCoverageMappingTest.cpp355 std::vector<CoverageSegment> Segments(Data.begin(), Data.end()); in TEST_P() local
356 ASSERT_EQ(2U, Segments.size()); in TEST_P()
358 EXPECT_EQ(CoverageSegment(1, 1, 10, true), Segments[0]); in TEST_P()
359 EXPECT_EQ(CoverageSegment(5, 5, false), Segments[1]); in TEST_P()
362 EXPECT_EQ(CoverageSegment(2, 2, 20, true), Segments[0]); in TEST_P()
363 EXPECT_EQ(CoverageSegment(6, 6, false), Segments[1]); in TEST_P()
382 std::vector<CoverageSegment> Segments(Data.begin(), Data.end()); in TEST_P() local
384 ASSERT_EQ(2U, Segments.size()); in TEST_P()
385 EXPECT_EQ(CoverageSegment(1, 1, 6, true), Segments[0]); in TEST_P()
386 EXPECT_EQ(CoverageSegment(2, 2, false), Segments[1]); in TEST_P()
[all …]
/external/okhttp/okio/okio/src/main/java/okio/
DSegmentedByteString.java26 * An immutable byte string composed of segments of byte arrays. This class exists to implement
27 * efficient snapshots of buffers. It is implemented as an array of segments, plus a directory in
28 * two halves that describes how the segments compose this byte string.
31 * element at {@code directory[0]} contains the number of bytes held in {@code segments[0]}; the
32 * element at {@code directory[1]} contains the number of bytes held in {@code segments[0] +
33 * segments[1]}, and so on. The element at {@code directory[segments.length - 1]} contains the total
36 * <p>The second half of the directory is the offset in {@code segments} of the first content byte.
42 * segments} in order. Since the arrays contribute 5, 2, and 6 elements respectively, the directory
51 transient final byte[][] segments; field in SegmentedByteString
58 // Walk through the buffer to count how many segments we'll need. in SegmentedByteString()
[all …]
/external/okhttp/repackaged/okio/okio/src/main/java/com/android/okhttp/okio/
DSegmentedByteString.java27 * An immutable byte string composed of segments of byte arrays. This class exists to implement
28 * efficient snapshots of buffers. It is implemented as an array of segments, plus a directory in
29 * two halves that describes how the segments compose this byte string.
32 * element at {@code directory[0]} contains the number of bytes held in {@code segments[0]}; the
33 * element at {@code directory[1]} contains the number of bytes held in {@code segments[0] +
34 * segments[1]}, and so on. The element at {@code directory[segments.length - 1]} contains the total
37 * <p>The second half of the directory is the offset in {@code segments} of the first content byte.
43 * segments} in order. Since the arrays contribute 5, 2, and 6 elements respectively, the directory
52 transient final byte[][] segments; field in SegmentedByteString
59 // Walk through the buffer to count how many segments we'll need. in SegmentedByteString()
[all …]
/external/llvm/unittests/ProfileData/
DCoverageMappingTest.cpp308 std::vector<CoverageSegment> Segments(Data.begin(), Data.end()); in TEST_P() local
309 ASSERT_EQ(2U, Segments.size()); in TEST_P()
311 EXPECT_EQ(CoverageSegment(1, 1, 10, true), Segments[0]); in TEST_P()
312 EXPECT_EQ(CoverageSegment(5, 5, false), Segments[1]); in TEST_P()
315 EXPECT_EQ(CoverageSegment(2, 2, 20, true), Segments[0]); in TEST_P()
316 EXPECT_EQ(CoverageSegment(6, 6, false), Segments[1]); in TEST_P()
349 std::vector<CoverageSegment> Segments(Data.begin(), Data.end()); in TEST_P() local
350 ASSERT_EQ(7U, Segments.size()); in TEST_P()
351 ASSERT_EQ(CoverageSegment(1, 1, 20, true), Segments[0]); in TEST_P()
352 ASSERT_EQ(CoverageSegment(4, 7, 30, false), Segments[1]); in TEST_P()
[all …]
/external/syzkaller/sys/linux/
Dfilesystem.txt13 syz_read_part_table(size intptr, nsegs len[segments], segments ptr[in, array[fs_image_segment]])
15 …in, string["vfat"]], dir ptr[in, filename], size intptr, nsegs len[segments], segments ptr[in, arr…
17 …n, string["msdos"]], dir ptr[in, filename], size intptr, nsegs len[segments], segments ptr[in, arr…
19 …[in, string["bfs"]], dir ptr[in, filename], size intptr, nsegs len[segments], segments ptr[in, arr…
21 …[in, string["xfs"]], dir ptr[in, filename], size intptr, nsegs len[segments], segments ptr[in, arr…
23 …n, string["minix"]], dir ptr[in, filename], size intptr, nsegs len[segments], segments ptr[in, arr…
25 …string["reiserfs"]], dir ptr[in, filename], size intptr, nsegs len[segments], segments ptr[in, arr…
27 …[in, string["hfs"]], dir ptr[in, filename], size intptr, nsegs len[segments], segments ptr[in, arr…
29 … string["hfsplus"]], dir ptr[in, filename], size intptr, nsegs len[segments], segments ptr[in, arr…
31 … string["iso9660"]], dir ptr[in, filename], size intptr, nsegs len[segments], segments ptr[in, arr…
[all …]
/external/llvm/lib/CodeGen/
DLiveInterval.cpp66 if (I == segments().end()) { in createDeadDef()
88 segments().insert(I, Segment(Def, Def.getDeadSlot(), VNI)); in createDeadDef()
93 if (segments().empty()) in extendInBlock()
97 if (I == segments().begin()) in extendInBlock()
109 /// merge and eliminate all segments that this will overlap
112 assert(I != segments().end() && "Not a valid segment!"); in extendSegmentEndTo()
118 for (; MergeTo != segments().end() && NewEnd >= MergeTo->end; ++MergeTo) in extendSegmentEndTo()
125 // have the same value number, merge the two segments into one segment. in extendSegmentEndTo()
126 if (MergeTo != segments().end() && MergeTo->start <= I->end && in extendSegmentEndTo()
132 // Erase any dead segments. in extendSegmentEndTo()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/
DLiveIntervalUnion.h10 // LiveIntervalUnion is a union of live segments across multiple live virtual
44 // A set of live virtual register segments that supports fast insertion,
63 LiveSegments Segments; // union of virtual reg segments variable
66 explicit LiveIntervalUnion(Allocator &a) : Segments(a) {} in LiveIntervalUnion()
68 // Iterate over all segments in the union of live virtual registers ordered
70 SegmentIter begin() { return Segments.begin(); } in begin()
71 SegmentIter end() { return Segments.end(); } in end()
72 SegmentIter find(SlotIndex x) { return Segments.find(x); } in find()
73 ConstSegmentIter begin() const { return Segments.begin(); } in begin()
74 ConstSegmentIter end() const { return Segments.end(); } in end()
[all …]
DLiveInterval.h154 /// The Segments are organized in a static single assignment form: At places
196 using Segments = SmallVector<Segment, 2>; variable
199 Segments segments; // the liveness segments variable
208 using iterator = Segments::iterator;
209 using const_iterator = Segments::const_iterator;
211 iterator begin() { return segments.begin(); } in begin()
212 iterator end() { return segments.end(); } in end()
214 const_iterator begin() const { return segments.begin(); } in begin()
215 const_iterator end() const { return segments.end(); } in end()
231 /// Constructs a new LiveRange object by copying segments and valnos from
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/
DLiveInterval.cpp94 if (I == segments().end()) { in createDeadDef()
117 segments().insert(I, Segment(Def, Def.getDeadSlot(), VNI)); in createDeadDef()
122 if (segments().empty()) in extendInBlock()
126 if (I == segments().begin()) in extendInBlock()
138 if (segments().empty()) in extendInBlock()
142 if (I == segments().begin()) in extendInBlock()
157 /// merge and eliminate all segments that this will overlap
160 assert(I != segments().end() && "Not a valid segment!"); in extendSegmentEndTo()
166 for (; MergeTo != segments().end() && NewEnd >= MergeTo->end; ++MergeTo) in extendSegmentEndTo()
173 // have the same value number, merge the two segments into one segment. in extendSegmentEndTo()
[all …]
/external/llvm/include/llvm/CodeGen/
DLiveInterval.h151 /// The Segments are organized in a static single assignment form: At places
193 typedef SmallVector<Segment, 2> Segments; typedef
196 Segments segments; // the liveness segments variable
205 typedef Segments::iterator iterator;
206 iterator begin() { return segments.begin(); } in begin()
207 iterator end() { return segments.end(); } in end()
209 typedef Segments::const_iterator const_iterator;
210 const_iterator begin() const { return segments.begin(); } in begin()
211 const_iterator end() const { return segments.end(); } in end()
226 /// Constructs a new LiveRange object by copying segments and valnos from
[all …]
DLiveIntervalUnion.h10 // LiveIntervalUnion is a union of live segments across multiple live virtual
45 // A set of live virtual register segments that supports fast insertion,
63 LiveSegments Segments; // union of virtual reg segments variable
66 explicit LiveIntervalUnion(Allocator &a) : Tag(0), Segments(a) {} in LiveIntervalUnion()
68 // Iterate over all segments in the union of live virtual registers ordered
70 SegmentIter begin() { return Segments.begin(); } in begin()
71 SegmentIter end() { return Segments.end(); } in end()
72 SegmentIter find(SlotIndex x) { return Segments.find(x); } in find()
73 bool empty() const { return Segments.empty(); } in empty()
74 SlotIndex startIndex() const { return Segments.start(); } in startIndex()
[all …]
/external/tensorflow/tensorflow/python/ops/signal/
Dreconstruction_ops.py95 # Compute the number of segments, per frame.
96 segments = -(-frame_length // frame_step) # Divide and round up.
99 # Pad the frames dimension by `segments` so that signal.shape = (6, 6)
106 paddings = [[0, segments], [0, segments * frame_step - frame_length]]
118 shape = full_shape([frames + segments, segments, frame_step])
131 shape = full_shape([(frames + segments) * segments, frame_step])
136 signal = signal[..., :(frames + segments - 1) * segments, :]
142 shape = full_shape([segments, (frames + segments - 1), frame_step])
149 shape = full_shape([(frames + segments - 1) * frame_step])
/external/swiftshader/third_party/LLVM/lib/CodeGen/
DLiveIntervalUnion.h10 // LiveIntervalUnion is a union of live segments across multiple live virtual
48 // A set of live virtual register segments that supports fast insertion,
67 LiveSegments Segments; // union of virtual reg segments variable
70 LiveIntervalUnion(unsigned r, Allocator &a) : RepReg(r), Tag(0), Segments(a) in LiveIntervalUnion()
73 // Iterate over all segments in the union of live virtual registers ordered
75 SegmentIter begin() { return Segments.begin(); } in begin()
76 SegmentIter end() { return Segments.end(); } in end()
77 SegmentIter find(SlotIndex x) { return Segments.find(x); } in find()
78 bool empty() const { return Segments.empty(); } in empty()
79 SlotIndex startIndex() const { return Segments.start(); } in startIndex()
[all …]
/external/skia/src/gpu/ops/
DGrAAConvexPathRenderer.cpp65 static bool center_of_mass(const SegmentArray& segments, SkPoint* c) { in center_of_mass() argument
68 int count = segments.count(); in center_of_mass()
74 p0 = segments[0].endPt(); in center_of_mass()
80 pj = segments[1].endPt() - p0; in center_of_mass()
83 pj = segments[i + 1].endPt() - p0; in center_of_mass()
98 const SkPoint& pt = segments[i].endPt(); in center_of_mass()
115 static bool compute_vectors(SegmentArray* segments, in compute_vectors() argument
120 if (!center_of_mass(*segments, fanPt)) { in compute_vectors()
123 int count = segments->count(); in compute_vectors()
137 Segment& sega = (*segments)[a]; in compute_vectors()
[all …]
/external/skqp/src/gpu/ops/
DGrAAConvexPathRenderer.cpp66 static bool center_of_mass(const SegmentArray& segments, SkPoint* c) { in center_of_mass() argument
69 int count = segments.count(); in center_of_mass()
75 p0 = segments[0].endPt(); in center_of_mass()
81 pj = segments[1].endPt() - p0; in center_of_mass()
84 pj = segments[i + 1].endPt() - p0; in center_of_mass()
99 const SkPoint& pt = segments[i].endPt(); in center_of_mass()
116 static bool compute_vectors(SegmentArray* segments, in compute_vectors() argument
121 if (!center_of_mass(*segments, fanPt)) { in compute_vectors()
124 int count = segments->count(); in compute_vectors()
138 Segment& sega = (*segments)[a]; in compute_vectors()
[all …]
/external/pdfium/third_party/lcms/
D0017-memory-leak-ReadSegmentedCurve.patch12 Segments[i].nGridPoints = Count;
13 …Segments[i].SampledPoints = (cmsFloat32Number*) _cmsCalloc(self ->ContextID, Count, sizeof(cmsFloa…
27 - if (Segments) _cmsFree(self ->ContextID, Segments);
28 + if (Segments) {
30 + if (Segments[i].SampledPoints) _cmsFree(self ->ContextID, Segments[i].SampledPoints);
32 + _cmsFree(self ->ContextID, Segments);
/external/sonivox/jet_tools/JetCreator/
DJetFile.py93 """ Class to hold segments """
302 # count segments
303 segments = []
360 …segments.append(JetSegment(segname, filename, start, end, length, output, quantize, jetevents, dls…
363 self.segments = segments
364 if not len(segments):
365 #TODO: Check for segments when writing
366 #raise JetFileException('No segments defined in configuration file')
392 JINF_NUM_SMF_CHUNKS, len(self.segments),
426 # copy the MIDI segments
[all …]
/external/freetype/src/autofit/
Dafhints.h36 /* i.e., vertical segments & edges */
38 /* i.e., horizontal segments & edges */
70 * Segments
73 * find segments in an outline.
85 * As soon as segments are defined, the auto-hinter groups them into
87 * dimension that collects one or more segments (allowing for a small
91 * edges, then to align segments on the edges unless it detects that
113 * Segments need to be `linked' to other ones in order to detect stems.
114 * A stem is made of two segments that face each other in opposite
116 * vocabulary from the TrueType specification, stem segments form a
[all …]
/external/chromium-trace/catapult/devil/devil/android/
Ddevice_errors.py58 segments = ['adb %s: failed ' % adb_cmd]
60 segments.append('with exit status %s ' % self.status)
62 segments.append('and output:\n')
63 segments.extend('- %s\n' % line for line in output.splitlines())
65 segments.append('and no output.')
66 message = ''.join(segments)
122 segments = ['shell command run via adb failed on the device:\n',
124 segments.append(' exit status: %s\n' % status)
126 segments.append(' output:\n')
131 segments.extend(' - %s\n' % line for line in output_lines)
[all …]
/external/elfutils/src/
Dfindtextrel.c41 struct segments struct
91 static void check_rel (size_t nsegments, struct segments segments[nsegments],
304 /* Get the address ranges for the loaded segments. */ in process_file()
307 struct segments *segments in process_file() local
308 = (struct segments *) malloc (nsegments_max * sizeof (segments[0])); in process_file()
309 if (segments == NULL) in process_file()
336 segments in process_file()
337 = (struct segments *) realloc (segments, in process_file()
339 * sizeof (segments[0])); in process_file()
340 if (segments == NULL) in process_file()
[all …]
/external/fonttools/Lib/fontTools/pens/
DpointPen.py56 so when you need an outline presented as segments but you have
68 def _flushContour(self, segments): argument
72 of segments: the 'segments' argument.
74 The segments list contains tuples of length 2:
91 The 'points' list of "move" and "line" segments always contains
105 segments = [("move", [(pt, smooth, name, kwargs)])]
106 self._flushContour(segments)
108 segments = []
113 segments.append(("move", [(pt, smooth, name, kwargs)]))
138 segments.append((segmentType, currentSegment))
[all …]
/external/pdfium/third_party/lcms/src/
Dcmsgamma.c29 // The curve is stored in segments, where each segment can be sampled or specified by parameters.
213 cmsInt32Number nSegments, const cmsCurveSegment* Segments, in AllocateToneCurveStruct() argument
226 …cmsSignalError(ContextID, cmsERROR_RANGE, "Couldn't create tone curve with zero segments and no ta… in AllocateToneCurveStruct()
234 // In this case, there are no segments in AllocateToneCurveStruct()
236 p ->Segments = NULL; in AllocateToneCurveStruct()
240 p ->Segments = (cmsCurveSegment*) _cmsCalloc(ContextID, nSegments, sizeof(cmsCurveSegment)); in AllocateToneCurveStruct()
241 if (p ->Segments == NULL) goto Error; in AllocateToneCurveStruct()
268 // Initialize the segments stuff. The evaluator for each segment is located and a pointer to it in AllocateToneCurveStruct()
270 if (Segments != NULL && (nSegments > 0)) { in AllocateToneCurveStruct()
280 if (Segments[i].Type == 0) in AllocateToneCurveStruct()
[all …]
/external/python/google-api-python-client/docs/dyn/
Danalytics_v3.management.segments.html75 …management.html">management</a> . <a href="analytics_v3.management.segments.html">segments</a></h1>
79 <p class="firstline">Lists segments to which the user has access.</p>
83 <pre>Lists segments to which the user has access.
86 max_results: integer, The maximum number of segments to include in this response.
92 …{ # An segment collection lists Analytics segments that the user has access to. Each resource in t…
94 "kind": "analytics#segments", # Collection type for segments.
95 "items": [ # A list of segments.
/external/testng/src/test/java/test/ant/
DTestCommandLineArgs.java23 String[] segments = path.split("[/\\\\]", -1); in testUnixPathResolution() local
25 assertEquals(4, segments.length); in testUnixPathResolution()
26 assertEquals("wee", segments[1]); in testUnixPathResolution()
34 String[] segments = path.split("[/\\\\]", -1); in testDOSPathResolution() local
36 assertEquals(5, segments.length); in testDOSPathResolution()
37 assertEquals("com", segments[2]); // because c: is actually \\ which will be split twice in testDOSPathResolution()
/external/replicaisland/src/com/replica/replicaisland/
DCollisionSystem.java26 * world. This version is based on a collision world of line segments, organized into an array of
30 * This class also provides a system for runtime-generated collision segments. These temporary
31 * segments are cleared each frame, and consequently must be constantly re-submitted if they are
32 * intended to persist. Temporary segments are useful for dynamic solid objects, such as moving
37 * implementations to executeRay. Provided is TileTestVisitor, a visitor that compares the segments
100 * @param movementDirection If set, only segments with normals that oppose this direction will
101 * be counted as valid intersections. If null, all intersecting segments will be
206 boolean hit = testBoxAgainstList(mCollisionTiles[tileIndex].segments, in testBox()
220 // temporary segments in testBox()
258 // frame execution order. So each frame we queue up inserted segments and then swap them in update()
[all …]

12345678910>>...51