fix: limit memory for C2xC2 computations

ext/GAPExt/abelian_layer.jl

@@ -59,7 +59,7 @@ function abelian_extensionsQQ(gtype::Vector{Int}, bound::ZZRingElem, only_real::
     end
     return res
   end
-  if gtype == Int[2,2]
+  if gtype == Int[2,2] && bound < ZZ(10)^12 # otherwise the method needs to much memory
     l = Hecke._C22_exts_abexts(Int(bound), only_real, unramified_outside = unramified_outside)
     @vprintln :Fields 1 "Computing maximal orders"
     @vprintln :FieldsNonFancy 1 "Computing maximal orders"

src/FieldFactory/ab_exts.jl

@@ -757,7 +757,6 @@ function _disc(a::Int, b::Int, c::Int, bound::Int)
 end
 
 function _pairs_totally_real(pairs, ls, bound)
-  #b1=floor(Int, Base.sqrt(bound))
   b1 = isqrt(bound)
   # We look for Q(sqrt{a},sqrt{b})
   # Remove all with a = 1
@@ -818,7 +817,6 @@ end
 
 function _find_pairs(bound::Int, only_real::Bool = false; unramified_outside::Vector{ZZRingElem} = ZZRingElem[] )
   #first, we need the squarefree numbers
-  #b1=ceil(Int, Base.sqrt(bound))
   b1 = isqrt(bound)
   ls = squarefree_up_to(b1, prime_base = unramified_outside)
   #The first step is to enumerate all the totally real extensions.