/external/wpa_supplicant_8/wpa_supplicant/src/ap/ |
H A D | ap_list.h | 15 /* Note: next/prev pointers are updated whenever a new beacon is 19 struct ap_info *prev; /* previous entry in AP list */ member in struct:ap_info
|
H A D | ieee802_11_auth.c | 67 struct hostapd_cached_radius_acl *prev; local 70 prev = acl_cache; 72 hostapd_acl_cache_free_entry(prev); 343 struct hostapd_cached_radius_acl *prev, *entry, *tmp; local 345 prev = NULL; 353 if (prev) 354 prev->next = entry->next; 364 prev = entry; 373 struct hostapd_acl_query_data *prev, *entry, *tmp; local 375 prev 482 struct hostapd_acl_query_data *query, *prev; local 632 struct hostapd_acl_query_data *query, *prev; local 652 struct hostapd_sta_wpa_psk_short *prev = psk; local [all...] |
/external/wpa_supplicant_8/hostapd/src/ap/ |
H A D | ieee802_11_auth.c | 67 struct hostapd_cached_radius_acl *prev; local 70 prev = acl_cache; 72 hostapd_acl_cache_free_entry(prev); 343 struct hostapd_cached_radius_acl *prev, *entry, *tmp; local 345 prev = NULL; 353 if (prev) 354 prev->next = entry->next; 364 prev = entry; 373 struct hostapd_acl_query_data *prev, *entry, *tmp; local 375 prev 482 struct hostapd_acl_query_data *query, *prev; local 632 struct hostapd_acl_query_data *query, *prev; local 652 struct hostapd_sta_wpa_psk_short *prev = psk; local [all...] |
/external/wpa_supplicant_8/src/ap/ |
H A D | ieee802_11_auth.c | 67 struct hostapd_cached_radius_acl *prev; local 70 prev = acl_cache; 72 hostapd_acl_cache_free_entry(prev); 343 struct hostapd_cached_radius_acl *prev, *entry, *tmp; local 345 prev = NULL; 353 if (prev) 354 prev->next = entry->next; 364 prev = entry; 373 struct hostapd_acl_query_data *prev, *entry, *tmp; local 375 prev 482 struct hostapd_acl_query_data *query, *prev; local 632 struct hostapd_acl_query_data *query, *prev; local 652 struct hostapd_sta_wpa_psk_short *prev = psk; local [all...] |
/external/libvncserver/x11vnc/ |
H A D | macosxCGS.c | 411 char prev, curr; local 432 prev = whist[whist_prv][win]; 436 } else if ( !(prev & is_mapped) && (curr & is_mapped)) { 438 if (0) fprintf(stderr, "MapNotify: %d/%d %d %.4f tot=%d\n", prev, curr, win, dnowx(), totcnt); 442 } else if ( !(curr & is_mapped) && (prev & is_mapped)) { 444 if (0) fprintf(stderr, "UnmapNotify: %d/%d %d %.4f A tot=%d\n", prev, curr, win, dnowx(), totcnt); 446 } else if ( !(prev & is_exist) && (curr & is_exist)) { 448 if (0) fprintf(stderr, "CreateNotify:%d/%d %d %.4f whist: %d/%d 0x%x tot=%d\n", prev, curr, win, dnowx(), whist_prv, whist_idx, win, totcnt); 451 if (0) fprintf(stderr, "MapNotify: %d/%d %d %.4f tot=%d\n", prev, curr, win, dnowx(), totcnt); 461 } else if (!(prev 490 char prev, curr; local [all...] |
/external/mesa3d/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_util.h | 106 // WARNING: do not use a->prev/next for __item or __list 110 (__item)->prev->next = (__item)->next; \ 111 (__item)->next->prev = (__item)->prev; \ 113 (__item)->prev = (__item); \ 119 (__item)->prev = (__list)->prev; \ 120 (__list)->prev->next = (__item); \ 121 (__list)->prev = (__item); \ 126 (__item)->prev 156 Item *prev; member in class:nv50_ir::DLList::Item [all...] |
/external/javassist/src/main/javassist/bytecode/stackmap/ |
H A D | MapMaker.java | 309 TypedBlock prev = blocks[0]; 310 int offsetDelta = prev.length; 311 if (prev.incoming > 0) { // the first instruction is a branch target. 320 int diffL = stackMapDiff(prev.numLocals, prev.localsTypes, 322 toStackMapBody(writer, bb, diffL, offsetDelta, prev); 324 prev = bb; 336 private boolean isTarget(TypedBlock cur, TypedBlock prev) { argument 343 return prev.stop; 347 int diffL, int offsetDelta, TypedBlock prev) { 346 toStackMapBody(StackMapTable.Writer writer, TypedBlock bb, int diffL, int offsetDelta, TypedBlock prev) argument [all...] |
/external/libusb/libusb/ |
H A D | libusbi.h | 40 struct list_head *prev, *next; member in struct:list_head 71 entry->prev = entry->next = entry; 77 entry->prev = head; 79 head->next->prev = entry; 87 entry->prev = head->prev; 89 head->prev->next = entry; 90 head->prev = entry; 95 entry->next->prev = entry->prev; [all...] |
/external/skia/src/pathops/ |
H A D | SkOpContour.h | 77 SkOpContour* prev = this; local 79 while ((next = prev->next())) { 80 prev = next; 82 prev->setNext(contour); 153 SkASSERT(segment->prev() == prior); 271 SkOpContour* prev = this; local 273 while ((next = prev->next()) != contour) { 275 prev = next; 277 SkASSERT(prev); 278 prev [all...] |
H A D | SkPathOpsPostSect.cpp | 44 SkOpPtT* prev = this; local 46 SkOpPtT* next = prev->fNext; 48 prev->removeNext(this); 50 return prev; 52 prev = next; 53 } while (prev != this); 115 SkOpSpan* oFromSpan = oSpanBase->prev(); 194 SkOpPtT* prev = test; local 202 prev->removeNext(ptT); 203 test = prev; 246 initBase(SkOpSegment* segment, SkOpSpan* prev, double t, const SkPoint& pt) argument 309 SkOpSpan* prev = this->prev(); local 322 init(SkOpSegment* segment, SkOpSpan* prev, double t, const SkPoint& pt) argument [all...] |
/external/apache-xml/src/main/java/org/apache/xalan/templates/ |
H A D | ElemTemplateElement.java | 372 ElemTemplateElement prev = childETE.getPreviousSiblingElem(); 374 prev.m_nextSibling = childETE.m_nextSibling; 404 ElemTemplateElement prev = 407 if (null != prev) 408 prev.m_nextSibling = newChildElem; 449 Node prev = null; 457 if(null != prev) 458 ((ElemTemplateElement)prev).m_nextSibling = 463 continue; // prev remains the same. 467 if(null != prev) [all...] |
/external/skia/src/gpu/ |
H A D | GrTessellatingPathRenderer.cpp | 99 void insert(T* t, T* prev, T* next, T** head, T** tail) { argument 100 t->*Prev = prev; 102 if (prev) { 103 prev->*Next = t; 367 Vertex* prev = v->fPrev; local 370 double ax = static_cast<double>(curr->fPoint.fX) - prev->fPoint.fX; 371 double ay = static_cast<double>(curr->fPoint.fY) - prev->fPoint.fY; 375 data = emit_triangle(prev, curr, next, data); 413 Vertex* prev = fActive->fSide == Poly::kLeft_Side ? local 416 fActive->addVertex(prev, Pol 466 append_point_to_contour(const SkPoint& p, Vertex* prev, Vertex** head, SkChunkAlloc& alloc) argument 482 generate_quadratic_points(const SkPoint& p0, const SkPoint& p1, const SkPoint& p2, SkScalar tolSqd, Vertex* prev, Vertex** head, int pointsLeft, SkChunkAlloc& alloc) argument 507 generate_cubic_points(const SkPoint& p0, const SkPoint& p1, const SkPoint& p2, const SkPoint& p3, SkScalar tolSqd, Vertex* prev, Vertex** head, int pointsLeft, SkChunkAlloc& alloc) argument 548 Vertex* prev = NULL; local 637 new_edge(Vertex* prev, Vertex* next, SkChunkAlloc& alloc, Comparator& c) argument 650 insert_edge(Edge* edge, Edge* prev, EdgeList* edges) argument 664 Edge* prev; local 677 Edge* prev = NULL; local 714 Edge* prev = NULL; local 732 Edge* prev = NULL; local 1012 Vertex* prev = NULL; local [all...] |
/external/jpeg/ |
H A D | ltmain.sh | 69 prev= 88 if test -n "$prev"; then 89 case "$prev" in 91 eval "$prev=\"\$$prev \$arg\"" 94 eval "$prev=\$arg" 98 prev= 135 --mode) prevopt="--mode" prev=mode ;; 144 prev=execute_dlfiles 386 prev [all...] |
/external/bison/lib/ |
H A D | obstack.c | 181 chunk->prev = 0; 229 chunk->prev = 0; 263 new_chunk->prev = old_chunk; 298 new_chunk->prev = old_chunk->prev; 331 plp = lp->prev; 355 plp = lp->prev; 386 for (lp = h->chunk; lp != 0; lp = lp->prev)
|
/external/elfutils/src/libdw/ |
H A D | dwarf_end.c | 104 while (memp->prev != NULL) 106 struct libdw_memblock *prevp = memp->prev;
|
H A D | cfi.c | 47 Dwarf_Frame *prev) 54 copy->prev = prev; 328 Dwarf_Frame *prev = fs->prev; local 329 cfi_assert (prev != NULL); 331 fs = prev; 398 while (fs->prev != NULL) 400 Dwarf_Frame *prev = fs->prev; local 46 duplicate_frame_state(const Dwarf_Frame *original, Dwarf_Frame *prev) argument [all...] |
/external/libvpx/libvpx/vpx_mem/memory_manager/ |
H A D | hmm_base.c | 29 to_remove->prev->next = to_remove->next; 32 to_remove->next->prev = to_remove->prev; 56 ptr_rec_ptr->prev = bin_front_ptr; 61 ptr_rec_ptr->next->prev = ptr_rec_ptr; 348 (((ACCESS) ? AUDIT_BLOCK_AS_EXPR(PTR_REC_TO_HEAD(H)) : 0), (H)->prev) 353 #define AVL_GET_GREATER(H, ACCESS) ((H)->prev) 358 #define AVL_SET_GREATER(H, GH) (H)->prev = (GH);
|
/external/linux-tools-perf/src/tools/perf/util/ |
H A D | cpumap.c | 49 int n, cpu, prev; local 53 prev = -1; 58 if (prev >= 0) { 59 int new_max = nr_cpus + cpu - prev - 1; 69 while (++prev < cpu) 70 tmp_cpus[nr_cpus++] = prev; 82 prev = cpu; 84 prev = -1;
|
/external/lzma/CPP/7zip/Archive/Common/ |
H A D | ItemNameUtils.cpp | 43 LPCSTR prev =
49 return (*prev == '/');
|
/external/mockito/cglib-and-asm/src/org/mockito/asm/tree/ |
H A D | AbstractInsnNode.java | 128 AbstractInsnNode prev;
field in class:AbstractInsnNode 178 return prev;
|
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/writer/pool/ |
H A D | FieldPool.java | 51 Integer prev = internedItems.put(field, 0); 52 if (prev == null) {
|
H A D | MethodPool.java | 53 Integer prev = internedItems.put(method, 0); 54 if (prev == null) {
|
/external/mesa3d/src/mesa/drivers/dri/i965/ |
H A D | brw_fs_schedule_instructions.cpp | 218 schedule_node *prev = (schedule_node *)n->prev; local 221 if (prev) { 222 while (!prev->is_head_sentinel()) { 223 add_dep(prev, n, 0); 224 prev = (schedule_node *)prev->prev; 354 exec_node *prev; local 355 for (node = instructions.get_tail(), prev [all...] |
/external/valgrind/coregrind/ |
H A D | m_execontext.c | 369 ExeContext *prev2, *prev; local 384 prev = NULL; 395 prev2 = prev; 396 prev = list; 405 if (prev2 != NULL && prev != NULL) { 407 vg_assert(prev2->chain == prev); 408 vg_assert(prev->chain == list); 410 prev->chain = list->chain; 411 list->chain = prev; 413 else if (prev2 == NULL && prev ! [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/ode/ |
H A D | MultistepIntegrator.java | 327 final double prev = interpolator.getPreviousTime(); 329 stepStart = prev; 330 stepSize = (curr - prev) / (nSteps + 1); 333 interpolator.setInterpolatedTime(prev); 342 interpolator.setInterpolatedTime(prev + stepSize * i);
|