| /external/e2fsprogs/lib/ext2fs/ |
| res_gdt.c | 136 unsigned int grp, last = 0; local
180 if (!gdt_buf[last]) {
183 expect, grp, gdt_blk, last);
185 gdt_buf[last] = expect;
188 } else if (gdt_buf[last] != expect) {
191 gdt_buf[last], expect, gdt_blk, last);
196 last++;
|
| /external/harfbuzz_ng/src/ |
| hb-ot-shape-complex-indic-machine.rl | 101 if (0) fprintf (stderr, "syllable %d..%d %s\n", last, p+1, #syllable_type); \
102 for (unsigned int i = last; i < p+1; i++) \
104 last = p+1; \
123 unsigned int last = 0;
|
| hb-ot-shape-complex-myanmar-machine.rl | 97 if (0) fprintf (stderr, "syllable %d..%d %s\n", last, p+1, #syllable_type); \
98 for (unsigned int i = last; i < p+1; i++) \
100 last = p+1; \
119 unsigned int last = 0;
|
| /external/iptables/extensions/ |
| libxt_NFQUEUE.c | 35 " --queue-balance first:last Balance flows between queues <value> to <value>.\n");
131 unsigned int last = tinfo->queues_total; local
133 if (last > 1) {
134 last += tinfo->queuenum - 1;
135 printf(" NFQUEUE balance %u:%u", tinfo->queuenum, last);
172 unsigned int last = tinfo->queues_total; local
174 if (last > 1) {
175 last += tinfo->queuenum - 1;
176 printf(" --queue-balance %u:%u", tinfo->queuenum, last);
|
| /external/libcxx/test/algorithms/alg.sorting/alg.binary.search/binary.search/ |
| binary_search.pass.cpp | 16 // binary_search(Iter first, Iter last, const T& value);
26 test(Iter first, Iter last, const T& value, bool x)
28 assert(std::binary_search(first, last, value) == x);
|
| binary_search_comp.pass.cpp | 16 // binary_search(Iter first, Iter last, const T& value, Compare comp);
27 test(Iter first, Iter last, const T& value, bool x)
29 assert(std::binary_search(first, last, value, std::greater<int>()) == x);
|
| /external/libcxx/test/numerics/numeric.ops/accumulate/ |
| accumulate_op.pass.cpp | 17 // accumulate(Iter first, Iter last, T init, BinaryOperation binary_op);
27 test(Iter first, Iter last, T init, T x)
29 assert(std::accumulate(first, last, init, std::multiplies<T>()) == x);
|
| /external/libopus/celt/tests/ |
| test_unit_mathops.c | 101 opus_int32 min_d,max_d,last,chk; local
103 last=min_d=32767;
109 d = last - q;
112 last = q;
125 opus_int32 min_d,max_d,last,chk; local
127 last=min_d=15059;
135 d = last - q;
140 last = q;
|
| /external/mesa3d/src/mesa/x86/ |
| sse.c | 73 GLfloat *last,
79 GLfloat *last,
|
| /external/mockito/cglib-and-asm/src/org/mockito/asm/ |
| AnnotationWriter.java | 262 AnnotationWriter last = null;
local
267 aw.prev = last;
268 last = aw;
273 aw = last;
299 AnnotationWriter last = null;
local
304 aw.prev = last;
305 last = aw;
309 aw = last;
|
| /external/oprofile/daemon/ |
| opd_trans.h | 44 struct sfile * last; member in struct:transient
67 trans->last = trans->current;
|
| /external/chromium_org/third_party/libphonenumber/src/phonenumbers/utf/ |
| unicodetext.cc | 51 const UnicodeText::const_iterator& last) {
52 return CodepointDistance(first.it_, last.it_);
205 const UnicodeText::const_iterator& last) {
206 assert(first <= last && "Incompatible iterators");
207 repr_.append(first.it_, last.it_ - first.it_);
211 const const_iterator& last) {
212 assert(first <= last && "Incompatible iterators");
213 return string(first.it_, last.it_ - first.it_);
291 const const_iterator &last) {
292 assert(first <= last && " Incompatible iterators")
[all...] |
| /bionic/libc/upstream-netbsd/lib/libc/gen/ |
| popen.c | 193 struct pid *cur, *last; local
202 for (last = NULL, cur = pidlist; cur; last = cur, cur = cur->next)
213 if (last == NULL)
216 last->next = cur->next;
|
| /external/chromium_org/media/cast/test/utility/ |
| audio_utility.cc | 51 float last = 0.0f; local
52 for (; i < length && fabsf(last) < kAmplitudeThreshold; ++i)
53 last = samples[i];
56 (last < 0) != (samples[i] < 0)) {
58 last = samples[i];
|
| /external/llvm/lib/CodeGen/ |
| ScoreboardHazardRecognizer.cpp | 97 unsigned last = Depth - 1; local
98 while ((last > 0) && ((*this)[last] == 0))
99 last--;
101 for (unsigned i = 0; i <= last; i++) {
|
| /external/chromium_org/third_party/WebKit/Source/platform/text/ |
| BidiResolver.h | 82 // Check to see if our last midpoint is a start point beyond the line break. If so,
132 , last(WTF::Unicode::OtherNeutral)
141 eor = lastStrong = last = direction;
148 , last(lastDir)
155 WTF::Unicode::Direction last; member in struct:blink::BidiStatus
176 return status1.eor == status2.eor && status1.last == status2.last && status1.lastStrong == status2.lastStrong && *(status1.context) == *(status2.context);
220 void setLastDir(WTF::Unicode::Direction lastDir) { m_status.last = lastDir; }
279 Iterator m_eor; // Points to the last character in the current run.
283 // m_endOfRunAtEndOfLine is "the position last eor in the end of line
[all...] |
| /external/libpng/contrib/libtests/ |
| pngimage.c | 5 * Last changed in libpng 1.6.10 [March 6, 2014]
348 struct buffer_list *last; /* last buffer in use */ member in struct:buffer
349 size_t end_count; /* bytes in the last buffer */
360 buffer->last = NULL;
368 buffer->last = &buffer->first;
418 struct buffer_list *last = &buffer->first; local
423 size_t r = fread(last->buffer+count, 1/*size*/,
424 (sizeof last->buffer)-count, fp);
430 if (count >= sizeof last->buffer
729 struct buffer_list *last = bp->current; local
1191 struct buffer_list *last = buffer->last; local
[all...] |
| /external/libsepol/src/ |
| hashtab.c | 108 hashtab_ptr_t cur, last; local
114 last = NULL;
117 last = cur;
124 if (last == NULL)
127 last->next = cur->next;
254 hashtab_ptr_t last, cur, temp; local
260 last = NULL;
265 if (last) {
266 last->next = cur->next;
278 last = cur
[all...] |
| sidtab.c | 90 sidtab_node_t *cur, *last; local
96 last = NULL;
99 last = cur;
106 if (last == NULL)
109 last->next = cur->next;
174 sidtab_node_t *last, *cur, *temp; local
180 last = NULL;
185 if (last) {
186 last->next = cur->next;
197 last = cur
[all...] |
| /external/bison/data/ |
| location.cc | 283 position last = loc.end - 1;
285 if (last.filename
287 || *loc.begin.filename != *last.filename))
288 ostr << '-' << last;
289 else if (loc.begin.line != last.line)
290 ostr << '-' << last.line << '.' << last.column;
291 else if (loc.begin.column != last.column)
292 ostr << '-' << last.column;
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkPathOpsDebug.cpp | 519 const SkOpSpan* last = NULL; local
534 if (last) {
535 SK_ALWAYSBREAK(last->fT != span.fT || last->fOther != span.fOther);
536 bool tsEqual = last->fT == span.fT;
537 bool tsPreciselyEqual = precisely_equal(last->fT, span.fT);
539 bool pointsEqual = last->fPt == span.fPt;
540 bool pointsNearlyEqual = AlmostEqualUlps(last->fPt, span.fPt);
544 // SK_ALWAYSBREAK(!last->fTiny || !tsPreciselyEqual || span.fTiny || tinyTFound);
545 SK_ALWAYSBREAK(last->fTiny || tsPreciselyEqual || !pointsEqual || hasLoop)
[all...] |
| /external/llvm/include/llvm/ADT/ |
| ilist.h | 119 ilist_iterator<NodeTy> /*last*/) {}
308 /// of the first node in the list always points to the last node in the list,
484 // [first, last) into position.
486 void transfer(iterator position, iplist &L2, iterator first, iterator last) {
487 assert(first != last && "Should be checked by callers");
493 if (position != last) {
501 // Remove [first, last) from its old position.
503 NodeTy *Next = last.getNodePtrUnchecked(), *Last = this->getPrev(Next);
510 // Splice [first, last) into its new position
575 iterator last = first; ++last; local
[all...] |
| /external/chromium_org/chrome/installer/util/ |
| language_selector.cc | 91 bool IsArraySorted(const LangToOffset* first, const LangToOffset* last,
93 if (last - first > 1) {
94 for (--last; first != last; ++first) {
149 bool TryFindOffset(const LangToOffset* first, const LangToOffset* last,
151 const LangToOffset* search_result = std::lower_bound(first, last, name);
152 if (last != search_result && search_result->language == name) {
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| NodeRenderingTraversal.cpp | 140 Node* last = currentElement->pseudoElement(AFTER); local
141 if (last)
142 return last;
144 last = lastChild(currentElement);
145 if (!last)
146 last = currentElement->pseudoElement(BEFORE);
147 return last;
|
| /external/chromium_org/third_party/WebKit/Source/core/html/parser/ |
| HTMLTreeBuilderSimulator.cpp | 125 if (namespaceStack.isEmpty() || namespaceStack.last() != currentNamespace)
142 if ((m_namespaceStack.last() == SVG && tokenExitsSVG(token))
143 || (m_namespaceStack.last() == MathML && tokenExitsMath(token)))
165 if ((m_namespaceStack.last() == SVG && threadSafeMatch(tagName, SVGNames::svgTag))
166 || (m_namespaceStack.last() == MathML && threadSafeMatch(tagName, MathMLNames::mathTag))
167 || (m_namespaceStack.contains(SVG) && m_namespaceStack.last() == HTML && tokenExitsSVG(token))
168 || (m_namespaceStack.contains(MathML) && m_namespaceStack.last() == HTML && tokenExitsMath(token)))
|
