mirror of
https://github.com/swift-server/async-http-client.git
synced 2026-06-02 07:37:34 +00:00
Johannes Weiss
e2d03ffb32
Motivation: At the moment, AHC assumes that creating a `NIOSSLContext` is both cheap and doesn't block. Neither of these two assumptions are true. To create a `NIOSSLContext`, BoringSSL will have to read a lot of certificates in the trust store (on disk) which require a lot of ASN1 parsing and much much more. On my Ubuntu test machine, creating one `NIOSSLContext` is about 27,000 allocations!!! To make it worse, AHC allocates a fresh `NIOSSLContext` for _every single connection_, whether HTTP or HTTPS. Yes, correct. Modification: - Cache NIOSSLContexts per TLSConfiguration in a LRU cache - Don't get an NIOSSLContext for HTTP (plain text) connections Result: New connections should be _much_ faster in general assuming that you're not using a different TLSConfiguration for every connection.
84 lines
2.4 KiB
Swift
84 lines
2.4 KiB
Swift
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This source file is part of the AsyncHTTPClient open source project
|
|
//
|
|
// Copyright (c) 2021 Apple Inc. and the AsyncHTTPClient project authors
|
|
// Licensed under Apache License v2.0
|
|
//
|
|
// See LICENSE.txt for license information
|
|
// See CONTRIBUTORS.txt for the list of AsyncHTTPClient project authors
|
|
//
|
|
// SPDX-License-Identifier: Apache-2.0
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
@testable import AsyncHTTPClient
|
|
import XCTest
|
|
|
|
class LRUCacheTests: XCTestCase {
|
|
func testBasicsWork() {
|
|
var cache = LRUCache<Int, Int>(capacity: 1)
|
|
var requestedValueGens = 0
|
|
for i in 0..<10 {
|
|
let actual = cache.findOrAppend(key: i) { i in
|
|
requestedValueGens += 1
|
|
return i
|
|
}
|
|
XCTAssertEqual(i, actual)
|
|
}
|
|
XCTAssertEqual(10, requestedValueGens)
|
|
|
|
let nine = cache.findOrAppend(key: 9) { i in
|
|
XCTAssertEqual(9, i)
|
|
XCTFail("9 should be in the cache")
|
|
return -1
|
|
}
|
|
XCTAssertEqual(9, nine)
|
|
}
|
|
|
|
func testCachesTheRightThings() {
|
|
var cache = LRUCache<Int, Int>(capacity: 3)
|
|
|
|
for i in 0..<10 {
|
|
let actual = cache.findOrAppend(key: i) { i in
|
|
i
|
|
}
|
|
XCTAssertEqual(i, actual)
|
|
|
|
let zero = cache.find(key: 0)
|
|
XCTAssertEqual(0, zero, "at \(i), couldn't find 0")
|
|
|
|
cache.append(key: -1, value: -1)
|
|
XCTAssertEqual(-1, cache.find(key: -1))
|
|
}
|
|
|
|
XCTAssertEqual(0, cache.find(key: 0))
|
|
XCTAssertEqual(9, cache.find(key: 9))
|
|
|
|
for i in 1..<9 {
|
|
XCTAssertNil(cache.find(key: i))
|
|
}
|
|
}
|
|
|
|
func testAppendingTheSameDoesNotEvictButUpdates() {
|
|
var cache = LRUCache<Int, Int>(capacity: 3)
|
|
|
|
cache.append(key: 1, value: 1)
|
|
cache.append(key: 3, value: 3)
|
|
for i in (2...100).reversed() {
|
|
cache.append(key: 2, value: i)
|
|
XCTAssertEqual(i, cache.find(key: 2))
|
|
}
|
|
|
|
for i in 1...3 {
|
|
XCTAssertEqual(i, cache.find(key: i))
|
|
}
|
|
|
|
cache.append(key: 4, value: 4)
|
|
XCTAssertNil(cache.find(key: 1))
|
|
for i in 2...4 {
|
|
XCTAssertEqual(i, cache.find(key: i))
|
|
}
|
|
}
|
|
}
|