HomeSort by relevance Sort by last modified time
    Searched refs:ptr (Results 226 - 250 of 5300) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /prebuilts/ndk/current/platforms/android-8/arch-arm/usr/include/asm/
unaligned.h 25 #define __get_unaligned_le(ptr) ({ __typeof__(*(ptr)) __v; __u8 *__p = (__u8 *)(ptr); switch (sizeof(*(ptr))) { case 1: __v = *(ptr); break; case 2: __v = __get_unaligned_2_le(__p); break; case 4: __v = __get_unaligned_4_le(__p); break; case 8: { unsigned int __v1, __v2; __v2 = __get_unaligned_4_le((__p+4)); __v1 = __get_unaligned_4_le(__p); __v = ((unsigned long long)__v2 << 32 | __v1); } break; default: __v = __bug_unaligned_x(__p); break; } __v; })
27 #define __get_unaligned_be(ptr) ({ __typeof__(*(ptr)) __v; __u8 *__p = (__u8 *)(ptr); switch (sizeof(*(ptr))) { case 1: __v = *(ptr); break; case 2: __v = __get_unaligned_2_be(__p); break; case 4: __v = __get_unaligned_4_be(__ (…)
    [all...]
  /prebuilts/ndk/current/platforms/android-9/arch-arm/usr/include/asm/
unaligned.h 25 #define __get_unaligned_le(ptr) ({ __typeof__(*(ptr)) __v; __u8 *__p = (__u8 *)(ptr); switch (sizeof(*(ptr))) { case 1: __v = *(ptr); break; case 2: __v = __get_unaligned_2_le(__p); break; case 4: __v = __get_unaligned_4_le(__p); break; case 8: { unsigned int __v1, __v2; __v2 = __get_unaligned_4_le((__p+4)); __v1 = __get_unaligned_4_le(__p); __v = ((unsigned long long)__v2 << 32 | __v1); } break; default: __v = __bug_unaligned_x(__p); break; } __v; })
27 #define __get_unaligned_be(ptr) ({ __typeof__(*(ptr)) __v; __u8 *__p = (__u8 *)(ptr); switch (sizeof(*(ptr))) { case 1: __v = *(ptr); break; case 2: __v = __get_unaligned_2_be(__p); break; case 4: __v = __get_unaligned_4_be(__ (…)
    [all...]
  /prebuilts/tools/darwin-x86_64/protoc/include/google/protobuf/stubs/
atomicops_internals_atomicword_compat.h 53 inline AtomicWord NoBarrier_CompareAndSwap(volatile AtomicWord* ptr,
57 reinterpret_cast<volatile Atomic32*>(ptr), old_value, new_value);
60 inline AtomicWord NoBarrier_AtomicExchange(volatile AtomicWord* ptr,
63 reinterpret_cast<volatile Atomic32*>(ptr), new_value);
66 inline AtomicWord NoBarrier_AtomicIncrement(volatile AtomicWord* ptr,
69 reinterpret_cast<volatile Atomic32*>(ptr), increment);
72 inline AtomicWord Barrier_AtomicIncrement(volatile AtomicWord* ptr,
75 reinterpret_cast<volatile Atomic32*>(ptr), increment);
78 inline AtomicWord Acquire_CompareAndSwap(volatile AtomicWord* ptr,
82 reinterpret_cast<volatile Atomic32*>(ptr), old_value, new_value)
    [all...]
