HomeSort by relevance Sort by last modified time
    Searched full:curr (Results 126 - 150 of 693) sorted by null

1 2 3 4 56 7 8 91011>>

  /external/mesa3d/src/gallium/drivers/svga/
svga_screen_cache.c 99 struct list_head *curr, *next; local
109 curr = cache->bucket[bucket].next;
110 next = curr->next;
111 while (curr != &cache->bucket[bucket]) {
114 entry = LIST_ENTRY(struct svga_host_surface_cache_entry, curr, bucket_head);
144 curr = next;
145 next = curr->next;
303 struct list_head *curr, *next; local
308 curr = cache->validated.next;
309 next = curr->next
    [all...]
svga_pipe_clear.c 48 struct pipe_framebuffer_state *fb = &svga->curr.framebuffer;
74 if ((svga->curr.framebuffer.zsbuf->format == PIPE_FORMAT_S8_UINT_Z24_UNORM) &&
116 svga_surface(svga->curr.framebuffer.cbufs[0])->handle);
svga_context.c 77 pipe_resource_reference( &svga->curr.cb[shader], NULL );
207 svga->curr.nr_fbs = 0;
288 if (svga->curr.framebuffer.cbufs[i])
289 svga_propagate_surface(svga, svga->curr.framebuffer.cbufs[i]);
292 if (svga->curr.framebuffer.zsbuf)
293 svga_propagate_surface(svga, svga->curr.framebuffer.zsbuf);
  /external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
fx_zlib_inftrees.c 44 unsigned curr; /* number of index bits for current table */ local
151 filled is at next and has curr index bits. The code being used is huff
153 bits off of the bottom. For codes where len is less than drop + curr,
154 those top drop + curr - len bits are incremented through all values to
204 curr = root; /* current table index bits */
234 fill = 1U << curr;
266 next += min; /* here min is 1 << curr */
269 curr = len - drop;
270 left = (int)(1 << curr);
271 while (curr + drop < max)
    [all...]
  /external/qemu/distrib/zlib-1.2.8/
inftrees.c 44 unsigned curr; /* number of index bits for current table */ local
151 filled is at next and has curr index bits. The code being used is huff
153 bits off of the bottom. For codes where len is less than drop + curr,
154 those top drop + curr - len bits are incremented through all values to
204 curr = root; /* current table index bits */
234 fill = 1U << curr;
266 next += min; /* here min is 1 << curr */
269 curr = len - drop;
270 left = (int)(1 << curr);
271 while (curr + drop < max)
    [all...]
  /external/zlib/src/
inftrees.c 44 unsigned curr; /* number of index bits for current table */ local
151 filled is at next and has curr index bits. The code being used is huff
153 bits off of the bottom. For codes where len is less than drop + curr,
154 those top drop + curr - len bits are incremented through all values to
204 curr = root; /* current table index bits */
234 fill = 1U << curr;
266 next += min; /* here min is 1 << curr */
269 curr = len - drop;
270 left = (int)(1 << curr);
271 while (curr + drop < max)
    [all...]
  /packages/apps/UnifiedEmail/src/org/apache/james/mime4j/
MimeStreamParser.java 235 int curr = 0; local
237 while ((curr = is.read()) != -1) {
238 if (curr == '\n' && (prev == '\n' || prev == 0)) {
245 sb.append((char) curr);
246 prev = curr == '\r' ? prev : curr;
249 // if (curr == -1 && log.isWarnEnabled()) {
  /external/libunwind/src/ia64/
Gscript.c 402 if (sr->curr.reg[r].where == IA64_WHERE_NONE
403 || sr->curr.reg[r].when >= sr->when_target)
416 max_when = sr->curr.reg[max_reg].when;
419 if (sr->curr.reg[regorder[j]].when > max_when)
423 max_when = sr->curr.reg[max_reg].when;
454 if (sr.when_target > sr.curr.reg[IA64_REG_PSP].when
455 && (sr.curr.reg[IA64_REG_PSP].where == IA64_WHERE_NONE)
456 && sr.curr.reg[IA64_REG_PSP].val != 0)
460 insn.val = sr.curr.reg[IA64_REG_PSP].val; /* frame size */
464 compile_reg (&sr, IA64_REG_PSP, sr.curr.reg + IA64_REG_PSP, script)
    [all...]
  /external/tcpdump/tests/
of10_p3295-vv.out 31 curr 0x00000000
38 curr 0x00000000
45 curr 0x00000000
52 curr 0x00000000
59 curr 0x00000000
66 curr 0x00000000
73 curr 0x00000000
80 curr 0x00000000
87 curr 0x00000000
94 curr 0x0000000
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/rendering/
RenderBlock.cpp 410 RenderBlock* curr = toRenderBlock(continuation());
413 while (curr) {
414 if (beforeChild && beforeChild->parent() == curr) {
415 if (curr->firstChild() == beforeChild)
417 return curr;
421 last = curr;
422 curr = toRenderBlock(curr->continuation());
482 RenderObject* curr = beforeChild; local
483 while (curr && curr->parent() != this
613 RenderBoxModelObject* curr = toRenderBoxModelObject(parent()); local
777 RenderObject* curr = this; local
938 RenderObject * curr = start; local
2356 RenderBox* curr; local
    [all...]
  /external/e2fsprogs/e2fsck/
dict.c 893 dnode_t *dict_next(dict_t *dict, dnode_t *curr)
897 if (curr->right != nil) {
898 curr = curr->right;
899 while ((left = curr->left) != nil)
900 curr = left;
901 return curr;
904 parent = curr->parent;
906 while (parent != nil && curr == parent->right) {
907 curr = parent
1085 dnode_t *curr, *dictnil = dict_nil(dict), *loadnil = &load->nilnode, *next; local
    [all...]
  /packages/apps/Camera2/src/com/android/camera/widget/
FilmstripView.java 908 ViewItem curr = mViewItem[mCurrentItem]; local
1017 final ViewItem curr = mViewItem[currItem]; local
1114 final ViewItem curr = mViewItem[itemID]; local
1126 final ViewItem curr = mViewItem[itemID]; local
1193 final ViewItem curr = mViewItem[itemID]; local
1202 final ViewItem curr = mViewItem[itemID]; local
1342 int curr = BUFFER_SIZE - 1; local
1386 int curr = 0; local
1662 ViewItem curr = mViewItem[mCurrentItem]; local
2895 ViewItem curr = mViewItem[mCurrentItem]; local
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/html/
HTMLMapElement.cpp 71 for (unsigned i = 0; Element* curr = images->item(i); ++i) {
72 ASSERT(isHTMLImageElement(curr));
76 HTMLImageElement& imageElement = toHTMLImageElement(*curr);
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/svga/
svga_pipe_clear.c 48 struct pipe_framebuffer_state *fb = &svga->curr.framebuffer;
74 if ((svga->curr.framebuffer.zsbuf->format == PIPE_FORMAT_S8_UINT_Z24_UNORM) &&
116 svga_surface(svga->curr.framebuffer.cbufs[0])->handle);
svga_context.c 77 pipe_resource_reference( &svga->curr.cb[shader], NULL );
207 svga->curr.nr_fbs = 0;
288 if (svga->curr.framebuffer.cbufs[i])
289 svga_propagate_surface(svga, svga->curr.framebuffer.cbufs[i]);
292 if (svga->curr.framebuffer.zsbuf)
293 svga_propagate_surface(svga, svga->curr.framebuffer.zsbuf);
  /external/jsilver/src/com/google/clearsilver/jsilver/data/
NestedMapData.java 102 NestedMapData curr = sym.firstChild; local
103 while (curr != null) {
104 sym.children.put(curr.getName(), curr); local
105 curr = curr.nextSibling;
348 NestedMapData curr = sym.firstChild; local
349 while (curr != null) {
350 if (curr.getName().equals(name)) {
351 return curr;
    [all...]
  /external/llvm/lib/Transforms/Scalar/
ADCE.cpp 72 Instruction* curr = worklist.pop_back_val(); local
73 for (Instruction::op_iterator OI = curr->op_begin(), OE = curr->op_end();
  /external/opencv/cvaux/src/
cvlines.cpp 207 int curr; local
211 curr = 0;
218 start.x = scanlines[curr++];
219 start.y = scanlines[curr++];
221 end.x = scanlines[curr++];
222 end.y = scanlines[curr++];
253 int curr; local
259 curr = 0;
266 start.x = scanlines[curr++];
267 start.y = scanlines[curr++]
    [all...]
  /external/e2fsprogs/lib/ext2fs/
extent.c 47 void *curr; member in struct:extent_path
254 handle->path[0].curr = 0;
371 ix = path->curr;
379 path->curr = 0;
384 if (path->curr) {
385 ix = path->curr;
392 path->curr = ix;
396 if (!path->curr ||
399 ix = path->curr;
401 path->curr = ix
    [all...]
  /external/chromium_org/third_party/openssl/openssl/crypto/pqueue/
pqueue.c 113 pitem *curr, *next; local
121 for(curr = NULL, next = pq->items;
123 curr = next, next = next->next)
132 if (curr == NULL)
135 curr->next = item;
145 curr->next = item;
  /external/openssl/crypto/pqueue/
pqueue.c 113 pitem *curr, *next; local
121 for(curr = NULL, next = pq->items;
123 curr = next, next = next->next)
132 if (curr == NULL)
135 curr->next = item;
145 curr->next = item;
  /prebuilts/misc/common/swig/include/2.0.11/octave/
octiterators.swg 126 OctSwigIterator_T(out_iterator curr, octave_value seq)
127 : OctSwigIterator(seq), current(curr)
184 OctSwigIteratorOpen_T(out_iterator curr, octave_value seq)
185 : OctSwigIterator_T<OutIterator>(curr, seq)
227 OctSwigIteratorClosed_T(out_iterator curr, out_iterator first, out_iterator last, octave_value seq)
228 : OctSwigIterator_T<OutIterator>(curr, seq), begin(first), end(last)
  /prebuilts/misc/common/swig/include/2.0.11/python/
std_map.i 33 SwigPyMapIterator_T(OutIterator curr, OutIterator first, OutIterator last, PyObject *seq)
34 : SwigPyIteratorClosed_T<OutIterator,ValueType,FromOper>(curr, first, last, seq)
44 SwigPyMapKeyIterator_T(OutIterator curr, OutIterator first, OutIterator last, PyObject *seq)
45 : SwigPyMapIterator_T<OutIterator, FromOper>(curr, first, last, seq)
61 SwigPyMapValueITerator_T(OutIterator curr, OutIterator first, OutIterator last, PyObject *seq)
62 : SwigPyMapIterator_T<OutIterator, FromOper>(curr, first, last, seq)
  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
u_time.h 121 const struct util_time *curr)
123 return os_time_timeout(start->counter, end->counter, curr->counter);
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
nv50_ir_graph.cpp 354 void Graph::classifyDFS(Node *curr, int& seq)
359 curr->visit(++seq);
360 curr->tag = 1;
362 for (edge = curr->out; edge; edge = edge->next[0]) {
371 if (node->getSequence() > curr->getSequence()) {
378 for (edge = curr->in; edge; edge = edge->next[1]) {
387 if (node->getSequence() > curr->getSequence()) {
394 curr->tag = 0;

Completed in 653 milliseconds

1 2 3 4 56 7 8 91011>>