1 /*
  2  * Copyright (c) 1997, 2019, Oracle and/or its affiliates. All rights reserved.
  3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  4  *
  5  * This code is free software; you can redistribute it and/or modify it
  6  * under the terms of the GNU General Public License version 2 only, as
  7  * published by the Free Software Foundation.
  8  *
  9  * This code is distributed in the hope that it will be useful, but WITHOUT
 10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 12  * version 2 for more details (a copy is included in the LICENSE file that
 13  * accompanied this code).
 14  *
 15  * You should have received a copy of the GNU General Public License version
 16  * 2 along with this work; if not, write to the Free Software Foundation,
 17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 18  *
 19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 20  * or visit www.oracle.com if you need additional information or have any
 21  * questions.
 22  *
 23  */
 24 
 25 #ifndef SHARE_OPTO_PARSE_HPP
 26 #define SHARE_OPTO_PARSE_HPP
 27 
 28 #include "ci/ciMethodData.hpp"
 29 #include "ci/ciTypeFlow.hpp"
 30 #include "compiler/methodLiveness.hpp"
 31 #include "libadt/vectset.hpp"
 32 #include "oops/generateOopMap.hpp"
 33 #include "opto/graphKit.hpp"
 34 #include "opto/subnode.hpp"
 35 
 36 class BytecodeParseHistogram;
 37 class InlineTree;
 38 class Parse;
 39 class SwitchRange;
 40 
 41 
 42 //------------------------------InlineTree-------------------------------------
 43 class InlineTree : public ResourceObj {
 44   friend class VMStructs;
 45 
 46   Compile*    C;                  // cache
 47   JVMState*   _caller_jvms;       // state of caller
 48   ciMethod*   _method;            // method being called by the caller_jvms
 49   InlineTree* _caller_tree;
 50   uint        _count_inline_bcs;  // Accumulated count of inlined bytecodes
 51   const int   _max_inline_level;  // the maximum inline level for this sub-tree (may be adjusted)
 52 
 53   GrowableArray<InlineTree*> _subtrees;
 54 
 55   bool pass_initial_checks(ciMethod* caller_method, int caller_bci, ciMethod* callee_method);
 56 
 57   void print_impl(outputStream* stj, int indent) const PRODUCT_RETURN;
 58   const char* _msg;
 59 protected:
 60   InlineTree(Compile* C,
 61              const InlineTree* caller_tree,
 62              ciMethod* callee_method,
 63              JVMState* caller_jvms,
 64              int caller_bci,
 65              int max_inline_level);
 66   InlineTree *build_inline_tree_for_callee(ciMethod* callee_method,
 67                                            JVMState* caller_jvms,
 68                                            int caller_bci);
 69   bool        try_to_inline(ciMethod* callee_method,
 70                             ciMethod* caller_method,
 71                             int caller_bci,
 72                             JVMState* jvms,
 73                             ciCallProfile& profile,
 74                             bool& should_delay);
 75   bool        should_inline(ciMethod* callee_method,
 76                             ciMethod* caller_method,
 77                             int caller_bci,
 78                             ciCallProfile& profile);
 79   bool        should_not_inline(ciMethod* callee_method,
 80                                 ciMethod* caller_method,
 81                                 JVMState* jvms);
 82   bool        is_not_reached(ciMethod* callee_method,
 83                              ciMethod* caller_method,
 84                              int caller_bci,
 85                              ciCallProfile& profile);
 86   void        print_inlining(ciMethod* callee_method, int caller_bci,
 87                              ciMethod* caller_method, bool success) const;
 88 
 89   InlineTree* caller_tree()       const { return _caller_tree;  }
 90   InlineTree* callee_at(int bci, ciMethod* m) const;
 91   int         inline_level()      const { return stack_depth(); }
 92   int         stack_depth()       const { return _caller_jvms ? _caller_jvms->depth() : 0; }
 93   const char* msg()               const { return _msg; }
 94   void        set_msg(const char* msg)  { _msg = msg; }
 95 public:
 96   static const char* check_can_parse(ciMethod* callee);
 97 
 98   static InlineTree* build_inline_tree_root();
 99   static InlineTree* find_subtree_from_root(InlineTree* root, JVMState* jvms, ciMethod* callee);
100 
101   // See if it is OK to inline.
102   // The receiver is the inline tree for the caller.
103   //
104   // The result is a temperature indication.  If it is hot or cold,
105   // inlining is immediate or undesirable.  Otherwise, the info block
106   // returned is newly allocated and may be enqueued.
107   //
108   // If the method is inlinable, a new inline subtree is created on the fly,
109   // and may be accessed by find_subtree_from_root.
110   // The call_method is the dest_method for a special or static invocation.
111   // The call_method is an optimized virtual method candidate otherwise.
112   bool ok_to_inline(ciMethod *call_method, JVMState* caller_jvms, ciCallProfile& profile, bool& should_delay);
113 
114   // Information about inlined method
115   JVMState*   caller_jvms()       const { return _caller_jvms; }
116   ciMethod   *method()            const { return _method; }
117   int         caller_bci()        const { return _caller_jvms ? _caller_jvms->bci() : InvocationEntryBci; }
118   uint        count_inline_bcs()  const { return _count_inline_bcs; }
119 
120 #ifndef PRODUCT
121 private:
122   uint        _count_inlines;     // Count of inlined methods
123 public:
124   // Debug information collected during parse
125   uint        count_inlines()     const { return _count_inlines; };
126 #endif
127   GrowableArray<InlineTree*> subtrees() { return _subtrees; }
128 
129   void print_value_on(outputStream* st) const PRODUCT_RETURN;
130 
131   bool        _forced_inline;     // Inlining was forced by CompilerOracle, ciReplay or annotation
132   bool        forced_inline()     const { return _forced_inline; }
133   // Count number of nodes in this subtree
134   int         count() const;
135   // Dump inlining replay data to the stream.
136   void dump_replay_data(outputStream* out);
137 };
138 
139 
140 //-----------------------------------------------------------------------------
141 //------------------------------Parse------------------------------------------
142 // Parse bytecodes, build a Graph
143 class Parse : public GraphKit {
144  public:
145   // Per-block information needed by the parser:
146   class Block {
147    private:
148     ciTypeFlow::Block* _flow;
149     int                _pred_count;     // how many predecessors in CFG?
150     int                _preds_parsed;   // how many of these have been parsed?
151     uint               _count;          // how many times executed?  Currently only set by _goto's
152     bool               _is_parsed;      // has this block been parsed yet?
153     bool               _is_handler;     // is this block an exception handler?
154     bool               _has_merged_backedge; // does this block have merged backedge?
155     SafePointNode*     _start_map;      // all values flowing into this block
156     MethodLivenessResult _live_locals;  // lazily initialized liveness bitmap
157     bool               _has_predicates; // Were predicates added before parsing of the loop head?
158 
159     int                _num_successors; // Includes only normal control flow.
160     int                _all_successors; // Include exception paths also.
161     Block**            _successors;
162 
163    public:
164 
165     // Set up the block data structure itself.
166     Block(Parse* outer, int rpo);
167 
168     // Set up the block's relations to other blocks.
169     void init_graph(Parse* outer);
170 
171     ciTypeFlow::Block* flow() const        { return _flow; }
172     int pred_count() const                 { return _pred_count; }
173     int preds_parsed() const               { return _preds_parsed; }
174     bool is_parsed() const                 { return _is_parsed; }
175     bool is_handler() const                { return _is_handler; }
176     void set_count( uint x )               { _count = x; }
177     uint count() const                     { return _count; }
178 
179     SafePointNode* start_map() const       { assert(is_merged(),"");   return _start_map; }
180     void set_start_map(SafePointNode* m)   { assert(!is_merged(), ""); _start_map = m; }
181 
182     // True after any predecessor flows control into this block
183     bool is_merged() const                 { return _start_map != NULL; }
184 
185 #ifdef ASSERT
186     // True after backedge predecessor flows control into this block
187     bool has_merged_backedge() const       { return _has_merged_backedge; }
188     void mark_merged_backedge(Block* pred) {
189       assert(is_SEL_head(), "should be loop head");
190       if (pred != NULL && is_SEL_backedge(pred)) {
191         assert(is_parsed(), "block should be parsed before merging backedges");
192         _has_merged_backedge = true;
193       }
194     }
195 #endif
196 
197     // True when all non-exception predecessors have been parsed.
198     bool is_ready() const                  { return preds_parsed() == pred_count(); }
199 
200     bool has_predicates() const            { return _has_predicates; }
201     void set_has_predicates()              { _has_predicates = true; }
202 
203     int num_successors() const             { return _num_successors; }
204     int all_successors() const             { return _all_successors; }
205     Block* successor_at(int i) const {
206       assert((uint)i < (uint)all_successors(), "");
207       return _successors[i];
208     }
209     Block* successor_for_bci(int bci);
210 
211     int start() const                      { return flow()->start(); }
212     int limit() const                      { return flow()->limit(); }
213     int rpo() const                        { return flow()->rpo(); }
214     int start_sp() const                   { return flow()->stack_size(); }
215 
216     bool is_loop_head() const              { return flow()->is_loop_head(); }
217     bool is_SEL_head() const               { return flow()->is_single_entry_loop_head(); }
218     bool is_SEL_backedge(Block* pred) const{ return is_SEL_head() && pred->rpo() >= rpo(); }
219     bool is_invariant_local(uint i) const  {
220       const JVMState* jvms = start_map()->jvms();
221       if (!jvms->is_loc(i) || flow()->outer()->has_irreducible_entry()) return false;
222       return flow()->is_invariant_local(i - jvms->locoff());
223     }
224     bool can_elide_SEL_phi(uint i) const  { assert(is_SEL_head(),""); return is_invariant_local(i); }
225 
226     const Type* peek(int off=0) const      { return stack_type_at(start_sp() - (off+1)); }
227 
228     const Type* stack_type_at(int i) const;
229     const Type* local_type_at(int i) const;
230     static const Type* get_type(ciType* t) { return Type::get_typeflow_type(t); }
231 
232     bool has_trap_at(int bci) const        { return flow()->has_trap() && flow()->trap_bci() == bci; }
233 
234     // Call this just before parsing a block.
235     void mark_parsed() {
236       assert(!_is_parsed, "must parse each block exactly once");
237       _is_parsed = true;
238     }
239 
240     // Return the phi/region input index for the "current" pred,
241     // and bump the pred number.  For historical reasons these index
242     // numbers are handed out in descending order.  The last index is
243     // always PhiNode::Input (i.e., 1).  The value returned is known
244     // as a "path number" because it distinguishes by which path we are
245     // entering the block.
246     int next_path_num() {
247       assert(preds_parsed() < pred_count(), "too many preds?");
248       return pred_count() - _preds_parsed++;
249     }
250 
251     // Add a previously unaccounted predecessor to this block.
252     // This operates by increasing the size of the block's region
253     // and all its phi nodes (if any).  The value returned is a
254     // path number ("pnum").
255     int add_new_path();
256 
257     // Initialize me by recording the parser's map.  My own map must be NULL.
258     void record_state(Parse* outer);
259   };
260 
261 #ifndef PRODUCT
262   // BytecodeParseHistogram collects number of bytecodes parsed, nodes constructed, and transformations.
263   class BytecodeParseHistogram : public ResourceObj {
264    private:
265     enum BPHType {
266       BPH_transforms,
267       BPH_values
268     };
269     static bool _initialized;
270     static uint _bytecodes_parsed [Bytecodes::number_of_codes];
271     static uint _nodes_constructed[Bytecodes::number_of_codes];
272     static uint _nodes_transformed[Bytecodes::number_of_codes];
273     static uint _new_values       [Bytecodes::number_of_codes];
274 
275     Bytecodes::Code _initial_bytecode;
276     int             _initial_node_count;
277     int             _initial_transforms;
278     int             _initial_values;
279 
280     Parse     *_parser;
281     Compile   *_compiler;
282 
283     // Initialization
284     static void reset();
285 
286     // Return info being collected, select with global flag 'BytecodeParseInfo'
287     int current_count(BPHType info_selector);
288 
289    public:
290     BytecodeParseHistogram(Parse *p, Compile *c);
291     static bool initialized();
292 
293     // Record info when starting to parse one bytecode
294     void set_initial_state( Bytecodes::Code bc );
295     // Record results of parsing one bytecode
296     void record_change();
297 
298     // Profile printing
299     static void print(float cutoff = 0.01F); // cutoff in percent
300   };
301 
302   public:
303     // Record work done during parsing
304     BytecodeParseHistogram* _parse_histogram;
305     void set_parse_histogram(BytecodeParseHistogram *bph) { _parse_histogram = bph; }
306     BytecodeParseHistogram* parse_histogram()      { return _parse_histogram; }
307 #endif
308 
309  private:
310   friend class Block;
311 
312   // Variables which characterize this compilation as a whole:
313 
314   JVMState*     _caller;        // JVMS which carries incoming args & state.
315   float         _expected_uses; // expected number of calls to this code
316   float         _prof_factor;   // discount applied to my profile counts
317   int           _depth;         // Inline tree depth, for debug printouts
318   const TypeFunc*_tf;           // My kind of function type
319   int           _entry_bci;     // the osr bci or InvocationEntryBci
320 
321   ciTypeFlow*   _flow;          // Results of previous flow pass.
322   Block*        _blocks;        // Array of basic-block structs.
323   int           _block_count;   // Number of elements in _blocks.
324 
325   GraphKit      _exits;         // Record all normal returns and throws here.
326   bool          _wrote_final;   // Did we write a final field?
327   bool          _wrote_volatile;     // Did we write a volatile field?
328   bool          _wrote_stable;       // Did we write a @Stable field?
329   bool          _wrote_fields;       // Did we write any field?
330   Node*         _alloc_with_final;   // An allocation node with final field
331 
332   // Variables which track Java semantics during bytecode parsing:
333 
334   Block*            _block;     // block currently getting parsed
335   ciBytecodeStream  _iter;      // stream of this method's bytecodes
336 
337   const FastLockNode* _synch_lock; // FastLockNode for synchronized method
338 
339 #ifndef PRODUCT
340   int _max_switch_depth;        // Debugging SwitchRanges.
341   int _est_switch_depth;        // Debugging SwitchRanges.
342 #endif
343 
344   bool         _first_return;                  // true if return is the first to be parsed
345   bool         _replaced_nodes_for_exceptions; // needs processing of replaced nodes in exception paths?
346   uint         _new_idx;                       // any node with _idx above were new during this parsing. Used to trim the replaced nodes list.
347 
348  public:
349   // Constructor
350   Parse(JVMState* caller, ciMethod* parse_method, float expected_uses);
351 
352   virtual Parse* is_Parse() const { return (Parse*)this; }
353 
354   // Accessors.
355   JVMState*     caller()        const { return _caller; }
356   float         expected_uses() const { return _expected_uses; }
357   float         prof_factor()   const { return _prof_factor; }
358   int           depth()         const { return _depth; }
359   const TypeFunc* tf()          const { return _tf; }
360   //            entry_bci()     -- see osr_bci, etc.
361 
362   ciTypeFlow*   flow()          const { return _flow; }
363   //            blocks()        -- see rpo_at, start_block, etc.
364   int           block_count()   const { return _block_count; }
365 
366   GraphKit&     exits()               { return _exits; }
367   bool          wrote_final() const   { return _wrote_final; }
368   void      set_wrote_final(bool z)   { _wrote_final = z; }
369   bool          wrote_volatile() const { return _wrote_volatile; }
370   void      set_wrote_volatile(bool z) { _wrote_volatile = z; }
371   bool          wrote_stable() const  { return _wrote_stable; }
372   void      set_wrote_stable(bool z)  { _wrote_stable = z; }
373   bool         wrote_fields() const   { return _wrote_fields; }
374   void     set_wrote_fields(bool z)   { _wrote_fields = z; }
375   Node*    alloc_with_final() const   { return _alloc_with_final; }
376   void set_alloc_with_final(Node* n)  {
377     assert((_alloc_with_final == NULL) || (_alloc_with_final == n), "different init objects?");
378     _alloc_with_final = n;
379   }
380 
381   Block*             block()    const { return _block; }
382   ciBytecodeStream&  iter()           { return _iter; }
383   Bytecodes::Code    bc()       const { return _iter.cur_bc(); }
384 
385   void set_block(Block* b)            { _block = b; }
386 
387   // Derived accessors:
388   bool is_normal_parse() const  { return _entry_bci == InvocationEntryBci; }
389   bool is_osr_parse() const     { return _entry_bci != InvocationEntryBci; }
390   int osr_bci() const           { assert(is_osr_parse(),""); return _entry_bci; }
391 
392   void set_parse_bci(int bci);
393 
394   // Must this parse be aborted?
395   bool failing()                { return C->failing(); }
396 
397   Block* rpo_at(int rpo) {
398     assert(0 <= rpo && rpo < _block_count, "oob");
399     return &_blocks[rpo];
400   }
401   Block* start_block() {
402     return rpo_at(flow()->start_block()->rpo());
403   }
404   // Can return NULL if the flow pass did not complete a block.
405   Block* successor_for_bci(int bci) {
406     return block()->successor_for_bci(bci);
407   }
408 
409  private:
410   // Create a JVMS & map for the initial state of this method.
411   SafePointNode* create_entry_map();
412 
413   // OSR helpers
414   Node *fetch_interpreter_state(int index, BasicType bt, Node *local_addrs, Node *local_addrs_base);
415   Node* check_interpreter_type(Node* l, const Type* type, SafePointNode* &bad_type_exit);
416   void  load_interpreter_state(Node* osr_buf);
417 
418   // Functions for managing basic blocks:
419   void init_blocks();
420   void load_state_from(Block* b);
421   void store_state_to(Block* b) { b->record_state(this); }
422 
423   // Parse all the basic blocks.
424   void do_all_blocks();
425 
426   // Parse the current basic block
427   void do_one_block();
428 
429   // Raise an error if we get a bad ciTypeFlow CFG.
430   void handle_missing_successor(int bci);
431 
432   // first actions (before BCI 0)
433   void do_method_entry();
434 
435   // implementation of monitorenter/monitorexit
436   void do_monitor_enter();
437   void do_monitor_exit();
438 
439   // Eagerly create phie throughout the state, to cope with back edges.
440   void ensure_phis_everywhere();
441 
442   // Merge the current mapping into the basic block starting at bci
443   void merge(          int target_bci);
444   // Same as plain merge, except that it allocates a new path number.
445   void merge_new_path( int target_bci);
446   // Merge the current mapping into an exception handler.
447   void merge_exception(int target_bci);
448   // Helper: Merge the current mapping into the given basic block
449   void merge_common(Block* target, int pnum);
450   // Helper functions for merging individual cells.
451   PhiNode *ensure_phi(       int idx, bool nocreate = false);
452   PhiNode *ensure_memory_phi(int idx, bool nocreate = false);
453   // Helper to merge the current memory state into the given basic block
454   void merge_memory_edges(MergeMemNode* n, int pnum, bool nophi);
455 
456   // Parse this bytecode, and alter the Parsers JVM->Node mapping
457   void do_one_bytecode();
458 
459   // helper function to generate array store check
460   void array_store_check();
461   // Helper function to generate array load
462   void array_load(BasicType etype);
463   // Helper function to generate array store
464   void array_store(BasicType etype);
465   // Helper function to compute array addressing
466   Node* array_addressing(BasicType type, int vals, const Type*& elemtype);

467 
468   void clinit_deopt();
469 
470   void rtm_deopt();
471 
472   // Pass current map to exits
473   void return_current(Node* value);
474 
475   // Register finalizers on return from Object.<init>
476   void call_register_finalizer();
477 
478   // Insert a compiler safepoint into the graph
479   void add_safepoint();
480 
481   // Insert a compiler safepoint into the graph, if there is a back-branch.
482   void maybe_add_safepoint(int target_bci) {
483     if (target_bci <= bci()) {
484       add_safepoint();
485     }
486   }
487 
488   // Note:  Intrinsic generation routines may be found in library_call.cpp.
489 
490   // Helper function to setup Ideal Call nodes
491   void do_call();
492 
493   // Helper function to uncommon-trap or bailout for non-compilable call-sites
494   bool can_not_compile_call_site(ciMethod *dest_method, ciInstanceKlass *klass);
495 
496   // Helper functions for type checking bytecodes:
497   void  do_checkcast();
498   void  do_instanceof();
499 
500   // Helper functions for shifting & arithmetic
501   void modf();
502   void modd();
503   void l2f();
504 
505   // implementation of _get* and _put* bytecodes
506   void do_getstatic() { do_field_access(true,  false); }
507   void do_getfield () { do_field_access(true,  true); }
508   void do_putstatic() { do_field_access(false, false); }
509   void do_putfield () { do_field_access(false, true); }
510 
511   // common code for making initial checks and forming addresses
512   void do_field_access(bool is_get, bool is_field);
513 
514   // common code for actually performing the load or store
515   void do_get_xxx(Node* obj, ciField* field, bool is_field);
516   void do_put_xxx(Node* obj, ciField* field, bool is_field);
517 
518   // implementation of object creation bytecodes
519   void do_new();


520   void do_newarray(BasicType elemtype);
521   void do_anewarray();
522   void do_multianewarray();
523   Node* expand_multianewarray(ciArrayKlass* array_klass, Node* *lengths, int ndimensions, int nargs);
524 
525   // implementation of jsr/ret
526   void do_jsr();
527   void do_ret();
528 
529   float   dynamic_branch_prediction(float &cnt, BoolTest::mask btest, Node* test);
530   float   branch_prediction(float &cnt, BoolTest::mask btest, int target_bci, Node* test);
531   bool    seems_never_taken(float prob) const;
532   bool    path_is_suitable_for_uncommon_trap(float prob) const;
533   bool    seems_stable_comparison() const;
534 
535   void    do_ifnull(BoolTest::mask btest, Node* c);
536   void    do_if(BoolTest::mask btest, Node* c);





537   int     repush_if_args();
538   void    adjust_map_after_if(BoolTest::mask btest, Node* c, float prob,
539                               Block* path, Block* other_path);
540   void    sharpen_type_after_if(BoolTest::mask btest,
541                                 Node* con, const Type* tcon,
542                                 Node* val, const Type* tval);
543   void    maybe_add_predicate_after_if(Block* path);
544   IfNode* jump_if_fork_int(Node* a, Node* b, BoolTest::mask mask, float prob, float cnt);
545   void    jump_if_true_fork(IfNode *ifNode, int dest_bci_if_true, bool unc);
546   void    jump_if_false_fork(IfNode *ifNode, int dest_bci_if_false, bool unc);
547   void    jump_if_always_fork(int dest_bci_if_true, bool unc);
548 
549   friend class SwitchRange;
550   void    do_tableswitch();
551   void    do_lookupswitch();
552   void    jump_switch_ranges(Node* a, SwitchRange* lo, SwitchRange* hi, int depth = 0);
553   bool    create_jump_tables(Node* a, SwitchRange* lo, SwitchRange* hi);
554   void    linear_search_switch_ranges(Node* key_val, SwitchRange*& lo, SwitchRange*& hi);
555 
556   void decrement_age();
557 
558   // helper function for call statistics
559   void count_compiled_calls(bool at_method_entry, bool is_inline) PRODUCT_RETURN;
560 
561   Node_Notes* make_node_notes(Node_Notes* caller_nn);
562 
563   // Helper functions for handling normal and abnormal exits.
564   void build_exits();
565 
566   // Fix up all exceptional control flow exiting a single bytecode.
567   void do_exceptions();
568 
569   // Fix up all exiting control flow at the end of the parse.
570   void do_exits();
571 
572   // Add Catch/CatchProjs
573   // The call is either a Java call or the VM's rethrow stub
574   void catch_call_exceptions(ciExceptionHandlerStream&);
575 
576   // Handle all exceptions thrown by the inlined method.
577   // Also handles exceptions for individual bytecodes.
578   void catch_inline_exceptions(SafePointNode* ex_map);
579 
580   // Merge the given map into correct exceptional exit state.
581   // Assumes that there is no applicable local handler.
582   void throw_to_exit(SafePointNode* ex_map);
583 
584   // Use speculative type to optimize CmpP node
585   Node* optimize_cmp_with_klass(Node* c);
586 
587  public:
588 #ifndef PRODUCT
589   // Handle PrintOpto, etc.
590   void show_parse_info();
591   void dump_map_adr_mem() const;
592   static void print_statistics(); // Print some performance counters
593   void dump();
594   void dump_bci(int bci);
595 #endif
596 };
597 
598 #endif // SHARE_OPTO_PARSE_HPP
--- EOF ---