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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
|
{-# LANGUAGE CPP #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
module Network.HPACK.Table.RevIndex (
RevIndex,
newRevIndex,
renewRevIndex,
lookupRevIndex,
lookupRevIndex',
insertRevIndex,
deleteRevIndexList,
) where
import Data.Array (Array)
import qualified Data.Array as A
import Data.Array.Base (unsafeAt)
import Data.CaseInsensitive (foldedCase)
import Data.Function (on)
import Data.IORef
import Data.Map.Strict (Map)
import qualified Data.Map.Strict as M
import Imports
import Network.HPACK.Table.Entry
import Network.HPACK.Table.Static
import Network.HPACK.Token
import Network.HPACK.Types
----------------------------------------------------------------
data RevIndex = RevIndex DynamicRevIndex OtherRevIdex
type DynamicRevIndex = Array Int (IORef ValueMap)
data KeyValue = KeyValue HeaderName HeaderValue deriving (Eq, Ord)
-- We always create an index for a pair of an unknown header and its value
-- in Linear{H}.
type OtherRevIdex = IORef (Map KeyValue HIndex)
{-# SPECIALIZE INLINE M.lookup ::
KeyValue -> M.Map KeyValue HIndex -> Maybe HIndex
#-}
{-# SPECIALIZE INLINE M.delete ::
KeyValue -> M.Map KeyValue HIndex -> M.Map KeyValue HIndex
#-}
{-# SPECIALIZE INLINE M.insert ::
KeyValue -> HIndex -> M.Map KeyValue HIndex -> M.Map KeyValue HIndex
#-}
----------------------------------------------------------------
type StaticRevIndex = Array Int StaticEntry
data StaticEntry = StaticEntry HIndex (Maybe ValueMap) deriving (Show)
type ValueMap = Map HeaderValue HIndex
----------------------------------------------------------------
staticRevIndex :: StaticRevIndex
staticRevIndex = A.array (minTokenIx, maxStaticTokenIx) $ map toEnt zs
where
toEnt (k, xs) = (tokenIx (toToken k), m)
where
m = case xs of
[] -> error "staticRevIndex"
[("", i)] -> StaticEntry i Nothing
(_, i) : _ ->
let vs = M.fromList xs
in StaticEntry i (Just vs)
zs = map extract $ groupBy ((==) `on` fst) lst
where
lst = zipWith (\(k, v) i -> (k, (v, i))) staticTableList $ map SIndex [1 ..]
extract xs = (fst (head xs), map snd xs)
{-# INLINE lookupStaticRevIndex #-}
lookupStaticRevIndex
:: Int -> HeaderValue -> (HIndex -> IO ()) -> (HIndex -> IO ()) -> IO ()
lookupStaticRevIndex ix v fa' fbd' = case staticRevIndex `unsafeAt` ix of
StaticEntry i Nothing -> fbd' i
StaticEntry i (Just m) -> case M.lookup v m of
Nothing -> fbd' i
Just j -> fa' j
----------------------------------------------------------------
newDynamicRevIndex :: IO DynamicRevIndex
newDynamicRevIndex = A.listArray (minTokenIx, maxStaticTokenIx) <$> mapM mk lst
where
mk _ = newIORef M.empty
lst = [minTokenIx .. maxStaticTokenIx]
renewDynamicRevIndex :: DynamicRevIndex -> IO ()
renewDynamicRevIndex drev = mapM_ clear [minTokenIx .. maxStaticTokenIx]
where
clear t = writeIORef (drev `unsafeAt` t) M.empty
{-# INLINE lookupDynamicStaticRevIndex #-}
lookupDynamicStaticRevIndex
:: Int
-> HeaderValue
-> DynamicRevIndex
-> (HIndex -> IO ())
-> (HIndex -> IO ())
-> IO ()
lookupDynamicStaticRevIndex ix v drev fa' fbd' = do
let ref = drev `unsafeAt` ix
m <- readIORef ref
case M.lookup v m of
Just i -> fa' i
Nothing -> lookupStaticRevIndex ix v fa' fbd'
{-# INLINE insertDynamicRevIndex #-}
insertDynamicRevIndex
:: Token -> HeaderValue -> HIndex -> DynamicRevIndex -> IO ()
insertDynamicRevIndex t v i drev = modifyIORef ref $ M.insert v i
where
ref = drev `unsafeAt` tokenIx t
{-# INLINE deleteDynamicRevIndex #-}
deleteDynamicRevIndex :: Token -> HeaderValue -> DynamicRevIndex -> IO ()
deleteDynamicRevIndex t v drev = modifyIORef ref $ M.delete v
where
ref = drev `unsafeAt` tokenIx t
----------------------------------------------------------------
newOtherRevIndex :: IO OtherRevIdex
newOtherRevIndex = newIORef M.empty
renewOtherRevIndex :: OtherRevIdex -> IO ()
renewOtherRevIndex ref = writeIORef ref M.empty
{-# INLINE lookupOtherRevIndex #-}
lookupOtherRevIndex
:: Header -> OtherRevIdex -> (HIndex -> IO ()) -> IO () -> IO ()
lookupOtherRevIndex (k, v) ref fa' fc' = do
oth <- readIORef ref
maybe fc' fa' $ M.lookup (KeyValue k v) oth
{-# INLINE insertOtherRevIndex #-}
insertOtherRevIndex :: Token -> HeaderValue -> HIndex -> OtherRevIdex -> IO ()
insertOtherRevIndex t v i ref = modifyIORef' ref $ M.insert (KeyValue k v) i
where
k = tokenFoldedKey t
{-# INLINE deleteOtherRevIndex #-}
deleteOtherRevIndex :: Token -> HeaderValue -> OtherRevIdex -> IO ()
deleteOtherRevIndex t v ref = modifyIORef' ref $ M.delete (KeyValue k v)
where
k = tokenFoldedKey t
----------------------------------------------------------------
newRevIndex :: IO RevIndex
newRevIndex = RevIndex <$> newDynamicRevIndex <*> newOtherRevIndex
renewRevIndex :: RevIndex -> IO ()
renewRevIndex (RevIndex dyn oth) = do
renewDynamicRevIndex dyn
renewOtherRevIndex oth
{-# INLINE lookupRevIndex #-}
lookupRevIndex
:: Token
-> HeaderValue
-> (HIndex -> IO ())
-> (HeaderValue -> Entry -> HIndex -> IO ())
-> (HeaderName -> HeaderValue -> Entry -> IO ())
-> (HeaderValue -> HIndex -> IO ())
-> RevIndex
-> IO ()
lookupRevIndex t@Token{..} v fa fb fc fd (RevIndex dyn oth)
| not (isStaticTokenIx tokenIx) = lookupOtherRevIndex (k, v) oth fa' fc'
| shouldBeIndexed =
lookupDynamicStaticRevIndex tokenIx v dyn fa' fb'
-- path: is not indexed but ":path /" should be used, sigh.
| otherwise = lookupStaticRevIndex tokenIx v fa' fd'
where
k = foldedCase tokenKey
ent = toEntryToken t v
fa' = fa
fb' = fb v ent
fc' = fc k v ent
fd' = fd v
{-# INLINE lookupRevIndex' #-}
lookupRevIndex'
:: Token
-> HeaderValue
-> (HIndex -> IO ())
-> (HeaderValue -> HIndex -> IO ())
-> (HeaderName -> HeaderValue -> IO ())
-> IO ()
lookupRevIndex' Token{..} v fa fd fe
| isStaticTokenIx tokenIx = lookupStaticRevIndex tokenIx v fa' fd'
| otherwise = fe'
where
k = foldedCase tokenKey
fa' = fa
fd' = fd v
fe' = fe k v
----------------------------------------------------------------
{-# INLINE insertRevIndex #-}
insertRevIndex :: Entry -> HIndex -> RevIndex -> IO ()
insertRevIndex (Entry _ t v) i (RevIndex dyn oth)
| isStaticToken t = insertDynamicRevIndex t v i dyn
| otherwise = insertOtherRevIndex t v i oth
{-# INLINE deleteRevIndex #-}
deleteRevIndex :: RevIndex -> Entry -> IO ()
deleteRevIndex (RevIndex dyn oth) (Entry _ t v)
| isStaticToken t = deleteDynamicRevIndex t v dyn
| otherwise = deleteOtherRevIndex t v oth
{-# INLINE deleteRevIndexList #-}
deleteRevIndexList :: [Entry] -> RevIndex -> IO ()
deleteRevIndexList es rev = mapM_ (deleteRevIndex rev) es
|
