Alexis Huxley <[email protected]> writes: > Hi, I've been tasked with enhancing the load_formula expression > evaluator. I've compiled 8.1.8, added the recently discussed patches, > written an expression parser (with lex and yacc), integrated it, > temporarily I've return(true)-ed early in validate_load_formula() > and things are looking quite good! I can set load_formula to crazy > stuff like: > > 10*sqrt(swap_free) + 1/atan(np_load_avg) > > and the right thing seems to happen. I'll post the patch once the > code is working full, properly tested and looks cleaner, if people > are interested.
Please do. It would be good to explain the motivation and why the current parser isn't good enough (I don't remember how it works and whether it's used elsewhere), and check any regression in scheduling efficiency. It probably needs to be thread-safe, and I vaguely recall that lex/yacc output isn't. I'd probably just use a recursive descent parser, but wouldn't reject lex/yacc per se. For what it's worth, I'd thought the way to configure scheduling would be to embed Scheme and/or Lua as an extension language and/or provide hooks for loadable DSOs. I assume defining slots on the host does work.? _______________________________________________ SGE-discuss mailing list [email protected] https://arc.liv.ac.uk/mailman/listinfo/sge-discuss
