71   int n1, nexp, l, iq, iu[10], iv[10];  in mapd()  local
76   void node(int is, int n1, int nexp, int& l, int& iq, int iu[], int iv[]);  in mapd()
80   for (nexp = 1, i = 0; i<n; nexp *= 2, i++);   /* nexp=2**n */  in mapd()
84   dr = nexp;  in mapd()
95       dr = mne / nexp;  in mapd()
102       dr = dd + (dd - 1) / (nexp - 1);  in mapd()
111       is = nexp - 1; d = 0.0;  in mapd()
114       d = d*nexp;  in mapd()
119     node(i, n1, nexp, l, iq, iu, iv);  in mapd()
142     if (is == (nexp - 1)) i = -1;  in mapd()
157 void node(int is, int n1, int nexp, int& l, int& iq, int iu[], int iv[])  in node()  argument
170   else if (is == (nexp - 1)) {  in node()
180     iff = nexp;  in node()