1BMfix_send	include/BSprivate.h	/^extern int BMfix_send(int,int,MPI_Datatype,BMcomp_/
2BMset_setup_data	include/BSprivate.h	/^extern void BMset_setup_data(BMmsg *,int *,int,voi/
3BMset_user	include/BSprivate.h	/^extern void BMset_user(BMuser_data *,int *,int,voi/
4BMset_user_data	include/BSprivate.h	/^extern void BMset_user_data(BMmsg *,int *,int,void/
5CHECK_MEMORY	include/BSdepend.h	/^#define CHECK_MEMORY() \\$/
6CHECK_SEND_LIST	include/BSdepend.h	/^#define	CHECK_SEND_LIST(Mmsg_list) MCHECK_SEND_LIS/
7CHKERR	include/BSdepend.h	/^#define CHKERR(code_num) {if (GETERR) {DEBUG_ACT;r/
8CHKERRN	include/BSdepend.h	/^#define CHKERRN(code_num) {if (GETERR) {DEBUG_ACT;/
9DEBUG_ACTC	include/BSdepend.h	/^#define DEBUG_ACTC(msg) printf("ERROR: Code %d occ/
10DGEMM	include/BSsparse.h	/^#define DGEMM(a,b,c,d,e,f,g,h,i,j,k,l,m) SGEMM(_cp/
11DGEMV	include/BSsparse.h	/^#define DGEMV(a,b,c,d,e,f,g,h,i,j,k) SGEMV(_cptofc/
12DLAMCH	include/BSsparse.h	/^#define DLAMCH(a) SLAMCH(_cptofcd((a),1))$/
13DPOTRF	include/BSsparse.h	/^#define DPOTRF(a,b,c,d,e)  SPOTRF(_cptofcd((a),1),/
14DTRMM	include/BSsparse.h	/^#define DTRMM(a,b,c,d,e,f,g,h,i,j,k)  STRMM(_cptof/
15DTRMV	include/BSsparse.h	/^#define DTRMV(a,b,c,d,e,f,g,h)  STRMV(_cptofcd((a)/
16DTRTRI	include/BSsparse.h	/^#define DTRTRI(a,b,c,d,e,f)  STRTRI(_cptofcd((a),1/
17FINISH_SEND_LIST	include/BSdepend.h	/^#define FINISH_SEND_LIST(Mmsg_list) MFINISH_SEND_L/
18FREE	include/BSdepend.h	/^#define FREE(c) TrFree(c,__LINE__,__FILE__)$/
19GDMAX	include/BSdepend.h	/^#define GDMAX(sum_vec,vec_len,work_vec,procset) \\$/
20GDMIN	include/BSdepend.h	/^#define GDMIN(sum_vec,vec_len,work_vec,procset) \\$/
21GDSUM	include/BSdepend.h	/^#define GDSUM(sum_vec,vec_len,work_vec,procset) \\$/
22GFSUM	include/BSdepend.h	/^#define GFSUM(sum_vec,vec_len,work_vec,procset) \\$/
23GIMAX	include/BSdepend.h	/^#define GIMAX(sum_vec,vec_len,work_vec,procset) \\$/
24GIMIN	include/BSdepend.h	/^#define GIMIN(sum_vec,vec_len,work_vec,procset) \\$/
25GIOR	include/BSdepend.h	/^#define GIOR(sum_vec,vec_len,work_vec,procset) \\$/
26GISUM	include/BSdepend.h	/^#define GISUM(sum_vec,vec_len,work_vec,procset) \\$/
27GSYNC	include/BSdepend.h	/^#define GSYNC(procset) MPI_Barrier((MPI_Comm)procs/
28IS_TREE_PTR_NULL	include/BStree.h	/^#define IS_TREE_PTR_NULL(tree_ptr) ((tree_ptr.ptr /
29MALLOC	include/BSdepend.h	/^#define MALLOC(c) TrMalloc(c,__LINE__,__FILE__)$/
30MCHECK_SEND_LIST	include/BSdepend.h	/^#define	MCHECK_SEND_LIST(Mmsg_list) \\$/
31MFINISH_SEND_LIST	include/BSdepend.h	/^#define MFINISH_SEND_LIST(Mmsg_list) \\$/
32MLOG_ACC	include/BSlog.h	/^#define MLOG_ACC(event) \\$/
33MLOG_ELM	include/BSlog.h	/^#define MLOG_ELM(procset) \\$/
34MLOG_INIT	include/BSlog.h	/^#define	MLOG_INIT() \\$/
35MLOG_IT	include/BSlog.h	/^#define MLOG_IT(event) \\$/
36MLOG_PRINT	include/BSlog.h	/^#define MLOG_PRINT(procinfo) \\$/
37MLOG_flop	include/BSlog.h	/^#define MLOG_flop(num) MLOG_flops += num$/
38MSGFREERECV	include/BSdepend.h	/^#define MSGFREERECV(msg) MY_FREE(msg)$/
39MY_CLEAN_TREE	include/BStree.h	/^#define MY_CLEAN_TREE(tree) \\$/
40MY_DGEMV1_N_1111	include/BSmy_blas.h	/^#define MY_DGEMV1_N_1111(M,N,A,LDA,X,Y,Y_SP_IND) \\/
41MY_DGEMV1_Y_1101	include/BSmy_blas.h	/^#define MY_DGEMV1_Y_1101(M,N,A,LDA,X,X_SP_IND,Y) \\/
42MY_DGEMV1_Y_1111	include/BSmy_blas.h	/^#define MY_DGEMV1_Y_1111(M,N,A,LDA,X,X_SP_IND,Y) \\/
43MY_DGEMV2_N_1111	include/BSmy_blas.h	/^#define MY_DGEMV2_N_1111(M,N,A,LDA,X,Y,Y_SP_IND) \\/
44MY_DGEMV2_Y_1101	include/BSmy_blas.h	/^#define MY_DGEMV2_Y_1101(M,N,A,LDA,X,X_SP_IND,Y) \\/
45MY_DGEMV2_Y_1111	include/BSmy_blas.h	/^#define MY_DGEMV2_Y_1111(M,N,A,LDA,X,X_SP_IND,Y) \\/
46MY_DGEMV3_N_1111	include/BSmy_blas.h	/^#define MY_DGEMV3_N_1111(M,N,A,LDA,X,Y,Y_SP_IND) \\/
47MY_DGEMV3_Y_1101	include/BSmy_blas.h	/^#define MY_DGEMV3_Y_1101(M,N,A,LDA,X,X_SP_IND,Y) \\/
48MY_DGEMV3_Y_1111	include/BSmy_blas.h	/^#define MY_DGEMV3_Y_1111(M,N,A,LDA,X,X_SP_IND,Y) \\/
49MY_DGEMV4_N_1111	include/BSmy_blas.h	/^#define MY_DGEMV4_N_1111(M,N,A,LDA,X,Y,Y_SP_IND) \\/
50MY_DGEMV4_Y_1101	include/BSmy_blas.h	/^#define MY_DGEMV4_Y_1101(M,N,A,LDA,X,X_SP_IND,Y) \\/
51MY_DGEMV4_Y_1111	include/BSmy_blas.h	/^#define MY_DGEMV4_Y_1111(M,N,A,LDA,X,X_SP_IND,Y) \\/
52MY_DGEMV5_N_1111	include/BSmy_blas.h	/^#define MY_DGEMV5_N_1111(M,N,A,LDA,X,Y,Y_SP_IND) \\/
53MY_DGEMV5_Y_1101	include/BSmy_blas.h	/^#define MY_DGEMV5_Y_1101(M,N,A,LDA,X,X_SP_IND,Y) \\/
54MY_DGEMV5_Y_1111	include/BSmy_blas.h	/^#define MY_DGEMV5_Y_1111(M,N,A,LDA,X,X_SP_IND,Y) \\/
55MY_DGEMV6_N_1111	include/BSmy_blas.h	/^#define MY_DGEMV6_N_1111(M,N,A,LDA,X,Y,Y_SP_IND) \\/
56MY_DGEMV6_Y_1101	include/BSmy_blas.h	/^#define MY_DGEMV6_Y_1101(M,N,A,LDA,X,X_SP_IND,Y) \\/
57MY_DGEMV6_Y_1111	include/BSmy_blas.h	/^#define MY_DGEMV6_Y_1111(M,N,A,LDA,X,X_SP_IND,Y) \\/
58MY_DGEMV7_N_1111	include/BSmy_blas.h	/^#define MY_DGEMV7_N_1111(M,N,A,LDA,X,Y,Y_SP_IND) \\/
59MY_DGEMV7_Y_1101	include/BSmy_blas.h	/^#define MY_DGEMV7_Y_1101(M,N,A,LDA,X,X_SP_IND,Y) \\/
60MY_DGEMV7_Y_1111	include/BSmy_blas.h	/^#define MY_DGEMV7_Y_1111(M,N,A,LDA,X,X_SP_IND,Y) \\/
61MY_DGEMV8_N_1111	include/BSmy_blas.h	/^#define MY_DGEMV8_N_1111(M,N,A,LDA,X,Y,Y_SP_IND) \\/
62MY_DGEMV8_Y_1101	include/BSmy_blas.h	/^#define MY_DGEMV8_Y_1101(M,N,A,LDA,X,X_SP_IND,Y) \\/
63MY_DGEMV8_Y_1111	include/BSmy_blas.h	/^#define MY_DGEMV8_Y_1111(M,N,A,LDA,X,X_SP_IND,Y) \\/
64MY_DGEMV9_N_1111	include/BSmy_blas.h	/^#define MY_DGEMV9_N_1111(M,N,A,LDA,X,Y,Y_SP_IND) \\/
65MY_DGEMV9_Y_1101	include/BSmy_blas.h	/^#define MY_DGEMV9_Y_1101(M,N,A,LDA,X,X_SP_IND,Y) \\/
66MY_DGEMV9_Y_1111	include/BSmy_blas.h	/^#define MY_DGEMV9_Y_1111(M,N,A,LDA,X,X_SP_IND,Y) \\/
67MY_DGEMVM1_1_N_1111	include/BSmy_blas.h	/^#define MY_DGEMVM1_1_N_1111(M,N,A,LDA,X,Y,Y_SP_IND/
68MY_DGEMVM1_1_Y_1111	include/BSmy_blas.h	/^#define MY_DGEMVM1_1_Y_1111(M,N,A,LDA,X,X_SP_IND,Y/
69MY_DGEMVM1_2_N_1111	include/BSmy_blas.h	/^#define MY_DGEMVM1_2_N_1111(M,N,A,LDA,X,Y,Y_SP_IND/
70MY_DGEMVM1_2_Y_1111	include/BSmy_blas.h	/^#define MY_DGEMVM1_2_Y_1111(M,N,A,LDA,X,X_SP_IND,Y/
71MY_DGEMVM1_3_N_1111	include/BSmy_blas.h	/^#define MY_DGEMVM1_3_N_1111(M,N,A,LDA,X,Y,Y_SP_IND/
72MY_DGEMVM1_3_Y_1111	include/BSmy_blas.h	/^#define MY_DGEMVM1_3_Y_1111(M,N,A,LDA,X,X_SP_IND,Y/
73MY_DGEMVM1_4_N_1111	include/BSmy_blas.h	/^#define MY_DGEMVM1_4_N_1111(M,N,A,LDA,X,Y,Y_SP_IND/
74MY_DGEMVM1_4_Y_1111	include/BSmy_blas.h	/^#define MY_DGEMVM1_4_Y_1111(M,N,A,LDA,X,X_SP_IND,Y/
75MY_DGEMVM1_5_N_1111	include/BSmy_blas.h	/^#define MY_DGEMVM1_5_N_1111(M,N,A,LDA,X,Y,Y_SP_IND/
76MY_DGEMVM1_5_Y_1111	include/BSmy_blas.h	/^#define MY_DGEMVM1_5_Y_1111(M,N,A,LDA,X,X_SP_IND,Y/
77MY_DGEMVM1_6_N_1111	include/BSmy_blas.h	/^#define MY_DGEMVM1_6_N_1111(M,N,A,LDA,X,Y,Y_SP_IND/
78MY_DGEMVM1_6_Y_1111	include/BSmy_blas.h	/^#define MY_DGEMVM1_6_Y_1111(M,N,A,LDA,X,X_SP_IND,Y/
79MY_DGEMVM1_7_N_1111	include/BSmy_blas.h	/^#define MY_DGEMVM1_7_N_1111(M,N,A,LDA,X,Y,Y_SP_IND/
80MY_DGEMVM1_7_Y_1111	include/BSmy_blas.h	/^#define MY_DGEMVM1_7_Y_1111(M,N,A,LDA,X,X_SP_IND,Y/
81MY_DGEMVM1_8_N_1111	include/BSmy_blas.h	/^#define MY_DGEMVM1_8_N_1111(M,N,A,LDA,X,Y,Y_SP_IND/
82MY_DGEMVM1_8_Y_1111	include/BSmy_blas.h	/^#define MY_DGEMVM1_8_Y_1111(M,N,A,LDA,X,X_SP_IND,Y/
83MY_DGEMVM1_9_N_1111	include/BSmy_blas.h	/^#define MY_DGEMVM1_9_N_1111(M,N,A,LDA,X,Y,Y_SP_IND/
84MY_DGEMVM1_9_Y_1111	include/BSmy_blas.h	/^#define MY_DGEMVM1_9_Y_1111(M,N,A,LDA,X,X_SP_IND,Y/
85MY_DGEMVM1_N_1111	include/BSmy_blas.h	/^#define MY_DGEMVM1_N_1111(M,N,A,LDA,X,Y,Y_SP_IND) /
86MY_DGEMVM1_Y_1111	include/BSmy_blas.h	/^#define MY_DGEMVM1_Y_1111(M,N,A,LDA,X,X_SP_IND,Y) /
87MY_DGEMV_N_1111	include/BSmy_blas.h	/^#define MY_DGEMV_N_1111(M,N,A,LDA,X,Y,Y_SP_IND) \\$/
88MY_DGEMV_Y_1101	include/BSmy_blas.h	/^#define MY_DGEMV_Y_1101(M,N,A,LDA,X,X_SP_IND,Y) \\$/
89MY_DGEMV_Y_1111	include/BSmy_blas.h	/^#define MY_DGEMV_Y_1111(M,N,A,LDA,X,X_SP_IND,Y) \\$/
90MY_DTRMV_N_L	include/BSmy_blas.h	/^#define MY_DTRMV_N_L(M,A,LDA,X,B) \\$/
91MY_DTRMV_N_U	include/BSmy_blas.h	/^#define MY_DTRMV_N_U(M,A,LDA,X,WORK) \\$/
92MY_DTRMV_T_L	include/BSmy_blas.h	/^#define MY_DTRMV_T_L(M,A,LDA,X,B) \\$/
93MY_DTRMV_T_U	include/BSmy_blas.h	/^#define MY_DTRMV_T_U(M,A,LDA,X) \\$/
94MY_FIRST_IN_TREE	include/BStree.h	/^#define MY_FIRST_IN_TREE(tree,node_ptr) \\$/
95MY_FREE	include/BSprivate.h	/^#define MY_FREE(a) \\$/
96MY_FREEN	include/BSprivate.h	/^#define MY_FREEN(a) \\$/
97MY_FREE_TREE	include/BStree.h	/^#define MY_FREE_TREE(tree) \\$/
98MY_FREE_TREE_NODE	include/BStree.h	/^#define	MY_FREE_TREE_NODE(tree,inptr) \\$/
99MY_FREE_USER_DATA	include/BStree.h	/^#define	MY_FREE_USER_DATA(tree,data_ptr) \\$/
100MY_GET_TREE_DATA	include/BStree.h	/^#define	MY_GET_TREE_DATA(node_ptr) node_ptr.ptr->d/
101MY_GET_TREE_KEY	include/BStree.h	/^#define	MY_GET_TREE_KEY(node_ptr) node_ptr.ptr->ke/
102MY_GET_TREE_NODE	include/BStree.h	/^#define	MY_GET_TREE_NODE(tree,inptr) \\$/
103MY_INIT_TREE	include/BStree.h	/^#define	MY_INIT_TREE(tree,user_data_size) \\$/
104MY_INSERT_TREE_NODE	include/BStree.h	/^#define MY_INSERT_TREE_NODE(tree,inkey,found,node_/
105MY_KEY_EQUAL	include/BStree.h	/^#define MY_KEY_EQUAL(key1,key2) (((key1) == (key2)/
106MY_KEY_LT	include/BStree.h	/^#define MY_KEY_LT(key1,key2) (((key1) < (key2))?1:/
107MY_MAKE_PARENT	include/BStree.h	/^#define MY_MAKE_PARENT(inchild,inparent) \\$/
108MY_MALLOC	include/BSprivate.h	/^#define MY_MALLOC(a,b,c,d) { \\$/
109MY_MALLOCN	include/BSprivate.h	/^#define MY_MALLOCN(a,b,c,d) { \\$/
110MY_MALLOC_USER_DATA	include/BStree.h	/^#define	MY_MALLOC_USER_DATA(tree,data_ptr) \\$/
111MY_NEXT_IN_TREE	include/BStree.h	/^#define MY_NEXT_IN_TREE(node_ptr) \\$/
112MY_PRINT_NODE	include/BStree.h	/^#define MY_PRINT_NODE(tptr) \\$/
113MY_PUT_IN_TREE	include/BStree.h	/^#define MY_PUT_IN_TREE(tree,inkey,inptr) \\$/
114MY_SEARCH_TREE	include/BStree.h	/^#define MY_SEARCH_TREE(tree,inkey,found,node_ptr) /
115MY_SEND_SYNC	include/BSdepend.h	/^#define	MY_SEND_SYNC(Mmsg_list,Mmsg_type,Mmsg,Mmsg/
116MY_SETERR	include/BSprivate.h	/^#define MY_SETERR(a) {SETERR(a); return;}$/
117MY_SETERRC	include/BSprivate.h	/^#define MY_SETERRC(a,s) {SETERRC(a,s); return;}$/
118MY_SETERRCN	include/BSprivate.h	/^#define MY_SETERRCN(a,s) {SETERRC(a,s); return(0);/
119MY_SETERRN	include/BSprivate.h	/^#define MY_SETERRN(a) {SETERR(a); return(0);}$/
120Mclock	include/BSlog.h	/^#define Mclock() MPI_Wtime();$/
121PICall	include/BSdepend.h	/^#define PICall(procedure,argc,argv) \\$/
122PSISROOT	include/BSdepend.h	/^#define PSISROOT(procinfo) ((procinfo->my_id == 0)/
123PSNbrTree	include/BSdepend.h	/^#define PSNbrTree(op_code,nbr_id,procset) \\$/
124RECVASYNCNOMEMFORCE	include/BSdepend.h	/^#define RECVASYNCNOMEMFORCE(type,buf,length,data_t/
125RECVSYNCNOMEM	include/BSdepend.h	/^#define RECVSYNCNOMEM(type,buf,length,data_type,p_/
126RECVSYNCUNSZ	include/BSdepend.h	/^#define RECVSYNCUNSZ(type,buf,length,data_type,p_i/
127RECVSYNCUNSZN	include/BSdepend.h	/^#define RECVSYNCUNSZN(type,buf,length,data_type,p_/
128SENDASYNCNOMEM	include/BSdepend.h	/^#define SENDASYNCNOMEM(type,buf,size,to_proc,data_/
129SENDASYNCNOMEMFORCE	include/BSdepend.h	/^#define SENDASYNCNOMEMFORCE(type,buf,size,to_proc,/
130SENDSYNCNOMEM	include/BSdepend.h	/^#define SENDSYNCNOMEM(type,buf,size,to_proc,data_t/
131SENDWAITNOMEM	include/BSdepend.h	/^#define SENDWAITNOMEM(type,buf,size,to_proc,data_t/
132SETERR	include/BSdepend.h	/^#define SETERR(code_num) {__BSERROR_STATUS=code_nu/
133SETERRC	include/BSdepend.h	/^#define SETERRC(code_num,str) {__BSERROR_STATUS=co/
134BMadd_msg	src/BMcomp_msg.c	/^void BMadd_msg(BMcomp_msg *comp_msg, BMmsg *msg_pt/
135BMalloc_msg	src/BMcomp_msg.c	/^void BMalloc_msg(BMcomp_msg *comp_msg)$/
136BMcheck_on_async_block	src/BMcomp_msg.c	/^void BMcheck_on_async_block(BMphase *phase_ptr)$/
137BMcomp_init	src/BMcomp_msg.c	/^BMcomp_msg *BMcomp_init(int base_type)$/
138BMcreate_msg	src/BMcomp_msg.c	/^BMmsg *BMcreate_msg(int phase, int msg_type, MPI_D/
139BMfinish_comp_msg	src/BMcomp_msg.c	/^void BMfinish_comp_msg(BMcomp_msg *comp_msg, BSpro/
140BMfinish_on_async_block	src/BMcomp_msg.c	/^void BMfinish_on_async_block(BMphase *phase_ptr)$/
141BMfix_send	src/BMcomp_msg.c	/^int BMfix_send(int msg_type, int comp_msg_type, MP/
142BMfree_block_msg	src/BMcomp_msg.c	/^void BMfree_block_msg(BMphase *phase_ptr)$/
143BMfree_comp_msg	src/BMcomp_msg.c	/^void BMfree_comp_msg(BMcomp_msg *comp_msg)$/
144BMfree_msg	src/BMcomp_msg.c	/^void BMfree_msg(BMmsg *msg_ptr)$/
145BMfree_setup_data	src/BMcomp_msg.c	/^void BMfree_setup_data(BMmsg *msg)$/
146BMfree_user	src/BMcomp_msg.c	/^void BMfree_user(BMuser_data *user_data)$/
147BMfree_user_data	src/BMcomp_msg.c	/^void BMfree_user_data(BMmsg *msg)$/
148BMget_msg_ptr	src/BMcomp_msg.c	/^void *BMget_msg_ptr(BMmsg *msg)$/
149BMget_msg_size	src/BMcomp_msg.c	/^int BMget_msg_size(BMmsg *msg)$/
150BMget_phase	src/BMcomp_msg.c	/^BMphase *BMget_phase(BMcomp_msg *comp_msg, int pha/
151BMget_setup	src/BMcomp_msg.c	/^int *BMget_setup(BMmsg *msg, int *length)$/
152BMget_user	src/BMcomp_msg.c	/^int *BMget_user(BMmsg *msg, int *length)$/
153BMinit_comp_msg	src/BMcomp_msg.c	/^void BMinit_comp_msg(BMcomp_msg *comp_msg, BSproci/
154BMinit_user	src/BMcomp_msg.c	/^void BMinit_user(BMuser_data *user_data)$/
155BMnext_msg	src/BMcomp_msg.c	/^BMmsg *BMnext_msg(BMphase *phase_ptr, BMmsg *msg_p/
156BMrecv_block_msg	src/BMcomp_msg.c	/^BMmsg *BMrecv_block_msg(BMphase *phase_ptr, BSproc/
157BMrecv_msg	src/BMcomp_msg.c	/^BMmsg *BMrecv_msg(BMphase *phase_ptr)$/
158BMsend_block_msg	src/BMcomp_msg.c	/^void BMsend_block_msg(BMphase *phase_ptr, BMmsg *m/
159BMsendf_msg	src/BMcomp_msg.c	/^void BMsendf_msg(BMmsg *msg, BSprocinfo *procinfo)/
160BMset_msg_ptr	src/BMcomp_msg.c	/^void BMset_msg_ptr(BMmsg *msg, void *msg_ptr)$/
161BMset_msg_size	src/BMcomp_msg.c	/^void BMset_msg_size(BMmsg *msg, int size)$/
162BMset_setup_data	src/BMcomp_msg.c	/^void BMset_setup_data(BMmsg *msg, int *data, int l/
163BMset_user	src/BMcomp_msg.c	/^void BMset_user(BMuser_data *user_data, int *data,/
164BMset_user_data	src/BMcomp_msg.c	/^void BMset_user_data(BMmsg *msg, int *data, int le/
165BSalloc_distribution	src/BSallc_distr.c	/^BSdistribution	*BSalloc_distribution(int max)$/
166BSalloc_key_arr	src/BSallc_keyarr.c	/^BSkey_arr	*BSalloc_key_arr(int length)$/
167BSalloc_numbering	src/BSallc_number.c	/^BSnumbering	*BSalloc_numbering(int length)$/
168BSalloc_permutation	src/BSallc_perm.c	/^BSpermutation	*BSalloc_permutation(int length)$/
169BSb_back_solve	src/BSb_back_solve.c	/^void BSb_back_solve(BSpar_mat *A, FLOAT *x, BScomm/
170BSb_backward	src/BSb_backward.c	/^void BSb_backward(BSpar_mat *A, FLOAT *x, FLOAT *b/
171BSb_for_solve	src/BSb_for_solve.c	/^void BSb_for_solve(BSpar_mat *A, FLOAT *x, BScomm /
172BSb_forward	src/BSb_forward.c	/^void BSb_forward(BSpar_mat *A, FLOAT *x, FLOAT *b,/
173BSback_solve	src/BSback_solve.c	/^void BSback_solve(BSpar_mat *A, FLOAT *x, BScomm */
174BSback_solve1	src/BSback_solve1.c	/^void BSback_solve1(BSpar_mat *A, FLOAT *x, BScomm /
175BSbackward	src/BSbackward.c	/^void BSbackward(BSpar_mat *A, FLOAT *x, FLOAT *b,$/
176BSbackward1	src/BSbackward1.c	/^void BSbackward1(BSpar_mat *A, FLOAT *x, FLOAT *b,/
177BSbase	src/BSbase.c	/^BSnumbering *BSbase(BSdistribution *distr, BSproci/
178BSbjacobi	src/BSbjacobi.c	/^void BSbjacobi(BSpar_mat *A, FLOAT *x, BScomm *com/
179BSbuild_solution	src/BSpar_gmres.c	/^void BSbuild_solution(int i,int n,int BS,FLOAT *x,/
180BSclique_2_inode	src/BSclique_2_inode.c	/^void	BSclique_2_inode(BSspmat *A, BScl_2_inode *cl/
181BScolor_2_clique	src/BScolor_2_clique.c	/^BSnumbering *BScolor_2_clique(BSnumbering *color_b/
182BScopy_cliques	src/BScopy_nz.c	/^void BScopy_cliques(BSpar_mat *A, BSpar_mat *newA)/
183BScopy_nz	src/BScopy_nz.c	/^void BScopy_nz(BSpar_mat *A, BSpar_mat *newA)$/
184BScopy_par_mat	src/BScopy_par_mat.c	/^BSpar_mat *BScopy_par_mat(BSpar_mat *A)$/
185BScount_nz	src/BScount_nz.c	/^int BScount_nz(BSpar_mat *A, BSprocinfo *procinfo)/
186BScreate_ctx	src/BScontext.c	/^BSprocinfo	*BScreate_ctx()$/
187BSctx_print	src/BScontext.c	/^void	BSctx_print(BSprocinfo *context)$/
188BSctx_set_cs	src/BScontext.c	/^void	BSctx_set_cs(BSprocinfo *context, int cs)$/
189BSctx_set_ct	src/BScontext.c	/^void	BSctx_set_ct(BSprocinfo *context, int ct)$/
190BSctx_set_err	src/BScontext.c	/^void	BSctx_set_err(BSprocinfo *context, int err)$/
191BSctx_set_guess	src/BScontext.c	/^void	BSctx_set_guess(BSprocinfo *context, int gues/
192BSctx_set_id	src/BScontext.c	/^void	BSctx_set_id(BSprocinfo *context, int id)$/
193BSctx_set_is	src/BScontext.c	/^void	BSctx_set_is(BSprocinfo *context, int is)$/
194BSctx_set_max_it	src/BScontext.c	/^void	BSctx_set_max_it(BSprocinfo *context, int max/
195BSctx_set_method	src/BScontext.c	/^void	BSctx_set_method(BSprocinfo *context, int met/
196BSctx_set_np	src/BScontext.c	/^void	BSctx_set_np(BSprocinfo *context, int np)$/
197BSctx_set_num_rhs	src/BScontext.c	/^void	BSctx_set_num_rhs(BSprocinfo *context, int nu/
198BSctx_set_pr	src/BScontext.c	/^void	BSctx_set_pr(BSprocinfo *context, int pr)$/
199BSctx_set_pre	src/BScontext.c	/^void	BSctx_set_pre(BSprocinfo *context, int pre)$/
200BSctx_set_print_log	src/BScontext.c	/^void	BSctx_set_print_log(BSprocinfo *context, int /
201BSctx_set_ps	src/BScontext.c	/^void	BSctx_set_ps(BSprocinfo *context, ProcSet *ps/
202BSctx_set_restart	src/BScontext.c	/^void	BSctx_set_restart(BSprocinfo *context, int re/
203BSctx_set_rt	src/BScontext.c	/^void	BSctx_set_rt(BSprocinfo *context, int rt)$/
204BSctx_set_scaling	src/BScontext.c	/^void	BSctx_set_scaling(BSprocinfo *context, int sc/
205BSctx_set_si	src/BScontext.c	/^void	BSctx_set_si(BSprocinfo *context, int si)$/
206BSctx_set_tol	src/BScontext.c	/^void	BSctx_set_tol(BSprocinfo *context, FLOAT tol)/
207BSdo_contract	src/BScontract.c	/^BSspmat	*BSdo_contract(BSspmat *A, BSnumbering *nu/
208BSeasy_A	src/BSeasy_A.c	/^BSspmat *BSeasy_A(int start_num, int n, int *rp, i/
209BSfactor	src/BSfactor.c	/^int BSfactor(BSpar_mat *A, BScomm *comm, BSprocinf/
210BSfactor1	src/BSfactor1.c	/^int BSfactor1(BSpar_mat *A, BScomm *comm, BSprocin/
211BSfactorn	src/BSfactorn.c	/^int BSfactorn(BSpar_mat *A, BScomm *comm, BSprocin/
212BSfinalize	src/BSinit.c	/^int BSfinalize()$/
213BSfnd_clique	src/BSfnd_clique.c	/^BSnumbering	*BSfnd_clique(BSspmat *A, int size_lim/
214BSfnd_inode	src/BSfnd_inode.c	/^BSnumbering	*BSfnd_inode(BSspmat *A, int max_inode/
215BSfold_distr	src/BSfold_distr.c	/^BSdistribution *BSfold_distr(BSdistribution *cliqu/
216BSfor_solve	src/BSfor_solve.c	/^void BSfor_solve(BSpar_mat *A, FLOAT *x, BScomm *c/
217BSfor_solve1	src/BSfor_solve1.c	/^void BSfor_solve1(BSpar_mat *A, FLOAT *x, BScomm */
218BSforward	src/BSforward.c	/^void BSforward(BSpar_mat *A, FLOAT *x, FLOAT *b,$/
219BSforward1	src/BSforward1.c	/^void BSforward1(BSpar_mat *A, FLOAT *x, FLOAT *b,$/
220BSfree_bb	src/BSbulletin.c	/^void	BSfree_bb(BSbb *bb)$/
221BSfree_bb_d	src/BSbulletin_d.c	/^void	BSfree_bb_d(BSbb_d *bb)$/
222BSfree_cl_2_inode	src/BSfree_cl2i.c	/^void BSfree_cl_2_inode(BScl_2_inode *cl_data, int /
223BSfree_comm	src/BSfree_comm.c	/^void BSfree_comm(BScomm *comm_ptr)$/
224BSfree_comm_data	src/BSfree_comm.c	/^void BSfree_comm_data(int *data)$/
225BSfree_copy_par_mat	src/BSfree_par_mat.c	/^void BSfree_copy_par_mat(BSpar_mat *A)$/
226BSfree_ctx	src/BScontext.c	/^void	BSfree_ctx(BSprocinfo *context)$/
227BSfree_distribution	src/BSallc_distr.c	/^void	BSfree_distribution(BSdistribution *distr)$/
228BSfree_easymat	src/BSfree_easymat.c	/^void BSfree_easymat(BSspmat *A)$/
229BSfree_inode_list	src/BSfree_inlist.c	/^void BSfree_inode_list(BSinode_list *in_data)$/
230BSfree_key_arr	src/BSallc_keyarr.c	/^void	BSfree_key_arr(BSkey_arr *key_arr)$/
231BSfree_numbering	src/BSallc_number.c	/^void	BSfree_numbering(BSnumbering *numbering)$/
232BSfree_off_map	src/BSmap.c	/^void BSfree_off_map(BSoff_map *map)$/
233BSfree_par_mat	src/BSfree_par_mat.c	/^void BSfree_par_mat(BSpar_mat *A)$/
234BSfree_permutation	src/BSallc_perm.c	/^void	BSfree_permutation(BSpermutation *permutation/
235BSfree_reperm	src/BSfree_reperm.c	/^void BSfree_reperm(BSreperm *reperm)$/
236BSfree_spmat	src/BSfree_spmat.c	/^void BSfree_spmat(BSspmat *A)$/
237BSfreeg2l	src/BSmap.c	/^void BSfreeg2l(void *data)$/
238BSfreel2g	src/BSmap.c	/^void BSfreel2g(void *data)$/
239BSget_diag	src/BSget_diag.c	/^void BSget_diag(BSpar_mat *A, FLOAT *diag, BSproci/
240BSglob2loc	src/BSmap.c	/^void BSglob2loc(int length,int *req_array,int *ans/
241BSglob2proc	src/BSmap.c	/^void BSglob2proc(int length,int *req_array,int *an/
242BSglobal_flops	src/BSflops.c	/^double BSglobal_flops(BSprocinfo *procinfo)$/
243BSglobal_nnz	src/BSnumbers.c	/^int BSglobal_nnz(BSpar_mat *pA, BSprocinfo *procin/
244BSglobal_num_cliques	src/BSnumbers.c	/^int BSglobal_num_cliques(BSpar_mat *pA)$/
245BSglobal_num_inodes	src/BSnumbers.c	/^int BSglobal_num_inodes(BSpar_mat *pA)$/
246BSglobal_perm	src/BSglobal_perm.c	/^BSpermutation *BSglobal_perm(BSnumbering *numberin/
247BSheap_sort0	src/BSheap_sort.c	/^void BSheap_sort0(int n, int *key)$/
248BSheap_sort1	src/BSheap_sort.c	/^void BSheap_sort1(int n, int *key, int *data1)$/
249BSheap_sort1d	src/BSheap_sort.c	/^void BSheap_sort1d(int n, int *key, FLOAT *data1)$/
250BSheap_sort2	src/BSheap_sort.c	/^void BSheap_sort2(int n, int *key, int *data1, int/
251BSheap_sorthl1	src/BSheap_sort.c	/^void BSheap_sorthl1(int n, int *key, int *data1)$/
252BSido_color	src/BSido_color.c	/^void BSido_color(int *ido_queue, int n_queue, BSsp/
253BSiheap_sort1	src/BSheap_sort.c	/^void BSiheap_sort1(int n, int *key, int *ikey1)$/
254BSiheap_sort2	src/BSheap_sort.c	/^void BSiheap_sort2(int n, int *key, int *ikey1, in/
255BSilu_factor1	src/BSilu_factor1.c	/^int BSilu_factor1(BSpar_mat *A, BScomm *comm, BSpr/
256BSilu_factorn	src/BSilu_factorn.c	/^int BSilu_factorn(BSpar_mat *A, BScomm *comm, BSpr/
257BSilu_updt_matrix	src/BSilu_factorn.c	/^void BSilu_updt_matrix(BSpar_mat *A, int colnum, B/
258BSilu_updt_matrix1	src/BSilu_factor1.c	/^void BSilu_updt_matrix1(BSpar_mat *A, int colnum, /
259BSinit	src/BSinit.c	/^int BSinit(int *argc,char ***args)$/
260BSinit_bb	src/BSbulletin.c	/^BSbb	*BSinit_bb(int length, BSmapping *map)$/
261BSinit_bb_d	src/BSbulletin_d.c	/^BSbb_d	*BSinit_bb_d(int length, BSmapping *map)$/
262BSins_diag	src/BSins_diag.c	/^void	BSins_diag(BSspmat *A)$/
263BSinv_diag_block	src/BSinv_diag_block.c	/^void BSinv_diag_block(BSpar_mat *A, BSprocinfo *pr/
264BSiperm_dvec	src/BSmisc_perm.c	/^void	BSiperm_dvec(FLOAT *in_vec, FLOAT *out_vec, B/
265BSiperm_ivec	src/BSmisc_perm.c	/^void	BSiperm_ivec(int *in_vec, int *out_vec, BSper/
266BSloc2glob	src/BSmap.c	/^void BSloc2glob(int length,int *req_array,int *ans/
267BSlocal_flops	src/BSflops.c	/^double BSlocal_flops()$/
268BSlocal_nnz	src/BSnumbers.c	/^int BSlocal_nnz(BSpar_mat *pA)$/
269BSlocal_num_cliques	src/BSnumbers.c	/^int BSlocal_num_cliques(BSpar_mat *pA)$/
270BSlocal_num_inodes	src/BSnumbers.c	/^int BSlocal_num_inodes(BSpar_mat *pA)$/
271BSlow2high	src/BSlow2high.c	/^BSnumbering *BSlow2high(BSspmat *A, BSnumbering *n/
272BSmain_perm	src/BSmain_perm.c	/^BSpar_mat *BSmain_perm(BSprocinfo *procinfo, BSspm/
273BSmain_reperm	src/BSmain_reperm.c	/^void BSmain_reperm(BSprocinfo *procinfo, BSspmat */
274BSmake_off_map	src/BSmap.c	/^BSoff_map *BSmake_off_map(int offset, BSprocinfo */
275BSmat_subtract	src/BSmat_subtract.c	/^void	BSmat_subtract(BSspmat *A, BSspmat *B, FLOAT /
276BSmem_clean	src/BSspace.c	/^void	BSmem_clean(BSMBlock **B)$/
277BSmy_rand	src/BSmy_rand.c	/^int	BSmy_rand(int seed)$/
278BSnonlocalnz	src/BScount_nz.c	/^int	BSnonlocalnz(BSspmat *A,int *max_row_len,BSpro/
279BSnum2distr	src/BSnum2distr.c	/^BSdistribution *BSnum2distr(BSnumbering *numbering/
280BSnum2perm	src/BSnum2perm.c	/^BSpermutation	*BSnum2perm(BSnumbering *numbering, /
281BSnum_colors	src/BSnumbers.c	/^int BSnum_colors(BSpar_mat *pA)$/
282BSnz_2_inode	src/BSnz_2_inode.c	/^void BSnz_2_inode(BSspmat *A, BSsprow **perm_rows,/
283BSoff_gnum	src/BSoff_gnum.c	/^BSnumbering	*BSoff_gnum(BSnumbering *offset, BSnum/
284BSoffset	src/BSoffset.c	/^int BSoffset(int length, int *array, int **offsets/
285BSorig_inode	src/BSorig_inode.c	/^void BSorig_inode(BSpar_mat *A, BSprocinfo *procin/
286BSpack_n_send	src/BSpack_n_send.c	/^void BSpack_n_send(BSmsg_list *msg_list, int n_msg/
287BSpar_bcg	src/BSpar_bcg.c	/^int BSpar_bcg(int num_cols, FLOAT *rhs, FLOAT *x, /
288BSpar_bip	src/BSpar_bip.c	/^void BSpar_bip(int num_cols, FLOAT *vec1, FLOAT *v/
289BSpar_gmres	src/BSpar_gmres.c	/^int BSpar_gmres(int BS, BSpar_mat *A, BSpar_mat *f/
290BSpar_ip	src/BSpar_ip.c	/^FLOAT BSpar_ip(int num_cols, FLOAT *vec1, FLOAT *v/
291BSpar_isolve	src/BSpar_isolve.c	/^int BSpar_isolve(BSpar_mat *A, BSpar_mat *fact_A, /
292BSpar_solve	src/BSpar_solve.c	/^int BSpar_solve(BSpar_mat *A, BSpar_mat *fact_A, B/
293BSpar_sym_solve	src/BSpar_sym_solve.c	/^int BSpar_sym_solve(int BS, BSpar_mat *A, BSpar_ma/
294BSpar_symmlq	src/BSpar_symmlq.c	/^int BSpar_symmlq(int num_cols, FLOAT *rhs, FLOAT */
295BSperm2iperm	src/BSmisc_perm.c	/^void	BSperm2iperm(BSpermutation *permutation, BSpe/
296BSperm_dvec	src/BSmisc_perm.c	/^void	BSperm_dvec(FLOAT *in_vec, FLOAT *out_vec, BS/
297BSperm_ivec	src/BSmisc_perm.c	/^void	BSperm_ivec(int *in_vec, int *out_vec, BSperm/
298BSperm_rows	src/BSperm_rows.c	/^BSkey_arr *BSperm_rows(BSspmat *A, BSnumbering *gn/
299BSpost_bb	src/BSbulletin.c	/^void	BSpost_bb(BSbb *bb, int length, int *address,/
300BSpost_bb_d	src/BSbulletin_d.c	/^void	BSpost_bb_d(BSbb_d *bb, int length, int *addr/
301BSpost_noaddr_bb	src/BSbulletin.c	/^void	BSpost_noaddr_bb(BSbb *bb, int length, int *i/
302BSpost_noaddr_bb_d	src/BSbulletin_d.c	/^void	BSpost_noaddr_bb_d(BSbb_d *bb, int length, FL/
303BSprint_log	src/BSinit.c	/^int BSprint_log(BSprocinfo *procinfo)$/
304BSquery_match_bb	src/BSbulletin.c	/^void	BSquery_match_bb(BSbb *bb, int length, int *a/
305BSquery_match_bb_d	src/BSbulletin_d.c	/^void	BSquery_match_bb_d(BSbb_d *bb, int length, in/
306BSquery_nomatch_bb	src/BSbulletin.c	/^void	BSquery_nomatch_bb(BSbb *bb, int length, int /
307BSquery_nomatch_bb_d	src/BSbulletin_d.c	/^void	BSquery_nomatch_bb_d(BSbb_d *bb, int length, /
308BSrem_diag	src/BSrem_diag.c	/^void	BSrem_diag(BSspmat *A)$/
309BSreset_permutation	src/BSallc_perm.c	/^void	BSreset_permutation(int length, BSpermutation/
310BSrow_err_check	src/BSrow_err_check.c	/^void BSrow_err_check(BSspmat *A, BSprocinfo *proci/
311BSrow_perm	src/BSrow_perm.c	/^BSsprow **BSrow_perm(BSspmat *A, BSpermutation *ip/
312BSrows_2_inode	src/BSrows_2_inode.c	/^int BSrows_2_inode(BSspmat *A, BSnumbering *gnum, /
313BSsave_diag	src/BSsave_diag.c	/^void BSsave_diag(BSpar_mat *A, BSprocinfo *procinf/
314BSsbfree	src/BSspace.c	/^void BSsbfree(double *p, BSMBlock **B)$/
315BSsbinit	src/BSspace.c	/^BSMBlock *BSsbinit(long base_size, int num_units)$/
316BSsbmalloc	src/BSspace.c	/^double *BSsbmalloc(BSMBlock **B )$/
317BSscale_diag	src/BSscale_diag.c	/^void BSscale_diag(BSpar_mat *A, FLOAT *sc_diag, BS/
318BSsdo_color	src/BSsdo_color.c	/^void BSsdo_color(int *sdo_queue, int n_queue, BSsp/
319BSset_diag	src/BSset_diag.c	/^void BSset_diag(BSpar_mat *A, FLOAT my_alpha, BSpr/
320BSset_diagv	src/BSset_diagv.c	/^void BSset_diagv(BSpar_mat *A, FLOAT *diag, BSproc/
321BSset_mat_icc_storage	src/BScontext.c	/^void	BSset_mat_icc_storage(BSspmat *A, int storage/
322BSset_mat_symmetric	src/BScontext.c	/^void	BSset_mat_symmetric(BSspmat *A, int sym)$/
323BSsetup_block	src/BSsetup_block.c	/^void BSsetup_block(BSpar_mat *A, BScomm *comm, int/
324BSsetup_factor	src/BSsetup_factor.c	/^BScomm *BSsetup_factor(BSpar_mat *A, BSprocinfo *p/
325BSsetup_forward	src/BSsetup_forward.c	/^BScomm *BSsetup_forward(BSpar_mat *A, BSprocinfo */
326BSsort_rows	src/BSsort_rows.c	/^void BSsort_rows(BSspmat *A, BSpermutation *perm, /
327BStrans_perm_cl	src/BStrans_perm_cl.c	/^BScl_2_inode *BStrans_perm_cl(BSspmat *A, BSnumber/
328BStrans_perm_in	src/BStrans_perm_in.c	/^BSinode_list *BStrans_perm_in(BSspmat *A, BSnumber/
329BStri_mult	src/BStri_mult.c	/^void BStri_mult(BSpar_mat *A, BScomm *comm_A, BSpa/
330BStri_solve	src/BStri_solve.c	/^void BStri_solve(BSpar_mat *A, BSpar_mat *fact_A, /
331BSupdate_hessenberg	src/BSpar_gmres.c	/^void BSupdate_hessenberg(int i,int n,int BS,FLOAT /
332BSupdt_matrix	src/BSfactorn.c	/^void BSupdt_matrix(BStree inode_tree,int len,int n/
333BSupdt_matrix1	src/BSfactor1.c	/^void BSupdt_matrix1(BStree inode_tree,int len,int /
334BSx_color	src/BSx_color.c	/^void BSx_color(int *local_color, BSspmat *A, BSpro/
335DROP_KEY_IN_TREE	src/BSrows_2_inode.c	/^#define DROP_KEY_IN_TREE(tree,keyval,row_val,row_l/
336INSERT	src/BScontract.c	/^#define	INSERT(len,row,val,pos) \\$/
337TRUE_MSG_LEN	src/BMcomp_msg.c	/^#define TRUE_MSG_LEN(msg_len) \\$/
338TrDebugLevel	src/BStrmalloc.c	/^int  TrDebugLevel(int level )$/
339TrDump	src/BStrmalloc.c	/^int TrDump( FILE *fp )$/
340TrDumpGrouped	src/BStrmalloc.c	/^int TrDumpGrouped(FILE *fp )$/
341TrFree	src/BStrmalloc.c	/^int TrFree( void *aa, int line, char *file )$/
342TrImerge	src/BStrmalloc.c	/^TRSPACE *TrImerge(TRSPACE * l1,TRSPACE * l2 )$/
343TrIsort	src/BStrmalloc.c	/^TRSPACE *TrIsort( TRSPACE * head,int n )$/
344TrMalloc	src/BStrmalloc.c	/^void *TrMalloc(unsigned int a, int lineno, char *f/
345TrSortBlocks	src/BStrmalloc.c	/^int TrSortBlocks()$/
346TrSpace	src/BStrmalloc.c	/^int TrSpace( double *space, double *fr, double *ma/
347TrValid	src/BStrmalloc.c	/^int TrValid(int line,char *file )$/
348Mdown	examples/pargrid.h	/^#define Mdown(grid,procinfo) (((Mzpos(grid,procinf/
349Meast	examples/pargrid.h	/^#define Meast(grid,procinfo) (Mzpos(grid,procinfo)/
350Mmaster0	examples/master0.c	/^int main(int argc, char **argv)$/
351Mmaster1	examples/master1.c	/^int main(int argc, char **argv)$/
352Mmaster2	examples/master2.c	/^int main(int argc, char **argv)$/
353Mmaster3	examples/master3.c	/^int main(int argc, char **argv)$/
354Mmaster4	examples/master4.c	/^int main(int argc, char **argv)$/
355Mmaster5	examples/master5.c	/^int main(int argc, char **argv)$/
356Mmaster6	examples/master6.c	/^int main(int argc, char **argv)$/
357Mmaster7	examples/master7.c	/^int main(int argc, char **argv)$/
358Mmaster8	examples/master8.c	/^int main(int argc, char **argv)$/
359Mnorth	examples/pargrid.h	/^#define Mnorth(grid,procinfo) (Mzpos(grid,procinfo/
360Mrecv_border_msg	examples/pargrid.h	/^#define Mrecv_border_msg(points,intype,x1,x2,y1,y2/
361Msend_border_msg	examples/pargrid.h	/^#define Msend_border_msg(msg_list,points,msg,msg_t/
362Msouth	examples/pargrid.h	/^#define Msouth(grid,procinfo) (Mzpos(grid,procinfo/
363Mup	examples/pargrid.h	/^#define Mup(grid,procinfo) (((Mzpos(grid,procinfo)/
364Mwest	examples/pargrid.h	/^#define Mwest(grid,procinfo) (Mzpos(grid,procinfo)/
365Mxpos	examples/pargrid.h	/^#define Mxpos(grid,procinfo) (procinfo->my_id % gr/
366Mypos	examples/pargrid.h	/^#define Mypos(grid,procinfo) ((procinfo->my_id \/ g/
367Mzpos	examples/pargrid.h	/^#define Mzpos(grid,procinfo) (procinfo->my_id \/ (g/
368ex3_freeg2l	examples/map3.c	/^void ex3_freeg2l(int *data)$/
369ex3_freel2g	examples/map3.c	/^void ex3_freel2g(int *data)$/
370ex3_glob2loc	examples/map3.c	/^void ex3_glob2loc(int length, int *req_array, int /
371ex3_glob2proc	examples/map3.c	/^void ex3_glob2proc(int length, int *req_array, int/
372ex3_loc2glob	examples/map3.c	/^void ex3_loc2glob(int length,int *req_array,int *a/
373free_grid	examples/free_grid.c	/^void free_grid(par_grid *grid)$/
374get_mat	examples/get_mat.c	/^BSspmat *get_mat(par_grid *grid, BSprocinfo *proci/
375get_mat3d	examples/get_mat3d.c	/^BSspmat *get_mat3d(par_grid *grid, BSprocinfo *pro/
376num_grid3d	examples/num_grid3d.c	/^void num_grid3d(par_grid *grid, BSprocinfo *procin/
377worker	examples/worker0.c	/^void worker(par_grid *grid, BSprocinfo *procinfo)$/
378write_mat_matlab	examples/write_mat_matlab.c	/^void	write_mat_matlab(char *str, BSspmat *A, BSpro/
379write_vec_matlab	examples/write_mat_matlab.c	/^void	write_vec_matlab(char *str,FLOAT *x,BSspmat */
380write_vec_matlab2	examples/write_mat_matlab.c	/^void	write_vec_matlab2(char *str,FLOAT *x,BSpar_ma/
381BLAS	doc/manual/sec1.tex	/^dense BLAS (the Basic Linear Algebra Subroutines)$/
382BMcomp\_ms	doc/manual/sec2.tex	/^The routines in {\\tt BMcomp\\_msg()} build data str/
383BSctx\_prin	doc/manual/sec3.tex	/^{\\tt BSctx\\_print()}.\\findex{BSctx_print()}$/
384BSctx\_set\_	doc/manual/sec3.tex	/^{\\tt BSctx\\_set\\_id()}\\findex{BSctx_set_id()}.$/
385BSctx\_set\_e	doc/manual/sec3.tex	/^{\\tt BSctx\\_set\\_err()}\\findex{BSctx_set_err()}.$/
386BSctx\_set\_gue	doc/manual/sec3.tex	/^{\\tt BSctx\\_set\\_guess()}\\findex{BSctx_set_guess()/
387BSctx\_set\_max\	doc/manual/sec3.tex	/^{\\tt BSctx\\_set\\_max\\_it()}\\findex{BSctx_set_max_i/
388BSctx\_set\_meth	doc/manual/sec3.tex	/^{\\tt BSctx\\_set\\_method()}\\findex{BSctx_set_method/
389BSctx\_set\_num\_	doc/manual/sec3.tex	/^{\\tt BSctx\\_set\\_num\\_rhs()}\\findex{BSctx_set_num_/
390BSctx\_set\_p	doc/manual/sec3.tex	/^{\\tt BSctx\\_set\\_pre()}\\findex{BSctx_set_pre()}.$/
391BSctx\_set\_print\_	doc/manual/sec3.tex	/^{\\tt BSctx\\_set\\_print\\_log()}\\findex{BSctx_set_pr/
392BSctx\_set\_resta	doc/manual/sec3.tex	/^{\\tt BSctx\\_set\\_restart()}\\findex{BSctx_set_resta/
393BSctx\_set\_scali	doc/manual/sec3.tex	/^To change this value, {\\tt BSctx\\_set\\_scaling()}$/
394BSctx\_set\_t	doc/manual/sec3.tex	/^{\\tt BSctx\\_set\\_tol()}\\findex{BSctx_set_tol()}.$/
395BSctx_set_scaling	doc/manual/sec3.tex	/^may be called.\\findex{BSctx_set_scaling()}$/
396BSforward	doc/manual/sec2.tex	/^routine {\\tt BSforward()}.\\findex{BSforward()}$/
397BSmain\_per	doc/manual/sec3.tex	/^{\\tt BSmain\\_perm()}\\findex{BSmain_perm()}.$/
398BSpar\_isolv	doc/manual/sec3.tex	/^or {\\tt BSpar\\_isolve()}\\findex{BSpar_isolve()}.$/
399BSpar\_solv	doc/manual/sec3.tex	/^{\\tt BSpar\\_solve()}\\findex{BSpar_solve()} $/
400BSprint\_lo	doc/manual/sec3.tex	/^information when the routine {\\tt BSprint\\_log()}$/
401BSprint_log	doc/manual/sec3.tex	/^\\findex{BSprint_log()} is called.$/
402BSscale\_dia	doc/manual/sec3.tex	/^{\\tt BSscale\\_diag()}\\findex{BSscale_diag()} must /
403BSsetup\_bloc	doc/manual/sec3.tex	/^{\\tt BSsetup\\_block()}\\findex{BSsetup_block()} is /
404BSsetup\_forwar	doc/manual/sec2.tex	/^{\\tt BSsetup\\_forward()}.\\findex{BSsetup_forward()/
405ILU	doc/manual/sec5.tex	/^and solve the resulting system with GMRES precondi/
406Jacobi	doc/manual/sec2.tex	/^factorization, SSOR ($\\omega = 1)$, and block Jaco/
407MPI\_Comm\_ra	doc/manual/sec3.tex	/^The default setting is given by the routine {\\tt M/
408MPI\_Comm\_si	doc/manual/sec3.tex	/^The default setting is given by the routine {\\tt M/
409MPI\_Irsen	doc/manual/sec2.tex	/^{\\tt MPI\\_Irsend()}, to be used, and$/
410SUMAA3d	doc/manual/sec9.tex	/^The SUMAA3d (Scalable Unstructured Mesh Algorithms/
411Science	doc/manual/title.tex	/^\\hspace*{3.9in}Computer Science (UC-405)$/
412accordingly	doc/manual/sec6.tex	/^it will detect an error and return accordingly (if/
413blocking	doc/manual/sec6.tex	/^\\BS\\ can be compiled so that it does not use block/
414color	doc/manual/sec5.tex	/^absolute value is the row number of the color (les/
415communicator	doc/manual/sec3.tex	/^communicator (using {\\tt MPI\\_Comm\\_dup()}) to ens/
416computation	doc/manual/sec7.tex	/^the \\BS\\ data structure used for parallel computat/
417data	doc/manual/sec6.tex	/^vector data (although not matrix data) to use the /
418declares	doc/manual/sec2.tex	/^declares (via function calls in {\\tt BMcomp\\_msg()/
419element	doc/manual/sec4.tex	/^diagonal element (the value of this element could /
420executable	doc/manual/body.tex	/^and program executable (e.g., approximately 4 MByt/
421flops	doc/manual/sec6.tex	/^flops (floating-point operations) are being logged/
422function	doc/manual/sec4.tex	/^is passed into the local to global mapping functio/
423handling	doc/manual/sec6.tex	/^error checking, and special case handling (overloa/
424is	doc/manual/sec2.tex	/^For these algorithms it is (for the most part) a s/
425machines	doc/manual/sec7.tex	/^This feature is necessary because certain machines/
426mapping	doc/manual/sec4.tex	/^to set up and perform this mapping (details on the/
427memory	doc/manual/sec6.tex	/^expense of more memory (because the message buffer/
428names	doc/manual/sec7.tex	/^BLAS and LAPACK routines require the single-precis/
429node	doc/manual/sec2.tex	/^at the same geometric node$/
430nodes	doc/manual/sec2.tex	/^Identical nodes (i-nodes) typically exist when mul/
431nonblocking	doc/manual/sec6.tex	/^the nonblocking (asynchronous) send is the functio/
432nonumber	doc/manual/sec5.tex	/^\\begin{equation} \\nonumber$/
433occurs	doc/manual/sec6.tex	/^defined in the file {\\tt include\/BSdepend.h}, then/
434processors	doc/manual/sec2.tex	/^data from some subset of the processors (hopefully/
435sends	doc/manual/sec7.tex	/^no blocking sends (see \\S\\ref{sec:misc} or the inc/
436specified	doc/manual/sec3.tex	/^been specified (see \\S\\ref{sec:misc}$/
437storage	doc/manual/sec4.tex	/^standard compressed row storage (CRS) scheme for s/
438structure	doc/manual/sec1.tex	/^symmetric in structure (but not necessarily in $/
439symmetric	doc/manual/sec5.tex	/^inform \\BS\\ whether the matrix is symmetric (even /
440system	doc/manual/sec6.tex	/^system (a RS 6000 370 processor).$/
441that	doc/manual/sec5.tex	/^As an aside, we note that (for the incomplete Chol/
442total	doc/manual/sec6.tex	/^nonzeros locally assigned to a processor and the t/
443values	doc/manual/sec2.tex	/^array of integer values (matrix indices).$/
444