| /external/skqp/experimental/svg/model/ |
| SkPEG.h | 103 V(const typename E::V& head, const typename Seq<Es...>::V& tail)
104 : fHeadV(head), fTailV(tail) {}
|
| /external/skqp/src/gpu/ |
| GrRenderTargetOpList.cpp | 158 // We process ops in chain b from head to tail. We attempt to merge with nodes in a, starting
159 // at chain a's tail and working toward the head. We produce one of the following outcomes:
162 // 3) b's head is popped from chain a and added at the tail of a.
163 // After result 3 we don't want to attempt to merge the next head of b with the new tail of a,
165 // original tail of a and start our iteration of a there. We also track the bounds of the nodes
166 // appended to chain a that will be skipped for bounds testing. If the original tail of a is
167 // merged into an op in b (case 2) then we advance the "original tail" towards the head of a.
168 GrOp* origATail = chainA.tail();
173 bool noSkip = (origATail == chainA.tail());
180 (a == chainA.tail()) || can_reorder(a->bounds(), forwardMergeBounds)
[all...] |
| /external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| basic_block.h | 82 // Otherwise return null. May be used whenever tail() can be used.
87 // Otherwise return null. May be used whenever tail() can be used.
119 iterator tail() { function in class:spvtools::opt::BasicBlock
124 // Returns a const iterator, but othewrise similar to tail().
191 Instruction* terminator() { return &*tail(); }
|
| /external/u-boot/drivers/nvme/ |
| nvme.c | 146 u16 tail = nvmeq->sq_tail; local
148 memcpy(&nvmeq->sq_cmds[tail], cmd, sizeof(*cmd));
149 flush_dcache_range((ulong)&nvmeq->sq_cmds[tail],
150 (ulong)&nvmeq->sq_cmds[tail] + sizeof(*cmd));
152 if (++tail == nvmeq->q_depth)
153 tail = 0;
154 writel(tail, nvmeq->q_db);
155 nvmeq->sq_tail = tail;
|
| /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/h/ |
| PCCTSAST.cpp | 98 register PCCTS_AST *child, *sibling=NULL, *tail=NULL /*MR23*/, *w;
local
111 if ( sibling == NULL ) {sibling = child; tail = w;}
112 else {tail->setRight(child); tail = w;}
311 tail()
function in class:PCCTS_AST
|
| /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/h/ |
| PCCTSAST.cpp | 98 register PCCTS_AST *child, *sibling=NULL, *tail, *w;
local
111 if ( sibling == NULL ) {sibling = child; tail = w;}
112 else {tail->setRight(child); tail = w;}
297 tail()
function in class:PCCTS_AST
|
| /external/eigen/test/ |
| block.cpp | 119 VERIFY_IS_EQUAL(v1.template tail<2>(), v1.block(i,0,2,1));
120 VERIFY_IS_EQUAL(v1.template tail<2>(), v1.tail(2));
121 VERIFY_IS_EQUAL(v1.template tail<2>(), v1.segment(i,2));
122 VERIFY_IS_EQUAL(v1.template tail<2>(), v1.template segment<2>(i));
|
| /external/guava/guava-tests/benchmark/com/google/common/util/concurrent/ |
| ExecutionListBenchmark.java | 393 // A version of the ExecutionList that uses an explicit tail pointer to keep the nodes in order
401 private RunnableExecutorPair tail;
414 tail = newTail;
416 tail.next = newTail;
417 tail = newTail;
434 tail = null;
|
| /external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
| nv50_ir_util.h | 425 Interval() : head(0), tail(0) { }
435 inline int end() const { checkTail(); return tail ? tail->end : -1; }
474 Range *tail;
582 assert(tail == r);
|
| /external/python/cpython2/Lib/idlelib/ |
| EditorWindow.py | 692 head, tail = os.path.split(filename)
693 base, ext = os.path.splitext(tail)
[all...] |
| /external/python/cpython3/Lib/tkinter/ |
| filedialog.py | 189 head, tail = os.path.split(self.get_selection())
190 if tail == os.curdir: tail = ''
191 self.set_selection(tail)
260 head, tail = os.path.split(file)
|
| /external/python/cpython3/Tools/iobench/ |
| iobench.py | 405 tail = chunk[:size % len(chunk)]
406 # Adjust tail to end on a character boundary
409 tail.decode(TEXT_ENCODING)
412 tail = tail[:-1]
415 f.write(tail)
|
| /external/u-boot/tools/ |
| mkimage.c | 631 int tail; local
697 tail = size % 4;
698 if ((pad == 1) && (tail != 0)) {
700 if (write(ifd, (char *)&zero, 4-tail) != 4-tail) {
|
| /frameworks/base/cmds/incident_helper/src/ |
| ih_util.cpp | 37 const auto tail = s.find_last_not_of(charset); local
38 return s.substr(head, tail - head + 1);
191 const auto tail = line->find_last_not_of(DEFAULT_WHITESPACE); local
192 if (tail == std::string::npos) return false;
195 int j = tail;
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| arithmetic_optimizer.cc | 1097 NodeDef* tail = node; variable
1203 NodeDef* tail = GetTailOfValuePreservingChain(*node, *ctx().node_map, variable
1549 NodeDef* tail; local
1597 const NodeDef* tail = link.node; local
1629 NodeDef* tail = CHECK_NOTNULL(link.node); local
2098 NodeDef* tail = GetTailOfValuePreservingChain(*conv, *ctx().node_map, variable
2156 AddToOptimizationQueue(tail); variable
[all...] |
| /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
| IterablesTest.java | 593 Iterable<String> tail = skip(list, 1);
594 Iterator<String> tailIterator = tail.iterator();
603 Iterable<String> tail = skip(set, 1);
606 assertThat(tail).iteratesAs("c", "A", "B", "C");
611 Iterable<String> tail = skip(list, 1);
614 assertThat(tail).iteratesAs("B", "C", "a");
619 Iterable<String> tail = skip(set, 2);
622 assertFalse(tail.iterator().hasNext());
627 Iterable<String> tail = skip(list, 2);
629 assertTrue(Iterables.isEmpty(tail));
[all...] |
| /external/skia/tests/ |
| PathOpsDebug.cpp | 1082 const SkOpSpanBase* tail = segment->tail(); local
1083 SkOpAngle* angle = tail->fromAngle();
1115 const SkOpSpanBase* tail = segment->tail(); local
1116 const SkOpPtT* ptT = tail->ptT();
1151 const SkOpSpanBase* tail = segment->tail(); local
1152 if (tail->debugID() == id) {
1153 return tail;
[all...] |
| /external/skqp/tests/ |
| PathOpsDebug.cpp | 1082 const SkOpSpanBase* tail = segment->tail(); local
1083 SkOpAngle* angle = tail->fromAngle();
1115 const SkOpSpanBase* tail = segment->tail(); local
1116 const SkOpPtT* ptT = tail->ptT();
1151 const SkOpSpanBase* tail = segment->tail(); local
1152 if (tail->debugID() == id) {
1153 return tail;
[all...] |
| /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/ |
| fset2.c | 195 Tree *child, *sibling=NULL, *tail=NULL;
local
216 if ( sibling == NULL ) {sibling = child; tail = w;}
217 else {tail->right = child; tail = w;}
520 /* find tail of children */
542 Tree *tail=NULL, *r;
local
573 TRAV(p->p1, k, rk, tail);
579 if ( p->jtype==RuleBlk ) {p->lock[k] = FALSE; return tail;}
580 r = tmake(tnode(ALT), tail, NULL);
586 if ( tail==NULL ) {TRAV(alt->p1, k, rk, tail); r->down = tail;}
782 Tree *n, *tail = NULL; local
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/ |
| test_xml_etree.py | 92 if elem.tail:
93 elem.tail = elem.tail.replace("\r\n", "\n")
123 if not hasattr(element, "tail"):
124 print "no tail member"
130 if element.tail is not None:
131 check_string(element.tail)
577 <element>text</element>tail
585 <ns0:element>text</ns0:element>tail
599 <element>text</element>tail
[all...] |
| test_mmap.py | 648 def _make_test_file(self, num_zeroes, tail):
655 f.write(tail)
681 tail = b' DEARdear '
682 start = boundary - len(tail) // 2
683 end = start + len(tail)
684 with self._make_test_file(start, tail) as f:
687 self.assertEqual(m[start:end], tail)
|
| /external/python/cpython2/Modules/ |
| _elementtree.c | 15 * 2005-01-13 fl use tagged pointers for tail/text (cElementTree 0.9)
117 that all use of text and tail as object pointers must be wrapped in
258 PyObject* tail; member in struct:__anon36630
342 self->tail = Py_None;
470 PyObject *res = self->tail;
478 self->tail = tmp;
562 Py_DECREF(JOIN_OBJ(self->tail));
600 _set_joined_ptr(&self->tail, Py_None);
623 Py_INCREF(JOIN_OBJ(self->tail));
624 _set_joined_ptr(&element->tail, self->tail)
653 PyObject* tail; local
[all...] |
| /external/python/cpython3/Lib/idlelib/ |
| editor.py | [all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
| mhlib.py | 365 head, dir, tail = seq[:i], '', seq[i+1:]
366 if tail[:1] in '-+':
367 dir, tail = tail[:1], tail[1:]
368 if not isnumeric(tail):
371 count = int(tail)
[all...] |
| /external/guice/core/src/com/google/inject/spi/ |
| InjectionPoint.java | 493 InjectableMember tail; field in class:InjectionPoint.InjectableMembers
497 head = tail = member;
499 member.previous = tail;
500 tail.next = member;
501 tail = member;
515 if (tail == member) {
516 tail = member.previous;
[all...] |
