equal
deleted
inserted
replaced
343 void hash_insert(Node *n) { _table.hash_insert(n); } |
343 void hash_insert(Node *n) { _table.hash_insert(n); } |
344 Node *hash_find_insert(Node *n){ return _table.hash_find_insert(n); } |
344 Node *hash_find_insert(Node *n){ return _table.hash_find_insert(n); } |
345 Node *hash_find(const Node *n) { return _table.hash_find(n); } |
345 Node *hash_find(const Node *n) { return _table.hash_find(n); } |
346 |
346 |
347 // Used after parsing to eliminate values that are no longer in program |
347 // Used after parsing to eliminate values that are no longer in program |
348 void remove_useless_nodes(VectorSet &useful) { _table.remove_useless_nodes(useful); } |
348 void remove_useless_nodes(VectorSet &useful) { |
|
349 _table.remove_useless_nodes(useful); |
|
350 // this may invalidate cached cons so reset the cache |
|
351 init_con_caches(); |
|
352 } |
349 |
353 |
350 virtual ConNode* uncached_makecon(const Type* t); // override from PhaseTransform |
354 virtual ConNode* uncached_makecon(const Type* t); // override from PhaseTransform |
351 |
355 |
352 virtual const Type* saturate(const Type* new_type, const Type* old_type, |
356 virtual const Type* saturate(const Type* new_type, const Type* old_type, |
353 const Type* limit_type) const |
357 const Type* limit_type) const |