Home
last modified time | relevance | path

Searched refs:maxeq (Results 1 – 25 of 47) sorted by relevance

12

/dports/science/siesta/siesta-4.1.5/Src/
H A Dm_partial_charges.F305 . ispin, iua, ntimes(na_u), maxeq, neq, ieq
313 parameter (maxeq = 20)
316 integer iatom(maxeq)
335 do ieq = 1, maxeq
366 if (neq .gt. maxeq) stop 'voronoi: increase maxeq'
/dports/lang/gcc10/gcc-10.3.0/gcc/
H A Dvalue-range.cc611 bool maxeq = vrp_operand_equal_p (*vr0max, vr1max); in intersect_ranges() local
614 if (mineq && maxeq) in intersect_ranges()
676 else if ((maxeq || operand_less_p (vr1max, *vr0max) == 1) in intersect_ranges()
707 else if (maxeq) in intersect_ranges()
775 else if (maxeq) in intersect_ranges()
982 bool maxeq = cmpmax == 0; in union_ranges() local
985 if (mineq && maxeq) in union_ranges()
1082 else if ((maxeq || cmpmax == 1) in union_ranges()
1103 else if (!maxeq && TREE_CODE (vr1max) == INTEGER_CST) in union_ranges()
1116 else if ((maxeq || cmpmax == -1) in union_ranges()
[all …]
/dports/devel/avr-gcc/gcc-10.2.0/gcc/
H A Dvalue-range.cc628 bool maxeq = vrp_operand_equal_p (*vr0max, vr1max); in intersect_ranges() local
631 if (mineq && maxeq) in intersect_ranges()
693 else if ((maxeq || operand_less_p (vr1max, *vr0max) == 1) in intersect_ranges()
724 else if (maxeq) in intersect_ranges()
792 else if (maxeq) in intersect_ranges()
997 bool maxeq = cmpmax == 0; in union_ranges() local
1000 if (mineq && maxeq) in union_ranges()
1097 else if ((maxeq || cmpmax == 1) in union_ranges()
1118 else if (!maxeq && TREE_CODE (vr1max) == INTEGER_CST) in union_ranges()
1131 else if ((maxeq || cmpmax == -1) in union_ranges()
[all …]
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/
H A Dvalue-range.cc611 bool maxeq = vrp_operand_equal_p (*vr0max, vr1max); in intersect_ranges() local
614 if (mineq && maxeq) in intersect_ranges()
676 else if ((maxeq || operand_less_p (vr1max, *vr0max) == 1) in intersect_ranges()
707 else if (maxeq) in intersect_ranges()
775 else if (maxeq) in intersect_ranges()
982 bool maxeq = cmpmax == 0; in union_ranges() local
985 if (mineq && maxeq) in union_ranges()
1082 else if ((maxeq || cmpmax == 1) in union_ranges()
1103 else if (!maxeq && TREE_CODE (vr1max) == INTEGER_CST) in union_ranges()
1116 else if ((maxeq || cmpmax == -1) in union_ranges()
[all …]
/dports/science/tinker/tinker/source/
H A Dfaces.f37 integer maxeq,maxfs
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/
H A Dvalue-range.cc781 bool maxeq = vrp_operand_equal_p (*vr0max, vr1max); in intersect_ranges() local
784 if (mineq && maxeq) in intersect_ranges()
846 else if ((maxeq || operand_less_p (vr1max, *vr0max) == 1) in intersect_ranges()
877 else if (maxeq) in intersect_ranges()
945 else if (maxeq) in intersect_ranges()
1158 bool maxeq = cmpmax == 0; in union_ranges() local
1161 if (mineq && maxeq) in union_ranges()
1258 else if ((maxeq || cmpmax == 1) in union_ranges()
1279 else if (!maxeq && TREE_CODE (vr1max) == INTEGER_CST) in union_ranges()
1292 else if ((maxeq || cmpmax == -1) in union_ranges()
[all …]
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/
H A Dvalue-range.cc781 bool maxeq = vrp_operand_equal_p (*vr0max, vr1max); in intersect_ranges() local
784 if (mineq && maxeq) in intersect_ranges()
846 else if ((maxeq || operand_less_p (vr1max, *vr0max) == 1) in intersect_ranges()
877 else if (maxeq) in intersect_ranges()
945 else if (maxeq) in intersect_ranges()
1158 bool maxeq = cmpmax == 0; in union_ranges() local
1161 if (mineq && maxeq) in union_ranges()
1258 else if ((maxeq || cmpmax == 1) in union_ranges()
1279 else if (!maxeq && TREE_CODE (vr1max) == INTEGER_CST) in union_ranges()
1292 else if ((maxeq || cmpmax == -1) in union_ranges()
[all …]
/dports/lang/gcc11/gcc-11.2.0/gcc/
H A Dvalue-range.cc781 bool maxeq = vrp_operand_equal_p (*vr0max, vr1max); in intersect_ranges() local
784 if (mineq && maxeq) in intersect_ranges()
846 else if ((maxeq || operand_less_p (vr1max, *vr0max) == 1) in intersect_ranges()
877 else if (maxeq) in intersect_ranges()
945 else if (maxeq) in intersect_ranges()
1158 bool maxeq = cmpmax == 0; in union_ranges() local
1161 if (mineq && maxeq) in union_ranges()
1258 else if ((maxeq || cmpmax == 1) in union_ranges()
1279 else if (!maxeq && TREE_CODE (vr1max) == INTEGER_CST) in union_ranges()
1292 else if ((maxeq || cmpmax == -1) in union_ranges()
[all …]
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/
H A Dvalue-range.cc752 bool maxeq = vrp_operand_equal_p (*vr0max, vr1max); in intersect_ranges() local
755 if (mineq && maxeq) in intersect_ranges()
817 else if ((maxeq || operand_less_p (vr1max, *vr0max) == 1) in intersect_ranges()
848 else if (maxeq) in intersect_ranges()
916 else if (maxeq) in intersect_ranges()
1129 bool maxeq = cmpmax == 0; in union_ranges() local
1132 if (mineq && maxeq) in union_ranges()
1229 else if ((maxeq || cmpmax == 1) in union_ranges()
1250 else if (!maxeq && TREE_CODE (vr1max) == INTEGER_CST) in union_ranges()
1263 else if ((maxeq || cmpmax == -1) in union_ranges()
[all …]
/dports/biology/jalview/jalview/src/com/stevesoft/pat/
H A DpatInt.java153 public final patInt maxeq(patInt p) in maxeq() method in patInt
H A DOr.java115 m.maxeq(p.countMaxChars()); in maxChars()
/dports/net-mgmt/netmagis-servers/netmagis-2.3.4/topo/lib/
H A Ddupgraph.c118 int maxeq ; in dup_all_mobj() local
258 maxeq = j ; in dup_all_mobj()
402 for (i = 0 ; i < maxeq ; i++) in dup_all_mobj()
/dports/net-mgmt/netmagis-topo/netmagis-2.3.4/topo/lib/
H A Ddupgraph.c118 int maxeq ; in dup_all_mobj() local
258 maxeq = j ; in dup_all_mobj()
402 for (i = 0 ; i < maxeq ; i++) in dup_all_mobj()
/dports/net-mgmt/netmagis-detecteq/netmagis-2.3.4/topo/lib/
H A Ddupgraph.c118 int maxeq ; in dup_all_mobj() local
258 maxeq = j ; in dup_all_mobj()
402 for (i = 0 ; i < maxeq ; i++) in dup_all_mobj()
/dports/net-mgmt/netmagis-www/netmagis-2.3.4/topo/lib/
H A Ddupgraph.c118 int maxeq ; in dup_all_mobj() local
258 maxeq = j ; in dup_all_mobj()
402 for (i = 0 ; i < maxeq ; i++) in dup_all_mobj()
/dports/net-mgmt/netmagis-database/netmagis-2.3.4/topo/lib/
H A Ddupgraph.c118 int maxeq ; in dup_all_mobj() local
258 maxeq = j ; in dup_all_mobj()
402 for (i = 0 ; i < maxeq ; i++) in dup_all_mobj()
/dports/net-mgmt/netmagis-common/netmagis-2.3.4/topo/lib/
H A Ddupgraph.c118 int maxeq ; in dup_all_mobj() local
258 maxeq = j ; in dup_all_mobj()
402 for (i = 0 ; i < maxeq ; i++) in dup_all_mobj()
/dports/net-mgmt/netmagis-utils/netmagis-2.3.4/topo/lib/
H A Ddupgraph.c118 int maxeq ; in dup_all_mobj() local
258 maxeq = j ; in dup_all_mobj()
402 for (i = 0 ; i < maxeq ; i++) in dup_all_mobj()
/dports/net-mgmt/netmagis-metro/netmagis-2.3.4/topo/lib/
H A Ddupgraph.c118 int maxeq ; in dup_all_mobj() local
258 maxeq = j ; in dup_all_mobj()
402 for (i = 0 ; i < maxeq ; i++) in dup_all_mobj()
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/
H A Dtree-vrp.c5478 bool maxeq = vrp_operand_equal_p (*vr0max, vr1max); in union_ranges() local
5481 if (mineq && maxeq) in union_ranges()
5578 else if ((maxeq || operand_less_p (vr1max, *vr0max) == 1) in union_ranges()
5599 else if (!maxeq && TREE_CODE (vr1max) == INTEGER_CST) in union_ranges()
5612 else if ((maxeq || operand_less_p (*vr0max, vr1max) == 1) in union_ranges()
5636 else if (!maxeq && TREE_CODE (*vr0max) == INTEGER_CST) in union_ranges()
5749 bool maxeq = vrp_operand_equal_p (*vr0max, vr1max); in intersect_ranges() local
5752 if (mineq && maxeq) in intersect_ranges()
5814 else if ((maxeq || operand_less_p (vr1max, *vr0max) == 1) in intersect_ranges()
5845 else if (maxeq) in intersect_ranges()
[all …]
/dports/lang/gcc9/gcc-9.4.0/gcc/
H A Dtree-vrp.c5478 bool maxeq = vrp_operand_equal_p (*vr0max, vr1max); in union_ranges() local
5481 if (mineq && maxeq) in union_ranges()
5578 else if ((maxeq || operand_less_p (vr1max, *vr0max) == 1) in union_ranges()
5599 else if (!maxeq && TREE_CODE (vr1max) == INTEGER_CST) in union_ranges()
5612 else if ((maxeq || operand_less_p (*vr0max, vr1max) == 1) in union_ranges()
5636 else if (!maxeq && TREE_CODE (*vr0max) == INTEGER_CST) in union_ranges()
5749 bool maxeq = vrp_operand_equal_p (*vr0max, vr1max); in intersect_ranges() local
5752 if (mineq && maxeq) in intersect_ranges()
5814 else if ((maxeq || operand_less_p (vr1max, *vr0max) == 1) in intersect_ranges()
5845 else if (maxeq) in intersect_ranges()
[all …]
/dports/lang/gcc9-aux/gcc-9.1.0/gcc/
H A Dtree-vrp.c5472 bool maxeq = vrp_operand_equal_p (*vr0max, vr1max); in union_ranges() local
5475 if (mineq && maxeq) in union_ranges()
5572 else if ((maxeq || operand_less_p (vr1max, *vr0max) == 1) in union_ranges()
5593 else if (!maxeq && TREE_CODE (vr1max) == INTEGER_CST) in union_ranges()
5606 else if ((maxeq || operand_less_p (*vr0max, vr1max) == 1) in union_ranges()
5630 else if (!maxeq && TREE_CODE (*vr0max) == INTEGER_CST) in union_ranges()
5743 bool maxeq = vrp_operand_equal_p (*vr0max, vr1max); in intersect_ranges() local
5746 if (mineq && maxeq) in intersect_ranges()
5808 else if ((maxeq || operand_less_p (vr1max, *vr0max) == 1) in intersect_ranges()
5839 else if (maxeq) in intersect_ranges()
[all …]
/dports/lang/gcc8/gcc-8.5.0/gcc/
H A Dtree-vrp.c5690 bool maxeq = vrp_operand_equal_p (*vr0max, vr1max); in union_ranges() local
5693 if (mineq && maxeq) in union_ranges()
5790 else if ((maxeq || operand_less_p (vr1max, *vr0max) == 1) in union_ranges()
5811 else if (!maxeq && TREE_CODE (vr1max) == INTEGER_CST) in union_ranges()
5824 else if ((maxeq || operand_less_p (*vr0max, vr1max) == 1) in union_ranges()
5848 else if (!maxeq && TREE_CODE (*vr0max) == INTEGER_CST) in union_ranges()
5961 bool maxeq = vrp_operand_equal_p (*vr0max, vr1max); in intersect_ranges() local
5964 if (mineq && maxeq) in intersect_ranges()
6026 else if ((maxeq || operand_less_p (vr1max, *vr0max) == 1) in intersect_ranges()
6057 else if (maxeq) in intersect_ranges()
[all …]
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/
H A Dtree-vrp.c5690 bool maxeq = vrp_operand_equal_p (*vr0max, vr1max); in union_ranges() local
5693 if (mineq && maxeq) in union_ranges()
5790 else if ((maxeq || operand_less_p (vr1max, *vr0max) == 1) in union_ranges()
5811 else if (!maxeq && TREE_CODE (vr1max) == INTEGER_CST) in union_ranges()
5824 else if ((maxeq || operand_less_p (*vr0max, vr1max) == 1) in union_ranges()
5848 else if (!maxeq && TREE_CODE (*vr0max) == INTEGER_CST) in union_ranges()
5961 bool maxeq = vrp_operand_equal_p (*vr0max, vr1max); in intersect_ranges() local
5964 if (mineq && maxeq) in intersect_ranges()
6026 else if ((maxeq || operand_less_p (vr1max, *vr0max) == 1) in intersect_ranges()
6057 else if (maxeq) in intersect_ranges()
[all …]
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/
H A Dtree-vrp.c5690 bool maxeq = vrp_operand_equal_p (*vr0max, vr1max); in union_ranges() local
5693 if (mineq && maxeq) in union_ranges()
5790 else if ((maxeq || operand_less_p (vr1max, *vr0max) == 1) in union_ranges()
5811 else if (!maxeq && TREE_CODE (vr1max) == INTEGER_CST) in union_ranges()
5824 else if ((maxeq || operand_less_p (*vr0max, vr1max) == 1) in union_ranges()
5848 else if (!maxeq && TREE_CODE (*vr0max) == INTEGER_CST) in union_ranges()
5961 bool maxeq = vrp_operand_equal_p (*vr0max, vr1max); in intersect_ranges() local
5964 if (mineq && maxeq) in intersect_ranges()
6026 else if ((maxeq || operand_less_p (vr1max, *vr0max) == 1) in intersect_ranges()
6057 else if (maxeq) in intersect_ranges()
[all …]

12