| /external/owasp/sanitizer/src/main/org/owasp/html/ |
| TagBalancingHtmlStreamEventReceiver.java | 179 int last = openElements.size(); local
182 while (--last > index) {
183 ElementContainmentInfo unclosed = openElements.remove(last);
184 if (last + 1 < nestingLimit) {
[all...] |
| /external/pdfium/core/src/fdrm/crypto/ |
| fx_crypt_sha.cpp | 338 FX_DWORD last, padn; local
345 last = ctx->total[0] & 0x3F;
346 padn = (last < 56) ? (56 - last) : (120 - last);
579 FX_DWORD last, padn; local
587 last = (FX_DWORD)ctx->total[0] & 0x7F;
588 padn = (last < 112) ? (112 - last) : (240 - last);
626 FX_DWORD last, padn; local
[all...] |
| /external/pdfium/third_party/lcms2-2.6/src/ |
| cmsgamma.c | 673 // A segmented tone curve should have function segments in the first and last positions
1148 int i, last; local
[all...] |
| /external/skia/src/animator/ |
| SkDisplayApply.cpp | 465 SkOperand* last = new SkOperand[count]; local
466 SkAutoTDelete<SkOperand> autoLast(last);
468 info->getValue(target, last, count);
476 last[0] = scriptValue.fOperand;
482 memcpy(save, last, count * sizeof(SkOperand));
750 SkTDOperandArray last; local
755 last.setCount(count);
756 memcpy(last.begin(), fActive->fSaveRestore[activeIndex], count * sizeof(SkOperand));
761 info->setValue(target, last.begin(), count);
771 scriptValue.fOperand = last[0]
[all...] |
| /external/skia/src/core/ |
| SkScan_Path.cpp | 411 static SkEdge* sort_edges(SkEdge* list[], int count, SkEdge** last) {
420 *last = list[count - 1];
468 SkEdge headEdge, tailEdge, *last; local
469 // this returns the first and last edge after they're sorted into a dlink list
470 SkEdge* edge = sort_edges(list, count, &last);
478 tailEdge.fPrev = last;
481 last->fNext = &tailEdge;
719 SkEdge headEdge, tailEdge, *last; local
721 // this returns the first and last edge after they're sorted into a dlink list
722 SkEdge* edge = sort_edges(list, count, &last);
[all...] |
| /external/skia/tests/ |
| PathOpsAngleTest.cpp | 88 SkDPoint last; local
90 last = quad[1];
102 } while (last.asSkPoint() != quad[1].asSkPoint());
103 float p1 = SkDoubleToScalar(line[1].fX * last.fY);
104 float p2 = SkDoubleToScalar(line[1].fY * last.fX);
111 line[1].fX, line[1].fY, t, t2, t3, moveT, last.fX, last.fY, epsilon);
115 double a2 = atan2(last.fY, last.fX);
120 line[1].fX, line[1].fY, t, t2, t3, moveT, last.fX, last.fY, angle)
[all...] |
| /external/toybox/toys/pending/ |
| diff.c | 51 unsigned last:1; member in struct:v_vector
143 * 3. if E[p].last true break i.e we have reached at the end of an equiv class
172 if (E[p].last) break;
236 if ((r -1)->last) return 0;
245 * classes of lines in file[1], with e.last = true on the last element of each class.
302 e[0].last = 1;
304 if ((i == file[1].len) || (v[1][i].hash != v[1][i+1].hash)) e[i].last = 1;
305 else e[i].last = 0;
324 k = 0; //last successfully filled k candidate
[all...] |
| /external/v8/src/compiler/arm/ |
| code-generator-arm.cc | 1117 uint32_t last = base::bits::CountLeadingZeros32(saves_fp) - 1; local
1153 uint32_t last = base::bits::CountLeadingZeros32(saves_fp) - 1; local
[all...] |
| /external/v8/src/crankshaft/ |
| hydrogen-gvn.cc | 580 HBasicBlock* last = block->loop_information()->GetLastBackEdge(); local
581 for (int j = block->block_id(); j <= last->block_id(); ++j) {
699 // that call can reuse "this" if we are at the last dominated block.
745 // No need to copy the map for the last child in the dominator tree.
|
| /external/valgrind/coregrind/ |
| m_options.c | 337 HChar const* last = VG_(clo_trace_children_skip); local
339 while (*last) {
342 HChar const* first = consume_commas(last);
343 last = consume_field(first);
344 if (first == last)
346 vg_assert(last > first);
349 patt = VG_(calloc)("m_options.swttc.1", last - first + 1, 1);
350 VG_(memcpy)(patt, first, last - first);
351 vg_assert(patt[last-first] == 0);
362 HChar const* last = VG_(clo_trace_children_skip_by_arg) local
[all...] |
| /external/webrtc/webrtc/base/ |
| thread_unittest.cc | 28 TestGenerator() : last(0), count(0) {}
31 int result = prev + last;
32 last = result;
37 int last; member in class:TestGenerator
226 EXPECT_EQ(34, msg_client.last);
228 EXPECT_EQ(55, sock_client.last);
|
| /external/wpa_supplicant_8/src/eap_server/ |
| tncs.c | 1023 struct tnc_if_imv *imv, *last; local
1026 last = NULL;
1050 if (last == NULL)
1053 last->next = imv;
1054 last = imv;
|
| /frameworks/base/core/java/android/content/ |
| UndoManager.java | 74 * Never merge with the last undo state.
79 * Allow merge with the last undo state only if it contains
85 * Always allow merge with the last undo state, if possible.
226 * Perform undo of last/top <var>count</var> undo states. The states impacted
263 * Perform redo of last/top <var>count</var> undo states in the transient redo stack.
492 * @param owner Optional owner of last operation to retrieve. If null, the last
493 * operation regardless of owner will be retrieved; if non-null, the last operation
505 * @param clazz Optional class of the last operation to retrieve. If null, the
506 * last operation regardless of class will be retrieved; if non-null, the las
521 UndoOperation<?> last; local
[all...] |
| /frameworks/base/core/java/android/view/ |
| InputEventConsistencyVerifier.java | 59 // It does not make sense to examine the contents of the last event since it may have
740 KeyState last = null; local
[all...] |
| /frameworks/base/core/java/android/widget/ |
| ExpandableListConnector.java | 149 * last child's flat list position, so search right
565 /* Num children for this group is its last child's fl pos minus
801 // last position scanned so far
802 int last = seedGroupPosition; local
810 // True when we have looked at the last item in the data
827 hitLast = last == count - 1;
837 last++;
838 seedGroupPosition = last;
[all...] |
| /frameworks/compile/mclinker/lib/Target/ARM/ |
| ARMLDBackend.cpp | 717 // Move the first fragment (align fragment) and last fragment (null fragment)
722 SectionData::iterator last = sectData->end(); local
723 --last;
726 assert(last->getKind() == Fragment::Null);
729 tmp.splice(tmp.end(), list, last);
787 // Add the first and the last fragment back.
[all...] |
| /frameworks/opt/timezonepicker/src/com/android/timezonepicker/ |
| TimeZoneData.java | 231 TimeZoneInfo last = null; local
248 if (true && last != null) {
249 if (last.compareTo(tz) == 0) {
251 Log.e("SAME", last.toString());
259 last = tz;
333 // Last: Old tz id
|
| /frameworks/rs/api/ |
| Specification.cpp | 123 * We know that's it's a vector type if the last character is a digit and
127 const int last = type.size() - 1; local
128 const char lastChar = type[last];
130 const string trimmed = type.substr(0, last);
[all...] |
| /hardware/qcom/display/msm8084/libhwcomposer/ |
| hwc_copybit.cpp | 120 // Skipping last layer since FrameBuffer layer should not affect
271 uint32_t last = 0; local
280 last = (uint32_t)list->numHwLayers - 1;
281 renderBuffer = (private_handle_t *)list->hwLayers[last].handle;
298 if(list->hwLayers[last].acquireFenceFd >=0) {
300 copybit->set_sync(copybit, list->hwLayers[last].acquireFenceFd);
344 list->hwLayers[last].acquireFenceFd >= 0) {
345 close(list->hwLayers[last].acquireFenceFd);
346 list->hwLayers[last].acquireFenceFd = -1;
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedQueue.java | 95 * - There is exactly one (last) Node with a null next reference,
96 * which is CASed when enqueueing. This last Node can be
126 * to be two or more steps away from the first/last node.
194 * A node from which the last node on list (that is, the unique
197 * - the last node is always reachable from tail via succ()
287 // p is last node
488 Node<E> beginningOfTheEnd = null, last = null; local
492 beginningOfTheEnd = last = newNode;
494 lazySetNext(last, newNode);
495 last = newNode
[all...] |
| LinkedBlockingQueue.java | 100 * - null, meaning there is no successor (this is the last node)
121 * Invariant: last.next == null
123 private transient Node<E> last; field in class:LinkedBlockingQueue
171 // assert last.next == null;
172 last = last.next = node;
234 last = head = new Node<E>(null);
496 if (last == p)
497 last = trail;
649 head = last;
[all...] |
| /libcore/ojluni/src/main/java/java/sql/ |
| ResultSet.java | 49 * last row. It is possible to
159 * the cursor is positioned after the last row. Any
212 * the last column read had a value of SQL <code>NULL</code>.
218 * @return <code>true</code> if the last column value read was SQL
1158 boolean last() throws SQLException; method in interface:ResultSet
[all...] |
| /libcore/ojluni/src/main/java/java/util/ |
| LinkedList.java | 91 * Invariant: (first == null && last == null) ||
97 * Pointer to last node.
98 * Invariant: (first == null && last == null) ||
99 * (last.next == null && last.item != null)
101 transient Node<E> last; field in class:LinkedList
130 last = newNode;
138 * Links e as last element.
141 final Node<E> l = last;
143 last = newNode
[all...] |
| /libcore/ojluni/src/test/java/util/stream/bootlib/java/util/stream/ |
| LambdaTestHelpers.java | 219 T last = i.next();
222 assertTrue(last.compareTo(t) <= 0);
223 assertTrue(t.compareTo(last) >= 0);
224 last = t;
237 T last = i.next();
240 assertTrue(comp.compare(last, t) <= 0);
241 assertTrue(comp.compare(t, last) >= 0);
242 last = t;
|
| /libcore/ojluni/src/test/java/util/stream/testlib/org/openjdk/testlib/java/util/stream/ |
| LambdaTestHelpers.java | 220 T last = i.next();
223 assertTrue(last.compareTo(t) <= 0);
224 assertTrue(t.compareTo(last) >= 0);
225 last = t;
238 T last = i.next();
241 assertTrue(comp.compare(last, t) <= 0);
242 assertTrue(comp.compare(t, last) >= 0);
243 last = t;
|
