Home | History | Annotate | Download | only in seccomp-bpf

Lines Matching refs:Instructions

18 typedef std::vector<Instruction*> Instructions;
25 // graph of BPF instructions into a well-formed stream of BPF instructions.
27 // the limit of 255 instructions imposed by the instruction set.
30 // build a DAG of Instructions. They'll eventually call Compile() to convert
33 // Instructions can be chained at the time when they are created, or they
64 // Create a new instruction. Instructions form a DAG. The instruction objects
77 // Join two (sequences of) instructions. This is useful, if the "next"
82 // Traverse the graph of instructions and visit each instruction once.
90 // Compiles the graph of instructions into a BPF program that can be passed
93 void Compile(Instruction* instructions, SandboxBPF::Program* program);
98 // Find all the instructions that are the target of BPF_JMPs.
99 void FindBranchTargets(const Instruction& instructions,
102 // Combine instructions between "head" and "tail" into a new basic block.
103 // Basic blocks are defined as sequences of instructions whose only branch
116 // Cuts the DAG of instructions into basic blocks.
117 BasicBlock* CutGraphIntoBasicBlocks(Instruction* instructions,
135 // Convert jt_ptr_ and jf_ptr_ fields in BPF_JMP instructions to valid
136 // jt_ and jf_ jump offsets. This can result in BPF_JA instructions being
137 // inserted, if we need to jump over more than 256 instructions.
141 // Concatenate instructions from all basic blocks into a BPF program that
145 // We stick all instructions and basic blocks into pools that get destroyed
149 Instructions instructions_;