Searched refs:vector (Results 1 - 7 of 7) sorted by relevance

/system/core/libpixelflinger/tinyutils/
H A DVectorImpl.cpp110 ssize_t VectorImpl::insertVectorAt(const VectorImpl& vector, size_t index) argument
114 void* where = _grow(index, vector.size());
116 _do_copy(where, vector.arrayImpl(), vector.size());
121 ssize_t VectorImpl::appendVector(const VectorImpl& vector) argument
123 return insertVectorAt(vector, size());
284 // ALOGV("grow vector %p, new_capacity=%d", this, (int)new_capacity);
337 // ALOGV("shrink vector %p, new_capacity=%d", this, (int)new_capacity);
495 ssize_t SortedVectorImpl::merge(const VectorImpl& vector)
498 if (!vector
[all...]
H A DVectorImpl.h23 * Implementation of the guts of the vector<> class
54 /*! vector stats */
60 /*! append/insert another vector */
61 ssize_t insertVectorAt(const VectorImpl& vector, size_t index);
62 ssize_t appendVector(const VectorImpl& vector);
116 void * mStorage; // base address of the vector
143 //! merges a vector into this one
144 ssize_t merge(const VectorImpl& vector);
145 ssize_t merge(const SortedVectorImpl& vector);
172 ssize_t insertVectorAt(const VectorImpl& vector, size_
[all...]
H A DSortedVector.h51 * empty the vector
57 * vector stats
60 //! returns number of items in the vector
62 //! returns wether or not the vector is empty
95 //! stack-usage of the vector. returns the top of the stack (last element)
97 //! same as operator [], but allows to access the vector backward (from the end) with a negative index
112 //! merges a vector into this one
113 ssize_t merge(const Vector<TYPE>& vector);
114 ssize_t merge(const SortedVector<TYPE>& vector);
221 ssize_t SortedVector<TYPE>::merge(const Vector<TYPE>& vector) {
[all...]
H A DVector.h2 * vector.h
27 * The main templated vector class ensuring type safety
51 * empty the vector
57 * vector stats
60 //! returns number of items in the vector
62 //! returns wether or not the vector is empty
86 //! stack-usage of the vector. returns the top of the stack (last element)
88 //! same as operator [], but allows to access the vector backward (from the end) with a negative index
101 * append/insert another vector
104 //! insert another vector a
247 insertVectorAt(const Vector<TYPE>& vector, size_t index) argument
252 appendVector(const Vector<TYPE>& vector) argument
[all...]
/system/core/liblog/
H A Dfake_log_device.c536 * Receive a log message. We happen to know that "vector" has three parts:
542 static ssize_t logWritev(int fd, const struct iovec* vector, int count) argument
570 int logPrio = *(const char*)vector[0].iov_base;
571 const char* tag = (const char*) vector[1].iov_base;
572 const char* msg = (const char*) vector[2].iov_base;
596 return vector[0].iov_len + vector[1].iov_len + vector[2].iov_len;
643 static ssize_t (*redirectWritev)(int fd, const struct iovec* vector, int count)
681 ssize_t fakeLogWritev(int fd, const struct iovec* vector, in argument
[all...]
H A Dlogd_write.c37 #define log_writev(filedes, vector, count) fakeLogWritev(filedes, vector, count)
41 #define log_writev(filedes, vector, count) writev(filedes, vector, count)
/system/security/keystore/
H A Dkeystore.cpp282 uint8_t vector[AES_BLOCK_SIZE]; member in struct:blob
350 if (!entropy->generate_random_data(mBlob.vector, AES_BLOCK_SIZE)) {
369 uint8_t vector[AES_BLOCK_SIZE]; local
370 memcpy(vector, mBlob.vector, AES_BLOCK_SIZE);
372 aes_key, vector, AES_ENCRYPT);
416 mBlob.vector, AES_DECRYPT);

Completed in 3232 milliseconds