Searched refs:probes (Results 1 - 7 of 7) sorted by relevance
/third_party/backends/backend/ |
H A D | hp-device.c | 232 } probes[] = { in sanei_hp_device_probe_model() local 275 for (i = 0; i < (int)(sizeof(probes)/sizeof(probes[0])); i++) in sanei_hp_device_probe_model() 277 DBG(1,"probing %s\n",probes[i].model); in sanei_hp_device_probe_model() 279 if (!FAILED( status = sanei_hp_scl_upload(scsi, probes[i].cmd, in sanei_hp_device_probe_model() 282 DBG(1, "probe_scanner: %s compatible (%5s)\n", probes[i].model, buf); in sanei_hp_device_probe_model() 283 last_model_name = probes[i].model; in sanei_hp_device_probe_model() 285 if (probes[i].model_num == 9) in sanei_hp_device_probe_model() 294 *compat |= probes[i].flag; in sanei_hp_device_probe_model() 295 last_model_num = probes[ in sanei_hp_device_probe_model() [all...] |
/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/ |
H A D | hashtable_debug.h | 44 // Returns the number of probes required to lookup `key`. Returns 0 for a 55 // Gets a histogram of the number of probes for each elements in the container. 80 auto probes = GetHashtableDebugNumProbesHistogram(container); in GetHashtableDebugProbeSummary() local 82 for (size_t i = 0; i < probes.size(); ++i) { in GetHashtableDebugProbeSummary() 83 summary.total_elements += probes[i]; in GetHashtableDebugProbeSummary() 84 summary.total_num_probes += probes[i] * i; in GetHashtableDebugProbeSummary()
|
/third_party/toybox/toys/pending/ |
H A D | modprobe.c | 35 struct arg_list *probes, *dbase[256]; 246 for (temp = TT.probes; temp; temp = temp->next) { in config_action() 360 // Add module in probes list, if not loaded. 372 llist_add_tail(&TT.probes, mod); in add_mod() 507 if (!TT.probes) { in modprobe_main() 525 while ((module = llist_popme(&TT.probes))) { in modprobe_main()
|
/third_party/selinux/libselinux/src/ |
H A D | avc.c | 380 int *probes) in avc_search_node() 401 if (probes) in avc_search_node() 402 *probes = tprobes; in avc_search_node() 430 int probes, rc = 0; in avc_lookup() local 433 node = avc_search_node(ssid, tsid, tclass, &probes); in avc_lookup() 437 avc_cache_stats_add(cav_probes, probes); in avc_lookup() 377 avc_search_node(security_id_t ssid, security_id_t tsid, security_class_t tclass, int *probes) avc_search_node() argument
|
/third_party/python/Objects/ |
H A D | setobject.c | 14 nearby entries before moving on to probes elsewhere in memory. This leaves 17 tend to be much cheaper than scattered probes. After LINEAR_PROBES steps, 63 int probes; in set_lookkey() local 68 probes = (i + LINEAR_PROBES <= mask) ? LINEAR_PROBES: 0; in set_lookkey() 94 } while (probes--); in set_lookkey() 111 int probes; in set_add_entry() local 127 probes = (i + LINEAR_PROBES <= mask) ? LINEAR_PROBES: 0; in set_add_entry() 157 } while (probes--); in set_add_entry()
|
/third_party/toybox/generated/ |
H A D | globals.h | 925 struct arg_list *probes; member
|
/third_party/vk-gl-cts/external/amber/src/src/vkscript/ |
H A D | command_parser_test.cc | 1170 } probes[] = { in TEST_F() local 1270 for (const auto& probe : probes) { in TEST_F()
|
Completed in 21 milliseconds