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

1 2 3 45 6 7 8 91011>>

  /hardware/intel/common/libmix/mix_vbp/viddec_fw/fw/parser/
main.c 175 static inline void viddec_fw_push_current_frame_to_output(FW_IPC_Handle *fwipc, uint32_t cur)
178 FwIPC_ReadMessage(fwipc, &fwipc->wkld_q[cur], (char *)&(wkld_to_push), sizeof(ipc_msg_data));
179 FwIPC_SendMessage(fwipc, cur, (char *)&(wkld_to_push), sizeof(ipc_msg_data));
190 int32_t cur = -1; local
192 if(mfd_round_robin(viddec_stream_priority_REALTIME, &cur, _dmem.g_pk_data.high_id))
195 _dmem.g_pk_data.high_id = cur;
200 if(mfd_round_robin(viddec_stream_priority_BACKGROUND, &cur, _dmem.g_pk_data.low_id))
202 _dmem.g_pk_data.low_id = cur;
206 return cur;
216 static inline void viddec_fw_update_pending_interrupt_flag(int32_t cur, mfd_stream_info *cxt_swap, uint8_t pushed_a_workload
308 int32_t cur = -1; local
    [all...]
  /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);
  /external/clang/test/Analysis/engine/
replay-without-inlining.c 16 int cur; member in struct:__anon6924
23 if (input->cur + 1 > input->end)
25 return input->ib[(input->cur)++];
46 while (st->cur < st->end && i < 4) {
54 st.cur = 0;
  /external/compiler-rt/lib/sanitizer_common/
sanitizer_stacktrace_libcdep.cc 35 for (SymbolizedStack *cur = frames; cur; cur = cur->next) {
38 cur->info, common_flags()->symbolize_vs_style,
sanitizer_printf.cc 126 const char *cur = format; local
128 for (; *cur; cur++) {
129 if (*cur != '%') {
130 result += AppendChar(&buff, buff_end, *cur);
133 cur++;
134 bool have_width = (*cur >= '0' && *cur <= '9');
135 bool pad_with_zero = (*cur == '0');
138 while (*cur >= '0' && *cur <= '9')
    [all...]
sanitizer_lfstack.h 51 T *cur = (T*)(uptr)(cmp & kPtrMask); local
52 if (!cur)
54 T *nxt = cur->next;
59 return cur;
  /external/freetype/src/base/
ftutil.c 245 FT_ListNode cur; local
251 cur = list->head;
252 while ( cur )
254 if ( cur->data == data )
255 return cur;
257 cur = cur->next;
383 FT_ListNode cur; local
390 cur = list->head;
392 while ( cur )
416 FT_ListNode cur; local
    [all...]
  /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/base/
ftutil.c 245 FT_ListNode cur; local
251 cur = list->head;
252 while ( cur )
254 if ( cur->data == data )
255 return cur;
257 cur = cur->next;
383 FT_ListNode cur; local
390 cur = list->head;
392 while ( cur )
416 FT_ListNode cur; local
    [all...]
  /external/lzma/C/
Bra86.c 52 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/
ftutil.c 245 FT_ListNode cur; local
251 cur = list->head;
252 while ( cur )
254 if ( cur->data == data )
255 return cur;
257 cur = cur->next;
383 FT_ListNode cur; local
390 cur = list->head;
392 while ( cur )
416 FT_ListNode cur; local
    [all...]
  /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/type42/
t42parse.c 298 FT_Byte* cur; local
305 cur = parser->root.cursor;
306 if ( cur >= limit )
315 if ( ft_isdigit( *cur ) || *cur == '[' )
326 if ( *cur == '[' )
401 cur = parser->root.cursor;
404 if ( *cur == 'd' && cur + 3 < limit )
406 if ( cur[1] == 'e' &
534 FT_Byte* cur; local
786 FT_Byte* cur; local
1145 FT_Byte* cur; local
    [all...]
  /device/google/contexthub/firmware/src/
simpleQ.c 82 struct SimpleQueueEntry *cur; local
85 for (i = sq->head; i != SIMPLE_QUEUE_IDX_NONE; i = cur->nextIdx) {
86 cur = simpleQueueGetNth(sq, i);
87 discard(cur->data, true);
119 struct SimpleQueueEntry* cur = NULL; local
122 for (idx = sq->head; idx != SIMPLE_QUEUE_IDX_NONE; prev=idx, idx = cur->nextIdx) {
123 cur = simpleQueueGetNth(sq, idx);
125 if (!cur->discardable)
129 if (sq->discardCbk(cur->data, false)) {
133 sq->head = cur->nextIdx
    [all...]
  /external/strace/
poll.c 54 unsigned long cur, abbrev_end; local
79 for (cur = start + sizeof(fds); cur < end; cur += sizeof(fds)) {
81 if (cur >= abbrev_end) {
85 if (umove(tcp, cur, &fds) < 0) {
105 unsigned long cur, abbrev_end; local
131 for (cur = start; cur < end; cur += sizeof(fds))
    [all...]
  /external/v8/tools/
bash-completion.sh 38 local cur defines targets
39 cur="${COMP_WORDS[COMP_CWORD]}"
55 COMPREPLY=($(compgen -W "$targets" -- "$cur"))
  /frameworks/base/core/java/android/os/
PooledStringWriter.java 59 final Integer cur = mPool.get(str); local
60 if (cur != null) {
61 mOut.writeInt(cur);
  /external/libxml2/
pattern.c 179 const xmlChar *cur; /* the current char being parsed */ member in struct:_xmlPatParserContext
204 xmlPatternPtr cur; local
206 cur = (xmlPatternPtr) xmlMalloc(sizeof(xmlPattern));
207 if (cur == NULL) {
212 memset(cur, 0, sizeof(xmlPattern));
213 cur->maxStep = 10;
214 cur->steps = (xmlStepOpPtr) xmlMalloc(cur->maxStep * sizeof(xmlStepOp));
215 if (cur->steps == NULL) {
216 xmlFree(cur);
270 xmlPatternPtr cur; local
294 xmlPatParserContextPtr cur; local
823 const xmlChar *q, *cur; local
861 const xmlChar *q, *cur; local
1492 xmlStreamCompPtr cur; local
1547 xmlStreamStepPtr cur; local
1760 xmlStreamCtxtPtr cur; local
1823 int *cur; local
2360 xmlPatternPtr ret = NULL, cur; local
2491 xmlStreamCtxtPtr ret = NULL, cur; local
    [all...]
xpath.c 155 xmlNodePtr cur, root; local
290 cur = miscNode2->prev;
291 while (cur != NULL) {
292 if (cur == miscNode1)
294 if (cur->type == XML_ELEMENT_NODE)
296 cur = cur->prev;
321 cur = node1->parent;
322 while (cur) {
323 if (cur == node2
990 xmlXPathCompExprPtr cur; local
3110 char *ptr, *cur; local
3229 xmlNodePtr cur; local
3278 xmlNodePtr cur, root; local
3472 xmlNsPtr cur; local
4469 xmlNodePtr cur; local
4505 xmlNodePtr cur; local
4542 xmlNodePtr cur; local
4602 xmlNodePtr cur; local
4632 xmlNodePtr cur; local
4737 xmlNodePtr cur; local
8541 xmlXPathObjectPtr cur; local
8589 const xmlChar *cur = ids; local
8709 xmlXPathObjectPtr cur; local
8768 xmlXPathObjectPtr cur; local
8829 xmlXPathObjectPtr cur; local
8923 xmlXPathObjectPtr cur; local
8953 xmlXPathObjectPtr cur; local
8990 xmlXPathObjectPtr cur, newobj; local
9468 xmlXPathObjectPtr cur; local
9583 xmlXPathObjectPtr cur; local
9617 xmlXPathObjectPtr cur; local
9786 const xmlChar *cur; local
10091 const xmlChar *cur = str; local
10581 const xmlChar *cur; local
12128 xmlNodePtr cur; local
12734 int total = 0, cur; local
12858 int total = 0, cur; local
14277 xmlNodePtr cur = NULL, limit = NULL; local
    [all...]
relaxng.c 1601 xmlNodePtr root, cur; local
1765 xmlRelaxNGValidErrorPtr cur; local
1831 xmlRelaxNGValidErrorPtr cur; local
3915 xmlRelaxNGDefinePtr parent, cur, tmp; local
3991 xmlRelaxNGDefinePtr *ret = NULL, parent, cur, tmp; local
4089 xmlRelaxNGDefinePtr cur; local
4225 xmlRelaxNGDefinePtr cur; local
4317 xmlRelaxNGDefinePtr cur, *tmp; local
4485 xmlRelaxNGDefinePtr last = NULL, cur; local
5120 xmlRelaxNGDefinePtr ret, cur; local
5205 xmlRelaxNGDefinePtr ret, cur, last = NULL; local
5406 xmlRelaxNGDefinePtr ret, cur, last; local
5520 xmlRelaxNGDefinePtr def = NULL, last = NULL, cur, parent; local
5677 xmlRelaxNGDefinePtr def, cur; local
5734 xmlRelaxNGDefinePtr cur, last, tmp, tmp2; local
5854 xmlRelaxNGDefinePtr cur; local
6867 xmlChar *cur = value; local
6918 xmlAttrPtr cur, next; local
7006 xmlNodePtr cur, delete; local
7984 xmlNodePtr cur; local
8595 xmlRelaxNGDefinePtr cur; local
8661 xmlChar *cur; local
8816 xmlChar *oldvalue, *oldend, *val, *cur; local
8895 xmlChar *cur, *temp; local
9205 xmlRelaxNGDefinePtr cur; local
9250 xmlRelaxNGDefinePtr cur; local
9293 xmlNodePtr cur, start, last = NULL, lastchg = NULL, lastelem; local
10832 xmlNodePtr cur; local
    [all...]
valid.c 484 xmlValidPrintNode(xmlNodePtr cur) {
485 if (cur == NULL) {
489 switch (cur->type) {
491 xmlGenericError(xmlGenericErrorContext, "%s ", cur->name);
500 xmlGenericError(xmlGenericErrorContext, "&%s; ", cur->name);
503 xmlGenericError(xmlGenericErrorContext, "pi(%s) ", cur->name);
559 xmlValidPrintNodeList(xmlNodePtr cur) {
560 if (cur == NULL)
562 while (cur != NULL) {
563 xmlValidPrintNode(cur);
1616 xmlElementPtr cur; local
1847 xmlAttributePtr cur; local
2162 xmlAttributePtr cur; local
2434 xmlNotationPtr cur; local
3149 xmlElementPtr cur; local
3179 xmlElementPtr cur; local
3271 xmlAttributePtr cur; local
3492 const xmlChar *cur; local
3540 const xmlChar *cur; local
3610 const xmlChar *cur; local
3663 const xmlChar *cur; local
3878 xmlChar *dup, *nam = NULL, *cur, save; local
4246 xmlElementContentPtr cur, next; local
4977 xmlNodePtr cur; local
5103 xmlNodePtr cur; local
5116 xmlNodePtr cur; local
5144 xmlNodePtr cur; local
5236 xmlNodePtr cur; local
5519 xmlNodePtr cur, child; local
6446 xmlChar *dup, *str = NULL, *cur, save; local
6481 xmlChar *dup, *str = NULL, *cur, save; local
    [all...]
  /external/libcap-ng/libcap-ng-0.7/utils/
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/libgdx/gdx/src/com/badlogic/gdx/utils/compression/lz/
BinTree.java 106 int cur = _bufferOffset + _pos; local
111 int temp = CrcTable[_bufferBase[cur] & 0xFF] ^ (_bufferBase[cur + 1] & 0xFF);
113 temp ^= ((int)(_bufferBase[cur + 2] & 0xFF) << 8);
115 hashValue = (temp ^ (CrcTable[_bufferBase[cur + 3] & 0xFF] << 5)) & _hashMask;
117 hashValue = ((_bufferBase[cur] & 0xFF) ^ ((int)(_bufferBase[cur + 1] & 0xFF) << 8));
125 if (curMatch2 > matchMinPos) if (_bufferBase[_bufferOffset + curMatch2] == _bufferBase[cur]) {
129 if (curMatch3 > matchMinPos) if (_bufferBase[_bufferOffset + curMatch3] == _bufferBase[cur]) {
151 if (_bufferBase[_bufferOffset + curMatch + kNumHashDirectBytes] != _bufferBase[cur + kNumHashDirectBytes]) {
214 int cur = _bufferOffset + _pos; local
    [all...]
  /external/lzma/Java/SevenZip/Compression/LZ/
BinTree.java 135 int cur = _bufferOffset + _pos; local
141 int temp = CrcTable[_bufferBase[cur] & 0xFF] ^ (_bufferBase[cur + 1] & 0xFF);
143 temp ^= ((int)(_bufferBase[cur + 2] & 0xFF) << 8);
145 hashValue = (temp ^ (CrcTable[_bufferBase[cur + 3] & 0xFF] << 5)) & _hashMask;
148 hashValue = ((_bufferBase[cur] & 0xFF) ^ ((int)(_bufferBase[cur + 1] & 0xFF) << 8));
158 if (_bufferBase[_bufferOffset + curMatch2] == _bufferBase[cur])
164 if (_bufferBase[_bufferOffset + curMatch3] == _bufferBase[cur])
192 _bufferBase[cur + kNumHashDirectBytes])
270 int cur = _bufferOffset + _pos; local
    [all...]
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/
RubyTarget.java 147 char cur; local
155 cur = value.charAt( i );
158 if ( Character.isLetter( cur ) ) {
159 output_buffer.append( Character.toLowerCase( cur ) );
163 } else if ( Character.isLowerCase( cur ) && Character.isUpperCase( next ) ) {
166 } else if ( ( i < cliff - 1 ) && Character.isUpperCase( cur ) && Character.isUpperCase( next ) ) {
167 // cur is part of an acronym
176 } else if ( Character.isDigit( cur ) ) {
177 output_buffer.append( cur );
181 } else if ( Character.isWhitespace( cur ) ) {
244 char cur; local
    [all...]
  /external/compiler-rt/lib/tsan/rtl/
tsan_update_shadow_word_inl.h 30 if (Shadow::Addr0AndSizeAreEqual(cur, old)) {
33 if (Shadow::TidsAreEqual(old, cur)) {
50 if (Shadow::TwoRangesIntersect(old, cur, kAccessSize)) {
52 if (Shadow::TidsAreEqual(old, cur)) {
  /external/libxml2/doc/examples/
io1.c 23 static const char *cur = NULL; variable
54 cur = result;
56 return((void *) cur);
70 cur = NULL;

Completed in 718 milliseconds

1 2 3 45 6 7 8 91011>>