/dports/net-mgmt/aircrack-ng/aircrack-ng-1.5.2/src/ |
H A D | kstats.c | 49 A_neg /* helps reject false positives */ enumerator 111 votes[A_neg][Kq]++; in calc_votes() 113 votes[A_neg][Kq]++; in calc_votes() 118 votes[A_neg][Kq]++; in calc_votes() 133 votes[A_neg][Kq]++; in calc_votes() 135 votes[A_neg][Kq]++; in calc_votes() 141 votes[A_neg][Kq]++; in calc_votes() 143 votes[A_neg][Kq]++; in calc_votes()
|
H A D | aircrack-ng.h | 113 A_neg /* helps reject false positives */ enumerator
|
H A D | aircrack-ng.c | 2359 votes[A_neg][Kq]++; in crack_wep_thread() 2361 votes[A_neg][Kq]++; in crack_wep_thread() 2366 votes[A_neg][Kq]++; in crack_wep_thread() 2381 votes[A_neg][Kq]++; in crack_wep_thread() 2383 votes[A_neg][Kq]++; in crack_wep_thread() 2389 votes[A_neg][Kq]++; in crack_wep_thread() 2391 votes[A_neg][Kq]++; in crack_wep_thread()
|
/dports/math/py-libpoly/libpoly-0.1.11/src/polynomial/ |
H A D | polynomial.c | 1386 lp_polynomial_t* A_neg = lp_polynomial_new(ctx); in lp_polynomial_constraint_infer_bounds() local 1387 lp_polynomial_neg(A_neg, A); in lp_polynomial_constraint_infer_bounds() 1389 lp_polynomial_delete(A_neg); in lp_polynomial_constraint_infer_bounds() 1393 lp_polynomial_t* A_neg = lp_polynomial_new(ctx); in lp_polynomial_constraint_infer_bounds() local 1394 lp_polynomial_neg(A_neg, A); in lp_polynomial_constraint_infer_bounds() 1396 lp_polynomial_delete(A_neg); in lp_polynomial_constraint_infer_bounds() 1605 lp_polynomial_t* A_neg = lp_polynomial_new(ctx); in lp_polynomial_constraint_explain_infer_bounds() local 1606 lp_polynomial_neg(A_neg, A); in lp_polynomial_constraint_explain_infer_bounds() 1608 lp_polynomial_delete(A_neg); in lp_polynomial_constraint_explain_infer_bounds() 1613 lp_polynomial_neg(A_neg, A); in lp_polynomial_constraint_explain_infer_bounds() [all …]
|
/dports/math/libpoly/libpoly-0.1.11/src/polynomial/ |
H A D | polynomial.c | 1386 lp_polynomial_t* A_neg = lp_polynomial_new(ctx); in lp_polynomial_constraint_infer_bounds() local 1387 lp_polynomial_neg(A_neg, A); in lp_polynomial_constraint_infer_bounds() 1389 lp_polynomial_delete(A_neg); in lp_polynomial_constraint_infer_bounds() 1393 lp_polynomial_t* A_neg = lp_polynomial_new(ctx); in lp_polynomial_constraint_infer_bounds() local 1394 lp_polynomial_neg(A_neg, A); in lp_polynomial_constraint_infer_bounds() 1396 lp_polynomial_delete(A_neg); in lp_polynomial_constraint_infer_bounds() 1605 lp_polynomial_t* A_neg = lp_polynomial_new(ctx); in lp_polynomial_constraint_explain_infer_bounds() local 1606 lp_polynomial_neg(A_neg, A); in lp_polynomial_constraint_explain_infer_bounds() 1608 lp_polynomial_delete(A_neg); in lp_polynomial_constraint_explain_infer_bounds() 1613 lp_polynomial_neg(A_neg, A); in lp_polynomial_constraint_explain_infer_bounds() [all …]
|
/dports/net-mgmt/kismet/kismet-2016-07-R1/restricted-plugin-ptw/ |
H A D | aircrack-ptw2-lib.cc | 544 doVote(first, second, i, A_neg, Kq, iv, weights[0], keylength); in genVotes() 547 doVote(first, second, i, A_neg, Kq, iv, weights[0], keylength); in genVotes() 556 doVote(first, second, i, A_neg, Kq, iv, weights[1], keylength); in genVotes() 578 doVote(first, second, i, A_neg, Kq, iv, weights[0], keylength); in genVotes() 581 doVote(first, second, i, A_neg, Kq, iv, weights[0], keylength); in genVotes() 591 doVote(first, second, i, A_neg, Kq, iv, weights[0], keylength); in genVotes() 594 doVote(first, second, i, A_neg, Kq, iv, weights[0], keylength); in genVotes()
|
H A D | aircrack-ng.h | 86 A_neg, /* helps reject false positives */ enumerator
|
/dports/devel/zpu-gcc/zpu-toolchain-1.0/toolchain/gcc/gcc/config/m68hc11/ |
H A D | larith.asm | 763 bmi A_neg 771 A_neg: label
|
/dports/devel/tigcc/tigcc-0.96.b8_10/gnu/gcc-4.1-20060728/gcc/config/m68hc11/ |
H A D | larith.asm | 763 bmi A_neg 771 A_neg: label
|
/dports/devel/zpu-binutils/zpu-toolchain-1.0/toolchain/gcc/gcc/config/m68hc11/ |
H A D | larith.asm | 763 bmi A_neg 771 A_neg: label
|
/dports/math/giacxcas/CoCoALib-0.99700/src/CoCoA-5/packages/ |
H A D | arrangements.cpkg5 | 539 A_neg := [IndetsS[edge[1]]+IndetsS[edge[2]]| edge in negative_edgesG]; 541 return ConcatLists([A_pos, A_neg, A_loop]);
|
/dports/math/cocoalib/CoCoALib-0.99712/src/CoCoA-5/packages/ |
H A D | arrangements.cpkg5 | 539 A_neg := [IndetsS[edge[1]]+IndetsS[edge[2]]| edge in negative_edgesG]; 541 return ConcatLists([A_pos, A_neg, A_loop]);
|