Searched defs:empty (Results 1 - 5 of 5) sorted by relevance
/bionic/libc/upstream-openbsd/lib/libc/stdio/ |
H A D | findfp.c | 78 static FILE empty; local 93 *p = empty;
|
/bionic/tests/ |
H A D | fortify_test.cpp | 53 char empty[0]; member in struct:foo 193 ASSERT_EXIT(stpcpy(myfoo.empty, src), 211 ASSERT_EXIT(strcpy(myfoo.empty, src), 229 ASSERT_EXIT(strcpy(myfoo.empty, src),
|
/bionic/libc/upstream-netbsd/lib/libc/regex/ |
H A D | engine.c | 120 states empty; /* empty set of states */ member in struct:match 234 SETUP(m->empty); 235 CLEAR(m->empty); 875 states empty = m->empty; local 935 if (EQ(st, empty) || p == stop) 940 ASSIGN(st, empty); 1025 case OPLUS_: /* forward, this is just an empty */ 1042 case O_QUEST: /* just an empty */ [all...] |
/bionic/libc/kernel/uapi/sound/ |
H A D | asound.h | 331 empty:1; member in struct:snd_interval
|
/bionic/libc/upstream-dlmalloc/ |
H A D | malloc.c | 2522 treebins ("treemap). Each bin sets its bit when non-empty, and 2523 clears the bit when empty. Bit operations are then used to avoid 3369 int empty = (m->treemap & (1U << i)) == 0; local 3371 assert(empty); 3372 if (!empty) 3380 unsigned int empty = (m->smallmap & (1U << i)) == 0; local 3382 assert(empty); 3383 if (!empty) { 4485 if (t == 0 && v == 0) { /* set t to root of next non-empty treebin */ 4606 idx += ~smallbits & 1; /* Uses next bin if idx empty */ [all...] |
Completed in 264 milliseconds