HomeSort by relevance Sort by last modified time
    Searched full:last (Results 1126 - 1150 of 13702) sorted by null

<<41424344454647484950>>

  /frameworks/base/libs/hwui/
PathTessellator.cpp 193 const Vertex* last = &(perimeter[perimeter.size() - 1]); local
195 vec2 lastNormal(current->position[1] - last->position[1],
196 last->position[0] - current->position[0]);
215 last = current;
243 const int last = vertices.size() - 1; local
248 - (vertices[last].position[0] - vertices[last - 1].position[0]),
249 vertices[last].position[1] - vertices[last - 1].position[1]);
273 vertices[last].position[0] + endRadialOffset.x
337 const Vertex* last = &(perimeter[perimeter.size() - 1]); local
576 const Vertex* last = &(vertices[0]); local
646 const Vertex* last = &(perimeter[perimeter.size() - 1]); local
    [all...]
  /external/llvm/include/llvm/CodeGen/
LiveVariables.h 59 /// and the set of non-phi instructions that are the last users of the value.
72 /// PHI nodes complicate things a bit. If a PHI node is the last user of a
76 /// situation where a value is defined in a block, and the last use is a phi
88 /// Kills - List of MachineInstruction's which are the last use of this
136 // PhysRegInfo - Keep track of which instruction was the last def of a
141 // PhysRegInfo - Keep track of which instruction was the last use of a
154 /// the last use of the whole register.
165 /// FindLastRefOrPartRef - Return the last reference or partial reference of
169 /// FindLastPartialDef - Return the last partial def of the specified
  /external/srec/srec/cfront/
spec_anl.c 69 the last sample value is stored in lastx.
221 int last; local
232 last = freqobj->cut_off_above;
236 if (last >= num_freq)
237 last = num_freq - 1;
243 ASSERT(density[last] >= 0);
244 peak = density[last];
245 for (i = last - 1; i >= first; i--)
258 for (i = first + 1; i <= last; i++)
  /external/valgrind/main/VEX/switchback/
binary_switchback.pl 46 print " last_good = last known good bb (search space minimum)\n";
47 print " last_bad = last known bad bb (search space maximum)\n";
227 if ($line =~ /^---STOP---$/) { last; } # we're done
281 last;
342 last;
376 # This our last run-through?
380 last; # Get outta here
401 print "Getting output for last bad bb:\n";
418 print "*** Failure: Last failed switchback bb: $N_LAST_BAD ***\n";
  /external/zlib/src/contrib/ada/
test.adb 87 Last : out Stream_Element_Offset);
154 exit when Left_Last < Left_Buffer'Last;
167 Last : Stream_Element_Offset;
170 Read (Source, Buffer, Last);
171 Write (Target, Buffer (1 .. Last));
173 exit when Last < Buffer'Last;
183 Last : out Stream_Element_Offset) is
185 Read (File_In, Item, Last);
  /hardware/qcom/display/libhwcomposer/
hwc.cpp 146 uint32_t last = list->numHwLayers - 1; local
147 hwc_layer_1_t *fbLayer = &list->hwLayers[last];
174 uint32_t last = list->numHwLayers - 1; local
175 hwc_layer_1_t *fbLayer = &list->hwLayers[last];
358 uint32_t last = list->numHwLayers - 1; local
359 hwc_layer_1_t *fbLayer = &list->hwLayers[last];
373 //always. Last layer is always FB
406 uint32_t last = list->numHwLayers - 1; local
407 hwc_layer_1_t *fbLayer = &list->hwLayers[last];
  /libcore/luni/src/main/java/java/text/
SimpleDateFormat.java 281 int next, last = -1, count = 0; local
288 validateFormat((char) last);
291 if (last == next) {
292 last = -1;
294 last = next;
300 && (last == next || (next >= 'a' && next <= 'z') || (next >= 'A' && next <= 'Z'))) {
301 if (last == next) {
305 validateFormat((char) last);
307 last = next;
312 validateFormat((char) last);
526 int next, last = -1, count = 0; local
1017 int next, last = -1, count = 0, offset = position.getIndex(); local
    [all...]
  /libcore/luni/src/main/java/org/apache/harmony/xnet/provider/jsse/
HandshakeIODataStream.java 94 // position of the last byte to read + 1
202 + "the last oubound message had been sent."));
238 // position in the buffer where the last write session has begun
279 * @param long: the value to be written (last byte)
288 * @param long: the value to be written (last 2 bytes)
298 * @param long: the value to be written (last 3 bytes)
309 * @param long: the value to be written (last 4 bytes)
403 * except last message
415 * except last message
  /external/chromium/chrome/browser/sessions/
session_service.h 36 // SessionService supports restoring from the last session. The last session
37 // typically corresponds to the last run of the browser, but not always. For
40 // the last session and the current session reset. This is done to provide the
70 // Moves the current session to the last session. This is useful when a
155 // Fetches the contents of the last session, notifying the callback when
416 // When the user closes the last window, where the last window is the
417 // last tabbed browser and no more tabbed browsers are open with the same
423 // Set of tabs that have been closed by way of the last window or last ta
    [all...]
  /external/chromium/third_party/libjingle/source/talk/base/
