| /external/chromium_org/third_party/harfbuzz-ng/src/ |
| H A D | hb-utf-private.hh | 41 next (const uint8_t *text, function in struct:hb_utf_t
119 if (likely (next (text, end, unicode, replacement) == end))
140 next (const uint16_t *text, function in struct:hb_utf_t
189 if (likely (next (text, end, unicode, replacement) == end))
213 next (const uint32_t *text, function in struct:hb_utf_t
235 next (text - 1, text, unicode, replacement);
|
| /external/chromium_org/third_party/icu/source/common/ |
| H A D | uenumimp.h | 61 * This function returns the next element as a UChar *,
67 * @return next element as UChar *,
78 * This function returns the next element as a char *,
84 * @return next element as char *,
124 UEnumNext *next; member in struct:UEnumeration
145 * when a UEnumeration is defined with 'next' pointing to this
|
| /external/chromium_org/third_party/icu/source/i18n/ |
| H A D | fpositer.cpp | 88 UBool FieldPositionIterator::next(FieldPosition& fp) { function in class:FieldPositionIterator
|
| H A D | regeximp.cpp | 26 UChar32 CaseFoldingUTextIterator::next() { function in class:CaseFoldingUTextIterator
31 // Start handling the next char from the input UText.
74 UChar32 CaseFoldingUCharIterator::next() { function in class:CaseFoldingUCharIterator
79 // Start handling the next char from the input UText.
|
| /external/chromium_org/third_party/icu/source/test/intltest/ |
| H A D | tokiter.cpp | 26 UBool TokenIterator::next(UnicodeString& token, UErrorCode& ec) { function in class:TokenIterator
55 * Read the next token from 'this->line' and append it to 'token'.
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/draw/ |
| H A D | draw_vs_llvm.c | 15 * next paragraph) shall be included in all copies or substantial portions
72 struct draw_llvm_variant_list_item *next = next_elem(li); local
74 li = next;
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| H A D | u_mm.h | 38 struct mem_block *next, *prev; member in struct:mem_block
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/ |
| H A D | memory_pool.c | 11 * The above copyright notice and this permission notice (including the next
35 struct memory_block * next; member in struct:memory_block
48 pool->blocks = block->next;
62 newblock->next = pool->blocks;
90 block->next = pool->blocks;
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/r600/ |
| H A D | compute_memory_pool.h | 9 * The above copyright notice and this permission notice (including the next
44 struct compute_memory_item* next; member in struct:compute_memory_item
|
| /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i915/ |
| H A D | intel_resolve_map.c | 11 * The above copyright notice and this permission notice (including the next
41 struct intel_resolve_map **tail = &head->next;
50 tail = &(*tail)->next;
55 (*tail)->next = NULL;
70 struct intel_resolve_map *item = head->next;
76 item = item->next;
89 elem->prev->next = elem->next;
90 if (elem->next)
91 elem->next
101 struct intel_resolve_map *next = head->next; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/ |
| H A D | intel_resolve_map.c | 11 * The above copyright notice and this permission notice (including the next
41 struct intel_resolve_map **tail = &head->next;
50 tail = &(*tail)->next;
55 (*tail)->next = NULL;
70 struct intel_resolve_map *item = head->next;
76 item = item->next;
89 elem->prev->next = elem->next;
90 if (elem->next)
91 elem->next
101 struct intel_resolve_map *next = head->next; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/intel/ |
| H A D | intel_resolve_map.c | 11 * The above copyright notice and this permission notice (including the next
41 struct intel_resolve_map **tail = &head->next;
50 tail = &(*tail)->next;
55 (*tail)->next = NULL;
70 struct intel_resolve_map *item = head->next;
76 item = item->next;
89 elem->prev->next = elem->next;
90 if (elem->next)
91 elem->next
101 struct intel_resolve_map *next = head->next; local
[all...] |
| H A D | intel_resolve_map.h | 11 * The above copyright notice and this permission notice (including the next
80 struct intel_resolve_map *next; member in struct:intel_resolve_map
|
| /external/chromium_org/third_party/mesa/src/src/mesa/main/ |
| H A D | mm.h | 36 struct mem_block *next, *prev; member in struct:mem_block
|
| /external/chromium_org/third_party/npapi/npspy/include/ |
| H A D | epmanager.h | 50 InstanceList * next; member in struct:InstanceList
59 PluginEntryPointList * next; member in struct:PluginEntryPointList
|
| /external/chromium_org/third_party/skia/include/core/ |
| H A D | SkTRegistry.h | 42 const SkTRegistry* next() const { return fChain; } function in class:SkTRegistry
|
| /external/chromium_org/third_party/skia/src/core/ |
| H A D | SkRefDict.cpp | 83 Impl* next = rec->fNext; local
86 rec = next;
|
| /external/chromium_org/third_party/skia/tests/ |
| H A D | SListTest.cpp | 13 SListEntry* next() { return getSListNext(); } function in class:SListEntry
41 SListEntry* next = list.head(); local
48 if (NULL == next) {
52 if (next!= value) {
56 next = next->next();
58 if (next) {
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| H A D | heap-profile-stats.h | 15 // are implemented with the member "HeapProfileBucket* next".
49 HeapProfileBucket* next; // Next entry in hash-table. member in struct:HeapProfileBucket
|
| H A D | stack_trace_table.cc | 86 b = b->next;
103 b->next = table_[idx];
135 b = b->next;
149 Bucket* next = b->next; local
151 b = next;
|
| H A D | stack_trace_table.h | 71 Bucket* next; member in struct:tcmalloc::StackTraceTable::Bucket
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| H A D | stack_trace_table.cc | 86 b = b->next;
103 b->next = table_[idx];
135 b = b->next;
149 Bucket* next = b->next; local
151 b = next;
|
| H A D | stack_trace_table.h | 71 Bucket* next; member in struct:tcmalloc::StackTraceTable::Bucket
|
| /external/chromium_org/third_party/webrtc/modules/audio_coding/neteq/ |
| H A D | delay_peak_detector_unittest.cc | 62 int next = 1; // Start with the second packet to get a proper IAT. local
63 while (next < kNumPackets) {
64 while (next < kNumPackets && arrival_times_ms[next] <= time) {
65 int iat_packets = (arrival_times_ms[next] - arrival_times_ms[next - 1]) /
75 ++next;
108 int next = 1; // Start with the second packet to get a proper IAT. local
109 while (next < kNumPackets) {
110 while (next < kNumPacket
[all...] |
| /external/chromium_org/v8/src/ |
| H A D | circular-queue-inl.h | 62 Entry* next = entry + 1; local
63 if (next == &buffer_[L]) return buffer_;
64 return next;
|