| /external/brotli/c/enc/ |
| compress_fragment_two_pass.c | 123 const uint32_t tail = insertlen - 2; local
124 const uint32_t nbits = Log2FloorNonZero(tail) - 1u;
125 const uint32_t prefix = tail >> nbits;
127 const uint32_t extra = tail - (prefix << nbits);
130 const uint32_t tail = insertlen - 66; local
131 const uint32_t nbits = Log2FloorNonZero(tail);
133 const uint32_t extra = tail - (1u << nbits);
152 const size_t tail = copylen - 6; local
153 const size_t nbits = Log2FloorNonZero(tail) - 1;
154 const size_t prefix = tail >> nbits
159 const size_t tail = copylen - 70; local
177 const size_t tail = copylen - 8; local
185 const size_t tail = copylen - 8; local
193 const size_t tail = copylen - 72; local
[all...] |
| /external/freetype/src/base/ |
| ftutil.c | 278 before = list->tail;
288 list->tail = node;
310 list->tail = node;
341 list->tail = before;
369 list->tail = before;
439 list->tail = NULL;
|
| /external/linux-kselftest/tools/testing/selftests/powerpc/pmu/ebb/ |
| trace.c | 32 tb->tail = tb->data;
66 p = tb->tail;
67 newtail = tb->tail + bytes;
71 tb->tail = newtail;
277 printf(" tail %p\n", tb->tail);
287 while (trace_check_bounds(tb, p) && p < tb->tail) {
|
| /external/mesa3d/src/compiler/nir/ |
| nir_opt_constant_folding.c | 122 for (nir_deref *tail = deref->deref.child; tail; tail = tail->child) {
123 if (tail->deref_type != nir_deref_type_array)
126 nir_deref_array *arr = nir_deref_as_array(tail);
|
| nir_lower_io.c | 93 nir_deref *tail = &deref->deref; local
99 tail = tail->child;
100 nir_deref_array *deref_array = nir_deref_as_array(tail);
110 assert(tail->child->deref_type == nir_deref_type_array);
112 nir_deref_array *deref_array = nir_deref_as_array(tail->child);
125 while (tail->child != NULL) {
126 const struct glsl_type *parent_type = tail->type;
127 tail = tail->child
[all...] |
| /external/python/cpython2/Python/ |
| traceback.c | 133 /* Search tail of filename in sys.path before giving up */
135 const char *tail = strrchr(filename, SEP); local
136 if (tail == NULL)
137 tail = filename;
139 tail++;
144 size_t taillen = strlen(tail);
161 strcpy(namebuf+len, tail);
|
| /external/strace/ |
| unwind.c | 48 struct call_t *tail; member in struct:unwind_queue_t
71 tcp->unwind_queue->tail = NULL;
227 queue->tail = call;
229 queue->tail->next = call;
230 queue->tail = call;
262 queue->tail = NULL;
|
| /external/u-boot/arch/arm/mach-uniphier/clk/ |
| Makefile | 14 obj-$(CONFIG_ARCH_UNIPHIER_LD4) += clk-ld4.o pll-ld4.o dpll-tail.o
15 obj-$(CONFIG_ARCH_UNIPHIER_PRO4) += clk-pro4.o pll-pro4.o dpll-tail.o
16 obj-$(CONFIG_ARCH_UNIPHIER_SLD8) += clk-ld4.o pll-ld4.o dpll-tail.o
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/PyMod-2.7.2/Lib/ |
| os.py | 159 head, tail = path.split(name)
160 if not tail:
161 head, tail = path.split(head)
162 if head and tail and not path.exists(head):
169 if tail == curdir: # xxx/newdir/. exists if xxx/newdir exists
185 head, tail = path.split(name)
186 if not tail:
187 head, tail = path.split(head)
188 while head and tail:
193 head, tail = path.split(head)
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/PyMod-2.7.10/Lib/ |
| os.py | 172 head, tail = path.split(name)
173 if not tail:
174 head, tail = path.split(head)
175 if head and tail and not path.exists(head):
182 if tail == curdir: # xxx/newdir/. exists if xxx/newdir exists
198 head, tail = path.split(name)
199 if not tail:
200 head, tail = path.split(head)
201 while head and tail:
206 head, tail = path.split(head)
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
| os.py | 145 head, tail = path.split(name)
146 if not tail:
147 head, tail = path.split(head)
148 if head and tail and not path.exists(head):
155 if tail == curdir: # xxx/newdir/. exists if xxx/newdir exists
171 head, tail = path.split(name)
172 if not tail:
173 head, tail = path.split(head)
174 while head and tail:
179 head, tail = path.split(head)
[all...] |
| ihooks.py | 407 q, tail = self.find_head_package(parent, str(name))
408 m = self.load_tail(q, tail)
464 tail = name[i+1:]
467 tail = ""
473 if q: return q, tail
478 if q: return q, tail
481 def load_tail(self, q, tail):
483 while tail:
484 i = tail.find('.')
485 if i < 0: i = len(tail)
[all...] |
| /external/python/cpython2/Lib/ |
| os.py | 145 head, tail = path.split(name)
146 if not tail:
147 head, tail = path.split(head)
148 if head and tail and not path.exists(head):
155 if tail == curdir: # xxx/newdir/. exists if xxx/newdir exists
171 head, tail = path.split(name)
172 if not tail:
173 head, tail = path.split(head)
174 while head and tail:
179 head, tail = path.split(head
[all...] |
| sre_compile.py | 187 tail = []
188 tailappend = tail.append
197 for tail in tail:
198 code[tail] = _len(code) - tail
259 tail = []
289 tail.append((op, av))
305 tail.append((LITERAL, hi))
307 tail.append((RANGE, (lo, hi))
[all...] |
| ihooks.py | 407 q, tail = self.find_head_package(parent, str(name))
408 m = self.load_tail(q, tail)
464 tail = name[i+1:]
467 tail = ""
473 if q: return q, tail
478 if q: return q, tail
481 def load_tail(self, q, tail):
483 while tail:
484 i = tail.find('.')
485 if i < 0: i = len(tail)
[all...] |
| /external/grpc-grpc/src/core/lib/transport/ |
| metadata_batch.cc | 37 GPR_ASSERT((list->head == nullptr) == (list->tail == nullptr));
40 GPR_ASSERT(list->tail->next == nullptr);
41 GPR_ASSERT((list->head == list->tail) == (list->head->next == nullptr));
47 GPR_ASSERT((l->next == nullptr) == (l == list->tail));
145 list->tail = storage;
176 storage->prev = list->tail;
179 if (list->tail != nullptr) {
180 list->tail->next = storage;
184 list->tail = storage;
213 list->tail = storage->prev
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Objects/ |
| obmalloc.c | 1485 uchar *tail; \/* p + 2*SST + nbytes == pointer to tail pad bytes *\/ local
1539 uchar *tail; local
1598 const uchar *tail; local
1648 const uchar *tail; local
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Objects/ |
| obmalloc.c | 1436 uchar *tail; \/* p + 2*SST + nbytes == pointer to tail pad bytes *\/ local
1490 uchar *tail; local
1549 const uchar *tail; local
1599 const uchar *tail; local
[all...] |
| /external/python/cpython2/Objects/ |
| obmalloc.c | 1485 uchar *tail; \/* p + 2*SST + nbytes == pointer to tail pad bytes *\/ local
1539 uchar *tail; local
1604 const uchar *tail; local
1654 const uchar *tail; local
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/ |
| sre_compile.py | 187 tail = []
188 tailappend = tail.append
197 for tail in tail:
198 code[tail] = _len(code) - tail
259 tail = []
289 tail.append((op, av))
305 tail.append((LITERAL, hi))
307 tail.append((RANGE, (lo, hi)))
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| LinkedListMultimap.java | 144 Node<K, V> tail; field in class:LinkedListMultimap.KeyList
149 this.tail = firstNode;
157 private transient Node<K, V> tail; // the tail for all keys field in class:LinkedListMultimap
222 head = tail = node;
225 } else if (nextSibling == null) { // non-empty list, add to tail
226 tail.next = node;
227 node.previous = tail;
228 tail = node;
235 Node<K, V> keyTail = keyList.tail;
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| LinkedListMultimap.java | 140 Node<K, V> tail; field in class:LinkedListMultimap.KeyList
145 this.tail = firstNode;
153 private transient Node<K, V> tail; // the tail for all keys field in class:LinkedListMultimap
218 head = tail = node;
221 } else if (nextSibling == null) { // non-empty list, add to tail
222 tail.next = node;
223 node.previous = tail;
224 tail = node;
231 Node<K, V> keyTail = keyList.tail;
[all...] |
| /external/skia/src/core/ |
| SkRWBuffer.cpp | 105 void validate(size_t minUsed, const SkBufferBlock* tail = nullptr) const {
118 if (tail) {
119 SkASSERT(tail == lastBlock);
129 SkROBuffer::SkROBuffer(const SkBufferHead* head, size_t available, const SkBufferBlock* tail)
130 : fHead(head), fAvailable(available), fTail(tail)
135 head->validate(available, tail);
138 SkASSERT(!tail);
|
| /external/skqp/src/core/ |
| SkRWBuffer.cpp | 105 void validate(size_t minUsed, const SkBufferBlock* tail = nullptr) const {
118 if (tail) {
119 SkASSERT(tail == lastBlock);
129 SkROBuffer::SkROBuffer(const SkBufferHead* head, size_t available, const SkBufferBlock* tail)
130 : fHead(head), fAvailable(available), fTail(tail)
135 head->validate(available, tail);
138 SkASSERT(!tail);
|
| /external/google-breakpad/src/third_party/libdisasm/swig/ |
| libdisasm_oop.i | 259 X86_OpListNode *head, *tail, *curr;
291 self->curr = self->tail;
292 return self->tail;
307 self->curr = self->tail;
308 return self->tail;
324 if ( ! self->tail ) {
325 self->head = self->tail = node;
327 self->tail->next = node;
328 node->prev = self->tail;
329 self->tail = node
[all...] |
