| /external/bison/build-aux/ |
| Makefile.am | 2 EXTRA_DIST = prev-version.txt
|
| /external/bzip2/ |
| format.pl | 43 my ($prev, $curr, $str);
44 $prev = ''; $curr = '';
47 print OUTFILE $prev;
48 $prev = $curr;
52 if ( $prev =~ /<programlisting>$|<screen>$/ ) {
53 chomp $prev;
54 $curr = join( '', $prev, "<![CDATA[", $curr );
55 $prev = '';
59 chomp $prev;
60 $curr = join( '', $prev, "]]>", $curr )
[all...] |
| /frameworks/base/media/libstagefright/codecs/m4v_h263/dec/src/ |
| mb_utils.cpp | 25 void PutSKIPPED_MB(uint8 *comp, uint8 *prev, int width)
34 temp0 = (int32 *)prev;
43 prev += width;
45 temp0 = (int32 *)prev;
54 prev += width;
56 temp0 = (int32 *)prev;
65 prev += width;
67 temp0 = (int32 *)prev;
75 prev += width;
86 void PutSKIPPED_B(uint8 *comp, uint8 *prev, int width
[all...] |
| get_pred_outside.cpp | 113 #define PAD_CORNER { temp = *prev; \
133 #define PAD_ROW { temp = *((uint32*)prev); \
134 temp2 = *((uint32*)(prev+4)); \
152 #define PAD_EXTRA_4x8 { temp = *((uint32*)(prev+8)); \
162 #define PAD_COL { temp = *prev; \
166 temp = *(prev+=16); \
170 temp = *(prev+=16); \
174 temp = *(prev+=16); \
178 temp = *(prev+=16); \
182 temp = *(prev+=16);
255 uint8 *prev; \/* pointers to adjacent pixels in the *\/ local
[all...] |
| get_pred_adv_b_add.cpp | 83 uint8 *prev, /* i */
96 offset = width - B_SIZE; /* offset for prev */
99 tmp = (uint32)prev & 0x3;
106 *((uint32*)(pred_block += offset2)) = *((uint32*)prev);
107 *((uint32*)(pred_block += 4)) = *((uint32*)(prev + 4));
108 prev += width;
114 prev--; /* word-aligned */
118 word1 = *((uint32*)prev); /* read 4 bytes, b4 b3 b2 b1 */
119 word2 = *((uint32*)(prev += 4)); /* read 4 bytes, b8 b7 b6 b5 */
124 word1 = *((uint32*)(prev += 4)); /* b12 b11 b10 b9 *
[all...] |
| /bionic/libc/kernel/arch-sh/asm/ |
| system_64.h | 17 struct task_struct *sh64_switch_to(struct task_struct *prev,
22 #define switch_to(prev,next,last) do { if (last_task_used_math != next) { struct pt_regs *regs = next->thread.uregs; if (regs) regs->sr |= SR_FD; } last = sh64_switch_to(prev, &prev->thread, next, &next->thread); } while (0)
|
| system_32.h | 17 struct task_struct *__switch_to(struct task_struct *prev,
20 #define switch_to(prev, next, last) do { register u32 *__ts1 __asm__ ("r1") = (u32 *)&prev->thread.sp; register u32 *__ts2 __asm__ ("r2") = (u32 *)&prev->thread.pc; register u32 *__ts4 __asm__ ("r4") = (u32 *)prev; register u32 *__ts5 __asm__ ("r5") = (u32 *)next; register u32 *__ts6 __asm__ ("r6") = (u32 *)&next->thread.sp; register u32 __ts7 __asm__ ("r7") = next->thread.pc; struct task_struct *__last; __asm__ __volatile__ ( ".balign 4\n\t" "stc.l gbr, @-r15\n\t" "sts.l pr, @-r15\n\t" "mov.l r8, @-r15\n\t" "mov.l r9, @-r15\n\t" "mov.l r10, @-r15\n\t" "mov.l r11, @-r15\n\t" "mov.l r12, @-r15\n\t" "mov.l r13, @-r15\n\t" "mov.l r14, @-r15\n\t" "mov.l r15, @r1\t! save SP\n\t" "mov.l @r6, r15\t! change to new stack\n\t" "mova 1f, %0\n\t" "mov.l %0, @r2\t! save PC\n\t" "mov.l 2f, %0\n\t" "jmp @%0\t! call __switch_to\n\t" " lds r7, pr\t! with return to new PC\n\t" ".balign 4\n" "2:\n\t" ".long __switch_to\n" "1:\n\t" "mov.l @r15+, r14\n\t" "mov.l @r15+, r13\n\t" "mov.l @r15+, r12\n\t" "mov.l @r15+, r11\n\t" "mov.l @r15+, r10\n\t" "mov.l @r15+, r9\n\t" "mov.l @r15+, r8\n\t" "lds.l @r15+, pr\n\t" "ldc.l @r15+, gbr\n\t" : "=z" (__last) : "r" (__ts1), "r" (__ts2), "r" (__ts4), "r" (__ts5), "r" (__ts6), "r" (__ts7) : "r3", "t"); last = __last; } while (0)
|
| /external/e2fsprogs/lib/ext2fs/ |
| kernel-list.h | 9 * sometimes we already know the next/prev entries and we can
15 struct list_head *next, *prev; member in struct:list_head
24 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
35 * the prev/next entries already!
38 struct list_head * prev,
41 next->prev = new;
43 new->prev = prev;
44 prev->next = new;
60 __list_add(new, head->prev, head)
[all...] |
| /external/kernel-headers/original/asm-generic/ |
| mutex-xchg.h | 95 int prev = atomic_xchg(count, 0); local
97 if (unlikely(prev < 0)) {
100 * state. If while doing so we get back a prev value of 1
109 prev = atomic_xchg(count, prev);
110 if (prev < 0)
111 prev = 0;
115 return prev;
|
| /hardware/msm7k/libgralloc/ |
| allocator.h | 47 newNode->prev = node;
50 else node->next->prev = newNode;
55 newNode->prev = node->prev;
57 if (node->prev == 0) mFirst = newNode;
58 else node->prev->next = newNode;
59 node->prev = newNode;
65 newNode->prev = newNode->next = 0;
67 newNode->prev = 0;
69 mFirst->prev = newNode
116 mutable chunk_t* prev; member in struct:SimpleBestFitAllocator::chunk_t
[all...] |
| /hardware/msm7k/libgralloc-qsd8k/ |
| allocator.h | 48 newNode->prev = node;
51 else node->next->prev = newNode;
56 newNode->prev = node->prev;
58 if (node->prev == 0) mFirst = newNode;
59 else node->prev->next = newNode;
60 node->prev = newNode;
66 newNode->prev = newNode->next = 0;
68 newNode->prev = 0;
70 mFirst->prev = newNode
117 mutable chunk_t* prev; member in struct:SimpleBestFitAllocator::chunk_t
[all...] |
| /system/core/include/cutils/ |
| atomic-x86.h | 69 int32_t prev; local
71 : "=a" (prev)
74 return prev != old_value;
127 int32_t prev, status; local
129 prev = *ptr;
130 status = android_atomic_cas(prev, prev & value, ptr);
132 return prev;
137 int32_t prev, status; local
139 prev = *ptr
[all...] |
| atomic-arm.h | 86 int32_t prev, status; local
92 : "=&r" (prev), "=&r" (status), "+m"(*ptr)
96 return prev != old_value;
103 int32_t prev, status; local
104 prev = *ptr;
109 prev = *ptr;
110 } while (prev == old_value);
140 int32_t prev, status; local
144 : "=&r" (prev), "=&r" (status), "+m" (*ptr)
149 return prev;
155 int32_t prev; local
172 int32_t prev, tmp, status; local
189 int32_t prev, status; local
214 int32_t prev, tmp, status; local
230 int32_t prev, status; local
245 int32_t prev, tmp, status; local
261 int32_t prev, status; local
[all...] |
| /external/e2fsprogs/lib/blkid/ |
| list.h | 19 * sometimes we already know the next/prev entries and we can
25 struct list_head *next, *prev; member in struct:list_head
34 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
41 * the prev/next entries already!
44 struct list_head * prev,
47 next->prev = add;
49 add->prev = prev;
50 prev->next = add;
76 __list_add(add, head->prev, head)
[all...] |
| /external/oprofile/libutil/ |
| op_list.h | 19 * sometimes we already know the next/prev entries and we can
25 struct list_head * next, * prev; member in struct:list_head
37 ptr->prev = ptr;
44 * the prev/next entries already!
47 struct list_head * prev,
50 next->prev = new_entry;
52 new_entry->prev = prev;
53 prev->next = new_entry;
79 __list_add(new_entry, head->prev, head)
[all...] |
| /external/skia/include/core/ |
| SkAutoKern.h | 23 #define SkAutoKern_AdjustF(prev, next) (((next) - (prev) + 32) >> 6 << 16)
24 #define SkAutoKern_AdjustS(prev, next) SkIntToScalar(((next) - (prev) + 32) >> 6)
|
| /external/blktrace/btt/ |
| list.h | 35 struct list_head *next, *prev; member in struct:list_head
46 list->prev = list;
53 * the prev/next entries already!
56 struct list_head *prev,
59 next->prev = new;
61 new->prev = prev;
62 prev->next = new;
88 __list_add(new, head->prev, head);
92 * Delete a list entry by making the prev/next entrie
[all...] |
| /dalvik/vm/compiler/ |
| IntermediateRep.c | 34 mir->prev = mir->next = NULL;
37 mir->prev = bb->lastMIRInsn;
49 mir->prev = mir->next = NULL;
51 bb->firstMIRInsn->prev = mir;
53 mir->prev = NULL;
61 newMIR->prev = currentMIR;
67 newMIR->next->prev = newMIR;
83 lir->prev = lir->next = NULL;
86 lir->prev = cUnit->lastLIRInsn;
100 assert(currentLIR->prev != NULL)
[all...] |
| /external/iptables/include/linux/netfilter_ipv4/ |
| ipt_limit.h | 14 u_int64_t prev; member in struct:ipt_rateinfo
18 unsigned long prev; member in struct:ipt_rateinfo
|
| /external/iptables/include/linux/netfilter_ipv6/ |
| ip6t_limit.h | 14 u_int64_t prev; member in struct:ip6t_rateinfo
18 unsigned long prev; member in struct:ip6t_rateinfo
|
| /packages/apps/Email/src/org/apache/james/mime4j/ |
| RootInputStream.java | 38 private int prev = -1;
field in class:RootInputStream
79 if (prev == '\r' && b == '\n') {
82 prev = b;
97 if (prev == '\r' && b[i] == '\n') {
100 prev = b[i];
|
| /system/core/init/ |
| list.h | 23 struct listnode *prev; member in struct:listnode
32 .prev = &name, \
39 for (node = (list)->prev; node != (list); node = node->prev)
47 #define list_tail(list) ((list)->prev)
|
| /external/astl/src/ |
| ios_base.cpp | 53 fmtflags prev = mFlags; local
55 return prev;
59 fmtflags prev = mFlags; local
61 return prev;
65 fmtflags prev = mFlags; local
68 return prev;
76 const streamsize prev = mPrecision; local
80 return prev;
84 const streamsize prev = mWidth; local
88 return prev;
[all...] |
| /bionic/libc/private/isc/ |
| list.h | 28 #define LINK(type) struct { type *prev, *next; }
31 (elt)->link.prev = (type *)(-1); \
36 #define LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1))
46 (list).head->link.prev = (elt); \
49 (elt)->link.prev = NULL; \
61 (elt)->link.prev = (list).tail; \
70 (elt)->link.next->link.prev = (elt)->link.prev; \
72 (list).tail = (elt)->link.prev; \
73 if ((elt)->link.prev != NULL)
[all...] |
| /external/chromium/third_party/icu/source/i18n/ |
| bocsu.c | 112 * code points. Lexical order is preserved if "prev" is always moved
115 * Additionally, "prev" is moved from anywhere in the Unihan
123 int32_t c, prev; local
126 prev=0;
130 if(prev<0x4e00 || prev>=0xa000) {
131 prev=(prev&~0x7f)-SLOPE_REACH_NEG_1;
137 prev=0x9fff-SLOPE_REACH_POS_2;
141 p=u_writeDiff(c-prev, p)
167 int32_t c, prev; local
[all...] |
