HomeSort by relevance Sort by last modified time
    Searched refs:term (Results 1 - 25 of 299) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /bionic/libc/bionic/
isatty.c 36 struct termios term; local
38 return tcgetattr (fd, &term) == 0;
  /external/chromium_org/third_party/sqlite/src/test/
make-where7.tcl 31 set term($expr) $a
36 set term($expr) $x
38 set term($expr) $a
40 set term($expr) {}
42 lappend term($expr) $a
44 lappend term($expr) $a
46 lappend term($expr) $a
49 lappend term($expr) $a
51 lappend term($expr) $a
71 set term(b<0) {
    [all...]
  /external/dropbear/
netbsd_getpass.c 63 struct termios term; local
93 (void)tcgetattr(fileno(fp), &term); local
94 if ((echo = (term.c_lflag & ECHO)) != 0) {
95 term.c_lflag &= ~ECHO;
96 (void)tcsetattr(fileno(fp), TCSAFLUSH /*|TCSASOFT*/, &term); local
107 term.c_lflag |= ECHO;
108 (void)tcsetattr(fileno(fp), TCSAFLUSH/*|TCSASOFT*/, &term); local
  /external/grub/stage2/
terminfo.c 34 struct terminfo term = variable in typeref:struct:terminfo
222 grub_putstr (grub_tparm (term.cursor_address, y, x));
229 grub_putstr (grub_tparm (term.clear_screen));
236 grub_putstr (grub_tparm (term.enter_standout_mode));
243 grub_putstr (grub_tparm (term.exit_standout_mode));
250 grub_memmove (&term, new, sizeof (struct terminfo));
257 grub_memmove (copy, &term, sizeof (struct terminfo));
console.c 22 #include <term.h>
  /external/openssh/openbsd-compat/
readpassphrase.c 60 struct termios term, oterm; local
110 memcpy(&term, &oterm, sizeof(term));
112 term.c_lflag &= ~(ECHO | ECHONL);
114 if (term.c_cc[VSTATUS] != _POSIX_VDISABLE)
115 term.c_cc[VSTATUS] = _POSIX_VDISABLE;
117 (void)tcsetattr(input, _T_FLUSH, &term);
119 memset(&term, 0, sizeof(term));
120 term.c_lflag |= ECHO
    [all...]
  /external/ganymed-ssh2/src/main/java/ch/ethz/ssh2/packets/
PacketSessionPtyRequest.java 19 public String term; field in class:PacketSessionPtyRequest
26 public PacketSessionPtyRequest(int recipientChannelID, boolean wantReply, String term,
32 this.term = term;
49 tw.writeString(term);
  /external/llvm/utils/lit/lit/
ProgressBar.py 18 >>> term = TerminalController()
19 >>> print('This is '+term.GREEN+'green'+term.NORMAL)
24 >>> term = TerminalController()
25 >>> print(term.render('This is ${GREEN}green${NORMAL}'))
35 >>> term = TerminalController()
36 >>> if term.CLEAR_SCREEN:
212 def __init__(self, term, header, useETA=True):
213 self.term = term
    [all...]
  /external/srec/seti/sltsEngine/include/
CSWIslts.h 34 SWIsltsResult term();
  /hardware/qcom/bt/libbt-vendor/src/
userial_vendor.c 84 struct termios term; local
123 if (tcgetattr(fd, &term) < 0)
130 cfmakeraw(&term);
135 term.c_cflag |= (CRTSCTS | CLOCAL);
137 if (tcsetattr(fd, TCSANOW, &term) < 0)
  /external/chromium/chrome/browser/bookmarks/
bookmark_index.cc 27 // when we match only one term, and is filled in when we get more than one
28 // term. We can do this as when we have only one matching term we know
158 bool BookmarkIndex::GetBookmarksWithTitleMatchingTerm(const string16& term,
161 Index::const_iterator i = index_.lower_bound(term);
165 if (!QueryParser::IsWordLongEnoughForPrefixSearch(term)) {
166 // Term is too short for prefix match, compare using exact match.
167 if (i->first != term)
168 return false; // No bookmarks with this term.
178 // This is the first term and we're doing a prefix match. Loop throug
    [all...]
bookmark_index.h 92 // Populates |matches| for the specified term. If |first_term| is true, this
93 // is the first term in the query. Returns true if there is at least one node
94 // matching the term.
95 bool GetBookmarksWithTitleMatchingTerm(const string16& term,
124 void RegisterNode(const string16& term, const BookmarkNode* node);
127 void UnregisterNode(const string16& term, const BookmarkNode* node);
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/
lp_test_blend.c 244 double *term)
250 term[0] = factor[0]; /* R */
251 term[1] = factor[1]; /* G */
252 term[2] = factor[2]; /* B */
255 term[0] = factor[0] * src[0]; /* R */
256 term[1] = factor[1] * src[1]; /* G */
257 term[2] = factor[2] * src[2]; /* B */
260 term[0] = factor[0] * src[3]; /* R */
261 term[1] = factor[1] * src[3]; /* G */
262 term[2] = factor[2] * src[3]; /* B *
    [all...]
lp_bld_blend_soa.c 102 * Indexes are: factor[src,dst][color,term][r,g,b,a]
108 * Indexes are: term[src,dst][r,g,b,a]
110 LLVMValueRef term[2][4]; member in struct:lp_build_blend_soa_context
123 * Compute src/first term RGB
289 if(j < i && bld.term[k][j])
290 bld.term[k][i] = bld.term[k][j];
292 bld.term[k][i] = lp_build_mul(&bld.base, bld.factor[k][0][i], bld.factor[k][1][i]);
306 bld.term[k][i] = lp_build_mul(&bld.base, bld.factor[k][0][i],
322 bld.term[0][j] == bld.term[0][i] &
    [all...]
  /external/mesa3d/src/gallium/drivers/llvmpipe/
lp_test_blend.c 244 double *term)
250 term[0] = factor[0]; /* R */
251 term[1] = factor[1]; /* G */
252 term[2] = factor[2]; /* B */
255 term[0] = factor[0] * src[0]; /* R */
256 term[1] = factor[1] * src[1]; /* G */
257 term[2] = factor[2] * src[2]; /* B */
260 term[0] = factor[0] * src[3]; /* R */
261 term[1] = factor[1] * src[3]; /* G */
262 term[2] = factor[2] * src[3]; /* B *
    [all...]
lp_bld_blend_soa.c 102 * Indexes are: factor[src,dst][color,term][r,g,b,a]
108 * Indexes are: term[src,dst][r,g,b,a]
110 LLVMValueRef term[2][4]; member in struct:lp_build_blend_soa_context
123 * Compute src/first term RGB
289 if(j < i && bld.term[k][j])
290 bld.term[k][i] = bld.term[k][j];
292 bld.term[k][i] = lp_build_mul(&bld.base, bld.factor[k][0][i], bld.factor[k][1][i]);
306 bld.term[k][i] = lp_build_mul(&bld.base, bld.factor[k][0][i],
322 bld.term[0][j] == bld.term[0][i] &
    [all...]
  /external/chromium_org/chrome/browser/history/android/
android_cache_database.h 49 // Add a row in the search_term table with the given |term| and
52 SearchTermID AddSearchTerm(const string16& term,
58 // Get SearchTermRow of the given |term|; return the row id on success.
61 SearchTermID GetSearchTerm(const string16& term, SearchTermRow* row);
97 // When Android Client require update the search term, the search term can't
99 // deleting the old search term then inserting a new one, but the ID given
101 // table is used to mapping the ID given to client to the search term.
103 // The search term last visit time is stored in date as Android needs the time
android_cache_database_unittest.cc 76 string16 search_term1(UTF8ToUTF16("search term 1"));
81 EXPECT_EQ(search_term1, row1.term);
88 update_row1.term = (UTF8ToUTF16("update search term1"));
91 EXPECT_EQ(id1, history_db_.GetSearchTerm(update_row1.term, &row1));
92 EXPECT_EQ(update_row1.term, row1.term);
98 string16 search_term2(UTF8ToUTF16("search term 2"));
105 EXPECT_FALSE(history_db_.GetSearchTerm(update_row1.term, NULL));
111 EXPECT_EQ(search_term2, row1.term);
  /external/chromium_org/chrome/browser/bookmarks/
bookmark_index.cc 28 // when we match only one term, and is filled in when we get more than one
29 // term. We can do this as when we have only one matching term we know
166 bool BookmarkIndex::GetBookmarksWithTitleMatchingTerm(const string16& term,
169 Index::const_iterator i = index_.lower_bound(term);
173 if (!QueryParser::IsWordLongEnoughForPrefixSearch(term)) {
174 // Term is too short for prefix match, compare using exact match.
175 if (i->first != term)
176 return false; // No bookmarks with this term.
186 // This is the first term and we're doing a prefix match. Loop throug
    [all...]
  /external/chromium_org/ppapi/native_client/tools/browser_tester/browsertester/
browserprocess.py 24 self.term()
47 def term(self): member in class:BrowserProcess
58 def term(self): member in class:BrowserProcessPosix
  /ndk/sources/host-tools/nawk-20071023/
awkgram.y 65 %type <p> pas pattern ppattern plist pplist patlist prarg term re
214 | ppattern term %prec CAT { $$ = op2(CAT, $1, $2); }
216 | term
247 | pattern term %prec CAT { $$ = op2(CAT, $1, $2); }
249 | term
295 print prarg '|' term {
298 | print prarg APPEND term {
301 | print prarg GT term {
351 term: label
352 term '/' ASGNOP term { $$ = op2(DIVEQ, $1, $4);
    [all...]
  /external/chromium_org/third_party/mesa/src/src/mesa/swrast/
s_texcombine.c 104 GLuint i, term; local
148 for (term = 0; term < numArgsRGB; term++) {
149 const GLenum srcRGB = combine->SourceRGB[term];
150 const GLenum operandRGB = combine->OperandRGB[term];
154 argRGB[term] = get_texel_array(swrast, unit);
157 argRGB[term] = primary_rgba;
160 argRGB[term] = rgba;
164 float4_array c = ccolor[term];
    [all...]
  /external/mesa3d/src/mesa/swrast/
s_texcombine.c 96 GLuint i, term; local
140 for (term = 0; term < numArgsRGB; term++) {
141 const GLenum srcRGB = combine->SourceRGB[term];
142 const GLenum operandRGB = combine->OperandRGB[term];
146 argRGB[term] = get_texel_array(swrast, unit);
149 argRGB[term] = primary_rgba;
152 argRGB[term] = rgba;
156 float4_array c = ccolor[term];
    [all...]
  /external/ceres-solver/include/ceres/
gradient_checker.h 76 // term->parameter_block_sizes().size(), and each matrix is the
97 // term: The cost function to test. Not retained after this call returns.
106 CostFunctionToProbe *term,
109 CHECK_NOTNULL(term);
119 // Do a consistency check between the term and the template parameters.
120 CHECK_EQ(M, term->num_residuals());
122 const vector<int16>& block_sizes = term->parameter_block_sizes();
176 CHECK(term->Evaluate(probe_point, results->cost.data(),
179 numeric_term(term, DO_NOT_TAKE_OWNERSHIP);
192 LOG(INFO) << "========== term-computed derivatives =========="
    [all...]
  /external/ceres-solver/internal/ceres/
runtime_numeric_diff_cost_function_test.cc 81 TestCostFunction term; local
84 CreateRuntimeNumericDiffCostFunction(&term, CENTRAL, kRelativeEps));
87 CreateRuntimeNumericDiffCostFunction(&term, FORWARD, kRelativeEps));
154 TranscendentalTestCostFunction term; local
157 CreateRuntimeNumericDiffCostFunction(&term, CENTRAL, kRelativeEps));
160 CreateRuntimeNumericDiffCostFunction(&term, FORWARD, kRelativeEps));

Completed in 2459 milliseconds

1 2 3 4 5 6 7 8 91011>>