54   vec<struct pol_item> pol;  member
113   int right = addr.pol.length () - 1;  in chkp_pol_find()
120       if (addr.pol[n].var == var  in chkp_pol_find()
121 	  || (var && addr.pol[n].var  in chkp_pol_find()
123 	      && TREE_CODE (addr.pol[n].var) == ADDR_EXPR  in chkp_pol_find()
124 	      && TREE_OPERAND (var, 0) == TREE_OPERAND (addr.pol[n].var, 0)))  in chkp_pol_find()
126       else if (addr.pol[n].var > var)  in chkp_pol_find()
159       addr.pol.safe_push (item);  in chkp_add_addr_item()
160       addr.pol.qsort (&chkp_pol_item_compare);  in chkp_add_addr_item()
164       addr.pol[n].cst = fold_build2 (PLUS_EXPR, TREE_TYPE (addr.pol[n].cst),  in chkp_add_addr_item()
165 				     addr.pol[n].cst, cst);  in chkp_add_addr_item()
166       if (TREE_CODE (addr.pol[n].cst) == INTEGER_CST  in chkp_add_addr_item()
167 	  && integer_zerop (addr.pol[n].cst))  in chkp_add_addr_item()
168 	addr.pol.ordered_remove (n);  in chkp_add_addr_item()
187       addr.pol.safe_push (item);  in chkp_sub_addr_item()
188       addr.pol.qsort (&chkp_pol_item_compare);  in chkp_sub_addr_item()
192       addr.pol[n].cst = fold_build2 (MINUS_EXPR, TREE_TYPE (addr.pol[n].cst),  in chkp_sub_addr_item()
193 				     addr.pol[n].cst, cst);  in chkp_sub_addr_item()
194       if (TREE_CODE (addr.pol[n].cst) == INTEGER_CST  in chkp_sub_addr_item()
195 	  && integer_zerop (addr.pol[n].cst))  in chkp_sub_addr_item()
196 	addr.pol.ordered_remove (n);  in chkp_sub_addr_item()
205   for (i = 0; i < delta.pol.length (); i++)  in chkp_add_addr_addr()
206     chkp_add_addr_item (addr, delta.pol[i].cst, delta.pol[i].var);  in chkp_add_addr_addr()
214   for (i = 0; i < delta.pol.length (); i++)  in chkp_sub_addr_addr()
215     chkp_sub_addr_item (addr, delta.pol[i].cst, delta.pol[i].var);  in chkp_sub_addr_addr()
223   for (i = 0; i < addr.pol.length (); i++)  in chkp_mult_addr()
224     addr.pol[i].cst = fold_build2 (MULT_EXPR, TREE_TYPE (addr.pol[i].cst),  in chkp_mult_addr()
225 				   addr.pol[i].cst, mult);  in chkp_mult_addr()
236   if (addr.pol.length () == 0)  in chkp_is_constant_addr()
238   else if (addr.pol.length () > 1)  in chkp_is_constant_addr()
240   else if (addr.pol[0].var)  in chkp_is_constant_addr()
242   else if (TREE_CODE (addr.pol[0].cst) != INTEGER_CST)  in chkp_is_constant_addr()
244   else if (integer_zerop (addr.pol[0].cst))  in chkp_is_constant_addr()
246   else if (tree_int_cst_sign_bit (addr.pol[0].cst))  in chkp_is_constant_addr()
259   for (n = 0; n < addr.pol.length (); n++)  in chkp_print_addr()
264       if (addr.pol[n].var == NULL_TREE)  in chkp_print_addr()
265 	print_generic_expr (dump_file, addr.pol[n].cst);  in chkp_print_addr()
268 	  if (TREE_CODE (addr.pol[n].cst) != INTEGER_CST  in chkp_print_addr()
269 	      || !integer_onep (addr.pol[n].cst))  in chkp_print_addr()
271 	      print_generic_expr (dump_file, addr.pol[n].cst);  in chkp_print_addr()
274 	  print_generic_expr (dump_file, addr.pol[n].var);  in chkp_print_addr()
295       addr.pol.create (0);  in chkp_collect_addr_value()
298       addr.pol.release ();  in chkp_collect_addr_value()
303       addr.pol.create (0);  in chkp_collect_addr_value()
307       addr.pol.release ();  in chkp_collect_addr_value()
315 	addr.pol.create (0);  in chkp_collect_addr_value()
318 	addr.pol.release ();  in chkp_collect_addr_value()
321 	    addr.pol.create (0);  in chkp_collect_addr_value()
327 	    addr.pol.release ();  in chkp_collect_addr_value()
391       addr.pol.create (0);  in chkp_collect_value()
394       addr.pol.release ();  in chkp_collect_value()
399       addr.pol.create (0);  in chkp_collect_value()
402       addr.pol.release ();  in chkp_collect_value()
433   ci->addr.pol.create (0);  in chkp_fill_check_info()
454 	    if (check_infos[n].checks[m].addr.pol.exists ())  in chkp_release_check_info()
455 	      check_infos[n].checks[m].addr.pol.release ();  in chkp_release_check_info()
567       bound_val.pol.create (0);  in chkp_get_check_result()
572 	  size_val.pol.create (0);  in chkp_get_check_result()
575 	  size_val.pol.release ();  in chkp_get_check_result()
611       bound_val.pol.create (0);  in chkp_get_check_result()
635 	  size_val.pol.create (0);  in chkp_get_check_result()
638 	  size_val.pol.release ();  in chkp_get_check_result()
682   bound_val.pol.release ();  in chkp_get_check_result()
1037 	      size_val.pol.create (0);  in chkp_optimize_string_function_calls()
1040 	      size_val.pol.release ();  in chkp_optimize_string_function_calls()