| /external/clang/test/Index/ |
| D | recursive-member-access.c | 2 struct rdar8650865 *first; member
7 return ((((((s->first)->first) in test_rdar8650865()
8 ->first) in test_rdar8650865()
9 ->first) in test_rdar8650865()
10 ->first) in test_rdar8650865()
11 ->first) in test_rdar8650865()
12 ->first in test_rdar8650865()
13 ->first in test_rdar8650865()
14 ->first in test_rdar8650865()
15 ->first in test_rdar8650865()
[all …]
|
| /external/chromium_org/third_party/libjingle/source/talk/xmllite/ |
| D | xmlnsstack_unittest.cc | 46 EXPECT_EQ(std::string(NS_XML), stack.NsForPrefix("xml").first); in TEST()
47 EXPECT_EQ(std::string(NS_XMLNS), stack.NsForPrefix("xmlns").first); in TEST()
48 EXPECT_EQ("", stack.NsForPrefix("").first); in TEST()
50 EXPECT_EQ("xml", stack.PrefixForNs(NS_XML, false).first); in TEST()
51 EXPECT_EQ("xmlns", stack.PrefixForNs(NS_XMLNS, false).first); in TEST()
52 EXPECT_EQ("", stack.PrefixForNs("", false).first); in TEST()
53 EXPECT_EQ("", stack.PrefixForNs("", true).first); in TEST()
63 EXPECT_EQ("ns3", stack.NsForPrefix("pre1").first); in TEST()
65 EXPECT_EQ("ns2", stack.NsForPrefix("pre2").first); in TEST()
66 EXPECT_EQ("ns4", stack.NsForPrefix("").first); in TEST()
[all …]
|
| /external/qemu/distrib/sdl-1.2.15/src/stdlib/ |
| D | SDL_qsort.c | 110 typedef struct { char * first; char * last; } stack_entry; member
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;\
187 { size_t l=last-ffirst,r=llast-first; \
199 if ((size_t)(last-first)>PIVOT_THRESHOLD*sz) mid=pivot_big(first,mid,last,sz,compare);\
201 if (compare(first,mid)<0) { \
204 if (compare(first,mid)>0) swapper(first,mid);\
[all …]
|
| /external/elfutils/lib/ |
| D | list.h | 54 #define CDBL_LIST_ADD_REAR(first, newp) \ argument
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) \ argument
74 assert (first != NULL && _elem != NULL \
75 && (first != elem \
76 || ({ __typeof (elem) _runp = first->next; \
77 while (_runp != first) \
[all …]
|
| D | dynamicsizehash.c | 112 htab->table[idx].next = htab->first; in insert_entry_2()
113 htab->first = &htab->table[idx]; in insert_entry_2()
116 if (htab->first == NULL) in insert_entry_2()
117 htab->first = htab->table[idx].next = &htab->table[idx]; in insert_entry_2()
120 htab->table[idx].next = htab->first->next; in insert_entry_2()
121 htab->first = htab->first->next = &htab->table[idx]; in insert_entry_2()
135 __typeof__ (htab->first) first; in insert_entry_2() local
137 __typeof__ (htab->first) runp; in insert_entry_2()
150 first = htab->first; in insert_entry_2()
151 htab->first = NULL; in insert_entry_2()
[all …]
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/draw/ |
| D | draw_pt_util.c | 38 void draw_pt_split_prim(unsigned prim, unsigned *first, unsigned *incr) in draw_pt_split_prim() argument
42 *first = 1; in draw_pt_split_prim()
46 *first = 2; in draw_pt_split_prim()
51 *first = 2; in draw_pt_split_prim()
55 *first = 4; in draw_pt_split_prim()
59 *first = 4; in draw_pt_split_prim()
63 *first = 3; in draw_pt_split_prim()
67 *first = 6; in draw_pt_split_prim()
73 *first = 3; in draw_pt_split_prim()
77 *first = 6; in draw_pt_split_prim()
[all …]
|
| /external/mesa3d/src/gallium/auxiliary/draw/ |
| D | draw_pt_util.c | 38 void draw_pt_split_prim(unsigned prim, unsigned *first, unsigned *incr) in draw_pt_split_prim() argument
42 *first = 1; in draw_pt_split_prim()
46 *first = 2; in draw_pt_split_prim()
51 *first = 2; in draw_pt_split_prim()
55 *first = 4; in draw_pt_split_prim()
59 *first = 4; in draw_pt_split_prim()
63 *first = 3; in draw_pt_split_prim()
67 *first = 6; in draw_pt_split_prim()
73 *first = 3; in draw_pt_split_prim()
77 *first = 6; in draw_pt_split_prim()
[all …]
|
| /external/webrtc/src/system_wrappers/source/spreadsortlib/ |
| D | spreadsort.hpp | 125 …spread_sort_rec(RandomAccessIter first, RandomAccessIter last, std::vector<RandomAccessIter> &bin_… in spread_sort_rec() argument
131 find_extremes(first, last, max, min); in spread_sort_rec()
136 …unsigned log_divisor = get_log_divisor(last - first, rough_log_2_size((size_t)(*max >> 0) - (*min … in spread_sort_rec()
144 for (RandomAccessIter current = first; current != last;) in spread_sort_rec()
147 bins[0] = first; in spread_sort_rec()
153 RandomAccessIter nextbinstart = first; in spread_sort_rec()
187 size_t max_count = get_max_count(log_divisor, last - first); in spread_sort_rec()
188 RandomAccessIter lastPos = first; in spread_sort_rec()
242 …spread_sort_rec(RandomAccessIter first, RandomAccessIter last, std::vector<RandomAccessIter> &bin_… in spread_sort_rec() argument
246 find_extremes(first, last, max, min, comp); in spread_sort_rec()
[all …]
|
| /external/chromium_org/third_party/freetype/src/cache/ |
| D | ftcmru.c | 32 FTC_MruNode first = *plist; in FTC_MruNode_Prepend() local
35 if ( first ) in FTC_MruNode_Prepend()
37 FTC_MruNode last = first->prev; in FTC_MruNode_Prepend()
42 FTC_MruNode cnode = first; in FTC_MruNode_Prepend()
54 } while ( cnode != first ); in FTC_MruNode_Prepend()
58 first->prev = node; in FTC_MruNode_Prepend()
60 node->next = first; in FTC_MruNode_Prepend()
76 FTC_MruNode first = *plist; in FTC_MruNode_Up() local
79 FT_ASSERT( first != NULL ); in FTC_MruNode_Up()
81 if ( first != node ) in FTC_MruNode_Up()
[all …]
|
| /external/freetype/src/cache/ |
| D | ftcmru.c | 32 FTC_MruNode first = *plist; in FTC_MruNode_Prepend() local
35 if ( first ) in FTC_MruNode_Prepend()
37 FTC_MruNode last = first->prev; in FTC_MruNode_Prepend()
42 FTC_MruNode cnode = first; in FTC_MruNode_Prepend()
54 } while ( cnode != first ); in FTC_MruNode_Prepend()
58 first->prev = node; in FTC_MruNode_Prepend()
60 node->next = first; in FTC_MruNode_Prepend()
76 FTC_MruNode first = *plist; in FTC_MruNode_Up() local
79 FT_ASSERT( first != NULL ); in FTC_MruNode_Up()
81 if ( first != node ) in FTC_MruNode_Up()
[all …]
|
| /external/llvm/unittests/ADT/ |
| D | MapVectorTest.cpp | 21 ASSERT_EQ(R.first, MV.begin()); in TEST()
22 EXPECT_EQ(R.first->first, 1); in TEST()
23 EXPECT_EQ(R.first->second, 2); in TEST()
27 ASSERT_EQ(R.first, MV.begin()); in TEST()
28 EXPECT_EQ(R.first->first, 1); in TEST()
29 EXPECT_EQ(R.first->second, 2); in TEST()
33 ASSERT_NE(R.first, MV.end()); in TEST()
34 EXPECT_EQ(R.first->first, 4); in TEST()
35 EXPECT_EQ(R.first->second, 5); in TEST()
47 ASSERT_NE(R.first, MV.end()); in TEST()
[all …]
|
| /external/v8/test/mjsunit/ |
| D | cyrillic.js | 34 first: "\u0430", // a property
49 first: "\u03b1", // alpha property
69 var first = lc ? chars.first : chars.FIRST; variable
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, last).test(first_other_case), 4);
81 assertFalse(Range(first, last).test(middle_other_case), 5);
82 assertFalse(Range(first, last).test(last_other_case), 6);
[all …]
|
| /external/chromium_org/v8/test/mjsunit/ |
| D | cyrillic.js | 34 first: "\u0430", // a property
49 first: "\u03b1", // alpha property
69 var first = lc ? chars.first : chars.FIRST; variable
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, last).test(first_other_case), 4);
81 assertFalse(Range(first, last).test(middle_other_case), 5);
82 assertFalse(Range(first, last).test(last_other_case), 6);
[all …]
|
| /external/chromium-trace/trace-viewer/src/base/ |
| D | sorted_array_utils.js | 76 var first = findLowIndexInSortedArray(ary, mapLoFn, loVal);
77 if (first == 0) {
84 } else if (first < ary.length) {
85 if (loVal >= mapLoFn(ary[first]) &&
86 loVal < mapLoFn(ary[first]) + mapWidthFn(ary[first], first)) {
87 return first;
88 } else if (loVal >= mapLoFn(ary[first - 1]) &&
89 loVal < mapLoFn(ary[first - 1]) +
90 mapWidthFn(ary[first - 1], first - 1)) {
91 return first - 1;
[all …]
|
| /external/skia/src/core/ |
| D | SkDeque.cpp | 78 Block* first = fFrontBlock; in push_front() local
81 if (NULL == first->fBegin) { in push_front()
83 first->fEnd = first->fStop; in push_front()
84 begin = first->fStop - fElemSize; in push_front()
86 begin = first->fBegin - fElemSize; in push_front()
87 if (begin < first->start()) { // no more room in this chunk in push_front()
89 first = this->allocateBlock(fAllocCount); in push_front()
90 first->fNext = fFrontBlock; in push_front()
91 fFrontBlock->fPrev = first; in push_front()
92 fFrontBlock = first; in push_front()
[all …]
|
| /external/chromium_org/third_party/skia/src/core/ |
| D | SkDeque.cpp | 78 Block* first = fFrontBlock; in push_front() local
81 if (NULL == first->fBegin) { in push_front()
83 first->fEnd = first->fStop; in push_front()
84 begin = first->fStop - fElemSize; in push_front()
86 begin = first->fBegin - fElemSize; in push_front()
87 if (begin < first->start()) { // no more room in this chunk in push_front()
89 first = this->allocateBlock(fAllocCount); in push_front()
90 first->fNext = fFrontBlock; in push_front()
91 fFrontBlock->fPrev = first; in push_front()
92 fFrontBlock = first; in push_front()
[all …]
|
| /external/stlport/test/unit/ |
| D | alg_test.cpp | 229 vector<int>::iterator first; in find_first_of_test() local
230 first = find_first_of(intv.begin(), intv.end(), intsl.begin(), intsl.end()); in find_first_of_test()
231 CPPUNIT_ASSERT( first != intv.end() ); in find_first_of_test()
232 CPPUNIT_ASSERT( *first == 1 ); in find_first_of_test()
241 vector<int>::iterator first; in find_first_of_test() local
242 first = find_first_of(intv.begin(), intv.end(), intsl.begin(), intsl.end()); in find_first_of_test()
243 CPPUNIT_ASSERT( first != intv.end() ); in find_first_of_test()
244 CPPUNIT_ASSERT( *first == 2 ); in find_first_of_test()
259 vector<int>::iterator first; in find_first_of_test() local
260 first = find_first_of(intv.begin(), intv.end(), intl.begin(), intl.end()); in find_first_of_test()
[all …]
|
| /external/chromium_org/third_party/WebKit/Source/core/css/ |
| D | Pair.h | 43 …static PassRefPtr<Pair> create(PassRefPtr<CSSPrimitiveValue> first, PassRefPtr<CSSPrimitiveValue> … in create() argument
45 return adoptRef(new Pair(first, second, identicalValuesPolicy)); in create()
48 CSSPrimitiveValue* first() const { return m_first.get(); } in first() function
52 void setFirst(PassRefPtr<CSSPrimitiveValue> first) { m_first = first; } in setFirst() argument
58 return generateCSSString(first()->cssText(), second()->cssText(), m_identicalValuesPolicy); in cssText()
71 first()->customSerializeResolvingVariables(variables), in serializeResolvingVariables()
76 …bool hasVariableReference() const { return first()->hasVariableReference() || second()->hasVariabl… in hasVariableReference()
84 …Pair(PassRefPtr<CSSPrimitiveValue> first, PassRefPtr<CSSPrimitiveValue> second, IdenticalValuesPol… in Pair() argument
85 : m_first(first) in Pair()
89 …static String generateCSSString(const String& first, const String& second, IdenticalValuesPolicy i… in generateCSSString() argument
[all …]
|
| /external/chromium_org/v8/test/mjsunit/regress/ |
| 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((o[index] = 1, typeof x8), 2); }
[all …]
|
| /external/v8/test/mjsunit/regress/ |
| 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((o[index] = 1, typeof x8), 2); }
[all …]
|
| /external/chromium_org/tools/perf/metrics/ |
| D | rendering_stats_unittest.py | 140 first = (i == 0)
141 AddMainThreadRenderingStats(timer, renderer_main, first, ref_stats)
142 AddImplThreadRenderingStats(timer, renderer_compositor, first, ref_stats)
143 AddMainThreadRenderingStats(timer, browser_main, first, None)
144 AddImplThreadRenderingStats(timer, browser_compositor, first, None)
149 first = (i == 0)
150 AddMainThreadRenderingStats(timer, renderer_main, first, None)
151 AddImplThreadRenderingStats(timer, renderer_compositor, first, None)
152 AddMainThreadRenderingStats(timer, browser_main, first, None)
153 AddImplThreadRenderingStats(timer, browser_compositor, first, None)
[all …]
|
| /external/mockito/src/org/mockito/ |
| D | AdditionalMatchers.java | 575 public static boolean and(boolean first, boolean second) { in and() argument
590 public static byte and(byte first, byte second) { in and() argument
605 public static char and(char first, char second) { in and() argument
620 public static double and(double first, double second) { in and() argument
635 public static float and(float first, float second) { in and() argument
650 public static int and(int first, int second) { in and() argument
665 public static long and(long first, long second) { in and() argument
680 public static short and(short first, short second) { in and() argument
697 public static <T> T and(T first, T second) { in and() argument
712 public static boolean or(boolean first, boolean second) { in or() argument
[all …]
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/ |
| D | DERObjectIdentifier.java | 80 boolean first = true; in DERObjectIdentifier()
91 if (first) in DERObjectIdentifier()
107 first = false; in DERObjectIdentifier()
128 if (first) in DERObjectIdentifier()
132 first = false; in DERObjectIdentifier()
234 int first = Integer.parseInt(tok.nextToken()) * 40; in doOutput() local
239 writeField(aOut, first + Long.parseLong(secondToken)); in doOutput()
243 writeField(aOut, new BigInteger(secondToken).add(BigInteger.valueOf(first))); in doOutput()
361 char first = identifier.charAt(0); in isValidIdentifier() local
362 if (first < '0' || first > '2') in isValidIdentifier()
[all …]
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| D | DTMDefaultBaseTraversers.java | 256 public int first(int context) in first() method in DTMDefaultBaseTraversers.AncestorOrSelfTraverser
273 public int first(int context, int expandedTypeID) in first() method in DTMDefaultBaseTraversers.AncestorOrSelfTraverser
408 public int first(int context) in first() method in DTMDefaultBaseTraversers.ChildTraverser
427 public int first(int context, int expandedTypeID) in first() method in DTMDefaultBaseTraversers.ChildTraverser
679 public int first(int context, int expandedTypeID) in first() method in DTMDefaultBaseTraversers.DescendantTraverser
785 public int first(int context) in first() method in DTMDefaultBaseTraversers.DescendantOrSelfTraverser
840 public int first(int context) in first() method in DTMDefaultBaseTraversers.FollowingTraverser
845 int first; in first() local
851 first = _firstch(context); in first()
853 if (NULL != first) in first()
[all …]
|
| /external/opencv/cv/src/ |
| D | _cvkdtree.hpp | 84 int dimension_of_highest_variance(__instype * first, __instype * last, in dimension_of_highest_variance() argument
86 assert(last - first > 0); in dimension_of_highest_variance()
92 for (__instype * k = first; k < last; ++k) in dimension_of_highest_variance()
94 mean /= last - first; in dimension_of_highest_variance()
96 for (__instype * k = first; k < last; ++k) { in dimension_of_highest_variance()
100 var /= last - first; in dimension_of_highest_variance()
117 __instype * median_partition(__instype * first, __instype * last, in median_partition() argument
119 assert(last - first > 0); in median_partition()
120 __instype *k = first + (last - first) / 2; in median_partition()
121 median_partition(first, last, k, dim, ctor); in median_partition()
[all …]
|