infer_clone

Commit Graph

Author	SHA1	Message	Date
Jules Villard	8b882ac1df	Change license to MIT Summary: Change the license of the source code from BSD + PATENTS to MIT. Change `checkCopyright` to reflect the new license and learn some new file types. Generated with: ``` git grep BSD \| xargs -n 1 ./scripts/checkCopyright -i ``` Reviewed By: jeremydubreil, mbouaziz, jberdine Differential Revision: D8071249 fbshipit-source-id: 97ca23a	7 years ago
Sam Blackshear	584b10647d	[racerd] new lock domain Summary: The boolean lock domain is simple and surprisingly effective. But it's starting to cause false positives in the case where locks are nested. Releasing the inner lock also releases the outer lock. This diff introduces a new locks domain: a map of locks (access paths) to a bounded count representing an underapproximation of the number of times the lock has been acquired. For now, we just use a single dummy access path to represent all locks (and thus a count actually would have been sufficiently expressive; we don't need the map yet). But I'm planning to remove this limitation in a follow-up by refactoring the lock models to give us an access path. Knowing the names of locks could be useful for error messages and suggesting fixes. Reviewed By: jberdine Differential Revision: D6182006 fbshipit-source-id: 6624971	7 years ago
Sam Blackshear	bc02bee737	[cleanup] rename thread-safety analysis Reviewed By: jvillard Differential Revision: D6087967 fbshipit-source-id: 22bfb6d	7 years ago

Author

SHA1

Message

Date

Jules Villard

8b882ac1df

Change license to MIT

Summary:
Change the license of the source code from BSD + PATENTS to MIT.

Change `checkCopyright` to reflect the new license and learn some new file
types.

Generated with:

```
git grep BSD | xargs -n 1 ./scripts/checkCopyright -i
```

Reviewed By: jeremydubreil, mbouaziz, jberdine

Differential Revision: D8071249

fbshipit-source-id: 97ca23a

Sam Blackshear

584b10647d

[racerd] new lock domain

Summary:
The boolean lock domain is simple and surprisingly effective.
But it's starting to cause false positives in the case where locks are nested.
Releasing the inner lock also releases the outer lock.

This diff introduces a new locks domain: a map of locks (access paths) to a bounded count representing an underapproximation of the number of times the lock has been acquired.

For now, we just use a single dummy access path to represent all locks (and thus a count actually would have been sufficiently expressive; we don't need the map yet).
But I'm planning to remove this limitation in a follow-up by refactoring the lock models to give us an access path.
Knowing the names of locks could be useful for error messages and suggesting fixes.

Reviewed By: jberdine

Differential Revision: D6182006

fbshipit-source-id: 6624971

Sam Blackshear

bc02bee737

[cleanup] rename thread-safety analysis

Reviewed By: jvillard

Differential Revision: D6087967

fbshipit-source-id: 22bfb6d

3 Commits (f0fd0fd7acf5e9a5bb1bd6e9b5866e857dd69e3b)