File: TestClassifier.cpp

package info (click to toggle)
thunderbird 1%3A78.8.0-1~deb10u1
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 2,910,720 kB
  • sloc: cpp: 5,890,568; javascript: 4,416,354; ansic: 3,051,657; python: 917,001; asm: 304,197; xml: 206,624; sh: 109,232; java: 108,679; makefile: 22,984; perl: 15,867; yacc: 4,565; objc: 3,026; pascal: 1,787; lex: 1,720; ada: 1,681; cs: 879; exp: 505; awk: 485; sql: 452; php: 436; lisp: 432; ruby: 99; sed: 69; csh: 45
file content (85 lines) | stat: -rw-r--r-- 3,155 bytes parent folder | download | duplicates (4)
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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, You can obtain one at http://mozilla.org/MPL/2.0/. */

#include "Classifier.h"
#include "LookupCacheV4.h"

#include "Common.h"

static void TestReadNoiseEntries(RefPtr<Classifier> classifier,
                                 const nsCString& aTable, const nsCString& aURL,
                                 const _PrefixArray& aPrefixArray) {
  Completion lookupHash;
  lookupHash.FromPlaintext(aURL);
  RefPtr<LookupResult> result = new LookupResult;
  result->hash.complete = lookupHash;

  PrefixArray noiseEntries;
  uint32_t noiseCount = 3;
  nsresult rv;
  rv = classifier->ReadNoiseEntries(result->hash.fixedLengthPrefix, aTable,
                                    noiseCount, noiseEntries);
  ASSERT_TRUE(rv == NS_OK)
  << "ReadNoiseEntries returns an error";
  EXPECT_TRUE(noiseEntries.Length() > 0)
      << "Number of noise entries is less than 0";

  for (uint32_t i = 0; i < noiseEntries.Length(); i++) {
    // Test the noise entry should not equal the "real" hash request
    EXPECT_NE(noiseEntries[i], result->hash.fixedLengthPrefix)
        << "Noise entry is the same as real hash request";
    // Test the noise entry should exist in the cached prefix array
    nsAutoCString partialHash;
    partialHash.Assign(reinterpret_cast<char*>(&noiseEntries[i]), PREFIX_SIZE);
    EXPECT_TRUE(aPrefixArray.Contains(partialHash))
        << "Noise entry is not in the cached prefix array";
  }
}

TEST(UrlClassifierClassifier, ReadNoiseEntriesV4)
{
  RefPtr<Classifier> classifier = GetClassifier();
  _PrefixArray array = {
      CreatePrefixFromURL("bravo.com/", 5),
      CreatePrefixFromURL("browsing.com/", 9),
      CreatePrefixFromURL("gound.com/", 4),
      CreatePrefixFromURL("small.com/", 4),
      CreatePrefixFromURL("gdfad.com/", 4),
      CreatePrefixFromURL("afdfound.com/", 4),
      CreatePrefixFromURL("dffa.com/", 4),
  };

  nsresult rv;
  rv = BuildLookupCache(classifier, GTEST_TABLE_V4, array);
  ASSERT_TRUE(rv == NS_OK)
  << "Fail to build LookupCache";

  TestReadNoiseEntries(classifier, GTEST_TABLE_V4,
                       NS_LITERAL_CSTRING("gound.com/"), array);
}

TEST(UrlClassifierClassifier, ReadNoiseEntriesV2)
{
  RefPtr<Classifier> classifier = GetClassifier();
  _PrefixArray array = {
      CreatePrefixFromURL("helloworld.com/", 4),
      CreatePrefixFromURL("firefox.com/", 4),
      CreatePrefixFromURL("chrome.com/", 4),
      CreatePrefixFromURL("safebrowsing.com/", 4),
      CreatePrefixFromURL("opera.com/", 4),
      CreatePrefixFromURL("torbrowser.com/", 4),
      CreatePrefixFromURL("gfaads.com/", 4),
      CreatePrefixFromURL("qggdsas.com/", 4),
      CreatePrefixFromURL("nqtewq.com/", 4),
  };

  nsresult rv;
  rv = BuildLookupCache(classifier, GTEST_TABLE_V2, array);
  ASSERT_TRUE(rv == NS_OK)
  << "Fail to build LookupCache";

  TestReadNoiseEntries(classifier, GTEST_TABLE_V2,
                       NS_LITERAL_CSTRING("helloworld.com/"), array);
}