/external/webkit/WebCore/rendering/style/ |
ContentData.cpp | 39 ContentData* last = 0; local 43 c->m_next = last; 44 last = c; 46 for (c = last; c; c = n) {
|
/frameworks/base/media/libdrm/mobile2/src/util/ustl-1.0/ |
ualgobase.cpp | 152 void copy_backward_fast (const void* first, const void* last, void* result) 156 size_t nBytes (distance (first, last)); 158 size_t nHeadBytes = uintptr_t(last) % 4; 159 last = advance (last, -1); 161 movsb (last, nHeadBytes, result); 165 last = advance (last, -3); 167 movsd (last, nMiddleBlocks, result); 170 movsb (last, nBytes, result) [all...] |
umultimap.h | 74 const_iterator first (begin()), last (end()); 75 while (first != last) { 76 const_iterator mid = advance (first, distance (first,last) / 2); 80 last = mid; 89 const_iterator first (begin()), last (end()); 90 while (first != last) { 91 const_iterator mid = advance (first, distance (first,last) / 2); 93 last = mid; 97 return (last);
|
ustring.cpp | 178 void string::insert (const uoff_t ip, const wchar_t* first, const wchar_t* last, const size_type n) 181 size_type nti = distance (first, last), bti = 0; 209 /// Inserts [first,last] \p n times. 210 string::iterator string::insert (iterator start, const_pointer first, const_pointer last, size_type n) 212 assert (first <= last); 214 assert ((first < begin() || first >= end() || size() + abs_distance(first,last) < capacity()) && "Insertion of self with autoresize is not supported"); 215 start = iterator (memblock::insert (memblock::iterator(start), distance(first, last) * n)); 216 fill (memblock::iterator(start), first, distance(first, last), n); 242 void string::replace (iterator first, iterator last, const_pointer s) 246 replace (first, last, s, s + strlen(s)) [all...] |
/external/bluetooth/glib/glib/ |
glist.c | 120 GList *last; local 128 last = g_list_last (list); 129 /* g_assert (last != NULL); */ 130 last->next = new_list; 131 new_list->prev = last; 157 * list = g_list_prepend (list, "last"); 274 GList *last; local 276 last = list; 277 while (last->next) 278 last = last->next 479 GList *last; local 512 GList *last; local [all...] |
/external/srec/portable/src/ |
pmemory.c | 84 * Pointer to last memory allocation associated with the same tag. 86 struct MemoryData_t* last; member in struct:MemoryData_t 107 * Last memory allocation associated with this tag. 110 MemoryData* last; member in struct:MemMapEntry_t 191 gMemoryMap[idx].last = NULL; 418 if (e->last != NULL && e->last == data) 419 e->last = data->last; 420 if (data->last != NULL [all...] |
/external/stlport/test/eh/ |
test_insert.h | 96 key_iterator last = EH_STD::unique( keys.begin(), keys.end() ); local 99 for ( key_iterator tmp = keys.begin(); tmp != last; ++tmp ) 452 Iter first, Iter last, sequence_container_tag ) 457 c_inst.insert( pos, first, last ); 462 Iter first, Iter last, associative_container_tag ) 464 c.insert( first, last ); 468 void do_insert_range( C& c, Position, Iter first, Iter last, multiset_tag ) 470 c.insert( first, last ); 474 void do_insert_range( C& c, Position, Iter first, Iter last, multimap_tag ) 476 c.insert( first, last ); [all...] |
/external/opencore/oscl/oscl/osclbase/src/ |
oscl_vector.h | 127 * Removes the last element. 155 * Erases elements in range [first, last). 159 * @param last ending position, this position is not erased 161 OSCL_IMPORT_REF OsclAny* erase(OsclAny* first, OsclAny* last) ; 201 OsclAny* move(OsclAny* first, OsclAny* last, OsclAny* result) ; 203 OsclAny* copy(OsclAny* first, OsclAny* last, OsclAny* result) ; 205 OsclAny* uninitialized_copy(OsclAny* first, OsclAny* last, OsclAny* result) ; 208 void destroy(OsclAny* first, OsclAny* last) ; 353 * Returns the last element. 361 * Returns the last element [all...] |
/external/webkit/WebCore/rendering/ |
CounterNode.cpp | 69 CounterNode* last = m_lastChild; local 70 if (!last) 73 while (CounterNode* lastChild = last->m_lastChild) 74 last = lastChild; 76 return last; 174 CounterNode* last = newChild->m_lastChild; local 183 // counter node being created, it will be inserted as the last child so next is null. 188 last->m_nextSibling = next; 190 next->m_previousSibling = last; 192 m_lastChild = last; [all...] |
/external/e2fsprogs/lib/uuid/ |
gen_uuid.c | 266 THREAD_LOCAL struct timeval last = {0, 0}; local 310 last.tv_sec = tv1; 311 last.tv_usec = tv2; 316 if ((last.tv_sec == 0) && (last.tv_usec == 0)) { 319 last = tv; 320 last.tv_sec--; 325 if ((tv.tv_sec < last.tv_sec) || 326 ((tv.tv_sec == last.tv_sec) && 327 (tv.tv_usec < last.tv_usec))) [all...] |
/external/e2fsprogs/lib/ext2fs/ |
res_gdt.c | 127 unsigned int grp, last = 0; local 171 if (!gdt_buf[last]) { 174 expect, grp, gdt_blk, last); 176 gdt_buf[last] = expect; 179 } else if (gdt_buf[last] != expect) { 182 gdt_buf[last], expect, gdt_blk, last); 187 last++;
|
/external/kernel-headers/original/linux/ |
efs_fs_i.h | 45 __be32 di_atime; /* time last accessed */ 46 __be32 di_mtime; /* time last modified */
|
/external/kernel-headers/original/linux/netfilter_ipv4/ |
ip_nat.h | 22 /* position of the last TCP sequence number 25 /* sequence number offset before and after last modification */
|
/build/tools/rgb2565/ |
to565.c | 104 unsigned short last, color, count; local 111 if ((color == last) && (count != 65535)) { 116 write(1, &last, 2); 120 last = color; 125 write(1, &last, 2);
|
/external/icu4c/samples/break/ |
break.cpp | 58 int32_t end = boundary.last(); 75 /* Print the last element */ 78 int32_t end = boundary.last(); 130 //print last element 131 puts("----- last: --------------");
|
/external/skia/src/core/ |
SkTSearch.cpp | 147 static void SkQSort_Partition(char* first, char* last, size_t elemSize, SkQSortCompareProc compare) 150 char* rite = last; 155 while (left < last && compare(left, pivot) < 0) 172 if (left < last) 173 SkQSort_Partition(left, last, elemSize, compare);
|
/external/v8/test/cctest/ |
test-ast.cc | 46 CHECK_EQ(node, list->last()); 65 CHECK_EQ(1, list.last()); 71 CHECK_EQ(3, list.last()); 74 CHECK_EQ(2, list.last()); 82 CHECK_EQ(j, list.last());
|
/external/zlib/contrib/ada/ |
buffer_demo.adb | 14 -- of exactly the correct size is used for decompressed data, and the last 54 pragma Assert (I = Source'Last); 64 -- (because this demonstrates the problem - the last block passed will 74 -- This makes sure that the last block contains 89 (Total_Out (Decompressor) + 1 .. Uncompressed_Data'Last),
|
/packages/experimental/procstatlog/ |
procstatreport.py | 178 last = last_state.get("/proc/stat:cpu", "").split() 180 if last and next: 181 stime = sum([int(next[x]) - int(last[x]) for x in [2, 5, 6]]) 182 utime = sum([int(next[x]) - int(last[x]) for x in [0, 1]]) 183 idle = sum([int(next[x]) - int(last[x]) for x in [3, 4]]) 227 last = int(last_state.get(key, -1)) 229 if last != -1 and next != -1: 231 total_time += next - last 232 total_cycles += (next - last) * speed 263 last = int(last_state.get("/proc/stat:ctxt", -1) [all...] |
/external/astl/include/ |
list | 193 // Removes last element. Invalidated the iterators/references to 194 // the last element. 217 // Remove a range of elements [first, last) 219 // @param last Iterator pointing to one past the last element to be removed. 220 // @return An iterator pointing to the elt next to 'last' or end(). 221 iterator erase(iterator first, iterator last); 272 typename list<_T>::iterator list<_T>::erase(iterator first, iterator last) { 273 while (first != last) { 276 return last; [all...] |
/external/clearsilver/util/ |
wildmat.c | 22 ** '\0'.) The last return has ABORT instead of FALSE to avoid quadratic 25 ** only the last one does. 61 register int last; local 100 for (last = *p; *++p && *p != ']'; last = *p) 103 ? *text <= *++p && *text >= last : *text == *p) 125 register int last; local 164 for (last = toupper(*p); *++p && *p != ']'; last = toupper(*p)) 167 ? toupper(*text) <= toupper(*++p) && toupper(*text) >= last : toupper(*text) == toupper(*p) [all...] |
/external/skia/include/core/ |
SkPath.h | 196 /** Set the beginning of the next contour relative to the last point on the 207 /** Add a line from the last point to the specified point (x,y). If no 216 /** Add a line from the last point to the specified point. If no moveTo() 226 /** Same as lineTo, but the coordinates are considered relative to the last 237 /** Add a quadratic bezier from the last point, approaching control point 248 /** Add a quadratic bezier from the last point, approaching control point 259 /** Same as quadTo, but the coordinates are considered relative to the last 263 @param dx1 The amount to add to the x-coordinate of the last point on 265 @param dy1 The amount to add to the y-coordinate of the last point on 267 @param dx2 The amount to add to the x-coordinate of the last point o [all...] |
/external/zlib/examples/ |
gun.c | 43 encountered in an input file, it is the last stream in that file. 152 last = have ? (have--, (int)(*next++)) : -1) 199 int last; /* last byte read by NEXT(), or -1 if EOF */ local 208 unsigned end; /* last valid entry in prefix/suffix tables */ 211 unsigned final; /* last character written for previous code */ 222 if (last == -1) 246 final = prev = (unsigned)last; /* low 8 bits of code */ 249 if (last & 1) { /* code must be < 256 */ 253 rem = (unsigned)last >> 1; /* remaining 7 bits * 376 int ret, first, last; local [all...] |
/external/webkit/WebKit/android/jni/ |
PictureSet.cpp | 86 Pictures* last = mPictures.end(); local 87 for (Pictures* working = mPictures.begin(); working != last; working++) 107 Pictures* last = mPictures.end(); local 110 for (working = last; working != first; ) { 162 for (working = first; working != last; working++) { 176 Pictures* last = mPictures.end(); local 177 for (working = mPictures.begin(); working != last; working++) { 211 Pictures* last = mPictures.end(); local 212 for (Pictures* working = mPictures.begin(); working != last; working++) { 224 Pictures* last = mPictures.end() local 313 const Pictures* last = mPictures.end(); local 442 const Pictures* last = mPictures.end(); local 489 const Pictures* last = src.mPictures.end(); local 541 const Pictures* last = mPictures.end(); local [all...] |
/external/opencore/codecs_v2/video/m4v_h263/dec/src/ |
vlc_decode.cpp | 875 pTcoef->last = (uint) tab->last; //(tab->val >> 16) & 1; 884 //if (((tab->run<<8)|(tab->level)|(tab->last<<16)) == VLC_ESCAPE_CODE) 922 pTcoef->last = (uint)tab->last; //(tab->val >> 16) & 1; 926 if ((pTcoef->last == 0 && pTcoef->run > 14) || (pTcoef->last == 1 && pTcoef->run > 20)) 930 pTcoef->level = pTcoef->level + intra_max_level[pTcoef->last][pTcoef->run]; 974 pTcoef->last = (uint)tab->last; //(tab->val >> 16) & 1 [all...] |