Searched refs:s_i (Results 1 – 9 of 9) sorted by relevance
| /external/valgrind/drd/tests/ |
| D | annotate_hb_race.c | 14 static int s_i; variable
21 U_ANNOTATE_HAPPENS_AFTER(&s_i); in thread_func()
22 i = s_i; in thread_func()
23 U_ANNOTATE_HAPPENS_AFTER(&s_i); in thread_func()
34 U_ANNOTATE_HAPPENS_BEFORE(&s_i); in main()
40 s_i = 1; in main()
|
| D | annotate_static.cpp | 11 static int s_i; variable
14 ANNOTATE_BENIGN_RACE_STATIC(s_i, "Benign because duplicate assignment.");
29 s_i = i; in thread_func()
31 s_i = ANNOTATE_UNPROTECTED_READ(s_j); in thread_func()
42 s_i = s_j; in main()
|
| D | pth_cond_destroy_busy.c | 13 static int s_i; variable
28 s_i = 1; in thread_func()
30 while (s_i == 1) in thread_func()
48 while (s_i == 0) in main()
57 s_i = 2; in main()
|
| /external/libchrome/base/strings/ |
| D | string_piece.cc | 264 for (size_t s_i = 0; s_i < s.size(); ++s_i) { in find_first_not_of() local
265 if (self[self_i] == s[s_i]) { in find_first_not_of()
332 for (size_t s_i = 0; s_i < s.size(); s_i++) { in find_last_of() local
333 if (self.data()[self_i] == s[s_i]) in find_last_of()
377 for (size_t s_i = 0; s_i < s.size(); s_i++) { in find_last_not_of() local
378 if (self.data()[self_i] == s[s_i]) { in find_last_not_of()
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| D | DFAState.java | 338 IntSet s_i = rl.getSet(); in addReachableLabel() local
339 IntSet intersection = s_i.and(t); in addReachableLabel()
343 IntSet existingMinusNewElements = s_i.subtract(t); in addReachableLabel()
358 remainder = t.subtract(s_i); in addReachableLabel()
|
| /external/valgrind/coregrind/m_debuginfo/ |
| D | readmacho.c | 462 DiSym *s_j1, *s_j, *s_i; in tidy_up_cand_syms() local
466 s_i = (DiSym*)VG_(indexXA)(syms, i); in tidy_up_cand_syms()
467 if (s_i->avmas.main != s_j1->avmas.main in tidy_up_cand_syms()
468 || s_i->size != s_j1->size in tidy_up_cand_syms()
469 || 0 != VG_(strcmp)(s_i->pri_name, s_j1->pri_name)) { in tidy_up_cand_syms()
470 *s_j = *s_i; in tidy_up_cand_syms()
475 s_i->avmas.main, s_i->pri_name ); in tidy_up_cand_syms()
|
| /external/v8/src/wasm/ |
| D | wasm-opcodes.h | 305 V(I32x4Splat, 0xe51b, s_i) \
326 V(I16x8Splat, 0xe538, s_i) \
349 V(I8x16Splat, 0xe557, s_i) \
493 V(s_i, kWasmS128, kWasmI32) \
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| D | Grammar.java | 1260 IntervalSet s_i = (IntervalSet)disjointSets.get(i); in makeEdgeSetsDisjoint() local
1262 if ( t.and(s_i).isNil() ) { // nothing in common in makeEdgeSetsDisjoint()
1272 IntervalSet intersection = (IntervalSet)s_i.and(t); in makeEdgeSetsDisjoint()
1276 IntSet existingMinusNewElements = s_i.subtract(t); in makeEdgeSetsDisjoint()
1285 remainder = (IntervalSet)t.subtract(s_i); in makeEdgeSetsDisjoint()
|
| /external/compiler-rt/lib/msan/tests/ |
| D | msan_test.cc | 1209 struct shm_info s_i; in TEST() local
1210 res = shmctl(id, SHM_INFO, (struct shmid_ds *)&s_i); in TEST()
1212 EXPECT_NOT_POISONED(s_i); in TEST()
|