Searched defs:probe (Results 26 - 50 of 96) sorted by relevance

1234

/external/bison/src/
H A Dstate.c395 state *probe = xmalloc (offsetof (state, items) + items_size); local
398 probe->nitems = nitems;
399 memcpy (probe->items, core, items_size);
400 entry = hash_lookup (state_table, probe);
401 free (probe);
H A Dmuscle-tab.c111 muscle_entry probe; local
114 probe.key = key;
115 entry = hash_lookup (muscle_table, &probe);
141 muscle_entry probe; local
144 probe.key = key;
145 entry = hash_lookup (muscle_table, &probe);
228 muscle_entry probe; local
231 probe.key = key;
232 result = hash_lookup (muscle_table, &probe);
248 muscle_entry probe; local
[all...]
H A Dsymtab.c664 symbol probe; local
667 probe.tag = key;
668 entry = hash_lookup (symbol_table, &probe);
690 semantic_type probe; local
693 probe.tag = key;
694 entry = hash_lookup (semantic_type_table, &probe);
/external/chromium_org/third_party/icu/source/common/
H A Dusc_impl.c163 int32_t probe = pairedCharPower; local
170 while (probe > (1 << 0)) {
171 probe >>= 1;
173 if (ch >= pairedChars[pairIndex + probe]) {
174 pairIndex += probe;
H A Duvectr32.cpp306 int32_t probe = (min + max) / 2; local
307 //int8_t c = (*compare)(elements[probe], tok);
309 if (elements[probe] > tok) {
310 max = probe;
313 min = probe + 1;
H A Duvector.cpp465 int32_t probe = (min + max) / 2; local
466 int8_t c = (*compare)(elements[probe], tok);
468 max = probe;
471 min = probe + 1;
/external/chromium_org/third_party/icu/source/test/letest/
H A DFontObject.cpp63 le_uint16 probe = 1 << entrySelector; local
69 while (probe > (1 << 0)) {
70 probe >>= 1;
72 if (SWAPL(directory->tableDirectory[table + probe].tag) <= tag) {
73 table += probe;
161 le_uint16 probe = 1 << cmEntrySelector; local
168 while (probe > (1 << 0)) {
169 probe >>= 1;
171 if (SWAPW(cmStartCodes[index + probe]) <= unicode) {
172 index += probe;
[all...]
H A DPortableFontInstance.cpp190 le_uint16 probe = fDirPower; local
196 while (probe > (1 << 0)) {
197 probe >>= 1;
199 if (SWAPL(fDirectory->tableDirectory[table + probe].tag) <= tag) {
200 table += probe;
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
H A Du_cache.c128 uint32_t probe; local
134 * as a previous linear probe for the same key could have continued
137 for (probe = 0; probe < cache->size; probe++) {
138 uint32_t i = (index + probe) % cache->size;
/external/icu4c/common/
H A Dusc_impl.c163 int32_t probe = pairedCharPower; local
170 while (probe > (1 << 0)) {
171 probe >>= 1;
173 if (ch >= pairedChars[pairIndex + probe]) {
174 pairIndex += probe;
H A Duvectr32.cpp306 int32_t probe = (min + max) / 2; local
307 //int8_t c = (*compare)(elements[probe], tok);
309 if (elements[probe] > tok) {
310 max = probe;
313 min = probe + 1;
H A Duvector.cpp466 int32_t probe = (min + max) / 2; local
467 int8_t c = (*compare)(elements[probe], e);
469 max = probe;
472 min = probe + 1;
/external/icu4c/layout/
H A DKernTable.cpp197 le_uint32 probe = searchRange; local
199 while (probe > KERN_PAIRINFO_SIZE) {
200 probe >>= 1;
201 tp = (const PairInfo*)((char*)p + probe);
/external/icu4c/test/letest/
H A DFontObject.cpp63 le_uint16 probe = 1 << entrySelector; local
69 while (probe > (1 << 0)) {
70 probe >>= 1;
72 if (SWAPL(directory->tableDirectory[table + probe].tag) <= tag) {
73 table += probe;
161 le_uint16 probe = 1 << cmEntrySelector; local
168 while (probe > (1 << 0)) {
169 probe >>= 1;
171 if (SWAPW(cmStartCodes[index + probe]) <= unicode) {
172 index += probe;
[all...]
H A DPortableFontInstance.cpp190 le_uint16 probe = fDirPower; local
196 while (probe > (1 << 0)) {
197 probe >>= 1;
199 if (SWAPL(fDirectory->tableDirectory[table + probe].tag) <= tag) {
200 table += probe;
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_cache.c128 uint32_t probe; local
134 * as a previous linear probe for the same key could have continued
137 for (probe = 0; probe < cache->size; probe++) {
138 uint32_t i = (index + probe) % cache->size;
/external/kernel-headers/original/linux/mmc/
H A Dcard.h97 int (*probe)(struct mmc_card *); member in struct:mmc_driver
/external/kernel-headers/original/linux/mtd/
H A Dmap.h168 to a chip probe routine -- either JEDEC or CFI probe or both -- via
169 do_map_probe(). If a chip is recognised, the probe code will invoke the
226 struct mtd_info *(*probe)(struct map_info *map); member in struct:mtd_chip_driver
/external/chromium_org/third_party/sfntly/cpp/src/sfntly/table/core/
H A Dname_table.cc300 NameEntryId probe(platform_id, encoding_id, language_id, name_id);
302 return (name_entry_map_.find(probe) != name_entry_map_.end());
310 NameEntryId probe(platform_id, encoding_id, language_id, name_id);
313 if (name_entry_map_.find(probe) != name_entry_map_.end()) {
314 return name_entry_map_[probe];
316 NameEntryBuilderPtr builder = new NameEntryBuilder(probe);
317 name_entry_map_[probe] = builder;
325 NameEntryId probe(platform_id, encoding_id, language_id, name_id);
327 NameEntryBuilderMap::iterator position = name_entry_map_.find(probe);
423 NameEntryId probe local
[all...]
/external/iputils/
H A Dtraceroute6.c66 * internet host. We find out intermediate hops by launching probe
74 * round trip time of each probe. If the probe answers come from
78 * probe.
163 * icmp's) until we probe with a ttl that's at least twice the path
205 * of the "likely" range). To keep track of which probe is being
208 * port number before each probe.
317 u_short port = 32768+666; /* start udp dest port # for probe packets */
343 int ch, i, on, probe, seq, tos, ttl; local
409 * probe (
[all...]
/external/kernel-headers/original/linux/
H A Ddevice.h51 int (*probe)(struct device * dev); member in struct:bus_type
99 int (*probe) (struct device * dev); member in struct:device_driver
/external/libpcap/
H A Dpcap-dos.h156 int (*probe)(struct device *dev); member in struct:device
/external/sfntly/cpp/src/sfntly/table/core/
H A Dname_table.cc300 NameEntryId probe(platform_id, encoding_id, language_id, name_id);
302 return (name_entry_map_.find(probe) != name_entry_map_.end());
310 NameEntryId probe(platform_id, encoding_id, language_id, name_id);
313 if (name_entry_map_.find(probe) != name_entry_map_.end()) {
314 return name_entry_map_[probe];
316 NameEntryBuilderPtr builder = new NameEntryBuilder(probe);
317 name_entry_map_[probe] = builder;
325 NameEntryId probe(platform_id, encoding_id, language_id, name_id);
327 NameEntryBuilderMap::iterator position = name_entry_map_.find(probe);
423 NameEntryId probe local
[all...]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
H A DDFA.java158 /** This probe tells you a lot about a decision and is useful even
163 public DecisionProbe probe = new DecisionProbe(this); field in class:DFA
242 if ( !probe.isDeterministic() || probe.analysisOverflowed() ) {
243 probe.issueWarnings();
255 // probe.reportAnalysisTimeout();
257 // probe.issueWarnings();
261 probe.reportNonLLStarDecision(this);
264 probe.issueWarnings();
740 !probe
[all...]
/external/chromium_org/v8/src/arm/
H A Dic-arm.cc349 Label number, non_number, non_string, boolean, probe, miss; local
363 // to probe.
372 __ b(&probe);
380 __ b(&probe);
395 __ bind(&probe);
593 // a quick inline probe of the receiver's dictionary.
594 // Otherwise do the monomorphic cache probe.
982 // cache. Otherwise probe the dictionary.
1072 // Do a quick inline probe of the receiver's dictionary, if it
1514 // Get the receiver from the stack and probe th
[all...]

Completed in 708 milliseconds

1234