| /prebuilts/clang/host/linux-x86/clang-4691093/include/clang/Lex/ |
| PreprocessingRecord.h | 388 /// values (corresponding to loaded entities), so that position -M
389 /// corresponds to element 0 in the loaded entities vector, position -M+1
402 iterator(PreprocessingRecord *Self, int Position)
403 : iterator::iterator_adaptor_base(Position), Self(Self) {}
|
| /prebuilts/tools/common/m2/repository/com/cocoahero/android/geojson/1.0.1/ |
| geojson-1.0.1.jar | |
| /device/linaro/bootloader/edk2/ShellPkg/Library/UefiShellDebug1CommandsLib/ |
| DmpStore.c | 147 UINT64 Position;
165 Position = 0;
166 while (Position < FileSize) {
222 Position += BufferSize + sizeof (Crc32);
243 if ((Position != FileSize) || (ShellStatus != SHELL_SUCCESS)) {
245 if (Position != FileSize) {
|
| /prebuilts/go/darwin-x86/src/go/types/ |
| example_test.go | 194 posn := fset.Position(id.Pos())
203 fset.Position(obj.Pos()),
215 posn := fset.Position(expr.Pos())
|
| issues_test.go | 114 t.Errorf("%s: got %s; want %s", fset.Position(x.Pos()), tv.Type, want)
193 fact := fmt.Sprintf("L%d defs %s", fset.Position(id.Pos()).Line, obj)
198 fact := fmt.Sprintf("L%d uses %s", fset.Position(id.Pos()).Line, obj)
|
| /prebuilts/go/linux-x86/src/go/types/ |
| example_test.go | 194 posn := fset.Position(id.Pos())
203 fset.Position(obj.Pos()),
215 posn := fset.Position(expr.Pos())
|
| issues_test.go | 114 t.Errorf("%s: got %s; want %s", fset.Position(x.Pos()), tv.Type, want)
193 fact := fmt.Sprintf("L%d defs %s", fset.Position(id.Pos()).Line, obj)
198 fact := fmt.Sprintf("L%d uses %s", fset.Position(id.Pos()).Line, obj)
|
| /build/soong/androidmk/cmd/androidmk/ |
| androidmk.go | 50 mkPos scanner.Position // Position of the last handled line in the makefile
51 bpPos scanner.Position // Position of the last emitted line to the blueprint file
96 func (f *bpFile) setMkPos(pos, end scanner.Position) {
|
| /device/linaro/bootloader/edk2/Nt32Pkg/WinNtSimpleFileSystemDxe/ |
| WinNtSimpleFileSystem.c | [all...] |
| /external/pdfium/third_party/lcms/src/ |
| cmsgamma.c | 162 // Search in type list, return position or -1 if not found
180 int Position;
185 Position = IsInSet(Type, c);
187 if (Position != -1) {
189 *index = Position;
196 Position = IsInSet(Type, c);
198 if (Position != -1) {
200 *index = Position;
[all...] |
| /external/llvm/include/llvm/ADT/ |
| IntervalMap.h | 274 /// shift - Shift elements [i;size) 1 position to the right.
373 /// after an overflow or underflow. Reserve space for a new element at Position,
374 /// and compute the node that will hold Position after redistributing node
387 /// The returned index is the node where Position will go, so:
389 /// sum(NewSize[0..idx-1]) <= Position
390 /// sum(NewSize[0..idx]) >= Position
392 /// The last equality, sum(NewSize[0..idx]) == Position, can only happen when
394 /// before the one holding the Position'th element where there is room for an
402 /// @param Position Insert position
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| IntervalMap.h | 253 /// shift - Shift elements [i;size) 1 position to the right.
352 /// after an overflow or underflow. Reserve space for a new element at Position,
353 /// and compute the node that will hold Position after redistributing node
366 /// The returned index is the node where Position will go, so:
368 /// sum(NewSize[0..idx-1]) <= Position
369 /// sum(NewSize[0..idx]) >= Position
371 /// The last equality, sum(NewSize[0..idx]) == Position, can only happen when
373 /// before the one holding the Position'th element where there is room for an
381 /// @param Position Insert position
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| IntervalMap.h | 279 /// shift - Shift elements [i;size) 1 position to the right.
378 /// after an overflow or underflow. Reserve space for a new element at Position,
379 /// and compute the node that will hold Position after redistributing node
392 /// The returned index is the node where Position will go, so:
394 /// sum(NewSize[0..idx-1]) <= Position
395 /// sum(NewSize[0..idx]) >= Position
397 /// The last equality, sum(NewSize[0..idx]) == Position, can only happen when
399 /// before the one holding the Position'th element where there is room for an
407 /// @param Position Insert position
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| IntervalMap.h | 280 /// shift - Shift elements [i;size) 1 position to the right.
379 /// after an overflow or underflow. Reserve space for a new element at Position,
380 /// and compute the node that will hold Position after redistributing node
393 /// The returned index is the node where Position will go, so:
395 /// sum(NewSize[0..idx-1]) <= Position
396 /// sum(NewSize[0..idx]) >= Position
398 /// The last equality, sum(NewSize[0..idx]) == Position, can only happen when
400 /// before the one holding the Position'th element where there is room for an
408 /// @param Position Insert position
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
| IntervalMap.h | 280 /// shift - Shift elements [i;size) 1 position to the right.
379 /// after an overflow or underflow. Reserve space for a new element at Position,
380 /// and compute the node that will hold Position after redistributing node
393 /// The returned index is the node where Position will go, so:
395 /// sum(NewSize[0..idx-1]) <= Position
396 /// sum(NewSize[0..idx]) >= Position
398 /// The last equality, sum(NewSize[0..idx]) == Position, can only happen when
400 /// before the one holding the Position'th element where there is room for an
408 /// @param Position Insert position
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
| IntervalMap.h | 280 /// shift - Shift elements [i;size) 1 position to the right.
379 /// after an overflow or underflow. Reserve space for a new element at Position,
380 /// and compute the node that will hold Position after redistributing node
393 /// The returned index is the node where Position will go, so:
395 /// sum(NewSize[0..idx-1]) <= Position
396 /// sum(NewSize[0..idx]) >= Position
398 /// The last equality, sum(NewSize[0..idx]) == Position, can only happen when
400 /// before the one holding the Position'th element where there is room for an
408 /// @param Position Insert position
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
| IntervalMap.h | 280 /// shift - Shift elements [i;size) 1 position to the right.
379 /// after an overflow or underflow. Reserve space for a new element at Position,
380 /// and compute the node that will hold Position after redistributing node
393 /// The returned index is the node where Position will go, so:
395 /// sum(NewSize[0..idx-1]) <= Position
396 /// sum(NewSize[0..idx]) >= Position
398 /// The last equality, sum(NewSize[0..idx]) == Position, can only happen when
400 /// before the one holding the Position'th element where there is room for an
408 /// @param Position Insert position
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/ |
| IntervalMap.h | 280 /// shift - Shift elements [i;size) 1 position to the right.
379 /// after an overflow or underflow. Reserve space for a new element at Position,
380 /// and compute the node that will hold Position after redistributing node
393 /// The returned index is the node where Position will go, so:
395 /// sum(NewSize[0..idx-1]) <= Position
396 /// sum(NewSize[0..idx]) >= Position
398 /// The last equality, sum(NewSize[0..idx]) == Position, can only happen when
400 /// before the one holding the Position'th element where there is room for an
408 /// @param Position Insert position
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/ |
| IntervalMap.h | 280 /// shift - Shift elements [i;size) 1 position to the right.
379 /// after an overflow or underflow. Reserve space for a new element at Position,
380 /// and compute the node that will hold Position after redistributing node
393 /// The returned index is the node where Position will go, so:
395 /// sum(NewSize[0..idx-1]) <= Position
396 /// sum(NewSize[0..idx]) >= Position
398 /// The last equality, sum(NewSize[0..idx]) == Position, can only happen when
400 /// before the one holding the Position'th element where there is room for an
408 /// @param Position Insert position
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| IntervalMap.h | 279 /// shift - Shift elements [i;size) 1 position to the right.
378 /// after an overflow or underflow. Reserve space for a new element at Position,
379 /// and compute the node that will hold Position after redistributing node
392 /// The returned index is the node where Position will go, so:
394 /// sum(NewSize[0..idx-1]) <= Position
395 /// sum(NewSize[0..idx]) >= Position
397 /// The last equality, sum(NewSize[0..idx]) == Position, can only happen when
399 /// before the one holding the Position'th element where there is room for an
407 /// @param Position Insert position
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/ |
| IntervalMap.h | 280 /// shift - Shift elements [i;size) 1 position to the right.
379 /// after an overflow or underflow. Reserve space for a new element at Position,
380 /// and compute the node that will hold Position after redistributing node
393 /// The returned index is the node where Position will go, so:
395 /// sum(NewSize[0..idx-1]) <= Position
396 /// sum(NewSize[0..idx]) >= Position
398 /// The last equality, sum(NewSize[0..idx]) == Position, can only happen when
400 /// before the one holding the Position'th element where there is room for an
408 /// @param Position Insert position
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/ |
| IntervalMap.h | 280 /// shift - Shift elements [i;size) 1 position to the right.
379 /// after an overflow or underflow. Reserve space for a new element at Position,
380 /// and compute the node that will hold Position after redistributing node
393 /// The returned index is the node where Position will go, so:
395 /// sum(NewSize[0..idx-1]) <= Position
396 /// sum(NewSize[0..idx]) >= Position
398 /// The last equality, sum(NewSize[0..idx]) == Position, can only happen when
400 /// before the one holding the Position'th element where there is room for an
408 /// @param Position Insert position
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/ |
| IntervalMap.h | 280 /// shift - Shift elements [i;size) 1 position to the right.
379 /// after an overflow or underflow. Reserve space for a new element at Position,
380 /// and compute the node that will hold Position after redistributing node
393 /// The returned index is the node where Position will go, so:
395 /// sum(NewSize[0..idx-1]) <= Position
396 /// sum(NewSize[0..idx]) >= Position
398 /// The last equality, sum(NewSize[0..idx]) == Position, can only happen when
400 /// before the one holding the Position'th element where there is room for an
408 /// @param Position Insert position
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/ |
| IntervalMap.h | 280 /// shift - Shift elements [i;size) 1 position to the right.
379 /// after an overflow or underflow. Reserve space for a new element at Position,
380 /// and compute the node that will hold Position after redistributing node
393 /// The returned index is the node where Position will go, so:
395 /// sum(NewSize[0..idx-1]) <= Position
396 /// sum(NewSize[0..idx]) >= Position
398 /// The last equality, sum(NewSize[0..idx]) == Position, can only happen when
400 /// before the one holding the Position'th element where there is room for an
408 /// @param Position Insert position
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/ |
| IntervalMap.h | 280 /// shift - Shift elements [i;size) 1 position to the right.
379 /// after an overflow or underflow. Reserve space for a new element at Position,
380 /// and compute the node that will hold Position after redistributing node
393 /// The returned index is the node where Position will go, so:
395 /// sum(NewSize[0..idx-1]) <= Position
396 /// sum(NewSize[0..idx]) >= Position
398 /// The last equality, sum(NewSize[0..idx]) == Position, can only happen when
400 /// before the one holding the Position'th element where there is room for an
408 /// @param Position Insert position
[all...] |
