HomeSort by relevance Sort by last modified time
    Searched defs:Probe (Results 1 - 15 of 15) sorted by null

  /external/ceres-solver/include/ceres/
gradient_checker.h 59 // CostFunction, and then call Probe(). Check that the return value is
68 // Here we stash some results from the probe, for later
92 // probe_point: The parameter values at which to probe.
95 // this amount, then the probe fails.
104 static bool Probe(double const* const* probe_point,
110 LOG(INFO) << "-------------------- Starting Probe() --------------------";
  /external/chromium_org/chrome/browser/net/
dns_probe_service_unittest.cc 36 void Probe() {
60 Probe();
126 // New rules should apply, since a new probe should be run.
  /external/compiler-rt/lib/ubsan/
ubsan_type_hash.cc 97 unsigned Probe = V & 65535;
99 if (!__ubsan_vptr_hash_set[Probe] || __ubsan_vptr_hash_set[Probe] == V)
100 return &__ubsan_vptr_hash_set[Probe];
101 Probe += ((V >> 16) & 65535) + 1;
102 if (Probe >= HashTableSize)
103 Probe -= HashTableSize;
105 // FIXME: Pick a random entry from the probe sequence to evict rather than
  /external/chromium_org/v8/src/
hashmap.h 108 Entry* Probe(void* key, uint32_t hash);
134 Entry* p = Probe(key, hash);
150 p = Probe(key, hash);
164 Entry* p = Probe(key, hash);
257 TemplateHashMapImpl<AllocationPolicy>::Probe(void* key, uint32_t hash) {
  /external/llvm/lib/Support/
FoldingSet.cpp 260 void *Probe = OldBuckets[i];
261 if (!Probe) continue;
262 while (Node *NodeInBucket = GetNextPtr(Probe)) {
264 Probe = NodeInBucket->getNextInBucket();
286 void *Probe = *Bucket;
291 while (Node *NodeInBucket = GetNextPtr(Probe)) {
296 Probe = NodeInBucket->getNextInBucket();
401 void *Probe = NodePtr->getNextInBucket();
403 if (FoldingSetNode *NextNodeInBucket = GetNextPtr(Probe))
407 void **Bucket = GetBucketPtr(Probe);
    [all...]
  /external/v8/src/
hashmap.h 97 Entry* Probe(void* key, uint32_t hash);
122 Entry* p = Probe(key, hash);
137 p = Probe(key, hash);
151 Entry* p = Probe(key, hash);
240 typename TemplateHashMapImpl<P>::Entry* TemplateHashMapImpl<P>::Probe(void* key,
  /external/llvm/include/llvm/ADT/
FoldingSet.h 691 void *Probe = static_cast<FoldingSetNode*>(Ptr)->getNextInBucket();
692 uintptr_t x = reinterpret_cast<uintptr_t>(Probe) & ~0x1;
  /external/v8/src/arm/
assembler-arm.cc 82 void CpuFeatures::Probe() {
111 // Probe for additional features not already known to be available.
    [all...]
  /external/chromium_org/v8/src/ia32/
assembler-ia32.cc 91 // The Probe method needs executable memory, so it uses Heap::CreateCode.
93 void CpuFeatures::Probe() {
171 F0 probe = FUNCTION_CAST<F0>(reinterpret_cast<Address>(memory->address())); local
172 uint64_t probed_features = probe();
    [all...]
  /external/chromium_org/v8/src/x64/
assembler-x64.cc 55 void CpuFeatures::Probe() {
145 F0 probe = FUNCTION_CAST<F0>(reinterpret_cast<Address>(memory->address())); local
147 uint64_t probed_features = probe();
    [all...]
  /external/v8/src/ia32/
assembler-ia32.cc 58 // The Probe method needs executable memory, so it uses Heap::CreateCode.
60 void CpuFeatures::Probe() {
138 F0 probe = FUNCTION_CAST<F0>(reinterpret_cast<Address>(memory->address())); local
139 supported_ = probe();
    [all...]
  /external/v8/src/x64/
assembler-x64.cc 49 void CpuFeatures::Probe() {
137 F0 probe = FUNCTION_CAST<F0>(reinterpret_cast<Address>(memory->address())); local
138 supported_ = probe();
    [all...]
  /external/chromium_org/v8/src/arm/
assembler-arm.cc 101 void CpuFeatures::Probe() {
154 // Probe for additional features not already known to be available.
    [all...]
  /external/chromium_org/v8/src/mips/
assembler-mips.cc 104 void CpuFeatures::Probe() {
128 // Probe for additional features not already known to be available.
    [all...]
  /external/v8/src/mips/
assembler-mips.cc 76 void CpuFeatures::Probe() {
102 // Probe for additional features not already known to be available.
    [all...]

Completed in 840 milliseconds