atomicops_internals_generic_gcc.h 38 inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,
41 __atomic_compare_exchange_n(ptr, &old_value, new_value, true,
46 inline Atomic32 NoBarrier_AtomicExchange(volatile Atomic32* ptr,
48 return __atomic_exchange_n(ptr, new_value, __ATOMIC_RELAXED);
51 inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,
53 return __atomic_add_fetch(ptr, increment, __ATOMIC_RELAXED);
56 inline Atomic32 Barrier_AtomicIncrement(volatile Atomic32* ptr,
58 return __atomic_add_fetch(ptr, increment, __ATOMIC_SEQ_CST);
61 inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,
64 __atomic_compare_exchange_n(ptr, &old_value, new_value, true
    [all...]
  /prebuilts/tools/linux-x86_64/protoc/include/google/protobuf/stubs/
atomicops_internals_atomicword_compat.h 53 inline AtomicWord NoBarrier_CompareAndSwap(volatile AtomicWord* ptr,
57 reinterpret_cast<volatile Atomic32*>(ptr), old_value, new_value);
60 inline AtomicWord NoBarrier_AtomicExchange(volatile AtomicWord* ptr,
63 reinterpret_cast<volatile Atomic32*>(ptr), new_value);
66 inline AtomicWord NoBarrier_AtomicIncrement(volatile AtomicWord* ptr,
69 reinterpret_cast<volatile Atomic32*>(ptr), increment);
72 inline AtomicWord Barrier_AtomicIncrement(volatile AtomicWord* ptr,
75 reinterpret_cast<volatile Atomic32*>(ptr), increment);
78 inline AtomicWord Acquire_CompareAndSwap(volatile AtomicWord* ptr,
82 reinterpret_cast<volatile Atomic32*>(ptr), old_value, new_value)
    [all...]
atomicops_internals_pnacl.h 40 inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,
43 return __sync_val_compare_and_swap(ptr, old_value, new_value);
50 inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,
53 Atomic32 ret = NoBarrier_CompareAndSwap(ptr, old_value, new_value);
58 inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {
60 *ptr = value;
63 inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {
64 Atomic32 value = *ptr;
  /external/clang/test/Analysis/inlining/
eager-reclamation-path-notes.cpp 15 // In this case, we need the lvalue-to-rvalue cast for 'ptr' to disappear,
20 // we want to show that even if the node for the rvalue of 'ptr' disappears,
24 IntWrapper *ptr = getNullWrapper(); local
27 // expected-note@-3 {{'ptr' initialized to a null pointer value}}
33 return ptr->getValue(); // expected-warning {{Called C++ object pointer is null}}
270 // CHECK-NEXT: <string>&apos;ptr&apos; initialized to a null pointer value</string>
272 // CHECK-NEXT: <string>&apos;ptr&apos; initialized to a null pointer value</string>
  /external/clang/test/CodeGen/
2002-07-31-BadAssert.c 13 void denormalize(InternalFPF *ptr) {
14 SetInternalFPFZero(ptr);
  /external/clang/test/CodeGenCXX/
int64_uint64.cpp 20 void f3(int64_t *ptr) {}
23 void f4(uint64_t *ptr) {}
  /external/clang/test/PCH/
cxx-ms-function-specialization-class-scope.cpp 10 char* ptr; local
11 b.f(ptr);
  /external/clang/test/Sema/
conditional.c 5 void _efree(void *ptr);
6 void free(void *ptr);
  /external/eigen/failtest/
map_nonconst_ctor_on_const_ptr_0.cpp 11 void foo(CV_QUALIFIER float *ptr){
12 Map<Matrix3f> m(ptr);
map_on_const_type_actually_const_0.cpp 11 void foo(float *ptr){
12 Map<CV_QUALIFIER MatrixXf>(ptr, 1, 1).coeffRef(0,0) = 1.0f;
map_on_const_type_actually_const_1.cpp 11 void foo(float *ptr){
12 Map<CV_QUALIFIER Vector3f>(ptr).coeffRef(0) = 1.0f;
  /external/google-breakpad/src/processor/
linked_ptr.h 73 void join(linked_ptr_internal const* ptr) {
74 linked_ptr_internal const* p = ptr;
75 while (p->next_ != ptr) p = p->next_;
77 next_ = ptr;
101 explicit linked_ptr(T* ptr = NULL) { capture(ptr); }
105 template <typename U> linked_ptr(linked_ptr<U> const& ptr) { copy(&ptr); }
106 linked_ptr(linked_ptr const& ptr) { copy(&ptr); }
    [all...]
  /external/icu/icu4c/source/i18n/
sharedbreakiterator.cpp 19 BreakIterator *biToAdopt) : ptr(biToAdopt) { }
22 delete ptr;
  /external/libchrome/base/memory/
aligned_memory.cc 20 void* ptr = NULL; local
22 ptr = _aligned_malloc(size, alignment);
29 ptr = memalign(alignment, size);
31 if (posix_memalign(&ptr, alignment, size))
32 ptr = NULL;
37 if (!ptr) {
43 DCHECK_EQ(reinterpret_cast<uintptr_t>(ptr) & (alignment - 1), 0U);
44 return ptr;
linked_ptr.h 53 void join(linked_ptr_internal const* ptr) {
54 next_ = ptr->next_;
55 ptr->next_ = this;
81 explicit linked_ptr(T* ptr = NULL) { capture(ptr); }
85 template <typename U> linked_ptr(linked_ptr<U> const& ptr) { copy(&ptr); }
87 linked_ptr(linked_ptr const& ptr) {
88 DCHECK_NE(&ptr, this);
89 copy(&ptr);
    [all...]
  /external/protobuf/src/google/protobuf/stubs/
atomicops_internals_generic_gcc.h 38 inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,
41 __atomic_compare_exchange_n(ptr, &old_value, new_value, true,
46 inline Atomic32 NoBarrier_AtomicExchange(volatile Atomic32* ptr,
48 return __atomic_exchange_n(ptr, new_value, __ATOMIC_RELAXED);
51 inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,
53 return __atomic_add_fetch(ptr, increment, __ATOMIC_RELAXED);
56 inline Atomic32 Barrier_AtomicIncrement(volatile Atomic32* ptr,
58 return __atomic_add_fetch(ptr, increment, __ATOMIC_SEQ_CST);
61 inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,
64 __atomic_compare_exchange(ptr, &old_value, &new_value, true
    [all...]
atomicops_internals_pnacl.h 40 inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,
43 return __sync_val_compare_and_swap(ptr, old_value, new_value);
50 inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,
53 Atomic32 ret = NoBarrier_CompareAndSwap(ptr, old_value, new_value);
58 inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {
60 *ptr = value;
63 inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {
64 Atomic32 value = *ptr;
  /external/skia/src/svg/parser/
SkSVGGroup.cpp 18 for (SkSVGElement** ptr = fChildren.begin(); ptr < fChildren.end(); ptr++) {
19 SkSVGElement* result = (*ptr)->getGradient();
43 for (SkSVGElement** ptr = fChildren.begin(); ptr < fChildren.end(); ptr++)
44 parser.translate(*ptr, defState);
  /prebuilts/misc/darwin-x86_64/protobuf2.5/include/google/protobuf/stubs/
atomicops_internals_pnacl.h 40 inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,
43 return __sync_val_compare_and_swap(ptr, old_value, new_value);
50 inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,
53 Atomic32 ret = NoBarrier_CompareAndSwap(ptr, old_value, new_value);
58 inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {
60 *ptr = value;
63 inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {
64 Atomic32 value = *ptr;
  /prebuilts/misc/linux-x86_64/protobuf2.5/include/google/protobuf/stubs/
atomicops_internals_pnacl.h 40 inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,
43 return __sync_val_compare_and_swap(ptr, old_value, new_value);
50 inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,
53 Atomic32 ret = NoBarrier_CompareAndSwap(ptr, old_value, new_value);
58 inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {
60 *ptr = value;
63 inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {
64 Atomic32 value = *ptr;
  /prebuilts/misc/windows/protobuf2.5/include/google/protobuf/stubs/
atomicops_internals_pnacl.h 40 inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,
43 return __sync_val_compare_and_swap(ptr, old_value, new_value);
50 inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,
53 Atomic32 ret = NoBarrier_CompareAndSwap(ptr, old_value, new_value);
58 inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {
60 *ptr = value;
63 inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {
64 Atomic32 value = *ptr;
  /external/toybox/toys/other/
makedevs.c 56 char type=0, user[64], group[64], *node, *ptr = line; local
64 while (isspace(*ptr)) ptr++;
65 if (!*ptr || *ptr == '#') continue;
66 node = ptr;
68 while (*ptr && !isspace(*ptr)) ptr++;
69 if (*ptr) *(ptr++) = 0
    [all...]

Completed in 274 milliseconds

1 2 3 4 5 6 7 8 91011>>