/external/llvm/lib/Support/Windows/ |
H A D | Mutex.inc | 27 data_ = new CRITICAL_SECTION; 28 InitializeCriticalSection((LPCRITICAL_SECTION)data_); 33 DeleteCriticalSection((LPCRITICAL_SECTION)data_); 34 delete (LPCRITICAL_SECTION)data_; 35 data_ = 0; 41 EnterCriticalSection((LPCRITICAL_SECTION)data_); 48 LeaveCriticalSection((LPCRITICAL_SECTION)data_); 55 return TryEnterCriticalSection((LPCRITICAL_SECTION)data_);
|
/external/swiftshader/third_party/LLVM/lib/Support/Windows/ |
H A D | Mutex.inc | 27 data_ = new CRITICAL_SECTION;
28 InitializeCriticalSection((LPCRITICAL_SECTION)data_);
33 DeleteCriticalSection((LPCRITICAL_SECTION)data_);
34 delete (LPCRITICAL_SECTION)data_;
35 data_ = 0;
41 EnterCriticalSection((LPCRITICAL_SECTION)data_);
48 LeaveCriticalSection((LPCRITICAL_SECTION)data_);
55 return TryEnterCriticalSection((LPCRITICAL_SECTION)data_);
|
/external/llvm/lib/Support/Unix/ |
H A D | RWMutex.inc | 29 RWMutexImpl::RWMutexImpl() : data_(new MutexImpl(false)) { } 32 delete static_cast<MutexImpl *>(data_); 36 return static_cast<MutexImpl *>(data_)->acquire(); 40 return static_cast<MutexImpl *>(data_)->release(); 44 return static_cast<MutexImpl *>(data_)->acquire(); 48 return static_cast<MutexImpl *>(data_)->release();
|
/external/libcxx/test/std/utilities/tuple/tuple.tuple/tuple.cnstr/ |
H A D | UTypes.fail.cpp | 32 int data_; member in class:MoveOnly 34 explicit MoveOnly(int data = 1) : data_(data) {} 36 : data_(x.data_) {x.data_ = 0;} 38 {data_ = x.data_; x.data_ = 0; return *this;} 40 int get() const {return data_;} 42 bool operator==(const MoveOnly& x) const {return data_ [all...] |
/external/libcxx/test/std/utilities/time/ |
H A D | rep.h | 17 int data_; member in class:Rep 19 TEST_CONSTEXPR Rep() : data_(-1) {} 20 explicit TEST_CONSTEXPR Rep(int i) : data_(i) {} 22 bool TEST_CONSTEXPR operator==(int i) const {return data_ == i;} 23 bool TEST_CONSTEXPR operator==(const Rep& r) const {return data_ == r.data_;} 25 Rep& operator*=(Rep x) {data_ *= x.data_; return *this;} 26 Rep& operator/=(Rep x) {data_ /= x.data_; retur [all...] |
/external/libcxx/test/support/ |
H A D | DefaultOnly.h | 17 int data_; member in class:DefaultOnly 24 DefaultOnly() : data_(-1) {++count;} 25 ~DefaultOnly() {data_ = 0; --count;} 28 {return x.data_ == y.data_;} 30 {return x.data_ < y.data_;}
|
H A D | MoveOnly.h | 26 int data_; member in class:MoveOnly 28 MoveOnly(int data = 1) : data_(data) {} 30 : data_(x.data_) {x.data_ = 0;} 32 {data_ = x.data_; x.data_ = 0; return *this;} 34 int get() const {return data_;} 36 bool operator==(const MoveOnly& x) const {return data_ [all...] |
H A D | Counter.h | 21 Counter() : data_() { ++gConstructed; } 22 Counter(const T &data) : data_(data) { ++gConstructed; } 23 Counter(const Counter& rhs) : data_(rhs.data_) { ++gConstructed; } 24 Counter& operator=(const Counter& rhs) { ++gConstructed; data_ = rhs.data_; return *this; } 26 Counter(Counter&& rhs) : data_(std::move(rhs.data_)) { ++gConstructed; } 27 Counter& operator=(Counter&& rhs) { ++gConstructed; data_ = std::move(rhs.data_); retur 37 T data_; member in class:Counter [all...] |
/external/libmojo/mojo/public/cpp/bindings/ |
H A D | string_traits.h | 16 explicit StringDataView(internal::String_Data* data) : data_(data) { 17 DCHECK(data_); 20 const char* storage() const { return data_->storage(); } 22 size_t size() const { return data_->size(); } 25 internal::String_Data* data_; member in class:mojo::StringDataView
|
/external/libcxx/test/std/utilities/tuple/tuple.tuple/ |
H A D | alloc_first.h | 23 int data_; member in struct:alloc_first 25 alloc_first() : data_(0) {} 26 alloc_first(int d) : data_(d) {} 28 : data_(0) 35 : data_(d) 42 : data_(d.data_) 48 ~alloc_first() {data_ = -1;} 51 {return x.data_ == y.data_;} [all...] |
H A D | alloc_last.h | 23 int data_; member in struct:alloc_last 25 alloc_last() : data_(0) {} 26 alloc_last(int d) : data_(d) {} 28 : data_(0) 35 : data_(d) 42 : data_(d.data_) 48 ~alloc_last() {data_ = -1;} 51 {return x.data_ == y.data_;} [all...] |
/external/libcxx/test/std/utilities/function.objects/refwrap/ |
H A D | type_properties.pass.cpp | 32 int data_; member in class:MoveOnly 34 MoveOnly(int data = 1) : data_(data) {} 36 : data_(x.data_) {x.data_ = 0;} 38 {data_ = x.data_; x.data_ = 0; return *this;} 40 int get() const {return data_;}
|
/external/libcxx/test/std/utilities/utility/operators/ |
H A D | rel_ops.pass.cpp | 17 int data_; member in struct:A 19 explicit A(int data = -1) : data_(data) {} 26 return x.data_ == y.data_; 33 return x.data_ < y.data_;
|
/external/libcxx/test/std/iterators/predef.iterators/reverse.iterators/reverse.iter.ops/reverse.iter.opref/ |
H A D | op_arrow.pass.cpp | 32 int data_; member in class:A 34 A() : data_(1) {} 35 ~A() {data_ = -1;} 37 int get() const {return data_;} 40 {return x.data_ == y.data_;} 53 int data_; member in class:B 55 B(int d=1) : data_(d) {} 56 ~B() {data_ = -1;} 58 int get() const {return data_;} 68 int data_; member in class:C [all...] |
/external/libchrome/base/containers/ |
H A D | scoped_ptr_hash_map.h | 42 data_.swap(other.data_); 56 return data_.insert(std::make_pair(key, data.release())).first; 62 data_.insert(std::make_pair(key, data.get())); 71 data_.erase(it); 75 iterator it = data_.find(k); 76 if (it == data_.end()) 83 DCHECK(it != data_.end()); 84 if (it == data_.end()) 94 if (it == data_ 169 Container data_; member in class:base::ScopedPtrHashMap [all...] |
/external/libcxx/test/std/containers/ |
H A D | test_hash.h | 20 int data_; member in class:test_hash 22 explicit test_hash(int data = 0) : data_(data) {} 29 {return data_ == c.data_;}
|
/external/libcxx/test/std/utilities/function.objects/func.memfn/ |
H A D | member_data.fail.cpp | 19 double data_; member in struct:A 29 assert(a.data_ == 5); 32 assert(a.data_ == 6); 41 test(std::mem_fn(&A::data_));
|
/external/libcxx/test/std/utilities/utility/pairs/pairs.pair/ |
H A D | const_first_const_second_cxx03.pass.cpp | 21 int data_; member in class:A 23 A(int data) : data_(data) {} 25 bool operator==(const A& a) const {return data_ == a.data_;}
|
/external/v8/src/ |
H A D | small-pointer-list.h | 22 SmallPointerList() : data_(kEmptyTag) {} 24 SmallPointerList(int capacity, Zone* zone) : data_(kEmptyTag) { 30 if ((data_ & kTagMask) == kListTag) { 38 if ((data_ & kTagMask) == kSingletonTag) { 42 data_ = reinterpret_cast<intptr_t>(list) | kListTag; 46 data_ = kEmptyTag; 50 if ((data_ & kTagMask) == kListTag) { 58 if ((data_ & kTagMask) == kEmptyTag) return 0; 59 if ((data_ & kTagMask) == kSingletonTag) return 1; 65 if ((data_ 168 intptr_t data_; member in class:v8::internal::SmallPointerList [all...] |
/external/libcxx/test/std/utilities/function.objects/func.wrap/func.wrap.func/func.wrap.func.inv/ |
H A D | invoke.fail.cpp | 23 A_int_1() : data_(5) {} 25 int data_; member in struct:A_int_1 33 int A_int_1::*fp = &A_int_1::data_;
|
/external/libcxxabi/test/ |
H A D | uncaught_exceptions.pass.cpp | 26 B(unsigned cnt) : data_(cnt) {} 27 ~B() { assert( data_ == __cxxabiv1::__cxa_uncaught_exceptions()); } 28 unsigned data_; member in struct:B
|
/external/webrtc/webrtc/base/ |
H A D | array_view.h | 80 : data_(size == 0 ? nullptr : data), size_(size) { 104 T* data() const { return data_; } 107 RTC_DCHECK(data_); // Follows from size_ > idx and the class invariant. 108 return data_[idx]; 110 T* begin() const { return data_; } 111 T* end() const { return data_ + size_; } 112 const T* cbegin() const { return data_; } 113 const T* cend() const { return data_ + size_; } 118 return a.data_ == b.data_ 127 T* data_; member in class:rtc::final [all...] |
/external/eigen/unsupported/Eigen/CXX11/src/util/ |
H A D | MaxSizeVector.h | 37 data_(static_cast<T*>(internal::aligned_malloc(n * sizeof(T)))) { 38 for (size_t i = 0; i < n; ++i) { new (&data_[i]) T; } 46 data_(static_cast<T*>(internal::aligned_malloc(n * sizeof(T)))) { 47 for (size_t i = 0; i < n; ++i) { new (&data_[i]) T(init); } 53 data_[i].~T(); 55 internal::aligned_free(data_); 61 new (&data_[i]) T; 64 data_[i].~T(); 73 data_[size_++] = t; 79 return data_[ 136 T* data_; member in class:Eigen::MaxSizeVector [all...] |
/external/gemmlowp/public/ |
H A D | map.h | 39 Scalar* data_; // not owned. member in class:gemmlowp::MatrixMap 43 MatrixMap() : data_(nullptr), rows_(0), cols_(0), stride_(0) {} 45 : data_(data), rows_(rows), cols_(cols), stride_(stride) {} 47 : data_(other.data_), 57 Scalar* data() const { return data_; } 59 return data_ + row * rows_stride() + col * cols_stride(); 86 Scalar* data_; // not owned. member in class:gemmlowp::VectorMap 90 VectorMap() : data_(nullptr), size_(0) {} 91 VectorMap(Scalar* data, int size) : data_(dat 108 Scalar data_; member in class:gemmlowp::VectorDup [all...] |
/external/libcxx/test/std/iterators/predef.iterators/insert.iterators/back.insert.iter.ops/back.insert.iter.op=/ |
H A D | lv_value.pass.cpp | 34 int data_; member in class:Copyable 36 Copyable() : data_(0) {} 37 ~Copyable() {data_ = -1;} 40 {return x.data_ == y.data_;}
|