1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/gfx/skia/trunk/src/animator/SkTDArray_Experimental.h Wed Dec 31 06:09:35 2014 +0100
1.3 @@ -0,0 +1,142 @@
1.4 +
1.5 +/*
1.6 + * Copyright 2006 The Android Open Source Project
1.7 + *
1.8 + * Use of this source code is governed by a BSD-style license that can be
1.9 + * found in the LICENSE file.
1.10 + */
1.11 +
1.12 +
1.13 +#ifndef SkTDArray_Experimental_DEFINED
1.14 +#define SkTDArray_Experimental_DEFINED
1.15 +
1.16 +#include "SkTypes.h"
1.17 +
1.18 +#ifdef SK_BUILD_FOR_UNIX
1.19 +#define SK_BUILD_FOR_ADS_12
1.20 +#endif
1.21 +
1.22 +#if !defined(SK_BUILD_FOR_ADS_12) && !defined(__x86_64__)
1.23 +#define SK_SMALLER_ARRAY_TEMPLATE_EXPERIMENT 1
1.24 +#else
1.25 +#define SK_SMALLER_ARRAY_TEMPLATE_EXPERIMENT 0
1.26 +#endif
1.27 +
1.28 +#if SK_SMALLER_ARRAY_TEMPLATE_EXPERIMENT == 0
1.29 +#include "SkTDArray.h"
1.30 +#define SkIntArray(type) SkTDArray<type>
1.31 +#define SkLongArray(type) SkTDArray<type>
1.32 +#else
1.33 +
1.34 +class SkDS32Array {
1.35 +protected:
1.36 + SkDS32Array();
1.37 + SkDS32Array(const SkDS32Array& src);
1.38 + SkDS32Array(const int32_t src[], U16CPU count);
1.39 + SkDS32Array& operator=(const SkDS32Array& src);
1.40 + friend int operator==(const SkDS32Array& a, const SkDS32Array& b);
1.41 + int32_t* append() { return this->append(1, NULL); }
1.42 + int32_t* append(U16CPU count, const int32_t* src = NULL);
1.43 +
1.44 + int32_t* appendClear()
1.45 + {
1.46 + int32_t* result = this->append();
1.47 + *result = 0;
1.48 + return result;
1.49 + }
1.50 +
1.51 + int find(const int32_t& elem) const;
1.52 + int32_t* insert(U16CPU index, U16CPU count, const int32_t* src);
1.53 + int rfind(const int32_t& elem) const;
1.54 + void swap(SkDS32Array& other);
1.55 +public:
1.56 + bool isEmpty() const { return fCount == 0; }
1.57 + int count() const { return fCount; }
1.58 +
1.59 + void remove(U16CPU index, U16CPU count = 1)
1.60 + {
1.61 + SkASSERT(index + count <= fCount);
1.62 + fCount = SkToU16(fCount - count);
1.63 + memmove(fArray + index, fArray + index + count, sizeof(int32_t) * (fCount - index));
1.64 + }
1.65 +
1.66 + void reset()
1.67 + {
1.68 + if (fArray)
1.69 + {
1.70 + sk_free(fArray);
1.71 + fArray = NULL;
1.72 +#ifdef SK_DEBUG
1.73 + fData = NULL;
1.74 +#endif
1.75 + fReserve = fCount = 0;
1.76 + }
1.77 + else
1.78 + {
1.79 + SkASSERT(fReserve == 0 && fCount == 0);
1.80 + }
1.81 + }
1.82 +
1.83 + void setCount(U16CPU count)
1.84 + {
1.85 + if (count > fReserve)
1.86 + this->growBy(count - fCount);
1.87 + else
1.88 + fCount = SkToU16(count);
1.89 + }
1.90 +protected:
1.91 +#ifdef SK_DEBUG
1.92 + enum {
1.93 + kDebugArraySize = 24
1.94 + };
1.95 + int32_t(* fData)[kDebugArraySize];
1.96 +#endif
1.97 + int32_t* fArray;
1.98 + uint16_t fReserve, fCount;
1.99 + void growBy(U16CPU extra);
1.100 +};
1.101 +
1.102 +#ifdef SK_DEBUG
1.103 + #define SYNC() fTData = (T (*)[kDebugArraySize]) fArray
1.104 +#else
1.105 + #define SYNC()
1.106 +#endif
1.107 +
1.108 +template <typename T> class SkTDS32Array : public SkDS32Array {
1.109 +public:
1.110 + SkTDS32Array() { SkDEBUGCODE(fTData=NULL); SkASSERT(sizeof(T) == sizeof(int32_t)); }
1.111 + SkTDS32Array(const SkTDS32Array<T>& src) : SkDS32Array(src) {}
1.112 + ~SkTDS32Array() { sk_free(fArray); }
1.113 + T& operator[](int index) const { SYNC(); SkASSERT((unsigned)index < fCount); return ((T*) fArray)[index]; }
1.114 + SkTDS32Array<T>& operator=(const SkTDS32Array<T>& src) {
1.115 + return (SkTDS32Array<T>&) SkDS32Array::operator=(src); }
1.116 + friend int operator==(const SkTDS32Array<T>& a, const SkTDS32Array<T>& b) {
1.117 + return operator==((const SkDS32Array&) a, (const SkDS32Array&) b); }
1.118 + T* append() { return (T*) SkDS32Array::append(); }
1.119 + T* appendClear() { return (T*) SkDS32Array::appendClear(); }
1.120 + T* append(U16CPU count, const T* src = NULL) { return (T*) SkDS32Array::append(count, (const int32_t*) src); }
1.121 + T* begin() const { SYNC(); return (T*) fArray; }
1.122 + T* end() const { return (T*) (fArray ? fArray + fCount : NULL); }
1.123 + int find(const T& elem) const { return SkDS32Array::find((const int32_t&) elem); }
1.124 + T* insert(U16CPU index) { return this->insert(index, 1, NULL); }
1.125 + T* insert(U16CPU index, U16CPU count, const T* src = NULL) {
1.126 + return (T*) SkDS32Array::insert(index, count, (const int32_t*) src); }
1.127 + int rfind(const T& elem) const { return SkDS32Array::rfind((const int32_t&) elem); }
1.128 + T* push() { return this->append(); }
1.129 + void push(T& elem) { *this->append() = elem; }
1.130 + const T& top() const { return (*this)[fCount - 1]; }
1.131 + T& top() { return (*this)[fCount - 1]; }
1.132 + void pop(T* elem) { if (elem) *elem = (*this)[fCount - 1]; --fCount; }
1.133 + void pop() { --fCount; }
1.134 +private:
1.135 +#ifdef SK_DEBUG
1.136 + mutable T(* fTData)[kDebugArraySize];
1.137 +#endif
1.138 +};
1.139 +
1.140 +#define SkIntArray(type) SkTDS32Array<type> // holds 32 bit data types
1.141 +#define SkLongArray(type) SkTDS32Array<type>
1.142 +
1.143 +#endif // SK_SMALLER_ARRAY_TEMPLATE_EXPERIMENT
1.144 +
1.145 +#endif // SkTDArray_Experimental_DEFINED
