HomeSort by relevance Sort by last modified time
    Searched refs:inUse (Results 1 - 25 of 40) sorted by null

1 2

  /external/qemu/distrib/sdl-1.2.12/src/audio/mme/
SDL_mmeaudio.c 32 static BOOL inUse[NUM_BUFFERS];
115 inUse[wp->dwUser] = FALSE;
192 inUse[i] = FALSE;
200 while ( inUse[next_buffer] ) {
210 inUse[next_buffer] = TRUE;
229 while ( inUse[i] ) {
  /dalvik/vm/compiler/codegen/
RallocUtil.cpp 50 cUnit->regPool->coreTemps[i].inUse = false;
53 cUnit->regPool->FPTemps[i].inUse = false;
63 regs[i].inUse = false;
77 p[i].reg, p[i].inUse, p[i].pair, p[i].partner, p[i].live,
203 if (!p[next].inUse && !p[next].live) {
205 p[next].inUse = true;
216 if (!p[next].inUse) {
218 p[next].inUse = true;
246 if ((!p[next].inUse && !p[next].live) &&
247 (!p[next+1].inUse && !p[next+1].live))
    [all...]
  /external/yaffs2/yaffs2/direct/
yaffsfs.c 44 __u8 inUse:1; // this handle is in use
63 yaffsfs_handle[i].inUse = 0;
83 if(h && h->inUse)
108 if(!h->inUse)
111 h->inUse=1;
127 h->inUse = 0;
383 yaffsfs_handle[i].inUse &&
445 h->inUse = 1;
451 obj->inUse++;
486 if(h && h->inUse)
    [all...]
  /external/valgrind/main/coregrind/
m_sparsewa.c 59 UChar inUse[256/8];
204 if (swa_bitarray_read(level0->inUse, curr_ix) == 1) {
304 if (swa_bitarray_read(level0->inUse, ix) == 0) return False;
355 if (swa_bitarray_read_then_set(level0->inUse, ix) == 0) {
403 if (swa_bitarray_read_then_clear(level0->inUse, ix) == 0)
451 UWord x = level0->inUse[i+0]; /* assume zero-extend */
452 UWord y = level0->inUse[i+1]; /* assume zero-extend */
m_transtab.c 110 enum { InUse, Deleted, Empty } status;
174 /* The count of tt entries with state InUse. */
487 if (tte->status != InUse)
488 BAD("tteno points to non-inuse tte");
530 vg_assert(tte->status == InUse);
557 case InUse: VG_(printf)("InUse\n"); break;
817 if (sec->tt[i].status == InUse) {
    [all...]
  /external/valgrind/main/helgrind/
hg_wordset.c 70 UWord inUse; /* 0 .. dynMax inclusive */
79 (_zzcache).inUse = 0; \
90 tl_assert(_cache->inUse >= 0); \
91 tl_assert(_cache->inUse <= _cache->dynMax); \
92 if (_cache->inUse > 0) { \
96 for (_i = 1; _i < _cache->inUse; _i++) { \
117 tl_assert(_cache->inUse >= 0); \
118 tl_assert(_cache->inUse <= _cache->dynMax); \
119 if (_cache->inUse < _cache->dynMax) \
120 _cache->inUse++;
    [all...]