On Wed, 2020-09-09 at 22:05 +0200, Markus Elfring wrote: > > Implement a name cache and includes dependency graph to optimize > > performance for recursive parsing of header files. > > Can such information trigger any more evolution besides the > contributed > OCaml source code? > > > > The names of the above are stored in a "name cache", i.e. a > > hashtable > > to map the name to the files it is declared in. > > How much does hashing matter here? >
It's a hash table. I don't know how OCaml's Hashtbl works under the hood. > > > - A dependency graph is built to determine dependencies between all > > the > > files in the codebase. > > Can such information indicate a need for its own programming > interface? > If you mean graphs, there are entire modules for them in Coccinelle. (commons/ograph_*.ml). > > > - In the type annotation phase of the C subsystem, if a function > > call, > > struct/union field or identifier is encountered, the type of > > which is > > not known to the annoter, the name cache is checked for the name. > > Is there anything in common with symbol tables? > Kind of. Cheers, Jaskaran. > Regards, > Markus _______________________________________________ Cocci mailing list Cocci@systeme.lip6.fr https://systeme.lip6.fr/mailman/listinfo/cocci