| /external/skqp/src/core/ |
| SkPathPriv.h | 69 auto verbs = path.fPathRef->verbs(); local
71 switch (verbs[~i]) { // verbs are stored backwards; we use [~i] to get the i'th verb
109 * Returns a C++11-iterable object that traverses a path's verbs in order. e.g:
111 * for (SkPath::Verb verb : SkPathPriv::Verbs(path)) {
115 struct Verbs {
117 Verbs(const SkPath& path) : fPathRef(path.fPathRef.get()) {}
119 void operator++() { --fVerb; } // verbs are laid out backwards in memory.
124 Iter begin() { return Iter{fPathRef->verbs() - 1};
[all...] |
| /external/skia/tools/lua/ |
| bbh_filter.lua | 24 verbs = {},
67 currentInfo.verbs[t.verb] = (currentInfo.verbs[t.verb] or 0) + 1
102 function calculate_weight(verbs)
104 for name, count in pairs(verbs) do
124 for verb,count in pairs(globalInfo[t.fileName].verbs) do
138 function(a, b) return calculate_weight(a.verbs) > calculate_weight(b.verbs); end,
|
| count_dashes.lua | 34 local verbs = fillpath:getVerbs()
35 for _, verb in ipairs(verbs) do
|
| /external/skqp/tools/lua/ |
| bbh_filter.lua | 24 verbs = {},
67 currentInfo.verbs[t.verb] = (currentInfo.verbs[t.verb] or 0) + 1
102 function calculate_weight(verbs)
104 for name, count in pairs(verbs) do
124 for verb,count in pairs(globalInfo[t.fileName].verbs) do
138 function(a, b) return calculate_weight(a.verbs) > calculate_weight(b.verbs); end,
|
| count_dashes.lua | 34 local verbs = fillpath:getVerbs()
35 for _, verb in ipairs(verbs) do
|
| /external/skia/src/core/ |
| SkPathPriv.h | 69 auto verbs = path.fPathRef->verbs(); local
71 switch (verbs[~i]) { // verbs are stored backwards; we use [~i] to get the i'th verb
115 * Returns a C++11-iterable object that traverses a path's verbs in order. e.g:
117 * for (SkPath::Verb verb : SkPathPriv::Verbs(path)) {
121 struct Verbs {
123 Verbs(const SkPath& path) : fPathRef(path.fPathRef.get()) {}
125 void operator++() { --fVerb; } // verbs are laid out backwards in memory.
130 Iter begin() { return Iter{fPathRef->verbs() - 1};
[all...] |
| SkPathRef.cpp | 202 static bool validate_verb_sequence(const uint8_t verbs[], int vCount) {
203 // verbs are stored backwards, but we need to visit them in logical order to determine if
210 switch (verbs[i]) {
232 static bool deduce_pts_conics(const uint8_t verbs[], int vCount, int* ptCountPtr,
235 if (0 < vCount && verbs[vCount-1] != SkPath::kMove_Verb) {
243 switch (verbs[i]) {
322 // Check that the verbs are valid, and imply the correct number of pts and conics
341 // call this after validate_verb_sequence, since it relies on valid verbs
478 const uint8_t* verbs = this->verbsMemBegin();
481 switch (verbs[i])
[all...] |
| /frameworks/base/libs/hwui/utils/ |
| VectorDrawableUtils.cpp | 40 if (morphFrom.verbs.size() != morphTo.verbs.size()) {
44 for (unsigned int i = 0; i < morphFrom.verbs.size(); i++) {
45 if (morphFrom.verbs[i] != morphTo.verbs[i] ||
70 for (unsigned int i = 0; i < data.verbs.size(); i++) {
72 resolver.addCommand(outPath, previousCommand, data.verbs[i], &data.points, start,
74 previousCommand = data.verbs[i];
92 outData->verbs = from.verbs;
[all...] |
| /frameworks/base/libs/hwui/ |
| PathParser.cpp | 249 data->verbs.push_back(pathStr[start]);
264 data->verbs.push_back(pathStr[start]);
272 for (size_t i = 0; i < data.verbs.size(); i++) {
274 os << data.verbs[i];
298 if (pathData.verbs.size() == 0) {
300 result->failureMessage = "No verbs found in the string for pathData: ";
|
| /external/skia/gm/ |
| aarectmodes.cpp | 30 char verbs[] = { local
38 for (size_t i = 0; i < sizeof(verbs); ++i) {
39 switch ((SkPath::Verb) verbs[i]) {
|
| /external/skqp/gm/ |
| aarectmodes.cpp | 30 char verbs[] = { local
38 for (size_t i = 0; i < sizeof(verbs); ++i) {
39 switch ((SkPath::Verb) verbs[i]) {
|
| /prebuilts/go/darwin-x86/test/fixedbugs/ |
| issue18331.go | 5 // Issue 18331: We should catch invalid pragma verbs
|
| /prebuilts/go/linux-x86/test/fixedbugs/ |
| issue18331.go | 5 // Issue 18331: We should catch invalid pragma verbs
|
| /external/skia/tools/fonts/ |
| create_test_font.cpp | 141 int emSize, SkString* ptsOut, SkTDArray<SkPath::Verb>* verbs,
154 *verbs->append() = verb;
175 *verbs->append() = SkPath::kDone_Verb;
235 SkTDArray<SkPath::Verb> verbs; local
239 output_path_data(paint, emSize, &ptsOut, &verbs, &charCodes, &widths);
249 int verbCount = verbs.count();
252 SkPath::Verb verb = verbs[index];
|
| SkTestScalerContext.h | 37 void init(const SkScalar* pts, const unsigned char* verbs);
|
| /external/skqp/tools/ |
| create_test_font.cpp | 140 int emSize, SkString* ptsOut, SkTDArray<SkPath::Verb>* verbs,
153 *verbs->append() = verb;
174 *verbs->append() = SkPath::kDone_Verb;
234 SkTDArray<SkPath::Verb> verbs; local
238 output_path_data(paint, emSize, &ptsOut, &verbs, &charCodes, &widths);
248 int verbCount = verbs.count();
251 SkPath::Verb verb = verbs[index];
|
| SkTestScalerContext.h | 37 void init(const SkScalar* pts, const unsigned char* verbs);
|
| /external/skia/src/pathops/ |
| SkOpBuilder.cpp | 18 uint8_t* verbs = (uint8_t*) allocator.makeArrayDefault<uint8_t>(verbCount); local
19 (void) path.getVerbs(verbs, verbCount);
21 if (verbs[index] == SkPath::kMove_Verb) {
|
| /external/skqp/src/pathops/ |
| SkOpBuilder.cpp | 18 uint8_t* verbs = (uint8_t*) allocator.makeArrayDefault<uint8_t>(verbCount); local
19 (void) path.getVerbs(verbs, verbCount);
21 if (verbs[index] == SkPath::kMove_Verb) {
|
| /prebuilts/go/darwin-x86/src/fmt/ |
| doc.go | 7 to C's printf and scanf. The format 'verbs' are derived from C's but
13 The verbs:
43 String and slice of bytes (treated equivalently with these verbs):
50 The %b, %d, %o, %x and %X verbs also work with pointers,
123 Flags are ignored by verbs that do not expect them.
139 Except when printed using the verbs %T and %p, special
192 the value. After processing a bracketed expression [n], subsequent verbs
201 will yield " 12.00". Because an explicit index affects subsequent verbs,
261 consumes and parses input; these verbs are described in more
279 The verbs behave analogously to those of Printf
[all...] |
| /prebuilts/go/linux-x86/src/fmt/ |
| doc.go | 7 to C's printf and scanf. The format 'verbs' are derived from C's but
13 The verbs:
43 String and slice of bytes (treated equivalently with these verbs):
50 The %b, %d, %o, %x and %X verbs also work with pointers,
123 Flags are ignored by verbs that do not expect them.
139 Except when printed using the verbs %T and %p, special
192 the value. After processing a bracketed expression [n], subsequent verbs
201 will yield " 12.00". Because an explicit index affects subsequent verbs,
261 consumes and parses input; these verbs are described in more
279 The verbs behave analogously to those of Printf
[all...] |
| /external/skia/include/private/ |
| SkPathRef.h | 25 * Holds the path verbs and points. It is versioned by a generation ID. None of its public methods
26 * modify the contents. To modify or append to the verbs/points wrap the SkPathRef in an
32 * The points and verbs are stored in a single allocation. The points are at the begining of the
33 * allocation while the verbs are stored at end of the allocation, in reverse order. Thus the points
34 * and verbs both grow into the middle of the allocation until the meet. To access verb i in the
35 * verb array use ref.verbs()[~i] (because verbs() returns a pointer just beyond the first
91 * Resets the path ref to a new verb and point count. The new verbs and points are
147 * Gets a path ref with no verbs or points.
242 * Rollsback a path ref to zero verbs and points with the assumption that the path ref will b
256 const uint8_t* verbs() const { return fVerbs; } function in class:final
[all...] |
| /external/skqp/include/private/ |
| SkPathRef.h | 25 * Holds the path verbs and points. It is versioned by a generation ID. None of its public methods
26 * modify the contents. To modify or append to the verbs/points wrap the SkPathRef in an
32 * The points and verbs are stored in a single allocation. The points are at the begining of the
33 * allocation while the verbs are stored at end of the allocation, in reverse order. Thus the points
34 * and verbs both grow into the middle of the allocation until the meet. To access verb i in the
35 * verb array use ref.verbs()[~i] (because verbs() returns a pointer just beyond the first
91 * Resets the path ref to a new verb and point count. The new verbs and points are
147 * Gets a path ref with no verbs or points.
242 * Rollsback a path ref to zero verbs and points with the assumption that the path ref will b
256 const uint8_t* verbs() const { return fVerbs; } function in class:final
[all...] |
| /frameworks/base/libs/hwui/tests/unit/ |
| VectorDrawableTests.cpp | 40 // Verbs
55 // Comprehensive data, containing all the verbs possible.
59 {// Verbs
172 // Verbs
204 // Verbs
224 // Verbs
240 {"L.M.F.A.O", false}, // No floats following verbs
250 return from.verbs == to.verbs && from.verbSizes == to.verbSizes;
291 EXPECT_EQ(hasValidData, testData.pathData.verbs.size() > 0)
[all...] |
| /external/skia/src/gpu/ccpr/ |
| GrCCPathParser.cpp | 108 fCurrPathVerbsIdx = fGeometry.verbs().count();
120 for (SkPath::Verb verb : SkPathPriv::Verbs(path)) {
168 int numVerbs = fGeometry.verbs().count() - fCurrPathVerbsIdx - 1;
175 const SkTArray<GrCCGeometry::Verb, true>& verbs = fGeometry.verbs(); local
184 SkASSERT(GrCCGeometry::Verb::kBeginPath == verbs[fCurrPathVerbsIdx]);
185 for (int i = fCurrPathVerbsIdx + 1; i < fGeometry.verbs().count(); ++i) {
186 switch (verbs[i]) {
406 // Expand the ccpr verbs into GPU instance buffers.
407 for (GrCCGeometry::Verb verb : fGeometry.verbs()) {
[all...] |
