HomeSort by relevance Sort by last modified time
    Searched defs:next (Results 601 - 625 of 3893) sorted by null

<<21222324252627282930>>

  /external/chromium/net/websockets/
websocket_throttle_unittest.cc 35 struct addrinfo* next) {
50 addrinfo->ai_next = next;
56 struct addrinfo* next; local
57 for (struct addrinfo* a = head; a != NULL; a = next) {
58 next = a->ai_next;
  /external/chromium/testing/gtest/samples/
sample3-inl.h 47 // type E and a pointer to the next node.
56 // Gets the next node in the queue.
57 QueueNode* next() { return next_; } function in class:QueueNode
58 const QueueNode* next() const { return next_; } function in class:QueueNode
61 // Creates a node with a given element value. The next pointer is
88 QueueNode<E>* next = node->next(); local
91 node = next;
93 next = node->next();
    [all...]
  /external/chromium_org/base/debug/
trace_event_impl.cc 129 size_t next = oldest_event_index_; variable
131 return GetEventAt(next);
    [all...]
  /external/chromium_org/media/base/
audio_buffer_queue.cc 118 // Next buffer may not have timestamp, so we need to update current
119 // timestamp before switching to the next buffer.
124 BufferQueue::iterator next = current_buffer + 1; local
125 if (next == buffers_.end())
129 current_buffer = next;
seekable_buffer.cc 157 // are preparing for rewind for next iteration.
229 // Next buffer may not have timestamp, so we need to update current
230 // timestamp before switching to the next buffer.
234 BufferQueue::iterator next = current_buffer; local
235 ++next;
237 if (next == buffers_.end())
241 current_buffer = next;
  /external/chromium_org/native_client_sdk/src/libraries/nacl_io/
path.cc 175 size_t next = 0; local
182 while (next != std::string::npos) {
183 next = path.find('/', offs);
186 if (next == offs) {
191 std::string part = path.substr(offs, next - offs);
193 offs = next + 1;
  /external/chromium_org/testing/gtest/samples/
sample3-inl.h 47 // type E and a pointer to the next node.
56 // Gets the next node in the queue.
57 QueueNode* next() { return next_; } function in class:QueueNode
58 const QueueNode* next() const { return next_; } function in class:QueueNode
61 // Creates a node with a given element value. The next pointer is
87 QueueNode<E>* next = node->next(); local
90 node = next;
92 next = node->next();
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/css/
CSSParserValues.cpp 163 OwnPtr<CSSParserSelector> next = selector->m_tagHistory.release(); local
165 if (!next)
167 selector = next.release();
  /external/chromium_org/third_party/WebKit/Source/core/editing/
ModifySelectionListLevel.cpp 95 Node* next = node->nextSibling(); local
102 node = next;
110 Node* next = node->nextSibling(); local
118 node = next;
126 Node* next = node->nextSibling(); local
133 node = next;
  /external/chromium_org/third_party/WebKit/Source/core/html/parser/
HTMLElementStack.h 65 ElementRecord* next() const { return m_next.get(); } function in class:WebCore::HTMLElementStack::ElementRecord
72 void setNext(PassOwnPtr<ElementRecord> next) { m_next = next; }
  /external/chromium_org/third_party/WebKit/Source/core/platform/text/
BidiRunList.h 105 Run* next = m_firstRun; local
106 while (next != run) {
107 current = next;
108 next = current->next();
112 m_firstRun = run->next();
129 Run* next = current->next(); local
130 while (next != run) {
131 current = next;
233 Run* next = curr->next(); local
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/rendering/style/
FillLayer.cpp 164 for (curr = this; curr && curr->isXPositionSet(); curr = curr->next()) { }
167 for (FillLayer* pattern = this; curr; curr = curr->next()) {
173 pattern = pattern->next();
179 for (curr = this; curr && curr->isYPositionSet(); curr = curr->next()) { }
182 for (FillLayer* pattern = this; curr; curr = curr->next()) {
188 pattern = pattern->next();
194 for (curr = this; curr && curr->isAttachmentSet(); curr = curr->next()) { }
197 for (FillLayer* pattern = this; curr; curr = curr->next()) {
199 pattern = pattern->next();
205 for (curr = this; curr && curr->isClipSet(); curr = curr->next()) { }
286 FillLayer* next; local
    [all...]
ShadowData.h 64 const ShadowData* next() const { return m_next.get(); } function in class:WebCore::ShadowData
  /external/chromium_org/third_party/angle_dx11/src/compiler/
PoolAlloc.cpp 99 tHeader* next = inUseList->nextPage; local
102 inUseList = next;
110 tHeader* next = freeList->nextPage; local
112 freeList = next;
257 currentPageOffset = pageSize; // make next allocation come from a new page
  /external/chromium_org/third_party/freetype/src/base/
ftutil.c 253 cur = cur->next;
269 node->next = 0;
273 before->next = node;
290 node->next = after;
312 after = node->next;
315 before->next = after;
336 after = node->next;
342 before->next = after;
350 node->next = list->head;
369 FT_ListNode next = cur->next local
397 FT_ListNode next = cur->next; local
    [all...]
  /external/chromium_org/third_party/icu/source/i18n/
coleitr.cpp 71 * Get the ordering priority of the next character in the string.
72 * @return the next character's ordering. Returns NULLORDER if an error has
75 int32_t CollationElementIterator::next(UErrorCode& status) function in class:CollationElementIterator
  /external/chromium_org/third_party/libwebp/enc/
token.c 56 const VP8Tokens* const next = p->next_; local
58 p = next;
222 const VP8Tokens* const next = p->next_; local
223 const int N = (next == NULL) ? b->left_ : 0;
235 p = next;
  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/draw/
draw_pipe_validate.c 15 * next paragraph) shall be included in all copies or substantial portions
161 struct draw_stage *next = draw->pipeline.rasterize; local
167 /* Set the validate's next stage to the rasterize stage, so that it
170 stage->next = next;
196 draw->pipeline.aaline->next = next;
197 next = draw->pipeline.aaline;
202 draw->pipeline.aapoint->next = next;
    [all...]
  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
u_double_list.h 23 * next paragraph) shall be included in all copies or substantial portions
48 struct list_head *next; member in struct:list_head
54 item->next = item;
60 item->next = list->next;
61 list->next->prev = item;
62 list->next = item;
67 item->next = list;
69 list->prev->next = item;
76 to->next = from->next
    [all...]
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/
lp_state_setup.h 13 struct lp_setup_variant_list_item *next, *prev; member in struct:lp_setup_variant_list_item
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
nv50_ir_target.cpp 175 !fi.end(); fi.next()) {
208 for (IteratorRef it = func->cfg.iteratorCFG(); !it->end(); it->next())
215 Instruction *i, *next; local
246 for (i = bb->getEntry(); i; i = next) {
247 next = i->next;
250 if (next && i->encSize < 8)
253 if ((nShort & 1) && next && getMinEncodingSize(next) == 4) {
254 if (i->isCommutationLegal(i->next)) {
    [all...]
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/
r300_fs.h 13 * The above copyright notice and this permission notice (including the next
56 struct r300_fragment_shader_code* next; member in struct:r300_fragment_shader_code
  /external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/d3d1x/dxgi/src/
dxgi_loader.cpp 75 const char *cur, *next; local
80 next = strchr(cur, ':');
81 len = (next) ? next - cur : strlen(cur);
86 cur = (next) ? next + 1 : NULL;
  /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/
brw_fs_cfg.cpp 11 * The above copyright notice and this permission notice (including the next
81 fs_bblock *next; local
114 next = new_block();
115 next->start = (fs_inst *)inst->next;
116 cur_if->add_successor(mem_ctx, next);
118 set_next_block(next);
124 next = new_block();
125 next->start = (fs_inst *)inst->next;
    [all...]
brw_vec4_reg_allocate.cpp 11 * The above copyright notice and this permission notice (including the next
50 int next; local
72 next = hw_reg_mapping[0] + this->virtual_grf_sizes[0];
75 hw_reg_mapping[i] = next;
76 next += this->virtual_grf_sizes[i];
79 prog_data->total_grf = next;

Completed in 1128 milliseconds

<<21222324252627282930>>