/external/chromium_org/third_party/skia/gm/ |
H A D | testimagefilters.cpp | 44 SkImageFilter* first = SkOffsetImageFilter::Create(SkIntToScalar(16), SkIntToScalar(16)); local 46 SkAutoUnref aur0(first); 48 return SkMergeImageFilter::Create(first, second);
|
/external/chromium_org/third_party/skia/include/core/ |
H A D | SkPathEffect.h | 95 SkPath fFirst; // If not empty, contains geometry for first point 182 /** Construct a pathEffect whose effect is to apply first the inner pathEffect 220 (e.g. first(path) + second(path)) 221 The reference counts for first and second are both incremented in the constructor, 224 static SkSumPathEffect* Create(SkPathEffect* first, SkPathEffect* second) { argument 225 return SkNEW_ARGS(SkSumPathEffect, (first, second)); 234 SkSumPathEffect(SkPathEffect* first, SkPathEffect* second) argument 235 : INHERITED(first, second) {}
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkRecordPattern.h | 100 // It first matches Matcher (something from above), then Pattern (another Cons or Nil). 104 // - first, second, and third return the data stored by their respective matchers in the pattern. 117 // Starting from *end, walk through the SkRecord to find the first span matching this pattern. 129 // Once either match or search has succeeded, access the stored data of the first, second, 132 template <typename T> T* first() { return fHead.get(); } function in class:SkRecords::Cons 163 // All Cons are friends with each other. This lets first, second, and third work.
|
/external/chromium_org/third_party/skia/src/gpu/gl/ |
H A D | GrGLNameAllocator.cpp | 23 * Return the beginning of the range. first() is guaranteed to be allocated. 25 * @return The first name in the range. 27 GrGLuint first() const { return fFirst; } function in class:GrGLNameAllocator::SparseNameRange 81 * @return The first name appended. 144 if (fLeft->end() + 1 == fRight->first()) { 158 SkASSERT(fLeft->end() + 1 < fRight->first()); 183 SkASSERT(fLeft->first() == fFirst - count); 260 SkASSERT(fLeft->end() < fRight->first()); // There must be a gap between left and right. 261 fFirst = fLeft->first(); 276 ContiguousNameRange(GrGLuint first, GrGLuin argument [all...] |
/external/chromium_org/third_party/skia/src/pdf/ |
H A D | SkPDFCatalog.cpp | 111 int first = -1; local 116 // first = fCatalog.count() - fFirstPageCount; 121 stream->writeDecAsText(first + 1); 123 stream->writeDecAsText(last - first + 1); 126 if (first == -1) { 128 first++; 130 for (int i = first; i <= last; i++) { 155 // Check if the original is on first page.
|
/external/chromium_org/third_party/sqlite/src/ext/fts1/ |
H A D | fts1_hash.h | 36 fts1HashElem *first; /* The first element of the array */ member in struct:fts1Hash 42 fts1HashElem *chain; /* Pointer to first entry with this hash */ 101 #define fts1HashFirst(H) ((H)->first)
|
/external/chromium_org/third_party/sqlite/src/ext/fts3/ |
H A D | fts3_hash.h | 36 Fts3HashElem *first; /* The first element of the array */ member in struct:Fts3Hash 40 Fts3HashElem *chain; /* Pointer to first entry with this hash */ 101 #define fts3HashFirst(H) ((H)->first)
|
/external/chromium_org/third_party/webrtc/base/ |
H A D | stringutils.cc | 123 std::string::size_type first = s.find_first_not_of(kWhitespace); local 126 if (first == std::string::npos || last == std::string::npos) { 130 return s.substr(first, last - first + 1);
|
/external/chromium_org/third_party/webrtc/libjingle/xmllite/ |
H A D | xmlnsstack.cc | 72 return match.second && (match.first == ns); 96 std::string prefix(PrefixForNs(name.Namespace(), isAttr).first); 137 size_t first = last; local 139 while (first > 0) { 140 if (!IsAsciiLetter(ns[first - 1])) 142 first -= 1; 144 if (last - first > 4) 145 last = first + 3; 146 std::string candidate(AsciiLower(ns.substr(first, last - first))); [all...] |
/external/chromium_org/third_party/zlib/ |
H A D | crc32.c | 16 protection on the static variables used to control the first-use generation 18 first call get_crc_table() to initialize the tables before allowing more than 102 The first table is simply the CRC of all possible eight bit values. This is 114 static volatile int first = 1; /* flag to limit concurrent making */ local 120 if (first) { 121 first = 0; 138 and then the byte reversal of those as well as the first table */ 152 else { /* not first */ 400 /* apply len2 zeros to crc1 (first square will put the operator for one
|
/external/chromium_org/tools/ipc_fuzzer/ipclist/ |
H A D | ipclist.cc | 117 bool first = true; local 121 if (!first) 123 first = false;
|
/external/chromium_org/tools/json_schema_compiler/test/ |
H A D | arrays_unittest.cc | 309 base::DictionaryValue* first = new base::DictionaryValue(); local 310 first->SetInteger("val", 1); 311 expected_argument->Append(first);
|
/external/chromium_org/tools/relocation_packer/src/ |
H A D | elf_file_unittest.cc | 99 void CheckFileContentsEqual(FILE* first, FILE* second) { argument 100 ASSERT_EQ(0, fseek(first, 0, SEEK_SET)); 108 size_t first_read = fread(first_buffer, 1, sizeof(first_buffer), first); 113 } while (!feof(first) && !feof(second)); 115 EXPECT_TRUE(feof(first) && feof(second));
|
/external/chromium_org/v8/src/ |
H A D | regexp.js | 127 // Calculate the substring of the first match before creating the result array 128 // to avoid an unnecessary write barrier storing the first result. 129 var first = %_SubString(STRING, start, end); variable 131 result[0] = first; 306 // last pair (after the first pair) of elements of the capture array even if 349 // The properties $1..$9 are the first nine capturing substrings of the last
|
/external/clang/lib/StaticAnalyzer/Core/ |
H A D | SVals.cpp | 68 /// the first symbolic parent region is returned. 282 bool first = true; local 284 if (first) { 285 os << ' '; first = false;
|
/external/deqp/framework/delibs/decpp/ |
H A D | deRandom.hpp | 58 void choose (InputIter first, InputIter last, OutputIter result, int numItems); 61 T choose (InputIter first, InputIter last); 65 T chooseWeighted (InputIter first, InputIter last, WeightIter weight); 68 void shuffle (Iterator first, Iterator last); 103 void Random::choose (InputIter first, InputIter last, OutputIter result, int numItems) argument 110 for (ndx = 0; first != last; ++first, ++ndx) 113 *(result + ndx) = *first; 118 *(result + r) = *first; 126 T Random::choose (InputIter first, InputIte argument 135 chooseWeighted(InputIter first, InputIter last, WeightIter weight) argument 166 shuffle(Iterator first, Iterator last) argument [all...] |
/external/deqp/modules/gles31/functional/ |
H A D | es31fTextureBufferTests.cpp | 62 bool first = true; local 70 stream << (first ? "" : "_") << bitInfos[infoNdx].str; 71 first = false; 93 bool first = true; local 101 stream << (first ? "" : "_") << bitInfos[infoNdx].str; 102 first = false;
|
/external/deqp/modules/gles31/stress/ |
H A D | es31sDrawTests.cpp | 77 deUint32 first; member in struct:deqp::gles31::Stress::__anon20379::DrawArraysCommand 240 drawCommand.first = (m_op == INVALID_DATA_FIRST) ? (overBoundDrawCount) : (0); 248 << "\n\tfirst\t" << drawCommand.first 464 spec.first = random.chooseWeighted<int, const int*, const float*> (DE_ARRAY_BEGIN(firsts), DE_ARRAY_END(firsts), firstWeights);
|
/external/droiddriver/src/com/google/android/droiddriver/finders/ |
H A D | Predicates.java | 72 public static <T> Predicate<T> allOf(final Predicate<? super T> first, argument 74 if (first == null || first == ANY) { 78 return (Predicate<T>) first; 84 return first.apply(input) && second.apply(input); 89 return "allOf(" + first + ", " + second + ")";
|
/external/e2fsprogs/e2fsck/ |
H A D | message.c | 107 * below. The first character in the string is the index letter. An 242 int *first, int recurse) 253 if (*first && islower(*str)) { 254 *first = 0; 257 print_e2fsck_message(f, ctx, str, pctx, *first, recurse+1); 399 char ch, int width, int *first, 430 if (*first && islower(m[0])) 523 struct problem_context *pctx, int first, 534 expand_at_expression(f, ctx, *cp, pctx, &first, 551 &first, pct 240 expand_at_expression(FILE *f, e2fsck_t ctx, char ch, struct problem_context *pctx, int *first, int recurse) argument 398 expand_percent_expression(FILE *f, ext2_filsys fs, char ch, int width, int *first, struct problem_context *ctx) argument 522 print_e2fsck_message(FILE *f, e2fsck_t ctx, const char *msg, struct problem_context *pctx, int first, int recurse) argument [all...] |
H A D | mtrace.h | 131 size_t first; /* First free fragment of the block. */ member in struct:__anon20447::__anon20448::__anon20449::__anon20450 138 (that may be the first of a free cluster). */ 147 /* Pointer to first block of the heap. */
|
/external/eigen/Eigen/src/SparseCore/ |
H A D | SparseColEtree.h | 57 * \param firstRowElt The column index of the first element in each row 72 //Compute first nonzero column in each row 91 centered at its first vertex, which has the same fill. */ 127 * Depth-first search from vertex n. No recursion. 133 Index current = n, first, next; local 137 first = first_kid(current); 140 if (first == -1) 165 current = first; 197 // Depth-first search from dummy root vertex #n
|
/external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
H A D | IterationController.h | 98 bool first() { return m_nit == 0; } function in class:Eigen::IterationController
|
/external/elfutils/0.153/libdwfl/ |
H A D | dwfl_report_elf.c | 87 bool first = true; local 102 unless we just layed out the first section at 0 when 108 /* This is the first section assigned a location. 155 if (first || end < shdr->sh_addr + shdr->sh_size) 157 if (first || bias > shdr->sh_addr) 169 first = false;
|
/external/fio/lib/ |
H A D | prio_tree.c | 78 struct prio_tree_node *first = NULL, *prev, *last = NULL; local 89 if (first == NULL) { 90 first = root->prio_tree_node; 92 INIT_PRIO_TREE_NODE(first); 93 last = first; 106 if (first) { 107 node->left = first; 108 first->parent = node; 395 * Get the first prio_tree_node that overlaps with the interval [radix_index,
|