/external/clang/test/Index/ |
H A D | recursive-member-access.c | 2 struct rdar8650865 *first; member in struct:rdar8650865 7 return ((((((s->first)->first) 8 ->first) 9 ->first) 10 ->first) 11 ->first) 12 ->first 13 ->first 14 ->first [all...] |
H A D | complete-macros.c | 21 #define variadic4(first, second, args, ...) 22 #define variadic5(first, second, args ...) 42 // CHECK-VARIADIC: macro definition:{TypedText variadic4}{LeftParen (}{Placeholder first}{Comma , }{Placeholder second}{Comma , }{Placeholder args, ...}{RightParen )} (70) 43 // CHECK-VARIADIC: macro definition:{TypedText variadic5}{LeftParen (}{Placeholder first}{Comma , }{Placeholder second}{Comma , }{Placeholder args...}{RightParen )} (70)
|
/external/smali/dexlib/src/main/java/org/jf/dexlib/Util/ |
H A D | Pair.java | 32 public final A first; field in class:Pair 35 public Pair(A first, B second) { argument 36 this.first = first;
|
/external/easymock/src/org/easymock/internal/matchers/ |
H A D | Not.java | 26 private final IArgumentMatcher first;
field in class:Not 28 public Not(IArgumentMatcher first) {
argument 29 this.first = first;
33 return !first.matches(actual);
38 first.appendTo(buffer);
|
/external/clang/test/Frontend/ |
H A D | verify-fatal.c | 3 #error first fatal 4 // expected-error@-1 {{first fatal}}
|
/external/elfutils/lib/ |
H A D | list.h | 54 #define CDBL_LIST_ADD_REAR(first, newp) \ 59 if (unlikely ((first) == NULL)) \ 60 (first) = _newp->next = _newp->previous = _newp; \ 63 _newp->next = (first); \ 64 _newp->previous = (first)->previous; \ 70 #define CDBL_LIST_DEL(first, elem) \ 74 assert (first != NULL && _elem != NULL \ 75 && (first != elem \ 76 || ({ __typeof (elem) _runp = first->next; \ 77 while (_runp != first) \ [all...] |
H A D | dynamicsizehash.c | 112 htab->table[idx].next = htab->first; 113 htab->first = &htab->table[idx]; 116 if (htab->first == NULL) 117 htab->first = htab->table[idx].next = &htab->table[idx]; 120 htab->table[idx].next = htab->first->next; 121 htab->first = htab->first->next = &htab->table[idx]; 135 __typeof__ (htab->first) first; 137 __typeof__ (htab->first) run [all...] |
/external/mesa3d/src/glsl/ |
H A D | ir_basic_block.h | 25 void (*callback)(ir_instruction *first,
|
/external/webkit/Source/WebCore/css/ |
H A D | Pair.h | 40 static PassRefPtr<Pair> create(PassRefPtr<CSSPrimitiveValue> first, PassRefPtr<CSSPrimitiveValue> second) argument 42 return adoptRef(new Pair(first, second)); 46 CSSPrimitiveValue* first() const { return m_first.get(); } function in class:WebCore::Pair 49 void setFirst(PassRefPtr<CSSPrimitiveValue> first) { m_first = first; } argument 54 Pair(PassRefPtr<CSSPrimitiveValue> first, PassRefPtr<CSSPrimitiveValue> second) argument 55 : m_first(first), m_second(second) { }
|
H A D | FontFamilyValue.cpp | 49 unsigned first = 0; local 52 first = i - 1; 54 if (!first) 56 length = first;
|
/external/qemu/distrib/sdl-1.2.15/src/stdlib/ |
H A D | SDL_qsort.c | 110 typedef struct { char * first; char * last; } stack_entry; member in struct:__anon11129 111 #define pushLeft {stack[stacktop].first=ffirst;stack[stacktop++].last=last;} 112 #define pushRight {stack[stacktop].first=first;stack[stacktop++].last=llast;} 113 #define doLeft {first=ffirst;llast=last;continue;} 114 #define doRight {ffirst=first;last=llast;continue;} 116 first=ffirst=stack[stacktop].first;\ 133 * 3. We choose a pivot by looking at the first, last 187 { size_t l=last-ffirst,r=llast-first; \ 282 pivot_big(char *first, char *mid, char *last, size_t size, int compare(const void *, const void *)) argument 325 char *first,*last; local 356 char *first,*last; local 387 char *first,*last; local [all...] |
/external/v8/test/mjsunit/regress/ |
H A D | regress-969.js | 40 function first(x, y) { return x; } function 48 function test0() { return first((y = 1, typeof x0), 2); } 57 function test1() { return first((y += 1, typeof x1), 2); } 64 function test2() { return first((++y, typeof x2), 2); } 70 function test3() { return first((y++, typeof x3), 2); } 79 function test4() { return first((o.x = 1, typeof x4), 2); } 85 function test5() { return first((o.x += 1, typeof x5), 2); } 91 function test6() { return first((++o.x, typeof x6), 2); } 97 function test7() { return first((o.x++, typeof x7), 2); } 106 function test8(index) { return first(( [all...] |
H A D | regress-931.js | 35 function first() { sequence += "1"; return o; } function 40 var result = (first()[second()](third(), fourth())) 46 var result = (first()[second_prime()](third(), fourth()))
|
/external/clang/test/SemaCXX/ |
H A D | non-empty-class-size-zero.cpp | 13 int first; member in struct:Y
|
/external/compiler-rt/BlocksRuntime/tests/ |
H A D | josh.C | 19 MyStruct first; // works local
|
H A D | localisglobal.c | 21 int aresame(void *first, void *second) { argument 22 long *f = (long *)first;
|
/external/freetype/src/cache/ |
H A D | ftcmru.c | 32 FTC_MruNode first = *plist; local 35 if ( first ) 37 FTC_MruNode last = first->prev; 42 FTC_MruNode cnode = first; 54 } while ( cnode != first ); 58 first->prev = node; 60 node->next = first; 76 FTC_MruNode first = *plist; local 79 FT_ASSERT( first != NULL ); 81 if ( first ! 125 FTC_MruNode first = *plist; local 207 FTC_MruNode first, node; local 331 FTC_MruNode first, node, next; local [all...] |
/external/apache-xml/src/main/java/org/apache/xml/dtm/ |
H A D | DTMAxisTraverser.java | 36 * for(int nodeHandle=myTraverser.first(myContext); 50 * an axis, the first function must be used to get the first node. 57 * @return the first node in the traversal. 59 public int first(int context) method in class:DTMAxisTraverser 67 * an axis, the first function must be used to get the first node. 76 * @return the first node in the traversal. 78 public int first(int context, int extendedTypeID) method in class:DTMAxisTraverser 90 * previous traversal step. For the first traversa [all...] |
/external/jsilver/src/com/google/clearsilver/jsilver/examples/basic/ |
H A D | hello-world.cs | 1 Hello <?cs var:name.first ?> <?cs var:name.last ?>.
|
/external/chromium-trace/trace-viewer/src/tracks/ |
H A D | timeline_thread_track.css | 11 /* The first row of slices in each thread should have a border above it. */ 12 .timeline-thread-track > .timeline-slice-group-track.first-visible-child > .timeline-slice-track.first-visible-child .timeline-canvas-based-track-canvas-container { 18 /* ...except for the very first one at the top. */ 19 .timeline-process-track.first-visible-child > .timeline-thread-track.first-visible-child > .timeline-slice-group-track.first-visible-child > .timeline-slice-track.first-visible-child .timeline-canvas-based-track-canvas-container { 24 .timeline-thread-track > .timeline-slice-group-track.first-visible-child .timeline-canvas-based-track:first [all...] |
/external/openssl/crypto/asn1/ |
H A D | t_x509a.c | 70 char oidstr[80], first; local 74 first = 1; 78 if(!first) BIO_puts(out, ", "); 79 else first = 0; 87 first = 1; 91 if(!first) BIO_puts(out, ", "); 92 else first = 0;
|
/external/v8/src/ |
H A D | data-flow.cc | 38 bool first = true; local 42 if (!first) PrintF(","); 43 first = false;
|
/external/v8/test/mjsunit/ |
H A D | cyrillic.js | 34 first: "\u0430", // a 49 first: "\u03b1", // alpha 69 var first = lc ? chars.first : chars.FIRST; 72 var first_other_case = lc ? chars.FIRST : chars.first; 76 assertTrue(Range(first, last).test(first), 1); 77 assertTrue(Range(first, last).test(middle), 2); 78 assertTrue(Range(first, last).test(last), 3); 80 assertFalse(Range(first, las [all...] |
/external/stlport/test/unit/ |
H A D | alg_test.cpp | 229 vector<int>::iterator first; local 230 first = find_first_of(intv.begin(), intv.end(), intsl.begin(), intsl.end()); 231 CPPUNIT_ASSERT( first != intv.end() ); 232 CPPUNIT_ASSERT( *first == 1 ); 241 vector<int>::iterator first; local 242 first = find_first_of(intv.begin(), intv.end(), intsl.begin(), intsl.end()); 243 CPPUNIT_ASSERT( first != intv.end() ); 244 CPPUNIT_ASSERT( *first == 2 ); 259 vector<int>::iterator first; local 260 first 271 vector<int>::iterator first; local 285 vector<int>::iterator first; local 299 vector<int>::iterator first; local 314 vector<int>::iterator first; local 328 vector<MyIntComparable>::iterator first; local [all...] |
/external/skia/src/core/ |
H A D | SkDeque.cpp | 104 Head* first = fFront; local 107 if (NULL == first->fBegin) { 109 first->fEnd = first->fStop; 110 begin = first->fStop - fElemSize; 112 begin = first->fBegin - fElemSize; 113 if (begin < first->start()) { // no more room in this chunk 117 first = (Head*)sk_malloc_throw(size); 118 first->init(size); 119 first 170 Head* first = fFront; local [all...] |