| /external/v8/test/mjsunit/regress/ |
| regress-97116.js | 40 inner(should_deopt);
43 function inner(should_deopt) { function
|
| /external/v8/test/mjsunit/ |
| stack-traces.js | 63 eval("function Outer() { eval('function Inner() { eval(x); }'); Inner(); }; Outer();");
72 var innerEval = 'function Inner() { eval(x); }\n//@ sourceURL=res://inner-eval';
73 eval("function Outer() { eval(innerEval); Inner(); }; Outer();\n//@ sourceURL=res://outer-eval");
242 testTrace("testNestedEval", testNestedEval, ["eval at Inner (eval at Outer"]);
246 [" at Inner (res://inner-eval:1:20)",
|
| /external/valgrind/main/ |
| README_DEVELOPERS | 141 (1) Check out 2 trees, "Inner" and "Outer". Inner runs the app
142 directly. Outer runs Inner.
144 (2) Configure inner with --enable-inner and build/install as
152 --tool=cachegrind -v inner/.../bin/valgrind --tool=none -v prog
154 If you omit the --trace-children=yes, you'll only monitor Inner's launcher
158 for you to get some useful performance data. Inner has most of
|
| /frameworks/support/v7/appcompat/src/android/support/v7/internal/view/menu/ |
| MenuItemWrapperJB.java | 38 public ActionProviderWrapperJB(ActionProvider inner) {
39 super(inner);
|
| /packages/apps/Dialer/res/drawable/ |
| seek_bar_thumb.xml | 33 <!-- Second item is the inner almost-opaque sphere.
35 Looks like using left, right, top and bottom on the item is best to fix inner sphere. -->
|
| /packages/apps/UnifiedEmail/src/com/android/mail/browse/ |
| AttachmentLoader.java | 48 private AttachmentCursor(Cursor inner) {
49 super(inner);
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/unittest/ |
| signals.py | 60 def inner(*args, **kwargs): function in function:removeHandler
67 return inner
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/unittest/ |
| signals.py | 60 def inner(*args, **kwargs): function in function:removeHandler
67 return inner
|
| /sdk/emulator/qtools/ |
| bbprof.cpp | 14 MyStaticRec *inner; // pointer to an inner basic block member in struct:MyStaticRec
90 blocks[ii].inner = NULL;
109 for (MyStaticRec *bptr = blocks[bb_num].inner; bptr; bptr = bptr->inner)
113 for (MyStaticRec *bptr = &blocks[bb_num]; bptr; bptr = bptr->inner) {
200 // Create pointers to inner blocks and break up the enclosing block
210 sorted[ii]->inner = sorted[ii + 1];
|
| /external/chromium_org/tools/json_schema_compiler/ |
| code_test.py | 19 .Append('inner')
22 .Append('inner')
24 .Append('inner')
30 ' inner\n'
33 ' inner\n'
35 ' inner\n'
|
| /external/elfutils/tests/ |
| sectiondump.c | 158 size_t inner; local
162 for (inner = 0; inner < 16 && cnt + inner < size; ++inner)
163 printf (" %02hhx", buf[cnt + inner]);
|
| /external/javassist/src/main/javassist/bytecode/ |
| InnerClassesAttribute.java | 161 * @param inner <code>inner_class_info_index</code>
166 public void append(String inner, String outer, String name, int flags) {
167 int i = constPool.addClassInfo(inner);
176 * @param inner <code>inner_class_info_index</code>
181 public void append(int inner, int outer, int name, int flags) {
191 ByteArray.write16bit(inner, newData, len);
|
| /external/llvm/test/CodeGen/ARM/ |
| lsr-unfolded-offset.ll | 31 br label %inner.loop
33 inner.loop: ; preds = %for.inc, %outer.loop
39 if.end: ; preds = %inner.loop
61 for.inc: ; preds = %if.end, %if.then66, %inner.loop
62 %overlap.4 = phi i32 [ %overlap.178, %inner.loop ], [ 1, %if.then66 ], [ %overlap.3, %if.end ]
65 br i1 %exitcond, label %for.inc69, label %inner.loop
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseMatrix.h | 137 /** \returns a const pointer to the array of inner indices.
141 /** \returns a non-const pointer to the array of inner indices.
146 /** \returns a const pointer to the array of the starting positions of the inner vectors.
150 /** \returns a non-const pointer to the array of the starting positions of the inner vectors.
155 /** \returns a const pointer to the array of the number of non zeros of the inner vectors.
159 /** \returns a non-const pointer to the array of the number of non zeros of the inner vectors.
174 const Index inner = IsRowMajor ? col : row; local
176 return m_data.atInRange(m_outerIndex[outer], end, inner);
190 const Index inner = IsRowMajor ? col : row; local
197 const Index p = m_data.searchLowerIndex(start,end-1,inner);
750 const Index inner = IsRowMajor ? col : row; local
873 const Index inner = IsRowMajor ? col : row; local
904 const Index inner = IsRowMajor ? col : row; local
[all...] |
| /external/chromium_org/base/threading/ |
| sequenced_worker_pool.cc | 263 // Inner ----------------------------------------------------------------------
265 class SequencedWorkerPool::Inner {
269 Inner(SequencedWorkerPool* worker_pool, size_t max_threads,
273 ~Inner();
474 DISALLOW_COPY_AND_ASSIGN(Inner);
498 // Just jump back to the Inner object to run the thread, since it has all the
500 // using DelegateSimpleThread and have Inner implement the Delegate to avoid
508 // Inner definitions ---------------------------------------------------------
510 SequencedWorkerPool::Inner::Inner(
[all...] |
| /external/chromium_org/third_party/skia/src/animator/ |
| SkDisplayXMLParser.cpp | 62 SkString inner; local
63 getErrorString(&inner);
64 inner.prepend(": ");
65 inner.prependS32(getLineNumber());
66 inner.prepend(", line ");
67 inner.prepend(src);
68 parent->setErrorNoun(inner);
|
| /external/skia/src/animator/ |
| SkDisplayXMLParser.cpp | 62 SkString inner; local
63 getErrorString(&inner);
64 inner.prepend(": ");
65 inner.prependS32(getLineNumber());
66 inner.prepend(", line ");
67 inner.prepend(src);
68 parent->setErrorNoun(inner);
|
| /external/skia/tests/ |
| RegionTest.cpp | 117 static bool slow_contains(const SkRegion& outer, const SkRegion& inner) {
119 tmp.op(outer, inner, SkRegion::kUnion_Op);
129 static bool slow_intersects(const SkRegion& outer, const SkRegion& inner) {
131 return tmp.op(outer, inner, SkRegion::kIntersect_Op);
191 SkRegion inner; local
192 randRgn(rand, &inner, 2);
193 proc(reporter, outer, inner);
|
| /packages/apps/Camera2/src/com/android/camera/crop/ |
| CropObject.java | 55 public void resetBoundsTo(RectF inner, RectF outer) {
56 mBoundedRect.resetTo(0, outer, inner);
93 RectF inner = mBoundedRect.getInner(); local
94 CropMath.fixAspectRatioContained(inner, width, height);
95 if (inner.width() < mMinSideSize || inner.height() < mMinSideSize) {
101 mBoundedRect.setInner(inner);
|
| /sdk/docs/ |
| Notes_on_WST_StructuredDocument.txt | 132 iterate over inner regions:
135 // process inner regions
148 Also note that each outer region has a type, but the inner regions also reuse a similar type.
152 Surprisingly, the inner regions do not have many access methods we can use on them, except their
162 If you want the text of the inner region, you actually need to query it from the outer region.
164 methods, some of which return details on the inner regions:
178 list seems the most useful scenario. There's no actual iterator provided for inner regions.
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkLineClipper.cpp | 79 // returns true if outer contains inner, even if inner is empty.
80 // note: outer.contains(inner) always returns false if inner is empty.
82 const SkRect& inner) {
83 return outer.fLeft <= inner.fLeft && outer.fTop <= inner.fTop &&
84 outer.fRight >= inner.fRight && outer.fBottom >= inner.fBottom;
|
| /external/chromium_org/third_party/skia/src/xml/ |
| SkJSDisplayable.cpp | 193 for (int inner = 0; inner < infoCount; inner++) {
194 if (info[inner].fType == SkType_BaseClassInfo)
196 propertySpec[inner].name = info[inner].fName;
197 propertySpec[inner].tinyid = inner;
198 propertySpec[inner].flags = JSPROP_ENUMERATE;
|
| /external/eigen/unsupported/Eigen/src/SparseExtra/ |
| RandomSetter.h | 190 // compute number of bits needed to store inner indices
225 const Index inner = it->first & keyBitsMask; local
232 mp_target->insertBackByOuterInner(outer, inner) = it->second.value;
270 const Index inner = (it->first >> m_keyBitsOffset) + outerOffset; local
278 while ( (i >= posStart) && (mp_target->innerIndexPtr()[i] > inner) )
284 mp_target->innerIndexPtr()[i+1] = inner;
296 const Index inner = SetterRowMajor ? col : row; local
298 const Index outerMinor = outer & OuterPacketMask; // index of the inner vector in the packet
299 const KeyType key = (KeyType(outerMinor)<<m_keyBitsOffset) | inner;
|
| /external/llvm/test/Transforms/IndVarSimplify/ |
| lftr-reuse.ll | 44 ; been simplified. As a result, the inner loop's exit test will not be
57 br i1 %cmp2, label %inner.ph, label %outer.inc
59 inner.ph:
60 br label %inner
62 ; CHECK: inner:
65 inner:
66 %j = phi i32 [ 0, %inner.ph ], [ %j.inc, %inner ]
69 br i1 %cmp3, label %inner, label %outer.inc
|
| /external/skia/src/core/ |
| SkLineClipper.cpp | 79 // returns true if outer contains inner, even if inner is empty.
80 // note: outer.contains(inner) always returns false if inner is empty.
82 const SkRect& inner) {
83 return outer.fLeft <= inner.fLeft && outer.fTop <= inner.fTop &&
84 outer.fRight >= inner.fRight && outer.fBottom >= inner.fBottom;
|
