I am answering my own question because it may help other people.
I could not find a function in docplex able to get all feasible solutions for a ILP problem. For my best knowledge, docplex only has this kind of function for MIP problems.
If you are dealing with MIP, you can check additional information here: https://www.ibm.com/support/knowledgecenter/SS9UKU_12.8.0/com.ibm.cplex.zos.help/CPLEX/Parameters/topics/listSolnPool.html
Feasible solutions for ILP problems:
With OR-tools I could find a way to get all feasible solutions for constrained problems by using SearchForAllSolutions. As expected, this functions is available for CP-SAT and you cannot state any objective function.
If you are interested in it, I suggest you to take a look at this example:
PS: In my case, I was trying to solve a 01LP, so it generated many solutions, but with several duplicates. In order to avoid that, you can state a limit (time or number of solutions found). Please, check CP-SAT documentation for additional information.
Hope it will help someone!