HomeSort by relevance Sort by last modified time
    Searched refs:cur (Results 151 - 175 of 1519) sorted by null

1 2 3 4 5 67 8 91011>>

  /external/ltp/testcases/open_posix_testsuite/stress/threads/pthread_mutex_init/
s-c.c 111 teststruct_t *cur, *prev; local
126 cur = NULL;
131 cur = malloc(sizeof(teststruct_t));
132 if (cur == NULL) /* No memory left */
136 cur->prev = prev;
137 prev = cur;
154 if ((ret = pthread_mutexattr_init(&(cur->ma[i])))) {
159 pthread_mutexattr_settype(&(cur->ma[i]),
165 cur->pma[0] = NULL;
167 cur->pma[i] = &(cur->ma[i % 5])
    [all...]
  /bionic/libc/bionic/
ftw.cpp 57 FTSENT* cur; local
58 while (error == 0 && (cur = fts_read(fts)) != nullptr) {
60 switch (cur->fts_info) {
64 if (postorder || access(cur->fts_path, R_OK) == -1) continue;
100 ftw.base = cur->fts_pathlen - cur->fts_namelen;
101 ftw.level = cur->fts_level;
102 error = nftw_fn(cur->fts_path, cur->fts_statp, fn_flag, &ftw);
104 error = ftw_fn(cur->fts_path, cur->fts_statp, fn_flag)
    [all...]
  /device/linaro/bootloader/arm-trusted-firmware/drivers/io/
io_block.c 126 block_dev_state_t *cur; local
134 cur = (block_dev_state_t *)dev_info->info;
135 assert(((region->offset % cur->dev_spec->block_size) == 0) &&
136 ((region->length % cur->dev_spec->block_size) == 0));
138 cur->base = region->offset;
139 cur->size = region->length;
140 cur->file_pos = 0;
142 entity->info = (uintptr_t)cur;
149 block_dev_state_t *cur; local
153 cur = (block_dev_state_t *)entity->info
173 block_dev_state_t *cur; local
279 block_dev_state_t *cur; local
376 block_dev_state_t *cur; local
    [all...]
  /external/libxml2/
schematron.c 729 * @cur: the current include node
735 xmlDocPtr doc, xmlNodePtr cur)
761 ctxt->includes[2 * ctxt->nbIncludes] = cur;
853 xmlNodePtr cur; local
886 cur = rule->children;
887 NEXT_SCHEMATRON(cur);
888 while (cur != NULL) {
889 if (IS_SCHEMATRON(cur, "assert")) {
891 test = xmlGetNoNsProp(cur, BAD_CAST "test");
893 xmlSchematronPErr(ctxt, cur,
961 xmlNodePtr cur; local
1081 xmlNodePtr root, cur; local
1668 xmlNodePtr cur, root; local
    [all...]
entities.c 511 xmlEntityPtr cur; local
517 cur = xmlGetEntityFromTable(table, name);
518 if (cur != NULL)
519 return(cur);
525 cur = xmlGetEntityFromTable(table, name);
526 if (cur != NULL)
527 return(cur);
562 const xmlChar *cur = input; local
583 while (*cur != '\0') {
594 if (*cur == '<')
792 const xmlChar *cur = input; local
916 xmlEntityPtr cur; local
970 const xmlChar * base, *cur; local
    [all...]
runxmlconf.c 289 xmlconfTestItem(xmlDocPtr doc, xmlNodePtr cur) {
308 id = xmlGetProp(cur, BAD_CAST "ID");
310 test_log("test missing ID, line %ld\n", xmlGetLineNo(cur));
321 type = xmlGetProp(cur, BAD_CAST "TYPE");
326 uri = xmlGetProp(cur, BAD_CAST "URI");
331 base = xmlNodeGetBase(doc, cur);
339 version = xmlGetProp(cur, BAD_CAST "VERSION");
341 entities = xmlGetProp(cur, BAD_CAST "ENTITIES");
346 rec = xmlGetProp(cur, BAD_CAST "RECOMMENDATION");
370 edition = xmlGetProp(cur, BAD_CAST "EDITION")
517 xmlNodePtr cur; local
    [all...]
xmlschemastypes.c 854 * @cur: the value to be appended
861 xmlSchemaValueAppend(xmlSchemaValPtr prev, xmlSchemaValPtr cur) {
863 if ((prev == NULL) || (cur == NULL))
865 prev->next = cur;
871 * @cur: the value
879 xmlSchemaValueGetNext(xmlSchemaValPtr cur) {
881 if (cur == NULL)
883 return (cur->next);
1210 const xmlChar *cur = *str, *firstChar; local
1303 const xmlChar *cur = *str; local
1333 const xmlChar *cur = *str; local
1363 const xmlChar *cur = *str; local
1414 const xmlChar *cur; local
1569 const xmlChar *cur = dateTime; local
1790 const xmlChar *cur = duration; local
1929 const xmlChar *cur = value; local
2020 xmlChar *val, *cur, *endval; local
2090 const xmlChar *tmp, *cur = *str; local
2197 const xmlChar *cur = value; local
2250 const xmlChar *cur = value; local
2271 const xmlChar *cur = value; local
2411 const xmlChar *cur = value; local
2551 const xmlChar *cur = value; local
2610 const xmlChar *cur = value; local
2927 xmlChar *tmpval, *cur; local
2959 const xmlChar *cur = value, *start; local
3031 const xmlChar *cur = value; local
3144 const xmlChar *cur = value; local
3203 const xmlChar *cur = value; local
3276 const xmlChar *cur = value; local
3691 xmlSchemaValPtr ret = NULL, prev = NULL, cur; local
    [all...]
parserInternals.c 58 #define CUR(ctxt) ctxt->input->cur
60 #define VALID_CTXT(ctxt) (CUR(ctxt) <= END(ctxt))
256 if (in->cur < in->base) {
258 "xmlParserInput: cur < base problem\n");
260 if (in->cur > in->base + xmlBufUse(in->buf->buffer)) {
262 "xmlParserInput: cur > base + use problem\n");
264 xmlGenericError(xmlGenericErrorContext,"buffer %x : content %x, cur %d, use %d\n",
265 (int) in, (int) xmlBufContent(in->buf->buffer), in->cur - in->base,
311 if (in->cur == NULL) return(-1)
442 const unsigned char *cur; local
609 const unsigned char *cur = ctxt->input->cur; local
1802 xmlNodePtr cur, next; local
1812 xmlAttrPtr cur, next; local
    [all...]
  /art/libartbase/base/
safe_copy.cc 49 const char* cur = static_cast<const char*>(src); local
56 src_iovs[iovecs_used].iov_base = const_cast<char*>(cur);
57 if (!IsAlignedParam(cur, PAGE_SIZE)) {
58 src_iovs[iovecs_used].iov_len = AlignUp(cur, PAGE_SIZE) - cur;
66 cur += src_iovs[iovecs_used].iov_len;
  /external/compiler-rt/lib/sanitizer_common/
sanitizer_stacktrace_libcdep.cc 37 for (SymbolizedStack *cur = frames; cur; cur = cur->next) {
40 cur->info, common_flags()->symbolize_vs_style,
46 dedup_token.append(cur->info.function);
  /external/ltp/testcases/open_posix_testsuite/stress/threads/pthread_cond_init/
s-c.c 102 teststruct_t *cur, *prev; local
126 cur = NULL;
131 cur = malloc(sizeof(teststruct_t));
132 if (cur == NULL) /* No memory left */
136 cur->prev = prev;
137 prev = cur;
149 ret = pthread_condattr_init(&(cur->ca[i]));
156 pthread_condattr_setclock(&(cur->ca[i]),
165 pthread_condattr_setpshared(&(cur->ca[i]),
176 cur->pca[i] = (i % 5) ? &(cur->ca[i % 4]) : NULL
    [all...]
  /art/runtime/gc/accounting/
card_table_test.cc 124 for (uint8_t* cur = start - CardTable::kCardSize; cur >= HeapBegin();
125 cur -= CardTable::kCardSize) {
126 EXPECT_EQ(card_table_->GetCard(reinterpret_cast<mirror::Object*>(cur)),
127 PseudoRandomCard(cur));
129 for (uint8_t* cur = end + CardTable::kCardSize; cur < HeapLimit();
130 cur += CardTable::kCardSize) {
131 EXPECT_EQ(card_table_->GetCard(reinterpret_cast<mirror::Object*>(cur)),
132 PseudoRandomCard(cur));
    [all...]
  /frameworks/base/core/java/com/android/internal/util/
ArrayUtils.java 367 public static @NonNull int[] appendInt(@Nullable int[] cur, int val,
369 if (cur == null) {
372 final int N = cur.length;
375 if (cur[i] == val) {
376 return cur;
381 System.arraycopy(cur, 0, ret, 0, N);
390 public static @NonNull int[] appendInt(@Nullable int[] cur, int val) {
391 return appendInt(cur, val, false);
397 public static @Nullable int[] removeInt(@Nullable int[] cur, int val) {
398 if (cur == null)
    [all...]
  /external/skia/src/gpu/ops/
GrAAConvexTessellator.cpp 149 for (int cur = 0; cur < fBisectors.count(); prev = cur, ++cur) {
150 fBisectors[cur] = fNorms[cur] + fNorms[prev];
151 if (!fBisectors[cur].normalize()) {
153 SkPointPriv::SetOrthog(&fBisectors[cur], fNorms[cur], (SkPointPriv::Side)-fSide);
156 fBisectors[cur] += other
    [all...]
  /external/skqp/src/gpu/ops/
GrAAConvexTessellator.cpp 149 for (int cur = 0; cur < fBisectors.count(); prev = cur, ++cur) {
150 fBisectors[cur] = fNorms[cur] + fNorms[prev];
151 if (!fBisectors[cur].normalize()) {
153 SkPointPriv::SetOrthog(&fBisectors[cur], fNorms[cur], (SkPointPriv::Side)-fSide);
156 fBisectors[cur] += other
    [all...]
  /external/libxml2/doc/tutorial/
includeaddattribute.c 13 xmlNodePtr cur;
24 cur = xmlDocGetRootElement(doc);
26 if (cur == NULL) {
32 if (xmlStrcmp(cur->name, (const xmlChar *) "story")) {
38 newnode = xmlNewTextChild (cur, NULL, "reference", NULL);
  /external/python/cpython3/Lib/sqlite3/test/
regression.py 37 cur = self.con.cursor()
38 cur.execute("pragma user_version")
44 cur = self.con.cursor()
45 cur.execute("pragma schema_version")
47 cur.close()
66 cur = self.con.cursor()
67 cur.execute('select 1 as "foo bar [datetime]"')
68 self.assertEqual(cur.description[0][0], "foo bar")
70 cur.execute('select 1 as "foo baz"')
71 self.assertEqual(cur.description[0][0], "foo baz"
210 cur = con.cursor() variable in class:RegressionTests.CheckConnectionConstructorCallCheck.Connection
    [all...]
  /hardware/intel/common/libmix/mix_vbp/viddec_fw/fw/parser/
viddec_emit.c 7 if(emit->cur.data != NULL)
9 emit->cur.data->num_items = emit->cur.num_items;
15 emit->cur.num_items = emit->next.num_items;
17 if(emit->cur.data != NULL)
19 emit->cur.data->result = emit->cur.result;
25 emit->cur.result = emit->next.result;
53 cur_wkld = (using_next == 0)? &(emit->cur):&(emit->next);
71 cur_wkld = (using_next == false)? &(emit->cur):&(emit->next)
    [all...]
  /device/linaro/bootloader/edk2/StdLib/LibC/NetUtil/
inet_ntop.c 140 struct { int base, len; } best, cur; local
158 cur.base = -1;
159 cur.len = 0;
162 if (cur.base == -1)
163 cur.base = i, cur.len = 1;
165 cur.len++;
167 if (cur.base != -1) {
168 if (best.base == -1 || cur.len > best.len)
169 best = cur;
    [all...]
  /external/libdrm/freedreno/
freedreno_ringbuffer.c 52 ring->cur = ring->last_start = ring->start;
78 ring->cur = ring->last_start = start;
107 ring->cur = ring->last_start = ring->start;
137 submit_offset = offset_bytes(target->cur, target->ring->start);
138 size = offset_bytes(end->cur, target->cur);
154 uint32_t size = offset_bytes(target->cur, target->start);
170 marker->cur = marker->ring->cur;
182 marker->cur = marker->ring->cur
    [all...]
  /external/libxml2/doc/examples/
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...]
  /external/llvm/utils/gdb-scripts/
prettyprinters.py 33 self.cur = begin
41 if self.cur == self.end:
45 cur = self.cur
46 self.cur = self.cur + 1
47 return '[%d]' % count, cur.dereference()
73 self.cur = begin
81 if self.cur == self.end:
85 cur = self.cu
    [all...]
  /external/tcpdump/
addrtostr.c 115 } best, cur; local
128 cur.len = 0;
129 cur.base = -1;
134 if (cur.base == -1)
135 cur.base = i, cur.len = 1;
136 else cur.len++;
138 else if (cur.base != -1)
140 if (best.base == -1 || cur.len > best.len)
141 best = cur;
    [all...]
  /external/valgrind/coregrind/m_gdbserver/
inferiors.c 55 struct inferior_list_entry *cur = list->head, *next; local
57 while (cur != NULL) {
58 next = cur->next;
59 (*action) (cur);
60 cur = next;
76 struct inferior_list_entry **cur; local
85 cur = &list->head;
86 while (*cur && (*cur)->next != entry)
87 cur = &(*cur)->next
    [all...]
  /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...]

Completed in 588 milliseconds

1 2 3 4 5 67 8 91011>>