Searched defs:cur (Results 1 - 25 of 380) sorted by relevance

1234567891011>>

/external/libcap-ng/libcap-ng-0.7/utils/
H A Dproc-llist.c32 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
89 register lnode* cur; local
[all...]
H A Dproc-llist.h47 lnode *cur; // Pointer to current node member in struct:__anon8957
52 static inline lnode *list_get_cur(llist *l) { return l->cur; }
/external/selinux/libsepol/tests/
H A Ddebug.c40 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);
/external/strace/
H A Daffinity.c37 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))
H A Depoll.c95 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))
H A Dio.c68 unsigned long size, cur, end, abbrev_end; local
90 for (cur = addr; cur < end; cur += sizeof_iov) {
91 if (cur > addr)
93 if (cur >= abbrev_end) {
97 if (umove_ulong_array_or_printaddr(tcp, cur, iov,
/external/autotest/frontend/
H A Dmake_superuser.py22 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/c-ares/
H A Dinet_ntop.c129 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/lib/sanitizer_common/
H A Dsanitizer_atomic_clang_other.h85 typename T::Type cur; local
87 cur = __sync_val_compare_and_swap(&a->val_dont_use, cmp, v);
90 cmp = cur;
H A Dsanitizer_lfstack.h51 T *cur = (T*)(uptr)(cmp & kPtrMask); local
52 if (!cur)
54 T *nxt = cur->next;
59 return cur;
/external/compiler-rt/test/msan/
H A Dchained_origin_limits.cc70 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/fio/lib/
H A Dflist_sort.c115 struct flist_head *cur = list; local
117 cur->next = NULL;
120 cur = merge(priv, cmp, part[lev], cur);
132 part[lev] = cur;
/external/freetype/src/base/
H A Dftinit.c201 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/
H A Dio1.c23 static const char *cur = NULL; variable
54 cur = result;
56 return((void *) cur);
70 cur = NULL;
/external/lzma/C/
H A DBra86.c52 UInt32 cur = ip + (UInt32)pos; local
55 v += cur;
57 v -= cur;
65 v += cur;
67 v -= cur;
/external/pdfium/third_party/freetype/src/base/
H A Dftinit.c201 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/boringssl/src/crypto/bio/
H A Dsocket_helper.c43 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
[all...]
/external/curl/lib/
H A Dinet_ntop.c92 } best, cur; local
105 cur.base = -1;
107 cur.len = 0;
111 if(cur.base == -1)
112 cur.base = i, cur.len = 1;
114 cur.len++;
116 else if(cur.base != -1) {
117 if(best.base == -1 || cur.len > best.len)
118 best = cur;
[all...]
/external/lzma/CPP/7zip/Common/
H A DInOutTempBuffer.cpp63 UInt32 cur = MyMin(kTempBufSize - _bufPos, size); local
64 memcpy(_buf + _bufPos, data, cur);
65 _crc = CrcUpdate(_crc, data, cur);
66 _bufPos += cur;
67 size -= cur;
68 data = ((const Byte *)data) + cur;
69 _size += cur;
/external/opencv/cvaux/src/
H A Dextendededges.cpp143 CvPoint cur; local
145 CV_READ_SEQ_ELEM( cur, reader );
148 ((uchar*)image->imageData)[image->widthStep * cur.y + cur.x]++;
149 assert( ((uchar*)image->imageData)[image->widthStep * cur.y + cur.x] != 255 );
156 CvPoint cur; local
158 CV_READ_SEQ_ELEM( cur, reader );
161 uchar flag = image->imageData[image->widthStep * cur.y + cur
[all...]
/external/pdfium/third_party/freetype/src/cid/
H A Dcidparse.c58 FT_Byte *cur, *limit; local
166 cur = parser->root.cursor;
168 while ( cur < limit )
176 if ( cur[0] == 'S' && ft_strncmp( (char*)cur, "StartData", 9 ) == 0 )
194 else if ( cur[1] == 's' && ft_strncmp( (char*)cur, "/sfnts", 6 ) == 0 )
204 arg2 = cur;
205 cur = parser->root.cursor;
/external/pdfium/third_party/freetype/src/type1/
H A Dt1parse.c335 FT_Byte* cur = parser->base_dict; local
336 FT_Byte* limit = cur + parser->base_len;
344 if ( cur[0] == 'e' &&
345 cur + 9 < limit ) /* 9 = 5 letters for `eexec' + */
348 if ( cur[1] == 'e' &&
349 cur[2] == 'x' &&
350 cur[3] == 'e' &&
351 cur[4] == 'c' )
354 cur++;
355 if ( cur >
[all...]
/external/toybox/toys/other/
H A Dacpi.c110 int dfd=5, cur, max; local
123 cur=read_int_at(dfd, "cur_state");
127 else printf("Cooling %d: %s %d of %d\n", TT.cool++, toybuf, cur, max);
/external/bison/lib/
H A Dmbuiter.h119 struct mbchar cur; /* the current character: member in struct:mbuiter_multi
120 const char *cur.ptr pointer to current character
122 size_t cur.bytes number of bytes of current character
123 bool cur.wc_valid true if wc is a valid wide character
124 wchar_t cur.wc if wc_valid: the current character
136 if (is_basic (*iter->cur.ptr))
141 iter->cur.bytes = 1;
142 iter->cur.wc = *iter->cur.ptr;
143 iter->cur
[all...]
/external/blktrace/btt/
H A Dmmap.c37 static off_t cur_min, cur, cur_max, total_size; variable
86 cur_min = (cur & ~(pgsz-1));
99 return (cur < cur_max);
134 if ((cur + 512) > cur_max)
140 next_t = cur_map + (cur - cur_min);
142 cur += this_len;
149 return 100.0 * ((double)cur / (double)total_size);

Completed in 1792 milliseconds

1234567891011>>