summaryrefslogtreecommitdiff
path: root/compiler/optimizing/graph_visualizer.cc
diff options
context:
space:
mode:
authorIgor Murashkin <iam@google.com>2017-10-06 11:34:26 -0700
committerIgor Murashkin <iam@google.com>2017-10-06 16:46:56 -0700
commitc60f75d6d6f229fa7b5494d54189e974883dafa2 (patch)
treef728320ab915995a011f15089e726ca674f36dc8 /compiler/optimizing/graph_visualizer.cc
parent7ec532fd6387a309c824f1abba466003593a685e (diff)
base: Add more bit utils and bit struct class
Allows efficient, zero-cost, bitwise memory storage. // Definition for type 'Example' BITSTRUCT_DEFINE_START(Example, 10) BitStructUint<0, 2> u2; // Every field must be a BitStruct[*]. BitStructInt<2, 7> i7; BitStructUint<9, 1> i1; BITSTRUCT_DEFINE_END(Example); Would define a bit struct with this layout: <- 1 -> <-- 7 --> <- 2 -> +--------+---------------+-----+ | i1 | i7 | u2 + +--------+---------------+-----+ 10 9 2 0 See bit_struct.h for more documentation. (Also adds new BitField[Extract|Insert|Clear] bit_utils similar to the ARM bitfield instructions). Test: art/test.py --gtest Change-Id: I5e43f2468c5d275ee872546855527bb4ea73ad4c
Diffstat (limited to 'compiler/optimizing/graph_visualizer.cc')
0 files changed, 0 insertions, 0 deletions