HomeSort by relevance Sort by last modified time
    Searched defs:last (Results 26 - 50 of 2704) sorted by null

12 3 4 5 6 7 8 91011>>

  /external/curl/tests/unit/
unit1308.c 46 struct curl_httppost *last = NULL; variable in typeref:struct:curl_httppost
50 rc = curl_formadd(&post, &last, CURLFORM_COPYNAME, "name",
57 fail_unless(post == last, "post and last weren't the same");
59 rc = curl_formadd(&post, &last, CURLFORM_COPYNAME, "htmlcode",
65 rc = curl_formadd(&post, &last, CURLFORM_COPYNAME, "name_for_ptrcontent",
79 post = last = NULL;
81 rc = curl_formadd(&post, &last,
  /external/google-breakpad/src/common/linux/
linux_libc_support_unittest.cc 171 const char* last; local
173 last = my_read_hex_ptr(&result, "");
175 ASSERT_EQ(*last, 0);
177 last = my_read_hex_ptr(&result, "0");
179 ASSERT_EQ(*last, 0);
181 last = my_read_hex_ptr(&result, "0123");
183 ASSERT_EQ(*last, 0);
185 last = my_read_hex_ptr(&result, "0123a");
187 ASSERT_EQ(*last, 0);
189 last = my_read_hex_ptr(&result, "0123a-")
196 const char* last; local
    [all...]
  /external/libcap-ng/libcap-ng-0.7/src/test/
lib_test.c 32 int rc, i, len, last = CAP_LAST_CAP; local
52 if (len < 80 && last > 30) // The kernel & headers are mismatched
53 last = 30;
60 printf("Doing advanced bit tests for %d capabilities...\n", last);
61 for (i=0; i<=last; i++) {
  /external/libcxx/test/std/containers/sequences/deque/deque.modifiers/
erase_iter_iter.invalidation.pass.cpp 26 typename C::iterator last = first + num; local
27 typename C::iterator it1 = last;
30 c.erase (first, last);
45 typename C::iterator last = c.end(); local
46 typename C::iterator first = last - num;
50 c.erase (first, last);
  /external/linux-kselftest/tools/testing/selftests/powerpc/pmu/
lib.h 33 uint64_t first, last; member in struct:addr_range
  /external/llvm/test/Other/
opt-bisect-helper.py 24 last = None variable
39 print("Last good count: %d" % start)
  /external/llvm/utils/
bisect 23 last = None variable
37 print("Last good count: %d" % start)
  /external/mesa3d/src/mesa/state_tracker/
st_atom_rasterizer.c 210 /* We have to check the last bound stage and see if it writes psize */
211 struct gl_program *last = NULL; local
213 last = ctx->GeometryProgram._Current;
215 last = ctx->TessEvalProgram._Current;
217 last = ctx->VertexProgram._Current;
218 if (last)
220 !!(last->info.outputs_written &
  /external/minijail/
syscall_filter.h 23 struct filter_block *last; member in struct:filter_block
  /external/pdfium/third_party/agg23/
agg_shorten_path.h 43 vertex_type& last = vs[n]; local
45 float x = prev.x + (last.x - prev.x) * d;
46 float y = prev.y + (last.y - prev.y) * d;
47 last.x = x;
48 last.y = y;
49 if(!prev(last)) {
  /external/perfetto/tools/skippy/
skippy.cc 41 base::TimeMillis last = base::GetWallTimeMs(); local
47 if ((now - last) < base::TimeMillis(100))
49 last = now;
  /external/syslinux/memdisk/
e820func.c 56 uint64_t last; local
64 last = start + len - 1; /* May roll over */
78 while (i == 0 || last > ranges[i].start - 1) {
84 if (last < ranges[i].start - 1)
85 insertrange_at(i, last + 1, oldtype);
  /external/tensorflow/tensorflow/cc/framework/
scope.h 237 /// Scope to be used for creating the last op.
238 Scope last; member in struct:tensorflow::CompositeOpScopes
  /frameworks/base/tools/aapt2/link/
PrivateAttributeMover.cpp 30 const auto last = input_container.end(); local
32 if (new_end == last) {
41 for (; first != last; ++first) {
54 input_container.erase(new_end, last);
  /libcore/ojluni/src/main/java/java/util/
SortedSet.java 216 * Returns the last (highest) element currently in this set.
218 * @return the last (highest) element currently in this set
221 E last(); method in interface:SortedSet
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.modifiers/
erase_iter_iter.invalidation.pass.cpp 26 typename C::iterator last = first + num; local
27 typename C::iterator it1 = last;
30 c.erase (first, last);
45 typename C::iterator last = c.end(); local
46 typename C::iterator first = last - num;
50 c.erase (first, last);
  /art/runtime/
monitor_pool.cc 71 Monitor* last = reinterpret_cast<Monitor*>(reinterpret_cast<uintptr_t>(chunk) + local
73 last->next_free_ = nullptr;
75 last->monitor_id_ = OffsetToMonitorId(current_chunk_list_index_* (kMaxListSize * kChunkSize)
78 Monitor* before = reinterpret_cast<Monitor*>(reinterpret_cast<uintptr_t>(last) -
80 before->next_free_ = last;
81 // Derive monitor_id from last.
82 before->monitor_id_ = OffsetToMonitorId(MonitorIdToOffset(last->monitor_id_) -
85 last = before;
87 DCHECK(last == reinterpret_cast<Monitor*>(chunk));
88 first_free_ = last;
    [all...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/cjkcodecs/
mappings_cn.h 4052 Py_UNICODE first, last; member in struct:_gb18030_to_unibmp_ranges
    [all...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/_sqlite/
cache.h 54 pysqlite_Node* last; member in struct:__anon4705
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/cjkcodecs/
mappings_cn.h 4052 Py_UNICODE first, last; member in struct:_gb18030_to_unibmp_ranges
    [all...]
  /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/h/
slist.cpp 96 PCCTS_AST *t=NULL, *last=NULL; local
102 if ( last==NULL ) last = t = u;
103 else { last->setRight(u); last = u; }
  /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/h/
slist.cpp 95 PCCTS_AST *t=NULL, *last=NULL; local
101 if ( last==NULL ) last = t = u;
102 else { last->setRight(u); last = u; }
  /external/apache-http/src/org/apache/commons/codec/language/
RefinedSoundex.java 173 char last, current; local
174 last = '*';
179 if (current == last) {
185 last = current;
  /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;

Completed in 354 milliseconds

12 3 4 5 6 7 8 91011>>