Searched refs:State (Results 76 - 100 of 468) sorted by relevance

1234567891011>>

/external/skia/bench/
H A DBenchmark.h36 enum State { enum in class:SkTriState
85 void setDither(SkTriState::State state) {
119 SkTriState::State fDither;
/external/skia/gm/
H A DSkAnimTimer.h23 enum State { enum in class:SkAnimTimer
107 State fState;
109 void setState(State newState) {
/external/skia/include/core/
H A DSkDocument.h125 enum State { enum in class:SkDocument
130 State getState() const { return fState; }
135 State fState;
/external/skia/include/effects/
H A DSkColorMatrixFilter.h32 struct State { struct in class:SkColorMatrixFilter
50 typedef void (*Proc)(const State&, unsigned r, unsigned g, unsigned b,
54 State fState;
/external/skia/src/pdf/
H A DSkPDFCanon.h51 SkPDFFunctionShader* findFunctionShader(const SkPDFShader::State&) const;
54 SkPDFAlphaFunctionShader* findAlphaShader(const SkPDFShader::State&) const;
57 SkPDFImageShader* findImageShader(const SkPDFShader::State&) const;
/external/v8/src/
H A Dhydrogen-flow-engine.h23 template <class State>
24 inline void Apply(State* state) {
57 // The "State" collects which facts are known while passing over instructions
64 // The flow engine requires the State and Effects classes to implement methods
67 template <class State, class Effects>
82 State* AnalyzeOneBlock(HBasicBlock* block, State* state) {
92 void AnalyzeDominatedBlocks(HBasicBlock* root, State* initial) {
102 State* state = State
[all...]
/external/webrtc/src/modules/audio_coding/codecs/isac/fix/source/
H A Dbandwidth_estimator.h102 WebRtc_UWord16 WebRtcIsacfix_GetMinBytes(RateModel *State,
111 void WebRtcIsacfix_UpdateRateModel(RateModel *State,
117 void WebRtcIsacfix_InitRateModel(RateModel *State);
H A Dbandwidth_estimator.c833 WebRtc_UWord16 WebRtcIsacfix_GetMinBytes(RateModel *State, argument
847 if (State->InitCounter > 0) {
848 if (State->InitCounter-- <= INIT_BURST_LEN) {
855 if (State->BurstCounter) {
856 if (State->StillBuffered < WEBRTC_SPL_RSHIFT_W32(WEBRTC_SPL_MUL((512 - WEBRTC_SPL_DIV(512, BURST_LEN)), DelayBuildUp), 9)) {
863 if (DelayBuildUp > State->StillBuffered) {
864 MinRate = WEBRTC_SPL_MUL(512 + WEBRTC_SPL_MUL(SAMPLES_PER_MSEC, WEBRTC_SPL_RSHIFT_W32(WEBRTC_SPL_MUL(DelayBuildUp - State->StillBuffered, inv_Q12), 3)), BottleNeck);
865 } else if ((den = WEBRTC_SPL_MUL(SAMPLES_PER_MSEC, (State->StillBuffered - DelayBuildUp))) >= FrameSamples) {
879 State->BurstCounter--;
898 if (State
942 WebRtcIsacfix_UpdateRateModel(RateModel *State, WebRtc_Word16 StreamSize, const WebRtc_Word16 FrameSamples, const WebRtc_Word16 BottleNeck) argument
963 WebRtcIsacfix_InitRateModel(RateModel *State) argument
[all...]
/external/webrtc/src/modules/audio_coding/codecs/isac/main/source/
H A Dbandwidth_estimator.h136 RateModel* State,
148 RateModel* State,
155 RateModel *State);
/external/guava/guava/src/com/google/common/util/concurrent/
H A DAbstractExecutionThreadService.java159 public final ListenableFuture<State> start() {
165 public final State startAndWait() {
173 @Override public final State state() {
179 public final ListenableFuture<State> stop() {
185 public final State stopAndWait() {
H A DAbstractIdleService.java113 public final ListenableFuture<State> start() {
119 public final State startAndWait() {
127 @Override public final State state() {
133 public final ListenableFuture<State> stop() {
139 public final State stopAndWait() {
/external/llvm/unittests/ADT/
H A DSmallVectorTest.cpp777 EmplaceableArgState State; member in struct:__anon11224::EmplaceableArg
778 EmplaceableArg() : State(EAS_Defaulted) {}
780 : State(X.State == EAS_Arg ? EAS_RValue : EAS_Failure) {}
782 : State(X.State == EAS_Arg ? EAS_LValue : EAS_Failure) {}
784 explicit EmplaceableArg(bool) : State(EAS_Arg) {}
797 EmplaceableState State; member in struct:__anon11224::Emplaceable
799 Emplaceable() : State(ES_Emplaced) {}
803 : A0(std::forward<A0Ty>(A0)), State(ES_Emplace
[all...]
/external/regex-re2/re2/
H A Ddfa.cc8 // which is represented by a graph of State structures, and the execution
11 // The basic idea is that the State graph is constructed so that the
17 // but it omits the details of how the State graph gets constructed as well
96 struct State { struct in class:re2::DFA
105 State** next_; // Outgoing arrows from State,
112 kFlagEmptyMask = 0xFFF, // State.flag_: bits holding kEmptyXXX flags
113 kFlagMatch = 0x1000, // State.flag_: this is a matching state
114 kFlagLastWord = 0x2000, // State.flag_: last byte was a word char
121 bool operator()(const State*
[all...]
/external/skia/src/gpu/
H A DGrTargetCommands.h67 friend class GrInOrderDrawBuffer; // This goes away when State becomes just a pipeline
75 struct State : public SkNVRefCnt<State> { struct in class:GrTargetCommands
77 State(const GrPrimitiveProcessor* primProc = NULL) function in struct:GrTargetCommands::State
81 ~State() { reinterpret_cast<GrPipeline*>(fPipeline.get())->~GrPipeline(); }
115 // TODO remove this when State is just a pipeline
116 friend SkNVRefCnt<State>;
138 DrawPath(State* state, const GrPath* path)
147 SkAutoTUnref<State> fState;
154 DrawPaths(State* stat
[all...]
/external/lzma/CPP/7zip/UI/Common/
H A DUpdatePair.cpp103 pair.State = NUpdateArchive::NPairState::kOnlyOnDisk;
109 pair.State = ai.Censored ?
125 case -1: pair.State = NUpdateArchive::NPairState::kNewInArchive; break;
126 case 1: pair.State = NUpdateArchive::NPairState::kOldInArchive; break;
128 pair.State = (ai.SizeDefined && di.Size == ai.Size) ?
141 pair.State = NUpdateArchive::NPairState::kOnlyOnDisk;
150 pair.State = arcItems[arcIndex2].Censored ?
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Delphi/
H A DASTParser.stg56 if (State.Backtracking = 0) then
73 if (State.Backtracking = 0) then
115 <super.matchSet(..., postmatchCode={<if(backtracking)>if (State.Backtracking = 0) then <endif>Adaptor.AddChild(Root[0], <createNodeFromToken(...)>);})>
131 <super.matchSet(..., postmatchCode={<if(backtracking)>if (State.Backtracking = 0) then <endif>Root[0] := Adaptor.BecomeRoot(<createNodeFromToken(...)>, Root[0]) as I<ASTLabelType>;})>
139 <if(backtracking)>if (State.Backtracking = 0) then <endif>Adaptor.AddChild(Root[0], <label>.Tree);
148 <if(backtracking)>if (State.Backtracking = 0) then <endif>Root[0] := Adaptor.BecomeRoot(<label>.Tree, Root[0]) as I<ASTLabelType>;
174 if (State.Backtracking = 0) then
189 if (State.Backtracking = 0) then
210 if (State.Backtracking = 0) then
/external/clang/lib/Format/
H A DUnwrappedLineFormatter.cpp308 /// \brief Formats the line starting at \p State, simply keeping all of the
311 LineState State = local
313 while (State.NextToken) {
315 Indenter->mustBreak(State) ||
316 (Indenter->canBreak(State) && State.NextToken->NewlinesBefore > 0);
317 Indenter->addTokenToState(State, Newline, /*DryRun=*/false);
423 LineState State = Indenter->getInitialState(Indent, &TheLine, DryRun); local
424 while (State.NextToken) {
425 formatChildren(State, /*Newlin
477 LineState State = Indenter->getInitialState(FirstIndent, &Line, DryRun); local
617 printLineState(const LineState &State) argument
627 reconstructPath(LineState &State, StateNode *Current) argument
672 formatChildren(LineState &State, bool NewLine, bool DryRun, unsigned &Penalty) argument
[all...]
/external/clang/lib/StaticAnalyzer/Checkers/
H A DDereferenceChecker.cpp35 void reportBug(ProgramStateRef State, const Stmt *S, CheckerContext &C,
90 void DereferenceChecker::reportBug(ProgramStateRef State, const Stmt *S, argument
93 ExplodedNode *N = C.generateSink(State);
129 State.get(), N->getLocationContext());
137 State.get(), N->getLocationContext(), true);
146 State.get(), N->getLocationContext(), true);
155 State.get(), N->getLocationContext(), true);
240 ProgramStateRef State = C.getState();
243 std::tie(StNonNull, StNull) = State->assume(V.castAs<DefinedOrUnknownSVal>());
276 C.addTransition(State, thi
[all...]
/external/llvm/lib/DebugInfo/DWARF/
H A DDWARFDebugLine.cpp263 ParsingState State(this);
285 State.Row.EndSequence = true;
286 State.appendRowToMatrix(*offset_ptr);
287 State.resetRowAndSequence();
302 State.Row.Address =
305 State.Row.Address = debug_line_data.getAddress(offset_ptr);
341 State.Row.Discriminator = debug_line_data.getULEB128(offset_ptr);
357 State.appendRowToMatrix(*offset_ptr);
364 State.Row.Address +=
371 State
[all...]
/external/llvm/lib/Object/
H A DRecordStreamer.cpp15 State &S = Symbols[Symbol.getName()];
30 State &S = Symbols[Symbol.getName()];
46 State &S = Symbols[Symbol.getName()];
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/
H A DShadowNetworkInfo.java55 public NetworkInfo.State getState() {
56 return isConnected ? NetworkInfo.State.CONNECTED :
57 NetworkInfo.State.DISCONNECTED;
/external/clang/lib/ARCMigrate/
H A DTransProtectedScope.cpp48 } State; member in struct:__anon796::CaseInfo
50 CaseInfo() : SC(nullptr), State(St_Unchecked) {}
52 : SC(S), Range(Range), State(St_Unchecked) {}
153 if (info.State == CaseInfo::St_Unchecked)
155 assert(info.State != CaseInfo::St_Unchecked);
157 if (info.State == CaseInfo::St_Fixed) {
169 assert(info.State == CaseInfo::St_Unchecked);
171 info.State = CaseInfo::St_CannotFix;
177 info.State = CaseInfo::St_Fixed;
/external/clang/lib/Serialization/
H A DModuleManager.cpp251 void ModuleManager::returnVisitState(VisitState *State) { argument
252 assert(State->NextState == nullptr && "Visited state is in list?");
253 State->NextState = FirstVisitState;
254 FirstVisitState = State;
346 VisitState *State = allocateVisitState(); local
347 unsigned VisitNumber = State->NextVisitNumber++;
357 State->VisitNumber[M->Index] = VisitNumber;
364 if (State->VisitNumber[CurrentModule->Index] == VisitNumber)
368 assert(State->VisitNumber[CurrentModule->Index] == VisitNumber - 1);
369 State
[all...]
/external/skia/include/views/
H A DSkOSWindow_Mac.h20 virtual bool onDispatchClick(int x, int y, Click::State state,
/external/v8/src/ic/
H A Dic-state.h187 enum State { enum in class:v8::internal::CompareICState
199 static Type* StateToType(Zone* zone, State state,
202 static State NewInputState(State old_state, Handle<Object> value);
204 static const char* GetStateName(CompareICState::State state);
206 static State TargetState(State old_state, State old_left, State old_right,

Completed in 745 milliseconds

1234567891011>>