HomeSort by relevance Sort by last modified time
    Searched refs:cur (Results 76 - 100 of 1114) sorted by null

1 2 34 5 6 7 8 91011>>

  /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))
  /external/libxml2/
runsuite.c 238 getNext(xmlNodePtr cur, const char *xpath) {
243 if ((cur == NULL) || (cur->doc == NULL) || (xpath == NULL))
245 ctxtXPath->doc = cur->doc;
246 ctxtXPath->node = cur;
266 getString(xmlNodePtr cur, const char *xpath) {
271 if ((cur == NULL) || (cur->doc == NULL) || (xpath == NULL))
273 ctxtXPath->doc = cur->doc;
274 ctxtXPath->node = cur;
420 xmlNodePtr test, tmp, cur; local
633 xmlNodePtr cur; local
696 xmlNodePtr cur; local
734 xmlNodePtr cur; local
998 xmlNodePtr cur; local
    [all...]
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 506 xmlEntityPtr cur; local
512 cur = xmlGetEntityFromTable(table, name);
513 if (cur != NULL)
514 return(cur);
520 cur = xmlGetEntityFromTable(table, name);
521 if (cur != NULL)
522 return(cur);
557 const xmlChar *cur = input; local
578 while (*cur != '\0') {
589 if (*cur == '<')
787 const xmlChar *cur = input; local
911 xmlEntityPtr cur; local
965 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...]
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)
444 const unsigned char *cur; local
618 const unsigned char *cur = ctxt->input->cur; local
1804 xmlNodePtr cur, next; local
1814 xmlAttrPtr cur, next; local
    [all...]
xpointer.c 106 ctxt->context->lastError.int1 = ctxt->cur - ctxt->base;
116 ctxt->cur - ctxt->base, 0,
127 xmlNodePtr xmlXPtrAdvanceNode(xmlNodePtr cur, int *level);
130 * @cur: the node
135 xmlXPtrGetArity(xmlNodePtr cur) {
137 if ((cur == NULL) || (cur->type == XML_NAMESPACE_DECL))
139 cur = cur->children;
140 for (i = 0;cur != NULL;cur = cur->next)
922 xmlNodePtr cur = NULL; local
980 xmlChar *buffer, *cur; local
1440 xmlNodePtr start, cur, end; local
2250 const xmlChar *cur; local
2382 xmlNodePtr cur; local
2472 xmlNodePtr cur; local
2556 xmlNodePtr cur; local
2640 xmlNodePtr cur; local
2929 const xmlChar *cur; local
    [all...]
xmlschemastypes.c 844 * @cur: the value to be appended
851 xmlSchemaValueAppend(xmlSchemaValPtr prev, xmlSchemaValPtr cur) {
853 if ((prev == NULL) || (cur == NULL))
855 prev->next = cur;
861 * @cur: the value
869 xmlSchemaValueGetNext(xmlSchemaValPtr cur) {
871 if (cur == NULL)
873 return (cur->next);
1200 const xmlChar *cur = *str, *firstChar; local
1293 const xmlChar *cur = *str; local
1323 const xmlChar *cur = *str; local
1353 const xmlChar *cur = *str; local
1404 const xmlChar *cur; local
1559 const xmlChar *cur = dateTime; local
1780 const xmlChar *cur = duration; local
1919 const xmlChar *cur = value; local
2010 xmlChar *val, *cur, *endval; local
2080 const xmlChar *tmp, *cur = *str; local
2187 const xmlChar *cur = value; local
2240 const xmlChar *cur = value; local
2261 const xmlChar *cur = value; local
2401 const xmlChar *cur = value; local
2541 const xmlChar *cur = value; local
2600 const xmlChar *cur = value; local
2917 xmlChar *tmpval, *cur; local
2949 const xmlChar *cur = value, *start; local
3021 const xmlChar *cur = value; local
3134 const xmlChar *cur = value; local
3193 const xmlChar *cur = value; local
3266 const xmlChar *cur = value; local
3681 xmlSchemaValPtr ret = NULL, prev = NULL, cur; local
    [all...]
xmlcatalog.c 97 char *cmdline = NULL, *cur; local
113 cur = cmdline;
115 while ((*cur == ' ') || (*cur == '\t')) cur++;
117 while ((*cur != ' ') && (*cur != '\t') &&
118 (*cur != '\n') && (*cur != '\r')) {
119 if (*cur == 0
    [all...]
  /device/google/contexthub/firmware/inc/
isr.h 62 struct link_t *cur, *tmp; local
66 list_iterate(&interrupt->isrs, cur, tmp) {
67 struct ChainedIsr *curIsr = container_of(cur, struct ChainedIsr, node);
81 struct link_t *cur, *tmp; local
83 list_iterate(&interrupt->isrs, cur, tmp) {
84 struct ChainedIsr *curIsr = container_of(cur, struct ChainedIsr, node);
96 struct link_t *cur, *tmp; local
99 list_iterate(&interrupt->isrs, cur, tmp) {
100 struct ChainedIsr *curIsr = container_of(cur, struct ChainedIsr, node);
  /external/smali/smalidea/src/main/java/org/jf/smalidea/psi/impl/
SmaliCompositeElement.java 72 for (PsiElement cur = getFirstChild(); cur != null; cur = cur.getNextSibling()) {
73 if (aClass.isInstance(cur)) result.add((T)cur);
81 for (PsiElement cur = getFirstChild(); cur != null; cur = cur.getNextSibling())
    [all...]
  /external/libselinux/src/
android.c 337 struct seapp_context *cur; local
379 cur = (struct seapp_context *) calloc(1, sizeof(struct seapp_context));
380 if (!cur)
385 free_seapp_context(cur);
393 free_seapp_context(cur);
400 cur->isSystemServer = true;
402 cur->isSystemServer = false;
404 free_seapp_context(cur);
408 cur->isAutoPlayAppSet = true;
410 cur->isAutoPlayApp = true
670 struct seapp_context *cur = NULL; local
    [all...]
  /development/samples/RandomMusicPlayer/src/com/example/android/musicplayer/
MusicRetriever.java 61 Cursor cur = mContentResolver.query(uri, null, local
63 Log.i(TAG, "Query finished. " + (cur == null ? "Returned NULL." : "Returned a cursor."));
65 if (cur == null) {
70 if (!cur.moveToFirst()) {
79 int artistColumn = cur.getColumnIndex(MediaStore.Audio.Media.ARTIST);
80 int titleColumn = cur.getColumnIndex(MediaStore.Audio.Media.TITLE);
81 int albumColumn = cur.getColumnIndex(MediaStore.Audio.Media.ALBUM);
82 int durationColumn = cur.getColumnIndex(MediaStore.Audio.Media.DURATION);
83 int idColumn = cur.getColumnIndex(MediaStore.Audio.Media._ID);
90 Log.i(TAG, "ID: " + cur.getString(idColumn) + " Title: " + cur.getString(titleColumn))
    [all...]
  /frameworks/native/libs/binder/
MemoryDealer.cpp 325 chunk_t* cur = mList.head(); local
328 while (cur) {
331 extra = ( -cur->start & ((pagesize/kMemoryAlign)-1) ) ;
334 if (cur->free && (cur->size >= (size+extra))) {
335 if ((!free_chunk) || (cur->size < free_chunk->size)) {
336 free_chunk = cur;
338 if (cur->size == size) {
342 cur = cur->next
378 chunk_t* cur = mList.head(); local
441 chunk_t const* cur = mList.head(); local
    [all...]
  /bionic/libc/upstream-netbsd/lib/libc/gen/
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);
  /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...]
  /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);
  /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...]
  /external/skia/src/gpu/batches/
GrAAConvexTessellator.cpp 137 for (int cur = 0; cur < fBisectors.count(); prev = cur, ++cur) {
138 fBisectors[cur] = fNorms[cur] + fNorms[prev];
139 if (!fBisectors[cur].normalize()) {
141 fBisectors[cur].setOrthog(fNorms[cur], (SkPoint::Side)-fSide);
144 fBisectors[cur] += other
    [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/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/tcpdump/missing/
inet_ntop.c 113 } best, cur; local
127 cur.len = 0;
128 cur.base = -1;
133 if (cur.base == -1)
134 cur.base = i, cur.len = 1;
135 else cur.len++;
137 else if (cur.base != -1)
139 if (best.base == -1 || cur.len > best.len)
140 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...]
  /external/boringssl/src/crypto/lhash/
lhash.c 133 LHASH_ITEM *cur, **ret; local
140 for (cur = *ret; cur != NULL; cur = *ret) {
141 if (lh->comp(cur->data, data) == 0) {
144 ret = &cur->next;
166 LHASH_ITEM **new_buckets, *cur, *next; local
181 for (cur = lh->buckets[i]; cur != NULL; cur = next)
281 LHASH_ITEM *cur, *next; local
    [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 2362 milliseconds

1 2 34 5 6 7 8 91011>>