HomeSort by relevance Sort by last modified time
    Searched defs:For (Results 1 - 25 of 47) sorted by null

1 2

  /external/swiftshader/src/Reactor/
Reactor.hpp 12 // See the License for the specific language governing permissions and
20 #define For(init, cond, inc) \
22 for(llvm::BasicBlock *loopBB__ = beginLoop(), \
29 #define While(cond) For(((void*)0), cond, ((void*)0))
44 for(llvm::BasicBlock *trueBB__ = Nucleus::createBasicBlock(), \
52 for(llvm::BasicBlock *endBB__ = Nucleus::getInsertBlock(), \
  /prebuilts/go/darwin-x86/src/go/importer/
importer.go 16 // A Lookup function returns a reader to access package data for
20 // For returns an Importer for the given compiler and lookup interface,
22 // the default package lookup mechanism for the given compiler is used.
23 // BUG(issue13847): For does not support non-nil lookup functions.
24 func For(compiler string, lookup Lookup) types.Importer {
28 panic("gc importer for custom import path lookup not yet implemented")
35 panic("gccgo importer for custom import path lookup not yet implemented")
52 // Default returns an Importer for the compiler that built the running binary.
55 return For(runtime.Compiler, nil
    [all...]
  /prebuilts/go/linux-x86/src/go/importer/
importer.go 16 // A Lookup function returns a reader to access package data for
20 // For returns an Importer for the given compiler and lookup interface,
22 // the default package lookup mechanism for the given compiler is used.
23 // BUG(issue13847): For does not support non-nil lookup functions.
24 func For(compiler string, lookup Lookup) types.Importer {
28 panic("gc importer for custom import path lookup not yet implemented")
35 panic("gccgo importer for custom import path lookup not yet implemented")
52 // Default returns an Importer for the compiler that built the running binary.
55 return For(runtime.Compiler, nil
    [all...]
  /external/llvm/examples/OCaml-Kaleidoscope/Chapter5/
ast.ml 5 (* expr - Base type for all expression nodes. *)
7 (* variant for numeric literals like "1.0". *)
10 (* variant for referencing a variable, like "a". *)
13 (* variant for a binary operator. *)
16 (* variant for function calls. *)
19 (* variant for if/then/else. *)
22 (* variant for for/in. *)
23 | For of string * expr * expr * expr option * expr
25 (* proto - This type represents the "prototype" for a function, which capture
    [all...]
  /external/llvm/examples/OCaml-Kaleidoscope/Chapter6/
ast.ml 5 (* expr - Base type for all expression nodes. *)
7 (* variant for numeric literals like "1.0". *)
10 (* variant for referencing a variable, like "a". *)
13 (* variant for a unary operator. *)
16 (* variant for a binary operator. *)
19 (* variant for function calls. *)
22 (* variant for if/then/else. *)
25 (* variant for for/in. *)
26 | For of string * expr * expr * expr option * exp
    [all...]
  /external/llvm/examples/OCaml-Kaleidoscope/Chapter7/
ast.ml 5 (* expr - Base type for all expression nodes. *)
7 (* variant for numeric literals like "1.0". *)
10 (* variant for referencing a variable, like "a". *)
13 (* variant for a unary operator. *)
16 (* variant for a binary operator. *)
19 (* variant for function calls. *)
22 (* variant for if/then/else. *)
25 (* variant for for/in. *)
26 | For of string * expr * expr * expr option * exp
    [all...]
  /external/swiftshader/third_party/LLVM/examples/OCaml-Kaleidoscope/Chapter5/
ast.ml 5 (* expr - Base type for all expression nodes. *)
7 (* variant for numeric literals like "1.0". *)
10 (* variant for referencing a variable, like "a". *)
13 (* variant for a binary operator. *)
16 (* variant for function calls. *)
19 (* variant for if/then/else. *)
22 (* variant for for/in. *)
23 | For of string * expr * expr * expr option * expr
25 (* proto - This type represents the "prototype" for a function, which capture
    [all...]
  /external/swiftshader/third_party/LLVM/examples/OCaml-Kaleidoscope/Chapter6/
ast.ml 5 (* expr - Base type for all expression nodes. *)
7 (* variant for numeric literals like "1.0". *)
10 (* variant for referencing a variable, like "a". *)
13 (* variant for a unary operator. *)
16 (* variant for a binary operator. *)
19 (* variant for function calls. *)
22 (* variant for if/then/else. *)
25 (* variant for for/in. *)
26 | For of string * expr * expr * expr option * exp
    [all...]
  /external/swiftshader/third_party/LLVM/examples/OCaml-Kaleidoscope/Chapter7/
ast.ml 5 (* expr - Base type for all expression nodes. *)
7 (* variant for numeric literals like "1.0". *)
10 (* variant for referencing a variable, like "a". *)
13 (* variant for a unary operator. *)
16 (* variant for a binary operator. *)
19 (* variant for function calls. *)
22 (* variant for if/then/else. *)
25 (* variant for for/in. *)
26 | For of string * expr * expr * expr option * exp
    [all...]
  /external/swiftshader/src/Renderer/
QuadRasterizer.cpp 12 // See the License for the specific language governing permissions and
42 for(int i = 0; i < PERF_TIMERS; i++)
83 for(int i = 0; i < PERF_TIMERS; i++)
98 for(int index = 0; index < RENDERTARGETS; index++)
124 for(unsigned int q = 1; q < state.multiSample; q++)
137 for(unsigned int q = 1; q < state.multiSample; q++)
148 for(unsigned int q = 0; q < state.multiSample; q++)
180 For(Int x = x0, x < x1, x += 2)
240 for(int interpolant = 0; interpolant < MAX_FRAGMENT_INPUTS; interpolant++)
242 for(int component = 0; component < 4; component++
    [all...]
Blitter.cpp 12 // See the License for the specific language governing permissions and
87 for(int j = dRect.y0; j < dRect.y1; j++)
91 for(int i = dRect.x0; i < dRect.x1; i++)
116 for(int k = 0; k < dest->getDepth(); ++k)
119 for(int j = 0; j < dest->getHeight(); ++j)
122 for(int i = 0; i < dest->getWidth(); ++i)
    [all...]
  /external/swiftshader/src/Main/
FrameBuffer.cpp 12 // See the License for the specific language governing permissions and
221 For(Int y = 0, y < height, y++)
239 For(, x < width - 3, x += 4)
249 For(, x < width - 3, x += 4)
262 For(, x < width - 1, x += 2)
274 For(, x < width, x++)
292 For(, x < width, x++)
348 For(, x < width - 3, x += 4)
358 For(, x < width - 3, x += 4)
371 For(, x < width - 1, x += 2
    [all...]
  /external/v8/src/parsing/
scanner-character-streams.cc 155 // For testing:
201 for (size_t i = 0; i < chunks_.size(); i++) delete[] chunks_[i].data;
312 for (it = current_.pos.bytes - chunk.start.bytes;
362 // Search for the last chunk whose start position is less or equal to
379 // Fancy-pants optimization for ASCII chunks within a utf-8 stream.
381 // ASCII subset for their JavaScript sources. We can exploit this, by
451 // Chunks - helper for One- + TwoByteExternalStreamingStream
463 for (size_t i = 0; i < chunks.size(); i++) delete[] chunks[i].data;
466 // Return the chunk index for the chunk containing position.
486 // chunk we were looking for, or we're out of data. Also, out_of_data an
    [all...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/compiler/
ast.py 9 for elt in seq:
12 for elt2 in flatten(elt):
19 return [n for n in flatten(seq) if isinstance(n, Node)]
24 """Abstract base class for ast nodes."""
28 for n in self.getChildren():
30 def asList(self): # for backwards compatibility
502 class For(Node):
528 return "For(%s, %s, %s, %s)" % (repr(self.assign), repr(self.list), repr(self.body), repr(self.else_))
    [all...]
  /external/libmojo/third_party/jinja2/
nodes.py 13 :license: BSD, see LICENSE for more details.
23 #: the types we support for context functions
60 """A metaclass for nodes that handles the field and attribute
65 for attr in 'fields', 'attributes':
108 """Baseclass for all Jinja2 nodes. There are a number of nodes available
120 The `environment` attribute is set at the end of the parsing process for
140 for name, arg in izip(self.fields, fields):
142 for attr in self.attributes:
155 for name in self.fields:
169 for field, item in self.iter_fields(exclude, only)
    [all...]
  /external/swiftshader/src/Shader/
SetupRoutine.cpp 12 // See the License for the specific language governing permissions and
200 For(Int q = 0, q < state.multiSample, q++)
229 For(Int y = yMin - 1, y < yMax + 1, y++)
254 For(yMin, yMin < yMax && *Pointer<Short>(leftEdge + yMin * sizeof(Primitive::Span)) == *Pointer<Short>(rightEdge + yMin * sizeof(Primitive::Span)), yMin++)
259 For(yMax, yMax > yMin && *Pointer<Short>(leftEdge + (yMax - 1) * sizeof(Primitive::Span)) == *Pointer<Short>(rightEdge + (yMax - 1) * sizeof(Primitive::Span)), yMax--)
454 for(int interpolant = 0; interpolant < MAX_FRAGMENT_INPUTS; interpolant++)
456 for(int component = 0; component < 4; component++)
  /external/v8/src/compiler/
types.h 21 // A simple type system for compiler-internal use. It is based entirely on
59 // There are two main functions for testing types:
72 // Consequently, do not normally use Equals for type tests, always use Is!
81 // Various formal properties hold for constructors, operators, and predicates
82 // over types. For example, constructors are injective and subtyping is a
85 // See test/cctest/test-types.cc for a comprehensive executable specification,
93 // bitsets. Bit 0 is reserved for tagging. Only structured types require
97 // Values for bitset types
184 * union with certain other bitsets. For instance, OtherNumber should only
265 // Superclass for non-bitset types (internal)
    [all...]
  /prebuilts/gdb/darwin-x86/lib/python2.7/compiler/
ast.py 9 for elt in seq:
12 for elt2 in flatten(elt):
19 return [n for n in flatten(seq) if isinstance(n, Node)]
24 """Abstract base class for ast nodes."""
28 for n in self.getChildren():
30 def asList(self): # for backwards compatibility
502 class For(Node):
528 return "For(%s, %s, %s, %s)" % (repr(self.assign), repr(self.list), repr(self.body), repr(self.else_))
    [all...]
  /prebuilts/gdb/linux-x86/lib/python2.7/compiler/
ast.py 9 for elt in seq:
12 for elt2 in flatten(elt):
19 return [n for n in flatten(seq) if isinstance(n, Node)]
24 """Abstract base class for ast nodes."""
28 for n in self.getChildren():
30 def asList(self): # for backwards compatibility
502 class For(Node):
528 return "For(%s, %s, %s, %s)" % (repr(self.assign), repr(self.list), repr(self.body), repr(self.else_))
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/
ast.py 9 for elt in seq:
12 for elt2 in flatten(elt):
19 return [n for n in flatten(seq) if isinstance(n, Node)]
24 """Abstract base class for ast nodes."""
28 for n in self.getChildren():
30 def asList(self): # for backwards compatibility
502 class For(Node):
528 return "For(%s, %s, %s, %s)" % (repr(self.assign), repr(self.list), repr(self.body), repr(self.else_))
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/
ast.py 9 for elt in seq:
12 for elt2 in flatten(elt):
19 return [n for n in flatten(seq) if isinstance(n, Node)]
24 """Abstract base class for ast nodes."""
28 for n in self.getChildren():
30 def asList(self): # for backwards compatibility
502 class For(Node):
528 return "For(%s, %s, %s, %s)" % (repr(self.assign), repr(self.list), repr(self.body), repr(self.else_))
    [all...]
  /external/v8/src/ast/
ast-types.h 18 // A simple type system for compiler-internal use. It is based entirely on
30 // The following equations and inequations hold for the semantic axis:
58 // for arbitrary heap values.
61 // TODO(rossberg): the latter is not currently true for proxies, because of fix,
69 // For the representation axis, the following holds:
81 // Subtyping relates the two dimensions, for example:
87 // types that allow for all possible representations, and dually, the ones for
89 // can then e.g. be narrowed for a given semantic type using intersection:
109 // There are two main functions for testing types
    [all...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Include/
Python-ast.h 116 } For;
405 #define For(a0, a1, a2, a3, a4, a5, a6) _Py_For(a0, a1, a2, a3, a4, a5, a6)
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Include/
Python-ast.h 116 } For;
405 #define For(a0, a1, a2, a3, a4, a5, a6) _Py_For(a0, a1, a2, a3, a4, a5, a6)
  /prebuilts/gdb/darwin-x86/include/python2.7/
Python-ast.h 116 } For;
405 #define For(a0, a1, a2, a3, a4, a5, a6) _Py_For(a0, a1, a2, a3, a4, a5, a6)

Completed in 970 milliseconds

1 2