powerpc/aim/slb.c

119 	int idx;
121 	idx = esid2idx(esid, parent->ua_level);
122 	KASSERT(parent->u.ua_child[idx] == NULL, ("Child already exists!"));
130 	idx = esid2idx(esid, child->ua_level);
131 	child->u.slb_entries[idx].slbv = slbv;
132 	child->u.slb_entries[idx].slbe = (esid << SLBE_ESID_SHIFT) | SLBE_VALID;
133 	setbit(&child->ua_alloc, idx);
135 	retval = &child->u.slb_entries[idx];
144 	idx = esid2idx(esid, parent->ua_level);
145 	parent->u.ua_child[idx] = child;
146 	setbit(&parent->ua_alloc, idx);
159 	int idx, level;
161 	idx = esid2idx(esid, parent->ua_level);
162 	child = parent->u.ua_child[idx];
187 	idx = esid2idx(child->ua_base, inter->ua_level);
188 	inter->u.ua_child[idx] = child;
189 	setbit(&inter->ua_alloc, idx);
193 	idx = esid2idx(inter->ua_base, parent->ua_level);
194 	parent->u.ua_child[idx] = inter;
195 	setbit(&parent->ua_alloc, idx);
226 	int idx;
233 		idx = esid2idx(esid, ua->ua_level);
240 			return ((ua->u.slb_entries[idx].slbe & SLBE_VALID) ?
241 			    &ua->u.slb_entries[idx] : NULL);
243 		ua = ua->u.ua_child[idx];
281 	int idx;
298 		idx = esid2idx(esid, ua->ua_level);
301 			ua->u.slb_entries[idx].slbv = slbv;
303 			ua->u.slb_entries[idx].slbe = (esid << SLBE_ESID_SHIFT)
305 			setbit(&ua->ua_alloc, idx);
306 			slb = &ua->u.slb_entries[idx];
310 		next = ua->u.ua_child[idx];
343 	int idx;
353 		idx = esid2idx(esid, ua->ua_level);
355 			ua->u.slb_entries[idx].slbv = 0;
357 			ua->u.slb_entries[idx].slbe = 0;
358 			clrbit(&ua->ua_alloc, idx);
362 		ua = ua->u.ua_child[idx];
376 	int idx;
378 	for (idx = 0; idx < 16; idx++) {
380 			if (ua->u.ua_child[idx] != NULL)
381 				free_slb_tree_node(ua->u.ua_child[idx]);
383 			if (ua->u.slb_entries[idx].slbv != 0)
384 				moea64_release_vsid(ua->u.slb_entries[idx].slbv