| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_procmaps_freebsd.cc | 54 char *last = proc_self_maps_.data + proc_self_maps_.len; local
55 if (current_ >= last) return false;
|
| /external/curl/lib/ |
| slist.c | 29 /* The last #include files should be: */
33 /* returns last node in linked list */
42 /* loop through to find the last item */
61 struct curl_slist *last; local
77 last = slist_get_last(list);
78 last->next = new_item;
|
| /external/e2fsprogs/contrib/android/ |
| hashmap.h | 12 struct hashmap_entry *last; member in struct:hashmap
|
| /external/freetype/src/cff/ |
| cf2stack.c | 247 CF2_StackNumber last = { { 0 }, CF2_NumberInt }; local
305 last = stack->buffer[idx];
315 stack->buffer[idx] = last;
316 last = tmp;
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| SortedMultisets.java | 77 @Override public E last() { method in class:SortedMultisets.ElementSet
|
| /external/harfbuzz_ng/test/api/ |
| test-set.c | 164 hb_codepoint_t next, first, last; local
191 first = last = HB_SET_VALUE_INVALID;
192 g_assert (hb_set_next_range (s, &first, &last));
194 g_assert_cmpint (last, ==, 6);
195 g_assert (hb_set_next_range (s, &first, &last));
197 g_assert_cmpint (last, ==, 15);
198 g_assert (hb_set_next_range (s, &first, &last));
200 g_assert_cmpint (last, ==, 20005);
201 g_assert (!hb_set_next_range (s, &first, &last));
203 g_assert_cmpint (last, ==, HB_SET_VALUE_INVALID)
[all...] |
| /external/icu/icu4c/source/i18n/ |
| nfrlist.h | 78 NFRule* last() const { return (fCount > 0 && fStuff != NULL) ? fStuff[fCount-1] : NULL; } function in class:NFRuleList
|
| /external/libchrome/sandbox/linux/bpf_dsl/ |
| syscall_set.cc | 29 uint32_t last; member in struct:sandbox::__anon22792::SyscallRange
57 if (num >= range.first && num <= range.last) {
107 if (want_valid && num_ < range.last) {
110 if (want_invalid && num_ <= range.last) {
111 return range.last + 1;
|
| /external/libcxx/test/std/experimental/string.view/string.view.iterators/ |
| rbegin.pass.cpp | 29 const size_t last = s.size() - 1; local
30 assert( *b == s[last]);
31 assert( &*b == &s[last]);
32 assert( *cb1 == s[last]);
33 assert(&*cb1 == &s[last]);
34 assert( *cb2 == s[last]);
35 assert(&*cb2 == &s[last]);
|
| /external/libcxx/test/std/strings/basic.string/string.modifiers/string_replace/ |
| iter_iter_pointer.pass.cpp | 29 typename S::const_iterator last = s.begin() + pos1 + n1; local
30 typename S::size_type xlen = last - first;
31 s.replace(first, last, str);
|
| iter_iter_size_char.pass.cpp | 29 typename S::const_iterator last = s.begin() + pos1 + n1; local
30 typename S::size_type xlen = last - first;
31 s.replace(first, last, n2, c);
|
| iter_iter_string.pass.cpp | 28 typename S::const_iterator last = s.begin() + pos1 + n1; local
29 typename S::size_type xlen = last - first;
30 s.replace(first, last, str);
|
| /external/libcxx/test/std/strings/string.view/string.view.iterators/ |
| rbegin.pass.cpp | 29 const size_t last = s.size() - 1; local
30 assert( *b == s[last]);
31 assert( &*b == &s[last]);
32 assert( *cb1 == s[last]);
33 assert(&*cb1 == &s[last]);
34 assert( *cb2 == s[last]);
35 assert(&*cb2 == &s[last]);
|
| /external/libcxxabi/test/ |
| test_fallback_malloc.pass.cpp | 44 const size_t *last = first + len; local
47 for ( const size_t *iter = first; iter != last; ++iter ) {
|
| /external/libmojo/mojo/edk/system/ |
| awakable_list.cc | 24 // Instead of deleting elements in-place, swap them with the last element and
26 auto last = awakables_.end(); local
27 for (AwakeInfoList::iterator it = awakables_.begin(); it != last;) {
35 --last;
36 std::swap(*it, *last);
41 awakables_.erase(last, awakables_.end());
63 auto last = awakables_.end(); local
64 for (AwakeInfoList::iterator it = awakables_.begin(); it != last;) {
66 --last;
67 std::swap(*it, *last);
[all...] |
| /external/libvterm/src/ |
| unicode.c | 74 int last; member in struct:interval
136 if (ucs < table[0].first || ucs > table[max].last)
140 if (ucs > table[mid].last)
|
| /external/ltp/testcases/kernel/syscalls/mlock/ |
| mlock03.c | 53 long first = -1, last = -1; local
94 last = (to - from) / KB;
99 tst_resm(TINFO, "final stack size is %ld", last);
100 if (last < first)
|
| /external/ltp/testcases/kernel/syscalls/nftw/ |
| tools.c | 213 int i, last = 0; local
217 last = i;
218 return (last ? last + 1 : 0);
|
| tools64.c | 213 int i, last = 0; local
217 last = i;
218 return (last ? last + 1 : 0);
|
| /external/mesa3d/src/glsl/ |
| opt_redundant_jumps.cpp | 61 /* If the last instruction in both branches is a 'break' or a 'continue',
102 /* If the last instruction of a loop body is a 'continue', remove it.
104 ir_instruction *const last = local
107 if (last && (last->ir_type == ir_type_loop_jump)
108 && (((ir_loop_jump *) last)->mode == ir_loop_jump::jump_continue)) {
109 last->remove();
|
| /external/mesa3d/src/mesa/program/ |
| sampler.cpp | 42 get_sampler_name(ir_dereference *last,
49 this->last = last;
90 if (ir != last) {
102 ir_dereference *last; member in class:get_sampler_name
|
| /external/protobuf/ruby/lib/google/protobuf/ |
| repeated_field.rb | 86 def last(n=nil) method in class:Google.Protobuf.RepeatedField
|
| /external/selinux/checkpolicy/ |
| queue.c | 147 queue_node_ptr_t p, last, temp; local
153 last = NULL;
158 if (last) {
159 last->next = p->next;
160 if (last->next == NULL)
161 q->tail = last;
173 last = p;
|
| /external/slf4j/slf4j-ext/src/main/java/org/slf4j/ |
| NDC.java | 55 int last = next - 1; local
56 String key = PREFIX + last;
|
| /external/toybox/toys/lsb/ |
| seq.c | 1 /* seq.c - Count from first to last, by increment.
14 usage: seq [-w|-f fmt_str] [-s sep_str] [first] [increment] last
16 Count from first to last, by increment. Omitted arguments default
17 to 1. Two arguments are used as first and last. Arguments can be
47 double first, increment, last, dd; local
57 default: last = atof(toys.optargs[toys.optc-1]);
66 dd = (double []){first, increment, last}[i];
87 if ((increment<0 && dd<last) || (increment>0 && dd>last)) break;
|
