Searched defs:prev (Results 201 - 225 of 904) sorted by relevance

1234567891011>>

/external/valgrind/main/perf/
H A Dmany-loss-records.c93 struct Chunk *prev = NULL; local
99 new->child = prev;
100 prev = new;
/external/wpa_supplicant_8/hostapd/src/ap/
H A Dap_list.c25 /* AP list is a double linked list with head->prev pointing to the end of the
67 ap->prev = iface->ap_list->prev;
68 iface->ap_list->prev = ap;
70 ap->prev = ap;
81 ap->prev->next = ap->next;
84 ap->next->prev = ap->prev;
86 iface->ap_list->prev = ap->prev;
131 struct ap_info *ap, *prev; local
[all...]
H A Dpeerkey_auth.c372 struct wpa_stsl_negotiation *pos, *prev; local
377 prev = NULL;
380 if (prev)
381 prev->next = pos->next;
389 prev = pos;
H A Dpreauth_auth.c135 struct rsn_preauth_interface *piface, *prev; local
140 prev = piface;
142 l2_packet_deinit(prev->l2);
143 os_free(prev->ifname);
144 os_free(prev);
/external/wpa_supplicant_8/hostapd/src/eap_peer/
H A Deap_methods.c233 struct eap_method *m, *prev; local
237 prev = NULL;
241 prev = m;
248 if (prev)
249 prev->next = m->next;
/external/wpa_supplicant_8/src/ap/
H A Dap_list.c25 /* AP list is a double linked list with head->prev pointing to the end of the
67 ap->prev = iface->ap_list->prev;
68 iface->ap_list->prev = ap;
70 ap->prev = ap;
81 ap->prev->next = ap->next;
84 ap->next->prev = ap->prev;
86 iface->ap_list->prev = ap->prev;
131 struct ap_info *ap, *prev; local
[all...]
H A Dpeerkey_auth.c372 struct wpa_stsl_negotiation *pos, *prev; local
377 prev = NULL;
380 if (prev)
381 prev->next = pos->next;
389 prev = pos;
H A Dpreauth_auth.c135 struct rsn_preauth_interface *piface, *prev; local
140 prev = piface;
142 l2_packet_deinit(prev->l2);
143 os_free(prev->ifname);
144 os_free(prev);
/external/wpa_supplicant_8/src/eap_peer/
H A Deap_methods.c233 struct eap_method *m, *prev; local
237 prev = NULL;
241 prev = m;
248 if (prev)
249 prev->next = m->next;
/external/wpa_supplicant_8/wpa_supplicant/src/ap/
H A Dap_list.c25 /* AP list is a double linked list with head->prev pointing to the end of the
67 ap->prev = iface->ap_list->prev;
68 iface->ap_list->prev = ap;
70 ap->prev = ap;
81 ap->prev->next = ap->next;
84 ap->next->prev = ap->prev;
86 iface->ap_list->prev = ap->prev;
131 struct ap_info *ap, *prev; local
[all...]
H A Dpeerkey_auth.c372 struct wpa_stsl_negotiation *pos, *prev; local
377 prev = NULL;
380 if (prev)
381 prev->next = pos->next;
389 prev = pos;
H A Dpreauth_auth.c135 struct rsn_preauth_interface *piface, *prev; local
140 prev = piface;
142 l2_packet_deinit(prev->l2);
143 os_free(prev->ifname);
144 os_free(prev);
/external/wpa_supplicant_8/wpa_supplicant/src/eap_peer/
H A Deap_methods.c233 struct eap_method *m, *prev; local
237 prev = NULL;
241 prev = m;
248 if (prev)
249 prev->next = m->next;
/external/bison/lib/
H A Dobstack.h146 struct _obstack_chunk *prev; /* address of prior chunk or NULL */
294 (__o->chunk->prev == 0 \
422 ((h)->chunk->prev == 0 \
145 struct _obstack_chunk *prev; /* address of prior chunk or NULL */ member in struct:_obstack_chunk
/external/ceres-solver/internal/ceres/
H A Dtrust_region_minimizer_test.cc323 int prev = (num_vertices_ + i - 1) % num_vertices_; local
326 const double diff = parameters[prev][dim] - parameters[i][dim];
338 int prev = (num_vertices_ + i - 1) % num_vertices_; local
344 u[dim] = parameters[i][dim] - parameters[prev][dim];
/external/chromium_org/base/allocator/
H A Dallocator_unittest.cc160 AtomicType prev = base::subtle::NoBarrier_CompareAndSwap(&value, 0, 1); local
162 EXPECT_EQ(0, prev);
169 prev = base::subtle::NoBarrier_CompareAndSwap(&value, 0, 5);
171 EXPECT_EQ(k_test_val, prev);
174 prev = base::subtle::NoBarrier_CompareAndSwap(&value, k_test_val, 5);
176 EXPECT_EQ(k_test_val, prev);
/external/chromium_org/base/files/
H A Dfile_proxy_unittest.cc145 bool prev = ThreadRestrictions::SetIOAllowed(false); local
154 ThreadRestrictions::SetIOAllowed(prev);
/external/chromium_org/chrome/browser/ui/app_list/
H A Dextension_app_item.cc204 void ExtensionAppItem::Move(const ExtensionAppItem* prev, argument
206 if (!prev && !next)
214 if (!prev) {
218 prev_id = prev->extension_id();
221 prev_id = prev->extension_id();
223 // Only set |next_id| if on the same page, otherwise just insert after prev.
H A Dextension_app_model_builder.cc349 ExtensionAppItem* prev = NULL; local
353 prev = static_cast<ExtensionAppItem*>(item);
366 if (prev || next)
367 static_cast<ExtensionAppItem*>(item)->Move(prev, next);
/external/chromium_org/components/policy/core/common/cloud/
H A Dcomponent_cloud_policy_store.cc222 std::map<PolicyNamespace, std::string>::iterator prev = it; local
224 cached_hashes_.erase(prev);
/external/chromium_org/net/base/
H A Dfile_stream_unittest.cc761 bool prev = base::ThreadRestrictions::SetIOAllowed(false); local
785 base::ThreadRestrictions::SetIOAllowed(prev);
/external/chromium_org/net/disk_cache/blockfile/
H A Ddisk_format.h142 CacheAddr prev; // LRU list. member in struct:disk_cache::RankingsNode
/external/chromium_org/net/proxy/
H A Dproxy_script_fetcher_impl.cc93 base::TimeDelta prev = max_duration_; local
95 return prev;
99 size_t prev = max_response_bytes_; local
101 return prev;
/external/chromium_org/third_party/WebKit/Source/core/dom/
H A DText.cpp260 const RenderObject* prev = NodeRenderingTraversal::previousSiblingRenderer(this); local
261 if (prev && prev->isBR()) // <span><br/> <br/></span>
266 if (prev && !prev->isInline())
269 if (parent.isRenderBlock() && !parent.childrenInline() && (!prev || !prev->isInline()))
/external/chromium_org/third_party/WebKit/Source/core/rendering/
H A DRenderLineBoxList.cpp324 const InlineFlowBox* prev = 0; local
326 ASSERT(child->prevLineBox() == prev);
327 prev = child;
329 ASSERT(prev == m_lastLineBox);

Completed in 498 milliseconds

1234567891011>>