/external/python/cpython2/Lib/ |
posixpath.py | 77 # Split a path in head (everything up to the last '/') and tail (the 78 # rest). If the path ends in '/', tail will be empty. If there is no 83 """Split a pathname. Returns tuple "(head, tail)" where "tail" is 86 head, tail = p[:i], p[i:] 89 return head, tail 110 # Return the tail (basename) part of a path, same as split(path)[1]. 313 tail = path[j:] 319 path += tail
|
/external/python/cpython3/Modules/_sqlite/ |
statement.c | 32 static int pysqlite_check_remaining_sql(const char* tail); 53 const char* tail; local 100 &tail); 105 if (rc == SQLITE_OK && pysqlite_check_remaining_sql(tail)) { 390 static int pysqlite_check_remaining_sql(const char* tail) 392 const char* pos = tail;
|
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/lib2to3/fixes/ |
fix_except.py | 42 tail=(['except' ':' (simple_stmt | suite)]
50 tail = [n.clone() for n in results["tail"]]
92 children = [c.clone() for c in node.children[:3]] + try_cleanup + tail
|
/external/antlr/runtime/C/include/ |
antlr3commontreenodestream.h | 255 /// Add new lookahead at lookahead[tail]. tail wraps around at the 256 /// end of the lookahead buffer so tail could be less than head. 258 ANTLR3_UINT32 tail; member in struct:ANTLR3_COMMON_TREE_NODE_STREAM_struct 327 ANTLR3_UINT32 tail; member in struct:ANTLR3_TREE_WALK_STATE_struct
|
/external/chromium-trace/catapult/common/py_vulcanize/third_party/rcssmin/_setup/py3/ |
shell.py | 288 head, tail = _os.path.split(dest) 289 while tail: 290 aslist.append(tail) 291 head, tail = _os.path.split(head) 314 head, tail = _os.path.split(dest) 315 while tail: 316 aslist.append(tail) 317 head, tail = _os.path.split(head)
|
/external/chromium-trace/catapult/common/py_vulcanize/third_party/rjsmin/_setup/py3/ |
shell.py | 288 head, tail = _os.path.split(dest) 289 while tail: 290 aslist.append(tail) 291 head, tail = _os.path.split(head) 314 head, tail = _os.path.split(dest) 315 while tail: 316 aslist.append(tail) 317 head, tail = _os.path.split(head)
|
/external/eigen/Eigen/src/SVD/ |
UpperBidiagonalization.h | 117 mat.col(k).tail(remainingRows) 121 .applyHouseholderOnTheLeft(mat.col(k).tail(remainingRows-1), mat.coeff(k,k), tempData); 126 mat.row(k).tail(remainingCols) 130 .applyHouseholderOnTheRight(mat.row(k).tail(remainingCols-1).transpose(), mat.coeff(k,k+1), tempData); 185 SubColumnType v_k = A.col(k).tail(remainingRows); 203 SubColumnType y_k( Y.col(k).tail(remainingCols) ); 216 SubRowType u_k( A.row(k).tail(remainingCols) ); 232 SubColumnType x_k ( X.col(k).tail(remainingRows-1) );
|
/external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
qrsolv.h | 45 sdiag.tail(n-j).setZero(); 78 wa.tail(n-nsing).setZero();
|
/external/jemalloc/include/jemalloc/internal/ |
ph.h | 84 a_type *tail = NULL; \ 93 * its tail, so we do a single pass over the sibling list to \ 105 head = tail = phn0; \ 126 phn_next_set(a_type, a_field, tail, \ 128 tail = phn0; \ 131 phn_next_set(a_type, a_field, tail, \ 133 tail = phn0; \ 155 phn_next_set(a_type, a_field, tail, \ 157 tail = phn0; \
|
/external/jemalloc_new/include/jemalloc/internal/ |
ph.h | 85 a_type *tail = NULL; \ 94 * its tail, so we do a single pass over the sibling list to \ 107 head = tail = phn0; \ 128 phn_next_set(a_type, a_field, tail, \ 130 tail = phn0; \ 133 phn_next_set(a_type, a_field, tail, \ 135 tail = phn0; \ 158 phn_next_set(a_type, a_field, tail, \ 160 tail = phn0; \
|
/external/libcups/ |
update_libcups.sh | 33 NEW_REV=$(git tag -l | grep -v "release" | grep -v "b" | grep -v "rc" | sort | tail -n1)
|
/external/linux-kselftest/tools/testing/selftests/rcutorture/bin/ |
kvm-test-1-run.sh | 231 oldline="`tail $resdir/console.log`" 242 newline="`tail $resdir/console.log`" 247 last_ts="`tail $resdir/console.log | grep '^\[ *[0-9]\+\.[0-9]\+]' | tail -1 | sed -e 's/^\[ *//' -e 's/\..*$//'`"
|
parse-torture.sh | 52 nerrs=`grep --binary-files=text '!!!' $file | tail -1 | awk '{for (i=NF-8;i<=NF;i++) sum+=$i; } END {print sum}'`
|
/external/ltp/testcases/kernel/fs/quota_remount/ |
quota_remount_test01.sh | 106 BLOCKS=`quota -f $MNTDIR -v -w | tail -n 1 | sed -e 's/ *[^ ]* *\([0-9]*\) .*/\1/'` 115 NEWBLOCKS=`quota -f $MNTDIR -v -w | tail -n 1 | sed -e 's/ *[^ ]* *\([0-9]*\) .*/\1/'`
|
/external/ltp/testcases/kernel/hotplug/cpu_hotplug/functional/ |
cpuhotplug05.sh | 106 offline_status=$(tail -n 1 "$LOG_FILE") 132 online_status=$(tail -n 1 "$LOG_FILE")
|
/external/ltp/testscripts/ |
ltp-scsi_debug.sh | 170 cat /proc/partitions | awk '{print $4}' | tail -n 4 > $TMPBASE/partition-test 172 part1=$(cat $TMPBASE/partition-test | tail -n 1) 174 part2=$(cat $TMPBASE/partition-test | head -n 3 | tail -n 1) 176 part3=$(cat $TMPBASE/partition-test | head -n 2 | tail -n 1)
|
/external/mesa3d/bin/ |
get-fixes-pick-list.sh | 48 id=`echo "$fixes" | tail -n $fixes_count | head -n 1 | cut -d : -f 2`
|
/external/python/cpython2/Lib/lib2to3/fixes/ |
fix_except.py | 42 tail=(['except' ':' (simple_stmt | suite)] 50 tail = [n.clone() for n in results["tail"]] 92 children = [c.clone() for c in node.children[:3]] + try_cleanup + tail
|
/external/skia/src/pathops/ |
SkOpContour.cpp | 18 SkAssertResult(segment->addCurveTo(segment->head(), segment->tail(), path)); 27 SkAssertResult(segment->addCurveTo(segment->tail(), segment->head(), path));
|
/external/skqp/src/pathops/ |
SkOpContour.cpp | 18 SkAssertResult(segment->addCurveTo(segment->head(), segment->tail(), path)); 27 SkAssertResult(segment->addCurveTo(segment->tail(), segment->head(), path));
|
/external/toybox/tests/ |
mount.test | 11 root_fs_type=`blkid -o value $root_fs | tail -1`
|
/external/tremolo/Tremolo/ |
framing.c | 227 the buffer preceeding pos and 'head'/'tail' are the buffer past the 229 'head/tail' are NULL */ 230 static ogg_reference *ogg_buffer_split(ogg_reference **tail, 236 ogg_reference *ret=*tail; 237 ogg_reference *or=*tail; 255 *tail=or->next; 261 *tail=*head=0; 271 /* make a new reference to tail the second piece */ 272 *tail=_fetch_ref(or->buffer->ptr.owner); 274 (*tail)->buffer=or->buffer [all...] |
/external/mesa3d/src/compiler/nir/ |
nir_lower_vars_to_ssa.c | 143 for (nir_deref *tail = deref->deref.child; tail; tail = tail->child) { 144 switch (tail->deref_type) { 146 nir_deref_struct *deref_struct = nir_deref_as_struct(tail); 152 deref_node_create(node, tail->type, state->dead_ctx); 159 nir_deref_array *arr = nir_deref_as_array(tail); 172 deref_node_create(node, tail->type, state->dead_ctx); 179 node->indirect = deref_node_create(node, tail->type [all...] |
nir.c | 712 /* This is the second step in the recursion. We've found the tail and made a 717 deref_foreach_leaf_build_recur(nir_deref_var *deref, nir_deref *tail, 726 assert(tail->child == NULL); 727 switch (glsl_get_base_type(tail->type)) { 738 if (glsl_type_is_vector_or_scalar(tail->type)) 744 tmp.arr.deref.type = glsl_get_array_element(tail->type); 747 tail->child = &tmp.arr.deref; 749 length = glsl_get_length(tail->type); 760 tail->child = &tmp.str.deref; 762 length = glsl_get_length(tail->type) 843 const nir_deref *tail = &deref->deref; local [all...] |
/external/syzkaller/vendor/google.golang.org/grpc/transport/ |
controlbuf.go | 42 tail *itemNode 47 if il.tail == nil { 48 il.head, il.tail = n, n 51 il.tail.next = n 52 il.tail = n 68 il.tail = nil 75 il.head, il.tail = nil, nil 201 tail *outStream 205 head, tail := new(outStream), new(outStream) 206 head.next = tail [all...] |