Searched defs:first (Results 1 - 25 of 1023) sorted by relevance

1234567891011>>

/external/curl/src/
H A Dslist_wc.h30 struct curl_slist *first; member in struct:slist_wc
40 * first. Returns the new list, after appending.
/external/v8/test/webkit/
H A Deval-cache-crash.js30 var a = "first";
31 var first = eval(str)(); variable
32 shouldBe("first", "'first'");
/external/valgrind/none/tests/amd64-linux/
H A Dmap_32bits.c9 void *first = NULL; local
17 if (first == NULL) {
18 first = res;
19 if (first == (void *)-1) {
20 perror ("first mmap");
23 fprintf(stderr, "first mmap : %p\n", first);
/external/clang/test/Index/
H A Drecursive-member-access.c2 struct rdar8650865 *first; member in struct:rdar8650865
7 return ((((((s->first)->first)
8 ->first)
9 ->first)
10 ->first)
11 ->first)
12 ->first
13 ->first
14 ->first
[all...]
/external/curl/lib/
H A Dstrequal.c34 int curl_strequal(const char *first, const char *second) argument
37 return !(strcasecmp)(first, second);
39 return !(strcmpi)(first, second);
41 return !(stricmp)(first, second);
43 while(*first && *second) {
44 if(toupper(*first) != toupper(*second)) {
47 first++;
50 return toupper(*first) == toupper(*second);
57 int curl_strnequal(const char *first, const char *second, size_t max) argument
60 return !strncasecmp(first, secon
[all...]
/external/elfutils/libelf/
H A Delf_newscn.c47 bool first = false; local
75 first = true;
114 /* Remember the index for the first section in this block. */
148 if (unlikely (first))
150 /* For the first section we mark the data as already available. */
152 first = false;
/external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/equal.range/
H A Dequal_range.pass.cpp16 // equal_range(Iter first, Iter last, const T& value);
26 test(Iter first, Iter last, const T& value) argument
28 std::pair<Iter, Iter> i = std::equal_range(first, last, value);
29 for (Iter j = first; j != i.first; ++j)
31 for (Iter j = i.first; j != last; ++j)
33 for (Iter j = first; j != i.second; ++j)
/external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/lower.bound/
H A Dlower_bound.pass.cpp15 // lower_bound(Iter first, Iter last, const T& value);
25 test(Iter first, Iter last, const T& value) argument
27 Iter i = std::lower_bound(first, last, value);
28 for (Iter j = first; j != i; ++j)
/external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/upper.bound/
H A Dupper_bound.pass.cpp15 // upper_bound(Iter first, Iter last, const T& value);
25 test(Iter first, Iter last, const T& value) argument
27 Iter i = std::upper_bound(first, last, value);
28 for (Iter j = first; j != i; ++j)
/external/lldb/test/functionalities/data-formatter/rdar-10449092/
H A Dmain.cpp14 int first; member in struct:foo
21 mine.first = 0xAABBCCDD; // Set break point at this line.
/external/testng/src/test/java/test/priority/
H A DWithPrioritySample2Test.java8 public void first() { method in class:WithPrioritySample2Test
9 add("first");
H A DWithPrioritySampleTest.java8 public void first() { method in class:WithPrioritySampleTest
9 add("first");
H A DWithoutPrioritySampleTest.java8 public void first() { method in class:WithoutPrioritySampleTest
9 add("first");
/external/clang/test/CodeGen/
H A Dtbaa-thread-sanitizer.cpp8 iterator first; member in struct:pair
9 pair(const iterator &a) : first(a) {}
/external/clang/test/CodeGenCXX/
H A Dpr18635.cpp11 F first; member in struct:unique_ptr::pair
/external/clang/test/Parser/
H A Dbad-control.c11 int pr8880_9 (int first) { argument
12 switch(({ if (first) { first = 0; break; } 1; })) { // expected-error {{'break' statement not in loop or switch statement}}
/external/compiler-rt/test/tsan/Linux/
H A Duser_malloc.cc9 static int first = 0; local
10 if (__sync_lock_test_and_set(&first, 1) == 0)
/external/libcxx/test/std/containers/sequences/vector/vector.cons/
H A Dconstruct_iter_iter.pass.cpp12 // template <class InputIter> vector(InputIter first, InputIter last);
24 test(Iterator first, Iterator last) argument
26 C c(first, last);
28 assert(c.size() == std::distance(first, last));
30 for (typename C::const_iterator i = c.cbegin(), e = c.cend(); i != e; ++i, ++first)
31 assert(*i == *first);
/external/libcxx/test/std/containers/sequences/vector.bool/
H A Dconstruct_iter_iter.pass.cpp13 // template <class InputIter> vector(InputIter first, InputIter last);
23 test(Iterator first, Iterator last) argument
25 C c(first, last);
27 assert(c.size() == std::distance(first, last));
28 for (typename C::const_iterator i = c.cbegin(), e = c.cend(); i != e; ++i, ++first)
29 assert(*i == *first);
H A Dconstruct_iter_iter_alloc.pass.cpp13 // template <class InputIter> vector(InputIter first, InputIter last,
24 test(Iterator first, Iterator last, const typename C::allocator_type& a) argument
26 C c(first, last, a);
28 assert(c.size() == std::distance(first, last));
29 for (typename C::const_iterator i = c.cbegin(), e = c.cend(); i != e; ++i, ++first)
30 assert(*i == *first);
/external/libcxx/test/std/iterators/iterator.primitives/iterator.operations/
H A Ddistance.pass.cpp14 // distance(Iter first, Iter last);
18 // distance(Iter first, Iter last);
27 test(It first, It last, typename std::iterator_traits<It>::difference_type x) argument
29 assert(std::distance(first, last) == x);
/external/libcxx/test/std/re/re.regex/re.regex.construct/
H A Diter_iter.pass.cpp15 // basic_regex(ForwardIterator first, ForwardIterator last);
24 test(Iter first, Iter last, unsigned mc) argument
26 std::basic_regex<typename std::iterator_traits<Iter>::value_type> r(first, last);
/external/libcxx/test/std/strings/basic.string/string.modifiers/string_append/
H A Diterator.pass.cpp13 // basic_string& append(InputIterator first, InputIterator last);
23 test(S s, It first, It last, S expected) argument
25 s.append(first, last);
/external/libcxx/test/std/strings/basic.string/string.modifiers/string_assign/
H A Diterator.pass.cpp13 // basic_string& assign(InputIterator first, InputIterator last);
23 test(S s, It first, It last, S expected) argument
25 s.assign(first, last);
/external/libcxx/test/std/utilities/meta/meta.unary/meta.unary.prop/
H A Dis_standard_layout.pass.cpp37 T1 first; member in struct:pair

Completed in 2043 milliseconds

1234567891011>>