| /external/llvm/include/llvm/ADT/ |
| ilist.h | 118 ilist_iterator<NodeTy> /*last*/) {}
307 /// of the first node in the list always points to the last node in the list,
470 // [first, last) into position.
472 void transfer(iterator position, iplist &L2, iterator first, iterator last) {
473 assert(first != last && "Should be checked by callers");
475 if (position != last) {
483 // Remove [first, last) from its old position.
485 NodeTy *Next = last.getNodePtrUnchecked(), *Last = this->getPrev(Next);
492 // Splice [first, last) into its new position
557 iterator last = first; ++last; local
[all...] |
| /external/opencv/cv/src/ |
| cvsegmentation.cpp | 59 CvWSNode* last; member in struct:CvWSQueue
124 if( q[idx].last ) \
125 q[idx].last->next=node; \
128 q[idx].last = node; \
136 q[idx].last = 0; \
|
| /external/opencv/cxcore/src/ |
| cxswitcher.cpp | 349 CvModuleInfo *CvModule::first = 0, *CvModule::last = 0; member in class:CvModule
354 info = last;
368 if( last == info )
369 last = p;
519 CvModule::last->next = module_copy;
520 CvModule::last = module_copy; member in class:CvModule
522 if( CvModule::first == CvModule::last )
|
| /external/openssl/crypto/des/ |
| des.c | 370 int num=0,j,k,l,rem,ll,len,last,ex=0; local
622 last=obuf[l-1];
624 if ((last > 7) || (last < 0))
629 last=0;
631 l=l-8+last;
|
| /external/oprofile/daemon/ |
| opd_ibs.c | 753 struct sfile * last = trans->last; local
780 hash = last->hashval & (CG_HASH_SIZE - 1);
783 * 'last', we use its hash.
787 if (sfile_equal(last, &cg->to)) {
794 sfile_dup(&cg->to, last);
800 opd_open_sample_file(file, last, sf, counter, is_cg);
|
| /external/oprofile/gui/ |
| oprof_start.cpp | 404 static time_t last = time(0); local
424 if (curr - last)
425 ss << " (" << dstat.nr_interrupts / (curr - last) << " interrupts / second, total " << total_nr_interrupts << ")";
429 last = curr;
519 // The deal is simple: QT lack of a way to know what item was the last
1042 "reset your last profile session ?", "Yes", "No", 0, 0, 1);
1048 daemon_label->setText("Last profile session reseted.");
|
| /external/qemu/block/ |
| qcow2-refcount.c | 462 int64_t start, last, cluster_offset; local
479 last = (offset + length - 1) & ~(s->cluster_size - 1);
480 for(cluster_offset = start; cluster_offset <= last;
535 /* Write last changed block to disk */
730 int64_t start, last, cluster_offset; local
734 last = (offset + size - 1) & ~(s->cluster_size - 1);
735 for(cluster_offset = start; cluster_offset <= last;
896 int64_t start, last, cluster_offset; local
903 last = (offset + size - 1) & ~(s->cluster_size - 1);
904 for(cluster_offset = start; cluster_offset <= last;
[all...] |
| /external/skia/gpu/src/ |
| GrRedBlackTree.h | 58 * legal to decerement end() if the tree is not empty to get the last
59 * element. However, a last() helper is provided.
90 * Gets the last valid iterator. This is always valid, even on an empty.
92 * @return an iterator that is just beyond the last item in sorted order.
96 * @return an iterator that to the last item in sorted order, or end() if
99 Iter last();
115 * Finds the last of an item in iterator order.
117 * @return an iterator to the last element equal to t or end() if
215 *this = fTree->last();
255 typename GrRedBlackTree<T,C>::Iter GrRedBlackTree<T,C>::last() { function in class:GrRedBlackTree
367 bool last = true; local
[all...] |
| /external/skia/src/animator/ |
| SkDisplayApply.cpp | 472 SkOperand* last = new SkOperand[count]; local
473 SkAutoTDelete<SkOperand> autoLast(last);
475 info->getValue(target, last, count);
483 last[0] = scriptValue.fOperand;
489 memcpy(save, last, count * sizeof(SkOperand));
757 SkTDOperandArray last; local
762 last.setCount(count);
763 memcpy(last.begin(), fActive->fSaveRestore[activeIndex], count * sizeof(SkOperand));
768 info->setValue(target, last.begin(), count);
778 scriptValue.fOperand = last[0]
[all...] |
| /external/skia/src/core/ |
| SkScan_Path.cpp | 423 static SkEdge* sort_edges(SkEdge* list[], int count, SkEdge** last) {
432 *last = list[count - 1];
484 SkEdge headEdge, tailEdge, *last; local
485 // this returns the first and last edge after they're sorted into a dlink list
486 SkEdge* edge = sort_edges(list, count, &last);
494 tailEdge.fPrev = last;
497 last->fNext = &tailEdge;
672 SkEdge headEdge, tailEdge, *last; local
674 // this returns the first and last edge after they're sorted into a dlink list
675 SkEdge* edge = sort_edges(list, count, &last);
[all...] |
| /external/srec/srec/cfront/ |
| sp_fft.c | 241 when we compute two point butterflieswe at the last stage
550 /* Compute 2 point butterflies of the last stage */
603 ** queeze the real valued first and last component of
642 fftdata tr, ti, last; local
682 /* compute the real input fft, the real valued first and last component of
756 last = himul32(tr, tr);
757 maxval |= last;
772 data[n1] = last; /* now the Nyquist freq can be put in place */
|
| /external/tcpdump/ |
| print-rx.c | 78 { RX_LAST_PACKET, 0, "last-pckt" },
624 /* Start the search where we last left off */
2304 int i, start, last; local
[all...] |
| /external/valgrind/main/coregrind/m_debuginfo/ |
| storage.c | 696 DiAddrRange *first, *last, *range; local
755 last = VG_(OSetGen_Lookup)( scope, &aMax );
756 vg_assert(last->aMin <= last->aMax);
757 vg_assert(last->aMin <= aMax && aMax <= last->aMax);
759 if (aMax < last->aMax) {
761 /* We have to split 'last'. */
762 /* truncate the lower end of 'last' */
763 Addr tmp = last->aMin
[all...] |
| /external/webkit/Source/JavaScriptCore/wtf/ |
| ListHashSet.h | 97 ValueType& last();
98 const ValueType& last() const;
474 inline T& ListHashSet<T, inlineCapacity, U>::last() function in class:WTF::ListHashSet
481 inline const T& ListHashSet<T, inlineCapacity, U>::last() const function in class:WTF::ListHashSet
|
| /external/webkit/Source/WebCore/dom/ |
| ContainerNode.cpp | 370 nodes.last().get()->willRemove();
658 Node* last = m_lastChild; local
667 childrenChanged(true, last, 0, 1);
896 // find the last text/image child, to get a position
[all...] |
| /external/webkit/Source/WebCore/page/ |
| Settings.cpp | 505 int last = m_page->backForward()->forwardCount(); local
506 for (int i = first; i <= last; i++)
|
| /external/webkit/Source/WebCore/platform/text/ |
| BidiResolver.h | 61 , last(WTF::Unicode::OtherNeutral)
68 , last(lastDir)
75 WTF::Unicode::Direction last; member in struct:WebCore::BidiStatus
96 return status1.eor == status2.eor && status1.last == status2.last && status1.lastStrong == status2.lastStrong && *(status1.context) == *(status2.context);
171 void setLastDir(WTF::Unicode::Direction lastDir) { m_status.last = lastDir; }
267 ASSERT(m_status.last != NonSpacingMark
268 && m_status.last != BoundaryNeutral
269 && m_status.last != RightToLeftEmbedding
270 && m_status.last != LeftToRightEmbeddin
[all...] |
| /external/webp/src/dec/ |
| io.c | 166 if (i == len - 1) { /* last one */ \
265 const int last = io->mb_h - 1; local
267 for (j = 0; j < last; j += 2) {
275 if (j == last) { // Just do the last line twice
294 const int last = io->mb_h;
296 for (j = 0; j < last; ++j) {
351 // move to last row
359 // (except for the very last row)
362 // Process the very last row of even-sized pictur
[all...] |
| /external/webp/src/enc/ |
| frame.c | 31 int last; member in struct:__anon13756
110 if (!Record(res->last >= 0, s[0])) {
151 if (n == 16 || !Record(n <= res->last, s[0])) {
209 res->last = -1;
212 res->last = n;
228 cost = VP8BitCost(res->last >= 0, p[0]);
229 if (res->last < 0) {
232 while (n <= res->last) {
249 cost += VP8BitCost(n <= res->last, p[0]);
287 it->top_nz_[x] = it->left_nz_[y] = (res.last >= 0)
[all...] |
| /external/wpa_supplicant_6/wpa_supplicant/ |
| ctrl_iface.c | 1956 struct wpa_interface_info *iface = NULL, *last = NULL, *tmp; local
[all...] |
| /external/wpa_supplicant_6/wpa_supplicant/wpa_gui-qt4/ |
| wpagui.cpp | 506 bool last = false; local
509 last = true;
542 if (last)
608 bool last = false; local
611 last = true;
646 if (last)
829 /* Update last message with truncated version of the event */
[all...] |
| /external/wpa_supplicant_8/wpa_supplicant/wpa_gui-qt4/ |
| wpagui.cpp | 532 bool last = false; local
535 last = true;
570 if (last)
638 bool last = false; local
641 last = true;
663 if (last)
683 if (last)
868 /* Update last message with truncated version of the event */
[all...] |
| /frameworks/base/core/java/android/widget/ |
| ExpandableListConnector.java | 149 * last child's flat list position, so search right
563 /* Num children for this group is its last child's fl pos minus
795 // last position scanned so far
796 int last = seedGroupPosition; local
804 // True when we have looked at the last item in the data
821 hitLast = last == count - 1;
831 last++;
832 seedGroupPosition = last;
[all...] |
| /frameworks/base/libs/rs/ |
| rsContext.cpp | 137 uint64_t last = mTimeLast; local
139 mTimers[mTimerActive] += mTimeLast - last;
|
| /libcore/luni/src/main/java/java/sql/ |
| ResultSet.java | 112 * in the forward direction, first to last.
118 * in the reverse direction, last to first.
151 * returns the last row.
160 * Moves the cursor to the end of the {@code ResultSet}, after the last row.
1188 public boolean last() throws SQLException; method in interface:ResultSet
[all...] |
