rentgen/request-cluster.ts

174 lines
4.6 KiB
TypeScript
Raw Normal View History

2021-10-03 16:33:23 +02:00
import { EventEmitter } from "events";
import ExtendedRequest from "./extended-request";
import {
MergedStolenDataEntry,
Sources,
StolenDataEntry,
} from "./stolen-data-entry";
2021-10-04 18:51:51 +02:00
import { allSubhosts, isSameURL, reduceConcat, unique } from "./util";
const source_priority: Array<Sources> = [
"cookie",
"pathname",
"queryparams",
"header",
];
2021-10-03 20:13:36 +02:00
2021-10-03 16:33:23 +02:00
export class RequestCluster extends EventEmitter {
public requests: ExtendedRequest[] = [];
constructor(public id: string) {
super();
}
add(request: ExtendedRequest) {
this.requests.push(request);
this.emit("change");
}
hasCookies() {
for (const request of this.requests) {
if (request.hasCookie()) {
return true;
}
}
return false;
}
2021-11-06 20:02:02 +01:00
getStolenData(filter: {
minValueLength: number;
cookiesOnly: boolean;
cookiesOrOriginOnly: boolean;
}): MergedStolenDataEntry[] {
2021-10-04 18:51:51 +02:00
return this.requests
.map((request) => request.stolenData)
2021-10-03 16:33:23 +02:00
.reduce((a, b) => a.concat(b), [])
2021-10-04 18:51:51 +02:00
.filter((entry) => {
return entry.value.length >= filter.minValueLength;
})
2021-11-06 20:02:02 +01:00
.filter((entry) => !filter.cookiesOnly || entry.source === "cookie")
.filter(
(entry) =>
!filter.cookiesOrOriginOnly ||
entry.source === "cookie" ||
entry.classification === "history"
)
.sort((entryA, entryB) => (entryA.name > entryB.name ? -1 : 1))
2021-10-04 18:51:51 +02:00
.filter((element, index, array) => {
// remove duplicates by name/value
2021-10-04 18:51:51 +02:00
if (index == 0) {
return true;
}
if (
element.name != array[index - 1].name ||
element.value != array[index - 1].value
) {
return true;
}
})
.sort((entryA, entryB) => (entryA.value > entryB.value ? -1 : 1))
.reduce(
(acc: MergedStolenDataEntry[], entry: StolenDataEntry) => {
// group by value
const last_entry = acc.slice(-1)[0];
if (last_entry.hasValue(entry.value)) {
last_entry.mergeWith(entry);
} else {
acc.push(new MergedStolenDataEntry([entry]));
}
return acc;
},
[new MergedStolenDataEntry([])] as MergedStolenDataEntry[]
)
.sort((entry1, entry2) =>
entry1.getPriority() > entry2.getPriority() ? -1 : 1
);
2021-10-03 16:33:23 +02:00
}
static sortCompare(a: RequestCluster, b: RequestCluster) {
if (a.hasCookies() == b.hasCookies()) {
if (a.id < b.id) {
return -1;
} else {
return 1;
}
} else {
if (a.hasCookies()) {
return -1;
} else {
return 1;
}
}
}
2021-11-07 15:45:26 +01:00
getMarkedRequests() {
return this.requests.filter((request) => request.hasMark());
}
getFullHosts() {
return unique(
this.requests
.map((request) => allSubhosts(request.getHost()))
.reduce((a, b) => a.concat(b), [])
);
}
2021-11-07 19:03:00 +01:00
hasMarks() {
return this.requests.some((request) => request.hasMark());
}
getMarkedEntries(): StolenDataEntry[] {
2021-11-07 19:03:00 +01:00
return this.requests
.map((request) => request.getMarkedEntries())
.reduce(reduceConcat, []);
}
exposesOrigin() {
return this.requests.some((request) => request.exposesOrigin());
}
getMarks() {
return this.requests
.map((request) => request.getMarkedEntries())
.reduce(reduceConcat, [])
.map((entry) => entry.marks)
.reduce(reduceConcat, []);
}
getRepresentativeMarks() {
// removes duplicates so the email/HAR file is shorter
return this.getMarks()
.sort((markA, markB) => {
if (markA.entry.value > markB.entry.value) {
return -1;
} else if (markA.entry.value < markB.entry.value) {
return 1;
} else {
const indexA = source_priority.indexOf(markA.source);
const indexB = source_priority.indexOf(markB.source);
if (indexA < indexB) {
return -1;
} else if (indexA > indexB) {
return 1;
} else {
return markA.entry.value.length > markB.entry.value.length ? -1 : 1;
}
}
})
.filter((_, index, array) => {
if (index == 0) {
return true;
}
if (
array[index].valuePreview === array[index - 1].valuePreview ||
(array[index].classification === "history" &&
array[index - 1].classification === "history") || // if they're both history, then the first one is the longest
isSameURL(array[index].entry.value, array[index - 1].entry.value)
) {
return false;
} else {
return true;
}
});
}
2021-10-03 16:33:23 +02:00
}