59 	if(ic->map)  in iinit()
60 		free(ic->map);  in iinit()
61 	ic->map = malloc(sizeof(Imap)*ic->nino);  in iinit()
62 	if(ic->map == 0){  in iinit()
67 	for(m = ic->map; m < &ic->map[ic->nino]; m++){  in iinit()
93 			m = &ic->map[ino];  in iinit()
158 		ic->map[b->ino].b = 0;  in ialloc()
161 	m = &ic->map[ino];  in ialloc()
174 		ic->map[b->ino].b = 0;  in ifree()
191 	for(m = ic->map, me = &ic->map[ic->nino]; m < me; m++)  in iget()
200 				iupdate(ic, m - ic->map, qid);  in iget()
209 		return iread(ic, m - ic->map);  in iget()
219 		if(iremove(ic, m - ic->map) < 0)  in iget()
229 		qid.path, qid.vers, m - ic->map);  in iget()
230 	b = ialloc(ic, m - ic->map);  in iget()
257 	m = &ic->map[ino];  in iread()
310 	lruref(&ic->mlru, &ic->map[b->ino]);  in iwrite()
338 	m = &ic->map[ino];  in iupdate()
366 	m = &ic->map[ino];  in iremove()
406 	ic->map[b->ino].qid = b->inode.qid;  in iinc()