-
Notifications
You must be signed in to change notification settings - Fork 1.9k
Expand file tree
/
Copy pathDuplicateKeyInDictionaryLiteral.ql
More file actions
46 lines (43 loc) · 1.26 KB
/
DuplicateKeyInDictionaryLiteral.ql
File metadata and controls
46 lines (43 loc) · 1.26 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
/**
* @name Duplicate key in dict literal
* @description Duplicate key in dict literal. All but the last will be lost.
* @kind problem
* @tags quality
* maintainability
* useless-code
* external/cwe/cwe-561
* @problem.severity warning
* @sub-severity high
* @precision very-high
* @id py/duplicate-key-dict-literal
*/
import python
import semmle.python.strings
predicate dict_key(Dict d, Expr k, string s) {
k = d.getAKey() and
(
s = k.(Num).getN()
or
// We use � to mark unrepresentable characters
// so two instances of � may represent different strings in the source code
not "�" = s.charAt(_) and
exists(StringLiteral c | c = k |
s = "u\"" + c.getText() + "\"" and c.isUnicode()
or
s = "b\"" + c.getText() + "\"" and not c.isUnicode()
)
)
}
from Dict d, Expr k1, Expr k2
where
exists(string s | dict_key(d, k1, s) and dict_key(d, k2, s) and k1 != k2) and
(
exists(BasicBlock b, int i1, int i2 |
k1.getAFlowNode() = b.getNode(i1) and
k2.getAFlowNode() = b.getNode(i2) and
i1 < i2
)
or
k1.getAFlowNode().getBasicBlock().strictlyDominates(k2.getAFlowNode().getBasicBlock())
)
select k1, "Dictionary key " + repr(k1) + " is subsequently $@.", k2, "overwritten"