791f5774d0
Put a hash-table of "interesting" fields in the per-proto-tree data. The dfilter code records which fields/protocols are "interesting" (by which I mean, their value or existence is checked). Thus, the proto_tree routines can create special arrays of field_info*'s that are ready for the dfilter engine to use during a filter operation. Also store the "proto_tree_is_visible" boolean, renamed "visible", in the per-proto-tree data. Move epan_dissect_t to its own header file to make #include dependencies easier to handle. Provide epan_dissect_fill_in_columns(), which accepts just the epan_dissect_t* as an argument. epan_dissect_new() needs to be followed by epan_dissect_run() for the dissection to actually take place. Between those two calls, epan_dissect_prime_dfilter() can be run 0, 1, or multiple times in order to prime the empty proto_tree with the "intersesting" fields from the dfilter_t. svn path=/trunk/; revision=4422
11 lines
147 B
C
11 lines
147 B
C
#ifndef GENCODE_H
|
|
#define GENCODE_H
|
|
|
|
void
|
|
dfw_gencode(dfwork_t *dfw);
|
|
|
|
int*
|
|
dfw_interesting_fields(dfwork_t *dfw, int *caller_num_fields);
|
|
|
|
#endif
|