/dports/math/igraph/igraph-0.9.5/vendor/glpk/bflib/ |
H A D | fhvint.c | 73 { fi->fhv.p0_ind[k] = fi->fhv.luf->pp_ind[k]; in fhvint_factorize() 102 int *pp_ind = luf->pp_ind; in fhvint_ftran() local 109 luf->pp_ind = fhv->p0_ind; in fhvint_ftran() 112 luf->pp_ind = pp_ind; in fhvint_ftran() 125 int *pp_ind = luf->pp_ind; in fhvint_btran() local 134 luf->pp_ind = fhv->p0_ind; in fhvint_btran() 137 luf->pp_ind = pp_ind; in fhvint_btran()
|
H A D | scfint.c | 96 { if (fi->scf.pp_ind != NULL) in scfint_factorize() 97 tfree(fi->scf.pp_ind); in scfint_factorize() 108 fi->scf.pp_ind = talloc(1+n0_max+nn_max, int); in scfint_factorize() 125 { fi->scf.pp_ind[k] = k; in scfint_factorize() 142 int *pp_ind = fi->scf.pp_ind; in scfint_update() local 157 xassert(pp_ind[k] == k); in scfint_update() 231 if (fi->scf.pp_ind != NULL) in scfint_delete() 232 tfree(fi->scf.pp_ind); in scfint_delete()
|
H A D | btf.c | 80 int *pp_ind = btf->pp_ind; in btf_make_blocks() local 104 ip = pp_ind; /* working array */ in btf_make_blocks() 122 pp_ind[pp_inv[j]] = j; in btf_make_blocks() 143 int *pp_ind = btf->pp_ind; in btf_check_blocks() local 156 { xassert(1 <= pp_ind[k] && pp_ind[k] <= n); in btf_check_blocks() 157 xassert(pp_inv[pp_ind[k]] == k); in btf_check_blocks() 183 ii = pp_ind[i]; in btf_check_blocks() 321 luf.pp_ind = btf->p1_ind + (beg_k-1); in btf_a_solve() 413 luf.pp_ind = btf->p1_ind + (beg_k-1); in btf_at_solve() 499 luf.pp_ind = btf->p1_ind + (beg_k-1); in btf_at_solve1()
|
H A D | sgf.c | 76 int *pp_ind = luf->pp_ind; in sgf_reduce_nuc() local 115 ii = pp_ind[i]; in sgf_reduce_nuc() 142 { if (pp_ind[i] < k1) in sgf_reduce_nuc() 169 ii = pp_ind[i]; in sgf_reduce_nuc() 274 int *pp_ind = luf->pp_ind; in sgf_singl_phase() local 360 if (pp_ind[i] == k) in sgf_singl_phase() 364 else if (pp_ind[i] > k) in sgf_singl_phase() 1119 int *pp_ind = luf->pp_ind; in sgf_dense_phase() local 1180 pp_ind[pp_inv[ii]] = ii; in sgf_dense_phase() 1312 int *pp_ind = luf->pp_ind; in sgf_factorize() local [all …]
|
H A D | fhv.c | 160 int *pp_ind = luf->pp_ind; in fhv_ft_update() local 193 luf->pp_ind = fhv->p0_ind; in fhv_ft_update() 196 luf->pp_ind = pp_ind; in fhv_ft_update() 278 if (t < pp_ind[i]) in fhv_ft_update() 279 t = pp_ind[i]; in fhv_ft_update() 315 { pp_ind[pp_inv[k] = pp_inv[k+1]] = k; in fhv_ft_update() 319 pp_ind[pp_inv[t] = p] = qq_inv[qq_ind[t] = q] = t; in fhv_ft_update()
|
H A D | luf.h | 134 int *pp_ind; /* int pp_ind[1+n]; */ member 155 pp_ind[j1] = i2, pp_inv[i2] = j1; \ 156 pp_ind[j2] = i1, pp_inv[i1] = j2; \
|
H A D | btfint.c | 114 int *pp_ind = btf->pp_ind; in factorize_block() local 135 luf.pp_ind = btf->p1_ind + (beg_k-1); in factorize_block() 155 ii = pp_ind[i]; in factorize_block() 244 { tfree(btf->pp_ind); in btfint_factorize() 255 btf->pp_ind = talloc(1+n_max, int); in btfint_factorize() 307 btf_store_a_cols(btf, col, info, btf->pp_ind, btf->vr_piv); in btfint_factorize() 377 { tfree(btf->pp_ind); in btfint_delete()
|
H A D | lufint.c | 81 tfree(luf->pp_ind); in lufint_factorize() 87 luf->pp_ind = talloc(1+n_max, int); in lufint_factorize() 158 tfree(luf->pp_ind); in lufint_delete()
|
H A D | luf.c | 95 int *pp_ind = luf->pp_ind; in luf_check_all() local 104 { ii = pp_ind[i]; in luf_check_all() 120 jj = pp_ind[j]; in luf_check_all() 127 ii = pp_ind[i]; /* f[i,j] = l[ii,jj] */ in luf_check_all() 138 ii = pp_ind[i]; in luf_check_all() 170 ii = pp_ind[i]; /* v[i,j] = u[ii,jj] */ in luf_check_all()
|
H A D | scf.c | 257 int *pp_ind = scf->pp_ind; in scf_a_solve() local 262 { i = pp_ind[ii]; in scf_a_solve() 515 scf->pp_ind[k] = scf->pp_inv[k] = k; in scf_update_aug()
|
H A D | btf.h | 80 int *pp_ind; /* int pp_ind[1+n]; */ member
|
H A D | scf.h | 131 int *pp_ind; /* int pp_ind[1+n0+nn_max]; */ member
|
/dports/math/glpk/glpk-5.0/src/bflib/ |
H A D | fhvint.c | 73 { fi->fhv.p0_ind[k] = fi->fhv.luf->pp_ind[k]; in fhvint_factorize() 102 int *pp_ind = luf->pp_ind; in fhvint_ftran() local 109 luf->pp_ind = fhv->p0_ind; in fhvint_ftran() 112 luf->pp_ind = pp_ind; in fhvint_ftran() 125 int *pp_ind = luf->pp_ind; in fhvint_btran() local 134 luf->pp_ind = fhv->p0_ind; in fhvint_btran() 137 luf->pp_ind = pp_ind; in fhvint_btran()
|
H A D | scfint.c | 96 { if (fi->scf.pp_ind != NULL) in scfint_factorize() 97 tfree(fi->scf.pp_ind); in scfint_factorize() 108 fi->scf.pp_ind = talloc(1+n0_max+nn_max, int); in scfint_factorize() 125 { fi->scf.pp_ind[k] = k; in scfint_factorize() 142 int *pp_ind = fi->scf.pp_ind; in scfint_update() local 157 xassert(pp_ind[k] == k); in scfint_update() 231 if (fi->scf.pp_ind != NULL) in scfint_delete() 232 tfree(fi->scf.pp_ind); in scfint_delete()
|
H A D | btf.c | 80 int *pp_ind = btf->pp_ind; in btf_make_blocks() local 104 ip = pp_ind; /* working array */ in btf_make_blocks() 122 pp_ind[pp_inv[j]] = j; in btf_make_blocks() 143 int *pp_ind = btf->pp_ind; in btf_check_blocks() local 156 { xassert(1 <= pp_ind[k] && pp_ind[k] <= n); in btf_check_blocks() 157 xassert(pp_inv[pp_ind[k]] == k); in btf_check_blocks() 183 ii = pp_ind[i]; in btf_check_blocks() 321 luf.pp_ind = btf->p1_ind + (beg_k-1); in btf_a_solve() 413 luf.pp_ind = btf->p1_ind + (beg_k-1); in btf_at_solve() 499 luf.pp_ind = btf->p1_ind + (beg_k-1); in btf_at_solve1()
|
H A D | sgf.c | 76 int *pp_ind = luf->pp_ind; in sgf_reduce_nuc() local 115 ii = pp_ind[i]; in sgf_reduce_nuc() 142 { if (pp_ind[i] < k1) in sgf_reduce_nuc() 169 ii = pp_ind[i]; in sgf_reduce_nuc() 274 int *pp_ind = luf->pp_ind; in sgf_singl_phase() local 360 if (pp_ind[i] == k) in sgf_singl_phase() 364 else if (pp_ind[i] > k) in sgf_singl_phase() 1119 int *pp_ind = luf->pp_ind; in sgf_dense_phase() local 1180 pp_ind[pp_inv[ii]] = ii; in sgf_dense_phase() 1312 int *pp_ind = luf->pp_ind; in sgf_factorize() local [all …]
|
H A D | fhv.c | 160 int *pp_ind = luf->pp_ind; in fhv_ft_update() local 193 luf->pp_ind = fhv->p0_ind; in fhv_ft_update() 196 luf->pp_ind = pp_ind; in fhv_ft_update() 278 if (t < pp_ind[i]) in fhv_ft_update() 279 t = pp_ind[i]; in fhv_ft_update() 315 { pp_ind[pp_inv[k] = pp_inv[k+1]] = k; in fhv_ft_update() 319 pp_ind[pp_inv[t] = p] = qq_inv[qq_ind[t] = q] = t; in fhv_ft_update()
|
H A D | luf.h | 134 int *pp_ind; /* int pp_ind[1+n]; */ member 155 pp_ind[j1] = i2, pp_inv[i2] = j1; \ 156 pp_ind[j2] = i1, pp_inv[i1] = j2; \
|
H A D | btfint.c | 114 int *pp_ind = btf->pp_ind; in factorize_block() local 135 luf.pp_ind = btf->p1_ind + (beg_k-1); in factorize_block() 155 ii = pp_ind[i]; in factorize_block() 244 { tfree(btf->pp_ind); in btfint_factorize() 255 btf->pp_ind = talloc(1+n_max, int); in btfint_factorize() 307 btf_store_a_cols(btf, col, info, btf->pp_ind, btf->vr_piv); in btfint_factorize() 377 { tfree(btf->pp_ind); in btfint_delete()
|
H A D | lufint.c | 81 tfree(luf->pp_ind); in lufint_factorize() 87 luf->pp_ind = talloc(1+n_max, int); in lufint_factorize() 158 tfree(luf->pp_ind); in lufint_delete()
|
H A D | luf.c | 95 int *pp_ind = luf->pp_ind; in luf_check_all() local 104 { ii = pp_ind[i]; in luf_check_all() 120 jj = pp_ind[j]; in luf_check_all() 127 ii = pp_ind[i]; /* f[i,j] = l[ii,jj] */ in luf_check_all() 138 ii = pp_ind[i]; in luf_check_all() 170 ii = pp_ind[i]; /* v[i,j] = u[ii,jj] */ in luf_check_all()
|
H A D | scf.c | 257 int *pp_ind = scf->pp_ind; in scf_a_solve() local 262 { i = pp_ind[ii]; in scf_a_solve() 515 scf->pp_ind[k] = scf->pp_inv[k] = k; in scf_update_aug()
|
H A D | btf.h | 80 int *pp_ind; /* int pp_ind[1+n]; */ member
|
H A D | scf.h | 131 int *pp_ind; /* int pp_ind[1+n0+nn_max]; */ member
|