/external/chromium_org/third_party/simplejson/ |
H A D | ordered_dict.py | 33 self.__map = {} # key --> [key, prev, next] 45 key, prev, next = self.__map.pop(key) 46 prev[2] = next 47 next[1] = prev
|
/external/chromium_org/third_party/skia/tools/ |
H A D | CrashHandler.cpp | 80 void (*prev)(int) = signal(kSignals[i], handler); 81 if (prev != SIG_DFL) { 82 signal(kSignals[i], prev);
|
/external/harfbuzz_ng/src/ |
H A D | hb-utf-private.hh | 110 prev (const uint8_t *text, function in struct:hb_utf_t 172 prev (const uint16_t *text, function in struct:hb_utf_t 230 prev (const uint32_t *text, function in struct:hb_utf_t
|
H A D | hb-ot-shape-complex-arabic.cc | 109 /* State 0: prev was U, not willing to join. */ 112 /* State 1: prev was R or ISOL/ALAPH, not willing to join. */ 115 /* State 2: prev was D/L in ISOL form, willing to join. */ 118 /* State 3: prev was D in FINA form, willing to join. */ 121 /* State 4: prev was FINA ALAPH, not willing to join. */ 124 /* State 5: prev was FIN2/FIN3 ALAPH, not willing to join. */ 127 /* State 6: prev was DALATH/RISH, not willing to join. */ 248 unsigned int prev = (unsigned int) -1, state = 0; local 275 if (entry->prev_action != NONE && prev != (unsigned int) -1) 276 info[prev] [all...] |
/external/libsepol/src/ |
H A D | avtab.c | 59 avtab_insert_node(avtab_t * h, int hvalue, avtab_ptr_t prev, avtab_key_t * key, argument 69 if (prev) { 70 newnode->next = prev->next; 71 prev->next = newnode; 84 avtab_ptr_t prev, cur, newnode; local 92 for (prev = NULL, cur = h->htable[hvalue]; 93 cur; prev = cur, cur = cur->next) { 110 newnode = avtab_insert_node(h, hvalue, prev, key, datum); 125 avtab_ptr_t prev, cur, newnode; local 132 for (prev [all...] |
H A D | sidtab.c | 46 sidtab_node_t *prev, *cur, *newnode; local 52 prev = NULL; 55 prev = cur; 73 if (prev) { 74 newnode->next = prev->next; 75 prev->next = newnode;
|
/external/mesa3d/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_graph.h | 68 Edge *prev[2]; member in class:nv50_ir::Graph::Edge 82 t = e = ((rev && first) ? first->prev[d] : first); 87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]);
|
/external/qemu/scripts/ |
H A D | ordereddict.py | 39 self.__map = {} # key --> [key, prev, next] 51 key, prev, next = self.__map.pop(key) 52 prev[2] = next 53 next[1] = prev
|
/external/skia/tools/ |
H A D | CrashHandler.cpp | 74 void (*prev)(int) = signal(kSignals[i], handler); 75 if (prev != SIG_DFL) { 76 signal(kSignals[i], prev);
|
/external/wpa_supplicant_8/wpa_supplicant/ |
H A D | ctrl_iface_named_pipe.c | 63 struct wpa_ctrl_dst *next, *prev; member in struct:wpa_ctrl_dst 211 dst->next->prev = dst; 242 if (dst->prev) 243 dst->prev->next = dst->next; 247 dst->next->prev = dst->prev; 542 struct wpa_global_dst *next, *prev; member in struct:wpa_global_dst 642 dst->next->prev = dst; 673 if (dst->prev) 674 dst->prev [all...] |
/external/chromium_org/base/ |
H A D | atomicops_unittest.cc | 88 AtomicType prev = base::subtle::NoBarrier_CompareAndSwap(&value, 0, 1); local 90 EXPECT_EQ(0, prev); 97 prev = base::subtle::NoBarrier_CompareAndSwap(&value, 0, 5); 99 EXPECT_EQ(k_test_val, prev); 102 prev = base::subtle::NoBarrier_CompareAndSwap(&value, k_test_val, 5); 104 EXPECT_EQ(k_test_val, prev);
|
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/cm/ |
H A D | markselection.js | 21 var prev = old && old != CodeMirror.Init; 22 if (val && !prev) { 28 } else if (!val && prev) {
|
/external/chromium_org/third_party/harfbuzz-ng/src/ |
H A D | hb-ot-shape-complex-arabic.cc | 109 /* State 0: prev was U, not willing to join. */ 112 /* State 1: prev was R or ISOL/ALAPH, not willing to join. */ 115 /* State 2: prev was D/L in ISOL form, willing to join. */ 118 /* State 3: prev was D in FINA form, willing to join. */ 121 /* State 4: prev was FINA ALAPH, not willing to join. */ 124 /* State 5: prev was FIN2/FIN3 ALAPH, not willing to join. */ 127 /* State 6: prev was DALATH/RISH, not willing to join. */ 248 unsigned int prev = (unsigned int) -1, state = 0; local 274 if (entry->prev_action != NONE && prev != (unsigned int) -1) 275 info[prev] [all...] |
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkDeque.cpp | 266 // Like next, prev actually returns the current element pointed to by fPos and 268 void* SkDeque::Iter::prev() { function in class:SkDeque::Iter 272 char* prev = pos - fElemSize; local 273 SkASSERT(prev >= fCurBlock->fBegin - fElemSize); 274 if (prev < fCurBlock->fBegin) { // exhausted this chunk, move to prior 278 prev = fCurBlock ? fCurBlock->fEnd - fElemSize : NULL; 280 fPos = prev;
|
/external/chromium_org/tools/android/heap_profiler/ |
H A D | heap_profiler.c | 134 StacktraceEntry** prev = &stack_traces_ht[slot]; local 135 while (*prev != st) 136 prev = &((*prev)->next); 139 assert(*prev == st); 140 *prev = st->next;
|
/external/clang/utils/ |
H A D | token-delta.py | 175 prev = None 177 if prev is None or j != prev + 1: 178 if prev: 179 sys.stderr.write('%d][' % prev) 182 prev = j
|
/external/skia/src/core/ |
H A D | SkDeque.cpp | 266 // Like next, prev actually returns the current element pointed to by fPos and 268 void* SkDeque::Iter::prev() { function in class:SkDeque::Iter 272 char* prev = pos - fElemSize; local 273 SkASSERT(prev >= fCurBlock->fBegin - fElemSize); 274 if (prev < fCurBlock->fBegin) { // exhausted this chunk, move to prior 278 prev = fCurBlock ? fCurBlock->fEnd - fElemSize : NULL; 280 fPos = prev;
|
/external/chromium_org/third_party/icu/source/common/ |
H A D | ucasemap.cpp | 264 int32_t prev, titleStart, titleLimit, idx, destIndex, length; local 281 prev=0; 285 while(prev<srcLength) { 305 * In this implementation, segment [prev..index[ into 3 parts: 306 * a) uncased characters (copy as-is) [prev..titleStart[ 310 if(prev<idx) { 311 /* find and copy uncased characters [prev..titleStart[ */ 312 titleStart=titleLimit=prev; 320 * only uncased characters in [prev..index[ 330 length=titleStart-prev; [all...] |
/external/chromium_org/third_party/npapi/npspy/common/ |
H A D | epmanager.cpp | 131 PluginEntryPointList * prev = NULL; local 137 if(prev) 138 prev->next = eps->next; 147 prev = eps; 244 InstanceList * prev = NULL; local 259 if(prev) 260 prev->next = instances->next; 269 prev = instances;
|
/external/chromium_org/v8/src/compiler/ |
H A D | generic-node-inl.h | 71 first_use_->prev = replace_to->last_use_; 137 use->prev = NULL; 193 use->prev = last_use_; 206 last_use_ = use->prev; 208 if (use->prev != NULL) { 209 use->prev->next = use->next; 214 use->next->prev = use->prev;
|
/external/e2fsprogs/debugfs/ |
H A D | extent_cmds.ct | 38 previous, prev, p;
|
/external/e2fsprogs/e2fsck/ |
H A D | mtrace.h | 143 size_t prev; /* Index of previous free cluster. */ member in struct:__anon20447::__anon20451 167 struct list *prev; member in struct:list
|
/external/emma/core/java12/com/vladium/util/ |
H A D | SoftValueMap.java | 307 for (SoftEntry entry = buckets [bucketIndex], prev = null; entry != null; prev = entry, entry = entry.m_next) 313 if (prev == null) // head of the list 319 prev.m_next = entry.m_next; 558 for (SoftEntry entry = m_buckets [bucketIndex], prev = null; entry != null; prev = entry, entry = entry.m_next) 562 if (prev == null) // head of the list 568 prev.m_next = entry.m_next;
|
/external/fio/ |
H A D | gettime.c | 538 struct clock_entry *prev, *this; local 603 prev = this; 607 if (prev->tsc > this->tsc) { 608 uint64_t diff = prev->tsc - this->tsc; 612 log_info("\t CPU%3u: TSC=%llu, SEQ=%u\n", prev->cpu, (unsigned long long) prev->tsc, prev->seq); 617 prev = this;
|
/external/icu/icu4c/source/common/ |
H A D | ucasemap.cpp | 264 int32_t prev, titleStart, titleLimit, idx, destIndex, length; local 281 prev=0; 285 while(prev<srcLength) { 305 * In this implementation, segment [prev..index[ into 3 parts: 306 * a) uncased characters (copy as-is) [prev..titleStart[ 310 if(prev<idx) { 311 /* find and copy uncased characters [prev..titleStart[ */ 312 titleStart=titleLimit=prev; 320 * only uncased characters in [prev..index[ 330 length=titleStart-prev; [all...] |