Tyson Pencer

Tyson Pencer (born February 10, 1989) is a Canadian football offensive lineman who is currently a free agent. He was ranked as the ninth best player in the Canadian Football League’s Amateur Scouting Bureau September rankings for players eligible in the 2012 CFL Draft.[1] After redshirting for the 2008 season, Pencer played his freshman and sophomore seasons for the Washington State Cougars in 2009 and 2010.[2] He left the program for personal reasons and played for the Okanagan Sun of the Canadian Junior Football League in 2011.[3][4]

Tyson Pencer
No. --     Free Agent
Born: (1989-02-10) February 10, 1989
Delta, British Columbia, Canada
Career information
StatusActive
CFL statusNational
Position(s)OL
Height6 ft 7 in (201 cm)
Weight300 lb (140 kg)
CollegeWashington State
CJFLOkanagan Sun
CFL draft2012 / Round: 1 / Pick: 3
Drafted byWinnipeg Blue Bombers
Career history
As player
20122014Winnipeg Blue Bombers
2015Edmonton Eskimos*

Professional career

Winnipeg Blue Bombers

Pencer was selected 3rd overall in the 2012 CFL Draft by the Winnipeg Blue Bombers of Canadian Football League. He signed with the team on May 30, 2012.[5] He was released on June 12, 2014 [6]

Edmonton Eskimos

Pencer signed with the Edmonton Eskimos on May 14, 2015.

gollark: The rest of the instruction consists of variable-width (for fun) target specifiers. The first N target specifiers in an operation are used as destinations and the remaining ones as sources. N varies per opcode. They can be of the form `000DDD` (pop/push from/to stack index DDD), `001EEE` (peek stack index EEE if source, if destination then push onto EEE if it is empty), `010FFFFFFFF` (8-bit immediate value FFFFFFFF; writes are discarded), `011GGGGGGGGGGGGGGGG` (16-bit immediate value GGGGGGGGGGGGGGGG; writes are also discarded), `100[H 31 times]` (31-bit immediate because bee you), `101IIIIIIIIIIIIIIII` (16 bits of memory location relative to the base memory address register of the stack the operation is conditional on), `110JJJJJJJJJJJJJJJJ` (16 bit memory location relative to the top value on that stack instead), `1111LLLMMM` (memory address equal to base memory address of stack LLL plus top of stack MMM), or `1110NNN` (base memory address register of stack MMM).Opcodes (numbered from 0 in order): MOV (1 source, as many destinations as can be parsed validly; the value is copied to all of them), ADD (1 destination, multiple sources), JMP (1 source), NOT (same as MOV), WR (write to output port; multiple sources, first is port number), RE (read from input port; one source for port number, multiple destinations), SUB, AND, OR, XOR, SHR, SHL (bitwise operations), MUL, ROR, ROL, NOP, MUL2 (multiplication with two outputs).
gollark: osmarksISA™️-2028 is a VLIW stack machine. Specifically, it executes a 384-bit instruction composed of 8 48-bit operations in parallel. There are 8 stacks, for safety. Each stack also has an associated base memory address register, which is used in some "addressing modes". Each stack holds 64-bit integers; popping/peeking an empty stack simply returns 0, and the stacks can hold at most 32 items. Exceeding a stack's capacity is runtime undefined behaviour. The operation encoding is: `AABBBCCCCCCCCC`:A = 2-bit conditional operation mode - 0 is "run unconditionally", 1 is "run if top value on stack is 0", 2 is "run if not 0", 3 is "run if first bit is ~~negative~~ 1".B = 3-bit index for the stack to use for the conditional.C = 9-bit opcode (for extensibility).
gollark: By "really fast", I mean "in a few decaminutes, probably".
gollark: I suppose I could just specify it really fast.
gollark: I could, but do I really want to?

References

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.