Lines Matching defs:pos
39 Item *rem = pos;
43 pos = pos->next;
51 Item *item = pos;
54 assert(pos != term);
56 pos = pos->next;
67 ins->next = pos->next;
68 ins->prev = pos;
69 pos->next->prev = ins;
70 pos->next = ins;
72 if (pos == term)
156 bool Interval::contains(int pos) const
158 for (Range *r = head; r && r->bgn <= pos; r = r->next)
159 if (r->end > pos)
317 int pos = max;
323 pos = ffs(~data[i]) - 1;
324 if (pos >= 0)
332 pos = ffs(~b) - 1;
333 if (pos >= 0)
344 pos = ffs(~b) - 1;
345 if (pos >= 0)
360 for (pos = 0; pos < 32; pos += count)
361 if (!(data[i] & (m << pos)))
363 if (pos < 32)
369 // If we couldn't find a position, we can have a left-over -1 in pos. Make
371 if (pos < 0)
374 pos += i * 32;
376 return ((pos + count) <= max) ? pos : -1;
386 int pos = ffs(bits) - 1;
387 bits &= ~(1 << pos);
388 INFO(" %i", i * 32 + pos);