HomeSort by relevance Sort by last modified time
    Searched refs:start1 (Results 1 - 25 of 47) sorted by null

1 2

  /external/qemu/include/qemu/
cache-utils.h 20 unsigned long p, start1, stop1; local
24 start1 = start & ~(dsize - 1);
26 for (p = start1; p < stop1; p += dsize) {
33 for (p = start1; p < stop1; p += isize) {
  /external/strace/test/
leaderkill.c 22 static void *start1(void *arg) function
47 i = pthread_create(&thread1, NULL, start1, NULL);
  /external/chromium_org/third_party/icu/source/common/
unormcmp.cpp 151 const UChar *start1, *start2, *limit1, *limit2; local
196 start1=s1;
236 start1=stack1[level1].start; /*Not uninitialized*/
237 } while(start1==NULL);
294 if(start1<=(s1-2) && U16_IS_LEAD(c=*(s1-2))) {
343 stack1[0].start=start1;
358 start1=s1=fold1;
433 stack1[level1].start=start1;
444 start1=s1=p;
514 (U16_IS_TRAIL(c1) && start1!=(s1-1) && U16_IS_LEAD(*(s1-2))
    [all...]
ustrcase.cpp 477 const UChar *start1, *start2, *limit1, *limit2; local
507 start1=s1;
547 start1=stack1[level1].start; /*Not uninitialized*/
548 } while(start1==NULL);
605 if(start1<=(s1-2) && U16_IS_LEAD(c=*(s1-2))) {
654 stack1[0].start=start1;
669 start1=s1=fold1;
743 (U16_IS_TRAIL(c1) && start1!=(s1-1) && U16_IS_LEAD(*(s1-2)))
ustring.cpp 687 const UChar *start1, *start2, *limit1, *limit2; local
691 start1=s1;
722 limit1=start1+length1;
755 /* limit1=start1+min(lenght1, length2) */
758 limit1=start1+length1;
761 limit1=start1+length1;
764 limit1=start1+length2;
787 limit1=start1+length1;
796 (U16_IS_TRAIL(c1) && start1!=s1 && U16_IS_LEAD(*(s1-1)))
    [all...]
ubidi.c 2016 int32_t i, start1, start2; local
    [all...]
  /external/icu/icu4c/source/common/
unormcmp.cpp 151 const UChar *start1, *start2, *limit1, *limit2; local
196 start1=s1;
236 start1=stack1[level1].start; /*Not uninitialized*/
237 } while(start1==NULL);
294 if(start1<=(s1-2) && U16_IS_LEAD(c=*(s1-2))) {
343 stack1[0].start=start1;
358 start1=s1=fold1;
433 stack1[level1].start=start1;
444 start1=s1=p;
514 (U16_IS_TRAIL(c1) && start1!=(s1-1) && U16_IS_LEAD(*(s1-2))
    [all...]
ustrcase.cpp 477 const UChar *start1, *start2, *limit1, *limit2; local
507 start1=s1;
547 start1=stack1[level1].start; /*Not uninitialized*/
548 } while(start1==NULL);
605 if(start1<=(s1-2) && U16_IS_LEAD(c=*(s1-2))) {
654 stack1[0].start=start1;
669 start1=s1=fold1;
743 (U16_IS_TRAIL(c1) && start1!=(s1-1) && U16_IS_LEAD(*(s1-2)))
ustring.cpp 687 const UChar *start1, *start2, *limit1, *limit2; local
691 start1=s1;
722 limit1=start1+length1;
755 /* limit1=start1+min(lenght1, length2) */
758 limit1=start1+length1;
761 limit1=start1+length1;
764 limit1=start1+length2;
787 limit1=start1+length1;
796 (U16_IS_TRAIL(c1) && start1!=s1 && U16_IS_LEAD(*(s1-1)))
    [all...]
  /external/openfst/src/include/fst/
union.h 90 StateId start1 = fst1->Start(); local
91 if (start1 == kNoStateId) {
98 fst1->AddArc(start1, Arc(0, 0, Weight::One(), start2 + numstates1));
102 fst1->AddArc(nstart1, Arc(0, 0, Weight::One(), start1));
concat.h 65 StateId start1 = fst1->Start(); local
66 if (start1 == kNoStateId) {
157 StateId start1 = fst1.Start(); local
158 fst2->SetStart(start1 == kNoStateId ? fst2->AddState() : start1 + numstates2);
159 if (start1 != kNoStateId)
  /external/qemu/include/exec/
cputlb.h 29 void cpu_tlb_reset_dirty_all(ram_addr_t start1, ram_addr_t length);
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
union.h 65 StateId start1 = fst1->Start(); local
66 if (start1 == kNoStateId) {
73 fst1->AddArc(start1, Arc(0, 0, Weight::One(), start2 + numstates1));
77 fst1->AddArc(nstart1, Arc(0, 0, Weight::One(), start1));
concat.h 44 StateId start1 = fst1->Start(); local
45 if (start1 == kNoStateId)
  /external/scrypt/lib/crypto/
crypto_scrypt-neon-salsa208.h 57 uint32x4_t start1 = x12x1x6x11; local
64 uint32x4_t diag1 = start1;
102 x12x1x6x11 = diag1 + start1;
  /libcore/dalvik/src/test/java/dalvik/system/profiler/
SamplingProfilerTest.java 127 ThreadEvent start1 = ThreadEvent.start(objectId, threadId, local
129 hprofData.addThreadEvent(start1);
130 assertEquals(Arrays.asList(start1), hprofData.getThreadHistory());
136 assertEquals(Arrays.asList(start1, end2), hprofData.getThreadHistory());
142 assertEquals(Arrays.asList(start1, end2, end1), hprofData.getThreadHistory());
151 assertEquals(Arrays.asList(start1, end2, end1), hprofData.getThreadHistory());
  /external/chromium_org/third_party/skia/experimental/Intersection/
QuadraticIntersection.cpp 329 double start1 = i.fCoincidentT[0][cIndex]; local
332 xy_at_t(q1, start1, ends1[0].x, ends1[0].y);
348 if (approximately_less_than_zero(start1) || approximately_less_than_zero(end1)) {
349 start1 = 0;
350 } else if (approximately_greater_than_one(start1) || approximately_greater_than_one(end1)) {
351 start1 = 1;
353 start1 = (start1 + end1) / 2;
362 i.insert(start1, start2);
  /external/skia/experimental/Intersection/
QuadraticIntersection.cpp 329 double start1 = i.fCoincidentT[0][cIndex]; local
332 xy_at_t(q1, start1, ends1[0].x, ends1[0].y);
348 if (approximately_less_than_zero(start1) || approximately_less_than_zero(end1)) {
349 start1 = 0;
350 } else if (approximately_greater_than_one(start1) || approximately_greater_than_one(end1)) {
351 start1 = 1;
353 start1 = (start1 + end1) / 2;
362 i.insert(start1, start2);
  /external/chromium_org/third_party/icu/source/i18n/
rbtz.cpp 700 UDate start0, start1; local
720 UBool avail1 = fr1->getPreviousStart(base, fr0->getRawOffset(), fr0->getDSTSavings(), TRUE, start1);
732 return (start0 > start1) ? fr0 : fr1;
761 UDate start0, start1; local
763 UBool avail1 = r1->getNextStart(base, r0->getRawOffset(), r0->getDSTSavings(), inclusive, start1);
768 if (!avail1 || start0 < start1) {
773 result.time = start1;
844 UDate start0, start1; local
846 UBool avail1 = r1->getPreviousStart(base, r0->getRawOffset(), r0->getDSTSavings(), inclusive, start1);
851 if (!avail1 || start0 > start1) {
    [all...]
  /external/icu/icu4c/source/i18n/
rbtz.cpp 700 UDate start0, start1; local
720 UBool avail1 = fr1->getPreviousStart(base, fr0->getRawOffset(), fr0->getDSTSavings(), TRUE, start1);
732 return (start0 > start1) ? fr0 : fr1;
761 UDate start0, start1; local
763 UBool avail1 = r1->getNextStart(base, r0->getRawOffset(), r0->getDSTSavings(), inclusive, start1);
768 if (!avail1 || start0 < start1) {
773 result.time = start1;
844 UDate start0, start1; local
846 UBool avail1 = r1->getPreviousStart(base, r0->getRawOffset(), r0->getDSTSavings(), inclusive, start1);
851 if (!avail1 || start0 > start1) {
    [all...]
  /external/compiler-rt/lib/sanitizer_common/
sanitizer_posix.cc 221 static inline bool IntervalsAreSeparate(uptr start1, uptr end1,
223 CHECK(start1 <= end1);
225 return (end1 < start2) || (end2 < start1);
  /external/google-diff-match-patch/name/fraser/neil/plaintext/
diff_match_patch.java 2080 int start1, start2; local
2342 public int start1; field in class:Patch
    [all...]
  /development/samples/ApiDemos/src/com/example/android/apis/app/
IsolatedService.java 193 mService1 = new ServiceInfo(this, IsolatedService.class, R.id.start1, R.id.stop1,
  /external/chromium_org/cc/quads/
draw_polygon.cc 281 size_t start1 = (vertex_before[0] + 1) % points_size; local
287 for (size_t i = start1; i <= vertex_before[1]; i++) {
  /external/chromium_org/third_party/cython/src/Cython/Utility/
MemoryView_C.c 684 void *start1, *end1, *start2, *end2; variable
686 __pyx_get_array_memory_extents(slice1, &start1, &end1, ndim, itemsize);
689 return (start1 < end2) && (start2 < end1);

Completed in 1555 milliseconds

1 2