HomeSort by relevance Sort by last modified time
    Searched defs:avail (Results 1 - 25 of 169) sorted by null

1 2 3 4 5 6 7

  /external/clang/test/CodeGen/
2002-12-15-StructParameters.c 7 unsigned avail; member in struct:__anon16947
  /external/u-boot/cmd/
trace.c 33 size_t buff_size, avail, buff_ptr, used; local
41 avail = buff_size - buff_ptr;
42 err = trace_list_functions(buff + buff_ptr, avail, &needed);
45 used = min(avail, (size_t)needed);
57 size_t buff_size, avail, buff_ptr, used; local
65 avail = buff_size - buff_ptr;
66 err = trace_list_calls(buff + buff_ptr, avail, &needed);
69 used = min(avail, (size_t)needed);
  /frameworks/av/media/libnbaio/
PipeReader.cpp 53 ssize_t avail = mFifoReader.available(&lost); local
54 if (avail == -EOVERFLOW || lost > 0) {
57 avail = OVERRUN;
59 return avail;
SourceAudioBufferProvider.cpp 111 ssize_t avail = mSource->availableToRead(); local
112 return avail < 0 ? 0 : (size_t) avail;
MonoPipe.cpp 93 ssize_t avail = mFifoWriter.available(); local
94 ALOG_ASSERT(avail <= mMaxFrames);
95 if (avail < 0) {
96 // don't return avail as status, because totalFramesWritten > 0
99 size_t filled = mMaxFrames - (size_t) avail;
  /external/clang/www/
make_cxx_dr_status 103 avail = 'Unknown'
106 avail = 'SVN'
109 avail = 'Clang %s' % status
112 avail = 'Yes'
115 avail = 'Partial'
118 avail = 'No'
121 avail = 'N/A'
125 avail = 'Superseded by <a href="#%s">%s</a>' % (dup, dup)
133 avail = 'Duplicate of <a href="#%s">%s</a>' % (dup, dup)
137 return (avail + avail_suffix, avail_style
147 avail = 'Not resolved' variable
    [all...]
  /external/drrickorang/LoopbackApp/app/src/main/java/org/drrickorang/loopback/
PipeShort.java 77 int avail = availableToRead(); local
78 if (avail <= 0) {
79 return avail;
84 if (count > avail) {
85 count = avail;
119 int avail = rear - mFront; local
120 if (avail > mMaxValues) {
129 return avail;
PipeByteBuffer.java 81 int avail = availableToRead(rear, mFront); local
82 if (avail <= 0) { //return -2 for overrun
83 return avail;
87 if (requiredSamples > avail) {
88 requiredSamples = avail;
129 int avail = rear - front; local
130 if (avail > mMaxValues) {
139 return avail;
146 int avail; local
151 avail = availableToRead(rear, mFront)
    [all...]
  /external/jemalloc_new/include/jemalloc/internal/
base_structs.h 49 extent_heap_t avail[NSIZES]; member in struct:base_s
cache_bin.h 61 * To make use of adjacent cacheline prefetch, the items in the avail
62 * stack goes to higher address for newer allocations. avail points
64 * avail[-ncached, ... -1] are available items and the lowest item will
67 void **avail; member in struct:cache_bin_s
102 * null stored on the avail stack (which is unknown to the compiler),
107 ret = *(bin->avail - bin->ncached);
  /external/skia/src/compute/skc/
suballocator.h 68 skc_subbuf_id_t * ids; // [<-AVAIL-><-empty-><-SPARE->]
71 skc_uint avail; member in struct:skc_suballocator::__anon38056
73 } rem; // inuse = count - (avail + spare)
suballocator.c 31 suballocator->rem.avail, \
40 suballocator->rem.avail, \
82 suballocator->rem.avail = 1;
143 skc_uint avail_rem = suballocator->rem.avail;
149 struct skc_subbuf * const avail = suballocator->subbufs + avail_id; local
151 assert(avail->inuse == 0);
153 if (avail->size == size_ru) // size matches exactly
163 avail->inuse += 1;
165 assert(avail->inuse == 1);
167 // update rem avail coun
    [all...]
  /external/skqp/src/compute/skc/
suballocator.h 68 skc_subbuf_id_t * ids; // [<-AVAIL-><-empty-><-SPARE->]
71 skc_uint avail; member in struct:skc_suballocator::__anon38859
73 } rem; // inuse = count - (avail + spare)
suballocator.c 31 suballocator->rem.avail, \
40 suballocator->rem.avail, \
82 suballocator->rem.avail = 1;
143 skc_uint avail_rem = suballocator->rem.avail;
149 struct skc_subbuf * const avail = suballocator->subbufs + avail_id; local
151 assert(avail->inuse == 0);
153 if (avail->size == size_ru) // size matches exactly
163 avail->inuse += 1;
165 assert(avail->inuse == 1);
167 // update rem avail coun
    [all...]
  /external/squashfs-tools/kernel/fs/squashfs/
block.c 89 int bytes, compressed, b = 0, k = 0, page = 0, avail; local
170 avail = min(bytes, msblk->devblksize - offset);
171 bytes -= avail;
176 if (avail == 0) {
183 msblk->stream.avail_in = avail;
247 avail = min_t(int, in, PAGE_CACHE_SIZE -
250 bh[k]->b_data + offset, avail);
251 in -= avail;
252 pg_offset += avail;
253 offset += avail;
    [all...]
  /external/lzma/CPP/7zip/Common/
CWrappers.cpp 179 UInt32 avail; local
181 Res = Stream->Read(Buf, Size, &avail);
183 Lim = Buf + avail;
184 if (avail != 0)
  /external/python/cpython2/Demo/tkinter/guido/
ManPage.py 64 def avail(fp=fp, tout=0.0, select=select): function in function:EditableManPage.syncparsefile
  /external/xz-java/src/org/tukaani/xz/lzma/
LZMAEncoderFast.java 60 int avail = Math.min(lz.getAvail(), MATCH_LEN_MAX); local
61 if (avail < MATCH_LEN_MIN)
68 int len = lz.getMatchLen(reps[rep], avail);
123 if (mainLen < MATCH_LEN_MIN || avail <= MATCH_LEN_MIN)
  /frameworks/av/media/bufferpool/1.0/
BufferStatus.cpp 77 size_t avail = it->second->availableToRead(); local
78 while (avail > 0) {
88 --avail;
111 size_t avail = mBufferStatusQueue->availableToWrite(); local
112 return avail + kMinElementsToSyncInQueue < kNumElementsInQueue;
121 size_t avail = mBufferStatusQueue->availableToWrite(); local
122 avail = std::min(avail, pending.size());
124 for (size_t i = 0 ; i < avail; ++i) {
147 size_t avail = mBufferStatusQueue->availableToWrite() local
    [all...]
  /bionic/libc/kernel/uapi/linux/
virtio_ring.h 60 struct vring_avail * avail; member in struct:vring
66 #define vring_used_event(vr) ((vr)->avail->ring[(vr)->num])
  /bionic/tools/versioner/src/
DeclarationDatabase.h 150 DeclarationAvailability avail; local
153 if (!calculateAvailability(&avail)) {
156 fprintf(out, "%s\n", to_string(avail).c_str());
  /cts/apps/CtsVerifier/src/com/android/cts/verifier/audio/wavelib/
PipeShort.java 69 int avail = rear - mFront; local
70 if (avail > mMaxValues) {
78 return avail;
88 int avail = availableToRead(); local
89 if (avail <= 0) {
90 return avail;
94 if (count > avail) {
95 count = avail;
  /device/generic/goldfish/libqemu/
test_guest_2.c 195 int avail = bufferSize - nn; local
197 if (avail > maxAvail)
198 avail = maxAvail;
200 if (memcmp(buffer+nn, buffer2+nn, avail) != 0) {
207 for (mm = 0; mm < avail; mm++)
214 for (mm = 0; mm < avail; mm++)
219 nn += avail;
  /external/adhd/cras/src/server/
cras_empty_iodev.c 121 unsigned int avail, current; local
124 avail = EMPTY_FRAMES - current_level(iodev);
125 *frames = MIN(*frames, avail);
test_iodev.c 125 unsigned int avail; local
132 write_ptr = buf_write_pointer_size(testio->audbuff, &avail);
133 avail = MIN(avail, *frames * testio->fmt_bytes);
134 nread = read(testio->fd, write_ptr, avail);
244 unsigned int avail; local
247 write_ptr = buf_write_pointer_size(testio->audbuff, &avail);
248 count = MIN(count, avail);

Completed in 957 milliseconds

1 2 3 4 5 6 7