/external/openfst/src/include/fst/ |
symbol-table-ops.h | 40 unordered_set<typename Arc::Label> seen; local 41 seen.insert(0); // Always keep epslion 48 seen.insert(sym); 54 if (seen.find(label) != seen.end()) {
|
/external/chromium_org/v8/test/webkit/fast/js/ |
JSON-parse-reviver.js | 117 if (seen) { 122 seen = true; 172 var seen = false; variable
|
/external/chromium_org/base/files/ |
dir_reader_posix_unittest.cc | 45 std::set<unsigned> seen; local 72 EXPECT_EQ(0u, seen.count(value)); 73 seen.insert(value); 89 EXPECT_EQ(kNumFiles, seen.size());
|
/external/chromium_org/v8/src/compiler/ |
gap-resolver.cc | 31 std::set<InstructionOperand*, InstructionOperandComparator> seen; local 33 SLOW_DCHECK(seen.find(i->destination()) == seen.end()); 34 seen.insert(i->destination());
|
/external/jemalloc/test/unit/ |
ckh.c | 148 bool seen[NITEMS]; local 151 memset(seen, 0, sizeof(seen)); 161 assert_false(seen[k], 162 "Item %zu already seen", k); 163 seen[k] = true; 170 assert_true(seen[j], "Item %zu not seen", j); 172 assert_false(seen[j], "Item %zu seen", j) [all...] |
/external/chromium_org/third_party/sqlite/src/src/ |
notify.c | 60 int seen = 0; local 68 if( p2->xUnlockNotify==p->xUnlockNotify ) seen = 1; 69 assert( p2->xUnlockNotify==p->xUnlockNotify || !seen );
|
test_quota.c | 198 int seen; local 225 seen = 0; 235 if( c==']' ) seen = 1; 241 if( c>=prior_c && c<=c2 ) seen = 1; 245 seen = 1; 251 if( c2==0 || (seen ^ invert)==0 ) return 0;
|
func.c | 559 int seen; local 613 seen = 0; 623 if( c==']' ) seen = 1; 629 if( c>=prior_c && c<=c2 ) seen = 1; 633 seen = 1; 639 if( c2==0 || (seen ^ invert)==0 ){ [all...] |
/external/chromium_org/v8/test/cctest/compiler/ |
test-gap-resolver.cc | 113 std::set<InstructionOperand*, InstructionOperandComparator> seen; local 116 if (!mo.IsRedundant() && seen.find(mo.destination()) == seen.end()) { 118 seen.insert(mo.destination());
|
/development/tools/elftree/ |
elftree.c | 51 struct seen { struct 53 struct seen *next; 58 struct seen *seen; member in struct:tree_state 61 static int seen(struct tree_state *t, char *name) function 63 struct seen *s; 65 for (s = t->seen; s; s = s->next) { 75 struct seen *s = malloc(sizeof(*s)); 78 s->next = t->seen; 79 t->seen = s [all...] |
/external/chromium_org/chrome/browser/supervised_user/ |
supervised_user_shared_settings_service.cc | 199 // We keep a map from MU ID to the set of keys that we have seen in the 241 const std::set<std::string>& seen = seen_keys[it.key()]; local 243 // We only need to upload settings that we haven't seen in the initial 245 if (seen.count(jt.key()) > 0)
|
/external/chromium_org/net/dns/ |
dns_response.cc | 46 // Count number of seen bytes to detect loops. 47 unsigned seen = 0; local 71 seen += sizeof(uint16); 72 // If seen the whole packet, then we must be in a loop. 73 if (seen > length_) 101 seen += 1 + label_len; 302 // Following the CNAME chain, only if no addresses seen.
|
/external/chromium_org/chrome/browser/apps/ |
app_browsertest.cc | 947 bool seen() const { function in class:extensions::__anon7512::CheckExtensionInstalledObserver [all...] |
/external/fio/ |
ioengine.h | 84 unsigned int seen; member in union:io_u::__anon988
|
/external/libsepol/src/ |
module.c | 456 /* Flags for which sections have been seen during parsing of module package. */ 470 unsigned i, seen = 0; local 504 if (seen & SEEN_FC) { 528 seen |= SEEN_FC; 531 if (seen & SEEN_SEUSER) { 551 seen |= SEEN_SEUSER; 554 if (seen & SEEN_USER_EXTRA) { 576 seen |= SEEN_USER_EXTRA; 579 if (seen & SEEN_NETFILTER) { 603 seen |= SEEN_NETFILTER 655 unsigned i, seen = 0; local [all...] |
/external/lldb/source/Breakpoint/ |
Breakpoint.cpp | 365 // for that module, we mark the module as "seen" and we don't try to re-resolve 378 bool seen = false; local 391 if (!seen) 392 seen = true; 404 if (!seen)
|
/external/ltrace/ |
dict.c | 233 /* If there is a loop, but we've seen an erased 509 char *seen = data; local 510 assert(seen[*key] == 0); 511 seen[*key] = 1; 523 verify(struct dict *di, size_t len, char *seen) 527 for (it = NULL; (it = DICT_EACH(di, int, int, it, dump, seen)) != NULL;) 530 memset(seen, 0, len); 547 char seen[100000] = {}; local 549 for (i = 0; i < sizeof(seen); ++i) { 559 verify(&di, sizeof(seen), seen) [all...] |
/dalvik/dexgen/src/com/android/dexgen/dex/file/ |
DebugInfoEncoder.java | 531 BitSet seen = new BitSet(regSize - argBase); local 543 if (seen.get(reg - argBase)) { 547 seen.set(reg - argBase);
|
/dalvik/dx/src/com/android/dx/dex/file/ |
DebugInfoEncoder.java | 539 BitSet seen = new BitSet(regSize - argBase); local 551 if (seen.get(reg - argBase)) { 555 seen.set(reg - argBase);
|
/external/chromium_org/components/translate/core/browser/ |
translate_prefs.cc | 63 std::set<std::string> seen; local 68 if (seen.find(language) == seen.end()) { 70 seen.insert(language); 78 if (seen.find(main_part) == seen.end()) { 80 seen.insert(main_part);
|
/external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/ |
expr.c | 1452 int seen = 0; local 1491 int seen = 0; local [all...] |
/external/dexmaker/src/dx/java/com/android/dx/dex/file/ |
DebugInfoEncoder.java | 531 BitSet seen = new BitSet(regSize - argBase); local 543 if (seen.get(reg - argBase)) { 547 seen.set(reg - argBase);
|
/external/linux-tools-perf/perf-3.12.0/tools/perf/ |
builtin-top.c | 697 static struct intlist *seen; local 699 if (!seen) 700 seen = intlist__new(NULL); 702 if (!intlist__has_entry(seen, sample->pid)) { 705 intlist__add(seen, sample->pid);
|
/dalvik/dx/src/com/android/dx/ssa/back/ |
FirstFitLocalCombiningAllocator.java | 97 /** list of move-result-pesudo instructions seen in this method */ 100 /** list of invoke-range instructions seen in this method */ 103 /** list of phi instructions seen in this method */ 1037 BitSet seen = new BitSet(ssaMeth.getRegCount()); local [all...] |
/external/chromium_org/v8/test/cctest/ |
test-regexp.cc | 561 bool seen[kLimit]; local 562 for (unsigned i = 0; i < kLimit; i++) seen[i] = false; 565 CHECK_EQ(seen[k], tree.Find(k, &loc)); \ 570 if (seen[next]) { 571 // We've already seen this one. Check the value and remove 578 seen[next] = false; 587 seen[next] = true; 591 if (seen[val]) { 598 if (seen[val]) { [all...] |