Lines Matching defs:it

11  * you can redistribute it and/or modify it under the terms of the GNU
13 * Foundation, in version 2 as it comes in the "COPYING" file of the
15 * hope that it will be useful, but WITHOUT ANY WARRANTY of any kind.
44 * Get our IP address and put it in our_addr
127 * @note This will LEAVE the critical section of the zone and RE-ENTER it
153 struct item *it;
169 it = LIST_FIRST(&zone->free_items);
170 Assert(it->magic == ITEM_MAGIC);
173 rc = zone->pfInit(zone->pData, (void *)&it[1], zone->size, M_DONTWAIT);
177 LIST_REMOVE(it, list);
178 LIST_INSERT_HEAD(&zone->used_items, it, list);
180 ret = (void *)&it[1];
200 * it into sub-zone conforming chunks.
210 it = &((struct item *)sub_area)[-1];
211 /* It's the chunk descriptor of the master zone, we should remove it
214 Assert((it->zone && it->zone->magic == ZONE_MAGIC));
215 RTCritSectEnter(&it->zone->csZone);
217 LIST_REMOVE(it, list);
218 RTCritSectLeave(&it->zone->csZone);
221 memset(it, 0, sizeof(struct item));
222 it->zone = zone;
223 it->magic = ITEM_MAGIC;
224 LIST_INSERT_HEAD(&zone->free_items, it, list);
226 LogRel(("NAT: zone(%s) has reached it maximum\n", zone->name));
235 struct item *it;
243 it = &((struct item *)item)[-1];
244 LogFlowFunc(("ENTER: item:%p(%R[mzoneitem]), size:%d, flags:%RX8\n", item, it, size, flags));
245 Assert(it->magic == ITEM_MAGIC);
246 zone = it->zone;
248 Assert((*(uint32_t *)(((uint8_t *)&it[1]) + zone->size) == 0xabadbabe));
252 LIST_REMOVE(it, list);
261 LIST_INSERT_HEAD(&zone->free_items, it, list);
329 struct item *it;
335 it = (struct item *)(((uint8_t *)zone->area) + i*(sizeof(struct item) + zone->size + sizeof(uint32_t)));
336 it->magic = ITEM_MAGIC;
337 it->zone = zone;
338 *(uint32_t *)(((uint8_t *)&it[1]) + zone->size) = 0xabadbabe;
339 LIST_INSERT_HEAD(&zone->free_items, it, list);
362 struct item *it = NULL;
367 it = (struct item *)mem; /* 1st element */
371 Assert(it[-1].magic == ITEM_MAGIC);
372 LogFlowFunc(("LEAVE: %p\n", &it[-1].ref_count));
373 return &it[-1].ref_count;
410 struct item *it;
420 it = &((struct item *)mem)[-1];
421 Assert((it->magic == ITEM_MAGIC));
422 Assert((zone->magic == ZONE_MAGIC && zone == it->zone));
442 struct item *it;
451 it = LIST_FIRST(&zone->free_items);
452 Assert((it->magic == ITEM_MAGIC));
455 LIST_REMOVE(it, list);
459 it->zone = master_zone;
462 LIST_INSERT_HEAD(&master_zone->free_items, it, list);
472 /** @todo (vvl) make it wiser */