Searched refs:terms (Results 1 - 25 of 114) sorted by relevance

12345

/external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/
H A Dexpr.c73 ptr->terms[0].type = YASM_EXPR_NONE;
74 ptr->terms[1].type = YASM_EXPR_NONE;
76 ptr->terms[0] = *left; /* structure copy */
86 while (ptr->terms[0].type == YASM_EXPR_EXPR &&
87 ptr->terms[0].data.expn->op == YASM_EXPR_IDENT) {
88 sube = ptr->terms[0].data.expn;
89 ptr->terms[0] = sube->terms[0]; /* structure copy */
99 ptr->terms[1] = *right; /* structure copy */
109 while (ptr->terms[
[all...]
H A Dvalue.c134 /* Yes, this has a maximum upper bound on 32 terms, based on an
135 * "insane number of terms" (and ease of implementation) WAG.
165 yasm__fatal(N_("expression on line %d has too many add terms;"
179 if (e->terms[i].type != YASM_EXPR_EXPR)
181 sube = e->terms[i].data.expn;
191 if (sube->terms[0].type == YASM_EXPR_INT &&
192 sube->terms[1].type == YASM_EXPR_SYM) {
193 intn = sube->terms[0].data.intn;
194 sym = sube->terms[1].data.sym;
195 } else if (sube->terms[
[all...]
H A Dsection.c850 /* span terms in absolute portion of value */
851 yasm_span_term *terms; member in struct:yasm_span
898 span->terms = NULL;
934 span->terms = yasm_xrealloc(span->terms,
937 span->terms[subst].precbc = precbc;
938 span->terms[subst].precbc2 = precbc2;
939 span->terms[subst].span = span;
940 span->terms[subst].subst = subst;
945 span->terms[subs
[all...]
/external/chromium_org/v8/test/mjsunit/es6/
H A Dmath-log1p.js25 var terms = [];
28 terms.push(prod / i);
32 while (terms.length > 0) sum += terms.pop();
/external/chromium_org/components/bookmarks/browser/
H A Dbookmark_index.cc66 // represents a set of terms (as an interator into the Index) matching the
67 // query as well as the set of nodes that contain those terms in their titles.
69 // List of terms matching the query.
70 std::list<Index::const_iterator> terms; member in struct:bookmarks::BookmarkIndex::Match
72 // The set of nodes matching the terms. As an optimization this is empty
75 // the set of matching nodes is terms.front()->second.
78 // it handles the necessary switching between nodes and terms.front().
92 return nodes.empty() ? terms.front()->second.begin() : nodes.begin();
96 return nodes.empty() ? terms.front()->second.end() : nodes.end();
112 std::vector<base::string16> terms
140 std::vector<base::string16> terms = ExtractQueryWords(query); local
333 std::vector<base::string16> terms; local
337 parser.ParseQueryWords(base::i18n::ToLower(query), &terms); local
[all...]
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/arch/x86/
H A Dx86expr.c160 switch (e->terms[i].type) {
181 if (yasm_expr__contains(e->terms[i].data.expn,
195 x86_expr_checkea_distcheck_reg(&e->terms[i].data.expn,
201 } else if (yasm_expr__contains(e->terms[i].data.expn,
221 if (e->terms[havereg_expr].type != YASM_EXPR_EXPR ||
222 e->terms[havereg_expr].data.expn->op != YASM_EXPR_ADD)
226 for (i=0; i<e->terms[havereg_expr].data.expn->numterms; i++) {
231 ne->terms[havereg_expr] =
232 e->terms[havereg_expr].data.expn->terms[
[all...]
/external/chromium_org/chrome/browser/resources/chromeos/login/
H A Doobe_screen_terms_of_service.css6 #terms-of-service {
15 #terms-of-service .step-contents {
20 #terms-of-service h1 {
44 #terms-of-service h2 {
63 #terms-of-service p {
70 #terms-of-service p + p {
91 #terms-of-service.error #tos-back-button {
/external/wpa_supplicant_8/hs20/server/www/
H A Dfree-remediation.php9 <p>Terms and conditions have changed. You need to accept the new terms
/external/chromium_org/third_party/markdown/extensions/
H A Ddef_list.py74 terms = [l.strip() for l in raw_block[:m.start()].split('\n') if l.strip()]
86 if not terms and sibling is None:
91 if not terms and sibling.tag == 'p':
92 # The previous paragraph contains the terms
94 terms = sibling.text.split('\n')
109 # Add terms
110 for term in terms:
/external/linux-tools-perf/perf-3.12.0/tools/perf/tests/
H A Dpmu.c127 static LIST_HEAD(terms);
131 list_add_tail(&test_terms[i].list, &terms);
133 return &terms;
140 struct list_head *terms = test_terms_list(); local
155 ret = perf_pmu__config_terms(&formats, &attr, terms);
/external/markdown/markdown/extensions/
H A Ddef_list.py37 terms = [l.strip() for l in block[:m.start()].split('\n') if l.strip()]
45 if not terms and sibling.tag == 'p':
46 # The previous paragraph contains the terms
48 terms = sibling.text.split('\n')
63 # Add terms
64 for term in terms:
/external/linux-tools-perf/perf-3.12.0/tools/perf/scripts/perl/Perf-Trace-Util/lib/Perf/Trace/
H A DContext.pm48 it under the same terms as Perl itself, either Perl version 5.10.0 or,
51 Alternatively, this software may be distributed under the terms of the
H A DUtil.pm87 it under the same terms as Perl itself, either Perl version 5.10.0 or,
90 Alternatively, this software may be distributed under the terms of the
/external/chromium_org/chrome/renderer/safe_browsing/
H A Dphishing_term_feature_extractor_unittest.cc37 base::hash_set<std::string> terms; local
38 terms.insert("one");
39 terms.insert("one one");
40 terms.insert("two");
41 terms.insert("multi word test");
42 terms.insert("capitalization");
43 terms.insert("space");
44 terms.insert("separator");
45 terms.insert("punctuation");
47 terms
[all...]
/external/chromium_org/chrome/common/extensions/docs/examples/api/downloads/download_links/
H A Dpopup.js65 var terms = filterValue.split(' ');
67 for (var termI = 0; termI < terms.length; ++termI) {
68 var term = terms[termI];
/external/linux-tools-perf/perf-3.12.0/tools/perf/util/
H A Dparse-events.h34 extern int parse_events_terms(struct list_head *terms, const char *str);
72 struct list_head *terms; member in struct:parse_events_terms
84 void parse_events__free_terms(struct list_head *terms);
H A Dpmu.c15 struct list_head terms; member in struct:perf_pmu_alias
113 INIT_LIST_HEAD(&alias->terms);
114 ret = parse_events_terms(&alias->terms, buf);
188 struct list_head *terms)
194 list_for_each_entry(term, &alias->terms, list) {
202 list_splice(&list, terms);
424 * Support only for hardcoded and numnerial terms.
425 * Hardcoded terms should be already in, so nothing
454 * non-hardcoded terms, here's the place to translate
476 * 1) users input - specified in terms paramete
187 pmu_alias_terms(struct perf_pmu_alias *alias, struct list_head *terms) argument
[all...]
/external/chromium_org/chrome/browser/first_run/
H A Dfirst_run_internal_win.cc102 std::string terms = l10n_util::GetStringUTF8(IDS_TERMS_HTML); local
103 return (!terms.empty() &&
105 base::WriteFile(*eula_path, terms.data(), terms.size()) != -1);
/external/chromium_org/v8/test/mjsunit/
H A Dsin-cos.js77 // We sum up in the reverse order for higher precision, as we expect the terms
90 var terms = [];
92 terms.push(sign * x / factorial[i]);
96 return precision_sum(terms);
103 var terms = [1];
105 terms.push(sign * x / factorial[i]);
109 return precision_sum(terms);
/external/chromium_org/chrome/browser/
H A Dchrome_process_finder_win.cc122 base::string16 terms; local
123 base::win::MetroLaunchType launch = base::win::GetMetroLaunchParams(&terms);
127 std::string query = EscapeQueryParamValue(base::UTF16ToUTF8(terms), true);
/external/chromium_org/third_party/sqlite/src/test/
H A Dfts3_common.tcl128 # This function returns a list of all terms present in the segments
223 # Return a list consisting of alternating terms (strings) and doclists
228 set terms [list]
238 lappend terms $zTerm $doclist
242 return $terms
/external/smali/
H A DREADME.md9 - [#smali on freenode](http://webchat.freenode.net/?channels=smali) - Free free to drop by and ask a question. Don't expect an instant response, but if you hang around someone will respond. Think of it more in terms of.. multi-player notepad.
/external/chromium_org/chrome/browser/autocomplete/
H A Dshortcuts_provider.h100 int CalculateScore(const base::string16& terms,
/external/chromium_org/chrome/browser/history/
H A Dscored_history_match.cc54 const String16Vector& terms,
75 for (String16Vector::const_iterator iter = terms.begin(); iter != terms.end();
112 (!url_matches_.empty() && (terms.size() == 1)) ?
113 URLPrefix::BestURLPrefix(base::UTF8ToUTF16(gurl.spec()), terms[0]) :
154 terms.size(), url, terms_to_word_starts_offsets, word_starts);
178 if (base::UTF8ToUTF16(gurl.host()) == terms[0])
429 // to give it credit for. For instance, terms that appear in the middle
438 // TODO(mpearson): If there are multiple terms, consider taking the
49 ScoredHistoryMatch( const URLRow& row, const VisitInfoVector& visits, const std::string& languages, const base::string16& lower_string, const String16Vector& terms, const WordStarts& terms_to_word_starts_offsets, const RowWordStarts& word_starts, const base::Time now, HistoryClient* history_client) argument
/external/chromium_org/third_party/devscripts/
H A Dlicensecheck.pl10 # it under the terms of the GNU General Public License as published by
126 You are free to redistribute this code under the terms of the GNU
424 You are free to redistribute this code under the terms of the
460 if ($licensetext =~ /is (free software.? you can redistribute it and\/or modify it|licensed) under the terms of (version [^ ]+ of )?the (GNU (Library |Lesser )General Public License|LGPL)/i or
461 $licensetext =~ /(is distributed|may be used|can redistribute).*terms.*(LGPL|(Lesser|Library) GNU General Public License)/) {
469 if ($licensetext =~ /is free software.? you (can|may) redistribute it and\/or modify it under the terms of (?:version [^ ]+ (?:\(?only\)? )?of )?the GNU General Public License/i) {
471 } elsif ($licensetext =~ /is distributed under the terms of the GNU General Public License,/
474 } elsif ($licensetext =~ /is distributed.*terms.*[^L]GPL/) {
482 if ($licensetext =~ /This file is part of the .*Qt GUI Toolkit. This file may be distributed under the terms of the Q Public License as defined/) {
484 } elsif ($licensetext =~ /may be distributed under the terms o
[all...]

Completed in 919 milliseconds

12345