HomeSort by relevance Sort by last modified time
    Searched refs:verbs (Results 26 - 50 of 67) sorted by null

12 3

  /external/skia/src/core/
SkPath.cpp 123 Stores the verbs and points as they are given to us, with exceptions:
683 copy_verbs_reverse(dst, fPathRef->verbs(), count);
1198 const uint8_t* verbs = const_cast<const SkPathRef*>(fPathRef.get())->verbsMemBegin(); local
1682 const uint8_t* verbs = src.fPathRef->verbsMemBegin(); \/\/ points at the last verb local
1880 const uint8_t* verbs = fVerbs; local
2556 const uint8_t* verbs = fCurrVerb; local
    [all...]
SkPath_serial.cpp 218 const uint8_t* verbs = buffer.skipCount<uint8_t>(vbs); local
239 switch (verbs[i]) {
  /external/skqp/src/core/
SkPath.cpp 122 Stores the verbs and points as they are given to us, with exceptions:
674 copy_verbs_reverse(dst, fPathRef->verbs(), count);
1189 const uint8_t* verbs = const_cast<const SkPathRef*>(fPathRef.get())->verbsMemBegin(); local
1654 const uint8_t* verbs = src.fPathRef->verbsMemBegin(); \/\/ points at the last verb local
1852 const uint8_t* verbs = fVerbs; local
2672 const uint8_t* verbs = fCurrVerb; local
    [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]) {
323 // Check that the verbs are valid, and imply the correct number of pts and conics
727 fVerbs = path.verbs();
  /external/skqp/tests/
PathTest.cpp 2553 uint8_t* verbs = &buffer[28]; local
2781 uint8_t verbs[32]; local
3942 uint8_t verbs[4]; local
3960 uint8_t verbs[7]; local
4486 SkPath::Verb verbs[] = {kMove, kLine, kLine, kLine, kLine, kLine, kLine, kLine, kClose, local
4658 uint8_t verbs[6]; local
4810 const SkPath::Verb verbs[] = { local
4911 int verbs = 0; local
    [all...]
  /external/skia/samplecode/
SamplePathFuzz.cpp 605 SkTDArray<uint8_t> verbs; local
606 verbs.setCount(verbCount);
607 SkDEBUGCODE(int getVerbResult = ) path.getVerbs(verbs.begin(), verbCount);
610 if (verbs[index] != SkPath::kMove_Verb) {
SampleCCPRGeometry.cpp 204 for (GrCCGeometry::Verb verb : geometry.verbs()) {
226 for (GrCCGeometry::Verb verb : geometry.verbs()) {
  /external/skia/src/gpu/ccpr/
GrCCGeometry.h 25 // These are the verbs that CCPR knows how to draw. If a path has any segments that don't map to
51 : fPoints(numSkPoints * 3) // Reserve for a 3x expansion in points and verbs.
55 const SkTArray<Verb, true>& verbs() const { SkASSERT(!fBuildingContour); return fVerbs; } function in class:GrCCGeometry
  /external/skqp/samplecode/
SamplePathFuzz.cpp 605 SkTDArray<uint8_t> verbs; local
606 verbs.setCount(verbCount);
607 SkDEBUGCODE(int getVerbResult = ) path.getVerbs(verbs.begin(), verbCount);
610 if (verbs[index] != SkPath::kMove_Verb) {
SampleCCPRGeometry.cpp 204 for (GrCCGeometry::Verb verb : geometry.verbs()) {
226 for (GrCCGeometry::Verb verb : geometry.verbs()) {
  /external/skqp/src/gpu/ccpr/
GrCCGeometry.h 25 // These are the verbs that CCPR knows how to draw. If a path has any segments that don't map to
50 : fPoints(numSkPoints * 3) // Reserve for a 3x expansion in points and verbs.
54 const SkTArray<Verb, true>& verbs() const { SkASSERT(!fBuildingContour); return fVerbs; } function in class:GrCCGeometry
GrCCPathParser.cpp 106 fCurrPathVerbsIdx = fGeometry.verbs().count();
118 for (SkPath::Verb verb : SkPathPriv::Verbs(path)) {
292 // Expand the ccpr verbs into GPU instance buffers.
293 for (GrCCGeometry::Verb verb : fGeometry.verbs()) {
  /external/skia/tools/fonts/
SkTestScalerContext.cpp 51 void SkTestFont::init(const SkScalar* pts, const unsigned char* verbs) {
56 while ((verb = (SkPath::Verb) *verbs++) != SkPath::kDone_Verb) {
  /external/skqp/tools/
SkTestScalerContext.cpp 51 void SkTestFont::init(const SkScalar* pts, const unsigned char* verbs) {
56 while ((verb = (SkPath::Verb) *verbs++) != SkPath::kDone_Verb) {
  /external/skia/tests/
PathTest.cpp 2687 uint8_t verbs[32]; local
3848 uint8_t verbs[4]; local
3866 uint8_t verbs[7]; local
4392 SkPath::Verb verbs[] = {kMove, kLine, kLine, kLine, kLine, kLine, kLine, kLine, kClose, local
4564 uint8_t verbs[6]; local
4716 const SkPath::Verb verbs[] = { local
4794 int verbs = 0; local
    [all...]
  /frameworks/base/libs/hwui/
VectorDrawable.h 137 std::vector<char> verbs; member in struct:android::uirenderer::VectorDrawable::Path::Data
141 return verbs == data.verbs && verbSizes == data.verbSizes && points == data.points;
  /external/fio/engines/
rdma.c 4 * RDMA I/O engine based on the IB verbs and RDMA/CM user space libraries.
413 rd->pd = ibv_alloc_pd(rd->child_cm_id->verbs);
415 rd->pd = ibv_alloc_pd(rd->cm_id->verbs);
423 rd->channel = ibv_create_comp_channel(rd->child_cm_id->verbs);
425 rd->channel = ibv_create_comp_channel(rd->cm_id->verbs);
435 rd->cq = ibv_create_cq(rd->child_cm_id->verbs,
438 rd->cq = ibv_create_cq(rd->cm_id->verbs,
  /external/skia/tools/lua/
scrape_dashing_full.lua 112 eventually would like to print out info on drawPath verbs with dashed effect
  /external/skqp/tools/lua/
scrape_dashing_full.lua 112 eventually would like to print out info on drawPath verbs with dashed effect
  /prebuilts/go/darwin-x86/src/math/big/
example_test.go 131 // We can use the usual fmt.Printf verbs since big.Float implements fmt.Formatter
  /prebuilts/go/linux-x86/src/math/big/
example_test.go 131 // We can use the usual fmt.Printf verbs since big.Float implements fmt.Formatter
  /external/adhd/cras/src/tests/
alsa_ucm_unittest.cc 1347 const char *verbs[] = { "HiFi", "Comment for Verb1", local
1363 const char *verbs[] = { "HiFi", "Comment for Verb1", local
    [all...]
  /external/tensorflow/tensorflow/contrib/verbs/
patch_notes_verbs_with_0_copies.md 0 ## Verbs implementation to use direct tensor writes (0 copies)
5 Following HKUST research on the use of GPU direct, and their [GDR implementation](https://github.com/tensorflow/tensorflow/blob/master/tensorflow/contrib/gdr/README.md), we wish to adopt the 0 copies approach and apply it to the current verbs implementation, while keeping the current implementation advantages, such as configurability and the use of RDMA for control messages.
9 Compared with the current GRPC, verbs and GDR implementation, the result implementation gave the best performance for every model, with any number of nodes. For VGG16 on 8 nodes with 4 P100 GPUs each, the prototype beat the second place by over 15%.
  /prebuilts/go/darwin-x86/src/fmt/
print.go 169 // recursive use in custom verbs.
414 // Make sure any unsupported verbs are found before the
695 // It does not handle 'p' and 'T' verbs because these should have been already handled by printArg.
801 // Handle byte and uint8 slices and arrays special for the above verbs.
992 // Fast path for common case of ascii lower case simple verbs
  /prebuilts/go/linux-x86/src/fmt/
print.go 169 // recursive use in custom verbs.
414 // Make sure any unsupported verbs are found before the
695 // It does not handle 'p' and 'T' verbs because these should have been already handled by printArg.
801 // Handle byte and uint8 slices and arrays special for the above verbs.
992 // Fast path for common case of ascii lower case simple verbs

Completed in 750 milliseconds

12 3