forked from llvm/llvm-project
-
Notifications
You must be signed in to change notification settings - Fork 55
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Change-Id: I99bcb1456baa1b5efd3ffdfcb9fe57d1923359f7
- Loading branch information
Showing
143 changed files
with
2,216 additions
and
677 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
146 changes: 146 additions & 0 deletions
146
clang/test/Analysis/Checkers/WebKit/call-args-wtf-containers.cpp
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,146 @@ | ||
| // RUN: %clang_analyze_cc1 -analyzer-checker=alpha.webkit.UncountedCallArgsChecker -verify %s | ||
|
|
||
| #include "mock-types.h" | ||
|
|
||
| namespace WTF { | ||
|
|
||
| template <typename T> | ||
| class HashSet { | ||
| public: | ||
| template <typename U> T* find(U&) const; | ||
| template <typename U> bool contains(U&) const; | ||
| unsigned size() { return m_size; } | ||
| template <typename U> void add(U&) const; | ||
| template <typename U> void remove(U&) const; | ||
|
|
||
| private: | ||
| T* m_table { nullptr }; | ||
| unsigned m_size { 0 }; | ||
| }; | ||
|
|
||
| template <typename T, typename S> | ||
| class HashMap { | ||
| public: | ||
| struct Item { | ||
| T key; | ||
| S value; | ||
| }; | ||
|
|
||
| template <typename U> Item* find(U&) const; | ||
| template <typename U> bool contains(U&) const; | ||
| template <typename U> S* get(U&) const; | ||
| template <typename U> S* inlineGet(U&) const; | ||
| template <typename U> void add(U&) const; | ||
| template <typename U> void remove(U&) const; | ||
|
|
||
| private: | ||
| Item* m_table { nullptr }; | ||
| }; | ||
|
|
||
| template <typename T> | ||
| class WeakHashSet { | ||
| public: | ||
| template <typename U> T* find(U&) const; | ||
| template <typename U> bool contains(U&) const; | ||
| template <typename U> void add(U&) const; | ||
| template <typename U> void remove(U&) const; | ||
| }; | ||
|
|
||
| template <typename T> | ||
| class Vector { | ||
| public: | ||
| unsigned size() { return m_size; } | ||
| T& at(unsigned i) { return m_buffer[i]; } | ||
| T& operator[](unsigned i) { return m_buffer[i]; } | ||
| template <typename U> unsigned find(U&); | ||
| template <typename U> unsigned reverseFind(U&); | ||
| template <typename U> bool contains(U&); | ||
| template <typename MatchFunction> unsigned findIf(const MatchFunction& match) | ||
| { | ||
| for (unsigned i = 0; i < m_size; ++i) { | ||
| if (match(at(i))) | ||
| return i; | ||
| } | ||
| return static_cast<unsigned>(-1); | ||
| } | ||
| template <typename MatchFunction> unsigned reverseFindIf(const MatchFunction& match) | ||
| { | ||
| for (unsigned i = 0; i < m_size; ++i) { | ||
| if (match(at(m_size - i))) | ||
| return i; | ||
| } | ||
| return static_cast<unsigned>(-1); | ||
| } | ||
| template <typename MatchFunction> bool containsIf(const MatchFunction& match) | ||
| { | ||
| for (unsigned i = 0; i < m_size; ++i) { | ||
| if (match(at(m_size - i))) | ||
| return true; | ||
| } | ||
| return false; | ||
| } | ||
| template <typename U> void append(U&) const; | ||
| template <typename U> void remove(U&) const; | ||
|
|
||
| private: | ||
| T* m_buffer { nullptr }; | ||
| unsigned m_size { 0 }; | ||
| }; | ||
|
|
||
| } | ||
|
|
||
| using WTF::HashSet; | ||
| using WTF::HashMap; | ||
| using WTF::WeakHashSet; | ||
| using WTF::Vector; | ||
|
|
||
| class RefCounted { | ||
| public: | ||
| void ref() const; | ||
| void deref() const; | ||
| }; | ||
|
|
||
| RefCounted* object(); | ||
|
|
||
| void test() { | ||
| HashSet<RefPtr<RefCounted>> set; | ||
| set.find(*object()); | ||
| set.contains(*object()); | ||
| set.add(*object()); | ||
| // expected-warning@-1{{Call argument is uncounted and unsafe}} | ||
| set.remove(*object()); | ||
| // expected-warning@-1{{Call argument is uncounted and unsafe}} | ||
|
|
||
| HashMap<Ref<RefCounted>, unsigned> map; | ||
| map.find(*object()); | ||
| map.contains(*object()); | ||
| map.inlineGet(*object()); | ||
| map.add(*object()); | ||
| // expected-warning@-1{{Call argument is uncounted and unsafe}} | ||
| map.remove(*object()); | ||
| // expected-warning@-1{{Call argument is uncounted and unsafe}} | ||
|
|
||
| WeakHashSet<Ref<RefCounted>> weakSet; | ||
| weakSet.find(*object()); | ||
| weakSet.contains(*object()); | ||
| weakSet.add(*object()); | ||
| // expected-warning@-1{{Call argument is uncounted and unsafe}} | ||
| weakSet.remove(*object()); | ||
| // expected-warning@-1{{Call argument is uncounted and unsafe}} | ||
|
|
||
| Vector<Ref<RefCounted>> vector; | ||
| vector.at(0); | ||
| vector[0]; | ||
| vector.find(*object()); | ||
| vector.reverseFind(*object()); | ||
| vector.contains(*object()); | ||
| vector.append(*object()); | ||
| // expected-warning@-1{{Call argument is uncounted and unsafe}} | ||
| vector.remove(*object()); | ||
| // expected-warning@-1{{Call argument is uncounted and unsafe}} | ||
|
|
||
| auto* obj = object(); | ||
| vector.findIf([&](Ref<RefCounted> key) { return key.ptr() == obj; }); | ||
| vector.reverseFindIf([&](Ref<RefCounted> key) { return key.ptr() == obj; }); | ||
| vector.containsIf([&](Ref<RefCounted> key) { return key.ptr() == obj; }); | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.