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

1 2 3 4 5 6 7 8 91011>>

  /external/selinux/libsepol/tests/
debug.c 40 cond_expr_t *cur; local
41 for (cur = exp; cur != NULL; cur = cur->next) {
42 switch (cur->expr_type) {
44 fprintf(fp, "%s ", p->p_bool_val_to_name[cur->bool - 1]);
65 fprintf(fp, "error! (%d)", cur->expr_type);
  /ndk/tests/device/test-gnustl-full/unit/
strstream_buffer_read_test.cpp 31 char cur; local
32 stream >> cur; local
33 CPPUNIT_ASSERT(cur == 'H');
  /ndk/tests/device/test-stlport/unit/
strstream_buffer_read_test.cpp 31 char cur; local
32 stream >> cur; local
33 CPPUNIT_ASSERT(cur == 'H');
  /bionic/libc/upstream-netbsd/lib/libc/gen/
ftw.c 43 FTSENT *cur; local
57 while ((cur = fts_read(ftsp)) != NULL) {
58 switch (cur->fts_info) {
87 error = fn(cur->fts_path, cur->fts_statp, fnflag);
nftw.c 45 FTSENT *cur; local
67 while ((cur = fts_read(ftsp)) != NULL) {
68 switch (cur->fts_info) {
103 f.base = cur->fts_pathlen - cur->fts_namelen;
104 f.level = cur->fts_level;
105 error = fn(cur->fts_path, cur->fts_statp, fnflag, &f);
  /external/libcap-ng/libcap-ng-0.7/utils/
proc-llist.c 32 l->cur = NULL;
61 l->cur->next = newnode;
64 l->cur = newnode;
71 register lnode* cur; local
73 cur = l->head;
74 while (cur) {
75 nextnode=cur->next;
76 free(cur->cmd);
77 free(cur->capabilities);
78 free(cur->bounds)
89 register lnode* cur; local
    [all...]
proc-llist.h 47 lnode *cur; // Pointer to current node member in struct:__anon14222
52 static inline lnode *list_get_cur(llist *l) { return l->cur; }
  /external/strace/
affinity.c 37 unsigned long cur, abbrev_end; local
54 for (cur = addr; cur < end; cur += sizeof(w)) {
55 if (cur > addr)
57 if (cur >= abbrev_end) {
61 if (umove_or_printaddr(tcp, cur, &w))
epoll.c 95 struct epoll_event ev, *start, *cur, *end; local
110 for (cur = start + 1; cur < end; ++cur) {
112 if (umove_or_printaddr(tcp, (long) cur, &ev))
  /dalvik/libdex/
Leb128.h 36 int cur = *(ptr++); local
37 result = (result & 0x7f) | ((cur & 0x7f) << 7);
38 if (cur > 0x7f) {
39 cur = *(ptr++);
40 result |= (cur & 0x7f) << 14;
41 if (cur > 0x7f) {
42 cur = *(ptr++);
43 result |= (cur & 0x7f) << 21;
44 if (cur > 0x7f) {
46 * Note: We don't check to see if cur is out o
73 int cur = *(ptr++); local
    [all...]
  /external/compiler-rt/lib/sanitizer_common/
sanitizer_atomic_clang_other.h 85 typename T::Type cur; local
87 cur = __sync_val_compare_and_swap(&a->val_dont_use, cmp, v);
90 cmp = cur;
sanitizer_lfstack.h 51 T *cur = (T*)(uptr)(cmp & kPtrMask); local
52 if (!cur)
54 T *nxt = cur->next;
59 return cur;
  /external/lzma/C/
Bra86.c 52 UInt32 cur = ip + (UInt32)pos; local
55 v += cur;
57 v -= cur;
65 v += cur;
67 v -= cur;
  /frameworks/compile/mclinker/lib/MC/
AttributeSet.cpp 26 iterator cur = m_AttrSet.begin(); local
29 while (cur != aEnd) {
30 delete (*cur);
31 ++cur;
39 const_iterator cur = m_AttrSet.begin();
41 while (cur != aEnd) {
42 if (*(*cur) == pAttr) {
43 return *cur;
45 ++cur;
  /bionic/libc/upstream-openbsd/lib/libc/net/
inet_ntop.c 105 struct { int base, len; } best, cur; local
119 cur.base = -1;
122 if (cur.base == -1)
123 cur.base = i, cur.len = 1;
125 cur.len++;
127 if (cur.base != -1) {
128 if (best.base == -1 || cur.len > best.len)
129 best = cur;
130 cur.base = -1
    [all...]
  /cts/tests/tests/view/src/android/view/cts/
SearchEventTest.java 40 long cur = System.currentTimeMillis(); local
42 while (!mActivity.hasWindowFocus() && (cur - start) < timeout) {
  /external/autotest/frontend/
make_superuser.py 22 cur = con.cursor() variable
25 cur.execute("""
29 row = cur.fetchone()
33 cur.execute("""
39 cur.execute("""
43 if (cur.rowcount == 1):
48 cur.close()
  /external/boringssl/src/crypto/bio/
socket_helper.c 43 struct addrinfo hint, *result, *cur; local
61 for (cur = result; cur; cur = cur->ai_next) {
62 if ((size_t) cur->ai_addrlen > sizeof(struct sockaddr_storage)) {
66 memcpy(out_addr, cur->ai_addr, cur->ai_addrlen);
67 *out_addr_length = cur->ai_addrlen;
69 *out_sock = socket(cur->ai_family, cur->ai_socktype, cur->ai_protocol)
    [all...]
  /external/c-ares/
inet_ntop.c 129 struct { int base, len; } best, cur; local
143 cur.base = -1;
144 cur.len = 0;
147 if (cur.base == -1)
148 cur.base = i, cur.len = 1;
150 cur.len++;
152 if (cur.base != -1) {
153 if (best.base == -1 || cur.len > best.len)
154 best = cur;
    [all...]
  /external/compiler-rt/test/msan/
chained_origin_limits.cc 70 static char *buf, *cur, *end; variable
78 cur = buf;
84 for (p = cur - 1; p >= buf; --p)
91 cur -= write_sz;
97 size_t copy_sz = end - cur;
99 memcpy(cur, p, copy_sz);
100 cur += copy_sz;
  /external/curl/lib/
inet_ntop.c 91 } best, cur; local
104 cur.base = -1;
106 cur.len = 0;
110 if(cur.base == -1)
111 cur.base = i, cur.len = 1;
113 cur.len++;
115 else if(cur.base != -1) {
116 if(best.base == -1 || cur.len > best.len)
117 best = cur;
    [all...]
  /external/fio/lib/
flist_sort.c 115 struct flist_head *cur = list; local
117 cur->next = NULL;
120 cur = merge(priv, cmp, part[lev], cur);
132 part[lev] = cur;
  /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/base/
ftinit.c 201 const FT_Module_Class* const* cur; local
213 cur = (const FT_Module_Class* const*)FT_DEFAULT_MODULES_GET;
216 while ( *cur )
218 error = FT_Add_Module( library, *cur );
223 (*cur)->module_name, error ));
224 cur++;
  /external/libxml2/doc/examples/
io1.c 23 static const char *cur = NULL; variable
54 cur = result;
56 return((void *) cur);
70 cur = NULL;
xpath1.c 206 xmlNodePtr cur; local
221 cur = (xmlNodePtr)ns->next;
222 if(cur->ns) {
224 ns->prefix, ns->href, cur->ns->href, cur->name);
227 ns->prefix, ns->href, cur->name);
230 cur = nodes->nodeTab[i];
231 if(cur->ns) {
233 cur->ns->href, cur->name)
    [all...]

Completed in 1006 milliseconds

1 2 3 4 5 6 7 8 91011>>