HomeSort by relevance Sort by last modified time
    Searched defs:last (Results 176 - 200 of 2364) sorted by null

1 2 3 4 5 6 78 91011>>

  /external/libevent/
minheap-internal.h 100 struct event *last = s->p[--s->n]; local
102 /* we replace e with the last element in the heap. We might need to
107 if (e->ev_timeout_pos.min_heap_idx > 0 && min_heap_elem_greater(s->p[parent], last))
108 min_heap_shift_up_(s, e->ev_timeout_pos.min_heap_idx, last);
110 min_heap_shift_down_(s, e->ev_timeout_pos.min_heap_idx, last);
  /external/llvm/lib/CodeGen/
ScoreboardHazardRecognizer.cpp 88 unsigned last = Depth - 1; local
89 while ((last > 0) && ((*this)[last] == 0))
90 last--;
92 for (unsigned i = 0; i <= last; i++) {
  /external/mesa3d/src/gallium/drivers/svga/
svga_tgsi_decl_sm30.c 520 unsigned last = decl->Range.Last; local
523 for( idx = first; idx <= last; idx++ ) {
  /external/mesa3d/src/gallium/state_trackers/vega/
vgu.c 269 VGfloat last = startAngle + angleExtent; local
297 while (angle < last) {
311 coords[i+3] = x+cos(DEGREES_TO_RADIANS(last))*width/2;
312 coords[i+4] = y+sin(DEGREES_TO_RADIANS(last))*height/2;
320 while (angle > last) {
334 coords[i+3] = x + cos(DEGREES_TO_RADIANS(last)) * width/2;
335 coords[i+4] = y + sin(DEGREES_TO_RADIANS(last)) * height/2;
  /external/mesa3d/src/mesa/drivers/dri/i965/
brw_fs_channel_expressions.cpp 277 ir_expression *last = NULL; local
287 if (last) {
288 last = new(mem_ctx) ir_expression(ir_binop_add,
291 last);
293 last = temp;
296 assign(ir, 0, last);
309 ir_expression *last = NULL; local
325 if (last) {
326 last = new(mem_ctx) ir_expression(join,
329 last);
    [all...]
  /external/mesa3d/src/mesa/program/
prog_cache.c 48 struct cache_item *last; member in struct:gl_program_cache
88 cache->last = NULL;
114 cache->last = NULL;
177 if (cache->last &&
178 memcmp(cache->last->key, key, keysize) == 0) {
179 return cache->last->program;
187 cache->last = c;
  /external/owasp/sanitizer/src/main/org/owasp/html/
Trie.java 66 * @param end an index into punctuationStrings past the last string in this
87 int last = -1; local
90 if (ch != last) {
92 last = ch;
  /external/parameter-framework/upstream/remote-processor/
Message.cpp 65 auto last = first + size; local
68 std::copy(first, last, destFirst);
78 auto last = first + size; local
81 std::copy(first, last, destFirst);
  /external/parameter-framework/upstream/utility/test/
utility.cpp 62 const auto &last = end(test.input); variable
63 REQUIRE(join(first, last, test.binaryOpt, test.empty) == test.result);
64 REQUIRE(join<int>(first, last, test.binaryOpt) == test.resultNoEmpty);
  /external/pdfium/third_party/freetype/src/base/
ftbbox.c 39 FT_Vector last; member in struct:TBBox_Rec_
72 /* in `user->last'. We also update bbox in case contour starts with */
90 user->last = *to;
104 /* in `user->last'; no further computations are necessary because */
120 user->last = *to;
206 BBox_Conic_Check( user->last.x,
213 BBox_Conic_Check( user->last.y,
219 user->last = *to;
404 BBox_Cubic_Check( user->last.x,
413 BBox_Cubic_Check( user->last.y
    [all...]
  /external/pdfium/third_party/zlib_v128/
inffast.c 73 z_const unsigned char FAR *last; /* have enough input while in < last */ local
100 last = in + (strm->avail_in - 5);
307 } while (in < last && out < end);
318 strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last));
  /external/protobuf/gtest/include/gtest/internal/
gtest-linked_ptr.h 33 // particular object is kept on a circular linked list. When the last pointer
36 // Used properly, this deletes the object when the last reference goes away.
119 // last member of the circle. Once this is done, you can join() another.
178 bool last = link_.depart(); local
179 assert(last);
  /external/protobuf/src/google/protobuf/stubs/
stringpiece.cc 126 const char* last = ptr_ + std::min(ulen - s.length_, pos) + s.length_; local
127 const char* result = std::find_end(ptr_, last, s.ptr_, s.ptr_ + s.length_);
128 return result != last ? result - ptr_ : npos;
  /external/regex-re2/util/
benchmark.cc 96 int n, last; local
106 last = n;
112 n = max(last+1, min(n+n/2, 100*last));
  /external/selinux/libsepol/cil/src/
cil_list.c 173 struct cil_list_item *last = item; local
183 while (last->next != NULL) {
184 last = last->next;
189 list->tail = last;
194 list->tail = last;
200 struct cil_list_item *last = item; local
210 while (last->next != NULL) {
211 last = last->next
    [all...]
  /external/selinux/libsepol/src/
hashtab.c 108 hashtab_ptr_t cur, last; local
114 last = NULL;
117 last = cur;
124 if (last == NULL)
127 last->next = cur->next;
254 hashtab_ptr_t last, cur, temp; local
260 last = NULL;
265 if (last) {
266 last->next = cur->next;
278 last = cur
    [all...]
sidtab.c 90 sidtab_node_t *cur, *last; local
96 last = NULL;
99 last = cur;
106 if (last == NULL)
109 last->next = cur->next;
174 sidtab_node_t *last, *cur, *temp; local
180 last = NULL;
185 if (last) {
186 last->next = cur->next;
197 last = cur
    [all...]
  /external/selinux/policycoreutils/newrole/
hashtab.c 87 hashtab_ptr_t cur, last; local
93 last = NULL;
96 last = cur;
103 if (last == NULL)
106 last->next = cur->next;
233 hashtab_ptr_t last, cur, temp; local
239 last = NULL;
244 if (last) {
245 last->next = cur->next;
257 last = cur
    [all...]
  /external/skia/src/pathops/
SkPathOpsSimplify.cpp 61 SkOpSpanBase* last = current->markAndChaseDone(start, end); local
62 if (last && !last->chased()) {
63 last->setChased(true);
64 SkASSERT(!SkPathOpsDebug::ChaseContains(chase, last));
65 *chase.append() = last;
67 SkDebugf("%s chase.append id=%d", __FUNCTION__, last->segment()->debugID());
68 if (!last->final()) {
69 SkDebugf(" windSum=%d", last->upCast()->windSum());
  /external/skia/third_party/harfbuzz/
hb-ot-shape-complex-indic-machine.hh 1395 unsigned int last = 0; local
    [all...]
hb-ot-shape-complex-myanmar-machine.hh 273 if (0) fprintf (stderr, "syllable %d..%d %s\n", last, p+1, #syllable_type); \
274 for (unsigned int i = last; i < p+1; i++) \
276 last = p+1; \
302 unsigned int last = 0; local
hb-ot-shape-complex-use-machine.hh 299 if (0) fprintf (stderr, "syllable %d..%d %s\n", last, p+1, #syllable_type); \
300 for (unsigned int i = last; i < p+1; i++) \
302 last = p+1; \
328 unsigned int last = 0; local
  /external/slf4j/log4j-over-slf4j/src/main/java/org/apache/log4j/
NDC.java 72 int last = next - 1; local
73 String key = PREFIX + last;
84 int last = next - 1; local
85 String key = PREFIX + last;
  /external/swiftshader/third_party/LLVM/lib/CodeGen/
ScoreboardHazardRecognizer.cpp 87 unsigned last = Depth - 1; local
88 while ((last > 0) && ((*this)[last] == 0))
89 last--;
91 for (unsigned i = 0; i <= last; i++) {
  /external/syslinux/com32/lib/zlib/
inffast.c 73 unsigned char FAR *last; /* while in < last, enough input available */ local
100 last = in + (strm->avail_in - 5);
307 } while (in < last && out < end);
318 strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last));

Completed in 1442 milliseconds

1 2 3 4 5 6 78 91011>>