/third_party/vk-gl-cts/scripts/opengl/ |
H A D | gen_call_log_wrapper.py | 35 def pointer (size): function 90 "glDeleteBuffers": LogSpec({1: pointer(size = "n")}), 91 "glDeleteFramebuffers": LogSpec({1: pointer(size = "n")}), 92 "glDeleteQueries": LogSpec({1: pointer(size = "n")}), 93 "glDeleteRenderbuffers": LogSpec({1: pointer(size = "n")}), 94 "glDeleteBuffers": LogSpec({1: pointer(size = "n")}), 95 "glDeleteTextures": LogSpec({1: pointer(size = "n")}), 96 "glDeleteVertexArrays": LogSpec({1: pointer(size = "n")}), 97 "glDeleteProgramPipelines": LogSpec({1: pointer(size = "n")}), 124 "glGenBuffers": LogSpec({}, argOutPrints = {1: pointer(siz [all...] |
/third_party/mbedtls/tests/include/test/ |
H A D | macros.h | 107 * You must set \p pointer to \c NULL before calling this macro and 108 * put `mbedtls_free(pointer)` in the test's cleanup code. 110 * If \p item_count is zero, the resulting \p pointer will be \c NULL. 117 * \param pointer An lvalue where the address of the allocated buffer 124 #define TEST_CALLOC(pointer, item_count) \ 126 TEST_ASSERT((pointer) == NULL); \ 128 (pointer) = mbedtls_calloc((item_count), \ 129 sizeof(*(pointer))); \ 130 TEST_ASSERT((pointer) != NULL); \ 137 * You must set \p pointer t [all...] |
/third_party/python/Lib/idlelib/ |
H A D | history.py | 20 .pointer - index into history. 26 self.pointer = None 44 Set prefix and pointer as needed for successive fetches. 50 pointer = self.pointer 52 if pointer is not None and prefix is not None: 54 self.text.get("iomark", "end-1c") != self.history[pointer]: 55 pointer = prefix = None 57 if pointer is None or prefix is None: 60 pointer [all...] |
H A D | undo.py | 42 pprint(self.undolist[:self.pointer]) 43 print("pointer:", self.pointer, end=' ') 47 pprint(self.undolist[self.pointer:]) 52 self.pointer = 0 59 self.saved = self.pointer 66 return self.saved == self.pointer 122 if self.can_merge and self.pointer > 0: 123 lastcmd = self.undolist[self.pointer-1] 126 self.undolist[self.pointer [all...] |
/third_party/mesa3d/src/glx/ |
H A D | vertarr.c | 40 * \name Vertex array pointer bridge functions 51 GLsizei count, const GLvoid * pointer) in __indirect_glColorPointerEXT() 54 __indirect_glColorPointer(size, type, stride, pointer); in __indirect_glColorPointerEXT() 59 GLsizei count, const GLboolean * pointer) in __indirect_glEdgeFlagPointerEXT() 62 __indirect_glEdgeFlagPointer(stride, pointer); in __indirect_glEdgeFlagPointerEXT() 67 GLsizei count, const GLvoid * pointer) in __indirect_glIndexPointerEXT() 70 __indirect_glIndexPointer(type, stride, pointer); in __indirect_glIndexPointerEXT() 75 const GLvoid * pointer) in __indirect_glNormalPointerEXT() 78 __indirect_glNormalPointer(type, stride, pointer); in __indirect_glNormalPointerEXT() 83 GLsizei count, const GLvoid * pointer) in __indirect_glTexCoordPointerEXT() 50 __indirect_glColorPointerEXT(GLint size, GLenum type, GLsizei stride, GLsizei count, const GLvoid * pointer) __indirect_glColorPointerEXT() argument 58 __indirect_glEdgeFlagPointerEXT(GLsizei stride, GLsizei count, const GLboolean * pointer) __indirect_glEdgeFlagPointerEXT() argument 66 __indirect_glIndexPointerEXT(GLenum type, GLsizei stride, GLsizei count, const GLvoid * pointer) __indirect_glIndexPointerEXT() argument 74 __indirect_glNormalPointerEXT(GLenum type, GLsizei stride, GLsizei count, const GLvoid * pointer) __indirect_glNormalPointerEXT() argument 82 __indirect_glTexCoordPointerEXT(GLint size, GLenum type, GLsizei stride, GLsizei count, const GLvoid * pointer) __indirect_glTexCoordPointerEXT() argument 90 __indirect_glVertexPointerEXT(GLint size, GLenum type, GLsizei stride, GLsizei count, const GLvoid * pointer) __indirect_glVertexPointerEXT() argument 102 __indirect_glInterleavedArrays(GLenum format, GLsizei stride, const GLvoid * pointer) __indirect_glInterleavedArrays() argument [all...] |
/third_party/cJSON/tests/ |
H A D | old_utils_tests.c | 99 char *pointer = NULL; in misc_tests() local 107 pointer = cJSONUtils_FindPointerFromObjectTo(object, num6); in misc_tests() 108 TEST_ASSERT_EQUAL_STRING("/numbers/6", pointer); in misc_tests() 109 free(pointer); in misc_tests() 111 pointer = cJSONUtils_FindPointerFromObjectTo(object, nums); in misc_tests() 112 TEST_ASSERT_EQUAL_STRING("/numbers", pointer); in misc_tests() 113 free(pointer); in misc_tests() 115 pointer = cJSONUtils_FindPointerFromObjectTo(object, object); in misc_tests() 116 TEST_ASSERT_EQUAL_STRING("", pointer); in misc_tests() 117 free(pointer); in misc_tests() [all...] |
/third_party/icu/icu4c/source/common/ |
H A D | uhash.cpp | 46 * returns a pointer to that slot. If the table is full, and no match 120 /* This macro expects a UHashTok.pointer as its keypointer and 133 * or a pointer. If a hint bit is zero, then the associated 151 if (hash->keyDeleter != NULL && e->key.pointer != NULL && in _uhash_setElement() 152 e->key.pointer != key.pointer) { /* Avoid double deletion */ in _uhash_setElement() 153 (*hash->keyDeleter)(e->key.pointer); in _uhash_setElement() 156 if (oldValue.pointer != NULL && in _uhash_setElement() 157 oldValue.pointer != value.pointer) { /* Avoi in _uhash_setElement() [all...] |
H A D | uvector.cpp | 24 * or a pointer. If a hint bit is zero, then the associated 78 if (elements[i].pointer != nullptr && deleter != nullptr) { in assign() 79 (*deleter)(elements[i].pointer); in assign() 105 elements[count++].pointer = obj; in addElement() 112 elements[count++].pointer = obj; in adoptElement() 120 elements[count].pointer = nullptr; // Pointers may be bigger than ints. in addElement() 128 if (elements[index].pointer != nullptr && deleter != nullptr) { in setElementAt() 129 (*deleter)(elements[index].pointer); in setElementAt() 131 elements[index].pointer = obj; in setElementAt() 143 elements[index].pointer in setElementAt() [all...] |
H A D | ulist.cpp | 159 const UListNode *pointer; in ulist_containsString() local 160 for (pointer = list->head; pointer != NULL; pointer = pointer->next) { in ulist_containsString() 161 if (length == (int32_t)uprv_strlen((const char *)pointer->data)) { in ulist_containsString() 162 if (uprv_memcmp(data, pointer->data, length) == 0) { in ulist_containsString() 173 UListNode *pointer; in ulist_removeString() local 174 for (pointer = list->head; pointer ! in ulist_removeString() [all...] |
/third_party/node/deps/icu-small/source/common/ |
H A D | uhash.cpp | 46 * returns a pointer to that slot. If the table is full, and no match 120 /* This macro expects a UHashTok.pointer as its keypointer and 133 * or a pointer. If a hint bit is zero, then the associated 151 if (hash->keyDeleter != nullptr && e->key.pointer != nullptr && in _uhash_setElement() 152 e->key.pointer != key.pointer) { /* Avoid double deletion */ in _uhash_setElement() 153 (*hash->keyDeleter)(e->key.pointer); in _uhash_setElement() 156 if (oldValue.pointer != nullptr && in _uhash_setElement() 157 oldValue.pointer != value.pointer) { /* Avoi in _uhash_setElement() [all...] |
H A D | uvector.cpp | 24 * or a pointer. If a hint bit is zero, then the associated 78 if (elements[i].pointer != nullptr && deleter != nullptr) { in assign() 79 (*deleter)(elements[i].pointer); in assign() 105 elements[count++].pointer = obj; in addElement() 112 elements[count++].pointer = obj; in adoptElement() 120 elements[count].pointer = nullptr; // Pointers may be bigger than ints. in addElement() 128 if (elements[index].pointer != nullptr && deleter != nullptr) { in setElementAt() 129 (*deleter)(elements[index].pointer); in setElementAt() 131 elements[index].pointer = obj; in setElementAt() 143 elements[index].pointer in setElementAt() [all...] |
H A D | ulist.cpp | 159 const UListNode *pointer; in ulist_containsString() local 160 for (pointer = list->head; pointer != nullptr; pointer = pointer->next) { in ulist_containsString() 161 if (length == (int32_t)uprv_strlen((const char *)pointer->data)) { in ulist_containsString() 162 if (uprv_memcmp(data, pointer->data, length) == 0) { in ulist_containsString() 173 UListNode *pointer; in ulist_removeString() local 174 for (pointer = list->head; pointer ! in ulist_removeString() [all...] |
/third_party/skia/third_party/externals/icu/source/common/ |
H A D | uhash.cpp | 46 * returns a pointer to that slot. If the table is full, and no match 120 /* This macro expects a UHashTok.pointer as its keypointer and 133 * or a pointer. If a hint bit is zero, then the associated 151 if (hash->keyDeleter != NULL && e->key.pointer != NULL && in _uhash_setElement() 152 e->key.pointer != key.pointer) { /* Avoid double deletion */ in _uhash_setElement() 153 (*hash->keyDeleter)(e->key.pointer); in _uhash_setElement() 156 if (oldValue.pointer != NULL && in _uhash_setElement() 157 oldValue.pointer != value.pointer) { /* Avoi in _uhash_setElement() [all...] |
H A D | uvector.cpp | 24 * or a pointer. If a hint bit is zero, then the associated 103 if (elements[i].pointer != 0 && deleter != 0) { in assign() 104 (*deleter)(elements[i].pointer); in assign() 129 elements[count++].pointer = obj; in addElement() 135 elements[count].pointer = NULL; // Pointers may be bigger than ints. in addElement() 143 if (elements[index].pointer != 0 && deleter != 0) { in setElementAt() 144 (*deleter)(elements[index].pointer); in setElementAt() 146 elements[index].pointer = obj; in setElementAt() 153 if (elements[index].pointer != 0 && deleter != 0) { in setElementAt() 155 (*deleter)(elements[index].pointer); in setElementAt() [all...] |
H A D | ulist.cpp | 159 const UListNode *pointer; in ulist_containsString() local 160 for (pointer = list->head; pointer != NULL; pointer = pointer->next) { in ulist_containsString() 161 if (length == (int32_t)uprv_strlen((const char *)pointer->data)) { in ulist_containsString() 162 if (uprv_memcmp(data, pointer->data, length) == 0) { in ulist_containsString() 173 UListNode *pointer; in ulist_removeString() local 174 for (pointer = list->head; pointer ! in ulist_removeString() [all...] |
/third_party/gn/src/base/ |
H A D | value_iterators.cc | 16 dict_iterator::pointer::pointer(const reference& ref) : ref_(ref) {} in pointer() function in base::detail::dict_iterator::pointer 18 dict_iterator::pointer::pointer(const pointer& ptr) = default; 34 dict_iterator::pointer dict_iterator::operator->() { in operator ->() 35 return pointer(operator*()); in operator ->() 71 const_dict_iterator::pointer::pointer(const reference& ref) : ref_(ref) {} in pointer() function in base::detail::const_dict_iterator::pointer 73 const_dict_iterator::pointer [all...] |
H A D | value_iterators.h | 34 class pointer { class in base::detail::dict_iterator 36 explicit pointer(const reference& ref); 37 pointer(const pointer& ptr); 38 pointer& operator=(const pointer& ptr) = delete; 52 pointer operator->(); 78 class pointer { class in base::detail::const_dict_iterator 80 explicit pointer(const reference& ref); 81 pointer(cons [all...] |
/third_party/python/Objects/ |
H A D | capsule.c | 8 void *pointer; member 19 if (!capsule || !PyCapsule_CheckExact(capsule) || capsule->pointer == NULL) { in _is_legal_capsule() 44 PyCapsule_New(void *pointer, const char *name, PyCapsule_Destructor destructor) in PyCapsule_New() argument 48 if (!pointer) { in PyCapsule_New() 49 PyErr_SetString(PyExc_ValueError, "PyCapsule_New called with null pointer"); in PyCapsule_New() 58 capsule->pointer = pointer; in PyCapsule_New() 74 capsule->pointer != NULL && in PyCapsule_IsValid() 93 return capsule->pointer; in PyCapsule_GetPointer() 134 PyCapsule_SetPointer(PyObject *o, void *pointer) in PyCapsule_SetPointer() argument [all...] |
/third_party/skia/third_party/externals/brotli/java/org/brotli/enc/ |
H A D | PreparedDictionaryGenerator.java | 131 ByteBuffer pointer = flat.slice(); in generate() 132 pointer.order(ByteOrder.nativeOrder()); in generate() 134 IntBuffer struct = pointer.asIntBuffer(); in generate() 135 pointer.position(pointer.position() + part0); in generate() 136 IntBuffer slotOffsets = pointer.asIntBuffer(); in generate() 137 pointer.position(pointer.position() + part1); in generate() 138 ShortBuffer heads = pointer.asShortBuffer(); in generate() 139 pointer in generate() [all...] |
/third_party/skia/third_party/externals/angle2/src/compiler/translator/ |
H A D | PoolAlloc.h | 45 typedef T *pointer; typedef in pool_allocator 56 pointer address(reference x) const { return &x; } in address() 79 pointer allocate(size_type n) in allocate() 81 return static_cast<pointer>(getAllocator().allocate(n * sizeof(T))); in allocate() 83 pointer allocate(size_type n, const void *) in allocate() 85 return static_cast<pointer>(getAllocator().allocate(n * sizeof(T))); in allocate() 87 void deallocate(pointer, size_type) {} in deallocate() 90 void construct(pointer p, const T &val) { new ((void *)p) T(val); } in construct() 91 void destroy(pointer p) { p->T::~T(); } in destroy()
|
/third_party/PyYAML/lib/yaml/ |
H A D | reader.py | 65 self.pointer = 0 89 return self.buffer[self.pointer+index] 92 return self.buffer[self.pointer+index] 95 if self.pointer+length >= len(self.buffer): 97 return self.buffer[self.pointer:self.pointer+length] 100 if self.pointer+length+1 >= len(self.buffer): 103 ch = self.buffer[self.pointer] 104 self.pointer += 1 107 or (ch == '\r' and self.buffer[self.pointer] ! [all...] |
/third_party/cJSON/ |
H A D | cJSON_Utils.c | 120 static cJSON_bool compare_pointers(const unsigned char *name, const unsigned char *pointer, const cJSON_bool case_sensitive) in compare_pointers() argument 122 if ((name == NULL) || (pointer == NULL)) in compare_pointers() 127 for (; (*name != '\0') && (*pointer != '\0') && (*pointer != '/'); (void)name++, pointer++) /* compare until next '/' */ in compare_pointers() 129 if (*pointer == '~') in compare_pointers() 132 if (((pointer[1] != '0') || (*name != '~')) && ((pointer[1] != '1') || (*name != '/'))) in compare_pointers() 139 pointer++; in compare_pointers() 142 else if ((!case_sensitive && (tolower(*name) != tolower(*pointer))) || (case_sensitiv in compare_pointers() 274 decode_array_index_from_pointer(const unsigned char * const pointer, size_t * const index) decode_array_index_from_pointer() argument 301 get_item_from_pointer(cJSON * const object, const char * pointer, const cJSON_bool case_sensitive) get_item_from_pointer() argument 348 cJSONUtils_GetPointer(cJSON * const object, const char *pointer) cJSONUtils_GetPointer() argument 353 cJSONUtils_GetPointerCaseSensitive(cJSON * const object, const char *pointer) cJSONUtils_GetPointerCaseSensitive() argument [all...] |
/third_party/node/deps/v8/src/sandbox/ |
H A D | sandboxed-pointer-inl.h | 11 #include "src/sandbox/sandboxed-pointer.h" 23 Address pointer = cage_base.address() + offset; in ReadSandboxedPointerField() local 24 return pointer; in ReadSandboxedPointerField() 32 Address pointer) { in WriteSandboxedPointerField() 34 // The pointer must point into the sandbox. in WriteSandboxedPointerField() 35 CHECK(GetProcessWideSandbox()->Contains(pointer)); in WriteSandboxedPointerField() 37 Address offset = pointer - cage_base.address(); in WriteSandboxedPointerField() 42 WriteMaybeUnalignedValue<Address>(field_address, pointer); in WriteSandboxedPointerField() 30 WriteSandboxedPointerField(Address field_address, PtrComprCageBase cage_base, Address pointer) WriteSandboxedPointerField() argument
|
/third_party/vk-gl-cts/framework/opengl/ |
H A D | gluDrawUtil.cpp | 49 const void* pointer; //!< Pointer or offset. member 64 , pointer (pointer_) in VertexAttributeDescriptor() 75 , pointer (0) in VertexAttributeDescriptor() 232 *out = VertexArrayBinding(BindingPoint(location + binding.location), cur->pointer); in namedBindingsToProgramLocations() 246 static deUint32 getMinimumAlignment (const VertexArrayPointer& pointer) in getMinimumAlignment() argument 249 DE_UNREF(pointer); in getMinimumAlignment() 277 const int offset = deAlign32(layout.size, getMinimumAlignment(va.pointer)); in appendAttributeNonStrided() 278 const int elementSize = getVtxCompSize(va.pointer.componentType)*va.pointer.numComponents; in appendAttributeNonStrided() 279 const int size = elementSize*va.pointer in appendAttributeNonStrided() [all...] |
/third_party/glslang/glslang/Include/ |
H A D | PoolAlloc.h | 180 // available, otherwise a properly aligned pointer to 'numBytes' of memory. 273 typedef T *pointer; typedef in glslang::pool_allocator 282 pointer address(reference x) const { return &x; } in address() 292 pointer allocate(size_type n) { in allocate() 293 return reinterpret_cast<pointer>(getAllocator().allocate(n * sizeof(T))); } in allocate() 294 pointer allocate(size_type n, const void*) { in allocate() 295 return reinterpret_cast<pointer>(getAllocator().allocate(n * sizeof(T))); } in allocate() 298 void deallocate(pointer, size_type) { } in deallocate() 300 pointer _Charalloc(size_t n) { in _Charalloc() 301 return reinterpret_cast<pointer>(getAllocato in _Charalloc() [all...] |