Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(547)

Side by Side Diff: crosstest/test_global.cpp

Issue 974113002: Subzero: Rerun clang-format after LLVM 3.6 merge. (Closed) Base URL: https://chromium.googlesource.com/native_client/pnacl-subzero.git@master
Patch Set: Created 5 years, 9 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
OLDNEW
1 //===- subzero/crosstest/test_global.cpp - Global variable access tests ---===// 1 //===- subzero/crosstest/test_global.cpp - Global variable access tests ---===//
2 // 2 //
3 // The Subzero Code Generator 3 // The Subzero Code Generator
4 // 4 //
5 // This file is distributed under the University of Illinois Open Source 5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details. 6 // License. See LICENSE.TXT for details.
7 // 7 //
8 //===----------------------------------------------------------------------===// 8 //===----------------------------------------------------------------------===//
9 // 9 //
10 // Implementation for crosstesting global variable access operations. 10 // Implementation for crosstesting global variable access operations.
(...skipping 25 matching lines...) Expand all
36 uint8_t *Pointer1; 36 uint8_t *Pointer1;
37 double Array2[3]; 37 double Array2[3];
38 uint8_t *Pointer2; 38 uint8_t *Pointer2;
39 struct { 39 struct {
40 uint8_t *Pointer3; 40 uint8_t *Pointer3;
41 int Array1[3]; 41 int Array1[3];
42 uint8_t *Pointer4; 42 uint8_t *Pointer4;
43 } NestedStuff; 43 } NestedStuff;
44 uint8_t *Pointer5; 44 uint8_t *Pointer5;
45 } StructEx = { 45 } StructEx = {
46 {10, 20, 30, 40, 50}, 46 {10, 20, 30, 40, 50},
47 ExternName1, 47 ExternName1,
48 {0.5, 1.5, 2.5}, 48 {0.5, 1.5, 2.5},
49 ExternName4, 49 ExternName4,
50 {ExternName3, {1000, 1010, 1020}, ExternName2}, 50 {ExternName3, {1000, 1010, 1020}, ExternName2},
51 ExternName5, 51 ExternName5,
52 }; 52 };
53 53
54 #define ARRAY(a) \ 54 #define ARRAY(a) \
55 { (uint8_t *)(a), sizeof(a) } 55 { (uint8_t *)(a), sizeof(a) }
56 56
57 // Note: By embedding the array addresses in this table, we are indirectly 57 // Note: By embedding the array addresses in this table, we are indirectly
58 // testing relocations (i.e. getArray would return the wrong address if 58 // testing relocations (i.e. getArray would return the wrong address if
59 // relocations are broken). 59 // relocations are broken).
60 struct { 60 struct {
61 uint8_t *ArrayAddress; 61 uint8_t *ArrayAddress;
62 size_t ArraySizeInBytes; 62 size_t ArraySizeInBytes;
63 } Arrays[] = { 63 } Arrays[] = {
64 ARRAY(ArrayInitPartial), 64 ARRAY(ArrayInitPartial),
65 ARRAY(ArrayInitFull), 65 ARRAY(ArrayInitFull),
66 ARRAY(ArrayConst), 66 ARRAY(ArrayConst),
67 ARRAY(ArrayDouble), 67 ARRAY(ArrayDouble),
68 {(uint8_t *)(ArrayInitPartial + 2), 68 {(uint8_t *)(ArrayInitPartial + 2),
69 sizeof(ArrayInitPartial) - 2 * sizeof(int)}, 69 sizeof(ArrayInitPartial) - 2 * sizeof(int)},
70 {(uint8_t *)(&StructEx), sizeof(StructEx)}, 70 {(uint8_t *)(&StructEx), sizeof(StructEx)},
71 }; 71 };
72 size_t NumArraysElements = sizeof(Arrays) / sizeof(*Arrays); 72 size_t NumArraysElements = sizeof(Arrays) / sizeof(*Arrays);
73 73
74 size_t getNumArrays() { return NumArraysElements; } 74 size_t getNumArrays() { return NumArraysElements; }
75 75
76 const uint8_t *getArray(size_t WhichArray, size_t &Len) { 76 const uint8_t *getArray(size_t WhichArray, size_t &Len) {
77 if (WhichArray >= NumArraysElements) { 77 if (WhichArray >= NumArraysElements) {
78 Len = -1; 78 Len = -1;
79 return NULL; 79 return NULL;
80 } 80 }
81 Len = Arrays[WhichArray].ArraySizeInBytes; 81 Len = Arrays[WhichArray].ArraySizeInBytes;
82 return Arrays[WhichArray].ArrayAddress; 82 return Arrays[WhichArray].ArrayAddress;
83 } 83 }
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698