GCC Middle and Back End API Reference
constraint-manager.h
Go to the documentation of this file.
1/* Tracking equivalence classes and constraints at a point on an execution path.
2 Copyright (C) 2019-2024 Free Software Foundation, Inc.
3 Contributed by David Malcolm <dmalcolm@redhat.com>.
4
5This file is part of GCC.
6
7GCC is free software; you can redistribute it and/or modify it
8under the terms of the GNU General Public License as published by
9the Free Software Foundation; either version 3, or (at your option)
10any later version.
11
12GCC is distributed in the hope that it will be useful, but
13WITHOUT ANY WARRANTY; without even the implied warranty of
14MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15General Public License for more details.
16
17You should have received a copy of the GNU General Public License
18along with GCC; see the file COPYING3. If not see
19<http://www.gnu.org/licenses/>. */
20
21#ifndef GCC_ANALYZER_CONSTRAINT_MANAGER_H
22#define GCC_ANALYZER_CONSTRAINT_MANAGER_H
23
24namespace ana {
25
26class constraint_manager;
27
33
34/* One of the end-points of a range. */
35
36struct bound
37{
39 bound (tree constant, bool closed)
40 : m_constant (constant), m_closed (closed) {}
41
43
44 const char * get_relation_as_str () const;
45
48};
49
50/* A range of values, used for determining if a value has been
51 constrained to just one possible constant value. */
52
53class range
54{
55public:
57 range (const bound &lower, const bound &upper)
58 : m_lower_bound (lower), m_upper_bound (upper) {}
59
60 void dump_to_pp (pretty_printer *pp) const;
61 void dump () const;
62
64
66 tree rhs_const) const;
67 bool below_lower_bound (tree rhs_const) const;
68 bool above_upper_bound (tree rhs_const) const;
69
71 bool add_bound (enum tree_code op, tree rhs_const);
72
73private:
76};
77
78/* A closed range of values with constant integer bounds
79 e.g. [3, 5] for the set {3, 4, 5}. */
80
82{
84
85 void dump_to_pp (pretty_printer *pp, bool show_types) const;
86 void dump (bool show_types) const;
87
89
90 std::unique_ptr<text_art::widget>
91 make_dump_widget (const text_art::dump_widget_info &dwi) const;
92
93 bool contains_p (tree cst) const;
94
95 bool intersects_p (const bounded_range &other,
96 bounded_range *out) const;
97
98 bool operator== (const bounded_range &other) const;
99 bool operator!= (const bounded_range &other) const
100 {
101 return !(*this == other);
102 }
103
104 static int cmp (const bounded_range &a, const bounded_range &b);
105
106 bool singleton_p () const
107 {
109 }
110
113
114private:
115 static void set_json_attr (json::object *obj, const char *name, tree value);
116};
117
118/* A collection of bounded_range instances, suitable
119 for representing the ranges on a case label within a switch
120 statement. */
121
123{
124public:
126
129 bounded_ranges (enum tree_code op, tree rhs_const);
130
131 bool operator== (const bounded_ranges &other) const;
132
133 hashval_t get_hash () const { return m_hash; }
134
135 void dump_to_pp (pretty_printer *pp, bool show_types) const;
136 void dump (bool show_types) const;
137
139
140 void add_to_dump_widget (text_art::tree_widget &parent,
141 const text_art::dump_widget_info &dwi) const;
142
144 tree rhs_const,
145 bounded_ranges_manager *mgr) const;
146
147 bool contain_p (tree cst) const;
148 bool empty_p () const { return m_ranges.length () == 0; }
149
150 static int cmp (const bounded_ranges *a, const bounded_ranges *b);
151
152 unsigned get_count () const { return m_ranges.length (); }
153 const bounded_range &get_range (unsigned idx) const { return m_ranges[idx]; }
154
155private:
157 void validate () const;
158
160
162 hashval_t m_hash;
163};
164
165} // namespace ana
166
167template <> struct default_hash_traits<bounded_ranges::key_t>
168: public member_function_hash_traits<bounded_ranges::key_t>
169{
170 static const bool empty_zero_p = true;
171};
172
173namespace ana {
174
175/* An object to own and consolidate bounded_ranges instances.
176 This also caches the mapping from switch_cfg_superedge
177 bounded_ranges instances, so that get_or_create_ranges_for_switch is
178 memoized. */
179
181{
182public:
184
185 const bounded_ranges *
187 const gswitch *switch_stmt);
188
192 const_tree upper_bound);
193 const bounded_ranges *
194 get_or_create_union (const vec <const bounded_ranges *> &others);
195 const bounded_ranges *
197 const bounded_ranges *b);
198 const bounded_ranges *
200
201 void log_stats (logger *logger, bool show_objs) const;
202
203private:
204 const bounded_ranges *
206 const gswitch *switch_stmt);
207
208 const bounded_ranges *
209 make_case_label_ranges (const gswitch *switch_stmt,
210 tree case_label);
211
213
214 struct hash_traits_t : public typed_noop_remove<bounded_ranges *>
215 {
218
219 static inline bool
220 equal (const key_type &k1, const key_type &k2)
221 {
222 return *k1 == *k2;
223 }
224 static inline hashval_t
225 hash (const key_type &k)
226 {
227 return k->get_hash ();
228 }
229 static inline bool is_empty (key_type k) { return k == NULL; }
230 static inline void mark_empty (key_type &k) { k = NULL; }
231 static inline bool is_deleted (key_type k)
232 {
233 return k == reinterpret_cast<key_type> (1);
234 }
235
236 static const bool empty_zero_p = true;
237 };
238 struct traits_t : public simple_hashmap_traits<hash_traits_t,
239 bounded_ranges *>
240 {
241 };
244
245 typedef hash_map<const switch_cfg_superedge *,
248};
249
250/* An equivalence class within a constraint manager: a set of
251 svalues that are known to all be equal to each other,
252 together with an optional tree constant that they are equal to. */
253
255{
256public:
258 equiv_class (const equiv_class &other);
259
260 hashval_t hash () const;
261 bool operator== (const equiv_class &other);
262
263 void add (const svalue *sval);
264 bool del (const svalue *sval);
265
266 tree get_any_constant () const { return m_constant; }
267
268 const svalue *get_representative () const;
269
271
272 void print (pretty_printer *pp) const;
273
275
276 std::unique_ptr<text_art::tree_widget>
277 make_dump_widget (const text_art::dump_widget_info &dwi,
278 unsigned id) const;
279
281
282 /* An equivalence class can contain multiple constants (e.g. multiple
283 different zeroes, for different types); these are just for the last
284 constant added. */
287
288 // TODO: should this be a set rather than a vec?
290};
291
292/* The various kinds of constraint. */
293
300
301const char *constraint_op_code (enum constraint_op c_op);
302
303/* An ID for an equiv_class within a constraint_manager. Internally, this
304 is an index into a vector of equiv_class * within the constraint_manager. */
305
307{
308public:
309 static equiv_class_id null () { return equiv_class_id (-1); }
310
311 equiv_class_id (unsigned idx) : m_idx (idx) {}
312 const equiv_class &get_obj (const constraint_manager &cm) const;
314
315 bool operator== (const equiv_class_id &other) const
316 {
317 return m_idx == other.m_idx;
318 }
319 bool operator!= (const equiv_class_id &other) const
320 {
321 return m_idx != other.m_idx;
322 }
323
324 bool null_p () const { return m_idx == -1; }
325
326 static equiv_class_id from_int (int idx) { return equiv_class_id (idx); }
327 int as_int () const { return m_idx; }
328
329 void print (pretty_printer *pp) const;
330
332 {
333 if (m_idx > other.m_idx)
334 m_idx--;
335 }
336
337 int m_idx;
338};
339
340/* A relationship between two equivalence classes in a constraint_manager. */
341
343{
344 public:
346 : m_lhs (lhs), m_op (c_op), m_rhs (rhs)
347 {
348 gcc_assert (!lhs.null_p ());
349 gcc_assert (!rhs.null_p ());
350 }
351
352 void print (pretty_printer *pp, const constraint_manager &cm) const;
353
355
356 std::unique_ptr<text_art::widget>
357 make_dump_widget (const text_art::dump_widget_info &dwi,
358 const constraint_manager &cm) const;
359
360 hashval_t hash () const;
361 bool operator== (const constraint &other) const;
362
363 /* Is this an ordering, rather than a "!=". */
364 bool is_ordering_p () const
365 {
366 return m_op != CONSTRAINT_NE;
367 }
368
369 bool implied_by (const constraint &other,
370 const constraint_manager &cm) const;
371
375};
376
377/* An abstract base class for use with constraint_manager::for_each_fact. */
378
380{
381 public:
382 virtual ~fact_visitor () {}
383 virtual void on_fact (const svalue *lhs,
384 enum tree_code,
385 const svalue *rhs) = 0;
386 virtual void on_ranges (const svalue *lhs,
387 const bounded_ranges *ranges) = 0;
388};
389
391{
392public:
394 const bounded_ranges *ranges)
395 : m_ec_id (ec_id), m_ranges (ranges)
396 {
397 }
398
399 void print (pretty_printer *pp, const constraint_manager &cm) const;
400
402
403 bool operator== (const bounded_ranges_constraint &other) const;
404 bool operator!= (const bounded_ranges_constraint &other) const
405 {
406 return !(*this == other);
407 }
408
409 void add_to_hash (inchash::hash *hstate) const;
410
411 std::unique_ptr<text_art::tree_widget>
412 make_dump_widget (const text_art::dump_widget_info &dwi) const;
413
416};
417
418/* A collection of equivalence classes and constraints on them.
419
420 Given N svalues, this can be thought of as representing a subset of
421 N-dimensional space. When we call add_constraint,
422 we are effectively taking an intersection with that constraint. */
423
425{
426public:
430
432
433 hashval_t hash () const;
434 bool operator== (const constraint_manager &other) const;
435 bool operator!= (const constraint_manager &other) const
436 {
437 return !(*this == other);
438 }
439
440 void print (pretty_printer *pp) const;
441 void dump_to_pp (pretty_printer *pp, bool multiline) const;
442 void dump (FILE *fp) const;
443 void dump () const;
444
446
447 std::unique_ptr<text_art::tree_widget>
448 make_dump_widget (const text_art::dump_widget_info &dwi) const;
449
450 const equiv_class &get_equiv_class_by_index (unsigned idx) const
451 {
452 return *m_equiv_classes[idx];
453 }
455 {
456 return *m_equiv_classes[idx];
457 }
458
460 {
462 return ec_id.get_obj (*this);
463 }
464
465 bool add_constraint (const svalue *lhs,
466 enum tree_code op,
467 const svalue *rhs);
468
470 enum tree_code op,
471 equiv_class_id rhs_ec_id);
472
474 enum tree_code op,
475 equiv_class_id rhs_ec_id);
476
477 bool add_bounded_ranges (const svalue *sval,
478 const bounded_ranges *ranges);
479
481 equiv_class_id *out) const;
482 bool sval_constrained_p (const svalue *sval) const;
485 enum tree_code op,
486 equiv_class_id rhs) const;
488 enum tree_code op,
489 tree rhs_const) const;
491 enum tree_code op,
492 const svalue *rhs) const;
494
495 /* PurgeCriteria should have:
496 bool should_purge_p (const svalue *sval) const. */
497 template <typename PurgeCriteria>
498 void purge (const PurgeCriteria &p, purge_stats *stats);
499
500 void on_liveness_change (const svalue_set &live_svalues,
501 const region_model *model);
502 void purge_state_involving (const svalue *sval);
503
505
506 static void merge (const constraint_manager &cm_a,
507 const constraint_manager &cm_b,
508 constraint_manager *out);
509
511
512 void validate () const;
513
515
517 const constraint_manager &summary);
518
522
523 private:
525 enum constraint_op c_op,
526 equiv_class_id rhs_id);
528 const svalue *rhs) const;
529
531};
532
533} // namespace ana
534
535#endif /* GCC_ANALYZER_CONSTRAINT_MANAGER_H */
Definition constraint-manager.h:391
bool operator!=(const bounded_ranges_constraint &other) const
Definition constraint-manager.h:404
const bounded_ranges * m_ranges
Definition constraint-manager.h:415
bounded_ranges_constraint(equiv_class_id ec_id, const bounded_ranges *ranges)
Definition constraint-manager.h:393
equiv_class_id m_ec_id
Definition constraint-manager.h:414
std::unique_ptr< text_art::tree_widget > make_dump_widget(const text_art::dump_widget_info &dwi) const
json::object * to_json() const
void add_to_hash(inchash::hash *hstate) const
void print(pretty_printer *pp, const constraint_manager &cm) const
bool operator==(const bounded_ranges_constraint &other) const
Definition constraint-manager.h:181
hash_map< bounded_ranges *, bounded_ranges *, traits_t > map_t
Definition constraint-manager.h:242
const bounded_ranges * get_or_create_inverse(const bounded_ranges *other, tree type)
const bounded_ranges * get_or_create_intersection(const bounded_ranges *a, const bounded_ranges *b)
const bounded_ranges * create_ranges_for_switch(const switch_cfg_superedge &edge, const gswitch *switch_stmt)
map_t m_map
Definition constraint-manager.h:243
const bounded_ranges * get_or_create_empty()
const bounded_ranges * get_or_create_range(const_tree lower_bound, const_tree upper_bound)
const bounded_ranges * get_or_create_union(const vec< const bounded_ranges * > &others)
hash_map< const switch_cfg_superedge *, const bounded_ranges * > edge_cache_t
Definition constraint-manager.h:246
void log_stats(logger *logger, bool show_objs) const
edge_cache_t m_edge_cache
Definition constraint-manager.h:247
const bounded_ranges * get_or_create_point(const_tree value)
const bounded_ranges * consolidate(bounded_ranges *)
const bounded_ranges * get_or_create_ranges_for_switch(const switch_cfg_superedge *edge, const gswitch *switch_stmt)
const bounded_ranges * make_case_label_ranges(const gswitch *switch_stmt, tree case_label)
Definition call-summary.h:68
Definition constraint-manager.h:425
bool add_constraint(const svalue *lhs, enum tree_code op, const svalue *rhs)
bool add_bounded_ranges(const svalue *sval, const bounded_ranges *ranges)
constraint_manager(const constraint_manager &other)
tristate eval_condition(equiv_class_id lhs, enum tree_code op, equiv_class_id rhs) const
region_model_manager * m_mgr
Definition constraint-manager.h:530
void print(pretty_printer *pp) const
bool get_equiv_class_by_svalue(const svalue *sval, equiv_class_id *out) const
range get_ec_bounds(equiv_class_id ec_id) const
void add_unknown_constraint(equiv_class_id lhs_ec_id, enum tree_code op, equiv_class_id rhs_ec_id)
void dump(FILE *fp) const
virtual ~constraint_manager()
Definition constraint-manager.h:429
json::object * to_json() const
void add_constraint_internal(equiv_class_id lhs_id, enum constraint_op c_op, equiv_class_id rhs_id)
constraint_manager(region_model_manager *mgr)
Definition constraint-manager.h:427
constraint_manager & operator=(const constraint_manager &other)
void purge_state_involving(const svalue *sval)
const equiv_class & get_equiv_class_by_index(unsigned idx) const
Definition constraint-manager.h:450
hashval_t hash() const
void for_each_fact(fact_visitor *) const
auto_vec< constraint > m_constraints
Definition constraint-manager.h:520
tristate eval_condition(const svalue *lhs, enum tree_code op, const svalue *rhs) const
void dump_to_pp(pretty_printer *pp, bool multiline) const
equiv_class & get_equiv_class_by_index(unsigned idx)
Definition constraint-manager.h:454
static void merge(const constraint_manager &cm_a, const constraint_manager &cm_b, constraint_manager *out)
auto_vec< bounded_ranges_constraint > m_bounded_ranges_constraints
Definition constraint-manager.h:521
void purge(const PurgeCriteria &p, purge_stats *stats)
bool operator==(const constraint_manager &other) const
equiv_class_id get_or_add_equiv_class(const svalue *sval)
equiv_class & get_equiv_class(const svalue *sval)
Definition constraint-manager.h:459
auto_delete_vec< equiv_class > m_equiv_classes
Definition constraint-manager.h:519
tristate eval_condition(equiv_class_id lhs_ec, enum tree_code op, tree rhs_const) const
bool impossible_derived_conditions_p(const svalue *lhs, const svalue *rhs) const
bool replay_call_summary(call_summary_replay &r, const constraint_manager &summary)
bounded_ranges_manager * get_range_manager() const
bool operator!=(const constraint_manager &other) const
Definition constraint-manager.h:435
bool add_constraint(equiv_class_id lhs_ec_id, enum tree_code op, equiv_class_id rhs_ec_id)
bool sval_constrained_p(const svalue *sval) const
std::unique_ptr< text_art::tree_widget > make_dump_widget(const text_art::dump_widget_info &dwi) const
void on_liveness_change(const svalue_set &live_svalues, const region_model *model)
Definition constraint-manager.h:343
json::object * to_json() const
equiv_class_id m_rhs
Definition constraint-manager.h:374
bool operator==(const constraint &other) const
enum constraint_op m_op
Definition constraint-manager.h:373
equiv_class_id m_lhs
Definition constraint-manager.h:372
bool is_ordering_p() const
Definition constraint-manager.h:364
hashval_t hash() const
std::unique_ptr< text_art::widget > make_dump_widget(const text_art::dump_widget_info &dwi, const constraint_manager &cm) const
constraint(equiv_class_id lhs, enum constraint_op c_op, equiv_class_id rhs)
Definition constraint-manager.h:345
void print(pretty_printer *pp, const constraint_manager &cm) const
bool implied_by(const constraint &other, const constraint_manager &cm) const
Definition constraint-manager.h:307
equiv_class_id(unsigned idx)
Definition constraint-manager.h:311
static equiv_class_id from_int(int idx)
Definition constraint-manager.h:326
bool operator!=(const equiv_class_id &other) const
Definition constraint-manager.h:319
const equiv_class & get_obj(const constraint_manager &cm) const
bool operator==(const equiv_class_id &other) const
Definition constraint-manager.h:315
int as_int() const
Definition constraint-manager.h:327
void print(pretty_printer *pp) const
int m_idx
Definition constraint-manager.h:337
bool null_p() const
Definition constraint-manager.h:324
void update_for_removal(equiv_class_id other)
Definition constraint-manager.h:331
static equiv_class_id null()
Definition constraint-manager.h:309
equiv_class & get_obj(constraint_manager &cm) const
Definition constraint-manager.h:255
json::object * to_json() const
tree m_constant
Definition constraint-manager.h:285
bool contains_non_constant_p() const
const svalue * get_representative() const
const svalue * m_cst_sval
Definition constraint-manager.h:286
auto_vec< const svalue * > m_vars
Definition constraint-manager.h:289
hashval_t hash() const
void add(const svalue *sval)
bool del(const svalue *sval)
tree get_any_constant() const
Definition constraint-manager.h:266
void print(pretty_printer *pp) const
equiv_class(const equiv_class &other)
std::unique_ptr< text_art::tree_widget > make_dump_widget(const text_art::dump_widget_info &dwi, unsigned id) const
bool operator==(const equiv_class &other)
Definition constraint-manager.h:380
virtual void on_ranges(const svalue *lhs, const bounded_ranges *ranges)=0
virtual void on_fact(const svalue *lhs, enum tree_code, const svalue *rhs)=0
virtual ~fact_visitor()
Definition constraint-manager.h:382
Definition analyzer-logging.h:34
Definition constraint-manager.h:54
void dump_to_pp(pretty_printer *pp) const
bound m_lower_bound
Definition constraint-manager.h:74
tree constrained_to_single_element()
bool add_bound(bound b, enum bound_kind bound_kind)
bool add_bound(enum tree_code op, tree rhs_const)
bound m_upper_bound
Definition constraint-manager.h:75
range(const bound &lower, const bound &upper)
Definition constraint-manager.h:57
void dump() const
range()
Definition constraint-manager.h:56
bool below_lower_bound(tree rhs_const) const
bool above_upper_bound(tree rhs_const) const
tristate eval_condition(enum tree_code op, tree rhs_const) const
Definition region-model-manager.h:32
Definition region-model.h:263
Definition svalue.h:92
Definition supergraph.h:557
Definition vec.h:1802
Definition vec.h:1656
Definition hash-map.h:40
Definition inchash.h:38
Definition json.h:95
Definition json.h:79
Definition pretty-print.h:255
Definition tristate.h:26
class edge_def * edge
Definition coretypes.h:343
const union tree_node * const_tree
Definition coretypes.h:98
union tree_node * tree
Definition coretypes.h:97
static void lower(vec< simplify * > &simplifiers, bool gimple)
Definition genmatch.cc:1702
tree_code
Definition genmatch.cc:347
Definition access-diagram.h:30
constraint_op
Definition constraint-manager.h:295
@ CONSTRAINT_NE
Definition constraint-manager.h:296
@ CONSTRAINT_LE
Definition constraint-manager.h:298
@ CONSTRAINT_LT
Definition constraint-manager.h:297
bound_kind
Definition constraint-manager.h:29
@ BK_LOWER
Definition constraint-manager.h:30
@ BK_UPPER
Definition constraint-manager.h:31
const char * constraint_op_code(enum constraint_op c_op)
poly_int< N, C > r
Definition poly-int.h:770
Ca const poly_int< N, Cb > & b
Definition poly-int.h:767
Ca & a
Definition poly-int.h:766
Definition constraint-manager.h:37
bool m_closed
Definition constraint-manager.h:47
bound()
Definition constraint-manager.h:38
tree m_constant
Definition constraint-manager.h:46
bound(tree constant, bool closed)
Definition constraint-manager.h:39
void ensure_closed(enum bound_kind bound_kind)
const char * get_relation_as_str() const
Definition constraint-manager.h:82
void dump_to_pp(pretty_printer *pp, bool show_types) const
static void set_json_attr(json::object *obj, const char *name, tree value)
bool singleton_p() const
Definition constraint-manager.h:106
tree m_upper
Definition constraint-manager.h:112
json::object * to_json() const
bool contains_p(tree cst) const
bool operator==(const bounded_range &other) const
void dump(bool show_types) const
std::unique_ptr< text_art::widget > make_dump_widget(const text_art::dump_widget_info &dwi) const
bounded_range(const_tree lower, const_tree upper)
static int cmp(const bounded_range &a, const bounded_range &b)
tree m_lower
Definition constraint-manager.h:111
bool intersects_p(const bounded_range &other, bounded_range *out) const
bool operator!=(const bounded_range &other) const
Definition constraint-manager.h:99
Definition constraint-manager.h:215
static bool is_empty(key_type k)
Definition constraint-manager.h:229
static hashval_t hash(const key_type &k)
Definition constraint-manager.h:225
static void mark_empty(key_type &k)
Definition constraint-manager.h:230
static bool is_deleted(key_type k)
Definition constraint-manager.h:231
static bool equal(const key_type &k1, const key_type &k2)
Definition constraint-manager.h:220
static const bool empty_zero_p
Definition constraint-manager.h:236
bounded_ranges * key_type
Definition constraint-manager.h:216
bounded_ranges * value_type
Definition constraint-manager.h:217
Definition constraint-manager.h:240
Definition constraint-manager.h:123
void validate() const
json::value * to_json() const
bounded_ranges(enum tree_code op, tree rhs_const)
bounded_ranges key_t
Definition constraint-manager.h:125
bounded_ranges(const bounded_range &range)
static int cmp(const bounded_ranges *a, const bounded_ranges *b)
hashval_t m_hash
Definition constraint-manager.h:162
auto_vec< bounded_range > m_ranges
Definition constraint-manager.h:161
unsigned get_count() const
Definition constraint-manager.h:152
bool contain_p(tree cst) const
bounded_ranges(const vec< bounded_range > &ranges)
void dump(bool show_types) const
tristate eval_condition(enum tree_code op, tree rhs_const, bounded_ranges_manager *mgr) const
hashval_t get_hash() const
Definition constraint-manager.h:133
void add_to_dump_widget(text_art::tree_widget &parent, const text_art::dump_widget_info &dwi) const
void dump_to_pp(pretty_printer *pp, bool show_types) const
bool empty_p() const
Definition constraint-manager.h:148
const bounded_range & get_range(unsigned idx) const
Definition constraint-manager.h:153
bool operator==(const bounded_ranges &other) const
Definition region-model.h:200
Definition exploded-graph.h:512
Definition hash-traits.h:466
Definition gimple.h:895
Definition analyzer.h:508
Definition hash-map-traits.h:33
Definition gengtype.h:252
Definition hash-traits.h:75
Definition vec.h:450
#define NULL
Definition system.h:50
#define gcc_assert(EXPR)
Definition system.h:821
#define false
Definition system.h:895
bool tree_int_cst_equal(const_tree t1, const_tree t2)
Definition tree.cc:6388
#define NULL_TREE
Definition tree.h:317