HomeSort by: relevance | last modified time | path
    Searched defs:vp1 (Results 1 - 3 of 3) sorted by relevancy

  /src/bin/csh/
set.c 451 struct varent *vp1; local
454 if (vp->v_left && (vp1 = madrof(pat, vp->v_left)))
455 return vp1;
  /src/external/gpl3/gcc/dist/gcc/
tree-ssa-sccvn.cc 179 vn_phi_eq (const_vn_phi_t const vp1, const_vn_phi_t const vp2);
190 vn_phi_hasher::hash (const vn_phi_s *vp1)
192 return vp1->hashcode;
198 vn_phi_hasher::equal (const vn_phi_s *vp1, const vn_phi_s *vp2)
200 return vp1 == vp2 || vn_phi_eq (vp1, vp2);
4783 /* Compute a hashcode for PHI operation VP1 and return it. */
4786 vn_phi_compute_hash (vn_phi_t vp1)
4794 hstate.add_int (EDGE_COUNT (vp1->block->preds));
4795 switch (EDGE_COUNT (vp1->block->preds)
4980 struct vn_phi_s *vp1; local
5035 vn_phi_t vp1 = (vn_phi_t) obstack_alloc (&vn_tables_obstack, local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
tree-ssa-sccvn.cc 173 vn_phi_eq (const_vn_phi_t const vp1, const_vn_phi_t const vp2);
184 vn_phi_hasher::hash (const vn_phi_s *vp1)
186 return vp1->hashcode;
192 vn_phi_hasher::equal (const vn_phi_s *vp1, const vn_phi_s *vp2)
194 return vp1 == vp2 || vn_phi_eq (vp1, vp2);
4409 /* Compute a hashcode for PHI operation VP1 and return it. */
4412 vn_phi_compute_hash (vn_phi_t vp1)
4420 hstate.add_int (EDGE_COUNT (vp1->block->preds));
4421 switch (EDGE_COUNT (vp1->block->preds)
4605 struct vn_phi_s *vp1; local
4655 vn_phi_t vp1 = (vn_phi_t) obstack_alloc (&vn_tables_obstack, local
    [all...]

Completed in 32 milliseconds