| /external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/tests/ |
| equ-expand.asm | 2 end1: label
4 line_out equ end1+258 ;length = 1 + 263
5 real_end equ end1+258+264
8 cmp bx,((end1+258+264)-(end1+258))/4
9 cmp bx,(end1+258+264-end1-258)/4
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| algobase.h | 55 mismatch(InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2,
57 { return _GLIBCXX_STD_P::mismatch(begin1, end1, begin2); }
63 mismatch(InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2,
65 { return _GLIBCXX_STD_P::mismatch(begin1, end1, begin2, pred); }
71 mismatch_switch(InputIterator1 begin1, InputIterator1 end1,
74 { return _GLIBCXX_STD_P::mismatch(begin1, end1, begin2, pred); }
80 mismatch_switch(RandomAccessIterator1 begin1, RandomAccessIterator1 end1,
87 __gnu_parallel::find_template(begin1, end1, begin2, pred,
93 return _GLIBCXX_STD_P::mismatch(begin1, end1, begin2, pred);
99 mismatch(InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2
[all...] |
| find_selectors.h | 65 * @param end1 End iterator of first sequence.
73 RandomAccessIterator1 end1,
75 { return std::make_pair(find_if(begin1, end1, pred,
98 * @param end1 End iterator of first sequence.
106 RandomAccessIterator1 end1,
110 RandomAccessIterator1 spot = adjacent_find(begin1, end1 + 1,
112 if (spot == (end1 + 1))
113 spot = end1;
136 * @param end1 End iterator of first sequence.
144 RandomAccessIterator1 end1,
[all...] |
| merge.h | 46 * @param end1 End iterator of first sequence.
58 RandomAccessIterator1 end1,
64 while (begin1 != end1 && begin2 != end2 && max_length > 0)
74 if (begin1 != end1)
95 * @param end1 End iterator of first sequence.
107 RandomAccessIterator1 end1,
123 while (begin1 != end1 && begin2 != end2 && max_length > 0)
143 if (begin1 != end1)
163 * @param end1 End iterator of first sequence.
174 merge_advance(RandomAccessIterator1& begin1, RandomAccessIterator1 end1,
[all...] |
| algo.h | 213 find_first_of(InputIterator begin1, InputIterator end1,
216 { return _GLIBCXX_STD_P::find_first_of(begin1, end1, begin2, end2); }
222 find_first_of(InputIterator begin1, InputIterator end1,
225 { return _GLIBCXX_STD_P::find_first_of(begin1, end1, begin2, end2, comp); }
231 find_first_of_switch(InputIterator begin1, InputIterator end1,
234 { return find_first_of(begin1, end1, begin2, end2,
242 RandomAccessIterator end1,
248 find_template(begin1, end1, begin1, comp,
258 find_first_of_switch(InputIterator begin1, InputIterator end1,
261 { return find_first_of(begin1, end1, begin2, end2, comp,
[all...] |
| find.h | 48 * @param end1 End iterator of first sequence.
60 find_template(RandomAccessIterator1 begin1, RandomAccessIterator1 end1,
66 return find_template(begin1, end1, begin2, pred, selector,
69 return find_template(begin1, end1, begin2, pred, selector,
72 return find_template(begin1, end1, begin2, pred, selector,
85 * @param end1 End iterator of first sequence.
98 RandomAccessIterator1 end1,
104 _GLIBCXX_CALL(end1 - begin1)
110 difference_type length = end1 - begin1;
167 * @param end1 End iterator of first sequence
[all...] |
| set_operations.h | 354 parallel_set_operation(InputIterator begin1, InputIterator end1,
358 _GLIBCXX_CALL((end1 - begin1) + (end2 - begin2))
364 if (begin1 == end1)
368 return op.second_empty(begin1, end1, result);
370 const difference_type size = (end1 - begin1) + (end2 - begin2);
373 { std::make_pair(begin1, end1), std::make_pair(begin2, end2) } ;
381 std::min(end1 - begin1, end2 - begin2));
456 block_begin.first, end1, block_begin.second, end2, r);
477 parallel_set_union(InputIterator begin1, InputIterator end1,
481 return parallel_set_operation(begin1, end1, begin2, end2, result
[all...] |
| search.h | 73 * @param end1 End iterator of first sequence.
82 search_template(_RandomAccessIterator1 begin1, _RandomAccessIterator1 end1,
89 _GLIBCXX_CALL((end1 - begin1) + (end2 - begin2));
95 return end1;
98 difference_type input_length = (end1 - begin1) - pattern_length;
101 difference_type result = (end1 - begin1);
106 return end1;
|
| /external/speex/libspeex/ |
| buffer.c | 71 int end1; local
79 end1 = end;
80 if (end1 > st->size)
81 end1 = st->size;
82 SPEEX_COPY(st->data + st->write_ptr, data, end1 - st->write_ptr);
86 SPEEX_COPY(st->data, data+end1 - st->write_ptr, end);
105 int end1; local
111 end1 = end;
112 if (end1 > st->size)
113 end1 = st->size
134 int end, end1; local
[all...] |
| /bionic/libc/bionic/ |
| memcmp.c | 33 const unsigned char* end1 = p1 + n; local
38 if (d || p1 >= end1) break;
41 if (d || p1 >= end1) break;
44 if (d || p1 >= end1) break;
47 if (d || p1 >= end1) break;
|
| /external/llvm/test/CodeGen/AArch64/ |
| tst-br.ll | 17 br i1 %tst0, label %test1, label %end1
23 br i1 %tst1, label %test2, label %end1
29 br i1 %tst2, label %test3, label %end1
35 br i1 %tst3, label %end2, label %end1
43 end1:
|
| /external/oprofile/libutil++/ |
| child_reader.cpp | 30 pos1(0), end1(0),
134 end1 = temp;
136 end1 = 0;
151 bool ret = !(end1 == 0 && end2 == 0);
153 if (end1 == -1)
154 end1 = 0;
172 if (pos1 >= end1) {
179 while (temp_pos < end1 && ok) {
188 if (!ok || !end1)
201 return end1 != 0 || result.length() != 0
[all...] |
| /external/chromium_org/extensions/common/permissions/ |
| base_set_operators.h | 126 const_iterator end1 = end(); local
129 while (it1 != end1 && it2 != end2) {
151 const const_iterator end1 = set1.end(); local
154 while (it1 != end1 && it2 != end2) {
169 while (it1 != end1) {
181 const const_iterator end1 = set1.end(); local
184 while (it1 != end1 && it2 != end2) {
205 const const_iterator end1 = set1.end(); local
209 if (it1 == end1) {
217 while (it1 != end1) {
[all...] |
| /external/llvm/test/Transforms/LoopUnswitch/ |
| infinite-loop.ll | 29 ; CHECK-NEXT: call void @end1() [[NOR_NUW]]
49 call void @end1() noreturn nounwind
54 declare void @end1() noreturn
|
| /external/oprofile/libpp/ |
| diff_container.cpp | 128 symbol_container::symbols_t::iterator end1 = pc1.end_symbol(); local
132 while (it1 != end1 && it2 != end2) {
146 for (; it1 != end1; ++it1)
|
| /dalvik/dx/tests/032-bb-live-code/ |
| blort.j | 33 end1:
42 .catch all from start to end1 using handler1
52 end1:
61 .catch all from start to end1 using handler1
|
| /external/chromium_org/base/ |
| file_util.cc | 110 std::string::size_type end1 = line1.find_last_not_of("\r\n"); local
111 if (end1 == std::string::npos)
113 else if (end1 + 1 < line1.length())
114 line1.erase(end1 + 1);
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_posix.cc | 135 static inline bool IntervalsAreSeparate(uptr start1, uptr end1,
137 CHECK(start1 <= end1);
139 return (end1 < start2) || (end2 < start1);
|
| /external/llvm/test/Transforms/Inline/ |
| inline_cleanup.ll | 80 br i1 %cmp1, label %then1, label %end1
84 br label %end1
86 end1:
|
| /external/chromium/base/ |
| file_util.cc | 134 std::string::size_type end1 = line1.find_last_not_of("\r\n"); local
135 if (end1 == std::string::npos)
137 else if (end1 + 1 < line1.length())
138 line1.erase(end1 + 1);
|
| /external/llvm/test/CodeGen/X86/ |
| rd-mod-wr-eflags.ll | 90 br i1 %tobool2, label %if.end1, label %return
93 if.end1:
144 br i1 %tobool2, label %if.end1, label %return
147 if.end1:
|
| /libcore/dalvik/src/test/java/dalvik/system/profiler/ |
| SamplingProfilerTest.java | 140 ThreadEvent end1 = ThreadEvent.end(threadId); local
141 hprofData.addThreadEvent(end1);
142 assertEquals(Arrays.asList(start1, end2, end1), hprofData.getThreadHistory());
151 assertEquals(Arrays.asList(start1, end2, end1), hprofData.getThreadHistory());
|
| /external/chromium/chrome/browser/sync/engine/ |
| syncer.h | 146 bool SortedCollectionsIntersect(Iterator1 begin1, Iterator1 end1,
150 while (i1 != end1 && i2 != end2) {
|
| /external/chromium_org/net/disk_cache/ |
| rankings.h | 180 // Walks a list in the desired direction until the nodes |end1| or |end2| are
183 int CheckListSection(List list, Addr end1, Addr end2, bool forward,
|
| /external/llvm/unittests/IR/ |
| IRBuilderTest.cpp | 67 Value *End1 = Builder.CreateLifetimeEnd(Var1);
72 IntrinsicInst *II_End1 = dyn_cast<IntrinsicInst>(End1);
|
