/external/llvm/lib/CodeGen/ |
ScoreboardHazardRecognizer.cpp | 44 // the scoreboard. We always make the scoreboard at least 1 cycle deep to 124 int cycle = Stalls; local 137 // We must find one of the stage's units free for every cycle the 141 int StageCycle = cycle + (int)i; 165 DEBUG(dbgs() << "*** Hazard in cycle +" << StageCycle << ", "); 172 // Advance the cycle to the next stage. 173 cycle += IS->getNextCycles(); 192 unsigned cycle = 0; local 197 // We must reserve one of the stage's units for every cycle the 201 assert(((cycle + i) < RequiredScoreboard.getDepth()) & [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
GrammarSanity.java | 157 /** enclosingRuleName calls targetRuleName, find the cycle containing 158 * the target and add the caller. Find the cycle containing the caller 160 * cycle. listOfRecursiveCycles is List<Set<String>> that holds a list 170 // ensure both rules are in same cycle 181 Set cycle = new HashSet(); local 182 cycle.add(targetRule); 183 cycle.add(enclosingRule); 184 listOfRecursiveCycles.add(cycle);
|
/external/chromium_org/net/tools/testserver/ |
echo_message.py | 28 from itertools import cycle namespace 264 return ''.join(chr(ord(x) ^ ord(y)) for (x, y) in izip(payload, cycle(key)))
|
/external/chromium_org/third_party/smhasher/src/ |
KeysetTest.h | 261 uint8_t * cycle = new uint8_t[cycleLen + 16]; local 268 r.rand_p(cycle,cycleLen); 270 *(uint32_t*)cycle = f3mix(i ^ 0x746a94f1); 274 key[j] = cycle[j % cycleLen]; 287 delete [] cycle;
|
/external/guava/guava/src/com/google/common/collect/ |
Iterables.java | 353 * Returns an iterable whose iterators cycle indefinitely over the elements of 366 * <p>To cycle over the iterable {@code n} times, use the following: 369 public static <T> Iterable<T> cycle(final Iterable<T> iterable) { method in class:Iterables 374 return Iterators.cycle(iterable); 383 * Returns an iterable whose iterators cycle indefinitely over the provided 389 * as {@code Iterables.cycle(Lists.newArrayList(elements))}. The iterator's 397 * <p>To cycle over the elements {@code n} times, use the following: 400 public static <T> Iterable<T> cycle(T... elements) { 401 return cycle(Lists.newArrayList(elements)); [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
Iterables.java | 335 * Returns an iterable whose iterators cycle indefinitely over the elements of 348 * <p>To cycle over the iterable {@code n} times, use the following: 351 public static <T> Iterable<T> cycle(final Iterable<T> iterable) { method in class:Iterables 356 return Iterators.cycle(iterable); 365 * Returns an iterable whose iterators cycle indefinitely over the provided 371 * as {@code Iterables.cycle(Lists.newArrayList(elements))}. The iterator's 379 * <p>To cycle over the elements {@code n} times, use the following: 382 public static <T> Iterable<T> cycle(T... elements) { 383 return cycle(Lists.newArrayList(elements)); [all...] |
/external/chromium_org/tools/gn/ |
builder.cc | 22 // participates in a cycle. 24 // If this returns true, the cycle will be in *path. This should point to an 28 // Return false means no cycle was found. 42 // This item is already in the set, we found the cycle. Everything before 43 // the first definition of cur is irrelevant to the cycle. 50 return true; // Found cycle. 172 // dependencies because in this case all items in the cycle will be GENERATED 219 *err = Err(Location(), "Dependency cycle:", depstring); 528 std::vector<const BuilderRecord*> cycle; local 529 if (!RecursiveFindCycle(bad_records[0], &cycle)) [all...] |
/external/guava/guava-tests/test/com/google/common/collect/ |
IteratorsTest.java | 486 Iterator<String> cycle = Iterators.<String>cycle(); local 487 assertFalse(cycle.hasNext()); 491 Iterator<String> cycle = Iterators.cycle("a"); local 493 assertTrue(cycle.hasNext()); 494 assertEquals("a", cycle.next()); 500 Iterator<String> cycle = Iterators.cycle(iterable); local 501 assertTrue(cycle.hasNext()) 509 Iterator<String> cycle = Iterators.cycle("a", "b"); local 520 Iterator<String> cycle = Iterators.cycle(iterable); local 539 Iterator<String> cycle = Iterators.cycle("a", "b"); local 549 Iterator<String> cycle = Iterators.cycle("a", "b"); local 561 Iterator<String> cycle = Iterators.cycle(iterable); local 572 Iterator<String> cycle = Iterators.cycle(iterable); local 583 Iterator<String> cycle = Iterators.cycle(iterable); local [all...] |
/external/chromium_org/third_party/jinja2/ |
runtime.py | 299 def cycle(self, *args): member in class:LoopContext
|
/external/antlr/antlr-3.4/runtime/C/include/ |
antlr3collections.h | 427 * visited in the stack, then it means there wasa cycle such as 9->8->1->9 432 pANTLR3_UINT32 cycle; member in struct:ANTLR3_TOPO_struct 435 * A flag that indicates the algorithm found a cycle in the edges 438 * then the detected cycle will be contained in the cycle array and 439 * cycleLimit will point to the one after the last entry in the cycle. 444 * A watermark used to accumulate potential cycles in the cycle array. 446 * of the sort methods and if it is ANTLR3_TRUE then you can find the cycle 447 * in cycle[0]...cycle[cycleMark-1 [all...] |
/external/chromium_org/third_party/icu/source/i18n/ |
chnsecal.cpp | 62 * resulting in EXTENDED_YEAR values 60 years greater and ERA (cycle) 212 * YEAR field as the cycle and year-of-cycle, or the EXTENDED_YEAR 221 int32_t cycle = internalGet(UCAL_ERA, 1) - 1; // 0-based cycle local 223 year = cycle * 60 + internalGet(UCAL_YEAR, 1) - (fEpochYear - CHINESE_EPOCH_YEAR); 710 // Extended year and cycle year is based on the epoch year 725 int32_t cycle = ClockMath::floorDivide(cycle_year - 1, 60, yearOfCycle); local 726 internalSet(UCAL_ERA, cycle + 1);
|
/external/icu/icu4c/source/i18n/ |
chnsecal.cpp | 62 * resulting in EXTENDED_YEAR values 60 years greater and ERA (cycle) 212 * YEAR field as the cycle and year-of-cycle, or the EXTENDED_YEAR 221 int32_t cycle = internalGet(UCAL_ERA, 1) - 1; // 0-based cycle local 223 year = cycle * 60 + internalGet(UCAL_YEAR, 1) - (fEpochYear - CHINESE_EPOCH_YEAR); 710 // Extended year and cycle year is based on the epoch year 725 int32_t cycle = ClockMath::floorDivide(cycle_year - 1, 60, yearOfCycle); local 726 internalSet(UCAL_ERA, cycle + 1);
|
calendar.cpp | 1175 int cycle, offset, shift = 0; local 1243 int cycle, offset, shift = 0; local [all...] |
/bionic/libc/kernel/uapi/linux/ |
firewire-cdev.h | 95 __u32 cycle; member in struct:fw_cdev_event_iso_interrupt 275 __s32 cycle; member in struct:fw_cdev_start_iso
|
/development/ndk/platforms/android-L/include/linux/ |
firewire-cdev.h | 95 __u32 cycle; member in struct:fw_cdev_event_iso_interrupt 275 __s32 cycle; member in struct:fw_cdev_start_iso
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nvc0/codegen/ |
nv50_ir_emit_nvc0.cpp | 1961 int cycle; member in class:nv50_ir::SchedDataCalculator 2042 int cycle = 0; local [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/r600/ |
r600_asm.c | 670 int i, cycle, component; local 672 for (cycle = 0; cycle < NUM_OF_CYCLES; cycle++) 674 bs->hw_gpr[cycle][component] = -1; 681 static int reserve_gpr(struct alu_bank_swizzle *bs, unsigned sel, unsigned chan, unsigned cycle) 683 if (bs->hw_gpr[cycle][chan] == -1) 684 bs->hw_gpr[cycle][chan] = sel; 685 else if (bs->hw_gpr[cycle][chan] != (int)sel) { 737 int r, src, num_src, sel, elem, cycle; local 767 int r, src, num_src, const_count, sel, elem, cycle; local [all...] |
/external/kernel-headers/original/uapi/linux/ |
firewire-cdev.h | 210 * @cycle: Cycle counter of the last completed packet 260 __u32 cycle; member in struct:fw_cdev_event_iso_interrupt 849 __s32 cycle; member in struct:fw_cdev_start_iso [all...] |
/external/mesa3d/src/gallium/drivers/nvc0/codegen/ |
nv50_ir_emit_nvc0.cpp | 1961 int cycle; member in class:nv50_ir::SchedDataCalculator 2042 int cycle = 0; local [all...] |
/external/mesa3d/src/gallium/drivers/r600/ |
r600_asm.c | 670 int i, cycle, component; local 672 for (cycle = 0; cycle < NUM_OF_CYCLES; cycle++) 674 bs->hw_gpr[cycle][component] = -1; 681 static int reserve_gpr(struct alu_bank_swizzle *bs, unsigned sel, unsigned chan, unsigned cycle) 683 if (bs->hw_gpr[cycle][chan] == -1) 684 bs->hw_gpr[cycle][chan] = sel; 685 else if (bs->hw_gpr[cycle][chan] != (int)sel) { 737 int r, src, num_src, sel, elem, cycle; local 767 int r, src, num_src, const_count, sel, elem, cycle; local [all...] |
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
editable_text.js | 92 cvox.TypingEcho.cycle = function(cur) { [all...] |
/external/okhttp/website/static/ |
bootstrap.min.js | 6 !function(e){"use strict";e(function(){e.support.transition=function(){var e=function(){var e=document.createElement("bootstrap"),t={WebkitTransition:"webkitTransitionEnd",MozTransition:"transitionend",OTransition:"oTransitionEnd otransitionend",transition:"transitionend"},n;for(n in t)if(e.style[n]!==undefined)return t[n]}();return e&&{end:e}}()})}(window.jQuery),!function(e){"use strict";var t='[data-dismiss="alert"]',n=function(n){e(n).on("click",t,this.close)};n.prototype.close=function(t){function s(){i.trigger("closed").remove()}var n=e(this),r=n.attr("data-target"),i;r||(r=n.attr("href"),r=r&&r.replace(/.*(?=#[^\s]*$)/,"")),i=e(r),t&&t.preventDefault(),i.length||(i=n.hasClass("alert")?n:n.parent()),i.trigger(t=e.Event("close"));if(t.isDefaultPrevented())return;i.removeClass("in"),e.support.transition&&i.hasClass("fade")?i.on(e.support.transition.end,s):s()};var r=e.fn.alert;e.fn.alert=function(t){return this.each(function(){var r=e(this),i=r.data("alert");i||r.data("alert",i=new n(this)),typeof t=="string"&&i[t].call(r)})},e.fn.alert.Constructor=n,e.fn.alert.noConflict=function(){return e.fn.alert=r,this},e(document).on("click.alert.data-api",t,n.prototype.close)}(window.jQuery),!function(e){"use strict";var t=function(t,n){this.$element=e(t),this.options=e.extend({},e.fn.button.defaults,n)};t.prototype.setState=function(e){var t="disabled",n=this.$element,r=n.data(),i=n.is("input")?"val":"html";e+="Text",r.resetText||n.data("resetText",n[i]()),n[i](r[e]||this.options[e]),setTimeout(function(){e=="loadingText"?n.addClass(t).attr(t,t):n.removeClass(t).removeAttr(t)},0)},t.prototype.toggle=function(){var e=this.$element.closest('[data-toggle="buttons-radio"]');e&&e.find(".active").removeClass("active"),this.$element.toggleClass("active")};var n=e.fn.button;e.fn.button=function(n){return this.each(function(){var r=e(this),i=r.data("button"),s=typeof n=="object"&&n;i||r.data("button",i=new t(this,s)),n=="toggle"?i.toggle():n&&i.setState(n)})},e.fn.button.defaults={loadingText:"loading..."},e.fn.button.Constructor=t,e.fn.button.noConflict=function(){return e.fn.button=n,this},e(document).on("click.button.data-api","[data-toggle^=button]",function(t){var n=e(t.target);n.hasClass("btn")||(n=n.closest(".btn")),n.button("toggle")})}(window.jQuery),!function(e){"use strict";var t=function(t,n){this.$element=e(t),this.$indicators=this.$element.find(".carousel-indicators"),this.options=n,this.options.pause=="hover"&&this.$element.on("mouseenter",e.proxy(this.pause,this)).on("mouseleave",e.proxy(this.cycle,this))};t.prototype={cycle:function(t){return t||(this.paused=!1),this.interval&&clearInterval(this.interval),this.options.interval&&!this.paused&&(this.interval=setInterval(e.proxy(this.next,this),this.options.interval)),this},getActiveIndex:function(){return this.$active=this.$element.find(".item.active"),this.$items=this.$active.parent().children(),this.$items.index(this.$active)},to:function(t){var n=this.getActiveIndex(),r=this;if(t>this.$items.length-1||t<0)return;return this.sliding?this.$element.one("slid",function(){r.to(t)}):n==t?this.pause().cycle():this.slide(t>n?"next":"prev",e(this.$items[t]))},pause:function(t){return t||(this.paused=!0),this.$element.find(".next, .prev").length&&e.support.transition.end&&(this.$element.trigger(e.support.transition.end),this.cycle(!0)),clearInterval(this.interval),this.interval=null,this},next:function(){if(this.sliding)return;return this.slide("next")},prev:function(){if(this.sliding)return;return this.slide("prev")},slide:function(t,n){var r=this.$element.find(".item.active"),i=n||r[t](),s=this.interval,o=t=="next"?"left":"right",u=t=="next"?"first":"last",a=this,f;this.sliding=!0,s&&this.pause(),i=i.length?i:this.$element.find(".item")[u](),f=e.Event("slide",{relatedTarget:i[0],direction:o});if(i.hasClass("active"))return;this.$indicators.length&&(this.$indicators.find(".active").removeClass("active"),this.$element.one("slid",function(){var t=e(a.$indicators.children()[a.getActiveIndex()]);t&&t.addClass("active")}));if(e.support.transition&&this.$element.hasClass("slide")){this.$element.trigger(f);if(f.isDefaultPrevented())return;i.addClass(t),i[0].offsetWidth,r.addClass(o),i.addClass(o),this.$element.one(e.support.transition.end,function(){i.removeClass([t,o].join(" ")).addClass("active"),r.removeClass(["active",o].join(" ")),a.sliding=!1,setTimeout(function(){a.$element.trigger("slid")},0)})}else{this.$element.trigger(f);if(f.isDefaultPrevented())return;r.removeClass("active"),i.addClass("active"),this.sliding=!1,this.$element.trigger("slid")}return s&&this.cycle(),this}};var n=e.fn.carousel;e.fn.carousel=function(n){return this.each(function(){var r=e(this),i=r.data("carousel"),s=e.extend({},e.fn.carousel.defaults,typeof n=="object"&&n),o=typeof n=="string"?n:s.slide;i||r.data("carousel",i=new t(this,s)),typeof n=="number"?i.to(n):o?i[o]():s.interval&&i.pause().cycle()})},e.fn.carousel.defaults={interval:5e3,pause:"hover"},e.fn.carousel.Constructor=t,e.fn.carousel.noConflict=function(){return e.fn.carousel=n,this},e(document).on("click.carousel.data-api","[data-slide], [data-slide-to]",function(t){var n=e(this),r,i=e(n.attr("data-target")||(r=n.attr("href"))&&r.replace(/.*(?=#[^\s]+$)/,"")),s=e.extend({},i.data(),n.data()),o;i.carousel(s),(o=n.attr("data-slide-to"))&&i.data("carousel").pause().to(o).cycle(),t.preventDefault()})}(window.jQuery),!function(e){"use strict";var t=function(t,n){this.$element (…)
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
org.eclipse.osgi_3.6.1.R36x_v20100806.jar | |
org.eclipse.osgi_3.6.2.R36x_v20101103.jar | |
/cts/tools/signature-tools/lib/ |
antlr-2.7.7.jar | |