reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
45 T &operator[](uptr i) { 50 const T &operator[](uptr i) const { 55 T *PushBack() { 62 T *PushBack(const T& v) { 62 T *PushBack(const T& v) { 64 T *p = &end_[-1]; 92 T *begin_; 93 T *end_; 94 T *last_; 109 T *p = (T*)InternalAlloc(cap * sizeof(T)); 109 T *p = (T*)InternalAlloc(cap * sizeof(T)); 111 internal_memcpy(p, begin_, cap0 * sizeof(T));projects/compiler-rt/lib/tsan/rtl/tsan_interface_ann.cpp
64 ExpectRace *next; 65 ExpectRace *prev; 77 ExpectRace expect; 78 ExpectRace benign; 88 static void AddExpectRace(ExpectRace *list, 90 ExpectRace *race = list->next; 98 race = (ExpectRace*)internal_alloc(MBlockExpectRace, sizeof(ExpectRace)); 118 static ExpectRace *FindRace(ExpectRace *list, uptr addr, uptr size) { 118 static ExpectRace *FindRace(ExpectRace *list, uptr addr, uptr size) { 119 for (ExpectRace *race = list->next; race != list; race = race->next) { 128 static bool CheckContains(ExpectRace *list, uptr addr, uptr size) { 129 ExpectRace *race = FindRace(list, addr, size); 138 static void InitList(ExpectRace *list) { 158 static void CollectMatchedBenignRaces(Vector<ExpectRace> *matched, 160 ExpectRace *list = &dyn_ann_ctx->benign; 161 for (ExpectRace *race = list->next; race != list; race = race->next) { 169 ExpectRace *race0 = &(*matched)[i]; 187 Vector<ExpectRace> hit_matched; 189 &ExpectRace::hitcount); 190 Vector<ExpectRace> add_matched; 192 &ExpectRace::addcount); 214 static void ReportMissedExpectedRace(ExpectRace *race) { 307 ExpectRace *race = dyn_ann_ctx->expect.next;