/external/libxml2/example/ |
gjobread.c | 46 parsePerson(xmlDocPtr doc, xmlNsPtr ns, xmlNodePtr cur) { 62 cur = cur->xmlChildrenNode; 63 while (cur != NULL) { 64 if ((!xmlStrcmp(cur->name, (const xmlChar *)"Person")) && 65 (cur->ns == ns)) 66 ret->name = xmlNodeListGetString(doc, cur->xmlChildrenNode, 1); 67 if ((!xmlStrcmp(cur->name, (const xmlChar *)"Email")) && 68 (cur->ns == ns)) 69 ret->email = xmlNodeListGetString(doc, cur->xmlChildrenNode, 1) 185 xmlNodePtr cur; local 290 gJobPtr cur; local [all...] |
/external/lzma/C/ |
LzHash.h | 15 #define HASH2_CALC hashValue = cur[0] | ((UInt32)cur[1] << 8);
18 UInt32 temp = p->crc[cur[0]] ^ cur[1]; \
20 hashValue = (temp ^ ((UInt32)cur[2] << 8)) & p->hashMask; }
23 UInt32 temp = p->crc[cur[0]] ^ cur[1]; \
25 hash3Value = (temp ^ ((UInt32)cur[2] << 8)) & (kHash3Size - 1); \
26 hashValue = (temp ^ ((UInt32)cur[2] << 8) ^ (p->crc[cur[3]] << 5)) & p->hashMask; } [all...] |
/external/libxml2/doc/tutorial/ |
includekeyword.c | 9 parseStory (xmlDocPtr doc, xmlNodePtr cur) { 12 cur = cur->xmlChildrenNode; 13 while (cur != NULL) { 14 if ((!xmlStrcmp(cur->name, (const xmlChar *)"keyword"))) { 15 key = xmlNodeListGetString(doc, cur->xmlChildrenNode, 1); 19 cur = cur->next; 28 xmlNodePtr cur; 37 cur = xmlDocGetRootElement(doc) [all...] |
includeaddkeyword.c | 9 parseStory (xmlDocPtr doc, xmlNodePtr cur, char *keyword) { 11 xmlNewTextChild (cur, NULL, "keyword", keyword); 19 xmlNodePtr cur; 28 cur = xmlDocGetRootElement(doc); 30 if (cur == NULL) { 36 if (xmlStrcmp(cur->name, (const xmlChar *) "story")) { 42 cur = cur->xmlChildrenNode; 43 while (cur != NULL) { 44 if ((!xmlStrcmp(cur->name, (const xmlChar *)"storyinfo"))) [all...] |
includegetattribute.c | 9 getReference (xmlDocPtr doc, xmlNodePtr cur) { 12 cur = cur->xmlChildrenNode; 13 while (cur != NULL) { 14 if ((!xmlStrcmp(cur->name, (const xmlChar *)"reference"))) { 15 uri = xmlGetProp(cur, "uri"); 19 cur = cur->next; 29 xmlNodePtr cur; 38 cur = xmlDocGetRootElement(doc) [all...] |
/external/bison/lib/ |
mbuiter.h | 119 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.wc_valid = true [all...] |
/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/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...] |
/external/mesa3d/src/gallium/auxiliary/tgsi/ |
tgsi_text.c | 42 static boolean is_alpha_underscore( const char *cur ) 45 (*cur >= 'a' && *cur <= 'z') || 46 (*cur >= 'A' && *cur <= 'Z') || 47 *cur == '_'; 50 static boolean is_digit( const char *cur ) 52 return *cur >= '0' && *cur <= '9'; 55 static boolean is_digit_alpha_underscore( const char *cur ) 91 const char *cur = *pcur; local 112 const char *cur = *pcur; local 135 const char *cur = *pcur; local 146 const char *cur = *pcur; local 160 const char *cur = *pcur; local 177 const char *cur = *pcur; local 194 const char *cur = *pcur; local 238 const char *cur; member in struct:translate_ctx 303 const char *cur = ctx->cur; local 322 const char *cur = *pcur; local 338 const char *cur; local 451 const char *cur; local 519 const char *cur = ctx->cur; local 625 const char *cur; local 684 const char *cur; local 727 const char *cur = ctx->cur; local 834 const char *cur = *pcur; local 870 const char *cur; local 1072 const char *cur, *cur2; local 1375 const char *cur = *pcur; local 1392 const char *cur = *pcur; local 1409 const char *cur = *pcur; local [all...] |
/external/selinux/libsepol/src/ |
hashtab.c | 69 hashtab_ptr_t prev, cur, newnode; local 76 cur = h->htable[hvalue]; 77 while (cur && h->keycmp(h, key, cur->key) > 0) { 78 prev = cur; 79 cur = cur->next; 82 if (cur && (h->keycmp(h, key, cur->key) == 0)) 108 hashtab_ptr_t cur, last local 141 hashtab_ptr_t prev, cur, newnode; local 182 hashtab_ptr_t cur; local 201 hashtab_ptr_t cur, temp; local 227 hashtab_ptr_t cur; local 254 hashtab_ptr_t last, cur, temp; local 291 hashtab_ptr_t cur; local [all...] |
sidtab.c | 46 sidtab_node_t *prev, *cur, *newnode; local 53 cur = s->htable[hvalue]; 54 while (cur != NULL && sid > cur->sid) { 55 prev = cur; 56 cur = cur->next; 59 if (cur && sid == cur->sid) { 90 sidtab_node_t *cur, *last local 121 sidtab_node_t *cur; local 151 sidtab_node_t *cur; local 174 sidtab_node_t *last, *cur, *temp; local 211 sidtab_node_t *cur; local 263 sidtab_node_t *cur; local 290 sidtab_ptr_t cur, temp; local [all...] |
/external/selinux/policycoreutils/newrole/ |
hashtab.c | 48 hashtab_ptr_t prev, cur, newnode; local 55 cur = h->htable[hvalue]; 56 while (cur && h->keycmp(h, key, cur->key) > 0) { 57 prev = cur; 58 cur = cur->next; 61 if (cur && (h->keycmp(h, key, cur->key) == 0)) 87 hashtab_ptr_t cur, last local 120 hashtab_ptr_t prev, cur, newnode; local 161 hashtab_ptr_t cur; local 180 hashtab_ptr_t cur, temp; local 206 hashtab_ptr_t cur; local 233 hashtab_ptr_t last, cur, temp; local 270 hashtab_ptr_t cur; local [all...] |
/external/boringssl/src/crypto/lhash/ |
lhash_test.c | 36 struct dummy_lhash_node *cur, *next; local 38 for (cur = lh->head; cur != NULL; cur = next) { 39 next = cur->next; 40 free(cur->s); 41 free(cur); 47 struct dummy_lhash_node *cur; local 49 for (cur = lh->head; cur != NULL; cur = cur->next) 57 struct dummy_lhash_node *cur; local 69 struct dummy_lhash_node *node, *cur; local 88 struct dummy_lhash_node *cur, **next_ptr; local [all...] |
/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;
|
/external/libxml2/ |
tree.c | 368 const xmlChar *cur = value; local 378 while (IS_BLANK_CH(*cur)) cur++; 379 if (((*cur >= 'a') && (*cur <= 'z')) || ((*cur >= 'A') && (*cur <= 'Z')) || 380 (*cur == '_')) 381 cur++; 384 while (((*cur >= 'a') && (*cur <= 'z')) | 442 const xmlChar *cur = value; local 540 const xmlChar *cur = value; local 609 const xmlChar *cur = value; local 729 xmlNsPtr cur; local 872 xmlDtdPtr cur; local 920 xmlNodePtr cur; local 946 xmlDtdPtr cur; local 1157 xmlDocPtr cur; local 1273 const xmlChar *cur = value, *end = cur + len; local 1481 const xmlChar *cur = value; local 1831 xmlAttrPtr cur; local 2004 xmlAttrPtr cur; local 2154 xmlNodePtr cur; local 2216 xmlNodePtr cur; local 2258 xmlNodePtr cur; local 2307 xmlNodePtr cur; local 2344 xmlNodePtr cur; local 2378 xmlNodePtr cur; local 2400 xmlNodePtr cur; local 2430 xmlNodePtr cur; local 2476 xmlNodePtr cur, prev; local 2545 xmlNodePtr cur; local 2588 xmlNodePtr cur; local 2644 xmlNodePtr cur; local 2661 xmlNodePtr cur; local 2696 xmlNodePtr cur; local 2712 xmlNodePtr cur; local 2746 xmlNodePtr cur; local 2779 xmlNodePtr cur; local 2842 xmlNodePtr cur; local 2875 xmlNodePtr cur, prev; local 3471 xmlNodePtr cur = NULL; local 3507 xmlNodePtr cur = NULL; local 3543 xmlNodePtr cur = NULL; local 4431 xmlNodePtr cur, p = NULL, q; local 4652 const xmlNode *cur, *tmp, *next; local 5897 xmlNsPtr cur; local 6001 xmlNsPtr cur; local 6130 xmlNsPtr cur; local 6542 xmlNsPtr *nsList, *cur; local 6941 const xmlChar *cur; local 7627 const char *cur; local 7696 const xmlChar *cur, *base; local 7843 xmlNsMapItemPtr cur, tmp; local 8074 xmlNodePtr cur; local 8345 xmlNodePtr cur, prev = NULL, out = NULL; local 8447 xmlNodePtr cur; local 8736 xmlNodePtr cur, curElem = NULL; local 9000 xmlNodePtr cur, curElem = NULL; local 9370 xmlNodePtr cur, curElem = NULL; local 9894 xmlNodePtr cur; local 10073 xmlNodePtr cur = node; local [all...] |
/frameworks/base/libs/androidfw/ |
AssetDir.cpp | 42 int lo, hi, cur; 49 cur = (hi + lo) / 2; 50 cmp = strcmp(pVector->itemAt(cur).getFileName(), fileName); 53 return cur; 56 lo = cur + 1; 59 hi = cur -1;
|
/external/fio/lib/ |
prio_tree.c | 171 struct prio_tree_node *cur, *res = node; local 182 cur = root->prio_tree_node; 186 get_index(cur, &r_index, &h_index); 189 return cur; 194 node = prio_tree_replace(root, cur, node); 195 cur = tmp; 211 if (prio_tree_right_empty(cur)) { 213 cur->right = node; 214 node->parent = cur; 217 cur = cur->right 247 struct prio_tree_node *cur; local [all...] |
/external/libcxx/test/std/depr/depr.ios.members/ |
seek_dir.pass.cpp | 23 std::strstream::seek_dir b = std::strstream::cur; 24 assert(b == std::ios::cur);
|
/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/sources/cxx-stl/llvm-libc++/libcxx/test/depr/depr.ios.members/ |
seek_dir.pass.cpp | 23 std::strstream::seek_dir b = std::strstream::cur; 24 assert(b == std::ios::cur);
|
/frameworks/av/media/libstagefright/foundation/ |
AHierarchicalStateMachine.cpp | 57 sp<AState> cur = mState; local 58 while (cur != NULL && !cur->onMessageReceived(msg)) { 63 cur = cur->parentState(); 66 if (cur != NULL) { 81 sp<AState> cur = mState; local 83 A.push(cur); 84 if (cur == NULL) { 87 cur = cur->parentState() [all...] |
/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');
|
/hardware/intel/common/libmix/mix_vbp/viddec_fw/fw/parser/include/ |
viddec_emitter.h | 24 viddec_emitter_wkld cur; member in struct:__anon29743 44 cxt->cur.data = cxt->next.data = 0; 45 cxt->cur.max_items = cxt->next.max_items = 0; 46 cxt->cur.num_items = cxt->next.num_items = 0; 47 cxt->cur.result = cxt->next.result = VIDDEC_FW_WORKLOAD_SUCCESS; 50 static inline void viddec_emit_update(viddec_emitter *cxt, uint32_t cur, uint32_t next, uint32_t cur_size, uint32_t next_size) 52 cxt->cur.data = (cur != 0) ? (viddec_workload_t *)(cur | DDR_MEM_MASK) : NULL; 54 cxt->cur.max_items = (cur_size - sizeof(viddec_workload_t))/sizeof(viddec_workload_item_t) 60 viddec_emitter_wkld *cur; local [all...] |
/external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/psaux/ |
psobjs.c | 288 FT_Byte* cur = *acur; local 291 while ( cur < limit ) 293 if ( IS_PS_NEWLINE( *cur ) ) 295 cur++; 298 *acur = cur; 306 FT_Byte* cur = *acur; local 309 while ( cur < limit ) 311 if ( !IS_PS_SPACE( *cur ) ) 313 if ( *cur == '%' ) 315 skip_comment( &cur, limit ) 336 FT_Byte* cur = *acur; local 412 FT_Byte* cur = *acur; local 451 FT_Byte* cur; local 514 FT_Byte* cur = parser->cursor; local 619 FT_Byte* cur; local 736 T1_Token cur = tokens; local 777 FT_Byte* cur = *acur; local 857 FT_Byte* cur = *acur; local 990 FT_Byte* cur = *acur; local 1030 FT_Byte* cur; local 1385 FT_Byte* cur; local [all...] |