6 Commits (c1dd4534d9c3d47babeb3e1104581e18182797f3)

Author	SHA1	Message	Date
Victor Julien	b84eba80aa	detect/nfs.version: minor cleanups	6 years ago
Victor Julien	2ea11da230	detect/nfs: add nfs.version	6 years ago
Victor Julien	aefce4d761	detect/nfs: remove HAVE_RUST guards	6 years ago
Victor Julien	5879dafe55	detect: cleanup direct SIG_FLAG_STATE_MATCH use ... This flag should normally not be set manually. It will be set by the code registering the app engines in a signature.	7 years ago
Victor Julien	e96d9c1159	app-layer: add tx iterator API ... Until now, the transaction space is assumed to be terse. Transactions are handled sequentially so the difference between the lowest and highest active tx id's is small. For this reason the logic of walking every id between the 'minimum' and max id made sense. The space might look like: [..........TTTT] Here the looping starts at the first T and loops 4 times. This assumption isn't a great fit though. A protocol like NFS has 2 types of transactions. Long running file transfer transactions and short lived request/reply pairs are causing the id space to be sparse. This leads to a lot of unnecessary looping in various parts of the engine, but most prominently: detection, tx house keeping and tx logging. [.T..T...TTTT.T] Here the looping starts at the first T and loops for every spot, even those where no tx exists anymore. Cases have been observed where the lowest tx id was 2 and the highest was 50k. This lead to a lot of unnecessary looping. This patch add an alternative approach. It allows a protocol to register an iterator function, that simply returns the next transaction until all transactions are returned. To do this it uses a bit of state the caller must keep. The registration is optional. If no iterator is registered the old behaviour will be used.	8 years ago
Victor Julien	e0c6565e68	nfs: nfs_version keyword ... Store nfs version in tx and add keyword to match on it.	8 years ago