Commit d2a3cc6c authored by Peter Bruin's avatar Peter Bruin

remove obsolete make targets

parent afd85dde
......@@ -43,45 +43,15 @@ ramified_primes.gp: form.gp
embedding_forms.gp: form.gp
$(call gp_eval_args,"embedding_forms(modular_symbols_group(readvec(\"$<\")[1]),7)",@pkgdatadir@/init.gp,$@)
info.txt: relative_equation.gp scalar_mul_absolute.gp
$(call gp_eval,"info()",$@)
summary.txt: reduced_dual_pair.gp
$(call gp_eval_raw,"summary();",@pkgdatadir@/functions.gp,$@)
projective_field.gp: projective_polynomial_reduced.gp | ramified_primes.gp
$(call gp_eval,"nfinit([readvec(\"$<\")[1],read(\"ramified_primes.gp\")])",$@)
relative_field.gp: projective_field.gp relative_polynomial_reduced.gp
$(call gp_eval,"g=readvec(\"relative_polynomial_reduced.gp\")[1];K=read(\"projective_field.gp\");rnfinit(K,g)",$@)
relative_equation.gp: projective_field.gp relative_polynomial_reduced.gp
$(call gp_eval,"relative_equation()",$@)
absolute_field.gp: relative_field.gp
$(call gp_eval,"nfinit(read(\"$<\"))",$@)
projective_polynomial_reduced.gp: projective_polynomial.gp
$(call gp_eval_vec,"polredbest(read(\"$<\"),1)",$@)
subgroups.gp: form.gp
$(call gp_eval_vec,"subgroup_chain(znstar(characteristic(readvec(\"$<\")[2])))",$@)
polynomial.gp: | polynomials
$(call gp_eval,"reconstruct_polynomial()",$@)
polynomials.gp: | polynomials
$(call gp_eval_vec,"reconstruct_polynomials()",$@)
projective_polynomial.gp: | projective_polynomials
$(call gp_eval,"reconstruct_projective_polynomial()",$@)
relative_polynomial.gp: | relative_polynomials
$(call gp_eval,"reconstruct_relative_polynomial()",$@)
absolute_polynomial_reduced.gp: relative_equation.gp
$(call gp_eval_vec,"polredbest(read(\"$<\")[1],1)",$@)
intermediate_polynomials_0.gp: | subgroups.gp suitable_primes.gp intermediate_polynomials_0
$(call gp_eval_vec,"reconstruct_intermediate_polynomials(0)",$@)
......@@ -138,37 +108,6 @@ origins.gp: | suitable_primes.gp
reduced_bases.gp: origins.gp | intermediate_fields
$(call gp_eval_vec,"reduced_bases()",$@)
addition.gp: polynomial.gp | suitable_primes_poly.gp
$(MAKE) $(patsubst %,addition_%.gp,$(shell cat suitable_primes_poly.gp))
$(call gp_eval,"reconstruct_addition()",$@)
scalar_mul.gp: polynomial.gp | suitable_primes_poly.gp
$(MAKE) $(patsubst %,scalar_mul_%.gp,$(shell cat suitable_primes_poly.gp))
$(call gp_eval,"reconstruct_scalar_mul()",$@)
polynomial_star.gp: polynomial.gp origin.gp
$(call gp_eval,"read(\"polynomial.gp\")/(x-read(\"origin.gp\"))",$@)
projectivisation.gp: polynomial_star.gp projective_polynomial.gp | suitable_primes_poly.gp
$(MAKE) $(patsubst %,projectivisation_%.gp,$(shell cat suitable_primes_poly.gp))
$(call gp_eval,"reconstruct_projectivisation()",$@)
projectivisation_to_reduced.gp: projectivisation.gp projective_polynomial_reduced.gp
$(call gp_eval,"projectivisation_to_reduced()",$@)
relative_polynomial_reduced.gp: projective_field.gp relative_polynomial.gp
$(call gp_eval_vec,"relative_polynomial_reduced()",$@)
scalar_mul_rel.gp: relative_polynomial.gp | suitable_primes_strict.gp
$(MAKE) $(patsubst %,scalar_mul_rel_%.gp,$(shell cat suitable_primes_strict.gp))
$(call gp_eval,"reconstruct_scalar_mul_rel()",$@)
scalar_mul_rel_reduced.gp: scalar_mul_rel.gp relative_polynomial_reduced.gp
$(call gp_eval,"scalar_mul_rel_reduced()",$@)
scalar_mul_absolute.gp: scalar_mul_rel_reduced.gp relative_equation.gp
$(call gp_eval,"scalar_mul_absolute()",$@)
pairing.gp: | pairings
$(call gp_eval,"reconstruct_pairing()",$@)
......@@ -181,7 +120,7 @@ reduced_pairing.gp: | reduced_pairings
reduced_dual_pair.gp: reduced_pairing.gp
$(call gp_eval_vec,"reduced_dual_pair()",$@)
.PHONY: values polynomials projective_polynomials relative_polynomials \
.PHONY: values polynomials \
intermediate_polynomials_0 intermediate_polynomials_1 intermediate_polynomials_2 \
intermediate_polynomials_3 intermediate_polynomials_4 pairings reduced_pairings
......@@ -192,12 +131,6 @@ values: primes.gp | embedding_forms.gp
polynomials: suitable_primes.gp
$(MAKE) $(patsubst %,poly_%.gp,$(shell cat suitable_primes.gp))
projective_polynomials: suitable_primes.gp
$(MAKE) $(patsubst %,ppoly_%.gp,$(shell cat suitable_primes.gp))
relative_polynomials: suitable_primes_rpoly.gp
$(MAKE) $(patsubst %,rpoly_%.gp,$(shell cat suitable_primes_rpoly.gp))
intermediate_polynomials_0: | suitable_primes.gp
$(MAKE) $(patsubst %,ipoly_0_%.gp,$(shell cat suitable_primes.gp))
......@@ -222,12 +155,6 @@ reduced_pairings: suitable_primes_pairing.gp
poly_%.gp: values_%.gp
$(call gp_eval_vec,"polynomials($*)",$@)
ppoly_%.gp: values_%.gp
$(call gp_eval,"projective_polynomial($*)",$@)
rpoly_%.gp: values_%.gp projective_polynomial_reduced.gp
$(call gp_eval,"relative_polynomial($*)",$@)
ipoly_0_%.gp: values_%.gp
$(call gp_eval_vec,"intermediate_polynomials(0,$*)",$@)
......@@ -243,21 +170,6 @@ ipoly_3_%.gp: values_%.gp intermediate_polynomials_reduced_2.gp
ipoly_4_%.gp: values_%.gp intermediate_polynomials_reduced_3.gp
$(call gp_eval_vec,"intermediate_polynomials(4,$*)",$@)
addition_%.gp: values_%.gp
$(call gp_eval,"addition($*)",$@)
scalar_generator.gp: form.gp
$(call gp_eval,"liftint(znprimroot(characteristic(readvec(\"$<\")[2])))",$@)
scalar_mul_%.gp: values_%.gp scalar_generator.gp
$(call gp_eval,"scalar_multiplication($*,read(\"scalar_generator.gp\"))",$@)
projectivisation_%.gp: values_%.gp
$(call gp_eval,"projectivisation($*)",$@)
scalar_mul_rel_%.gp: values_%.gp scalar_generator.gp
$(call gp_eval,"scalar_multiplication_relative($*,read(\"scalar_generator.gp\"))",$@)
pairing_%.gp: values_%.gp
$(call gp_eval,"pairing($*)",$@)
......@@ -277,18 +189,6 @@ suitable_primes.gp: primes.gp | values
$(call gp_eval_vec,"suitable_primes()",$@)
if [ ! -s $@ ]; then echo "no suitable primes" > /dev/stderr; false; fi
suitable_primes_poly.gp: suitable_primes.gp | polynomials
$(call gp_eval_vec,"suitable_primes_poly()",$@)
if [ ! -s $@ ]; then echo "map appears to be non-injective" > /dev/stderr; false; fi
suitable_primes_ppoly.gp: suitable_primes.gp | projective_polynomials
$(call gp_eval_vec,"suitable_primes_ppoly()",$@)
if [ ! -s $@ ]; then echo "projective map appears to be non-injective" > /dev/stderr; false; fi
suitable_primes_rpoly.gp: suitable_primes_ppoly.gp projective_polynomial_reduced.gp
$(call gp_eval_vec,"suitable_primes_rpoly()",$@)
if [ ! -s $@ ]; then echo "map appears to be non-injective" > /dev/stderr; false; fi
suitable_primes_ipoly_0.gp: suitable_primes.gp | intermediate_polynomials_0
$(call gp_eval_vec,"suitable_primes_ipoly(0)",$@)
if [ ! -s $@ ]; then echo "intermediate map 0 appears to be non-injective" > /dev/stderr; false; fi
......@@ -313,10 +213,6 @@ suitable_primes_ipoly_red_%.gp: suitable_primes_ipoly_%.gp intermediate_polynomi
$(call gp_eval_vec,"suitable_primes_ipoly_red($*)",$@)
if [ ! -s $@ ]; then echo "no suitable primes for reduced intermediate polynomial" > /dev/stderr; false; fi
suitable_primes_strict.gp: suitable_primes_poly.gp suitable_primes_rpoly.gp
$(call gp_eval_vec,"setintersect(readvec(\"suitable_primes_poly.gp\"),readvec(\"suitable_primes_rpoly.gp\"))",$@)
if [ ! -s $@ ]; then echo "no suitable primes for scalar multiplication" > /dev/stderr; false; fi
suitable_primes_dual.gp: suitable_primes.gp | polynomials
$(call gp_eval_vec,"suitable_primes_dual()",$@)
if [ ! -s $@ ]; then echo "(dual) map appears to be non-injective" > /dev/stderr; false; fi
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment