| /external/clang/lib/AST/ |
| InheritViz.cpp | 138 QualType Self = Context.getTypeDeclType(this);
143 Self.getAsString(), "dot", FD, Filename)) {
153 Writer.WriteGraph(Self);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Support/ |
| Parallel.cpp | 43 Taskish *Self = static_cast<Taskish *>(P);
44 Self->Task();
45 concurrency::Free(Self);
|
| /device/linaro/bootloader/edk2/EmulatorPkg/Include/Protocol/ |
| EmuThread.h | 97 THREAD_THUNK_SELF Self;
|
| /external/clang/test/SemaTemplate/ |
| enum-argument.cpp | 6 typedef C<v> Self;
|
| /external/eigen/unsupported/Eigen/CXX11/src/Tensor/ |
| TensorStorage.h | 75 typedef TensorStorage<T, DSizes<IndexType, NumIndices_>, Options_> Self;
95 EIGEN_DEVICE_FUNC TensorStorage(const Self& other)
101 EIGEN_DEVICE_FUNC Self& operator=(const Self& other)
104 Self tmp(other);
111 EIGEN_DEVICE_FUNC void swap(Self& other)
|
| TensorFixedSize.h | 30 typedef TensorFixedSize<Scalar_, Dimensions_, Options_, IndexType> Self;
32 typedef typename Eigen::internal::nested<Self>::type Nested;
33 typedef typename internal::traits<Self>::StorageKind StorageKind;
34 typedef typename internal::traits<Self>::Index Index;
65 inline Self& base() { return *this; }
66 inline const Self& base() const { return *this; }
307 EIGEN_STRONG_INLINE TensorFixedSize(const Self& other)
313 EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE TensorFixedSize(Self&& other)
341 typedef TensorAssignOp<Self, const TensorFixedSize> Assign;
352 typedef TensorAssignOp<Self, const OtherDerived> Assign
[all...] |
| TensorMap.h | 30 typedef TensorMap<PlainObjectType, Options_, MakePointer_> Self;
32 typedef typename Eigen::internal::nested<Self>::type Nested;
296 EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Self& operator=(const Self& other)
298 typedef TensorAssignOp<Self, const Self> Assign;
306 Self& operator=(const OtherDerived& other)
308 typedef TensorAssignOp<Self, const OtherDerived> Assign;
|
| Tensor.h | 66 typedef Tensor<Scalar_, NumIndices_, Options_, IndexType_> Self;
68 typedef typename Eigen::internal::nested<Self>::type Nested;
69 typedef typename internal::traits<Self>::StorageKind StorageKind;
70 typedef typename internal::traits<Self>::Index Index;
110 inline Self& base() { return *this; }
111 inline const Self& base() const { return *this; }
334 EIGEN_STRONG_INLINE Tensor(const Self& other)
|
| TensorContractionMapper.h | 343 typedef TensorContractionSubMapper<Scalar, Index, side, Tensor, nocontract_t, contract_t, packet_size, inner_dim_contiguous, inner_dim_reordered, Alignment> Self;
344 typedef Self LinearMapper;
|
| /art/runtime/ |
| scoped_thread_state_change.h | 44 ALWAYS_INLINE ScopedThreadStateChange(Thread* self, ThreadState new_thread_state)
49 ALWAYS_INLINE Thread* Self() const {
71 Thread* Self() const {
107 ALWAYS_INLINE explicit ScopedObjectAccessAlreadyRunnable(Thread* self)
123 // Self thread, can be null.
150 ALWAYS_INLINE explicit ScopedObjectAccessUnchecked(Thread* self)
175 ALWAYS_INLINE explicit ScopedObjectAccess(Thread* self)
196 ALWAYS_INLINE explicit ScopedThreadSuspension(Thread* self, ThreadState suspended_state)
|
| handle_scope.h | 222 explicit ALWAYS_INLINE StackHandleScope(Thread* self, mirror::Object* fill_value = nullptr);
225 Thread* Self() const {
242 explicit VariableSizedHandleScope(Thread* const self);
|
| /external/brotli/c/enc/ |
| hash_composite_inc.h | 36 static BROTLI_INLINE HashComposite* FN(Self)(HasherHandle handle) {
42 HashComposite* self = FN(Self)(handle); local
43 self->ha = 0;
44 self->hb = 0;
45 self->params = params;
54 HashComposite* self = FN(Self)(handle); local
55 if (!self->ha) {
59 self->ha = handle + sizeof(HasherCommon) + sizeof(HashComposite)
90 HashComposite* self = FN(Self)(handle); local
98 HashComposite* self = FN(Self)(handle); local
106 HashComposite* self = FN(Self)(handle); local
115 HashComposite* self = FN(Self)(handle); local
127 HashComposite* self = FN(Self)(handle); local
[all...] |
| hash_longest_match_quickly_inc.h | 41 static BROTLI_INLINE HashLongestMatchQuickly* FN(Self)(HasherHandle handle) {
53 HashLongestMatchQuickly* self = FN(Self)(handle); local
60 memset(&self->buckets_[key], 0, BUCKET_SWEEP * sizeof(self->buckets_[0]));
67 memset(&self->buckets_[0], 0, sizeof(self->buckets_));
88 FN(Self)(handle)->buckets_[key + off] = (uint32_t)ix;
134 HashLongestMatchQuickly* self = FN(Self)(handle) local
[all...] |
| hash_rolling_inc.h | 54 static BROTLI_INLINE HashRolling* FN(Self)(HasherHandle handle) {
60 HashRolling* self = FN(Self)(handle); local
62 self->state = 0;
63 self->next_ix = 0;
65 self->factor = FN(kRollingHashMul32);
69 self->factor_remove = 1;
71 self->factor_remove *= self->factor;
74 self->table = (uint32_t*)((HasherHandle)self + sizeof(HashRolling))
84 HashRolling* self = FN(Self)(handle); local
128 HashRolling* self = FN(Self)(handle); local
161 HashRolling* self = FN(Self)(handle); local
[all...] |
| hash_forgetful_chain_inc.h | 57 static BROTLI_INLINE HashForgetfulChain* FN(Self)(HasherHandle handle) {
63 FN(Self)(handle)->max_hops =
69 HashForgetfulChain* self = FN(Self)(handle); local
77 self->addr[bucket] = 0xCCCCCCCC;
78 self->head[bucket] = 0xCCCC;
84 memset(self->addr, 0xCC, sizeof(self->addr));
85 memset(self->head, 0, sizeof(self->head))
104 HashForgetfulChain* self = FN(Self)(handle); local
163 HashForgetfulChain* self = FN(Self)(handle); local
[all...] |
| hash_longest_match64_inc.h | 54 static BROTLI_INLINE HashLongestMatch* FN(Self)(HasherHandle handle) {
58 static BROTLI_INLINE uint16_t* FN(Num)(HashLongestMatch* self) {
59 return (uint16_t*)(&self[1]);
62 static BROTLI_INLINE uint32_t* FN(Buckets)(HashLongestMatch* self) {
63 return (uint32_t*)(&FN(Num)(self)[self->bucket_size_]);
69 HashLongestMatch* self = FN(Self)(handle); local
71 self->hash_shift_ = 64 - common->params.bucket_bits;
72 self->hash_mask_ = (~((uint64_t)0U)) >> (64 - 8 * common->params.hash_len)
80 HashLongestMatch* self = FN(Self)(handle); local
110 HashLongestMatch* self = FN(Self)(handle); local
168 HashLongestMatch* self = FN(Self)(handle); local
[all...] |
| hash_longest_match_inc.h | 50 static BROTLI_INLINE HashLongestMatch* FN(Self)(HasherHandle handle) {
54 static BROTLI_INLINE uint16_t* FN(Num)(HashLongestMatch* self) {
55 return (uint16_t*)(&self[1]);
58 static BROTLI_INLINE uint32_t* FN(Buckets)(HashLongestMatch* self) {
59 return (uint32_t*)(&FN(Num)(self)[self->bucket_size_]);
65 HashLongestMatch* self = FN(Self)(handle); local
67 self->hash_shift_ = 32 - common->params.bucket_bits;
68 self->bucket_size_ = (size_t)1 << common->params.bucket_bits
75 HashLongestMatch* self = FN(Self)(handle); local
104 HashLongestMatch* self = FN(Self)(handle); local
161 HashLongestMatch* self = FN(Self)(handle); local
[all...] |
| hash_to_binary_tree_inc.h | 57 static BROTLI_INLINE HashToBinaryTree* FN(Self)(HasherHandle handle) {
61 static BROTLI_INLINE uint32_t* FN(Forest)(HashToBinaryTree* self) {
62 return (uint32_t*)(&self[1]);
67 HashToBinaryTree* self = FN(Self)(handle); local
68 self->window_mask_ = (1u << params->lgwin) - 1u;
69 self->invalid_pos_ = (uint32_t)(0 - self->window_mask_);
74 HashToBinaryTree* self = FN(Self)(handle) local
271 HashToBinaryTree* self = FN(Self)(handle); local
299 HashToBinaryTree* self = FN(Self)(handle); local
[all...] |
| /external/clang/include/clang/Serialization/ |
| ContinuousRangeMap.h | 110 ContinuousRangeMap &Self;
116 explicit Builder(ContinuousRangeMap &Self) : Self(Self) { }
119 std::sort(Self.Rep.begin(), Self.Rep.end(), Compare());
120 std::unique(Self.Rep.begin(), Self.Rep.end(),
131 Self.Rep.push_back(Val);
|
| /external/clang/lib/CodeGen/ |
| ModuleBuilder.cpp | 46 CodeGeneratorImpl &Self;
48 HandlingTopLevelDeclRAII(CodeGeneratorImpl &Self,
50 : Self(Self), EmitDeferred(EmitDeferred) {
51 ++Self.HandlingTopLevelDecls;
54 unsigned Level = --Self.HandlingTopLevelDecls;
56 Self.EmitDeferredDecls();
|
| /external/llvm/include/llvm/Analysis/ |
| RegionIterator.h | 90 typedef RNSuccIterator<NodeType, BlockT, RegionT> Self;
113 inline bool operator==(const Self& x) const {
121 inline bool operator!=(const Self& x) const { return !operator==(x); }
129 inline Self& operator++() {
143 inline Self operator++(int) {
144 Self tmp = *this;
168 typedef RNSuccIterator<FlatIt<NodeType>, BlockT, RegionT> Self;
196 inline bool operator==(const Self& x) const {
203 inline bool operator!=(const Self& x) const { return !operator==(x); }
218 inline Self& operator++()
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| RegionIterator.h | 87 typedef RNSuccIterator<NodeType> Self;
111 inline bool operator==(const Self& x) const {
119 inline bool operator!=(const Self& x) const { return !operator==(x); }
127 inline Self& operator++() {
141 inline Self operator++(int) {
142 Self tmp = *this;
147 inline const Self &operator=(const Self &I) {
174 typedef RNSuccIterator<FlatIt<NodeType> > Self;
199 inline bool operator==(const Self& x) const
[all...] |
| /external/tensorflow/tensorflow/core/kernels/ |
| eigen_cuboid_convolution.h | 80 Self;
713 Self;
714 typedef Self LinearMapper;
725 const Self& base_mapper, Index vert_offset, Index horiz_offset)
[all...] |
| /art/libartbase/base/ |
| safe_map.h | 34 typedef SafeMap<K, V, Comparator, Allocator> Self;
53 Self& operator=(const Self& rhs) {
70 void swap(Self& other) { map_.swap(other.map_); }
153 bool Equals(const Self& rhs) const {
|
| /device/linaro/bootloader/edk2/StdLib/LibC/Uefi/Devices/Console/ |
| daConsole.c | 247 cIIO *Self;
252 Self = (cIIO *)filp->devdata;
273 else if((Self->Termio.c_iflag & IGNSPEC) != 0) {
325 //cIIO *Self;
|
