|
NAMEftimes-proximo - Locate a group of dig hits within a specified byte rangeSYNOPSISftimes-proximo [-l limit] [-r range] {-G group=tag,tag[,tag[,...]][:range]|-g <groups-file}> -f {file|-}DESCRIPTIONThis utility locates a group of dig hits within a specified byte range. To work properly, the input must be sorted by 'hostname' (when present), 'name', and 'offset' in ascending order. Note that this utility does not sort the input -- that step can be done with ftimes-sortini(1). The input format can vary so long as it contains at least the 'name', 'tag', 'offset', and 'string' fields. The two most common formats are:name|type|tag|offset|string and hostname|name|type|tag|offset|string|joiner The first is produced by ftimes(1) and hipdig(1), and the second is produced by ftimes-dig2dbi(1). Each input record must contain a non-null tag value -- those that don't will be ignored. Generally, each tag should correspond to a unique dig string. However, tag overloading is allowed. This utility can also take its own output as input, thus providing a way to analyze groups of groups. In that case, the input must contain at least the 'name', 'group', 'footprint', and 'offset' fields. Output is written to stdout in one of the following formats: name|group|ordered|proximity|gap|limit|range|window|footprint|offset|offsets|tags or hostname|name|group|ordered|proximity|gap|limit|range|window|footprint|offset|offsets|tags The breakdown of the output format is as follows:
The trigger event for generating an output record is a group match. Each time a member offset changes for a given group, the entire group is evaluated to see if the resulting set of offsets fall within the specified range. If that condition is met, then an output record is generated. OPTIONS
CAVEATSGroup matching only maintains (i.e., remembers) the last offset of each group member. This means that there are cases where a single group could have multiple matches in a specified range, but only one is reported. For example, suppose you have the following group definition:g_test=a1,b2,c3,d4:100 Now suppose that you have the following dig records: name|type|tag|offset|string "file"|normal|a1|10|a1 "file"|normal|b2|20|b2 "file"|normal|c3|30|c3 "file"|normal|a1|40|a1 "file"|normal|d4|50|d4 In this case, one could say that the group matches twice within the specified range of 100 bytes. Once for offsets 10, 20, 30, and 50, and once for offsets 20, 30, 40, and 50. Since this utility only maintains the last offset of each group member, only the second set of offsets is considered a match. This happens because the 'a1' offset is reset from 10 to 40 when the fourth record (not counting the header) is porcessed. Effectively, this means that given two potential matches within a specified range, the match where the offsets are the closest always wins. AUTHORKlayton MonroeSEE ALSOftimes(1), ftimes-dig2ctx(1), ftimes-dig2dbi(1), ftimes-sortini(1), hipdig(1)HISTORYThis utility was initially written to perform proximity analysis in a case where we needed to identify last names in close proximity to their respective Social Security Numbers (SSN).This utility first appeared in FTimes 3.9.0. LICENSEAll documentation and code are distributed under same terms and conditions as FTimes.
Visit the GSP FreeBSD Man Page Interface. |