stringencode.cc 518 size_t last = 0;
521 if (i != last) {
522 fields->push_back(source.substr(last, i - last));
524 last = i + 1;
527 if (last != source.length()) {
528 fields->push_back(source.substr(last, source.length() - last));
537 size_t last = 0;
540 fields->push_back(source.substr(last, i - last))
    [all...]
  /external/eigen/Eigen/src/OrderingMethods/
Amd.h 122 Index* last = perm.indices().data(); /* use P as workspace for last */ local
135 last[i] = -1;
169 if(head[d] != -1) last[head[d]] = i;
179 if(next[k] != -1) last[next[k]] = -1;
235 if(next[i] != -1) last[next[i]] = last[i];
236 if(last[i] != -1) /* remove i from degree list */
238 next[last[i]] = next[i];
336 last[i] = h; /* save hash of i in last[i] *
    [all...]
  /external/jpeg/
jdmainct.c 43 * groups does not. Some garbage sample rows may be included in the last iMCU
58 * context rows are manufactured by duplicating the first or last real sample
70 * To provide the desired context, we have to retain the last two row groups
71 * of one iMCU row while reading in the next iMCU row. (The last row group
73 * and so we have to save the next-to-last group too for its above-context.)
91 * We read alternate iMCU rows using each master pointer; thus the last two
99 * the first or last sample row as necessary (this is cheaper than copying
220 /* In the second list, put the last four row groups in swapped order */
267 /* Change the pointer lists to duplicate the last sample row at the bottom
291 /* Duplicate the last real sample row rgroup*2 times; this pads out th
    [all...]
  /external/libnfc-nci/src/nfc/int/
rw_int.h 86 #define RW_T1T_SUBSTATE_WAIT_NDEF_UPDATED 0x0A /* waiting for response of writing last part of NDEF Msg */
140 tT1T_CMD_RSP_INFO *p_cmd_rsp_info; /* Pointer to Command rsp info of last sent command */
155 UINT8 ndef_final_block[T1T_BLOCK_SIZE]; /* Buffer for ndef last block */
158 UINT8 block_read; /* Last read Block */
159 UINT8 write_byte; /* Index of last written byte */
165 UINT8 ndef_block_written; /* Last block where NDEF bytes are written */
166 UINT8 num_ndef_finalblock; /* Block number where NDEF's last byte will be present */
259 #define RW_T2T_SUBSTATE_WAIT_WRITE_NDEF_LAST_BLOCK 0x0F /* waiting for rsp to last NDEF block write cmd */
312 tT2T_CMD_RSP_INFO *p_cmd_rsp_info; /* Pointer to Command rsp info of last sent command */
326 UINT8 ndef_final_block[T2T_BLOCK_SIZE]; /* Buffer for ndef last block *
    [all...]
  /external/libvorbis/vq/
vqgen.c 14 last mod: $Id: vqgen.c 16037 2009-05-26 21:10:58Z xiphmont $
178 float last=0.f; local
180 if(mindel>_now(v,j)[k]-last)mindel=_now(v,j)[k]-last;
181 if(maxdel<_now(v,j)[k]-last)maxdel=_now(v,j)[k]-last;
182 if(q->sequencep)last=_now(v,j)[k];
200 float last=0; local
203 float now=rint((val-last-mindel)/delta);
217 if(q->sequencep)last=(now*delta)+mindel+last
230 float last=0.f; local
    [all...]
  /external/libxslt/libxslt/
templates.c 517 ret->children = ret->last = NULL;
543 ret->last = ret->children = text;
619 xmlAttrPtr attr, copy, last; local
635 last = target->properties;
636 while (last->next != NULL)
637 last = last->next;
639 last = NULL;
695 if (last == NULL) {
697 last = copy
    [all...]
  /external/qemu/distrib/jpeg-6b/
jdmainct.c 43 * groups does not. Some garbage sample rows may be included in the last iMCU
58 * context rows are manufactured by duplicating the first or last real sample
70 * To provide the desired context, we have to retain the last two row groups
71 * of one iMCU row while reading in the next iMCU row. (The last row group
73 * and so we have to save the next-to-last group too for its above-context.)
91 * We read alternate iMCU rows using each master pointer; thus the last two
99 * the first or last sample row as necessary (this is cheaper than copying
220 /* In the second list, put the last four row groups in swapped order */
267 /* Change the pointer lists to duplicate the last sample row at the bottom
291 /* Duplicate the last real sample row rgroup*2 times; this pads out th
    [all...]
  /external/webkit/Source/WebCore/editing/
VisibleSelection.cpp 283 // Edge case: If the caret is after the last word in a soft-wrapped line or the last word in
284 // the document, select that last word (LeftWordIfOnBoundary).
285 // Edge case: If the caret is after the last word in a paragraph, select from the the end of the
286 // last word to the line break (also RightWordIfOnBoundary);
306 // The paragraph break after the last paragraph in the last cell of a block table ends
356 // The paragraph break after the last paragraph in the last cell of a block table ends
360 // There is no parargraph break after the last paragraph in the last cell of an inline table
486 VisiblePosition last = lastEditablePositionBeforePositionInRoot(m_end, baseRoot); local
    [all...]
  /external/webkit/Source/WebCore/rendering/
RenderBlockLineLayout.cpp 100 // Check to see if our last midpoint is a start point beyond the line break. If so,
218 // the last item on the line.
228 // Get the last box we made for this render object.
345 // be the last continuation of our line list.
363 // Return the last line.
527 expansionOpportunities.last()--;
1289 RootInlineBox* last = 0; local
1411 RootInlineBox* last = 0; local
1833 RenderObject* last = o; local
1997 width.applyOverhang(toRenderRubyRun(o), last, next); local
    [all...]
  /frameworks/base/tools/layoutlib/bridge/src/android/graphics/
Path_Delegate.java 576 * Set the beginning of the next contour relative to the last point on the
592 * Add a line from the last point to the specified point (x,y).
604 * Same as lineTo, but the coordinates are considered relative to the last
623 * Add a quadratic bezier from the last point, approaching control point
637 * Same as quadTo, but the coordinates are considered relative to the last
641 * @param dx1 The amount to add to the x-coordinate of the last point on
643 * @param dy1 The amount to add to the y-coordinate of the last point on
645 * @param dx2 The amount to add to the x-coordinate of the last point on
647 * @param dy2 The amount to add to the y-coordinate of the last point on
662 * Add a cubic bezier from the last point, approaching control point
727 Point2D last = mPath.getCurrentPoint(); local
    [all...]
  /external/libnfc-nci/src/nfc/ndef/
ndef_utils.c 161 /* This may be the last guy in a chunk. */
199 /* The last record should have the ME bit set */
329 /* If this is the last record, return NULL */
409 ** Description This function gets a pointer to the last record in the
412 ** Returns Pointer to the start of the last record, or NULL if some problem
498 /* If this was the last record, return NULL */
527 /* If this is the last record in the message, return NULL */
559 /* If this was the last record, return NULL */
617 /* If this was the last record, return NULL */
646 /* If this is the last record in the message, return NULL *
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/
stl_map.h 207 * @param last An input iterator.
209 * Create a %map consisting of copies of the elements from [first,last).
211 * otherwise (where N is distance(first,last)).
221 * @param last An input iterator.
225 * Create a %map consisting of copies of the elements from [first,last).
227 * otherwise (where N is distance(first,last)).
322 * Returns a read/write iterator that points one past the last
331 * Returns a read-only (constant) iterator that points one past the last
340 * Returns a read/write reverse iterator that points to the last pair in
350 * last pair in the %map. Iteration is done in descending orde
    [all...]
stl_multimap.h 204 * @param last An input iterator.
207 * [first,last). This is linear in N if the range is already sorted,
208 * and NlogN otherwise (where N is distance(first,last)).
218 * @param last An input iterator.
223 * [first,last). This is linear in N if the range is already sorted,
224 * and NlogN otherwise (where N is distance(first,last)).
319 * Returns a read/write iterator that points one past the last pair in
328 * Returns a read-only (constant) iterator that points one past the last
337 * Returns a read/write reverse iterator that points to the last pair in
347 * last pair in the %multimap. Iteration is done in descending orde
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/
stl_map.h 207 * @param last An input iterator.
209 * Create a %map consisting of copies of the elements from [first,last).
211 * otherwise (where N is distance(first,last)).
221 * @param last An input iterator.
225 * Create a %map consisting of copies of the elements from [first,last).
227 * otherwise (where N is distance(first,last)).
322 * Returns a read/write iterator that points one past the last
331 * Returns a read-only (constant) iterator that points one past the last
340 * Returns a read/write reverse iterator that points to the last pair in
350 * last pair in the %map. Iteration is done in descending orde
    [all...]
stl_multimap.h 204 * @param last An input iterator.
207 * [first,last). This is linear in N if the range is already sorted,
208 * and NlogN otherwise (where N is distance(first,last)).
218 * @param last An input iterator.
223 * [first,last). This is linear in N if the range is already sorted,
224 * and NlogN otherwise (where N is distance(first,last)).
319 * Returns a read/write iterator that points one past the last pair in
328 * Returns a read-only (constant) iterator that points one past the last
337 * Returns a read/write reverse iterator that points to the last pair in
347 * last pair in the %multimap. Iteration is done in descending orde
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
stl_map.h 207 * @param last An input iterator.
209 * Create a %map consisting of copies of the elements from [first,last).
211 * otherwise (where N is distance(first,last)).
221 * @param last An input iterator.
225 * Create a %map consisting of copies of the elements from [first,last).
227 * otherwise (where N is distance(first,last)).
322 * Returns a read/write iterator that points one past the last
331 * Returns a read-only (constant) iterator that points one past the last
340 * Returns a read/write reverse iterator that points to the last pair in
350 * last pair in the %map. Iteration is done in descending orde
    [all...]

Completed in 1332 milliseconds

<<41424344454647484950>>