| /external/mesa3d/src/gallium/drivers/llvmpipe/ |
| lp_scene.c | 141 bin->head = bin->tail;
142 if (bin->tail) {
143 bin->tail->next = NULL;
144 bin->tail->count = 0;
242 bin->tail = NULL;
314 if (bin->tail) {
315 bin->tail->next = block;
316 bin->tail = block;
320 bin->tail = block;
|
| /external/skia/src/gpu/ccpr/ |
| GrCCPathCache.cpp | 101 this->evict(*fLRU.tail()->fCacheKey, fLRU.tail());
201 SkDEBUGCODE(HashNode* node = fHashTable.find(*fLRU.tail()->fCacheKey));
202 SkASSERT(node && node->entry() == fLRU.tail());
203 this->evict(*fLRU.tail()->fCacheKey); // We've exceeded our limit.
276 : fLRU.tail()->fTimestamp;
280 while (!fLRU.isEmpty() && fLRU.tail()->fTimestamp < purgeTime) {
283 auto timestamp = fLRU.tail()->fTimestamp;
287 this->evict(*fLRU.tail()->fCacheKey);
|
| /external/skqp/src/gpu/ccpr/ |
| GrCCPathCache.cpp | 101 this->evict(*fLRU.tail()->fCacheKey, fLRU.tail());
201 SkDEBUGCODE(HashNode* node = fHashTable.find(*fLRU.tail()->fCacheKey));
202 SkASSERT(node && node->entry() == fLRU.tail());
203 this->evict(*fLRU.tail()->fCacheKey); // We've exceeded our limit.
276 : fLRU.tail()->fTimestamp;
280 while (!fLRU.isEmpty() && fLRU.tail()->fTimestamp < purgeTime) {
283 auto timestamp = fLRU.tail()->fTimestamp;
287 this->evict(*fLRU.tail()->fCacheKey);
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/distutils/ |
| dir_util.py | 49 (head, tail) = os.path.split(name)
50 tails = [tail] # stack of lone dirs to create
52 while head and tail and not os.path.isdir(head):
53 (head, tail) = os.path.split(head)
54 tails.insert(0, tail) # push next higher dir onto stack
|
| /external/okhttp/okio/okio/src/main/java/okio/ |
| Okio.java | 134 Segment tail = sink.writableSegment(1);
135 int maxToCopy = (int) Math.min(byteCount, Segment.SIZE - tail.limit);
136 int bytesRead = in.read(tail.data, tail.limit, maxToCopy);
138 tail.limit += bytesRead;
|
| /external/okhttp/repackaged/okio/okio/src/main/java/com/android/okhttp/okio/ |
| Okio.java | 136 Segment tail = sink.writableSegment(1);
137 int maxToCopy = (int) Math.min(byteCount, Segment.SIZE - tail.limit);
138 int bytesRead = in.read(tail.data, tail.limit, maxToCopy);
140 tail.limit += bytesRead;
|
| /external/owasp/sanitizer/src/main/org/owasp/html/ |
| HtmlEntities.java | 59 int tail = -1; local
62 end = tail = entityLimit;
69 tail = end + 1;
92 tail = i;
191 return (((long) tail) << 32) | codepoint;
|
| /external/python/cpython2/Lib/distutils/ |
| dir_util.py | 49 (head, tail) = os.path.split(name)
50 tails = [tail] # stack of lone dirs to create
52 while head and tail and not os.path.isdir(head):
53 (head, tail) = os.path.split(head)
54 tails.insert(0, tail) # push next higher dir onto stack
|
| /external/python/cpython3/Lib/distutils/ |
| dir_util.py | 47 (head, tail) = os.path.split(name)
48 tails = [tail] # stack of lone dirs to create
50 while head and tail and not os.path.isdir(head):
51 (head, tail) = os.path.split(head)
52 tails.insert(0, tail) # push next higher dir onto stack
|
| /external/vboot_reference/firmware/2lib/ |
| 2rsa.c | 249 const uint8_t *tail; local
259 tail = sha1_tail;
263 tail = sha256_tail;
267 tail = sha512_tail;
278 /* Then 0xff bytes until the tail */
283 * Then the tail. Even though there are probably no timing issues
286 result |= vb2_safe_memcmp(sig, tail, tail_size);
|
| /frameworks/av/media/mtp/ |
| MtpUtils.cpp | 63 const char* tail = dateTime + 15; local
64 if (tail[0] == '.' && tail[1]) tail += 2;
76 bool useUTC = (tail[0] == 'Z');
|
| /device/google/bonito/json-c/ |
| linkhash.c | 259 * string is aligned, the masked-off tail is in the same word as the
475 t->tail = new_t->tail;
514 t->head = t->tail = &t->table[n];
517 t->tail->next = &t->table[n];
518 t->table[n].prev = t->tail;
520 t->tail = &t->table[n];
575 if(t->tail == &t->table[n] && t->head == &t->table[n]) {
576 t->head = t->tail = NULL;
580 } else if (t->tail == &t->table[n])
[all...] |
| /device/google/crosshatch/json-c/ |
| linkhash.c | 259 * string is aligned, the masked-off tail is in the same word as the
475 t->tail = new_t->tail;
514 t->head = t->tail = &t->table[n];
517 t->tail->next = &t->table[n];
518 t->table[n].prev = t->tail;
520 t->tail = &t->table[n];
575 if(t->tail == &t->table[n] && t->head == &t->table[n]) {
576 t->head = t->tail = NULL;
580 } else if (t->tail == &t->table[n])
[all...] |
| /external/eigen/Eigen/src/Eigenvalues/ |
| HessenbergDecomposition.h | 305 matA.col(i).tail(remainingSize).makeHouseholderInPlace(h, beta);
314 .applyHouseholderOnTheLeft(matA.col(i).tail(remainingSize-1), h, &temp.coeffRef(0));
318 .applyHouseholderOnTheRight(matA.col(i).tail(remainingSize-1).conjugate(), numext::conj(h), &temp.coeffRef(0));
|
| /external/eigen/test/ |
| product_selfadjoint.cpp | 56 m2.block(1,1,rows-1,cols-1).template selfadjointView<Lower>().rankUpdate(v1.tail(rows-1),v2.head(cols-1));
58 m3.block(1,1,rows-1,cols-1) += v1.tail(rows-1) * v2.head(cols-1).adjoint()+ v2.head(cols-1) * v1.tail(rows-1).adjoint();
|
| /external/eigen/unsupported/Eigen/CXX11/src/Tensor/ |
| TensorSyclTuple.h | 48 Tuple(T t, Ts... ts) : head(t), tail(ts...) {}
50 Tuple<Ts...> tail; member in struct:utility::tuple::Tuple
108 return utility::tuple::get<k - 1>(t.tail); \
|
| /external/libchrome/mojo/public/tools/bindings/pylib/mojom/parse/ |
| lexer.py | 14 path, tail = os.path.split(path)
15 assert tail
16 if tail == dirname:
|
| /external/libchrome/mojo/public/tools/bindings/pylib/mojom_tests/generate/ |
| pack_unittest.py | 16 path, tail = os.path.split(path)
17 assert tail
18 if tail == dirname:
|
| /external/mesa3d/src/compiler/glsl/glcpp/ |
| glcpp.h | 55 string_node_t *tail; member in struct:string_list
116 token_node_t *tail; member in struct:token_list
127 argument_node_t *tail; member in struct:argument_list
|
| glcpp-parse.y | 96 _token_list_append_list(token_list_t *list, token_list_t *tail);
778 list->tail = NULL;
797 list->tail->next = node;
800 list->tail = node;
889 list->tail = NULL;
908 list->tail->next = node;
911 list->tail = node;
982 list->tail = NULL;
1000 list->tail->next = node;
1003 list->tail = node
[all...] |
| /external/tensorflow/tensorflow/core/grappler/ |
| utils_test.cc | 250 // We walk backwards, starting as "id1", so tail should be "neg1".
251 NodeDef* tail = GetTailOfChain(graph.node(5), node_map, local
253 ASSERT_NE(tail, nullptr);
254 EXPECT_EQ(tail->name(), "neg1");
256 // We stop at branching nodes, so tail should be "neg2".
260 tail =
263 ASSERT_NE(tail, nullptr);
264 EXPECT_EQ(tail->name(), "neg2");
267 // so tail should be "neg0".
268 tail = GetTailOfChain(graph.node(7), node_map
[all...] |
| /external/tensorflow/tensorflow/core/lib/strings/ |
| base64.cc | 126 char tail[4] = {kBase64UrlSafeChars[0], kBase64UrlSafeChars[0], local
128 // Copy tail of the input into the array, then decode.
129 std::memcpy(tail, b64, remain * sizeof(*b64));
130 TF_RETURN_IF_ERROR(DecodeThreeChars(tail, current));
172 // Take care of the tail.
|
| /external/tensorflow/tensorflow/lite/toco/graph_transformations/ |
| move_binary_operator_before_reshape.cc | 25 bool IsTailOfShape(const Shape& tail, const Shape& shape) {
26 // Return true if 'tail' dimensions are the same as the ending dimensions of
30 int tail_end = tail.dimensions_count() - 1;
33 // tail cannot be longer than shape.
39 if (shape.dims(shape_end - i) != tail.dims(tail_end - i)) {
49 // and the constant array shape is the tail of both the other input shape, and a
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
| posixpath.py | 75 # Split a path in head (everything up to the last '/') and tail (the
76 # rest). If the path ends in '/', tail will be empty. If there is no
81 """Split a pathname. Returns tuple "(head, tail)" where "tail" is
84 head, tail = p[:i], p[i:]
87 return head, tail
108 # Return the tail (basename) part of a path, same as split(path)[1].
299 tail = path[j:]
302 path += tail
|
| /external/mesa3d/src/compiler/glsl/ |
| lower_int64.cpp | 154 exec_node *const tail = v.function_list.tail_sentinel.prev; local
159 after->prev = tail;
160 tail->next = after;
304 exec_node *const tail = instructions.tail_sentinel.prev; local
309 after->prev = tail;
310 tail->next = after;
|
