| /prebuilts/go/darwin-x86/misc/cgo/life/ |
| life.h | 5 extern void Step(int, int, int *, int *);
|
| /prebuilts/go/linux-x86/misc/cgo/life/ |
| life.h | 5 extern void Step(int, int, int *, int *);
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p10/src/ |
| armVCM4P10_DeBlockPixel.c | 50 * [in] Step Step between pixels q0 and q1
62 int Step, /* step between pixels q0 and q1 */
78 p3 = pQ0[-4*Step];
79 p2 = pQ0[-3*Step];
80 p1 = pQ0[-2*Step];
81 p0 = pQ0[-1*Step];
82 q0 = pQ0[ 0*Step];
83 q1 = pQ0[ 1*Step];
[all...] |
| /external/pdfium/third_party/agg23/ |
| agg_pixfmt_gray.h | 42 template<class Blender, unsigned Step = 1, unsigned Offset = 0>
95 value_type* p = (value_type*)m_rbuf->row(y) + x * Step + Offset;
103 x * Step * sizeof(value_type) +
110 x * Step * sizeof(value_type) +
115 *((value_type*)m_rbuf->row(y) + x * Step + Offset) = c.v;
119 copy_or_blend_pix((value_type*)m_rbuf->row(y) + x * Step + Offset, c, cover);
125 value_type* p = (value_type*)m_rbuf->row(y) + x * Step + Offset;
128 p += Step;
137 value_type* p = (value_type*)m_rbuf->row(y) + x * Step + Offset;
142 p += Step;
[all...] |
| /external/hamcrest/hamcrest-core/src/main/java/org/hamcrest/ |
| Condition.java | 4 * A Condition implements part of a multi-step match. We sometimes need to write matchers
5 * that have a sequence of steps, where each step depends on the result of the previous
6 * step and we can stop processing as soon as a step fails. These classes provide
16 public interface Step<I, O> {
23 public abstract <U> Condition<U> and(Step<? super T, U> mapping);
26 public final <U> Condition<U> then(Step<? super T, U> mapping) { return and(mapping); }
57 public <U> Condition<U> and(Step<? super T, U> next) {
65 @Override public <U> Condition<U> and(Step<? super T, U> mapping) {
|
| /external/v8/tools/release/ |
| push_to_candidates.py | 40 class Preparation(Step):
55 class FreshBranch(Step):
63 class PreparePushRevision(Step):
75 class IncrementVersion(Step):
109 class DetectLastRelease(Step):
119 class PrepareChangeLog(Step):
172 class EditChangeLog(Step):
195 class StragglerCommits(Step):
204 class SquashCommits(Step):
237 class NewBranch(Step)
[all...] |
| auto_push.py | 40 class Preparation(Step):
48 class FetchCandidate(Step):
57 class LastReleaseBailout(Step):
70 class CreateRelease(Step):
|
| create_release.py | 14 class Preparation(Step):
28 class PrepareBranchRevision(Step):
38 class IncrementVersion(Step):
75 class DetectLastRelease(Step):
82 class PrepareChangeLog(Step):
135 class EditChangeLog(Step):
158 class MakeBranch(Step):
169 class AddChangeLog(Step):
179 class SetVersion(Step):
186 class EnableMergeWatchlist(Step)
[all...] |
| roll_merge.py | 38 class Preparation(Step):
45 elif self._options.step == 0: # pragma: no cover
59 class CreateBranch(Step):
67 class SearchArchitecturePorts(Step):
99 class CreateCommitMessage(Step):
134 class ApplyPatches(Step):
148 class PrepareVersion(Step):
156 class IncrementVersion(Step):
179 class CommitLocal(Step):
191 class CommitRepository(Step)
[all...] |
| auto_tag.py | 12 class Preparation(Step):
27 class GetTags(Step):
35 class GetOldestUntaggedVersion(Step):
91 class GetLKGRs(Step):
101 class CalculateTagRevision(Step):
149 class MakeTag(Step):
161 class CleanUp(Step):
|
| merge_to_branch.py | 38 class Preparation(Step):
45 elif self._options.step == 0: # pragma: no cover
57 class CreateBranch(Step):
65 class SearchArchitecturePorts(Step):
97 class CreateCommitMessage(Step):
146 class ApplyPatches(Step):
159 class CommitLocal(Step):
169 class AddInformationalComment(Step):
180 class CommitRepository(Step):
189 class CleanUp(Step)
[all...] |
| auto_roll.py | 25 class Preparation(Step):
35 class DetectLastRoll(Step):
54 class DetectRevisionToRoll(Step):
62 # in the next step.
90 class PrepareRollCandidate(Step):
105 class SwitchChromium(Step):
120 class UpdateChromiumCheckout(Step):
136 class UploadCL(Step):
170 class CleanUp(Step):
|
| /system/core/libunwindstack/ |
| Elf.h | 52 bool Step(uint64_t rel_pc, Regs* regs, Memory* process_memory) {
53 return valid_ && interface_->Step(rel_pc, regs, process_memory);
|
| /external/v8/src/heap/ |
| incremental-marking-job.h | 18 // step and posts another task until the marking is completed.
25 static void Step(Heap* heap);
|
| incremental-marking-job.cc | 33 void IncrementalMarkingJob::Task::Step(Heap* heap) {
57 Step(heap);
|
| /frameworks/support/v7/recyclerview/tests/src/android/support/v7/widget/ |
| LinearLayoutManagerWrapContentTest.java | 59 new Step() {
65 new Step() {
71 new Step() {
83 new Step() {
90 new Step() {
96 new Step() {
|
| /external/apache-harmony/jdwp/src/test/java/org/apache/harmony/jpda/tests/framework/jdwp/ |
| EventMod.java | 54 public static final byte Step = 10;
|
| /cts/apps/CtsVerifier/src/com/android/cts/verifier/security/ |
| KeyChainTest.java | 94 private List<Step> mSteps;
131 Step step = mSteps.get(mCurrentStep); local
133 switch (step.task.getStatus()) {
135 step.task.execute();
150 step.task.cancel(false);
179 mSteps.add(new Step(R.string.keychain_setup_desc, false, new SetupTestKeyStoreTask()));
180 mSteps.add(new Step(R.string.keychain_install_desc, true, new InstallCredentialsTask()));
181 mSteps.add(new Step(R.string.keychain_https_desc, false, new TestHttpsRequestTask()));
182 mSteps.add(new Step(R.string.keychain_reset_desc, true, new ClearCredentialsTask()))
198 final Step step = mSteps.get(mCurrentStep); local
[all...] |
| /device/linaro/bootloader/edk2/ShellPkg/Library/UefiShellLevel1CommandsLib/ |
| For.c | 112 INTN Step;
424 Info->Step = 0;
542 Info->Step = 1;
544 Info->Step = -1;
564 ASSERT(Info->Step == 1 || Info->Step == -1);
567 Info->Step = 0 - (INTN)ReturnUintn(ArgSetWalker+1);
569 Info->Step = (INTN)ReturnUintn(ArgSetWalker);
636 if (Info->Step != 0) {
644 Info->Current += Info->Step;
[all...] |
| /external/autotest/client/cros/cellular/pseudomodem/ |
| state_machine.py | 28 The correct method will be dynamically located and executed by the step
78 waits for an |Advance| call before each step.
99 self.Step()
106 Advance a step on a state machine running in interactive mode.
150 def Step(self):
156 logging.info('StateMachine: Step')
192 gobject.idle_add(StateMachine.Step, self)
|
| /external/hamcrest/hamcrest-library/src/main/java/org/hamcrest/xml/ |
| HasXPath.java | 27 private static final Condition.Step<Object,String> NODE_EXISTS = nodeExists();
83 private static Condition.Step<Object, String> nodeExists() {
84 return new Condition.Step<Object, String>() {
|
| /prebuilts/go/darwin-x86/doc/play/ |
| life.go | 42 // Next returns the state of the specified cell at the next time step.
78 // Step advances the game by one instant, recomputing and updating all cells.
79 func (l *Life) Step() {
109 l.Step()
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| shortcircuit.go | 12 // Step 1: Replace a phi arg with a constant if that arg
48 // Step 2: Compute which values are live across blocks.
63 // Step 3: Redirect control flow around known branches.
|
| /prebuilts/go/linux-x86/doc/play/ |
| life.go | 42 // Next returns the state of the specified cell at the next time step.
78 // Step advances the game by one instant, recomputing and updating all cells.
79 func (l *Life) Step() {
109 l.Step()
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| shortcircuit.go | 12 // Step 1: Replace a phi arg with a constant if that arg
48 // Step 2: Compute which values are live across blocks.
63 // Step 3: Redirect control flow around known branches.
|
