Mirror/zeek
1
0
Fork 0
mirror of https://github.com/zeek/zeek.git synced 2025-10-14 12:38:20 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 2

Fix typos and formatting in the BiFs docs

Browse source
This commit is contained in:
Daniel Thayer 2013-10-17 01:04:20 -05:00
parent 92dc8e5880
commit 8c3adc9df6
5 changed files with 73 additions and 62 deletions
Download patch file Download diff file Expand all files Collapse all files

21
src/bro.bif
View file

@ -1,10 +1,11 @@
##! A collection of built-in functions that implement a variety of things ##! A collection of built-in functions that implement a variety of things
##! such as general programming algorithms, string processing, math functions, ##! such as general programming algorithms, string processing, math functions,
##! introspection, type conversion, file/directory manipulation, packet filtering, ##! introspection, type conversion, file/directory manipulation, packet
##! inter-process communication and controlling protocol analyzer behavior. ##! filtering, interprocess communication and controlling protocol analyzer
##! behavior.
##! ##!
##! You'll find most of Bro's built-in functions that aren't protocol-specific in ##! You'll find most of Bro's built-in functions that aren't protocol-specific
##! this file. ##! in this file.
%%{ // C segment %%{ // C segment
#include <math.h> #include <math.h>
@ -615,7 +616,7 @@ function md5_hmac%(...%): string
## Constructs an MD5 handle to enable incremental hash computation. You can ## Constructs an MD5 handle to enable incremental hash computation. You can
## feed data to the returned opaque value with :bro:id:`md5_hash_update` and ## feed data to the returned opaque value with :bro:id:`md5_hash_update` and
## eventually need to call :bro:id:`md5_hash_finish` to finish the computation ## eventually need to call :bro:id:`md5_hash_finish` to finish the computation
## and get the hash digest as result. ## and get the hash digest.
## ##
## For example, when computing incremental MD5 values of transferred files in ## For example, when computing incremental MD5 values of transferred files in
## multiple concurrent HTTP connections, one keeps an optional handle in the ## multiple concurrent HTTP connections, one keeps an optional handle in the
@ -640,12 +641,12 @@ function md5_hash_init%(%): opaque of md5
## Constructs an SHA1 handle to enable incremental hash computation. You can ## Constructs an SHA1 handle to enable incremental hash computation. You can
## feed data to the returned opaque value with :bro:id:`sha1_hash_update` and ## feed data to the returned opaque value with :bro:id:`sha1_hash_update` and
## finally need to call :bro:id:`sha1_hash_finish` to finish the computation ## finally need to call :bro:id:`sha1_hash_finish` to finish the computation
## and get the hash digest as result. ## and get the hash digest.
## ##
## For example, when computing incremental SHA1 values of transferred files in ## For example, when computing incremental SHA1 values of transferred files in
## multiple concurrent HTTP connections, one keeps an optional handle in the ## multiple concurrent HTTP connections, one keeps an optional handle in the
## HTTP session record. Then, one would call ## HTTP session record. Then, one would call
## ``c$http$sha1_handle = sha1_hash_init()`` ## once before invoking ## ``c$http$sha1_handle = sha1_hash_init()`` once before invoking
## ``sha1_hash_update(c$http$sha1_handle, some_more_data)`` in the ## ``sha1_hash_update(c$http$sha1_handle, some_more_data)`` in the
## :bro:id:`http_entity_data` event handler. When all data has arrived, a call ## :bro:id:`http_entity_data` event handler. When all data has arrived, a call
## to :bro:id:`sha1_hash_finish` returns the final hash value. ## to :bro:id:`sha1_hash_finish` returns the final hash value.
@ -665,12 +666,12 @@ function sha1_hash_init%(%): opaque of sha1
## Constructs an SHA256 handle to enable incremental hash computation. You can ## Constructs an SHA256 handle to enable incremental hash computation. You can
## feed data to the returned opaque value with :bro:id:`sha256_hash_update` and ## feed data to the returned opaque value with :bro:id:`sha256_hash_update` and
## finally need to call :bro:id:`sha256_hash_finish` to finish the computation ## finally need to call :bro:id:`sha256_hash_finish` to finish the computation
## and get the hash digest as result. ## and get the hash digest.
## ##
## For example, when computing incremental SHA256 values of transferred files in ## For example, when computing incremental SHA256 values of transferred files in
## multiple concurrent HTTP connections, one keeps an optional handle in the ## multiple concurrent HTTP connections, one keeps an optional handle in the
## HTTP session record. Then, one would call ## HTTP session record. Then, one would call
## ``c$http$sha256_handle = sha256_hash_init()`` ## once before invoking ## ``c$http$sha256_handle = sha256_hash_init()`` once before invoking
## ``sha256_hash_update(c$http$sha256_handle, some_more_data)`` in the ## ``sha256_hash_update(c$http$sha256_handle, some_more_data)`` in the
## :bro:id:`http_entity_data` event handler. When all data has arrived, a call ## :bro:id:`http_entity_data` event handler. When all data has arrived, a call
## to :bro:id:`sha256_hash_finish` returns the final hash value. ## to :bro:id:`sha256_hash_finish` returns the final hash value.
@ -1532,7 +1533,7 @@ function log10%(d: double%): double
# #
# =========================================================================== # ===========================================================================
## Determines whether *c* has been received externally. For example, ## Determines whether a connection has been received externally. For example,
## Broccoli or the Time Machine can send packets to Bro via a mechanism that is ## Broccoli or the Time Machine can send packets to Bro via a mechanism that is
## one step lower than sending events. This function checks whether the packets ## one step lower than sending events. This function checks whether the packets
## of a connection stem from one of these external *packet sources*. ## of a connection stem from one of these external *packet sources*.

15
src/probabilistic/bloom-filter.bif
View file

@ -50,8 +50,9 @@ function bloomfilter_basic_init%(fp: double, capacity: count,
%} %}
## Creates a basic Bloom filter. This function serves as a low-level ## Creates a basic Bloom filter. This function serves as a low-level
## alternative to bloomfilter_basic_init where the user has full control over ## alternative to :bro:id:`bloomfilter_basic_init` where the user has full
## the number of hash functions and cells in the underlying bit vector. ## control over the number of hash functions and cells in the underlying bit
## vector.
## ##
## k: The number of hash functions to use. ## k: The number of hash functions to use.
## ##
@ -97,7 +98,7 @@ function bloomfilter_basic_init2%(k: count, cells: count,
## counting Bloom filter, we refer to the Bloom filter literature ## counting Bloom filter, we refer to the Bloom filter literature
## here for choosing an appropiate value. ## here for choosing an appropiate value.
## ##
## max: The maximum counter value associated with each each element ## max: The maximum counter value associated with each element
## described by *w = ceil(log_2(max))* bits. Each bit in the underlying ## described by *w = ceil(log_2(max))* bits. Each bit in the underlying
## counter vector becomes a cell of size *w* bits. ## counter vector becomes a cell of size *w* bits.
## ##
@ -187,9 +188,9 @@ function bloomfilter_lookup%(bf: opaque of bloomfilter, x: any%): count
return new Val(0, TYPE_COUNT); return new Val(0, TYPE_COUNT);
%} %}
## Removes all elements from a Bloom filter. This function resets all bits in the ## Removes all elements from a Bloom filter. This function resets all bits in
## underlying bitvector back to 0 but does not change the parameterization of the ## the underlying bitvector back to 0 but does not change the parameterization
## Bloom filter, such as the element type and the hasher seed. ## of the Bloom filter, such as the element type and the hasher seed.
## ##
## bf: The Bloom filter handle. ## bf: The Bloom filter handle.
## ##
@ -242,6 +243,8 @@ function bloomfilter_merge%(bf1: opaque of bloomfilter,
## state. This is for debugging/testing purposes only. ## state. This is for debugging/testing purposes only.
## ##
## bf: The Bloom filter handle. ## bf: The Bloom filter handle.
##
## Returns: a string with a representation of a Bloom filter's internal state.
function bloomfilter_internal_state%(bf: opaque of bloomfilter%): string function bloomfilter_internal_state%(bf: opaque of bloomfilter%): string
%{ %{
BloomFilterVal* bfv = static_cast<BloomFilterVal*>(bf); BloomFilterVal* bfv = static_cast<BloomFilterVal*>(bf);

21
src/probabilistic/cardinality-counter.bif
View file

@ -8,11 +8,12 @@ using namespace probabilistic;
module GLOBAL; module GLOBAL;
## Initializes a probabilistic cardinality counter that uses the HyperLogLog algorithm. ## Initializes a probabilistic cardinality counter that uses the HyperLogLog
## algorithm.
## ##
## err: the desired error rate (e.g. 0.01). ## err: the desired error rate (e.g. 0.01).
## ##
## confidence: the desirec confidence for the error rate (e.g., 0.95). ## confidence: the desired confidence for the error rate (e.g., 0.95).
## ##
## Returns: a HLL cardinality handle. ## Returns: a HLL cardinality handle.
## ##
@ -30,9 +31,9 @@ function hll_cardinality_init%(err: double, confidence: double%): opaque of card
## ##
## handle: the HLL handle. ## handle: the HLL handle.
## ##
## elem: the element to add ## elem: the element to add.
## ##
## Returns: true on success ## Returns: true on success.
## ##
## .. bro:see:: hll_cardinality_estimate hll_cardinality_merge_into ## .. bro:see:: hll_cardinality_estimate hll_cardinality_merge_into
## hll_cardinality_init hll_cardinality_copy ## hll_cardinality_init hll_cardinality_copy
@ -61,11 +62,11 @@ function hll_cardinality_add%(handle: opaque of cardinality, elem: any%): bool
## .. note:: The same restrictions as for Bloom filter merging apply, ## .. note:: The same restrictions as for Bloom filter merging apply,
## see :bro:id:`bloomfilter_merge`. ## see :bro:id:`bloomfilter_merge`.
## ##
## handle1: the first HLL handle, which will contain the merged result ## handle1: the first HLL handle, which will contain the merged result.
## ##
## handle2: the second HLL handle, which will be merged into the first ## handle2: the second HLL handle, which will be merged into the first.
## ##
## Returns: true on success ## Returns: true on success.
## ##
## .. bro:see:: hll_cardinality_estimate hll_cardinality_add ## .. bro:see:: hll_cardinality_estimate hll_cardinality_add
## hll_cardinality_init hll_cardinality_copy ## hll_cardinality_init hll_cardinality_copy
@ -98,7 +99,7 @@ function hll_cardinality_merge_into%(handle1: opaque of cardinality, handle2: op
## Estimate the current cardinality of an HLL cardinality counter. ## Estimate the current cardinality of an HLL cardinality counter.
## ##
## handle: the HLL handle ## handle: the HLL handle.
## ##
## Returns: the cardinality estimate. Returns -1.0 if the counter is empty. ## Returns: the cardinality estimate. Returns -1.0 if the counter is empty.
## ##
@ -116,9 +117,9 @@ function hll_cardinality_estimate%(handle: opaque of cardinality%): double
## Copy a HLL cardinality counter. ## Copy a HLL cardinality counter.
## ##
## handle: cardinality counter to copy ## handle: cardinality counter to copy.
## ##
## Returns: copy of handle ## Returns: copy of handle.
## ##
## .. bro:see:: hll_cardinality_estimate hll_cardinality_merge_into hll_cardinality_add ## .. bro:see:: hll_cardinality_estimate hll_cardinality_merge_into hll_cardinality_add
## hll_cardinality_init ## hll_cardinality_init

64
src/probabilistic/top-k.bif
View file

@ -6,7 +6,7 @@
## Creates a top-k data structure which tracks *size* elements. ## Creates a top-k data structure which tracks *size* elements.
## ##
## size: number of elements to track ## size: number of elements to track.
## ##
## Returns: Opaque pointer to the data structure. ## Returns: Opaque pointer to the data structure.
## ##
@ -24,9 +24,9 @@ function topk_init%(size: count%): opaque of topk
## the top-k data structure. All following values have to be of the same ## the top-k data structure. All following values have to be of the same
## type. ## type.
## ##
## handle: the TopK handle ## handle: the TopK handle.
## ##
## value: observed value ## value: observed value.
## ##
## .. bro:see:: topk_init topk_get_top topk_count topk_epsilon ## .. bro:see:: topk_init topk_get_top topk_count topk_epsilon
## topk_size topk_sum topk_merge topk_merge_prune ## topk_size topk_sum topk_merge topk_merge_prune
@ -41,11 +41,11 @@ function topk_add%(handle: opaque of topk, value: any%): any
## Get the first *k* elements of the top-k data structure. ## Get the first *k* elements of the top-k data structure.
## ##
## handle: the TopK handle ## handle: the TopK handle.
## ##
## k: number of elements to return ## k: number of elements to return.
## ##
## Returns: vector of the first k elements ## Returns: vector of the first k elements.
## ##
## .. bro:see:: topk_init topk_add topk_count topk_epsilon ## .. bro:see:: topk_init topk_add topk_count topk_epsilon
## topk_size topk_sum topk_merge topk_merge_prune ## topk_size topk_sum topk_merge topk_merge_prune
@ -56,16 +56,17 @@ function topk_get_top%(handle: opaque of topk, k: count%): any
return h->GetTopK(k); return h->GetTopK(k);
%} %}
## Get an overestimated count of how often value has been encountered. ## Get an overestimated count of how often a value has been encountered.
## ##
## .. note:: value has to be part of the currently tracked elements, otherwise ## .. note:: The value has to be part of the currently tracked elements,
## 0 will be returned and an error message will be added to reporter. ## otherwise 0 will be returned and an error message will be added to
## reporter.
## ##
## handle: the TopK handle ## handle: the TopK handle.
## ##
## value: Value to look up count for. ## value: Value to look up count for.
## ##
## Returns: Overestimated number for how often the element has been encountered ## Returns: Overestimated number for how often the element has been encountered.
## ##
## .. bro:see:: topk_init topk_add topk_get_top topk_epsilon ## .. bro:see:: topk_init topk_add topk_get_top topk_epsilon
## topk_size topk_sum topk_merge topk_merge_prune ## topk_size topk_sum topk_merge topk_merge_prune
@ -80,11 +81,12 @@ function topk_count%(handle: opaque of topk, value: any%): count
## ##
## .. note:: Same restrictions as for :bro:id:`topk_count` apply. ## .. note:: Same restrictions as for :bro:id:`topk_count` apply.
## ##
## handle: the TopK handle ## handle: the TopK handle.
## ##
## value: Value to look up epsilon for. ## value: Value to look up epsilon for.
## ##
## Returns: Number which represents the maximal overesimation for the count of this element. ## Returns: Number which represents the maximal overestimation for the count of
## this element.
## ##
## .. bro:see:: topk_init topk_add topk_get_top topk_count ## .. bro:see:: topk_init topk_add topk_get_top topk_count
## topk_size topk_sum topk_merge topk_merge_prune ## topk_size topk_sum topk_merge topk_merge_prune
@ -95,14 +97,15 @@ function topk_epsilon%(handle: opaque of topk, value: any%): count
return new Val(h->GetEpsilon(value), TYPE_COUNT); return new Val(h->GetEpsilon(value), TYPE_COUNT);
%} %}
## Get the number of elements this data structure is supposed to track (given on init). ## Get the number of elements this data structure is supposed to track (given
## on init).
## ##
## .. note ::Note that the actual number of elements in the data structure can be lower ## .. note:: Note that the actual number of elements in the data structure can
## or higher (due to non-pruned merges) than this. ## be lower or higher (due to non-pruned merges) than this.
## ##
## handle: the TopK handle ## handle: the TopK handle.
## ##
## Returns: size given during initialization ## Returns: size given during initialization.
## ##
## .. bro:see:: topk_init topk_add topk_get_top topk_count topk_epsilon ## .. bro:see:: topk_init topk_add topk_get_top topk_count topk_epsilon
## topk_sum topk_merge topk_merge_prune ## topk_sum topk_merge topk_merge_prune
@ -115,13 +118,14 @@ function topk_size%(handle: opaque of topk%): count
## Get the sum of all counts of all elements in the data structure. ## Get the sum of all counts of all elements in the data structure.
## ##
## .. note:: This is equal to the number of all inserted objects if the data structure ## .. note:: This is equal to the number of all inserted objects if the data
## never has been pruned. Do not use after calling topk_merge_prune (will throw a ## structure never has been pruned. Do not use after
## warning message if used afterwards) ## calling :bro:id:`topk_merge_prune` (will throw a warning message if used
## afterwards).
## ##
## handle: the TopK handle ## handle: the TopK handle.
## ##
## Returns: sum of all counts ## Returns: sum of all counts.
## ##
## .. bro:see:: topk_init topk_add topk_get_top topk_count topk_epsilon ## .. bro:see:: topk_init topk_add topk_get_top topk_count topk_epsilon
## topk_size topk_merge topk_merge_prune ## topk_size topk_merge topk_merge_prune
@ -132,10 +136,10 @@ function topk_sum%(handle: opaque of topk%): count
return new Val(h->GetSum(), TYPE_COUNT); return new Val(h->GetSum(), TYPE_COUNT);
%} %}
## Merge the second topk data structure into the first. ## Merge the second top-k data structure into the first.
## ##
## .. note:: This does not remove any elements, the resulting data structure can be ## .. note:: This does not remove any elements, the resulting data structure
## bigger than the maximum size given on initialization. ## can be bigger than the maximum size given on initialization.
## ##
## .. bro:see:: topk_init topk_add topk_get_top topk_count topk_epsilon ## .. bro:see:: topk_init topk_add topk_get_top topk_count topk_epsilon
## topk_size topk_sum topk_merge_prune ## topk_size topk_sum topk_merge_prune
@ -152,16 +156,16 @@ function topk_merge%(handle1: opaque of topk, handle2: opaque of topk%): any
return 0; return 0;
%} %}
## Merge the second topk data structure into the first and prunes the final data ## Merge the second top-k data structure into the first and prunes the final
## structure back to the size given on initialization. ## data structure back to the size given on initialization.
## ##
## .. note:: Use with care and only when being aware of the restrictions this ## .. note:: Use with care and only when being aware of the restrictions this
## entails. Do not call :bro:id:`topk_size` or :bro:id:`topk_add` afterwards, ## entails. Do not call :bro:id:`topk_size` or :bro:id:`topk_add` afterwards,
## results will probably not be what you expect. ## results will probably not be what you expect.
## ##
## handle1: the TopK handle in which the second TopK structure is merged ## handle1: the TopK handle in which the second TopK structure is merged.
## ##
## handle2: the TopK handle in which is merged into the first TopK structure ## handle2: the TopK handle in which is merged into the first TopK structure.
## ##
## .. bro:see:: topk_init topk_add topk_get_top topk_count topk_epsilon ## .. bro:see:: topk_init topk_add topk_get_top topk_count topk_epsilon
## topk_size topk_sum topk_merge ## topk_size topk_sum topk_merge

2
src/strings.bif
View file

@ -1052,6 +1052,8 @@ function find_last%(str: string, re: pattern%) : string
## ##
## data_str: The string to dump in hex format. ## data_str: The string to dump in hex format.
## ##
## Returns: The hex dump of the given string.
##
## .. bro:see:: string_to_ascii_hex bytestring_to_hexstr ## .. bro:see:: string_to_ascii_hex bytestring_to_hexstr
## ##
## .. note:: Based on Netdude's hex editor code. ## .. note:: Based on Netdude's hex editor code.